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