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.5 (Berkeley) 5/19/95
38 * Routines to build and maintain radix trees for routing lookups.
41 #include <sys/param.h>
44 #include <sys/mutex.h>
45 #include <sys/systm.h>
46 #include <sys/malloc.h>
47 #include <sys/domain.h>
51 #include <sys/syslog.h>
52 #include <net/radix.h>
55 static int rn_walktree_from(struct radix_node_head *h, void *a, void *m,
56 walktree_f_t *f, void *w);
57 static int rn_walktree(struct radix_node_head *, walktree_f_t *, void *);
58 static struct radix_node
59 *rn_insert(void *, struct radix_node_head *, int *,
60 struct radix_node [2]),
61 *rn_newpair(void *, int, struct radix_node[2]),
62 *rn_search(void *, struct radix_node *),
63 *rn_search_m(void *, struct radix_node *, void *);
65 static int max_keylen;
66 static struct radix_mask *rn_mkfreelist;
67 static struct radix_node_head *mask_rnhead;
68 static char *addmask_key;
69 static char normal_chars[] = {0, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, -1};
70 static char *rn_zeros, *rn_ones;
72 #define rn_masktop (mask_rnhead->rnh_treetop)
74 #define Bcmp(a, b, l) \
75 ((l) == 0 ? 0 : bcmp((caddr_t)(a), (caddr_t)(b), (u_long)(l)))
77 static int rn_lexobetter(void *m_arg, void *n_arg);
78 static struct radix_mask *
79 rn_new_radix_mask(struct radix_node *tt,
80 struct radix_mask *next);
81 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf,
85 * The data structure for the keys is a radix tree with one way
86 * branching removed. The index rn_bit at an internal node n represents a bit
87 * position to be tested. The tree is arranged so that all descendants
88 * of a node n have keys whose bits all agree up to position rn_bit - 1.
89 * (We say the index of n is rn_bit.)
91 * There is at least one descendant which has a one bit at position rn_bit,
92 * and at least one with a zero there.
94 * A route is determined by a pair of key and mask. We require that the
95 * bit-wise logical and of the key and mask to be the key.
96 * We define the index of a route to associated with the mask to be
97 * the first bit number in the mask where 0 occurs (with bit number 0
98 * representing the highest order bit).
100 * We say a mask is normal if every bit is 0, past the index of the mask.
101 * If a node n has a descendant (k, m) with index(m) == index(n) == rn_bit,
102 * and m is a normal mask, then the route applies to every descendant of n.
103 * If the index(m) < rn_bit, this implies the trailing last few bits of k
104 * before bit b are all 0, (and hence consequently true of every descendant
105 * of n), so the route applies to all descendants of the node as well.
107 * Similar logic shows that a non-normal mask m such that
108 * index(m) <= index(n) could potentially apply to many children of n.
109 * Thus, for each non-host route, we attach its mask to a list at an internal
110 * node as high in the tree as we can go.
112 * The present version of the code makes use of normal routes in short-
113 * circuiting an explict mask and compare operation when testing whether
114 * a key satisfies a normal route, and also in remembering the unique leaf
115 * that governs a subtree.
118 static struct radix_node *
119 rn_search(v_arg, head)
121 struct radix_node *head;
123 register struct radix_node *x;
126 for (x = head, v = v_arg; x->rn_bit >= 0;) {
127 if (x->rn_bmask & v[x->rn_offset])
135 static struct radix_node *
136 rn_search_m(v_arg, head, m_arg)
137 struct radix_node *head;
140 register struct radix_node *x;
141 register caddr_t v = v_arg, m = m_arg;
143 for (x = head; x->rn_bit >= 0;) {
144 if ((x->rn_bmask & m[x->rn_offset]) &&
145 (x->rn_bmask & v[x->rn_offset]))
154 rn_refines(m_arg, n_arg)
157 register caddr_t m = m_arg, n = n_arg;
158 register caddr_t lim, lim2 = lim = n + *(u_char *)n;
159 int longer = (*(u_char *)n++) - (int)(*(u_char *)m++);
160 int masks_are_equal = 1;
173 if (masks_are_equal && (longer < 0))
174 for (lim2 = m - longer; m < lim2; )
177 return (!masks_are_equal);
181 rn_lookup(v_arg, m_arg, head)
183 struct radix_node_head *head;
185 register struct radix_node *x;
189 x = rn_addmask(m_arg, 1, head->rnh_treetop->rn_offset);
194 x = rn_match(v_arg, head);
196 while (x && x->rn_mask != netmask)
203 rn_satisfies_leaf(trial, leaf, skip)
205 register struct radix_node *leaf;
208 register char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
210 int length = min(*(u_char *)cp, *(u_char *)cp2);
215 length = min(length, *(u_char *)cp3);
216 cplim = cp + length; cp3 += skip; cp2 += skip;
217 for (cp += skip; cp < cplim; cp++, cp2++, cp3++)
218 if ((*cp ^ *cp2) & *cp3)
224 rn_match(v_arg, head)
226 struct radix_node_head *head;
229 register struct radix_node *t = head->rnh_treetop, *x;
230 register caddr_t cp = v, cp2;
232 struct radix_node *saved_t, *top = t;
233 int off = t->rn_offset, vlen = *(u_char *)cp, matched_off;
234 register int test, b, rn_bit;
237 * Open code rn_search(v, top) to avoid overhead of extra
240 for (; t->rn_bit >= 0; ) {
241 if (t->rn_bmask & cp[t->rn_offset])
247 * See if we match exactly as a host destination
248 * or at least learn how many bits match, for normal mask finesse.
250 * It doesn't hurt us to limit how many bytes to check
251 * to the length of the mask, since if it matches we had a genuine
252 * match and the leaf we have is the most specific one anyway;
253 * if it didn't match with a shorter length it would fail
254 * with a long one. This wins big for class B&C netmasks which
255 * are probably the most common case...
258 vlen = *(u_char *)t->rn_mask;
259 cp += off; cp2 = t->rn_key + off; cplim = v + vlen;
260 for (; cp < cplim; cp++, cp2++)
264 * This extra grot is in case we are explicitly asked
265 * to look up the default. Ugh!
267 * Never return the root node itself, it seems to cause a
270 if (t->rn_flags & RNF_ROOT)
274 test = (*cp ^ *cp2) & 0xff; /* find first bit that differs */
275 for (b = 7; (test >>= 1) > 0;)
277 matched_off = cp - v;
278 b += matched_off << 3;
281 * If there is a host route in a duped-key chain, it will be first.
283 if ((saved_t = t)->rn_mask == 0)
285 for (; t; t = t->rn_dupedkey)
287 * Even if we don't match exactly as a host,
288 * we may match if the leaf we wound up at is
291 if (t->rn_flags & RNF_NORMAL) {
292 if (rn_bit <= t->rn_bit)
294 } else if (rn_satisfies_leaf(v, t, matched_off))
297 /* start searching up the tree */
299 register struct radix_mask *m;
303 * If non-contiguous masks ever become important
304 * we can restore the masking and open coding of
305 * the search and satisfaction test and put the
306 * calculation of "off" back before the "do".
309 if (m->rm_flags & RNF_NORMAL) {
310 if (rn_bit <= m->rm_bit)
313 off = min(t->rn_offset, matched_off);
314 x = rn_search_m(v, t, m->rm_mask);
315 while (x && x->rn_mask != m->rm_mask)
317 if (x && rn_satisfies_leaf(v, x, off))
328 struct radix_node *rn_clist;
333 static struct radix_node *
334 rn_newpair(v, b, nodes)
337 struct radix_node nodes[2];
339 register struct radix_node *tt = nodes, *t = tt + 1;
341 t->rn_bmask = 0x80 >> (b & 7);
343 t->rn_offset = b >> 3;
345 tt->rn_key = (caddr_t)v;
347 tt->rn_flags = t->rn_flags = RNF_ACTIVE;
348 tt->rn_mklist = t->rn_mklist = 0;
350 tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++;
352 tt->rn_ybro = rn_clist;
358 static struct radix_node *
359 rn_insert(v_arg, head, dupentry, nodes)
361 struct radix_node_head *head;
363 struct radix_node nodes[2];
366 struct radix_node *top = head->rnh_treetop;
367 int head_off = top->rn_offset, vlen = (int)*((u_char *)v);
368 register struct radix_node *t = rn_search(v_arg, top);
369 register caddr_t cp = v + head_off;
371 struct radix_node *tt;
373 * Find first bit at which v and t->rn_key differ
376 register caddr_t cp2 = t->rn_key + head_off;
377 register int cmp_res;
378 caddr_t cplim = v + vlen;
387 cmp_res = (cp[-1] ^ cp2[-1]) & 0xff;
388 for (b = (cp - v) << 3; cmp_res; b--)
392 register struct radix_node *p, *x = top;
396 if (cp[x->rn_offset] & x->rn_bmask)
400 } while (b > (unsigned) x->rn_bit);
401 /* x->rn_bit < b && x->rn_bit >= 0 */
404 log(LOG_DEBUG, "rn_insert: Going In:\n"), traverse(p);
406 t = rn_newpair(v_arg, b, nodes);
408 if ((cp[p->rn_offset] & p->rn_bmask) == 0)
413 t->rn_parent = p; /* frees x, p as temp vars below */
414 if ((cp[t->rn_offset] & t->rn_bmask) == 0) {
422 log(LOG_DEBUG, "rn_insert: Coming Out:\n"), traverse(p);
429 rn_addmask(n_arg, search, skip)
433 caddr_t netmask = (caddr_t)n_arg;
434 register struct radix_node *x;
435 register caddr_t cp, cplim;
436 register int b = 0, mlen, j;
437 int maskduplicated, m0, isnormal;
438 struct radix_node *saved_x;
439 static int last_zeroed = 0;
441 if ((mlen = *(u_char *)netmask) > max_keylen)
446 return (mask_rnhead->rnh_nodes);
448 Bcopy(rn_ones + 1, addmask_key + 1, skip - 1);
449 if ((m0 = mlen) > skip)
450 Bcopy(netmask + skip, addmask_key + skip, mlen - skip);
452 * Trim trailing zeroes.
454 for (cp = addmask_key + mlen; (cp > addmask_key) && cp[-1] == 0;)
456 mlen = cp - addmask_key;
458 if (m0 >= last_zeroed)
460 return (mask_rnhead->rnh_nodes);
462 if (m0 < last_zeroed)
463 Bzero(addmask_key + m0, last_zeroed - m0);
464 *addmask_key = last_zeroed = mlen;
465 x = rn_search(addmask_key, rn_masktop);
466 if (Bcmp(addmask_key, x->rn_key, mlen) != 0)
470 R_Malloc(x, struct radix_node *, max_keylen + 2 * sizeof (*x));
471 if ((saved_x = x) == 0)
473 Bzero(x, max_keylen + 2 * sizeof (*x));
474 netmask = cp = (caddr_t)(x + 2);
475 Bcopy(addmask_key, cp, mlen);
476 x = rn_insert(cp, mask_rnhead, &maskduplicated, x);
477 if (maskduplicated) {
478 log(LOG_ERR, "rn_addmask: mask impossibly already in tree");
483 * Calculate index of mask, and check for normalcy.
485 cplim = netmask + mlen; isnormal = 1;
486 for (cp = netmask + skip; (cp < cplim) && *(u_char *)cp == 0xff;)
489 for (j = 0x80; (j & *cp) != 0; j >>= 1)
491 if (*cp != normal_chars[b] || cp != (cplim - 1))
494 b += (cp - netmask) << 3;
497 x->rn_flags |= RNF_NORMAL;
501 static int /* XXX: arbitrary ordering for non-contiguous masks */
502 rn_lexobetter(m_arg, n_arg)
505 register u_char *mp = m_arg, *np = n_arg, *lim;
508 return 1; /* not really, but need to check longer one first */
510 for (lim = mp + *mp; mp < lim;)
516 static struct radix_mask *
517 rn_new_radix_mask(tt, next)
518 register struct radix_node *tt;
519 register struct radix_mask *next;
521 register struct radix_mask *m;
525 log(LOG_ERR, "Mask for route not entered\n");
529 m->rm_bit = tt->rn_bit;
530 m->rm_flags = tt->rn_flags;
531 if (tt->rn_flags & RNF_NORMAL)
534 m->rm_mask = tt->rn_mask;
541 rn_addroute(v_arg, n_arg, head, treenodes)
543 struct radix_node_head *head;
544 struct radix_node treenodes[2];
546 caddr_t v = (caddr_t)v_arg, netmask = (caddr_t)n_arg;
547 register struct radix_node *t, *x = 0, *tt;
548 struct radix_node *saved_tt, *top = head->rnh_treetop;
549 short b = 0, b_leaf = 0;
552 struct radix_mask *m, **mp;
555 * In dealing with non-contiguous masks, there may be
556 * many different routes which have the same mask.
557 * We will find it useful to have a unique pointer to
558 * the mask to speed avoiding duplicate references at
559 * nodes and possibly save time in calculating indices.
562 if ((x = rn_addmask(netmask, 0, top->rn_offset)) == 0)
569 * Deal with duplicated keys: attach node to previous instance
571 saved_tt = tt = rn_insert(v, head, &keyduplicated, treenodes);
573 for (t = tt; tt; t = tt, tt = tt->rn_dupedkey) {
574 if (tt->rn_mask == netmask)
578 ((b_leaf < tt->rn_bit) /* index(netmask) > node */
579 || rn_refines(netmask, tt->rn_mask)
580 || rn_lexobetter(netmask, tt->rn_mask))))
584 * If the mask is not duplicated, we wouldn't
585 * find it among possible duplicate key entries
586 * anyway, so the above test doesn't hurt.
588 * We sort the masks for a duplicated key the same way as
589 * in a masklist -- most specific to least specific.
590 * This may require the unfortunate nuisance of relocating
591 * the head of the list.
593 * We also reverse, or doubly link the list through the
596 if (tt == saved_tt) {
597 struct radix_node *xx = x;
598 /* link in at head of list */
599 (tt = treenodes)->rn_dupedkey = t;
600 tt->rn_flags = t->rn_flags;
601 tt->rn_parent = x = t->rn_parent;
602 t->rn_parent = tt; /* parent */
607 saved_tt = tt; x = xx;
609 (tt = treenodes)->rn_dupedkey = t->rn_dupedkey;
611 tt->rn_parent = t; /* parent */
612 if (tt->rn_dupedkey) /* parent */
613 tt->rn_dupedkey->rn_parent = tt; /* parent */
616 t=tt+1; tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++;
617 tt->rn_twin = t; tt->rn_ybro = rn_clist; rn_clist = tt;
619 tt->rn_key = (caddr_t) v;
621 tt->rn_flags = RNF_ACTIVE;
627 tt->rn_mask = netmask;
628 tt->rn_bit = x->rn_bit;
629 tt->rn_flags |= x->rn_flags & RNF_NORMAL;
631 t = saved_tt->rn_parent;
634 b_leaf = -1 - t->rn_bit;
635 if (t->rn_right == saved_tt)
639 /* Promote general routes from below */
641 for (mp = &t->rn_mklist; x; x = x->rn_dupedkey)
642 if (x->rn_mask && (x->rn_bit >= b_leaf) && x->rn_mklist == 0) {
643 *mp = m = rn_new_radix_mask(x, 0);
647 } else if (x->rn_mklist) {
649 * Skip over masks whose index is > that of new node
651 for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist)
652 if (m->rm_bit >= b_leaf)
654 t->rn_mklist = m; *mp = 0;
657 /* Add new route to highest possible ancestor's list */
658 if ((netmask == 0) || (b > t->rn_bit ))
659 return tt; /* can't lift at all */
664 } while (b <= t->rn_bit && x != top);
666 * Search through routes associated with node to
667 * insert new route according to index.
668 * Need same criteria as when sorting dupedkeys to avoid
669 * double loop on deletion.
671 for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist) {
672 if (m->rm_bit < b_leaf)
674 if (m->rm_bit > b_leaf)
676 if (m->rm_flags & RNF_NORMAL) {
677 mmask = m->rm_leaf->rn_mask;
678 if (tt->rn_flags & RNF_NORMAL) {
680 "Non-unique normal route, mask not entered\n");
685 if (mmask == netmask) {
690 if (rn_refines(netmask, mmask)
691 || rn_lexobetter(netmask, mmask))
694 *mp = rn_new_radix_mask(tt, *mp);
699 rn_delete(v_arg, netmask_arg, head)
700 void *v_arg, *netmask_arg;
701 struct radix_node_head *head;
703 register struct radix_node *t, *p, *x, *tt;
704 struct radix_mask *m, *saved_m, **mp;
705 struct radix_node *dupedkey, *saved_tt, *top;
707 int b, head_off, vlen;
710 netmask = netmask_arg;
711 x = head->rnh_treetop;
712 tt = rn_search(v, x);
713 head_off = x->rn_offset;
718 Bcmp(v + head_off, tt->rn_key + head_off, vlen - head_off))
721 * Delete our route from mask lists.
724 if ((x = rn_addmask(netmask, 1, head_off)) == 0)
727 while (tt->rn_mask != netmask)
728 if ((tt = tt->rn_dupedkey) == 0)
731 if (tt->rn_mask == 0 || (saved_m = m = tt->rn_mklist) == 0)
733 if (tt->rn_flags & RNF_NORMAL) {
734 if (m->rm_leaf != tt || m->rm_refs > 0) {
735 log(LOG_ERR, "rn_delete: inconsistent annotation\n");
736 return 0; /* dangling ref could cause disaster */
739 if (m->rm_mask != tt->rn_mask) {
740 log(LOG_ERR, "rn_delete: inconsistent annotation\n");
743 if (--m->rm_refs >= 0)
747 t = saved_tt->rn_parent;
749 goto on1; /* Wasn't lifted at all */
753 } while (b <= t->rn_bit && x != top);
754 for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist)
761 log(LOG_ERR, "rn_delete: couldn't find our annotation\n");
762 if (tt->rn_flags & RNF_NORMAL)
763 return (0); /* Dangling ref to us */
767 * Eliminate us from tree
769 if (tt->rn_flags & RNF_ROOT)
772 /* Get us out of the creation list */
773 for (t = rn_clist; t && t->rn_ybro != tt; t = t->rn_ybro) {}
774 if (t) t->rn_ybro = tt->rn_ybro;
777 dupedkey = saved_tt->rn_dupedkey;
780 * Here, tt is the deletion target and
781 * saved_tt is the head of the dupekey chain.
783 if (tt == saved_tt) {
784 /* remove from head of chain */
785 x = dupedkey; x->rn_parent = t;
786 if (t->rn_left == tt)
791 /* find node in front of tt on the chain */
792 for (x = p = saved_tt; p && p->rn_dupedkey != tt;)
795 p->rn_dupedkey = tt->rn_dupedkey;
796 if (tt->rn_dupedkey) /* parent */
797 tt->rn_dupedkey->rn_parent = p;
799 } else log(LOG_ERR, "rn_delete: couldn't find us\n");
802 if (t->rn_flags & RNF_ACTIVE) {
816 x->rn_left->rn_parent = x;
817 x->rn_right->rn_parent = x;
821 if (t->rn_left == tt)
826 if (p->rn_right == t)
832 * Demote routes attached to us.
835 if (x->rn_bit >= 0) {
836 for (mp = &x->rn_mklist; (m = *mp);)
840 /* If there are any key,mask pairs in a sibling
841 duped-key chain, some subset will appear sorted
842 in the same order attached to our mklist */
843 for (m = t->rn_mklist; m && x; x = x->rn_dupedkey)
844 if (m == x->rn_mklist) {
845 struct radix_mask *mm = m->rm_mklist;
847 if (--(m->rm_refs) < 0)
853 "rn_delete: Orphaned Mask %p at %p\n",
854 (void *)m, (void *)x);
858 * We may be holding an active internal node in the tree.
869 t->rn_left->rn_parent = t;
870 t->rn_right->rn_parent = t;
878 tt->rn_flags &= ~RNF_ACTIVE;
879 tt[1].rn_flags &= ~RNF_ACTIVE;
884 * This is the same as rn_walktree() except for the parameters and the
888 rn_walktree_from(h, a, m, f, w)
889 struct radix_node_head *h;
895 struct radix_node *base, *next;
896 u_char *xa = (u_char *)a;
897 u_char *xm = (u_char *)m;
898 register struct radix_node *rn, *last = 0 /* shut up gcc */;
903 * rn_search_m is sort-of-open-coded here.
905 /* printf("about to search\n"); */
906 for (rn = h->rnh_treetop; rn->rn_bit >= 0; ) {
908 /* printf("rn_bit %d, rn_bmask %x, xm[rn_offset] %x\n",
909 rn->rn_bit, rn->rn_bmask, xm[rn->rn_offset]); */
910 if (!(rn->rn_bmask & xm[rn->rn_offset])) {
913 if (rn->rn_bmask & xa[rn->rn_offset]) {
919 /* printf("done searching\n"); */
922 * Two cases: either we stepped off the end of our mask,
923 * in which case last == rn, or we reached a leaf, in which
924 * case we want to start from the last node we looked at.
925 * Either way, last is the node we want to start from.
930 /* printf("rn %p, lastb %d\n", rn, lastb);*/
933 * This gets complicated because we may delete the node
934 * while applying the function f to it, so we need to calculate
935 * the successor node in advance.
937 while (rn->rn_bit >= 0)
941 /* printf("node %p (%d)\n", rn, rn->rn_bit); */
943 /* If at right child go back up, otherwise, go right */
944 while (rn->rn_parent->rn_right == rn
945 && !(rn->rn_flags & RNF_ROOT)) {
948 /* if went up beyond last, stop */
949 if (rn->rn_bit < lastb) {
951 /* printf("up too far\n"); */
955 /* Find the next *leaf* since next node might vanish, too */
956 for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)
960 while ((rn = base) != 0) {
961 base = rn->rn_dupedkey;
962 /* printf("leaf %p\n", rn); */
963 if (!(rn->rn_flags & RNF_ROOT)
964 && (error = (*f)(rn, w)))
969 if (rn->rn_flags & RNF_ROOT) {
970 /* printf("root, stopping"); */
980 struct radix_node_head *h;
985 struct radix_node *base, *next;
986 register struct radix_node *rn = h->rnh_treetop;
988 * This gets complicated because we may delete the node
989 * while applying the function f to it, so we need to calculate
990 * the successor node in advance.
992 /* First time through node, go left */
993 while (rn->rn_bit >= 0)
997 /* If at right child go back up, otherwise, go right */
998 while (rn->rn_parent->rn_right == rn
999 && (rn->rn_flags & RNF_ROOT) == 0)
1001 /* Find the next *leaf* since next node might vanish, too */
1002 for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)
1005 /* Process leaves */
1006 while ((rn = base)) {
1007 base = rn->rn_dupedkey;
1008 if (!(rn->rn_flags & RNF_ROOT)
1009 && (error = (*f)(rn, w)))
1013 if (rn->rn_flags & RNF_ROOT)
1020 rn_inithead(head, off)
1024 register struct radix_node_head *rnh;
1025 register struct radix_node *t, *tt, *ttt;
1028 R_Malloc(rnh, struct radix_node_head *, sizeof (*rnh));
1031 Bzero(rnh, sizeof (*rnh));
1033 RADIX_NODE_HEAD_LOCK_INIT(rnh);
1036 t = rn_newpair(rn_zeros, off, rnh->rnh_nodes);
1037 ttt = rnh->rnh_nodes + 2;
1041 tt->rn_flags = t->rn_flags = RNF_ROOT | RNF_ACTIVE;
1042 tt->rn_bit = -1 - off;
1044 ttt->rn_key = rn_ones;
1045 rnh->rnh_addaddr = rn_addroute;
1046 rnh->rnh_deladdr = rn_delete;
1047 rnh->rnh_matchaddr = rn_match;
1048 rnh->rnh_lookup = rn_lookup;
1049 rnh->rnh_walktree = rn_walktree;
1050 rnh->rnh_walktree_from = rn_walktree_from;
1051 rnh->rnh_treetop = t;
1062 for (dom = domains; dom; dom = dom->dom_next)
1063 if (dom->dom_maxrtkey > max_keylen)
1064 max_keylen = dom->dom_maxrtkey;
1066 if (max_keylen == 0) {
1068 "rn_init: radix functions require max_keylen be set\n");
1071 R_Malloc(rn_zeros, char *, 3 * max_keylen);
1072 if (rn_zeros == NULL)
1074 Bzero(rn_zeros, 3 * max_keylen);
1075 rn_ones = cp = rn_zeros + max_keylen;
1076 addmask_key = cplim = rn_ones + max_keylen;
1079 if (rn_inithead((void **)(void *)&mask_rnhead, 0) == 0)