Lines Matching refs:next
47 rk_s16 next[MPP_TRIE_KEY_MAX]; member
170 rk_s32 next = 0; in trie_pave_node() local
182 next = node->next[key0]; in trie_pave_node()
185 p, name, i, key, key, key0, key1, idx, next); in trie_pave_node()
187 if (!next) { in trie_pave_node()
188 next = trie_get_node(p, idx, key0); in trie_pave_node()
189 if (next < 0) in trie_pave_node()
190 return next; in trie_pave_node()
194 node->next[key0] = next; in trie_pave_node()
197 p, name, i, key, key, node->idx, next); in trie_pave_node()
200 idx = next; in trie_pave_node()
202 next = node->next[key1]; in trie_pave_node()
205 p, s, i, key, key, key0, key1, idx, next); in trie_pave_node()
207 if (!next) { in trie_pave_node()
208 next = trie_get_node(p, idx, key1); in trie_pave_node()
209 if (next < 0) in trie_pave_node()
210 return next; in trie_pave_node()
214 node->next[key1] = next; in trie_pave_node()
217 p, name, i, key, key, node->idx, next); in trie_pave_node()
220 idx = next; in trie_pave_node()
223 p, name, i, key, key, key0, key1, idx, next); in trie_pave_node()
367 rk_s32 next = -1; in mpp_trie_walk() local
377 next = node->next[keyx]; in mpp_trie_walk()
402 next = node->idx; in mpp_trie_walk()
415 next = INVALID_NODE_ID; in mpp_trie_walk()
420 next = node->idx; in mpp_trie_walk()
427 snprintf(log_buf + log_len, log_size - log_len, "%d", next); in mpp_trie_walk()
431 return next; in mpp_trie_walk()
567 memcpy(prev->next, node->next, sizeof(node->next)); 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()
616 if (prev->next[k] != tmp->idx) in mpp_trie_last_info()
619 prev->next[k] = i; in mpp_trie_last_info()
629 if (!node->next[k]) in mpp_trie_last_info()
632 root[node->next[k]].prev = i; in mpp_trie_last_info()
898 if (node->next[j] > 0) { in mpp_trie_dump()
899 mpp_logi(" next %d:%d -> %d\n", valid_count, j, node->next[j]); in mpp_trie_dump()