Searched refs:StackTrieNode (Results 1 – 2 of 2) sorted by relevance
282 using StackTrieNode = TrieNode<StackDuration>; typedef311 std::size_t GetValueForStack(const StackTrieNode *Node) { in GetValueForStack()320 using RootVector = SmallVector<StackTrieNode *, 4>;326 std::forward_list<StackTrieNode> NodeStore;333 StackTrieNode *Parent) { in createTrieNode()453 SmallVector<const StackTrieNode *, 8> CurrentStack; in printStack()547 std::forward_list<StackTrieNode> AggregatedNodeStore; in printAllAggregatingThreads()565 SmallVector<const StackTrieNode *, 16> S; in printAll()586 const StackTrieNode *Node) { in printSingleStack()589 SmallVector<const StackTrieNode *, 5> lineage{}; in printSingleStack()[all …]
180 using StackTrieNode = TrieNode<StackIdData>; typedef185 SmallVector<StackTrieNode *, 4>190 SmallVector<StackTrieNode *, 4> Siblings{}; in findSiblings()216 StackTrieNode *findOrCreateStackNode( in findOrCreateStackNode()220 std::forward_list<StackTrieNode> &NodeStore) { in findOrCreateStackNode()221 SmallVector<StackTrieNode *, 4> &ParentCallees = in findOrCreateStackNode()229 SmallVector<StackTrieNode *, 4> siblings = in findOrCreateStackNode()233 StackTrieNode *CurrentStack = &NodeStore.front(); in findOrCreateStackNode()240 StackTrieNode *CurrentStack = &NodeStore.front(); in findOrCreateStackNode()287 std::forward_list<StackTrieNode> NodeStore{}; in exportAsChromeTraceEventFormat()[all …]