2 * DEBUG: section 53 Radix Tree data structure implementation
3 * AUTHOR: NetBSD Derived
5 * SQUID Web Proxy Cache http://www.squid-cache.org/
6 * ----------------------------------------------------------
8 * Squid is the result of efforts by numerous individuals from
9 * the Internet community; see the CONTRIBUTORS file for full
10 * details. Many organizations have provided support for Squid's
11 * development; see the SPONSORS file for full details. Squid is
12 * Copyrighted (C) 2001 by the Regents of the University of
13 * California; see the COPYRIGHT file for full details. Squid
14 * incorporates software developed and/or copyrighted by other
15 * sources; see the CREDITS file for full details.
17 * This program is free software; you can redistribute it and/or modify
18 * it under the terms of the GNU General Public License as published by
19 * the Free Software Foundation; either version 2 of the License, or
20 * (at your option) any later version.
22 * This program is distributed in the hope that it will be useful,
23 * but WITHOUT ANY WARRANTY; without even the implied warranty of
24 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
25 * GNU General Public License for more details.
27 * You should have received a copy of the GNU General Public License
28 * along with this program; if not, write to the Free Software
29 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
34 * Copyright (c) 1988, 1989, 1993
35 * The Regents of the University of California. All rights reserved.
37 * Redistribution and use in source and binary forms, with or without
38 * modification, are permitted provided that the following conditions
40 * 1. Redistributions of source code must retain the above copyright
41 * notice, this list of conditions and the following disclaimer.
42 * 2. Redistributions in binary form must reproduce the above copyright
43 * notice, this list of conditions and the following disclaimer in the
44 * documentation and/or other materials provided with the distribution.
45 * 3. Neither the name of the University nor the names of its contributors
46 * may be used to endorse or promote products derived from this software
47 * without specific prior written permission.
49 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
50 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
51 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
52 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
53 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
54 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
55 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
56 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
57 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
58 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
61 * @(#)radix.c 8.4 (Berkeley) 11/2/94
75 #include <sys/types.h>
90 #include <gnumalloc.h>
98 #include <sys/param.h>
104 int squid_max_keylen
;
105 struct squid_radix_mask
*squid_rn_mkfreelist
;
106 struct squid_radix_node_head
*squid_mask_rnhead
;
107 static char *addmask_key
;
108 static unsigned char normal_chars
[] = {0, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, 0xFF};
109 static char *rn_zeros
, *rn_ones
;
112 #define rn_masktop (squid_mask_rnhead->rnh_treetop)
113 #define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey
114 #define rn_off rn_u.rn_node.rn_Off
115 #define rn_l rn_u.rn_node.rn_L
116 #define rn_r rn_u.rn_node.rn_R
117 #define rm_mask rm_rmu.rmu_mask
118 #define rm_leaf rm_rmu.rmu_leaf /* extra field would make 32 bytes */
121 #define squid_Bcmp(a, b, l) (l == 0 ? 0 : memcmp((caddr_t)(a), (caddr_t)(b), (u_long)l))
122 #define squid_R_Malloc(p, t, n) (p = (t) xmalloc((unsigned int)(n)))
123 #define squid_Free(p) xfree((char *)p)
124 #define squid_MKGet(m) {\
125 if (squid_rn_mkfreelist) {\
126 m = squid_rn_mkfreelist; \
127 squid_rn_mkfreelist = (m)->rm_mklist; \
129 squid_R_Malloc(m, struct squid_radix_mask *, sizeof (*(m)));\
132 #define squid_MKFree(m) { (m)->rm_mklist = squid_rn_mkfreelist; squid_rn_mkfreelist = (m);}
135 #define min(x,y) ((x)<(y)? (x) : (y))
138 * The data structure for the keys is a radix tree with one way
139 * branching removed. The index rn_b at an internal node n represents a bit
140 * position to be tested. The tree is arranged so that all descendants
141 * of a node n have keys whose bits all agree up to position rn_b - 1.
142 * (We say the index of n is rn_b.)
144 * There is at least one descendant which has a one bit at position rn_b,
145 * and at least one with a zero there.
147 * A route is determined by a pair of key and mask. We require that the
148 * bit-wise logical and of the key and mask to be the key.
149 * We define the index of a route to associated with the mask to be
150 * the first bit number in the mask where 0 occurs (with bit number 0
151 * representing the highest order bit).
153 * We say a mask is normal if every bit is 0, past the index of the mask.
154 * If a node n has a descendant (k, m) with index(m) == index(n) == rn_b,
155 * and m is a normal mask, then the route applies to every descendant of n.
156 * If the index(m) < rn_b, this implies the trailing last few bits of k
157 * before bit b are all 0, (and hence consequently true of every descendant
158 * of n), so the route applies to all descendants of the node as well.
160 * Similar logic shows that a non-normal mask m such that
161 * index(m) <= index(n) could potentially apply to many children of n.
162 * Thus, for each non-host route, we attach its mask to a list at an internal
163 * node as high in the tree as we can go.
165 * The present version of the code makes use of normal routes in short-
166 * circuiting an explict mask and compare operation when testing whether
167 * a key satisfies a normal route, and also in remembering the unique leaf
168 * that governs a subtree.
171 struct squid_radix_node
*
172 squid_rn_search(void *v_arg
, struct squid_radix_node
*head
) {
173 register struct squid_radix_node
*x
;
176 for (x
= head
, v
= v_arg
; x
->rn_b
>= 0;) {
177 if (x
->rn_bmask
& v
[x
->rn_off
])
185 struct squid_radix_node
*
186 squid_rn_search_m(void *v_arg
, struct squid_radix_node
*head
, void *m_arg
) {
187 register struct squid_radix_node
*x
;
188 register caddr_t v
= v_arg
, m
= m_arg
;
190 for (x
= head
; x
->rn_b
>= 0;) {
191 if ((x
->rn_bmask
& m
[x
->rn_off
]) &&
192 (x
->rn_bmask
& v
[x
->rn_off
]))
201 squid_rn_refines(void *m_arg
, void *n_arg
)
203 register caddr_t m
= m_arg
, n
= n_arg
;
204 register caddr_t lim
, lim2
= lim
= n
+ *(u_char
*) n
;
205 int longer
= (*(u_char
*) n
++) - (int) (*(u_char
*) m
++);
206 int masks_are_equal
= 1;
219 if (masks_are_equal
&& (longer
< 0))
220 for (lim2
= m
- longer
; m
< lim2
;)
223 return (!masks_are_equal
);
226 struct squid_radix_node
*
227 squid_rn_lookup(void *v_arg
, void *m_arg
, struct squid_radix_node_head
*head
) {
228 register struct squid_radix_node
*x
;
232 if ((x
= squid_rn_addmask(m_arg
, 1, head
->rnh_treetop
->rn_off
)) == 0)
236 x
= squid_rn_match(v_arg
, head
);
238 while (x
&& x
->rn_mask
!= netmask
)
245 rn_satsifies_leaf(char *trial
, register struct squid_radix_node
*leaf
, int skip
)
247 register char *cp
= trial
, *cp2
= leaf
->rn_key
, *cp3
= leaf
->rn_mask
;
249 int length
= min(*(u_char
*) cp
, *(u_char
*) cp2
);
254 length
= min(length
, *(u_char
*) cp3
);
258 for (cp
+= skip
; cp
< cplim
; cp
++, cp2
++, cp3
++)
259 if ((*cp
^ *cp2
) & *cp3
)
264 struct squid_radix_node
*
265 squid_rn_match(void *v_arg
, struct squid_radix_node_head
*head
) {
267 register struct squid_radix_node
*t
= head
->rnh_treetop
, *x
;
268 register caddr_t cp
= v
, cp2
;
270 struct squid_radix_node
*saved_t
, *top
= t
;
271 int off
= t
->rn_off
, vlen
= *(u_char
*) cp
, matched_off
;
272 register int test
, b
, rn_b
;
275 * Open code squid_rn_search(v, top) to avoid overhead of extra
278 for (; t
->rn_b
>= 0;) {
279 if (t
->rn_bmask
& cp
[t
->rn_off
])
285 * See if we match exactly as a host destination
286 * or at least learn how many bits match, for normal mask finesse.
288 * It doesn't hurt us to limit how many bytes to check
289 * to the length of the mask, since if it matches we had a genuine
290 * match and the leaf we have is the most specific one anyway;
291 * if it didn't match with a shorter length it would fail
292 * with a long one. This wins big for class B&C netmasks which
293 * are probably the most common case...
296 vlen
= *(u_char
*) t
->rn_mask
;
298 cp2
= t
->rn_key
+ off
;
300 for (; cp
< cplim
; cp
++, cp2
++)
304 * This extra grot is in case we are explicitly asked
305 * to look up the default. Ugh!
307 if ((t
->rn_flags
& RNF_ROOT
) && t
->rn_dupedkey
)
311 test
= (*cp
^ *cp2
) & 0xff; /* find first bit that differs */
312 for (b
= 7; (test
>>= 1) > 0;)
314 matched_off
= cp
- v
;
315 b
+= matched_off
<< 3;
318 * If there is a host route in a duped-key chain, it will be first.
320 if ((saved_t
= t
)->rn_mask
== 0)
322 for (; t
; t
= t
->rn_dupedkey
)
324 * Even if we don't match exactly as a host,
325 * we may match if the leaf we wound up at is
328 if (t
->rn_flags
& RNF_NORMAL
) {
331 } else if (rn_satsifies_leaf(v
, t
, matched_off
))
334 /* start searching up the tree */
336 register struct squid_radix_mask
*m
;
338 if ((m
= t
->rn_mklist
)) {
340 * If non-contiguous masks ever become important
341 * we can restore the masking and open coding of
342 * the search and satisfaction test and put the
343 * calculation of "off" back before the "do".
346 if (m
->rm_flags
& RNF_NORMAL
) {
350 off
= min(t
->rn_off
, matched_off
);
351 x
= squid_rn_search_m(v
, t
, m
->rm_mask
);
352 while (x
&& x
->rn_mask
!= m
->rm_mask
)
354 if (x
&& rn_satsifies_leaf(v
, x
, off
))
357 } while ((m
= m
->rm_mklist
));
365 struct squid_radix_node
*rn_clist
;
370 struct squid_radix_node
*
371 squid_rn_newpair(void *v
, int b
, struct squid_radix_node nodes
[2]) {
372 register struct squid_radix_node
*tt
= nodes
, *t
= tt
+ 1;
374 t
->rn_bmask
= 0x80 >> (b
& 7);
378 tt
->rn_key
= (caddr_t
) v
;
380 tt
->rn_flags
= t
->rn_flags
= RNF_ACTIVE
;
382 tt
->rn_info
= rn_nodenum
++;
383 t
->rn_info
= rn_nodenum
++;
385 tt
->rn_ybro
= rn_clist
;
391 struct squid_radix_node
*
392 squid_rn_insert(void *v_arg
, struct squid_radix_node_head
*head
, int *dupentry
, struct squid_radix_node nodes
[2]) {
394 struct squid_radix_node
*top
= head
->rnh_treetop
;
395 int head_off
= top
->rn_off
, vlen
= (int) *((u_char
*) v
);
396 register struct squid_radix_node
*t
= squid_rn_search(v_arg
, top
);
397 register caddr_t cp
= v
+ head_off
;
399 struct squid_radix_node
*tt
;
401 * Find first bit at which v and t->rn_key differ
404 register caddr_t cp2
= t
->rn_key
+ head_off
;
405 register int cmp_res
;
406 caddr_t cplim
= v
+ vlen
;
415 cmp_res
= (cp
[-1] ^ cp2
[-1]) & 0xff;
416 for (b
= (cp
- v
) << 3; cmp_res
; b
--)
420 register struct squid_radix_node
*p
, *x
= top
;
424 if (cp
[x
->rn_off
] & x
->rn_bmask
)
428 } while (b
> (unsigned) x
->rn_b
); /* x->rn_b < b && x->rn_b >= 0 */
431 fprintf(stderr
, "squid_rn_insert: Going In:\n");
434 t
= squid_rn_newpair(v_arg
, b
, nodes
);
436 if ((cp
[p
->rn_off
] & p
->rn_bmask
) == 0)
441 t
->rn_p
= p
; /* frees x, p as temp vars below */
442 if ((cp
[t
->rn_off
] & t
->rn_bmask
) == 0) {
450 log(LOG_DEBUG
, "squid_rn_insert: Coming Out:\n"), traverse(p
);
456 struct squid_radix_node
*
457 squid_rn_addmask(void *n_arg
, int search
, int skip
) {
458 caddr_t netmask
= (caddr_t
) n_arg
;
459 register struct squid_radix_node
*x
;
460 register caddr_t cp
, cplim
;
461 register int b
= 0, mlen
, j
;
462 int maskduplicated
, m0
, isnormal
;
463 struct squid_radix_node
*saved_x
;
464 static int last_zeroed
= 0;
466 if ((mlen
= *(u_char
*) netmask
) > squid_max_keylen
)
467 mlen
= squid_max_keylen
;
471 return (squid_mask_rnhead
->rnh_nodes
);
473 memcpy(addmask_key
+ 1, rn_ones
+ 1, skip
- 1);
474 if ((m0
= mlen
) > skip
)
475 memcpy(addmask_key
+ skip
, netmask
+ skip
, mlen
- skip
);
477 * Trim trailing zeroes.
479 for (cp
= addmask_key
+ mlen
; (cp
> addmask_key
) && cp
[-1] == 0;)
481 mlen
= cp
- addmask_key
;
483 if (m0
>= last_zeroed
)
485 return (squid_mask_rnhead
->rnh_nodes
);
487 if (m0
< last_zeroed
)
488 memset(addmask_key
+ m0
, '\0', last_zeroed
- m0
);
489 *addmask_key
= last_zeroed
= mlen
;
490 x
= squid_rn_search(addmask_key
, rn_masktop
);
491 if (memcmp(addmask_key
, x
->rn_key
, mlen
) != 0)
495 squid_R_Malloc(x
, struct squid_radix_node
*, squid_max_keylen
+ 2 * sizeof(*x
));
496 if ((saved_x
= x
) == 0)
498 memset(x
, '\0', squid_max_keylen
+ 2 * sizeof(*x
));
499 netmask
= cp
= (caddr_t
) (x
+ 2);
500 memcpy(cp
, addmask_key
, mlen
);
501 x
= squid_rn_insert(cp
, squid_mask_rnhead
, &maskduplicated
, x
);
502 if (maskduplicated
) {
503 fprintf(stderr
, "squid_rn_addmask: mask impossibly already in tree");
508 * Calculate index of mask, and check for normalcy.
510 cplim
= netmask
+ mlen
;
512 for (cp
= netmask
+ skip
; (cp
< cplim
) && *(u_char
*) cp
== 0xff;)
515 for (j
= 0x80; (j
& *cp
) != 0; j
>>= 1)
517 if (*cp
!= normal_chars
[b
] || cp
!= (cplim
- 1))
520 b
+= (cp
- netmask
) << 3;
523 x
->rn_flags
|= RNF_NORMAL
;
527 static int /* XXX: arbitrary ordering for non-contiguous masks */
528 rn_lexobetter(void *m_arg
, void *n_arg
)
530 register u_char
*mp
= m_arg
, *np
= n_arg
, *lim
;
533 return 1; /* not really, but need to check longer one first */
535 for (lim
= mp
+ *mp
; mp
< lim
;)
541 static struct squid_radix_mask
*
542 rn_new_radix_mask(struct squid_radix_node
*tt
, struct squid_radix_mask
*next
) {
543 register struct squid_radix_mask
*m
;
547 fprintf(stderr
, "Mask for route not entered\n");
550 memset(m
, '\0', sizeof *m
);
552 m
->rm_flags
= tt
->rn_flags
;
553 if (tt
->rn_flags
& RNF_NORMAL
)
556 m
->rm_mask
= tt
->rn_mask
;
562 struct squid_radix_node
*
563 squid_rn_addroute(void *v_arg
, void *n_arg
, struct squid_radix_node_head
*head
, struct squid_radix_node treenodes
[2]) {
564 caddr_t v
= (caddr_t
) v_arg
, netmask
= (caddr_t
) n_arg
;
565 register struct squid_radix_node
*t
, *x
= NULL
, *tt
;
566 struct squid_radix_node
*saved_tt
, *top
= head
->rnh_treetop
;
567 short b
= 0, b_leaf
= 0;
570 struct squid_radix_mask
*m
, **mp
;
573 * In dealing with non-contiguous masks, there may be
574 * many different routes which have the same mask.
575 * We will find it useful to have a unique pointer to
576 * the mask to speed avoiding duplicate references at
577 * nodes and possibly save time in calculating indices.
580 if ((x
= squid_rn_addmask(netmask
, 0, top
->rn_off
)) == 0)
587 * Deal with duplicated keys: attach node to previous instance
589 saved_tt
= tt
= squid_rn_insert(v
, head
, &keyduplicated
, treenodes
);
591 for (t
= tt
; tt
; t
= tt
, tt
= tt
->rn_dupedkey
) {
592 if (tt
->rn_mask
== netmask
)
596 ((b_leaf
< tt
->rn_b
) || /* index(netmask) > node */
597 squid_rn_refines(netmask
, tt
->rn_mask
) ||
598 rn_lexobetter(netmask
, tt
->rn_mask
))))
602 * If the mask is not duplicated, we wouldn't
603 * find it among possible duplicate key entries
604 * anyway, so the above test doesn't hurt.
606 * We sort the masks for a duplicated key the same way as
607 * in a masklist -- most specific to least specific.
608 * This may require the unfortunate nuisance of relocating
609 * the head of the list.
611 if (tt
== saved_tt
) {
612 struct squid_radix_node
*xx
= x
;
613 /* link in at head of list */
616 tt
->rn_flags
= t
->rn_flags
;
617 tt
->rn_p
= x
= t
->rn_p
;
626 tt
->rn_dupedkey
= t
->rn_dupedkey
;
631 tt
->rn_info
= rn_nodenum
++;
632 t
->rn_info
= rn_nodenum
++;
634 tt
->rn_ybro
= rn_clist
;
637 tt
->rn_key
= (caddr_t
) v
;
639 tt
->rn_flags
= RNF_ACTIVE
;
645 tt
->rn_mask
= netmask
;
647 tt
->rn_flags
|= x
->rn_flags
& RNF_NORMAL
;
652 b_leaf
= -1 - t
->rn_b
;
653 if (t
->rn_r
== saved_tt
)
657 /* Promote general routes from below */
659 for (mp
= &t
->rn_mklist
; x
; x
= x
->rn_dupedkey
)
660 if (x
->rn_mask
&& (x
->rn_b
>= b_leaf
) && x
->rn_mklist
== 0) {
661 if ((*mp
= m
= rn_new_radix_mask(x
, 0)))
664 } else if (x
->rn_mklist
) {
666 * Skip over masks whose index is > that of new node
668 for (mp
= &x
->rn_mklist
; (m
= *mp
); mp
= &m
->rm_mklist
)
669 if (m
->rm_b
>= b_leaf
)
675 /* Add new route to highest possible ancestor's list */
676 if ((netmask
== 0) || (b
> t
->rn_b
))
677 return tt
; /* can't lift at all */
682 } while (b
<= t
->rn_b
&& x
!= top
);
684 * Search through routes associated with node to
685 * insert new route according to index.
686 * Need same criteria as when sorting dupedkeys to avoid
687 * double loop on deletion.
689 for (mp
= &x
->rn_mklist
; (m
= *mp
); mp
= &m
->rm_mklist
) {
690 if (m
->rm_b
< b_leaf
)
692 if (m
->rm_b
> b_leaf
)
694 if (m
->rm_flags
& RNF_NORMAL
) {
695 mmask
= m
->rm_leaf
->rn_mask
;
696 if (tt
->rn_flags
& RNF_NORMAL
) {
698 "Non-unique normal route, mask not entered");
703 if (mmask
== netmask
) {
708 if (squid_rn_refines(netmask
, mmask
) || rn_lexobetter(netmask
, mmask
))
711 *mp
= rn_new_radix_mask(tt
, *mp
);
715 struct squid_radix_node
*
716 squid_rn_delete(void *v_arg
, void *netmask_arg
, struct squid_radix_node_head
*head
) {
717 register struct squid_radix_node
*t
, *p
, *x
, *tt
;
718 struct squid_radix_mask
*m
, *saved_m
, **mp
;
719 struct squid_radix_node
*dupedkey
, *saved_tt
, *top
;
721 int b
, head_off
, vlen
;
724 netmask
= netmask_arg
;
725 x
= head
->rnh_treetop
;
726 tt
= squid_rn_search(v
, x
);
727 head_off
= x
->rn_off
;
728 vlen
= *(u_char
*) v
;
732 memcmp(v
+ head_off
, tt
->rn_key
+ head_off
, vlen
- head_off
))
735 * Delete our route from mask lists.
738 if ((x
= squid_rn_addmask(netmask
, 1, head_off
)) == 0)
741 while (tt
->rn_mask
!= netmask
)
742 if ((tt
= tt
->rn_dupedkey
) == 0)
745 if (tt
->rn_mask
== 0 || (saved_m
= m
= tt
->rn_mklist
) == 0)
747 if (tt
->rn_flags
& RNF_NORMAL
) {
748 if (m
->rm_leaf
!= tt
|| m
->rm_refs
> 0) {
749 fprintf(stderr
, "squid_rn_delete: inconsistent annotation\n");
750 return 0; /* dangling ref could cause disaster */
753 if (m
->rm_mask
!= tt
->rn_mask
) {
754 fprintf(stderr
, "squid_rn_delete: inconsistent annotation\n");
757 if (--m
->rm_refs
>= 0)
763 goto on1
; /* Wasn't lifted at all */
767 } while (b
<= t
->rn_b
&& x
!= top
);
768 for (mp
= &x
->rn_mklist
; (m
= *mp
); mp
= &m
->rm_mklist
)
775 fprintf(stderr
, "squid_rn_delete: couldn't find our annotation\n");
776 if (tt
->rn_flags
& RNF_NORMAL
)
777 return (0); /* Dangling ref to us */
781 * Eliminate us from tree
783 if (tt
->rn_flags
& RNF_ROOT
)
786 /* Get us out of the creation list */
787 for (t
= rn_clist
; t
&& t
->rn_ybro
!= tt
; t
= t
->rn_ybro
) {
790 t
->rn_ybro
= tt
->rn_ybro
;
793 if ((dupedkey
= saved_tt
->rn_dupedkey
)) {
794 if (tt
== saved_tt
) {
802 for (x
= p
= saved_tt
; p
&& p
->rn_dupedkey
!= tt
;)
805 p
->rn_dupedkey
= tt
->rn_dupedkey
;
807 fprintf(stderr
, "squid_rn_delete: couldn't find us\n");
810 if (t
->rn_flags
& RNF_ACTIVE
) {
840 * Demote routes attached to us.
844 for (mp
= &x
->rn_mklist
; (m
= *mp
);)
848 /* If there are any key,mask pairs in a sibling
849 * duped-key chain, some subset will appear sorted
850 * in the same order attached to our mklist */
851 for (m
= t
->rn_mklist
; m
&& x
; x
= x
->rn_dupedkey
)
852 if (m
== x
->rn_mklist
) {
853 struct squid_radix_mask
*mm
= m
->rm_mklist
;
855 if (--(m
->rm_refs
) < 0)
861 fprintf(stderr
, "%s %x at %x\n",
862 "squid_rn_delete: Orphaned Mask", (int) m
, (int) x
);
869 * We may be holding an active internal node in the tree.
889 tt
->rn_flags
&= ~RNF_ACTIVE
;
890 tt
[1].rn_flags
&= ~RNF_ACTIVE
;
895 squid_rn_walktree(struct squid_radix_node_head
*h
, int (*f
) (struct squid_radix_node
*, void *), void *w
)
898 struct squid_radix_node
*base
, *next
;
899 register struct squid_radix_node
*rn
= h
->rnh_treetop
;
901 * This gets complicated because we may delete the node
902 * while applying the function f to it, so we need to calculate
903 * the successor node in advance.
905 /* First time through node, go left */
906 while (rn
->rn_b
>= 0)
910 /* If at right child go back up, otherwise, go right */
911 while (rn
->rn_p
->rn_r
== rn
&& (rn
->rn_flags
& RNF_ROOT
) == 0)
913 /* Find the next *leaf* since next node might vanish, too */
914 for (rn
= rn
->rn_p
->rn_r
; rn
->rn_b
>= 0;)
918 while ((rn
= base
)) {
919 base
= rn
->rn_dupedkey
;
920 if (!(rn
->rn_flags
& RNF_ROOT
) && (error
= (*f
) (rn
, w
)))
924 if (rn
->rn_flags
& RNF_ROOT
)
931 squid_rn_inithead(struct squid_radix_node_head
**head
, int off
)
933 register struct squid_radix_node_head
*rnh
;
934 register struct squid_radix_node
*t
, *tt
, *ttt
;
937 squid_R_Malloc(rnh
, struct squid_radix_node_head
*, sizeof(*rnh
));
940 memset(rnh
, '\0', sizeof(*rnh
));
942 t
= squid_rn_newpair(rn_zeros
, off
, rnh
->rnh_nodes
);
943 ttt
= rnh
->rnh_nodes
+ 2;
947 tt
->rn_flags
= t
->rn_flags
= RNF_ROOT
| RNF_ACTIVE
;
950 ttt
->rn_key
= rn_ones
;
951 rnh
->rnh_addaddr
= squid_rn_addroute
;
952 rnh
->rnh_deladdr
= squid_rn_delete
;
953 rnh
->rnh_matchaddr
= squid_rn_match
;
954 rnh
->rnh_lookup
= squid_rn_lookup
;
955 rnh
->rnh_walktree
= squid_rn_walktree
;
956 rnh
->rnh_treetop
= t
;
967 for (dom
= domains
; dom
; dom
= dom
->dom_next
)
968 if (dom
->dom_maxrtkey
> squid_max_keylen
)
969 squid_max_keylen
= dom
->dom_maxrtkey
;
971 if (squid_max_keylen
== 0) {
973 "squid_rn_init: radix functions require squid_max_keylen be set\n");
976 squid_R_Malloc(rn_zeros
, char *, 3 * squid_max_keylen
);
977 if (rn_zeros
== NULL
) {
978 fprintf(stderr
, "squid_rn_init failed.\n");
981 memset(rn_zeros
, '\0', 3 * squid_max_keylen
);
982 rn_ones
= cp
= rn_zeros
+ squid_max_keylen
;
983 addmask_key
= cplim
= rn_ones
+ squid_max_keylen
;
986 if (squid_rn_inithead(&squid_mask_rnhead
, 0) == 0) {
987 fprintf(stderr
, "rn_init2 failed.\n");