Merge tag 'armsoc-drivers' of git://git.kernel.org/pub/scm/linux/kernel/git/arm/arm-soc
[deliverable/linux.git] / net / ipv4 / netfilter / ip_tables.c
1 /*
2 * Packet matching code.
3 *
4 * Copyright (C) 1999 Paul `Rusty' Russell & Michael J. Neuling
5 * Copyright (C) 2000-2005 Netfilter Core Team <coreteam@netfilter.org>
6 * Copyright (C) 2006-2010 Patrick McHardy <kaber@trash.net>
7 *
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License version 2 as
10 * published by the Free Software Foundation.
11 */
12 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
13 #include <linux/cache.h>
14 #include <linux/capability.h>
15 #include <linux/skbuff.h>
16 #include <linux/kmod.h>
17 #include <linux/vmalloc.h>
18 #include <linux/netdevice.h>
19 #include <linux/module.h>
20 #include <linux/icmp.h>
21 #include <net/ip.h>
22 #include <net/compat.h>
23 #include <asm/uaccess.h>
24 #include <linux/mutex.h>
25 #include <linux/proc_fs.h>
26 #include <linux/err.h>
27 #include <linux/cpumask.h>
28
29 #include <linux/netfilter/x_tables.h>
30 #include <linux/netfilter_ipv4/ip_tables.h>
31 #include <net/netfilter/nf_log.h>
32 #include "../../netfilter/xt_repldata.h"
33
34 MODULE_LICENSE("GPL");
35 MODULE_AUTHOR("Netfilter Core Team <coreteam@netfilter.org>");
36 MODULE_DESCRIPTION("IPv4 packet filter");
37
38 /*#define DEBUG_IP_FIREWALL*/
39 /*#define DEBUG_ALLOW_ALL*/ /* Useful for remote debugging */
40 /*#define DEBUG_IP_FIREWALL_USER*/
41
42 #ifdef DEBUG_IP_FIREWALL
43 #define dprintf(format, args...) pr_info(format , ## args)
44 #else
45 #define dprintf(format, args...)
46 #endif
47
48 #ifdef DEBUG_IP_FIREWALL_USER
49 #define duprintf(format, args...) pr_info(format , ## args)
50 #else
51 #define duprintf(format, args...)
52 #endif
53
54 #ifdef CONFIG_NETFILTER_DEBUG
55 #define IP_NF_ASSERT(x) WARN_ON(!(x))
56 #else
57 #define IP_NF_ASSERT(x)
58 #endif
59
60 #if 0
61 /* All the better to debug you with... */
62 #define static
63 #define inline
64 #endif
65
66 void *ipt_alloc_initial_table(const struct xt_table *info)
67 {
68 return xt_alloc_initial_table(ipt, IPT);
69 }
70 EXPORT_SYMBOL_GPL(ipt_alloc_initial_table);
71
72 /* Returns whether matches rule or not. */
73 /* Performance critical - called for every packet */
74 static inline bool
75 ip_packet_match(const struct iphdr *ip,
76 const char *indev,
77 const char *outdev,
78 const struct ipt_ip *ipinfo,
79 int isfrag)
80 {
81 unsigned long ret;
82
83 #define FWINV(bool, invflg) ((bool) ^ !!(ipinfo->invflags & (invflg)))
84
85 if (FWINV((ip->saddr&ipinfo->smsk.s_addr) != ipinfo->src.s_addr,
86 IPT_INV_SRCIP) ||
87 FWINV((ip->daddr&ipinfo->dmsk.s_addr) != ipinfo->dst.s_addr,
88 IPT_INV_DSTIP)) {
89 dprintf("Source or dest mismatch.\n");
90
91 dprintf("SRC: %pI4. Mask: %pI4. Target: %pI4.%s\n",
92 &ip->saddr, &ipinfo->smsk.s_addr, &ipinfo->src.s_addr,
93 ipinfo->invflags & IPT_INV_SRCIP ? " (INV)" : "");
94 dprintf("DST: %pI4 Mask: %pI4 Target: %pI4.%s\n",
95 &ip->daddr, &ipinfo->dmsk.s_addr, &ipinfo->dst.s_addr,
96 ipinfo->invflags & IPT_INV_DSTIP ? " (INV)" : "");
97 return false;
98 }
99
100 ret = ifname_compare_aligned(indev, ipinfo->iniface, ipinfo->iniface_mask);
101
102 if (FWINV(ret != 0, IPT_INV_VIA_IN)) {
103 dprintf("VIA in mismatch (%s vs %s).%s\n",
104 indev, ipinfo->iniface,
105 ipinfo->invflags&IPT_INV_VIA_IN ?" (INV)":"");
106 return false;
107 }
108
109 ret = ifname_compare_aligned(outdev, ipinfo->outiface, ipinfo->outiface_mask);
110
111 if (FWINV(ret != 0, IPT_INV_VIA_OUT)) {
112 dprintf("VIA out mismatch (%s vs %s).%s\n",
113 outdev, ipinfo->outiface,
114 ipinfo->invflags&IPT_INV_VIA_OUT ?" (INV)":"");
115 return false;
116 }
117
118 /* Check specific protocol */
119 if (ipinfo->proto &&
120 FWINV(ip->protocol != ipinfo->proto, IPT_INV_PROTO)) {
121 dprintf("Packet protocol %hi does not match %hi.%s\n",
122 ip->protocol, ipinfo->proto,
123 ipinfo->invflags&IPT_INV_PROTO ? " (INV)":"");
124 return false;
125 }
126
127 /* If we have a fragment rule but the packet is not a fragment
128 * then we return zero */
129 if (FWINV((ipinfo->flags&IPT_F_FRAG) && !isfrag, IPT_INV_FRAG)) {
130 dprintf("Fragment rule but not fragment.%s\n",
131 ipinfo->invflags & IPT_INV_FRAG ? " (INV)" : "");
132 return false;
133 }
134
135 return true;
136 }
137
138 static bool
139 ip_checkentry(const struct ipt_ip *ip)
140 {
141 if (ip->flags & ~IPT_F_MASK) {
142 duprintf("Unknown flag bits set: %08X\n",
143 ip->flags & ~IPT_F_MASK);
144 return false;
145 }
146 if (ip->invflags & ~IPT_INV_MASK) {
147 duprintf("Unknown invflag bits set: %08X\n",
148 ip->invflags & ~IPT_INV_MASK);
149 return false;
150 }
151 return true;
152 }
153
154 static unsigned int
155 ipt_error(struct sk_buff *skb, const struct xt_action_param *par)
156 {
157 net_info_ratelimited("error: `%s'\n", (const char *)par->targinfo);
158
159 return NF_DROP;
160 }
161
162 /* Performance critical */
163 static inline struct ipt_entry *
164 get_entry(const void *base, unsigned int offset)
165 {
166 return (struct ipt_entry *)(base + offset);
167 }
168
169 /* All zeroes == unconditional rule. */
170 /* Mildly perf critical (only if packet tracing is on) */
171 static inline bool unconditional(const struct ipt_ip *ip)
172 {
173 static const struct ipt_ip uncond;
174
175 return memcmp(ip, &uncond, sizeof(uncond)) == 0;
176 #undef FWINV
177 }
178
179 /* for const-correctness */
180 static inline const struct xt_entry_target *
181 ipt_get_target_c(const struct ipt_entry *e)
182 {
183 return ipt_get_target((struct ipt_entry *)e);
184 }
185
186 #if IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TRACE)
187 static const char *const hooknames[] = {
188 [NF_INET_PRE_ROUTING] = "PREROUTING",
189 [NF_INET_LOCAL_IN] = "INPUT",
190 [NF_INET_FORWARD] = "FORWARD",
191 [NF_INET_LOCAL_OUT] = "OUTPUT",
192 [NF_INET_POST_ROUTING] = "POSTROUTING",
193 };
194
195 enum nf_ip_trace_comments {
196 NF_IP_TRACE_COMMENT_RULE,
197 NF_IP_TRACE_COMMENT_RETURN,
198 NF_IP_TRACE_COMMENT_POLICY,
199 };
200
201 static const char *const comments[] = {
202 [NF_IP_TRACE_COMMENT_RULE] = "rule",
203 [NF_IP_TRACE_COMMENT_RETURN] = "return",
204 [NF_IP_TRACE_COMMENT_POLICY] = "policy",
205 };
206
207 static struct nf_loginfo trace_loginfo = {
208 .type = NF_LOG_TYPE_LOG,
209 .u = {
210 .log = {
211 .level = 4,
212 .logflags = NF_LOG_MASK,
213 },
214 },
215 };
216
217 /* Mildly perf critical (only if packet tracing is on) */
218 static inline int
219 get_chainname_rulenum(const struct ipt_entry *s, const struct ipt_entry *e,
220 const char *hookname, const char **chainname,
221 const char **comment, unsigned int *rulenum)
222 {
223 const struct xt_standard_target *t = (void *)ipt_get_target_c(s);
224
225 if (strcmp(t->target.u.kernel.target->name, XT_ERROR_TARGET) == 0) {
226 /* Head of user chain: ERROR target with chainname */
227 *chainname = t->target.data;
228 (*rulenum) = 0;
229 } else if (s == e) {
230 (*rulenum)++;
231
232 if (s->target_offset == sizeof(struct ipt_entry) &&
233 strcmp(t->target.u.kernel.target->name,
234 XT_STANDARD_TARGET) == 0 &&
235 t->verdict < 0 &&
236 unconditional(&s->ip)) {
237 /* Tail of chains: STANDARD target (return/policy) */
238 *comment = *chainname == hookname
239 ? comments[NF_IP_TRACE_COMMENT_POLICY]
240 : comments[NF_IP_TRACE_COMMENT_RETURN];
241 }
242 return 1;
243 } else
244 (*rulenum)++;
245
246 return 0;
247 }
248
249 static void trace_packet(const struct sk_buff *skb,
250 unsigned int hook,
251 const struct net_device *in,
252 const struct net_device *out,
253 const char *tablename,
254 const struct xt_table_info *private,
255 const struct ipt_entry *e)
256 {
257 const void *table_base;
258 const struct ipt_entry *root;
259 const char *hookname, *chainname, *comment;
260 const struct ipt_entry *iter;
261 unsigned int rulenum = 0;
262 struct net *net = dev_net(in ? in : out);
263
264 table_base = private->entries[smp_processor_id()];
265 root = get_entry(table_base, private->hook_entry[hook]);
266
267 hookname = chainname = hooknames[hook];
268 comment = comments[NF_IP_TRACE_COMMENT_RULE];
269
270 xt_entry_foreach(iter, root, private->size - private->hook_entry[hook])
271 if (get_chainname_rulenum(iter, e, hookname,
272 &chainname, &comment, &rulenum) != 0)
273 break;
274
275 nf_log_trace(net, AF_INET, hook, skb, in, out, &trace_loginfo,
276 "TRACE: %s:%s:%s:%u ",
277 tablename, chainname, comment, rulenum);
278 }
279 #endif
280
281 static inline __pure
282 struct ipt_entry *ipt_next_entry(const struct ipt_entry *entry)
283 {
284 return (void *)entry + entry->next_offset;
285 }
286
287 /* Returns one of the generic firewall policies, like NF_ACCEPT. */
288 unsigned int
289 ipt_do_table(struct sk_buff *skb,
290 unsigned int hook,
291 const struct nf_hook_state *state,
292 struct xt_table *table)
293 {
294 static const char nulldevname[IFNAMSIZ] __attribute__((aligned(sizeof(long))));
295 const struct iphdr *ip;
296 /* Initializing verdict to NF_DROP keeps gcc happy. */
297 unsigned int verdict = NF_DROP;
298 const char *indev, *outdev;
299 const void *table_base;
300 struct ipt_entry *e, **jumpstack;
301 unsigned int *stackptr, origptr, cpu;
302 const struct xt_table_info *private;
303 struct xt_action_param acpar;
304 unsigned int addend;
305
306 /* Initialization */
307 ip = ip_hdr(skb);
308 indev = state->in ? state->in->name : nulldevname;
309 outdev = state->out ? state->out->name : nulldevname;
310 /* We handle fragments by dealing with the first fragment as
311 * if it was a normal packet. All other fragments are treated
312 * normally, except that they will NEVER match rules that ask
313 * things we don't know, ie. tcp syn flag or ports). If the
314 * rule is also a fragment-specific rule, non-fragments won't
315 * match it. */
316 acpar.fragoff = ntohs(ip->frag_off) & IP_OFFSET;
317 acpar.thoff = ip_hdrlen(skb);
318 acpar.hotdrop = false;
319 acpar.in = state->in;
320 acpar.out = state->out;
321 acpar.family = NFPROTO_IPV4;
322 acpar.hooknum = hook;
323
324 IP_NF_ASSERT(table->valid_hooks & (1 << hook));
325 local_bh_disable();
326 addend = xt_write_recseq_begin();
327 private = table->private;
328 cpu = smp_processor_id();
329 /*
330 * Ensure we load private-> members after we've fetched the base
331 * pointer.
332 */
333 smp_read_barrier_depends();
334 table_base = private->entries[cpu];
335 jumpstack = (struct ipt_entry **)private->jumpstack[cpu];
336 stackptr = per_cpu_ptr(private->stackptr, cpu);
337 origptr = *stackptr;
338
339 e = get_entry(table_base, private->hook_entry[hook]);
340
341 pr_debug("Entering %s(hook %u); sp at %u (UF %p)\n",
342 table->name, hook, origptr,
343 get_entry(table_base, private->underflow[hook]));
344
345 do {
346 const struct xt_entry_target *t;
347 const struct xt_entry_match *ematch;
348
349 IP_NF_ASSERT(e);
350 if (!ip_packet_match(ip, indev, outdev,
351 &e->ip, acpar.fragoff)) {
352 no_match:
353 e = ipt_next_entry(e);
354 continue;
355 }
356
357 xt_ematch_foreach(ematch, e) {
358 acpar.match = ematch->u.kernel.match;
359 acpar.matchinfo = ematch->data;
360 if (!acpar.match->match(skb, &acpar))
361 goto no_match;
362 }
363
364 ADD_COUNTER(e->counters, skb->len, 1);
365
366 t = ipt_get_target(e);
367 IP_NF_ASSERT(t->u.kernel.target);
368
369 #if IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TRACE)
370 /* The packet is traced: log it */
371 if (unlikely(skb->nf_trace))
372 trace_packet(skb, hook, state->in, state->out,
373 table->name, private, e);
374 #endif
375 /* Standard target? */
376 if (!t->u.kernel.target->target) {
377 int v;
378
379 v = ((struct xt_standard_target *)t)->verdict;
380 if (v < 0) {
381 /* Pop from stack? */
382 if (v != XT_RETURN) {
383 verdict = (unsigned int)(-v) - 1;
384 break;
385 }
386 if (*stackptr <= origptr) {
387 e = get_entry(table_base,
388 private->underflow[hook]);
389 pr_debug("Underflow (this is normal) "
390 "to %p\n", e);
391 } else {
392 e = jumpstack[--*stackptr];
393 pr_debug("Pulled %p out from pos %u\n",
394 e, *stackptr);
395 e = ipt_next_entry(e);
396 }
397 continue;
398 }
399 if (table_base + v != ipt_next_entry(e) &&
400 !(e->ip.flags & IPT_F_GOTO)) {
401 if (*stackptr >= private->stacksize) {
402 verdict = NF_DROP;
403 break;
404 }
405 jumpstack[(*stackptr)++] = e;
406 pr_debug("Pushed %p into pos %u\n",
407 e, *stackptr - 1);
408 }
409
410 e = get_entry(table_base, v);
411 continue;
412 }
413
414 acpar.target = t->u.kernel.target;
415 acpar.targinfo = t->data;
416
417 verdict = t->u.kernel.target->target(skb, &acpar);
418 /* Target might have changed stuff. */
419 ip = ip_hdr(skb);
420 if (verdict == XT_CONTINUE)
421 e = ipt_next_entry(e);
422 else
423 /* Verdict */
424 break;
425 } while (!acpar.hotdrop);
426 pr_debug("Exiting %s; resetting sp from %u to %u\n",
427 __func__, *stackptr, origptr);
428 *stackptr = origptr;
429 xt_write_recseq_end(addend);
430 local_bh_enable();
431
432 #ifdef DEBUG_ALLOW_ALL
433 return NF_ACCEPT;
434 #else
435 if (acpar.hotdrop)
436 return NF_DROP;
437 else return verdict;
438 #endif
439 }
440
441 /* Figures out from what hook each rule can be called: returns 0 if
442 there are loops. Puts hook bitmask in comefrom. */
443 static int
444 mark_source_chains(const struct xt_table_info *newinfo,
445 unsigned int valid_hooks, void *entry0)
446 {
447 unsigned int hook;
448
449 /* No recursion; use packet counter to save back ptrs (reset
450 to 0 as we leave), and comefrom to save source hook bitmask */
451 for (hook = 0; hook < NF_INET_NUMHOOKS; hook++) {
452 unsigned int pos = newinfo->hook_entry[hook];
453 struct ipt_entry *e = (struct ipt_entry *)(entry0 + pos);
454
455 if (!(valid_hooks & (1 << hook)))
456 continue;
457
458 /* Set initial back pointer. */
459 e->counters.pcnt = pos;
460
461 for (;;) {
462 const struct xt_standard_target *t
463 = (void *)ipt_get_target_c(e);
464 int visited = e->comefrom & (1 << hook);
465
466 if (e->comefrom & (1 << NF_INET_NUMHOOKS)) {
467 pr_err("iptables: loop hook %u pos %u %08X.\n",
468 hook, pos, e->comefrom);
469 return 0;
470 }
471 e->comefrom |= ((1 << hook) | (1 << NF_INET_NUMHOOKS));
472
473 /* Unconditional return/END. */
474 if ((e->target_offset == sizeof(struct ipt_entry) &&
475 (strcmp(t->target.u.user.name,
476 XT_STANDARD_TARGET) == 0) &&
477 t->verdict < 0 && unconditional(&e->ip)) ||
478 visited) {
479 unsigned int oldpos, size;
480
481 if ((strcmp(t->target.u.user.name,
482 XT_STANDARD_TARGET) == 0) &&
483 t->verdict < -NF_MAX_VERDICT - 1) {
484 duprintf("mark_source_chains: bad "
485 "negative verdict (%i)\n",
486 t->verdict);
487 return 0;
488 }
489
490 /* Return: backtrack through the last
491 big jump. */
492 do {
493 e->comefrom ^= (1<<NF_INET_NUMHOOKS);
494 #ifdef DEBUG_IP_FIREWALL_USER
495 if (e->comefrom
496 & (1 << NF_INET_NUMHOOKS)) {
497 duprintf("Back unset "
498 "on hook %u "
499 "rule %u\n",
500 hook, pos);
501 }
502 #endif
503 oldpos = pos;
504 pos = e->counters.pcnt;
505 e->counters.pcnt = 0;
506
507 /* We're at the start. */
508 if (pos == oldpos)
509 goto next;
510
511 e = (struct ipt_entry *)
512 (entry0 + pos);
513 } while (oldpos == pos + e->next_offset);
514
515 /* Move along one */
516 size = e->next_offset;
517 e = (struct ipt_entry *)
518 (entry0 + pos + size);
519 e->counters.pcnt = pos;
520 pos += size;
521 } else {
522 int newpos = t->verdict;
523
524 if (strcmp(t->target.u.user.name,
525 XT_STANDARD_TARGET) == 0 &&
526 newpos >= 0) {
527 if (newpos > newinfo->size -
528 sizeof(struct ipt_entry)) {
529 duprintf("mark_source_chains: "
530 "bad verdict (%i)\n",
531 newpos);
532 return 0;
533 }
534 /* This a jump; chase it. */
535 duprintf("Jump rule %u -> %u\n",
536 pos, newpos);
537 } else {
538 /* ... this is a fallthru */
539 newpos = pos + e->next_offset;
540 }
541 e = (struct ipt_entry *)
542 (entry0 + newpos);
543 e->counters.pcnt = pos;
544 pos = newpos;
545 }
546 }
547 next:
548 duprintf("Finished chain %u\n", hook);
549 }
550 return 1;
551 }
552
553 static void cleanup_match(struct xt_entry_match *m, struct net *net)
554 {
555 struct xt_mtdtor_param par;
556
557 par.net = net;
558 par.match = m->u.kernel.match;
559 par.matchinfo = m->data;
560 par.family = NFPROTO_IPV4;
561 if (par.match->destroy != NULL)
562 par.match->destroy(&par);
563 module_put(par.match->me);
564 }
565
566 static int
567 check_entry(const struct ipt_entry *e, const char *name)
568 {
569 const struct xt_entry_target *t;
570
571 if (!ip_checkentry(&e->ip)) {
572 duprintf("ip check failed %p %s.\n", e, name);
573 return -EINVAL;
574 }
575
576 if (e->target_offset + sizeof(struct xt_entry_target) >
577 e->next_offset)
578 return -EINVAL;
579
580 t = ipt_get_target_c(e);
581 if (e->target_offset + t->u.target_size > e->next_offset)
582 return -EINVAL;
583
584 return 0;
585 }
586
587 static int
588 check_match(struct xt_entry_match *m, struct xt_mtchk_param *par)
589 {
590 const struct ipt_ip *ip = par->entryinfo;
591 int ret;
592
593 par->match = m->u.kernel.match;
594 par->matchinfo = m->data;
595
596 ret = xt_check_match(par, m->u.match_size - sizeof(*m),
597 ip->proto, ip->invflags & IPT_INV_PROTO);
598 if (ret < 0) {
599 duprintf("check failed for `%s'.\n", par->match->name);
600 return ret;
601 }
602 return 0;
603 }
604
605 static int
606 find_check_match(struct xt_entry_match *m, struct xt_mtchk_param *par)
607 {
608 struct xt_match *match;
609 int ret;
610
611 match = xt_request_find_match(NFPROTO_IPV4, m->u.user.name,
612 m->u.user.revision);
613 if (IS_ERR(match)) {
614 duprintf("find_check_match: `%s' not found\n", m->u.user.name);
615 return PTR_ERR(match);
616 }
617 m->u.kernel.match = match;
618
619 ret = check_match(m, par);
620 if (ret)
621 goto err;
622
623 return 0;
624 err:
625 module_put(m->u.kernel.match->me);
626 return ret;
627 }
628
629 static int check_target(struct ipt_entry *e, struct net *net, const char *name)
630 {
631 struct xt_entry_target *t = ipt_get_target(e);
632 struct xt_tgchk_param par = {
633 .net = net,
634 .table = name,
635 .entryinfo = e,
636 .target = t->u.kernel.target,
637 .targinfo = t->data,
638 .hook_mask = e->comefrom,
639 .family = NFPROTO_IPV4,
640 };
641 int ret;
642
643 ret = xt_check_target(&par, t->u.target_size - sizeof(*t),
644 e->ip.proto, e->ip.invflags & IPT_INV_PROTO);
645 if (ret < 0) {
646 duprintf("check failed for `%s'.\n",
647 t->u.kernel.target->name);
648 return ret;
649 }
650 return 0;
651 }
652
653 static int
654 find_check_entry(struct ipt_entry *e, struct net *net, const char *name,
655 unsigned int size)
656 {
657 struct xt_entry_target *t;
658 struct xt_target *target;
659 int ret;
660 unsigned int j;
661 struct xt_mtchk_param mtpar;
662 struct xt_entry_match *ematch;
663
664 ret = check_entry(e, name);
665 if (ret)
666 return ret;
667
668 j = 0;
669 mtpar.net = net;
670 mtpar.table = name;
671 mtpar.entryinfo = &e->ip;
672 mtpar.hook_mask = e->comefrom;
673 mtpar.family = NFPROTO_IPV4;
674 xt_ematch_foreach(ematch, e) {
675 ret = find_check_match(ematch, &mtpar);
676 if (ret != 0)
677 goto cleanup_matches;
678 ++j;
679 }
680
681 t = ipt_get_target(e);
682 target = xt_request_find_target(NFPROTO_IPV4, t->u.user.name,
683 t->u.user.revision);
684 if (IS_ERR(target)) {
685 duprintf("find_check_entry: `%s' not found\n", t->u.user.name);
686 ret = PTR_ERR(target);
687 goto cleanup_matches;
688 }
689 t->u.kernel.target = target;
690
691 ret = check_target(e, net, name);
692 if (ret)
693 goto err;
694 return 0;
695 err:
696 module_put(t->u.kernel.target->me);
697 cleanup_matches:
698 xt_ematch_foreach(ematch, e) {
699 if (j-- == 0)
700 break;
701 cleanup_match(ematch, net);
702 }
703 return ret;
704 }
705
706 static bool check_underflow(const struct ipt_entry *e)
707 {
708 const struct xt_entry_target *t;
709 unsigned int verdict;
710
711 if (!unconditional(&e->ip))
712 return false;
713 t = ipt_get_target_c(e);
714 if (strcmp(t->u.user.name, XT_STANDARD_TARGET) != 0)
715 return false;
716 verdict = ((struct xt_standard_target *)t)->verdict;
717 verdict = -verdict - 1;
718 return verdict == NF_DROP || verdict == NF_ACCEPT;
719 }
720
721 static int
722 check_entry_size_and_hooks(struct ipt_entry *e,
723 struct xt_table_info *newinfo,
724 const unsigned char *base,
725 const unsigned char *limit,
726 const unsigned int *hook_entries,
727 const unsigned int *underflows,
728 unsigned int valid_hooks)
729 {
730 unsigned int h;
731
732 if ((unsigned long)e % __alignof__(struct ipt_entry) != 0 ||
733 (unsigned char *)e + sizeof(struct ipt_entry) >= limit) {
734 duprintf("Bad offset %p\n", e);
735 return -EINVAL;
736 }
737
738 if (e->next_offset
739 < sizeof(struct ipt_entry) + sizeof(struct xt_entry_target)) {
740 duprintf("checking: element %p size %u\n",
741 e, e->next_offset);
742 return -EINVAL;
743 }
744
745 /* Check hooks & underflows */
746 for (h = 0; h < NF_INET_NUMHOOKS; h++) {
747 if (!(valid_hooks & (1 << h)))
748 continue;
749 if ((unsigned char *)e - base == hook_entries[h])
750 newinfo->hook_entry[h] = hook_entries[h];
751 if ((unsigned char *)e - base == underflows[h]) {
752 if (!check_underflow(e)) {
753 pr_err("Underflows must be unconditional and "
754 "use the STANDARD target with "
755 "ACCEPT/DROP\n");
756 return -EINVAL;
757 }
758 newinfo->underflow[h] = underflows[h];
759 }
760 }
761
762 /* Clear counters and comefrom */
763 e->counters = ((struct xt_counters) { 0, 0 });
764 e->comefrom = 0;
765 return 0;
766 }
767
768 static void
769 cleanup_entry(struct ipt_entry *e, struct net *net)
770 {
771 struct xt_tgdtor_param par;
772 struct xt_entry_target *t;
773 struct xt_entry_match *ematch;
774
775 /* Cleanup all matches */
776 xt_ematch_foreach(ematch, e)
777 cleanup_match(ematch, net);
778 t = ipt_get_target(e);
779
780 par.net = net;
781 par.target = t->u.kernel.target;
782 par.targinfo = t->data;
783 par.family = NFPROTO_IPV4;
784 if (par.target->destroy != NULL)
785 par.target->destroy(&par);
786 module_put(par.target->me);
787 }
788
789 /* Checks and translates the user-supplied table segment (held in
790 newinfo) */
791 static int
792 translate_table(struct net *net, struct xt_table_info *newinfo, void *entry0,
793 const struct ipt_replace *repl)
794 {
795 struct ipt_entry *iter;
796 unsigned int i;
797 int ret = 0;
798
799 newinfo->size = repl->size;
800 newinfo->number = repl->num_entries;
801
802 /* Init all hooks to impossible value. */
803 for (i = 0; i < NF_INET_NUMHOOKS; i++) {
804 newinfo->hook_entry[i] = 0xFFFFFFFF;
805 newinfo->underflow[i] = 0xFFFFFFFF;
806 }
807
808 duprintf("translate_table: size %u\n", newinfo->size);
809 i = 0;
810 /* Walk through entries, checking offsets. */
811 xt_entry_foreach(iter, entry0, newinfo->size) {
812 ret = check_entry_size_and_hooks(iter, newinfo, entry0,
813 entry0 + repl->size,
814 repl->hook_entry,
815 repl->underflow,
816 repl->valid_hooks);
817 if (ret != 0)
818 return ret;
819 ++i;
820 if (strcmp(ipt_get_target(iter)->u.user.name,
821 XT_ERROR_TARGET) == 0)
822 ++newinfo->stacksize;
823 }
824
825 if (i != repl->num_entries) {
826 duprintf("translate_table: %u not %u entries\n",
827 i, repl->num_entries);
828 return -EINVAL;
829 }
830
831 /* Check hooks all assigned */
832 for (i = 0; i < NF_INET_NUMHOOKS; i++) {
833 /* Only hooks which are valid */
834 if (!(repl->valid_hooks & (1 << i)))
835 continue;
836 if (newinfo->hook_entry[i] == 0xFFFFFFFF) {
837 duprintf("Invalid hook entry %u %u\n",
838 i, repl->hook_entry[i]);
839 return -EINVAL;
840 }
841 if (newinfo->underflow[i] == 0xFFFFFFFF) {
842 duprintf("Invalid underflow %u %u\n",
843 i, repl->underflow[i]);
844 return -EINVAL;
845 }
846 }
847
848 if (!mark_source_chains(newinfo, repl->valid_hooks, entry0))
849 return -ELOOP;
850
851 /* Finally, each sanity check must pass */
852 i = 0;
853 xt_entry_foreach(iter, entry0, newinfo->size) {
854 ret = find_check_entry(iter, net, repl->name, repl->size);
855 if (ret != 0)
856 break;
857 ++i;
858 }
859
860 if (ret != 0) {
861 xt_entry_foreach(iter, entry0, newinfo->size) {
862 if (i-- == 0)
863 break;
864 cleanup_entry(iter, net);
865 }
866 return ret;
867 }
868
869 /* And one copy for every other CPU */
870 for_each_possible_cpu(i) {
871 if (newinfo->entries[i] && newinfo->entries[i] != entry0)
872 memcpy(newinfo->entries[i], entry0, newinfo->size);
873 }
874
875 return ret;
876 }
877
878 static void
879 get_counters(const struct xt_table_info *t,
880 struct xt_counters counters[])
881 {
882 struct ipt_entry *iter;
883 unsigned int cpu;
884 unsigned int i;
885
886 for_each_possible_cpu(cpu) {
887 seqcount_t *s = &per_cpu(xt_recseq, cpu);
888
889 i = 0;
890 xt_entry_foreach(iter, t->entries[cpu], t->size) {
891 u64 bcnt, pcnt;
892 unsigned int start;
893
894 do {
895 start = read_seqcount_begin(s);
896 bcnt = iter->counters.bcnt;
897 pcnt = iter->counters.pcnt;
898 } while (read_seqcount_retry(s, start));
899
900 ADD_COUNTER(counters[i], bcnt, pcnt);
901 ++i; /* macro does multi eval of i */
902 }
903 }
904 }
905
906 static struct xt_counters *alloc_counters(const struct xt_table *table)
907 {
908 unsigned int countersize;
909 struct xt_counters *counters;
910 const struct xt_table_info *private = table->private;
911
912 /* We need atomic snapshot of counters: rest doesn't change
913 (other than comefrom, which userspace doesn't care
914 about). */
915 countersize = sizeof(struct xt_counters) * private->number;
916 counters = vzalloc(countersize);
917
918 if (counters == NULL)
919 return ERR_PTR(-ENOMEM);
920
921 get_counters(private, counters);
922
923 return counters;
924 }
925
926 static int
927 copy_entries_to_user(unsigned int total_size,
928 const struct xt_table *table,
929 void __user *userptr)
930 {
931 unsigned int off, num;
932 const struct ipt_entry *e;
933 struct xt_counters *counters;
934 const struct xt_table_info *private = table->private;
935 int ret = 0;
936 const void *loc_cpu_entry;
937
938 counters = alloc_counters(table);
939 if (IS_ERR(counters))
940 return PTR_ERR(counters);
941
942 /* choose the copy that is on our node/cpu, ...
943 * This choice is lazy (because current thread is
944 * allowed to migrate to another cpu)
945 */
946 loc_cpu_entry = private->entries[raw_smp_processor_id()];
947 if (copy_to_user(userptr, loc_cpu_entry, total_size) != 0) {
948 ret = -EFAULT;
949 goto free_counters;
950 }
951
952 /* FIXME: use iterator macros --RR */
953 /* ... then go back and fix counters and names */
954 for (off = 0, num = 0; off < total_size; off += e->next_offset, num++){
955 unsigned int i;
956 const struct xt_entry_match *m;
957 const struct xt_entry_target *t;
958
959 e = (struct ipt_entry *)(loc_cpu_entry + off);
960 if (copy_to_user(userptr + off
961 + offsetof(struct ipt_entry, counters),
962 &counters[num],
963 sizeof(counters[num])) != 0) {
964 ret = -EFAULT;
965 goto free_counters;
966 }
967
968 for (i = sizeof(struct ipt_entry);
969 i < e->target_offset;
970 i += m->u.match_size) {
971 m = (void *)e + i;
972
973 if (copy_to_user(userptr + off + i
974 + offsetof(struct xt_entry_match,
975 u.user.name),
976 m->u.kernel.match->name,
977 strlen(m->u.kernel.match->name)+1)
978 != 0) {
979 ret = -EFAULT;
980 goto free_counters;
981 }
982 }
983
984 t = ipt_get_target_c(e);
985 if (copy_to_user(userptr + off + e->target_offset
986 + offsetof(struct xt_entry_target,
987 u.user.name),
988 t->u.kernel.target->name,
989 strlen(t->u.kernel.target->name)+1) != 0) {
990 ret = -EFAULT;
991 goto free_counters;
992 }
993 }
994
995 free_counters:
996 vfree(counters);
997 return ret;
998 }
999
1000 #ifdef CONFIG_COMPAT
1001 static void compat_standard_from_user(void *dst, const void *src)
1002 {
1003 int v = *(compat_int_t *)src;
1004
1005 if (v > 0)
1006 v += xt_compat_calc_jump(AF_INET, v);
1007 memcpy(dst, &v, sizeof(v));
1008 }
1009
1010 static int compat_standard_to_user(void __user *dst, const void *src)
1011 {
1012 compat_int_t cv = *(int *)src;
1013
1014 if (cv > 0)
1015 cv -= xt_compat_calc_jump(AF_INET, cv);
1016 return copy_to_user(dst, &cv, sizeof(cv)) ? -EFAULT : 0;
1017 }
1018
1019 static int compat_calc_entry(const struct ipt_entry *e,
1020 const struct xt_table_info *info,
1021 const void *base, struct xt_table_info *newinfo)
1022 {
1023 const struct xt_entry_match *ematch;
1024 const struct xt_entry_target *t;
1025 unsigned int entry_offset;
1026 int off, i, ret;
1027
1028 off = sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);
1029 entry_offset = (void *)e - base;
1030 xt_ematch_foreach(ematch, e)
1031 off += xt_compat_match_offset(ematch->u.kernel.match);
1032 t = ipt_get_target_c(e);
1033 off += xt_compat_target_offset(t->u.kernel.target);
1034 newinfo->size -= off;
1035 ret = xt_compat_add_offset(AF_INET, entry_offset, off);
1036 if (ret)
1037 return ret;
1038
1039 for (i = 0; i < NF_INET_NUMHOOKS; i++) {
1040 if (info->hook_entry[i] &&
1041 (e < (struct ipt_entry *)(base + info->hook_entry[i])))
1042 newinfo->hook_entry[i] -= off;
1043 if (info->underflow[i] &&
1044 (e < (struct ipt_entry *)(base + info->underflow[i])))
1045 newinfo->underflow[i] -= off;
1046 }
1047 return 0;
1048 }
1049
1050 static int compat_table_info(const struct xt_table_info *info,
1051 struct xt_table_info *newinfo)
1052 {
1053 struct ipt_entry *iter;
1054 void *loc_cpu_entry;
1055 int ret;
1056
1057 if (!newinfo || !info)
1058 return -EINVAL;
1059
1060 /* we dont care about newinfo->entries[] */
1061 memcpy(newinfo, info, offsetof(struct xt_table_info, entries));
1062 newinfo->initial_entries = 0;
1063 loc_cpu_entry = info->entries[raw_smp_processor_id()];
1064 xt_compat_init_offsets(AF_INET, info->number);
1065 xt_entry_foreach(iter, loc_cpu_entry, info->size) {
1066 ret = compat_calc_entry(iter, info, loc_cpu_entry, newinfo);
1067 if (ret != 0)
1068 return ret;
1069 }
1070 return 0;
1071 }
1072 #endif
1073
1074 static int get_info(struct net *net, void __user *user,
1075 const int *len, int compat)
1076 {
1077 char name[XT_TABLE_MAXNAMELEN];
1078 struct xt_table *t;
1079 int ret;
1080
1081 if (*len != sizeof(struct ipt_getinfo)) {
1082 duprintf("length %u != %zu\n", *len,
1083 sizeof(struct ipt_getinfo));
1084 return -EINVAL;
1085 }
1086
1087 if (copy_from_user(name, user, sizeof(name)) != 0)
1088 return -EFAULT;
1089
1090 name[XT_TABLE_MAXNAMELEN-1] = '\0';
1091 #ifdef CONFIG_COMPAT
1092 if (compat)
1093 xt_compat_lock(AF_INET);
1094 #endif
1095 t = try_then_request_module(xt_find_table_lock(net, AF_INET, name),
1096 "iptable_%s", name);
1097 if (!IS_ERR_OR_NULL(t)) {
1098 struct ipt_getinfo info;
1099 const struct xt_table_info *private = t->private;
1100 #ifdef CONFIG_COMPAT
1101 struct xt_table_info tmp;
1102
1103 if (compat) {
1104 ret = compat_table_info(private, &tmp);
1105 xt_compat_flush_offsets(AF_INET);
1106 private = &tmp;
1107 }
1108 #endif
1109 memset(&info, 0, sizeof(info));
1110 info.valid_hooks = t->valid_hooks;
1111 memcpy(info.hook_entry, private->hook_entry,
1112 sizeof(info.hook_entry));
1113 memcpy(info.underflow, private->underflow,
1114 sizeof(info.underflow));
1115 info.num_entries = private->number;
1116 info.size = private->size;
1117 strcpy(info.name, name);
1118
1119 if (copy_to_user(user, &info, *len) != 0)
1120 ret = -EFAULT;
1121 else
1122 ret = 0;
1123
1124 xt_table_unlock(t);
1125 module_put(t->me);
1126 } else
1127 ret = t ? PTR_ERR(t) : -ENOENT;
1128 #ifdef CONFIG_COMPAT
1129 if (compat)
1130 xt_compat_unlock(AF_INET);
1131 #endif
1132 return ret;
1133 }
1134
1135 static int
1136 get_entries(struct net *net, struct ipt_get_entries __user *uptr,
1137 const int *len)
1138 {
1139 int ret;
1140 struct ipt_get_entries get;
1141 struct xt_table *t;
1142
1143 if (*len < sizeof(get)) {
1144 duprintf("get_entries: %u < %zu\n", *len, sizeof(get));
1145 return -EINVAL;
1146 }
1147 if (copy_from_user(&get, uptr, sizeof(get)) != 0)
1148 return -EFAULT;
1149 if (*len != sizeof(struct ipt_get_entries) + get.size) {
1150 duprintf("get_entries: %u != %zu\n",
1151 *len, sizeof(get) + get.size);
1152 return -EINVAL;
1153 }
1154
1155 t = xt_find_table_lock(net, AF_INET, get.name);
1156 if (!IS_ERR_OR_NULL(t)) {
1157 const struct xt_table_info *private = t->private;
1158 duprintf("t->private->number = %u\n", private->number);
1159 if (get.size == private->size)
1160 ret = copy_entries_to_user(private->size,
1161 t, uptr->entrytable);
1162 else {
1163 duprintf("get_entries: I've got %u not %u!\n",
1164 private->size, get.size);
1165 ret = -EAGAIN;
1166 }
1167 module_put(t->me);
1168 xt_table_unlock(t);
1169 } else
1170 ret = t ? PTR_ERR(t) : -ENOENT;
1171
1172 return ret;
1173 }
1174
1175 static int
1176 __do_replace(struct net *net, const char *name, unsigned int valid_hooks,
1177 struct xt_table_info *newinfo, unsigned int num_counters,
1178 void __user *counters_ptr)
1179 {
1180 int ret;
1181 struct xt_table *t;
1182 struct xt_table_info *oldinfo;
1183 struct xt_counters *counters;
1184 void *loc_cpu_old_entry;
1185 struct ipt_entry *iter;
1186
1187 ret = 0;
1188 counters = vzalloc(num_counters * sizeof(struct xt_counters));
1189 if (!counters) {
1190 ret = -ENOMEM;
1191 goto out;
1192 }
1193
1194 t = try_then_request_module(xt_find_table_lock(net, AF_INET, name),
1195 "iptable_%s", name);
1196 if (IS_ERR_OR_NULL(t)) {
1197 ret = t ? PTR_ERR(t) : -ENOENT;
1198 goto free_newinfo_counters_untrans;
1199 }
1200
1201 /* You lied! */
1202 if (valid_hooks != t->valid_hooks) {
1203 duprintf("Valid hook crap: %08X vs %08X\n",
1204 valid_hooks, t->valid_hooks);
1205 ret = -EINVAL;
1206 goto put_module;
1207 }
1208
1209 oldinfo = xt_replace_table(t, num_counters, newinfo, &ret);
1210 if (!oldinfo)
1211 goto put_module;
1212
1213 /* Update module usage count based on number of rules */
1214 duprintf("do_replace: oldnum=%u, initnum=%u, newnum=%u\n",
1215 oldinfo->number, oldinfo->initial_entries, newinfo->number);
1216 if ((oldinfo->number > oldinfo->initial_entries) ||
1217 (newinfo->number <= oldinfo->initial_entries))
1218 module_put(t->me);
1219 if ((oldinfo->number > oldinfo->initial_entries) &&
1220 (newinfo->number <= oldinfo->initial_entries))
1221 module_put(t->me);
1222
1223 /* Get the old counters, and synchronize with replace */
1224 get_counters(oldinfo, counters);
1225
1226 /* Decrease module usage counts and free resource */
1227 loc_cpu_old_entry = oldinfo->entries[raw_smp_processor_id()];
1228 xt_entry_foreach(iter, loc_cpu_old_entry, oldinfo->size)
1229 cleanup_entry(iter, net);
1230
1231 xt_free_table_info(oldinfo);
1232 if (copy_to_user(counters_ptr, counters,
1233 sizeof(struct xt_counters) * num_counters) != 0) {
1234 /* Silent error, can't fail, new table is already in place */
1235 net_warn_ratelimited("iptables: counters copy to user failed while replacing table\n");
1236 }
1237 vfree(counters);
1238 xt_table_unlock(t);
1239 return ret;
1240
1241 put_module:
1242 module_put(t->me);
1243 xt_table_unlock(t);
1244 free_newinfo_counters_untrans:
1245 vfree(counters);
1246 out:
1247 return ret;
1248 }
1249
1250 static int
1251 do_replace(struct net *net, const void __user *user, unsigned int len)
1252 {
1253 int ret;
1254 struct ipt_replace tmp;
1255 struct xt_table_info *newinfo;
1256 void *loc_cpu_entry;
1257 struct ipt_entry *iter;
1258
1259 if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
1260 return -EFAULT;
1261
1262 /* overflow check */
1263 if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))
1264 return -ENOMEM;
1265 tmp.name[sizeof(tmp.name)-1] = 0;
1266
1267 newinfo = xt_alloc_table_info(tmp.size);
1268 if (!newinfo)
1269 return -ENOMEM;
1270
1271 /* choose the copy that is on our node/cpu */
1272 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
1273 if (copy_from_user(loc_cpu_entry, user + sizeof(tmp),
1274 tmp.size) != 0) {
1275 ret = -EFAULT;
1276 goto free_newinfo;
1277 }
1278
1279 ret = translate_table(net, newinfo, loc_cpu_entry, &tmp);
1280 if (ret != 0)
1281 goto free_newinfo;
1282
1283 duprintf("Translated table\n");
1284
1285 ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,
1286 tmp.num_counters, tmp.counters);
1287 if (ret)
1288 goto free_newinfo_untrans;
1289 return 0;
1290
1291 free_newinfo_untrans:
1292 xt_entry_foreach(iter, loc_cpu_entry, newinfo->size)
1293 cleanup_entry(iter, net);
1294 free_newinfo:
1295 xt_free_table_info(newinfo);
1296 return ret;
1297 }
1298
1299 static int
1300 do_add_counters(struct net *net, const void __user *user,
1301 unsigned int len, int compat)
1302 {
1303 unsigned int i, curcpu;
1304 struct xt_counters_info tmp;
1305 struct xt_counters *paddc;
1306 unsigned int num_counters;
1307 const char *name;
1308 int size;
1309 void *ptmp;
1310 struct xt_table *t;
1311 const struct xt_table_info *private;
1312 int ret = 0;
1313 void *loc_cpu_entry;
1314 struct ipt_entry *iter;
1315 unsigned int addend;
1316 #ifdef CONFIG_COMPAT
1317 struct compat_xt_counters_info compat_tmp;
1318
1319 if (compat) {
1320 ptmp = &compat_tmp;
1321 size = sizeof(struct compat_xt_counters_info);
1322 } else
1323 #endif
1324 {
1325 ptmp = &tmp;
1326 size = sizeof(struct xt_counters_info);
1327 }
1328
1329 if (copy_from_user(ptmp, user, size) != 0)
1330 return -EFAULT;
1331
1332 #ifdef CONFIG_COMPAT
1333 if (compat) {
1334 num_counters = compat_tmp.num_counters;
1335 name = compat_tmp.name;
1336 } else
1337 #endif
1338 {
1339 num_counters = tmp.num_counters;
1340 name = tmp.name;
1341 }
1342
1343 if (len != size + num_counters * sizeof(struct xt_counters))
1344 return -EINVAL;
1345
1346 paddc = vmalloc(len - size);
1347 if (!paddc)
1348 return -ENOMEM;
1349
1350 if (copy_from_user(paddc, user + size, len - size) != 0) {
1351 ret = -EFAULT;
1352 goto free;
1353 }
1354
1355 t = xt_find_table_lock(net, AF_INET, name);
1356 if (IS_ERR_OR_NULL(t)) {
1357 ret = t ? PTR_ERR(t) : -ENOENT;
1358 goto free;
1359 }
1360
1361 local_bh_disable();
1362 private = t->private;
1363 if (private->number != num_counters) {
1364 ret = -EINVAL;
1365 goto unlock_up_free;
1366 }
1367
1368 i = 0;
1369 /* Choose the copy that is on our node */
1370 curcpu = smp_processor_id();
1371 loc_cpu_entry = private->entries[curcpu];
1372 addend = xt_write_recseq_begin();
1373 xt_entry_foreach(iter, loc_cpu_entry, private->size) {
1374 ADD_COUNTER(iter->counters, paddc[i].bcnt, paddc[i].pcnt);
1375 ++i;
1376 }
1377 xt_write_recseq_end(addend);
1378 unlock_up_free:
1379 local_bh_enable();
1380 xt_table_unlock(t);
1381 module_put(t->me);
1382 free:
1383 vfree(paddc);
1384
1385 return ret;
1386 }
1387
1388 #ifdef CONFIG_COMPAT
1389 struct compat_ipt_replace {
1390 char name[XT_TABLE_MAXNAMELEN];
1391 u32 valid_hooks;
1392 u32 num_entries;
1393 u32 size;
1394 u32 hook_entry[NF_INET_NUMHOOKS];
1395 u32 underflow[NF_INET_NUMHOOKS];
1396 u32 num_counters;
1397 compat_uptr_t counters; /* struct xt_counters * */
1398 struct compat_ipt_entry entries[0];
1399 };
1400
1401 static int
1402 compat_copy_entry_to_user(struct ipt_entry *e, void __user **dstptr,
1403 unsigned int *size, struct xt_counters *counters,
1404 unsigned int i)
1405 {
1406 struct xt_entry_target *t;
1407 struct compat_ipt_entry __user *ce;
1408 u_int16_t target_offset, next_offset;
1409 compat_uint_t origsize;
1410 const struct xt_entry_match *ematch;
1411 int ret = 0;
1412
1413 origsize = *size;
1414 ce = (struct compat_ipt_entry __user *)*dstptr;
1415 if (copy_to_user(ce, e, sizeof(struct ipt_entry)) != 0 ||
1416 copy_to_user(&ce->counters, &counters[i],
1417 sizeof(counters[i])) != 0)
1418 return -EFAULT;
1419
1420 *dstptr += sizeof(struct compat_ipt_entry);
1421 *size -= sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);
1422
1423 xt_ematch_foreach(ematch, e) {
1424 ret = xt_compat_match_to_user(ematch, dstptr, size);
1425 if (ret != 0)
1426 return ret;
1427 }
1428 target_offset = e->target_offset - (origsize - *size);
1429 t = ipt_get_target(e);
1430 ret = xt_compat_target_to_user(t, dstptr, size);
1431 if (ret)
1432 return ret;
1433 next_offset = e->next_offset - (origsize - *size);
1434 if (put_user(target_offset, &ce->target_offset) != 0 ||
1435 put_user(next_offset, &ce->next_offset) != 0)
1436 return -EFAULT;
1437 return 0;
1438 }
1439
1440 static int
1441 compat_find_calc_match(struct xt_entry_match *m,
1442 const char *name,
1443 const struct ipt_ip *ip,
1444 unsigned int hookmask,
1445 int *size)
1446 {
1447 struct xt_match *match;
1448
1449 match = xt_request_find_match(NFPROTO_IPV4, m->u.user.name,
1450 m->u.user.revision);
1451 if (IS_ERR(match)) {
1452 duprintf("compat_check_calc_match: `%s' not found\n",
1453 m->u.user.name);
1454 return PTR_ERR(match);
1455 }
1456 m->u.kernel.match = match;
1457 *size += xt_compat_match_offset(match);
1458 return 0;
1459 }
1460
1461 static void compat_release_entry(struct compat_ipt_entry *e)
1462 {
1463 struct xt_entry_target *t;
1464 struct xt_entry_match *ematch;
1465
1466 /* Cleanup all matches */
1467 xt_ematch_foreach(ematch, e)
1468 module_put(ematch->u.kernel.match->me);
1469 t = compat_ipt_get_target(e);
1470 module_put(t->u.kernel.target->me);
1471 }
1472
1473 static int
1474 check_compat_entry_size_and_hooks(struct compat_ipt_entry *e,
1475 struct xt_table_info *newinfo,
1476 unsigned int *size,
1477 const unsigned char *base,
1478 const unsigned char *limit,
1479 const unsigned int *hook_entries,
1480 const unsigned int *underflows,
1481 const char *name)
1482 {
1483 struct xt_entry_match *ematch;
1484 struct xt_entry_target *t;
1485 struct xt_target *target;
1486 unsigned int entry_offset;
1487 unsigned int j;
1488 int ret, off, h;
1489
1490 duprintf("check_compat_entry_size_and_hooks %p\n", e);
1491 if ((unsigned long)e % __alignof__(struct compat_ipt_entry) != 0 ||
1492 (unsigned char *)e + sizeof(struct compat_ipt_entry) >= limit) {
1493 duprintf("Bad offset %p, limit = %p\n", e, limit);
1494 return -EINVAL;
1495 }
1496
1497 if (e->next_offset < sizeof(struct compat_ipt_entry) +
1498 sizeof(struct compat_xt_entry_target)) {
1499 duprintf("checking: element %p size %u\n",
1500 e, e->next_offset);
1501 return -EINVAL;
1502 }
1503
1504 /* For purposes of check_entry casting the compat entry is fine */
1505 ret = check_entry((struct ipt_entry *)e, name);
1506 if (ret)
1507 return ret;
1508
1509 off = sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);
1510 entry_offset = (void *)e - (void *)base;
1511 j = 0;
1512 xt_ematch_foreach(ematch, e) {
1513 ret = compat_find_calc_match(ematch, name,
1514 &e->ip, e->comefrom, &off);
1515 if (ret != 0)
1516 goto release_matches;
1517 ++j;
1518 }
1519
1520 t = compat_ipt_get_target(e);
1521 target = xt_request_find_target(NFPROTO_IPV4, t->u.user.name,
1522 t->u.user.revision);
1523 if (IS_ERR(target)) {
1524 duprintf("check_compat_entry_size_and_hooks: `%s' not found\n",
1525 t->u.user.name);
1526 ret = PTR_ERR(target);
1527 goto release_matches;
1528 }
1529 t->u.kernel.target = target;
1530
1531 off += xt_compat_target_offset(target);
1532 *size += off;
1533 ret = xt_compat_add_offset(AF_INET, entry_offset, off);
1534 if (ret)
1535 goto out;
1536
1537 /* Check hooks & underflows */
1538 for (h = 0; h < NF_INET_NUMHOOKS; h++) {
1539 if ((unsigned char *)e - base == hook_entries[h])
1540 newinfo->hook_entry[h] = hook_entries[h];
1541 if ((unsigned char *)e - base == underflows[h])
1542 newinfo->underflow[h] = underflows[h];
1543 }
1544
1545 /* Clear counters and comefrom */
1546 memset(&e->counters, 0, sizeof(e->counters));
1547 e->comefrom = 0;
1548 return 0;
1549
1550 out:
1551 module_put(t->u.kernel.target->me);
1552 release_matches:
1553 xt_ematch_foreach(ematch, e) {
1554 if (j-- == 0)
1555 break;
1556 module_put(ematch->u.kernel.match->me);
1557 }
1558 return ret;
1559 }
1560
1561 static int
1562 compat_copy_entry_from_user(struct compat_ipt_entry *e, void **dstptr,
1563 unsigned int *size, const char *name,
1564 struct xt_table_info *newinfo, unsigned char *base)
1565 {
1566 struct xt_entry_target *t;
1567 struct xt_target *target;
1568 struct ipt_entry *de;
1569 unsigned int origsize;
1570 int ret, h;
1571 struct xt_entry_match *ematch;
1572
1573 ret = 0;
1574 origsize = *size;
1575 de = (struct ipt_entry *)*dstptr;
1576 memcpy(de, e, sizeof(struct ipt_entry));
1577 memcpy(&de->counters, &e->counters, sizeof(e->counters));
1578
1579 *dstptr += sizeof(struct ipt_entry);
1580 *size += sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);
1581
1582 xt_ematch_foreach(ematch, e) {
1583 ret = xt_compat_match_from_user(ematch, dstptr, size);
1584 if (ret != 0)
1585 return ret;
1586 }
1587 de->target_offset = e->target_offset - (origsize - *size);
1588 t = compat_ipt_get_target(e);
1589 target = t->u.kernel.target;
1590 xt_compat_target_from_user(t, dstptr, size);
1591
1592 de->next_offset = e->next_offset - (origsize - *size);
1593 for (h = 0; h < NF_INET_NUMHOOKS; h++) {
1594 if ((unsigned char *)de - base < newinfo->hook_entry[h])
1595 newinfo->hook_entry[h] -= origsize - *size;
1596 if ((unsigned char *)de - base < newinfo->underflow[h])
1597 newinfo->underflow[h] -= origsize - *size;
1598 }
1599 return ret;
1600 }
1601
1602 static int
1603 compat_check_entry(struct ipt_entry *e, struct net *net, const char *name)
1604 {
1605 struct xt_entry_match *ematch;
1606 struct xt_mtchk_param mtpar;
1607 unsigned int j;
1608 int ret = 0;
1609
1610 j = 0;
1611 mtpar.net = net;
1612 mtpar.table = name;
1613 mtpar.entryinfo = &e->ip;
1614 mtpar.hook_mask = e->comefrom;
1615 mtpar.family = NFPROTO_IPV4;
1616 xt_ematch_foreach(ematch, e) {
1617 ret = check_match(ematch, &mtpar);
1618 if (ret != 0)
1619 goto cleanup_matches;
1620 ++j;
1621 }
1622
1623 ret = check_target(e, net, name);
1624 if (ret)
1625 goto cleanup_matches;
1626 return 0;
1627
1628 cleanup_matches:
1629 xt_ematch_foreach(ematch, e) {
1630 if (j-- == 0)
1631 break;
1632 cleanup_match(ematch, net);
1633 }
1634 return ret;
1635 }
1636
1637 static int
1638 translate_compat_table(struct net *net,
1639 const char *name,
1640 unsigned int valid_hooks,
1641 struct xt_table_info **pinfo,
1642 void **pentry0,
1643 unsigned int total_size,
1644 unsigned int number,
1645 unsigned int *hook_entries,
1646 unsigned int *underflows)
1647 {
1648 unsigned int i, j;
1649 struct xt_table_info *newinfo, *info;
1650 void *pos, *entry0, *entry1;
1651 struct compat_ipt_entry *iter0;
1652 struct ipt_entry *iter1;
1653 unsigned int size;
1654 int ret;
1655
1656 info = *pinfo;
1657 entry0 = *pentry0;
1658 size = total_size;
1659 info->number = number;
1660
1661 /* Init all hooks to impossible value. */
1662 for (i = 0; i < NF_INET_NUMHOOKS; i++) {
1663 info->hook_entry[i] = 0xFFFFFFFF;
1664 info->underflow[i] = 0xFFFFFFFF;
1665 }
1666
1667 duprintf("translate_compat_table: size %u\n", info->size);
1668 j = 0;
1669 xt_compat_lock(AF_INET);
1670 xt_compat_init_offsets(AF_INET, number);
1671 /* Walk through entries, checking offsets. */
1672 xt_entry_foreach(iter0, entry0, total_size) {
1673 ret = check_compat_entry_size_and_hooks(iter0, info, &size,
1674 entry0,
1675 entry0 + total_size,
1676 hook_entries,
1677 underflows,
1678 name);
1679 if (ret != 0)
1680 goto out_unlock;
1681 ++j;
1682 }
1683
1684 ret = -EINVAL;
1685 if (j != number) {
1686 duprintf("translate_compat_table: %u not %u entries\n",
1687 j, number);
1688 goto out_unlock;
1689 }
1690
1691 /* Check hooks all assigned */
1692 for (i = 0; i < NF_INET_NUMHOOKS; i++) {
1693 /* Only hooks which are valid */
1694 if (!(valid_hooks & (1 << i)))
1695 continue;
1696 if (info->hook_entry[i] == 0xFFFFFFFF) {
1697 duprintf("Invalid hook entry %u %u\n",
1698 i, hook_entries[i]);
1699 goto out_unlock;
1700 }
1701 if (info->underflow[i] == 0xFFFFFFFF) {
1702 duprintf("Invalid underflow %u %u\n",
1703 i, underflows[i]);
1704 goto out_unlock;
1705 }
1706 }
1707
1708 ret = -ENOMEM;
1709 newinfo = xt_alloc_table_info(size);
1710 if (!newinfo)
1711 goto out_unlock;
1712
1713 newinfo->number = number;
1714 for (i = 0; i < NF_INET_NUMHOOKS; i++) {
1715 newinfo->hook_entry[i] = info->hook_entry[i];
1716 newinfo->underflow[i] = info->underflow[i];
1717 }
1718 entry1 = newinfo->entries[raw_smp_processor_id()];
1719 pos = entry1;
1720 size = total_size;
1721 xt_entry_foreach(iter0, entry0, total_size) {
1722 ret = compat_copy_entry_from_user(iter0, &pos, &size,
1723 name, newinfo, entry1);
1724 if (ret != 0)
1725 break;
1726 }
1727 xt_compat_flush_offsets(AF_INET);
1728 xt_compat_unlock(AF_INET);
1729 if (ret)
1730 goto free_newinfo;
1731
1732 ret = -ELOOP;
1733 if (!mark_source_chains(newinfo, valid_hooks, entry1))
1734 goto free_newinfo;
1735
1736 i = 0;
1737 xt_entry_foreach(iter1, entry1, newinfo->size) {
1738 ret = compat_check_entry(iter1, net, name);
1739 if (ret != 0)
1740 break;
1741 ++i;
1742 if (strcmp(ipt_get_target(iter1)->u.user.name,
1743 XT_ERROR_TARGET) == 0)
1744 ++newinfo->stacksize;
1745 }
1746 if (ret) {
1747 /*
1748 * The first i matches need cleanup_entry (calls ->destroy)
1749 * because they had called ->check already. The other j-i
1750 * entries need only release.
1751 */
1752 int skip = i;
1753 j -= i;
1754 xt_entry_foreach(iter0, entry0, newinfo->size) {
1755 if (skip-- > 0)
1756 continue;
1757 if (j-- == 0)
1758 break;
1759 compat_release_entry(iter0);
1760 }
1761 xt_entry_foreach(iter1, entry1, newinfo->size) {
1762 if (i-- == 0)
1763 break;
1764 cleanup_entry(iter1, net);
1765 }
1766 xt_free_table_info(newinfo);
1767 return ret;
1768 }
1769
1770 /* And one copy for every other CPU */
1771 for_each_possible_cpu(i)
1772 if (newinfo->entries[i] && newinfo->entries[i] != entry1)
1773 memcpy(newinfo->entries[i], entry1, newinfo->size);
1774
1775 *pinfo = newinfo;
1776 *pentry0 = entry1;
1777 xt_free_table_info(info);
1778 return 0;
1779
1780 free_newinfo:
1781 xt_free_table_info(newinfo);
1782 out:
1783 xt_entry_foreach(iter0, entry0, total_size) {
1784 if (j-- == 0)
1785 break;
1786 compat_release_entry(iter0);
1787 }
1788 return ret;
1789 out_unlock:
1790 xt_compat_flush_offsets(AF_INET);
1791 xt_compat_unlock(AF_INET);
1792 goto out;
1793 }
1794
1795 static int
1796 compat_do_replace(struct net *net, void __user *user, unsigned int len)
1797 {
1798 int ret;
1799 struct compat_ipt_replace tmp;
1800 struct xt_table_info *newinfo;
1801 void *loc_cpu_entry;
1802 struct ipt_entry *iter;
1803
1804 if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
1805 return -EFAULT;
1806
1807 /* overflow check */
1808 if (tmp.size >= INT_MAX / num_possible_cpus())
1809 return -ENOMEM;
1810 if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))
1811 return -ENOMEM;
1812 tmp.name[sizeof(tmp.name)-1] = 0;
1813
1814 newinfo = xt_alloc_table_info(tmp.size);
1815 if (!newinfo)
1816 return -ENOMEM;
1817
1818 /* choose the copy that is on our node/cpu */
1819 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
1820 if (copy_from_user(loc_cpu_entry, user + sizeof(tmp),
1821 tmp.size) != 0) {
1822 ret = -EFAULT;
1823 goto free_newinfo;
1824 }
1825
1826 ret = translate_compat_table(net, tmp.name, tmp.valid_hooks,
1827 &newinfo, &loc_cpu_entry, tmp.size,
1828 tmp.num_entries, tmp.hook_entry,
1829 tmp.underflow);
1830 if (ret != 0)
1831 goto free_newinfo;
1832
1833 duprintf("compat_do_replace: Translated table\n");
1834
1835 ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,
1836 tmp.num_counters, compat_ptr(tmp.counters));
1837 if (ret)
1838 goto free_newinfo_untrans;
1839 return 0;
1840
1841 free_newinfo_untrans:
1842 xt_entry_foreach(iter, loc_cpu_entry, newinfo->size)
1843 cleanup_entry(iter, net);
1844 free_newinfo:
1845 xt_free_table_info(newinfo);
1846 return ret;
1847 }
1848
1849 static int
1850 compat_do_ipt_set_ctl(struct sock *sk, int cmd, void __user *user,
1851 unsigned int len)
1852 {
1853 int ret;
1854
1855 if (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))
1856 return -EPERM;
1857
1858 switch (cmd) {
1859 case IPT_SO_SET_REPLACE:
1860 ret = compat_do_replace(sock_net(sk), user, len);
1861 break;
1862
1863 case IPT_SO_SET_ADD_COUNTERS:
1864 ret = do_add_counters(sock_net(sk), user, len, 1);
1865 break;
1866
1867 default:
1868 duprintf("do_ipt_set_ctl: unknown request %i\n", cmd);
1869 ret = -EINVAL;
1870 }
1871
1872 return ret;
1873 }
1874
1875 struct compat_ipt_get_entries {
1876 char name[XT_TABLE_MAXNAMELEN];
1877 compat_uint_t size;
1878 struct compat_ipt_entry entrytable[0];
1879 };
1880
1881 static int
1882 compat_copy_entries_to_user(unsigned int total_size, struct xt_table *table,
1883 void __user *userptr)
1884 {
1885 struct xt_counters *counters;
1886 const struct xt_table_info *private = table->private;
1887 void __user *pos;
1888 unsigned int size;
1889 int ret = 0;
1890 const void *loc_cpu_entry;
1891 unsigned int i = 0;
1892 struct ipt_entry *iter;
1893
1894 counters = alloc_counters(table);
1895 if (IS_ERR(counters))
1896 return PTR_ERR(counters);
1897
1898 /* choose the copy that is on our node/cpu, ...
1899 * This choice is lazy (because current thread is
1900 * allowed to migrate to another cpu)
1901 */
1902 loc_cpu_entry = private->entries[raw_smp_processor_id()];
1903 pos = userptr;
1904 size = total_size;
1905 xt_entry_foreach(iter, loc_cpu_entry, total_size) {
1906 ret = compat_copy_entry_to_user(iter, &pos,
1907 &size, counters, i++);
1908 if (ret != 0)
1909 break;
1910 }
1911
1912 vfree(counters);
1913 return ret;
1914 }
1915
1916 static int
1917 compat_get_entries(struct net *net, struct compat_ipt_get_entries __user *uptr,
1918 int *len)
1919 {
1920 int ret;
1921 struct compat_ipt_get_entries get;
1922 struct xt_table *t;
1923
1924 if (*len < sizeof(get)) {
1925 duprintf("compat_get_entries: %u < %zu\n", *len, sizeof(get));
1926 return -EINVAL;
1927 }
1928
1929 if (copy_from_user(&get, uptr, sizeof(get)) != 0)
1930 return -EFAULT;
1931
1932 if (*len != sizeof(struct compat_ipt_get_entries) + get.size) {
1933 duprintf("compat_get_entries: %u != %zu\n",
1934 *len, sizeof(get) + get.size);
1935 return -EINVAL;
1936 }
1937
1938 xt_compat_lock(AF_INET);
1939 t = xt_find_table_lock(net, AF_INET, get.name);
1940 if (!IS_ERR_OR_NULL(t)) {
1941 const struct xt_table_info *private = t->private;
1942 struct xt_table_info info;
1943 duprintf("t->private->number = %u\n", private->number);
1944 ret = compat_table_info(private, &info);
1945 if (!ret && get.size == info.size) {
1946 ret = compat_copy_entries_to_user(private->size,
1947 t, uptr->entrytable);
1948 } else if (!ret) {
1949 duprintf("compat_get_entries: I've got %u not %u!\n",
1950 private->size, get.size);
1951 ret = -EAGAIN;
1952 }
1953 xt_compat_flush_offsets(AF_INET);
1954 module_put(t->me);
1955 xt_table_unlock(t);
1956 } else
1957 ret = t ? PTR_ERR(t) : -ENOENT;
1958
1959 xt_compat_unlock(AF_INET);
1960 return ret;
1961 }
1962
1963 static int do_ipt_get_ctl(struct sock *, int, void __user *, int *);
1964
1965 static int
1966 compat_do_ipt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len)
1967 {
1968 int ret;
1969
1970 if (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))
1971 return -EPERM;
1972
1973 switch (cmd) {
1974 case IPT_SO_GET_INFO:
1975 ret = get_info(sock_net(sk), user, len, 1);
1976 break;
1977 case IPT_SO_GET_ENTRIES:
1978 ret = compat_get_entries(sock_net(sk), user, len);
1979 break;
1980 default:
1981 ret = do_ipt_get_ctl(sk, cmd, user, len);
1982 }
1983 return ret;
1984 }
1985 #endif
1986
1987 static int
1988 do_ipt_set_ctl(struct sock *sk, int cmd, void __user *user, unsigned int len)
1989 {
1990 int ret;
1991
1992 if (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))
1993 return -EPERM;
1994
1995 switch (cmd) {
1996 case IPT_SO_SET_REPLACE:
1997 ret = do_replace(sock_net(sk), user, len);
1998 break;
1999
2000 case IPT_SO_SET_ADD_COUNTERS:
2001 ret = do_add_counters(sock_net(sk), user, len, 0);
2002 break;
2003
2004 default:
2005 duprintf("do_ipt_set_ctl: unknown request %i\n", cmd);
2006 ret = -EINVAL;
2007 }
2008
2009 return ret;
2010 }
2011
2012 static int
2013 do_ipt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len)
2014 {
2015 int ret;
2016
2017 if (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))
2018 return -EPERM;
2019
2020 switch (cmd) {
2021 case IPT_SO_GET_INFO:
2022 ret = get_info(sock_net(sk), user, len, 0);
2023 break;
2024
2025 case IPT_SO_GET_ENTRIES:
2026 ret = get_entries(sock_net(sk), user, len);
2027 break;
2028
2029 case IPT_SO_GET_REVISION_MATCH:
2030 case IPT_SO_GET_REVISION_TARGET: {
2031 struct xt_get_revision rev;
2032 int target;
2033
2034 if (*len != sizeof(rev)) {
2035 ret = -EINVAL;
2036 break;
2037 }
2038 if (copy_from_user(&rev, user, sizeof(rev)) != 0) {
2039 ret = -EFAULT;
2040 break;
2041 }
2042 rev.name[sizeof(rev.name)-1] = 0;
2043
2044 if (cmd == IPT_SO_GET_REVISION_TARGET)
2045 target = 1;
2046 else
2047 target = 0;
2048
2049 try_then_request_module(xt_find_revision(AF_INET, rev.name,
2050 rev.revision,
2051 target, &ret),
2052 "ipt_%s", rev.name);
2053 break;
2054 }
2055
2056 default:
2057 duprintf("do_ipt_get_ctl: unknown request %i\n", cmd);
2058 ret = -EINVAL;
2059 }
2060
2061 return ret;
2062 }
2063
2064 struct xt_table *ipt_register_table(struct net *net,
2065 const struct xt_table *table,
2066 const struct ipt_replace *repl)
2067 {
2068 int ret;
2069 struct xt_table_info *newinfo;
2070 struct xt_table_info bootstrap = {0};
2071 void *loc_cpu_entry;
2072 struct xt_table *new_table;
2073
2074 newinfo = xt_alloc_table_info(repl->size);
2075 if (!newinfo) {
2076 ret = -ENOMEM;
2077 goto out;
2078 }
2079
2080 /* choose the copy on our node/cpu, but dont care about preemption */
2081 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
2082 memcpy(loc_cpu_entry, repl->entries, repl->size);
2083
2084 ret = translate_table(net, newinfo, loc_cpu_entry, repl);
2085 if (ret != 0)
2086 goto out_free;
2087
2088 new_table = xt_register_table(net, table, &bootstrap, newinfo);
2089 if (IS_ERR(new_table)) {
2090 ret = PTR_ERR(new_table);
2091 goto out_free;
2092 }
2093
2094 return new_table;
2095
2096 out_free:
2097 xt_free_table_info(newinfo);
2098 out:
2099 return ERR_PTR(ret);
2100 }
2101
2102 void ipt_unregister_table(struct net *net, struct xt_table *table)
2103 {
2104 struct xt_table_info *private;
2105 void *loc_cpu_entry;
2106 struct module *table_owner = table->me;
2107 struct ipt_entry *iter;
2108
2109 private = xt_unregister_table(table);
2110
2111 /* Decrease module usage counts and free resources */
2112 loc_cpu_entry = private->entries[raw_smp_processor_id()];
2113 xt_entry_foreach(iter, loc_cpu_entry, private->size)
2114 cleanup_entry(iter, net);
2115 if (private->number > private->initial_entries)
2116 module_put(table_owner);
2117 xt_free_table_info(private);
2118 }
2119
2120 /* Returns 1 if the type and code is matched by the range, 0 otherwise */
2121 static inline bool
2122 icmp_type_code_match(u_int8_t test_type, u_int8_t min_code, u_int8_t max_code,
2123 u_int8_t type, u_int8_t code,
2124 bool invert)
2125 {
2126 return ((test_type == 0xFF) ||
2127 (type == test_type && code >= min_code && code <= max_code))
2128 ^ invert;
2129 }
2130
2131 static bool
2132 icmp_match(const struct sk_buff *skb, struct xt_action_param *par)
2133 {
2134 const struct icmphdr *ic;
2135 struct icmphdr _icmph;
2136 const struct ipt_icmp *icmpinfo = par->matchinfo;
2137
2138 /* Must not be a fragment. */
2139 if (par->fragoff != 0)
2140 return false;
2141
2142 ic = skb_header_pointer(skb, par->thoff, sizeof(_icmph), &_icmph);
2143 if (ic == NULL) {
2144 /* We've been asked to examine this packet, and we
2145 * can't. Hence, no choice but to drop.
2146 */
2147 duprintf("Dropping evil ICMP tinygram.\n");
2148 par->hotdrop = true;
2149 return false;
2150 }
2151
2152 return icmp_type_code_match(icmpinfo->type,
2153 icmpinfo->code[0],
2154 icmpinfo->code[1],
2155 ic->type, ic->code,
2156 !!(icmpinfo->invflags&IPT_ICMP_INV));
2157 }
2158
2159 static int icmp_checkentry(const struct xt_mtchk_param *par)
2160 {
2161 const struct ipt_icmp *icmpinfo = par->matchinfo;
2162
2163 /* Must specify no unknown invflags */
2164 return (icmpinfo->invflags & ~IPT_ICMP_INV) ? -EINVAL : 0;
2165 }
2166
2167 static struct xt_target ipt_builtin_tg[] __read_mostly = {
2168 {
2169 .name = XT_STANDARD_TARGET,
2170 .targetsize = sizeof(int),
2171 .family = NFPROTO_IPV4,
2172 #ifdef CONFIG_COMPAT
2173 .compatsize = sizeof(compat_int_t),
2174 .compat_from_user = compat_standard_from_user,
2175 .compat_to_user = compat_standard_to_user,
2176 #endif
2177 },
2178 {
2179 .name = XT_ERROR_TARGET,
2180 .target = ipt_error,
2181 .targetsize = XT_FUNCTION_MAXNAMELEN,
2182 .family = NFPROTO_IPV4,
2183 },
2184 };
2185
2186 static struct nf_sockopt_ops ipt_sockopts = {
2187 .pf = PF_INET,
2188 .set_optmin = IPT_BASE_CTL,
2189 .set_optmax = IPT_SO_SET_MAX+1,
2190 .set = do_ipt_set_ctl,
2191 #ifdef CONFIG_COMPAT
2192 .compat_set = compat_do_ipt_set_ctl,
2193 #endif
2194 .get_optmin = IPT_BASE_CTL,
2195 .get_optmax = IPT_SO_GET_MAX+1,
2196 .get = do_ipt_get_ctl,
2197 #ifdef CONFIG_COMPAT
2198 .compat_get = compat_do_ipt_get_ctl,
2199 #endif
2200 .owner = THIS_MODULE,
2201 };
2202
2203 static struct xt_match ipt_builtin_mt[] __read_mostly = {
2204 {
2205 .name = "icmp",
2206 .match = icmp_match,
2207 .matchsize = sizeof(struct ipt_icmp),
2208 .checkentry = icmp_checkentry,
2209 .proto = IPPROTO_ICMP,
2210 .family = NFPROTO_IPV4,
2211 },
2212 };
2213
2214 static int __net_init ip_tables_net_init(struct net *net)
2215 {
2216 return xt_proto_init(net, NFPROTO_IPV4);
2217 }
2218
2219 static void __net_exit ip_tables_net_exit(struct net *net)
2220 {
2221 xt_proto_fini(net, NFPROTO_IPV4);
2222 }
2223
2224 static struct pernet_operations ip_tables_net_ops = {
2225 .init = ip_tables_net_init,
2226 .exit = ip_tables_net_exit,
2227 };
2228
2229 static int __init ip_tables_init(void)
2230 {
2231 int ret;
2232
2233 ret = register_pernet_subsys(&ip_tables_net_ops);
2234 if (ret < 0)
2235 goto err1;
2236
2237 /* No one else will be downing sem now, so we won't sleep */
2238 ret = xt_register_targets(ipt_builtin_tg, ARRAY_SIZE(ipt_builtin_tg));
2239 if (ret < 0)
2240 goto err2;
2241 ret = xt_register_matches(ipt_builtin_mt, ARRAY_SIZE(ipt_builtin_mt));
2242 if (ret < 0)
2243 goto err4;
2244
2245 /* Register setsockopt */
2246 ret = nf_register_sockopt(&ipt_sockopts);
2247 if (ret < 0)
2248 goto err5;
2249
2250 pr_info("(C) 2000-2006 Netfilter Core Team\n");
2251 return 0;
2252
2253 err5:
2254 xt_unregister_matches(ipt_builtin_mt, ARRAY_SIZE(ipt_builtin_mt));
2255 err4:
2256 xt_unregister_targets(ipt_builtin_tg, ARRAY_SIZE(ipt_builtin_tg));
2257 err2:
2258 unregister_pernet_subsys(&ip_tables_net_ops);
2259 err1:
2260 return ret;
2261 }
2262
2263 static void __exit ip_tables_fini(void)
2264 {
2265 nf_unregister_sockopt(&ipt_sockopts);
2266
2267 xt_unregister_matches(ipt_builtin_mt, ARRAY_SIZE(ipt_builtin_mt));
2268 xt_unregister_targets(ipt_builtin_tg, ARRAY_SIZE(ipt_builtin_tg));
2269 unregister_pernet_subsys(&ip_tables_net_ops);
2270 }
2271
2272 EXPORT_SYMBOL(ipt_register_table);
2273 EXPORT_SYMBOL(ipt_unregister_table);
2274 EXPORT_SYMBOL(ipt_do_table);
2275 module_init(ip_tables_init);
2276 module_exit(ip_tables_fini);
This page took 0.087641 seconds and 6 git commands to generate.