Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dtrie-node.h30 template <typename AssociatedData> struct TrieNode { struct
35 TrieNode<AssociatedData> *Parent; argument
38 llvm::SmallVector<TrieNode<AssociatedData> *, 4> Callees; argument
48 TrieNode<T> * argument
49 mergeTrieNodes(const TrieNode<T> &Left, const TrieNode<T> &Right, in mergeTrieNodes()
51 std::remove_reference_t<TrieNode<T> *> NewParent, in mergeTrieNodes()
52 std::forward_list<TrieNode<T>> &NodeStore, in mergeTrieNodes()
57 NodeStore.push_front(TrieNode<T>{ in mergeTrieNodes()
63 llvm::DenseMap<int32_t, TrieNode<T> *> LeftCalleesByFuncId; in mergeTrieNodes()
H A Dxray-converter.cpp177 SmallVector<TrieNode<StackIdData> *, 4> siblings;
180 using StackTrieNode = TrieNode<StackIdData>;
H A Dxray-stacks.cpp278 using StackTrieNode = TrieNode<StackDuration>;
/freebsd/contrib/llvm-project/lld/MachO/
H A DExportTrie.cpp52 Edge(StringRef s, TrieNode *node) : substring(s), child(node) {} in Edge()
55 struct TrieNode *child;
84 struct macho::TrieNode { struct in macho
127 uint32_t TrieNode::getTerminalSize() const { in getTerminalSize()
136 bool TrieNode::updateOffset(size_t &nextOffset) { in updateOffset()
163 void TrieNode::writeTo(uint8_t *buf) const { in writeTo()
192 for (TrieNode *node : nodes) in ~TrieBuilder()
196 TrieNode *TrieBuilder::makeNode() { in makeNode()
197 auto *node = new TrieNode(); in makeNode()
221 TrieNode *node, size_t lastPos, size_t pos) { in sortAndBuild()
[all …]
H A DExportTrie.h19 struct TrieNode;
32 TrieNode *makeNode();
33 void sortAndBuild(llvm::MutableArrayRef<const Symbol *> vec, TrieNode *node,
38 std::vector<TrieNode *> nodes;
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DTrieRawHashMap.cpp24 struct TrieNode { struct
27 TrieNode(bool IsSubtrie) : IsSubtrie(IsSubtrie) {} in TrieNode() function
33 struct TrieContent final : public TrieNode {
49 : TrieNode(/*IsSubtrie=*/false), ContentOffset(ContentOffset), in TrieContent()
52 static bool classof(const TrieNode *TN) { return !TN->IsSubtrie; } in classof()
60 : public TrieNode,
61 private TrailingObjects<TrieSubtrie, LazyAtomicPointer<TrieNode>> {
63 using Slot = LazyAtomicPointer<TrieNode>;
66 TrieNode *load(size_t I) { return get(I).load(); } in load()
78 static bool classof(const TrieNode *TN) { return TN->IsSubtrie; } in classof()
[all …]
/freebsd/contrib/llvm-project/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/contrib/llvm-project/llvm/lib/XRay/
H A DProfile.cpp152 find_if(Roots, [PathRoot](TrieNode *N) { return N->Func == PathRoot; }); in internPath()
155 TrieNode *Node = nullptr; in internPath()
168 auto CalleeIt = find_if(Node->Callees, [NodeFuncID](TrieNode *N) { in internPath()