kernel/bpf/lpm_trie.c

18 /* Intermediate node */
139  * An intermediate node will be turned into a 'real' node on demand. In the
147  * downwards. The last node in the traversal that is a non-intermediate one is
257 		 * artificially added intermediate one.  in trie_lookup_elem()
343 	 * an intermediate node.  in trie_update_elem()
413 	/* Finally, assign the intermediate node to the determined spot */  in trie_update_elem()
480 	 * as intermediate and we are done.  in trie_delete_elem()
488 	/* If the parent of the node we are about to delete is an intermediate  in trie_delete_elem()
490 	 * the intermediate parent as well and promote its other child  in trie_delete_elem()
492 	 * intermediate nodes have exactly 2 children and that there are no  in trie_delete_elem()
493 	 * unnecessary intermediate nodes in the tree.  in trie_delete_elem()
701 	/* Find the leftmost non-intermediate node, all intermediate nodes  in trie_get_next_key()