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.
14 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26 * @(#)radix.c 8.6 (Berkeley) 10/17/95
30 * Routines to build and maintain radix trees for routing lookups.
32 #if defined(KERNEL) || defined(_KERNEL)
38 #define __SYS_ATOMIC_OPS_H__
39 #if !defined(__svr4__) && !defined(__SVR4) && !defined(__osf__) && \
40 !defined(__hpux) && !defined(__sgi)
41 #include <sys/cdefs.h>
52 # define _IPV6_SWTAB_H
53 # define _PROTO_NET_H_
54 # define _PROTO_IPV6_H
55 # include <sys/malloc.h>
58 #include <sys/param.h>
60 #include <sys/systm.h>
62 void panic __P((char *str));
71 #include <sys/syslog.h>
74 #include <netinet/in.h>
75 #include <sys/socket.h>
80 #include "netinet/ip_compat.h"
81 #include "netinet/ip_fil.h"
86 #include "radix_ipf.h"
95 static struct radix_mask *rn_mkfreelist;
96 static struct radix_node_head *mask_rnhead;
97 static char *addmask_key;
98 static u_char normal_chars[] = {0, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, 0xff};
99 static char *rn_zeros = NULL, *rn_ones = NULL;
101 #define rn_masktop (mask_rnhead->rnh_treetop)
103 #define Bcmp(a, b, l) (l == 0 ? 0 : bcmp((caddr_t)(a), (caddr_t)(b), (u_long)l))
105 static int rn_satisfies_leaf __P((char *, struct radix_node *, int));
106 static int rn_lexobetter __P((void *, void *));
107 static struct radix_mask *rn_new_radix_mask __P((struct radix_node *,
108 struct radix_mask *));
109 static int rn_freenode __P((struct radix_node *, void *));
110 #if defined(AIX) && !defined(_KERNEL)
111 struct radix_node *rn_match __P((void *, struct radix_node_head *));
112 struct radix_node *rn_addmask __P((int, int, void *));
113 #define FreeS(x, y) KFREES(x, y)
114 #define Bcopy(x, y, z) bcopy(x, y, z)
118 * The data structure for the keys is a radix tree with one way
119 * branching removed. The index rn_b at an internal node n represents a bit
120 * position to be tested. The tree is arranged so that all descendants
121 * of a node n have keys whose bits all agree up to position rn_b - 1.
122 * (We say the index of n is rn_b.)
124 * There is at least one descendant which has a one bit at position rn_b,
125 * and at least one with a zero there.
127 * A route is determined by a pair of key and mask. We require that the
128 * bit-wise logical and of the key and mask to be the key.
129 * We define the index of a route to associated with the mask to be
130 * the first bit number in the mask where 0 occurs (with bit number 0
131 * representing the highest order bit).
133 * We say a mask is normal if every bit is 0, past the index of the mask.
134 * If a node n has a descendant (k, m) with index(m) == index(n) == rn_b,
135 * and m is a normal mask, then the route applies to every descendant of n.
136 * If the index(m) < rn_b, this implies the trailing last few bits of k
137 * before bit b are all 0, (and hence consequently true of every descendant
138 * of n), so the route applies to all descendants of the node as well.
140 * Similar logic shows that a non-normal mask m such that
141 * index(m) <= index(n) could potentially apply to many children of n.
142 * Thus, for each non-host route, we attach its mask to a list at an internal
143 * node as high in the tree as we can go.
145 * The present version of the code makes use of normal routes in short-
146 * circuiting an explicit mask and compare operation when testing whether
147 * a key satisfies a normal route, and also in remembering the unique leaf
148 * that governs a subtree.
152 rn_search(v_arg, head)
154 struct radix_node *head;
156 struct radix_node *x;
159 for (x = head, v = v_arg; x->rn_b >= 0;) {
160 if (x->rn_bmask & v[x->rn_off])
169 rn_search_m(v_arg, head, m_arg)
170 struct radix_node *head;
173 struct radix_node *x;
174 caddr_t v = v_arg, m = m_arg;
176 for (x = head; x->rn_b >= 0;) {
177 if ((x->rn_bmask & m[x->rn_off]) &&
178 (x->rn_bmask & v[x->rn_off]))
187 rn_refines(m_arg, n_arg)
190 caddr_t m = m_arg, n = n_arg;
191 caddr_t lim, lim2 = lim = n + *(u_char *)n;
192 int longer = (*(u_char *)n++) - (int)(*(u_char *)m++);
193 int masks_are_equal = 1;
206 if (masks_are_equal && (longer < 0))
207 for (lim2 = m - longer; m < lim2; )
210 return (!masks_are_equal);
214 rn_lookup(v_arg, m_arg, head)
216 struct radix_node_head *head;
218 struct radix_node *x;
222 if ((x = rn_addmask(m_arg, 1, head->rnh_treetop->rn_off)) == 0)
226 x = rn_match(v_arg, head);
228 while (x && x->rn_mask != netmask)
235 rn_satisfies_leaf(trial, leaf, skip)
237 struct radix_node *leaf;
240 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
242 int length = min(*(u_char *)cp, *(u_char *)cp2);
247 length = min(length, *(u_char *)cp3);
251 for (cp += skip; cp < cplim; cp++, cp2++, cp3++)
252 if ((*cp ^ *cp2) & *cp3)
258 rn_match(v_arg, head)
260 struct radix_node_head *head;
263 struct radix_node *t = head->rnh_treetop, *x;
266 struct radix_node *saved_t, *top = t;
267 int off = t->rn_off, vlen = *(u_char *)cp, matched_off;
271 * Open code rn_search(v, top) to avoid overhead of extra
274 for (; t->rn_b >= 0; ) {
275 if (t->rn_bmask & cp[t->rn_off])
281 * See if we match exactly as a host destination
282 * or at least learn how many bits match, for normal mask finesse.
284 * It doesn't hurt us to limit how many bytes to check
285 * to the length of the mask, since if it matches we had a genuine
286 * match and the leaf we have is the most specific one anyway;
287 * if it didn't match with a shorter length it would fail
288 * with a long one. This wins big for class B&C netmasks which
289 * are probably the most common case...
292 vlen = *(u_char *)t->rn_mask;
294 cp2 = t->rn_key + off;
296 for (; cp < cplim; cp++, cp2++)
300 * This extra grot is in case we are explicitly asked
301 * to look up the default. Ugh!
303 if ((t->rn_flags & RNF_ROOT) && t->rn_dupedkey)
307 test = (*cp ^ *cp2) & 0xff; /* find first bit that differs */
308 for (b = 7; (test >>= 1) > 0;)
310 matched_off = cp - v;
311 b += matched_off << 3;
314 * If there is a host route in a duped-key chain, it will be first.
316 if ((saved_t = t)->rn_mask == 0)
318 for (; t; t = t->rn_dupedkey)
320 * Even if we don't match exactly as a host,
321 * we may match if the leaf we wound up at is
324 if (t->rn_flags & RNF_NORMAL) {
327 } else if (rn_satisfies_leaf(v, t, matched_off))
330 /* start searching up the tree */
332 struct radix_mask *m;
337 * If non-contiguous masks ever become important
338 * we can restore the masking and open coding of
339 * the search and satisfaction test and put the
340 * calculation of "off" back before the "do".
343 if (m->rm_flags & RNF_NORMAL) {
347 off = min(t->rn_off, matched_off);
348 x = rn_search_m(v, t, m->rm_mask);
349 while (x && x->rn_mask != m->rm_mask)
351 if (x && rn_satisfies_leaf(v, x, off))
363 struct radix_node *rn_clist;
369 rn_newpair(v, b, nodes)
372 struct radix_node nodes[2];
374 struct radix_node *tt = nodes, *t = tt + 1;
376 t->rn_bmask = 0x80 >> (b & 7);
380 tt->rn_key = (caddr_t)v;
382 tt->rn_flags = t->rn_flags = RNF_ACTIVE;
384 tt->rn_info = rn_nodenum++;
385 t->rn_info = rn_nodenum++;
387 tt->rn_ybro = rn_clist;
394 rn_insert(v_arg, head, dupentry, nodes)
396 struct radix_node_head *head;
398 struct radix_node nodes[2];
401 struct radix_node *top = head->rnh_treetop;
402 int head_off = top->rn_off, vlen = (int)*((u_char *)v);
403 struct radix_node *t = rn_search(v_arg, top);
404 caddr_t cp = v + head_off;
406 struct radix_node *tt;
410 log(LOG_DEBUG, "rn_insert(%p,%p,%p,%p)\n", v_arg, head, dupentry, nodes);
413 * Find first bit at which v and t->rn_key differ
416 caddr_t cp2 = t->rn_key + head_off;
418 caddr_t cplim = v + vlen;
427 cmp_res = (cp[-1] ^ cp2[-1]) & 0xff;
428 for (b = (cp - v) << 3; cmp_res; b--)
432 struct radix_node *p, *x = top;
436 if (cp[x->rn_off] & x->rn_bmask)
440 } while (b > (unsigned) x->rn_b); /* x->rn_b < b && x->rn_b >= 0 */
443 log(LOG_DEBUG, "rn_insert: Going In:\n"); // traverse(p);
445 t = rn_newpair(v_arg, b, nodes);
447 if ((cp[p->rn_off] & p->rn_bmask) == 0)
452 t->rn_p = p; /* frees x, p as temp vars below */
453 if ((cp[t->rn_off] & t->rn_bmask) == 0) {
461 log(LOG_DEBUG, "rn_insert: Coming Out:\n"); // traverse(p);
468 rn_addmask(n_arg, search, skip)
472 caddr_t netmask = (caddr_t)n_arg;
473 struct radix_node *x;
476 int maskduplicated, m0, isnormal;
477 struct radix_node *saved_x;
478 static int last_zeroed = 0;
482 log(LOG_DEBUG, "rn_addmask(%p,%d,%d)\n", n_arg, search, skip);
484 mlen = *(u_char *)netmask;
485 if ((mlen = *(u_char *)netmask) > max_keylen)
490 return (mask_rnhead->rnh_nodes);
492 Bcopy(rn_ones + 1, addmask_key + 1, skip - 1);
493 if ((m0 = mlen) > skip)
494 Bcopy(netmask + skip, addmask_key + skip, mlen - skip);
496 * Trim trailing zeroes.
498 for (cp = addmask_key + mlen; (cp > addmask_key) && cp[-1] == 0;)
500 mlen = cp - addmask_key;
502 if (m0 >= last_zeroed)
504 return (mask_rnhead->rnh_nodes);
506 if (m0 < last_zeroed)
507 Bzero(addmask_key + m0, last_zeroed - m0);
508 *addmask_key = last_zeroed = mlen;
509 x = rn_search(addmask_key, rn_masktop);
510 if (Bcmp(addmask_key, x->rn_key, mlen) != 0)
514 R_Malloc(x, struct radix_node *, max_keylen + 2 * sizeof (*x));
515 if ((saved_x = x) == 0)
517 Bzero(x, max_keylen + 2 * sizeof (*x));
518 netmask = cp = (caddr_t)(x + 2);
519 Bcopy(addmask_key, cp, mlen);
520 x = rn_insert(cp, mask_rnhead, &maskduplicated, x);
521 if (maskduplicated) {
523 log(LOG_ERR, "rn_addmask: mask impossibly already in tree\n");
529 * Calculate index of mask, and check for normalcy.
531 cplim = netmask + mlen;
533 for (cp = netmask + skip; (cp < cplim) && *(u_char *)cp == 0xff;)
536 for (j = 0x80; (j & *cp) != 0; j >>= 1)
538 if (*cp != normal_chars[b] || cp != (cplim - 1))
541 b += (cp - netmask) << 3;
544 x->rn_flags |= RNF_NORMAL;
548 static int /* XXX: arbitrary ordering for non-contiguous masks */
549 rn_lexobetter(m_arg, n_arg)
552 u_char *mp = m_arg, *np = n_arg, *lim;
555 return 1; /* not really, but need to check longer one first */
557 for (lim = mp + *mp; mp < lim;)
563 static struct radix_mask *
564 rn_new_radix_mask(tt, next)
565 struct radix_node *tt;
566 struct radix_mask *next;
568 struct radix_mask *m;
573 log(LOG_ERR, "Mask for route not entered\n");
579 m->rm_flags = tt->rn_flags;
580 if (tt->rn_flags & RNF_NORMAL)
583 m->rm_mask = tt->rn_mask;
590 rn_addroute(v_arg, n_arg, head, treenodes)
592 struct radix_node_head *head;
593 struct radix_node treenodes[2];
595 caddr_t v = (caddr_t)v_arg, netmask = (caddr_t)n_arg;
596 struct radix_node *t, *x = NULL, *tt;
597 struct radix_node *saved_tt, *top = head->rnh_treetop;
598 short b = 0, b_leaf = 0;
601 struct radix_mask *m, **mp;
605 log(LOG_DEBUG, "rn_addroute(%p,%p,%p,%p)\n", v_arg, n_arg, head, treenodes);
608 * In dealing with non-contiguous masks, there may be
609 * many different routes which have the same mask.
610 * We will find it useful to have a unique pointer to
611 * the mask to speed avoiding duplicate references at
612 * nodes and possibly save time in calculating indices.
615 if ((x = rn_addmask(netmask, 0, top->rn_off)) == 0)
622 * Deal with duplicated keys: attach node to previous instance
624 saved_tt = tt = rn_insert(v, head, &keyduplicated, treenodes);
626 for (t = tt; tt; t = tt, tt = tt->rn_dupedkey) {
627 if (tt->rn_mask == netmask)
631 ((b_leaf < tt->rn_b) || /* index(netmask) > node */
632 rn_refines(netmask, tt->rn_mask) ||
633 rn_lexobetter(netmask, tt->rn_mask))))
637 * If the mask is not duplicated, we wouldn't
638 * find it among possible duplicate key entries
639 * anyway, so the above test doesn't hurt.
641 * We sort the masks for a duplicated key the same way as
642 * in a masklist -- most specific to least specific.
643 * This may require the unfortunate nuisance of relocating
644 * the head of the list.
646 * We also reverse, or doubly link the list through the
649 if (tt == saved_tt) {
650 struct radix_node *xx = x;
651 /* link in at head of list */
652 (tt = treenodes)->rn_dupedkey = t;
653 tt->rn_flags = t->rn_flags;
654 tt->rn_p = x = t->rn_p;
663 (tt = treenodes)->rn_dupedkey = t->rn_dupedkey;
667 tt->rn_dupedkey->rn_p = tt;
671 tt->rn_info = rn_nodenum++;
672 t->rn_info = rn_nodenum++;
674 tt->rn_ybro = rn_clist;
677 tt->rn_key = (caddr_t) v;
679 tt->rn_flags = RNF_ACTIVE;
685 tt->rn_mask = netmask;
687 tt->rn_flags |= x->rn_flags & RNF_NORMAL;
692 b_leaf = -1 - t->rn_b;
693 if (t->rn_r == saved_tt)
697 /* Promote general routes from below */
699 for (mp = &t->rn_mklist; x; x = x->rn_dupedkey)
700 if (x->rn_mask && (x->rn_b >= b_leaf) && x->rn_mklist == 0) {
701 *mp = m = rn_new_radix_mask(x, 0);
705 } else if (x->rn_mklist) {
707 * Skip over masks whose index is > that of new node
709 for (mp = &x->rn_mklist; (m = *mp) != NULL; mp = &m->rm_mklist)
710 if (m->rm_b >= b_leaf)
716 /* Add new route to highest possible ancestor's list */
717 if ((netmask == 0) || (b > t->rn_b ))
718 return tt; /* can't lift at all */
723 } while (b <= t->rn_b && x != top);
725 * Search through routes associated with node to
726 * insert new route according to index.
727 * Need same criteria as when sorting dupedkeys to avoid
728 * double loop on deletion.
730 for (mp = &x->rn_mklist; (m = *mp) != NULL; mp = &m->rm_mklist) {
731 if (m->rm_b < b_leaf)
733 if (m->rm_b > b_leaf)
735 if (m->rm_flags & RNF_NORMAL) {
736 mmask = m->rm_leaf->rn_mask;
737 if (tt->rn_flags & RNF_NORMAL) {
739 log(LOG_ERR, "Non-unique normal route,"
740 " mask not entered\n");
746 if (mmask == netmask) {
751 if (rn_refines(netmask, mmask)
752 || rn_lexobetter(netmask, mmask))
755 *mp = rn_new_radix_mask(tt, *mp);
760 rn_delete(v_arg, netmask_arg, head)
761 void *v_arg, *netmask_arg;
762 struct radix_node_head *head;
764 struct radix_node *t, *p, *x, *tt;
765 struct radix_mask *m, *saved_m, **mp;
766 struct radix_node *dupedkey, *saved_tt, *top;
768 int b, head_off, vlen;
771 netmask = netmask_arg;
772 x = head->rnh_treetop;
773 tt = rn_search(v, x);
774 head_off = x->rn_off;
779 Bcmp(v + head_off, tt->rn_key + head_off, vlen - head_off))
782 * Delete our route from mask lists.
785 if ((x = rn_addmask(netmask, 1, head_off)) == 0)
788 while (tt->rn_mask != netmask)
789 if ((tt = tt->rn_dupedkey) == 0)
792 if (tt->rn_mask == 0 || (saved_m = m = tt->rn_mklist) == 0)
794 if (tt->rn_flags & RNF_NORMAL) {
795 if (m->rm_leaf != tt || m->rm_refs > 0) {
797 log(LOG_ERR, "rn_delete: inconsistent annotation\n");
799 return 0; /* dangling ref could cause disaster */
802 if (m->rm_mask != tt->rn_mask) {
804 log(LOG_ERR, "rn_delete: inconsistent annotation\n");
808 if (--m->rm_refs >= 0)
814 goto on1; /* Wasn't lifted at all */
818 } while (b <= t->rn_b && x != top);
819 for (mp = &x->rn_mklist; (m = *mp) != NULL; mp = &m->rm_mklist)
827 log(LOG_ERR, "rn_delete: couldn't find our annotation\n");
829 if (tt->rn_flags & RNF_NORMAL)
830 return (0); /* Dangling ref to us */
834 * Eliminate us from tree
836 if (tt->rn_flags & RNF_ROOT)
839 /* Get us out of the creation list */
840 for (t = rn_clist; t && t->rn_ybro != tt; t = t->rn_ybro)
842 if (t) t->rn_ybro = tt->rn_ybro;
845 dupedkey = saved_tt->rn_dupedkey;
848 * Here, tt is the deletion target and
849 * saved_tt is the head of the dupedkey chain.
851 if (tt == saved_tt) {
859 /* find node in front of tt on the chain */
860 for (x = p = saved_tt; p && p->rn_dupedkey != tt;)
863 p->rn_dupedkey = tt->rn_dupedkey;
865 tt->rn_dupedkey->rn_p = p;
869 log(LOG_ERR, "rn_delete: couldn't find us\n");
873 if (t->rn_flags & RNF_ACTIVE) {
903 * Demote routes attached to us.
907 for (mp = &x->rn_mklist; (m = *mp) != NULL;)
911 /* If there are any key,mask pairs in a sibling
912 duped-key chain, some subset will appear sorted
913 in the same order attached to our mklist */
914 for (m = t->rn_mklist; m && x; x = x->rn_dupedkey)
915 if (m == x->rn_mklist) {
916 struct radix_mask *mm = m->rm_mklist;
918 if (--(m->rm_refs) < 0)
924 log(LOG_ERR, "%s %p at %p\n",
925 "rn_delete: Orphaned Mask", m, x);
930 * We may be holding an active internal node in the tree.
950 tt->rn_flags &= ~RNF_ACTIVE;
951 tt[1].rn_flags &= ~RNF_ACTIVE;
957 struct radix_node_head *h;
958 int (*f) __P((struct radix_node *, void *));
962 struct radix_node *base, *next;
963 struct radix_node *rn = h->rnh_treetop;
965 * This gets complicated because we may delete the node
966 * while applying the function f to it, so we need to calculate
967 * the successor node in advance.
969 /* First time through node, go left */
970 while (rn->rn_b >= 0)
974 /* If at right child go back up, otherwise, go right */
975 while (rn->rn_p->rn_r == rn && (rn->rn_flags & RNF_ROOT) == 0)
977 /* Find the next *leaf* since next node might vanish, too */
978 for (rn = rn->rn_p->rn_r; rn->rn_b >= 0;)
982 while ((rn = base) != NULL) {
983 base = rn->rn_dupedkey;
984 if (!(rn->rn_flags & RNF_ROOT)
985 && (error = (*f)(rn, w)))
989 if (rn->rn_flags & RNF_ROOT)
996 rn_inithead(head, off)
1000 struct radix_node_head *rnh;
1004 R_Malloc(rnh, struct radix_node_head *, sizeof (*rnh));
1008 return rn_inithead0(rnh, off);
1012 rn_inithead0(rnh, off)
1013 struct radix_node_head *rnh;
1016 struct radix_node *t, *tt, *ttt;
1018 Bzero(rnh, sizeof (*rnh));
1019 t = rn_newpair(rn_zeros, off, rnh->rnh_nodes);
1020 ttt = rnh->rnh_nodes + 2;
1024 tt->rn_flags = t->rn_flags = RNF_ROOT | RNF_ACTIVE;
1025 tt->rn_b = -1 - off;
1027 ttt->rn_key = rn_ones;
1028 rnh->rnh_addaddr = rn_addroute;
1029 rnh->rnh_deladdr = rn_delete;
1030 rnh->rnh_matchaddr = rn_match;
1031 rnh->rnh_lookup = rn_lookup;
1032 rnh->rnh_walktree = rn_walktree;
1033 rnh->rnh_treetop = t;
1042 if (max_keylen == 0) {
1045 "rn_init: radix functions require max_keylen be set\n");
1049 if (rn_zeros == NULL) {
1050 R_Malloc(rn_zeros, char *, 3 * max_keylen);
1052 if (rn_zeros == NULL)
1054 Bzero(rn_zeros, 3 * max_keylen);
1055 rn_ones = cp = rn_zeros + max_keylen;
1056 addmask_key = cplim = rn_ones + max_keylen;
1059 if (rn_inithead((void *)&mask_rnhead, 0) == 0)
1065 rn_freenode(struct radix_node *n, void *p)
1067 struct radix_node_head *rnh = p;
1068 struct radix_node *d;
1070 d = rnh->rnh_deladdr(n->rn_key, NULL, rnh);
1072 FreeS(d, max_keylen + 2 * sizeof (*d));
1080 struct radix_node_head *rnh;
1083 (void)rn_walktree(rnh, rn_freenode, rnh);
1085 rnh->rnh_addaddr = NULL;
1086 rnh->rnh_deladdr = NULL;
1087 rnh->rnh_matchaddr = NULL;
1088 rnh->rnh_lookup = NULL;
1089 rnh->rnh_walktree = NULL;
1098 struct radix_mask *m;
1100 if (rn_zeros != NULL) {
1101 FreeS(rn_zeros, 3 * max_keylen);
1105 if (mask_rnhead != NULL) {
1106 rn_freehead(mask_rnhead);
1110 while ((m = rn_mkfreelist) != NULL) {
1111 rn_mkfreelist = m->rm_mklist;
1119 typedef struct myst {
1122 struct radix_node nodes[2];
1126 main(int argc, char *argv[])
1128 struct radix_node_head *rnh;
1129 struct radix_node *rn;
1130 addrfamily_t af, mf;
1131 myst_t st1, st2, *stp;
1133 memset(&st1, 0, sizeof(st1));
1134 memset(&st2, 0, sizeof(st2));
1135 memset(&af, 0, sizeof(af));
1140 rn_inithead(&rnh, offsetof(addrfamily_t, adf_addr) << 3);
1142 st1.dst.adf_len = sizeof(st1);
1143 st1.mask.adf_len = sizeof(st1);
1144 st1.dst.adf_addr.in4.s_addr = inet_addr("127.0.0.0");
1145 st1.mask.adf_addr.in4.s_addr = inet_addr("255.0.0.0");
1146 rn = rnh->rnh_addaddr(&st1.dst, &st1.mask, rnh, st1.nodes);
1147 printf("add.1 %p\n", rn);
1149 st2.dst.adf_len = sizeof(st2);
1150 st2.mask.adf_len = sizeof(st2);
1151 st2.dst.adf_addr.in4.s_addr = inet_addr("127.0.1.0");
1152 st2.mask.adf_addr.in4.s_addr = inet_addr("255.255.255.0");
1153 rn = rnh->rnh_addaddr(&st2.dst, &st2.mask, rnh, st2.nodes);
1154 printf("add.2 %p\n", rn);
1156 af.adf_len = sizeof(af);
1157 af.adf_addr.in4.s_addr = inet_addr("127.0.1.0");
1158 rn = rnh->rnh_matchaddr(&af, rnh);
1160 printf("1.lookup = %p key %p mask %p\n", rn, rn->rn_key, rn->rn_mask);
1162 printf("%s/", inet_ntoa(stp->dst.adf_addr.in4));
1164 printf("%s\n", inet_ntoa(stp->dst.adf_addr.in4));
1167 mf.adf_len = sizeof(mf);
1168 mf.adf_addr.in4.s_addr = inet_addr("255.255.255.0");
1169 rn = rnh->rnh_lookup(&af, &mf, rnh);
1171 printf("2.lookup = %p key %p mask %p\n", rn, rn->rn_key, rn->rn_mask);
1173 printf("%s/", inet_ntoa(stp->dst.adf_addr.in4));
1175 printf("%s\n", inet_ntoa(stp->dst.adf_addr.in4));
1178 af.adf_len = sizeof(af);
1179 af.adf_addr.in4.s_addr = inet_addr("126.0.0.1");
1180 rn = rnh->rnh_matchaddr(&af, rnh);
1182 printf("3.lookup = %p key %p mask %p\n", rn, rn->rn_key, rn->rn_mask);
1184 printf("%s/", inet_ntoa(stp->dst.adf_addr.in4));
1186 printf("%s\n", inet_ntoa(stp->dst.adf_addr.in4));
1194 log(int level, char *format, ...)
1198 va_start(ap, format);
1199 vfprintf(stderr, format, ap);