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
30 * $FreeBSD: head/sys/net/radix.c 200354 2009-12-10 10:34:30Z luigi $
34 * Routines to build and maintain radix trees for routing lookups.
36 #include <sys/param.h>
38 #include <sys/cdefs.h>
40 #include <sys/mutex.h>
41 #include <sys/rwlock.h>
42 #include <sys/systm.h>
43 #include <sys/malloc.h>
44 #include <sys/syslog.h>
45 #include <net/radix.h>
46 #include "opt_mpath.h"
48 #include <net/radix_mpath.h>
54 #define log(x, arg...) fprintf(stderr, ## arg)
55 #define panic(x) fprintf(stderr, "PANIC: %s", x), exit(1)
56 #define min(a, b) ((a) < (b) ? (a) : (b) )
57 #include "include/net/radix.h"
60 static int rn_walktree_from(struct radix_node_head *h, void *a, void *m,
61 walktree_f_t *f, void *w);
62 static int rn_walktree(struct radix_node_head *, walktree_f_t *, void *);
63 static struct radix_node
64 *rn_insert(void *, struct radix_node_head *, int *,
65 struct radix_node [2]),
66 *rn_newpair(void *, int, struct radix_node[2]),
67 *rn_search(void *, struct radix_node *),
68 *rn_search_m(void *, struct radix_node *, void *);
70 static int max_keylen;
71 static struct radix_mask *rn_mkfreelist;
72 static struct radix_node_head *mask_rnhead;
74 * Work area -- the following point to 3 buffers of size max_keylen,
75 * allocated in this order in a block of memory malloc'ed by rn_init.
76 * rn_zeros, rn_ones are set in rn_init and used in readonly afterwards.
77 * addmask_key is used in rn_addmask in rw mode and not thread-safe.
79 static char *rn_zeros, *rn_ones, *addmask_key;
82 if (rn_mkfreelist) { \
84 rn_mkfreelist = (m)->rm_mklist; \
86 R_Malloc(m, struct radix_mask *, sizeof (struct radix_mask)); }
88 #define MKFree(m) { (m)->rm_mklist = rn_mkfreelist; rn_mkfreelist = (m);}
90 #define rn_masktop (mask_rnhead->rnh_treetop)
92 static int rn_lexobetter(void *m_arg, void *n_arg);
93 static struct radix_mask *
94 rn_new_radix_mask(struct radix_node *tt,
95 struct radix_mask *next);
96 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf,
100 * The data structure for the keys is a radix tree with one way
101 * branching removed. The index rn_bit at an internal node n represents a bit
102 * position to be tested. The tree is arranged so that all descendants
103 * of a node n have keys whose bits all agree up to position rn_bit - 1.
104 * (We say the index of n is rn_bit.)
106 * There is at least one descendant which has a one bit at position rn_bit,
107 * and at least one with a zero there.
109 * A route is determined by a pair of key and mask. We require that the
110 * bit-wise logical and of the key and mask to be the key.
111 * We define the index of a route to associated with the mask to be
112 * the first bit number in the mask where 0 occurs (with bit number 0
113 * representing the highest order bit).
115 * We say a mask is normal if every bit is 0, past the index of the mask.
116 * If a node n has a descendant (k, m) with index(m) == index(n) == rn_bit,
117 * and m is a normal mask, then the route applies to every descendant of n.
118 * If the index(m) < rn_bit, this implies the trailing last few bits of k
119 * before bit b are all 0, (and hence consequently true of every descendant
120 * of n), so the route applies to all descendants of the node as well.
122 * Similar logic shows that a non-normal mask m such that
123 * index(m) <= index(n) could potentially apply to many children of n.
124 * Thus, for each non-host route, we attach its mask to a list at an internal
125 * node as high in the tree as we can go.
127 * The present version of the code makes use of normal routes in short-
128 * circuiting an explict mask and compare operation when testing whether
129 * a key satisfies a normal route, and also in remembering the unique leaf
130 * that governs a subtree.
134 * Most of the functions in this code assume that the key/mask arguments
135 * are sockaddr-like structures, where the first byte is an u_char
136 * indicating the size of the entire structure.
138 * To make the assumption more explicit, we use the LEN() macro to access
139 * this field. It is safe to pass an expression with side effects
140 * to LEN() as the argument is evaluated only once.
141 * We cast the result to int as this is the dominant usage.
143 #define LEN(x) ( (int) (*(const u_char *)(x)) )
146 * XXX THIS NEEDS TO BE FIXED
147 * In the code, pointers to keys and masks are passed as either
148 * 'void *' (because callers use to pass pointers of various kinds), or
149 * 'caddr_t' (which is fine for pointer arithmetics, but not very
150 * clean when you dereference it to access data). Furthermore, caddr_t
151 * is really 'char *', while the natural type to operate on keys and
152 * masks would be 'u_char'. This mismatch require a lot of casts and
153 * intermediate variables to adapt types that clutter the code.
157 * Search a node in the tree matching the key.
159 static struct radix_node *
160 rn_search(v_arg, head)
162 struct radix_node *head;
164 register struct radix_node *x;
167 for (x = head, v = v_arg; x->rn_bit >= 0;) {
168 if (x->rn_bmask & v[x->rn_offset])
177 * Same as above, but with an additional mask.
178 * XXX note this function is used only once.
180 static struct radix_node *
181 rn_search_m(v_arg, head, m_arg)
182 struct radix_node *head;
185 register struct radix_node *x;
186 register caddr_t v = v_arg, m = m_arg;
188 for (x = head; x->rn_bit >= 0;) {
189 if ((x->rn_bmask & m[x->rn_offset]) &&
190 (x->rn_bmask & v[x->rn_offset]))
199 rn_refines(m_arg, n_arg)
202 register caddr_t m = m_arg, n = n_arg;
203 register caddr_t lim, lim2 = lim = n + LEN(n);
204 int longer = LEN(n++) - LEN(m++);
205 int masks_are_equal = 1;
218 if (masks_are_equal && (longer < 0))
219 for (lim2 = m - longer; m < lim2; )
222 return (!masks_are_equal);
226 rn_lookup(v_arg, m_arg, head)
228 struct radix_node_head *head;
230 register struct radix_node *x;
234 x = rn_addmask(m_arg, 1, head->rnh_treetop->rn_offset);
239 x = rn_match(v_arg, head);
241 while (x && x->rn_mask != netmask)
248 rn_satisfies_leaf(trial, leaf, skip)
250 register struct radix_node *leaf;
253 register char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
255 int length = min(LEN(cp), LEN(cp2));
260 length = min(length, LEN(cp3));
261 cplim = cp + length; cp3 += skip; cp2 += skip;
262 for (cp += skip; cp < cplim; cp++, cp2++, cp3++)
263 if ((*cp ^ *cp2) & *cp3)
269 rn_match(v_arg, head)
271 struct radix_node_head *head;
274 register struct radix_node *t = head->rnh_treetop, *x;
275 register caddr_t cp = v, cp2;
277 struct radix_node *saved_t, *top = t;
278 int off = t->rn_offset, vlen = LEN(cp), matched_off;
279 register int test, b, rn_bit;
282 * Open code rn_search(v, top) to avoid overhead of extra
285 for (; t->rn_bit >= 0; ) {
286 if (t->rn_bmask & cp[t->rn_offset])
292 * See if we match exactly as a host destination
293 * or at least learn how many bits match, for normal mask finesse.
295 * It doesn't hurt us to limit how many bytes to check
296 * to the length of the mask, since if it matches we had a genuine
297 * match and the leaf we have is the most specific one anyway;
298 * if it didn't match with a shorter length it would fail
299 * with a long one. This wins big for class B&C netmasks which
300 * are probably the most common case...
303 vlen = *(u_char *)t->rn_mask;
304 cp += off; cp2 = t->rn_key + off; cplim = v + vlen;
305 for (; cp < cplim; cp++, cp2++)
309 * This extra grot is in case we are explicitly asked
310 * to look up the default. Ugh!
312 * Never return the root node itself, it seems to cause a
315 if (t->rn_flags & RNF_ROOT)
319 test = (*cp ^ *cp2) & 0xff; /* find first bit that differs */
320 for (b = 7; (test >>= 1) > 0;)
322 matched_off = cp - v;
323 b += matched_off << 3;
326 * If there is a host route in a duped-key chain, it will be first.
328 if ((saved_t = t)->rn_mask == 0)
330 for (; t; t = t->rn_dupedkey)
332 * Even if we don't match exactly as a host,
333 * we may match if the leaf we wound up at is
336 if (t->rn_flags & RNF_NORMAL) {
337 if (rn_bit <= t->rn_bit)
339 } else if (rn_satisfies_leaf(v, t, matched_off))
342 /* start searching up the tree */
344 register struct radix_mask *m;
348 * If non-contiguous masks ever become important
349 * we can restore the masking and open coding of
350 * the search and satisfaction test and put the
351 * calculation of "off" back before the "do".
354 if (m->rm_flags & RNF_NORMAL) {
355 if (rn_bit <= m->rm_bit)
358 off = min(t->rn_offset, matched_off);
359 x = rn_search_m(v, t, m->rm_mask);
360 while (x && x->rn_mask != m->rm_mask)
362 if (x && rn_satisfies_leaf(v, x, off))
373 struct radix_node *rn_clist;
379 * Whenever we add a new leaf to the tree, we also add a parent node,
380 * so we allocate them as an array of two elements: the first one must be
381 * the leaf (see RNTORT() in route.c), the second one is the parent.
382 * This routine initializes the relevant fields of the nodes, so that
383 * the leaf is the left child of the parent node, and both nodes have
384 * (almost) all all fields filled as appropriate.
385 * (XXX some fields are left unset, see the '#if 0' section).
386 * The function returns a pointer to the parent node.
389 static struct radix_node *
390 rn_newpair(v, b, nodes)
393 struct radix_node nodes[2];
395 register struct radix_node *tt = nodes, *t = tt + 1;
397 t->rn_bmask = 0x80 >> (b & 7);
399 t->rn_offset = b >> 3;
401 #if 0 /* XXX perhaps we should fill these fields as well. */
402 t->rn_parent = t->rn_right = NULL;
405 tt->rn_dupedkey = NULL;
409 tt->rn_key = (caddr_t)v;
411 tt->rn_flags = t->rn_flags = RNF_ACTIVE;
412 tt->rn_mklist = t->rn_mklist = 0;
414 tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++;
416 tt->rn_ybro = rn_clist;
422 static struct radix_node *
423 rn_insert(v_arg, head, dupentry, nodes)
425 struct radix_node_head *head;
427 struct radix_node nodes[2];
430 struct radix_node *top = head->rnh_treetop;
431 int head_off = top->rn_offset, vlen = LEN(v);
432 register struct radix_node *t = rn_search(v_arg, top);
433 register caddr_t cp = v + head_off;
435 struct radix_node *tt;
437 * Find first bit at which v and t->rn_key differ
440 register caddr_t cp2 = t->rn_key + head_off;
441 register int cmp_res;
442 caddr_t cplim = v + vlen;
451 cmp_res = (cp[-1] ^ cp2[-1]) & 0xff;
452 for (b = (cp - v) << 3; cmp_res; b--)
456 register struct radix_node *p, *x = top;
460 if (cp[x->rn_offset] & x->rn_bmask)
464 } while (b > (unsigned) x->rn_bit);
465 /* x->rn_bit < b && x->rn_bit >= 0 */
468 log(LOG_DEBUG, "rn_insert: Going In:\n"), traverse(p);
470 t = rn_newpair(v_arg, b, nodes);
472 if ((cp[p->rn_offset] & p->rn_bmask) == 0)
477 t->rn_parent = p; /* frees x, p as temp vars below */
478 if ((cp[t->rn_offset] & t->rn_bmask) == 0) {
486 log(LOG_DEBUG, "rn_insert: Coming Out:\n"), traverse(p);
493 rn_addmask(n_arg, search, skip)
497 caddr_t netmask = (caddr_t)n_arg;
498 register struct radix_node *x;
499 register caddr_t cp, cplim;
500 register int b = 0, mlen, j;
501 int maskduplicated, m0, isnormal;
502 struct radix_node *saved_x;
503 static int last_zeroed = 0;
505 if ((mlen = LEN(netmask)) > max_keylen)
510 return (mask_rnhead->rnh_nodes);
512 bcopy(rn_ones + 1, addmask_key + 1, skip - 1);
513 if ((m0 = mlen) > skip)
514 bcopy(netmask + skip, addmask_key + skip, mlen - skip);
516 * Trim trailing zeroes.
518 for (cp = addmask_key + mlen; (cp > addmask_key) && cp[-1] == 0;)
520 mlen = cp - addmask_key;
522 if (m0 >= last_zeroed)
524 return (mask_rnhead->rnh_nodes);
526 if (m0 < last_zeroed)
527 bzero(addmask_key + m0, last_zeroed - m0);
528 *addmask_key = last_zeroed = mlen;
529 x = rn_search(addmask_key, rn_masktop);
530 if (bcmp(addmask_key, x->rn_key, mlen) != 0)
534 R_Zalloc(x, struct radix_node *, max_keylen + 2 * sizeof (*x));
535 if ((saved_x = x) == 0)
537 netmask = cp = (caddr_t)(x + 2);
538 bcopy(addmask_key, cp, mlen);
539 x = rn_insert(cp, mask_rnhead, &maskduplicated, x);
540 if (maskduplicated) {
541 log(LOG_ERR, "rn_addmask: mask impossibly already in tree");
546 * Calculate index of mask, and check for normalcy.
547 * First find the first byte with a 0 bit, then if there are
548 * more bits left (remember we already trimmed the trailing 0's),
549 * the pattern must be one of those in normal_chars[], or we have
550 * a non-contiguous mask.
552 cplim = netmask + mlen;
554 for (cp = netmask + skip; (cp < cplim) && *(u_char *)cp == 0xff;)
557 static char normal_chars[] = {
558 0, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, 0xff};
560 for (j = 0x80; (j & *cp) != 0; j >>= 1)
562 if (*cp != normal_chars[b] || cp != (cplim - 1))
565 b += (cp - netmask) << 3;
568 x->rn_flags |= RNF_NORMAL;
572 static int /* XXX: arbitrary ordering for non-contiguous masks */
573 rn_lexobetter(m_arg, n_arg)
576 register u_char *mp = m_arg, *np = n_arg, *lim;
578 if (LEN(mp) > LEN(np))
579 return 1; /* not really, but need to check longer one first */
580 if (LEN(mp) == LEN(np))
581 for (lim = mp + LEN(mp); mp < lim;)
587 static struct radix_mask *
588 rn_new_radix_mask(tt, next)
589 register struct radix_node *tt;
590 register struct radix_mask *next;
592 register struct radix_mask *m;
596 log(LOG_ERR, "Mask for route not entered\n");
600 m->rm_bit = tt->rn_bit;
601 m->rm_flags = tt->rn_flags;
602 if (tt->rn_flags & RNF_NORMAL)
605 m->rm_mask = tt->rn_mask;
612 rn_addroute(v_arg, n_arg, head, treenodes)
614 struct radix_node_head *head;
615 struct radix_node treenodes[2];
617 caddr_t v = (caddr_t)v_arg, netmask = (caddr_t)n_arg;
618 register struct radix_node *t, *x = 0, *tt;
619 struct radix_node *saved_tt, *top = head->rnh_treetop;
620 short b = 0, b_leaf = 0;
623 struct radix_mask *m, **mp;
626 * In dealing with non-contiguous masks, there may be
627 * many different routes which have the same mask.
628 * We will find it useful to have a unique pointer to
629 * the mask to speed avoiding duplicate references at
630 * nodes and possibly save time in calculating indices.
633 if ((x = rn_addmask(netmask, 0, top->rn_offset)) == 0)
640 * Deal with duplicated keys: attach node to previous instance
642 saved_tt = tt = rn_insert(v, head, &keyduplicated, treenodes);
644 for (t = tt; tt; t = tt, tt = tt->rn_dupedkey) {
646 /* permit multipath, if enabled for the family */
647 if (rn_mpath_capable(head) && netmask == tt->rn_mask) {
649 * go down to the end of multipaths, so that
650 * new entry goes into the end of rn_dupedkey
655 tt = tt->rn_dupedkey;
656 } while (tt && t->rn_mask == tt->rn_mask);
660 if (tt->rn_mask == netmask)
664 ((b_leaf < tt->rn_bit) /* index(netmask) > node */
665 || rn_refines(netmask, tt->rn_mask)
666 || rn_lexobetter(netmask, tt->rn_mask))))
670 * If the mask is not duplicated, we wouldn't
671 * find it among possible duplicate key entries
672 * anyway, so the above test doesn't hurt.
674 * We sort the masks for a duplicated key the same way as
675 * in a masklist -- most specific to least specific.
676 * This may require the unfortunate nuisance of relocating
677 * the head of the list.
679 * We also reverse, or doubly link the list through the
682 if (tt == saved_tt) {
683 struct radix_node *xx = x;
684 /* link in at head of list */
685 (tt = treenodes)->rn_dupedkey = t;
686 tt->rn_flags = t->rn_flags;
687 tt->rn_parent = x = t->rn_parent;
688 t->rn_parent = tt; /* parent */
693 saved_tt = tt; x = xx;
695 (tt = treenodes)->rn_dupedkey = t->rn_dupedkey;
697 tt->rn_parent = t; /* parent */
698 if (tt->rn_dupedkey) /* parent */
699 tt->rn_dupedkey->rn_parent = tt; /* parent */
702 t=tt+1; tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++;
703 tt->rn_twin = t; tt->rn_ybro = rn_clist; rn_clist = tt;
705 tt->rn_key = (caddr_t) v;
707 tt->rn_flags = RNF_ACTIVE;
713 tt->rn_mask = netmask;
714 tt->rn_bit = x->rn_bit;
715 tt->rn_flags |= x->rn_flags & RNF_NORMAL;
717 t = saved_tt->rn_parent;
720 b_leaf = -1 - t->rn_bit;
721 if (t->rn_right == saved_tt)
725 /* Promote general routes from below */
727 for (mp = &t->rn_mklist; x; x = x->rn_dupedkey)
728 if (x->rn_mask && (x->rn_bit >= b_leaf) && x->rn_mklist == 0) {
729 *mp = m = rn_new_radix_mask(x, 0);
733 } else if (x->rn_mklist) {
735 * Skip over masks whose index is > that of new node
737 for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist)
738 if (m->rm_bit >= b_leaf)
740 t->rn_mklist = m; *mp = 0;
743 /* Add new route to highest possible ancestor's list */
744 if ((netmask == 0) || (b > t->rn_bit ))
745 return tt; /* can't lift at all */
750 } while (b <= t->rn_bit && x != top);
752 * Search through routes associated with node to
753 * insert new route according to index.
754 * Need same criteria as when sorting dupedkeys to avoid
755 * double loop on deletion.
757 for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist) {
758 if (m->rm_bit < b_leaf)
760 if (m->rm_bit > b_leaf)
762 if (m->rm_flags & RNF_NORMAL) {
763 mmask = m->rm_leaf->rn_mask;
764 if (tt->rn_flags & RNF_NORMAL) {
766 "Non-unique normal route, mask not entered\n");
771 if (mmask == netmask) {
776 if (rn_refines(netmask, mmask)
777 || rn_lexobetter(netmask, mmask))
780 *mp = rn_new_radix_mask(tt, *mp);
785 rn_delete(v_arg, netmask_arg, head)
786 void *v_arg, *netmask_arg;
787 struct radix_node_head *head;
789 register struct radix_node *t, *p, *x, *tt;
790 struct radix_mask *m, *saved_m, **mp;
791 struct radix_node *dupedkey, *saved_tt, *top;
793 int b, head_off, vlen;
796 netmask = netmask_arg;
797 x = head->rnh_treetop;
798 tt = rn_search(v, x);
799 head_off = x->rn_offset;
804 bcmp(v + head_off, tt->rn_key + head_off, vlen - head_off))
807 * Delete our route from mask lists.
810 if ((x = rn_addmask(netmask, 1, head_off)) == 0)
813 while (tt->rn_mask != netmask)
814 if ((tt = tt->rn_dupedkey) == 0)
817 if (tt->rn_mask == 0 || (saved_m = m = tt->rn_mklist) == 0)
819 if (tt->rn_flags & RNF_NORMAL) {
820 if (m->rm_leaf != tt || m->rm_refs > 0) {
821 log(LOG_ERR, "rn_delete: inconsistent annotation\n");
822 return 0; /* dangling ref could cause disaster */
825 if (m->rm_mask != tt->rn_mask) {
826 log(LOG_ERR, "rn_delete: inconsistent annotation\n");
829 if (--m->rm_refs >= 0)
833 t = saved_tt->rn_parent;
835 goto on1; /* Wasn't lifted at all */
839 } while (b <= t->rn_bit && x != top);
840 for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist)
847 log(LOG_ERR, "rn_delete: couldn't find our annotation\n");
848 if (tt->rn_flags & RNF_NORMAL)
849 return (0); /* Dangling ref to us */
853 * Eliminate us from tree
855 if (tt->rn_flags & RNF_ROOT)
858 /* Get us out of the creation list */
859 for (t = rn_clist; t && t->rn_ybro != tt; t = t->rn_ybro) {}
860 if (t) t->rn_ybro = tt->rn_ybro;
863 dupedkey = saved_tt->rn_dupedkey;
866 * Here, tt is the deletion target and
867 * saved_tt is the head of the dupekey chain.
869 if (tt == saved_tt) {
870 /* remove from head of chain */
871 x = dupedkey; x->rn_parent = t;
872 if (t->rn_left == tt)
877 /* find node in front of tt on the chain */
878 for (x = p = saved_tt; p && p->rn_dupedkey != tt;)
881 p->rn_dupedkey = tt->rn_dupedkey;
882 if (tt->rn_dupedkey) /* parent */
883 tt->rn_dupedkey->rn_parent = p;
885 } else log(LOG_ERR, "rn_delete: couldn't find us\n");
888 if (t->rn_flags & RNF_ACTIVE) {
902 x->rn_left->rn_parent = x;
903 x->rn_right->rn_parent = x;
907 if (t->rn_left == tt)
912 if (p->rn_right == t)
918 * Demote routes attached to us.
921 if (x->rn_bit >= 0) {
922 for (mp = &x->rn_mklist; (m = *mp);)
926 /* If there are any key,mask pairs in a sibling
927 duped-key chain, some subset will appear sorted
928 in the same order attached to our mklist */
929 for (m = t->rn_mklist; m && x; x = x->rn_dupedkey)
930 if (m == x->rn_mklist) {
931 struct radix_mask *mm = m->rm_mklist;
933 if (--(m->rm_refs) < 0)
938 log(LOG_ERR, "rn_delete: Orphaned Mask %p at %p\n", m, x);
942 * We may be holding an active internal node in the tree.
953 t->rn_left->rn_parent = t;
954 t->rn_right->rn_parent = t;
962 tt->rn_flags &= ~RNF_ACTIVE;
963 tt[1].rn_flags &= ~RNF_ACTIVE;
968 * This is the same as rn_walktree() except for the parameters and the
972 rn_walktree_from(h, a, m, f, w)
973 struct radix_node_head *h;
979 struct radix_node *base, *next;
980 u_char *xa = (u_char *)a;
981 u_char *xm = (u_char *)m;
982 register struct radix_node *rn, *last = 0 /* shut up gcc */;
987 * rn_search_m is sort-of-open-coded here. We cannot use the
988 * function because we need to keep track of the last node seen.
990 /* printf("about to search\n"); */
991 for (rn = h->rnh_treetop; rn->rn_bit >= 0; ) {
993 /* printf("rn_bit %d, rn_bmask %x, xm[rn_offset] %x\n",
994 rn->rn_bit, rn->rn_bmask, xm[rn->rn_offset]); */
995 if (!(rn->rn_bmask & xm[rn->rn_offset])) {
998 if (rn->rn_bmask & xa[rn->rn_offset]) {
1004 /* printf("done searching\n"); */
1007 * Two cases: either we stepped off the end of our mask,
1008 * in which case last == rn, or we reached a leaf, in which
1009 * case we want to start from the last node we looked at.
1010 * Either way, last is the node we want to start from.
1015 /* printf("rn %p, lastb %d\n", rn, lastb);*/
1018 * This gets complicated because we may delete the node
1019 * while applying the function f to it, so we need to calculate
1020 * the successor node in advance.
1022 while (rn->rn_bit >= 0)
1026 /* printf("node %p (%d)\n", rn, rn->rn_bit); */
1028 /* If at right child go back up, otherwise, go right */
1029 while (rn->rn_parent->rn_right == rn
1030 && !(rn->rn_flags & RNF_ROOT)) {
1033 /* if went up beyond last, stop */
1034 if (rn->rn_bit <= lastb) {
1036 /* printf("up too far\n"); */
1038 * XXX we should jump to the 'Process leaves'
1039 * part, because the values of 'rn' and 'next'
1040 * we compute will not be used. Not a big deal
1041 * because this loop will terminate, but it is
1042 * inefficient and hard to understand!
1048 * At the top of the tree, no need to traverse the right
1049 * half, prevent the traversal of the entire tree in the
1050 * case of default route.
1052 if (rn->rn_parent->rn_flags & RNF_ROOT)
1055 /* Find the next *leaf* since next node might vanish, too */
1056 for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)
1059 /* Process leaves */
1060 while ((rn = base) != 0) {
1061 base = rn->rn_dupedkey;
1062 /* printf("leaf %p\n", rn); */
1063 if (!(rn->rn_flags & RNF_ROOT)
1064 && (error = (*f)(rn, w)))
1069 if (rn->rn_flags & RNF_ROOT) {
1070 /* printf("root, stopping"); */
1079 rn_walktree(h, f, w)
1080 struct radix_node_head *h;
1085 struct radix_node *base, *next;
1086 register struct radix_node *rn = h->rnh_treetop;
1088 * This gets complicated because we may delete the node
1089 * while applying the function f to it, so we need to calculate
1090 * the successor node in advance.
1093 /* First time through node, go left */
1094 while (rn->rn_bit >= 0)
1098 /* If at right child go back up, otherwise, go right */
1099 while (rn->rn_parent->rn_right == rn
1100 && (rn->rn_flags & RNF_ROOT) == 0)
1102 /* Find the next *leaf* since next node might vanish, too */
1103 for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)
1106 /* Process leaves */
1107 while ((rn = base)) {
1108 base = rn->rn_dupedkey;
1109 if (!(rn->rn_flags & RNF_ROOT)
1110 && (error = (*f)(rn, w)))
1114 if (rn->rn_flags & RNF_ROOT)
1121 * Allocate and initialize an empty tree. This has 3 nodes, which are
1122 * part of the radix_node_head (in the order <left,root,right>) and are
1123 * marked RNF_ROOT so they cannot be freed.
1124 * The leaves have all-zero and all-one keys, with significant
1125 * bits starting at 'off'.
1126 * Return 1 on success, 0 on error.
1129 rn_inithead(head, off)
1133 register struct radix_node_head *rnh;
1134 register struct radix_node *t, *tt, *ttt;
1137 R_Zalloc(rnh, struct radix_node_head *, sizeof (*rnh));
1141 RADIX_NODE_HEAD_LOCK_INIT(rnh);
1144 t = rn_newpair(rn_zeros, off, rnh->rnh_nodes);
1145 ttt = rnh->rnh_nodes + 2;
1148 tt = t->rn_left; /* ... which in turn is rnh->rnh_nodes */
1149 tt->rn_flags = t->rn_flags = RNF_ROOT | RNF_ACTIVE;
1150 tt->rn_bit = -1 - off;
1152 ttt->rn_key = rn_ones;
1153 rnh->rnh_addaddr = rn_addroute;
1154 rnh->rnh_deladdr = rn_delete;
1155 rnh->rnh_matchaddr = rn_match;
1156 rnh->rnh_lookup = rn_lookup;
1157 rnh->rnh_walktree = rn_walktree;
1158 rnh->rnh_walktree_from = rn_walktree_from;
1159 rnh->rnh_treetop = t;
1169 if (max_keylen == 0) {
1171 "rn_init: radix functions require max_keylen be set\n");
1174 R_Malloc(rn_zeros, char *, 3 * max_keylen);
1175 if (rn_zeros == NULL)
1177 bzero(rn_zeros, 3 * max_keylen);
1178 rn_ones = cp = rn_zeros + max_keylen;
1179 addmask_key = cplim = rn_ones + max_keylen;
1182 if (rn_inithead((void **)(void *)&mask_rnhead, 0) == 0)