Commit | Line | Data |
---|---|---|
d2912cb1 | 1 | // SPDX-License-Identifier: GPL-2.0-only |
2e4e6a17 HW |
2 | /* |
3 | * x_tables core - Backend for {ip,ip6,arp}_tables | |
4 | * | |
5 | * Copyright (C) 2006-2006 Harald Welte <laforge@netfilter.org> | |
f229f6ce | 6 | * Copyright (C) 2006-2012 Patrick McHardy <kaber@trash.net> |
2e4e6a17 HW |
7 | * |
8 | * Based on existing ip_tables code which is | |
9 | * Copyright (C) 1999 Paul `Rusty' Russell & Michael J. Neuling | |
10 | * Copyright (C) 2000-2005 Netfilter Core Team <coreteam@netfilter.org> | |
2e4e6a17 | 11 | */ |
be91fd5e | 12 | #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt |
2e4e6a17 | 13 | #include <linux/kernel.h> |
3a9a231d | 14 | #include <linux/module.h> |
2e4e6a17 HW |
15 | #include <linux/socket.h> |
16 | #include <linux/net.h> | |
17 | #include <linux/proc_fs.h> | |
18 | #include <linux/seq_file.h> | |
19 | #include <linux/string.h> | |
20 | #include <linux/vmalloc.h> | |
9e19bb6d | 21 | #include <linux/mutex.h> |
d7fe0f24 | 22 | #include <linux/mm.h> |
5a0e3ad6 | 23 | #include <linux/slab.h> |
fbabf31e | 24 | #include <linux/audit.h> |
f13f2aee | 25 | #include <linux/user_namespace.h> |
457c4cbc | 26 | #include <net/net_namespace.h> |
1d610d4d | 27 | #include <net/netns/generic.h> |
2e4e6a17 HW |
28 | |
29 | #include <linux/netfilter/x_tables.h> | |
30 | #include <linux/netfilter_arp.h> | |
e3eaa991 JE |
31 | #include <linux/netfilter_ipv4/ip_tables.h> |
32 | #include <linux/netfilter_ipv6/ip6_tables.h> | |
33 | #include <linux/netfilter_arp/arp_tables.h> | |
9e19bb6d | 34 | |
2e4e6a17 HW |
35 | MODULE_LICENSE("GPL"); |
36 | MODULE_AUTHOR("Harald Welte <laforge@netfilter.org>"); | |
043ef46c | 37 | MODULE_DESCRIPTION("{ip,ip6,arp,eb}_tables backend module"); |
2e4e6a17 | 38 | |
ae0ac0ed | 39 | #define XT_PCPU_BLOCK_SIZE 4096 |
19926968 | 40 | #define XT_MAX_TABLE_SIZE (512 * 1024 * 1024) |
2e4e6a17 | 41 | |
1d610d4d FW |
42 | struct xt_pernet { |
43 | struct list_head tables[NFPROTO_NUMPROTO]; | |
44 | }; | |
45 | ||
b386d9f5 | 46 | struct compat_delta { |
255d0dc3 ED |
47 | unsigned int offset; /* offset in kernel */ |
48 | int delta; /* delta in 32bit user land */ | |
b386d9f5 PM |
49 | }; |
50 | ||
2e4e6a17 | 51 | struct xt_af { |
9e19bb6d | 52 | struct mutex mutex; |
2e4e6a17 HW |
53 | struct list_head match; |
54 | struct list_head target; | |
b386d9f5 | 55 | #ifdef CONFIG_COMPAT |
2722971c | 56 | struct mutex compat_mutex; |
255d0dc3 ED |
57 | struct compat_delta *compat_tab; |
58 | unsigned int number; /* number of slots in compat_tab[] */ | |
59 | unsigned int cur; /* number of used slots in compat_tab[] */ | |
b386d9f5 | 60 | #endif |
2e4e6a17 HW |
61 | }; |
62 | ||
1d610d4d FW |
63 | static unsigned int xt_pernet_id __read_mostly; |
64 | static struct xt_af *xt __read_mostly; | |
2e4e6a17 | 65 | |
7e9c6eeb JE |
66 | static const char *const xt_prefix[NFPROTO_NUMPROTO] = { |
67 | [NFPROTO_UNSPEC] = "x", | |
68 | [NFPROTO_IPV4] = "ip", | |
69 | [NFPROTO_ARP] = "arp", | |
70 | [NFPROTO_BRIDGE] = "eb", | |
71 | [NFPROTO_IPV6] = "ip6", | |
37f9f733 PM |
72 | }; |
73 | ||
2e4e6a17 | 74 | /* Registration hooks for targets. */ |
7926dbfa | 75 | int xt_register_target(struct xt_target *target) |
2e4e6a17 | 76 | { |
76108cea | 77 | u_int8_t af = target->family; |
2e4e6a17 | 78 | |
7926dbfa | 79 | mutex_lock(&xt[af].mutex); |
2e4e6a17 | 80 | list_add(&target->list, &xt[af].target); |
9e19bb6d | 81 | mutex_unlock(&xt[af].mutex); |
7926dbfa | 82 | return 0; |
2e4e6a17 HW |
83 | } |
84 | EXPORT_SYMBOL(xt_register_target); | |
85 | ||
86 | void | |
a45049c5 | 87 | xt_unregister_target(struct xt_target *target) |
2e4e6a17 | 88 | { |
76108cea | 89 | u_int8_t af = target->family; |
a45049c5 | 90 | |
9e19bb6d | 91 | mutex_lock(&xt[af].mutex); |
df0933dc | 92 | list_del(&target->list); |
9e19bb6d | 93 | mutex_unlock(&xt[af].mutex); |
2e4e6a17 HW |
94 | } |
95 | EXPORT_SYMBOL(xt_unregister_target); | |
96 | ||
52d9c42e PM |
97 | int |
98 | xt_register_targets(struct xt_target *target, unsigned int n) | |
99 | { | |
100 | unsigned int i; | |
101 | int err = 0; | |
102 | ||
103 | for (i = 0; i < n; i++) { | |
104 | err = xt_register_target(&target[i]); | |
105 | if (err) | |
106 | goto err; | |
107 | } | |
108 | return err; | |
109 | ||
110 | err: | |
111 | if (i > 0) | |
112 | xt_unregister_targets(target, i); | |
113 | return err; | |
114 | } | |
115 | EXPORT_SYMBOL(xt_register_targets); | |
116 | ||
117 | void | |
118 | xt_unregister_targets(struct xt_target *target, unsigned int n) | |
119 | { | |
f68c5301 CG |
120 | while (n-- > 0) |
121 | xt_unregister_target(&target[n]); | |
52d9c42e PM |
122 | } |
123 | EXPORT_SYMBOL(xt_unregister_targets); | |
124 | ||
7926dbfa | 125 | int xt_register_match(struct xt_match *match) |
2e4e6a17 | 126 | { |
76108cea | 127 | u_int8_t af = match->family; |
2e4e6a17 | 128 | |
7926dbfa | 129 | mutex_lock(&xt[af].mutex); |
2e4e6a17 | 130 | list_add(&match->list, &xt[af].match); |
9e19bb6d | 131 | mutex_unlock(&xt[af].mutex); |
7926dbfa | 132 | return 0; |
2e4e6a17 HW |
133 | } |
134 | EXPORT_SYMBOL(xt_register_match); | |
135 | ||
136 | void | |
a45049c5 | 137 | xt_unregister_match(struct xt_match *match) |
2e4e6a17 | 138 | { |
76108cea | 139 | u_int8_t af = match->family; |
a45049c5 | 140 | |
9e19bb6d | 141 | mutex_lock(&xt[af].mutex); |
df0933dc | 142 | list_del(&match->list); |
9e19bb6d | 143 | mutex_unlock(&xt[af].mutex); |
2e4e6a17 HW |
144 | } |
145 | EXPORT_SYMBOL(xt_unregister_match); | |
146 | ||
52d9c42e PM |
147 | int |
148 | xt_register_matches(struct xt_match *match, unsigned int n) | |
149 | { | |
150 | unsigned int i; | |
151 | int err = 0; | |
152 | ||
153 | for (i = 0; i < n; i++) { | |
154 | err = xt_register_match(&match[i]); | |
155 | if (err) | |
156 | goto err; | |
157 | } | |
158 | return err; | |
159 | ||
160 | err: | |
161 | if (i > 0) | |
162 | xt_unregister_matches(match, i); | |
163 | return err; | |
164 | } | |
165 | EXPORT_SYMBOL(xt_register_matches); | |
166 | ||
167 | void | |
168 | xt_unregister_matches(struct xt_match *match, unsigned int n) | |
169 | { | |
f68c5301 CG |
170 | while (n-- > 0) |
171 | xt_unregister_match(&match[n]); | |
52d9c42e PM |
172 | } |
173 | EXPORT_SYMBOL(xt_unregister_matches); | |
174 | ||
2e4e6a17 HW |
175 | |
176 | /* | |
177 | * These are weird, but module loading must not be done with mutex | |
178 | * held (since they will register), and we have to have a single | |
adb00ae2 | 179 | * function to use. |
2e4e6a17 HW |
180 | */ |
181 | ||
182 | /* Find match, grabs ref. Returns ERR_PTR() on error. */ | |
76108cea | 183 | struct xt_match *xt_find_match(u8 af, const char *name, u8 revision) |
2e4e6a17 HW |
184 | { |
185 | struct xt_match *m; | |
42046e2e | 186 | int err = -ENOENT; |
2e4e6a17 | 187 | |
dceb48d8 FW |
188 | if (strnlen(name, XT_EXTENSION_MAXNAMELEN) == XT_EXTENSION_MAXNAMELEN) |
189 | return ERR_PTR(-EINVAL); | |
190 | ||
7926dbfa | 191 | mutex_lock(&xt[af].mutex); |
2e4e6a17 HW |
192 | list_for_each_entry(m, &xt[af].match, list) { |
193 | if (strcmp(m->name, name) == 0) { | |
194 | if (m->revision == revision) { | |
195 | if (try_module_get(m->me)) { | |
9e19bb6d | 196 | mutex_unlock(&xt[af].mutex); |
2e4e6a17 HW |
197 | return m; |
198 | } | |
199 | } else | |
200 | err = -EPROTOTYPE; /* Found something. */ | |
201 | } | |
202 | } | |
9e19bb6d | 203 | mutex_unlock(&xt[af].mutex); |
55b69e91 JE |
204 | |
205 | if (af != NFPROTO_UNSPEC) | |
206 | /* Try searching again in the family-independent list */ | |
207 | return xt_find_match(NFPROTO_UNSPEC, name, revision); | |
208 | ||
2e4e6a17 HW |
209 | return ERR_PTR(err); |
210 | } | |
211 | EXPORT_SYMBOL(xt_find_match); | |
212 | ||
fd0ec0e6 JE |
213 | struct xt_match * |
214 | xt_request_find_match(uint8_t nfproto, const char *name, uint8_t revision) | |
215 | { | |
216 | struct xt_match *match; | |
217 | ||
da17c73b ED |
218 | if (strnlen(name, XT_EXTENSION_MAXNAMELEN) == XT_EXTENSION_MAXNAMELEN) |
219 | return ERR_PTR(-EINVAL); | |
220 | ||
adb00ae2 SH |
221 | match = xt_find_match(nfproto, name, revision); |
222 | if (IS_ERR(match)) { | |
223 | request_module("%st_%s", xt_prefix[nfproto], name); | |
224 | match = xt_find_match(nfproto, name, revision); | |
225 | } | |
226 | ||
227 | return match; | |
fd0ec0e6 JE |
228 | } |
229 | EXPORT_SYMBOL_GPL(xt_request_find_match); | |
230 | ||
2e4e6a17 | 231 | /* Find target, grabs ref. Returns ERR_PTR() on error. */ |
3b0a081d | 232 | static struct xt_target *xt_find_target(u8 af, const char *name, u8 revision) |
2e4e6a17 HW |
233 | { |
234 | struct xt_target *t; | |
42046e2e | 235 | int err = -ENOENT; |
2e4e6a17 | 236 | |
dceb48d8 FW |
237 | if (strnlen(name, XT_EXTENSION_MAXNAMELEN) == XT_EXTENSION_MAXNAMELEN) |
238 | return ERR_PTR(-EINVAL); | |
239 | ||
7926dbfa | 240 | mutex_lock(&xt[af].mutex); |
2e4e6a17 HW |
241 | list_for_each_entry(t, &xt[af].target, list) { |
242 | if (strcmp(t->name, name) == 0) { | |
243 | if (t->revision == revision) { | |
244 | if (try_module_get(t->me)) { | |
9e19bb6d | 245 | mutex_unlock(&xt[af].mutex); |
2e4e6a17 HW |
246 | return t; |
247 | } | |
248 | } else | |
249 | err = -EPROTOTYPE; /* Found something. */ | |
250 | } | |
251 | } | |
9e19bb6d | 252 | mutex_unlock(&xt[af].mutex); |
55b69e91 JE |
253 | |
254 | if (af != NFPROTO_UNSPEC) | |
255 | /* Try searching again in the family-independent list */ | |
256 | return xt_find_target(NFPROTO_UNSPEC, name, revision); | |
257 | ||
2e4e6a17 HW |
258 | return ERR_PTR(err); |
259 | } | |
2e4e6a17 | 260 | |
76108cea | 261 | struct xt_target *xt_request_find_target(u8 af, const char *name, u8 revision) |
2e4e6a17 HW |
262 | { |
263 | struct xt_target *target; | |
264 | ||
da17c73b ED |
265 | if (strnlen(name, XT_EXTENSION_MAXNAMELEN) == XT_EXTENSION_MAXNAMELEN) |
266 | return ERR_PTR(-EINVAL); | |
267 | ||
adb00ae2 SH |
268 | target = xt_find_target(af, name, revision); |
269 | if (IS_ERR(target)) { | |
270 | request_module("%st_%s", xt_prefix[af], name); | |
271 | target = xt_find_target(af, name, revision); | |
272 | } | |
273 | ||
274 | return target; | |
2e4e6a17 HW |
275 | } |
276 | EXPORT_SYMBOL_GPL(xt_request_find_target); | |
277 | ||
f32815d2 WB |
278 | |
279 | static int xt_obj_to_user(u16 __user *psize, u16 size, | |
280 | void __user *pname, const char *name, | |
281 | u8 __user *prev, u8 rev) | |
282 | { | |
283 | if (put_user(size, psize)) | |
284 | return -EFAULT; | |
285 | if (copy_to_user(pname, name, strlen(name) + 1)) | |
286 | return -EFAULT; | |
287 | if (put_user(rev, prev)) | |
288 | return -EFAULT; | |
289 | ||
290 | return 0; | |
291 | } | |
292 | ||
293 | #define XT_OBJ_TO_USER(U, K, TYPE, C_SIZE) \ | |
294 | xt_obj_to_user(&U->u.TYPE##_size, C_SIZE ? : K->u.TYPE##_size, \ | |
295 | U->u.user.name, K->u.kernel.TYPE->name, \ | |
296 | &U->u.user.revision, K->u.kernel.TYPE->revision) | |
297 | ||
298 | int xt_data_to_user(void __user *dst, const void *src, | |
324318f0 | 299 | int usersize, int size, int aligned_size) |
f32815d2 WB |
300 | { |
301 | usersize = usersize ? : size; | |
302 | if (copy_to_user(dst, src, usersize)) | |
303 | return -EFAULT; | |
324318f0 WB |
304 | if (usersize != aligned_size && |
305 | clear_user(dst + usersize, aligned_size - usersize)) | |
f32815d2 WB |
306 | return -EFAULT; |
307 | ||
308 | return 0; | |
309 | } | |
310 | EXPORT_SYMBOL_GPL(xt_data_to_user); | |
311 | ||
751a9c76 | 312 | #define XT_DATA_TO_USER(U, K, TYPE) \ |
f32815d2 WB |
313 | xt_data_to_user(U->data, K->data, \ |
314 | K->u.kernel.TYPE->usersize, \ | |
751a9c76 WB |
315 | K->u.kernel.TYPE->TYPE##size, \ |
316 | XT_ALIGN(K->u.kernel.TYPE->TYPE##size)) | |
f32815d2 WB |
317 | |
318 | int xt_match_to_user(const struct xt_entry_match *m, | |
319 | struct xt_entry_match __user *u) | |
320 | { | |
321 | return XT_OBJ_TO_USER(u, m, match, 0) || | |
751a9c76 | 322 | XT_DATA_TO_USER(u, m, match); |
f32815d2 WB |
323 | } |
324 | EXPORT_SYMBOL_GPL(xt_match_to_user); | |
325 | ||
326 | int xt_target_to_user(const struct xt_entry_target *t, | |
327 | struct xt_entry_target __user *u) | |
328 | { | |
329 | return XT_OBJ_TO_USER(u, t, target, 0) || | |
751a9c76 | 330 | XT_DATA_TO_USER(u, t, target); |
f32815d2 WB |
331 | } |
332 | EXPORT_SYMBOL_GPL(xt_target_to_user); | |
333 | ||
76108cea | 334 | static int match_revfn(u8 af, const char *name, u8 revision, int *bestp) |
2e4e6a17 | 335 | { |
5452e425 | 336 | const struct xt_match *m; |
2e4e6a17 HW |
337 | int have_rev = 0; |
338 | ||
8e24eddd | 339 | mutex_lock(&xt[af].mutex); |
2e4e6a17 HW |
340 | list_for_each_entry(m, &xt[af].match, list) { |
341 | if (strcmp(m->name, name) == 0) { | |
342 | if (m->revision > *bestp) | |
343 | *bestp = m->revision; | |
344 | if (m->revision == revision) | |
345 | have_rev = 1; | |
346 | } | |
347 | } | |
8e24eddd | 348 | mutex_unlock(&xt[af].mutex); |
656caff2 PM |
349 | |
350 | if (af != NFPROTO_UNSPEC && !have_rev) | |
351 | return match_revfn(NFPROTO_UNSPEC, name, revision, bestp); | |
352 | ||
2e4e6a17 HW |
353 | return have_rev; |
354 | } | |
355 | ||
76108cea | 356 | static int target_revfn(u8 af, const char *name, u8 revision, int *bestp) |
2e4e6a17 | 357 | { |
5452e425 | 358 | const struct xt_target *t; |
2e4e6a17 HW |
359 | int have_rev = 0; |
360 | ||
8e24eddd | 361 | mutex_lock(&xt[af].mutex); |
2e4e6a17 HW |
362 | list_for_each_entry(t, &xt[af].target, list) { |
363 | if (strcmp(t->name, name) == 0) { | |
364 | if (t->revision > *bestp) | |
365 | *bestp = t->revision; | |
366 | if (t->revision == revision) | |
367 | have_rev = 1; | |
368 | } | |
369 | } | |
8e24eddd | 370 | mutex_unlock(&xt[af].mutex); |
656caff2 PM |
371 | |
372 | if (af != NFPROTO_UNSPEC && !have_rev) | |
373 | return target_revfn(NFPROTO_UNSPEC, name, revision, bestp); | |
374 | ||
2e4e6a17 HW |
375 | return have_rev; |
376 | } | |
377 | ||
378 | /* Returns true or false (if no such extension at all) */ | |
76108cea | 379 | int xt_find_revision(u8 af, const char *name, u8 revision, int target, |
2e4e6a17 HW |
380 | int *err) |
381 | { | |
382 | int have_rev, best = -1; | |
383 | ||
2e4e6a17 HW |
384 | if (target == 1) |
385 | have_rev = target_revfn(af, name, revision, &best); | |
386 | else | |
387 | have_rev = match_revfn(af, name, revision, &best); | |
2e4e6a17 HW |
388 | |
389 | /* Nothing at all? Return 0 to try loading module. */ | |
390 | if (best == -1) { | |
391 | *err = -ENOENT; | |
392 | return 0; | |
393 | } | |
394 | ||
395 | *err = best; | |
396 | if (!have_rev) | |
397 | *err = -EPROTONOSUPPORT; | |
398 | return 1; | |
399 | } | |
400 | EXPORT_SYMBOL_GPL(xt_find_revision); | |
401 | ||
5b76c494 JE |
402 | static char * |
403 | textify_hooks(char *buf, size_t size, unsigned int mask, uint8_t nfproto) | |
45185364 | 404 | { |
5b76c494 | 405 | static const char *const inetbr_names[] = { |
45185364 JE |
406 | "PREROUTING", "INPUT", "FORWARD", |
407 | "OUTPUT", "POSTROUTING", "BROUTING", | |
408 | }; | |
5b76c494 JE |
409 | static const char *const arp_names[] = { |
410 | "INPUT", "FORWARD", "OUTPUT", | |
411 | }; | |
412 | const char *const *names; | |
413 | unsigned int i, max; | |
45185364 JE |
414 | char *p = buf; |
415 | bool np = false; | |
416 | int res; | |
417 | ||
5b76c494 JE |
418 | names = (nfproto == NFPROTO_ARP) ? arp_names : inetbr_names; |
419 | max = (nfproto == NFPROTO_ARP) ? ARRAY_SIZE(arp_names) : | |
420 | ARRAY_SIZE(inetbr_names); | |
45185364 | 421 | *p = '\0'; |
5b76c494 | 422 | for (i = 0; i < max; ++i) { |
45185364 JE |
423 | if (!(mask & (1 << i))) |
424 | continue; | |
425 | res = snprintf(p, size, "%s%s", np ? "/" : "", names[i]); | |
426 | if (res > 0) { | |
427 | size -= res; | |
428 | p += res; | |
429 | } | |
430 | np = true; | |
431 | } | |
432 | ||
433 | return buf; | |
434 | } | |
435 | ||
b1d0a5d0 FW |
436 | /** |
437 | * xt_check_proc_name - check that name is suitable for /proc file creation | |
438 | * | |
439 | * @name: file name candidate | |
440 | * @size: length of buffer | |
441 | * | |
442 | * some x_tables modules wish to create a file in /proc. | |
443 | * This function makes sure that the name is suitable for this | |
444 | * purpose, it checks that name is NUL terminated and isn't a 'special' | |
445 | * name, like "..". | |
446 | * | |
447 | * returns negative number on error or 0 if name is useable. | |
448 | */ | |
449 | int xt_check_proc_name(const char *name, unsigned int size) | |
450 | { | |
451 | if (name[0] == '\0') | |
452 | return -EINVAL; | |
453 | ||
454 | if (strnlen(name, size) == size) | |
455 | return -ENAMETOOLONG; | |
456 | ||
457 | if (strcmp(name, ".") == 0 || | |
458 | strcmp(name, "..") == 0 || | |
459 | strchr(name, '/')) | |
460 | return -EINVAL; | |
461 | ||
462 | return 0; | |
463 | } | |
464 | EXPORT_SYMBOL(xt_check_proc_name); | |
465 | ||
916a917d | 466 | int xt_check_match(struct xt_mtchk_param *par, |
11d4dd0b | 467 | unsigned int size, u16 proto, bool inv_proto) |
37f9f733 | 468 | { |
bd414ee6 JE |
469 | int ret; |
470 | ||
9b4fce7a JE |
471 | if (XT_ALIGN(par->match->matchsize) != size && |
472 | par->match->matchsize != -1) { | |
043ef46c JE |
473 | /* |
474 | * ebt_among is exempt from centralized matchsize checking | |
475 | * because it uses a dynamic-size data set. | |
476 | */ | |
1b6cd671 FW |
477 | pr_err_ratelimited("%s_tables: %s.%u match: invalid size %u (kernel) != (user) %u\n", |
478 | xt_prefix[par->family], par->match->name, | |
479 | par->match->revision, | |
480 | XT_ALIGN(par->match->matchsize), size); | |
37f9f733 PM |
481 | return -EINVAL; |
482 | } | |
9b4fce7a JE |
483 | if (par->match->table != NULL && |
484 | strcmp(par->match->table, par->table) != 0) { | |
1b6cd671 FW |
485 | pr_info_ratelimited("%s_tables: %s match: only valid in %s table, not %s\n", |
486 | xt_prefix[par->family], par->match->name, | |
487 | par->match->table, par->table); | |
37f9f733 PM |
488 | return -EINVAL; |
489 | } | |
9b4fce7a | 490 | if (par->match->hooks && (par->hook_mask & ~par->match->hooks) != 0) { |
45185364 JE |
491 | char used[64], allow[64]; |
492 | ||
1b6cd671 FW |
493 | pr_info_ratelimited("%s_tables: %s match: used from hooks %s, but only valid from %s\n", |
494 | xt_prefix[par->family], par->match->name, | |
495 | textify_hooks(used, sizeof(used), | |
496 | par->hook_mask, par->family), | |
497 | textify_hooks(allow, sizeof(allow), | |
498 | par->match->hooks, | |
499 | par->family)); | |
37f9f733 PM |
500 | return -EINVAL; |
501 | } | |
9b4fce7a | 502 | if (par->match->proto && (par->match->proto != proto || inv_proto)) { |
1b6cd671 FW |
503 | pr_info_ratelimited("%s_tables: %s match: only valid for protocol %u\n", |
504 | xt_prefix[par->family], par->match->name, | |
505 | par->match->proto); | |
37f9f733 PM |
506 | return -EINVAL; |
507 | } | |
bd414ee6 JE |
508 | if (par->match->checkentry != NULL) { |
509 | ret = par->match->checkentry(par); | |
510 | if (ret < 0) | |
511 | return ret; | |
512 | else if (ret > 0) | |
513 | /* Flag up potential errors. */ | |
514 | return -EIO; | |
515 | } | |
37f9f733 PM |
516 | return 0; |
517 | } | |
518 | EXPORT_SYMBOL_GPL(xt_check_match); | |
519 | ||
13631bfc FW |
520 | /** xt_check_entry_match - check that matches end before start of target |
521 | * | |
522 | * @match: beginning of xt_entry_match | |
523 | * @target: beginning of this rules target (alleged end of matches) | |
524 | * @alignment: alignment requirement of match structures | |
525 | * | |
526 | * Validates that all matches add up to the beginning of the target, | |
527 | * and that each match covers at least the base structure size. | |
528 | * | |
529 | * Return: 0 on success, negative errno on failure. | |
530 | */ | |
531 | static int xt_check_entry_match(const char *match, const char *target, | |
532 | const size_t alignment) | |
533 | { | |
534 | const struct xt_entry_match *pos; | |
535 | int length = target - match; | |
536 | ||
537 | if (length == 0) /* no matches */ | |
538 | return 0; | |
539 | ||
540 | pos = (struct xt_entry_match *)match; | |
541 | do { | |
542 | if ((unsigned long)pos % alignment) | |
543 | return -EINVAL; | |
544 | ||
545 | if (length < (int)sizeof(struct xt_entry_match)) | |
546 | return -EINVAL; | |
547 | ||
548 | if (pos->u.match_size < sizeof(struct xt_entry_match)) | |
549 | return -EINVAL; | |
550 | ||
551 | if (pos->u.match_size > length) | |
552 | return -EINVAL; | |
553 | ||
554 | length -= pos->u.match_size; | |
555 | pos = ((void *)((char *)(pos) + (pos)->u.match_size)); | |
556 | } while (length > 0); | |
557 | ||
558 | return 0; | |
559 | } | |
560 | ||
1b293e30 FW |
561 | /** xt_check_table_hooks - check hook entry points are sane |
562 | * | |
563 | * @info xt_table_info to check | |
564 | * @valid_hooks - hook entry points that we can enter from | |
565 | * | |
566 | * Validates that the hook entry and underflows points are set up. | |
567 | * | |
568 | * Return: 0 on success, negative errno on failure. | |
569 | */ | |
570 | int xt_check_table_hooks(const struct xt_table_info *info, unsigned int valid_hooks) | |
571 | { | |
e816a2ce FW |
572 | const char *err = "unsorted underflow"; |
573 | unsigned int i, max_uflow, max_entry; | |
574 | bool check_hooks = false; | |
1b293e30 FW |
575 | |
576 | BUILD_BUG_ON(ARRAY_SIZE(info->hook_entry) != ARRAY_SIZE(info->underflow)); | |
577 | ||
e816a2ce FW |
578 | max_entry = 0; |
579 | max_uflow = 0; | |
580 | ||
1b293e30 FW |
581 | for (i = 0; i < ARRAY_SIZE(info->hook_entry); i++) { |
582 | if (!(valid_hooks & (1 << i))) | |
583 | continue; | |
584 | ||
585 | if (info->hook_entry[i] == 0xFFFFFFFF) | |
586 | return -EINVAL; | |
587 | if (info->underflow[i] == 0xFFFFFFFF) | |
588 | return -EINVAL; | |
e816a2ce FW |
589 | |
590 | if (check_hooks) { | |
591 | if (max_uflow > info->underflow[i]) | |
592 | goto error; | |
593 | ||
594 | if (max_uflow == info->underflow[i]) { | |
595 | err = "duplicate underflow"; | |
596 | goto error; | |
597 | } | |
598 | if (max_entry > info->hook_entry[i]) { | |
599 | err = "unsorted entry"; | |
600 | goto error; | |
601 | } | |
602 | if (max_entry == info->hook_entry[i]) { | |
603 | err = "duplicate entry"; | |
604 | goto error; | |
605 | } | |
606 | } | |
607 | max_entry = info->hook_entry[i]; | |
608 | max_uflow = info->underflow[i]; | |
609 | check_hooks = true; | |
1b293e30 FW |
610 | } |
611 | ||
612 | return 0; | |
e816a2ce FW |
613 | error: |
614 | pr_err_ratelimited("%s at hook %d\n", err, i); | |
615 | return -EINVAL; | |
1b293e30 FW |
616 | } |
617 | EXPORT_SYMBOL(xt_check_table_hooks); | |
618 | ||
72597135 FW |
619 | static bool verdict_ok(int verdict) |
620 | { | |
621 | if (verdict > 0) | |
622 | return true; | |
623 | ||
624 | if (verdict < 0) { | |
625 | int v = -verdict - 1; | |
626 | ||
627 | if (verdict == XT_RETURN) | |
628 | return true; | |
629 | ||
630 | switch (v) { | |
631 | case NF_ACCEPT: return true; | |
632 | case NF_DROP: return true; | |
633 | case NF_QUEUE: return true; | |
634 | default: | |
635 | break; | |
636 | } | |
637 | ||
638 | return false; | |
639 | } | |
640 | ||
641 | return false; | |
642 | } | |
643 | ||
644 | static bool error_tg_ok(unsigned int usersize, unsigned int kernsize, | |
645 | const char *msg, unsigned int msglen) | |
646 | { | |
647 | return usersize == kernsize && strnlen(msg, msglen) < msglen; | |
648 | } | |
649 | ||
2722971c | 650 | #ifdef CONFIG_COMPAT |
255d0dc3 | 651 | int xt_compat_add_offset(u_int8_t af, unsigned int offset, int delta) |
b386d9f5 | 652 | { |
255d0dc3 | 653 | struct xt_af *xp = &xt[af]; |
b386d9f5 | 654 | |
89370860 FW |
655 | WARN_ON(!mutex_is_locked(&xt[af].compat_mutex)); |
656 | ||
7d7d7e02 FW |
657 | if (WARN_ON(!xp->compat_tab)) |
658 | return -ENOMEM; | |
b386d9f5 | 659 | |
255d0dc3 ED |
660 | if (xp->cur >= xp->number) |
661 | return -EINVAL; | |
b386d9f5 | 662 | |
255d0dc3 ED |
663 | if (xp->cur) |
664 | delta += xp->compat_tab[xp->cur - 1].delta; | |
665 | xp->compat_tab[xp->cur].offset = offset; | |
666 | xp->compat_tab[xp->cur].delta = delta; | |
667 | xp->cur++; | |
b386d9f5 PM |
668 | return 0; |
669 | } | |
670 | EXPORT_SYMBOL_GPL(xt_compat_add_offset); | |
671 | ||
76108cea | 672 | void xt_compat_flush_offsets(u_int8_t af) |
b386d9f5 | 673 | { |
89370860 FW |
674 | WARN_ON(!mutex_is_locked(&xt[af].compat_mutex)); |
675 | ||
255d0dc3 ED |
676 | if (xt[af].compat_tab) { |
677 | vfree(xt[af].compat_tab); | |
678 | xt[af].compat_tab = NULL; | |
679 | xt[af].number = 0; | |
5a6351ee | 680 | xt[af].cur = 0; |
b386d9f5 PM |
681 | } |
682 | } | |
683 | EXPORT_SYMBOL_GPL(xt_compat_flush_offsets); | |
684 | ||
3e5e524f | 685 | int xt_compat_calc_jump(u_int8_t af, unsigned int offset) |
b386d9f5 | 686 | { |
255d0dc3 ED |
687 | struct compat_delta *tmp = xt[af].compat_tab; |
688 | int mid, left = 0, right = xt[af].cur - 1; | |
689 | ||
690 | while (left <= right) { | |
691 | mid = (left + right) >> 1; | |
692 | if (offset > tmp[mid].offset) | |
693 | left = mid + 1; | |
694 | else if (offset < tmp[mid].offset) | |
695 | right = mid - 1; | |
696 | else | |
697 | return mid ? tmp[mid - 1].delta : 0; | |
698 | } | |
5a6351ee | 699 | return left ? tmp[left - 1].delta : 0; |
b386d9f5 PM |
700 | } |
701 | EXPORT_SYMBOL_GPL(xt_compat_calc_jump); | |
702 | ||
9782a11e | 703 | int xt_compat_init_offsets(u8 af, unsigned int number) |
255d0dc3 | 704 | { |
7d7d7e02 FW |
705 | size_t mem; |
706 | ||
89370860 FW |
707 | WARN_ON(!mutex_is_locked(&xt[af].compat_mutex)); |
708 | ||
7d7d7e02 FW |
709 | if (!number || number > (INT_MAX / sizeof(struct compat_delta))) |
710 | return -EINVAL; | |
711 | ||
712 | if (WARN_ON(xt[af].compat_tab)) | |
713 | return -EINVAL; | |
714 | ||
715 | mem = sizeof(struct compat_delta) * number; | |
716 | if (mem > XT_MAX_TABLE_SIZE) | |
717 | return -ENOMEM; | |
718 | ||
719 | xt[af].compat_tab = vmalloc(mem); | |
720 | if (!xt[af].compat_tab) | |
721 | return -ENOMEM; | |
722 | ||
255d0dc3 ED |
723 | xt[af].number = number; |
724 | xt[af].cur = 0; | |
9782a11e FW |
725 | |
726 | return 0; | |
255d0dc3 ED |
727 | } |
728 | EXPORT_SYMBOL(xt_compat_init_offsets); | |
729 | ||
5452e425 | 730 | int xt_compat_match_offset(const struct xt_match *match) |
2722971c | 731 | { |
9fa492cd PM |
732 | u_int16_t csize = match->compatsize ? : match->matchsize; |
733 | return XT_ALIGN(match->matchsize) - COMPAT_XT_ALIGN(csize); | |
734 | } | |
735 | EXPORT_SYMBOL_GPL(xt_compat_match_offset); | |
736 | ||
0188346f FW |
737 | void xt_compat_match_from_user(struct xt_entry_match *m, void **dstptr, |
738 | unsigned int *size) | |
9fa492cd | 739 | { |
5452e425 | 740 | const struct xt_match *match = m->u.kernel.match; |
9fa492cd | 741 | struct compat_xt_entry_match *cm = (struct compat_xt_entry_match *)m; |
b29c457a | 742 | int off = xt_compat_match_offset(match); |
9fa492cd | 743 | u_int16_t msize = cm->u.user.match_size; |
09d96860 | 744 | char name[sizeof(m->u.user.name)]; |
9fa492cd PM |
745 | |
746 | m = *dstptr; | |
747 | memcpy(m, cm, sizeof(*cm)); | |
748 | if (match->compat_from_user) | |
749 | match->compat_from_user(m->data, cm->data); | |
750 | else | |
751 | memcpy(m->data, cm->data, msize - sizeof(*cm)); | |
9fa492cd PM |
752 | |
753 | msize += off; | |
754 | m->u.user.match_size = msize; | |
09d96860 FW |
755 | strlcpy(name, match->name, sizeof(name)); |
756 | module_put(match->me); | |
757 | strncpy(m->u.user.name, name, sizeof(m->u.user.name)); | |
9fa492cd PM |
758 | |
759 | *size += off; | |
760 | *dstptr += msize; | |
761 | } | |
762 | EXPORT_SYMBOL_GPL(xt_compat_match_from_user); | |
763 | ||
751a9c76 WB |
764 | #define COMPAT_XT_DATA_TO_USER(U, K, TYPE, C_SIZE) \ |
765 | xt_data_to_user(U->data, K->data, \ | |
766 | K->u.kernel.TYPE->usersize, \ | |
767 | C_SIZE, \ | |
768 | COMPAT_XT_ALIGN(C_SIZE)) | |
769 | ||
739674fb JE |
770 | int xt_compat_match_to_user(const struct xt_entry_match *m, |
771 | void __user **dstptr, unsigned int *size) | |
9fa492cd | 772 | { |
5452e425 | 773 | const struct xt_match *match = m->u.kernel.match; |
9fa492cd PM |
774 | struct compat_xt_entry_match __user *cm = *dstptr; |
775 | int off = xt_compat_match_offset(match); | |
776 | u_int16_t msize = m->u.user.match_size - off; | |
777 | ||
4915f7bb | 778 | if (XT_OBJ_TO_USER(cm, m, match, msize)) |
601e68e1 | 779 | return -EFAULT; |
9fa492cd PM |
780 | |
781 | if (match->compat_to_user) { | |
782 | if (match->compat_to_user((void __user *)cm->data, m->data)) | |
783 | return -EFAULT; | |
784 | } else { | |
751a9c76 | 785 | if (COMPAT_XT_DATA_TO_USER(cm, m, match, msize - sizeof(*cm))) |
9fa492cd | 786 | return -EFAULT; |
2722971c | 787 | } |
9fa492cd PM |
788 | |
789 | *size -= off; | |
790 | *dstptr += msize; | |
791 | return 0; | |
2722971c | 792 | } |
9fa492cd | 793 | EXPORT_SYMBOL_GPL(xt_compat_match_to_user); |
fc1221b3 | 794 | |
7ed2abdd FW |
795 | /* non-compat version may have padding after verdict */ |
796 | struct compat_xt_standard_target { | |
797 | struct compat_xt_entry_target t; | |
798 | compat_uint_t verdict; | |
799 | }; | |
800 | ||
472ebdcd FW |
801 | struct compat_xt_error_target { |
802 | struct compat_xt_entry_target t; | |
803 | char errorname[XT_FUNCTION_MAXNAMELEN]; | |
804 | }; | |
805 | ||
ce683e5f | 806 | int xt_compat_check_entry_offsets(const void *base, const char *elems, |
fc1221b3 FW |
807 | unsigned int target_offset, |
808 | unsigned int next_offset) | |
809 | { | |
ce683e5f | 810 | long size_of_base_struct = elems - (const char *)base; |
fc1221b3 FW |
811 | const struct compat_xt_entry_target *t; |
812 | const char *e = base; | |
813 | ||
ce683e5f FW |
814 | if (target_offset < size_of_base_struct) |
815 | return -EINVAL; | |
816 | ||
fc1221b3 FW |
817 | if (target_offset + sizeof(*t) > next_offset) |
818 | return -EINVAL; | |
819 | ||
820 | t = (void *)(e + target_offset); | |
821 | if (t->u.target_size < sizeof(*t)) | |
822 | return -EINVAL; | |
823 | ||
824 | if (target_offset + t->u.target_size > next_offset) | |
825 | return -EINVAL; | |
826 | ||
07a9da51 FW |
827 | if (strcmp(t->u.user.name, XT_STANDARD_TARGET) == 0) { |
828 | const struct compat_xt_standard_target *st = (const void *)t; | |
829 | ||
830 | if (COMPAT_XT_ALIGN(target_offset + sizeof(*st)) != next_offset) | |
831 | return -EINVAL; | |
832 | ||
833 | if (!verdict_ok(st->verdict)) | |
834 | return -EINVAL; | |
472ebdcd FW |
835 | } else if (strcmp(t->u.user.name, XT_ERROR_TARGET) == 0) { |
836 | const struct compat_xt_error_target *et = (const void *)t; | |
837 | ||
838 | if (!error_tg_ok(t->u.target_size, sizeof(*et), | |
839 | et->errorname, sizeof(et->errorname))) | |
840 | return -EINVAL; | |
07a9da51 | 841 | } |
7ed2abdd | 842 | |
550116d2 | 843 | /* compat_xt_entry match has less strict alignment requirements, |
13631bfc FW |
844 | * otherwise they are identical. In case of padding differences |
845 | * we need to add compat version of xt_check_entry_match. | |
846 | */ | |
847 | BUILD_BUG_ON(sizeof(struct compat_xt_entry_match) != sizeof(struct xt_entry_match)); | |
848 | ||
849 | return xt_check_entry_match(elems, base + target_offset, | |
850 | __alignof__(struct compat_xt_entry_match)); | |
fc1221b3 FW |
851 | } |
852 | EXPORT_SYMBOL(xt_compat_check_entry_offsets); | |
9fa492cd | 853 | #endif /* CONFIG_COMPAT */ |
2722971c | 854 | |
7d35812c FW |
855 | /** |
856 | * xt_check_entry_offsets - validate arp/ip/ip6t_entry | |
857 | * | |
858 | * @base: pointer to arp/ip/ip6t_entry | |
ce683e5f | 859 | * @elems: pointer to first xt_entry_match, i.e. ip(6)t_entry->elems |
7d35812c FW |
860 | * @target_offset: the arp/ip/ip6_t->target_offset |
861 | * @next_offset: the arp/ip/ip6_t->next_offset | |
862 | * | |
13631bfc FW |
863 | * validates that target_offset and next_offset are sane and that all |
864 | * match sizes (if any) align with the target offset. | |
7d35812c | 865 | * |
ce683e5f | 866 | * This function does not validate the targets or matches themselves, it |
13631bfc FW |
867 | * only tests that all the offsets and sizes are correct, that all |
868 | * match structures are aligned, and that the last structure ends where | |
869 | * the target structure begins. | |
870 | * | |
871 | * Also see xt_compat_check_entry_offsets for CONFIG_COMPAT version. | |
ce683e5f | 872 | * |
7d35812c FW |
873 | * The arp/ip/ip6t_entry structure @base must have passed following tests: |
874 | * - it must point to a valid memory location | |
875 | * - base to base + next_offset must be accessible, i.e. not exceed allocated | |
876 | * length. | |
877 | * | |
13631bfc FW |
878 | * A well-formed entry looks like this: |
879 | * | |
880 | * ip(6)t_entry match [mtdata] match [mtdata] target [tgdata] ip(6)t_entry | |
881 | * e->elems[]-----' | | | |
882 | * matchsize | | | |
883 | * matchsize | | | |
884 | * | | | |
885 | * target_offset---------------------------------' | | |
886 | * next_offset---------------------------------------------------' | |
887 | * | |
888 | * elems[]: flexible array member at end of ip(6)/arpt_entry struct. | |
889 | * This is where matches (if any) and the target reside. | |
890 | * target_offset: beginning of target. | |
891 | * next_offset: start of the next rule; also: size of this rule. | |
892 | * Since targets have a minimum size, target_offset + minlen <= next_offset. | |
893 | * | |
894 | * Every match stores its size, sum of sizes must not exceed target_offset. | |
895 | * | |
7d35812c FW |
896 | * Return: 0 on success, negative errno on failure. |
897 | */ | |
898 | int xt_check_entry_offsets(const void *base, | |
ce683e5f | 899 | const char *elems, |
7d35812c FW |
900 | unsigned int target_offset, |
901 | unsigned int next_offset) | |
902 | { | |
ce683e5f | 903 | long size_of_base_struct = elems - (const char *)base; |
7d35812c FW |
904 | const struct xt_entry_target *t; |
905 | const char *e = base; | |
906 | ||
ce683e5f FW |
907 | /* target start is within the ip/ip6/arpt_entry struct */ |
908 | if (target_offset < size_of_base_struct) | |
909 | return -EINVAL; | |
910 | ||
7d35812c FW |
911 | if (target_offset + sizeof(*t) > next_offset) |
912 | return -EINVAL; | |
913 | ||
914 | t = (void *)(e + target_offset); | |
a08e4e19 FW |
915 | if (t->u.target_size < sizeof(*t)) |
916 | return -EINVAL; | |
917 | ||
7d35812c FW |
918 | if (target_offset + t->u.target_size > next_offset) |
919 | return -EINVAL; | |
920 | ||
07a9da51 FW |
921 | if (strcmp(t->u.user.name, XT_STANDARD_TARGET) == 0) { |
922 | const struct xt_standard_target *st = (const void *)t; | |
923 | ||
924 | if (XT_ALIGN(target_offset + sizeof(*st)) != next_offset) | |
925 | return -EINVAL; | |
926 | ||
927 | if (!verdict_ok(st->verdict)) | |
928 | return -EINVAL; | |
472ebdcd FW |
929 | } else if (strcmp(t->u.user.name, XT_ERROR_TARGET) == 0) { |
930 | const struct xt_error_target *et = (const void *)t; | |
931 | ||
932 | if (!error_tg_ok(t->u.target_size, sizeof(*et), | |
933 | et->errorname, sizeof(et->errorname))) | |
934 | return -EINVAL; | |
07a9da51 | 935 | } |
7ed2abdd | 936 | |
13631bfc FW |
937 | return xt_check_entry_match(elems, base + target_offset, |
938 | __alignof__(struct xt_entry_match)); | |
7d35812c FW |
939 | } |
940 | EXPORT_SYMBOL(xt_check_entry_offsets); | |
941 | ||
f4dc7771 FW |
942 | /** |
943 | * xt_alloc_entry_offsets - allocate array to store rule head offsets | |
944 | * | |
945 | * @size: number of entries | |
946 | * | |
b9e0102a | 947 | * Return: NULL or zeroed kmalloc'd or vmalloc'd array |
f4dc7771 FW |
948 | */ |
949 | unsigned int *xt_alloc_entry_offsets(unsigned int size) | |
950 | { | |
9d5c12a7 FW |
951 | if (size > XT_MAX_TABLE_SIZE / sizeof(unsigned int)) |
952 | return NULL; | |
953 | ||
b9e0102a | 954 | return kvcalloc(size, sizeof(unsigned int), GFP_KERNEL); |
f4dc7771 | 955 | |
f4dc7771 FW |
956 | } |
957 | EXPORT_SYMBOL(xt_alloc_entry_offsets); | |
958 | ||
959 | /** | |
960 | * xt_find_jump_offset - check if target is a valid jump offset | |
961 | * | |
962 | * @offsets: array containing all valid rule start offsets of a rule blob | |
963 | * @target: the jump target to search for | |
964 | * @size: entries in @offset | |
965 | */ | |
966 | bool xt_find_jump_offset(const unsigned int *offsets, | |
967 | unsigned int target, unsigned int size) | |
968 | { | |
969 | int m, low = 0, hi = size; | |
970 | ||
971 | while (hi > low) { | |
972 | m = (low + hi) / 2u; | |
973 | ||
974 | if (offsets[m] > target) | |
975 | hi = m; | |
976 | else if (offsets[m] < target) | |
977 | low = m + 1; | |
978 | else | |
979 | return true; | |
980 | } | |
981 | ||
982 | return false; | |
983 | } | |
984 | EXPORT_SYMBOL(xt_find_jump_offset); | |
985 | ||
916a917d | 986 | int xt_check_target(struct xt_tgchk_param *par, |
11d4dd0b | 987 | unsigned int size, u16 proto, bool inv_proto) |
37f9f733 | 988 | { |
d6b00a53 JE |
989 | int ret; |
990 | ||
af5d6dc2 | 991 | if (XT_ALIGN(par->target->targetsize) != size) { |
1b6cd671 FW |
992 | pr_err_ratelimited("%s_tables: %s.%u target: invalid size %u (kernel) != (user) %u\n", |
993 | xt_prefix[par->family], par->target->name, | |
994 | par->target->revision, | |
995 | XT_ALIGN(par->target->targetsize), size); | |
37f9f733 PM |
996 | return -EINVAL; |
997 | } | |
af5d6dc2 JE |
998 | if (par->target->table != NULL && |
999 | strcmp(par->target->table, par->table) != 0) { | |
1b6cd671 FW |
1000 | pr_info_ratelimited("%s_tables: %s target: only valid in %s table, not %s\n", |
1001 | xt_prefix[par->family], par->target->name, | |
1002 | par->target->table, par->table); | |
37f9f733 PM |
1003 | return -EINVAL; |
1004 | } | |
af5d6dc2 | 1005 | if (par->target->hooks && (par->hook_mask & ~par->target->hooks) != 0) { |
45185364 JE |
1006 | char used[64], allow[64]; |
1007 | ||
1b6cd671 FW |
1008 | pr_info_ratelimited("%s_tables: %s target: used from hooks %s, but only usable from %s\n", |
1009 | xt_prefix[par->family], par->target->name, | |
1010 | textify_hooks(used, sizeof(used), | |
1011 | par->hook_mask, par->family), | |
1012 | textify_hooks(allow, sizeof(allow), | |
1013 | par->target->hooks, | |
1014 | par->family)); | |
37f9f733 PM |
1015 | return -EINVAL; |
1016 | } | |
af5d6dc2 | 1017 | if (par->target->proto && (par->target->proto != proto || inv_proto)) { |
1b6cd671 FW |
1018 | pr_info_ratelimited("%s_tables: %s target: only valid for protocol %u\n", |
1019 | xt_prefix[par->family], par->target->name, | |
1020 | par->target->proto); | |
37f9f733 PM |
1021 | return -EINVAL; |
1022 | } | |
d6b00a53 JE |
1023 | if (par->target->checkentry != NULL) { |
1024 | ret = par->target->checkentry(par); | |
1025 | if (ret < 0) | |
1026 | return ret; | |
1027 | else if (ret > 0) | |
1028 | /* Flag up potential errors. */ | |
1029 | return -EIO; | |
1030 | } | |
37f9f733 PM |
1031 | return 0; |
1032 | } | |
1033 | EXPORT_SYMBOL_GPL(xt_check_target); | |
1034 | ||
d7591f0c | 1035 | /** |
ab214d1b | 1036 | * xt_copy_counters - copy counters and metadata from a sockptr_t |
d7591f0c | 1037 | * |
ab214d1b | 1038 | * @arg: src sockptr |
d7591f0c FW |
1039 | * @len: alleged size of userspace memory |
1040 | * @info: where to store the xt_counters_info metadata | |
d7591f0c FW |
1041 | * |
1042 | * Copies counter meta data from @user and stores it in @info. | |
1043 | * | |
1044 | * vmallocs memory to hold the counters, then copies the counter data | |
1045 | * from @user to the new memory and returns a pointer to it. | |
1046 | * | |
c34bc10d CH |
1047 | * If called from a compat syscall, @info gets converted automatically to the |
1048 | * 64bit representation. | |
d7591f0c FW |
1049 | * |
1050 | * The metadata associated with the counters is stored in @info. | |
1051 | * | |
1052 | * Return: returns pointer that caller has to test via IS_ERR(). | |
1053 | * If IS_ERR is false, caller has to vfree the pointer. | |
1054 | */ | |
ab214d1b CH |
1055 | void *xt_copy_counters(sockptr_t arg, unsigned int len, |
1056 | struct xt_counters_info *info) | |
d7591f0c | 1057 | { |
d3c48151 | 1058 | size_t offset; |
d7591f0c FW |
1059 | void *mem; |
1060 | u64 size; | |
1061 | ||
1062 | #ifdef CONFIG_COMPAT | |
c34bc10d | 1063 | if (in_compat_syscall()) { |
d7591f0c FW |
1064 | /* structures only differ in size due to alignment */ |
1065 | struct compat_xt_counters_info compat_tmp; | |
1066 | ||
1067 | if (len <= sizeof(compat_tmp)) | |
1068 | return ERR_PTR(-EINVAL); | |
1069 | ||
1070 | len -= sizeof(compat_tmp); | |
ab214d1b | 1071 | if (copy_from_sockptr(&compat_tmp, arg, sizeof(compat_tmp)) != 0) |
d7591f0c FW |
1072 | return ERR_PTR(-EFAULT); |
1073 | ||
e466af75 | 1074 | memcpy(info->name, compat_tmp.name, sizeof(info->name) - 1); |
d7591f0c | 1075 | info->num_counters = compat_tmp.num_counters; |
d3c48151 | 1076 | offset = sizeof(compat_tmp); |
d7591f0c FW |
1077 | } else |
1078 | #endif | |
1079 | { | |
1080 | if (len <= sizeof(*info)) | |
1081 | return ERR_PTR(-EINVAL); | |
1082 | ||
1083 | len -= sizeof(*info); | |
ab214d1b | 1084 | if (copy_from_sockptr(info, arg, sizeof(*info)) != 0) |
d7591f0c FW |
1085 | return ERR_PTR(-EFAULT); |
1086 | ||
d3c48151 | 1087 | offset = sizeof(*info); |
d7591f0c | 1088 | } |
e466af75 | 1089 | info->name[sizeof(info->name) - 1] = '\0'; |
d7591f0c FW |
1090 | |
1091 | size = sizeof(struct xt_counters); | |
1092 | size *= info->num_counters; | |
1093 | ||
1094 | if (size != (u64)len) | |
1095 | return ERR_PTR(-EINVAL); | |
1096 | ||
1097 | mem = vmalloc(len); | |
1098 | if (!mem) | |
1099 | return ERR_PTR(-ENOMEM); | |
1100 | ||
d3c48151 | 1101 | if (copy_from_sockptr_offset(mem, arg, offset, len) == 0) |
d7591f0c FW |
1102 | return mem; |
1103 | ||
1104 | vfree(mem); | |
1105 | return ERR_PTR(-EFAULT); | |
1106 | } | |
ab214d1b | 1107 | EXPORT_SYMBOL_GPL(xt_copy_counters); |
d7591f0c | 1108 | |
2722971c | 1109 | #ifdef CONFIG_COMPAT |
5452e425 | 1110 | int xt_compat_target_offset(const struct xt_target *target) |
2722971c | 1111 | { |
9fa492cd PM |
1112 | u_int16_t csize = target->compatsize ? : target->targetsize; |
1113 | return XT_ALIGN(target->targetsize) - COMPAT_XT_ALIGN(csize); | |
1114 | } | |
1115 | EXPORT_SYMBOL_GPL(xt_compat_target_offset); | |
1116 | ||
1117 | void xt_compat_target_from_user(struct xt_entry_target *t, void **dstptr, | |
b0a6363c | 1118 | unsigned int *size) |
9fa492cd | 1119 | { |
5452e425 | 1120 | const struct xt_target *target = t->u.kernel.target; |
9fa492cd | 1121 | struct compat_xt_entry_target *ct = (struct compat_xt_entry_target *)t; |
b29c457a | 1122 | int off = xt_compat_target_offset(target); |
9fa492cd | 1123 | u_int16_t tsize = ct->u.user.target_size; |
09d96860 | 1124 | char name[sizeof(t->u.user.name)]; |
9fa492cd PM |
1125 | |
1126 | t = *dstptr; | |
1127 | memcpy(t, ct, sizeof(*ct)); | |
1128 | if (target->compat_from_user) | |
1129 | target->compat_from_user(t->data, ct->data); | |
1130 | else | |
1131 | memcpy(t->data, ct->data, tsize - sizeof(*ct)); | |
9fa492cd PM |
1132 | |
1133 | tsize += off; | |
1134 | t->u.user.target_size = tsize; | |
09d96860 FW |
1135 | strlcpy(name, target->name, sizeof(name)); |
1136 | module_put(target->me); | |
1137 | strncpy(t->u.user.name, name, sizeof(t->u.user.name)); | |
9fa492cd PM |
1138 | |
1139 | *size += off; | |
1140 | *dstptr += tsize; | |
1141 | } | |
1142 | EXPORT_SYMBOL_GPL(xt_compat_target_from_user); | |
1143 | ||
739674fb JE |
1144 | int xt_compat_target_to_user(const struct xt_entry_target *t, |
1145 | void __user **dstptr, unsigned int *size) | |
9fa492cd | 1146 | { |
5452e425 | 1147 | const struct xt_target *target = t->u.kernel.target; |
9fa492cd PM |
1148 | struct compat_xt_entry_target __user *ct = *dstptr; |
1149 | int off = xt_compat_target_offset(target); | |
1150 | u_int16_t tsize = t->u.user.target_size - off; | |
1151 | ||
4915f7bb | 1152 | if (XT_OBJ_TO_USER(ct, t, target, tsize)) |
601e68e1 | 1153 | return -EFAULT; |
9fa492cd PM |
1154 | |
1155 | if (target->compat_to_user) { | |
1156 | if (target->compat_to_user((void __user *)ct->data, t->data)) | |
1157 | return -EFAULT; | |
1158 | } else { | |
751a9c76 | 1159 | if (COMPAT_XT_DATA_TO_USER(ct, t, target, tsize - sizeof(*ct))) |
9fa492cd | 1160 | return -EFAULT; |
2722971c | 1161 | } |
9fa492cd PM |
1162 | |
1163 | *size -= off; | |
1164 | *dstptr += tsize; | |
1165 | return 0; | |
2722971c | 1166 | } |
9fa492cd | 1167 | EXPORT_SYMBOL_GPL(xt_compat_target_to_user); |
2722971c DM |
1168 | #endif |
1169 | ||
2e4e6a17 HW |
1170 | struct xt_table_info *xt_alloc_table_info(unsigned int size) |
1171 | { | |
711bdde6 ED |
1172 | struct xt_table_info *info = NULL; |
1173 | size_t sz = sizeof(*info) + size; | |
2e4e6a17 | 1174 | |
19926968 | 1175 | if (sz < sizeof(*info) || sz >= XT_MAX_TABLE_SIZE) |
d157bd76 FW |
1176 | return NULL; |
1177 | ||
a148ce15 | 1178 | info = kvmalloc(sz, GFP_KERNEL_ACCOUNT); |
eacd86ca MH |
1179 | if (!info) |
1180 | return NULL; | |
1181 | ||
711bdde6 ED |
1182 | memset(info, 0, sizeof(*info)); |
1183 | info->size = size; | |
1184 | return info; | |
2e4e6a17 HW |
1185 | } |
1186 | EXPORT_SYMBOL(xt_alloc_table_info); | |
1187 | ||
1188 | void xt_free_table_info(struct xt_table_info *info) | |
1189 | { | |
1190 | int cpu; | |
1191 | ||
f3c5c1bf | 1192 | if (info->jumpstack != NULL) { |
f6b50824 ED |
1193 | for_each_possible_cpu(cpu) |
1194 | kvfree(info->jumpstack[cpu]); | |
1195 | kvfree(info->jumpstack); | |
f3c5c1bf JE |
1196 | } |
1197 | ||
711bdde6 | 1198 | kvfree(info); |
2e4e6a17 HW |
1199 | } |
1200 | EXPORT_SYMBOL(xt_free_table_info); | |
1201 | ||
1ef4d6d1 FW |
1202 | struct xt_table *xt_find_table(struct net *net, u8 af, const char *name) |
1203 | { | |
1204 | struct xt_pernet *xt_net = net_generic(net, xt_pernet_id); | |
1205 | struct xt_table *t; | |
1206 | ||
1207 | mutex_lock(&xt[af].mutex); | |
1208 | list_for_each_entry(t, &xt_net->tables[af], list) { | |
1209 | if (strcmp(t->name, name) == 0) { | |
1210 | mutex_unlock(&xt[af].mutex); | |
1211 | return t; | |
1212 | } | |
1213 | } | |
1214 | mutex_unlock(&xt[af].mutex); | |
1215 | return NULL; | |
1216 | } | |
1217 | EXPORT_SYMBOL(xt_find_table); | |
1218 | ||
03d13b68 | 1219 | /* Find table by name, grabs mutex & ref. Returns ERR_PTR on error. */ |
76108cea JE |
1220 | struct xt_table *xt_find_table_lock(struct net *net, u_int8_t af, |
1221 | const char *name) | |
2e4e6a17 | 1222 | { |
1d610d4d | 1223 | struct xt_pernet *xt_net = net_generic(net, xt_pernet_id); |
b9e69e12 | 1224 | struct xt_table *t, *found = NULL; |
2e4e6a17 | 1225 | |
7926dbfa | 1226 | mutex_lock(&xt[af].mutex); |
1d610d4d | 1227 | list_for_each_entry(t, &xt_net->tables[af], list) |
2e4e6a17 HW |
1228 | if (strcmp(t->name, name) == 0 && try_module_get(t->me)) |
1229 | return t; | |
b9e69e12 FW |
1230 | |
1231 | if (net == &init_net) | |
1232 | goto out; | |
1233 | ||
1234 | /* Table doesn't exist in this netns, re-try init */ | |
1d610d4d FW |
1235 | xt_net = net_generic(&init_net, xt_pernet_id); |
1236 | list_for_each_entry(t, &xt_net->tables[af], list) { | |
03d13b68 FW |
1237 | int err; |
1238 | ||
b9e69e12 FW |
1239 | if (strcmp(t->name, name)) |
1240 | continue; | |
03d13b68 FW |
1241 | if (!try_module_get(t->me)) |
1242 | goto out; | |
b9e69e12 | 1243 | mutex_unlock(&xt[af].mutex); |
03d13b68 FW |
1244 | err = t->table_init(net); |
1245 | if (err < 0) { | |
b9e69e12 | 1246 | module_put(t->me); |
03d13b68 | 1247 | return ERR_PTR(err); |
b9e69e12 FW |
1248 | } |
1249 | ||
1250 | found = t; | |
1251 | ||
1252 | mutex_lock(&xt[af].mutex); | |
1253 | break; | |
1254 | } | |
1255 | ||
1256 | if (!found) | |
1257 | goto out; | |
1258 | ||
1d610d4d | 1259 | xt_net = net_generic(net, xt_pernet_id); |
b9e69e12 | 1260 | /* and once again: */ |
1d610d4d | 1261 | list_for_each_entry(t, &xt_net->tables[af], list) |
b9e69e12 FW |
1262 | if (strcmp(t->name, name) == 0) |
1263 | return t; | |
1264 | ||
1265 | module_put(found->me); | |
1266 | out: | |
9e19bb6d | 1267 | mutex_unlock(&xt[af].mutex); |
03d13b68 | 1268 | return ERR_PTR(-ENOENT); |
2e4e6a17 HW |
1269 | } |
1270 | EXPORT_SYMBOL_GPL(xt_find_table_lock); | |
1271 | ||
03d13b68 FW |
1272 | struct xt_table *xt_request_find_table_lock(struct net *net, u_int8_t af, |
1273 | const char *name) | |
1274 | { | |
1275 | struct xt_table *t = xt_find_table_lock(net, af, name); | |
1276 | ||
20651cef | 1277 | #ifdef CONFIG_MODULES |
03d13b68 FW |
1278 | if (IS_ERR(t)) { |
1279 | int err = request_module("%stable_%s", xt_prefix[af], name); | |
e3eeacba | 1280 | if (err < 0) |
03d13b68 FW |
1281 | return ERR_PTR(err); |
1282 | t = xt_find_table_lock(net, af, name); | |
1283 | } | |
1284 | #endif | |
1285 | ||
1286 | return t; | |
1287 | } | |
1288 | EXPORT_SYMBOL_GPL(xt_request_find_table_lock); | |
1289 | ||
2e4e6a17 HW |
1290 | void xt_table_unlock(struct xt_table *table) |
1291 | { | |
9e19bb6d | 1292 | mutex_unlock(&xt[table->af].mutex); |
2e4e6a17 HW |
1293 | } |
1294 | EXPORT_SYMBOL_GPL(xt_table_unlock); | |
1295 | ||
2722971c | 1296 | #ifdef CONFIG_COMPAT |
76108cea | 1297 | void xt_compat_lock(u_int8_t af) |
2722971c DM |
1298 | { |
1299 | mutex_lock(&xt[af].compat_mutex); | |
1300 | } | |
1301 | EXPORT_SYMBOL_GPL(xt_compat_lock); | |
1302 | ||
76108cea | 1303 | void xt_compat_unlock(u_int8_t af) |
2722971c DM |
1304 | { |
1305 | mutex_unlock(&xt[af].compat_mutex); | |
1306 | } | |
1307 | EXPORT_SYMBOL_GPL(xt_compat_unlock); | |
1308 | #endif | |
2e4e6a17 | 1309 | |
7f5c6d4f ED |
1310 | DEFINE_PER_CPU(seqcount_t, xt_recseq); |
1311 | EXPORT_PER_CPU_SYMBOL_GPL(xt_recseq); | |
942e4a2b | 1312 | |
dcebd315 FW |
1313 | struct static_key xt_tee_enabled __read_mostly; |
1314 | EXPORT_SYMBOL_GPL(xt_tee_enabled); | |
1315 | ||
f3c5c1bf JE |
1316 | static int xt_jumpstack_alloc(struct xt_table_info *i) |
1317 | { | |
1318 | unsigned int size; | |
1319 | int cpu; | |
1320 | ||
f3c5c1bf JE |
1321 | size = sizeof(void **) * nr_cpu_ids; |
1322 | if (size > PAGE_SIZE) | |
752ade68 | 1323 | i->jumpstack = kvzalloc(size, GFP_KERNEL); |
f3c5c1bf | 1324 | else |
3dbd4439 | 1325 | i->jumpstack = kzalloc(size, GFP_KERNEL); |
f3c5c1bf JE |
1326 | if (i->jumpstack == NULL) |
1327 | return -ENOMEM; | |
f3c5c1bf | 1328 | |
98d1bd80 FW |
1329 | /* ruleset without jumps -- no stack needed */ |
1330 | if (i->stacksize == 0) | |
1331 | return 0; | |
1332 | ||
7814b6ec FW |
1333 | /* Jumpstack needs to be able to record two full callchains, one |
1334 | * from the first rule set traversal, plus one table reentrancy | |
1335 | * via -j TEE without clobbering the callchain that brought us to | |
1336 | * TEE target. | |
1337 | * | |
1338 | * This is done by allocating two jumpstacks per cpu, on reentry | |
1339 | * the upper half of the stack is used. | |
1340 | * | |
1341 | * see the jumpstack setup in ipt_do_table() for more details. | |
1342 | */ | |
1343 | size = sizeof(void *) * i->stacksize * 2u; | |
f3c5c1bf | 1344 | for_each_possible_cpu(cpu) { |
752ade68 MH |
1345 | i->jumpstack[cpu] = kvmalloc_node(size, GFP_KERNEL, |
1346 | cpu_to_node(cpu)); | |
f3c5c1bf JE |
1347 | if (i->jumpstack[cpu] == NULL) |
1348 | /* | |
1349 | * Freeing will be done later on by the callers. The | |
1350 | * chain is: xt_replace_table -> __do_replace -> | |
1351 | * do_replace -> xt_free_table_info. | |
1352 | */ | |
1353 | return -ENOMEM; | |
1354 | } | |
1355 | ||
1356 | return 0; | |
1357 | } | |
942e4a2b | 1358 | |
c84ca954 FW |
1359 | struct xt_counters *xt_counters_alloc(unsigned int counters) |
1360 | { | |
1361 | struct xt_counters *mem; | |
1362 | ||
1363 | if (counters == 0 || counters > INT_MAX / sizeof(*mem)) | |
1364 | return NULL; | |
1365 | ||
1366 | counters *= sizeof(*mem); | |
1367 | if (counters > XT_MAX_TABLE_SIZE) | |
1368 | return NULL; | |
1369 | ||
1370 | return vzalloc(counters); | |
1371 | } | |
1372 | EXPORT_SYMBOL(xt_counters_alloc); | |
1373 | ||
2e4e6a17 HW |
1374 | struct xt_table_info * |
1375 | xt_replace_table(struct xt_table *table, | |
1376 | unsigned int num_counters, | |
1377 | struct xt_table_info *newinfo, | |
1378 | int *error) | |
1379 | { | |
942e4a2b | 1380 | struct xt_table_info *private; |
d3d40f23 | 1381 | unsigned int cpu; |
f3c5c1bf | 1382 | int ret; |
2e4e6a17 | 1383 | |
d97a9e47 JE |
1384 | ret = xt_jumpstack_alloc(newinfo); |
1385 | if (ret < 0) { | |
1386 | *error = ret; | |
1387 | return NULL; | |
1388 | } | |
1389 | ||
2e4e6a17 | 1390 | /* Do the substitution. */ |
d3d40f23 MT |
1391 | local_bh_disable(); |
1392 | private = table->private; | |
942e4a2b | 1393 | |
2e4e6a17 HW |
1394 | /* Check inside lock: is the old number correct? */ |
1395 | if (num_counters != private->number) { | |
be91fd5e | 1396 | pr_debug("num_counters != table->private->number (%u/%u)\n", |
2e4e6a17 | 1397 | num_counters, private->number); |
d3d40f23 | 1398 | local_bh_enable(); |
2e4e6a17 HW |
1399 | *error = -EAGAIN; |
1400 | return NULL; | |
1401 | } | |
2e4e6a17 | 1402 | |
942e4a2b | 1403 | newinfo->initial_entries = private->initial_entries; |
d3d40f23 MT |
1404 | /* |
1405 | * Ensure contents of newinfo are visible before assigning to | |
1406 | * private. | |
1407 | */ | |
1408 | smp_wmb(); | |
1409 | table->private = newinfo; | |
1410 | ||
1411 | /* make sure all cpus see new ->private value */ | |
175e476b | 1412 | smp_mb(); |
80055dab | 1413 | |
d3d40f23 MT |
1414 | /* |
1415 | * Even though table entries have now been swapped, other CPU's | |
1416 | * may still be using the old entries... | |
1417 | */ | |
1418 | local_bh_enable(); | |
1419 | ||
1420 | /* ... so wait for even xt_recseq on all cpus */ | |
1421 | for_each_possible_cpu(cpu) { | |
1422 | seqcount_t *s = &per_cpu(xt_recseq, cpu); | |
1423 | u32 seq = raw_read_seqcount(s); | |
1424 | ||
1425 | if (seq & 1) { | |
1426 | do { | |
1427 | cond_resched(); | |
1428 | cpu_relax(); | |
1429 | } while (seq == raw_read_seqcount(s)); | |
1430 | } | |
1431 | } | |
80055dab | 1432 | |
c4dad0aa RGB |
1433 | audit_log_nfcfg(table->name, table->af, private->number, |
1434 | !private->number ? AUDIT_XT_OP_REGISTER : | |
14224039 RGB |
1435 | AUDIT_XT_OP_REPLACE, |
1436 | GFP_KERNEL); | |
942e4a2b | 1437 | return private; |
2e4e6a17 HW |
1438 | } |
1439 | EXPORT_SYMBOL_GPL(xt_replace_table); | |
1440 | ||
35aad0ff JE |
1441 | struct xt_table *xt_register_table(struct net *net, |
1442 | const struct xt_table *input_table, | |
a98da11d AD |
1443 | struct xt_table_info *bootstrap, |
1444 | struct xt_table_info *newinfo) | |
2e4e6a17 | 1445 | { |
1d610d4d | 1446 | struct xt_pernet *xt_net = net_generic(net, xt_pernet_id); |
2e4e6a17 | 1447 | struct xt_table_info *private; |
35aad0ff | 1448 | struct xt_table *t, *table; |
1d610d4d | 1449 | int ret; |
2e4e6a17 | 1450 | |
44d34e72 | 1451 | /* Don't add one object to multiple lists. */ |
35aad0ff | 1452 | table = kmemdup(input_table, sizeof(struct xt_table), GFP_KERNEL); |
44d34e72 AD |
1453 | if (!table) { |
1454 | ret = -ENOMEM; | |
1455 | goto out; | |
1456 | } | |
1457 | ||
7926dbfa | 1458 | mutex_lock(&xt[table->af].mutex); |
2e4e6a17 | 1459 | /* Don't autoload: we'd eat our tail... */ |
1d610d4d | 1460 | list_for_each_entry(t, &xt_net->tables[table->af], list) { |
df0933dc PM |
1461 | if (strcmp(t->name, table->name) == 0) { |
1462 | ret = -EEXIST; | |
1463 | goto unlock; | |
1464 | } | |
2e4e6a17 HW |
1465 | } |
1466 | ||
1467 | /* Simplifies replace_table code. */ | |
d3d40f23 | 1468 | table->private = bootstrap; |
78454473 | 1469 | |
2e4e6a17 HW |
1470 | if (!xt_replace_table(table, 0, newinfo, &ret)) |
1471 | goto unlock; | |
1472 | ||
d3d40f23 | 1473 | private = table->private; |
be91fd5e | 1474 | pr_debug("table->private->number = %u\n", private->number); |
2e4e6a17 HW |
1475 | |
1476 | /* save number of initial entries */ | |
1477 | private->initial_entries = private->number; | |
1478 | ||
1d610d4d | 1479 | list_add(&table->list, &xt_net->tables[table->af]); |
a98da11d AD |
1480 | mutex_unlock(&xt[table->af].mutex); |
1481 | return table; | |
2e4e6a17 | 1482 | |
7926dbfa | 1483 | unlock: |
9e19bb6d | 1484 | mutex_unlock(&xt[table->af].mutex); |
44d34e72 | 1485 | kfree(table); |
a98da11d AD |
1486 | out: |
1487 | return ERR_PTR(ret); | |
2e4e6a17 HW |
1488 | } |
1489 | EXPORT_SYMBOL_GPL(xt_register_table); | |
1490 | ||
1491 | void *xt_unregister_table(struct xt_table *table) | |
1492 | { | |
1493 | struct xt_table_info *private; | |
1494 | ||
9e19bb6d | 1495 | mutex_lock(&xt[table->af].mutex); |
d3d40f23 | 1496 | private = table->private; |
df0933dc | 1497 | list_del(&table->list); |
9e19bb6d | 1498 | mutex_unlock(&xt[table->af].mutex); |
a45d8853 | 1499 | audit_log_nfcfg(table->name, table->af, private->number, |
14224039 | 1500 | AUDIT_XT_OP_UNREGISTER, GFP_KERNEL); |
ae689334 | 1501 | kfree(table->ops); |
44d34e72 | 1502 | kfree(table); |
2e4e6a17 HW |
1503 | |
1504 | return private; | |
1505 | } | |
1506 | EXPORT_SYMBOL_GPL(xt_unregister_table); | |
1507 | ||
1508 | #ifdef CONFIG_PROC_FS | |
025d93d1 | 1509 | static void *xt_table_seq_start(struct seq_file *seq, loff_t *pos) |
2e4e6a17 | 1510 | { |
1d610d4d | 1511 | u8 af = (unsigned long)PDE_DATA(file_inode(seq->file)); |
1218854a | 1512 | struct net *net = seq_file_net(seq); |
1d610d4d FW |
1513 | struct xt_pernet *xt_net; |
1514 | ||
1515 | xt_net = net_generic(net, xt_pernet_id); | |
2e4e6a17 | 1516 | |
025d93d1 | 1517 | mutex_lock(&xt[af].mutex); |
1d610d4d | 1518 | return seq_list_start(&xt_net->tables[af], *pos); |
025d93d1 | 1519 | } |
2e4e6a17 | 1520 | |
025d93d1 AD |
1521 | static void *xt_table_seq_next(struct seq_file *seq, void *v, loff_t *pos) |
1522 | { | |
1d610d4d | 1523 | u8 af = (unsigned long)PDE_DATA(file_inode(seq->file)); |
1218854a | 1524 | struct net *net = seq_file_net(seq); |
1d610d4d FW |
1525 | struct xt_pernet *xt_net; |
1526 | ||
1527 | xt_net = net_generic(net, xt_pernet_id); | |
2e4e6a17 | 1528 | |
1d610d4d | 1529 | return seq_list_next(v, &xt_net->tables[af], pos); |
2e4e6a17 HW |
1530 | } |
1531 | ||
025d93d1 | 1532 | static void xt_table_seq_stop(struct seq_file *seq, void *v) |
2e4e6a17 | 1533 | { |
1d98c16d | 1534 | u_int8_t af = (unsigned long)PDE_DATA(file_inode(seq->file)); |
2e4e6a17 | 1535 | |
025d93d1 AD |
1536 | mutex_unlock(&xt[af].mutex); |
1537 | } | |
2e4e6a17 | 1538 | |
025d93d1 AD |
1539 | static int xt_table_seq_show(struct seq_file *seq, void *v) |
1540 | { | |
1541 | struct xt_table *table = list_entry(v, struct xt_table, list); | |
2e4e6a17 | 1542 | |
861fb107 | 1543 | if (*table->name) |
e71456ae | 1544 | seq_printf(seq, "%s\n", table->name); |
861fb107 | 1545 | return 0; |
025d93d1 | 1546 | } |
601e68e1 | 1547 | |
025d93d1 AD |
1548 | static const struct seq_operations xt_table_seq_ops = { |
1549 | .start = xt_table_seq_start, | |
1550 | .next = xt_table_seq_next, | |
1551 | .stop = xt_table_seq_stop, | |
1552 | .show = xt_table_seq_show, | |
1553 | }; | |
1554 | ||
eb132205 JE |
1555 | /* |
1556 | * Traverse state for ip{,6}_{tables,matches} for helping crossing | |
1557 | * the multi-AF mutexes. | |
1558 | */ | |
1559 | struct nf_mttg_trav { | |
1560 | struct list_head *head, *curr; | |
1d98c16d | 1561 | uint8_t class; |
eb132205 JE |
1562 | }; |
1563 | ||
1564 | enum { | |
1565 | MTTG_TRAV_INIT, | |
1566 | MTTG_TRAV_NFP_UNSPEC, | |
1567 | MTTG_TRAV_NFP_SPEC, | |
1568 | MTTG_TRAV_DONE, | |
1569 | }; | |
1570 | ||
1571 | static void *xt_mttg_seq_next(struct seq_file *seq, void *v, loff_t *ppos, | |
1572 | bool is_target) | |
2e4e6a17 | 1573 | { |
eb132205 JE |
1574 | static const uint8_t next_class[] = { |
1575 | [MTTG_TRAV_NFP_UNSPEC] = MTTG_TRAV_NFP_SPEC, | |
1576 | [MTTG_TRAV_NFP_SPEC] = MTTG_TRAV_DONE, | |
1577 | }; | |
1d98c16d | 1578 | uint8_t nfproto = (unsigned long)PDE_DATA(file_inode(seq->file)); |
eb132205 JE |
1579 | struct nf_mttg_trav *trav = seq->private; |
1580 | ||
ee84f19c VA |
1581 | if (ppos != NULL) |
1582 | ++(*ppos); | |
1583 | ||
eb132205 JE |
1584 | switch (trav->class) { |
1585 | case MTTG_TRAV_INIT: | |
1586 | trav->class = MTTG_TRAV_NFP_UNSPEC; | |
1587 | mutex_lock(&xt[NFPROTO_UNSPEC].mutex); | |
1588 | trav->head = trav->curr = is_target ? | |
1589 | &xt[NFPROTO_UNSPEC].target : &xt[NFPROTO_UNSPEC].match; | |
1590 | break; | |
1591 | case MTTG_TRAV_NFP_UNSPEC: | |
1592 | trav->curr = trav->curr->next; | |
1593 | if (trav->curr != trav->head) | |
1594 | break; | |
1595 | mutex_unlock(&xt[NFPROTO_UNSPEC].mutex); | |
1d98c16d | 1596 | mutex_lock(&xt[nfproto].mutex); |
eb132205 | 1597 | trav->head = trav->curr = is_target ? |
1d98c16d | 1598 | &xt[nfproto].target : &xt[nfproto].match; |
eb132205 JE |
1599 | trav->class = next_class[trav->class]; |
1600 | break; | |
1601 | case MTTG_TRAV_NFP_SPEC: | |
1602 | trav->curr = trav->curr->next; | |
1603 | if (trav->curr != trav->head) | |
1604 | break; | |
954d8297 | 1605 | fallthrough; |
eb132205 JE |
1606 | default: |
1607 | return NULL; | |
1608 | } | |
eb132205 | 1609 | return trav; |
025d93d1 | 1610 | } |
601e68e1 | 1611 | |
eb132205 JE |
1612 | static void *xt_mttg_seq_start(struct seq_file *seq, loff_t *pos, |
1613 | bool is_target) | |
025d93d1 | 1614 | { |
eb132205 JE |
1615 | struct nf_mttg_trav *trav = seq->private; |
1616 | unsigned int j; | |
2e4e6a17 | 1617 | |
eb132205 JE |
1618 | trav->class = MTTG_TRAV_INIT; |
1619 | for (j = 0; j < *pos; ++j) | |
1620 | if (xt_mttg_seq_next(seq, NULL, NULL, is_target) == NULL) | |
1621 | return NULL; | |
1622 | return trav; | |
2e4e6a17 HW |
1623 | } |
1624 | ||
eb132205 | 1625 | static void xt_mttg_seq_stop(struct seq_file *seq, void *v) |
2e4e6a17 | 1626 | { |
1d98c16d | 1627 | uint8_t nfproto = (unsigned long)PDE_DATA(file_inode(seq->file)); |
eb132205 JE |
1628 | struct nf_mttg_trav *trav = seq->private; |
1629 | ||
1630 | switch (trav->class) { | |
1631 | case MTTG_TRAV_NFP_UNSPEC: | |
1632 | mutex_unlock(&xt[NFPROTO_UNSPEC].mutex); | |
1633 | break; | |
1634 | case MTTG_TRAV_NFP_SPEC: | |
1d98c16d | 1635 | mutex_unlock(&xt[nfproto].mutex); |
eb132205 JE |
1636 | break; |
1637 | } | |
1638 | } | |
2e4e6a17 | 1639 | |
eb132205 JE |
1640 | static void *xt_match_seq_start(struct seq_file *seq, loff_t *pos) |
1641 | { | |
1642 | return xt_mttg_seq_start(seq, pos, false); | |
2e4e6a17 HW |
1643 | } |
1644 | ||
eb132205 | 1645 | static void *xt_match_seq_next(struct seq_file *seq, void *v, loff_t *ppos) |
2e4e6a17 | 1646 | { |
eb132205 JE |
1647 | return xt_mttg_seq_next(seq, v, ppos, false); |
1648 | } | |
2e4e6a17 | 1649 | |
eb132205 JE |
1650 | static int xt_match_seq_show(struct seq_file *seq, void *v) |
1651 | { | |
1652 | const struct nf_mttg_trav *trav = seq->private; | |
1653 | const struct xt_match *match; | |
1654 | ||
1655 | switch (trav->class) { | |
1656 | case MTTG_TRAV_NFP_UNSPEC: | |
1657 | case MTTG_TRAV_NFP_SPEC: | |
1658 | if (trav->curr == trav->head) | |
1659 | return 0; | |
1660 | match = list_entry(trav->curr, struct xt_match, list); | |
861fb107 JP |
1661 | if (*match->name) |
1662 | seq_printf(seq, "%s\n", match->name); | |
eb132205 JE |
1663 | } |
1664 | return 0; | |
2e4e6a17 HW |
1665 | } |
1666 | ||
025d93d1 AD |
1667 | static const struct seq_operations xt_match_seq_ops = { |
1668 | .start = xt_match_seq_start, | |
1669 | .next = xt_match_seq_next, | |
eb132205 | 1670 | .stop = xt_mttg_seq_stop, |
025d93d1 | 1671 | .show = xt_match_seq_show, |
2e4e6a17 HW |
1672 | }; |
1673 | ||
025d93d1 AD |
1674 | static void *xt_target_seq_start(struct seq_file *seq, loff_t *pos) |
1675 | { | |
eb132205 | 1676 | return xt_mttg_seq_start(seq, pos, true); |
025d93d1 AD |
1677 | } |
1678 | ||
eb132205 | 1679 | static void *xt_target_seq_next(struct seq_file *seq, void *v, loff_t *ppos) |
025d93d1 | 1680 | { |
eb132205 | 1681 | return xt_mttg_seq_next(seq, v, ppos, true); |
025d93d1 AD |
1682 | } |
1683 | ||
1684 | static int xt_target_seq_show(struct seq_file *seq, void *v) | |
1685 | { | |
eb132205 JE |
1686 | const struct nf_mttg_trav *trav = seq->private; |
1687 | const struct xt_target *target; | |
1688 | ||
1689 | switch (trav->class) { | |
1690 | case MTTG_TRAV_NFP_UNSPEC: | |
1691 | case MTTG_TRAV_NFP_SPEC: | |
1692 | if (trav->curr == trav->head) | |
1693 | return 0; | |
1694 | target = list_entry(trav->curr, struct xt_target, list); | |
861fb107 JP |
1695 | if (*target->name) |
1696 | seq_printf(seq, "%s\n", target->name); | |
eb132205 JE |
1697 | } |
1698 | return 0; | |
025d93d1 AD |
1699 | } |
1700 | ||
1701 | static const struct seq_operations xt_target_seq_ops = { | |
1702 | .start = xt_target_seq_start, | |
1703 | .next = xt_target_seq_next, | |
eb132205 | 1704 | .stop = xt_mttg_seq_stop, |
025d93d1 AD |
1705 | .show = xt_target_seq_show, |
1706 | }; | |
1707 | ||
2e4e6a17 HW |
1708 | #define FORMAT_TABLES "_tables_names" |
1709 | #define FORMAT_MATCHES "_tables_matches" | |
1710 | #define FORMAT_TARGETS "_tables_targets" | |
1711 | ||
1712 | #endif /* CONFIG_PROC_FS */ | |
1713 | ||
2b95efe7 | 1714 | /** |
b9e69e12 | 1715 | * xt_hook_ops_alloc - set up hooks for a new table |
2b95efe7 JE |
1716 | * @table: table with metadata needed to set up hooks |
1717 | * @fn: Hook function | |
1718 | * | |
b9e69e12 FW |
1719 | * This function will create the nf_hook_ops that the x_table needs |
1720 | * to hand to xt_hook_link_net(). | |
2b95efe7 | 1721 | */ |
b9e69e12 FW |
1722 | struct nf_hook_ops * |
1723 | xt_hook_ops_alloc(const struct xt_table *table, nf_hookfn *fn) | |
2b95efe7 JE |
1724 | { |
1725 | unsigned int hook_mask = table->valid_hooks; | |
1726 | uint8_t i, num_hooks = hweight32(hook_mask); | |
1727 | uint8_t hooknum; | |
1728 | struct nf_hook_ops *ops; | |
2b95efe7 | 1729 | |
a6d0bae1 XL |
1730 | if (!num_hooks) |
1731 | return ERR_PTR(-EINVAL); | |
1732 | ||
1ecc281e | 1733 | ops = kcalloc(num_hooks, sizeof(*ops), GFP_KERNEL); |
2b95efe7 JE |
1734 | if (ops == NULL) |
1735 | return ERR_PTR(-ENOMEM); | |
1736 | ||
1737 | for (i = 0, hooknum = 0; i < num_hooks && hook_mask != 0; | |
1738 | hook_mask >>= 1, ++hooknum) { | |
1739 | if (!(hook_mask & 1)) | |
1740 | continue; | |
1741 | ops[i].hook = fn; | |
2b95efe7 JE |
1742 | ops[i].pf = table->af; |
1743 | ops[i].hooknum = hooknum; | |
1744 | ops[i].priority = table->priority; | |
1745 | ++i; | |
1746 | } | |
1747 | ||
2b95efe7 JE |
1748 | return ops; |
1749 | } | |
b9e69e12 | 1750 | EXPORT_SYMBOL_GPL(xt_hook_ops_alloc); |
2b95efe7 | 1751 | |
76108cea | 1752 | int xt_proto_init(struct net *net, u_int8_t af) |
2e4e6a17 HW |
1753 | { |
1754 | #ifdef CONFIG_PROC_FS | |
1755 | char buf[XT_FUNCTION_MAXNAMELEN]; | |
1756 | struct proc_dir_entry *proc; | |
f13f2aee PW |
1757 | kuid_t root_uid; |
1758 | kgid_t root_gid; | |
2e4e6a17 HW |
1759 | #endif |
1760 | ||
7e9c6eeb | 1761 | if (af >= ARRAY_SIZE(xt_prefix)) |
2e4e6a17 HW |
1762 | return -EINVAL; |
1763 | ||
1764 | ||
1765 | #ifdef CONFIG_PROC_FS | |
f13f2aee PW |
1766 | root_uid = make_kuid(net->user_ns, 0); |
1767 | root_gid = make_kgid(net->user_ns, 0); | |
1768 | ||
ce18afe5 | 1769 | strlcpy(buf, xt_prefix[af], sizeof(buf)); |
2e4e6a17 | 1770 | strlcat(buf, FORMAT_TABLES, sizeof(buf)); |
c3506372 CH |
1771 | proc = proc_create_net_data(buf, 0440, net->proc_net, &xt_table_seq_ops, |
1772 | sizeof(struct seq_net_private), | |
1773 | (void *)(unsigned long)af); | |
2e4e6a17 HW |
1774 | if (!proc) |
1775 | goto out; | |
f13f2aee PW |
1776 | if (uid_valid(root_uid) && gid_valid(root_gid)) |
1777 | proc_set_user(proc, root_uid, root_gid); | |
2e4e6a17 | 1778 | |
ce18afe5 | 1779 | strlcpy(buf, xt_prefix[af], sizeof(buf)); |
2e4e6a17 | 1780 | strlcat(buf, FORMAT_MATCHES, sizeof(buf)); |
1cd67182 CH |
1781 | proc = proc_create_seq_private(buf, 0440, net->proc_net, |
1782 | &xt_match_seq_ops, sizeof(struct nf_mttg_trav), | |
1783 | (void *)(unsigned long)af); | |
2e4e6a17 HW |
1784 | if (!proc) |
1785 | goto out_remove_tables; | |
f13f2aee PW |
1786 | if (uid_valid(root_uid) && gid_valid(root_gid)) |
1787 | proc_set_user(proc, root_uid, root_gid); | |
2e4e6a17 | 1788 | |
ce18afe5 | 1789 | strlcpy(buf, xt_prefix[af], sizeof(buf)); |
2e4e6a17 | 1790 | strlcat(buf, FORMAT_TARGETS, sizeof(buf)); |
1cd67182 CH |
1791 | proc = proc_create_seq_private(buf, 0440, net->proc_net, |
1792 | &xt_target_seq_ops, sizeof(struct nf_mttg_trav), | |
1793 | (void *)(unsigned long)af); | |
2e4e6a17 HW |
1794 | if (!proc) |
1795 | goto out_remove_matches; | |
f13f2aee PW |
1796 | if (uid_valid(root_uid) && gid_valid(root_gid)) |
1797 | proc_set_user(proc, root_uid, root_gid); | |
2e4e6a17 HW |
1798 | #endif |
1799 | ||
1800 | return 0; | |
1801 | ||
1802 | #ifdef CONFIG_PROC_FS | |
1803 | out_remove_matches: | |
ce18afe5 | 1804 | strlcpy(buf, xt_prefix[af], sizeof(buf)); |
2e4e6a17 | 1805 | strlcat(buf, FORMAT_MATCHES, sizeof(buf)); |
ece31ffd | 1806 | remove_proc_entry(buf, net->proc_net); |
2e4e6a17 HW |
1807 | |
1808 | out_remove_tables: | |
ce18afe5 | 1809 | strlcpy(buf, xt_prefix[af], sizeof(buf)); |
2e4e6a17 | 1810 | strlcat(buf, FORMAT_TABLES, sizeof(buf)); |
ece31ffd | 1811 | remove_proc_entry(buf, net->proc_net); |
2e4e6a17 HW |
1812 | out: |
1813 | return -1; | |
1814 | #endif | |
1815 | } | |
1816 | EXPORT_SYMBOL_GPL(xt_proto_init); | |
1817 | ||
76108cea | 1818 | void xt_proto_fini(struct net *net, u_int8_t af) |
2e4e6a17 HW |
1819 | { |
1820 | #ifdef CONFIG_PROC_FS | |
1821 | char buf[XT_FUNCTION_MAXNAMELEN]; | |
1822 | ||
ce18afe5 | 1823 | strlcpy(buf, xt_prefix[af], sizeof(buf)); |
2e4e6a17 | 1824 | strlcat(buf, FORMAT_TABLES, sizeof(buf)); |
ece31ffd | 1825 | remove_proc_entry(buf, net->proc_net); |
2e4e6a17 | 1826 | |
ce18afe5 | 1827 | strlcpy(buf, xt_prefix[af], sizeof(buf)); |
2e4e6a17 | 1828 | strlcat(buf, FORMAT_TARGETS, sizeof(buf)); |
ece31ffd | 1829 | remove_proc_entry(buf, net->proc_net); |
2e4e6a17 | 1830 | |
ce18afe5 | 1831 | strlcpy(buf, xt_prefix[af], sizeof(buf)); |
2e4e6a17 | 1832 | strlcat(buf, FORMAT_MATCHES, sizeof(buf)); |
ece31ffd | 1833 | remove_proc_entry(buf, net->proc_net); |
2e4e6a17 HW |
1834 | #endif /*CONFIG_PROC_FS*/ |
1835 | } | |
1836 | EXPORT_SYMBOL_GPL(xt_proto_fini); | |
1837 | ||
f28e15ba FW |
1838 | /** |
1839 | * xt_percpu_counter_alloc - allocate x_tables rule counter | |
1840 | * | |
ae0ac0ed | 1841 | * @state: pointer to xt_percpu allocation state |
f28e15ba FW |
1842 | * @counter: pointer to counter struct inside the ip(6)/arpt_entry struct |
1843 | * | |
1844 | * On SMP, the packet counter [ ip(6)t_entry->counters.pcnt ] will then | |
1845 | * contain the address of the real (percpu) counter. | |
1846 | * | |
1847 | * Rule evaluation needs to use xt_get_this_cpu_counter() helper | |
1848 | * to fetch the real percpu counter. | |
1849 | * | |
ae0ac0ed | 1850 | * To speed up allocation and improve data locality, a 4kb block is |
9ba5c404 BH |
1851 | * allocated. Freeing any counter may free an entire block, so all |
1852 | * counters allocated using the same state must be freed at the same | |
1853 | * time. | |
ae0ac0ed FW |
1854 | * |
1855 | * xt_percpu_counter_alloc_state contains the base address of the | |
1856 | * allocated page and the current sub-offset. | |
1857 | * | |
f28e15ba FW |
1858 | * returns false on error. |
1859 | */ | |
ae0ac0ed FW |
1860 | bool xt_percpu_counter_alloc(struct xt_percpu_counter_alloc_state *state, |
1861 | struct xt_counters *counter) | |
f28e15ba | 1862 | { |
ae0ac0ed | 1863 | BUILD_BUG_ON(XT_PCPU_BLOCK_SIZE < (sizeof(*counter) * 2)); |
f28e15ba FW |
1864 | |
1865 | if (nr_cpu_ids <= 1) | |
1866 | return true; | |
1867 | ||
ae0ac0ed FW |
1868 | if (!state->mem) { |
1869 | state->mem = __alloc_percpu(XT_PCPU_BLOCK_SIZE, | |
1870 | XT_PCPU_BLOCK_SIZE); | |
1871 | if (!state->mem) | |
1872 | return false; | |
1873 | } | |
1874 | counter->pcnt = (__force unsigned long)(state->mem + state->off); | |
1875 | state->off += sizeof(*counter); | |
1876 | if (state->off > (XT_PCPU_BLOCK_SIZE - sizeof(*counter))) { | |
1877 | state->mem = NULL; | |
1878 | state->off = 0; | |
1879 | } | |
f28e15ba FW |
1880 | return true; |
1881 | } | |
1882 | EXPORT_SYMBOL_GPL(xt_percpu_counter_alloc); | |
1883 | ||
4d31eef5 FW |
1884 | void xt_percpu_counter_free(struct xt_counters *counters) |
1885 | { | |
1886 | unsigned long pcnt = counters->pcnt; | |
1887 | ||
ae0ac0ed | 1888 | if (nr_cpu_ids > 1 && (pcnt & (XT_PCPU_BLOCK_SIZE - 1)) == 0) |
4d31eef5 FW |
1889 | free_percpu((void __percpu *)pcnt); |
1890 | } | |
1891 | EXPORT_SYMBOL_GPL(xt_percpu_counter_free); | |
1892 | ||
8d870052 AD |
1893 | static int __net_init xt_net_init(struct net *net) |
1894 | { | |
1d610d4d | 1895 | struct xt_pernet *xt_net = net_generic(net, xt_pernet_id); |
8d870052 AD |
1896 | int i; |
1897 | ||
7e9c6eeb | 1898 | for (i = 0; i < NFPROTO_NUMPROTO; i++) |
1d610d4d | 1899 | INIT_LIST_HEAD(&xt_net->tables[i]); |
8d870052 AD |
1900 | return 0; |
1901 | } | |
1902 | ||
613d0776 VA |
1903 | static void __net_exit xt_net_exit(struct net *net) |
1904 | { | |
1d610d4d | 1905 | struct xt_pernet *xt_net = net_generic(net, xt_pernet_id); |
613d0776 VA |
1906 | int i; |
1907 | ||
1908 | for (i = 0; i < NFPROTO_NUMPROTO; i++) | |
1d610d4d | 1909 | WARN_ON_ONCE(!list_empty(&xt_net->tables[i])); |
613d0776 VA |
1910 | } |
1911 | ||
8d870052 AD |
1912 | static struct pernet_operations xt_net_ops = { |
1913 | .init = xt_net_init, | |
613d0776 | 1914 | .exit = xt_net_exit, |
1d610d4d FW |
1915 | .id = &xt_pernet_id, |
1916 | .size = sizeof(struct xt_pernet), | |
8d870052 | 1917 | }; |
2e4e6a17 HW |
1918 | |
1919 | static int __init xt_init(void) | |
1920 | { | |
942e4a2b SH |
1921 | unsigned int i; |
1922 | int rv; | |
1923 | ||
1924 | for_each_possible_cpu(i) { | |
7f5c6d4f | 1925 | seqcount_init(&per_cpu(xt_recseq, i)); |
942e4a2b | 1926 | } |
2e4e6a17 | 1927 | |
8d29d16d | 1928 | xt = kcalloc(NFPROTO_NUMPROTO, sizeof(struct xt_af), GFP_KERNEL); |
2e4e6a17 HW |
1929 | if (!xt) |
1930 | return -ENOMEM; | |
1931 | ||
7e9c6eeb | 1932 | for (i = 0; i < NFPROTO_NUMPROTO; i++) { |
9e19bb6d | 1933 | mutex_init(&xt[i].mutex); |
2722971c DM |
1934 | #ifdef CONFIG_COMPAT |
1935 | mutex_init(&xt[i].compat_mutex); | |
255d0dc3 | 1936 | xt[i].compat_tab = NULL; |
2722971c | 1937 | #endif |
2e4e6a17 HW |
1938 | INIT_LIST_HEAD(&xt[i].target); |
1939 | INIT_LIST_HEAD(&xt[i].match); | |
2e4e6a17 | 1940 | } |
8d870052 AD |
1941 | rv = register_pernet_subsys(&xt_net_ops); |
1942 | if (rv < 0) | |
1943 | kfree(xt); | |
1944 | return rv; | |
2e4e6a17 HW |
1945 | } |
1946 | ||
1947 | static void __exit xt_fini(void) | |
1948 | { | |
8d870052 | 1949 | unregister_pernet_subsys(&xt_net_ops); |
2e4e6a17 HW |
1950 | kfree(xt); |
1951 | } | |
1952 | ||
1953 | module_init(xt_init); | |
1954 | module_exit(xt_fini); | |
1955 |