|
sl@0
|
1 |
/*-
|
|
sl@0
|
2 |
* Copyright (c) 1988, 1989, 1993
|
|
sl@0
|
3 |
* The Regents of the University of California. All rights reserved.
|
|
sl@0
|
4 |
* Redistribution and use in source and binary forms, with or without
|
|
sl@0
|
5 |
* modification, are permitted provided that the following conditions
|
|
sl@0
|
6 |
* are met:
|
|
sl@0
|
7 |
* 1. Redistributions of source code must retain the above copyright
|
|
sl@0
|
8 |
* notice, this list of conditions and the following disclaimer.
|
|
sl@0
|
9 |
* 2. Redistributions in binary form must reproduce the above copyright
|
|
sl@0
|
10 |
* notice, this list of conditions and the following disclaimer in the
|
|
sl@0
|
11 |
* documentation and/or other materials provided with the distribution.
|
|
sl@0
|
12 |
* 4. Neither the name of the University nor the names of its contributors
|
|
sl@0
|
13 |
* may be used to endorse or promote products derived from this software
|
|
sl@0
|
14 |
* without specific prior written permission.
|
|
sl@0
|
15 |
*
|
|
sl@0
|
16 |
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
sl@0
|
17 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
sl@0
|
18 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
sl@0
|
19 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
sl@0
|
20 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
sl@0
|
21 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
sl@0
|
22 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
sl@0
|
23 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
sl@0
|
24 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
sl@0
|
25 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
sl@0
|
26 |
* SUCH DAMAGE.
|
|
sl@0
|
27 |
*
|
|
sl@0
|
28 |
* Portions Copyright (c) 2007 Nokia Corporation and/or its subsidiary(-ies). All rights reserved.
|
|
sl@0
|
29 |
* @(#)radix.h 8.2 (Berkeley) 10/31/94
|
|
sl@0
|
30 |
* $FreeBSD: src/sys/net/radix.h,v 1.26 2005/01/07 01:45:35 imp Exp $
|
|
sl@0
|
31 |
*/
|
|
sl@0
|
32 |
|
|
sl@0
|
33 |
#ifndef _RADIX_H_
|
|
sl@0
|
34 |
#define _RADIX_H_
|
|
sl@0
|
35 |
|
|
sl@0
|
36 |
#ifdef _KERNEL
|
|
sl@0
|
37 |
#include <sys/_lock.h>
|
|
sl@0
|
38 |
#include <sys/_mutex.h>
|
|
sl@0
|
39 |
#endif
|
|
sl@0
|
40 |
|
|
sl@0
|
41 |
/*
|
|
sl@0
|
42 |
* Radix search tree node layout.
|
|
sl@0
|
43 |
*/
|
|
sl@0
|
44 |
|
|
sl@0
|
45 |
struct radix_node {
|
|
sl@0
|
46 |
struct radix_mask *rn_mklist; /* list of masks contained in subtree */
|
|
sl@0
|
47 |
struct radix_node *rn_parent; /* parent */
|
|
sl@0
|
48 |
short rn_bit; /* bit offset; -1-index(netmask) */
|
|
sl@0
|
49 |
char rn_bmask; /* node: mask for bit test*/
|
|
sl@0
|
50 |
u_char rn_flags; /* enumerated next */
|
|
sl@0
|
51 |
#define RNF_NORMAL 1 /* leaf contains normal route */
|
|
sl@0
|
52 |
#define RNF_ROOT 2 /* leaf is root leaf for tree */
|
|
sl@0
|
53 |
#define RNF_ACTIVE 4 /* This node is alive (for rtfree) */
|
|
sl@0
|
54 |
union {
|
|
sl@0
|
55 |
struct { /* leaf only data: */
|
|
sl@0
|
56 |
caddr_t rn_Key; /* object of search */
|
|
sl@0
|
57 |
caddr_t rn_Mask; /* netmask, if present */
|
|
sl@0
|
58 |
struct radix_node *rn_Dupedkey;
|
|
sl@0
|
59 |
} rn_leaf;
|
|
sl@0
|
60 |
struct { /* node only data: */
|
|
sl@0
|
61 |
int rn_Off; /* where to start compare */
|
|
sl@0
|
62 |
struct radix_node *rn_L;/* progeny */
|
|
sl@0
|
63 |
struct radix_node *rn_R;/* progeny */
|
|
sl@0
|
64 |
} rn_node;
|
|
sl@0
|
65 |
} rn_u;
|
|
sl@0
|
66 |
#ifdef RN_DEBUG
|
|
sl@0
|
67 |
int rn_info;
|
|
sl@0
|
68 |
struct radix_node *rn_twin;
|
|
sl@0
|
69 |
struct radix_node *rn_ybro;
|
|
sl@0
|
70 |
#endif
|
|
sl@0
|
71 |
};
|
|
sl@0
|
72 |
|
|
sl@0
|
73 |
#define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey
|
|
sl@0
|
74 |
#define rn_key rn_u.rn_leaf.rn_Key
|
|
sl@0
|
75 |
#define rn_mask rn_u.rn_leaf.rn_Mask
|
|
sl@0
|
76 |
#define rn_offset rn_u.rn_node.rn_Off
|
|
sl@0
|
77 |
#define rn_left rn_u.rn_node.rn_L
|
|
sl@0
|
78 |
#define rn_right rn_u.rn_node.rn_R
|
|
sl@0
|
79 |
|
|
sl@0
|
80 |
/*
|
|
sl@0
|
81 |
* Annotations to tree concerning potential routes applying to subtrees.
|
|
sl@0
|
82 |
*/
|
|
sl@0
|
83 |
|
|
sl@0
|
84 |
struct radix_mask {
|
|
sl@0
|
85 |
short rm_bit; /* bit offset; -1-index(netmask) */
|
|
sl@0
|
86 |
char rm_unused; /* cf. rn_bmask */
|
|
sl@0
|
87 |
u_char rm_flags; /* cf. rn_flags */
|
|
sl@0
|
88 |
struct radix_mask *rm_mklist; /* more masks to try */
|
|
sl@0
|
89 |
union {
|
|
sl@0
|
90 |
caddr_t rmu_mask; /* the mask */
|
|
sl@0
|
91 |
struct radix_node *rmu_leaf; /* for normal routes */
|
|
sl@0
|
92 |
} rm_rmu;
|
|
sl@0
|
93 |
int rm_refs; /* # of references to this struct */
|
|
sl@0
|
94 |
};
|
|
sl@0
|
95 |
|
|
sl@0
|
96 |
#define rm_mask rm_rmu.rmu_mask
|
|
sl@0
|
97 |
#define rm_leaf rm_rmu.rmu_leaf /* extra field would make 32 bytes */
|
|
sl@0
|
98 |
|
|
sl@0
|
99 |
#ifndef __SYMBIAN32__
|
|
sl@0
|
100 |
typedef int walktree_f_t(struct radix_node *, void *);
|
|
sl@0
|
101 |
|
|
sl@0
|
102 |
struct radix_node_head {
|
|
sl@0
|
103 |
struct radix_node *rnh_treetop;
|
|
sl@0
|
104 |
int rnh_addrsize; /* permit, but not require fixed keys */
|
|
sl@0
|
105 |
int rnh_pktsize; /* permit, but not require fixed keys */
|
|
sl@0
|
106 |
struct radix_node *(*rnh_addaddr) /* add based on sockaddr */
|
|
sl@0
|
107 |
(void *v, void *mask,
|
|
sl@0
|
108 |
struct radix_node_head *head, struct radix_node nodes[]);
|
|
sl@0
|
109 |
struct radix_node *(*rnh_addpkt) /* add based on packet hdr */
|
|
sl@0
|
110 |
(void *v, void *mask,
|
|
sl@0
|
111 |
struct radix_node_head *head, struct radix_node nodes[]);
|
|
sl@0
|
112 |
struct radix_node *(*rnh_deladdr) /* remove based on sockaddr */
|
|
sl@0
|
113 |
(void *v, void *mask, struct radix_node_head *head);
|
|
sl@0
|
114 |
struct radix_node *(*rnh_delpkt) /* remove based on packet hdr */
|
|
sl@0
|
115 |
(void *v, void *mask, struct radix_node_head *head);
|
|
sl@0
|
116 |
struct radix_node *(*rnh_matchaddr) /* locate based on sockaddr */
|
|
sl@0
|
117 |
(void *v, struct radix_node_head *head);
|
|
sl@0
|
118 |
struct radix_node *(*rnh_lookup) /* locate based on sockaddr */
|
|
sl@0
|
119 |
(void *v, void *mask, struct radix_node_head *head);
|
|
sl@0
|
120 |
struct radix_node *(*rnh_matchpkt) /* locate based on packet hdr */
|
|
sl@0
|
121 |
(void *v, struct radix_node_head *head);
|
|
sl@0
|
122 |
int (*rnh_walktree) /* traverse tree */
|
|
sl@0
|
123 |
(struct radix_node_head *head, walktree_f_t *f, void *w);
|
|
sl@0
|
124 |
int (*rnh_walktree_from) /* traverse tree below a */
|
|
sl@0
|
125 |
(struct radix_node_head *head, void *a, void *m,
|
|
sl@0
|
126 |
walktree_f_t *f, void *w);
|
|
sl@0
|
127 |
void (*rnh_close) /* do something when the last ref drops */
|
|
sl@0
|
128 |
(struct radix_node *rn, struct radix_node_head *head);
|
|
sl@0
|
129 |
struct radix_node rnh_nodes[3]; /* empty tree for common case */
|
|
sl@0
|
130 |
#ifdef _KERNEL
|
|
sl@0
|
131 |
struct mtx rnh_mtx; /* locks entire radix tree */
|
|
sl@0
|
132 |
#endif
|
|
sl@0
|
133 |
};
|
|
sl@0
|
134 |
|
|
sl@0
|
135 |
#ifndef _KERNEL
|
|
sl@0
|
136 |
#define R_Malloc(p, t, n) (p = (t) malloc((unsigned int)(n)))
|
|
sl@0
|
137 |
#define R_Zalloc(p, t, n) (p = (t) calloc(1,(unsigned int)(n)))
|
|
sl@0
|
138 |
#ifndef __SYMBIAN32__
|
|
sl@0
|
139 |
#define Free(p) free((char *)p);
|
|
sl@0
|
140 |
#endif
|
|
sl@0
|
141 |
#else
|
|
sl@0
|
142 |
#define R_Malloc(p, t, n) (p = (t) malloc((unsigned long)(n), M_RTABLE, M_NOWAIT))
|
|
sl@0
|
143 |
#define R_Zalloc(p, t, n) (p = (t) malloc((unsigned long)(n), M_RTABLE, M_NOWAIT | M_ZERO))
|
|
sl@0
|
144 |
#ifndef __SYMBIAN32__
|
|
sl@0
|
145 |
#define Free(p) free((caddr_t)p, M_RTABLE);
|
|
sl@0
|
146 |
#endif
|
|
sl@0
|
147 |
#define RADIX_NODE_HEAD_LOCK_INIT(rnh) \
|
|
sl@0
|
148 |
mtx_init(&(rnh)->rnh_mtx, "radix node head", NULL, MTX_DEF | MTX_RECURSE)
|
|
sl@0
|
149 |
#define RADIX_NODE_HEAD_LOCK(rnh) mtx_lock(&(rnh)->rnh_mtx)
|
|
sl@0
|
150 |
#define RADIX_NODE_HEAD_UNLOCK(rnh) mtx_unlock(&(rnh)->rnh_mtx)
|
|
sl@0
|
151 |
#define RADIX_NODE_HEAD_DESTROY(rnh) mtx_destroy(&(rnh)->rnh_mtx)
|
|
sl@0
|
152 |
#define RADIX_NODE_HEAD_LOCK_ASSERT(rnh) mtx_assert(&(rnh)->rnh_mtx, MA_OWNED)
|
|
sl@0
|
153 |
#endif /* _KERNEL */
|
|
sl@0
|
154 |
|
|
sl@0
|
155 |
struct radix_node
|
|
sl@0
|
156 |
*rn_addmask(void *, int, int),
|
|
sl@0
|
157 |
*rn_addroute (void *, void *, struct radix_node_head *,
|
|
sl@0
|
158 |
struct radix_node [2]),
|
|
sl@0
|
159 |
*rn_delete(void *, void *, struct radix_node_head *),
|
|
sl@0
|
160 |
*rn_lookup (void *v_arg, void *m_arg,
|
|
sl@0
|
161 |
struct radix_node_head *head),
|
|
sl@0
|
162 |
*rn_match(void *, struct radix_node_head *);
|
|
sl@0
|
163 |
#endif //__SYMBIAN32__
|
|
sl@0
|
164 |
#endif /* _RADIX_H_ */
|