2 * Copyright (c) 1988, 1989, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * @(#)radix.c 8.4 (Berkeley) 11/2/94
37 * Routines to build and maintain radix trees for routing lookups.
40 #include <sys/param.h>
42 #include <sys/systm.h>
43 #include <sys/malloc.h>
44 #define M_DONTWAIT M_NOWAIT
45 #include <sys/domain.h>
49 #include <sys/syslog.h>
50 #include <net/radix.h>
55 struct radix_mask
*rn_mkfreelist
;
56 struct radix_node_head
*mask_rnhead
;
57 static char *addmask_key
;
58 static char normal_chars
[] = {0, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, -1};
59 static char *rn_zeros
, *rn_ones
;
61 #define rn_masktop (mask_rnhead->rnh_treetop)
63 #define Bcmp(a, b, l) (l == 0 ? 0 : bcmp((caddr_t)(a), (caddr_t)(b), (u_long)l))
65 * The data structure for the keys is a radix tree with one way
66 * branching removed. The index rn_b at an internal node n represents a bit
67 * position to be tested. The tree is arranged so that all descendants
68 * of a node n have keys whose bits all agree up to position rn_b - 1.
69 * (We say the index of n is rn_b.)
71 * There is at least one descendant which has a one bit at position rn_b,
72 * and at least one with a zero there.
74 * A route is determined by a pair of key and mask. We require that the
75 * bit-wise logical and of the key and mask to be the key.
76 * We define the index of a route to associated with the mask to be
77 * the first bit number in the mask where 0 occurs (with bit number 0
78 * representing the highest order bit).
80 * We say a mask is normal if every bit is 0, past the index of the mask.
81 * If a node n has a descendant (k, m) with index(m) == index(n) == rn_b,
82 * and m is a normal mask, then the route applies to every descendant of n.
83 * If the index(m) < rn_b, this implies the trailing last few bits of k
84 * before bit b are all 0, (and hence consequently true of every descendant
85 * of n), so the route applies to all descendants of the node as well.
87 * Similar logic shows that a non-normal mask m such that
88 * index(m) <= index(n) could potentially apply to many children of n.
89 * Thus, for each non-host route, we attach its mask to a list at an internal
90 * node as high in the tree as we can go.
92 * The present version of the code makes use of normal routes in short-
93 * circuiting an explict mask and compare operation when testing whether
94 * a key satisfies a normal route, and also in remembering the unique leaf
95 * that governs a subtree.
99 rn_search(v_arg
, head
)
101 struct radix_node
*head
;
103 register struct radix_node
*x
;
106 for (x
= head
, v
= v_arg
; x
->rn_b
>= 0;) {
107 if (x
->rn_bmask
& v
[x
->rn_off
])
116 rn_search_m(v_arg
, head
, m_arg
)
117 struct radix_node
*head
;
120 register struct radix_node
*x
;
121 register caddr_t v
= v_arg
, m
= m_arg
;
123 for (x
= head
; x
->rn_b
>= 0;) {
124 if ((x
->rn_bmask
& m
[x
->rn_off
]) &&
125 (x
->rn_bmask
& v
[x
->rn_off
]))
134 rn_refines(m_arg
, n_arg
)
137 register caddr_t m
= m_arg
, n
= n_arg
;
138 register caddr_t lim
, lim2
= lim
= n
+ *(u_char
*)n
;
139 int longer
= (*(u_char
*)n
++) - (int)(*(u_char
*)m
++);
140 int masks_are_equal
= 1;
153 if (masks_are_equal
&& (longer
< 0))
154 for (lim2
= m
- longer
; m
< lim2
; )
157 return (!masks_are_equal
);
161 rn_lookup(v_arg
, m_arg
, head
)
163 struct radix_node_head
*head
;
165 register struct radix_node
*x
;
169 if ((x
= rn_addmask(m_arg
, 1, head
->rnh_treetop
->rn_off
)) == 0)
173 x
= rn_match(v_arg
, head
);
175 while (x
&& x
->rn_mask
!= netmask
)
182 rn_satsifies_leaf(trial
, leaf
, skip
)
184 register struct radix_node
*leaf
;
187 register char *cp
= trial
, *cp2
= leaf
->rn_key
, *cp3
= leaf
->rn_mask
;
189 int length
= min(*(u_char
*)cp
, *(u_char
*)cp2
);
194 length
= min(length
, *(u_char
*)cp3
);
195 cplim
= cp
+ length
; cp3
+= skip
; cp2
+= skip
;
196 for (cp
+= skip
; cp
< cplim
; cp
++, cp2
++, cp3
++)
197 if ((*cp
^ *cp2
) & *cp3
)
203 rn_match(v_arg
, head
)
205 struct radix_node_head
*head
;
208 register struct radix_node
*t
= head
->rnh_treetop
, *x
;
209 register caddr_t cp
= v
, cp2
;
211 struct radix_node
*saved_t
, *top
= t
;
212 int off
= t
->rn_off
, vlen
= *(u_char
*)cp
, matched_off
;
213 register int test
, b
, rn_b
;
216 * Open code rn_search(v, top) to avoid overhead of extra
219 for (; t
->rn_b
>= 0; ) {
220 if (t
->rn_bmask
& cp
[t
->rn_off
])
226 * See if we match exactly as a host destination
227 * or at least learn how many bits match, for normal mask finesse.
229 * It doesn't hurt us to limit how many bytes to check
230 * to the length of the mask, since if it matches we had a genuine
231 * match and the leaf we have is the most specific one anyway;
232 * if it didn't match with a shorter length it would fail
233 * with a long one. This wins big for class B&C netmasks which
234 * are probably the most common case...
237 vlen
= *(u_char
*)t
->rn_mask
;
238 cp
+= off
; cp2
= t
->rn_key
+ off
; cplim
= v
+ vlen
;
239 for (; cp
< cplim
; cp
++, cp2
++)
243 * This extra grot is in case we are explicitly asked
244 * to look up the default. Ugh!
246 if ((t
->rn_flags
& RNF_ROOT
) && t
->rn_dupedkey
)
250 test
= (*cp
^ *cp2
) & 0xff; /* find first bit that differs */
251 for (b
= 7; (test
>>= 1) > 0;)
253 matched_off
= cp
- v
;
254 b
+= matched_off
<< 3;
257 * If there is a host route in a duped-key chain, it will be first.
259 if ((saved_t
= t
)->rn_mask
== 0)
261 for (; t
; t
= t
->rn_dupedkey
)
263 * Even if we don't match exactly as a host,
264 * we may match if the leaf we wound up at is
267 if (t
->rn_flags
& RNF_NORMAL
) {
270 } else if (rn_satsifies_leaf(v
, t
, matched_off
))
273 /* start searching up the tree */
275 register struct radix_mask
*m
;
280 * If non-contiguous masks ever become important
281 * we can restore the masking and open coding of
282 * the search and satisfaction test and put the
283 * calculation of "off" back before the "do".
286 if (m
->rm_flags
& RNF_NORMAL
) {
290 off
= min(t
->rn_off
, matched_off
);
291 x
= rn_search_m(v
, t
, m
->rm_mask
);
292 while (x
&& x
->rn_mask
!= m
->rm_mask
)
294 if (x
&& rn_satsifies_leaf(v
, x
, off
))
306 struct radix_node
*rn_clist
;
312 rn_newpair(v
, b
, nodes
)
315 struct radix_node nodes
[2];
317 register struct radix_node
*tt
= nodes
, *t
= tt
+ 1;
318 t
->rn_b
= b
; t
->rn_bmask
= 0x80 >> (b
& 7);
319 t
->rn_l
= tt
; t
->rn_off
= b
>> 3;
320 tt
->rn_b
= -1; tt
->rn_key
= (caddr_t
)v
; tt
->rn_p
= t
;
321 tt
->rn_flags
= t
->rn_flags
= RNF_ACTIVE
;
323 tt
->rn_info
= rn_nodenum
++; t
->rn_info
= rn_nodenum
++;
324 tt
->rn_twin
= t
; tt
->rn_ybro
= rn_clist
; rn_clist
= tt
;
330 rn_insert(v_arg
, head
, dupentry
, nodes
)
332 struct radix_node_head
*head
;
334 struct radix_node nodes
[2];
337 struct radix_node
*top
= head
->rnh_treetop
;
338 int head_off
= top
->rn_off
, vlen
= (int)*((u_char
*)v
);
339 register struct radix_node
*t
= rn_search(v_arg
, top
);
340 register caddr_t cp
= v
+ head_off
;
342 struct radix_node
*tt
;
344 * Find first bit at which v and t->rn_key differ
347 register caddr_t cp2
= t
->rn_key
+ head_off
;
348 register int cmp_res
;
349 caddr_t cplim
= v
+ vlen
;
358 cmp_res
= (cp
[-1] ^ cp2
[-1]) & 0xff;
359 for (b
= (cp
- v
) << 3; cmp_res
; b
--)
363 register struct radix_node
*p
, *x
= top
;
367 if (cp
[x
->rn_off
] & x
->rn_bmask
)
370 } while (b
> (unsigned) x
->rn_b
); /* x->rn_b < b && x->rn_b >= 0 */
373 log(LOG_DEBUG
, "rn_insert: Going In:\n"), traverse(p
);
375 t
= rn_newpair(v_arg
, b
, nodes
); tt
= t
->rn_l
;
376 if ((cp
[p
->rn_off
] & p
->rn_bmask
) == 0)
380 x
->rn_p
= t
; t
->rn_p
= p
; /* frees x, p as temp vars below */
381 if ((cp
[t
->rn_off
] & t
->rn_bmask
) == 0) {
384 t
->rn_r
= tt
; t
->rn_l
= x
;
388 log(LOG_DEBUG
, "rn_insert: Coming Out:\n"), traverse(p
);
395 rn_addmask(n_arg
, search
, skip
)
399 caddr_t netmask
= (caddr_t
)n_arg
;
400 register struct radix_node
*x
;
401 register caddr_t cp
, cplim
;
402 register int b
= 0, mlen
, j
;
403 int maskduplicated
, m0
, isnormal
;
404 struct radix_node
*saved_x
;
405 static int last_zeroed
= 0;
407 if ((mlen
= *(u_char
*)netmask
) > max_keylen
)
412 return (mask_rnhead
->rnh_nodes
);
414 Bcopy(rn_ones
+ 1, addmask_key
+ 1, skip
- 1);
415 if ((m0
= mlen
) > skip
)
416 Bcopy(netmask
+ skip
, addmask_key
+ skip
, mlen
- skip
);
418 * Trim trailing zeroes.
420 for (cp
= addmask_key
+ mlen
; (cp
> addmask_key
) && cp
[-1] == 0;)
422 mlen
= cp
- addmask_key
;
424 if (m0
>= last_zeroed
)
426 return (mask_rnhead
->rnh_nodes
);
428 if (m0
< last_zeroed
)
429 Bzero(addmask_key
+ m0
, last_zeroed
- m0
);
430 *addmask_key
= last_zeroed
= mlen
;
431 x
= rn_search(addmask_key
, rn_masktop
);
432 if (Bcmp(addmask_key
, x
->rn_key
, mlen
) != 0)
436 R_Malloc(x
, struct radix_node
*, max_keylen
+ 2 * sizeof (*x
));
437 if ((saved_x
= x
) == 0)
439 Bzero(x
, max_keylen
+ 2 * sizeof (*x
));
440 netmask
= cp
= (caddr_t
)(x
+ 2);
441 Bcopy(addmask_key
, cp
, mlen
);
442 x
= rn_insert(cp
, mask_rnhead
, &maskduplicated
, x
);
443 if (maskduplicated
) {
444 log(LOG_ERR
, "rn_addmask: mask impossibly already in tree");
449 * Calculate index of mask, and check for normalcy.
451 cplim
= netmask
+ mlen
; isnormal
= 1;
452 for (cp
= netmask
+ skip
; (cp
< cplim
) && *(u_char
*)cp
== 0xff;)
455 for (j
= 0x80; (j
& *cp
) != 0; j
>>= 1)
457 if (*cp
!= normal_chars
[b
] || cp
!= (cplim
- 1))
460 b
+= (cp
- netmask
) << 3;
463 x
->rn_flags
|= RNF_NORMAL
;
467 static int /* XXX: arbitrary ordering for non-contiguous masks */
468 rn_lexobetter(m_arg
, n_arg
)
471 register u_char
*mp
= m_arg
, *np
= n_arg
, *lim
;
474 return 1; /* not really, but need to check longer one first */
476 for (lim
= mp
+ *mp
; mp
< lim
;)
482 static struct radix_mask
*
483 rn_new_radix_mask(tt
, next
)
484 register struct radix_node
*tt
;
485 register struct radix_mask
*next
;
487 register struct radix_mask
*m
;
491 log(LOG_ERR
, "Mask for route not entered\n");
496 m
->rm_flags
= tt
->rn_flags
;
497 if (tt
->rn_flags
& RNF_NORMAL
)
500 m
->rm_mask
= tt
->rn_mask
;
507 rn_addroute(v_arg
, n_arg
, head
, treenodes
)
509 struct radix_node_head
*head
;
510 struct radix_node treenodes
[2];
512 caddr_t v
= (caddr_t
)v_arg
, netmask
= (caddr_t
)n_arg
;
513 register struct radix_node
*t
, *x
= 0, *tt
;
514 struct radix_node
*saved_tt
, *top
= head
->rnh_treetop
;
515 short b
= 0, b_leaf
= 0;
518 struct radix_mask
*m
, **mp
;
521 * In dealing with non-contiguous masks, there may be
522 * many different routes which have the same mask.
523 * We will find it useful to have a unique pointer to
524 * the mask to speed avoiding duplicate references at
525 * nodes and possibly save time in calculating indices.
528 if ((x
= rn_addmask(netmask
, 0, top
->rn_off
)) == 0)
535 * Deal with duplicated keys: attach node to previous instance
537 saved_tt
= tt
= rn_insert(v
, head
, &keyduplicated
, treenodes
);
539 for (t
= tt
; tt
; t
= tt
, tt
= tt
->rn_dupedkey
) {
540 if (tt
->rn_mask
== netmask
)
544 ((b_leaf
< tt
->rn_b
) || /* index(netmask) > node */
545 rn_refines(netmask
, tt
->rn_mask
) ||
546 rn_lexobetter(netmask
, tt
->rn_mask
))))
550 * If the mask is not duplicated, we wouldn't
551 * find it among possible duplicate key entries
552 * anyway, so the above test doesn't hurt.
554 * We sort the masks for a duplicated key the same way as
555 * in a masklist -- most specific to least specific.
556 * This may require the unfortunate nuisance of relocating
557 * the head of the list.
559 if (tt
== saved_tt
) {
560 struct radix_node
*xx
= x
;
561 /* link in at head of list */
562 (tt
= treenodes
)->rn_dupedkey
= t
;
563 tt
->rn_flags
= t
->rn_flags
;
564 tt
->rn_p
= x
= t
->rn_p
;
565 t
->rn_p
= tt
; /* parent */
566 if (x
->rn_l
== t
) x
->rn_l
= tt
; else x
->rn_r
= tt
;
567 saved_tt
= tt
; x
= xx
;
569 (tt
= treenodes
)->rn_dupedkey
= t
->rn_dupedkey
;
571 tt
->rn_p
= t
; /* parent */
572 if (tt
->rn_dupedkey
) /* parent */
573 tt
->rn_dupedkey
->rn_p
= tt
; /* parent */
576 t
=tt
+1; tt
->rn_info
= rn_nodenum
++; t
->rn_info
= rn_nodenum
++;
577 tt
->rn_twin
= t
; tt
->rn_ybro
= rn_clist
; rn_clist
= tt
;
579 tt
->rn_key
= (caddr_t
) v
;
581 tt
->rn_flags
= RNF_ACTIVE
;
587 tt
->rn_mask
= netmask
;
589 tt
->rn_flags
|= x
->rn_flags
& RNF_NORMAL
;
594 b_leaf
= -1 - t
->rn_b
;
595 if (t
->rn_r
== saved_tt
) x
= t
->rn_l
; else x
= t
->rn_r
;
596 /* Promote general routes from below */
598 for (mp
= &t
->rn_mklist
; x
; x
= x
->rn_dupedkey
)
599 if (x
->rn_mask
&& (x
->rn_b
>= b_leaf
) && x
->rn_mklist
== 0) {
600 *mp
= m
= rn_new_radix_mask(x
, 0);
604 } else if (x
->rn_mklist
) {
606 * Skip over masks whose index is > that of new node
608 for (mp
= &x
->rn_mklist
; (m
= *mp
); mp
= &m
->rm_mklist
)
609 if (m
->rm_b
>= b_leaf
)
611 t
->rn_mklist
= m
; *mp
= 0;
614 /* Add new route to highest possible ancestor's list */
615 if ((netmask
== 0) || (b
> t
->rn_b
))
616 return tt
; /* can't lift at all */
621 } while (b
<= t
->rn_b
&& x
!= top
);
623 * Search through routes associated with node to
624 * insert new route according to index.
625 * Need same criteria as when sorting dupedkeys to avoid
626 * double loop on deletion.
628 for (mp
= &x
->rn_mklist
; (m
= *mp
); mp
= &m
->rm_mklist
) {
629 if (m
->rm_b
< b_leaf
)
631 if (m
->rm_b
> b_leaf
)
633 if (m
->rm_flags
& RNF_NORMAL
) {
634 mmask
= m
->rm_leaf
->rn_mask
;
635 if (tt
->rn_flags
& RNF_NORMAL
) {
637 "Non-unique normal route, mask not entered");
642 if (mmask
== netmask
) {
647 if (rn_refines(netmask
, mmask
) || rn_lexobetter(netmask
, mmask
))
650 *mp
= rn_new_radix_mask(tt
, *mp
);
655 rn_delete(v_arg
, netmask_arg
, head
)
656 void *v_arg
, *netmask_arg
;
657 struct radix_node_head
*head
;
659 register struct radix_node
*t
, *p
, *x
, *tt
;
660 struct radix_mask
*m
, *saved_m
, **mp
;
661 struct radix_node
*dupedkey
, *saved_tt
, *top
;
663 int b
, head_off
, vlen
;
666 netmask
= netmask_arg
;
667 x
= head
->rnh_treetop
;
668 tt
= rn_search(v
, x
);
669 head_off
= x
->rn_off
;
674 Bcmp(v
+ head_off
, tt
->rn_key
+ head_off
, vlen
- head_off
))
677 * Delete our route from mask lists.
680 if ((x
= rn_addmask(netmask
, 1, head_off
)) == 0)
683 while (tt
->rn_mask
!= netmask
)
684 if ((tt
= tt
->rn_dupedkey
) == 0)
687 if (tt
->rn_mask
== 0 || (saved_m
= m
= tt
->rn_mklist
) == 0)
689 if (tt
->rn_flags
& RNF_NORMAL
) {
690 if (m
->rm_leaf
!= tt
|| m
->rm_refs
> 0) {
691 log(LOG_ERR
, "rn_delete: inconsistent annotation\n");
692 return 0; /* dangling ref could cause disaster */
695 if (m
->rm_mask
!= tt
->rn_mask
) {
696 log(LOG_ERR
, "rn_delete: inconsistent annotation\n");
699 if (--m
->rm_refs
>= 0)
705 goto on1
; /* Wasn't lifted at all */
709 } while (b
<= t
->rn_b
&& x
!= top
);
710 for (mp
= &x
->rn_mklist
; (m
= *mp
); mp
= &m
->rm_mklist
)
717 log(LOG_ERR
, "rn_delete: couldn't find our annotation\n");
718 if (tt
->rn_flags
& RNF_NORMAL
)
719 return (0); /* Dangling ref to us */
723 * Eliminate us from tree
725 if (tt
->rn_flags
& RNF_ROOT
)
728 /* Get us out of the creation list */
729 for (t
= rn_clist
; t
&& t
->rn_ybro
!= tt
; t
= t
->rn_ybro
) {}
730 if (t
) t
->rn_ybro
= tt
->rn_ybro
;
733 dupedkey
= saved_tt
->rn_dupedkey
;
736 * at this point, tt is the deletion target and saved_tt
737 * is the head of the dupekey chain
739 if (tt
== saved_tt
) {
740 /* remove from head of chain */
741 x
= dupedkey
; x
->rn_p
= t
;
742 if (t
->rn_l
== tt
) t
->rn_l
= x
; else t
->rn_r
= x
;
744 /* find node in front of tt on the chain */
745 for (x
= p
= saved_tt
; p
&& p
->rn_dupedkey
!= tt
;)
748 p
->rn_dupedkey
= tt
->rn_dupedkey
;
749 if (tt
->rn_dupedkey
) /* parent */
750 tt
->rn_dupedkey
->rn_p
= p
; /* parent */
751 } else log(LOG_ERR
, "rn_delete: couldn't find us\n");
754 if (t
->rn_flags
& RNF_ACTIVE
) {
756 *++x
= *t
; p
= t
->rn_p
;
758 b
= t
->rn_info
; *++x
= *t
; t
->rn_info
= b
; p
= t
->rn_p
;
760 if (p
->rn_l
== t
) p
->rn_l
= x
; else p
->rn_r
= x
;
761 x
->rn_l
->rn_p
= x
; x
->rn_r
->rn_p
= x
;
765 if (t
->rn_l
== tt
) x
= t
->rn_r
; else x
= t
->rn_l
;
767 if (p
->rn_r
== t
) p
->rn_r
= x
; else p
->rn_l
= x
;
770 * Demote routes attached to us.
774 for (mp
= &x
->rn_mklist
; (m
= *mp
);)
778 /* If there are any key,mask pairs in a sibling
779 duped-key chain, some subset will appear sorted
780 in the same order attached to our mklist */
781 for (m
= t
->rn_mklist
; m
&& x
; x
= x
->rn_dupedkey
)
782 if (m
== x
->rn_mklist
) {
783 struct radix_mask
*mm
= m
->rm_mklist
;
785 if (--(m
->rm_refs
) < 0)
790 log(LOG_ERR
, "%s %p at %x\n",
791 "rn_delete: Orphaned Mask", m
, x
);
795 * We may be holding an active internal node in the tree.
802 b
= t
->rn_info
; *t
= *x
; t
->rn_info
= b
;
804 t
->rn_l
->rn_p
= t
; t
->rn_r
->rn_p
= t
;
806 if (p
->rn_l
== x
) p
->rn_l
= t
; else p
->rn_r
= t
;
809 tt
->rn_flags
&= ~RNF_ACTIVE
;
810 tt
[1].rn_flags
&= ~RNF_ACTIVE
;
815 * This is the same as rn_walktree() except for the parameters and the
819 rn_walktree_from(h
, a
, m
, f
, w
)
820 struct radix_node_head
*h
;
826 struct radix_node
*base
, *next
;
827 u_char
*xa
= (u_char
*)a
;
828 u_char
*xm
= (u_char
*)m
;
829 register struct radix_node
*rn
, *last
= 0 /* shut up gcc */;
834 * rn_search_m is sort-of-open-coded here.
836 /* printf("about to search\n"); */
837 for (rn
= h
->rnh_treetop
; rn
->rn_b
>= 0; ) {
839 /* printf("rn_b %d, rn_bmask %x, xm[rn_off] %x\n",
840 rn->rn_b, rn->rn_bmask, xm[rn->rn_off]); */
841 if (!(rn
->rn_bmask
& xm
[rn
->rn_off
])) {
844 if (rn
->rn_bmask
& xa
[rn
->rn_off
]) {
850 /* printf("done searching\n"); */
853 * Two cases: either we stepped off the end of our mask,
854 * in which case last == rn, or we reached a leaf, in which
855 * case we want to start from the last node we looked at.
856 * Either way, last is the node we want to start from.
861 /* printf("rn %p, lastb %d\n", rn, lastb);*/
864 * This gets complicated because we may delete the node
865 * while applying the function f to it, so we need to calculate
866 * the successor node in advance.
868 while (rn
->rn_b
>= 0)
872 /* printf("node %p (%d)\n", rn, rn->rn_b); */
874 /* If at right child go back up, otherwise, go right */
875 while (rn
->rn_p
->rn_r
== rn
&& !(rn
->rn_flags
& RNF_ROOT
)) {
878 /* if went up beyond last, stop */
879 if (rn
->rn_b
< lastb
) {
881 /* printf("up too far\n"); */
885 /* Find the next *leaf* since next node might vanish, too */
886 for (rn
= rn
->rn_p
->rn_r
; rn
->rn_b
>= 0;)
890 while ((rn
= base
) != 0) {
891 base
= rn
->rn_dupedkey
;
892 /* printf("leaf %p\n", rn); */
893 if (!(rn
->rn_flags
& RNF_ROOT
)
894 && (error
= (*f
)(rn
, w
)))
899 if (rn
->rn_flags
& RNF_ROOT
) {
900 /* printf("root, stopping"); */
910 struct radix_node_head
*h
;
915 struct radix_node
*base
, *next
;
916 register struct radix_node
*rn
= h
->rnh_treetop
;
918 * This gets complicated because we may delete the node
919 * while applying the function f to it, so we need to calculate
920 * the successor node in advance.
922 /* First time through node, go left */
923 while (rn
->rn_b
>= 0)
927 /* If at right child go back up, otherwise, go right */
928 while (rn
->rn_p
->rn_r
== rn
&& (rn
->rn_flags
& RNF_ROOT
) == 0)
930 /* Find the next *leaf* since next node might vanish, too */
931 for (rn
= rn
->rn_p
->rn_r
; rn
->rn_b
>= 0;)
935 while ((rn
= base
)) {
936 base
= rn
->rn_dupedkey
;
937 if (!(rn
->rn_flags
& RNF_ROOT
) && (error
= (*f
)(rn
, w
)))
941 if (rn
->rn_flags
& RNF_ROOT
)
948 rn_inithead(head
, off
)
952 register struct radix_node_head
*rnh
;
953 register struct radix_node
*t
, *tt
, *ttt
;
956 R_Malloc(rnh
, struct radix_node_head
*, sizeof (*rnh
));
959 Bzero(rnh
, sizeof (*rnh
));
961 t
= rn_newpair(rn_zeros
, off
, rnh
->rnh_nodes
);
962 ttt
= rnh
->rnh_nodes
+ 2;
966 tt
->rn_flags
= t
->rn_flags
= RNF_ROOT
| RNF_ACTIVE
;
969 ttt
->rn_key
= rn_ones
;
970 rnh
->rnh_addaddr
= rn_addroute
;
971 rnh
->rnh_deladdr
= rn_delete
;
972 rnh
->rnh_matchaddr
= rn_match
;
973 rnh
->rnh_lookup
= rn_lookup
;
974 rnh
->rnh_walktree
= rn_walktree
;
975 rnh
->rnh_walktree_from
= rn_walktree_from
;
976 rnh
->rnh_treetop
= t
;
987 for (dom
= domains
; dom
; dom
= dom
->dom_next
)
988 if (dom
->dom_maxrtkey
> max_keylen
)
989 max_keylen
= dom
->dom_maxrtkey
;
991 if (max_keylen
== 0) {
993 "rn_init: radix functions require max_keylen be set\n");
996 R_Malloc(rn_zeros
, char *, 3 * max_keylen
);
997 if (rn_zeros
== NULL
)
999 Bzero(rn_zeros
, 3 * max_keylen
);
1000 rn_ones
= cp
= rn_zeros
+ max_keylen
;
1001 addmask_key
= cplim
= rn_ones
+ max_keylen
;
1004 if (rn_inithead((void **)&mask_rnhead
, 0) == 0)