Home
last modified time | relevance | path

Searched refs:TrieNode (Results 1 – 6 of 6) sorted by relevance

/freebsd-12.1/contrib/llvm/tools/llvm-xray/
H A Dtrie-node.h31 template <typename AssociatedData> struct TrieNode { struct
36 TrieNode<AssociatedData> *Parent; argument
39 llvm::SmallVector<TrieNode<AssociatedData> *, 4> Callees; argument
49 TrieNode<T> * argument
50 mergeTrieNodes(const TrieNode<T> &Left, const TrieNode<T> &Right, in mergeTrieNodes()
52 typename std::remove_reference<TrieNode<T> *>::type NewParent, in mergeTrieNodes()
53 std::forward_list<TrieNode<T>> &NodeStore, in mergeTrieNodes()
58 NodeStore.push_front(TrieNode<T>{ in mergeTrieNodes()
64 llvm::DenseMap<int32_t, TrieNode<T> *> LeftCalleesByFuncId; in mergeTrieNodes()
H A Dxray-converter.cpp174 SmallVector<TrieNode<StackIdData> *, 4> siblings;
177 using StackTrieNode = TrieNode<StackIdData>;
H A Dxray-stacks.cpp284 using StackTrieNode = TrieNode<StackDuration>;
/freebsd-12.1/contrib/llvm/include/llvm/XRay/
H A DProfile.h118 struct TrieNode { struct
120 std::vector<TrieNode *> Callees{}; argument
121 TrieNode *Caller = nullptr; argument
129 std::list<TrieNode> NodeStorage;
132 SmallVector<TrieNode *, 4> Roots;
135 DenseMap<PathID, TrieNode *> PathIDMap;
/freebsd-12.1/contrib/llvm/tools/lld/lib/ReaderWriter/MachO/
H A DMachONormalizedFileBinaryWriter.cpp54 struct TrieNode; // Forward declaration.
60 struct TrieNode *_child;
79 struct TrieNode { struct
82 TrieNode(StringRef s) in TrieNode() argument
85 ~TrieNode() = default;
1251 void TrieNode::addSymbol(const Export& entry, in addSymbol()
1270 TrieNode* cNode = edge._child; in addSymbol()
1427 std::vector<TrieNode*> allNodes; in buildExportTrie()
1434 std::vector<TrieNode*> orderedNodes; in buildExportTrie()
1446 for (TrieNode* node : orderedNodes) { in buildExportTrie()
[all …]
/freebsd-12.1/contrib/llvm/lib/XRay/
H A DProfile.cpp154 find_if(Roots, [PathRoot](TrieNode *N) { return N->Func == PathRoot; }); in internPath()
157 TrieNode *Node = nullptr; in internPath()
170 auto CalleeIt = find_if(Node->Callees, [NodeFuncID](TrieNode *N) { in internPath()