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