Link/tracy
1
0
Fork 0
mirror of https://github.com/wolfpld/tracy.git synced 2025-03-20 07:40:02 +08:00
Code Issues Projects Wiki Activity

Cache call stack tree paths.

Browse Source
This commit is contained in:
Bartosz Taudul 2018-08-18 19:13:46 +02:00
parent 7f0fb851b4
commit bd96c2ce51
1 changed files with 41 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

53
server/TracyView.cpp
View File

@ -6476,25 +6476,54 @@ static tracy_force_inline CallstackFrameTree* GetFrameTreeItem( std::vector<Call
std::vector<CallstackFrameTree> View::GetCallstackFrameTree( const MemData& mem ) const
{
std::vector<CallstackFrameTree> root;
flat_hash_map<uint32_t, std::vector<uint32_t>, nohash<uint32_t>> paths;
for( auto& ev : mem.data )
{
if( ev.csAlloc == 0 ) continue;
auto& cs = m_worker.GetCallstack( ev.csAlloc );
auto base = cs.back();
auto treePtr = GetFrameTreeItem( root, base );
treePtr->countInclusive++;
treePtr->allocInclusive += ev.size;
for( int i = int( cs.size() ) - 2; i >= 0; i-- )
auto it = paths.find( ev.csAlloc );
if( it != paths.end() )
{
treePtr = GetFrameTreeItem( treePtr->children, cs[i] );
const auto& path = it->second;
auto treePtr = &root;
CallstackFrameTree* node = nullptr;
for( auto& v : path )
{
node = &(*treePtr)[v];
node->countInclusive++;
node->allocInclusive += ev.size;
treePtr = &node->children;
}
assert( treePtr->empty() );
node->countExclusive++;
node->allocExclusive += ev.size;
}
else
{
auto& cs = m_worker.GetCallstack( ev.csAlloc );
std::vector<uint32_t> path;
path.reserve( cs.size() );
auto base = cs.back();
auto treePtr = GetFrameTreeItem( root, base );
treePtr->countInclusive++;
treePtr->allocInclusive += ev.size;
}
path.emplace_back( uint32_t( treePtr - root.data() ) );
treePtr->countExclusive++;
treePtr->allocExclusive += ev.size;
for( int i = int( cs.size() ) - 2; i >= 0; i-- )
{
auto newTreePtr = GetFrameTreeItem( treePtr->children, cs[i] );
newTreePtr->countInclusive++;
newTreePtr->allocInclusive += ev.size;
path.emplace_back( uint32_t( newTreePtr - treePtr->children.data() ) );
treePtr = newTreePtr;
}
treePtr->countExclusive++;
treePtr->allocExclusive += ev.size;
paths.emplace( ev.csAlloc, std::move( path ) );
}
}
return root;
}