49     rk_s32          id;
72     rk_s32          name_len;
73     rk_s32          buf_size;
75     rk_s32          node_count;
76     rk_s32          node_used;
81     rk_s32          info_count;
82     rk_s32          info_buf_size;
83     rk_s32          info_buf_pos;
84     rk_s32          info_name_max;
92     rk_s32          match;
97 static rk_s32 trie_get_node(MppTrieImpl *trie, rk_s32 prev, rk_u64 key)  in trie_get_node()
100     rk_s32 idx;  in trie_get_node()
103         rk_s32 old_count = trie->node_count;  in trie_get_node()
104         rk_s32 new_count = old_count * 2;  in trie_get_node()
137 static rk_s32 trie_prepare_buf(MppTrieImpl *p, rk_s32 info_size)  in trie_prepare_buf()
147         rk_s32 old_size = p->info_buf_size;  in trie_prepare_buf()
148         rk_s32 new_size = old_size * 2;  in trie_prepare_buf()
166 static rk_s32 trie_pave_node(MppTrieImpl *p, const char *name, rk_s32 str_len)  in trie_pave_node()
170     rk_s32 next = 0;  in trie_pave_node()
171     rk_s32 idx = 0;  in trie_pave_node()
172     rk_s32 i;  in trie_pave_node()
178         rk_s32 key0 = (key >> 4) & 0xf;  in trie_pave_node()
179         rk_s32 key1 = (key >> 0) & 0xf;  in trie_pave_node()
229 rk_s32 mpp_trie_init(MppTrie *trie, const char *name)  in mpp_trie_init()
232     rk_s32 name_len;  in mpp_trie_init()
233     rk_s32 ret = rk_nok;  in mpp_trie_init()
283 rk_s32 mpp_trie_init_by_root(MppTrie *trie, void *root)  in mpp_trie_init_by_root()
287     rk_s32 i;  in mpp_trie_init_by_root()
341 rk_s32 mpp_trie_deinit(MppTrie trie)  in mpp_trie_deinit()
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()
367     rk_s32 next = -1;  in mpp_trie_walk()
388         rk_s32 len_new = p->len + 1;  in mpp_trie_walk()
439     rk_s32 idx = 0;  in mpp_trie_get_node()
475 static rk_s32 mpp_trie_check(MppTrie trie, const char *log)  in mpp_trie_check()
479     rk_s32 info_size = 0;  in mpp_trie_check()
480     rk_s32 pos = 0;  in mpp_trie_check()
481     rk_s32 i;  in mpp_trie_check()
501 rk_s32 mpp_trie_last_info(MppTrie trie)  in mpp_trie_last_info()
507     rk_s32 node_count;  in mpp_trie_last_info()
508     rk_s32 node_valid;  in mpp_trie_last_info()
509     rk_s32 nodes_size;  in mpp_trie_last_info()
510     rk_s32 len = 0;  in mpp_trie_last_info()
511     rk_s32 pos = 0;  in mpp_trie_last_info()
512     rk_s32 i;  in mpp_trie_last_info()
513     rk_s32 j;  in mpp_trie_last_info()
538         rk_s32 prev_idx;  in mpp_trie_last_info()
604             rk_s32 k;  in mpp_trie_last_info()
669         rk_s32 info_size = sizeof(MppTrieInfo) + src->str_len + src->ctx_len;  in mpp_trie_last_info()
694 rk_s32 mpp_trie_add_info(MppTrie trie, const char *name, void *ctx, rk_u32 ctx_len)  in mpp_trie_add_info()
697     rk_s32 info_size;  in mpp_trie_add_info()
699     rk_s32 str_real;  in mpp_trie_add_info()
700     rk_s32 str_len;  in mpp_trie_add_info()
701     rk_s32 idx;  in mpp_trie_add_info()
769 rk_s32 mpp_trie_get_node_count(MppTrie trie)  in mpp_trie_get_node_count()
776 rk_s32 mpp_trie_get_info_count(MppTrie trie)  in mpp_trie_get_info_count()
783 rk_s32 mpp_trie_get_buf_size(MppTrie trie)  in mpp_trie_get_buf_size()
790 rk_s32 mpp_trie_get_name_max(MppTrie trie)  in mpp_trie_get_name_max()
860     rk_s32 i;  in mpp_trie_dump()
861     rk_s32 next_cnt[17];  in mpp_trie_dump()
862     rk_s32 tag_len[17];  in mpp_trie_dump()
873         rk_s32 valid_count = 0;  in mpp_trie_dump()
874         rk_s32 j;  in mpp_trie_dump()
883             if (node->id < (rk_s32)(p->node_used * sizeof(MppTrieNode)))  in mpp_trie_dump()
923     rk_s32 loop = 0;  in mpp_trie_timing_test()