[thirdparty/squid.git] / include / radix.h

/*
 * Copyright (c) 1988, 1989, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *	This product includes software developed by the University of
 *	California, Berkeley and its contributors.
 * 4. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 *	@(#)radix.h	8.2 (Berkeley) 10/31/94
 */

#ifndef _RADIX_H_
#define	_RADIX_H_
#undef RN_DEBUG
/*
 * Radix search tree node layout.
 */

struct radix_node {
	struct	radix_mask *rn_mklist;	/* list of masks contained in subtree */
	struct	radix_node *rn_p;	/* parent */
	short	rn_b;			/* bit offset; -1-index(netmask) */
	char	rn_bmask;		/* node: mask for bit test*/
	u_char	rn_flags;		/* enumerated next */
#define RNF_NORMAL	1		/* leaf contains normal route */
#define RNF_ROOT	2		/* leaf is root leaf for tree */
#define RNF_ACTIVE	4		/* This node is alive (for rtfree) */
	union {
		struct {			/* leaf only data: */
			caddr_t	rn_Key;	/* object of search */
			caddr_t	rn_Mask;	/* netmask, if present */
			struct	radix_node *rn_Dupedkey;
		} rn_leaf;
		struct {			/* node only data: */
			int	rn_Off;		/* where to start compare */
			struct	radix_node *rn_L;/* progeny */
			struct	radix_node *rn_R;/* progeny */
		}rn_node;
	}		rn_u;
#ifdef RN_DEBUG
	int rn_info;
	struct radix_node *rn_twin;
	struct radix_node *rn_ybro;
#endif
};

#define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey
#define rn_key rn_u.rn_leaf.rn_Key
#define rn_mask rn_u.rn_leaf.rn_Mask
#define rn_off rn_u.rn_node.rn_Off
#define rn_l rn_u.rn_node.rn_L
#define rn_r rn_u.rn_node.rn_R

/*
 * Annotations to tree concerning potential routes applying to subtrees.
 */

extern struct radix_mask {
	short	rm_b;			/* bit offset; -1-index(netmask) */
	char	rm_unused;		/* cf. rn_bmask */
	u_char	rm_flags;		/* cf. rn_flags */
	struct	radix_mask *rm_mklist;	/* more masks to try */
	union	{
		caddr_t	rmu_mask;		/* the mask */
		struct	radix_node *rmu_leaf;	/* for normal routes */
	}	rm_rmu;
	int	rm_refs;		/* # of references to this struct */
} *rn_mkfreelist;

#define rm_mask rm_rmu.rmu_mask
#define rm_leaf rm_rmu.rmu_leaf		/* extra field would make 32 bytes */

#define MKGet(m) {\
	if (rn_mkfreelist) {\
		m = rn_mkfreelist; \
		rn_mkfreelist = (m)->rm_mklist; \
	} else \
		R_Malloc(m, struct radix_mask *, sizeof (*(m))); }\

#define MKFree(m) { (m)->rm_mklist = rn_mkfreelist; rn_mkfreelist = (m);}

struct radix_node_head {
	struct	radix_node *rnh_treetop;
	int	rnh_addrsize;		/* permit, but not require fixed keys */
	int	rnh_pktsize;		/* permit, but not require fixed keys */
	struct	radix_node *(*rnh_addaddr)	/* add based on sockaddr */
		__P((void *v, void *mask,
		     struct radix_node_head *head, struct radix_node nodes[]));
	struct	radix_node *(*rnh_addpkt)	/* add based on packet hdr */
		__P((void *v, void *mask,
		     struct radix_node_head *head, struct radix_node nodes[]));
	struct	radix_node *(*rnh_deladdr)	/* remove based on sockaddr */
		__P((void *v, void *mask, struct radix_node_head *head));
	struct	radix_node *(*rnh_delpkt)	/* remove based on packet hdr */
		__P((void *v, void *mask, struct radix_node_head *head));
	struct	radix_node *(*rnh_matchaddr)	/* locate based on sockaddr */
		__P((void *v, struct radix_node_head *head));
	struct	radix_node *(*rnh_lookup)	/* locate based on sockaddr */
		__P((void *v, void *mask, struct radix_node_head *head));
	struct	radix_node *(*rnh_matchpkt)	/* locate based on packet hdr */
		__P((void *v, struct radix_node_head *head));
	int	(*rnh_walktree)			/* traverse tree */
		__P((struct radix_node_head *head, int (*f)(), void *w));
	struct	radix_node rnh_nodes[3];	/* empty tree for common case */
};


#ifndef KERNEL
#define Bcmp(a, b, n) bcmp(((char *)(a)), ((char *)(b)), (n))
#define Bcopy(a, b, n) bcopy(((char *)(a)), ((char *)(b)), (unsigned)(n))
#define Bzero(p, n) bzero((char *)(p), (int)(n));
#define R_Malloc(p, t, n) (p = (t) malloc((unsigned int)(n)))
#define Free(p) free((char *)p);
#else
#define Bcmp(a, b, n) bcmp(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n))
#define Bcopy(a, b, n) bcopy(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n))
#define Bzero(p, n) bzero((caddr_t)(p), (unsigned)(n));
#define R_Malloc(p, t, n) (p = (t) malloc((unsigned long)(n), M_RTABLE, M_DONTWAIT))
#define Free(p) free((caddr_t)p, M_RTABLE);
#endif /*KERNEL*/

void	 rn_init __P((void));
int	 rn_inithead __P((void **, int));
int	 rn_refines __P((void *, void *));
int	 rn_walktree __P((struct radix_node_head *, int (*)(), void *));
struct radix_node
	 *rn_addmask __P((void *, int, int)),
	 *rn_addroute __P((void *, void *, struct radix_node_head *,
			struct radix_node [2])),
	 *rn_delete __P((void *, void *, struct radix_node_head *)),
	 *rn_insert __P((void *, struct radix_node_head *, int *,
			struct radix_node [2])),
	 *rn_match __P((void *, struct radix_node_head *)),
	 *rn_newpair __P((void *, int, struct radix_node[2])),
	 *rn_search __P((void *, struct radix_node *)),
	 *rn_search_m __P((void *, struct radix_node *, void *));

#define min(x,y) ((x)<(y)? (x) : (y))
#endif /* _RADIX_H_ */
Commit	Line	Data
86b7a908	1	/*
	2	* Copyright (c) 1988, 1989, 1993
	3	* The Regents of the University of California. 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 8.2 (Berkeley) 10/31/94
	34	*/
	35
	36	#ifndef _RADIX_H_
	37	#define _RADIX_H_
	38	#undef RN_DEBUG
	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 rn_dupedkey rn_u.rn_leaf.rn_Dupedkey
72	#define rn_key rn_u.rn_leaf.rn_Key
73	#define rn_mask rn_u.rn_leaf.rn_Mask
74	#define rn_off rn_u.rn_node.rn_Off
75	#define rn_l rn_u.rn_node.rn_L
76	#define rn_r rn_u.rn_node.rn_R
77
78	/*
79	* Annotations to tree concerning potential routes applying to subtrees.
80	*/
81
82	extern struct radix_mask {
83	short rm_b; /* bit offset; -1-index(netmask) */
84	char rm_unused; /* cf. rn_bmask */
85	u_char rm_flags; /* cf. rn_flags */
86	struct radix_mask rm_mklist; / more masks to try */
87	union {
88	caddr_t rmu_mask; /* the mask */
89	struct radix_node rmu_leaf; / for normal routes */
90	} rm_rmu;
91	int rm_refs; /* # of references to this struct */
92	} *rn_mkfreelist;
93
94	#define rm_mask rm_rmu.rmu_mask
95	#define rm_leaf rm_rmu.rmu_leaf /* extra field would make 32 bytes */
96
97	#define MKGet(m) {\
98	if (rn_mkfreelist) {\
99	m = rn_mkfreelist; \
100	rn_mkfreelist = (m)->rm_mklist; \
101	} else \
102	R_Malloc(m, struct radix_mask , sizeof ((m))); }\
103
104	#define MKFree(m) { (m)->rm_mklist = rn_mkfreelist; rn_mkfreelist = (m);}
105
106	struct radix_node_head {
107	struct radix_node *rnh_treetop;
108	int rnh_addrsize; /* permit, but not require fixed keys */
109	int rnh_pktsize; /* permit, but not require fixed keys */
110	struct radix_node (rnh_addaddr) /* add based on sockaddr */
111	__P((void v, void mask,
112	struct radix_node_head *head, struct radix_node nodes[]));
113	struct radix_node (rnh_addpkt) /* add based on packet hdr */
114	__P((void v, void mask,
115	struct radix_node_head *head, struct radix_node nodes[]));
116	struct radix_node (rnh_deladdr) /* remove based on sockaddr */
117	__P((void v, void mask, struct radix_node_head *head));
118	struct radix_node (rnh_delpkt) /* remove based on packet hdr */
119	__P((void v, void mask, struct radix_node_head *head));
120	struct radix_node (rnh_matchaddr) /* locate based on sockaddr */
121	__P((void v, struct radix_node_head head));
122	struct radix_node (rnh_lookup) /* locate based on sockaddr */
123	__P((void v, void mask, struct radix_node_head *head));
124	struct radix_node (rnh_matchpkt) /* locate based on packet hdr */
125	__P((void v, struct radix_node_head head));
126	int (rnh_walktree) / traverse tree */
127	__P((struct radix_node_head head, int (f)(), void *w));
128	struct radix_node rnh_nodes[3]; /* empty tree for common case */
129	};
130
131
132	#ifndef KERNEL
133	#define Bcmp(a, b, n) bcmp(((char )(a)), ((char )(b)), (n))
134	#define Bcopy(a, b, n) bcopy(((char )(a)), ((char )(b)), (unsigned)(n))
135	#define Bzero(p, n) bzero((char *)(p), (int)(n));
136	#define R_Malloc(p, t, n) (p = (t) malloc((unsigned int)(n)))
137	#define Free(p) free((char *)p);
138	#else
139	#define Bcmp(a, b, n) bcmp(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n))
140	#define Bcopy(a, b, n) bcopy(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n))
141	#define Bzero(p, n) bzero((caddr_t)(p), (unsigned)(n));
142	#define R_Malloc(p, t, n) (p = (t) malloc((unsigned long)(n), M_RTABLE, M_DONTWAIT))
143	#define Free(p) free((caddr_t)p, M_RTABLE);
144	#endif /KERNEL/
145
146	void rn_init __P((void));
147	int rn_inithead __P((void **, int));
148	int rn_refines __P((void , void ));
149	int rn_walktree __P((struct radix_node_head , int ()(), void *));
150	struct radix_node
151	rn_addmask __P((void , int, int)),
152	rn_addroute __P((void , void , struct radix_node_head ,
153	struct radix_node [2])),
154	rn_delete __P((void , void , struct radix_node_head )),
155	rn_insert __P((void , struct radix_node_head , int ,
156	struct radix_node [2])),
157	rn_match __P((void , struct radix_node_head *)),
158	rn_newpair __P((void , int, struct radix_node[2])),
159	rn_search __P((void , struct radix_node *)),
160	rn_search_m __P((void , struct radix_node , void ));
161
162	#define min(x,y) ((x)<(y)? (x) : (y))
163	#endif /* _RADIX_H_ */