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