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