Home
last modified time | relevance | path

Searched refs:NodeStore (Results 1 – 3 of 3) sorted by relevance

/external/llvm-project/llvm/tools/llvm-xray/
Dtrie-node.h52 std::forward_list<TrieNode<T>> &NodeStore, in mergeTrieNodes() argument
57 NodeStore.push_front(TrieNode<T>{ in mergeTrieNodes()
59 auto I = NodeStore.begin(); in mergeTrieNodes()
76 mergeTrieNodes(*(iter->second), *Callee, Node, NodeStore, MergeFn)); in mergeTrieNodes()
Dxray-converter.cpp211 std::forward_list<StackTrieNode> &NodeStore) { in findOrCreateStackNode() argument
223 NodeStore.push_front({FuncId, Parent, {}, {(*id_counter)++, {}}}); in findOrCreateStackNode()
224 StackTrieNode *CurrentStack = &NodeStore.front(); in findOrCreateStackNode()
230 NodeStore.push_front({FuncId, Parent, {}, {stack_id, std::move(siblings)}}); in findOrCreateStackNode()
231 StackTrieNode *CurrentStack = &NodeStore.front(); in findOrCreateStackNode()
277 std::forward_list<StackTrieNode> NodeStore{}; in exportAsChromeTraceEventFormat() local
304 &id_counter, NodeStore); in exportAsChromeTraceEventFormat()
Dxray-stacks.cpp326 std::forward_list<StackTrieNode> NodeStore; member in StackTrie
334 NodeStore.push_front(StackTrieNode{FuncId, Parent, {}, {{}, {}}}); in createTrieNode()
335 auto I = NodeStore.begin(); in createTrieNode()
523 RootVector mergeAcrossThreads(std::forward_list<StackTrieNode> &NodeStore) { in mergeAcrossThreads() argument
536 **MaybeFoundIter, *Node, nullptr, NodeStore, mergeStackDuration)); in mergeAcrossThreads()