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 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * @(#)radix.c 8.5 (Berkeley) 5/19/95
34 * Routines to build and maintain radix trees for routing lookups.
36 #include <sys/param.h>
39 #include <sys/mutex.h>
40 #include <sys/rwlock.h>
41 #include <sys/systm.h>
42 #include <sys/malloc.h>
43 #include <sys/syslog.h>
44 #include <net/radix.h>
45 #include "opt_mpath.h"
47 #include <net/radix_mpath.h>
53 #define log(x, arg...) fprintf(stderr, ## arg)
54 #define panic(x) fprintf(stderr, "PANIC: %s", x), exit(1)
55 #define min(a, b) ((a) < (b) ? (a) : (b) )
56 #include <net/radix.h>
59 static int rn_walktree_from(struct radix_node_head *h, void *a, void *m,
60 walktree_f_t *f, void *w);
61 static int rn_walktree(struct radix_node_head *, walktree_f_t *, void *);
62 static struct radix_node
63 *rn_insert(void *, struct radix_node_head *, int *,
64 struct radix_node [2]),
65 *rn_newpair(void *, int, struct radix_node[2]),
66 *rn_search(void *, struct radix_node *),
67 *rn_search_m(void *, struct radix_node *, void *);
69 static int max_keylen;
70 static struct radix_mask *rn_mkfreelist;
71 static struct radix_node_head *mask_rnhead;
73 * Work area -- the following point to 3 buffers of size max_keylen,
74 * allocated in this order in a block of memory malloc'ed by rn_init.
75 * rn_zeros, rn_ones are set in rn_init and used in readonly afterwards.
76 * addmask_key is used in rn_addmask in rw mode and not thread-safe.
78 static char *rn_zeros, *rn_ones, *addmask_key;
81 if (rn_mkfreelist) { \
83 rn_mkfreelist = (m)->rm_mklist; \
85 R_Malloc(m, struct radix_mask *, sizeof (struct radix_mask)); }
87 #define MKFree(m) { (m)->rm_mklist = rn_mkfreelist; rn_mkfreelist = (m);}
89 #define rn_masktop (mask_rnhead->rnh_treetop)
91 static int rn_lexobetter(void *m_arg, void *n_arg);
92 static struct radix_mask *
93 rn_new_radix_mask(struct radix_node *tt,
94 struct radix_mask *next);
95 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf,
99 * The data structure for the keys is a radix tree with one way
100 * branching removed. The index rn_bit at an internal node n represents a bit
101 * position to be tested. The tree is arranged so that all descendants
102 * of a node n have keys whose bits all agree up to position rn_bit - 1.
103 * (We say the index of n is rn_bit.)
105 * There is at least one descendant which has a one bit at position rn_bit,
106 * and at least one with a zero there.
108 * A route is determined by a pair of key and mask. We require that the
109 * bit-wise logical and of the key and mask to be the key.
110 * We define the index of a route to associated with the mask to be
111 * the first bit number in the mask where 0 occurs (with bit number 0
112 * representing the highest order bit).
114 * We say a mask is normal if every bit is 0, past the index of the mask.
115 * If a node n has a descendant (k, m) with index(m) == index(n) == rn_bit,
116 * and m is a normal mask, then the route applies to every descendant of n.
117 * If the index(m) < rn_bit, this implies the trailing last few bits of k
118 * before bit b are all 0, (and hence consequently true of every descendant
119 * of n), so the route applies to all descendants of the node as well.
121 * Similar logic shows that a non-normal mask m such that
122 * index(m) <= index(n) could potentially apply to many children of n.
123 * Thus, for each non-host route, we attach its mask to a list at an internal
124 * node as high in the tree as we can go.
126 * The present version of the code makes use of normal routes in short-
127 * circuiting an explict mask and compare operation when testing whether
128 * a key satisfies a normal route, and also in remembering the unique leaf
129 * that governs a subtree.
133 * Most of the functions in this code assume that the key/mask arguments
134 * are sockaddr-like structures, where the first byte is an u_char
135 * indicating the size of the entire structure.
137 * To make the assumption more explicit, we use the LEN() macro to access
138 * this field. It is safe to pass an expression with side effects
139 * to LEN() as the argument is evaluated only once.
140 * We cast the result to int as this is the dominant usage.
142 #define LEN(x) ( (int) (*(const u_char *)(x)) )
145 * XXX THIS NEEDS TO BE FIXED
146 * In the code, pointers to keys and masks are passed as either
147 * 'void *' (because callers use to pass pointers of various kinds), or
148 * 'caddr_t' (which is fine for pointer arithmetics, but not very
149 * clean when you dereference it to access data). Furthermore, caddr_t
150 * is really 'char *', while the natural type to operate on keys and
151 * masks would be 'u_char'. This mismatch require a lot of casts and
152 * intermediate variables to adapt types that clutter the code.
156 * Search a node in the tree matching the key.
158 static struct radix_node *
159 rn_search(v_arg, head)
161 struct radix_node *head;
163 register struct radix_node *x;
166 for (x = head, v = v_arg; x->rn_bit >= 0;) {
167 if (x->rn_bmask & v[x->rn_offset])
176 * Same as above, but with an additional mask.
177 * XXX note this function is used only once.
179 static struct radix_node *
180 rn_search_m(v_arg, head, m_arg)
181 struct radix_node *head;
184 register struct radix_node *x;
185 register caddr_t v = v_arg, m = m_arg;
187 for (x = head; x->rn_bit >= 0;) {
188 if ((x->rn_bmask & m[x->rn_offset]) &&
189 (x->rn_bmask & v[x->rn_offset]))
198 rn_refines(m_arg, n_arg)
201 register caddr_t m = m_arg, n = n_arg;
202 register caddr_t lim, lim2 = lim = n + LEN(n);
203 int longer = LEN(n++) - LEN(m++);
204 int masks_are_equal = 1;
217 if (masks_are_equal && (longer < 0))
218 for (lim2 = m - longer; m < lim2; )
221 return (!masks_are_equal);
225 rn_lookup(v_arg, m_arg, head)
227 struct radix_node_head *head;
229 register struct radix_node *x;
233 x = rn_addmask(m_arg, 1, head->rnh_treetop->rn_offset);
238 x = rn_match(v_arg, head);
240 while (x && x->rn_mask != netmask)
247 rn_satisfies_leaf(trial, leaf, skip)
249 register struct radix_node *leaf;
252 register char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
254 int length = min(LEN(cp), LEN(cp2));
259 length = min(length, LEN(cp3));
260 cplim = cp + length; cp3 += skip; cp2 += skip;
261 for (cp += skip; cp < cplim; cp++, cp2++, cp3++)
262 if ((*cp ^ *cp2) & *cp3)
268 rn_match(v_arg, head)
270 struct radix_node_head *head;
273 register struct radix_node *t = head->rnh_treetop, *x;
274 register caddr_t cp = v, cp2;
276 struct radix_node *saved_t, *top = t;
277 int off = t->rn_offset, vlen = LEN(cp), matched_off;
278 register int test, b, rn_bit;
281 * Open code rn_search(v, top) to avoid overhead of extra
284 for (; t->rn_bit >= 0; ) {
285 if (t->rn_bmask & cp[t->rn_offset])
291 * See if we match exactly as a host destination
292 * or at least learn how many bits match, for normal mask finesse.
294 * It doesn't hurt us to limit how many bytes to check
295 * to the length of the mask, since if it matches we had a genuine
296 * match and the leaf we have is the most specific one anyway;
297 * if it didn't match with a shorter length it would fail
298 * with a long one. This wins big for class B&C netmasks which
299 * are probably the most common case...
302 vlen = *(u_char *)t->rn_mask;
303 cp += off; cp2 = t->rn_key + off; cplim = v + vlen;
304 for (; cp < cplim; cp++, cp2++)
308 * This extra grot is in case we are explicitly asked
309 * to look up the default. Ugh!
311 * Never return the root node itself, it seems to cause a
314 if (t->rn_flags & RNF_ROOT)
318 test = (*cp ^ *cp2) & 0xff; /* find first bit that differs */
319 for (b = 7; (test >>= 1) > 0;)
321 matched_off = cp - v;
322 b += matched_off << 3;
325 * If there is a host route in a duped-key chain, it will be first.
327 if ((saved_t = t)->rn_mask == 0)
329 for (; t; t = t->rn_dupedkey)
331 * Even if we don't match exactly as a host,
332 * we may match if the leaf we wound up at is
335 if (t->rn_flags & RNF_NORMAL) {
336 if (rn_bit <= t->rn_bit)
338 } else if (rn_satisfies_leaf(v, t, matched_off))
341 /* start searching up the tree */
343 register struct radix_mask *m;
347 * If non-contiguous masks ever become important
348 * we can restore the masking and open coding of
349 * the search and satisfaction test and put the
350 * calculation of "off" back before the "do".
353 if (m->rm_flags & RNF_NORMAL) {
354 if (rn_bit <= m->rm_bit)
357 off = min(t->rn_offset, matched_off);
358 x = rn_search_m(v, t, m->rm_mask);
359 while (x && x->rn_mask != m->rm_mask)
361 if (x && rn_satisfies_leaf(v, x, off))
372 struct radix_node *rn_clist;
378 * Whenever we add a new leaf to the tree, we also add a parent node,
379 * so we allocate them as an array of two elements: the first one must be
380 * the leaf (see RNTORT() in route.c), the second one is the parent.
381 * This routine initializes the relevant fields of the nodes, so that
382 * the leaf is the left child of the parent node, and both nodes have
383 * (almost) all all fields filled as appropriate.
384 * (XXX some fields are left unset, see the '#if 0' section).
385 * The function returns a pointer to the parent node.
388 static struct radix_node *
389 rn_newpair(v, b, nodes)
392 struct radix_node nodes[2];
394 register struct radix_node *tt = nodes, *t = tt + 1;
396 t->rn_bmask = 0x80 >> (b & 7);
398 t->rn_offset = b >> 3;
400 #if 0 /* XXX perhaps we should fill these fields as well. */
401 t->rn_parent = t->rn_right = NULL;
404 tt->rn_dupedkey = NULL;
408 tt->rn_key = (caddr_t)v;
410 tt->rn_flags = t->rn_flags = RNF_ACTIVE;
411 tt->rn_mklist = t->rn_mklist = 0;
413 tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++;
415 tt->rn_ybro = rn_clist;
421 static struct radix_node *
422 rn_insert(v_arg, head, dupentry, nodes)
424 struct radix_node_head *head;
426 struct radix_node nodes[2];
429 struct radix_node *top = head->rnh_treetop;
430 int head_off = top->rn_offset, vlen = LEN(v);
431 register struct radix_node *t = rn_search(v_arg, top);
432 register caddr_t cp = v + head_off;
434 struct radix_node *tt;
436 * Find first bit at which v and t->rn_key differ
439 register caddr_t cp2 = t->rn_key + head_off;
440 register int cmp_res;
441 caddr_t cplim = v + vlen;
450 cmp_res = (cp[-1] ^ cp2[-1]) & 0xff;
451 for (b = (cp - v) << 3; cmp_res; b--)
455 register struct radix_node *p, *x = top;
459 if (cp[x->rn_offset] & x->rn_bmask)
463 } while (b > (unsigned) x->rn_bit);
464 /* x->rn_bit < b && x->rn_bit >= 0 */
467 log(LOG_DEBUG, "rn_insert: Going In:\n"), traverse(p);
469 t = rn_newpair(v_arg, b, nodes);
471 if ((cp[p->rn_offset] & p->rn_bmask) == 0)
476 t->rn_parent = p; /* frees x, p as temp vars below */
477 if ((cp[t->rn_offset] & t->rn_bmask) == 0) {
485 log(LOG_DEBUG, "rn_insert: Coming Out:\n"), traverse(p);
492 rn_addmask(n_arg, search, skip)
496 caddr_t netmask = (caddr_t)n_arg;
497 register struct radix_node *x;
498 register caddr_t cp, cplim;
499 register int b = 0, mlen, j;
500 int maskduplicated, m0, isnormal;
501 struct radix_node *saved_x;
502 static int last_zeroed = 0;
504 if ((mlen = LEN(netmask)) > max_keylen)
509 return (mask_rnhead->rnh_nodes);
511 bcopy(rn_ones + 1, addmask_key + 1, skip - 1);
512 if ((m0 = mlen) > skip)
513 bcopy(netmask + skip, addmask_key + skip, mlen - skip);
515 * Trim trailing zeroes.
517 for (cp = addmask_key + mlen; (cp > addmask_key) && cp[-1] == 0;)
519 mlen = cp - addmask_key;
521 if (m0 >= last_zeroed)
523 return (mask_rnhead->rnh_nodes);
525 if (m0 < last_zeroed)
526 bzero(addmask_key + m0, last_zeroed - m0);
527 *addmask_key = last_zeroed = mlen;
528 x = rn_search(addmask_key, rn_masktop);
529 if (bcmp(addmask_key, x->rn_key, mlen) != 0)
533 R_Zalloc(x, struct radix_node *, max_keylen + 2 * sizeof (*x));
534 if ((saved_x = x) == 0)
536 netmask = cp = (caddr_t)(x + 2);
537 bcopy(addmask_key, cp, mlen);
538 x = rn_insert(cp, mask_rnhead, &maskduplicated, x);
539 if (maskduplicated) {
540 log(LOG_ERR, "rn_addmask: mask impossibly already in tree");
545 * Calculate index of mask, and check for normalcy.
546 * First find the first byte with a 0 bit, then if there are
547 * more bits left (remember we already trimmed the trailing 0's),
548 * the pattern must be one of those in normal_chars[], or we have
549 * a non-contiguous mask.
551 cplim = netmask + mlen;
553 for (cp = netmask + skip; (cp < cplim) && *(u_char *)cp == 0xff;)
556 static char normal_chars[] = {
557 0, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, 0xff};
559 for (j = 0x80; (j & *cp) != 0; j >>= 1)
561 if (*cp != normal_chars[b] || cp != (cplim - 1))
564 b += (cp - netmask) << 3;
567 x->rn_flags |= RNF_NORMAL;
571 static int /* XXX: arbitrary ordering for non-contiguous masks */
572 rn_lexobetter(m_arg, n_arg)
575 register u_char *mp = m_arg, *np = n_arg, *lim;
577 if (LEN(mp) > LEN(np))
578 return 1; /* not really, but need to check longer one first */
579 if (LEN(mp) == LEN(np))
580 for (lim = mp + LEN(mp); mp < lim;)
586 static struct radix_mask *
587 rn_new_radix_mask(tt, next)
588 register struct radix_node *tt;
589 register struct radix_mask *next;
591 register struct radix_mask *m;
595 log(LOG_ERR, "Mask for route not entered\n");
599 m->rm_bit = tt->rn_bit;
600 m->rm_flags = tt->rn_flags;
601 if (tt->rn_flags & RNF_NORMAL)
604 m->rm_mask = tt->rn_mask;
611 rn_addroute(v_arg, n_arg, head, treenodes)
613 struct radix_node_head *head;
614 struct radix_node treenodes[2];
616 caddr_t v = (caddr_t)v_arg, netmask = (caddr_t)n_arg;
617 register struct radix_node *t, *x = 0, *tt;
618 struct radix_node *saved_tt, *top = head->rnh_treetop;
619 short b = 0, b_leaf = 0;
622 struct radix_mask *m, **mp;
625 * In dealing with non-contiguous masks, there may be
626 * many different routes which have the same mask.
627 * We will find it useful to have a unique pointer to
628 * the mask to speed avoiding duplicate references at
629 * nodes and possibly save time in calculating indices.
632 if ((x = rn_addmask(netmask, 0, top->rn_offset)) == 0)
639 * Deal with duplicated keys: attach node to previous instance
641 saved_tt = tt = rn_insert(v, head, &keyduplicated, treenodes);
643 for (t = tt; tt; t = tt, tt = tt->rn_dupedkey) {
645 /* permit multipath, if enabled for the family */
646 if (rn_mpath_capable(head) && netmask == tt->rn_mask) {
648 * go down to the end of multipaths, so that
649 * new entry goes into the end of rn_dupedkey
654 tt = tt->rn_dupedkey;
655 } while (tt && t->rn_mask == tt->rn_mask);
659 if (tt->rn_mask == netmask)
663 ((b_leaf < tt->rn_bit) /* index(netmask) > node */
664 || rn_refines(netmask, tt->rn_mask)
665 || rn_lexobetter(netmask, tt->rn_mask))))
669 * If the mask is not duplicated, we wouldn't
670 * find it among possible duplicate key entries
671 * anyway, so the above test doesn't hurt.
673 * We sort the masks for a duplicated key the same way as
674 * in a masklist -- most specific to least specific.
675 * This may require the unfortunate nuisance of relocating
676 * the head of the list.
678 * We also reverse, or doubly link the list through the
681 if (tt == saved_tt) {
682 struct radix_node *xx = x;
683 /* link in at head of list */
684 (tt = treenodes)->rn_dupedkey = t;
685 tt->rn_flags = t->rn_flags;
686 tt->rn_parent = x = t->rn_parent;
687 t->rn_parent = tt; /* parent */
692 saved_tt = tt; x = xx;
694 (tt = treenodes)->rn_dupedkey = t->rn_dupedkey;
696 tt->rn_parent = t; /* parent */
697 if (tt->rn_dupedkey) /* parent */
698 tt->rn_dupedkey->rn_parent = tt; /* parent */
701 t=tt+1; tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++;
702 tt->rn_twin = t; tt->rn_ybro = rn_clist; rn_clist = tt;
704 tt->rn_key = (caddr_t) v;
706 tt->rn_flags = RNF_ACTIVE;
712 tt->rn_mask = netmask;
713 tt->rn_bit = x->rn_bit;
714 tt->rn_flags |= x->rn_flags & RNF_NORMAL;
716 t = saved_tt->rn_parent;
719 b_leaf = -1 - t->rn_bit;
720 if (t->rn_right == saved_tt)
724 /* Promote general routes from below */
726 for (mp = &t->rn_mklist; x; x = x->rn_dupedkey)
727 if (x->rn_mask && (x->rn_bit >= b_leaf) && x->rn_mklist == 0) {
728 *mp = m = rn_new_radix_mask(x, 0);
732 } else if (x->rn_mklist) {
734 * Skip over masks whose index is > that of new node
736 for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist)
737 if (m->rm_bit >= b_leaf)
739 t->rn_mklist = m; *mp = 0;
742 /* Add new route to highest possible ancestor's list */
743 if ((netmask == 0) || (b > t->rn_bit ))
744 return tt; /* can't lift at all */
749 } while (b <= t->rn_bit && x != top);
751 * Search through routes associated with node to
752 * insert new route according to index.
753 * Need same criteria as when sorting dupedkeys to avoid
754 * double loop on deletion.
756 for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist) {
757 if (m->rm_bit < b_leaf)
759 if (m->rm_bit > b_leaf)
761 if (m->rm_flags & RNF_NORMAL) {
762 mmask = m->rm_leaf->rn_mask;
763 if (tt->rn_flags & RNF_NORMAL) {
764 #if !defined(RADIX_MPATH)
766 "Non-unique normal route, mask not entered\n");
772 if (mmask == netmask) {
777 if (rn_refines(netmask, mmask)
778 || rn_lexobetter(netmask, mmask))
781 *mp = rn_new_radix_mask(tt, *mp);
786 rn_delete(v_arg, netmask_arg, head)
787 void *v_arg, *netmask_arg;
788 struct radix_node_head *head;
790 register struct radix_node *t, *p, *x, *tt;
791 struct radix_mask *m, *saved_m, **mp;
792 struct radix_node *dupedkey, *saved_tt, *top;
794 int b, head_off, vlen;
797 netmask = netmask_arg;
798 x = head->rnh_treetop;
799 tt = rn_search(v, x);
800 head_off = x->rn_offset;
805 bcmp(v + head_off, tt->rn_key + head_off, vlen - head_off))
808 * Delete our route from mask lists.
811 if ((x = rn_addmask(netmask, 1, head_off)) == 0)
814 while (tt->rn_mask != netmask)
815 if ((tt = tt->rn_dupedkey) == 0)
818 if (tt->rn_mask == 0 || (saved_m = m = tt->rn_mklist) == 0)
820 if (tt->rn_flags & RNF_NORMAL) {
821 if (m->rm_leaf != tt || m->rm_refs > 0) {
822 log(LOG_ERR, "rn_delete: inconsistent annotation\n");
823 return 0; /* dangling ref could cause disaster */
826 if (m->rm_mask != tt->rn_mask) {
827 log(LOG_ERR, "rn_delete: inconsistent annotation\n");
830 if (--m->rm_refs >= 0)
834 t = saved_tt->rn_parent;
836 goto on1; /* Wasn't lifted at all */
840 } while (b <= t->rn_bit && x != top);
841 for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist)
848 log(LOG_ERR, "rn_delete: couldn't find our annotation\n");
849 if (tt->rn_flags & RNF_NORMAL)
850 return (0); /* Dangling ref to us */
854 * Eliminate us from tree
856 if (tt->rn_flags & RNF_ROOT)
859 /* Get us out of the creation list */
860 for (t = rn_clist; t && t->rn_ybro != tt; t = t->rn_ybro) {}
861 if (t) t->rn_ybro = tt->rn_ybro;
864 dupedkey = saved_tt->rn_dupedkey;
867 * Here, tt is the deletion target and
868 * saved_tt is the head of the dupekey chain.
870 if (tt == saved_tt) {
871 /* remove from head of chain */
872 x = dupedkey; x->rn_parent = t;
873 if (t->rn_left == tt)
878 /* find node in front of tt on the chain */
879 for (x = p = saved_tt; p && p->rn_dupedkey != tt;)
882 p->rn_dupedkey = tt->rn_dupedkey;
883 if (tt->rn_dupedkey) /* parent */
884 tt->rn_dupedkey->rn_parent = p;
886 } else log(LOG_ERR, "rn_delete: couldn't find us\n");
889 if (t->rn_flags & RNF_ACTIVE) {
903 x->rn_left->rn_parent = x;
904 x->rn_right->rn_parent = x;
908 if (t->rn_left == tt)
913 if (p->rn_right == t)
919 * Demote routes attached to us.
922 if (x->rn_bit >= 0) {
923 for (mp = &x->rn_mklist; (m = *mp);)
927 /* If there are any key,mask pairs in a sibling
928 duped-key chain, some subset will appear sorted
929 in the same order attached to our mklist */
930 for (m = t->rn_mklist; m && x; x = x->rn_dupedkey)
931 if (m == x->rn_mklist) {
932 struct radix_mask *mm = m->rm_mklist;
934 if (--(m->rm_refs) < 0)
940 "rn_delete: Orphaned Mask %p at %p\n",
945 * We may be holding an active internal node in the tree.
956 t->rn_left->rn_parent = t;
957 t->rn_right->rn_parent = t;
965 tt->rn_flags &= ~RNF_ACTIVE;
966 tt[1].rn_flags &= ~RNF_ACTIVE;
971 * This is the same as rn_walktree() except for the parameters and the
975 rn_walktree_from(h, a, m, f, w)
976 struct radix_node_head *h;
982 struct radix_node *base, *next;
983 u_char *xa = (u_char *)a;
984 u_char *xm = (u_char *)m;
985 register struct radix_node *rn, *last = 0 /* shut up gcc */;
990 * rn_search_m is sort-of-open-coded here. We cannot use the
991 * function because we need to keep track of the last node seen.
993 /* printf("about to search\n"); */
994 for (rn = h->rnh_treetop; rn->rn_bit >= 0; ) {
996 /* printf("rn_bit %d, rn_bmask %x, xm[rn_offset] %x\n",
997 rn->rn_bit, rn->rn_bmask, xm[rn->rn_offset]); */
998 if (!(rn->rn_bmask & xm[rn->rn_offset])) {
1001 if (rn->rn_bmask & xa[rn->rn_offset]) {
1007 /* printf("done searching\n"); */
1010 * Two cases: either we stepped off the end of our mask,
1011 * in which case last == rn, or we reached a leaf, in which
1012 * case we want to start from the last node we looked at.
1013 * Either way, last is the node we want to start from.
1018 /* printf("rn %p, lastb %d\n", rn, lastb);*/
1021 * This gets complicated because we may delete the node
1022 * while applying the function f to it, so we need to calculate
1023 * the successor node in advance.
1025 while (rn->rn_bit >= 0)
1029 /* printf("node %p (%d)\n", rn, rn->rn_bit); */
1031 /* If at right child go back up, otherwise, go right */
1032 while (rn->rn_parent->rn_right == rn
1033 && !(rn->rn_flags & RNF_ROOT)) {
1036 /* if went up beyond last, stop */
1037 if (rn->rn_bit <= lastb) {
1039 /* printf("up too far\n"); */
1041 * XXX we should jump to the 'Process leaves'
1042 * part, because the values of 'rn' and 'next'
1043 * we compute will not be used. Not a big deal
1044 * because this loop will terminate, but it is
1045 * inefficient and hard to understand!
1051 * At the top of the tree, no need to traverse the right
1052 * half, prevent the traversal of the entire tree in the
1053 * case of default route.
1055 if (rn->rn_parent->rn_flags & RNF_ROOT)
1058 /* Find the next *leaf* since next node might vanish, too */
1059 for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)
1062 /* Process leaves */
1063 while ((rn = base) != 0) {
1064 base = rn->rn_dupedkey;
1065 /* printf("leaf %p\n", rn); */
1066 if (!(rn->rn_flags & RNF_ROOT)
1067 && (error = (*f)(rn, w)))
1072 if (rn->rn_flags & RNF_ROOT) {
1073 /* printf("root, stopping"); */
1082 rn_walktree(h, f, w)
1083 struct radix_node_head *h;
1088 struct radix_node *base, *next;
1089 register struct radix_node *rn = h->rnh_treetop;
1091 * This gets complicated because we may delete the node
1092 * while applying the function f to it, so we need to calculate
1093 * the successor node in advance.
1096 /* First time through node, go left */
1097 while (rn->rn_bit >= 0)
1101 /* If at right child go back up, otherwise, go right */
1102 while (rn->rn_parent->rn_right == rn
1103 && (rn->rn_flags & RNF_ROOT) == 0)
1105 /* Find the next *leaf* since next node might vanish, too */
1106 for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)
1109 /* Process leaves */
1110 while ((rn = base)) {
1111 base = rn->rn_dupedkey;
1112 if (!(rn->rn_flags & RNF_ROOT)
1113 && (error = (*f)(rn, w)))
1117 if (rn->rn_flags & RNF_ROOT)
1124 * Allocate and initialize an empty tree. This has 3 nodes, which are
1125 * part of the radix_node_head (in the order <left,root,right>) and are
1126 * marked RNF_ROOT so they cannot be freed.
1127 * The leaves have all-zero and all-one keys, with significant
1128 * bits starting at 'off'.
1129 * Return 1 on success, 0 on error.
1132 rn_inithead(head, off)
1136 register struct radix_node_head *rnh;
1137 register struct radix_node *t, *tt, *ttt;
1140 R_Zalloc(rnh, struct radix_node_head *, sizeof (*rnh));
1144 RADIX_NODE_HEAD_LOCK_INIT(rnh);
1147 t = rn_newpair(rn_zeros, off, rnh->rnh_nodes);
1148 ttt = rnh->rnh_nodes + 2;
1151 tt = t->rn_left; /* ... which in turn is rnh->rnh_nodes */
1152 tt->rn_flags = t->rn_flags = RNF_ROOT | RNF_ACTIVE;
1153 tt->rn_bit = -1 - off;
1155 ttt->rn_key = rn_ones;
1156 rnh->rnh_addaddr = rn_addroute;
1157 rnh->rnh_deladdr = rn_delete;
1158 rnh->rnh_matchaddr = rn_match;
1159 rnh->rnh_lookup = rn_lookup;
1160 rnh->rnh_walktree = rn_walktree;
1161 rnh->rnh_walktree_from = rn_walktree_from;
1162 rnh->rnh_treetop = t;
1167 rn_detachhead(void **head)
1169 struct radix_node_head *rnh;
1171 KASSERT((head != NULL && *head != NULL),
1172 ("%s: head already freed", __func__));
1175 /* Free <left,root,right> nodes. */
1188 if (max_keylen == 0) {
1190 "rn_init: radix functions require max_keylen be set\n");
1193 R_Malloc(rn_zeros, char *, 3 * max_keylen);
1194 if (rn_zeros == NULL)
1196 bzero(rn_zeros, 3 * max_keylen);
1197 rn_ones = cp = rn_zeros + max_keylen;
1198 addmask_key = cplim = rn_ones + max_keylen;
1201 if (rn_inithead((void **)(void *)&mask_rnhead, 0) == 0)