76     rk_s32          node_used;  member
102     if (trie->node_used >= trie->node_count) {  in trie_get_node()
122     idx = trie->node_used++;  in trie_get_node()
307         p->node_used = *(rk_u32 *)mpp_trie_info_ctx(info);  in mpp_trie_init_by_root()
525     mpp_trie_add_info(trie, "__node__", &p->node_used, sizeof(p->node_used));  in mpp_trie_last_info()
528     node_count = p->node_used;  in mpp_trie_last_info()
639     p->node_used = node_valid;  in mpp_trie_last_info()
641     trie_dbg_last("move trie node finish used %d\n", p->node_used);  in mpp_trie_last_info()
651     nodes_size = sizeof(MppTrieNode) * p->node_used;  in mpp_trie_last_info()
688             *(rk_u32 *)mpp_trie_info_ctx(info) = p->node_used;  in mpp_trie_last_info()
773     return (p) ? p->node_used : 0;  in mpp_trie_get_node_count()
825     return (p) ? (MppTrieInfo *)(((char *)p->nodes) + p->node_used * sizeof(MppTrieNode)) : NULL;  in mpp_trie_get_info_first()
869              p->name, p->buf_size, p->node_used, p->info_count);  in mpp_trie_dump()
871     for (i = 0; i < p->node_used; i++) {  in mpp_trie_dump()
883             if (node->id < (rk_s32)(p->node_used * sizeof(MppTrieNode)))  in mpp_trie_dump()
908     mpp_logi("node | next |  tag | used %d\n", p->node_used);  in mpp_trie_dump()
915     mpp_logi("%s dumping node end\n", func, p->node_used);  in mpp_trie_dump()