radix.h revision 1.9.20.1
1 /* $NetBSD: radix.h,v 1.9.20.1 1999/06/28 06:36:57 itojun Exp $ */ 2 3 /* 4 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project. 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 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. 15 * 3. Neither the name of the project nor the names of its contributors 16 * may be used to endorse or promote products derived from this software 17 * without specific prior written permission. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND 20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE 23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 * SUCH DAMAGE. 30 */ 31 32 /* 33 * Copyright (c) 1988, 1989, 1993 34 * The Regents of the University of California. All rights reserved. 35 * 36 * Redistribution and use in source and binary forms, with or without 37 * modification, are permitted provided that the following conditions 38 * are met: 39 * 1. Redistributions of source code must retain the above copyright 40 * notice, this list of conditions and the following disclaimer. 41 * 2. Redistributions in binary form must reproduce the above copyright 42 * notice, this list of conditions and the following disclaimer in the 43 * documentation and/or other materials provided with the distribution. 44 * 3. All advertising materials mentioning features or use of this software 45 * must display the following acknowledgement: 46 * This product includes software developed by the University of 47 * California, Berkeley and its contributors. 48 * 4. Neither the name of the University nor the names of its contributors 49 * may be used to endorse or promote products derived from this software 50 * without specific prior written permission. 51 * 52 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 53 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 54 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 55 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 56 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 57 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 58 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 59 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 60 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 61 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 62 * SUCH DAMAGE. 63 * 64 * @(#)radix.h 8.2 (Berkeley) 10/31/94 65 */ 66 67 #ifndef _NET_RADIX_H_ 68 #define _NET_RADIX_H_ 69 70 /* 71 * Radix search tree node layout. 72 */ 73 74 struct radix_node { 75 struct radix_mask *rn_mklist; /* list of masks contained in subtree */ 76 struct radix_node *rn_p; /* parent */ 77 short rn_b; /* bit offset; -1-index(netmask) */ 78 char rn_bmask; /* node: mask for bit test*/ 79 u_char rn_flags; /* enumerated next */ 80 #define RNF_NORMAL 1 /* leaf contains normal route */ 81 #define RNF_ROOT 2 /* leaf is root leaf for tree */ 82 #define RNF_ACTIVE 4 /* This node is alive (for rtfree) */ 83 union { 84 struct { /* leaf only data: */ 85 caddr_t rn_Key; /* object of search */ 86 caddr_t rn_Mask; /* netmask, if present */ 87 struct radix_node *rn_Dupedkey; 88 } rn_leaf; 89 struct { /* node only data: */ 90 int rn_Off; /* where to start compare */ 91 struct radix_node *rn_L;/* progeny */ 92 struct radix_node *rn_R;/* progeny */ 93 } rn_node; 94 } rn_u; 95 #ifdef RN_DEBUG 96 int rn_info; 97 struct radix_node *rn_twin; 98 struct radix_node *rn_ybro; 99 #endif 100 }; 101 102 #define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey 103 #define rn_key rn_u.rn_leaf.rn_Key 104 #define rn_mask rn_u.rn_leaf.rn_Mask 105 #define rn_off rn_u.rn_node.rn_Off 106 #define rn_l rn_u.rn_node.rn_L 107 #define rn_r rn_u.rn_node.rn_R 108 109 /* 110 * Annotations to tree concerning potential routes applying to subtrees. 111 */ 112 113 extern struct radix_mask { 114 short rm_b; /* bit offset; -1-index(netmask) */ 115 char rm_unused; /* cf. rn_bmask */ 116 u_char rm_flags; /* cf. rn_flags */ 117 struct radix_mask *rm_mklist; /* more masks to try */ 118 union { 119 caddr_t rmu_mask; /* the mask */ 120 struct radix_node *rmu_leaf; /* for normal routes */ 121 } rm_rmu; 122 int rm_refs; /* # of references to this struct */ 123 } *rn_mkfreelist; 124 125 #define rm_mask rm_rmu.rmu_mask 126 #define rm_leaf rm_rmu.rmu_leaf /* extra field would make 32 bytes */ 127 128 #define MKGet(m) {\ 129 if (rn_mkfreelist) {\ 130 m = rn_mkfreelist; \ 131 rn_mkfreelist = (m)->rm_mklist; \ 132 } else \ 133 R_Malloc(m, struct radix_mask *, sizeof (*(m))); }\ 134 135 #define MKFree(m) { (m)->rm_mklist = rn_mkfreelist; rn_mkfreelist = (m);} 136 137 struct radix_node_head { 138 struct radix_node *rnh_treetop; 139 int rnh_addrsize; /* permit, but not require fixed keys */ 140 int rnh_pktsize; /* permit, but not require fixed keys */ 141 struct radix_node *(*rnh_addaddr) /* add based on sockaddr */ 142 __P((void *v, void *mask, 143 struct radix_node_head *head, struct radix_node nodes[])); 144 struct radix_node *(*rnh_addpkt) /* add based on packet hdr */ 145 __P((void *v, void *mask, 146 struct radix_node_head *head, struct radix_node nodes[])); 147 struct radix_node *(*rnh_deladdr) /* remove based on sockaddr */ 148 __P((void *v, void *mask, struct radix_node_head *head)); 149 struct radix_node *(*rnh_delpkt) /* remove based on packet hdr */ 150 __P((void *v, void *mask, struct radix_node_head *head)); 151 struct radix_node *(*rnh_matchaddr) /* locate based on sockaddr */ 152 __P((void *v, struct radix_node_head *head)); 153 struct radix_node *(*rnh_lookup) /* locate based on sockaddr */ 154 __P((void *v, void *mask, struct radix_node_head *head)); 155 struct radix_node *(*rnh_matchpkt) /* locate based on packet hdr */ 156 __P((void *v, struct radix_node_head *head)); 157 int (*rnh_walktree) /* traverse tree */ 158 __P((struct radix_node_head *, 159 int (*)(struct radix_node *, void *), void *)); 160 struct radix_node rnh_nodes[3]; /* empty tree for common case */ 161 }; 162 163 164 #ifndef _KERNEL 165 #define Bcmp(a, b, n) bcmp(((char *)(a)), ((char *)(b)), (n)) 166 #define Bcopy(a, b, n) bcopy(((char *)(a)), ((char *)(b)), (unsigned)(n)) 167 #define Bzero(p, n) bzero((char *)(p), (int)(n)); 168 #define R_Malloc(p, t, n) (p = (t) malloc((unsigned int)(n))) 169 #define Free(p) free((char *)p); 170 #else 171 #define Bcmp(a, b, n) bcmp(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n)) 172 #define Bcopy(a, b, n) bcopy(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n)) 173 #define Bzero(p, n) bzero((caddr_t)(p), (unsigned)(n)); 174 #define R_Malloc(p, t, n) (p = (t) malloc((unsigned long)(n), M_RTABLE, M_DONTWAIT)) 175 #define Free(p) free((caddr_t)p, M_RTABLE); 176 #endif /*_KERNEL*/ 177 178 void rn_init __P((void)); 179 int rn_inithead __P((void **, int)); 180 int rn_refines __P((void *, void *)); 181 int rn_walktree __P((struct radix_node_head *, 182 int (*)(struct radix_node *, void *), void *)); 183 struct radix_node 184 *rn_addmask __P((void *, int, int)), 185 *rn_addroute __P((void *, void *, struct radix_node_head *, 186 struct radix_node [2])), 187 *rn_delete __P((void *, void *, struct radix_node_head *)), 188 *rn_insert __P((void *, struct radix_node_head *, int *, 189 struct radix_node [2])), 190 *rn_lookup __P((void *, void *, struct radix_node_head *)), 191 *rn_match __P((void *, struct radix_node_head *)), 192 *rn_newpair __P((void *, int, struct radix_node[2])), 193 *rn_search __P((void *, struct radix_node *)), 194 *rn_search_m __P((void *, struct radix_node *, void *)); 195 196 #endif /* _NET_RADIX_H_ */ 197
Indexes created Wed Oct 22 13:09:56 GMT 2025