]>
git.ipfire.org Git - thirdparty/squid.git/blob - lib/radix.c
2 * $Id: radix.c,v 1.13 2001/02/07 19:04:08 hno Exp $
4 * DEBUG: section 53 Radix tree data structure implementation
5 * AUTHOR: NetBSD Derived
7 * SQUID Web Proxy Cache http://www.squid-cache.org/
8 * ----------------------------------------------------------
10 * Squid is the result of efforts by numerous individuals from
11 * the Internet community; see the CONTRIBUTORS file for full
12 * details. Many organizations have provided support for Squid's
13 * development; see the SPONSORS file for full details. Squid is
14 * Copyrighted (C) 2001 by the Regents of the University of
15 * California; see the COPYRIGHT file for full details. Squid
16 * incorporates software developed and/or copyrighted by other
17 * sources; see the CREDITS file for full details.
19 * This program is free software; you can redistribute it and/or modify
20 * it under the terms of the GNU General Public License as published by
21 * the Free Software Foundation; either version 2 of the License, or
22 * (at your option) any later version.
24 * This program is distributed in the hope that it will be useful,
25 * but WITHOUT ANY WARRANTY; without even the implied warranty of
26 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
27 * GNU General Public License for more details.
29 * You should have received a copy of the GNU General Public License
30 * along with this program; if not, write to the Free Software
31 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
37 * Copyright (c) 1988, 1989, 1993
38 * The Regents of the University of California. All rights reserved.
40 * Redistribution and use in source and binary forms, with or without
41 * modification, are permitted provided that the following conditions
43 * 1. Redistributions of source code must retain the above copyright
44 * notice, this list of conditions and the following disclaimer.
45 * 2. Redistributions in binary form must reproduce the above copyright
46 * notice, this list of conditions and the following disclaimer in the
47 * documentation and/or other materials provided with the distribution.
48 * 3. All advertising materials mentioning features or use of this software
49 * must display the following acknowledgement:
50 * This product includes software developed by the University of
51 * California, Berkeley and its contributors.
52 * 4. Neither the name of the University nor the names of its contributors
53 * may be used to endorse or promote products derived from this software
54 * without specific prior written permission.
56 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
57 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
58 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
59 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
60 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
61 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
62 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
63 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
64 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
65 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
68 * @(#)radix.c 8.4 (Berkeley) 11/2/94
84 #include <sys/types.h>
99 #include <gnumalloc.h>
100 #elif HAVE_MALLOC_H && !defined(_SQUID_FREEBSD_) && !defined(_SQUID_NEXT_)
107 #include <sys/param.h>
118 struct radix_mask
*rn_mkfreelist
;
119 struct radix_node_head
*mask_rnhead
;
120 static char *addmask_key
;
121 static unsigned char normal_chars
[] =
122 {0, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, 0xFF};
123 static char *rn_zeros
, *rn_ones
;
125 #define rn_masktop (mask_rnhead->rnh_treetop)
127 #define Bcmp(a, b, l) (l == 0 ? 0 : memcmp((caddr_t)(a), (caddr_t)(b), (u_long)l))
129 * The data structure for the keys is a radix tree with one way
130 * branching removed. The index rn_b at an internal node n represents a bit
131 * position to be tested. The tree is arranged so that all descendants
132 * of a node n have keys whose bits all agree up to position rn_b - 1.
133 * (We say the index of n is rn_b.)
135 * There is at least one descendant which has a one bit at position rn_b,
136 * and at least one with a zero there.
138 * A route is determined by a pair of key and mask. We require that the
139 * bit-wise logical and of the key and mask to be the key.
140 * We define the index of a route to associated with the mask to be
141 * the first bit number in the mask where 0 occurs (with bit number 0
142 * representing the highest order bit).
144 * We say a mask is normal if every bit is 0, past the index of the mask.
145 * If a node n has a descendant (k, m) with index(m) == index(n) == rn_b,
146 * and m is a normal mask, then the route applies to every descendant of n.
147 * If the index(m) < rn_b, this implies the trailing last few bits of k
148 * before bit b are all 0, (and hence consequently true of every descendant
149 * of n), so the route applies to all descendants of the node as well.
151 * Similar logic shows that a non-normal mask m such that
152 * index(m) <= index(n) could potentially apply to many children of n.
153 * Thus, for each non-host route, we attach its mask to a list at an internal
154 * node as high in the tree as we can go.
156 * The present version of the code makes use of normal routes in short-
157 * circuiting an explict mask and compare operation when testing whether
158 * a key satisfies a normal route, and also in remembering the unique leaf
159 * that governs a subtree.
163 rn_search(v_arg
, head
)
165 struct radix_node
*head
;
167 register struct radix_node
*x
;
170 for (x
= head
, v
= v_arg
; x
->rn_b
>= 0;) {
171 if (x
->rn_bmask
& v
[x
->rn_off
])
180 rn_search_m(v_arg
, head
, m_arg
)
181 struct radix_node
*head
;
184 register struct radix_node
*x
;
185 register caddr_t v
= v_arg
, m
= m_arg
;
187 for (x
= head
; x
->rn_b
>= 0;) {
188 if ((x
->rn_bmask
& m
[x
->rn_off
]) &&
189 (x
->rn_bmask
& v
[x
->rn_off
]))
198 rn_refines(m_arg
, n_arg
)
201 register caddr_t m
= m_arg
, n
= n_arg
;
202 register caddr_t lim
, lim2
= lim
= n
+ *(u_char
*) n
;
203 int longer
= (*(u_char
*) n
++) - (int) (*(u_char
*) m
++);
204 int masks_are_equal
= 1;
217 if (masks_are_equal
&& (longer
< 0))
218 for (lim2
= m
- longer
; m
< lim2
;)
221 return (!masks_are_equal
);
225 rn_lookup(v_arg
, m_arg
, head
)
227 struct radix_node_head
*head
;
229 register struct radix_node
*x
;
233 if ((x
= rn_addmask(m_arg
, 1, head
->rnh_treetop
->rn_off
)) == 0)
237 x
= rn_match(v_arg
, head
);
239 while (x
&& x
->rn_mask
!= netmask
)
247 rn_satsifies_leaf(trial
, leaf
, skip
)
249 register struct radix_node
*leaf
;
252 register char *cp
= trial
, *cp2
= leaf
->rn_key
, *cp3
= leaf
->rn_mask
;
254 int length
= min(*(u_char
*) cp
, *(u_char
*) cp2
);
259 length
= min(length
, *(u_char
*) cp3
);
263 for (cp
+= skip
; cp
< cplim
; cp
++, cp2
++, cp3
++)
264 if ((*cp
^ *cp2
) & *cp3
)
270 rn_match(v_arg
, head
)
272 struct radix_node_head
*head
;
275 register struct radix_node
*t
= head
->rnh_treetop
, *x
;
276 register caddr_t cp
= v
, cp2
;
278 struct radix_node
*saved_t
, *top
= t
;
279 int off
= t
->rn_off
, vlen
= *(u_char
*) cp
, matched_off
;
280 register int test
, b
, rn_b
;
283 * Open code rn_search(v, top) to avoid overhead of extra
286 for (; t
->rn_b
>= 0;) {
287 if (t
->rn_bmask
& cp
[t
->rn_off
])
293 * See if we match exactly as a host destination
294 * or at least learn how many bits match, for normal mask finesse.
296 * It doesn't hurt us to limit how many bytes to check
297 * to the length of the mask, since if it matches we had a genuine
298 * match and the leaf we have is the most specific one anyway;
299 * if it didn't match with a shorter length it would fail
300 * with a long one. This wins big for class B&C netmasks which
301 * are probably the most common case...
304 vlen
= *(u_char
*) t
->rn_mask
;
306 cp2
= t
->rn_key
+ off
;
308 for (; cp
< cplim
; cp
++, cp2
++)
312 * This extra grot is in case we are explicitly asked
313 * to look up the default. Ugh!
315 if ((t
->rn_flags
& RNF_ROOT
) && t
->rn_dupedkey
)
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
) {
339 } else if (rn_satsifies_leaf(v
, t
, matched_off
))
342 /* start searching up the tree */
344 register struct radix_mask
*m
;
346 if ((m
= t
->rn_mklist
)) {
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
) {
358 off
= min(t
->rn_off
, 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_satsifies_leaf(v
, x
, off
))
365 } while ((m
= m
->rm_mklist
));
373 struct radix_node
*rn_clist
;
379 rn_newpair(v
, b
, nodes
)
382 struct radix_node nodes
[2];
384 register struct radix_node
*tt
= nodes
, *t
= tt
+ 1;
386 t
->rn_bmask
= 0x80 >> (b
& 7);
390 tt
->rn_key
= (caddr_t
) v
;
392 tt
->rn_flags
= t
->rn_flags
= RNF_ACTIVE
;
394 tt
->rn_info
= rn_nodenum
++;
395 t
->rn_info
= rn_nodenum
++;
397 tt
->rn_ybro
= rn_clist
;
404 rn_insert(v_arg
, head
, dupentry
, nodes
)
406 struct radix_node_head
*head
;
408 struct radix_node nodes
[2];
411 struct radix_node
*top
= head
->rnh_treetop
;
412 int head_off
= top
->rn_off
, vlen
= (int) *((u_char
*) v
);
413 register struct radix_node
*t
= rn_search(v_arg
, top
);
414 register caddr_t cp
= v
+ head_off
;
416 struct radix_node
*tt
;
418 * Find first bit at which v and t->rn_key differ
421 register caddr_t cp2
= t
->rn_key
+ head_off
;
422 register int cmp_res
;
423 caddr_t cplim
= v
+ vlen
;
432 cmp_res
= (cp
[-1] ^ cp2
[-1]) & 0xff;
433 for (b
= (cp
- v
) << 3; cmp_res
; b
--)
437 register struct radix_node
*p
, *x
= top
;
441 if (cp
[x
->rn_off
] & x
->rn_bmask
)
445 } while (b
> (unsigned) x
->rn_b
); /* x->rn_b < b && x->rn_b >= 0 */
448 fprintf(stderr
, "rn_insert: Going In:\n");
451 t
= rn_newpair(v_arg
, b
, nodes
);
453 if ((cp
[p
->rn_off
] & p
->rn_bmask
) == 0)
458 t
->rn_p
= p
; /* frees x, p as temp vars below */
459 if ((cp
[t
->rn_off
] & t
->rn_bmask
) == 0) {
467 log(LOG_DEBUG
, "rn_insert: Coming Out:\n"), traverse(p
);
474 rn_addmask(n_arg
, search
, skip
)
478 caddr_t netmask
= (caddr_t
) n_arg
;
479 register struct radix_node
*x
;
480 register caddr_t cp
, cplim
;
481 register int b
= 0, mlen
, j
;
482 int maskduplicated
, m0
, isnormal
;
483 struct radix_node
*saved_x
;
484 static int last_zeroed
= 0;
486 if ((mlen
= *(u_char
*) netmask
) > max_keylen
)
491 return (mask_rnhead
->rnh_nodes
);
493 memcpy(addmask_key
+ 1, rn_ones
+ 1, skip
- 1);
494 if ((m0
= mlen
) > skip
)
495 memcpy(addmask_key
+ skip
, netmask
+ skip
, mlen
- skip
);
497 * Trim trailing zeroes.
499 for (cp
= addmask_key
+ mlen
; (cp
> addmask_key
) && cp
[-1] == 0;)
501 mlen
= cp
- addmask_key
;
503 if (m0
>= last_zeroed
)
505 return (mask_rnhead
->rnh_nodes
);
507 if (m0
< last_zeroed
)
508 memset(addmask_key
+ m0
, '\0', last_zeroed
- m0
);
509 *addmask_key
= last_zeroed
= mlen
;
510 x
= rn_search(addmask_key
, rn_masktop
);
511 if (memcmp(addmask_key
, x
->rn_key
, mlen
) != 0)
515 R_Malloc(x
, struct radix_node
*, max_keylen
+ 2 * sizeof(*x
));
516 if ((saved_x
= x
) == 0)
518 memset(x
, '\0', max_keylen
+ 2 * sizeof(*x
));
519 netmask
= cp
= (caddr_t
) (x
+ 2);
520 memcpy(cp
, addmask_key
, mlen
);
521 x
= rn_insert(cp
, mask_rnhead
, &maskduplicated
, x
);
522 if (maskduplicated
) {
523 fprintf(stderr
, "rn_addmask: mask impossibly already in tree");
528 * Calculate index of mask, and check for normalcy.
530 cplim
= netmask
+ mlen
;
532 for (cp
= netmask
+ skip
; (cp
< cplim
) && *(u_char
*) cp
== 0xff;)
535 for (j
= 0x80; (j
& *cp
) != 0; j
>>= 1)
537 if (*cp
!= normal_chars
[b
] || cp
!= (cplim
- 1))
540 b
+= (cp
- netmask
) << 3;
543 x
->rn_flags
|= RNF_NORMAL
;
547 static int /* XXX: arbitrary ordering for non-contiguous masks */
548 rn_lexobetter(m_arg
, n_arg
)
551 register u_char
*mp
= m_arg
, *np
= n_arg
, *lim
;
554 return 1; /* not really, but need to check longer one first */
556 for (lim
= mp
+ *mp
; mp
< lim
;)
562 static struct radix_mask
*
563 rn_new_radix_mask(tt
, next
)
564 register struct radix_node
*tt
;
565 register struct radix_mask
*next
;
567 register struct radix_mask
*m
;
571 fprintf(stderr
, "Mask for route not entered\n");
574 memset(m
, '\0', sizeof *m
);
576 m
->rm_flags
= tt
->rn_flags
;
577 if (tt
->rn_flags
& RNF_NORMAL
)
580 m
->rm_mask
= tt
->rn_mask
;
587 rn_addroute(v_arg
, n_arg
, head
, treenodes
)
589 struct radix_node_head
*head
;
590 struct radix_node treenodes
[2];
592 caddr_t v
= (caddr_t
) v_arg
, netmask
= (caddr_t
) n_arg
;
593 register struct radix_node
*t
, *x
= NULL
, *tt
;
594 struct radix_node
*saved_tt
, *top
= head
->rnh_treetop
;
595 short b
= 0, b_leaf
= 0;
598 struct radix_mask
*m
, **mp
;
601 * In dealing with non-contiguous masks, there may be
602 * many different routes which have the same mask.
603 * We will find it useful to have a unique pointer to
604 * the mask to speed avoiding duplicate references at
605 * nodes and possibly save time in calculating indices.
608 if ((x
= rn_addmask(netmask
, 0, top
->rn_off
)) == 0)
615 * Deal with duplicated keys: attach node to previous instance
617 saved_tt
= tt
= rn_insert(v
, head
, &keyduplicated
, treenodes
);
619 for (t
= tt
; tt
; t
= tt
, tt
= tt
->rn_dupedkey
) {
620 if (tt
->rn_mask
== netmask
)
624 ((b_leaf
< tt
->rn_b
) || /* index(netmask) > node */
625 rn_refines(netmask
, tt
->rn_mask
) ||
626 rn_lexobetter(netmask
, tt
->rn_mask
))))
630 * If the mask is not duplicated, we wouldn't
631 * find it among possible duplicate key entries
632 * anyway, so the above test doesn't hurt.
634 * We sort the masks for a duplicated key the same way as
635 * in a masklist -- most specific to least specific.
636 * This may require the unfortunate nuisance of relocating
637 * the head of the list.
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
;
652 (tt
= treenodes
)->rn_dupedkey
= t
->rn_dupedkey
;
657 tt
->rn_info
= rn_nodenum
++;
658 t
->rn_info
= rn_nodenum
++;
660 tt
->rn_ybro
= rn_clist
;
663 tt
->rn_key
= (caddr_t
) v
;
665 tt
->rn_flags
= RNF_ACTIVE
;
671 tt
->rn_mask
= netmask
;
673 tt
->rn_flags
|= x
->rn_flags
& RNF_NORMAL
;
678 b_leaf
= -1 - t
->rn_b
;
679 if (t
->rn_r
== saved_tt
)
683 /* Promote general routes from below */
685 for (mp
= &t
->rn_mklist
; x
; x
= x
->rn_dupedkey
)
686 if (x
->rn_mask
&& (x
->rn_b
>= b_leaf
) && x
->rn_mklist
== 0) {
687 if ((*mp
= m
= rn_new_radix_mask(x
, 0)))
690 } else if (x
->rn_mklist
) {
692 * Skip over masks whose index is > that of new node
694 for (mp
= &x
->rn_mklist
; (m
= *mp
); mp
= &m
->rm_mklist
)
695 if (m
->rm_b
>= b_leaf
)
701 /* Add new route to highest possible ancestor's list */
702 if ((netmask
== 0) || (b
> t
->rn_b
))
703 return tt
; /* can't lift at all */
708 } while (b
<= t
->rn_b
&& x
!= top
);
710 * Search through routes associated with node to
711 * insert new route according to index.
712 * Need same criteria as when sorting dupedkeys to avoid
713 * double loop on deletion.
715 for (mp
= &x
->rn_mklist
; (m
= *mp
); mp
= &m
->rm_mklist
) {
716 if (m
->rm_b
< b_leaf
)
718 if (m
->rm_b
> b_leaf
)
720 if (m
->rm_flags
& RNF_NORMAL
) {
721 mmask
= m
->rm_leaf
->rn_mask
;
722 if (tt
->rn_flags
& RNF_NORMAL
) {
724 "Non-unique normal route, mask not entered");
729 if (mmask
== netmask
) {
734 if (rn_refines(netmask
, mmask
) || rn_lexobetter(netmask
, mmask
))
737 *mp
= rn_new_radix_mask(tt
, *mp
);
742 rn_delete(v_arg
, netmask_arg
, head
)
743 void *v_arg
, *netmask_arg
;
744 struct radix_node_head
*head
;
746 register struct radix_node
*t
, *p
, *x
, *tt
;
747 struct radix_mask
*m
, *saved_m
, **mp
;
748 struct radix_node
*dupedkey
, *saved_tt
, *top
;
750 int b
, head_off
, vlen
;
753 netmask
= netmask_arg
;
754 x
= head
->rnh_treetop
;
755 tt
= rn_search(v
, x
);
756 head_off
= x
->rn_off
;
757 vlen
= *(u_char
*) v
;
761 memcmp(v
+ head_off
, tt
->rn_key
+ head_off
, vlen
- head_off
))
764 * Delete our route from mask lists.
767 if ((x
= rn_addmask(netmask
, 1, head_off
)) == 0)
770 while (tt
->rn_mask
!= netmask
)
771 if ((tt
= tt
->rn_dupedkey
) == 0)
774 if (tt
->rn_mask
== 0 || (saved_m
= m
= tt
->rn_mklist
) == 0)
776 if (tt
->rn_flags
& RNF_NORMAL
) {
777 if (m
->rm_leaf
!= tt
|| m
->rm_refs
> 0) {
778 fprintf(stderr
, "rn_delete: inconsistent annotation\n");
779 return 0; /* dangling ref could cause disaster */
782 if (m
->rm_mask
!= tt
->rn_mask
) {
783 fprintf(stderr
, "rn_delete: inconsistent annotation\n");
786 if (--m
->rm_refs
>= 0)
792 goto on1
; /* Wasn't lifted at all */
796 } while (b
<= t
->rn_b
&& x
!= top
);
797 for (mp
= &x
->rn_mklist
; (m
= *mp
); mp
= &m
->rm_mklist
)
804 fprintf(stderr
, "rn_delete: couldn't find our annotation\n");
805 if (tt
->rn_flags
& RNF_NORMAL
)
806 return (0); /* Dangling ref to us */
810 * Eliminate us from tree
812 if (tt
->rn_flags
& RNF_ROOT
)
815 /* Get us out of the creation list */
816 for (t
= rn_clist
; t
&& t
->rn_ybro
!= tt
; t
= t
->rn_ybro
) {
819 t
->rn_ybro
= tt
->rn_ybro
;
822 if ((dupedkey
= saved_tt
->rn_dupedkey
)) {
823 if (tt
== saved_tt
) {
831 for (x
= p
= saved_tt
; p
&& p
->rn_dupedkey
!= tt
;)
834 p
->rn_dupedkey
= tt
->rn_dupedkey
;
836 fprintf(stderr
, "rn_delete: couldn't find us\n");
839 if (t
->rn_flags
& RNF_ACTIVE
) {
869 * Demote routes attached to us.
873 for (mp
= &x
->rn_mklist
; (m
= *mp
);)
877 /* If there are any key,mask pairs in a sibling
878 * duped-key chain, some subset will appear sorted
879 * in the same order attached to our mklist */
880 for (m
= t
->rn_mklist
; m
&& x
; x
= x
->rn_dupedkey
)
881 if (m
== x
->rn_mklist
) {
882 struct radix_mask
*mm
= m
->rm_mklist
;
884 if (--(m
->rm_refs
) < 0)
890 fprintf(stderr
, "%s %x at %x\n",
891 "rn_delete: Orphaned Mask", (int) m
, (int) x
);
898 * We may be holding an active internal node in the tree.
918 tt
->rn_flags
&= ~RNF_ACTIVE
;
919 tt
[1].rn_flags
&= ~RNF_ACTIVE
;
925 struct radix_node_head
*h
;
930 struct radix_node
*base
, *next
;
931 register struct radix_node
*rn
= h
->rnh_treetop
;
933 * This gets complicated because we may delete the node
934 * while applying the function f to it, so we need to calculate
935 * the successor node in advance.
937 /* First time through node, go left */
938 while (rn
->rn_b
>= 0)
942 /* If at right child go back up, otherwise, go right */
943 while (rn
->rn_p
->rn_r
== rn
&& (rn
->rn_flags
& RNF_ROOT
) == 0)
945 /* Find the next *leaf* since next node might vanish, too */
946 for (rn
= rn
->rn_p
->rn_r
; rn
->rn_b
>= 0;)
950 while ((rn
= base
)) {
951 base
= rn
->rn_dupedkey
;
952 if (!(rn
->rn_flags
& RNF_ROOT
) && (error
= (*f
) (rn
, w
)))
956 if (rn
->rn_flags
& RNF_ROOT
)
963 rn_inithead(head
, off
)
967 register struct radix_node_head
*rnh
;
968 register struct radix_node
*t
, *tt
, *ttt
;
971 R_Malloc(rnh
, struct radix_node_head
*, sizeof(*rnh
));
974 memset(rnh
, '\0', sizeof(*rnh
));
976 t
= rn_newpair(rn_zeros
, off
, rnh
->rnh_nodes
);
977 ttt
= rnh
->rnh_nodes
+ 2;
981 tt
->rn_flags
= t
->rn_flags
= RNF_ROOT
| RNF_ACTIVE
;
984 ttt
->rn_key
= rn_ones
;
985 rnh
->rnh_addaddr
= rn_addroute
;
986 rnh
->rnh_deladdr
= rn_delete
;
987 rnh
->rnh_matchaddr
= rn_match
;
988 rnh
->rnh_lookup
= rn_lookup
;
989 rnh
->rnh_walktree
= rn_walktree
;
990 rnh
->rnh_treetop
= t
;
1001 for (dom
= domains
; dom
; dom
= dom
->dom_next
)
1002 if (dom
->dom_maxrtkey
> max_keylen
)
1003 max_keylen
= dom
->dom_maxrtkey
;
1005 if (max_keylen
== 0) {
1007 "rn_init: radix functions require max_keylen be set\n");
1010 R_Malloc(rn_zeros
, char *, 3 * max_keylen
);
1011 if (rn_zeros
== NULL
) {
1012 fprintf(stderr
, "rn_init failed.\n");
1015 memset(rn_zeros
, '\0', 3 * max_keylen
);
1016 rn_ones
= cp
= rn_zeros
+ max_keylen
;
1017 addmask_key
= cplim
= rn_ones
+ max_keylen
;
1020 if (rn_inithead((void **) &mask_rnhead
, 0) == 0) {
1021 fprintf(stderr
, "rn_init2 failed.\n");