Lines Matching defs:leaf
72 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf,
105 * a key satisfies a normal route, and also in remembering the unique leaf
217 rn_satisfies_leaf(char *trial, register struct radix_node *leaf, int skip)
219 register char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
236 * Whenever we add a new leaf to the tree, we also add a parent node,
238 * the leaf (see RNTORT() in route.c), the second one is the parent.
240 * the leaf is the left child of the parent node, and both nodes have
370 * in which case last == rn, or we reached a leaf, in which
418 /* Find the next *leaf* since next node might vanish, too */
425 /* printf("leaf %p\n", rn); */
463 /* Find the next *leaf* since next node might vanish, too */
534 * match and the leaf we have is the most specific one anyway;
571 * we may match if the leaf we wound up at is