Searched refs:TrieNode (Results 1 – 7 of 7) sorted by relevance
31 template <typename AssociatedData> struct TrieNode { struct36 TrieNode<AssociatedData> *Parent; argument39 llvm::SmallVector<TrieNode<AssociatedData> *, 4> Callees; argument49 TrieNode<T> * argument50 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()
167 SmallVector<TrieNode<StackIdData> *, 4> siblings;170 using StackTrieNode = TrieNode<StackIdData>;
284 using StackTrieNode = TrieNode<StackDuration>;
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()
39 typedef uint32 TrieNode; typedef45 DoubleArrayTrie(const TrieNode* nodes, const int nodes_length) in DoubleArrayTrie()79 const TrieNode* nodes_;
38 DoubleArrayTrie trie(reinterpret_cast<const TrieNode*>(config.data()), in TEST()39 config.size() / sizeof(TrieNode)); in TEST()
91 const TrieNode* charsmap_trie_nodes = reinterpret_cast<const TrieNode*>( in Initialize()94 config->normalization_charsmap()->Length() / sizeof(TrieNode); in Initialize()106 const TrieNode* pieces_trie_nodes = in Initialize()107 reinterpret_cast<const TrieNode*>(config->pieces()->Data()); in Initialize()109 config->pieces()->Length() / sizeof(TrieNode); in Initialize()