Lines Matching defs:leaf

121 		rn_satisfies_leaf(char *trial, struct radix_node *leaf,
156  * a key satisfies a normal route, and also in remembering the unique leaf
270  * leaf's key when compared under the leaf's mask.  In other words,
271  * returns true when 'trial' matches leaf.
277 rn_satisfies_leaf(trial, leaf, skip, rn_leaf_fn, rn_leaf_arg)
279 	struct radix_node *leaf;
284 	char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
300 	return (RN_MATCHF(leaf, rn_leaf_fn, rn_leaf_arg));
342 	 * match and the leaf we have is the most specific one anyway;
396 		 * we may match if the leaf we wound up at is
447  * Whenever we add a new leaf to the tree, we also add a parent node,
449  * the leaf (see RNTORT() in route.c), the second one is the parent.
451  * the leaf is the left child of the parent node, and both nodes have
797 	 * b_leaf is now normalized to be in the leaf rn_bit format
798 	 * (it is the rn_bit value of a leaf corresponding to netmask
810 		/* x is the sibling node. it is a leaf node. */
1134 		/* Find the next *leaf* since next node might vanish, too */