51     rk_s16          idx;  member
100     rk_s32 idx;  in trie_get_node()  local
122     idx = trie->node_used++;  in trie_get_node()
123     node = &trie->nodes[idx];  in trie_get_node()
124     node->idx = idx;  in trie_get_node()
132     trie_dbg_cnt("get node %d\n", idx);  in trie_get_node()
134     return idx;  in trie_get_node()
171     rk_s32 idx = 0;  in trie_pave_node()  local
181         node = p->nodes + idx;  in trie_pave_node()
185                       p, name, i, key, key, key0, key1, idx, next);  in trie_pave_node()
188             next = trie_get_node(p, idx, key0);  in trie_pave_node()
193             node = p->nodes + idx;  in trie_pave_node()
197                           p, name, i, key, key, node->idx, next);  in trie_pave_node()
200         idx = next;  in trie_pave_node()
201         node = p->nodes + idx;  in trie_pave_node()
205                       p, s, i, key, key, key0, key1, idx, next);  in trie_pave_node()
208             next = trie_get_node(p, idx, key1);  in trie_pave_node()
213             node = p->nodes + idx;  in trie_pave_node()
217                           p, name, i, key, key, node->idx, next);  in trie_pave_node()
220         idx = next;  in trie_pave_node()
223                       p, name, i, key, key, key0, key1, idx, next);  in trie_pave_node()
226     return idx;  in trie_pave_node()
360 static rk_s32 mpp_trie_walk(MppTrieWalk *p, rk_s32 idx, rk_u32 key, rk_u32 keyx, rk_u32 end)  in mpp_trie_walk()  argument
362     MppTrieNode *node = &p->root[idx];  in mpp_trie_walk()
372                             node->idx, node->id, key, keyx);  in mpp_trie_walk()
375     if (!node->tag_len || p->match == node->idx) {  in mpp_trie_walk()
402             next = node->idx;  in mpp_trie_walk()
420                 next = node->idx;  in mpp_trie_walk()
421                 p->match = node->idx;  in mpp_trie_walk()
439     rk_s32 idx = 0;  in mpp_trie_get_node()  local
459         idx = mpp_trie_walk(&walk, idx, key, key0, 0);  in mpp_trie_get_node()
460         if (idx < 0)  in mpp_trie_get_node()
463         idx = mpp_trie_walk(&walk, idx, key, key1, end);  in mpp_trie_get_node()
464         if (idx < 0 || end)  in mpp_trie_get_node()
468     ret = (idx >= 0) ? &root[idx] : NULL;  in mpp_trie_get_node()
470     trie_dbg_get("get %s ret node %d:%d\n", name, idx, ret ? ret->id : INVALID_NODE_ID);  in mpp_trie_get_node()
570                       i, node->id, prev->idx, prev->key, node->tag_val, prev->tag_val);  in mpp_trie_last_info()
598         if (node->idx)  in mpp_trie_last_info()
607             if (!tmp->idx)  in mpp_trie_last_info()
616                 if (prev->next[k] != tmp->idx)  in mpp_trie_last_info()
624             node->idx = i;  in mpp_trie_last_info()
701     rk_s32 idx;  in mpp_trie_add_info()  local
727     idx = trie_pave_node(p, name, str_real);  in mpp_trie_add_info()
728     if (idx < 0) {  in mpp_trie_add_info()
732     if (p->nodes[idx].id != -1) {  in mpp_trie_add_info()
737     p->nodes[idx].id = p->info_buf_pos;  in mpp_trie_add_info()
761                  p, p->info_count, name, idx, p->info_buf_pos, ctx, ctx_len);  in mpp_trie_add_info()
876         if (i && !node->idx)  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()