Lines Matching refs:rn
117 #define RN_MATCHF(rn, f, arg) (f == NULL || (*f)((rn), arg))
944 struct radix_node *rn, *last;
968 for (rn = h->rnh_treetop; rn->rn_bit >= 0; ) {
969 last = rn;
970 if (!(rn->rn_bmask & xm[rn->rn_offset]))
973 if (rn->rn_bmask & xa[rn->rn_offset])
974 rn = rn->rn_right;
976 rn = rn->rn_left;
981 * in which case last == rn, or we reached a leaf, in which
985 rn = last;
986 lastb = rn->rn_bit;
989 while (rn->rn_bit >= 0)
990 rn = rn->rn_left;
993 base = rn;
995 while (rn->rn_parent->rn_right == rn
996 && !(rn->rn_flags & RNF_ROOT)) {
997 rn = rn->rn_parent;
1000 if (rn->rn_bit <= lastb) {
1004 * part, because the values of 'rn' and 'next'
1036 if (rn->rn_parent->rn_flags & RNF_ROOT)
1041 for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)
1042 rn = rn->rn_left;
1043 next = rn;
1045 while ((rn = base) != 0) {
1046 base = rn->rn_dupedkey;
1047 if (!(rn->rn_flags & RNF_ROOT)
1048 && (error = (*f)(rn, w)))
1054 rn = next;
1055 if (rn->rn_flags & RNF_ROOT)
1066 struct radix_node *rn;
1081 rn = h->rnh_treetop;
1085 while (rn->rn_bit >= 0)
1086 rn = rn->rn_left;
1088 base = rn;
1090 while (rn->rn_parent->rn_right == rn &&
1091 (rn->rn_flags & RNF_ROOT) == 0)
1092 rn = rn->rn_parent;
1094 for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)
1095 rn = rn->rn_left;
1096 next = rn;
1098 while ((rn = base) != NULL) {
1099 base = rn->rn_dupedkey;
1100 if (!(rn->rn_flags & RNF_ROOT)
1101 && (error = (*f)(rn, w)))
1107 rn = next;
1108 if (rn->rn_flags & RNF_ROOT)