17c478bd9Sstevel@tonic-gate /* 27c478bd9Sstevel@tonic-gate * Copyright (c) 1988, 1989, 1993 37c478bd9Sstevel@tonic-gate * The Regents of the University of California. All rights reserved. 47c478bd9Sstevel@tonic-gate * 57c478bd9Sstevel@tonic-gate * Redistribution and use in source and binary forms, with or without 67c478bd9Sstevel@tonic-gate * modification, are permitted provided that the following conditions 77c478bd9Sstevel@tonic-gate * are met: 87c478bd9Sstevel@tonic-gate * 1. Redistributions of source code must retain the above copyright 97c478bd9Sstevel@tonic-gate * notice, this list of conditions and the following disclaimer. 107c478bd9Sstevel@tonic-gate * 2. Redistributions in binary form must reproduce the above copyright 117c478bd9Sstevel@tonic-gate * notice, this list of conditions and the following disclaimer in the 127c478bd9Sstevel@tonic-gate * documentation and/or other materials provided with the distribution. 137c478bd9Sstevel@tonic-gate * 147c478bd9Sstevel@tonic-gate * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 157c478bd9Sstevel@tonic-gate * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 167c478bd9Sstevel@tonic-gate * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 177c478bd9Sstevel@tonic-gate * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 187c478bd9Sstevel@tonic-gate * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 197c478bd9Sstevel@tonic-gate * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 207c478bd9Sstevel@tonic-gate * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 217c478bd9Sstevel@tonic-gate * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 227c478bd9Sstevel@tonic-gate * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 237c478bd9Sstevel@tonic-gate * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 247c478bd9Sstevel@tonic-gate * SUCH DAMAGE. 257c478bd9Sstevel@tonic-gate * 267c478bd9Sstevel@tonic-gate * @(#)radix.h 8.2 (Berkeley) 10/31/94 277c478bd9Sstevel@tonic-gate */ 287c478bd9Sstevel@tonic-gate 29*ab25eeb5Syz #if !defined(_NET_RADIX_H_) && !defined(_RADIX_H_) 307c478bd9Sstevel@tonic-gate #define _NET_RADIX_H_ 31*ab25eeb5Syz #ifndef _RADIX_H_ 32*ab25eeb5Syz #define _RADIX_H_ 33*ab25eeb5Syz #endif /* _RADIX_H_ */ 347c478bd9Sstevel@tonic-gate 357c478bd9Sstevel@tonic-gate #ifndef __P 367c478bd9Sstevel@tonic-gate # ifdef __STDC__ 377c478bd9Sstevel@tonic-gate # define __P(x) x 387c478bd9Sstevel@tonic-gate # else 397c478bd9Sstevel@tonic-gate # define __P(x) () 407c478bd9Sstevel@tonic-gate # endif 417c478bd9Sstevel@tonic-gate #endif 427c478bd9Sstevel@tonic-gate 43*ab25eeb5Syz #if defined(__sgi) 44*ab25eeb5Syz # define radix_mask ipf_radix_mask 45*ab25eeb5Syz # define radix_node ipf_radix_node 46*ab25eeb5Syz # define radix_node_head ipf_radix_node_head 47*ab25eeb5Syz #endif 48*ab25eeb5Syz 497c478bd9Sstevel@tonic-gate /* 507c478bd9Sstevel@tonic-gate * Radix search tree node layout. 517c478bd9Sstevel@tonic-gate */ 527c478bd9Sstevel@tonic-gate 537c478bd9Sstevel@tonic-gate struct radix_node { 547c478bd9Sstevel@tonic-gate struct radix_mask *rn_mklist; /* list of masks contained in subtree */ 557c478bd9Sstevel@tonic-gate struct radix_node *rn_p; /* parent */ 567c478bd9Sstevel@tonic-gate short rn_b; /* bit offset; -1-index(netmask) */ 577c478bd9Sstevel@tonic-gate char rn_bmask; /* node: mask for bit test*/ 587c478bd9Sstevel@tonic-gate u_char rn_flags; /* enumerated next */ 597c478bd9Sstevel@tonic-gate #define RNF_NORMAL 1 /* leaf contains normal route */ 607c478bd9Sstevel@tonic-gate #define RNF_ROOT 2 /* leaf is root leaf for tree */ 617c478bd9Sstevel@tonic-gate #define RNF_ACTIVE 4 /* This node is alive (for rtfree) */ 627c478bd9Sstevel@tonic-gate union { 637c478bd9Sstevel@tonic-gate struct { /* leaf only data: */ 647c478bd9Sstevel@tonic-gate caddr_t rn_Key; /* object of search */ 657c478bd9Sstevel@tonic-gate caddr_t rn_Mask; /* netmask, if present */ 667c478bd9Sstevel@tonic-gate struct radix_node *rn_Dupedkey; 677c478bd9Sstevel@tonic-gate } rn_leaf; 687c478bd9Sstevel@tonic-gate struct { /* node only data: */ 697c478bd9Sstevel@tonic-gate int rn_Off; /* where to start compare */ 707c478bd9Sstevel@tonic-gate struct radix_node *rn_L;/* progeny */ 717c478bd9Sstevel@tonic-gate struct radix_node *rn_R;/* progeny */ 727c478bd9Sstevel@tonic-gate } rn_node; 737c478bd9Sstevel@tonic-gate } rn_u; 747c478bd9Sstevel@tonic-gate #ifdef RN_DEBUG 757c478bd9Sstevel@tonic-gate int rn_info; 767c478bd9Sstevel@tonic-gate struct radix_node *rn_twin; 777c478bd9Sstevel@tonic-gate struct radix_node *rn_ybro; 787c478bd9Sstevel@tonic-gate #endif 797c478bd9Sstevel@tonic-gate }; 807c478bd9Sstevel@tonic-gate 817c478bd9Sstevel@tonic-gate #define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey 827c478bd9Sstevel@tonic-gate #define rn_key rn_u.rn_leaf.rn_Key 837c478bd9Sstevel@tonic-gate #define rn_mask rn_u.rn_leaf.rn_Mask 847c478bd9Sstevel@tonic-gate #define rn_off rn_u.rn_node.rn_Off 857c478bd9Sstevel@tonic-gate #define rn_l rn_u.rn_node.rn_L 867c478bd9Sstevel@tonic-gate #define rn_r rn_u.rn_node.rn_R 877c478bd9Sstevel@tonic-gate 887c478bd9Sstevel@tonic-gate /* 897c478bd9Sstevel@tonic-gate * Annotations to tree concerning potential routes applying to subtrees. 907c478bd9Sstevel@tonic-gate */ 917c478bd9Sstevel@tonic-gate 92*ab25eeb5Syz struct radix_mask { 937c478bd9Sstevel@tonic-gate short rm_b; /* bit offset; -1-index(netmask) */ 947c478bd9Sstevel@tonic-gate char rm_unused; /* cf. rn_bmask */ 957c478bd9Sstevel@tonic-gate u_char rm_flags; /* cf. rn_flags */ 967c478bd9Sstevel@tonic-gate struct radix_mask *rm_mklist; /* more masks to try */ 977c478bd9Sstevel@tonic-gate union { 987c478bd9Sstevel@tonic-gate caddr_t rmu_mask; /* the mask */ 997c478bd9Sstevel@tonic-gate struct radix_node *rmu_leaf; /* for normal routes */ 1007c478bd9Sstevel@tonic-gate } rm_rmu; 1017c478bd9Sstevel@tonic-gate int rm_refs; /* # of references to this struct */ 102*ab25eeb5Syz }; 1037c478bd9Sstevel@tonic-gate 1047c478bd9Sstevel@tonic-gate #define rm_mask rm_rmu.rmu_mask 1057c478bd9Sstevel@tonic-gate #define rm_leaf rm_rmu.rmu_leaf /* extra field would make 32 bytes */ 1067c478bd9Sstevel@tonic-gate 1077c478bd9Sstevel@tonic-gate #define MKGet(m) {\ 1087c478bd9Sstevel@tonic-gate if (rn_mkfreelist) {\ 1097c478bd9Sstevel@tonic-gate m = rn_mkfreelist; \ 1107c478bd9Sstevel@tonic-gate rn_mkfreelist = (m)->rm_mklist; \ 1117c478bd9Sstevel@tonic-gate } else \ 1127c478bd9Sstevel@tonic-gate R_Malloc(m, struct radix_mask *, sizeof (*(m))); }\ 1137c478bd9Sstevel@tonic-gate 1147c478bd9Sstevel@tonic-gate #define MKFree(m) { (m)->rm_mklist = rn_mkfreelist; rn_mkfreelist = (m);} 1157c478bd9Sstevel@tonic-gate 1167c478bd9Sstevel@tonic-gate struct radix_node_head { 1177c478bd9Sstevel@tonic-gate struct radix_node *rnh_treetop; 1187c478bd9Sstevel@tonic-gate struct radix_node *rnh_leaflist; 1197c478bd9Sstevel@tonic-gate u_long rnh_hits; 1207c478bd9Sstevel@tonic-gate u_int rnh_number; 1217c478bd9Sstevel@tonic-gate u_int rnh_ref; 1227c478bd9Sstevel@tonic-gate int rnh_addrsize; /* permit, but not require fixed keys */ 1237c478bd9Sstevel@tonic-gate int rnh_pktsize; /* permit, but not require fixed keys */ 1247c478bd9Sstevel@tonic-gate struct radix_node *(*rnh_addaddr) /* add based on sockaddr */ 1257c478bd9Sstevel@tonic-gate __P((void *v, void *mask, 1267c478bd9Sstevel@tonic-gate struct radix_node_head *head, struct radix_node nodes[])); 1277c478bd9Sstevel@tonic-gate struct radix_node *(*rnh_addpkt) /* add based on packet hdr */ 1287c478bd9Sstevel@tonic-gate __P((void *v, void *mask, 1297c478bd9Sstevel@tonic-gate struct radix_node_head *head, struct radix_node nodes[])); 1307c478bd9Sstevel@tonic-gate struct radix_node *(*rnh_deladdr) /* remove based on sockaddr */ 1317c478bd9Sstevel@tonic-gate __P((void *v, void *mask, struct radix_node_head *head)); 1327c478bd9Sstevel@tonic-gate struct radix_node *(*rnh_delpkt) /* remove based on packet hdr */ 1337c478bd9Sstevel@tonic-gate __P((void *v, void *mask, struct radix_node_head *head)); 1347c478bd9Sstevel@tonic-gate struct radix_node *(*rnh_matchaddr) /* locate based on sockaddr */ 1357c478bd9Sstevel@tonic-gate __P((void *v, struct radix_node_head *head)); 1367c478bd9Sstevel@tonic-gate struct radix_node *(*rnh_lookup) /* locate based on sockaddr */ 1377c478bd9Sstevel@tonic-gate __P((void *v, void *mask, struct radix_node_head *head)); 1387c478bd9Sstevel@tonic-gate struct radix_node *(*rnh_matchpkt) /* locate based on packet hdr */ 1397c478bd9Sstevel@tonic-gate __P((void *v, struct radix_node_head *head)); 1407c478bd9Sstevel@tonic-gate int (*rnh_walktree) /* traverse tree */ 1417c478bd9Sstevel@tonic-gate __P((struct radix_node_head *, 1427c478bd9Sstevel@tonic-gate int (*)(struct radix_node *, void *), void *)); 1437c478bd9Sstevel@tonic-gate struct radix_node rnh_nodes[3]; /* empty tree for common case */ 1447c478bd9Sstevel@tonic-gate }; 1457c478bd9Sstevel@tonic-gate 1467c478bd9Sstevel@tonic-gate 147*ab25eeb5Syz #if defined(AIX) 148*ab25eeb5Syz # undef Bcmp 149*ab25eeb5Syz # undef Bzero 150*ab25eeb5Syz # undef R_Malloc 151*ab25eeb5Syz # undef Free 152*ab25eeb5Syz #endif 1537c478bd9Sstevel@tonic-gate #define Bcmp(a, b, n) bcmp(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n)) 154*ab25eeb5Syz #if defined(linux) && defined(_KERNEL) 155*ab25eeb5Syz # define Bcopy(a, b, n) memmove(((caddr_t)(b)), ((caddr_t)(a)), (unsigned)(n)) 156*ab25eeb5Syz #else 157*ab25eeb5Syz # define Bcopy(a, b, n) bcopy(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n)) 158*ab25eeb5Syz #endif 1597c478bd9Sstevel@tonic-gate #define Bzero(p, n) bzero((caddr_t)(p), (unsigned)(n)); 1607c478bd9Sstevel@tonic-gate #define R_Malloc(p, t, n) KMALLOCS(p, t, n) 1617c478bd9Sstevel@tonic-gate #define FreeS(p, z) KFREES(p, z) 1627c478bd9Sstevel@tonic-gate #define Free(p) KFREE(p) 1637c478bd9Sstevel@tonic-gate 164*ab25eeb5Syz #if (defined(__osf__) || defined(AIX) || (IRIX >= 60516)) && defined(_KERNEL) 165*ab25eeb5Syz # define rn_init ipf_rn_init 166*ab25eeb5Syz # define rn_fini ipf_rn_fini 167*ab25eeb5Syz # define rn_inithead ipf_rn_inithead 168*ab25eeb5Syz # define rn_freehead ipf_rn_freehead 169*ab25eeb5Syz # define rn_inithead0 ipf_rn_inithead0 170*ab25eeb5Syz # define rn_refines ipf_rn_refines 171*ab25eeb5Syz # define rn_walktree ipf_rn_walktree 172*ab25eeb5Syz # define rn_addmask ipf_rn_addmask 173*ab25eeb5Syz # define rn_addroute ipf_rn_addroute 174*ab25eeb5Syz # define rn_delete ipf_rn_delete 175*ab25eeb5Syz # define rn_insert ipf_rn_insert 176*ab25eeb5Syz # define rn_lookup ipf_rn_lookup 177*ab25eeb5Syz # define rn_match ipf_rn_match 178*ab25eeb5Syz # define rn_newpair ipf_rn_newpair 179*ab25eeb5Syz # define rn_search ipf_rn_search 180*ab25eeb5Syz # define rn_search_m ipf_rn_search_m 181*ab25eeb5Syz # define max_keylen ipf_maxkeylen 182*ab25eeb5Syz # define rn_mkfreelist ipf_rn_mkfreelist 183*ab25eeb5Syz # define rn_zeros ipf_rn_zeros 184*ab25eeb5Syz # define rn_ones ipf_rn_ones 185*ab25eeb5Syz # define rn_satisfies_leaf ipf_rn_satisfies_leaf 186*ab25eeb5Syz # define rn_lexobetter ipf_rn_lexobetter 187*ab25eeb5Syz # define rn_new_radix_mask ipf_rn_new_radix_mask 188*ab25eeb5Syz # define rn_freenode ipf_rn_freenode 189*ab25eeb5Syz #endif 190*ab25eeb5Syz 1917c478bd9Sstevel@tonic-gate void rn_init __P((void)); 1927c478bd9Sstevel@tonic-gate void rn_fini __P((void)); 1937c478bd9Sstevel@tonic-gate int rn_inithead __P((void **, int)); 1947c478bd9Sstevel@tonic-gate void rn_freehead __P((struct radix_node_head *)); 1957c478bd9Sstevel@tonic-gate int rn_inithead0 __P((struct radix_node_head *, int)); 1967c478bd9Sstevel@tonic-gate int rn_refines __P((void *, void *)); 1977c478bd9Sstevel@tonic-gate int rn_walktree __P((struct radix_node_head *, 1987c478bd9Sstevel@tonic-gate int (*)(struct radix_node *, void *), void *)); 1997c478bd9Sstevel@tonic-gate struct radix_node 2007c478bd9Sstevel@tonic-gate *rn_addmask __P((void *, int, int)), 2017c478bd9Sstevel@tonic-gate *rn_addroute __P((void *, void *, struct radix_node_head *, 2027c478bd9Sstevel@tonic-gate struct radix_node [2])), 2037c478bd9Sstevel@tonic-gate *rn_delete __P((void *, void *, struct radix_node_head *)), 2047c478bd9Sstevel@tonic-gate *rn_insert __P((void *, struct radix_node_head *, int *, 2057c478bd9Sstevel@tonic-gate struct radix_node [2])), 2067c478bd9Sstevel@tonic-gate *rn_lookup __P((void *, void *, struct radix_node_head *)), 2077c478bd9Sstevel@tonic-gate *rn_match __P((void *, struct radix_node_head *)), 2087c478bd9Sstevel@tonic-gate *rn_newpair __P((void *, int, struct radix_node[2])), 2097c478bd9Sstevel@tonic-gate *rn_search __P((void *, struct radix_node *)), 2107c478bd9Sstevel@tonic-gate *rn_search_m __P((void *, struct radix_node *, void *)); 2117c478bd9Sstevel@tonic-gate 2127c478bd9Sstevel@tonic-gate #endif /* _NET_RADIX_H_ */ 213