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