Lines Matching refs:leaf
115 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip,
150 * a key satisfies a normal route, and also in remembering the unique leaf
240 * leaf's key when compared under the leaf's mask. In other words,
241 * returns true when 'trial' matches leaf. If a leaf-matching
246 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip,
249 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
262 return (RN_MATCHF(leaf, f, w));
299 * match and the leaf we have is the most specific one anyway;
350 * we may match if the leaf we wound up at is
953 * leaf as the successor node in advance, because that leaf may
982 * in which case last == rn, or we reached a leaf, in which
1041 /* Find the next *leaf* to start from */
1073 * leaf as the successor node in advance, because that leaf may
1094 /* Find the next *leaf* to start from */