Lines Matching refs:rn
118 #define RN_MATCHF(rn, f, arg) (f == NULL || (*f)((rn), arg))
945 struct radix_node *rn, *last;
969 for (rn = h->rnh_treetop; rn->rn_bit >= 0; ) {
970 last = rn;
971 if (!(rn->rn_bmask & xm[rn->rn_offset]))
974 if (rn->rn_bmask & xa[rn->rn_offset])
975 rn = rn->rn_right;
977 rn = rn->rn_left;
982 * in which case last == rn, or we reached a leaf, in which
986 rn = last;
987 lastb = rn->rn_bit;
990 while (rn->rn_bit >= 0)
991 rn = rn->rn_left;
994 base = rn;
996 while (rn->rn_parent->rn_right == rn
997 && !(rn->rn_flags & RNF_ROOT)) {
998 rn = rn->rn_parent;
1001 if (rn->rn_bit <= lastb) {
1005 * part, because the values of 'rn' and 'next'
1037 if (rn->rn_parent->rn_flags & RNF_ROOT)
1042 for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)
1043 rn = rn->rn_left;
1044 next = rn;
1046 while ((rn = base) != 0) {
1047 base = rn->rn_dupedkey;
1048 if (!(rn->rn_flags & RNF_ROOT)
1049 && (error = (*f)(rn, w)))
1055 rn = next;
1056 if (rn->rn_flags & RNF_ROOT)
1067 struct radix_node *rn;
1082 rn = h->rnh_treetop;
1086 while (rn->rn_bit >= 0)
1087 rn = rn->rn_left;
1089 base = rn;
1091 while (rn->rn_parent->rn_right == rn &&
1092 (rn->rn_flags & RNF_ROOT) == 0)
1093 rn = rn->rn_parent;
1095 for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)
1096 rn = rn->rn_left;
1097 next = rn;
1099 while ((rn = base) != NULL) {
1100 base = rn->rn_dupedkey;
1101 if (!(rn->rn_flags & RNF_ROOT)
1102 && (error = (*f)(rn, w)))
1108 rn = next;
1109 if (rn->rn_flags & RNF_ROOT)