99     MppTrieNode *node;  in trie_get_node()  local
123     node = &trie->nodes[idx];  in trie_get_node()
124     node->idx = idx;  in trie_get_node()
125     node->prev = (prev > 0) ? prev : 0;  in trie_get_node()
126     node->key = key;  in trie_get_node()
127     node->id = INVALID_NODE_ID;  in trie_get_node()
168     MppTrieNode *node = NULL;  in trie_pave_node()  local
181         node = p->nodes + idx;  in trie_pave_node()
182         next = node->next[key0];  in trie_pave_node()
193             node = p->nodes + idx;  in trie_pave_node()
194             node->next[key0] = next;  in trie_pave_node()
197                           p, name, i, key, key, node->idx, next);  in trie_pave_node()
201         node = p->nodes + idx;  in trie_pave_node()
202         next = node->next[key1];  in trie_pave_node()
213             node = p->nodes + idx;  in trie_pave_node()
214             node->next[key1] = next;  in trie_pave_node()
217                           p, name, i, key, key, node->idx, next);  in trie_pave_node()
362     MppTrieNode *node = &p->root[idx];  in mpp_trie_walk()  local
372                             node->idx, node->id, key, keyx);  in mpp_trie_walk()
375     if (!node->tag_len || p->match == node->idx) {  in mpp_trie_walk()
377         next = node->next[keyx];  in mpp_trie_walk()
381                                 !node->tag_len ? "n/a" : "match");  in mpp_trie_walk()
393                                 node->tag_len, node->tag_val, node->tag_len,  in mpp_trie_walk()
394                                 node->tag_len, val_new, len_new);  in mpp_trie_walk()
398         if (node->tag_len > len_new && !end) {  in mpp_trie_walk()
402             next = node->idx;  in mpp_trie_walk()
411             if (node->tag_val != val_new) {  in mpp_trie_walk()
420                 next = node->idx;  in mpp_trie_walk()
421                 p->match = node->idx;  in mpp_trie_walk()
486         MppTrieNode *node = mpp_trie_get_node(p->nodes, name);  in mpp_trie_check()  local
490         if (node && node->id >= 0 && node->id == pos)  in mpp_trie_check()
494                  log, name, i, node ? node->id : -1);  in mpp_trie_check()
505     MppTrieNode *node;  in mpp_trie_last_info()  local
540         node = &root[i];  in mpp_trie_last_info()
541         prev_idx = node->prev;  in mpp_trie_last_info()
546                           i, node->id, prev_idx, prev->next_cnt);  in mpp_trie_last_info()
550         if (node->tag_len >= (rk_s16)MPP_TRIE_TAG_LEN_MAX) {  in mpp_trie_last_info()
552                           i, node->id, node->tag_len, node->tag_val);  in mpp_trie_last_info()
558                           i, node->id, node->tag_len, node->tag_val);  in mpp_trie_last_info()
562         prev->id = node->id;  in mpp_trie_last_info()
564         prev->tag_len = node->tag_len + 1;  in mpp_trie_last_info()
565         prev->tag_val = ((rk_u64)node->key << (node->tag_len * 4)) | node->tag_val;  in mpp_trie_last_info()
566         prev->next_cnt = node->next_cnt;  in mpp_trie_last_info()
567         memcpy(prev->next, node->next, sizeof(node->next));  in mpp_trie_last_info()
570                       i, node->id, prev->idx, prev->key, node->tag_val, prev->tag_val);  in mpp_trie_last_info()
579         memset(node, 0, sizeof(*node));  in mpp_trie_last_info()
580         node->id = INVALID_NODE_ID;  in mpp_trie_last_info()
595         node = &root[i];  in mpp_trie_last_info()
598         if (node->idx)  in mpp_trie_last_info()
623             memcpy(node, tmp, sizeof(*node));  in mpp_trie_last_info()
624             node->idx = i;  in mpp_trie_last_info()
629                 if (!node->next[k])  in mpp_trie_last_info()
632                 root[node->next[k]].prev = i;  in mpp_trie_last_info()
672         node = mpp_trie_get_node(p->nodes, name);  in mpp_trie_last_info()
673         node->id = pos;  in mpp_trie_last_info()
807     MppTrieNode *node;  in mpp_trie_get_info()  local
814     node = mpp_trie_get_node(p->nodes, name);  in mpp_trie_get_info()
815     if (!node || node->id < 0)  in mpp_trie_get_info()
818     return (MppTrieInfo *)(((char *)p->nodes) + node->id);  in mpp_trie_get_info()
840     MppTrieNode *node;  in mpp_trie_get_info_from_root()  local
849     node = mpp_trie_get_node((MppTrieNode *)root, name);  in mpp_trie_get_info_from_root()
850     if (!node || node->id < 0)  in mpp_trie_get_info_from_root()
853     return (MppTrieInfo *)(((char *)root) + node->id);  in mpp_trie_get_info_from_root()
872         MppTrieNode *node = &p->nodes[i];  in mpp_trie_dump()  local
876         if (i && !node->idx)  in mpp_trie_dump()
879         if (node->id >= 0) {  in mpp_trie_dump()
880             MppTrieInfo *info = (MppTrieInfo *)((char *)base + node->id);  in mpp_trie_dump()
883             if (node->id < (rk_s32)(p->node_used * sizeof(MppTrieNode)))  in mpp_trie_dump()
884                 mpp_logi("node %d key %x info %d - %s\n", node->idx, node->key, node->id,  in mpp_trie_dump()
887                 mpp_logi("node %d key %x info %d - %s\n", node->idx, node->key, node->id,  in mpp_trie_dump()
890             mpp_logi("node %d key %x\n", node->idx, node->key);  in mpp_trie_dump()
892         if (node->tag_len)  in mpp_trie_dump()
893 …mpp_logi("    prev %d count %d tag %d - %llx\n", node->prev, node->next_cnt, node->tag_len, node->…  in mpp_trie_dump()
895             mpp_logi("    prev %d count %d\n", node->prev, node->next_cnt);  in mpp_trie_dump()
898             if (node->next[j] > 0) {  in mpp_trie_dump()
899                 mpp_logi("    next %d:%d -> %d\n", valid_count, j, node->next[j]);  in mpp_trie_dump()
905         tag_len[node->tag_len]++;  in mpp_trie_dump()