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