| 207 |
mateuszvis |
1 |
/*!\file net/radix.h
|
|
|
2 |
* Radix search trees.
|
|
|
3 |
*/
|
|
|
4 |
|
|
|
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 |
/*
|
|
|
46 |
* Radix search tree node layout.
|
|
|
47 |
*/
|
|
|
48 |
|
|
|
49 |
struct radix_node {
|
|
|
50 |
struct radix_mask *rn_mklist; /* list of masks contained in subtree */
|
|
|
51 |
struct radix_node *rn_p; /* parent */
|
|
|
52 |
short rn_b; /* bit offset; -1-index(netmask) */
|
|
|
53 |
char rn_bmask; /* node: mask for bit test*/
|
|
|
54 |
u_char rn_flags; /* enumerated next */
|
|
|
55 |
#define RNF_NORMAL 1 /* leaf contains normal route */
|
|
|
56 |
#define RNF_ROOT 2 /* leaf is root leaf for tree */
|
|
|
57 |
#define RNF_ACTIVE 4 /* This node is alive (for rtfree) */
|
|
|
58 |
union {
|
|
|
59 |
struct { /* leaf only data: */
|
|
|
60 |
caddr_t rn_Key; /* object of search */
|
|
|
61 |
caddr_t rn_Mask; /* netmask, if present */
|
|
|
62 |
struct radix_node *rn_Dupedkey;
|
|
|
63 |
} rn_leaf;
|
|
|
64 |
struct { /* node only data: */
|
|
|
65 |
int rn_Off; /* where to start compare */
|
|
|
66 |
struct radix_node *rn_L;/* progeny */
|
|
|
67 |
struct radix_node *rn_R;/* progeny */
|
|
|
68 |
} rn_node;
|
|
|
69 |
} rn_u;
|
|
|
70 |
#ifdef RN_DEBUG
|
|
|
71 |
int rn_info;
|
|
|
72 |
struct radix_node *rn_twin;
|
|
|
73 |
struct radix_node *rn_ybro;
|
|
|
74 |
#endif
|
|
|
75 |
};
|
|
|
76 |
|
|
|
77 |
#define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey
|
|
|
78 |
#define rn_key rn_u.rn_leaf.rn_Key
|
|
|
79 |
#define rn_mask rn_u.rn_leaf.rn_Mask
|
|
|
80 |
#define rn_off rn_u.rn_node.rn_Off
|
|
|
81 |
#define rn_l rn_u.rn_node.rn_L
|
|
|
82 |
#define rn_r rn_u.rn_node.rn_R
|
|
|
83 |
|
|
|
84 |
/*
|
|
|
85 |
* Annotations to tree concerning potential routes applying to subtrees.
|
|
|
86 |
*/
|
|
|
87 |
|
|
|
88 |
extern struct radix_mask {
|
|
|
89 |
short rm_b; /* bit offset; -1-index(netmask) */
|
|
|
90 |
char rm_unused; /* cf. rn_bmask */
|
|
|
91 |
u_char rm_flags; /* cf. rn_flags */
|
|
|
92 |
struct radix_mask *rm_mklist; /* more masks to try */
|
|
|
93 |
union {
|
|
|
94 |
caddr_t rmu_mask; /* the mask */
|
|
|
95 |
struct radix_node *rmu_leaf; /* for normal routes */
|
|
|
96 |
} rm_rmu;
|
|
|
97 |
int rm_refs; /* # of references to this struct */
|
|
|
98 |
} *rn_mkfreelist;
|
|
|
99 |
|
|
|
100 |
#define rm_mask rm_rmu.rmu_mask
|
|
|
101 |
#define rm_leaf rm_rmu.rmu_leaf /* extra field would make 32 bytes */
|
|
|
102 |
|
|
|
103 |
#define MKGet(m) {\
|
|
|
104 |
if (rn_mkfreelist) {\
|
|
|
105 |
m = rn_mkfreelist; \
|
|
|
106 |
rn_mkfreelist = (m)->rm_mklist; \
|
|
|
107 |
} else \
|
|
|
108 |
R_Malloc(m, struct radix_mask *, sizeof (*(m))); }\
|
|
|
109 |
|
|
|
110 |
#define MKFree(m) { (m)->rm_mklist = rn_mkfreelist; rn_mkfreelist = (m);}
|
|
|
111 |
|
|
|
112 |
struct radix_node_head {
|
|
|
113 |
struct radix_node *rnh_treetop;
|
|
|
114 |
int rnh_addrsize; /* permit, but not require fixed keys */
|
|
|
115 |
int rnh_pktsize; /* permit, but not require fixed keys */
|
|
|
116 |
struct radix_node *(*rnh_addaddr) /* add based on sockaddr */
|
|
|
117 |
__P((void *v, void *mask,
|
|
|
118 |
struct radix_node_head *head, struct radix_node nodes[]));
|
|
|
119 |
struct radix_node *(*rnh_addpkt) /* add based on packet hdr */
|
|
|
120 |
__P((void *v, void *mask,
|
|
|
121 |
struct radix_node_head *head, struct radix_node nodes[]));
|
|
|
122 |
struct radix_node *(*rnh_deladdr) /* remove based on sockaddr */
|
|
|
123 |
__P((void *v, void *mask, struct radix_node_head *head));
|
|
|
124 |
struct radix_node *(*rnh_delpkt) /* remove based on packet hdr */
|
|
|
125 |
__P((void *v, void *mask, struct radix_node_head *head));
|
|
|
126 |
struct radix_node *(*rnh_matchaddr) /* locate based on sockaddr */
|
|
|
127 |
__P((void *v, struct radix_node_head *head));
|
|
|
128 |
struct radix_node *(*rnh_lookup) /* locate based on sockaddr */
|
|
|
129 |
__P((void *v, void *mask, struct radix_node_head *head));
|
|
|
130 |
struct radix_node *(*rnh_matchpkt) /* locate based on packet hdr */
|
|
|
131 |
__P((void *v, struct radix_node_head *head));
|
|
|
132 |
int (*rnh_walktree) /* traverse tree */
|
|
|
133 |
__P((struct radix_node_head *,
|
|
|
134 |
int (*)(struct radix_node *, void *), void *));
|
|
|
135 |
struct radix_node rnh_nodes[3]; /* empty tree for common case */
|
|
|
136 |
};
|
|
|
137 |
|
|
|
138 |
|
|
|
139 |
#define Bcmp(a,b,n) memcmp (a,b,n)
|
|
|
140 |
#define Bcopy(a,b,n) memcpy (b,a,n)
|
|
|
141 |
#define Bzero(p,n) memset ((void*)(p),0,(int)(n));
|
|
|
142 |
#define R_Malloc(p,t,n) (p = (t) malloc((unsigned int)(n)))
|
|
|
143 |
#define Free(p) free ((void*)p);
|
|
|
144 |
|
|
|
145 |
__BEGIN_DECLS
|
|
|
146 |
|
|
|
147 |
void rn_init (void);
|
|
|
148 |
int rn_inithead (void **, int);
|
|
|
149 |
int rn_refines (void *, void *);
|
|
|
150 |
int rn_walktree (struct radix_node_head *,
|
|
|
151 |
int (*)(struct radix_node *, void *),
|
|
|
152 |
void *);
|
|
|
153 |
|
|
|
154 |
struct radix_node *rn_addroute (void *, void *, struct radix_node_head *, struct radix_node [2]);
|
|
|
155 |
struct radix_node *rn_insert (void *, struct radix_node_head *, int *, struct radix_node [2]);
|
|
|
156 |
struct radix_node *rn_newpair (void *, int, struct radix_node[2]);
|
|
|
157 |
|
|
|
158 |
struct radix_node *rn_addmask (void *, int, int);
|
|
|
159 |
struct radix_node *rn_delete (void *, void *, struct radix_node_head *);
|
|
|
160 |
struct radix_node *rn_lookup (void *, void *, struct radix_node_head *);
|
|
|
161 |
struct radix_node *rn_match (void *, struct radix_node_head *);
|
|
|
162 |
struct radix_node *rn_search (void *, struct radix_node *);
|
|
|
163 |
struct radix_node *rn_search_m (void *, struct radix_node *, void *);
|
|
|
164 |
|
|
|
165 |
__END_DECLS
|
|
|
166 |
|
|
|
167 |
#endif /* _NET_RADIX_H_ */
|