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
34 * $FreeBSD: src/sys/net/radix.c,v 1.20.2.3 2002/04/28 05:40:25 suz Exp $
38 * 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 #include <sys/domain.h>
45 #include <sys/globaldata.h>
46 #include <sys/thread.h>
50 #include <sys/syslog.h>
51 #include <net/radix.h>
54 * The arguments to the radix functions are really counted byte arrays with
55 * the length in the first byte. struct sockaddr's fit this type structurally.
57 #define clen(c) (*(u_char *)(c))
59 static int rn_walktree_from(struct radix_node_head *h, char *a, char *m,
60 walktree_f_t *f, void *w);
61 static int rn_walktree(struct radix_node_head *, walktree_f_t *, void *);
63 static struct radix_node
64 *rn_insert(char *, struct radix_node_head *, boolean_t *,
65 struct radix_node [2]),
66 *rn_newpair(char *, int, struct radix_node[2]),
67 *rn_search(const char *, struct radix_node *),
68 *rn_search_m(const char *, struct radix_node *, const char *);
70 static struct radix_mask *rn_mkfreelist;
71 static struct radix_node_head *mask_rnheads[MAXCPU];
73 static char rn_zeros[RN_MAXKEYLEN];
74 static char rn_ones[RN_MAXKEYLEN] = RN_MAXKEYONES;
76 static int rn_lexobetter(char *m, char *n);
77 static struct radix_mask *
78 rn_new_radix_mask(struct radix_node *tt, struct radix_mask *nextmask);
80 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip);
82 static __inline struct radix_mask *
83 MKGet(struct radix_mask **l)
91 R_Malloc(m, struct radix_mask *, sizeof *m);
97 MKFree(struct radix_mask **l, struct radix_mask *m)
104 * The data structure for the keys is a radix tree with one way
105 * branching removed. The index rn_bit at an internal node n represents a bit
106 * position to be tested. The tree is arranged so that all descendants
107 * of a node n have keys whose bits all agree up to position rn_bit - 1.
108 * (We say the index of n is rn_bit.)
110 * There is at least one descendant which has a one bit at position rn_bit,
111 * and at least one with a zero there.
113 * A route is determined by a pair of key and mask. We require that the
114 * bit-wise logical and of the key and mask to be the key.
115 * We define the index of a route to associated with the mask to be
116 * the first bit number in the mask where 0 occurs (with bit number 0
117 * representing the highest order bit).
119 * We say a mask is normal if every bit is 0, past the index of the mask.
120 * If a node n has a descendant (k, m) with index(m) == index(n) == rn_bit,
121 * and m is a normal mask, then the route applies to every descendant of n.
122 * If the index(m) < rn_bit, this implies the trailing last few bits of k
123 * before bit b are all 0, (and hence consequently true of every descendant
124 * of n), so the route applies to all descendants of the node as well.
126 * Similar logic shows that a non-normal mask m such that
127 * index(m) <= index(n) could potentially apply to many children of n.
128 * Thus, for each non-host route, we attach its mask to a list at an internal
129 * node as high in the tree as we can go.
131 * The present version of the code makes use of normal routes in short-
132 * circuiting an explict mask and compare operation when testing whether
133 * a key satisfies a normal route, and also in remembering the unique leaf
134 * that governs a subtree.
137 static struct radix_node *
138 rn_search(const char *v, struct radix_node *head)
140 struct radix_node *x;
143 while (x->rn_bit >= 0) {
144 if (x->rn_bmask & v[x->rn_offset])
152 static struct radix_node *
153 rn_search_m(const char *v, struct radix_node *head, const char *m)
155 struct radix_node *x;
157 for (x = head; x->rn_bit >= 0;) {
158 if ((x->rn_bmask & m[x->rn_offset]) &&
159 (x->rn_bmask & v[x->rn_offset]))
168 rn_refines(char *m, char *n)
171 int longer = clen(n++) - clen(m++);
172 boolean_t masks_are_equal = TRUE;
174 lim2 = lim = n + clen(n);
181 masks_are_equal = FALSE;
186 if (masks_are_equal && (longer < 0))
187 for (lim2 = m - longer; m < lim2; )
190 return (!masks_are_equal);
194 rn_lookup(char *key, char *mask, struct radix_node_head *head)
196 struct radix_node *x;
197 char *netmask = NULL;
200 x = rn_addmask(mask, TRUE, head->rnh_treetop->rn_offset,
206 x = rn_match(key, head);
207 if (x != NULL && netmask != NULL) {
208 while (x != NULL && x->rn_mask != netmask)
215 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip)
217 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
219 int length = min(clen(cp), clen(cp2));
224 length = min(length, clen(cp3));
228 for (cp += skip; cp < cplim; cp++, cp2++, cp3++)
229 if ((*cp ^ *cp2) & *cp3)
235 rn_match(char *key, struct radix_node_head *head)
237 struct radix_node *t, *x;
238 char *cp = key, *cp2;
240 struct radix_node *saved_t, *top = head->rnh_treetop;
241 int off = top->rn_offset, klen, matched_off;
244 t = rn_search(key, top);
246 * See if we match exactly as a host destination
247 * or at least learn how many bits match, for normal mask finesse.
249 * It doesn't hurt us to limit how many bytes to check
250 * to the length of the mask, since if it matches we had a genuine
251 * match and the leaf we have is the most specific one anyway;
252 * if it didn't match with a shorter length it would fail
253 * with a long one. This wins big for class B&C netmasks which
254 * are probably the most common case...
256 if (t->rn_mask != NULL)
257 klen = clen(t->rn_mask);
260 cp += off; cp2 = t->rn_key + off; cplim = key + klen;
261 for (; cp < cplim; cp++, cp2++)
265 * This extra grot is in case we are explicitly asked
266 * to look up the default. Ugh!
268 * Never return the root node itself, it seems to cause a
271 if (t->rn_flags & RNF_ROOT)
275 test = (*cp ^ *cp2) & 0xff; /* find first bit that differs */
276 for (b = 7; (test >>= 1) > 0;)
278 matched_off = cp - key;
279 b += matched_off << 3;
282 * If there is a host route in a duped-key chain, it will be first.
284 if ((saved_t = t)->rn_mask == NULL)
286 for (; t; t = t->rn_dupedkey) {
288 * Even if we don't match exactly as a host,
289 * we may match if the leaf we wound up at is
292 if (t->rn_flags & RNF_NORMAL) {
293 if (rn_bit <= t->rn_bit)
295 } else if (rn_satisfies_leaf(key, t, matched_off))
299 /* start searching up the tree */
301 struct radix_mask *m;
305 * If non-contiguous masks ever become important
306 * we can restore the masking and open coding of
307 * the search and satisfaction test and put the
308 * calculation of "off" back before the "do".
312 if (m->rm_flags & RNF_NORMAL) {
313 if (rn_bit <= m->rm_bit)
316 off = min(t->rn_offset, matched_off);
317 x = rn_search_m(key, t, m->rm_mask);
318 while (x != NULL && x->rn_mask != m->rm_mask)
320 if (x && rn_satisfies_leaf(key, x, off))
331 struct radix_node *rn_clist;
333 boolean_t rn_debug = TRUE;
336 static struct radix_node *
337 rn_newpair(char *key, int indexbit, struct radix_node nodes[2])
339 struct radix_node *leaf = &nodes[0], *interior = &nodes[1];
341 interior->rn_bit = indexbit;
342 interior->rn_bmask = 0x80 >> (indexbit & 0x7);
343 interior->rn_offset = indexbit >> 3;
344 interior->rn_left = leaf;
345 interior->rn_mklist = NULL;
349 leaf->rn_parent = interior;
350 leaf->rn_flags = interior->rn_flags = RNF_ACTIVE;
351 leaf->rn_mklist = NULL;
354 leaf->rn_info = rn_nodenum++;
355 interior->rn_info = rn_nodenum++;
356 leaf->rn_twin = interior;
357 leaf->rn_ybro = rn_clist;
363 static struct radix_node *
364 rn_insert(char *key, struct radix_node_head *head, boolean_t *dupentry,
365 struct radix_node nodes[2])
367 struct radix_node *top = head->rnh_treetop;
368 int head_off = top->rn_offset, klen = clen(key);
369 struct radix_node *t = rn_search(key, top);
370 char *cp = key + head_off;
372 struct radix_node *tt;
375 * Find first bit at which the key and t->rn_key differ
378 char *cp2 = t->rn_key + head_off;
380 char *cplim = key + klen;
389 cmp_res = (cp[-1] ^ cp2[-1]) & 0xff;
390 for (b = (cp - key) << 3; cmp_res; b--)
394 struct radix_node *p, *x = top;
399 if (cp[x->rn_offset] & x->rn_bmask)
403 } while (b > (unsigned) x->rn_bit);
404 /* x->rn_bit < b && x->rn_bit >= 0 */
407 log(LOG_DEBUG, "rn_insert: Going In:\n"), traverse(p);
409 t = rn_newpair(key, b, nodes);
411 if ((cp[p->rn_offset] & p->rn_bmask) == 0)
416 t->rn_parent = p; /* frees x, p as temp vars below */
417 if ((cp[t->rn_offset] & t->rn_bmask) == 0) {
425 log(LOG_DEBUG, "rn_insert: Coming Out:\n"), traverse(p);
432 rn_addmask(char *netmask, boolean_t search, int skip,
433 struct radix_node_head *mask_rnh)
435 struct radix_node *x, *saved_x;
437 int b = 0, mlen, m0, j;
438 boolean_t maskduplicated, isnormal;
439 static int last_zeroed = 0;
442 if ((mlen = clen(netmask)) > RN_MAXKEYLEN)
447 return (mask_rnh->rnh_nodes);
448 R_Malloc(addmask_key, char *, RN_MAXKEYLEN);
449 if (addmask_key == NULL)
452 bcopy(rn_ones + 1, addmask_key + 1, skip - 1);
453 if ((m0 = mlen) > skip)
454 bcopy(netmask + skip, addmask_key + skip, mlen - skip);
456 * Trim trailing zeroes.
458 for (cp = addmask_key + mlen; (cp > addmask_key) && cp[-1] == 0;)
460 mlen = cp - addmask_key;
462 if (m0 >= last_zeroed)
465 return (mask_rnh->rnh_nodes);
467 if (m0 < last_zeroed)
468 bzero(addmask_key + m0, last_zeroed - m0);
469 *addmask_key = last_zeroed = mlen;
470 x = rn_search(addmask_key, mask_rnh->rnh_treetop);
471 if (x->rn_key == NULL) {
472 kprintf("WARNING: radix_node->rn_key is NULL rn=%p\n", x);
475 } else if (bcmp(addmask_key, x->rn_key, mlen) != 0) {
478 if (x != NULL || search)
480 R_Malloc(x, struct radix_node *, RN_MAXKEYLEN + 2 * (sizeof *x));
481 if ((saved_x = x) == NULL)
483 bzero(x, RN_MAXKEYLEN + 2 * (sizeof *x));
484 netmask = cp = (char *)(x + 2);
485 bcopy(addmask_key, cp, mlen);
486 x = rn_insert(cp, mask_rnh, &maskduplicated, x);
487 if (maskduplicated) {
488 log(LOG_ERR, "rn_addmask: mask impossibly already in tree");
493 * Calculate index of mask, and check for normalcy.
496 cplim = netmask + mlen;
497 for (cp = netmask + skip; cp < cplim && clen(cp) == 0xff;)
500 static const char normal_chars[] = {
501 0, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, -1
504 for (j = 0x80; (j & *cp) != 0; j >>= 1)
506 if (*cp != normal_chars[b] || cp != (cplim - 1))
509 b += (cp - netmask) << 3;
512 x->rn_flags |= RNF_NORMAL;
518 /* XXX: arbitrary ordering for non-contiguous masks */
520 rn_lexobetter(char *mp, char *np)
524 if ((unsigned) *mp > (unsigned) *np)
525 return TRUE;/* not really, but need to check longer one first */
527 for (lim = mp + clen(mp); mp < lim;)
533 static struct radix_mask *
534 rn_new_radix_mask(struct radix_node *tt, struct radix_mask *nextmask)
536 struct radix_mask *m;
538 m = MKGet(&rn_mkfreelist);
540 log(LOG_ERR, "Mask for route not entered\n");
544 m->rm_bit = tt->rn_bit;
545 m->rm_flags = tt->rn_flags;
546 if (tt->rn_flags & RNF_NORMAL)
549 m->rm_mask = tt->rn_mask;
550 m->rm_next = nextmask;
556 rn_addroute(char *key, char *netmask, struct radix_node_head *head,
557 struct radix_node treenodes[2])
559 struct radix_node *t, *x = NULL, *tt;
560 struct radix_node *saved_tt, *top = head->rnh_treetop;
561 short b = 0, b_leaf = 0;
562 boolean_t keyduplicated;
564 struct radix_mask *m, **mp;
567 * In dealing with non-contiguous masks, there may be
568 * many different routes which have the same mask.
569 * We will find it useful to have a unique pointer to
570 * the mask to speed avoiding duplicate references at
571 * nodes and possibly save time in calculating indices.
573 if (netmask != NULL) {
574 if ((x = rn_addmask(netmask, FALSE, top->rn_offset,
575 head->rnh_maskhead)) == NULL)
582 * Deal with duplicated keys: attach node to previous instance
584 saved_tt = tt = rn_insert(key, head, &keyduplicated, treenodes);
586 for (t = tt; tt; t = tt, tt = tt->rn_dupedkey) {
587 if (tt->rn_mask == netmask)
589 if (netmask == NULL ||
591 ((b_leaf < tt->rn_bit) /* index(netmask) > node */
592 || rn_refines(netmask, tt->rn_mask)
593 || rn_lexobetter(netmask, tt->rn_mask))))
597 * If the mask is not duplicated, we wouldn't
598 * find it among possible duplicate key entries
599 * anyway, so the above test doesn't hurt.
601 * We sort the masks for a duplicated key the same way as
602 * in a masklist -- most specific to least specific.
603 * This may require the unfortunate nuisance of relocating
604 * the head of the list.
606 if (tt == saved_tt) {
607 struct radix_node *xx = x;
608 /* link in at head of list */
609 (tt = treenodes)->rn_dupedkey = t;
610 tt->rn_flags = t->rn_flags;
611 tt->rn_parent = x = t->rn_parent;
612 t->rn_parent = tt; /* parent */
617 saved_tt = tt; x = xx;
619 (tt = treenodes)->rn_dupedkey = t->rn_dupedkey;
621 tt->rn_parent = t; /* parent */
622 if (tt->rn_dupedkey != NULL) /* parent */
623 tt->rn_dupedkey->rn_parent = tt; /* parent */
626 t=tt+1; tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++;
627 tt->rn_twin = t; tt->rn_ybro = rn_clist; rn_clist = tt;
631 tt->rn_flags = RNF_ACTIVE;
636 if (netmask != NULL) {
637 tt->rn_mask = netmask;
638 tt->rn_bit = x->rn_bit;
639 tt->rn_flags |= x->rn_flags & RNF_NORMAL;
641 t = saved_tt->rn_parent;
644 b_leaf = -1 - t->rn_bit;
645 if (t->rn_right == saved_tt)
649 /* Promote general routes from below */
653 if (x->rn_mask != NULL &&
654 x->rn_bit >= b_leaf &&
655 x->rn_mklist == NULL) {
656 *mp = m = rn_new_radix_mask(x, NULL);
662 } else if (x->rn_mklist != NULL) {
664 * Skip over masks whose index is > that of new node
666 for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_next)
667 if (m->rm_bit >= b_leaf)
673 /* Add new route to highest possible ancestor's list */
674 if ((netmask == NULL) || (b > t->rn_bit ))
675 return tt; /* can't lift at all */
680 } while (b <= t->rn_bit && x != top);
682 * Search through routes associated with node to
683 * insert new route according to index.
684 * Need same criteria as when sorting dupedkeys to avoid
685 * double loop on deletion.
687 for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_next) {
688 if (m->rm_bit < b_leaf)
690 if (m->rm_bit > b_leaf)
692 if (m->rm_flags & RNF_NORMAL) {
693 mmask = m->rm_leaf->rn_mask;
694 if (tt->rn_flags & RNF_NORMAL) {
696 "Non-unique normal route, mask not entered\n");
701 if (mmask == netmask) {
706 if (rn_refines(netmask, mmask) || rn_lexobetter(netmask, mmask))
709 *mp = rn_new_radix_mask(tt, *mp);
714 rn_delete(char *key, char *netmask, struct radix_node_head *head)
716 struct radix_node *t, *p, *x, *tt;
717 struct radix_mask *m, *saved_m, **mp;
718 struct radix_node *dupedkey, *saved_tt, *top;
719 int b, head_off, klen;
721 x = head->rnh_treetop;
722 tt = rn_search(key, x);
723 head_off = x->rn_offset;
728 bcmp(key + head_off, tt->rn_key + head_off, klen - head_off))
731 * Delete our route from mask lists.
733 if (netmask != NULL) {
734 if ((x = rn_addmask(netmask, TRUE, head_off,
735 head->rnh_maskhead)) == NULL)
738 while (tt->rn_mask != netmask)
739 if ((tt = tt->rn_dupedkey) == NULL)
742 if (tt->rn_mask == NULL || (saved_m = m = tt->rn_mklist) == NULL)
744 if (tt->rn_flags & RNF_NORMAL) {
745 if (m->rm_leaf != tt || m->rm_refs > 0) {
746 log(LOG_ERR, "rn_delete: inconsistent annotation\n");
747 return (NULL); /* dangling ref could cause disaster */
750 if (m->rm_mask != tt->rn_mask) {
751 log(LOG_ERR, "rn_delete: inconsistent annotation\n");
754 if (--m->rm_refs >= 0)
758 t = saved_tt->rn_parent;
760 goto on1; /* Wasn't lifted at all */
764 } while (b <= t->rn_bit && x != top);
765 for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_next)
768 MKFree(&rn_mkfreelist, m);
772 log(LOG_ERR, "rn_delete: couldn't find our annotation\n");
773 if (tt->rn_flags & RNF_NORMAL)
774 return (NULL); /* Dangling ref to us */
778 * Eliminate us from tree
780 if (tt->rn_flags & RNF_ROOT)
783 /* Get us out of the creation list */
784 for (t = rn_clist; t && t->rn_ybro != tt; t = t->rn_ybro) {}
785 if (t) t->rn_ybro = tt->rn_ybro;
788 dupedkey = saved_tt->rn_dupedkey;
789 if (dupedkey != NULL) {
791 * at this point, tt is the deletion target and saved_tt
792 * is the head of the dupekey chain
794 if (tt == saved_tt) {
795 /* remove from head of chain */
796 x = dupedkey; x->rn_parent = t;
797 if (t->rn_left == tt)
802 /* find node in front of tt on the chain */
803 for (x = p = saved_tt; p && p->rn_dupedkey != tt;)
806 p->rn_dupedkey = tt->rn_dupedkey;
807 if (tt->rn_dupedkey) /* parent */
808 tt->rn_dupedkey->rn_parent = p;
810 } else log(LOG_ERR, "rn_delete: couldn't find us\n");
813 if (t->rn_flags & RNF_ACTIVE) {
827 x->rn_left->rn_parent = x;
828 x->rn_right->rn_parent = x;
832 if (t->rn_left == tt)
837 if (p->rn_right == t)
843 * Demote routes attached to us.
845 if (t->rn_mklist != NULL) {
846 if (x->rn_bit >= 0) {
847 for (mp = &x->rn_mklist; (m = *mp);)
852 * If there are any (key, mask) pairs in a sibling
853 * duped-key chain, some subset will appear sorted
854 * in the same order attached to our mklist.
856 for (m = t->rn_mklist; m && x; x = x->rn_dupedkey)
857 if (m == x->rn_mklist) {
858 struct radix_mask *mm = m->rm_next;
861 if (--(m->rm_refs) < 0)
862 MKFree(&rn_mkfreelist, m);
867 "rn_delete: Orphaned Mask %p at %p\n",
868 (void *)m, (void *)x);
872 * We may be holding an active internal node in the tree.
883 t->rn_left->rn_parent = t;
884 t->rn_right->rn_parent = t;
892 tt->rn_flags &= ~RNF_ACTIVE;
893 tt[1].rn_flags &= ~RNF_ACTIVE;
898 * This is the same as rn_walktree() except for the parameters and the
902 rn_walktree_from(struct radix_node_head *h, char *xa, char *xm,
903 walktree_f_t *f, void *w)
905 struct radix_node *base, *next;
906 struct radix_node *rn, *last = NULL /* shut up gcc */;
907 boolean_t stopping = FALSE;
911 * rn_search_m is sort-of-open-coded here.
913 /* kprintf("about to search\n"); */
914 for (rn = h->rnh_treetop; rn->rn_bit >= 0; ) {
916 /* kprintf("rn_bit %d, rn_bmask %x, xm[rn_offset] %x\n",
917 rn->rn_bit, rn->rn_bmask, xm[rn->rn_offset]); */
918 if (!(rn->rn_bmask & xm[rn->rn_offset])) {
921 if (rn->rn_bmask & xa[rn->rn_offset]) {
927 /* kprintf("done searching\n"); */
930 * Two cases: either we stepped off the end of our mask,
931 * in which case last == rn, or we reached a leaf, in which
932 * case we want to start from the last node we looked at.
933 * Either way, last is the node we want to start from.
938 /* kprintf("rn %p, lastb %d\n", rn, lastb);*/
941 * This gets complicated because we may delete the node
942 * while applying the function f to it, so we need to calculate
943 * the successor node in advance.
945 while (rn->rn_bit >= 0)
949 /* kprintf("node %p (%d)\n", rn, rn->rn_bit); */
951 /* If at right child go back up, otherwise, go right */
952 while (rn->rn_parent->rn_right == rn &&
953 !(rn->rn_flags & RNF_ROOT)) {
956 /* if went up beyond last, stop */
957 if (rn->rn_bit < lastb) {
959 /* kprintf("up too far\n"); */
963 /* Find the next *leaf* since next node might vanish, too */
964 for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)
968 while ((rn = base) != NULL) {
969 base = rn->rn_dupedkey;
970 /* kprintf("leaf %p\n", rn); */
971 if (!(rn->rn_flags & RNF_ROOT) && (error = (*f)(rn, w)))
976 if (rn->rn_flags & RNF_ROOT) {
977 /* kprintf("root, stopping"); */
986 rn_walktree(struct radix_node_head *h, walktree_f_t *f, void *w)
988 struct radix_node *base, *next;
989 struct radix_node *rn = h->rnh_treetop;
993 * This gets complicated because we may delete the node
994 * while applying the function f to it, so we need to calculate
995 * the successor node in advance.
997 /* First time through node, go left */
998 while (rn->rn_bit >= 0)
1002 /* If at right child go back up, otherwise, go right */
1003 while (rn->rn_parent->rn_right == rn &&
1004 !(rn->rn_flags & RNF_ROOT))
1006 /* Find the next *leaf* since next node might vanish, too */
1007 for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)
1010 /* Process leaves */
1011 while ((rn = base)) {
1012 base = rn->rn_dupedkey;
1013 if (!(rn->rn_flags & RNF_ROOT) && (error = (*f)(rn, w)))
1017 if (rn->rn_flags & RNF_ROOT)
1024 rn_inithead(void **head, struct radix_node_head *maskhead, int off)
1026 struct radix_node_head *rnh;
1027 struct radix_node *root, *left, *right;
1029 if (*head != NULL) /* already initialized */
1032 R_Malloc(rnh, struct radix_node_head *, sizeof *rnh);
1035 bzero(rnh, sizeof *rnh);
1038 root = rn_newpair(rn_zeros, off, rnh->rnh_nodes);
1039 right = &rnh->rnh_nodes[2];
1040 root->rn_parent = root;
1041 root->rn_flags = RNF_ROOT | RNF_ACTIVE;
1042 root->rn_right = right;
1044 left = root->rn_left;
1045 left->rn_bit = -1 - off;
1046 left->rn_flags = RNF_ROOT | RNF_ACTIVE;
1049 right->rn_key = rn_ones;
1051 rnh->rnh_treetop = root;
1052 rnh->rnh_maskhead = maskhead;
1054 rnh->rnh_addaddr = rn_addroute;
1055 rnh->rnh_deladdr = rn_delete;
1056 rnh->rnh_matchaddr = rn_match;
1057 rnh->rnh_lookup = rn_lookup;
1058 rnh->rnh_walktree = rn_walktree;
1059 rnh->rnh_walktree_from = rn_walktree_from;
1071 SLIST_FOREACH(dom, &domains, dom_next) {
1072 if (dom->dom_maxrtkey > RN_MAXKEYLEN) {
1073 panic("domain %s maxkey too big %d/%d",
1074 dom->dom_name, dom->dom_maxrtkey, RN_MAXKEYLEN);
1078 for (cpu = 0; cpu < ncpus; ++cpu) {
1079 if (rn_inithead((void **)&mask_rnheads[cpu], NULL, 0) == 0)
1084 struct radix_node_head *
1085 rn_cpumaskhead(int cpu)
1087 KKASSERT(mask_rnheads[cpu] != NULL);
1088 return mask_rnheads[cpu];