Lines Matching full:intermediate
20 /* Intermediate node */
141 * An intermediate node will be turned into a 'real' node on demand. In the
149 * downwards. The last node in the traversal that is a non-intermediate one is
271 * artificially added intermediate one. in trie_lookup_elem()
355 * an intermediate node. in trie_update_elem()
441 /* Finally, assign the intermediate node to the determined slot */ in trie_update_elem()
505 * as intermediate and we are done. in trie_delete_elem()
513 /* If the parent of the node we are about to delete is an intermediate in trie_delete_elem()
515 * the intermediate parent as well and promote its other child in trie_delete_elem()
517 * intermediate nodes have exactly 2 children and that there are no in trie_delete_elem()
518 * unnecessary intermediate nodes in the tree. in trie_delete_elem()
597 /* Allocate intermediate and leaf nodes from the same allocator */ in trie_alloc()
729 /* Find the leftmost non-intermediate node, all intermediate nodes in trie_get_next_key()