Lines Matching full:intermediate

21 /* Intermediate node */
142  * An intermediate node will be turned into a 'real' node on demand. In the
150  * downwards. The last node in the traversal that is a non-intermediate one is
272 		 * artificially added intermediate one.  in trie_lookup_elem()
358 	 * an intermediate node.  in trie_update_elem()
443 	/* Finally, assign the intermediate node to the determined slot */  in trie_update_elem()
508 	 * as intermediate and we are done.  in trie_delete_elem()
516 	/* If the parent of the node we are about to delete is an intermediate  in trie_delete_elem()
518 	 * the intermediate parent as well and promote its other child  in trie_delete_elem()
520 	 * intermediate nodes have exactly 2 children and that there are no  in trie_delete_elem()
521 	 * unnecessary intermediate nodes in the tree.  in trie_delete_elem()
600 	/* Allocate intermediate and leaf nodes from the same allocator */  in trie_alloc()
732 	/* Find the leftmost non-intermediate node, all intermediate nodes  in trie_get_next_key()