williamr@2: /*- williamr@2: * Copyright (c) 1988, 1989, 1993 williamr@2: * The Regents of the University of California. All rights reserved. williamr@2: * Redistribution and use in source and binary forms, with or without williamr@2: * modification, are permitted provided that the following conditions williamr@2: * are met: williamr@2: * 1. Redistributions of source code must retain the above copyright williamr@2: * notice, this list of conditions and the following disclaimer. williamr@2: * 2. Redistributions in binary form must reproduce the above copyright williamr@2: * notice, this list of conditions and the following disclaimer in the williamr@2: * documentation and/or other materials provided with the distribution. williamr@2: * 4. Neither the name of the University nor the names of its contributors williamr@2: * may be used to endorse or promote products derived from this software williamr@2: * without specific prior written permission. williamr@2: * williamr@2: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND williamr@2: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE williamr@2: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE williamr@2: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE williamr@2: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL williamr@2: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS williamr@2: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) williamr@2: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT williamr@2: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY williamr@2: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF williamr@2: * SUCH DAMAGE. williamr@2: * williamr@4: * Portions Copyright (c) 2007 Nokia Corporation and/or its subsidiary(-ies). All rights reserved. williamr@2: * @(#)radix.h 8.2 (Berkeley) 10/31/94 williamr@2: * $FreeBSD: src/sys/net/radix.h,v 1.26 2005/01/07 01:45:35 imp Exp $ williamr@2: */ williamr@2: williamr@2: #ifndef _RADIX_H_ williamr@2: #define _RADIX_H_ williamr@2: williamr@2: #ifdef _KERNEL williamr@2: #include williamr@2: #include williamr@2: #endif williamr@2: williamr@2: /* williamr@2: * Radix search tree node layout. williamr@2: */ williamr@2: williamr@2: struct radix_node { williamr@2: struct radix_mask *rn_mklist; /* list of masks contained in subtree */ williamr@2: struct radix_node *rn_parent; /* parent */ williamr@2: short rn_bit; /* bit offset; -1-index(netmask) */ williamr@2: char rn_bmask; /* node: mask for bit test*/ williamr@2: u_char rn_flags; /* enumerated next */ williamr@2: #define RNF_NORMAL 1 /* leaf contains normal route */ williamr@2: #define RNF_ROOT 2 /* leaf is root leaf for tree */ williamr@2: #define RNF_ACTIVE 4 /* This node is alive (for rtfree) */ williamr@2: union { williamr@2: struct { /* leaf only data: */ williamr@2: caddr_t rn_Key; /* object of search */ williamr@2: caddr_t rn_Mask; /* netmask, if present */ williamr@2: struct radix_node *rn_Dupedkey; williamr@2: } rn_leaf; williamr@2: struct { /* node only data: */ williamr@2: int rn_Off; /* where to start compare */ williamr@2: struct radix_node *rn_L;/* progeny */ williamr@2: struct radix_node *rn_R;/* progeny */ williamr@2: } rn_node; williamr@2: } rn_u; williamr@2: #ifdef RN_DEBUG williamr@2: int rn_info; williamr@2: struct radix_node *rn_twin; williamr@2: struct radix_node *rn_ybro; williamr@2: #endif williamr@2: }; williamr@2: williamr@2: #define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey williamr@2: #define rn_key rn_u.rn_leaf.rn_Key williamr@2: #define rn_mask rn_u.rn_leaf.rn_Mask williamr@2: #define rn_offset rn_u.rn_node.rn_Off williamr@2: #define rn_left rn_u.rn_node.rn_L williamr@2: #define rn_right rn_u.rn_node.rn_R williamr@2: williamr@2: /* williamr@2: * Annotations to tree concerning potential routes applying to subtrees. williamr@2: */ williamr@2: williamr@2: struct radix_mask { williamr@2: short rm_bit; /* bit offset; -1-index(netmask) */ williamr@2: char rm_unused; /* cf. rn_bmask */ williamr@2: u_char rm_flags; /* cf. rn_flags */ williamr@2: struct radix_mask *rm_mklist; /* more masks to try */ williamr@2: union { williamr@2: caddr_t rmu_mask; /* the mask */ williamr@2: struct radix_node *rmu_leaf; /* for normal routes */ williamr@2: } rm_rmu; williamr@2: int rm_refs; /* # of references to this struct */ williamr@2: }; williamr@2: williamr@2: #define rm_mask rm_rmu.rmu_mask williamr@2: #define rm_leaf rm_rmu.rmu_leaf /* extra field would make 32 bytes */ williamr@2: williamr@2: #ifndef __SYMBIAN32__ williamr@2: typedef int walktree_f_t(struct radix_node *, void *); williamr@2: williamr@2: struct radix_node_head { williamr@2: struct radix_node *rnh_treetop; williamr@2: int rnh_addrsize; /* permit, but not require fixed keys */ williamr@2: int rnh_pktsize; /* permit, but not require fixed keys */ williamr@2: struct radix_node *(*rnh_addaddr) /* add based on sockaddr */ williamr@2: (void *v, void *mask, williamr@2: struct radix_node_head *head, struct radix_node nodes[]); williamr@2: struct radix_node *(*rnh_addpkt) /* add based on packet hdr */ williamr@2: (void *v, void *mask, williamr@2: struct radix_node_head *head, struct radix_node nodes[]); williamr@2: struct radix_node *(*rnh_deladdr) /* remove based on sockaddr */ williamr@2: (void *v, void *mask, struct radix_node_head *head); williamr@2: struct radix_node *(*rnh_delpkt) /* remove based on packet hdr */ williamr@2: (void *v, void *mask, struct radix_node_head *head); williamr@2: struct radix_node *(*rnh_matchaddr) /* locate based on sockaddr */ williamr@2: (void *v, struct radix_node_head *head); williamr@2: struct radix_node *(*rnh_lookup) /* locate based on sockaddr */ williamr@2: (void *v, void *mask, struct radix_node_head *head); williamr@2: struct radix_node *(*rnh_matchpkt) /* locate based on packet hdr */ williamr@2: (void *v, struct radix_node_head *head); williamr@2: int (*rnh_walktree) /* traverse tree */ williamr@2: (struct radix_node_head *head, walktree_f_t *f, void *w); williamr@2: int (*rnh_walktree_from) /* traverse tree below a */ williamr@2: (struct radix_node_head *head, void *a, void *m, williamr@2: walktree_f_t *f, void *w); williamr@2: void (*rnh_close) /* do something when the last ref drops */ williamr@2: (struct radix_node *rn, struct radix_node_head *head); williamr@2: struct radix_node rnh_nodes[3]; /* empty tree for common case */ williamr@2: #ifdef _KERNEL williamr@2: struct mtx rnh_mtx; /* locks entire radix tree */ williamr@2: #endif williamr@2: }; williamr@2: williamr@2: #ifndef _KERNEL williamr@2: #define R_Malloc(p, t, n) (p = (t) malloc((unsigned int)(n))) williamr@2: #define R_Zalloc(p, t, n) (p = (t) calloc(1,(unsigned int)(n))) williamr@2: #ifndef __SYMBIAN32__ williamr@2: #define Free(p) free((char *)p); williamr@2: #endif williamr@2: #else williamr@2: #define R_Malloc(p, t, n) (p = (t) malloc((unsigned long)(n), M_RTABLE, M_NOWAIT)) williamr@2: #define R_Zalloc(p, t, n) (p = (t) malloc((unsigned long)(n), M_RTABLE, M_NOWAIT | M_ZERO)) williamr@2: #ifndef __SYMBIAN32__ williamr@2: #define Free(p) free((caddr_t)p, M_RTABLE); williamr@2: #endif williamr@2: #define RADIX_NODE_HEAD_LOCK_INIT(rnh) \ williamr@2: mtx_init(&(rnh)->rnh_mtx, "radix node head", NULL, MTX_DEF | MTX_RECURSE) williamr@2: #define RADIX_NODE_HEAD_LOCK(rnh) mtx_lock(&(rnh)->rnh_mtx) williamr@2: #define RADIX_NODE_HEAD_UNLOCK(rnh) mtx_unlock(&(rnh)->rnh_mtx) williamr@2: #define RADIX_NODE_HEAD_DESTROY(rnh) mtx_destroy(&(rnh)->rnh_mtx) williamr@2: #define RADIX_NODE_HEAD_LOCK_ASSERT(rnh) mtx_assert(&(rnh)->rnh_mtx, MA_OWNED) williamr@2: #endif /* _KERNEL */ williamr@2: williamr@2: struct radix_node williamr@2: *rn_addmask(void *, int, int), williamr@2: *rn_addroute (void *, void *, struct radix_node_head *, williamr@2: struct radix_node [2]), williamr@2: *rn_delete(void *, void *, struct radix_node_head *), williamr@2: *rn_lookup (void *v_arg, void *m_arg, williamr@2: struct radix_node_head *head), williamr@2: *rn_match(void *, struct radix_node_head *); williamr@2: #endif //__SYMBIAN32__ williamr@2: #endif /* _RADIX_H_ */