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