Lines Matching defs:leaf
118 * a key satisfies a normal route, and also in remembering the unique leaf
208 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip)
211 char *cp2 = leaf->rn_key;
212 char *cp3 = leaf->rn_mask;
251 * match and the leaf we have is the most specific one anyway;
291 * we may match if the leaf we wound up at is
709 * - leaf nodes with possible rn_dupedkey list
728 if (x->rn_b < 0) { /* x is a leaf node */
796 /* Either insert into dupedkey list or as a leaf node. */
919 * the radix leaf node (where th rn_dupedkey list starts) so
1074 /* Find the next *leaf* since next node might vanish, too */