Home | History | Annotate | Line # | Download | only in net
radix.h revision 1.2 
      1 /*
      2  * Copyright (c) 1988, 1989 Regents of the University of California.
      3  * All rights reserved.
      4  *
      5  * Redistribution and use in source and binary forms, with or without
      6  * modification, are permitted provided that the following conditions
      7  * are met:
      8  * 1. Redistributions of source code must retain the above copyright
      9  *    notice, this list of conditions and the following disclaimer.
     10  * 2. Redistributions in binary form must reproduce the above copyright
     11  *    notice, this list of conditions and the following disclaimer in the
     12  *    documentation and/or other materials provided with the distribution.
     13  * 3. All advertising materials mentioning features or use of this software
     14  *    must display the following acknowledgement:
     15  *	This product includes software developed by the University of
     16  *	California, Berkeley and its contributors.
     17  * 4. Neither the name of the University nor the names of its contributors
     18  *    may be used to endorse or promote products derived from this software
     19  *    without specific prior written permission.
     20  *
     21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  * SUCH DAMAGE.
     32  *
     33  *	@(#)radix.h	7.4 (Berkeley) 6/28/90
     34  */
     35 
     36 #ifndef _NET_RADIX_H_
     37 #define _NET_RADIX_H_
     38 
     39 /*
     40  * Radix search tree node layout.
     41  */
     42 
     43 struct radix_node {
     44 	struct	radix_mask *rn_mklist;	/* list of masks contained in subtree */
     45 	struct	radix_node *rn_p;	/* parent */
     46 	short	rn_b;			/* bit offset; -1-index(netmask) */
     47 	char	rn_bmask;		/* node: mask for bit test*/
     48 	u_char	rn_flags;		/* enumerated next */
     49 #define RNF_NORMAL	1		/* leaf contains normal route */
     50 #define RNF_ROOT	2		/* leaf is root leaf for tree */
     51 #define RNF_ACTIVE	4		/* This node is alive (for rtfree) */
     52 	union {
     53 		struct {			/* leaf only data: */
     54 			caddr_t	rn_Key;	/* object of search */
     55 			caddr_t	rn_Mask;	/* netmask, if present */
     56 			struct	radix_node *rn_Dupedkey;
     57 		} rn_leaf;
     58 		struct {			/* node only data: */
     59 			int	rn_Off;		/* where to start compare */
     60 			struct	radix_node *rn_L;/* progeny */
     61 			struct	radix_node *rn_R;/* progeny */
     62 		}rn_node;
     63 	}		rn_u;
     64 #ifdef RN_DEBUG
     65 	int rn_info;
     66 	struct radix_node *rn_twin;
     67 	struct radix_node *rn_ybro;
     68 #endif
     69 };
     70 
     71 #define MAXKEYLEN 32
     72 
     73 #define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey
     74 #define rn_key rn_u.rn_leaf.rn_Key
     75 #define rn_mask rn_u.rn_leaf.rn_Mask
     76 #define rn_off rn_u.rn_node.rn_Off
     77 #define rn_l rn_u.rn_node.rn_L
     78 #define rn_r rn_u.rn_node.rn_R
     79 
     80 /*
     81  * Annotations to tree concerning potential routes applying to subtrees.
     82  */
     83 
     84 extern struct radix_mask {
     85 	short	rm_b;			/* bit offset; -1-index(netmask) */
     86 	char	rm_unused;		/* cf. rn_bmask */
     87 	u_char	rm_flags;		/* cf. rn_flags */
     88 	struct	radix_mask *rm_mklist;	/* more masks to try */
     89 	caddr_t	rm_mask;		/* the mask */
     90 	int	rm_refs;		/* # of references to this struct */
     91 } *rn_mkfreelist;
     92 
     93 #define MKGet(m) {\
     94 	if (rn_mkfreelist) {\
     95 		m = rn_mkfreelist; \
     96 		rn_mkfreelist = (m)->rm_mklist; \
     97 	} else \
     98 		R_Malloc(m, struct radix_mask *, sizeof (*(m))); }\
     99 
    100 #define MKFree(m) { (m)->rm_mklist = rn_mkfreelist; rn_mkfreelist = (m);}
    101 
    102 extern struct radix_node_head {
    103 	struct	radix_node_head *rnh_next;
    104 	struct	radix_node *rnh_treetop;
    105 	int	rnh_af;
    106 	struct	radix_node rnh_nodes[3];
    107 } *radix_node_head;
    108 
    109 
    110 #ifndef KERNEL
    111 #define Bcmp(a, b, n) bcmp(((char *)(a)), ((char *)(b)), (n))
    112 #define Bzero(p, n) bzero((char *)(p), (int)(n));
    113 #define R_Malloc(p, t, n) (p = (t) malloc((unsigned int)(n)))
    114 #define Free(p) free((char *)p);
    115 #else
    116 #define Bcmp(a, b, n) bcmp(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n))
    117 #define Bcopy(a, b, n) bcopy(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n))
    118 #define Bzero(p, n) bzero((caddr_t)(p), (unsigned)(n));
    119 #define R_Malloc(p, t, n) (p = (t) malloc((unsigned long)(n), M_RTABLE, M_DONTWAIT))
    120 #define Free(p) free((caddr_t)p, M_RTABLE);
    121 #endif /*KERNEL*/
    122 
    123 #endif /* !_NET_RADIX_H_ */
    124