68 } MppTrieNode;  typedef
77     MppTrieNode     *nodes;
89     MppTrieNode     *root;
99     MppTrieNode *node;  in trie_get_node()
105         MppTrieNode *new_nodes = mpp_realloc(trie->nodes, MppTrieNode, new_count);  in trie_get_node()
168     MppTrieNode *node = NULL;  in trie_pave_node()
254     p->nodes = mpp_calloc(MppTrieNode, p->node_count);  in mpp_trie_init()
314     p->nodes = (MppTrieNode *)root;  in mpp_trie_init_by_root()
362     MppTrieNode *node = &p->root[idx];  in mpp_trie_walk()
434 static MppTrieNode *mpp_trie_get_node(MppTrieNode *root, const char *name)  in mpp_trie_get_node()
436     MppTrieNode *ret = NULL;  in mpp_trie_get_node()
486         MppTrieNode *node = mpp_trie_get_node(p->nodes, name);  in mpp_trie_check()
504     MppTrieNode *root;  in mpp_trie_last_info()
505     MppTrieNode *node;  in mpp_trie_last_info()
537         MppTrieNode *prev;  in mpp_trie_last_info()
602             MppTrieNode *tmp = &root[j];  in mpp_trie_last_info()
603             MppTrieNode *prev;  in mpp_trie_last_info()
651     nodes_size = sizeof(MppTrieNode) * p->node_used;  in mpp_trie_last_info()
661     p->nodes = (MppTrieNode *)buf;  in mpp_trie_last_info()
807     MppTrieNode *node;  in mpp_trie_get_info()
825     return (p) ? (MppTrieInfo *)(((char *)p->nodes) + p->node_used * sizeof(MppTrieNode)) : NULL;  in mpp_trie_get_info_first()
840     MppTrieNode *node;  in mpp_trie_get_info_from_root()
849     node = mpp_trie_get_node((MppTrieNode *)root, name);  in mpp_trie_get_info_from_root()
872         MppTrieNode *node = &p->nodes[i];  in mpp_trie_dump()
883             if (node->id < (rk_s32)(p->node_used * sizeof(MppTrieNode)))  in mpp_trie_dump()