Lines Matching refs:leaf
114 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip,
149 * a key satisfies a normal route, and also in remembering the unique leaf
239 * leaf's key when compared under the leaf's mask. In other words,
240 * returns true when 'trial' matches leaf. If a leaf-matching
245 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip,
248 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
261 return (RN_MATCHF(leaf, f, w));
298 * match and the leaf we have is the most specific one anyway;
349 * we may match if the leaf we wound up at is
952 * leaf as the successor node in advance, because that leaf may
981 * in which case last == rn, or we reached a leaf, in which
1040 /* Find the next *leaf* to start from */
1072 * leaf as the successor node in advance, because that leaf may
1093 /* Find the next *leaf* to start from */