188     MatchTrie* node = this;  in Add()  local
192       if (node->nodes_[c] == nullptr) {  in Add()
194         node->nodes_[c].reset(new_node);  in Add()
195         new_node->parent_ = node;  in Add()
198         node = new_node;  in Add()
200         node = node->nodes_[c].get();  in Add()
202       ++node->count_;  in Add()
204     return node;  in Add()
209     MatchTrie* node = this;  in LongestPrefix()  local
211       if (node->nodes_[c] == nullptr) {  in LongestPrefix()
214       node = node->nodes_[c].get();  in LongestPrefix()
216     return node;  in LongestPrefix()
369       MatchTrie* node = prefixe_trie->LongestPrefix(str);  in Build()  local
370       if (node != nullptr && node->depth_ == str.length() && node->value_ != 0u) {  in Build()
371         CHECK_EQ(node->GetString(), str);  in Build()
373         output_->dictionary_.GetOffset(node->value_, &prefix_offset, &existing_len);  in Build()
378           node = prefixe_trie->Add(s);  in Build()
379           node->value_ = prefix_idx;  in Build()
380           while (node != nullptr) {  in Build()
381             node->value_ = prefix_idx;  in Build()
382             node = node->parent_;  in Build()
403     MatchTrie* node = prefixe_trie->LongestPrefix(str);  in Build()  local
406     while (node != nullptr) {  in Build()
409       output_->dictionary_.GetOffset(node->value_, &offset, &length);  in Build()
410       if (node->depth_ == length) {  in Build()
411         prefix_idx = node->value_;  in Build()
412         best_length = node->depth_;  in Build()
416       node = node->parent_;  in Build()