Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * ebtables | |
3 | * | |
4 | * Author: | |
5 | * Bart De Schuymer <bdschuym@pandora.be> | |
6 | * | |
7 | * ebtables.c,v 2.0, July, 2002 | |
8 | * | |
9 | * This code is stongly inspired on the iptables code which is | |
10 | * Copyright (C) 1999 Paul `Rusty' Russell & Michael J. Neuling | |
11 | * | |
12 | * This program is free software; you can redistribute it and/or | |
13 | * modify it under the terms of the GNU General Public License | |
14 | * as published by the Free Software Foundation; either version | |
15 | * 2 of the License, or (at your option) any later version. | |
16 | */ | |
17 | ||
18 | /* used for print_string */ | |
19 | #include <linux/sched.h> | |
20 | #include <linux/tty.h> | |
21 | ||
22 | #include <linux/kmod.h> | |
23 | #include <linux/module.h> | |
24 | #include <linux/vmalloc.h> | |
25 | #include <linux/netfilter_bridge/ebtables.h> | |
26 | #include <linux/spinlock.h> | |
df0933dc | 27 | #include <linux/mutex.h> |
1da177e4 LT |
28 | #include <asm/uaccess.h> |
29 | #include <linux/smp.h> | |
c8923c6b | 30 | #include <linux/cpumask.h> |
1da177e4 LT |
31 | #include <net/sock.h> |
32 | /* needed for logical [in,out]-dev filtering */ | |
33 | #include "../br_private.h" | |
34 | ||
1da177e4 LT |
35 | #define BUGPRINT(format, args...) printk("kernel msg: ebtables bug: please "\ |
36 | "report to author: "format, ## args) | |
37 | /* #define BUGPRINT(format, args...) */ | |
1da177e4 LT |
38 | #define MEMPRINT(format, args...) printk("kernel msg: ebtables "\ |
39 | ": out of memory: "format, ## args) | |
40 | /* #define MEMPRINT(format, args...) */ | |
41 | ||
42 | ||
43 | ||
44 | /* | |
45 | * Each cpu has its own set of counters, so there is no need for write_lock in | |
46 | * the softirq | |
47 | * For reading or updating the counters, the user context needs to | |
48 | * get a write_lock | |
49 | */ | |
50 | ||
51 | /* The size of each set of counters is altered to get cache alignment */ | |
52 | #define SMP_ALIGN(x) (((x) + SMP_CACHE_BYTES-1) & ~(SMP_CACHE_BYTES-1)) | |
53 | #define COUNTER_OFFSET(n) (SMP_ALIGN(n * sizeof(struct ebt_counter))) | |
54 | #define COUNTER_BASE(c, n, cpu) ((struct ebt_counter *)(((char *)c) + \ | |
55 | COUNTER_OFFSET(n) * cpu)) | |
56 | ||
57 | ||
58 | ||
57b47a53 | 59 | static DEFINE_MUTEX(ebt_mutex); |
1da177e4 LT |
60 | static LIST_HEAD(ebt_tables); |
61 | static LIST_HEAD(ebt_targets); | |
62 | static LIST_HEAD(ebt_matches); | |
63 | static LIST_HEAD(ebt_watchers); | |
64 | ||
65 | static struct ebt_target ebt_standard_target = | |
66 | { {NULL, NULL}, EBT_STANDARD_TARGET, NULL, NULL, NULL, NULL}; | |
67 | ||
68 | static inline int ebt_do_watcher (struct ebt_entry_watcher *w, | |
69 | const struct sk_buff *skb, unsigned int hooknr, const struct net_device *in, | |
70 | const struct net_device *out) | |
71 | { | |
72 | w->u.watcher->watcher(skb, hooknr, in, out, w->data, | |
73 | w->watcher_size); | |
74 | /* watchers don't give a verdict */ | |
75 | return 0; | |
76 | } | |
77 | ||
78 | static inline int ebt_do_match (struct ebt_entry_match *m, | |
79 | const struct sk_buff *skb, const struct net_device *in, | |
80 | const struct net_device *out) | |
81 | { | |
82 | return m->u.match->match(skb, in, out, m->data, | |
83 | m->match_size); | |
84 | } | |
85 | ||
86 | static inline int ebt_dev_check(char *entry, const struct net_device *device) | |
87 | { | |
88 | int i = 0; | |
6f5b7ef6 | 89 | const char *devname = device->name; |
1da177e4 LT |
90 | |
91 | if (*entry == '\0') | |
92 | return 0; | |
93 | if (!device) | |
94 | return 1; | |
95 | /* 1 is the wildcard token */ | |
96 | while (entry[i] != '\0' && entry[i] != 1 && entry[i] == devname[i]) | |
97 | i++; | |
98 | return (devname[i] != entry[i] && entry[i] != 1); | |
99 | } | |
100 | ||
101 | #define FWINV2(bool,invflg) ((bool) ^ !!(e->invflags & invflg)) | |
102 | /* process standard matches */ | |
103 | static inline int ebt_basic_match(struct ebt_entry *e, struct ethhdr *h, | |
104 | const struct net_device *in, const struct net_device *out) | |
105 | { | |
106 | int verdict, i; | |
107 | ||
108 | if (e->bitmask & EBT_802_3) { | |
109 | if (FWINV2(ntohs(h->h_proto) >= 1536, EBT_IPROTO)) | |
110 | return 1; | |
111 | } else if (!(e->bitmask & EBT_NOPROTO) && | |
112 | FWINV2(e->ethproto != h->h_proto, EBT_IPROTO)) | |
113 | return 1; | |
114 | ||
115 | if (FWINV2(ebt_dev_check(e->in, in), EBT_IIN)) | |
116 | return 1; | |
117 | if (FWINV2(ebt_dev_check(e->out, out), EBT_IOUT)) | |
118 | return 1; | |
119 | if ((!in || !in->br_port) ? 0 : FWINV2(ebt_dev_check( | |
120 | e->logical_in, in->br_port->br->dev), EBT_ILOGICALIN)) | |
121 | return 1; | |
122 | if ((!out || !out->br_port) ? 0 : FWINV2(ebt_dev_check( | |
123 | e->logical_out, out->br_port->br->dev), EBT_ILOGICALOUT)) | |
124 | return 1; | |
125 | ||
126 | if (e->bitmask & EBT_SOURCEMAC) { | |
127 | verdict = 0; | |
128 | for (i = 0; i < 6; i++) | |
129 | verdict |= (h->h_source[i] ^ e->sourcemac[i]) & | |
130 | e->sourcemsk[i]; | |
131 | if (FWINV2(verdict != 0, EBT_ISOURCE) ) | |
132 | return 1; | |
133 | } | |
134 | if (e->bitmask & EBT_DESTMAC) { | |
135 | verdict = 0; | |
136 | for (i = 0; i < 6; i++) | |
137 | verdict |= (h->h_dest[i] ^ e->destmac[i]) & | |
138 | e->destmsk[i]; | |
139 | if (FWINV2(verdict != 0, EBT_IDEST) ) | |
140 | return 1; | |
141 | } | |
142 | return 0; | |
143 | } | |
144 | ||
145 | /* Do some firewalling */ | |
146 | unsigned int ebt_do_table (unsigned int hook, struct sk_buff **pskb, | |
147 | const struct net_device *in, const struct net_device *out, | |
148 | struct ebt_table *table) | |
149 | { | |
150 | int i, nentries; | |
151 | struct ebt_entry *point; | |
152 | struct ebt_counter *counter_base, *cb_base; | |
153 | struct ebt_entry_target *t; | |
154 | int verdict, sp = 0; | |
155 | struct ebt_chainstack *cs; | |
156 | struct ebt_entries *chaininfo; | |
157 | char *base; | |
158 | struct ebt_table_info *private; | |
159 | ||
160 | read_lock_bh(&table->lock); | |
161 | private = table->private; | |
162 | cb_base = COUNTER_BASE(private->counters, private->nentries, | |
163 | smp_processor_id()); | |
164 | if (private->chainstack) | |
165 | cs = private->chainstack[smp_processor_id()]; | |
166 | else | |
167 | cs = NULL; | |
168 | chaininfo = private->hook_entry[hook]; | |
169 | nentries = private->hook_entry[hook]->nentries; | |
170 | point = (struct ebt_entry *)(private->hook_entry[hook]->data); | |
171 | counter_base = cb_base + private->hook_entry[hook]->counter_offset; | |
172 | /* base for chain jumps */ | |
173 | base = private->entries; | |
174 | i = 0; | |
175 | while (i < nentries) { | |
176 | if (ebt_basic_match(point, eth_hdr(*pskb), in, out)) | |
177 | goto letscontinue; | |
178 | ||
179 | if (EBT_MATCH_ITERATE(point, ebt_do_match, *pskb, in, out) != 0) | |
180 | goto letscontinue; | |
181 | ||
182 | /* increase counter */ | |
183 | (*(counter_base + i)).pcnt++; | |
184 | (*(counter_base + i)).bcnt+=(**pskb).len; | |
185 | ||
186 | /* these should only watch: not modify, nor tell us | |
187 | what to do with the packet */ | |
188 | EBT_WATCHER_ITERATE(point, ebt_do_watcher, *pskb, hook, in, | |
189 | out); | |
190 | ||
191 | t = (struct ebt_entry_target *) | |
192 | (((char *)point) + point->target_offset); | |
193 | /* standard target */ | |
194 | if (!t->u.target->target) | |
195 | verdict = ((struct ebt_standard_target *)t)->verdict; | |
196 | else | |
197 | verdict = t->u.target->target(pskb, hook, | |
198 | in, out, t->data, t->target_size); | |
199 | if (verdict == EBT_ACCEPT) { | |
200 | read_unlock_bh(&table->lock); | |
201 | return NF_ACCEPT; | |
202 | } | |
203 | if (verdict == EBT_DROP) { | |
204 | read_unlock_bh(&table->lock); | |
205 | return NF_DROP; | |
206 | } | |
207 | if (verdict == EBT_RETURN) { | |
208 | letsreturn: | |
209 | #ifdef CONFIG_NETFILTER_DEBUG | |
210 | if (sp == 0) { | |
211 | BUGPRINT("RETURN on base chain"); | |
212 | /* act like this is EBT_CONTINUE */ | |
213 | goto letscontinue; | |
214 | } | |
215 | #endif | |
216 | sp--; | |
217 | /* put all the local variables right */ | |
218 | i = cs[sp].n; | |
219 | chaininfo = cs[sp].chaininfo; | |
220 | nentries = chaininfo->nentries; | |
221 | point = cs[sp].e; | |
222 | counter_base = cb_base + | |
223 | chaininfo->counter_offset; | |
224 | continue; | |
225 | } | |
226 | if (verdict == EBT_CONTINUE) | |
227 | goto letscontinue; | |
228 | #ifdef CONFIG_NETFILTER_DEBUG | |
229 | if (verdict < 0) { | |
230 | BUGPRINT("bogus standard verdict\n"); | |
231 | read_unlock_bh(&table->lock); | |
232 | return NF_DROP; | |
233 | } | |
234 | #endif | |
235 | /* jump to a udc */ | |
236 | cs[sp].n = i + 1; | |
237 | cs[sp].chaininfo = chaininfo; | |
238 | cs[sp].e = (struct ebt_entry *) | |
239 | (((char *)point) + point->next_offset); | |
240 | i = 0; | |
241 | chaininfo = (struct ebt_entries *) (base + verdict); | |
242 | #ifdef CONFIG_NETFILTER_DEBUG | |
243 | if (chaininfo->distinguisher) { | |
244 | BUGPRINT("jump to non-chain\n"); | |
245 | read_unlock_bh(&table->lock); | |
246 | return NF_DROP; | |
247 | } | |
248 | #endif | |
249 | nentries = chaininfo->nentries; | |
250 | point = (struct ebt_entry *)chaininfo->data; | |
251 | counter_base = cb_base + chaininfo->counter_offset; | |
252 | sp++; | |
253 | continue; | |
254 | letscontinue: | |
255 | point = (struct ebt_entry *) | |
256 | (((char *)point) + point->next_offset); | |
257 | i++; | |
258 | } | |
259 | ||
260 | /* I actually like this :) */ | |
261 | if (chaininfo->policy == EBT_RETURN) | |
262 | goto letsreturn; | |
263 | if (chaininfo->policy == EBT_ACCEPT) { | |
264 | read_unlock_bh(&table->lock); | |
265 | return NF_ACCEPT; | |
266 | } | |
267 | read_unlock_bh(&table->lock); | |
268 | return NF_DROP; | |
269 | } | |
270 | ||
271 | /* If it succeeds, returns element and locks mutex */ | |
272 | static inline void * | |
273 | find_inlist_lock_noload(struct list_head *head, const char *name, int *error, | |
57b47a53 | 274 | struct mutex *mutex) |
1da177e4 | 275 | { |
df0933dc PM |
276 | struct { |
277 | struct list_head list; | |
278 | char name[EBT_FUNCTION_MAXNAMELEN]; | |
279 | } *e; | |
1da177e4 | 280 | |
57b47a53 | 281 | *error = mutex_lock_interruptible(mutex); |
1da177e4 LT |
282 | if (*error != 0) |
283 | return NULL; | |
284 | ||
df0933dc PM |
285 | list_for_each_entry(e, head, list) { |
286 | if (strcmp(e->name, name) == 0) | |
287 | return e; | |
1da177e4 | 288 | } |
df0933dc PM |
289 | *error = -ENOENT; |
290 | mutex_unlock(mutex); | |
291 | return NULL; | |
1da177e4 LT |
292 | } |
293 | ||
294 | #ifndef CONFIG_KMOD | |
295 | #define find_inlist_lock(h,n,p,e,m) find_inlist_lock_noload((h),(n),(e),(m)) | |
296 | #else | |
297 | static void * | |
298 | find_inlist_lock(struct list_head *head, const char *name, const char *prefix, | |
57b47a53 | 299 | int *error, struct mutex *mutex) |
1da177e4 LT |
300 | { |
301 | void *ret; | |
302 | ||
303 | ret = find_inlist_lock_noload(head, name, error, mutex); | |
304 | if (!ret) { | |
305 | request_module("%s%s", prefix, name); | |
306 | ret = find_inlist_lock_noload(head, name, error, mutex); | |
307 | } | |
308 | return ret; | |
309 | } | |
310 | #endif | |
311 | ||
312 | static inline struct ebt_table * | |
57b47a53 | 313 | find_table_lock(const char *name, int *error, struct mutex *mutex) |
1da177e4 LT |
314 | { |
315 | return find_inlist_lock(&ebt_tables, name, "ebtable_", error, mutex); | |
316 | } | |
317 | ||
318 | static inline struct ebt_match * | |
57b47a53 | 319 | find_match_lock(const char *name, int *error, struct mutex *mutex) |
1da177e4 LT |
320 | { |
321 | return find_inlist_lock(&ebt_matches, name, "ebt_", error, mutex); | |
322 | } | |
323 | ||
324 | static inline struct ebt_watcher * | |
57b47a53 | 325 | find_watcher_lock(const char *name, int *error, struct mutex *mutex) |
1da177e4 LT |
326 | { |
327 | return find_inlist_lock(&ebt_watchers, name, "ebt_", error, mutex); | |
328 | } | |
329 | ||
330 | static inline struct ebt_target * | |
57b47a53 | 331 | find_target_lock(const char *name, int *error, struct mutex *mutex) |
1da177e4 LT |
332 | { |
333 | return find_inlist_lock(&ebt_targets, name, "ebt_", error, mutex); | |
334 | } | |
335 | ||
336 | static inline int | |
337 | ebt_check_match(struct ebt_entry_match *m, struct ebt_entry *e, | |
338 | const char *name, unsigned int hookmask, unsigned int *cnt) | |
339 | { | |
340 | struct ebt_match *match; | |
341 | int ret; | |
342 | ||
343 | if (((char *)m) + m->match_size + sizeof(struct ebt_entry_match) > | |
344 | ((char *)e) + e->watchers_offset) | |
345 | return -EINVAL; | |
346 | match = find_match_lock(m->u.name, &ret, &ebt_mutex); | |
347 | if (!match) | |
348 | return ret; | |
349 | m->u.match = match; | |
350 | if (!try_module_get(match->me)) { | |
57b47a53 | 351 | mutex_unlock(&ebt_mutex); |
1da177e4 LT |
352 | return -ENOENT; |
353 | } | |
57b47a53 | 354 | mutex_unlock(&ebt_mutex); |
1da177e4 LT |
355 | if (match->check && |
356 | match->check(name, hookmask, e, m->data, m->match_size) != 0) { | |
357 | BUGPRINT("match->check failed\n"); | |
358 | module_put(match->me); | |
359 | return -EINVAL; | |
360 | } | |
361 | (*cnt)++; | |
362 | return 0; | |
363 | } | |
364 | ||
365 | static inline int | |
366 | ebt_check_watcher(struct ebt_entry_watcher *w, struct ebt_entry *e, | |
367 | const char *name, unsigned int hookmask, unsigned int *cnt) | |
368 | { | |
369 | struct ebt_watcher *watcher; | |
370 | int ret; | |
371 | ||
372 | if (((char *)w) + w->watcher_size + sizeof(struct ebt_entry_watcher) > | |
373 | ((char *)e) + e->target_offset) | |
374 | return -EINVAL; | |
375 | watcher = find_watcher_lock(w->u.name, &ret, &ebt_mutex); | |
376 | if (!watcher) | |
377 | return ret; | |
378 | w->u.watcher = watcher; | |
379 | if (!try_module_get(watcher->me)) { | |
57b47a53 | 380 | mutex_unlock(&ebt_mutex); |
1da177e4 LT |
381 | return -ENOENT; |
382 | } | |
57b47a53 | 383 | mutex_unlock(&ebt_mutex); |
1da177e4 LT |
384 | if (watcher->check && |
385 | watcher->check(name, hookmask, e, w->data, w->watcher_size) != 0) { | |
386 | BUGPRINT("watcher->check failed\n"); | |
387 | module_put(watcher->me); | |
388 | return -EINVAL; | |
389 | } | |
390 | (*cnt)++; | |
391 | return 0; | |
392 | } | |
393 | ||
394 | /* | |
395 | * this one is very careful, as it is the first function | |
396 | * to parse the userspace data | |
397 | */ | |
398 | static inline int | |
399 | ebt_check_entry_size_and_hooks(struct ebt_entry *e, | |
400 | struct ebt_table_info *newinfo, char *base, char *limit, | |
401 | struct ebt_entries **hook_entries, unsigned int *n, unsigned int *cnt, | |
402 | unsigned int *totalcnt, unsigned int *udc_cnt, unsigned int valid_hooks) | |
403 | { | |
404 | int i; | |
405 | ||
406 | for (i = 0; i < NF_BR_NUMHOOKS; i++) { | |
407 | if ((valid_hooks & (1 << i)) == 0) | |
408 | continue; | |
409 | if ( (char *)hook_entries[i] - base == | |
410 | (char *)e - newinfo->entries) | |
411 | break; | |
412 | } | |
413 | /* beginning of a new chain | |
414 | if i == NF_BR_NUMHOOKS it must be a user defined chain */ | |
415 | if (i != NF_BR_NUMHOOKS || !(e->bitmask & EBT_ENTRY_OR_ENTRIES)) { | |
416 | if ((e->bitmask & EBT_ENTRY_OR_ENTRIES) != 0) { | |
417 | /* we make userspace set this right, | |
418 | so there is no misunderstanding */ | |
419 | BUGPRINT("EBT_ENTRY_OR_ENTRIES shouldn't be set " | |
420 | "in distinguisher\n"); | |
421 | return -EINVAL; | |
422 | } | |
423 | /* this checks if the previous chain has as many entries | |
424 | as it said it has */ | |
425 | if (*n != *cnt) { | |
426 | BUGPRINT("nentries does not equal the nr of entries " | |
427 | "in the chain\n"); | |
428 | return -EINVAL; | |
429 | } | |
430 | /* before we look at the struct, be sure it is not too big */ | |
431 | if ((char *)hook_entries[i] + sizeof(struct ebt_entries) | |
432 | > limit) { | |
433 | BUGPRINT("entries_size too small\n"); | |
434 | return -EINVAL; | |
435 | } | |
436 | if (((struct ebt_entries *)e)->policy != EBT_DROP && | |
437 | ((struct ebt_entries *)e)->policy != EBT_ACCEPT) { | |
438 | /* only RETURN from udc */ | |
439 | if (i != NF_BR_NUMHOOKS || | |
440 | ((struct ebt_entries *)e)->policy != EBT_RETURN) { | |
441 | BUGPRINT("bad policy\n"); | |
442 | return -EINVAL; | |
443 | } | |
444 | } | |
445 | if (i == NF_BR_NUMHOOKS) /* it's a user defined chain */ | |
446 | (*udc_cnt)++; | |
447 | else | |
448 | newinfo->hook_entry[i] = (struct ebt_entries *)e; | |
449 | if (((struct ebt_entries *)e)->counter_offset != *totalcnt) { | |
450 | BUGPRINT("counter_offset != totalcnt"); | |
451 | return -EINVAL; | |
452 | } | |
453 | *n = ((struct ebt_entries *)e)->nentries; | |
454 | *cnt = 0; | |
455 | return 0; | |
456 | } | |
457 | /* a plain old entry, heh */ | |
458 | if (sizeof(struct ebt_entry) > e->watchers_offset || | |
459 | e->watchers_offset > e->target_offset || | |
460 | e->target_offset >= e->next_offset) { | |
461 | BUGPRINT("entry offsets not in right order\n"); | |
462 | return -EINVAL; | |
463 | } | |
464 | /* this is not checked anywhere else */ | |
465 | if (e->next_offset - e->target_offset < sizeof(struct ebt_entry_target)) { | |
466 | BUGPRINT("target size too small\n"); | |
467 | return -EINVAL; | |
468 | } | |
469 | ||
470 | (*cnt)++; | |
471 | (*totalcnt)++; | |
472 | return 0; | |
473 | } | |
474 | ||
475 | struct ebt_cl_stack | |
476 | { | |
477 | struct ebt_chainstack cs; | |
478 | int from; | |
479 | unsigned int hookmask; | |
480 | }; | |
481 | ||
482 | /* | |
483 | * we need these positions to check that the jumps to a different part of the | |
484 | * entries is a jump to the beginning of a new chain. | |
485 | */ | |
486 | static inline int | |
487 | ebt_get_udc_positions(struct ebt_entry *e, struct ebt_table_info *newinfo, | |
488 | struct ebt_entries **hook_entries, unsigned int *n, unsigned int valid_hooks, | |
489 | struct ebt_cl_stack *udc) | |
490 | { | |
491 | int i; | |
492 | ||
493 | /* we're only interested in chain starts */ | |
494 | if (e->bitmask & EBT_ENTRY_OR_ENTRIES) | |
495 | return 0; | |
496 | for (i = 0; i < NF_BR_NUMHOOKS; i++) { | |
497 | if ((valid_hooks & (1 << i)) == 0) | |
498 | continue; | |
499 | if (newinfo->hook_entry[i] == (struct ebt_entries *)e) | |
500 | break; | |
501 | } | |
502 | /* only care about udc */ | |
503 | if (i != NF_BR_NUMHOOKS) | |
504 | return 0; | |
505 | ||
506 | udc[*n].cs.chaininfo = (struct ebt_entries *)e; | |
507 | /* these initialisations are depended on later in check_chainloops() */ | |
508 | udc[*n].cs.n = 0; | |
509 | udc[*n].hookmask = 0; | |
510 | ||
511 | (*n)++; | |
512 | return 0; | |
513 | } | |
514 | ||
515 | static inline int | |
516 | ebt_cleanup_match(struct ebt_entry_match *m, unsigned int *i) | |
517 | { | |
518 | if (i && (*i)-- == 0) | |
519 | return 1; | |
520 | if (m->u.match->destroy) | |
521 | m->u.match->destroy(m->data, m->match_size); | |
522 | module_put(m->u.match->me); | |
523 | ||
524 | return 0; | |
525 | } | |
526 | ||
527 | static inline int | |
528 | ebt_cleanup_watcher(struct ebt_entry_watcher *w, unsigned int *i) | |
529 | { | |
530 | if (i && (*i)-- == 0) | |
531 | return 1; | |
532 | if (w->u.watcher->destroy) | |
533 | w->u.watcher->destroy(w->data, w->watcher_size); | |
534 | module_put(w->u.watcher->me); | |
535 | ||
536 | return 0; | |
537 | } | |
538 | ||
539 | static inline int | |
540 | ebt_cleanup_entry(struct ebt_entry *e, unsigned int *cnt) | |
541 | { | |
542 | struct ebt_entry_target *t; | |
543 | ||
544 | if ((e->bitmask & EBT_ENTRY_OR_ENTRIES) == 0) | |
545 | return 0; | |
546 | /* we're done */ | |
547 | if (cnt && (*cnt)-- == 0) | |
548 | return 1; | |
549 | EBT_WATCHER_ITERATE(e, ebt_cleanup_watcher, NULL); | |
550 | EBT_MATCH_ITERATE(e, ebt_cleanup_match, NULL); | |
551 | t = (struct ebt_entry_target *)(((char *)e) + e->target_offset); | |
552 | if (t->u.target->destroy) | |
553 | t->u.target->destroy(t->data, t->target_size); | |
554 | module_put(t->u.target->me); | |
555 | ||
556 | return 0; | |
557 | } | |
558 | ||
559 | static inline int | |
560 | ebt_check_entry(struct ebt_entry *e, struct ebt_table_info *newinfo, | |
561 | const char *name, unsigned int *cnt, unsigned int valid_hooks, | |
562 | struct ebt_cl_stack *cl_s, unsigned int udc_cnt) | |
563 | { | |
564 | struct ebt_entry_target *t; | |
565 | struct ebt_target *target; | |
566 | unsigned int i, j, hook = 0, hookmask = 0; | |
567 | int ret; | |
568 | ||
569 | /* don't mess with the struct ebt_entries */ | |
570 | if ((e->bitmask & EBT_ENTRY_OR_ENTRIES) == 0) | |
571 | return 0; | |
572 | ||
573 | if (e->bitmask & ~EBT_F_MASK) { | |
574 | BUGPRINT("Unknown flag for bitmask\n"); | |
575 | return -EINVAL; | |
576 | } | |
577 | if (e->invflags & ~EBT_INV_MASK) { | |
578 | BUGPRINT("Unknown flag for inv bitmask\n"); | |
579 | return -EINVAL; | |
580 | } | |
581 | if ( (e->bitmask & EBT_NOPROTO) && (e->bitmask & EBT_802_3) ) { | |
582 | BUGPRINT("NOPROTO & 802_3 not allowed\n"); | |
583 | return -EINVAL; | |
584 | } | |
585 | /* what hook do we belong to? */ | |
586 | for (i = 0; i < NF_BR_NUMHOOKS; i++) { | |
587 | if ((valid_hooks & (1 << i)) == 0) | |
588 | continue; | |
589 | if ((char *)newinfo->hook_entry[i] < (char *)e) | |
590 | hook = i; | |
591 | else | |
592 | break; | |
593 | } | |
594 | /* (1 << NF_BR_NUMHOOKS) tells the check functions the rule is on | |
595 | a base chain */ | |
596 | if (i < NF_BR_NUMHOOKS) | |
597 | hookmask = (1 << hook) | (1 << NF_BR_NUMHOOKS); | |
598 | else { | |
599 | for (i = 0; i < udc_cnt; i++) | |
600 | if ((char *)(cl_s[i].cs.chaininfo) > (char *)e) | |
601 | break; | |
602 | if (i == 0) | |
603 | hookmask = (1 << hook) | (1 << NF_BR_NUMHOOKS); | |
604 | else | |
605 | hookmask = cl_s[i - 1].hookmask; | |
606 | } | |
607 | i = 0; | |
608 | ret = EBT_MATCH_ITERATE(e, ebt_check_match, e, name, hookmask, &i); | |
609 | if (ret != 0) | |
610 | goto cleanup_matches; | |
611 | j = 0; | |
612 | ret = EBT_WATCHER_ITERATE(e, ebt_check_watcher, e, name, hookmask, &j); | |
613 | if (ret != 0) | |
614 | goto cleanup_watchers; | |
615 | t = (struct ebt_entry_target *)(((char *)e) + e->target_offset); | |
616 | target = find_target_lock(t->u.name, &ret, &ebt_mutex); | |
617 | if (!target) | |
618 | goto cleanup_watchers; | |
619 | if (!try_module_get(target->me)) { | |
57b47a53 | 620 | mutex_unlock(&ebt_mutex); |
1da177e4 LT |
621 | ret = -ENOENT; |
622 | goto cleanup_watchers; | |
623 | } | |
57b47a53 | 624 | mutex_unlock(&ebt_mutex); |
1da177e4 LT |
625 | |
626 | t->u.target = target; | |
627 | if (t->u.target == &ebt_standard_target) { | |
628 | if (e->target_offset + sizeof(struct ebt_standard_target) > | |
629 | e->next_offset) { | |
630 | BUGPRINT("Standard target size too big\n"); | |
631 | ret = -EFAULT; | |
632 | goto cleanup_watchers; | |
633 | } | |
634 | if (((struct ebt_standard_target *)t)->verdict < | |
635 | -NUM_STANDARD_TARGETS) { | |
636 | BUGPRINT("Invalid standard target\n"); | |
637 | ret = -EFAULT; | |
638 | goto cleanup_watchers; | |
639 | } | |
640 | } else if ((e->target_offset + t->target_size + | |
641 | sizeof(struct ebt_entry_target) > e->next_offset) || | |
642 | (t->u.target->check && | |
643 | t->u.target->check(name, hookmask, e, t->data, t->target_size) != 0)){ | |
644 | module_put(t->u.target->me); | |
645 | ret = -EFAULT; | |
646 | goto cleanup_watchers; | |
647 | } | |
648 | (*cnt)++; | |
649 | return 0; | |
650 | cleanup_watchers: | |
651 | EBT_WATCHER_ITERATE(e, ebt_cleanup_watcher, &j); | |
652 | cleanup_matches: | |
653 | EBT_MATCH_ITERATE(e, ebt_cleanup_match, &i); | |
654 | return ret; | |
655 | } | |
656 | ||
657 | /* | |
658 | * checks for loops and sets the hook mask for udc | |
659 | * the hook mask for udc tells us from which base chains the udc can be | |
660 | * accessed. This mask is a parameter to the check() functions of the extensions | |
661 | */ | |
662 | static int check_chainloops(struct ebt_entries *chain, struct ebt_cl_stack *cl_s, | |
663 | unsigned int udc_cnt, unsigned int hooknr, char *base) | |
664 | { | |
665 | int i, chain_nr = -1, pos = 0, nentries = chain->nentries, verdict; | |
666 | struct ebt_entry *e = (struct ebt_entry *)chain->data; | |
667 | struct ebt_entry_target *t; | |
668 | ||
669 | while (pos < nentries || chain_nr != -1) { | |
670 | /* end of udc, go back one 'recursion' step */ | |
671 | if (pos == nentries) { | |
672 | /* put back values of the time when this chain was called */ | |
673 | e = cl_s[chain_nr].cs.e; | |
674 | if (cl_s[chain_nr].from != -1) | |
675 | nentries = | |
676 | cl_s[cl_s[chain_nr].from].cs.chaininfo->nentries; | |
677 | else | |
678 | nentries = chain->nentries; | |
679 | pos = cl_s[chain_nr].cs.n; | |
680 | /* make sure we won't see a loop that isn't one */ | |
681 | cl_s[chain_nr].cs.n = 0; | |
682 | chain_nr = cl_s[chain_nr].from; | |
683 | if (pos == nentries) | |
684 | continue; | |
685 | } | |
686 | t = (struct ebt_entry_target *) | |
687 | (((char *)e) + e->target_offset); | |
688 | if (strcmp(t->u.name, EBT_STANDARD_TARGET)) | |
689 | goto letscontinue; | |
690 | if (e->target_offset + sizeof(struct ebt_standard_target) > | |
691 | e->next_offset) { | |
692 | BUGPRINT("Standard target size too big\n"); | |
693 | return -1; | |
694 | } | |
695 | verdict = ((struct ebt_standard_target *)t)->verdict; | |
696 | if (verdict >= 0) { /* jump to another chain */ | |
697 | struct ebt_entries *hlp2 = | |
698 | (struct ebt_entries *)(base + verdict); | |
699 | for (i = 0; i < udc_cnt; i++) | |
700 | if (hlp2 == cl_s[i].cs.chaininfo) | |
701 | break; | |
702 | /* bad destination or loop */ | |
703 | if (i == udc_cnt) { | |
704 | BUGPRINT("bad destination\n"); | |
705 | return -1; | |
706 | } | |
707 | if (cl_s[i].cs.n) { | |
708 | BUGPRINT("loop\n"); | |
709 | return -1; | |
710 | } | |
711 | /* this can't be 0, so the above test is correct */ | |
712 | cl_s[i].cs.n = pos + 1; | |
713 | pos = 0; | |
714 | cl_s[i].cs.e = ((void *)e + e->next_offset); | |
715 | e = (struct ebt_entry *)(hlp2->data); | |
716 | nentries = hlp2->nentries; | |
717 | cl_s[i].from = chain_nr; | |
718 | chain_nr = i; | |
719 | /* this udc is accessible from the base chain for hooknr */ | |
720 | cl_s[i].hookmask |= (1 << hooknr); | |
721 | continue; | |
722 | } | |
723 | letscontinue: | |
724 | e = (void *)e + e->next_offset; | |
725 | pos++; | |
726 | } | |
727 | return 0; | |
728 | } | |
729 | ||
730 | /* do the parsing of the table/chains/entries/matches/watchers/targets, heh */ | |
731 | static int translate_table(struct ebt_replace *repl, | |
732 | struct ebt_table_info *newinfo) | |
733 | { | |
734 | unsigned int i, j, k, udc_cnt; | |
735 | int ret; | |
736 | struct ebt_cl_stack *cl_s = NULL; /* used in the checking for chain loops */ | |
737 | ||
738 | i = 0; | |
739 | while (i < NF_BR_NUMHOOKS && !(repl->valid_hooks & (1 << i))) | |
740 | i++; | |
741 | if (i == NF_BR_NUMHOOKS) { | |
742 | BUGPRINT("No valid hooks specified\n"); | |
743 | return -EINVAL; | |
744 | } | |
745 | if (repl->hook_entry[i] != (struct ebt_entries *)repl->entries) { | |
746 | BUGPRINT("Chains don't start at beginning\n"); | |
747 | return -EINVAL; | |
748 | } | |
749 | /* make sure chains are ordered after each other in same order | |
750 | as their corresponding hooks */ | |
751 | for (j = i + 1; j < NF_BR_NUMHOOKS; j++) { | |
752 | if (!(repl->valid_hooks & (1 << j))) | |
753 | continue; | |
754 | if ( repl->hook_entry[j] <= repl->hook_entry[i] ) { | |
755 | BUGPRINT("Hook order must be followed\n"); | |
756 | return -EINVAL; | |
757 | } | |
758 | i = j; | |
759 | } | |
760 | ||
761 | for (i = 0; i < NF_BR_NUMHOOKS; i++) | |
762 | newinfo->hook_entry[i] = NULL; | |
763 | ||
764 | newinfo->entries_size = repl->entries_size; | |
765 | newinfo->nentries = repl->nentries; | |
766 | ||
767 | /* do some early checkings and initialize some things */ | |
768 | i = 0; /* holds the expected nr. of entries for the chain */ | |
769 | j = 0; /* holds the up to now counted entries for the chain */ | |
770 | k = 0; /* holds the total nr. of entries, should equal | |
771 | newinfo->nentries afterwards */ | |
772 | udc_cnt = 0; /* will hold the nr. of user defined chains (udc) */ | |
773 | ret = EBT_ENTRY_ITERATE(newinfo->entries, newinfo->entries_size, | |
774 | ebt_check_entry_size_and_hooks, newinfo, repl->entries, | |
775 | repl->entries + repl->entries_size, repl->hook_entry, &i, &j, &k, | |
776 | &udc_cnt, repl->valid_hooks); | |
777 | ||
778 | if (ret != 0) | |
779 | return ret; | |
780 | ||
781 | if (i != j) { | |
782 | BUGPRINT("nentries does not equal the nr of entries in the " | |
783 | "(last) chain\n"); | |
784 | return -EINVAL; | |
785 | } | |
786 | if (k != newinfo->nentries) { | |
787 | BUGPRINT("Total nentries is wrong\n"); | |
788 | return -EINVAL; | |
789 | } | |
790 | ||
791 | /* check if all valid hooks have a chain */ | |
792 | for (i = 0; i < NF_BR_NUMHOOKS; i++) { | |
793 | if (newinfo->hook_entry[i] == NULL && | |
794 | (repl->valid_hooks & (1 << i))) { | |
795 | BUGPRINT("Valid hook without chain\n"); | |
796 | return -EINVAL; | |
797 | } | |
798 | } | |
799 | ||
800 | /* get the location of the udc, put them in an array | |
801 | while we're at it, allocate the chainstack */ | |
802 | if (udc_cnt) { | |
803 | /* this will get free'd in do_replace()/ebt_register_table() | |
804 | if an error occurs */ | |
7ad4d2f6 J |
805 | newinfo->chainstack = |
806 | vmalloc((highest_possible_processor_id()+1) | |
807 | * sizeof(*(newinfo->chainstack))); | |
1da177e4 LT |
808 | if (!newinfo->chainstack) |
809 | return -ENOMEM; | |
6f912042 | 810 | for_each_possible_cpu(i) { |
1da177e4 | 811 | newinfo->chainstack[i] = |
18bc89aa | 812 | vmalloc(udc_cnt * sizeof(*(newinfo->chainstack[0]))); |
1da177e4 LT |
813 | if (!newinfo->chainstack[i]) { |
814 | while (i) | |
815 | vfree(newinfo->chainstack[--i]); | |
816 | vfree(newinfo->chainstack); | |
817 | newinfo->chainstack = NULL; | |
818 | return -ENOMEM; | |
819 | } | |
820 | } | |
821 | ||
18bc89aa | 822 | cl_s = vmalloc(udc_cnt * sizeof(*cl_s)); |
1da177e4 LT |
823 | if (!cl_s) |
824 | return -ENOMEM; | |
825 | i = 0; /* the i'th udc */ | |
826 | EBT_ENTRY_ITERATE(newinfo->entries, newinfo->entries_size, | |
827 | ebt_get_udc_positions, newinfo, repl->hook_entry, &i, | |
828 | repl->valid_hooks, cl_s); | |
829 | /* sanity check */ | |
830 | if (i != udc_cnt) { | |
831 | BUGPRINT("i != udc_cnt\n"); | |
832 | vfree(cl_s); | |
833 | return -EFAULT; | |
834 | } | |
835 | } | |
836 | ||
837 | /* Check for loops */ | |
838 | for (i = 0; i < NF_BR_NUMHOOKS; i++) | |
839 | if (repl->valid_hooks & (1 << i)) | |
840 | if (check_chainloops(newinfo->hook_entry[i], | |
841 | cl_s, udc_cnt, i, newinfo->entries)) { | |
68d31872 | 842 | vfree(cl_s); |
1da177e4 LT |
843 | return -EINVAL; |
844 | } | |
845 | ||
846 |