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 $
35 * $DragonFly: src/sys/net/radix.c,v 1.6 2004/12/14 18:46:08 hsu Exp $
39 * Routines to build and maintain radix trees for routing lookups.
41 #include <sys/param.h>
43 #include <sys/systm.h>
44 #include <sys/malloc.h>
45 #include <sys/domain.h>
49 #include <sys/syslog.h>
50 #include <net/radix.h>
53 * The arguments to the radix functions are really counted byte arrays with
54 * the length in the first byte. struct sockaddr's fit this type structurally.
56 #define clen(c) (*(u_char *)(c))
58 static int rn_walktree_from(struct radix_node_head *h, u_char *a, u_char *m,
59 walktree_f_t *f, void *w);
60 static int rn_walktree(struct radix_node_head *, walktree_f_t *, void *);
62 static struct radix_node
63 *rn_insert(char *, struct radix_node_head *, boolean_t *,
64 struct radix_node [2]),
65 *rn_newpair(char *, int, struct radix_node[2]),
66 *rn_search(const char *, struct radix_node *),
67 *rn_search_m(const char *, struct radix_node *, const char *);
69 static int max_keylen;
70 static struct radix_mask *rn_mkfreelist;
71 static struct radix_node_head *mask_rnhead;
72 static char *addmask_key;
73 static char normal_chars[] = {0, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, -1};
74 static char *rn_zeros, *rn_ones;
76 #define rn_masktop (mask_rnhead->rnh_treetop)
78 static int rn_lexobetter(char *m, char *n);
79 static struct radix_mask *
80 rn_new_radix_mask(struct radix_node *tt, struct radix_mask *nextmask);
82 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip);
84 static __inline struct radix_mask *
85 MKGet(struct radix_mask **l)
93 R_Malloc(m, struct radix_mask *, sizeof (*(m)));
99 MKFree(struct radix_mask **l, struct radix_mask *m)
106 * The data structure for the keys is a radix tree with one way
107 * branching removed. The index rn_bit at an internal node n represents a bit
108 * position to be tested. The tree is arranged so that all descendants
109 * of a node n have keys whose bits all agree up to position rn_bit - 1.
110 * (We say the index of n is rn_bit.)
112 * There is at least one descendant which has a one bit at position rn_bit,
113 * and at least one with a zero there.
115 * A route is determined by a pair of key and mask. We require that the
116 * bit-wise logical and of the key and mask to be the key.
117 * We define the index of a route to associated with the mask to be
118 * the first bit number in the mask where 0 occurs (with bit number 0
119 * representing the highest order bit).
121 * We say a mask is normal if every bit is 0, past the index of the mask.
122 * If a node n has a descendant (k, m) with index(m) == index(n) == rn_bit,
123 * and m is a normal mask, then the route applies to every descendant of n.
124 * If the index(m) < rn_bit, this implies the trailing last few bits of k
125 * before bit b are all 0, (and hence consequently true of every descendant
126 * of n), so the route applies to all descendants of the node as well.
128 * Similar logic shows that a non-normal mask m such that
129 * index(m) <= index(n) could potentially apply to many children of n.
130 * Thus, for each non-host route, we attach its mask to a list at an internal
131 * node as high in the tree as we can go.
133 * The present version of the code makes use of normal routes in short-
134 * circuiting an explict mask and compare operation when testing whether
135 * a key satisfies a normal route, and also in remembering the unique leaf
136 * that governs a subtree.
139 static struct radix_node *
140 rn_search(const char *v, struct radix_node *head)
142 struct radix_node *x;
145 while (x->rn_bit >= 0) {
146 if (x->rn_bmask & v[x->rn_offset])
154 static struct radix_node *
155 rn_search_m(const char *v, struct radix_node *head, const char *m)
157 struct radix_node *x;
159 for (x = head; x->rn_bit >= 0;) {
160 if ((x->rn_bmask & m[x->rn_offset]) &&
161 (x->rn_bmask & v[x->rn_offset]))
170 rn_refines(char *m, char *n)
173 int longer = clen(n++) - clen(m++);
174 boolean_t masks_are_equal = TRUE;
176 lim2 = lim = n + clen(n);
183 masks_are_equal = FALSE;
188 if (masks_are_equal && (longer < 0))
189 for (lim2 = m - longer; m < lim2; )
192 return (!masks_are_equal);
196 rn_lookup(char *key, char *mask, struct radix_node_head *head)
198 struct radix_node *x;
199 char *netmask = NULL;
202 x = rn_addmask(mask, TRUE, head->rnh_treetop->rn_offset);
207 x = rn_match(key, head);
208 if (x != NULL && netmask != NULL) {
209 while (x != NULL && x->rn_mask != netmask)
216 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip)
218 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
220 int length = min(clen(cp), clen(cp2));
225 length = min(length, clen(cp3));
229 for (cp += skip; cp < cplim; cp++, cp2++, cp3++)
230 if ((*cp ^ *cp2) & *cp3)
236 rn_match(char *key, struct radix_node_head *head)
238 struct radix_node *t, *x;
239 char *cp = key, *cp2;
241 struct radix_node *saved_t, *top = head->rnh_treetop;
242 int off = top->rn_offset, klen, matched_off;
245 t = rn_search(key, top);
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...
257 if (t->rn_mask != NULL)
258 klen = clen(t->rn_mask);
261 cp += off; cp2 = t->rn_key + off; cplim = key + klen;
262 for (; cp < cplim; cp++, cp2++)
266 * This extra grot is in case we are explicitly asked
267 * to look up the default. Ugh!
269 * Never return the root node itself, it seems to cause a
272 if (t->rn_flags & RNF_ROOT)
276 test = (*cp ^ *cp2) & 0xff; /* find first bit that differs */
277 for (b = 7; (test >>= 1) > 0;)
279 matched_off = cp - key;
280 b += matched_off << 3;
283 * If there is a host route in a duped-key chain, it will be first.
285 if ((saved_t = t)->rn_mask == NULL)
287 for (; t; t = t->rn_dupedkey) {
289 * Even if we don't match exactly as a host,
290 * we may match if the leaf we wound up at is
293 if (t->rn_flags & RNF_NORMAL) {
294 if (rn_bit <= t->rn_bit)
296 } else if (rn_satisfies_leaf(key, t, matched_off))
300 /* start searching up the tree */
302 struct radix_mask *m;
306 * If non-contiguous masks ever become important
307 * we can restore the masking and open coding of
308 * the search and satisfaction test and put the
309 * calculation of "off" back before the "do".
313 if (m->rm_flags & RNF_NORMAL) {
314 if (rn_bit <= m->rm_bit)
317 off = min(t->rn_offset, matched_off);
318 x = rn_search_m(key, t, m->rm_mask);
319 while (x != NULL && x->rn_mask != m->rm_mask)
321 if (x && rn_satisfies_leaf(key, x, off))
332 struct radix_node *rn_clist;
337 static struct radix_node *
338 rn_newpair(char *key, int indexbit, struct radix_node nodes[2])
340 struct radix_node *leaf = nodes, *interior = leaf + 1;
342 interior->rn_bit = indexbit;
343 interior->rn_bmask = 0x80 >> (indexbit & 0x7);
344 interior->rn_offset = indexbit >> 3;
345 interior->rn_left = leaf;
346 interior->rn_mklist = NULL;
350 leaf->rn_parent = interior;
351 leaf->rn_flags = interior->rn_flags = RNF_ACTIVE;
352 leaf->rn_mklist = NULL;
355 leaf->rn_info = rn_nodenum++;
356 interior->rn_info = rn_nodenum++;
357 leaf->rn_twin = interior;
358 leaf->rn_ybro = rn_clist;
364 static struct radix_node *
367 struct radix_node_head *head,
369 struct radix_node nodes[2])
371 struct radix_node *top = head->rnh_treetop;
372 int head_off = top->rn_offset, klen = clen(key);
373 struct radix_node *t = rn_search(key, top);
374 char *cp = key + head_off;
376 struct radix_node *tt;
378 * Find first bit at which the key and t->rn_key differ
381 char *cp2 = t->rn_key + head_off;
383 char *cplim = key + klen;
392 cmp_res = (cp[-1] ^ cp2[-1]) & 0xff;
393 for (b = (cp - key) << 3; cmp_res; b--)
397 struct radix_node *p, *x = top;
402 if (cp[x->rn_offset] & x->rn_bmask)
406 } while (b > (unsigned) x->rn_bit);
407 /* x->rn_bit < b && x->rn_bit >= 0 */
410 log(LOG_DEBUG, "rn_insert: Going In:\n"), traverse(p);
412 t = rn_newpair(key, b, nodes);
414 if ((cp[p->rn_offset] & p->rn_bmask) == 0)
419 t->rn_parent = p; /* frees x, p as temp vars below */
420 if ((cp[t->rn_offset] & t->rn_bmask) == 0) {
428 log(LOG_DEBUG, "rn_insert: Coming Out:\n"), traverse(p);
435 rn_addmask(char *netmask, boolean_t search, int skip)
437 struct radix_node *x, *saved_x;
440 boolean_t maskduplicated;
442 static int last_zeroed = 0;
444 if ((mlen = clen(netmask)) > max_keylen)
449 return (mask_rnhead->rnh_nodes);
451 bcopy(rn_ones + 1, addmask_key + 1, skip - 1);
452 if ((m0 = mlen) > skip)
453 bcopy(netmask + skip, addmask_key + skip, mlen - skip);
455 * Trim trailing zeroes.
457 for (cp = addmask_key + mlen; (cp > addmask_key) && cp[-1] == 0;)
459 mlen = cp - addmask_key;
461 if (m0 >= last_zeroed)
463 return (mask_rnhead->rnh_nodes);
465 if (m0 < last_zeroed)
466 bzero(addmask_key + m0, last_zeroed - m0);
467 *addmask_key = last_zeroed = mlen;
468 x = rn_search(addmask_key, rn_masktop);
469 if (bcmp(addmask_key, x->rn_key, mlen) != 0)
471 if (x != NULL || search)
473 R_Malloc(x, struct radix_node *, max_keylen + 2 * sizeof (*x));
474 if ((saved_x = x) == NULL)
476 bzero(x, max_keylen + 2 * sizeof (*x));
477 netmask = cp = (char *)(x + 2);
478 bcopy(addmask_key, cp, mlen);
479 x = rn_insert(cp, mask_rnhead, &maskduplicated, x);
480 if (maskduplicated) {
481 log(LOG_ERR, "rn_addmask: mask impossibly already in tree");
486 * Calculate index of mask, and check for normalcy.
488 cplim = netmask + mlen; isnormal = 1;
489 for (cp = netmask + skip; cp < cplim && clen(cp) == 0xff;)
492 for (j = 0x80; (j & *cp) != 0; j >>= 1)
494 if (*cp != normal_chars[b] || cp != (cplim - 1))
497 b += (cp - netmask) << 3;
500 x->rn_flags |= RNF_NORMAL;
504 static boolean_t /* XXX: arbitrary ordering for non-contiguous masks */
505 rn_lexobetter(char *mp, char *np)
509 if ((unsigned) *mp > (unsigned) *np)
510 return TRUE;/* not really, but need to check longer one first */
512 for (lim = mp + clen(mp); mp < lim;)
518 static struct radix_mask *
519 rn_new_radix_mask(struct radix_node *tt, struct radix_mask *nextmask)
521 struct radix_mask *m;
523 m = MKGet(&rn_mkfreelist);
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;
535 m->rm_next = nextmask;
541 rn_addroute(char *key, char *netmask, struct radix_node_head *head,
542 struct radix_node treenodes[2])
544 struct radix_node *t, *x = NULL, *tt;
545 struct radix_node *saved_tt, *top = head->rnh_treetop;
546 short b = 0, b_leaf = 0;
547 boolean_t keyduplicated;
549 struct radix_mask *m, **mp;
552 * In dealing with non-contiguous masks, there may be
553 * many different routes which have the same mask.
554 * We will find it useful to have a unique pointer to
555 * the mask to speed avoiding duplicate references at
556 * nodes and possibly save time in calculating indices.
558 if (netmask != NULL) {
559 if ((x = rn_addmask(netmask, FALSE, top->rn_offset)) == NULL)
566 * Deal with duplicated keys: attach node to previous instance
568 saved_tt = tt = rn_insert(key, head, &keyduplicated, treenodes);
570 for (t = tt; tt; t = tt, tt = tt->rn_dupedkey) {
571 if (tt->rn_mask == netmask)
573 if (netmask == NULL ||
575 ((b_leaf < tt->rn_bit) /* index(netmask) > node */
576 || rn_refines(netmask, tt->rn_mask)
577 || rn_lexobetter(netmask, tt->rn_mask))))
581 * If the mask is not duplicated, we wouldn't
582 * find it among possible duplicate key entries
583 * anyway, so the above test doesn't hurt.
585 * We sort the masks for a duplicated key the same way as
586 * in a masklist -- most specific to least specific.
587 * This may require the unfortunate nuisance of relocating
588 * the head of the list.
590 if (tt == saved_tt) {
591 struct radix_node *xx = x;
592 /* link in at head of list */
593 (tt = treenodes)->rn_dupedkey = t;
594 tt->rn_flags = t->rn_flags;
595 tt->rn_parent = x = t->rn_parent;
596 t->rn_parent = tt; /* parent */
601 saved_tt = tt; x = xx;
603 (tt = treenodes)->rn_dupedkey = t->rn_dupedkey;
605 tt->rn_parent = t; /* parent */
606 if (tt->rn_dupedkey != NULL) /* parent */
607 tt->rn_dupedkey->rn_parent = tt; /* parent */
610 t=tt+1; tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++;
611 tt->rn_twin = t; tt->rn_ybro = rn_clist; rn_clist = tt;
615 tt->rn_flags = RNF_ACTIVE;
620 if (netmask != NULL) {
621 tt->rn_mask = netmask;
622 tt->rn_bit = x->rn_bit;
623 tt->rn_flags |= x->rn_flags & RNF_NORMAL;
625 t = saved_tt->rn_parent;
628 b_leaf = -1 - t->rn_bit;
629 if (t->rn_right == saved_tt)
633 /* Promote general routes from below */
637 if (x->rn_mask != NULL &&
638 x->rn_bit >= b_leaf &&
639 x->rn_mklist == NULL) {
640 *mp = m = rn_new_radix_mask(x, NULL);
646 } else if (x->rn_mklist != NULL) {
648 * Skip over masks whose index is > that of new node
650 for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_next)
651 if (m->rm_bit >= b_leaf)
657 /* Add new route to highest possible ancestor's list */
658 if ((netmask == NULL) || (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_next) {
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) || rn_lexobetter(netmask, mmask))
693 *mp = rn_new_radix_mask(tt, *mp);
698 rn_delete(char *key, char *netmask, struct radix_node_head *head)
700 struct radix_node *t, *p, *x, *tt;
701 struct radix_mask *m, *saved_m, **mp;
702 struct radix_node *dupedkey, *saved_tt, *top;
703 int b, head_off, klen;
705 x = head->rnh_treetop;
706 tt = rn_search(key, x);
707 head_off = x->rn_offset;
712 bcmp(key + head_off, tt->rn_key + head_off, klen - head_off))
715 * Delete our route from mask lists.
717 if (netmask != NULL) {
718 if ((x = rn_addmask(netmask, TRUE, head_off)) == NULL)
721 while (tt->rn_mask != netmask)
722 if ((tt = tt->rn_dupedkey) == NULL)
725 if (tt->rn_mask == NULL || (saved_m = m = tt->rn_mklist) == NULL)
727 if (tt->rn_flags & RNF_NORMAL) {
728 if (m->rm_leaf != tt || m->rm_refs > 0) {
729 log(LOG_ERR, "rn_delete: inconsistent annotation\n");
730 return (NULL); /* dangling ref could cause disaster */
733 if (m->rm_mask != tt->rn_mask) {
734 log(LOG_ERR, "rn_delete: inconsistent annotation\n");
737 if (--m->rm_refs >= 0)
741 t = saved_tt->rn_parent;
743 goto on1; /* Wasn't lifted at all */
747 } while (b <= t->rn_bit && x != top);
748 for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_next)
751 MKFree(&rn_mkfreelist, m);
755 log(LOG_ERR, "rn_delete: couldn't find our annotation\n");
756 if (tt->rn_flags & RNF_NORMAL)
757 return (NULL); /* Dangling ref to us */
761 * Eliminate us from tree
763 if (tt->rn_flags & RNF_ROOT)
766 /* Get us out of the creation list */
767 for (t = rn_clist; t && t->rn_ybro != tt; t = t->rn_ybro) {}
768 if (t) t->rn_ybro = tt->rn_ybro;
771 dupedkey = saved_tt->rn_dupedkey;
772 if (dupedkey != NULL) {
774 * at this point, tt is the deletion target and saved_tt
775 * is the head of the dupekey chain
777 if (tt == saved_tt) {
778 /* remove from head of chain */
779 x = dupedkey; x->rn_parent = t;
780 if (t->rn_left == tt)
785 /* find node in front of tt on the chain */
786 for (x = p = saved_tt; p && p->rn_dupedkey != tt;)
789 p->rn_dupedkey = tt->rn_dupedkey;
790 if (tt->rn_dupedkey) /* parent */
791 tt->rn_dupedkey->rn_parent = p;
793 } else log(LOG_ERR, "rn_delete: couldn't find us\n");
796 if (t->rn_flags & RNF_ACTIVE) {
810 x->rn_left->rn_parent = x;
811 x->rn_right->rn_parent = x;
815 if (t->rn_left == tt)
820 if (p->rn_right == t)
826 * Demote routes attached to us.
828 if (t->rn_mklist != NULL) {
829 if (x->rn_bit >= 0) {
830 for (mp = &x->rn_mklist; (m = *mp);)
834 /* If there are any key,mask pairs in a sibling
835 duped-key chain, some subset will appear sorted
836 in the same order attached to our mklist */
837 for (m = t->rn_mklist; m && x; x = x->rn_dupedkey)
838 if (m == x->rn_mklist) {
839 struct radix_mask *mm = m->rm_next;
842 if (--(m->rm_refs) < 0)
843 MKFree(&rn_mkfreelist, m);
848 "rn_delete: Orphaned Mask %p at %p\n",
849 (void *)m, (void *)x);
853 * We may be holding an active internal node in the tree.
864 t->rn_left->rn_parent = t;
865 t->rn_right->rn_parent = t;
873 tt->rn_flags &= ~RNF_ACTIVE;
874 tt[1].rn_flags &= ~RNF_ACTIVE;
879 * This is the same as rn_walktree() except for the parameters and the
883 rn_walktree_from(struct radix_node_head *h, u_char *xa, u_char *xm,
884 walktree_f_t *f, void *w)
886 struct radix_node *base, *next;
887 struct radix_node *rn, *last = NULL /* shut up gcc */;
892 * rn_search_m is sort-of-open-coded here.
894 /* printf("about to search\n"); */
895 for (rn = h->rnh_treetop; rn->rn_bit >= 0; ) {
897 /* printf("rn_bit %d, rn_bmask %x, xm[rn_offset] %x\n",
898 rn->rn_bit, rn->rn_bmask, xm[rn->rn_offset]); */
899 if (!(rn->rn_bmask & xm[rn->rn_offset])) {
902 if (rn->rn_bmask & xa[rn->rn_offset]) {
908 /* printf("done searching\n"); */
911 * Two cases: either we stepped off the end of our mask,
912 * in which case last == rn, or we reached a leaf, in which
913 * case we want to start from the last node we looked at.
914 * Either way, last is the node we want to start from.
919 /* printf("rn %p, lastb %d\n", rn, lastb);*/
922 * This gets complicated because we may delete the node
923 * while applying the function f to it, so we need to calculate
924 * the successor node in advance.
926 while (rn->rn_bit >= 0)
930 /* printf("node %p (%d)\n", rn, rn->rn_bit); */
932 /* If at right child go back up, otherwise, go right */
933 while (rn->rn_parent->rn_right == rn &&
934 !(rn->rn_flags & RNF_ROOT)) {
937 /* if went up beyond last, stop */
938 if (rn->rn_bit < lastb) {
940 /* printf("up too far\n"); */
944 /* Find the next *leaf* since next node might vanish, too */
945 for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)
949 while ((rn = base) != NULL) {
950 base = rn->rn_dupedkey;
951 /* printf("leaf %p\n", rn); */
952 if (!(rn->rn_flags & RNF_ROOT) && (error = (*f)(rn, w)))
957 if (rn->rn_flags & RNF_ROOT) {
958 /* printf("root, stopping"); */
967 rn_walktree(struct radix_node_head *h, walktree_f_t *f, void *w)
969 struct radix_node *base, *next;
970 struct radix_node *rn = h->rnh_treetop;
974 * This gets complicated because we may delete the node
975 * while applying the function f to it, so we need to calculate
976 * the successor node in advance.
978 /* First time through node, go left */
979 while (rn->rn_bit >= 0)
983 /* If at right child go back up, otherwise, go right */
984 while (rn->rn_parent->rn_right == rn &&
985 !(rn->rn_flags & RNF_ROOT))
987 /* Find the next *leaf* since next node might vanish, too */
988 for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)
992 while ((rn = base)) {
993 base = rn->rn_dupedkey;
994 if (!(rn->rn_flags & RNF_ROOT) && (error = (*f)(rn, w)))
998 if (rn->rn_flags & RNF_ROOT)
1005 rn_inithead(void **head, int off)
1007 struct radix_node_head *rnh;
1008 struct radix_node *t, *left, *right;
1012 R_Malloc(rnh, struct radix_node_head *, sizeof (*rnh));
1015 bzero(rnh, sizeof (*rnh));
1018 t = rn_newpair(rn_zeros, off, rnh->rnh_nodes);
1019 right = rnh->rnh_nodes + 2;
1020 t->rn_right = right;
1024 left->rn_flags = t->rn_flags = RNF_ROOT | RNF_ACTIVE;
1025 left->rn_bit = -1 - off;
1028 right->rn_key = rn_ones;
1030 rnh->rnh_addaddr = rn_addroute;
1031 rnh->rnh_deladdr = rn_delete;
1032 rnh->rnh_matchaddr = rn_match;
1033 rnh->rnh_lookup = rn_lookup;
1034 rnh->rnh_walktree = rn_walktree;
1035 rnh->rnh_walktree_from = rn_walktree_from;
1036 rnh->rnh_treetop = t;
1048 for (dom = domains; dom; dom = dom->dom_next)
1049 if (dom->dom_maxrtkey > max_keylen)
1050 max_keylen = dom->dom_maxrtkey;
1052 if (max_keylen == 0) {
1054 "rn_init: radix functions require max_keylen be set\n");
1057 R_Malloc(rn_zeros, char *, 3 * max_keylen);
1058 if (rn_zeros == NULL)
1060 bzero(rn_zeros, 3 * max_keylen);
1061 rn_ones = cp = rn_zeros + max_keylen;
1062 addmask_key = cplim = rn_ones + max_keylen;
1065 if (rn_inithead((void **)&mask_rnhead, 0) == 0)