Lines Matching defs:leaf
95 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf,
128 * a key satisfies a normal route, and also in remembering the unique leaf
267 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip)
269 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
314 * match and the leaf we have is the most specific one anyway;
350 * we may match if the leaf we wound up at is
396 * Whenever we add a new leaf to the tree, we also add a parent node,
398 * the leaf (see RNTORT() in route.c), the second one is the parent.
400 * the leaf is the left child of the parent node, and both nodes have
1021 * in which case last == rn, or we reached a leaf, in which
1068 /* Find the next *leaf* since next node might vanish, too */
1075 /* printf("leaf %p\n", rn); */
1112 /* Find the next *leaf* since next node might vanish, too */