Lines Matching refs:leaf
84 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf,
117 * a key satisfies a normal route, and also in remembering the unique leaf
256 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip)
258 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
303 * match and the leaf we have is the most specific one anyway;
339 * we may match if the leaf we wound up at is
385 * Whenever we add a new leaf to the tree, we also add a parent node,
387 * the leaf (see RNTORT() in route.c), the second one is the parent.
389 * the leaf is the left child of the parent node, and both nodes have
995 * in which case last == rn, or we reached a leaf, in which
996 * case we want to start from the leaf.
1042 /* Find the next *leaf* since next node might vanish, too */
1049 /* printf("leaf %p\n", rn); */
1086 /* Find the next *leaf* since next node might vanish, too */