58     rk_u16          key;  member
97 static rk_s32 trie_get_node(MppTrieImpl *trie, rk_s32 prev, rk_u64 key)  in trie_get_node()  argument
126     node->key = key;  in trie_get_node()
177         rk_u32 key = s[i];  in trie_pave_node()  local
178         rk_s32 key0 = (key >> 4) & 0xf;  in trie_pave_node()
179         rk_s32 key1 = (key >> 0) & 0xf;  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()
205                       p, s, i, key, key, key0, key1, 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()
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
372                             node->idx, node->id, key, keyx);  in mpp_trie_walk()
454         char key = *s++;  in mpp_trie_get_node()  local
455         rk_u32 key0 = (key >> 4) & 0xf;  in mpp_trie_get_node()
456         rk_u32 key1 = key & 0xf;  in mpp_trie_get_node()
459         idx = mpp_trie_walk(&walk, idx, key, key0, 0);  in mpp_trie_get_node()
463         idx = mpp_trie_walk(&walk, idx, key, key1, end);  in mpp_trie_get_node()
565         prev->tag_val = ((rk_u64)node->key << (node->tag_len * 4)) | node->tag_val;  in mpp_trie_last_info()
570                       i, node->id, prev->idx, prev->key, node->tag_val, prev->tag_val);  in mpp_trie_last_info()
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()