radix_ipf.h revision 145511
1139825Simp/* $NetBSD$ */ 282899Sjake 380708Sjake/* 480708Sjake * Copyright (c) 1988, 1989, 1993 582899Sjake * The Regents of the University of California. All rights reserved. 682899Sjake * 782899Sjake * Redistribution and use in source and binary forms, with or without 882899Sjake * modification, are permitted provided that the following conditions 980708Sjake * are met: 1080708Sjake * 1. Redistributions of source code must retain the above copyright 1180708Sjake * notice, this list of conditions and the following disclaimer. 1280708Sjake * 2. Redistributions in binary form must reproduce the above copyright 1380708Sjake * notice, this list of conditions and the following disclaimer in the 1480708Sjake * documentation and/or other materials provided with the distribution. 1580708Sjake * 1680708Sjake * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 1782899Sjake * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 1882899Sjake * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 1982899Sjake * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 2080708Sjake * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 2182899Sjake * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 2280708Sjake * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 2380708Sjake * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 2482899Sjake * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 2580708Sjake * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 2680708Sjake * SUCH DAMAGE. 2780708Sjake * 2880708Sjake * @(#)radix.h 8.2 (Berkeley) 10/31/94 2980708Sjake */ 3080708Sjake 3180708Sjake#ifndef _NET_RADIX_H_ 3280708Sjake#define _NET_RADIX_H_ 3382899Sjake#ifndef _RADIX_H_ 3482899Sjake#define _RADIX_H_ 3582899Sjake#endif /* _RADIX_H_ */ 3680708Sjake 3780708Sjake#ifndef __P 3880708Sjake# ifdef __STDC__ 3980708Sjake# define __P(x) x 4080708Sjake# else 4180708Sjake# define __P(x) () 42104265Sjake# endif 43222813Sattilio#endif 44133451Salc 45133451Salc#ifdef __sgi 46236214Salc# define radix_mask ipf_radix_mask 47112399Sjake# define radix_node ipf_radix_node 4880709Sjake# define radix_node_head ipf_radix_node_head 4980709Sjake#endif 5080709Sjake 5180709Sjake/* 5280709Sjake * Radix search tree node layout. 5380709Sjake */ 5483053Sobrien 55108166Sjakestruct radix_node { 56108166Sjake struct radix_mask *rn_mklist; /* list of masks contained in subtree */ 57108166Sjake struct radix_node *rn_p; /* parent */ 58108166Sjake short rn_b; /* bit offset; -1-index(netmask) */ 59108166Sjake char rn_bmask; /* node: mask for bit test*/ 6080708Sjake u_char rn_flags; /* enumerated next */ 6180708Sjake#define RNF_NORMAL 1 /* leaf contains normal route */ 6283053Sobrien#define RNF_ROOT 2 /* leaf is root leaf for tree */ 63133451Salc#define RNF_ACTIVE 4 /* This node is alive (for rtfree) */ 6488651Sjake union { 6588651Sjake struct { /* leaf only data: */ 66222813Sattilio caddr_t rn_Key; /* object of search */ 6791288Sjake caddr_t rn_Mask; /* netmask, if present */ 6880709Sjake struct radix_node *rn_Dupedkey; 6980708Sjake } rn_leaf; 7080708Sjake struct { /* node only data: */ 71133451Salc int rn_Off; /* where to start compare */ 72216803Smarius struct radix_node *rn_L;/* progeny */ 73133451Salc struct radix_node *rn_R;/* progeny */ 74133451Salc } rn_node; 75216803Smarius } rn_u; 76142045Smarius#ifdef RN_DEBUG 77133451Salc int rn_info; 78133451Salc struct radix_node *rn_twin; 79133451Salc struct radix_node *rn_ybro; 80133451Salc#endif 81133451Salc}; 82195649Salc 83195649Salc#define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey 84195649Salc#define rn_key rn_u.rn_leaf.rn_Key 85204152Smarius#define rn_mask rn_u.rn_leaf.rn_Mask 86113238Sjake#define rn_off rn_u.rn_node.rn_Off 87113238Sjake#define rn_l rn_u.rn_node.rn_L 88112312Sjake#define rn_r rn_u.rn_node.rn_R 89113238Sjake 9098813Sjake/* 91129068Salc * Annotations to tree concerning potential routes applying to subtrees. 9280708Sjake */ 9388651Sjake 9488651Sjakestruct radix_mask { 9597447Sjake short rm_b; /* bit offset; -1-index(netmask) */ 9697447Sjake char rm_unused; /* cf. rn_bmask */ 9797447Sjake u_char rm_flags; /* cf. rn_flags */ 9889041Sjake struct radix_mask *rm_mklist; /* more masks to try */ 99216803Smarius union { 10089041Sjake caddr_t rmu_mask; /* the mask */ 101153179Sjhb struct radix_node *rmu_leaf; /* for normal routes */ 10284844Stmm } rm_rmu; 10388651Sjake int rm_refs; /* # of references to this struct */ 10488651Sjake}; 105236214Salc 106113238Sjake#define rm_mask rm_rmu.rmu_mask 10780708Sjake#define rm_leaf rm_rmu.rmu_leaf /* extra field would make 32 bytes */ 10880708Sjake 10980708Sjake#define MKGet(m) {\ 110108700Sjake if (rn_mkfreelist) {\ 111108700Sjake m = rn_mkfreelist; \ 112108700Sjake rn_mkfreelist = (m)->rm_mklist; \ 113108700Sjake } else \ 114108700Sjake R_Malloc(m, struct radix_mask *, sizeof (*(m))); }\ 115108700Sjake 116216803Smarius#define MKFree(m) { (m)->rm_mklist = rn_mkfreelist; rn_mkfreelist = (m);} 117108700Sjake 118108700Sjakestruct radix_node_head { 119108700Sjake struct radix_node *rnh_treetop; 120108700Sjake struct radix_node *rnh_leaflist; 121108700Sjake u_long rnh_hits; 122108700Sjake u_int rnh_number; 123108700Sjake u_int rnh_ref; 124108700Sjake int rnh_addrsize; /* permit, but not require fixed keys */ 125108700Sjake int rnh_pktsize; /* permit, but not require fixed keys */ 126108700Sjake struct radix_node *(*rnh_addaddr) /* add based on sockaddr */ 127108700Sjake __P((void *v, void *mask, 128108700Sjake struct radix_node_head *head, struct radix_node nodes[])); 12980708Sjake struct radix_node *(*rnh_addpkt) /* add based on packet hdr */ 130 __P((void *v, void *mask, 131 struct radix_node_head *head, struct radix_node nodes[])); 132 struct radix_node *(*rnh_deladdr) /* remove based on sockaddr */ 133 __P((void *v, void *mask, struct radix_node_head *head)); 134 struct radix_node *(*rnh_delpkt) /* remove based on packet hdr */ 135 __P((void *v, void *mask, struct radix_node_head *head)); 136 struct radix_node *(*rnh_matchaddr) /* locate based on sockaddr */ 137 __P((void *v, struct radix_node_head *head)); 138 struct radix_node *(*rnh_lookup) /* locate based on sockaddr */ 139 __P((void *v, void *mask, struct radix_node_head *head)); 140 struct radix_node *(*rnh_matchpkt) /* locate based on packet hdr */ 141 __P((void *v, struct radix_node_head *head)); 142 int (*rnh_walktree) /* traverse tree */ 143 __P((struct radix_node_head *, 144 int (*)(struct radix_node *, void *), void *)); 145 struct radix_node rnh_nodes[3]; /* empty tree for common case */ 146}; 147 148 149#define Bcmp(a, b, n) bcmp(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n)) 150#if defined(linux) && defined(_KERNEL) 151# define Bcopy(a, b, n) memmove(((caddr_t)(b)), ((caddr_t)(a)), (unsigned)(n)) 152#else 153# define Bcopy(a, b, n) bcopy(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n)) 154#endif 155#define Bzero(p, n) bzero((caddr_t)(p), (unsigned)(n)); 156#define R_Malloc(p, t, n) KMALLOCS(p, t, n) 157#define FreeS(p, z) KFREES(p, z) 158#define Free(p) KFREE(p) 159 160#if (defined(__osf__) || (IRIX >= 60516)) && defined(_KERNEL) 161# define rn_init ipf_rn_init 162# define rn_fini ipf_rn_fini 163# define rn_inithead ipf_rn_inithead 164# define rn_freehead ipf_rn_freehead 165# define rn_inithead0 ipf_rn_inithead0 166# define rn_refines ipf_rn_refines 167# define rn_walktree ipf_rn_walktree 168# define rn_addmask ipf_rn_addmask 169# define rn_addroute ipf_rn_addroute 170# define rn_delete ipf_rn_delete 171# define rn_insert ipf_rn_insert 172# define rn_lookup ipf_rn_lookup 173# define rn_match ipf_rn_match 174# define rn_newpair ipf_rn_newpair 175# define rn_search ipf_rn_search 176# define rn_search_m ipf_rn_search_m 177# define max_keylen ipf_maxkeylen 178# define rn_mkfreelist ipf_rn_mkfreelist 179# define rn_zeros ipf_rn_zeros 180# define rn_ones ipf_rn_ones 181# define rn_satisfies_leaf ipf_rn_satisfies_leaf 182# define rn_lexobetter ipf_rn_lexobetter 183# define rn_new_radix_mask ipf_rn_new_radix_mask 184# define rn_freenode ipf_rn_freenode 185#endif 186 187void rn_init __P((void)); 188void rn_fini __P((void)); 189int rn_inithead __P((void **, int)); 190void rn_freehead __P((struct radix_node_head *)); 191int rn_inithead0 __P((struct radix_node_head *, int)); 192int rn_refines __P((void *, void *)); 193int rn_walktree __P((struct radix_node_head *, 194 int (*)(struct radix_node *, void *), void *)); 195struct radix_node 196 *rn_addmask __P((void *, int, int)), 197 *rn_addroute __P((void *, void *, struct radix_node_head *, 198 struct radix_node [2])), 199 *rn_delete __P((void *, void *, struct radix_node_head *)), 200 *rn_insert __P((void *, struct radix_node_head *, int *, 201 struct radix_node [2])), 202 *rn_lookup __P((void *, void *, struct radix_node_head *)), 203 *rn_match __P((void *, struct radix_node_head *)), 204 *rn_newpair __P((void *, int, struct radix_node[2])), 205 *rn_search __P((void *, struct radix_node *)), 206 *rn_search_m __P((void *, struct radix_node *, void *)); 207 208#endif /* _NET_RADIX_H_ */ 209