4 * Copyright (c) 1988, 1989, 1993
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
16 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 * @(#)radix.c 8.6 (Berkeley) 10/17/95
32 * Routines to build and maintain radix trees for routing lookups.
34 #if defined(KERNEL) || defined(_KERNEL)
40 #define __SYS_ATOMIC_OPS_H__
41 #if !defined(__svr4__) && !defined(__SVR4) && !defined(__osf__) && \
42 !defined(__hpux) && !defined(__sgi)
43 #include <sys/cdefs.h>
54 # define _IPV6_SWTAB_H
55 # define _PROTO_NET_H_
56 # define _PROTO_IPV6_H
57 # include <sys/malloc.h>
60 #include <sys/param.h>
62 #include <sys/systm.h>
64 void panic __P((char *str));
73 #include <sys/syslog.h>
76 #include <netinet/in.h>
77 #include <sys/socket.h>
79 #include "netinet/ip_compat.h"
80 #include "netinet/ip_fil.h"
82 #include "radix_ipf.h"
91 static struct radix_mask *rn_mkfreelist;
92 static struct radix_node_head *mask_rnhead;
93 static char *addmask_key;
94 static u_char normal_chars[] = {0, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, 0xff};
95 static char *rn_zeros = NULL, *rn_ones = NULL;
97 #define rn_masktop (mask_rnhead->rnh_treetop)
99 #define Bcmp(a, b, l) (l == 0 ? 0 : bcmp((caddr_t)(a), (caddr_t)(b), (u_long)l))
101 static int rn_satisfies_leaf __P((char *, struct radix_node *, int));
102 static int rn_lexobetter __P((void *, void *));
103 static struct radix_mask *rn_new_radix_mask __P((struct radix_node *,
104 struct radix_mask *));
105 static int rn_freenode __P((struct radix_node *, void *));
108 * The data structure for the keys is a radix tree with one way
109 * branching removed. The index rn_b at an internal node n represents a bit
110 * position to be tested. The tree is arranged so that all descendants
111 * of a node n have keys whose bits all agree up to position rn_b - 1.
112 * (We say the index of n is rn_b.)
114 * There is at least one descendant which has a one bit at position rn_b,
115 * and at least one with a zero there.
117 * A route is determined by a pair of key and mask. We require that the
118 * bit-wise logical and of the key and mask to be the key.
119 * We define the index of a route to associated with the mask to be
120 * the first bit number in the mask where 0 occurs (with bit number 0
121 * representing the highest order bit).
123 * We say a mask is normal if every bit is 0, past the index of the mask.
124 * If a node n has a descendant (k, m) with index(m) == index(n) == rn_b,
125 * and m is a normal mask, then the route applies to every descendant of n.
126 * If the index(m) < rn_b, this implies the trailing last few bits of k
127 * before bit b are all 0, (and hence consequently true of every descendant
128 * of n), so the route applies to all descendants of the node as well.
130 * Similar logic shows that a non-normal mask m such that
131 * index(m) <= index(n) could potentially apply to many children of n.
132 * Thus, for each non-host route, we attach its mask to a list at an internal
133 * node as high in the tree as we can go.
135 * The present version of the code makes use of normal routes in short-
136 * circuiting an explict mask and compare operation when testing whether
137 * a key satisfies a normal route, and also in remembering the unique leaf
138 * that governs a subtree.
142 rn_search(v_arg, head)
144 struct radix_node *head;
146 struct radix_node *x;
149 for (x = head, v = v_arg; x->rn_b >= 0;) {
150 if (x->rn_bmask & v[x->rn_off])
159 rn_search_m(v_arg, head, m_arg)
160 struct radix_node *head;
163 struct radix_node *x;
164 caddr_t v = v_arg, m = m_arg;
166 for (x = head; x->rn_b >= 0;) {
167 if ((x->rn_bmask & m[x->rn_off]) &&
168 (x->rn_bmask & v[x->rn_off]))
177 rn_refines(m_arg, n_arg)
180 caddr_t m = m_arg, n = n_arg;
181 caddr_t lim, lim2 = lim = n + *(u_char *)n;
182 int longer = (*(u_char *)n++) - (int)(*(u_char *)m++);
183 int masks_are_equal = 1;
196 if (masks_are_equal && (longer < 0))
197 for (lim2 = m - longer; m < lim2; )
200 return (!masks_are_equal);
204 rn_lookup(v_arg, m_arg, head)
206 struct radix_node_head *head;
208 struct radix_node *x;
212 if ((x = rn_addmask(m_arg, 1, head->rnh_treetop->rn_off)) == 0)
216 x = rn_match(v_arg, head);
218 while (x && x->rn_mask != netmask)
225 rn_satisfies_leaf(trial, leaf, skip)
227 struct radix_node *leaf;
230 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
232 int length = min(*(u_char *)cp, *(u_char *)cp2);
237 length = min(length, *(u_char *)cp3);
241 for (cp += skip; cp < cplim; cp++, cp2++, cp3++)
242 if ((*cp ^ *cp2) & *cp3)
248 rn_match(v_arg, head)
250 struct radix_node_head *head;
253 struct radix_node *t = head->rnh_treetop, *x;
256 struct radix_node *saved_t, *top = t;
257 int off = t->rn_off, vlen = *(u_char *)cp, matched_off;
261 * Open code rn_search(v, top) to avoid overhead of extra
264 for (; t->rn_b >= 0; ) {
265 if (t->rn_bmask & cp[t->rn_off])
271 * See if we match exactly as a host destination
272 * or at least learn how many bits match, for normal mask finesse.
274 * It doesn't hurt us to limit how many bytes to check
275 * to the length of the mask, since if it matches we had a genuine
276 * match and the leaf we have is the most specific one anyway;
277 * if it didn't match with a shorter length it would fail
278 * with a long one. This wins big for class B&C netmasks which
279 * are probably the most common case...
282 vlen = *(u_char *)t->rn_mask;
284 cp2 = t->rn_key + off;
286 for (; cp < cplim; cp++, cp2++)
290 * This extra grot is in case we are explicitly asked
291 * to look up the default. Ugh!
293 if ((t->rn_flags & RNF_ROOT) && t->rn_dupedkey)
297 test = (*cp ^ *cp2) & 0xff; /* find first bit that differs */
298 for (b = 7; (test >>= 1) > 0;)
300 matched_off = cp - v;
301 b += matched_off << 3;
304 * If there is a host route in a duped-key chain, it will be first.
306 if ((saved_t = t)->rn_mask == 0)
308 for (; t; t = t->rn_dupedkey)
310 * Even if we don't match exactly as a host,
311 * we may match if the leaf we wound up at is
314 if (t->rn_flags & RNF_NORMAL) {
317 } else if (rn_satisfies_leaf(v, t, matched_off))
320 /* start searching up the tree */
322 struct radix_mask *m;
327 * If non-contiguous masks ever become important
328 * we can restore the masking and open coding of
329 * the search and satisfaction test and put the
330 * calculation of "off" back before the "do".
333 if (m->rm_flags & RNF_NORMAL) {
337 off = min(t->rn_off, matched_off);
338 x = rn_search_m(v, t, m->rm_mask);
339 while (x && x->rn_mask != m->rm_mask)
341 if (x && rn_satisfies_leaf(v, x, off))
353 struct radix_node *rn_clist;
359 rn_newpair(v, b, nodes)
362 struct radix_node nodes[2];
364 struct radix_node *tt = nodes, *t = tt + 1;
366 t->rn_bmask = 0x80 >> (b & 7);
370 tt->rn_key = (caddr_t)v;
372 tt->rn_flags = t->rn_flags = RNF_ACTIVE;
374 tt->rn_info = rn_nodenum++;
375 t->rn_info = rn_nodenum++;
377 tt->rn_ybro = rn_clist;
384 rn_insert(v_arg, head, dupentry, nodes)
386 struct radix_node_head *head;
388 struct radix_node nodes[2];
391 struct radix_node *top = head->rnh_treetop;
392 int head_off = top->rn_off, vlen = (int)*((u_char *)v);
393 struct radix_node *t = rn_search(v_arg, top);
394 caddr_t cp = v + head_off;
396 struct radix_node *tt;
400 log(LOG_DEBUG, "rn_insert(%p,%p,%p,%p)\n", v_arg, head, dupentry, nodes);
403 * Find first bit at which v and t->rn_key differ
406 caddr_t cp2 = t->rn_key + head_off;
408 caddr_t cplim = v + vlen;
417 cmp_res = (cp[-1] ^ cp2[-1]) & 0xff;
418 for (b = (cp - v) << 3; cmp_res; b--)
422 struct radix_node *p, *x = top;
426 if (cp[x->rn_off] & x->rn_bmask)
430 } while (b > (unsigned) x->rn_b); /* x->rn_b < b && x->rn_b >= 0 */
433 log(LOG_DEBUG, "rn_insert: Going In:\n"); // traverse(p);
435 t = rn_newpair(v_arg, b, nodes);
437 if ((cp[p->rn_off] & p->rn_bmask) == 0)
442 t->rn_p = p; /* frees x, p as temp vars below */
443 if ((cp[t->rn_off] & t->rn_bmask) == 0) {
451 log(LOG_DEBUG, "rn_insert: Coming Out:\n"); // traverse(p);
458 rn_addmask(n_arg, search, skip)
462 caddr_t netmask = (caddr_t)n_arg;
463 struct radix_node *x;
466 int maskduplicated, m0, isnormal;
467 struct radix_node *saved_x;
468 static int last_zeroed = 0;
472 log(LOG_DEBUG, "rn_addmask(%p,%d,%d)\n", n_arg, search, skip);
474 mlen = *(u_char *)netmask;
475 if ((mlen = *(u_char *)netmask) > max_keylen)
480 return (mask_rnhead->rnh_nodes);
482 Bcopy(rn_ones + 1, addmask_key + 1, skip - 1);
483 if ((m0 = mlen) > skip)
484 Bcopy(netmask + skip, addmask_key + skip, mlen - skip);
486 * Trim trailing zeroes.
488 for (cp = addmask_key + mlen; (cp > addmask_key) && cp[-1] == 0;)
490 mlen = cp - addmask_key;
492 if (m0 >= last_zeroed)
494 return (mask_rnhead->rnh_nodes);
496 if (m0 < last_zeroed)
497 Bzero(addmask_key + m0, last_zeroed - m0);
498 *addmask_key = last_zeroed = mlen;
499 x = rn_search(addmask_key, rn_masktop);
500 if (Bcmp(addmask_key, x->rn_key, mlen) != 0)
504 R_Malloc(x, struct radix_node *, max_keylen + 2 * sizeof (*x));
505 if ((saved_x = x) == 0)
507 Bzero(x, max_keylen + 2 * sizeof (*x));
508 netmask = cp = (caddr_t)(x + 2);
509 Bcopy(addmask_key, cp, mlen);
510 x = rn_insert(cp, mask_rnhead, &maskduplicated, x);
511 if (maskduplicated) {
513 log(LOG_ERR, "rn_addmask: mask impossibly already in tree\n");
519 * Calculate index of mask, and check for normalcy.
521 cplim = netmask + mlen;
523 for (cp = netmask + skip; (cp < cplim) && *(u_char *)cp == 0xff;)
526 for (j = 0x80; (j & *cp) != 0; j >>= 1)
528 if (*cp != normal_chars[b] || cp != (cplim - 1))
531 b += (cp - netmask) << 3;
534 x->rn_flags |= RNF_NORMAL;
538 static int /* XXX: arbitrary ordering for non-contiguous masks */
539 rn_lexobetter(m_arg, n_arg)
542 u_char *mp = m_arg, *np = n_arg, *lim;
545 return 1; /* not really, but need to check longer one first */
547 for (lim = mp + *mp; mp < lim;)
553 static struct radix_mask *
554 rn_new_radix_mask(tt, next)
555 struct radix_node *tt;
556 struct radix_mask *next;
558 struct radix_mask *m;
563 log(LOG_ERR, "Mask for route not entered\n");
569 m->rm_flags = tt->rn_flags;
570 if (tt->rn_flags & RNF_NORMAL)
573 m->rm_mask = tt->rn_mask;
580 rn_addroute(v_arg, n_arg, head, treenodes)
582 struct radix_node_head *head;
583 struct radix_node treenodes[2];
585 caddr_t v = (caddr_t)v_arg, netmask = (caddr_t)n_arg;
586 struct radix_node *t, *x = NULL, *tt;
587 struct radix_node *saved_tt, *top = head->rnh_treetop;
588 short b = 0, b_leaf = 0;
591 struct radix_mask *m, **mp;
595 log(LOG_DEBUG, "rn_addroute(%p,%p,%p,%p)\n", v_arg, n_arg, head, treenodes);
598 * In dealing with non-contiguous masks, there may be
599 * many different routes which have the same mask.
600 * We will find it useful to have a unique pointer to
601 * the mask to speed avoiding duplicate references at
602 * nodes and possibly save time in calculating indices.
605 if ((x = rn_addmask(netmask, 0, top->rn_off)) == 0)
612 * Deal with duplicated keys: attach node to previous instance
614 saved_tt = tt = rn_insert(v, head, &keyduplicated, treenodes);
616 for (t = tt; tt; t = tt, tt = tt->rn_dupedkey) {
617 if (tt->rn_mask == netmask)
621 ((b_leaf < tt->rn_b) || /* index(netmask) > node */
622 rn_refines(netmask, tt->rn_mask) ||
623 rn_lexobetter(netmask, tt->rn_mask))))
627 * If the mask is not duplicated, we wouldn't
628 * find it among possible duplicate key entries
629 * anyway, so the above test doesn't hurt.
631 * We sort the masks for a duplicated key the same way as
632 * in a masklist -- most specific to least specific.
633 * This may require the unfortunate nuisance of relocating
634 * the head of the list.
636 * We also reverse, or doubly link the list through the
639 if (tt == saved_tt) {
640 struct radix_node *xx = x;
641 /* link in at head of list */
642 (tt = treenodes)->rn_dupedkey = t;
643 tt->rn_flags = t->rn_flags;
644 tt->rn_p = x = t->rn_p;
653 (tt = treenodes)->rn_dupedkey = t->rn_dupedkey;
657 tt->rn_dupedkey->rn_p = tt;
661 tt->rn_info = rn_nodenum++;
662 t->rn_info = rn_nodenum++;
664 tt->rn_ybro = rn_clist;
667 tt->rn_key = (caddr_t) v;
669 tt->rn_flags = RNF_ACTIVE;
675 tt->rn_mask = netmask;
677 tt->rn_flags |= x->rn_flags & RNF_NORMAL;
682 b_leaf = -1 - t->rn_b;
683 if (t->rn_r == saved_tt)
687 /* Promote general routes from below */
689 for (mp = &t->rn_mklist; x; x = x->rn_dupedkey)
690 if (x->rn_mask && (x->rn_b >= b_leaf) && x->rn_mklist == 0) {
691 *mp = m = rn_new_radix_mask(x, 0);
695 } else if (x->rn_mklist) {
697 * Skip over masks whose index is > that of new node
699 for (mp = &x->rn_mklist; (m = *mp) != NULL; mp = &m->rm_mklist)
700 if (m->rm_b >= b_leaf)
706 /* Add new route to highest possible ancestor's list */
707 if ((netmask == 0) || (b > t->rn_b ))
708 return tt; /* can't lift at all */
713 } while (b <= t->rn_b && x != top);
715 * Search through routes associated with node to
716 * insert new route according to index.
717 * Need same criteria as when sorting dupedkeys to avoid
718 * double loop on deletion.
720 for (mp = &x->rn_mklist; (m = *mp) != NULL; mp = &m->rm_mklist) {
721 if (m->rm_b < b_leaf)
723 if (m->rm_b > b_leaf)
725 if (m->rm_flags & RNF_NORMAL) {
726 mmask = m->rm_leaf->rn_mask;
727 if (tt->rn_flags & RNF_NORMAL) {
729 log(LOG_ERR, "Non-unique normal route,"
730 " mask not entered\n");
736 if (mmask == netmask) {
741 if (rn_refines(netmask, mmask)
742 || rn_lexobetter(netmask, mmask))
745 *mp = rn_new_radix_mask(tt, *mp);
750 rn_delete(v_arg, netmask_arg, head)
751 void *v_arg, *netmask_arg;
752 struct radix_node_head *head;
754 struct radix_node *t, *p, *x, *tt;
755 struct radix_mask *m, *saved_m, **mp;
756 struct radix_node *dupedkey, *saved_tt, *top;
758 int b, head_off, vlen;
761 netmask = netmask_arg;
762 x = head->rnh_treetop;
763 tt = rn_search(v, x);
764 head_off = x->rn_off;
769 Bcmp(v + head_off, tt->rn_key + head_off, vlen - head_off))
772 * Delete our route from mask lists.
775 if ((x = rn_addmask(netmask, 1, head_off)) == 0)
778 while (tt->rn_mask != netmask)
779 if ((tt = tt->rn_dupedkey) == 0)
782 if (tt->rn_mask == 0 || (saved_m = m = tt->rn_mklist) == 0)
784 if (tt->rn_flags & RNF_NORMAL) {
785 if (m->rm_leaf != tt || m->rm_refs > 0) {
787 log(LOG_ERR, "rn_delete: inconsistent annotation\n");
789 return 0; /* dangling ref could cause disaster */
792 if (m->rm_mask != tt->rn_mask) {
794 log(LOG_ERR, "rn_delete: inconsistent annotation\n");
798 if (--m->rm_refs >= 0)
804 goto on1; /* Wasn't lifted at all */
808 } while (b <= t->rn_b && x != top);
809 for (mp = &x->rn_mklist; (m = *mp) != NULL; mp = &m->rm_mklist)
817 log(LOG_ERR, "rn_delete: couldn't find our annotation\n");
819 if (tt->rn_flags & RNF_NORMAL)
820 return (0); /* Dangling ref to us */
824 * Eliminate us from tree
826 if (tt->rn_flags & RNF_ROOT)
829 /* Get us out of the creation list */
830 for (t = rn_clist; t && t->rn_ybro != tt; t = t->rn_ybro)
832 if (t) t->rn_ybro = tt->rn_ybro;
835 dupedkey = saved_tt->rn_dupedkey;
838 * Here, tt is the deletion target and
839 * saved_tt is the head of the dupedkey chain.
841 if (tt == saved_tt) {
849 /* find node in front of tt on the chain */
850 for (x = p = saved_tt; p && p->rn_dupedkey != tt;)
853 p->rn_dupedkey = tt->rn_dupedkey;
855 tt->rn_dupedkey->rn_p = p;
859 log(LOG_ERR, "rn_delete: couldn't find us\n");
863 if (t->rn_flags & RNF_ACTIVE) {
893 * Demote routes attached to us.
897 for (mp = &x->rn_mklist; (m = *mp) != NULL;)
901 /* If there are any key,mask pairs in a sibling
902 duped-key chain, some subset will appear sorted
903 in the same order attached to our mklist */
904 for (m = t->rn_mklist; m && x; x = x->rn_dupedkey)
905 if (m == x->rn_mklist) {
906 struct radix_mask *mm = m->rm_mklist;
908 if (--(m->rm_refs) < 0)
914 log(LOG_ERR, "%s %p at %p\n",
915 "rn_delete: Orphaned Mask", m, x);
920 * We may be holding an active internal node in the tree.
940 tt->rn_flags &= ~RNF_ACTIVE;
941 tt[1].rn_flags &= ~RNF_ACTIVE;
947 struct radix_node_head *h;
948 int (*f) __P((struct radix_node *, void *));
952 struct radix_node *base, *next;
953 struct radix_node *rn = h->rnh_treetop;
955 * This gets complicated because we may delete the node
956 * while applying the function f to it, so we need to calculate
957 * the successor node in advance.
959 /* First time through node, go left */
960 while (rn->rn_b >= 0)
964 /* If at right child go back up, otherwise, go right */
965 while (rn->rn_p->rn_r == rn && (rn->rn_flags & RNF_ROOT) == 0)
967 /* Find the next *leaf* since next node might vanish, too */
968 for (rn = rn->rn_p->rn_r; rn->rn_b >= 0;)
972 while ((rn = base) != NULL) {
973 base = rn->rn_dupedkey;
974 if (!(rn->rn_flags & RNF_ROOT)
975 && (error = (*f)(rn, w)))
979 if (rn->rn_flags & RNF_ROOT)
986 rn_inithead(head, off)
990 struct radix_node_head *rnh;
994 R_Malloc(rnh, struct radix_node_head *, sizeof (*rnh));
998 return rn_inithead0(rnh, off);
1002 rn_inithead0(rnh, off)
1003 struct radix_node_head *rnh;
1006 struct radix_node *t, *tt, *ttt;
1008 Bzero(rnh, sizeof (*rnh));
1009 t = rn_newpair(rn_zeros, off, rnh->rnh_nodes);
1010 ttt = rnh->rnh_nodes + 2;
1014 tt->rn_flags = t->rn_flags = RNF_ROOT | RNF_ACTIVE;
1015 tt->rn_b = -1 - off;
1017 ttt->rn_key = rn_ones;
1018 rnh->rnh_addaddr = rn_addroute;
1019 rnh->rnh_deladdr = rn_delete;
1020 rnh->rnh_matchaddr = rn_match;
1021 rnh->rnh_lookup = rn_lookup;
1022 rnh->rnh_walktree = rn_walktree;
1023 rnh->rnh_treetop = t;
1032 if (max_keylen == 0) {
1035 "rn_init: radix functions require max_keylen be set\n");
1039 if (rn_zeros == NULL) {
1040 R_Malloc(rn_zeros, char *, 3 * max_keylen);
1042 if (rn_zeros == NULL)
1044 Bzero(rn_zeros, 3 * max_keylen);
1045 rn_ones = cp = rn_zeros + max_keylen;
1046 addmask_key = cplim = rn_ones + max_keylen;
1049 if (rn_inithead((void *)&mask_rnhead, 0) == 0)
1055 rn_freenode(struct radix_node *n, void *p)
1057 struct radix_node_head *rnh = p;
1058 struct radix_node *d;
1060 d = rnh->rnh_deladdr(n->rn_key, NULL, rnh);
1062 FreeS(d, max_keylen + 2 * sizeof (*d));
1070 struct radix_node_head *rnh;
1073 (void)rn_walktree(rnh, rn_freenode, rnh);
1075 rnh->rnh_addaddr = NULL;
1076 rnh->rnh_deladdr = NULL;
1077 rnh->rnh_matchaddr = NULL;
1078 rnh->rnh_lookup = NULL;
1079 rnh->rnh_walktree = NULL;
1088 struct radix_mask *m;
1090 if (rn_zeros != NULL) {
1091 FreeS(rn_zeros, 3 * max_keylen);
1095 if (mask_rnhead != NULL) {
1096 rn_freehead(mask_rnhead);
1100 while ((m = rn_mkfreelist) != NULL) {
1101 rn_mkfreelist = m->rm_mklist;
1109 typedef struct myst {
1112 struct radix_node nodes[2];
1116 main(int argc, char *argv[])
1118 struct radix_node_head *rnh;
1119 struct radix_node *rn;
1120 addrfamily_t af, mf;
1121 myst_t st1, st2, *stp;
1123 memset(&st1, 0, sizeof(st1));
1124 memset(&st2, 0, sizeof(st2));
1125 memset(&af, 0, sizeof(af));
1130 rn_inithead(&rnh, offsetof(addrfamily_t, adf_addr) << 3);
1132 st1.dst.adf_len = sizeof(st1);
1133 st1.mask.adf_len = sizeof(st1);
1134 st1.dst.adf_addr.in4.s_addr = inet_addr("127.0.0.0");
1135 st1.mask.adf_addr.in4.s_addr = inet_addr("255.0.0.0");
1136 rn = rnh->rnh_addaddr(&st1.dst, &st1.mask, rnh, st1.nodes);
1137 printf("add.1 %p\n", rn);
1139 st2.dst.adf_len = sizeof(st2);
1140 st2.mask.adf_len = sizeof(st2);
1141 st2.dst.adf_addr.in4.s_addr = inet_addr("127.0.1.0");
1142 st2.mask.adf_addr.in4.s_addr = inet_addr("255.255.255.0");
1143 rn = rnh->rnh_addaddr(&st2.dst, &st2.mask, rnh, st2.nodes);
1144 printf("add.2 %p\n", rn);
1146 af.adf_len = sizeof(af);
1147 af.adf_addr.in4.s_addr = inet_addr("127.0.1.0");
1148 rn = rnh->rnh_matchaddr(&af, rnh);
1150 printf("1.lookup = %p key %p mask %p\n", rn, rn->rn_key, rn->rn_mask);
1152 printf("%s/", inet_ntoa(stp->dst.adf_addr.in4));
1154 printf("%s\n", inet_ntoa(stp->dst.adf_addr.in4));
1157 mf.adf_len = sizeof(mf);
1158 mf.adf_addr.in4.s_addr = inet_addr("255.255.255.0");
1159 rn = rnh->rnh_lookup(&af, &mf, rnh);
1161 printf("2.lookup = %p key %p mask %p\n", rn, rn->rn_key, rn->rn_mask);
1163 printf("%s/", inet_ntoa(stp->dst.adf_addr.in4));
1165 printf("%s\n", inet_ntoa(stp->dst.adf_addr.in4));
1168 af.adf_len = sizeof(af);
1169 af.adf_addr.in4.s_addr = inet_addr("126.0.0.1");
1170 rn = rnh->rnh_matchaddr(&af, rnh);
1172 printf("3.lookup = %p key %p mask %p\n", rn, rn->rn_key, rn->rn_mask);
1174 printf("%s/", inet_ntoa(stp->dst.adf_addr.in4));
1176 printf("%s\n", inet_ntoa(stp->dst.adf_addr.in4));
1184 log(int level, char *format, ...)
1188 va_start(ap, format);
1189 vfprintf(stderr, format, ap);