53     rk_s16          prev;  member
97 static rk_s32 trie_get_node(MppTrieImpl *trie, rk_s32 prev, rk_u64 key)  in trie_get_node()  argument
125     node->prev = (prev > 0) ? prev : 0;  in trie_get_node()
129     if (prev >= 0)  in trie_get_node()
130         trie->nodes[prev].next_cnt++;  in trie_get_node()
537         MppTrieNode *prev;  in mpp_trie_last_info()  local
541         prev_idx = node->prev;  in mpp_trie_last_info()
542         prev = &root[prev_idx];  in mpp_trie_last_info()
544         if (prev->next_cnt > 1) {  in mpp_trie_last_info()
546                           i, node->id, prev_idx, prev->next_cnt);  in mpp_trie_last_info()
556         if (prev->id >= 0) {  in mpp_trie_last_info()
562         prev->id = node->id;  in mpp_trie_last_info()
564         prev->tag_len = node->tag_len + 1;  in mpp_trie_last_info()
565         prev->tag_val = ((rk_u64)node->key << (node->tag_len * 4)) | node->tag_val;  in mpp_trie_last_info()
566         prev->next_cnt = node->next_cnt;  in mpp_trie_last_info()
567         memcpy(prev->next, node->next, sizeof(node->next));  in mpp_trie_last_info()
570                       i, node->id, prev->idx, prev->key, node->tag_val, prev->tag_val);  in mpp_trie_last_info()
573             if (!prev->next[j])  in mpp_trie_last_info()
576             root[prev->next[j]].prev = prev_idx;  in mpp_trie_last_info()
603             MppTrieNode *prev;  in mpp_trie_last_info()  local
610             trie_dbg_last("move node %d to %d prev %d\n", j, i, tmp->prev);  in mpp_trie_last_info()
612             prev = &root[tmp->prev];  in mpp_trie_last_info()
616                 if (prev->next[k] != tmp->idx)  in mpp_trie_last_info()
619                 prev->next[k] = i;  in mpp_trie_last_info()
632                 root[node->next[k]].prev = i;  in mpp_trie_last_info()
893 …mpp_logi("    prev %d count %d tag %d - %llx\n", node->prev, node->next_cnt, node->tag_len, node->…  in mpp_trie_dump()
895             mpp_logi("    prev %d count %d\n", node->prev, node->next_cnt);  in mpp_trie_dump()