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 *));
106 #if defined(AIX) && !defined(_KERNEL)
107 struct radix_node *rn_match __P((void *, struct radix_node_head *));
108 struct radix_node *rn_addmask __P((int, int, void *));
109 #define FreeS(x, y) KFREES(x, y)
110 #define Bcopy(x, y, z) bcopy(x, y, z)
114 * The data structure for the keys is a radix tree with one way
115 * branching removed. The index rn_b at an internal node n represents a bit
116 * position to be tested. The tree is arranged so that all descendants
117 * of a node n have keys whose bits all agree up to position rn_b - 1.
118 * (We say the index of n is rn_b.)
120 * There is at least one descendant which has a one bit at position rn_b,
121 * and at least one with a zero there.
123 * A route is determined by a pair of key and mask. We require that the
124 * bit-wise logical and of the key and mask to be the key.
125 * We define the index of a route to associated with the mask to be
126 * the first bit number in the mask where 0 occurs (with bit number 0
127 * representing the highest order bit).
129 * We say a mask is normal if every bit is 0, past the index of the mask.
130 * If a node n has a descendant (k, m) with index(m) == index(n) == rn_b,
131 * and m is a normal mask, then the route applies to every descendant of n.
132 * If the index(m) < rn_b, this implies the trailing last few bits of k
133 * before bit b are all 0, (and hence consequently true of every descendant
134 * of n), so the route applies to all descendants of the node as well.
136 * Similar logic shows that a non-normal mask m such that
137 * index(m) <= index(n) could potentially apply to many children of n.
138 * Thus, for each non-host route, we attach its mask to a list at an internal
139 * node as high in the tree as we can go.
141 * The present version of the code makes use of normal routes in short-
142 * circuiting an explicit mask and compare operation when testing whether
143 * a key satisfies a normal route, and also in remembering the unique leaf
144 * that governs a subtree.
148 rn_search(v_arg, head)
150 struct radix_node *head;
152 struct radix_node *x;
155 for (x = head, v = v_arg; x->rn_b >= 0;) {
156 if (x->rn_bmask & v[x->rn_off])
165 rn_search_m(v_arg, head, m_arg)
166 struct radix_node *head;
169 struct radix_node *x;
170 caddr_t v = v_arg, m = m_arg;
172 for (x = head; x->rn_b >= 0;) {
173 if ((x->rn_bmask & m[x->rn_off]) &&
174 (x->rn_bmask & v[x->rn_off]))
183 rn_refines(m_arg, n_arg)
186 caddr_t m = m_arg, n = n_arg;
187 caddr_t lim, lim2 = lim = n + *(u_char *)n;
188 int longer = (*(u_char *)n++) - (int)(*(u_char *)m++);
189 int masks_are_equal = 1;
202 if (masks_are_equal && (longer < 0))
203 for (lim2 = m - longer; m < lim2; )
206 return (!masks_are_equal);
210 rn_lookup(v_arg, m_arg, head)
212 struct radix_node_head *head;
214 struct radix_node *x;
218 if ((x = rn_addmask(m_arg, 1, head->rnh_treetop->rn_off)) == 0)
222 x = rn_match(v_arg, head);
224 while (x && x->rn_mask != netmask)
231 rn_satisfies_leaf(trial, leaf, skip)
233 struct radix_node *leaf;
236 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
238 int length = min(*(u_char *)cp, *(u_char *)cp2);
243 length = min(length, *(u_char *)cp3);
247 for (cp += skip; cp < cplim; cp++, cp2++, cp3++)
248 if ((*cp ^ *cp2) & *cp3)
254 rn_match(v_arg, head)
256 struct radix_node_head *head;
259 struct radix_node *t = head->rnh_treetop, *x;
262 struct radix_node *saved_t, *top = t;
263 int off = t->rn_off, vlen = *(u_char *)cp, matched_off;
267 * Open code rn_search(v, top) to avoid overhead of extra
270 for (; t->rn_b >= 0; ) {
271 if (t->rn_bmask & cp[t->rn_off])
277 * See if we match exactly as a host destination
278 * or at least learn how many bits match, for normal mask finesse.
280 * It doesn't hurt us to limit how many bytes to check
281 * to the length of the mask, since if it matches we had a genuine
282 * match and the leaf we have is the most specific one anyway;
283 * if it didn't match with a shorter length it would fail
284 * with a long one. This wins big for class B&C netmasks which
285 * are probably the most common case...
288 vlen = *(u_char *)t->rn_mask;
290 cp2 = t->rn_key + off;
292 for (; cp < cplim; cp++, cp2++)
296 * This extra grot is in case we are explicitly asked
297 * to look up the default. Ugh!
299 if ((t->rn_flags & RNF_ROOT) && t->rn_dupedkey)
303 test = (*cp ^ *cp2) & 0xff; /* find first bit that differs */
304 for (b = 7; (test >>= 1) > 0;)
306 matched_off = cp - v;
307 b += matched_off << 3;
310 * If there is a host route in a duped-key chain, it will be first.
312 if ((saved_t = t)->rn_mask == 0)
314 for (; t; t = t->rn_dupedkey)
316 * Even if we don't match exactly as a host,
317 * we may match if the leaf we wound up at is
320 if (t->rn_flags & RNF_NORMAL) {
323 } else if (rn_satisfies_leaf(v, t, matched_off))
326 /* start searching up the tree */
328 struct radix_mask *m;
333 * If non-contiguous masks ever become important
334 * we can restore the masking and open coding of
335 * the search and satisfaction test and put the
336 * calculation of "off" back before the "do".
339 if (m->rm_flags & RNF_NORMAL) {
343 off = min(t->rn_off, matched_off);
344 x = rn_search_m(v, t, m->rm_mask);
345 while (x && x->rn_mask != m->rm_mask)
347 if (x && rn_satisfies_leaf(v, x, off))
359 struct radix_node *rn_clist;
365 rn_newpair(v, b, nodes)
368 struct radix_node nodes[2];
370 struct radix_node *tt = nodes, *t = tt + 1;
372 t->rn_bmask = 0x80 >> (b & 7);
376 tt->rn_key = (caddr_t)v;
378 tt->rn_flags = t->rn_flags = RNF_ACTIVE;
380 tt->rn_info = rn_nodenum++;
381 t->rn_info = rn_nodenum++;
383 tt->rn_ybro = rn_clist;
390 rn_insert(v_arg, head, dupentry, nodes)
392 struct radix_node_head *head;
394 struct radix_node nodes[2];
397 struct radix_node *top = head->rnh_treetop;
398 int head_off = top->rn_off, vlen = (int)*((u_char *)v);
399 struct radix_node *t = rn_search(v_arg, top);
400 caddr_t cp = v + head_off;
402 struct radix_node *tt;
406 log(LOG_DEBUG, "rn_insert(%p,%p,%p,%p)\n", v_arg, head, dupentry, nodes);
409 * Find first bit at which v and t->rn_key differ
412 caddr_t cp2 = t->rn_key + head_off;
414 caddr_t cplim = v + vlen;
423 cmp_res = (cp[-1] ^ cp2[-1]) & 0xff;
424 for (b = (cp - v) << 3; cmp_res; b--)
428 struct radix_node *p, *x = top;
432 if (cp[x->rn_off] & x->rn_bmask)
436 } while (b > (unsigned) x->rn_b); /* x->rn_b < b && x->rn_b >= 0 */
439 log(LOG_DEBUG, "rn_insert: Going In:\n"); // traverse(p);
441 t = rn_newpair(v_arg, b, nodes);
443 if ((cp[p->rn_off] & p->rn_bmask) == 0)
448 t->rn_p = p; /* frees x, p as temp vars below */
449 if ((cp[t->rn_off] & t->rn_bmask) == 0) {
457 log(LOG_DEBUG, "rn_insert: Coming Out:\n"); // traverse(p);
464 rn_addmask(n_arg, search, skip)
468 caddr_t netmask = (caddr_t)n_arg;
469 struct radix_node *x;
472 int maskduplicated, m0, isnormal;
473 struct radix_node *saved_x;
474 static int last_zeroed = 0;
478 log(LOG_DEBUG, "rn_addmask(%p,%d,%d)\n", n_arg, search, skip);
480 mlen = *(u_char *)netmask;
481 if ((mlen = *(u_char *)netmask) > max_keylen)
486 return (mask_rnhead->rnh_nodes);
488 Bcopy(rn_ones + 1, addmask_key + 1, skip - 1);
489 if ((m0 = mlen) > skip)
490 Bcopy(netmask + skip, addmask_key + skip, mlen - skip);
492 * Trim trailing zeroes.
494 for (cp = addmask_key + mlen; (cp > addmask_key) && cp[-1] == 0;)
496 mlen = cp - addmask_key;
498 if (m0 >= last_zeroed)
500 return (mask_rnhead->rnh_nodes);
502 if (m0 < last_zeroed)
503 Bzero(addmask_key + m0, last_zeroed - m0);
504 *addmask_key = last_zeroed = mlen;
505 x = rn_search(addmask_key, rn_masktop);
506 if (Bcmp(addmask_key, x->rn_key, mlen) != 0)
510 R_Malloc(x, struct radix_node *, max_keylen + 2 * sizeof (*x));
511 if ((saved_x = x) == 0)
513 Bzero(x, max_keylen + 2 * sizeof (*x));
514 netmask = cp = (caddr_t)(x + 2);
515 Bcopy(addmask_key, cp, mlen);
516 x = rn_insert(cp, mask_rnhead, &maskduplicated, x);
517 if (maskduplicated) {
519 log(LOG_ERR, "rn_addmask: mask impossibly already in tree\n");
525 * Calculate index of mask, and check for normalcy.
527 cplim = netmask + mlen;
529 for (cp = netmask + skip; (cp < cplim) && *(u_char *)cp == 0xff;)
532 for (j = 0x80; (j & *cp) != 0; j >>= 1)
534 if (*cp != normal_chars[b] || cp != (cplim - 1))
537 b += (cp - netmask) << 3;
540 x->rn_flags |= RNF_NORMAL;
544 static int /* XXX: arbitrary ordering for non-contiguous masks */
545 rn_lexobetter(m_arg, n_arg)
548 u_char *mp = m_arg, *np = n_arg, *lim;
551 return 1; /* not really, but need to check longer one first */
553 for (lim = mp + *mp; mp < lim;)
559 static struct radix_mask *
560 rn_new_radix_mask(tt, next)
561 struct radix_node *tt;
562 struct radix_mask *next;
564 struct radix_mask *m;
569 log(LOG_ERR, "Mask for route not entered\n");
575 m->rm_flags = tt->rn_flags;
576 if (tt->rn_flags & RNF_NORMAL)
579 m->rm_mask = tt->rn_mask;
586 rn_addroute(v_arg, n_arg, head, treenodes)
588 struct radix_node_head *head;
589 struct radix_node treenodes[2];
591 caddr_t v = (caddr_t)v_arg, netmask = (caddr_t)n_arg;
592 struct radix_node *t, *x = NULL, *tt;
593 struct radix_node *saved_tt, *top = head->rnh_treetop;
594 short b = 0, b_leaf = 0;
597 struct radix_mask *m, **mp;
601 log(LOG_DEBUG, "rn_addroute(%p,%p,%p,%p)\n", v_arg, n_arg, head, treenodes);
604 * In dealing with non-contiguous masks, there may be
605 * many different routes which have the same mask.
606 * We will find it useful to have a unique pointer to
607 * the mask to speed avoiding duplicate references at
608 * nodes and possibly save time in calculating indices.
611 if ((x = rn_addmask(netmask, 0, top->rn_off)) == 0)
618 * Deal with duplicated keys: attach node to previous instance
620 saved_tt = tt = rn_insert(v, head, &keyduplicated, treenodes);
622 for (t = tt; tt; t = tt, tt = tt->rn_dupedkey) {
623 if (tt->rn_mask == netmask)
627 ((b_leaf < tt->rn_b) || /* index(netmask) > node */
628 rn_refines(netmask, tt->rn_mask) ||
629 rn_lexobetter(netmask, tt->rn_mask))))
633 * If the mask is not duplicated, we wouldn't
634 * find it among possible duplicate key entries
635 * anyway, so the above test doesn't hurt.
637 * We sort the masks for a duplicated key the same way as
638 * in a masklist -- most specific to least specific.
639 * This may require the unfortunate nuisance of relocating
640 * the head of the list.
642 * We also reverse, or doubly link the list through the
645 if (tt == saved_tt) {
646 struct radix_node *xx = x;
647 /* link in at head of list */
648 (tt = treenodes)->rn_dupedkey = t;
649 tt->rn_flags = t->rn_flags;
650 tt->rn_p = x = t->rn_p;
659 (tt = treenodes)->rn_dupedkey = t->rn_dupedkey;
663 tt->rn_dupedkey->rn_p = tt;
667 tt->rn_info = rn_nodenum++;
668 t->rn_info = rn_nodenum++;
670 tt->rn_ybro = rn_clist;
673 tt->rn_key = (caddr_t) v;
675 tt->rn_flags = RNF_ACTIVE;
681 tt->rn_mask = netmask;
683 tt->rn_flags |= x->rn_flags & RNF_NORMAL;
688 b_leaf = -1 - t->rn_b;
689 if (t->rn_r == saved_tt)
693 /* Promote general routes from below */
695 for (mp = &t->rn_mklist; x; x = x->rn_dupedkey)
696 if (x->rn_mask && (x->rn_b >= b_leaf) && x->rn_mklist == 0) {
697 *mp = m = rn_new_radix_mask(x, 0);
701 } else if (x->rn_mklist) {
703 * Skip over masks whose index is > that of new node
705 for (mp = &x->rn_mklist; (m = *mp) != NULL; mp = &m->rm_mklist)
706 if (m->rm_b >= b_leaf)
712 /* Add new route to highest possible ancestor's list */
713 if ((netmask == 0) || (b > t->rn_b ))
714 return tt; /* can't lift at all */
719 } while (b <= t->rn_b && x != top);
721 * Search through routes associated with node to
722 * insert new route according to index.
723 * Need same criteria as when sorting dupedkeys to avoid
724 * double loop on deletion.
726 for (mp = &x->rn_mklist; (m = *mp) != NULL; mp = &m->rm_mklist) {
727 if (m->rm_b < b_leaf)
729 if (m->rm_b > b_leaf)
731 if (m->rm_flags & RNF_NORMAL) {
732 mmask = m->rm_leaf->rn_mask;
733 if (tt->rn_flags & RNF_NORMAL) {
735 log(LOG_ERR, "Non-unique normal route,"
736 " mask not entered\n");
742 if (mmask == netmask) {
747 if (rn_refines(netmask, mmask)
748 || rn_lexobetter(netmask, mmask))
751 *mp = rn_new_radix_mask(tt, *mp);
756 rn_delete(v_arg, netmask_arg, head)
757 void *v_arg, *netmask_arg;
758 struct radix_node_head *head;
760 struct radix_node *t, *p, *x, *tt;
761 struct radix_mask *m, *saved_m, **mp;
762 struct radix_node *dupedkey, *saved_tt, *top;
764 int b, head_off, vlen;
767 netmask = netmask_arg;
768 x = head->rnh_treetop;
769 tt = rn_search(v, x);
770 head_off = x->rn_off;
775 Bcmp(v + head_off, tt->rn_key + head_off, vlen - head_off))
778 * Delete our route from mask lists.
781 if ((x = rn_addmask(netmask, 1, head_off)) == 0)
784 while (tt->rn_mask != netmask)
785 if ((tt = tt->rn_dupedkey) == 0)
788 if (tt->rn_mask == 0 || (saved_m = m = tt->rn_mklist) == 0)
790 if (tt->rn_flags & RNF_NORMAL) {
791 if (m->rm_leaf != tt || m->rm_refs > 0) {
793 log(LOG_ERR, "rn_delete: inconsistent annotation\n");
795 return 0; /* dangling ref could cause disaster */
798 if (m->rm_mask != tt->rn_mask) {
800 log(LOG_ERR, "rn_delete: inconsistent annotation\n");
804 if (--m->rm_refs >= 0)
810 goto on1; /* Wasn't lifted at all */
814 } while (b <= t->rn_b && x != top);
815 for (mp = &x->rn_mklist; (m = *mp) != NULL; mp = &m->rm_mklist)
823 log(LOG_ERR, "rn_delete: couldn't find our annotation\n");
825 if (tt->rn_flags & RNF_NORMAL)
826 return (0); /* Dangling ref to us */
830 * Eliminate us from tree
832 if (tt->rn_flags & RNF_ROOT)
835 /* Get us out of the creation list */
836 for (t = rn_clist; t && t->rn_ybro != tt; t = t->rn_ybro)
838 if (t) t->rn_ybro = tt->rn_ybro;
841 dupedkey = saved_tt->rn_dupedkey;
844 * Here, tt is the deletion target and
845 * saved_tt is the head of the dupedkey chain.
847 if (tt == saved_tt) {
855 /* find node in front of tt on the chain */
856 for (x = p = saved_tt; p && p->rn_dupedkey != tt;)
859 p->rn_dupedkey = tt->rn_dupedkey;
861 tt->rn_dupedkey->rn_p = p;
865 log(LOG_ERR, "rn_delete: couldn't find us\n");
869 if (t->rn_flags & RNF_ACTIVE) {
899 * Demote routes attached to us.
903 for (mp = &x->rn_mklist; (m = *mp) != NULL;)
907 /* If there are any key,mask pairs in a sibling
908 duped-key chain, some subset will appear sorted
909 in the same order attached to our mklist */
910 for (m = t->rn_mklist; m && x; x = x->rn_dupedkey)
911 if (m == x->rn_mklist) {
912 struct radix_mask *mm = m->rm_mklist;
914 if (--(m->rm_refs) < 0)
920 log(LOG_ERR, "%s %p at %p\n",
921 "rn_delete: Orphaned Mask", m, x);
926 * We may be holding an active internal node in the tree.
946 tt->rn_flags &= ~RNF_ACTIVE;
947 tt[1].rn_flags &= ~RNF_ACTIVE;
953 struct radix_node_head *h;
954 int (*f) __P((struct radix_node *, void *));
958 struct radix_node *base, *next;
959 struct radix_node *rn = h->rnh_treetop;
961 * This gets complicated because we may delete the node
962 * while applying the function f to it, so we need to calculate
963 * the successor node in advance.
965 /* First time through node, go left */
966 while (rn->rn_b >= 0)
970 /* If at right child go back up, otherwise, go right */
971 while (rn->rn_p->rn_r == rn && (rn->rn_flags & RNF_ROOT) == 0)
973 /* Find the next *leaf* since next node might vanish, too */
974 for (rn = rn->rn_p->rn_r; rn->rn_b >= 0;)
978 while ((rn = base) != NULL) {
979 base = rn->rn_dupedkey;
980 if (!(rn->rn_flags & RNF_ROOT)
981 && (error = (*f)(rn, w)))
985 if (rn->rn_flags & RNF_ROOT)
992 rn_inithead(head, off)
996 struct radix_node_head *rnh;
1000 R_Malloc(rnh, struct radix_node_head *, sizeof (*rnh));
1004 return rn_inithead0(rnh, off);
1008 rn_inithead0(rnh, off)
1009 struct radix_node_head *rnh;
1012 struct radix_node *t, *tt, *ttt;
1014 Bzero(rnh, sizeof (*rnh));
1015 t = rn_newpair(rn_zeros, off, rnh->rnh_nodes);
1016 ttt = rnh->rnh_nodes + 2;
1020 tt->rn_flags = t->rn_flags = RNF_ROOT | RNF_ACTIVE;
1021 tt->rn_b = -1 - off;
1023 ttt->rn_key = rn_ones;
1024 rnh->rnh_addaddr = rn_addroute;
1025 rnh->rnh_deladdr = rn_delete;
1026 rnh->rnh_matchaddr = rn_match;
1027 rnh->rnh_lookup = rn_lookup;
1028 rnh->rnh_walktree = rn_walktree;
1029 rnh->rnh_treetop = t;
1038 if (max_keylen == 0) {
1041 "rn_init: radix functions require max_keylen be set\n");
1045 if (rn_zeros == NULL) {
1046 R_Malloc(rn_zeros, char *, 3 * max_keylen);
1048 if (rn_zeros == NULL)
1050 Bzero(rn_zeros, 3 * max_keylen);
1051 rn_ones = cp = rn_zeros + max_keylen;
1052 addmask_key = cplim = rn_ones + max_keylen;
1055 if (rn_inithead((void *)&mask_rnhead, 0) == 0)
1061 rn_freenode(struct radix_node *n, void *p)
1063 struct radix_node_head *rnh = p;
1064 struct radix_node *d;
1066 d = rnh->rnh_deladdr(n->rn_key, NULL, rnh);
1068 FreeS(d, max_keylen + 2 * sizeof (*d));
1076 struct radix_node_head *rnh;
1079 (void)rn_walktree(rnh, rn_freenode, rnh);
1081 rnh->rnh_addaddr = NULL;
1082 rnh->rnh_deladdr = NULL;
1083 rnh->rnh_matchaddr = NULL;
1084 rnh->rnh_lookup = NULL;
1085 rnh->rnh_walktree = NULL;
1094 struct radix_mask *m;
1096 if (rn_zeros != NULL) {
1097 FreeS(rn_zeros, 3 * max_keylen);
1101 if (mask_rnhead != NULL) {
1102 rn_freehead(mask_rnhead);
1106 while ((m = rn_mkfreelist) != NULL) {
1107 rn_mkfreelist = m->rm_mklist;
1115 typedef struct myst {
1118 struct radix_node nodes[2];
1122 main(int argc, char *argv[])
1124 struct radix_node_head *rnh;
1125 struct radix_node *rn;
1126 addrfamily_t af, mf;
1127 myst_t st1, st2, *stp;
1129 memset(&st1, 0, sizeof(st1));
1130 memset(&st2, 0, sizeof(st2));
1131 memset(&af, 0, sizeof(af));
1136 rn_inithead(&rnh, offsetof(addrfamily_t, adf_addr) << 3);
1138 st1.dst.adf_len = sizeof(st1);
1139 st1.mask.adf_len = sizeof(st1);
1140 st1.dst.adf_addr.in4.s_addr = inet_addr("127.0.0.0");
1141 st1.mask.adf_addr.in4.s_addr = inet_addr("255.0.0.0");
1142 rn = rnh->rnh_addaddr(&st1.dst, &st1.mask, rnh, st1.nodes);
1143 printf("add.1 %p\n", rn);
1145 st2.dst.adf_len = sizeof(st2);
1146 st2.mask.adf_len = sizeof(st2);
1147 st2.dst.adf_addr.in4.s_addr = inet_addr("127.0.1.0");
1148 st2.mask.adf_addr.in4.s_addr = inet_addr("255.255.255.0");
1149 rn = rnh->rnh_addaddr(&st2.dst, &st2.mask, rnh, st2.nodes);
1150 printf("add.2 %p\n", rn);
1152 af.adf_len = sizeof(af);
1153 af.adf_addr.in4.s_addr = inet_addr("127.0.1.0");
1154 rn = rnh->rnh_matchaddr(&af, rnh);
1156 printf("1.lookup = %p key %p mask %p\n", rn, rn->rn_key, rn->rn_mask);
1158 printf("%s/", inet_ntoa(stp->dst.adf_addr.in4));
1160 printf("%s\n", inet_ntoa(stp->dst.adf_addr.in4));
1163 mf.adf_len = sizeof(mf);
1164 mf.adf_addr.in4.s_addr = inet_addr("255.255.255.0");
1165 rn = rnh->rnh_lookup(&af, &mf, rnh);
1167 printf("2.lookup = %p key %p mask %p\n", rn, rn->rn_key, rn->rn_mask);
1169 printf("%s/", inet_ntoa(stp->dst.adf_addr.in4));
1171 printf("%s\n", inet_ntoa(stp->dst.adf_addr.in4));
1174 af.adf_len = sizeof(af);
1175 af.adf_addr.in4.s_addr = inet_addr("126.0.0.1");
1176 rn = rnh->rnh_matchaddr(&af, rnh);
1178 printf("3.lookup = %p key %p mask %p\n", rn, rn->rn_key, rn->rn_mask);
1180 printf("%s/", inet_ntoa(stp->dst.adf_addr.in4));
1182 printf("%s\n", inet_ntoa(stp->dst.adf_addr.in4));
1190 log(int level, char *format, ...)
1194 va_start(ap, format);
1195 vfprintf(stderr, format, ap);