| /external/llvm-project/llvm/tools/llvm-xray/ |
| D | trie-node.h | 30 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()
|
| D | xray-converter.cpp | 168 SmallVector<TrieNode<StackIdData> *, 4> siblings;
171 using StackTrieNode = TrieNode<StackIdData>;
|
| D | xray-stacks.cpp | 282 using StackTrieNode = TrieNode<StackDuration>;
|
| /external/llvm-project/lld/MachO/ |
| D | ExportTrie.cpp | 54 Edge(StringRef s, TrieNode *node) : substring(s), child(node) {} in Edge()
57 struct TrieNode *child;
82 struct macho::TrieNode { struct in macho
95 bool TrieNode::updateOffset(size_t &nextOffset) { in updateOffset()
123 void TrieNode::writeTo(uint8_t *buf) const { in writeTo()
148 TrieNode *TrieBuilder::makeNode() { in makeNode()
149 auto *node = make<TrieNode>(); in makeNode()
173 TrieNode *node, size_t lastPos, size_t pos) { in sortAndBuild()
198 TrieNode *newNode = makeNode(); in sortAndBuild()
224 TrieNode *root = makeNode(); in build()
[all …]
|
| D | ExportTrie.h | 20 struct TrieNode;
32 TrieNode *makeNode();
33 void sortAndBuild(llvm::MutableArrayRef<const Symbol *> vec, TrieNode *node,
38 std::vector<TrieNode *> nodes;
|
| /external/libtextclassifier/native/utils/tflite/ |
| D | skipgram_finder.h | 57 struct TrieNode { struct
60 absl::flat_hash_map<std::string, TrieNode> token_to_node; argument
62 absl::flat_hash_map<std::string, TrieNode> prefix_to_node; argument
65 TrieNode skipgram_trie_;
|
| D | text_encoder.cc | 92 const TrieNode* charsmap_trie_nodes = reinterpret_cast<const TrieNode*>( in Initialize()
95 config->normalization_charsmap()->size() / sizeof(TrieNode); in Initialize()
107 const TrieNode* pieces_trie_nodes = in Initialize()
108 reinterpret_cast<const TrieNode*>(config->pieces()->Data()); in Initialize()
110 config->pieces()->size() / sizeof(TrieNode); in Initialize()
|
| D | skipgram_finder.cc | 83 TrieNode* cur = &skipgram_trie_; in AddSkipgram()
141 std::deque<std::pair<int, const TrieNode*>> indices_and_skipgrams; in FindSkipgrams()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/XRay/ |
| D | Profile.h | 117 struct TrieNode { struct
119 std::vector<TrieNode *> Callees{}; argument
120 TrieNode *Caller = nullptr; argument
128 std::list<TrieNode> NodeStorage;
131 SmallVector<TrieNode *, 4> Roots;
134 DenseMap<PathID, TrieNode *> PathIDMap;
|
| /external/llvm-project/llvm/include/llvm/XRay/ |
| D | Profile.h | 117 struct TrieNode { struct
119 std::vector<TrieNode *> Callees{}; argument
120 TrieNode *Caller = nullptr; argument
128 std::list<TrieNode> NodeStorage;
131 SmallVector<TrieNode *, 4> Roots;
134 DenseMap<PathID, TrieNode *> PathIDMap;
|
| /external/libtextclassifier/native/utils/sentencepiece/ |
| D | test_utils.cc | 33 const TrieNode* trie_blob = reinterpret_cast<const TrieNode*>(spec.data()); in NormalizerFromSpec()
35 const int num_nodes = trie_blob_size / sizeof(TrieNode); in NormalizerFromSpec()
|
| /external/libtextclassifier/native/utils/container/ |
| D | double-array-trie.h | 39 typedef uint32 TrieNode; typedef
45 DoubleArrayTrie(const TrieNode* nodes, const int nodes_length) in DoubleArrayTrie()
79 const TrieNode* nodes_;
|
| D | double-array-trie_test.cc | 39 DoubleArrayTrie trie(reinterpret_cast<const TrieNode*>(config.data()), in TEST()
40 config.size() / sizeof(TrieNode)); in TEST()
|
| /external/llvm-project/lld/lib/ReaderWriter/MachO/ |
| D | MachONormalizedFileBinaryWriter.cpp | 53 struct TrieNode; // Forward declaration.
56 TrieEdge(StringRef s, TrieNode *node) : _subString(s), _child(node) {} in TrieEdge()
59 struct TrieNode *_child;
78 struct TrieNode { struct
81 TrieNode(StringRef s) in TrieNode() argument
84 ~TrieNode() = default;
87 std::vector<TrieNode *> &allNodes);
90 std::vector<TrieNode *> &allNodes);
1259 void TrieNode::addSymbol(const Export& entry, in addSymbol()
1261 std::vector<TrieNode*> &allNodes) { in addSymbol()
[all …]
|
| /external/llvm-project/llvm/lib/XRay/ |
| D | Profile.cpp | 153 find_if(Roots, [PathRoot](TrieNode *N) { return N->Func == PathRoot; }); in internPath()
156 TrieNode *Node = nullptr; in internPath()
169 auto CalleeIt = find_if(Node->Callees, [NodeFuncID](TrieNode *N) { in internPath()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/XRay/ |
| D | Profile.cpp | 153 find_if(Roots, [PathRoot](TrieNode *N) { return N->Func == PathRoot; }); in internPath()
156 TrieNode *Node = nullptr; in internPath()
169 auto CalleeIt = find_if(Node->Callees, [NodeFuncID](TrieNode *N) { in internPath()
|
| /external/kotlinc/lib/ |
| D | kotlin-compiler.jar | META-INF/
META-INF/MANIFEST.MF
META-INF/backend-common. ... |