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 | * | |
069d4a7b | 9 | * This code is strongly inspired by the iptables code which is |
1da177e4 LT |
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 | */ | |
ff67e4e4 | 17 | #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt |
1da177e4 LT |
18 | #include <linux/kmod.h> |
19 | #include <linux/module.h> | |
20 | #include <linux/vmalloc.h> | |
18219d3f | 21 | #include <linux/netfilter/x_tables.h> |
1da177e4 LT |
22 | #include <linux/netfilter_bridge/ebtables.h> |
23 | #include <linux/spinlock.h> | |
df0933dc | 24 | #include <linux/mutex.h> |
5a0e3ad6 | 25 | #include <linux/slab.h> |
1da177e4 LT |
26 | #include <asm/uaccess.h> |
27 | #include <linux/smp.h> | |
c8923c6b | 28 | #include <linux/cpumask.h> |
c55fbbb4 | 29 | #include <linux/audit.h> |
1da177e4 LT |
30 | #include <net/sock.h> |
31 | /* needed for logical [in,out]-dev filtering */ | |
32 | #include "../br_private.h" | |
33 | ||
1da177e4 | 34 | #define BUGPRINT(format, args...) printk("kernel msg: ebtables bug: please "\ |
9d6f229f | 35 | "report to author: "format, ## args) |
1da177e4 | 36 | /* #define BUGPRINT(format, args...) */ |
1da177e4 | 37 | |
7f495ad9 | 38 | /* Each cpu has its own set of counters, so there is no need for write_lock in |
1da177e4 LT |
39 | * the softirq |
40 | * For reading or updating the counters, the user context needs to | |
41 | * get a write_lock | |
42 | */ | |
43 | ||
44 | /* The size of each set of counters is altered to get cache alignment */ | |
45 | #define SMP_ALIGN(x) (((x) + SMP_CACHE_BYTES-1) & ~(SMP_CACHE_BYTES-1)) | |
46 | #define COUNTER_OFFSET(n) (SMP_ALIGN(n * sizeof(struct ebt_counter))) | |
47 | #define COUNTER_BASE(c, n, cpu) ((struct ebt_counter *)(((char *)c) + \ | |
052a4bc4 | 48 | COUNTER_OFFSET(n) * cpu)) |
1da177e4 LT |
49 | |
50 | ||
51 | ||
57b47a53 | 52 | static DEFINE_MUTEX(ebt_mutex); |
1da177e4 | 53 | |
81e675c2 FW |
54 | #ifdef CONFIG_COMPAT |
55 | static void ebt_standard_compat_from_user(void *dst, const void *src) | |
56 | { | |
57 | int v = *(compat_int_t *)src; | |
58 | ||
59 | if (v >= 0) | |
60 | v += xt_compat_calc_jump(NFPROTO_BRIDGE, v); | |
61 | memcpy(dst, &v, sizeof(v)); | |
62 | } | |
63 | ||
64 | static int ebt_standard_compat_to_user(void __user *dst, const void *src) | |
65 | { | |
66 | compat_int_t cv = *(int *)src; | |
67 | ||
68 | if (cv >= 0) | |
69 | cv -= xt_compat_calc_jump(NFPROTO_BRIDGE, cv); | |
70 | return copy_to_user(dst, &cv, sizeof(cv)) ? -EFAULT : 0; | |
71 | } | |
72 | #endif | |
73 | ||
74 | ||
043ef46c | 75 | static struct xt_target ebt_standard_target = { |
001a18d3 JE |
76 | .name = "standard", |
77 | .revision = 0, | |
78 | .family = NFPROTO_BRIDGE, | |
043ef46c | 79 | .targetsize = sizeof(int), |
81e675c2 FW |
80 | #ifdef CONFIG_COMPAT |
81 | .compatsize = sizeof(compat_int_t), | |
82 | .compat_from_user = ebt_standard_compat_from_user, | |
83 | .compat_to_user = ebt_standard_compat_to_user, | |
84 | #endif | |
18219d3f | 85 | }; |
1da177e4 | 86 | |
7eb35586 JE |
87 | static inline int |
88 | ebt_do_watcher(const struct ebt_entry_watcher *w, struct sk_buff *skb, | |
de74c169 | 89 | struct xt_action_param *par) |
1da177e4 | 90 | { |
7eb35586 JE |
91 | par->target = w->u.watcher; |
92 | par->targinfo = w->data; | |
93 | w->u.watcher->target(skb, par); | |
1da177e4 LT |
94 | /* watchers don't give a verdict */ |
95 | return 0; | |
96 | } | |
97 | ||
de74c169 JE |
98 | static inline int |
99 | ebt_do_match(struct ebt_entry_match *m, const struct sk_buff *skb, | |
100 | struct xt_action_param *par) | |
1da177e4 | 101 | { |
f7108a20 JE |
102 | par->match = m->u.match; |
103 | par->matchinfo = m->data; | |
d61ba9fd | 104 | return m->u.match->match(skb, par) ? EBT_MATCH : EBT_NOMATCH; |
1da177e4 LT |
105 | } |
106 | ||
d5d1baa1 JE |
107 | static inline int |
108 | ebt_dev_check(const char *entry, const struct net_device *device) | |
1da177e4 LT |
109 | { |
110 | int i = 0; | |
f3d8b2e4 | 111 | const char *devname; |
1da177e4 LT |
112 | |
113 | if (*entry == '\0') | |
114 | return 0; | |
115 | if (!device) | |
116 | return 1; | |
f3d8b2e4 | 117 | devname = device->name; |
1da177e4 LT |
118 | /* 1 is the wildcard token */ |
119 | while (entry[i] != '\0' && entry[i] != 1 && entry[i] == devname[i]) | |
120 | i++; | |
a97bfc1d | 121 | return devname[i] != entry[i] && entry[i] != 1; |
1da177e4 LT |
122 | } |
123 | ||
31a5b837 | 124 | #define FWINV2(bool, invflg) ((bool) ^ !!(e->invflags & invflg)) |
1da177e4 | 125 | /* process standard matches */ |
d5d1baa1 | 126 | static inline int |
13937911 | 127 | ebt_basic_match(const struct ebt_entry *e, const struct sk_buff *skb, |
052a4bc4 | 128 | const struct net_device *in, const struct net_device *out) |
1da177e4 | 129 | { |
13937911 | 130 | const struct ethhdr *h = eth_hdr(skb); |
b5ed54e9 | 131 | const struct net_bridge_port *p; |
13937911 | 132 | __be16 ethproto; |
1da177e4 LT |
133 | int verdict, i; |
134 | ||
df8a39de | 135 | if (skb_vlan_tag_present(skb)) |
13937911 JG |
136 | ethproto = htons(ETH_P_8021Q); |
137 | else | |
138 | ethproto = h->h_proto; | |
139 | ||
1da177e4 | 140 | if (e->bitmask & EBT_802_3) { |
27cf6a6e | 141 | if (FWINV2(eth_proto_is_802_3(ethproto), EBT_IPROTO)) |
1da177e4 LT |
142 | return 1; |
143 | } else if (!(e->bitmask & EBT_NOPROTO) && | |
13937911 | 144 | FWINV2(e->ethproto != ethproto, EBT_IPROTO)) |
1da177e4 LT |
145 | return 1; |
146 | ||
147 | if (FWINV2(ebt_dev_check(e->in, in), EBT_IIN)) | |
148 | return 1; | |
149 | if (FWINV2(ebt_dev_check(e->out, out), EBT_IOUT)) | |
150 | return 1; | |
f350a0a8 | 151 | /* rcu_read_lock()ed by nf_hook_slow */ |
b5ed54e9 | 152 | if (in && (p = br_port_get_rcu(in)) != NULL && |
153 | FWINV2(ebt_dev_check(e->logical_in, p->br->dev), EBT_ILOGICALIN)) | |
1da177e4 | 154 | return 1; |
b5ed54e9 | 155 | if (out && (p = br_port_get_rcu(out)) != NULL && |
156 | FWINV2(ebt_dev_check(e->logical_out, p->br->dev), EBT_ILOGICALOUT)) | |
1da177e4 LT |
157 | return 1; |
158 | ||
159 | if (e->bitmask & EBT_SOURCEMAC) { | |
160 | verdict = 0; | |
161 | for (i = 0; i < 6; i++) | |
162 | verdict |= (h->h_source[i] ^ e->sourcemac[i]) & | |
163 | e->sourcemsk[i]; | |
c1bc1d25 | 164 | if (FWINV2(verdict != 0, EBT_ISOURCE)) |
1da177e4 LT |
165 | return 1; |
166 | } | |
167 | if (e->bitmask & EBT_DESTMAC) { | |
168 | verdict = 0; | |
169 | for (i = 0; i < 6; i++) | |
170 | verdict |= (h->h_dest[i] ^ e->destmac[i]) & | |
171 | e->destmsk[i]; | |
c1bc1d25 | 172 | if (FWINV2(verdict != 0, EBT_IDEST)) |
1da177e4 LT |
173 | return 1; |
174 | } | |
175 | return 0; | |
176 | } | |
177 | ||
851345c5 | 178 | static inline |
98e86403 JE |
179 | struct ebt_entry *ebt_next_entry(const struct ebt_entry *entry) |
180 | { | |
181 | return (void *)entry + entry->next_offset; | |
182 | } | |
183 | ||
1da177e4 | 184 | /* Do some firewalling */ |
97b59c3a EB |
185 | unsigned int ebt_do_table(struct sk_buff *skb, |
186 | const struct nf_hook_state *state, | |
187 | struct ebt_table *table) | |
1da177e4 | 188 | { |
97b59c3a | 189 | unsigned int hook = state->hook; |
1da177e4 LT |
190 | int i, nentries; |
191 | struct ebt_entry *point; | |
192 | struct ebt_counter *counter_base, *cb_base; | |
d5d1baa1 | 193 | const struct ebt_entry_target *t; |
1da177e4 LT |
194 | int verdict, sp = 0; |
195 | struct ebt_chainstack *cs; | |
196 | struct ebt_entries *chaininfo; | |
d5d1baa1 JE |
197 | const char *base; |
198 | const struct ebt_table_info *private; | |
de74c169 | 199 | struct xt_action_param acpar; |
f7108a20 | 200 | |
de74c169 | 201 | acpar.family = NFPROTO_BRIDGE; |
156c196f | 202 | acpar.net = state->net; |
97b59c3a EB |
203 | acpar.in = state->in; |
204 | acpar.out = state->out; | |
b4ba2611 | 205 | acpar.hotdrop = false; |
de74c169 | 206 | acpar.hooknum = hook; |
1da177e4 LT |
207 | |
208 | read_lock_bh(&table->lock); | |
209 | private = table->private; | |
210 | cb_base = COUNTER_BASE(private->counters, private->nentries, | |
211 | smp_processor_id()); | |
212 | if (private->chainstack) | |
213 | cs = private->chainstack[smp_processor_id()]; | |
214 | else | |
215 | cs = NULL; | |
216 | chaininfo = private->hook_entry[hook]; | |
217 | nentries = private->hook_entry[hook]->nentries; | |
218 | point = (struct ebt_entry *)(private->hook_entry[hook]->data); | |
219 | counter_base = cb_base + private->hook_entry[hook]->counter_offset; | |
220 | /* base for chain jumps */ | |
221 | base = private->entries; | |
222 | i = 0; | |
223 | while (i < nentries) { | |
97b59c3a | 224 | if (ebt_basic_match(point, skb, state->in, state->out)) |
1da177e4 LT |
225 | goto letscontinue; |
226 | ||
de74c169 | 227 | if (EBT_MATCH_ITERATE(point, ebt_do_match, skb, &acpar) != 0) |
1da177e4 | 228 | goto letscontinue; |
b4ba2611 | 229 | if (acpar.hotdrop) { |
5365f802 JE |
230 | read_unlock_bh(&table->lock); |
231 | return NF_DROP; | |
232 | } | |
1da177e4 LT |
233 | |
234 | /* increase counter */ | |
235 | (*(counter_base + i)).pcnt++; | |
3db05fea | 236 | (*(counter_base + i)).bcnt += skb->len; |
1da177e4 LT |
237 | |
238 | /* these should only watch: not modify, nor tell us | |
7f495ad9 IM |
239 | * what to do with the packet |
240 | */ | |
de74c169 | 241 | EBT_WATCHER_ITERATE(point, ebt_do_watcher, skb, &acpar); |
1da177e4 LT |
242 | |
243 | t = (struct ebt_entry_target *) | |
244 | (((char *)point) + point->target_offset); | |
245 | /* standard target */ | |
246 | if (!t->u.target->target) | |
247 | verdict = ((struct ebt_standard_target *)t)->verdict; | |
7eb35586 | 248 | else { |
de74c169 JE |
249 | acpar.target = t->u.target; |
250 | acpar.targinfo = t->data; | |
251 | verdict = t->u.target->target(skb, &acpar); | |
7eb35586 | 252 | } |
1da177e4 LT |
253 | if (verdict == EBT_ACCEPT) { |
254 | read_unlock_bh(&table->lock); | |
255 | return NF_ACCEPT; | |
256 | } | |
257 | if (verdict == EBT_DROP) { | |
258 | read_unlock_bh(&table->lock); | |
259 | return NF_DROP; | |
260 | } | |
261 | if (verdict == EBT_RETURN) { | |
262 | letsreturn: | |
263 | #ifdef CONFIG_NETFILTER_DEBUG | |
264 | if (sp == 0) { | |
265 | BUGPRINT("RETURN on base chain"); | |
266 | /* act like this is EBT_CONTINUE */ | |
267 | goto letscontinue; | |
268 | } | |
269 | #endif | |
270 | sp--; | |
271 | /* put all the local variables right */ | |
272 | i = cs[sp].n; | |
273 | chaininfo = cs[sp].chaininfo; | |
274 | nentries = chaininfo->nentries; | |
275 | point = cs[sp].e; | |
276 | counter_base = cb_base + | |
277 | chaininfo->counter_offset; | |
278 | continue; | |
279 | } | |
280 | if (verdict == EBT_CONTINUE) | |
281 | goto letscontinue; | |
282 | #ifdef CONFIG_NETFILTER_DEBUG | |
283 | if (verdict < 0) { | |
284 | BUGPRINT("bogus standard verdict\n"); | |
285 | read_unlock_bh(&table->lock); | |
286 | return NF_DROP; | |
287 | } | |
288 | #endif | |
289 | /* jump to a udc */ | |
290 | cs[sp].n = i + 1; | |
291 | cs[sp].chaininfo = chaininfo; | |
98e86403 | 292 | cs[sp].e = ebt_next_entry(point); |
1da177e4 LT |
293 | i = 0; |
294 | chaininfo = (struct ebt_entries *) (base + verdict); | |
295 | #ifdef CONFIG_NETFILTER_DEBUG | |
296 | if (chaininfo->distinguisher) { | |
297 | BUGPRINT("jump to non-chain\n"); | |
298 | read_unlock_bh(&table->lock); | |
299 | return NF_DROP; | |
300 | } | |
301 | #endif | |
302 | nentries = chaininfo->nentries; | |
303 | point = (struct ebt_entry *)chaininfo->data; | |
304 | counter_base = cb_base + chaininfo->counter_offset; | |
305 | sp++; | |
306 | continue; | |
307 | letscontinue: | |
98e86403 | 308 | point = ebt_next_entry(point); |
1da177e4 LT |
309 | i++; |
310 | } | |
311 | ||
312 | /* I actually like this :) */ | |
313 | if (chaininfo->policy == EBT_RETURN) | |
314 | goto letsreturn; | |
315 | if (chaininfo->policy == EBT_ACCEPT) { | |
316 | read_unlock_bh(&table->lock); | |
317 | return NF_ACCEPT; | |
318 | } | |
319 | read_unlock_bh(&table->lock); | |
320 | return NF_DROP; | |
321 | } | |
322 | ||
323 | /* If it succeeds, returns element and locks mutex */ | |
324 | static inline void * | |
325 | find_inlist_lock_noload(struct list_head *head, const char *name, int *error, | |
052a4bc4 | 326 | struct mutex *mutex) |
1da177e4 | 327 | { |
df0933dc PM |
328 | struct { |
329 | struct list_head list; | |
330 | char name[EBT_FUNCTION_MAXNAMELEN]; | |
331 | } *e; | |
1da177e4 | 332 | |
7926dbfa | 333 | mutex_lock(mutex); |
df0933dc PM |
334 | list_for_each_entry(e, head, list) { |
335 | if (strcmp(e->name, name) == 0) | |
336 | return e; | |
1da177e4 | 337 | } |
df0933dc PM |
338 | *error = -ENOENT; |
339 | mutex_unlock(mutex); | |
340 | return NULL; | |
1da177e4 LT |
341 | } |
342 | ||
1da177e4 LT |
343 | static void * |
344 | find_inlist_lock(struct list_head *head, const char *name, const char *prefix, | |
052a4bc4 | 345 | int *error, struct mutex *mutex) |
1da177e4 | 346 | { |
95a5afca JB |
347 | return try_then_request_module( |
348 | find_inlist_lock_noload(head, name, error, mutex), | |
349 | "%s%s", prefix, name); | |
1da177e4 | 350 | } |
1da177e4 LT |
351 | |
352 | static inline struct ebt_table * | |
511061e2 AD |
353 | find_table_lock(struct net *net, const char *name, int *error, |
354 | struct mutex *mutex) | |
1da177e4 | 355 | { |
511061e2 AD |
356 | return find_inlist_lock(&net->xt.tables[NFPROTO_BRIDGE], name, |
357 | "ebtable_", error, mutex); | |
1da177e4 LT |
358 | } |
359 | ||
1da177e4 | 360 | static inline int |
9b4fce7a JE |
361 | ebt_check_match(struct ebt_entry_match *m, struct xt_mtchk_param *par, |
362 | unsigned int *cnt) | |
1da177e4 | 363 | { |
9b4fce7a | 364 | const struct ebt_entry *e = par->entryinfo; |
043ef46c | 365 | struct xt_match *match; |
14197d54 | 366 | size_t left = ((char *)e + e->watchers_offset) - (char *)m; |
1da177e4 LT |
367 | int ret; |
368 | ||
14197d54 AV |
369 | if (left < sizeof(struct ebt_entry_match) || |
370 | left - sizeof(struct ebt_entry_match) < m->match_size) | |
1da177e4 | 371 | return -EINVAL; |
043ef46c | 372 | |
fd0ec0e6 | 373 | match = xt_request_find_match(NFPROTO_BRIDGE, m->u.name, 0); |
043ef46c JE |
374 | if (IS_ERR(match)) |
375 | return PTR_ERR(match); | |
043ef46c JE |
376 | m->u.match = match; |
377 | ||
9b4fce7a JE |
378 | par->match = match; |
379 | par->matchinfo = m->data; | |
916a917d | 380 | ret = xt_check_match(par, m->match_size, |
9b4fce7a | 381 | e->ethproto, e->invflags & EBT_IPROTO); |
043ef46c JE |
382 | if (ret < 0) { |
383 | module_put(match->me); | |
384 | return ret; | |
1da177e4 | 385 | } |
043ef46c | 386 | |
1da177e4 LT |
387 | (*cnt)++; |
388 | return 0; | |
389 | } | |
390 | ||
391 | static inline int | |
af5d6dc2 JE |
392 | ebt_check_watcher(struct ebt_entry_watcher *w, struct xt_tgchk_param *par, |
393 | unsigned int *cnt) | |
1da177e4 | 394 | { |
af5d6dc2 | 395 | const struct ebt_entry *e = par->entryinfo; |
043ef46c | 396 | struct xt_target *watcher; |
14197d54 | 397 | size_t left = ((char *)e + e->target_offset) - (char *)w; |
1da177e4 LT |
398 | int ret; |
399 | ||
14197d54 AV |
400 | if (left < sizeof(struct ebt_entry_watcher) || |
401 | left - sizeof(struct ebt_entry_watcher) < w->watcher_size) | |
1da177e4 | 402 | return -EINVAL; |
043ef46c | 403 | |
d2a7b6ba | 404 | watcher = xt_request_find_target(NFPROTO_BRIDGE, w->u.name, 0); |
043ef46c JE |
405 | if (IS_ERR(watcher)) |
406 | return PTR_ERR(watcher); | |
043ef46c JE |
407 | w->u.watcher = watcher; |
408 | ||
af5d6dc2 JE |
409 | par->target = watcher; |
410 | par->targinfo = w->data; | |
916a917d | 411 | ret = xt_check_target(par, w->watcher_size, |
af5d6dc2 | 412 | e->ethproto, e->invflags & EBT_IPROTO); |
043ef46c JE |
413 | if (ret < 0) { |
414 | module_put(watcher->me); | |
415 | return ret; | |
1da177e4 | 416 | } |
043ef46c | 417 | |
1da177e4 LT |
418 | (*cnt)++; |
419 | return 0; | |
420 | } | |
421 | ||
d5d1baa1 | 422 | static int ebt_verify_pointers(const struct ebt_replace *repl, |
70fe9af4 | 423 | struct ebt_table_info *newinfo) |
1da177e4 | 424 | { |
70fe9af4 AV |
425 | unsigned int limit = repl->entries_size; |
426 | unsigned int valid_hooks = repl->valid_hooks; | |
427 | unsigned int offset = 0; | |
1da177e4 LT |
428 | int i; |
429 | ||
e4fd77de AV |
430 | for (i = 0; i < NF_BR_NUMHOOKS; i++) |
431 | newinfo->hook_entry[i] = NULL; | |
432 | ||
433 | newinfo->entries_size = repl->entries_size; | |
434 | newinfo->nentries = repl->nentries; | |
435 | ||
70fe9af4 AV |
436 | while (offset < limit) { |
437 | size_t left = limit - offset; | |
438 | struct ebt_entry *e = (void *)newinfo->entries + offset; | |
bb2ef25c | 439 | |
70fe9af4 | 440 | if (left < sizeof(unsigned int)) |
1da177e4 | 441 | break; |
70fe9af4 AV |
442 | |
443 | for (i = 0; i < NF_BR_NUMHOOKS; i++) { | |
444 | if ((valid_hooks & (1 << i)) == 0) | |
445 | continue; | |
1e419cd9 AV |
446 | if ((char __user *)repl->hook_entry[i] == |
447 | repl->entries + offset) | |
70fe9af4 AV |
448 | break; |
449 | } | |
450 | ||
451 | if (i != NF_BR_NUMHOOKS || !(e->bitmask & EBT_ENTRY_OR_ENTRIES)) { | |
452 | if (e->bitmask != 0) { | |
453 | /* we make userspace set this right, | |
7f495ad9 IM |
454 | * so there is no misunderstanding |
455 | */ | |
70fe9af4 AV |
456 | BUGPRINT("EBT_ENTRY_OR_ENTRIES shouldn't be set " |
457 | "in distinguisher\n"); | |
458 | return -EINVAL; | |
459 | } | |
460 | if (i != NF_BR_NUMHOOKS) | |
461 | newinfo->hook_entry[i] = (struct ebt_entries *)e; | |
462 | if (left < sizeof(struct ebt_entries)) | |
463 | break; | |
464 | offset += sizeof(struct ebt_entries); | |
465 | } else { | |
466 | if (left < sizeof(struct ebt_entry)) | |
467 | break; | |
468 | if (left < e->next_offset) | |
469 | break; | |
1756de26 FW |
470 | if (e->next_offset < sizeof(struct ebt_entry)) |
471 | return -EINVAL; | |
70fe9af4 | 472 | offset += e->next_offset; |
1da177e4 | 473 | } |
22b440bf | 474 | } |
70fe9af4 AV |
475 | if (offset != limit) { |
476 | BUGPRINT("entries_size too small\n"); | |
477 | return -EINVAL; | |
478 | } | |
e4fd77de AV |
479 | |
480 | /* check if all valid hooks have a chain */ | |
481 | for (i = 0; i < NF_BR_NUMHOOKS; i++) { | |
482 | if (!newinfo->hook_entry[i] && | |
483 | (valid_hooks & (1 << i))) { | |
484 | BUGPRINT("Valid hook without chain\n"); | |
485 | return -EINVAL; | |
486 | } | |
487 | } | |
22b440bf | 488 | return 0; |
22b440bf AV |
489 | } |
490 | ||
7f495ad9 | 491 | /* this one is very careful, as it is the first function |
22b440bf AV |
492 | * to parse the userspace data |
493 | */ | |
494 | static inline int | |
d5d1baa1 | 495 | ebt_check_entry_size_and_hooks(const struct ebt_entry *e, |
052a4bc4 IM |
496 | const struct ebt_table_info *newinfo, |
497 | unsigned int *n, unsigned int *cnt, | |
498 | unsigned int *totalcnt, unsigned int *udc_cnt) | |
22b440bf | 499 | { |
22b440bf AV |
500 | int i; |
501 | ||
502 | for (i = 0; i < NF_BR_NUMHOOKS; i++) { | |
0e795531 | 503 | if ((void *)e == (void *)newinfo->hook_entry[i]) |
22b440bf AV |
504 | break; |
505 | } | |
506 | /* beginning of a new chain | |
7f495ad9 IM |
507 | * if i == NF_BR_NUMHOOKS it must be a user defined chain |
508 | */ | |
22b440bf | 509 | if (i != NF_BR_NUMHOOKS || !e->bitmask) { |
1da177e4 | 510 | /* this checks if the previous chain has as many entries |
7f495ad9 IM |
511 | * as it said it has |
512 | */ | |
1da177e4 LT |
513 | if (*n != *cnt) { |
514 | BUGPRINT("nentries does not equal the nr of entries " | |
9d6f229f | 515 | "in the chain\n"); |
1da177e4 LT |
516 | return -EINVAL; |
517 | } | |
1da177e4 LT |
518 | if (((struct ebt_entries *)e)->policy != EBT_DROP && |
519 | ((struct ebt_entries *)e)->policy != EBT_ACCEPT) { | |
520 | /* only RETURN from udc */ | |
521 | if (i != NF_BR_NUMHOOKS || | |
522 | ((struct ebt_entries *)e)->policy != EBT_RETURN) { | |
523 | BUGPRINT("bad policy\n"); | |
524 | return -EINVAL; | |
525 | } | |
526 | } | |
527 | if (i == NF_BR_NUMHOOKS) /* it's a user defined chain */ | |
528 | (*udc_cnt)++; | |
1da177e4 LT |
529 | if (((struct ebt_entries *)e)->counter_offset != *totalcnt) { |
530 | BUGPRINT("counter_offset != totalcnt"); | |
531 | return -EINVAL; | |
532 | } | |
533 | *n = ((struct ebt_entries *)e)->nentries; | |
534 | *cnt = 0; | |
535 | return 0; | |
536 | } | |
537 | /* a plain old entry, heh */ | |
538 | if (sizeof(struct ebt_entry) > e->watchers_offset || | |
539 | e->watchers_offset > e->target_offset || | |
540 | e->target_offset >= e->next_offset) { | |
541 | BUGPRINT("entry offsets not in right order\n"); | |
542 | return -EINVAL; | |
543 | } | |
544 | /* this is not checked anywhere else */ | |
545 | if (e->next_offset - e->target_offset < sizeof(struct ebt_entry_target)) { | |
546 | BUGPRINT("target size too small\n"); | |
547 | return -EINVAL; | |
548 | } | |
1da177e4 LT |
549 | (*cnt)++; |
550 | (*totalcnt)++; | |
551 | return 0; | |
552 | } | |
553 | ||
abcdd9a6 | 554 | struct ebt_cl_stack { |
1da177e4 LT |
555 | struct ebt_chainstack cs; |
556 | int from; | |
557 | unsigned int hookmask; | |
558 | }; | |
559 | ||
7f495ad9 | 560 | /* We need these positions to check that the jumps to a different part of the |
1da177e4 LT |
561 | * entries is a jump to the beginning of a new chain. |
562 | */ | |
563 | static inline int | |
564 | ebt_get_udc_positions(struct ebt_entry *e, struct ebt_table_info *newinfo, | |
052a4bc4 | 565 | unsigned int *n, struct ebt_cl_stack *udc) |
1da177e4 LT |
566 | { |
567 | int i; | |
568 | ||
569 | /* we're only interested in chain starts */ | |
40642f95 | 570 | if (e->bitmask) |
1da177e4 LT |
571 | return 0; |
572 | for (i = 0; i < NF_BR_NUMHOOKS; i++) { | |
1da177e4 LT |
573 | if (newinfo->hook_entry[i] == (struct ebt_entries *)e) |
574 | break; | |
575 | } | |
576 | /* only care about udc */ | |
577 | if (i != NF_BR_NUMHOOKS) | |
578 | return 0; | |
579 | ||
580 | udc[*n].cs.chaininfo = (struct ebt_entries *)e; | |
581 | /* these initialisations are depended on later in check_chainloops() */ | |
582 | udc[*n].cs.n = 0; | |
583 | udc[*n].hookmask = 0; | |
584 | ||
585 | (*n)++; | |
586 | return 0; | |
587 | } | |
588 | ||
589 | static inline int | |
f54e9367 | 590 | ebt_cleanup_match(struct ebt_entry_match *m, struct net *net, unsigned int *i) |
1da177e4 | 591 | { |
6be3d859 JE |
592 | struct xt_mtdtor_param par; |
593 | ||
1da177e4 LT |
594 | if (i && (*i)-- == 0) |
595 | return 1; | |
1da177e4 | 596 | |
f54e9367 | 597 | par.net = net; |
6be3d859 JE |
598 | par.match = m->u.match; |
599 | par.matchinfo = m->data; | |
916a917d | 600 | par.family = NFPROTO_BRIDGE; |
6be3d859 JE |
601 | if (par.match->destroy != NULL) |
602 | par.match->destroy(&par); | |
603 | module_put(par.match->me); | |
1da177e4 LT |
604 | return 0; |
605 | } | |
606 | ||
607 | static inline int | |
add67461 | 608 | ebt_cleanup_watcher(struct ebt_entry_watcher *w, struct net *net, unsigned int *i) |
1da177e4 | 609 | { |
a2df1648 JE |
610 | struct xt_tgdtor_param par; |
611 | ||
1da177e4 LT |
612 | if (i && (*i)-- == 0) |
613 | return 1; | |
1da177e4 | 614 | |
add67461 | 615 | par.net = net; |
a2df1648 JE |
616 | par.target = w->u.watcher; |
617 | par.targinfo = w->data; | |
916a917d | 618 | par.family = NFPROTO_BRIDGE; |
a2df1648 JE |
619 | if (par.target->destroy != NULL) |
620 | par.target->destroy(&par); | |
621 | module_put(par.target->me); | |
1da177e4 LT |
622 | return 0; |
623 | } | |
624 | ||
625 | static inline int | |
f54e9367 | 626 | ebt_cleanup_entry(struct ebt_entry *e, struct net *net, unsigned int *cnt) |
1da177e4 | 627 | { |
a2df1648 | 628 | struct xt_tgdtor_param par; |
1da177e4 LT |
629 | struct ebt_entry_target *t; |
630 | ||
40642f95 | 631 | if (e->bitmask == 0) |
1da177e4 LT |
632 | return 0; |
633 | /* we're done */ | |
634 | if (cnt && (*cnt)-- == 0) | |
635 | return 1; | |
add67461 | 636 | EBT_WATCHER_ITERATE(e, ebt_cleanup_watcher, net, NULL); |
f54e9367 | 637 | EBT_MATCH_ITERATE(e, ebt_cleanup_match, net, NULL); |
1da177e4 | 638 | t = (struct ebt_entry_target *)(((char *)e) + e->target_offset); |
1da177e4 | 639 | |
add67461 | 640 | par.net = net; |
a2df1648 JE |
641 | par.target = t->u.target; |
642 | par.targinfo = t->data; | |
916a917d | 643 | par.family = NFPROTO_BRIDGE; |
a2df1648 JE |
644 | if (par.target->destroy != NULL) |
645 | par.target->destroy(&par); | |
646 | module_put(par.target->me); | |
1da177e4 LT |
647 | return 0; |
648 | } | |
649 | ||
650 | static inline int | |
d5d1baa1 | 651 | ebt_check_entry(struct ebt_entry *e, struct net *net, |
052a4bc4 IM |
652 | const struct ebt_table_info *newinfo, |
653 | const char *name, unsigned int *cnt, | |
654 | struct ebt_cl_stack *cl_s, unsigned int udc_cnt) | |
1da177e4 LT |
655 | { |
656 | struct ebt_entry_target *t; | |
043ef46c | 657 | struct xt_target *target; |
1da177e4 | 658 | unsigned int i, j, hook = 0, hookmask = 0; |
44f9a2fd | 659 | size_t gap; |
1da177e4 | 660 | int ret; |
6be3d859 | 661 | struct xt_mtchk_param mtpar; |
af5d6dc2 | 662 | struct xt_tgchk_param tgpar; |
1da177e4 LT |
663 | |
664 | /* don't mess with the struct ebt_entries */ | |
40642f95 | 665 | if (e->bitmask == 0) |
1da177e4 LT |
666 | return 0; |
667 | ||
668 | if (e->bitmask & ~EBT_F_MASK) { | |
669 | BUGPRINT("Unknown flag for bitmask\n"); | |
670 | return -EINVAL; | |
671 | } | |
672 | if (e->invflags & ~EBT_INV_MASK) { | |
673 | BUGPRINT("Unknown flag for inv bitmask\n"); | |
674 | return -EINVAL; | |
675 | } | |
c1bc1d25 | 676 | if ((e->bitmask & EBT_NOPROTO) && (e->bitmask & EBT_802_3)) { |
1da177e4 LT |
677 | BUGPRINT("NOPROTO & 802_3 not allowed\n"); |
678 | return -EINVAL; | |
679 | } | |
680 | /* what hook do we belong to? */ | |
681 | for (i = 0; i < NF_BR_NUMHOOKS; i++) { | |
f7da79d9 | 682 | if (!newinfo->hook_entry[i]) |
1da177e4 LT |
683 | continue; |
684 | if ((char *)newinfo->hook_entry[i] < (char *)e) | |
685 | hook = i; | |
686 | else | |
687 | break; | |
688 | } | |
689 | /* (1 << NF_BR_NUMHOOKS) tells the check functions the rule is on | |
7f495ad9 IM |
690 | * a base chain |
691 | */ | |
1da177e4 LT |
692 | if (i < NF_BR_NUMHOOKS) |
693 | hookmask = (1 << hook) | (1 << NF_BR_NUMHOOKS); | |
694 | else { | |
695 | for (i = 0; i < udc_cnt; i++) | |
696 | if ((char *)(cl_s[i].cs.chaininfo) > (char *)e) | |
697 | break; | |
698 | if (i == 0) | |
699 | hookmask = (1 << hook) | (1 << NF_BR_NUMHOOKS); | |
700 | else | |
701 | hookmask = cl_s[i - 1].hookmask; | |
702 | } | |
703 | i = 0; | |
9b4fce7a | 704 | |
add67461 | 705 | mtpar.net = tgpar.net = net; |
af5d6dc2 JE |
706 | mtpar.table = tgpar.table = name; |
707 | mtpar.entryinfo = tgpar.entryinfo = e; | |
708 | mtpar.hook_mask = tgpar.hook_mask = hookmask; | |
916a917d | 709 | mtpar.family = tgpar.family = NFPROTO_BRIDGE; |
6be3d859 | 710 | ret = EBT_MATCH_ITERATE(e, ebt_check_match, &mtpar, &i); |
1da177e4 LT |
711 | if (ret != 0) |
712 | goto cleanup_matches; | |
713 | j = 0; | |
af5d6dc2 | 714 | ret = EBT_WATCHER_ITERATE(e, ebt_check_watcher, &tgpar, &j); |
1da177e4 LT |
715 | if (ret != 0) |
716 | goto cleanup_watchers; | |
717 | t = (struct ebt_entry_target *)(((char *)e) + e->target_offset); | |
44f9a2fd | 718 | gap = e->next_offset - e->target_offset; |
1da177e4 | 719 | |
d2a7b6ba | 720 | target = xt_request_find_target(NFPROTO_BRIDGE, t->u.name, 0); |
043ef46c JE |
721 | if (IS_ERR(target)) { |
722 | ret = PTR_ERR(target); | |
001a18d3 | 723 | goto cleanup_watchers; |
001a18d3 JE |
724 | } |
725 | ||
1da177e4 LT |
726 | t->u.target = target; |
727 | if (t->u.target == &ebt_standard_target) { | |
14197d54 | 728 | if (gap < sizeof(struct ebt_standard_target)) { |
1da177e4 LT |
729 | BUGPRINT("Standard target size too big\n"); |
730 | ret = -EFAULT; | |
731 | goto cleanup_watchers; | |
732 | } | |
733 | if (((struct ebt_standard_target *)t)->verdict < | |
734 | -NUM_STANDARD_TARGETS) { | |
735 | BUGPRINT("Invalid standard target\n"); | |
736 | ret = -EFAULT; | |
737 | goto cleanup_watchers; | |
738 | } | |
18219d3f JE |
739 | } else if (t->target_size > gap - sizeof(struct ebt_entry_target)) { |
740 | module_put(t->u.target->me); | |
741 | ret = -EFAULT; | |
742 | goto cleanup_watchers; | |
043ef46c JE |
743 | } |
744 | ||
af5d6dc2 JE |
745 | tgpar.target = target; |
746 | tgpar.targinfo = t->data; | |
916a917d | 747 | ret = xt_check_target(&tgpar, t->target_size, |
af5d6dc2 | 748 | e->ethproto, e->invflags & EBT_IPROTO); |
043ef46c JE |
749 | if (ret < 0) { |
750 | module_put(target->me); | |
18219d3f | 751 | goto cleanup_watchers; |
1da177e4 LT |
752 | } |
753 | (*cnt)++; | |
754 | return 0; | |
755 | cleanup_watchers: | |
add67461 | 756 | EBT_WATCHER_ITERATE(e, ebt_cleanup_watcher, net, &j); |
1da177e4 | 757 | cleanup_matches: |
f54e9367 | 758 | EBT_MATCH_ITERATE(e, ebt_cleanup_match, net, &i); |
1da177e4 LT |
759 | return ret; |
760 | } | |
761 | ||
7f495ad9 | 762 | /* checks for loops and sets the hook mask for udc |
1da177e4 LT |
763 | * the hook mask for udc tells us from which base chains the udc can be |
764 | * accessed. This mask is a parameter to the check() functions of the extensions | |
765 | */ | |
d5d1baa1 | 766 | static int check_chainloops(const struct ebt_entries *chain, struct ebt_cl_stack *cl_s, |
052a4bc4 | 767 | unsigned int udc_cnt, unsigned int hooknr, char *base) |
1da177e4 LT |
768 | { |
769 | int i, chain_nr = -1, pos = 0, nentries = chain->nentries, verdict; | |
d5d1baa1 JE |
770 | const struct ebt_entry *e = (struct ebt_entry *)chain->data; |
771 | const struct ebt_entry_target *t; | |
1da177e4 LT |
772 | |
773 | while (pos < nentries || chain_nr != -1) { | |
774 | /* end of udc, go back one 'recursion' step */ | |
775 | if (pos == nentries) { | |
776 | /* put back values of the time when this chain was called */ | |
777 | e = cl_s[chain_nr].cs.e; | |
778 | if (cl_s[chain_nr].from != -1) | |
779 | nentries = | |
780 | cl_s[cl_s[chain_nr].from].cs.chaininfo->nentries; | |
781 | else | |
782 | nentries = chain->nentries; | |
783 | pos = cl_s[chain_nr].cs.n; | |
784 | /* make sure we won't see a loop that isn't one */ | |
785 | cl_s[chain_nr].cs.n = 0; | |
786 | chain_nr = cl_s[chain_nr].from; | |
787 | if (pos == nentries) | |
788 | continue; | |
789 | } | |
790 | t = (struct ebt_entry_target *) | |
791 | (((char *)e) + e->target_offset); | |
792 | if (strcmp(t->u.name, EBT_STANDARD_TARGET)) | |
793 | goto letscontinue; | |
794 | if (e->target_offset + sizeof(struct ebt_standard_target) > | |
795 | e->next_offset) { | |
796 | BUGPRINT("Standard target size too big\n"); | |
797 | return -1; | |
798 | } | |
799 | verdict = ((struct ebt_standard_target *)t)->verdict; | |
800 | if (verdict >= 0) { /* jump to another chain */ | |
801 | struct ebt_entries *hlp2 = | |
802 | (struct ebt_entries *)(base + verdict); | |
803 | for (i = 0; i < udc_cnt; i++) | |
804 | if (hlp2 == cl_s[i].cs.chaininfo) | |
805 | break; | |
806 | /* bad destination or loop */ | |
807 | if (i == udc_cnt) { | |
808 | BUGPRINT("bad destination\n"); | |
809 | return -1; | |
810 | } | |
811 | if (cl_s[i].cs.n) { | |
812 | BUGPRINT("loop\n"); | |
813 | return -1; | |
814 | } | |
98a0824a AV |
815 | if (cl_s[i].hookmask & (1 << hooknr)) |
816 | goto letscontinue; | |
817 | /* this can't be 0, so the loop test is correct */ | |
1da177e4 LT |
818 | cl_s[i].cs.n = pos + 1; |
819 | pos = 0; | |
98e86403 | 820 | cl_s[i].cs.e = ebt_next_entry(e); |
1da177e4 LT |
821 | e = (struct ebt_entry *)(hlp2->data); |
822 | nentries = hlp2->nentries; | |
823 | cl_s[i].from = chain_nr; | |
824 | chain_nr = i; | |
825 | /* this udc is accessible from the base chain for hooknr */ | |
826 | cl_s[i].hookmask |= (1 << hooknr); | |
827 | continue; | |
828 | } | |
829 | letscontinue: | |
98e86403 | 830 | e = ebt_next_entry(e); |
1da177e4 LT |
831 | pos++; |
832 | } | |
833 | return 0; | |
834 | } | |
835 | ||
836 | /* do the parsing of the table/chains/entries/matches/watchers/targets, heh */ | |
d5d1baa1 | 837 | static int translate_table(struct net *net, const char *name, |
a83d8e8d | 838 | struct ebt_table_info *newinfo) |
1da177e4 LT |
839 | { |
840 | unsigned int i, j, k, udc_cnt; | |
841 | int ret; | |
842 | struct ebt_cl_stack *cl_s = NULL; /* used in the checking for chain loops */ | |
843 | ||
844 | i = 0; | |
1f072c96 | 845 | while (i < NF_BR_NUMHOOKS && !newinfo->hook_entry[i]) |
1da177e4 LT |
846 | i++; |
847 | if (i == NF_BR_NUMHOOKS) { | |
848 | BUGPRINT("No valid hooks specified\n"); | |
849 | return -EINVAL; | |
850 | } | |
1f072c96 | 851 | if (newinfo->hook_entry[i] != (struct ebt_entries *)newinfo->entries) { |
1da177e4 LT |
852 | BUGPRINT("Chains don't start at beginning\n"); |
853 | return -EINVAL; | |
854 | } | |
855 | /* make sure chains are ordered after each other in same order | |
7f495ad9 IM |
856 | * as their corresponding hooks |
857 | */ | |
1da177e4 | 858 | for (j = i + 1; j < NF_BR_NUMHOOKS; j++) { |
1f072c96 | 859 | if (!newinfo->hook_entry[j]) |
1da177e4 | 860 | continue; |
1f072c96 | 861 | if (newinfo->hook_entry[j] <= newinfo->hook_entry[i]) { |
1da177e4 LT |
862 | BUGPRINT("Hook order must be followed\n"); |
863 | return -EINVAL; | |
864 | } | |
865 | i = j; | |
866 | } | |
867 | ||
1da177e4 LT |
868 | /* do some early checkings and initialize some things */ |
869 | i = 0; /* holds the expected nr. of entries for the chain */ | |
870 | j = 0; /* holds the up to now counted entries for the chain */ | |
871 | k = 0; /* holds the total nr. of entries, should equal | |
7f495ad9 IM |
872 | * newinfo->nentries afterwards |
873 | */ | |
1da177e4 LT |
874 | udc_cnt = 0; /* will hold the nr. of user defined chains (udc) */ |
875 | ret = EBT_ENTRY_ITERATE(newinfo->entries, newinfo->entries_size, | |
0e795531 AV |
876 | ebt_check_entry_size_and_hooks, newinfo, |
877 | &i, &j, &k, &udc_cnt); | |
1da177e4 LT |
878 | |
879 | if (ret != 0) | |
880 | return ret; | |
881 | ||
882 | if (i != j) { | |
883 | BUGPRINT("nentries does not equal the nr of entries in the " | |
9d6f229f | 884 | "(last) chain\n"); |
1da177e4 LT |
885 | return -EINVAL; |
886 | } | |
887 | if (k != newinfo->nentries) { | |
888 | BUGPRINT("Total nentries is wrong\n"); | |
889 | return -EINVAL; | |
890 | } | |
891 | ||
1da177e4 | 892 | /* get the location of the udc, put them in an array |
7f495ad9 IM |
893 | * while we're at it, allocate the chainstack |
894 | */ | |
1da177e4 LT |
895 | if (udc_cnt) { |
896 | /* this will get free'd in do_replace()/ebt_register_table() | |
7f495ad9 IM |
897 | * if an error occurs |
898 | */ | |
7ad4d2f6 | 899 | newinfo->chainstack = |
53b8a315 | 900 | vmalloc(nr_cpu_ids * sizeof(*(newinfo->chainstack))); |
1da177e4 LT |
901 | if (!newinfo->chainstack) |
902 | return -ENOMEM; | |
6f912042 | 903 | for_each_possible_cpu(i) { |
1da177e4 | 904 | newinfo->chainstack[i] = |
18bc89aa | 905 | vmalloc(udc_cnt * sizeof(*(newinfo->chainstack[0]))); |
1da177e4 LT |
906 | if (!newinfo->chainstack[i]) { |
907 | while (i) | |
908 | vfree(newinfo->chainstack[--i]); | |
909 | vfree(newinfo->chainstack); | |
910 | newinfo->chainstack = NULL; | |
911 | return -ENOMEM; | |
912 | } | |
913 | } | |
914 | ||
18bc89aa | 915 | cl_s = vmalloc(udc_cnt * sizeof(*cl_s)); |
1da177e4 LT |
916 | if (!cl_s) |
917 | return -ENOMEM; | |
918 | i = 0; /* the i'th udc */ | |
919 | EBT_ENTRY_ITERATE(newinfo->entries, newinfo->entries_size, | |
177abc34 | 920 | ebt_get_udc_positions, newinfo, &i, cl_s); |
1da177e4 LT |
921 | /* sanity check */ |
922 | if (i != udc_cnt) { | |
923 | BUGPRINT("i != udc_cnt\n"); | |
924 | vfree(cl_s); | |
925 | return -EFAULT; | |
926 | } | |
927 | } | |
928 | ||
929 | /* Check for loops */ | |
930 | for (i = 0; i < NF_BR_NUMHOOKS; i++) | |
1f072c96 | 931 | if (newinfo->hook_entry[i]) |
1da177e4 LT |
932 | if (check_chainloops(newinfo->hook_entry[i], |
933 | cl_s, udc_cnt, i, newinfo->entries)) { | |
68d31872 | 934 | vfree(cl_s); |
1da177e4 LT |
935 | return -EINVAL; |
936 | } | |
937 | ||
96de0e25 | 938 | /* we now know the following (along with E=mc²): |
7f495ad9 IM |
939 | * - the nr of entries in each chain is right |
940 | * - the size of the allocated space is right | |
941 | * - all valid hooks have a corresponding chain | |
942 | * - there are no loops | |
943 | * - wrong data can still be on the level of a single entry | |
944 | * - could be there are jumps to places that are not the | |
945 | * beginning of a chain. This can only occur in chains that | |
946 | * are not accessible from any base chains, so we don't care. | |
947 | */ | |
1da177e4 LT |
948 | |
949 | /* used to know what we need to clean up if something goes wrong */ | |
950 | i = 0; | |
951 | ret = EBT_ENTRY_ITERATE(newinfo->entries, newinfo->entries_size, | |
a83d8e8d | 952 | ebt_check_entry, net, newinfo, name, &i, cl_s, udc_cnt); |
1da177e4 LT |
953 | if (ret != 0) { |
954 | EBT_ENTRY_ITERATE(newinfo->entries, newinfo->entries_size, | |
f54e9367 | 955 | ebt_cleanup_entry, net, &i); |
1da177e4 | 956 | } |
68d31872 | 957 | vfree(cl_s); |
1da177e4 LT |
958 | return ret; |
959 | } | |
960 | ||
961 | /* called under write_lock */ | |
d5d1baa1 | 962 | static void get_counters(const struct ebt_counter *oldcounters, |
052a4bc4 | 963 | struct ebt_counter *counters, unsigned int nentries) |
1da177e4 LT |
964 | { |
965 | int i, cpu; | |
966 | struct ebt_counter *counter_base; | |
967 | ||
968 | /* counters of cpu 0 */ | |
969 | memcpy(counters, oldcounters, | |
c8923c6b DM |
970 | sizeof(struct ebt_counter) * nentries); |
971 | ||
1da177e4 | 972 | /* add other counters to those of cpu 0 */ |
6f912042 | 973 | for_each_possible_cpu(cpu) { |
c8923c6b DM |
974 | if (cpu == 0) |
975 | continue; | |
1da177e4 LT |
976 | counter_base = COUNTER_BASE(oldcounters, nentries, cpu); |
977 | for (i = 0; i < nentries; i++) { | |
978 | counters[i].pcnt += counter_base[i].pcnt; | |
979 | counters[i].bcnt += counter_base[i].bcnt; | |
980 | } | |
981 | } | |
982 | } | |
983 | ||
e788759f FW |
984 | static int do_replace_finish(struct net *net, struct ebt_replace *repl, |
985 | struct ebt_table_info *newinfo) | |
1da177e4 | 986 | { |
e788759f | 987 | int ret, i; |
1da177e4 LT |
988 | struct ebt_counter *counterstmp = NULL; |
989 | /* used to be able to unlock earlier */ | |
990 | struct ebt_table_info *table; | |
e788759f | 991 | struct ebt_table *t; |
1da177e4 LT |
992 | |
993 | /* the user wants counters back | |
7f495ad9 IM |
994 | * the check on the size is done later, when we have the lock |
995 | */ | |
e788759f FW |
996 | if (repl->num_counters) { |
997 | unsigned long size = repl->num_counters * sizeof(*counterstmp); | |
998 | counterstmp = vmalloc(size); | |
999 | if (!counterstmp) | |
1000 | return -ENOMEM; | |
1da177e4 | 1001 | } |
1da177e4 | 1002 | |
1da177e4 | 1003 | newinfo->chainstack = NULL; |
e788759f | 1004 | ret = ebt_verify_pointers(repl, newinfo); |
1bc2326c AV |
1005 | if (ret != 0) |
1006 | goto free_counterstmp; | |
1007 | ||
e788759f | 1008 | ret = translate_table(net, repl->name, newinfo); |
1da177e4 LT |
1009 | |
1010 | if (ret != 0) | |
1011 | goto free_counterstmp; | |
1012 | ||
e788759f | 1013 | t = find_table_lock(net, repl->name, &ret, &ebt_mutex); |
1da177e4 LT |
1014 | if (!t) { |
1015 | ret = -ENOENT; | |
1016 | goto free_iterate; | |
1017 | } | |
1018 | ||
1019 | /* the table doesn't like it */ | |
e788759f | 1020 | if (t->check && (ret = t->check(newinfo, repl->valid_hooks))) |
1da177e4 LT |
1021 | goto free_unlock; |
1022 | ||
e788759f | 1023 | if (repl->num_counters && repl->num_counters != t->private->nentries) { |
1da177e4 LT |
1024 | BUGPRINT("Wrong nr. of counters requested\n"); |
1025 | ret = -EINVAL; | |
1026 | goto free_unlock; | |
1027 | } | |
1028 | ||
1029 | /* we have the mutex lock, so no danger in reading this pointer */ | |
1030 | table = t->private; | |
1031 | /* make sure the table can only be rmmod'ed if it contains no rules */ | |
1032 | if (!table->nentries && newinfo->nentries && !try_module_get(t->me)) { | |
1033 | ret = -ENOENT; | |
1034 | goto free_unlock; | |
1035 | } else if (table->nentries && !newinfo->nentries) | |
1036 | module_put(t->me); | |
1037 | /* we need an atomic snapshot of the counters */ | |
1038 | write_lock_bh(&t->lock); | |
e788759f | 1039 | if (repl->num_counters) |
1da177e4 LT |
1040 | get_counters(t->private->counters, counterstmp, |
1041 | t->private->nentries); | |
1042 | ||
1043 | t->private = newinfo; | |
1044 | write_unlock_bh(&t->lock); | |
57b47a53 | 1045 | mutex_unlock(&ebt_mutex); |
1da177e4 | 1046 | /* so, a user can change the chains while having messed up her counter |
7f495ad9 IM |
1047 | * allocation. Only reason why this is done is because this way the lock |
1048 | * is held only once, while this doesn't bring the kernel into a | |
1049 | * dangerous state. | |
1050 | */ | |
e788759f FW |
1051 | if (repl->num_counters && |
1052 | copy_to_user(repl->counters, counterstmp, | |
1053 | repl->num_counters * sizeof(struct ebt_counter))) { | |
c58dd2dd TG |
1054 | /* Silent error, can't fail, new table is already in place */ |
1055 | net_warn_ratelimited("ebtables: counters copy to user failed while replacing table\n"); | |
1da177e4 | 1056 | } |
1da177e4 LT |
1057 | |
1058 | /* decrease module count and free resources */ | |
1059 | EBT_ENTRY_ITERATE(table->entries, table->entries_size, | |
f54e9367 | 1060 | ebt_cleanup_entry, net, NULL); |
1da177e4 LT |
1061 | |
1062 | vfree(table->entries); | |
1063 | if (table->chainstack) { | |
6f912042 | 1064 | for_each_possible_cpu(i) |
1da177e4 LT |
1065 | vfree(table->chainstack[i]); |
1066 | vfree(table->chainstack); | |
1067 | } | |
1068 | vfree(table); | |
1069 | ||
68d31872 | 1070 | vfree(counterstmp); |
c55fbbb4 ND |
1071 | |
1072 | #ifdef CONFIG_AUDIT | |
1073 | if (audit_enabled) { | |
1074 | struct audit_buffer *ab; | |
1075 | ||
1076 | ab = audit_log_start(current->audit_context, GFP_KERNEL, | |
1077 | AUDIT_NETFILTER_CFG); | |
1078 | if (ab) { | |
1079 | audit_log_format(ab, "table=%s family=%u entries=%u", | |
1080 | repl->name, AF_BRIDGE, repl->nentries); | |
1081 | audit_log_end(ab); | |
1082 | } | |
1083 | } | |
1084 | #endif | |
1da177e4 LT |
1085 | return ret; |
1086 | ||
1087 | free_unlock: | |
57b47a53 | 1088 | mutex_unlock(&ebt_mutex); |
1da177e4 LT |
1089 | free_iterate: |
1090 | EBT_ENTRY_ITERATE(newinfo->entries, newinfo->entries_size, | |
f54e9367 | 1091 | ebt_cleanup_entry, net, NULL); |
1da177e4 | 1092 | free_counterstmp: |
68d31872 | 1093 | vfree(counterstmp); |
1da177e4 LT |
1094 | /* can be initialized in translate_table() */ |
1095 | if (newinfo->chainstack) { | |
6f912042 | 1096 | for_each_possible_cpu(i) |
1da177e4 LT |
1097 | vfree(newinfo->chainstack[i]); |
1098 | vfree(newinfo->chainstack); | |
1099 | } | |
e788759f FW |
1100 | return ret; |
1101 | } | |
1102 | ||
1103 | /* replace the table */ | |
1104 | static int do_replace(struct net *net, const void __user *user, | |
1105 | unsigned int len) | |
1106 | { | |
1107 | int ret, countersize; | |
1108 | struct ebt_table_info *newinfo; | |
1109 | struct ebt_replace tmp; | |
1110 | ||
1111 | if (copy_from_user(&tmp, user, sizeof(tmp)) != 0) | |
1112 | return -EFAULT; | |
1113 | ||
1114 | if (len != sizeof(tmp) + tmp.entries_size) { | |
1115 | BUGPRINT("Wrong len argument\n"); | |
1116 | return -EINVAL; | |
1117 | } | |
1118 | ||
1119 | if (tmp.entries_size == 0) { | |
1120 | BUGPRINT("Entries_size never zero\n"); | |
1121 | return -EINVAL; | |
1122 | } | |
1123 | /* overflow check */ | |
1124 | if (tmp.nentries >= ((INT_MAX - sizeof(struct ebt_table_info)) / | |
1125 | NR_CPUS - SMP_CACHE_BYTES) / sizeof(struct ebt_counter)) | |
1126 | return -ENOMEM; | |
1127 | if (tmp.num_counters >= INT_MAX / sizeof(struct ebt_counter)) | |
1128 | return -ENOMEM; | |
1129 | ||
d846f711 VK |
1130 | tmp.name[sizeof(tmp.name) - 1] = 0; |
1131 | ||
e788759f FW |
1132 | countersize = COUNTER_OFFSET(tmp.nentries) * nr_cpu_ids; |
1133 | newinfo = vmalloc(sizeof(*newinfo) + countersize); | |
1134 | if (!newinfo) | |
1135 | return -ENOMEM; | |
1136 | ||
1137 | if (countersize) | |
1138 | memset(newinfo->counters, 0, countersize); | |
1139 | ||
1140 | newinfo->entries = vmalloc(tmp.entries_size); | |
1141 | if (!newinfo->entries) { | |
1142 | ret = -ENOMEM; | |
1143 | goto free_newinfo; | |
1144 | } | |
1145 | if (copy_from_user( | |
1146 | newinfo->entries, tmp.entries, tmp.entries_size) != 0) { | |
1147 | BUGPRINT("Couldn't copy entries from userspace\n"); | |
1148 | ret = -EFAULT; | |
1149 | goto free_entries; | |
1150 | } | |
1151 | ||
1152 | ret = do_replace_finish(net, &tmp, newinfo); | |
1153 | if (ret == 0) | |
1154 | return ret; | |
1da177e4 | 1155 | free_entries: |
68d31872 | 1156 | vfree(newinfo->entries); |
1da177e4 | 1157 | free_newinfo: |
68d31872 | 1158 | vfree(newinfo); |
1da177e4 LT |
1159 | return ret; |
1160 | } | |
1161 | ||
35aad0ff JE |
1162 | struct ebt_table * |
1163 | ebt_register_table(struct net *net, const struct ebt_table *input_table) | |
1da177e4 LT |
1164 | { |
1165 | struct ebt_table_info *newinfo; | |
35aad0ff | 1166 | struct ebt_table *t, *table; |
1e419cd9 | 1167 | struct ebt_replace_kernel *repl; |
1da177e4 | 1168 | int ret, i, countersize; |
df07a81e | 1169 | void *p; |
1da177e4 | 1170 | |
35aad0ff | 1171 | if (input_table == NULL || (repl = input_table->table) == NULL || |
1a9180a2 | 1172 | repl->entries == NULL || repl->entries_size == 0 || |
35aad0ff | 1173 | repl->counters != NULL || input_table->private != NULL) { |
1da177e4 | 1174 | BUGPRINT("Bad table data for ebt_register_table!!!\n"); |
6beceee5 AD |
1175 | return ERR_PTR(-EINVAL); |
1176 | } | |
1177 | ||
1178 | /* Don't add one table to multiple lists. */ | |
35aad0ff | 1179 | table = kmemdup(input_table, sizeof(struct ebt_table), GFP_KERNEL); |
6beceee5 AD |
1180 | if (!table) { |
1181 | ret = -ENOMEM; | |
1182 | goto out; | |
1da177e4 LT |
1183 | } |
1184 | ||
53b8a315 | 1185 | countersize = COUNTER_OFFSET(repl->nentries) * nr_cpu_ids; |
18bc89aa | 1186 | newinfo = vmalloc(sizeof(*newinfo) + countersize); |
1da177e4 LT |
1187 | ret = -ENOMEM; |
1188 | if (!newinfo) | |
6beceee5 | 1189 | goto free_table; |
1da177e4 | 1190 | |
df07a81e AV |
1191 | p = vmalloc(repl->entries_size); |
1192 | if (!p) | |
1da177e4 LT |
1193 | goto free_newinfo; |
1194 | ||
df07a81e AV |
1195 | memcpy(p, repl->entries, repl->entries_size); |
1196 | newinfo->entries = p; | |
1197 | ||
1198 | newinfo->entries_size = repl->entries_size; | |
1199 | newinfo->nentries = repl->nentries; | |
1da177e4 LT |
1200 | |
1201 | if (countersize) | |
1202 | memset(newinfo->counters, 0, countersize); | |
1203 | ||
1204 | /* fill in newinfo and parse the entries */ | |
1205 | newinfo->chainstack = NULL; | |
df07a81e AV |
1206 | for (i = 0; i < NF_BR_NUMHOOKS; i++) { |
1207 | if ((repl->valid_hooks & (1 << i)) == 0) | |
1208 | newinfo->hook_entry[i] = NULL; | |
1209 | else | |
1210 | newinfo->hook_entry[i] = p + | |
1211 | ((char *)repl->hook_entry[i] - repl->entries); | |
1212 | } | |
a83d8e8d | 1213 | ret = translate_table(net, repl->name, newinfo); |
1da177e4 LT |
1214 | if (ret != 0) { |
1215 | BUGPRINT("Translate_table failed\n"); | |
1216 | goto free_chainstack; | |
1217 | } | |
1218 | ||
1219 | if (table->check && table->check(newinfo, table->valid_hooks)) { | |
1220 | BUGPRINT("The table doesn't like its own initial data, lol\n"); | |
5189054d JL |
1221 | ret = -EINVAL; |
1222 | goto free_chainstack; | |
1da177e4 LT |
1223 | } |
1224 | ||
1225 | table->private = newinfo; | |
1226 | rwlock_init(&table->lock); | |
7926dbfa | 1227 | mutex_lock(&ebt_mutex); |
511061e2 | 1228 | list_for_each_entry(t, &net->xt.tables[NFPROTO_BRIDGE], list) { |
df0933dc PM |
1229 | if (strcmp(t->name, table->name) == 0) { |
1230 | ret = -EEXIST; | |
1231 | BUGPRINT("Table name already exists\n"); | |
1232 | goto free_unlock; | |
1233 | } | |
1da177e4 LT |
1234 | } |
1235 | ||
1236 | /* Hold a reference count if the chains aren't empty */ | |
1237 | if (newinfo->nentries && !try_module_get(table->me)) { | |
1238 | ret = -ENOENT; | |
1239 | goto free_unlock; | |
1240 | } | |
511061e2 | 1241 | list_add(&table->list, &net->xt.tables[NFPROTO_BRIDGE]); |
57b47a53 | 1242 | mutex_unlock(&ebt_mutex); |
6beceee5 | 1243 | return table; |
1da177e4 | 1244 | free_unlock: |
57b47a53 | 1245 | mutex_unlock(&ebt_mutex); |
1da177e4 LT |
1246 | free_chainstack: |
1247 | if (newinfo->chainstack) { | |
6f912042 | 1248 | for_each_possible_cpu(i) |
1da177e4 LT |
1249 | vfree(newinfo->chainstack[i]); |
1250 | vfree(newinfo->chainstack); | |
1251 | } | |
1252 | vfree(newinfo->entries); | |
1253 | free_newinfo: | |
1254 | vfree(newinfo); | |
6beceee5 AD |
1255 | free_table: |
1256 | kfree(table); | |
1257 | out: | |
1258 | return ERR_PTR(ret); | |
1da177e4 LT |
1259 | } |
1260 | ||
f54e9367 | 1261 | void ebt_unregister_table(struct net *net, struct ebt_table *table) |
1da177e4 LT |
1262 | { |
1263 | int i; | |
1264 | ||
1265 | if (!table) { | |
1266 | BUGPRINT("Request to unregister NULL table!!!\n"); | |
1267 | return; | |
1268 | } | |
57b47a53 | 1269 | mutex_lock(&ebt_mutex); |
df0933dc | 1270 | list_del(&table->list); |
57b47a53 | 1271 | mutex_unlock(&ebt_mutex); |
dbcdf85a | 1272 | EBT_ENTRY_ITERATE(table->private->entries, table->private->entries_size, |
f54e9367 | 1273 | ebt_cleanup_entry, net, NULL); |
dbcdf85a AD |
1274 | if (table->private->nentries) |
1275 | module_put(table->me); | |
68d31872 | 1276 | vfree(table->private->entries); |
1da177e4 | 1277 | if (table->private->chainstack) { |
6f912042 | 1278 | for_each_possible_cpu(i) |
1da177e4 LT |
1279 | vfree(table->private->chainstack[i]); |
1280 | vfree(table->private->chainstack); | |
1281 | } | |
1282 | vfree(table->private); | |
6beceee5 | 1283 | kfree(table); |
1da177e4 LT |
1284 | } |
1285 | ||
1286 | /* userspace just supplied us with counters */ | |
49facff9 FW |
1287 | static int do_update_counters(struct net *net, const char *name, |
1288 | struct ebt_counter __user *counters, | |
1289 | unsigned int num_counters, | |
1290 | const void __user *user, unsigned int len) | |
1da177e4 LT |
1291 | { |
1292 | int i, ret; | |
1293 | struct ebt_counter *tmp; | |
1da177e4 LT |
1294 | struct ebt_table *t; |
1295 | ||
49facff9 | 1296 | if (num_counters == 0) |
1da177e4 LT |
1297 | return -EINVAL; |
1298 | ||
49facff9 FW |
1299 | tmp = vmalloc(num_counters * sizeof(*tmp)); |
1300 | if (!tmp) | |
1da177e4 | 1301 | return -ENOMEM; |
1da177e4 | 1302 | |
49facff9 | 1303 | t = find_table_lock(net, name, &ret, &ebt_mutex); |
1da177e4 LT |
1304 | if (!t) |
1305 | goto free_tmp; | |
1306 | ||
49facff9 | 1307 | if (num_counters != t->private->nentries) { |
1da177e4 LT |
1308 | BUGPRINT("Wrong nr of counters\n"); |
1309 | ret = -EINVAL; | |
1310 | goto unlock_mutex; | |
1311 | } | |
1312 | ||
49facff9 | 1313 | if (copy_from_user(tmp, counters, num_counters * sizeof(*counters))) { |
1da177e4 LT |
1314 | ret = -EFAULT; |
1315 | goto unlock_mutex; | |
1316 | } | |
1317 | ||
1318 | /* we want an atomic add of the counters */ | |
1319 | write_lock_bh(&t->lock); | |
1320 | ||
1321 | /* we add to the counters of the first cpu */ | |
49facff9 | 1322 | for (i = 0; i < num_counters; i++) { |
1da177e4 LT |
1323 | t->private->counters[i].pcnt += tmp[i].pcnt; |
1324 | t->private->counters[i].bcnt += tmp[i].bcnt; | |
1325 | } | |
1326 | ||
1327 | write_unlock_bh(&t->lock); | |
1328 | ret = 0; | |
1329 | unlock_mutex: | |
57b47a53 | 1330 | mutex_unlock(&ebt_mutex); |
1da177e4 LT |
1331 | free_tmp: |
1332 | vfree(tmp); | |
1333 | return ret; | |
1334 | } | |
1335 | ||
49facff9 FW |
1336 | static int update_counters(struct net *net, const void __user *user, |
1337 | unsigned int len) | |
1338 | { | |
1339 | struct ebt_replace hlp; | |
1340 | ||
1341 | if (copy_from_user(&hlp, user, sizeof(hlp))) | |
1342 | return -EFAULT; | |
1343 | ||
1344 | if (len != sizeof(hlp) + hlp.num_counters * sizeof(struct ebt_counter)) | |
1345 | return -EINVAL; | |
1346 | ||
1347 | return do_update_counters(net, hlp.name, hlp.counters, | |
1348 | hlp.num_counters, user, len); | |
1349 | } | |
1350 | ||
d5d1baa1 | 1351 | static inline int ebt_make_matchname(const struct ebt_entry_match *m, |
052a4bc4 | 1352 | const char *base, char __user *ubase) |
1da177e4 | 1353 | { |
1e419cd9 | 1354 | char __user *hlp = ubase + ((char *)m - base); |
848edc69 SN |
1355 | char name[EBT_FUNCTION_MAXNAMELEN] = {}; |
1356 | ||
1357 | /* ebtables expects 32 bytes long names but xt_match names are 29 bytes | |
7f495ad9 IM |
1358 | * long. Copy 29 bytes and fill remaining bytes with zeroes. |
1359 | */ | |
8bc14d25 | 1360 | strlcpy(name, m->u.match->name, sizeof(name)); |
848edc69 | 1361 | if (copy_to_user(hlp, name, EBT_FUNCTION_MAXNAMELEN)) |
1da177e4 LT |
1362 | return -EFAULT; |
1363 | return 0; | |
1364 | } | |
1365 | ||
d5d1baa1 | 1366 | static inline int ebt_make_watchername(const struct ebt_entry_watcher *w, |
052a4bc4 | 1367 | const char *base, char __user *ubase) |
1da177e4 | 1368 | { |
1e419cd9 | 1369 | char __user *hlp = ubase + ((char *)w - base); |
848edc69 SN |
1370 | char name[EBT_FUNCTION_MAXNAMELEN] = {}; |
1371 | ||
8bc14d25 | 1372 | strlcpy(name, w->u.watcher->name, sizeof(name)); |
c1bc1d25 | 1373 | if (copy_to_user(hlp, name, EBT_FUNCTION_MAXNAMELEN)) |
1da177e4 LT |
1374 | return -EFAULT; |
1375 | return 0; | |
1376 | } | |
1377 | ||
052a4bc4 IM |
1378 | static inline int ebt_make_names(struct ebt_entry *e, const char *base, |
1379 | char __user *ubase) | |
1da177e4 LT |
1380 | { |
1381 | int ret; | |
1e419cd9 | 1382 | char __user *hlp; |
d5d1baa1 | 1383 | const struct ebt_entry_target *t; |
848edc69 | 1384 | char name[EBT_FUNCTION_MAXNAMELEN] = {}; |
1da177e4 | 1385 | |
40642f95 | 1386 | if (e->bitmask == 0) |
1da177e4 LT |
1387 | return 0; |
1388 | ||
1e419cd9 | 1389 | hlp = ubase + (((char *)e + e->target_offset) - base); |
1da177e4 | 1390 | t = (struct ebt_entry_target *)(((char *)e) + e->target_offset); |
9d6f229f | 1391 | |
1da177e4 LT |
1392 | ret = EBT_MATCH_ITERATE(e, ebt_make_matchname, base, ubase); |
1393 | if (ret != 0) | |
1394 | return ret; | |
1395 | ret = EBT_WATCHER_ITERATE(e, ebt_make_watchername, base, ubase); | |
1396 | if (ret != 0) | |
1397 | return ret; | |
8bc14d25 | 1398 | strlcpy(name, t->u.target->name, sizeof(name)); |
848edc69 | 1399 | if (copy_to_user(hlp, name, EBT_FUNCTION_MAXNAMELEN)) |
1da177e4 LT |
1400 | return -EFAULT; |
1401 | return 0; | |
1402 | } | |
1403 | ||
837395aa | 1404 | static int copy_counters_to_user(struct ebt_table *t, |
052a4bc4 IM |
1405 | const struct ebt_counter *oldcounters, |
1406 | void __user *user, unsigned int num_counters, | |
1407 | unsigned int nentries) | |
837395aa FW |
1408 | { |
1409 | struct ebt_counter *counterstmp; | |
1410 | int ret = 0; | |
1411 | ||
1412 | /* userspace might not need the counters */ | |
1413 | if (num_counters == 0) | |
1414 | return 0; | |
1415 | ||
1416 | if (num_counters != nentries) { | |
1417 | BUGPRINT("Num_counters wrong\n"); | |
1418 | return -EINVAL; | |
1419 | } | |
1420 | ||
1421 | counterstmp = vmalloc(nentries * sizeof(*counterstmp)); | |
1422 | if (!counterstmp) | |
1423 | return -ENOMEM; | |
1424 | ||
1425 | write_lock_bh(&t->lock); | |
1426 | get_counters(oldcounters, counterstmp, nentries); | |
1427 | write_unlock_bh(&t->lock); | |
1428 | ||
1429 | if (copy_to_user(user, counterstmp, | |
1430 | nentries * sizeof(struct ebt_counter))) | |
1431 | ret = -EFAULT; | |
1432 | vfree(counterstmp); | |
1433 | return ret; | |
1434 | } | |
1435 | ||
57b47a53 | 1436 | /* called with ebt_mutex locked */ |
1da177e4 | 1437 | static int copy_everything_to_user(struct ebt_table *t, void __user *user, |
052a4bc4 | 1438 | const int *len, int cmd) |
1da177e4 LT |
1439 | { |
1440 | struct ebt_replace tmp; | |
d5d1baa1 | 1441 | const struct ebt_counter *oldcounters; |
1da177e4 | 1442 | unsigned int entries_size, nentries; |
837395aa | 1443 | int ret; |
1da177e4 LT |
1444 | char *entries; |
1445 | ||
1446 | if (cmd == EBT_SO_GET_ENTRIES) { | |
1447 | entries_size = t->private->entries_size; | |
1448 | nentries = t->private->nentries; | |
1449 | entries = t->private->entries; | |
1450 | oldcounters = t->private->counters; | |
1451 | } else { | |
1452 | entries_size = t->table->entries_size; | |
1453 | nentries = t->table->nentries; | |
1454 | entries = t->table->entries; | |
1455 | oldcounters = t->table->counters; | |
1456 | } | |
1457 | ||
90b89af7 | 1458 | if (copy_from_user(&tmp, user, sizeof(tmp))) |
1da177e4 | 1459 | return -EFAULT; |
1da177e4 LT |
1460 | |
1461 | if (*len != sizeof(struct ebt_replace) + entries_size + | |
31a5b837 | 1462 | (tmp.num_counters ? nentries * sizeof(struct ebt_counter) : 0)) |
1da177e4 | 1463 | return -EINVAL; |
1da177e4 LT |
1464 | |
1465 | if (tmp.nentries != nentries) { | |
1466 | BUGPRINT("Nentries wrong\n"); | |
1467 | return -EINVAL; | |
1468 | } | |
1469 | ||
1470 | if (tmp.entries_size != entries_size) { | |
1471 | BUGPRINT("Wrong size\n"); | |
1472 | return -EINVAL; | |
1473 | } | |
1474 | ||
837395aa FW |
1475 | ret = copy_counters_to_user(t, oldcounters, tmp.counters, |
1476 | tmp.num_counters, nentries); | |
1477 | if (ret) | |
1478 | return ret; | |
1da177e4 LT |
1479 | |
1480 | if (copy_to_user(tmp.entries, entries, entries_size)) { | |
1481 | BUGPRINT("Couldn't copy entries to userspace\n"); | |
1482 | return -EFAULT; | |
1483 | } | |
1484 | /* set the match/watcher/target names right */ | |
1485 | return EBT_ENTRY_ITERATE(entries, entries_size, | |
1486 | ebt_make_names, entries, tmp.entries); | |
1487 | } | |
1488 | ||
1489 | static int do_ebt_set_ctl(struct sock *sk, | |
1490 | int cmd, void __user *user, unsigned int len) | |
1491 | { | |
1492 | int ret; | |
bb12b8b2 | 1493 | struct net *net = sock_net(sk); |
1da177e4 | 1494 | |
bb12b8b2 | 1495 | if (!ns_capable(net->user_ns, CAP_NET_ADMIN)) |
dce766af FW |
1496 | return -EPERM; |
1497 | ||
31a5b837 | 1498 | switch (cmd) { |
1da177e4 | 1499 | case EBT_SO_SET_ENTRIES: |
bb12b8b2 | 1500 | ret = do_replace(net, user, len); |
1da177e4 LT |
1501 | break; |
1502 | case EBT_SO_SET_COUNTERS: | |
bb12b8b2 | 1503 | ret = update_counters(net, user, len); |
1da177e4 LT |
1504 | break; |
1505 | default: | |
1506 | ret = -EINVAL; | |
81e675c2 | 1507 | } |
1da177e4 LT |
1508 | return ret; |
1509 | } | |
1510 | ||
1511 | static int do_ebt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len) | |
1512 | { | |
1513 | int ret; | |
1514 | struct ebt_replace tmp; | |
1515 | struct ebt_table *t; | |
bb12b8b2 | 1516 | struct net *net = sock_net(sk); |
1da177e4 | 1517 | |
bb12b8b2 | 1518 | if (!ns_capable(net->user_ns, CAP_NET_ADMIN)) |
dce766af FW |
1519 | return -EPERM; |
1520 | ||
1da177e4 LT |
1521 | if (copy_from_user(&tmp, user, sizeof(tmp))) |
1522 | return -EFAULT; | |
1523 | ||
bb12b8b2 | 1524 | t = find_table_lock(net, tmp.name, &ret, &ebt_mutex); |
1da177e4 LT |
1525 | if (!t) |
1526 | return ret; | |
1527 | ||
31a5b837 | 1528 | switch (cmd) { |
1da177e4 LT |
1529 | case EBT_SO_GET_INFO: |
1530 | case EBT_SO_GET_INIT_INFO: | |
31a5b837 | 1531 | if (*len != sizeof(struct ebt_replace)) { |
1da177e4 | 1532 | ret = -EINVAL; |
57b47a53 | 1533 | mutex_unlock(&ebt_mutex); |
1da177e4 LT |
1534 | break; |
1535 | } | |
1536 | if (cmd == EBT_SO_GET_INFO) { | |
1537 | tmp.nentries = t->private->nentries; | |
1538 | tmp.entries_size = t->private->entries_size; | |
1539 | tmp.valid_hooks = t->valid_hooks; | |
1540 | } else { | |
1541 | tmp.nentries = t->table->nentries; | |
1542 | tmp.entries_size = t->table->entries_size; | |
1543 | tmp.valid_hooks = t->table->valid_hooks; | |
1544 | } | |
57b47a53 | 1545 | mutex_unlock(&ebt_mutex); |
31a5b837 | 1546 | if (copy_to_user(user, &tmp, *len) != 0) { |
1da177e4 LT |
1547 | BUGPRINT("c2u Didn't work\n"); |
1548 | ret = -EFAULT; | |
1549 | break; | |
1550 | } | |
1551 | ret = 0; | |
1552 | break; | |
1553 | ||
1554 | case EBT_SO_GET_ENTRIES: | |
1555 | case EBT_SO_GET_INIT_ENTRIES: | |
1556 | ret = copy_everything_to_user(t, user, len, cmd); | |
57b47a53 | 1557 | mutex_unlock(&ebt_mutex); |
1da177e4 LT |
1558 | break; |
1559 | ||
1560 | default: | |
57b47a53 | 1561 | mutex_unlock(&ebt_mutex); |
1da177e4 LT |
1562 | ret = -EINVAL; |
1563 | } | |
1564 | ||
1565 | return ret; | |
1566 | } | |
1567 | ||
81e675c2 FW |
1568 | #ifdef CONFIG_COMPAT |
1569 | /* 32 bit-userspace compatibility definitions. */ | |
1570 | struct compat_ebt_replace { | |
1571 | char name[EBT_TABLE_MAXNAMELEN]; | |
1572 | compat_uint_t valid_hooks; | |
1573 | compat_uint_t nentries; | |
1574 | compat_uint_t entries_size; | |
1575 | /* start of the chains */ | |
1576 | compat_uptr_t hook_entry[NF_BR_NUMHOOKS]; | |
1577 | /* nr of counters userspace expects back */ | |
1578 | compat_uint_t num_counters; | |
1579 | /* where the kernel will put the old counters. */ | |
1580 | compat_uptr_t counters; | |
1581 | compat_uptr_t entries; | |
1582 | }; | |
1583 | ||
1584 | /* struct ebt_entry_match, _target and _watcher have same layout */ | |
1585 | struct compat_ebt_entry_mwt { | |
1586 | union { | |
1587 | char name[EBT_FUNCTION_MAXNAMELEN]; | |
1588 | compat_uptr_t ptr; | |
1589 | } u; | |
1590 | compat_uint_t match_size; | |
1591 | compat_uint_t data[0]; | |
1592 | }; | |
1593 | ||
1594 | /* account for possible padding between match_size and ->data */ | |
1595 | static int ebt_compat_entry_padsize(void) | |
1596 | { | |
1597 | BUILD_BUG_ON(XT_ALIGN(sizeof(struct ebt_entry_match)) < | |
1598 | COMPAT_XT_ALIGN(sizeof(struct compat_ebt_entry_mwt))); | |
1599 | return (int) XT_ALIGN(sizeof(struct ebt_entry_match)) - | |
1600 | COMPAT_XT_ALIGN(sizeof(struct compat_ebt_entry_mwt)); | |
1601 | } | |
1602 | ||
1603 | static int ebt_compat_match_offset(const struct xt_match *match, | |
1604 | unsigned int userlen) | |
1605 | { | |
7f495ad9 | 1606 | /* ebt_among needs special handling. The kernel .matchsize is |
81e675c2 FW |
1607 | * set to -1 at registration time; at runtime an EBT_ALIGN()ed |
1608 | * value is expected. | |
1609 | * Example: userspace sends 4500, ebt_among.c wants 4504. | |
1610 | */ | |
1611 | if (unlikely(match->matchsize == -1)) | |
1612 | return XT_ALIGN(userlen) - COMPAT_XT_ALIGN(userlen); | |
1613 | return xt_compat_match_offset(match); | |
1614 | } | |
1615 | ||
1616 | static int compat_match_to_user(struct ebt_entry_match *m, void __user **dstptr, | |
1617 | unsigned int *size) | |
1618 | { | |
1619 | const struct xt_match *match = m->u.match; | |
1620 | struct compat_ebt_entry_mwt __user *cm = *dstptr; | |
1621 | int off = ebt_compat_match_offset(match, m->match_size); | |
1622 | compat_uint_t msize = m->match_size - off; | |
1623 | ||
1624 | BUG_ON(off >= m->match_size); | |
1625 | ||
1626 | if (copy_to_user(cm->u.name, match->name, | |
1627 | strlen(match->name) + 1) || put_user(msize, &cm->match_size)) | |
1628 | return -EFAULT; | |
1629 | ||
1630 | if (match->compat_to_user) { | |
1631 | if (match->compat_to_user(cm->data, m->data)) | |
1632 | return -EFAULT; | |
1633 | } else if (copy_to_user(cm->data, m->data, msize)) | |
1634 | return -EFAULT; | |
1635 | ||
1636 | *size -= ebt_compat_entry_padsize() + off; | |
1637 | *dstptr = cm->data; | |
1638 | *dstptr += msize; | |
1639 | return 0; | |
1640 | } | |
1641 | ||
1642 | static int compat_target_to_user(struct ebt_entry_target *t, | |
1643 | void __user **dstptr, | |
1644 | unsigned int *size) | |
1645 | { | |
1646 | const struct xt_target *target = t->u.target; | |
1647 | struct compat_ebt_entry_mwt __user *cm = *dstptr; | |
1648 | int off = xt_compat_target_offset(target); | |
1649 | compat_uint_t tsize = t->target_size - off; | |
1650 | ||
1651 | BUG_ON(off >= t->target_size); | |
1652 | ||
1653 | if (copy_to_user(cm->u.name, target->name, | |
1654 | strlen(target->name) + 1) || put_user(tsize, &cm->match_size)) | |
1655 | return -EFAULT; | |
1656 | ||
1657 | if (target->compat_to_user) { | |
1658 | if (target->compat_to_user(cm->data, t->data)) | |
1659 | return -EFAULT; | |
1660 | } else if (copy_to_user(cm->data, t->data, tsize)) | |
1661 | return -EFAULT; | |
1662 | ||
1663 | *size -= ebt_compat_entry_padsize() + off; | |
1664 | *dstptr = cm->data; | |
1665 | *dstptr += tsize; | |
1666 | return 0; | |
1667 | } | |
1668 | ||
1669 | static int compat_watcher_to_user(struct ebt_entry_watcher *w, | |
1670 | void __user **dstptr, | |
1671 | unsigned int *size) | |
1672 | { | |
1673 | return compat_target_to_user((struct ebt_entry_target *)w, | |
1674 | dstptr, size); | |
1675 | } | |
1676 | ||
1677 | static int compat_copy_entry_to_user(struct ebt_entry *e, void __user **dstptr, | |
1678 | unsigned int *size) | |
1679 | { | |
1680 | struct ebt_entry_target *t; | |
1681 | struct ebt_entry __user *ce; | |
1682 | u32 watchers_offset, target_offset, next_offset; | |
1683 | compat_uint_t origsize; | |
1684 | int ret; | |
1685 | ||
1686 | if (e->bitmask == 0) { | |
1687 | if (*size < sizeof(struct ebt_entries)) | |
1688 | return -EINVAL; | |
1689 | if (copy_to_user(*dstptr, e, sizeof(struct ebt_entries))) | |
1690 | return -EFAULT; | |
1691 | ||
1692 | *dstptr += sizeof(struct ebt_entries); | |
1693 | *size -= sizeof(struct ebt_entries); | |
1694 | return 0; | |
1695 | } | |
1696 | ||
1697 | if (*size < sizeof(*ce)) | |
1698 | return -EINVAL; | |
1699 | ||
1700 | ce = (struct ebt_entry __user *)*dstptr; | |
1701 | if (copy_to_user(ce, e, sizeof(*ce))) | |
1702 | return -EFAULT; | |
1703 | ||
1704 | origsize = *size; | |
1705 | *dstptr += sizeof(*ce); | |
1706 | ||
1707 | ret = EBT_MATCH_ITERATE(e, compat_match_to_user, dstptr, size); | |
1708 | if (ret) | |
1709 | return ret; | |
1710 | watchers_offset = e->watchers_offset - (origsize - *size); | |
1711 | ||
1712 | ret = EBT_WATCHER_ITERATE(e, compat_watcher_to_user, dstptr, size); | |
1713 | if (ret) | |
1714 | return ret; | |
1715 | target_offset = e->target_offset - (origsize - *size); | |
1716 | ||
1717 | t = (struct ebt_entry_target *) ((char *) e + e->target_offset); | |
1718 | ||
1719 | ret = compat_target_to_user(t, dstptr, size); | |
1720 | if (ret) | |
1721 | return ret; | |
1722 | next_offset = e->next_offset - (origsize - *size); | |
1723 | ||
1724 | if (put_user(watchers_offset, &ce->watchers_offset) || | |
1725 | put_user(target_offset, &ce->target_offset) || | |
1726 | put_user(next_offset, &ce->next_offset)) | |
1727 | return -EFAULT; | |
1728 | ||
1729 | *size -= sizeof(*ce); | |
1730 | return 0; | |
1731 | } | |
1732 | ||
1733 | static int compat_calc_match(struct ebt_entry_match *m, int *off) | |
1734 | { | |
1735 | *off += ebt_compat_match_offset(m->u.match, m->match_size); | |
1736 | *off += ebt_compat_entry_padsize(); | |
1737 | return 0; | |
1738 | } | |
1739 | ||
1740 | static int compat_calc_watcher(struct ebt_entry_watcher *w, int *off) | |
1741 | { | |
1742 | *off += xt_compat_target_offset(w->u.watcher); | |
1743 | *off += ebt_compat_entry_padsize(); | |
1744 | return 0; | |
1745 | } | |
1746 | ||
1747 | static int compat_calc_entry(const struct ebt_entry *e, | |
1748 | const struct ebt_table_info *info, | |
1749 | const void *base, | |
1750 | struct compat_ebt_replace *newinfo) | |
1751 | { | |
1752 | const struct ebt_entry_target *t; | |
1753 | unsigned int entry_offset; | |
1754 | int off, ret, i; | |
1755 | ||
1756 | if (e->bitmask == 0) | |
1757 | return 0; | |
1758 | ||
1759 | off = 0; | |
1760 | entry_offset = (void *)e - base; | |
1761 | ||
1762 | EBT_MATCH_ITERATE(e, compat_calc_match, &off); | |
1763 | EBT_WATCHER_ITERATE(e, compat_calc_watcher, &off); | |
1764 | ||
1765 | t = (const struct ebt_entry_target *) ((char *) e + e->target_offset); | |
1766 | ||
1767 | off += xt_compat_target_offset(t->u.target); | |
1768 | off += ebt_compat_entry_padsize(); | |
1769 | ||
1770 | newinfo->entries_size -= off; | |
1771 | ||
1772 | ret = xt_compat_add_offset(NFPROTO_BRIDGE, entry_offset, off); | |
1773 | if (ret) | |
1774 | return ret; | |
1775 | ||
1776 | for (i = 0; i < NF_BR_NUMHOOKS; i++) { | |
1777 | const void *hookptr = info->hook_entry[i]; | |
1778 | if (info->hook_entry[i] && | |
1779 | (e < (struct ebt_entry *)(base - hookptr))) { | |
1780 | newinfo->hook_entry[i] -= off; | |
1781 | pr_debug("0x%08X -> 0x%08X\n", | |
1782 | newinfo->hook_entry[i] + off, | |
1783 | newinfo->hook_entry[i]); | |
1784 | } | |
1785 | } | |
1786 | ||
1787 | return 0; | |
1788 | } | |
1789 | ||
1790 | ||
1791 | static int compat_table_info(const struct ebt_table_info *info, | |
1792 | struct compat_ebt_replace *newinfo) | |
1793 | { | |
1794 | unsigned int size = info->entries_size; | |
1795 | const void *entries = info->entries; | |
1796 | ||
1797 | newinfo->entries_size = size; | |
1798 | ||
5a6351ee | 1799 | xt_compat_init_offsets(NFPROTO_BRIDGE, info->nentries); |
81e675c2 FW |
1800 | return EBT_ENTRY_ITERATE(entries, size, compat_calc_entry, info, |
1801 | entries, newinfo); | |
1802 | } | |
1803 | ||
1804 | static int compat_copy_everything_to_user(struct ebt_table *t, | |
1805 | void __user *user, int *len, int cmd) | |
1806 | { | |
1807 | struct compat_ebt_replace repl, tmp; | |
1808 | struct ebt_counter *oldcounters; | |
1809 | struct ebt_table_info tinfo; | |
1810 | int ret; | |
1811 | void __user *pos; | |
1812 | ||
1813 | memset(&tinfo, 0, sizeof(tinfo)); | |
1814 | ||
1815 | if (cmd == EBT_SO_GET_ENTRIES) { | |
1816 | tinfo.entries_size = t->private->entries_size; | |
1817 | tinfo.nentries = t->private->nentries; | |
1818 | tinfo.entries = t->private->entries; | |
1819 | oldcounters = t->private->counters; | |
1820 | } else { | |
1821 | tinfo.entries_size = t->table->entries_size; | |
1822 | tinfo.nentries = t->table->nentries; | |
1823 | tinfo.entries = t->table->entries; | |
1824 | oldcounters = t->table->counters; | |
1825 | } | |
1826 | ||
1827 | if (copy_from_user(&tmp, user, sizeof(tmp))) | |
1828 | return -EFAULT; | |
1829 | ||
1830 | if (tmp.nentries != tinfo.nentries || | |
1831 | (tmp.num_counters && tmp.num_counters != tinfo.nentries)) | |
1832 | return -EINVAL; | |
1833 | ||
1834 | memcpy(&repl, &tmp, sizeof(repl)); | |
1835 | if (cmd == EBT_SO_GET_ENTRIES) | |
1836 | ret = compat_table_info(t->private, &repl); | |
1837 | else | |
1838 | ret = compat_table_info(&tinfo, &repl); | |
1839 | if (ret) | |
1840 | return ret; | |
1841 | ||
1842 | if (*len != sizeof(tmp) + repl.entries_size + | |
1843 | (tmp.num_counters? tinfo.nentries * sizeof(struct ebt_counter): 0)) { | |
1844 | pr_err("wrong size: *len %d, entries_size %u, replsz %d\n", | |
1845 | *len, tinfo.entries_size, repl.entries_size); | |
1846 | return -EINVAL; | |
1847 | } | |
1848 | ||
1849 | /* userspace might not need the counters */ | |
1850 | ret = copy_counters_to_user(t, oldcounters, compat_ptr(tmp.counters), | |
1851 | tmp.num_counters, tinfo.nentries); | |
1852 | if (ret) | |
1853 | return ret; | |
1854 | ||
1855 | pos = compat_ptr(tmp.entries); | |
1856 | return EBT_ENTRY_ITERATE(tinfo.entries, tinfo.entries_size, | |
1857 | compat_copy_entry_to_user, &pos, &tmp.entries_size); | |
1858 | } | |
1859 | ||
1860 | struct ebt_entries_buf_state { | |
1861 | char *buf_kern_start; /* kernel buffer to copy (translated) data to */ | |
1862 | u32 buf_kern_len; /* total size of kernel buffer */ | |
1863 | u32 buf_kern_offset; /* amount of data copied so far */ | |
1864 | u32 buf_user_offset; /* read position in userspace buffer */ | |
1865 | }; | |
1866 | ||
1867 | static int ebt_buf_count(struct ebt_entries_buf_state *state, unsigned int sz) | |
1868 | { | |
1869 | state->buf_kern_offset += sz; | |
1870 | return state->buf_kern_offset >= sz ? 0 : -EINVAL; | |
1871 | } | |
1872 | ||
1873 | static int ebt_buf_add(struct ebt_entries_buf_state *state, | |
1874 | void *data, unsigned int sz) | |
1875 | { | |
1876 | if (state->buf_kern_start == NULL) | |
1877 | goto count_only; | |
1878 | ||
1879 | BUG_ON(state->buf_kern_offset + sz > state->buf_kern_len); | |
1880 | ||
1881 | memcpy(state->buf_kern_start + state->buf_kern_offset, data, sz); | |
1882 | ||
1883 | count_only: | |
1884 | state->buf_user_offset += sz; | |
1885 | return ebt_buf_count(state, sz); | |
1886 | } | |
1887 | ||
1888 | static int ebt_buf_add_pad(struct ebt_entries_buf_state *state, unsigned int sz) | |
1889 | { | |
1890 | char *b = state->buf_kern_start; | |
1891 | ||
1892 | BUG_ON(b && state->buf_kern_offset > state->buf_kern_len); | |
1893 | ||
1894 | if (b != NULL && sz > 0) | |
1895 | memset(b + state->buf_kern_offset, 0, sz); | |
1896 | /* do not adjust ->buf_user_offset here, we added kernel-side padding */ | |
1897 | return ebt_buf_count(state, sz); | |
1898 | } | |
1899 | ||
1900 | enum compat_mwt { | |
1901 | EBT_COMPAT_MATCH, | |
1902 | EBT_COMPAT_WATCHER, | |
1903 | EBT_COMPAT_TARGET, | |
1904 | }; | |
1905 | ||
1906 | static int compat_mtw_from_user(struct compat_ebt_entry_mwt *mwt, | |
1907 | enum compat_mwt compat_mwt, | |
1908 | struct ebt_entries_buf_state *state, | |
1909 | const unsigned char *base) | |
1910 | { | |
1911 | char name[EBT_FUNCTION_MAXNAMELEN]; | |
1912 | struct xt_match *match; | |
1913 | struct xt_target *wt; | |
1914 | void *dst = NULL; | |
103a9778 | 1915 | int off, pad = 0; |
97242c85 | 1916 | unsigned int size_kern, match_size = mwt->match_size; |
81e675c2 FW |
1917 | |
1918 | strlcpy(name, mwt->u.name, sizeof(name)); | |
1919 | ||
1920 | if (state->buf_kern_start) | |
1921 | dst = state->buf_kern_start + state->buf_kern_offset; | |
1922 | ||
81e675c2 FW |
1923 | switch (compat_mwt) { |
1924 | case EBT_COMPAT_MATCH: | |
e899b111 | 1925 | match = xt_request_find_match(NFPROTO_BRIDGE, name, 0); |
81e675c2 FW |
1926 | if (IS_ERR(match)) |
1927 | return PTR_ERR(match); | |
1928 | ||
1929 | off = ebt_compat_match_offset(match, match_size); | |
1930 | if (dst) { | |
1931 | if (match->compat_from_user) | |
1932 | match->compat_from_user(dst, mwt->data); | |
1933 | else | |
1934 | memcpy(dst, mwt->data, match_size); | |
1935 | } | |
1936 | ||
1937 | size_kern = match->matchsize; | |
1938 | if (unlikely(size_kern == -1)) | |
1939 | size_kern = match_size; | |
1940 | module_put(match->me); | |
1941 | break; | |
1942 | case EBT_COMPAT_WATCHER: /* fallthrough */ | |
1943 | case EBT_COMPAT_TARGET: | |
e899b111 | 1944 | wt = xt_request_find_target(NFPROTO_BRIDGE, name, 0); |
81e675c2 FW |
1945 | if (IS_ERR(wt)) |
1946 | return PTR_ERR(wt); | |
1947 | off = xt_compat_target_offset(wt); | |
1948 | ||
1949 | if (dst) { | |
1950 | if (wt->compat_from_user) | |
1951 | wt->compat_from_user(dst, mwt->data); | |
1952 | else | |
1953 | memcpy(dst, mwt->data, match_size); | |
1954 | } | |
1955 | ||
1956 | size_kern = wt->targetsize; | |
1957 | module_put(wt->me); | |
1958 | break; | |
97242c85 DM |
1959 | |
1960 | default: | |
1961 | return -EINVAL; | |
81e675c2 FW |
1962 | } |
1963 | ||
81e675c2 FW |
1964 | state->buf_kern_offset += match_size + off; |
1965 | state->buf_user_offset += match_size; | |
1966 | pad = XT_ALIGN(size_kern) - size_kern; | |
1967 | ||
1968 | if (pad > 0 && dst) { | |
1969 | BUG_ON(state->buf_kern_len <= pad); | |
1970 | BUG_ON(state->buf_kern_offset - (match_size + off) + size_kern > state->buf_kern_len - pad); | |
1971 | memset(dst + size_kern, 0, pad); | |
1972 | } | |
1973 | return off + match_size; | |
1974 | } | |
1975 | ||
7f495ad9 | 1976 | /* return size of all matches, watchers or target, including necessary |
81e675c2 FW |
1977 | * alignment and padding. |
1978 | */ | |
1979 | static int ebt_size_mwt(struct compat_ebt_entry_mwt *match32, | |
1980 | unsigned int size_left, enum compat_mwt type, | |
1981 | struct ebt_entries_buf_state *state, const void *base) | |
1982 | { | |
1983 | int growth = 0; | |
1984 | char *buf; | |
1985 | ||
1986 | if (size_left == 0) | |
1987 | return 0; | |
1988 | ||
1989 | buf = (char *) match32; | |
1990 | ||
1991 | while (size_left >= sizeof(*match32)) { | |
1992 | struct ebt_entry_match *match_kern; | |
1993 | int ret; | |
1994 | ||
1995 | match_kern = (struct ebt_entry_match *) state->buf_kern_start; | |
1996 | if (match_kern) { | |
1997 | char *tmp; | |
1998 | tmp = state->buf_kern_start + state->buf_kern_offset; | |
1999 | match_kern = (struct ebt_entry_match *) tmp; | |
2000 | } | |
2001 | ret = ebt_buf_add(state, buf, sizeof(*match32)); | |
2002 | if (ret < 0) | |
2003 | return ret; | |
2004 | size_left -= sizeof(*match32); | |
2005 | ||
2006 | /* add padding before match->data (if any) */ | |
2007 | ret = ebt_buf_add_pad(state, ebt_compat_entry_padsize()); | |
2008 | if (ret < 0) | |
2009 | return ret; | |
2010 | ||
2011 | if (match32->match_size > size_left) | |
2012 | return -EINVAL; | |
2013 | ||
2014 | size_left -= match32->match_size; | |
2015 | ||
2016 | ret = compat_mtw_from_user(match32, type, state, base); | |
2017 | if (ret < 0) | |
2018 | return ret; | |
2019 | ||
2020 | BUG_ON(ret < match32->match_size); | |
2021 | growth += ret - match32->match_size; | |
2022 | growth += ebt_compat_entry_padsize(); | |
2023 | ||
2024 | buf += sizeof(*match32); | |
2025 | buf += match32->match_size; | |
2026 | ||
2027 | if (match_kern) | |
2028 | match_kern->match_size = ret; | |
2029 | ||
2030 | WARN_ON(type == EBT_COMPAT_TARGET && size_left); | |
2031 | match32 = (struct compat_ebt_entry_mwt *) buf; | |
2032 | } | |
2033 | ||
2034 | return growth; | |
2035 | } | |
2036 | ||
81e675c2 FW |
2037 | /* called for all ebt_entry structures. */ |
2038 | static int size_entry_mwt(struct ebt_entry *entry, const unsigned char *base, | |
2039 | unsigned int *total, | |
2040 | struct ebt_entries_buf_state *state) | |
2041 | { | |
2042 | unsigned int i, j, startoff, new_offset = 0; | |
2043 | /* stores match/watchers/targets & offset of next struct ebt_entry: */ | |
2044 | unsigned int offsets[4]; | |
2045 | unsigned int *offsets_update = NULL; | |
2046 | int ret; | |
2047 | char *buf_start; | |
2048 | ||
2049 | if (*total < sizeof(struct ebt_entries)) | |
2050 | return -EINVAL; | |
2051 | ||
2052 | if (!entry->bitmask) { | |
2053 | *total -= sizeof(struct ebt_entries); | |
2054 | return ebt_buf_add(state, entry, sizeof(struct ebt_entries)); | |
2055 | } | |
2056 | if (*total < sizeof(*entry) || entry->next_offset < sizeof(*entry)) | |
2057 | return -EINVAL; | |
2058 | ||
2059 | startoff = state->buf_user_offset; | |
2060 | /* pull in most part of ebt_entry, it does not need to be changed. */ | |
2061 | ret = ebt_buf_add(state, entry, | |
2062 | offsetof(struct ebt_entry, watchers_offset)); | |
2063 | if (ret < 0) | |
2064 | return ret; | |
2065 | ||
2066 | offsets[0] = sizeof(struct ebt_entry); /* matches come first */ | |
2067 | memcpy(&offsets[1], &entry->watchers_offset, | |
2068 | sizeof(offsets) - sizeof(offsets[0])); | |
2069 | ||
2070 | if (state->buf_kern_start) { | |
2071 | buf_start = state->buf_kern_start + state->buf_kern_offset; | |
2072 | offsets_update = (unsigned int *) buf_start; | |
2073 | } | |
2074 | ret = ebt_buf_add(state, &offsets[1], | |
2075 | sizeof(offsets) - sizeof(offsets[0])); | |
2076 | if (ret < 0) | |
2077 | return ret; | |
2078 | buf_start = (char *) entry; | |
7f495ad9 | 2079 | /* 0: matches offset, always follows ebt_entry. |
81e675c2 FW |
2080 | * 1: watchers offset, from ebt_entry structure |
2081 | * 2: target offset, from ebt_entry structure | |
2082 | * 3: next ebt_entry offset, from ebt_entry structure | |
2083 | * | |
2084 | * offsets are relative to beginning of struct ebt_entry (i.e., 0). | |
2085 | */ | |
2086 | for (i = 0, j = 1 ; j < 4 ; j++, i++) { | |
2087 | struct compat_ebt_entry_mwt *match32; | |
2088 | unsigned int size; | |
2089 | char *buf = buf_start; | |
2090 | ||
2091 | buf = buf_start + offsets[i]; | |
2092 | if (offsets[i] > offsets[j]) | |
2093 | return -EINVAL; | |
2094 | ||
2095 | match32 = (struct compat_ebt_entry_mwt *) buf; | |
2096 | size = offsets[j] - offsets[i]; | |
2097 | ret = ebt_size_mwt(match32, size, i, state, base); | |
2098 | if (ret < 0) | |
2099 | return ret; | |
2100 | new_offset += ret; | |
2101 | if (offsets_update && new_offset) { | |
ff67e4e4 | 2102 | pr_debug("change offset %d to %d\n", |
81e675c2 FW |
2103 | offsets_update[i], offsets[j] + new_offset); |
2104 | offsets_update[i] = offsets[j] + new_offset; | |
2105 | } | |
2106 | } | |
2107 | ||
103a9778 FW |
2108 | if (state->buf_kern_start == NULL) { |
2109 | unsigned int offset = buf_start - (char *) base; | |
2110 | ||
2111 | ret = xt_compat_add_offset(NFPROTO_BRIDGE, offset, new_offset); | |
2112 | if (ret < 0) | |
2113 | return ret; | |
2114 | } | |
2115 | ||
81e675c2 FW |
2116 | startoff = state->buf_user_offset - startoff; |
2117 | ||
2118 | BUG_ON(*total < startoff); | |
2119 | *total -= startoff; | |
2120 | return 0; | |
2121 | } | |
2122 | ||
7f495ad9 | 2123 | /* repl->entries_size is the size of the ebt_entry blob in userspace. |
81e675c2 FW |
2124 | * It might need more memory when copied to a 64 bit kernel in case |
2125 | * userspace is 32-bit. So, first task: find out how much memory is needed. | |
2126 | * | |
2127 | * Called before validation is performed. | |
2128 | */ | |
2129 | static int compat_copy_entries(unsigned char *data, unsigned int size_user, | |
2130 | struct ebt_entries_buf_state *state) | |
2131 | { | |
2132 | unsigned int size_remaining = size_user; | |
2133 | int ret; | |
2134 | ||
2135 | ret = EBT_ENTRY_ITERATE(data, size_user, size_entry_mwt, data, | |
2136 | &size_remaining, state); | |
2137 | if (ret < 0) | |
2138 | return ret; | |
2139 | ||
2140 | WARN_ON(size_remaining); | |
2141 | return state->buf_kern_offset; | |
2142 | } | |
2143 | ||
2144 | ||
2145 | static int compat_copy_ebt_replace_from_user(struct ebt_replace *repl, | |
2146 | void __user *user, unsigned int len) | |
2147 | { | |
2148 | struct compat_ebt_replace tmp; | |
2149 | int i; | |
2150 | ||
2151 | if (len < sizeof(tmp)) | |
2152 | return -EINVAL; | |
2153 | ||
2154 | if (copy_from_user(&tmp, user, sizeof(tmp))) | |
2155 | return -EFAULT; | |
2156 | ||
2157 | if (len != sizeof(tmp) + tmp.entries_size) | |
2158 | return -EINVAL; | |
2159 | ||
2160 | if (tmp.entries_size == 0) | |
2161 | return -EINVAL; | |
2162 | ||
2163 | if (tmp.nentries >= ((INT_MAX - sizeof(struct ebt_table_info)) / | |
2164 | NR_CPUS - SMP_CACHE_BYTES) / sizeof(struct ebt_counter)) | |
2165 | return -ENOMEM; | |
2166 | if (tmp.num_counters >= INT_MAX / sizeof(struct ebt_counter)) | |
2167 | return -ENOMEM; | |
2168 | ||
2169 | memcpy(repl, &tmp, offsetof(struct ebt_replace, hook_entry)); | |
2170 | ||
2171 | /* starting with hook_entry, 32 vs. 64 bit structures are different */ | |
2172 | for (i = 0; i < NF_BR_NUMHOOKS; i++) | |
2173 | repl->hook_entry[i] = compat_ptr(tmp.hook_entry[i]); | |
2174 | ||
2175 | repl->num_counters = tmp.num_counters; | |
2176 | repl->counters = compat_ptr(tmp.counters); | |
2177 | repl->entries = compat_ptr(tmp.entries); | |
2178 | return 0; | |
2179 | } | |
2180 | ||
2181 | static int compat_do_replace(struct net *net, void __user *user, | |
2182 | unsigned int len) | |
2183 | { | |
2184 | int ret, i, countersize, size64; | |
2185 | struct ebt_table_info *newinfo; | |
2186 | struct ebt_replace tmp; | |
2187 | struct ebt_entries_buf_state state; | |
2188 | void *entries_tmp; | |
2189 | ||
2190 | ret = compat_copy_ebt_replace_from_user(&tmp, user, len); | |
90b89af7 FW |
2191 | if (ret) { |
2192 | /* try real handler in case userland supplied needed padding */ | |
2193 | if (ret == -EINVAL && do_replace(net, user, len) == 0) | |
2194 | ret = 0; | |
81e675c2 | 2195 | return ret; |
90b89af7 | 2196 | } |
81e675c2 FW |
2197 | |
2198 | countersize = COUNTER_OFFSET(tmp.nentries) * nr_cpu_ids; | |
2199 | newinfo = vmalloc(sizeof(*newinfo) + countersize); | |
2200 | if (!newinfo) | |
2201 | return -ENOMEM; | |
2202 | ||
2203 | if (countersize) | |
2204 | memset(newinfo->counters, 0, countersize); | |
2205 | ||
2206 | memset(&state, 0, sizeof(state)); | |
2207 | ||
2208 | newinfo->entries = vmalloc(tmp.entries_size); | |
2209 | if (!newinfo->entries) { | |
2210 | ret = -ENOMEM; | |
2211 | goto free_newinfo; | |
2212 | } | |
2213 | if (copy_from_user( | |
2214 | newinfo->entries, tmp.entries, tmp.entries_size) != 0) { | |
2215 | ret = -EFAULT; | |
2216 | goto free_entries; | |
2217 | } | |
2218 | ||
2219 | entries_tmp = newinfo->entries; | |
2220 | ||
2221 | xt_compat_lock(NFPROTO_BRIDGE); | |
2222 | ||
5a6351ee | 2223 | xt_compat_init_offsets(NFPROTO_BRIDGE, tmp.nentries); |
81e675c2 FW |
2224 | ret = compat_copy_entries(entries_tmp, tmp.entries_size, &state); |
2225 | if (ret < 0) | |
2226 | goto out_unlock; | |
2227 | ||
2228 | pr_debug("tmp.entries_size %d, kern off %d, user off %d delta %d\n", | |
2229 | tmp.entries_size, state.buf_kern_offset, state.buf_user_offset, | |
2230 | xt_compat_calc_jump(NFPROTO_BRIDGE, tmp.entries_size)); | |
2231 | ||
2232 | size64 = ret; | |
2233 | newinfo->entries = vmalloc(size64); | |
2234 | if (!newinfo->entries) { | |
2235 | vfree(entries_tmp); | |
2236 | ret = -ENOMEM; | |
2237 | goto out_unlock; | |
2238 | } | |
2239 | ||
2240 | memset(&state, 0, sizeof(state)); | |
2241 | state.buf_kern_start = newinfo->entries; | |
2242 | state.buf_kern_len = size64; | |
2243 | ||
2244 | ret = compat_copy_entries(entries_tmp, tmp.entries_size, &state); | |
2245 | BUG_ON(ret < 0); /* parses same data again */ | |
2246 | ||
2247 | vfree(entries_tmp); | |
2248 | tmp.entries_size = size64; | |
2249 | ||
2250 | for (i = 0; i < NF_BR_NUMHOOKS; i++) { | |
2251 | char __user *usrptr; | |
2252 | if (tmp.hook_entry[i]) { | |
2253 | unsigned int delta; | |
2254 | usrptr = (char __user *) tmp.hook_entry[i]; | |
2255 | delta = usrptr - tmp.entries; | |
2256 | usrptr += xt_compat_calc_jump(NFPROTO_BRIDGE, delta); | |
2257 | tmp.hook_entry[i] = (struct ebt_entries __user *)usrptr; | |
2258 | } | |
2259 | } | |
2260 | ||
2261 | xt_compat_flush_offsets(NFPROTO_BRIDGE); | |
2262 | xt_compat_unlock(NFPROTO_BRIDGE); | |
2263 | ||
2264 | ret = do_replace_finish(net, &tmp, newinfo); | |
2265 | if (ret == 0) | |
2266 | return ret; | |
2267 | free_entries: | |
2268 | vfree(newinfo->entries); | |
2269 | free_newinfo: | |
2270 | vfree(newinfo); | |
2271 | return ret; | |
2272 | out_unlock: | |
2273 | xt_compat_flush_offsets(NFPROTO_BRIDGE); | |
2274 | xt_compat_unlock(NFPROTO_BRIDGE); | |
2275 | goto free_entries; | |
2276 | } | |
2277 | ||
2278 | static int compat_update_counters(struct net *net, void __user *user, | |
2279 | unsigned int len) | |
2280 | { | |
2281 | struct compat_ebt_replace hlp; | |
2282 | ||
2283 | if (copy_from_user(&hlp, user, sizeof(hlp))) | |
2284 | return -EFAULT; | |
2285 | ||
90b89af7 | 2286 | /* try real handler in case userland supplied needed padding */ |
81e675c2 | 2287 | if (len != sizeof(hlp) + hlp.num_counters * sizeof(struct ebt_counter)) |
90b89af7 | 2288 | return update_counters(net, user, len); |
81e675c2 FW |
2289 | |
2290 | return do_update_counters(net, hlp.name, compat_ptr(hlp.counters), | |
2291 | hlp.num_counters, user, len); | |
2292 | } | |
2293 | ||
2294 | static int compat_do_ebt_set_ctl(struct sock *sk, | |
2295 | int cmd, void __user *user, unsigned int len) | |
2296 | { | |
2297 | int ret; | |
bb12b8b2 | 2298 | struct net *net = sock_net(sk); |
81e675c2 | 2299 | |
bb12b8b2 | 2300 | if (!ns_capable(net->user_ns, CAP_NET_ADMIN)) |
81e675c2 FW |
2301 | return -EPERM; |
2302 | ||
2303 | switch (cmd) { | |
2304 | case EBT_SO_SET_ENTRIES: | |
bb12b8b2 | 2305 | ret = compat_do_replace(net, user, len); |
81e675c2 FW |
2306 | break; |
2307 | case EBT_SO_SET_COUNTERS: | |
bb12b8b2 | 2308 | ret = compat_update_counters(net, user, len); |
81e675c2 FW |
2309 | break; |
2310 | default: | |
2311 | ret = -EINVAL; | |
052a4bc4 | 2312 | } |
81e675c2 FW |
2313 | return ret; |
2314 | } | |
2315 | ||
2316 | static int compat_do_ebt_get_ctl(struct sock *sk, int cmd, | |
2317 | void __user *user, int *len) | |
2318 | { | |
2319 | int ret; | |
2320 | struct compat_ebt_replace tmp; | |
2321 | struct ebt_table *t; | |
bb12b8b2 | 2322 | struct net *net = sock_net(sk); |
81e675c2 | 2323 | |
bb12b8b2 | 2324 | if (!ns_capable(net->user_ns, CAP_NET_ADMIN)) |
81e675c2 FW |
2325 | return -EPERM; |
2326 | ||
90b89af7 | 2327 | /* try real handler in case userland supplied needed padding */ |
81e675c2 FW |
2328 | if ((cmd == EBT_SO_GET_INFO || |
2329 | cmd == EBT_SO_GET_INIT_INFO) && *len != sizeof(tmp)) | |
90b89af7 | 2330 | return do_ebt_get_ctl(sk, cmd, user, len); |
81e675c2 FW |
2331 | |
2332 | if (copy_from_user(&tmp, user, sizeof(tmp))) | |
2333 | return -EFAULT; | |
2334 | ||
bb12b8b2 | 2335 | t = find_table_lock(net, tmp.name, &ret, &ebt_mutex); |
81e675c2 FW |
2336 | if (!t) |
2337 | return ret; | |
2338 | ||
2339 | xt_compat_lock(NFPROTO_BRIDGE); | |
2340 | switch (cmd) { | |
2341 | case EBT_SO_GET_INFO: | |
2342 | tmp.nentries = t->private->nentries; | |
2343 | ret = compat_table_info(t->private, &tmp); | |
2344 | if (ret) | |
2345 | goto out; | |
2346 | tmp.valid_hooks = t->valid_hooks; | |
2347 | ||
2348 | if (copy_to_user(user, &tmp, *len) != 0) { | |
2349 | ret = -EFAULT; | |
2350 | break; | |
2351 | } | |
2352 | ret = 0; | |
2353 | break; | |
2354 | case EBT_SO_GET_INIT_INFO: | |
2355 | tmp.nentries = t->table->nentries; | |
2356 | tmp.entries_size = t->table->entries_size; | |
2357 | tmp.valid_hooks = t->table->valid_hooks; | |
2358 | ||
2359 | if (copy_to_user(user, &tmp, *len) != 0) { | |
2360 | ret = -EFAULT; | |
2361 | break; | |
2362 | } | |
2363 | ret = 0; | |
2364 | break; | |
2365 | case EBT_SO_GET_ENTRIES: | |
2366 | case EBT_SO_GET_INIT_ENTRIES: | |
7f495ad9 | 2367 | /* try real handler first in case of userland-side padding. |
90b89af7 FW |
2368 | * in case we are dealing with an 'ordinary' 32 bit binary |
2369 | * without 64bit compatibility padding, this will fail right | |
2370 | * after copy_from_user when the *len argument is validated. | |
2371 | * | |
2372 | * the compat_ variant needs to do one pass over the kernel | |
2373 | * data set to adjust for size differences before it the check. | |
2374 | */ | |
2375 | if (copy_everything_to_user(t, user, len, cmd) == 0) | |
2376 | ret = 0; | |
2377 | else | |
2378 | ret = compat_copy_everything_to_user(t, user, len, cmd); | |
81e675c2 FW |
2379 | break; |
2380 | default: | |
2381 | ret = -EINVAL; | |
2382 | } | |
2383 | out: | |
2384 | xt_compat_flush_offsets(NFPROTO_BRIDGE); | |
2385 | xt_compat_unlock(NFPROTO_BRIDGE); | |
2386 | mutex_unlock(&ebt_mutex); | |
2387 | return ret; | |
2388 | } | |
2389 | #endif | |
2390 | ||
97ad8b53 | 2391 | static struct nf_sockopt_ops ebt_sockopts = { |
74ca4e5a AM |
2392 | .pf = PF_INET, |
2393 | .set_optmin = EBT_BASE_CTL, | |
2394 | .set_optmax = EBT_SO_SET_MAX + 1, | |
2395 | .set = do_ebt_set_ctl, | |
81e675c2 FW |
2396 | #ifdef CONFIG_COMPAT |
2397 | .compat_set = compat_do_ebt_set_ctl, | |
2398 | #endif | |
74ca4e5a AM |
2399 | .get_optmin = EBT_BASE_CTL, |
2400 | .get_optmax = EBT_SO_GET_MAX + 1, | |
2401 | .get = do_ebt_get_ctl, | |
81e675c2 FW |
2402 | #ifdef CONFIG_COMPAT |
2403 | .compat_get = compat_do_ebt_get_ctl, | |
2404 | #endif | |
16fcec35 | 2405 | .owner = THIS_MODULE, |
1da177e4 LT |
2406 | }; |
2407 | ||
65b4b4e8 | 2408 | static int __init ebtables_init(void) |
1da177e4 LT |
2409 | { |
2410 | int ret; | |
2411 | ||
043ef46c JE |
2412 | ret = xt_register_target(&ebt_standard_target); |
2413 | if (ret < 0) | |
1da177e4 | 2414 | return ret; |
043ef46c JE |
2415 | ret = nf_register_sockopt(&ebt_sockopts); |
2416 | if (ret < 0) { | |
2417 | xt_unregister_target(&ebt_standard_target); | |
2418 | return ret; | |
2419 | } | |
1da177e4 | 2420 | |
a887c1c1 | 2421 | printk(KERN_INFO "Ebtables v2.0 registered\n"); |
1da177e4 LT |
2422 | return 0; |
2423 | } | |
2424 | ||
65b4b4e8 | 2425 | static void __exit ebtables_fini(void) |
1da177e4 LT |
2426 | { |
2427 | nf_unregister_sockopt(&ebt_sockopts); | |
043ef46c | 2428 | xt_unregister_target(&ebt_standard_target); |
a887c1c1 | 2429 | printk(KERN_INFO "Ebtables v2.0 unregistered\n"); |
1da177e4 LT |
2430 | } |
2431 | ||
2432 | EXPORT_SYMBOL(ebt_register_table); | |
2433 | EXPORT_SYMBOL(ebt_unregister_table); | |
1da177e4 | 2434 | EXPORT_SYMBOL(ebt_do_table); |
65b4b4e8 AM |
2435 | module_init(ebtables_init); |
2436 | module_exit(ebtables_fini); | |
1da177e4 | 2437 | MODULE_LICENSE("GPL"); |