]>
git.ipfire.org Git - thirdparty/squid.git/blob - include/radix.h
2 * $Id: radix.h,v 1.11 2001/10/17 17:55:23 hno Exp $
9 * Copyright (c) 1988, 1989, 1993
10 * The Regents of the University of California. All rights reserved.
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. All advertising materials mentioning features or use of this software
21 * must display the following acknowledgement:
22 * This product includes software developed by the University of
23 * California, Berkeley and its contributors.
24 * 4. Neither the name of the University nor the names of its contributors
25 * may be used to endorse or promote products derived from this software
26 * without specific prior written permission.
28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40 * @(#)radix.h 8.2 (Berkeley) 10/31/94
45 * Radix search tree node layout.
49 struct radix_mask
*rn_mklist
; /* list of masks contained in subtree */
50 struct radix_node
*rn_p
; /* parent */
51 short rn_b
; /* bit offset; -1-index(netmask) */
52 char rn_bmask
; /* node: mask for bit test */
53 unsigned char rn_flags
; /* enumerated next */
54 #define RNF_NORMAL 1 /* leaf contains normal route */
55 #define RNF_ROOT 2 /* leaf is root leaf for tree */
56 #define RNF_ACTIVE 4 /* This node is alive (for rtfree) */
58 struct { /* leaf only data: */
59 char *rn_Key
; /* object of search */
60 char *rn_Mask
; /* netmask, if present */
61 struct radix_node
*rn_Dupedkey
;
63 struct { /* node only data: */
64 int rn_Off
; /* where to start compare */
65 struct radix_node
*rn_L
; /* progeny */
66 struct radix_node
*rn_R
; /* progeny */
71 struct radix_node
*rn_twin
;
72 struct radix_node
*rn_ybro
;
76 #define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey
77 #define rn_key rn_u.rn_leaf.rn_Key
78 #define rn_mask rn_u.rn_leaf.rn_Mask
79 #define rn_off rn_u.rn_node.rn_Off
80 #define rn_l rn_u.rn_node.rn_L
81 #define rn_r rn_u.rn_node.rn_R
84 * Annotations to tree concerning potential routes applying to subtrees.
87 extern struct radix_mask
{
88 short rm_b
; /* bit offset; -1-index(netmask) */
89 char rm_unused
; /* cf. rn_bmask */
90 unsigned char rm_flags
; /* cf. rn_flags */
91 struct radix_mask
*rm_mklist
; /* more masks to try */
93 char *rmu_mask
; /* the mask */
94 struct radix_node
*rmu_leaf
; /* for normal routes */
96 int rm_refs
; /* # of references to this struct */
99 #define rm_mask rm_rmu.rmu_mask
100 #define rm_leaf rm_rmu.rmu_leaf /* extra field would make 32 bytes */
103 if (rn_mkfreelist) {\
105 rn_mkfreelist = (m)->rm_mklist; \
107 R_Malloc(m, struct radix_mask *, sizeof (*(m))); }\
109 #define MKFree(m) { (m)->rm_mklist = rn_mkfreelist; rn_mkfreelist = (m);}
111 struct radix_node_head
{
112 struct radix_node
*rnh_treetop
;
113 int rnh_addrsize
; /* permit, but not require fixed keys */
114 int rnh_pktsize
; /* permit, but not require fixed keys */
115 struct radix_node
*(*rnh_addaddr
) /* add based on sockaddr */
116 (void *v
, void *mask
,
117 struct radix_node_head
* head
, struct radix_node nodes
[]);
118 struct radix_node
*(*rnh_addpkt
) /* add based on packet hdr */
119 (void *v
, void *mask
,
120 struct radix_node_head
* head
, struct radix_node nodes
[]);
121 struct radix_node
*(*rnh_deladdr
) /* remove based on sockaddr */
122 (void *v
, void *mask
, struct radix_node_head
* head
);
123 struct radix_node
*(*rnh_delpkt
) /* remove based on packet hdr */
124 (void *v
, void *mask
, struct radix_node_head
* head
);
125 struct radix_node
*(*rnh_matchaddr
) /* locate based on sockaddr */
126 (void *v
, struct radix_node_head
* head
);
127 struct radix_node
*(*rnh_lookup
) /* locate based on sockaddr */
128 (void *v
, void *mask
, struct radix_node_head
* head
);
129 struct radix_node
*(*rnh_matchpkt
) /* locate based on packet hdr */
130 (void *v
, struct radix_node_head
* head
);
131 int (*rnh_walktree
) /* traverse tree */
132 (struct radix_node_head
* head
, int (*f
) (struct radix_node
*, void *), void *w
);
133 struct radix_node rnh_nodes
[3]; /* empty tree for common case */
137 #define Bcmp(a, b, n) memcmp(((char *)(a)), ((char *)(b)), (n))
138 #define Bcopy(a, b, n) memcpy(((char *)(b)), ((char *)(a)), (unsigned)(n))
139 #define Bzero(p, n) memset((char *)(p),'\0', (int)(n))
140 #define R_Malloc(p, t, n) (p = (t) xmalloc((unsigned int)(n)))
141 #define Free(p) xfree((char *)p)
143 extern void rn_init (void);
144 extern int rn_inithead(void **, int);
145 extern int rn_refines(void *, void *);
146 extern int rn_walktree(struct radix_node_head
*, int (*)(struct radix_node
*, void *), void *);
147 extern struct radix_node
*rn_addmask(void *, int, int);
148 extern struct radix_node
*rn_addroute(void *, void *, struct radix_node_head
*, struct radix_node
[2]);
149 extern struct radix_node
*rn_delete(void *, void *, struct radix_node_head
*);
150 extern struct radix_node
*rn_insert(void *, struct radix_node_head
*, int *, struct radix_node
[2]);
151 extern struct radix_node
*rn_match(void *, struct radix_node_head
*);
152 extern struct radix_node
*rn_newpair(void *, int, struct radix_node
[2]);
153 extern struct radix_node
*rn_search(void *, struct radix_node
*);
154 extern struct radix_node
*rn_search_m(void *, struct radix_node
*, void *);
155 extern struct radix_node
*rn_lookup(void *, void *, struct radix_node_head
*);
156 #define min(x,y) ((x)<(y)? (x) : (y))
158 #endif /* SQUID_RADIX_H */