netfilter: xtables: move extension arguments into compound structure (2/6)
[GitHub/mt8127/android_kernel_alcatel_ttab.git] / net / netfilter / x_tables.c
1 /*
2 * x_tables core - Backend for {ip,ip6,arp}_tables
3 *
4 * Copyright (C) 2006-2006 Harald Welte <laforge@netfilter.org>
5 *
6 * Based on existing ip_tables code which is
7 * Copyright (C) 1999 Paul `Rusty' Russell & Michael J. Neuling
8 * Copyright (C) 2000-2005 Netfilter Core Team <coreteam@netfilter.org>
9 *
10 * This program is free software; you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License version 2 as
12 * published by the Free Software Foundation.
13 *
14 */
15
16 #include <linux/kernel.h>
17 #include <linux/socket.h>
18 #include <linux/net.h>
19 #include <linux/proc_fs.h>
20 #include <linux/seq_file.h>
21 #include <linux/string.h>
22 #include <linux/vmalloc.h>
23 #include <linux/mutex.h>
24 #include <linux/mm.h>
25 #include <net/net_namespace.h>
26
27 #include <linux/netfilter/x_tables.h>
28 #include <linux/netfilter_arp.h>
29
30
31 MODULE_LICENSE("GPL");
32 MODULE_AUTHOR("Harald Welte <laforge@netfilter.org>");
33 MODULE_DESCRIPTION("{ip,ip6,arp,eb}_tables backend module");
34
35 #define SMP_ALIGN(x) (((x) + SMP_CACHE_BYTES-1) & ~(SMP_CACHE_BYTES-1))
36
37 struct compat_delta {
38 struct compat_delta *next;
39 unsigned int offset;
40 short delta;
41 };
42
43 struct xt_af {
44 struct mutex mutex;
45 struct list_head match;
46 struct list_head target;
47 #ifdef CONFIG_COMPAT
48 struct mutex compat_mutex;
49 struct compat_delta *compat_offsets;
50 #endif
51 };
52
53 static struct xt_af *xt;
54
55 #ifdef DEBUG_IP_FIREWALL_USER
56 #define duprintf(format, args...) printk(format , ## args)
57 #else
58 #define duprintf(format, args...)
59 #endif
60
61 static const char *const xt_prefix[NFPROTO_NUMPROTO] = {
62 [NFPROTO_UNSPEC] = "x",
63 [NFPROTO_IPV4] = "ip",
64 [NFPROTO_ARP] = "arp",
65 [NFPROTO_BRIDGE] = "eb",
66 [NFPROTO_IPV6] = "ip6",
67 };
68
69 /* Registration hooks for targets. */
70 int
71 xt_register_target(struct xt_target *target)
72 {
73 u_int8_t af = target->family;
74 int ret;
75
76 ret = mutex_lock_interruptible(&xt[af].mutex);
77 if (ret != 0)
78 return ret;
79 list_add(&target->list, &xt[af].target);
80 mutex_unlock(&xt[af].mutex);
81 return ret;
82 }
83 EXPORT_SYMBOL(xt_register_target);
84
85 void
86 xt_unregister_target(struct xt_target *target)
87 {
88 u_int8_t af = target->family;
89
90 mutex_lock(&xt[af].mutex);
91 list_del(&target->list);
92 mutex_unlock(&xt[af].mutex);
93 }
94 EXPORT_SYMBOL(xt_unregister_target);
95
96 int
97 xt_register_targets(struct xt_target *target, unsigned int n)
98 {
99 unsigned int i;
100 int err = 0;
101
102 for (i = 0; i < n; i++) {
103 err = xt_register_target(&target[i]);
104 if (err)
105 goto err;
106 }
107 return err;
108
109 err:
110 if (i > 0)
111 xt_unregister_targets(target, i);
112 return err;
113 }
114 EXPORT_SYMBOL(xt_register_targets);
115
116 void
117 xt_unregister_targets(struct xt_target *target, unsigned int n)
118 {
119 unsigned int i;
120
121 for (i = 0; i < n; i++)
122 xt_unregister_target(&target[i]);
123 }
124 EXPORT_SYMBOL(xt_unregister_targets);
125
126 int
127 xt_register_match(struct xt_match *match)
128 {
129 u_int8_t af = match->family;
130 int ret;
131
132 ret = mutex_lock_interruptible(&xt[af].mutex);
133 if (ret != 0)
134 return ret;
135
136 list_add(&match->list, &xt[af].match);
137 mutex_unlock(&xt[af].mutex);
138
139 return ret;
140 }
141 EXPORT_SYMBOL(xt_register_match);
142
143 void
144 xt_unregister_match(struct xt_match *match)
145 {
146 u_int8_t af = match->family;
147
148 mutex_lock(&xt[af].mutex);
149 list_del(&match->list);
150 mutex_unlock(&xt[af].mutex);
151 }
152 EXPORT_SYMBOL(xt_unregister_match);
153
154 int
155 xt_register_matches(struct xt_match *match, unsigned int n)
156 {
157 unsigned int i;
158 int err = 0;
159
160 for (i = 0; i < n; i++) {
161 err = xt_register_match(&match[i]);
162 if (err)
163 goto err;
164 }
165 return err;
166
167 err:
168 if (i > 0)
169 xt_unregister_matches(match, i);
170 return err;
171 }
172 EXPORT_SYMBOL(xt_register_matches);
173
174 void
175 xt_unregister_matches(struct xt_match *match, unsigned int n)
176 {
177 unsigned int i;
178
179 for (i = 0; i < n; i++)
180 xt_unregister_match(&match[i]);
181 }
182 EXPORT_SYMBOL(xt_unregister_matches);
183
184
185 /*
186 * These are weird, but module loading must not be done with mutex
187 * held (since they will register), and we have to have a single
188 * function to use try_then_request_module().
189 */
190
191 /* Find match, grabs ref. Returns ERR_PTR() on error. */
192 struct xt_match *xt_find_match(u8 af, const char *name, u8 revision)
193 {
194 struct xt_match *m;
195 int err = 0;
196
197 if (mutex_lock_interruptible(&xt[af].mutex) != 0)
198 return ERR_PTR(-EINTR);
199
200 list_for_each_entry(m, &xt[af].match, list) {
201 if (strcmp(m->name, name) == 0) {
202 if (m->revision == revision) {
203 if (try_module_get(m->me)) {
204 mutex_unlock(&xt[af].mutex);
205 return m;
206 }
207 } else
208 err = -EPROTOTYPE; /* Found something. */
209 }
210 }
211 mutex_unlock(&xt[af].mutex);
212
213 if (af != NFPROTO_UNSPEC)
214 /* Try searching again in the family-independent list */
215 return xt_find_match(NFPROTO_UNSPEC, name, revision);
216
217 return ERR_PTR(err);
218 }
219 EXPORT_SYMBOL(xt_find_match);
220
221 /* Find target, grabs ref. Returns ERR_PTR() on error. */
222 struct xt_target *xt_find_target(u8 af, const char *name, u8 revision)
223 {
224 struct xt_target *t;
225 int err = 0;
226
227 if (mutex_lock_interruptible(&xt[af].mutex) != 0)
228 return ERR_PTR(-EINTR);
229
230 list_for_each_entry(t, &xt[af].target, list) {
231 if (strcmp(t->name, name) == 0) {
232 if (t->revision == revision) {
233 if (try_module_get(t->me)) {
234 mutex_unlock(&xt[af].mutex);
235 return t;
236 }
237 } else
238 err = -EPROTOTYPE; /* Found something. */
239 }
240 }
241 mutex_unlock(&xt[af].mutex);
242
243 if (af != NFPROTO_UNSPEC)
244 /* Try searching again in the family-independent list */
245 return xt_find_target(NFPROTO_UNSPEC, name, revision);
246
247 return ERR_PTR(err);
248 }
249 EXPORT_SYMBOL(xt_find_target);
250
251 struct xt_target *xt_request_find_target(u8 af, const char *name, u8 revision)
252 {
253 struct xt_target *target;
254
255 target = try_then_request_module(xt_find_target(af, name, revision),
256 "%st_%s", xt_prefix[af], name);
257 if (IS_ERR(target) || !target)
258 return NULL;
259 return target;
260 }
261 EXPORT_SYMBOL_GPL(xt_request_find_target);
262
263 static int match_revfn(u8 af, const char *name, u8 revision, int *bestp)
264 {
265 const struct xt_match *m;
266 int have_rev = 0;
267
268 list_for_each_entry(m, &xt[af].match, list) {
269 if (strcmp(m->name, name) == 0) {
270 if (m->revision > *bestp)
271 *bestp = m->revision;
272 if (m->revision == revision)
273 have_rev = 1;
274 }
275 }
276 return have_rev;
277 }
278
279 static int target_revfn(u8 af, const char *name, u8 revision, int *bestp)
280 {
281 const struct xt_target *t;
282 int have_rev = 0;
283
284 list_for_each_entry(t, &xt[af].target, list) {
285 if (strcmp(t->name, name) == 0) {
286 if (t->revision > *bestp)
287 *bestp = t->revision;
288 if (t->revision == revision)
289 have_rev = 1;
290 }
291 }
292 return have_rev;
293 }
294
295 /* Returns true or false (if no such extension at all) */
296 int xt_find_revision(u8 af, const char *name, u8 revision, int target,
297 int *err)
298 {
299 int have_rev, best = -1;
300
301 if (mutex_lock_interruptible(&xt[af].mutex) != 0) {
302 *err = -EINTR;
303 return 1;
304 }
305 if (target == 1)
306 have_rev = target_revfn(af, name, revision, &best);
307 else
308 have_rev = match_revfn(af, name, revision, &best);
309 mutex_unlock(&xt[af].mutex);
310
311 /* Nothing at all? Return 0 to try loading module. */
312 if (best == -1) {
313 *err = -ENOENT;
314 return 0;
315 }
316
317 *err = best;
318 if (!have_rev)
319 *err = -EPROTONOSUPPORT;
320 return 1;
321 }
322 EXPORT_SYMBOL_GPL(xt_find_revision);
323
324 int xt_check_match(struct xt_mtchk_param *par, u_int8_t family,
325 unsigned int size, u_int8_t proto, bool inv_proto)
326 {
327 if (XT_ALIGN(par->match->matchsize) != size &&
328 par->match->matchsize != -1) {
329 /*
330 * ebt_among is exempt from centralized matchsize checking
331 * because it uses a dynamic-size data set.
332 */
333 printk("%s_tables: %s match: invalid size %Zu != %u\n",
334 xt_prefix[family], par->match->name,
335 XT_ALIGN(par->match->matchsize), size);
336 return -EINVAL;
337 }
338 if (par->match->table != NULL &&
339 strcmp(par->match->table, par->table) != 0) {
340 printk("%s_tables: %s match: only valid in %s table, not %s\n",
341 xt_prefix[family], par->match->name,
342 par->match->table, par->table);
343 return -EINVAL;
344 }
345 if (par->match->hooks && (par->hook_mask & ~par->match->hooks) != 0) {
346 printk("%s_tables: %s match: bad hook_mask %#x/%#x\n",
347 xt_prefix[family], par->match->name,
348 par->hook_mask, par->match->hooks);
349 return -EINVAL;
350 }
351 if (par->match->proto && (par->match->proto != proto || inv_proto)) {
352 printk("%s_tables: %s match: only valid for protocol %u\n",
353 xt_prefix[family], par->match->name, par->match->proto);
354 return -EINVAL;
355 }
356 if (par->match->checkentry != NULL && !par->match->checkentry(par))
357 return -EINVAL;
358 return 0;
359 }
360 EXPORT_SYMBOL_GPL(xt_check_match);
361
362 #ifdef CONFIG_COMPAT
363 int xt_compat_add_offset(u_int8_t af, unsigned int offset, short delta)
364 {
365 struct compat_delta *tmp;
366
367 tmp = kmalloc(sizeof(struct compat_delta), GFP_KERNEL);
368 if (!tmp)
369 return -ENOMEM;
370
371 tmp->offset = offset;
372 tmp->delta = delta;
373
374 if (xt[af].compat_offsets) {
375 tmp->next = xt[af].compat_offsets->next;
376 xt[af].compat_offsets->next = tmp;
377 } else {
378 xt[af].compat_offsets = tmp;
379 tmp->next = NULL;
380 }
381 return 0;
382 }
383 EXPORT_SYMBOL_GPL(xt_compat_add_offset);
384
385 void xt_compat_flush_offsets(u_int8_t af)
386 {
387 struct compat_delta *tmp, *next;
388
389 if (xt[af].compat_offsets) {
390 for (tmp = xt[af].compat_offsets; tmp; tmp = next) {
391 next = tmp->next;
392 kfree(tmp);
393 }
394 xt[af].compat_offsets = NULL;
395 }
396 }
397 EXPORT_SYMBOL_GPL(xt_compat_flush_offsets);
398
399 short xt_compat_calc_jump(u_int8_t af, unsigned int offset)
400 {
401 struct compat_delta *tmp;
402 short delta;
403
404 for (tmp = xt[af].compat_offsets, delta = 0; tmp; tmp = tmp->next)
405 if (tmp->offset < offset)
406 delta += tmp->delta;
407 return delta;
408 }
409 EXPORT_SYMBOL_GPL(xt_compat_calc_jump);
410
411 int xt_compat_match_offset(const struct xt_match *match)
412 {
413 u_int16_t csize = match->compatsize ? : match->matchsize;
414 return XT_ALIGN(match->matchsize) - COMPAT_XT_ALIGN(csize);
415 }
416 EXPORT_SYMBOL_GPL(xt_compat_match_offset);
417
418 int xt_compat_match_from_user(struct xt_entry_match *m, void **dstptr,
419 unsigned int *size)
420 {
421 const struct xt_match *match = m->u.kernel.match;
422 struct compat_xt_entry_match *cm = (struct compat_xt_entry_match *)m;
423 int pad, off = xt_compat_match_offset(match);
424 u_int16_t msize = cm->u.user.match_size;
425
426 m = *dstptr;
427 memcpy(m, cm, sizeof(*cm));
428 if (match->compat_from_user)
429 match->compat_from_user(m->data, cm->data);
430 else
431 memcpy(m->data, cm->data, msize - sizeof(*cm));
432 pad = XT_ALIGN(match->matchsize) - match->matchsize;
433 if (pad > 0)
434 memset(m->data + match->matchsize, 0, pad);
435
436 msize += off;
437 m->u.user.match_size = msize;
438
439 *size += off;
440 *dstptr += msize;
441 return 0;
442 }
443 EXPORT_SYMBOL_GPL(xt_compat_match_from_user);
444
445 int xt_compat_match_to_user(struct xt_entry_match *m, void __user **dstptr,
446 unsigned int *size)
447 {
448 const struct xt_match *match = m->u.kernel.match;
449 struct compat_xt_entry_match __user *cm = *dstptr;
450 int off = xt_compat_match_offset(match);
451 u_int16_t msize = m->u.user.match_size - off;
452
453 if (copy_to_user(cm, m, sizeof(*cm)) ||
454 put_user(msize, &cm->u.user.match_size) ||
455 copy_to_user(cm->u.user.name, m->u.kernel.match->name,
456 strlen(m->u.kernel.match->name) + 1))
457 return -EFAULT;
458
459 if (match->compat_to_user) {
460 if (match->compat_to_user((void __user *)cm->data, m->data))
461 return -EFAULT;
462 } else {
463 if (copy_to_user(cm->data, m->data, msize - sizeof(*cm)))
464 return -EFAULT;
465 }
466
467 *size -= off;
468 *dstptr += msize;
469 return 0;
470 }
471 EXPORT_SYMBOL_GPL(xt_compat_match_to_user);
472 #endif /* CONFIG_COMPAT */
473
474 int xt_check_target(const struct xt_target *target, unsigned short family,
475 unsigned int size, const char *table, unsigned int hook_mask,
476 unsigned short proto, int inv_proto, const void *entry,
477 void *targinfo)
478 {
479 if (XT_ALIGN(target->targetsize) != size) {
480 printk("%s_tables: %s target: invalid size %Zu != %u\n",
481 xt_prefix[family], target->name,
482 XT_ALIGN(target->targetsize), size);
483 return -EINVAL;
484 }
485 if (target->table && strcmp(target->table, table)) {
486 printk("%s_tables: %s target: only valid in %s table, not %s\n",
487 xt_prefix[family], target->name, target->table, table);
488 return -EINVAL;
489 }
490 if (target->hooks && (hook_mask & ~target->hooks) != 0) {
491 printk("%s_tables: %s target: bad hook_mask %#x/%#x\n",
492 xt_prefix[family], target->name, hook_mask,
493 target->hooks);
494 return -EINVAL;
495 }
496 if (target->proto && (target->proto != proto || inv_proto)) {
497 printk("%s_tables: %s target: only valid for protocol %u\n",
498 xt_prefix[family], target->name, target->proto);
499 return -EINVAL;
500 }
501 if (target->checkentry != NULL &&
502 !target->checkentry(table, entry, target, targinfo, hook_mask))
503 return -EINVAL;
504 return 0;
505 }
506 EXPORT_SYMBOL_GPL(xt_check_target);
507
508 #ifdef CONFIG_COMPAT
509 int xt_compat_target_offset(const struct xt_target *target)
510 {
511 u_int16_t csize = target->compatsize ? : target->targetsize;
512 return XT_ALIGN(target->targetsize) - COMPAT_XT_ALIGN(csize);
513 }
514 EXPORT_SYMBOL_GPL(xt_compat_target_offset);
515
516 void xt_compat_target_from_user(struct xt_entry_target *t, void **dstptr,
517 unsigned int *size)
518 {
519 const struct xt_target *target = t->u.kernel.target;
520 struct compat_xt_entry_target *ct = (struct compat_xt_entry_target *)t;
521 int pad, off = xt_compat_target_offset(target);
522 u_int16_t tsize = ct->u.user.target_size;
523
524 t = *dstptr;
525 memcpy(t, ct, sizeof(*ct));
526 if (target->compat_from_user)
527 target->compat_from_user(t->data, ct->data);
528 else
529 memcpy(t->data, ct->data, tsize - sizeof(*ct));
530 pad = XT_ALIGN(target->targetsize) - target->targetsize;
531 if (pad > 0)
532 memset(t->data + target->targetsize, 0, pad);
533
534 tsize += off;
535 t->u.user.target_size = tsize;
536
537 *size += off;
538 *dstptr += tsize;
539 }
540 EXPORT_SYMBOL_GPL(xt_compat_target_from_user);
541
542 int xt_compat_target_to_user(struct xt_entry_target *t, void __user **dstptr,
543 unsigned int *size)
544 {
545 const struct xt_target *target = t->u.kernel.target;
546 struct compat_xt_entry_target __user *ct = *dstptr;
547 int off = xt_compat_target_offset(target);
548 u_int16_t tsize = t->u.user.target_size - off;
549
550 if (copy_to_user(ct, t, sizeof(*ct)) ||
551 put_user(tsize, &ct->u.user.target_size) ||
552 copy_to_user(ct->u.user.name, t->u.kernel.target->name,
553 strlen(t->u.kernel.target->name) + 1))
554 return -EFAULT;
555
556 if (target->compat_to_user) {
557 if (target->compat_to_user((void __user *)ct->data, t->data))
558 return -EFAULT;
559 } else {
560 if (copy_to_user(ct->data, t->data, tsize - sizeof(*ct)))
561 return -EFAULT;
562 }
563
564 *size -= off;
565 *dstptr += tsize;
566 return 0;
567 }
568 EXPORT_SYMBOL_GPL(xt_compat_target_to_user);
569 #endif
570
571 struct xt_table_info *xt_alloc_table_info(unsigned int size)
572 {
573 struct xt_table_info *newinfo;
574 int cpu;
575
576 /* Pedantry: prevent them from hitting BUG() in vmalloc.c --RR */
577 if ((SMP_ALIGN(size) >> PAGE_SHIFT) + 2 > num_physpages)
578 return NULL;
579
580 newinfo = kzalloc(XT_TABLE_INFO_SZ, GFP_KERNEL);
581 if (!newinfo)
582 return NULL;
583
584 newinfo->size = size;
585
586 for_each_possible_cpu(cpu) {
587 if (size <= PAGE_SIZE)
588 newinfo->entries[cpu] = kmalloc_node(size,
589 GFP_KERNEL,
590 cpu_to_node(cpu));
591 else
592 newinfo->entries[cpu] = vmalloc_node(size,
593 cpu_to_node(cpu));
594
595 if (newinfo->entries[cpu] == NULL) {
596 xt_free_table_info(newinfo);
597 return NULL;
598 }
599 }
600
601 return newinfo;
602 }
603 EXPORT_SYMBOL(xt_alloc_table_info);
604
605 void xt_free_table_info(struct xt_table_info *info)
606 {
607 int cpu;
608
609 for_each_possible_cpu(cpu) {
610 if (info->size <= PAGE_SIZE)
611 kfree(info->entries[cpu]);
612 else
613 vfree(info->entries[cpu]);
614 }
615 kfree(info);
616 }
617 EXPORT_SYMBOL(xt_free_table_info);
618
619 /* Find table by name, grabs mutex & ref. Returns ERR_PTR() on error. */
620 struct xt_table *xt_find_table_lock(struct net *net, u_int8_t af,
621 const char *name)
622 {
623 struct xt_table *t;
624
625 if (mutex_lock_interruptible(&xt[af].mutex) != 0)
626 return ERR_PTR(-EINTR);
627
628 list_for_each_entry(t, &net->xt.tables[af], list)
629 if (strcmp(t->name, name) == 0 && try_module_get(t->me))
630 return t;
631 mutex_unlock(&xt[af].mutex);
632 return NULL;
633 }
634 EXPORT_SYMBOL_GPL(xt_find_table_lock);
635
636 void xt_table_unlock(struct xt_table *table)
637 {
638 mutex_unlock(&xt[table->af].mutex);
639 }
640 EXPORT_SYMBOL_GPL(xt_table_unlock);
641
642 #ifdef CONFIG_COMPAT
643 void xt_compat_lock(u_int8_t af)
644 {
645 mutex_lock(&xt[af].compat_mutex);
646 }
647 EXPORT_SYMBOL_GPL(xt_compat_lock);
648
649 void xt_compat_unlock(u_int8_t af)
650 {
651 mutex_unlock(&xt[af].compat_mutex);
652 }
653 EXPORT_SYMBOL_GPL(xt_compat_unlock);
654 #endif
655
656 struct xt_table_info *
657 xt_replace_table(struct xt_table *table,
658 unsigned int num_counters,
659 struct xt_table_info *newinfo,
660 int *error)
661 {
662 struct xt_table_info *oldinfo, *private;
663
664 /* Do the substitution. */
665 write_lock_bh(&table->lock);
666 private = table->private;
667 /* Check inside lock: is the old number correct? */
668 if (num_counters != private->number) {
669 duprintf("num_counters != table->private->number (%u/%u)\n",
670 num_counters, private->number);
671 write_unlock_bh(&table->lock);
672 *error = -EAGAIN;
673 return NULL;
674 }
675 oldinfo = private;
676 table->private = newinfo;
677 newinfo->initial_entries = oldinfo->initial_entries;
678 write_unlock_bh(&table->lock);
679
680 return oldinfo;
681 }
682 EXPORT_SYMBOL_GPL(xt_replace_table);
683
684 struct xt_table *xt_register_table(struct net *net, struct xt_table *table,
685 struct xt_table_info *bootstrap,
686 struct xt_table_info *newinfo)
687 {
688 int ret;
689 struct xt_table_info *private;
690 struct xt_table *t;
691
692 /* Don't add one object to multiple lists. */
693 table = kmemdup(table, sizeof(struct xt_table), GFP_KERNEL);
694 if (!table) {
695 ret = -ENOMEM;
696 goto out;
697 }
698
699 ret = mutex_lock_interruptible(&xt[table->af].mutex);
700 if (ret != 0)
701 goto out_free;
702
703 /* Don't autoload: we'd eat our tail... */
704 list_for_each_entry(t, &net->xt.tables[table->af], list) {
705 if (strcmp(t->name, table->name) == 0) {
706 ret = -EEXIST;
707 goto unlock;
708 }
709 }
710
711 /* Simplifies replace_table code. */
712 table->private = bootstrap;
713 rwlock_init(&table->lock);
714 if (!xt_replace_table(table, 0, newinfo, &ret))
715 goto unlock;
716
717 private = table->private;
718 duprintf("table->private->number = %u\n", private->number);
719
720 /* save number of initial entries */
721 private->initial_entries = private->number;
722
723 list_add(&table->list, &net->xt.tables[table->af]);
724 mutex_unlock(&xt[table->af].mutex);
725 return table;
726
727 unlock:
728 mutex_unlock(&xt[table->af].mutex);
729 out_free:
730 kfree(table);
731 out:
732 return ERR_PTR(ret);
733 }
734 EXPORT_SYMBOL_GPL(xt_register_table);
735
736 void *xt_unregister_table(struct xt_table *table)
737 {
738 struct xt_table_info *private;
739
740 mutex_lock(&xt[table->af].mutex);
741 private = table->private;
742 list_del(&table->list);
743 mutex_unlock(&xt[table->af].mutex);
744 kfree(table);
745
746 return private;
747 }
748 EXPORT_SYMBOL_GPL(xt_unregister_table);
749
750 #ifdef CONFIG_PROC_FS
751 struct xt_names_priv {
752 struct seq_net_private p;
753 u_int8_t af;
754 };
755 static void *xt_table_seq_start(struct seq_file *seq, loff_t *pos)
756 {
757 struct xt_names_priv *priv = seq->private;
758 struct net *net = seq_file_net(seq);
759 u_int8_t af = priv->af;
760
761 mutex_lock(&xt[af].mutex);
762 return seq_list_start(&net->xt.tables[af], *pos);
763 }
764
765 static void *xt_table_seq_next(struct seq_file *seq, void *v, loff_t *pos)
766 {
767 struct xt_names_priv *priv = seq->private;
768 struct net *net = seq_file_net(seq);
769 u_int8_t af = priv->af;
770
771 return seq_list_next(v, &net->xt.tables[af], pos);
772 }
773
774 static void xt_table_seq_stop(struct seq_file *seq, void *v)
775 {
776 struct xt_names_priv *priv = seq->private;
777 u_int8_t af = priv->af;
778
779 mutex_unlock(&xt[af].mutex);
780 }
781
782 static int xt_table_seq_show(struct seq_file *seq, void *v)
783 {
784 struct xt_table *table = list_entry(v, struct xt_table, list);
785
786 if (strlen(table->name))
787 return seq_printf(seq, "%s\n", table->name);
788 else
789 return 0;
790 }
791
792 static const struct seq_operations xt_table_seq_ops = {
793 .start = xt_table_seq_start,
794 .next = xt_table_seq_next,
795 .stop = xt_table_seq_stop,
796 .show = xt_table_seq_show,
797 };
798
799 static int xt_table_open(struct inode *inode, struct file *file)
800 {
801 int ret;
802 struct xt_names_priv *priv;
803
804 ret = seq_open_net(inode, file, &xt_table_seq_ops,
805 sizeof(struct xt_names_priv));
806 if (!ret) {
807 priv = ((struct seq_file *)file->private_data)->private;
808 priv->af = (unsigned long)PDE(inode)->data;
809 }
810 return ret;
811 }
812
813 static const struct file_operations xt_table_ops = {
814 .owner = THIS_MODULE,
815 .open = xt_table_open,
816 .read = seq_read,
817 .llseek = seq_lseek,
818 .release = seq_release_net,
819 };
820
821 static void *xt_match_seq_start(struct seq_file *seq, loff_t *pos)
822 {
823 struct proc_dir_entry *pde = (struct proc_dir_entry *)seq->private;
824 u_int16_t af = (unsigned long)pde->data;
825
826 mutex_lock(&xt[af].mutex);
827 return seq_list_start(&xt[af].match, *pos);
828 }
829
830 static void *xt_match_seq_next(struct seq_file *seq, void *v, loff_t *pos)
831 {
832 struct proc_dir_entry *pde = (struct proc_dir_entry *)seq->private;
833 u_int16_t af = (unsigned long)pde->data;
834
835 return seq_list_next(v, &xt[af].match, pos);
836 }
837
838 static void xt_match_seq_stop(struct seq_file *seq, void *v)
839 {
840 struct proc_dir_entry *pde = seq->private;
841 u_int16_t af = (unsigned long)pde->data;
842
843 mutex_unlock(&xt[af].mutex);
844 }
845
846 static int xt_match_seq_show(struct seq_file *seq, void *v)
847 {
848 struct xt_match *match = list_entry(v, struct xt_match, list);
849
850 if (strlen(match->name))
851 return seq_printf(seq, "%s\n", match->name);
852 else
853 return 0;
854 }
855
856 static const struct seq_operations xt_match_seq_ops = {
857 .start = xt_match_seq_start,
858 .next = xt_match_seq_next,
859 .stop = xt_match_seq_stop,
860 .show = xt_match_seq_show,
861 };
862
863 static int xt_match_open(struct inode *inode, struct file *file)
864 {
865 int ret;
866
867 ret = seq_open(file, &xt_match_seq_ops);
868 if (!ret) {
869 struct seq_file *seq = file->private_data;
870
871 seq->private = PDE(inode);
872 }
873 return ret;
874 }
875
876 static const struct file_operations xt_match_ops = {
877 .owner = THIS_MODULE,
878 .open = xt_match_open,
879 .read = seq_read,
880 .llseek = seq_lseek,
881 .release = seq_release,
882 };
883
884 static void *xt_target_seq_start(struct seq_file *seq, loff_t *pos)
885 {
886 struct proc_dir_entry *pde = (struct proc_dir_entry *)seq->private;
887 u_int16_t af = (unsigned long)pde->data;
888
889 mutex_lock(&xt[af].mutex);
890 return seq_list_start(&xt[af].target, *pos);
891 }
892
893 static void *xt_target_seq_next(struct seq_file *seq, void *v, loff_t *pos)
894 {
895 struct proc_dir_entry *pde = (struct proc_dir_entry *)seq->private;
896 u_int16_t af = (unsigned long)pde->data;
897
898 return seq_list_next(v, &xt[af].target, pos);
899 }
900
901 static void xt_target_seq_stop(struct seq_file *seq, void *v)
902 {
903 struct proc_dir_entry *pde = seq->private;
904 u_int16_t af = (unsigned long)pde->data;
905
906 mutex_unlock(&xt[af].mutex);
907 }
908
909 static int xt_target_seq_show(struct seq_file *seq, void *v)
910 {
911 struct xt_target *target = list_entry(v, struct xt_target, list);
912
913 if (strlen(target->name))
914 return seq_printf(seq, "%s\n", target->name);
915 else
916 return 0;
917 }
918
919 static const struct seq_operations xt_target_seq_ops = {
920 .start = xt_target_seq_start,
921 .next = xt_target_seq_next,
922 .stop = xt_target_seq_stop,
923 .show = xt_target_seq_show,
924 };
925
926 static int xt_target_open(struct inode *inode, struct file *file)
927 {
928 int ret;
929
930 ret = seq_open(file, &xt_target_seq_ops);
931 if (!ret) {
932 struct seq_file *seq = file->private_data;
933
934 seq->private = PDE(inode);
935 }
936 return ret;
937 }
938
939 static const struct file_operations xt_target_ops = {
940 .owner = THIS_MODULE,
941 .open = xt_target_open,
942 .read = seq_read,
943 .llseek = seq_lseek,
944 .release = seq_release,
945 };
946
947 #define FORMAT_TABLES "_tables_names"
948 #define FORMAT_MATCHES "_tables_matches"
949 #define FORMAT_TARGETS "_tables_targets"
950
951 #endif /* CONFIG_PROC_FS */
952
953 int xt_proto_init(struct net *net, u_int8_t af)
954 {
955 #ifdef CONFIG_PROC_FS
956 char buf[XT_FUNCTION_MAXNAMELEN];
957 struct proc_dir_entry *proc;
958 #endif
959
960 if (af >= ARRAY_SIZE(xt_prefix))
961 return -EINVAL;
962
963
964 #ifdef CONFIG_PROC_FS
965 strlcpy(buf, xt_prefix[af], sizeof(buf));
966 strlcat(buf, FORMAT_TABLES, sizeof(buf));
967 proc = proc_create_data(buf, 0440, net->proc_net, &xt_table_ops,
968 (void *)(unsigned long)af);
969 if (!proc)
970 goto out;
971
972 strlcpy(buf, xt_prefix[af], sizeof(buf));
973 strlcat(buf, FORMAT_MATCHES, sizeof(buf));
974 proc = proc_create_data(buf, 0440, net->proc_net, &xt_match_ops,
975 (void *)(unsigned long)af);
976 if (!proc)
977 goto out_remove_tables;
978
979 strlcpy(buf, xt_prefix[af], sizeof(buf));
980 strlcat(buf, FORMAT_TARGETS, sizeof(buf));
981 proc = proc_create_data(buf, 0440, net->proc_net, &xt_target_ops,
982 (void *)(unsigned long)af);
983 if (!proc)
984 goto out_remove_matches;
985 #endif
986
987 return 0;
988
989 #ifdef CONFIG_PROC_FS
990 out_remove_matches:
991 strlcpy(buf, xt_prefix[af], sizeof(buf));
992 strlcat(buf, FORMAT_MATCHES, sizeof(buf));
993 proc_net_remove(net, buf);
994
995 out_remove_tables:
996 strlcpy(buf, xt_prefix[af], sizeof(buf));
997 strlcat(buf, FORMAT_TABLES, sizeof(buf));
998 proc_net_remove(net, buf);
999 out:
1000 return -1;
1001 #endif
1002 }
1003 EXPORT_SYMBOL_GPL(xt_proto_init);
1004
1005 void xt_proto_fini(struct net *net, u_int8_t af)
1006 {
1007 #ifdef CONFIG_PROC_FS
1008 char buf[XT_FUNCTION_MAXNAMELEN];
1009
1010 strlcpy(buf, xt_prefix[af], sizeof(buf));
1011 strlcat(buf, FORMAT_TABLES, sizeof(buf));
1012 proc_net_remove(net, buf);
1013
1014 strlcpy(buf, xt_prefix[af], sizeof(buf));
1015 strlcat(buf, FORMAT_TARGETS, sizeof(buf));
1016 proc_net_remove(net, buf);
1017
1018 strlcpy(buf, xt_prefix[af], sizeof(buf));
1019 strlcat(buf, FORMAT_MATCHES, sizeof(buf));
1020 proc_net_remove(net, buf);
1021 #endif /*CONFIG_PROC_FS*/
1022 }
1023 EXPORT_SYMBOL_GPL(xt_proto_fini);
1024
1025 static int __net_init xt_net_init(struct net *net)
1026 {
1027 int i;
1028
1029 for (i = 0; i < NFPROTO_NUMPROTO; i++)
1030 INIT_LIST_HEAD(&net->xt.tables[i]);
1031 return 0;
1032 }
1033
1034 static struct pernet_operations xt_net_ops = {
1035 .init = xt_net_init,
1036 };
1037
1038 static int __init xt_init(void)
1039 {
1040 int i, rv;
1041
1042 xt = kmalloc(sizeof(struct xt_af) * NFPROTO_NUMPROTO, GFP_KERNEL);
1043 if (!xt)
1044 return -ENOMEM;
1045
1046 for (i = 0; i < NFPROTO_NUMPROTO; i++) {
1047 mutex_init(&xt[i].mutex);
1048 #ifdef CONFIG_COMPAT
1049 mutex_init(&xt[i].compat_mutex);
1050 xt[i].compat_offsets = NULL;
1051 #endif
1052 INIT_LIST_HEAD(&xt[i].target);
1053 INIT_LIST_HEAD(&xt[i].match);
1054 }
1055 rv = register_pernet_subsys(&xt_net_ops);
1056 if (rv < 0)
1057 kfree(xt);
1058 return rv;
1059 }
1060
1061 static void __exit xt_fini(void)
1062 {
1063 unregister_pernet_subsys(&xt_net_ops);
1064 kfree(xt);
1065 }
1066
1067 module_init(xt_init);
1068 module_exit(xt_fini);
1069