1145519Sdarrenr/* $FreeBSD$ */ 2145510Sdarrenr 3145510Sdarrenr/* 4145510Sdarrenr * Copyright (c) 1988, 1989, 1993 5145510Sdarrenr * The Regents of the University of California. All rights reserved. 6145510Sdarrenr * 7145510Sdarrenr * Redistribution and use in source and binary forms, with or without 8145510Sdarrenr * modification, are permitted provided that the following conditions 9145510Sdarrenr * are met: 10145510Sdarrenr * 1. Redistributions of source code must retain the above copyright 11145510Sdarrenr * notice, this list of conditions and the following disclaimer. 12145510Sdarrenr * 2. Redistributions in binary form must reproduce the above copyright 13145510Sdarrenr * notice, this list of conditions and the following disclaimer in the 14145510Sdarrenr * documentation and/or other materials provided with the distribution. 15145510Sdarrenr * 16145510Sdarrenr * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 17145510Sdarrenr * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 18145510Sdarrenr * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 19145510Sdarrenr * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 20145510Sdarrenr * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 21145510Sdarrenr * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 22145510Sdarrenr * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 23145510Sdarrenr * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 24145510Sdarrenr * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 25145510Sdarrenr * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 26145510Sdarrenr * SUCH DAMAGE. 27145510Sdarrenr * 28145510Sdarrenr * @(#)radix.h 8.2 (Berkeley) 10/31/94 29145510Sdarrenr */ 30145510Sdarrenr 31153881Sguido#if !defined(_NET_RADIX_H_) && !defined(_RADIX_H_) 32145510Sdarrenr#define _NET_RADIX_H_ 33145510Sdarrenr#ifndef _RADIX_H_ 34145510Sdarrenr#define _RADIX_H_ 35145510Sdarrenr#endif /* _RADIX_H_ */ 36145510Sdarrenr 37145510Sdarrenr#ifndef __P 38145510Sdarrenr# ifdef __STDC__ 39145510Sdarrenr# define __P(x) x 40145510Sdarrenr# else 41145510Sdarrenr# define __P(x) () 42145510Sdarrenr# endif 43145510Sdarrenr#endif 44145510Sdarrenr 45172776Sdarrenr#if defined(__sgi) || defined(__osf__) || defined(sun) 46145510Sdarrenr# define radix_mask ipf_radix_mask 47145510Sdarrenr# define radix_node ipf_radix_node 48145510Sdarrenr# define radix_node_head ipf_radix_node_head 49145510Sdarrenr#endif 50145510Sdarrenr 51145510Sdarrenr/* 52145510Sdarrenr * Radix search tree node layout. 53145510Sdarrenr */ 54145510Sdarrenr 55145510Sdarrenrstruct radix_node { 56145510Sdarrenr struct radix_mask *rn_mklist; /* list of masks contained in subtree */ 57145510Sdarrenr struct radix_node *rn_p; /* parent */ 58145510Sdarrenr short rn_b; /* bit offset; -1-index(netmask) */ 59145510Sdarrenr char rn_bmask; /* node: mask for bit test*/ 60145510Sdarrenr u_char rn_flags; /* enumerated next */ 61145510Sdarrenr#define RNF_NORMAL 1 /* leaf contains normal route */ 62145510Sdarrenr#define RNF_ROOT 2 /* leaf is root leaf for tree */ 63145510Sdarrenr#define RNF_ACTIVE 4 /* This node is alive (for rtfree) */ 64145510Sdarrenr union { 65145510Sdarrenr struct { /* leaf only data: */ 66145510Sdarrenr caddr_t rn_Key; /* object of search */ 67145510Sdarrenr caddr_t rn_Mask; /* netmask, if present */ 68145510Sdarrenr struct radix_node *rn_Dupedkey; 69145510Sdarrenr } rn_leaf; 70145510Sdarrenr struct { /* node only data: */ 71145510Sdarrenr int rn_Off; /* where to start compare */ 72145510Sdarrenr struct radix_node *rn_L;/* progeny */ 73145510Sdarrenr struct radix_node *rn_R;/* progeny */ 74145510Sdarrenr } rn_node; 75145510Sdarrenr } rn_u; 76145510Sdarrenr#ifdef RN_DEBUG 77145510Sdarrenr int rn_info; 78145510Sdarrenr struct radix_node *rn_twin; 79145510Sdarrenr struct radix_node *rn_ybro; 80145510Sdarrenr#endif 81145510Sdarrenr}; 82145510Sdarrenr 83145510Sdarrenr#define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey 84145510Sdarrenr#define rn_key rn_u.rn_leaf.rn_Key 85145510Sdarrenr#define rn_mask rn_u.rn_leaf.rn_Mask 86145510Sdarrenr#define rn_off rn_u.rn_node.rn_Off 87145510Sdarrenr#define rn_l rn_u.rn_node.rn_L 88145510Sdarrenr#define rn_r rn_u.rn_node.rn_R 89145510Sdarrenr 90145510Sdarrenr/* 91145510Sdarrenr * Annotations to tree concerning potential routes applying to subtrees. 92145510Sdarrenr */ 93145510Sdarrenr 94145510Sdarrenrstruct radix_mask { 95145510Sdarrenr short rm_b; /* bit offset; -1-index(netmask) */ 96145510Sdarrenr char rm_unused; /* cf. rn_bmask */ 97145510Sdarrenr u_char rm_flags; /* cf. rn_flags */ 98145510Sdarrenr struct radix_mask *rm_mklist; /* more masks to try */ 99145510Sdarrenr union { 100145510Sdarrenr caddr_t rmu_mask; /* the mask */ 101145510Sdarrenr struct radix_node *rmu_leaf; /* for normal routes */ 102145510Sdarrenr } rm_rmu; 103145510Sdarrenr int rm_refs; /* # of references to this struct */ 104145510Sdarrenr}; 105145510Sdarrenr 106145510Sdarrenr#define rm_mask rm_rmu.rmu_mask 107145510Sdarrenr#define rm_leaf rm_rmu.rmu_leaf /* extra field would make 32 bytes */ 108145510Sdarrenr 109145510Sdarrenr#define MKGet(m) {\ 110145510Sdarrenr if (rn_mkfreelist) {\ 111145510Sdarrenr m = rn_mkfreelist; \ 112145510Sdarrenr rn_mkfreelist = (m)->rm_mklist; \ 113145510Sdarrenr } else \ 114145510Sdarrenr R_Malloc(m, struct radix_mask *, sizeof (*(m))); }\ 115145510Sdarrenr 116145510Sdarrenr#define MKFree(m) { (m)->rm_mklist = rn_mkfreelist; rn_mkfreelist = (m);} 117145510Sdarrenr 118145510Sdarrenrstruct radix_node_head { 119145510Sdarrenr struct radix_node *rnh_treetop; 120145510Sdarrenr struct radix_node *rnh_leaflist; 121145510Sdarrenr u_long rnh_hits; 122145510Sdarrenr u_int rnh_number; 123145510Sdarrenr u_int rnh_ref; 124145510Sdarrenr int rnh_addrsize; /* permit, but not require fixed keys */ 125145510Sdarrenr int rnh_pktsize; /* permit, but not require fixed keys */ 126145510Sdarrenr struct radix_node *(*rnh_addaddr) /* add based on sockaddr */ 127145510Sdarrenr __P((void *v, void *mask, 128145510Sdarrenr struct radix_node_head *head, struct radix_node nodes[])); 129145510Sdarrenr struct radix_node *(*rnh_addpkt) /* add based on packet hdr */ 130145510Sdarrenr __P((void *v, void *mask, 131145510Sdarrenr struct radix_node_head *head, struct radix_node nodes[])); 132145510Sdarrenr struct radix_node *(*rnh_deladdr) /* remove based on sockaddr */ 133145510Sdarrenr __P((void *v, void *mask, struct radix_node_head *head)); 134145510Sdarrenr struct radix_node *(*rnh_delpkt) /* remove based on packet hdr */ 135145510Sdarrenr __P((void *v, void *mask, struct radix_node_head *head)); 136145510Sdarrenr struct radix_node *(*rnh_matchaddr) /* locate based on sockaddr */ 137145510Sdarrenr __P((void *v, struct radix_node_head *head)); 138145510Sdarrenr struct radix_node *(*rnh_lookup) /* locate based on sockaddr */ 139145510Sdarrenr __P((void *v, void *mask, struct radix_node_head *head)); 140145510Sdarrenr struct radix_node *(*rnh_matchpkt) /* locate based on packet hdr */ 141145510Sdarrenr __P((void *v, struct radix_node_head *head)); 142145510Sdarrenr int (*rnh_walktree) /* traverse tree */ 143145510Sdarrenr __P((struct radix_node_head *, 144145510Sdarrenr int (*)(struct radix_node *, void *), void *)); 145145510Sdarrenr struct radix_node rnh_nodes[3]; /* empty tree for common case */ 146145510Sdarrenr}; 147145510Sdarrenr 148145510Sdarrenr 149153881Sguido#if defined(AIX) 150153881Sguido# undef Bcmp 151153881Sguido# undef Bzero 152153881Sguido# undef R_Malloc 153153881Sguido# undef Free 154153881Sguido#endif 155145510Sdarrenr#define Bcmp(a, b, n) bcmp(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n)) 156145510Sdarrenr#if defined(linux) && defined(_KERNEL) 157145510Sdarrenr# define Bcopy(a, b, n) memmove(((caddr_t)(b)), ((caddr_t)(a)), (unsigned)(n)) 158145510Sdarrenr#else 159145510Sdarrenr# define Bcopy(a, b, n) bcopy(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n)) 160145510Sdarrenr#endif 161145510Sdarrenr#define Bzero(p, n) bzero((caddr_t)(p), (unsigned)(n)); 162145510Sdarrenr#define R_Malloc(p, t, n) KMALLOCS(p, t, n) 163145510Sdarrenr#define FreeS(p, z) KFREES(p, z) 164145510Sdarrenr#define Free(p) KFREE(p) 165145510Sdarrenr 166172776Sdarrenr#if (defined(__osf__) || defined(AIX) || (IRIX >= 60516) || defined(sun)) && defined(_KERNEL) 167145510Sdarrenr# define rn_init ipf_rn_init 168145510Sdarrenr# define rn_fini ipf_rn_fini 169145510Sdarrenr# define rn_inithead ipf_rn_inithead 170145510Sdarrenr# define rn_freehead ipf_rn_freehead 171145510Sdarrenr# define rn_inithead0 ipf_rn_inithead0 172145510Sdarrenr# define rn_refines ipf_rn_refines 173145510Sdarrenr# define rn_walktree ipf_rn_walktree 174145510Sdarrenr# define rn_addmask ipf_rn_addmask 175145510Sdarrenr# define rn_addroute ipf_rn_addroute 176145510Sdarrenr# define rn_delete ipf_rn_delete 177145510Sdarrenr# define rn_insert ipf_rn_insert 178145510Sdarrenr# define rn_lookup ipf_rn_lookup 179145510Sdarrenr# define rn_match ipf_rn_match 180145510Sdarrenr# define rn_newpair ipf_rn_newpair 181145510Sdarrenr# define rn_search ipf_rn_search 182145510Sdarrenr# define rn_search_m ipf_rn_search_m 183145510Sdarrenr# define max_keylen ipf_maxkeylen 184145510Sdarrenr# define rn_mkfreelist ipf_rn_mkfreelist 185145510Sdarrenr# define rn_zeros ipf_rn_zeros 186145510Sdarrenr# define rn_ones ipf_rn_ones 187145510Sdarrenr# define rn_satisfies_leaf ipf_rn_satisfies_leaf 188145510Sdarrenr# define rn_lexobetter ipf_rn_lexobetter 189145510Sdarrenr# define rn_new_radix_mask ipf_rn_new_radix_mask 190145510Sdarrenr# define rn_freenode ipf_rn_freenode 191145510Sdarrenr#endif 192145510Sdarrenr 193145510Sdarrenrvoid rn_init __P((void)); 194145510Sdarrenrvoid rn_fini __P((void)); 195145510Sdarrenrint rn_inithead __P((void **, int)); 196145510Sdarrenrvoid rn_freehead __P((struct radix_node_head *)); 197145510Sdarrenrint rn_inithead0 __P((struct radix_node_head *, int)); 198145510Sdarrenrint rn_refines __P((void *, void *)); 199145510Sdarrenrint rn_walktree __P((struct radix_node_head *, 200145510Sdarrenr int (*)(struct radix_node *, void *), void *)); 201145510Sdarrenrstruct radix_node 202145510Sdarrenr *rn_addmask __P((void *, int, int)), 203145510Sdarrenr *rn_addroute __P((void *, void *, struct radix_node_head *, 204145510Sdarrenr struct radix_node [2])), 205145510Sdarrenr *rn_delete __P((void *, void *, struct radix_node_head *)), 206145510Sdarrenr *rn_insert __P((void *, struct radix_node_head *, int *, 207145510Sdarrenr struct radix_node [2])), 208145510Sdarrenr *rn_lookup __P((void *, void *, struct radix_node_head *)), 209145510Sdarrenr *rn_match __P((void *, struct radix_node_head *)), 210145510Sdarrenr *rn_newpair __P((void *, int, struct radix_node[2])), 211145510Sdarrenr *rn_search __P((void *, struct radix_node *)), 212145510Sdarrenr *rn_search_m __P((void *, struct radix_node *, void *)); 213145510Sdarrenr 214145510Sdarrenr#endif /* _NET_RADIX_H_ */ 215