134 #define RN_MATCHF(rn, f, arg)   (f == NULL || (*f)((rn), arg))  argument
1199 	struct radix_node *rn, *last;  in rn_walktree_from()  local
1223 	for (rn = h->rnh_treetop; rn->rn_bit >= 0;) {  in rn_walktree_from()
1224 		last = rn;  in rn_walktree_from()
1226 		test_byte = rnarg_get(xm, mlen, rn->rn_offset);  in rn_walktree_from()
1227 		if (!(rn->rn_bmask & test_byte)) {  in rn_walktree_from()
1230 		test_byte = rnarg_get(xa, alen, rn->rn_offset);  in rn_walktree_from()
1231 		if (rn->rn_bmask & test_byte) {  in rn_walktree_from()
1232 			rn = rn->rn_right;  in rn_walktree_from()
1234 			rn = rn->rn_left;  in rn_walktree_from()
1244 	rn = last;  in rn_walktree_from()
1245 	lastb = rn->rn_bit;  in rn_walktree_from()
1248 	while (rn->rn_bit >= 0) {  in rn_walktree_from()
1249 		rn = rn->rn_left;  in rn_walktree_from()
1253 		base = rn;  in rn_walktree_from()
1255 		while (rn->rn_parent->rn_right == rn  in rn_walktree_from()
1256 		    && !(rn->rn_flags & RNF_ROOT)) {  in rn_walktree_from()
1257 			rn = rn->rn_parent;  in rn_walktree_from()
1260 			if (rn->rn_bit <= lastb) {  in rn_walktree_from()
1296 		if (rn->rn_parent->rn_flags & RNF_ROOT) {  in rn_walktree_from()
1302 		for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;) {  in rn_walktree_from()
1303 			rn = rn->rn_left;  in rn_walktree_from()
1305 		next = rn;  in rn_walktree_from()
1307 		while ((rn = base) != 0) {  in rn_walktree_from()
1308 			base = rn->rn_dupedkey;  in rn_walktree_from()
1309 			if (!(rn->rn_flags & RNF_ROOT)  in rn_walktree_from()
1310 			    && (error = (*f)(rn, w))) {  in rn_walktree_from()
1318 		rn = next;  in rn_walktree_from()
1319 		if (rn->rn_flags & RNF_ROOT) {  in rn_walktree_from()
1331 	struct radix_node *rn;  in rn_walktree()  local
1346 	rn = h->rnh_treetop;  in rn_walktree()
1350 	while (rn->rn_bit >= 0) {  in rn_walktree()
1351 		rn = rn->rn_left;  in rn_walktree()
1354 		base = rn;  in rn_walktree()
1356 		while (rn->rn_parent->rn_right == rn &&  in rn_walktree()
1357 		    (rn->rn_flags & RNF_ROOT) == 0) {  in rn_walktree()
1358 			rn = rn->rn_parent;  in rn_walktree()
1361 		for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;) {  in rn_walktree()
1362 			rn = rn->rn_left;  in rn_walktree()
1364 		next = rn;  in rn_walktree()
1366 		while ((rn = base) != NULL) {  in rn_walktree()
1367 			base = rn->rn_dupedkey;  in rn_walktree()
1368 			if (!(rn->rn_flags & RNF_ROOT)  in rn_walktree()
1369 			    && (error = (*f)(rn, w))) {  in rn_walktree()
1377 		rn = next;  in rn_walktree()
1378 		if (rn->rn_flags & RNF_ROOT) {  in rn_walktree()