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

/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dtrie-node.h30 template <typename AssociatedData> struct TrieNode { struct
35 TrieNode<AssociatedData> *Parent;
38 llvm::SmallVector<TrieNode<AssociatedData> *, 4> Callees;
48 TrieNode<T> *
49 mergeTrieNodes(const TrieNode<T> &Left, const TrieNode<T> &Right,
51 typename std::remove_reference<TrieNode<T> *>::type NewParent,
52 std::forward_list<TrieNode<T>> &NodeStore,
57 NodeStore.push_front(TrieNode<T>{
63 llvm::DenseMap<int32_t, TrieNode<
[all...]
H A Dxray-converter.cpp168 SmallVector<TrieNode<StackIdData> *, 4> siblings;
171 using StackTrieNode = TrieNode<StackIdData>;
H A Dxray-stacks.cpp280 using StackTrieNode = TrieNode<StackDuration>;
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/XRay/
H A DProfile.h117 struct TrieNode { struct in class:llvm::xray::Profile
119 std::vector<TrieNode *> Callees{};
120 TrieNode *Caller = nullptr;
127 // List of TrieNode elements we've seen.
128 std::list<TrieNode> NodeStorage;
131 SmallVector<TrieNode *, 4> Roots;
133 // Reverse mapping between a PathID to a TrieNode*.
134 DenseMap<PathID, TrieNode *> PathIDMap;
/freebsd-11-stable/contrib/llvm-project/lld/lib/ReaderWriter/MachO/
H A DMachONormalizedFileBinaryWriter.cpp53 struct TrieNode; // Forward declaration.
56 TrieEdge(StringRef s, TrieNode *node) : _subString(s), _child(node) {}
59 struct TrieNode *_child;
78 struct TrieNode { struct in namespace:lld::mach_o::normalized
81 TrieNode(StringRef s) function in struct:lld::mach_o::normalized::TrieNode
84 ~TrieNode() = default;
87 std::vector<TrieNode *> &allNodes);
90 std::vector<TrieNode *> &allNodes);
1259 void TrieNode::addSymbol(const Export& entry,
1261 std::vector<TrieNode*>
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/XRay/
H A DProfile.cpp153 find_if(Roots, [PathRoot](TrieNode *N) { return N->Func == PathRoot; });
156 TrieNode *Node = nullptr;
169 auto CalleeIt = find_if(Node->Callees, [NodeFuncID](TrieNode *N) {

Completed in 117 milliseconds