71     char            *name;  member
166 static rk_s32 trie_pave_node(MppTrieImpl *p, const char *name, rk_s32 str_len)  in trie_pave_node()  argument
169     const char *s = name;  in trie_pave_node()
185                       p, name, i, key, key, key0, key1, idx, next);  in trie_pave_node()
197                           p, name, i, key, key, node->idx, next);  in trie_pave_node()
217                           p, name, i, key, key, node->idx, next);  in trie_pave_node()
223                       p, name, i, key, key, key0, key1, idx, next);  in trie_pave_node()
229 rk_s32 mpp_trie_init(MppTrie *trie, const char *name)  in mpp_trie_init()  argument
235     if (!trie || !name) {  in mpp_trie_init()
236         mpp_loge_f("invalid trie %p name %p\n", trie, name);  in mpp_trie_init()
242     name_len = strnlen(name, MPP_TRIE_NAME_MAX) + 1;  in mpp_trie_init()
245         mpp_loge_f("create trie impl %s failed\n", name);  in mpp_trie_init()
249     p->name = (char *)(p + 1);  in mpp_trie_init()
251     strncpy(p->name, name, name_len);  in mpp_trie_init()
303         p->name = mpp_trie_info_ctx(info);  in mpp_trie_init_by_root()
322         const char *name = mpp_trie_info_name(info);  in mpp_trie_init_by_root()  local
324         MppTrieInfo *info_ret = mpp_trie_get_info(p, name);  in mpp_trie_init_by_root()
332                    name, i, info_set, info_ret ? info_ret->index : -1, info_ret);  in mpp_trie_init_by_root()
434 static MppTrieNode *mpp_trie_get_node(MppTrieNode *root, const char *name)  in mpp_trie_get_node()  argument
437     const char *s = name;  in mpp_trie_get_node()
441     if (!root || !name) {  in mpp_trie_get_node()
442         mpp_err_f("invalid root %p name %p\n", root, name);  in mpp_trie_get_node()
446     trie_dbg_get("root %p search %s start\n", root, name);  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()
485         const char *name = (const char *)(info + 1);  in mpp_trie_check()  local
486         MppTrieNode *node = mpp_trie_get_node(p->nodes, name);  in mpp_trie_check()
494                  log, name, i, node ? node->id : -1);  in mpp_trie_check()
522     mpp_trie_add_info(trie, "__name__", p->name, p->name_len);  in mpp_trie_last_info()
670         const char *name = (char *)(src + 1);  in mpp_trie_last_info()  local
672         node = mpp_trie_get_node(p->nodes, name);  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()  argument
704         mpp_loge_f("invalid trie %p name %s ctx %p\n", p, name, ctx);  in mpp_trie_add_info()
708     if (!name)  in mpp_trie_add_info()
711     str_real = strnlen(name, MPP_TRIE_NAME_MAX) + 1;  in mpp_trie_add_info()
720                    name, str_len, MPP_TRIE_NAME_MAX);  in mpp_trie_add_info()
727     idx = trie_pave_node(p, name, str_real);  in mpp_trie_add_info()
729         mpp_loge_f("trie %p pave node %s failed\n", p, name);  in mpp_trie_add_info()
733         mpp_loge_f("trie %p add info %s already exist\n", p, name);  in mpp_trie_add_info()
749         memcpy(buf, name, str_real);  in mpp_trie_add_info()
761                  p, p->info_count, name, idx, p->info_buf_pos, ctx, ctx_len);  in mpp_trie_add_info()
804 MppTrieInfo *mpp_trie_get_info(MppTrie trie, const char *name)  in mpp_trie_get_info()  argument
809     if (!trie || !name) {  in mpp_trie_get_info()
810         mpp_err_f("invalid trie %p name %p\n", trie, name);  in mpp_trie_get_info()
814     node = mpp_trie_get_node(p->nodes, name);  in mpp_trie_get_info()
838 MppTrieInfo *mpp_trie_get_info_from_root(void *root, const char *name)  in mpp_trie_get_info_from_root()  argument
842     if (!root || !name) {  in mpp_trie_get_info_from_root()
843         mpp_loge_f("invalid root %p name %p\n", root, name);  in mpp_trie_get_info_from_root()
849     node = mpp_trie_get_node((MppTrieNode *)root, name);  in mpp_trie_get_info_from_root()
869              p->name, p->buf_size, p->node_used, p->info_count);  in mpp_trie_dump()