1/*-
2 * Copyright (c) 2004 Ruslan Ermilov and Vsevolod Lobko.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
6 * are met:
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
12 *
13 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
14 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
16 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
17 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
18 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
19 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
20 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
21 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
22 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
23 * SUCH DAMAGE.
24 */
25
26#include <sys/cdefs.h>
| 1/*-
2 * Copyright (c) 2004 Ruslan Ermilov and Vsevolod Lobko.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
6 * are met:
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
12 *
13 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
14 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
16 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
17 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
18 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
19 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
20 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
21 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
22 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
23 * SUCH DAMAGE.
24 */
25
26#include <sys/cdefs.h>
|
69#include <netinet/ipfw/ip_fw_private.h>
70
71#ifdef MAC
72#include <security/mac/mac_framework.h>
73#endif
74
75MALLOC_DEFINE(M_IPFW_TBL, "ipfw_tbl", "IpFw tables");
76
77struct table_entry {
78 struct radix_node rn[2];
79 struct sockaddr_in addr, mask;
80 u_int32_t value;
81};
82
83/*
84 * The radix code expects addr and mask to be array of bytes,
85 * with the first byte being the length of the array. rn_inithead
86 * is called with the offset in bits of the lookup key within the
87 * array. If we use a sockaddr_in as the underlying type,
88 * sin_len is conveniently located at offset 0, sin_addr is at
89 * offset 4 and normally aligned.
90 * But for portability, let's avoid assumption and make the code explicit
91 */
92#define KEY_LEN(v) *((uint8_t *)&(v))
93#define KEY_OFS (8*offsetof(struct sockaddr_in, sin_addr))
94
95int
96ipfw_add_table_entry(struct ip_fw_chain *ch, uint16_t tbl, in_addr_t addr,
97 uint8_t mlen, uint32_t value)
98{
99 struct radix_node_head *rnh;
100 struct table_entry *ent;
101 struct radix_node *rn;
102
103 if (tbl >= IPFW_TABLES_MAX)
104 return (EINVAL);
105 rnh = ch->tables[tbl];
106 ent = malloc(sizeof(*ent), M_IPFW_TBL, M_NOWAIT | M_ZERO);
107 if (ent == NULL)
108 return (ENOMEM);
109 ent->value = value;
110 KEY_LEN(ent->addr) = KEY_LEN(ent->mask) = 8;
111 ent->mask.sin_addr.s_addr = htonl(mlen ? ~((1 << (32 - mlen)) - 1) : 0);
112 ent->addr.sin_addr.s_addr = addr & ent->mask.sin_addr.s_addr;
113 IPFW_WLOCK(ch);
114 rn = rnh->rnh_addaddr(&ent->addr, &ent->mask, rnh, (void *)ent);
115 if (rn == NULL) {
116 IPFW_WUNLOCK(ch);
117 free(ent, M_IPFW_TBL);
118 return (EEXIST);
119 }
120 IPFW_WUNLOCK(ch);
121 return (0);
122}
123
124int
125ipfw_del_table_entry(struct ip_fw_chain *ch, uint16_t tbl, in_addr_t addr,
126 uint8_t mlen)
127{
128 struct radix_node_head *rnh;
129 struct table_entry *ent;
130 struct sockaddr_in sa, mask;
131
132 if (tbl >= IPFW_TABLES_MAX)
133 return (EINVAL);
134 rnh = ch->tables[tbl];
135 KEY_LEN(sa) = KEY_LEN(mask) = 8;
136 mask.sin_addr.s_addr = htonl(mlen ? ~((1 << (32 - mlen)) - 1) : 0);
137 sa.sin_addr.s_addr = addr & mask.sin_addr.s_addr;
138 IPFW_WLOCK(ch);
139 ent = (struct table_entry *)rnh->rnh_deladdr(&sa, &mask, rnh);
140 if (ent == NULL) {
141 IPFW_WUNLOCK(ch);
142 return (ESRCH);
143 }
144 IPFW_WUNLOCK(ch);
145 free(ent, M_IPFW_TBL);
146 return (0);
147}
148
149static int
150flush_table_entry(struct radix_node *rn, void *arg)
151{
152 struct radix_node_head * const rnh = arg;
153 struct table_entry *ent;
154
155 ent = (struct table_entry *)
156 rnh->rnh_deladdr(rn->rn_key, rn->rn_mask, rnh);
157 if (ent != NULL)
158 free(ent, M_IPFW_TBL);
159 return (0);
160}
161
162int
163ipfw_flush_table(struct ip_fw_chain *ch, uint16_t tbl)
164{
165 struct radix_node_head *rnh;
166
167 IPFW_WLOCK_ASSERT(ch);
168
169 if (tbl >= IPFW_TABLES_MAX)
170 return (EINVAL);
171 rnh = ch->tables[tbl];
172 KASSERT(rnh != NULL, ("NULL IPFW table"));
173 rnh->rnh_walktree(rnh, flush_table_entry, rnh);
174 return (0);
175}
176
177void
178ipfw_flush_tables(struct ip_fw_chain *ch)
179{
180 uint16_t tbl;
181
182 IPFW_WLOCK_ASSERT(ch);
183
184 for (tbl = 0; tbl < IPFW_TABLES_MAX; tbl++)
185 ipfw_flush_table(ch, tbl);
186}
187
188int
189ipfw_init_tables(struct ip_fw_chain *ch)
190{
191 int i;
192 uint16_t j;
193
194 for (i = 0; i < IPFW_TABLES_MAX; i++) {
195 if (!rn_inithead((void **)&ch->tables[i], KEY_OFS)) {
196 for (j = 0; j < i; j++) {
197 (void) ipfw_flush_table(ch, j);
198 }
199 return (ENOMEM);
200 }
201 }
202 return (0);
203}
204
205int
206ipfw_lookup_table(struct ip_fw_chain *ch, uint16_t tbl, in_addr_t addr,
207 uint32_t *val)
208{
209 struct radix_node_head *rnh;
210 struct table_entry *ent;
211 struct sockaddr_in sa;
212
213 if (tbl >= IPFW_TABLES_MAX)
214 return (0);
215 rnh = ch->tables[tbl];
216 KEY_LEN(sa) = 8;
217 sa.sin_addr.s_addr = addr;
218 ent = (struct table_entry *)(rnh->rnh_lookup(&sa, NULL, rnh));
219 if (ent != NULL) {
220 *val = ent->value;
221 return (1);
222 }
223 return (0);
224}
225
226static int
227count_table_entry(struct radix_node *rn, void *arg)
228{
229 u_int32_t * const cnt = arg;
230
231 (*cnt)++;
232 return (0);
233}
234
235int
236ipfw_count_table(struct ip_fw_chain *ch, uint32_t tbl, uint32_t *cnt)
237{
238 struct radix_node_head *rnh;
239
240 if (tbl >= IPFW_TABLES_MAX)
241 return (EINVAL);
242 rnh = ch->tables[tbl];
243 *cnt = 0;
244 rnh->rnh_walktree(rnh, count_table_entry, cnt);
245 return (0);
246}
247
248static int
249dump_table_entry(struct radix_node *rn, void *arg)
250{
251 struct table_entry * const n = (struct table_entry *)rn;
252 ipfw_table * const tbl = arg;
253 ipfw_table_entry *ent;
254
255 if (tbl->cnt == tbl->size)
256 return (1);
257 ent = &tbl->ent[tbl->cnt];
258 ent->tbl = tbl->tbl;
259 if (in_nullhost(n->mask.sin_addr))
260 ent->masklen = 0;
261 else
262 ent->masklen = 33 - ffs(ntohl(n->mask.sin_addr.s_addr));
263 ent->addr = n->addr.sin_addr.s_addr;
264 ent->value = n->value;
265 tbl->cnt++;
266 return (0);
267}
268
269int
270ipfw_dump_table(struct ip_fw_chain *ch, ipfw_table *tbl)
271{
272 struct radix_node_head *rnh;
273
274 if (tbl->tbl >= IPFW_TABLES_MAX)
275 return (EINVAL);
276 rnh = ch->tables[tbl->tbl];
277 tbl->cnt = 0;
278 rnh->rnh_walktree(rnh, dump_table_entry, tbl);
279 return (0);
280}
281/* end of file */
| 70#include <netinet/ipfw/ip_fw_private.h>
71
72#ifdef MAC
73#include <security/mac/mac_framework.h>
74#endif
75
76MALLOC_DEFINE(M_IPFW_TBL, "ipfw_tbl", "IpFw tables");
77
78struct table_entry {
79 struct radix_node rn[2];
80 struct sockaddr_in addr, mask;
81 u_int32_t value;
82};
83
84/*
85 * The radix code expects addr and mask to be array of bytes,
86 * with the first byte being the length of the array. rn_inithead
87 * is called with the offset in bits of the lookup key within the
88 * array. If we use a sockaddr_in as the underlying type,
89 * sin_len is conveniently located at offset 0, sin_addr is at
90 * offset 4 and normally aligned.
91 * But for portability, let's avoid assumption and make the code explicit
92 */
93#define KEY_LEN(v) *((uint8_t *)&(v))
94#define KEY_OFS (8*offsetof(struct sockaddr_in, sin_addr))
95
96int
97ipfw_add_table_entry(struct ip_fw_chain *ch, uint16_t tbl, in_addr_t addr,
98 uint8_t mlen, uint32_t value)
99{
100 struct radix_node_head *rnh;
101 struct table_entry *ent;
102 struct radix_node *rn;
103
104 if (tbl >= IPFW_TABLES_MAX)
105 return (EINVAL);
106 rnh = ch->tables[tbl];
107 ent = malloc(sizeof(*ent), M_IPFW_TBL, M_NOWAIT | M_ZERO);
108 if (ent == NULL)
109 return (ENOMEM);
110 ent->value = value;
111 KEY_LEN(ent->addr) = KEY_LEN(ent->mask) = 8;
112 ent->mask.sin_addr.s_addr = htonl(mlen ? ~((1 << (32 - mlen)) - 1) : 0);
113 ent->addr.sin_addr.s_addr = addr & ent->mask.sin_addr.s_addr;
114 IPFW_WLOCK(ch);
115 rn = rnh->rnh_addaddr(&ent->addr, &ent->mask, rnh, (void *)ent);
116 if (rn == NULL) {
117 IPFW_WUNLOCK(ch);
118 free(ent, M_IPFW_TBL);
119 return (EEXIST);
120 }
121 IPFW_WUNLOCK(ch);
122 return (0);
123}
124
125int
126ipfw_del_table_entry(struct ip_fw_chain *ch, uint16_t tbl, in_addr_t addr,
127 uint8_t mlen)
128{
129 struct radix_node_head *rnh;
130 struct table_entry *ent;
131 struct sockaddr_in sa, mask;
132
133 if (tbl >= IPFW_TABLES_MAX)
134 return (EINVAL);
135 rnh = ch->tables[tbl];
136 KEY_LEN(sa) = KEY_LEN(mask) = 8;
137 mask.sin_addr.s_addr = htonl(mlen ? ~((1 << (32 - mlen)) - 1) : 0);
138 sa.sin_addr.s_addr = addr & mask.sin_addr.s_addr;
139 IPFW_WLOCK(ch);
140 ent = (struct table_entry *)rnh->rnh_deladdr(&sa, &mask, rnh);
141 if (ent == NULL) {
142 IPFW_WUNLOCK(ch);
143 return (ESRCH);
144 }
145 IPFW_WUNLOCK(ch);
146 free(ent, M_IPFW_TBL);
147 return (0);
148}
149
150static int
151flush_table_entry(struct radix_node *rn, void *arg)
152{
153 struct radix_node_head * const rnh = arg;
154 struct table_entry *ent;
155
156 ent = (struct table_entry *)
157 rnh->rnh_deladdr(rn->rn_key, rn->rn_mask, rnh);
158 if (ent != NULL)
159 free(ent, M_IPFW_TBL);
160 return (0);
161}
162
163int
164ipfw_flush_table(struct ip_fw_chain *ch, uint16_t tbl)
165{
166 struct radix_node_head *rnh;
167
168 IPFW_WLOCK_ASSERT(ch);
169
170 if (tbl >= IPFW_TABLES_MAX)
171 return (EINVAL);
172 rnh = ch->tables[tbl];
173 KASSERT(rnh != NULL, ("NULL IPFW table"));
174 rnh->rnh_walktree(rnh, flush_table_entry, rnh);
175 return (0);
176}
177
178void
179ipfw_flush_tables(struct ip_fw_chain *ch)
180{
181 uint16_t tbl;
182
183 IPFW_WLOCK_ASSERT(ch);
184
185 for (tbl = 0; tbl < IPFW_TABLES_MAX; tbl++)
186 ipfw_flush_table(ch, tbl);
187}
188
189int
190ipfw_init_tables(struct ip_fw_chain *ch)
191{
192 int i;
193 uint16_t j;
194
195 for (i = 0; i < IPFW_TABLES_MAX; i++) {
196 if (!rn_inithead((void **)&ch->tables[i], KEY_OFS)) {
197 for (j = 0; j < i; j++) {
198 (void) ipfw_flush_table(ch, j);
199 }
200 return (ENOMEM);
201 }
202 }
203 return (0);
204}
205
206int
207ipfw_lookup_table(struct ip_fw_chain *ch, uint16_t tbl, in_addr_t addr,
208 uint32_t *val)
209{
210 struct radix_node_head *rnh;
211 struct table_entry *ent;
212 struct sockaddr_in sa;
213
214 if (tbl >= IPFW_TABLES_MAX)
215 return (0);
216 rnh = ch->tables[tbl];
217 KEY_LEN(sa) = 8;
218 sa.sin_addr.s_addr = addr;
219 ent = (struct table_entry *)(rnh->rnh_lookup(&sa, NULL, rnh));
220 if (ent != NULL) {
221 *val = ent->value;
222 return (1);
223 }
224 return (0);
225}
226
227static int
228count_table_entry(struct radix_node *rn, void *arg)
229{
230 u_int32_t * const cnt = arg;
231
232 (*cnt)++;
233 return (0);
234}
235
236int
237ipfw_count_table(struct ip_fw_chain *ch, uint32_t tbl, uint32_t *cnt)
238{
239 struct radix_node_head *rnh;
240
241 if (tbl >= IPFW_TABLES_MAX)
242 return (EINVAL);
243 rnh = ch->tables[tbl];
244 *cnt = 0;
245 rnh->rnh_walktree(rnh, count_table_entry, cnt);
246 return (0);
247}
248
249static int
250dump_table_entry(struct radix_node *rn, void *arg)
251{
252 struct table_entry * const n = (struct table_entry *)rn;
253 ipfw_table * const tbl = arg;
254 ipfw_table_entry *ent;
255
256 if (tbl->cnt == tbl->size)
257 return (1);
258 ent = &tbl->ent[tbl->cnt];
259 ent->tbl = tbl->tbl;
260 if (in_nullhost(n->mask.sin_addr))
261 ent->masklen = 0;
262 else
263 ent->masklen = 33 - ffs(ntohl(n->mask.sin_addr.s_addr));
264 ent->addr = n->addr.sin_addr.s_addr;
265 ent->value = n->value;
266 tbl->cnt++;
267 return (0);
268}
269
270int
271ipfw_dump_table(struct ip_fw_chain *ch, ipfw_table *tbl)
272{
273 struct radix_node_head *rnh;
274
275 if (tbl->tbl >= IPFW_TABLES_MAX)
276 return (EINVAL);
277 rnh = ch->tables[tbl->tbl];
278 tbl->cnt = 0;
279 rnh->rnh_walktree(rnh, dump_table_entry, tbl);
280 return (0);
281}
282/* end of file */
|