netfilter: x_tables: don't move to non-existent next rule
[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 if (pos + size >= newinfo->size)
515 return 0;
516 e->counters.pcnt = pos;
517 pos += size;
518 } else {
519 int newpos = t->verdict;
520
521 if (strcmp(t->target.u.user.name,
522 XT_STANDARD_TARGET) == 0 &&
523 newpos >= 0) {
524 if (newpos > newinfo->size -
525 sizeof(struct ipt_entry)) {
526 duprintf("mark_source_chains: "
527 "bad verdict (%i)\n",
528 newpos);
529 return 0;
530 }
531 /* This a jump; chase it. */
532 duprintf("Jump rule %u -> %u\n",
533 pos, newpos);
534 } else {
535 /* ... this is a fallthru */
536 newpos = pos + e->next_offset;
537 if (newpos >= newinfo->size)
538 return 0;
539 }
540 e = (struct ipt_entry *)
541 (entry0 + newpos);
542 e->counters.pcnt = pos;
543 pos = newpos;
544 }
545 }
546 next:
547 duprintf("Finished chain %u\n", hook);
548 }
549 return 1;
550 }
551
552 static void cleanup_match(struct xt_entry_match *m, struct net *net)
553 {
554 struct xt_mtdtor_param par;
555
556 par.net = net;
557 par.match = m->u.kernel.match;
558 par.matchinfo = m->data;
559 par.family = NFPROTO_IPV4;
560 if (par.match->destroy != NULL)
561 par.match->destroy(&par);
562 module_put(par.match->me);
563 }
564
565 static int
566 check_entry(const struct ipt_entry *e)
567 {
568 const struct xt_entry_target *t;
569
570 if (!ip_checkentry(&e->ip))
571 return -EINVAL;
572
573 if (e->target_offset + sizeof(struct xt_entry_target) >
574 e->next_offset)
575 return -EINVAL;
576
577 t = ipt_get_target_c(e);
578 if (e->target_offset + t->u.target_size > e->next_offset)
579 return -EINVAL;
580
581 return 0;
582 }
583
584 static int
585 check_match(struct xt_entry_match *m, struct xt_mtchk_param *par)
586 {
587 const struct ipt_ip *ip = par->entryinfo;
588 int ret;
589
590 par->match = m->u.kernel.match;
591 par->matchinfo = m->data;
592
593 ret = xt_check_match(par, m->u.match_size - sizeof(*m),
594 ip->proto, ip->invflags & IPT_INV_PROTO);
595 if (ret < 0) {
596 duprintf("check failed for `%s'.\n", par->match->name);
597 return ret;
598 }
599 return 0;
600 }
601
602 static int
603 find_check_match(struct xt_entry_match *m, struct xt_mtchk_param *par)
604 {
605 struct xt_match *match;
606 int ret;
607
608 match = xt_request_find_match(NFPROTO_IPV4, m->u.user.name,
609 m->u.user.revision);
610 if (IS_ERR(match)) {
611 duprintf("find_check_match: `%s' not found\n", m->u.user.name);
612 return PTR_ERR(match);
613 }
614 m->u.kernel.match = match;
615
616 ret = check_match(m, par);
617 if (ret)
618 goto err;
619
620 return 0;
621 err:
622 module_put(m->u.kernel.match->me);
623 return ret;
624 }
625
626 static int check_target(struct ipt_entry *e, struct net *net, const char *name)
627 {
628 struct xt_entry_target *t = ipt_get_target(e);
629 struct xt_tgchk_param par = {
630 .net = net,
631 .table = name,
632 .entryinfo = e,
633 .target = t->u.kernel.target,
634 .targinfo = t->data,
635 .hook_mask = e->comefrom,
636 .family = NFPROTO_IPV4,
637 };
638 int ret;
639
640 ret = xt_check_target(&par, t->u.target_size - sizeof(*t),
641 e->ip.proto, e->ip.invflags & IPT_INV_PROTO);
642 if (ret < 0) {
643 duprintf("check failed for `%s'.\n",
644 t->u.kernel.target->name);
645 return ret;
646 }
647 return 0;
648 }
649
650 static int
651 find_check_entry(struct ipt_entry *e, struct net *net, const char *name,
652 unsigned int size)
653 {
654 struct xt_entry_target *t;
655 struct xt_target *target;
656 int ret;
657 unsigned int j;
658 struct xt_mtchk_param mtpar;
659 struct xt_entry_match *ematch;
660
661 j = 0;
662 mtpar.net = net;
663 mtpar.table = name;
664 mtpar.entryinfo = &e->ip;
665 mtpar.hook_mask = e->comefrom;
666 mtpar.family = NFPROTO_IPV4;
667 xt_ematch_foreach(ematch, e) {
668 ret = find_check_match(ematch, &mtpar);
669 if (ret != 0)
670 goto cleanup_matches;
671 ++j;
672 }
673
674 t = ipt_get_target(e);
675 target = xt_request_find_target(NFPROTO_IPV4, t->u.user.name,
676 t->u.user.revision);
677 if (IS_ERR(target)) {
678 duprintf("find_check_entry: `%s' not found\n", t->u.user.name);
679 ret = PTR_ERR(target);
680 goto cleanup_matches;
681 }
682 t->u.kernel.target = target;
683
684 ret = check_target(e, net, name);
685 if (ret)
686 goto err;
687 return 0;
688 err:
689 module_put(t->u.kernel.target->me);
690 cleanup_matches:
691 xt_ematch_foreach(ematch, e) {
692 if (j-- == 0)
693 break;
694 cleanup_match(ematch, net);
695 }
696 return ret;
697 }
698
699 static bool check_underflow(const struct ipt_entry *e)
700 {
701 const struct xt_entry_target *t;
702 unsigned int verdict;
703
704 if (!unconditional(e))
705 return false;
706 t = ipt_get_target_c(e);
707 if (strcmp(t->u.user.name, XT_STANDARD_TARGET) != 0)
708 return false;
709 verdict = ((struct xt_standard_target *)t)->verdict;
710 verdict = -verdict - 1;
711 return verdict == NF_DROP || verdict == NF_ACCEPT;
712 }
713
714 static int
715 check_entry_size_and_hooks(struct ipt_entry *e,
716 struct xt_table_info *newinfo,
717 const unsigned char *base,
718 const unsigned char *limit,
719 const unsigned int *hook_entries,
720 const unsigned int *underflows,
721 unsigned int valid_hooks)
722 {
723 unsigned int h;
724 int err;
725
726 if ((unsigned long)e % __alignof__(struct ipt_entry) != 0 ||
727 (unsigned char *)e + sizeof(struct ipt_entry) >= limit ||
728 (unsigned char *)e + e->next_offset > limit) {
729 duprintf("Bad offset %p\n", e);
730 return -EINVAL;
731 }
732
733 if (e->next_offset
734 < sizeof(struct ipt_entry) + sizeof(struct xt_entry_target)) {
735 duprintf("checking: element %p size %u\n",
736 e, e->next_offset);
737 return -EINVAL;
738 }
739
740 err = check_entry(e);
741 if (err)
742 return err;
743
744 /* Check hooks & underflows */
745 for (h = 0; h < NF_INET_NUMHOOKS; h++) {
746 if (!(valid_hooks & (1 << h)))
747 continue;
748 if ((unsigned char *)e - base == hook_entries[h])
749 newinfo->hook_entry[h] = hook_entries[h];
750 if ((unsigned char *)e - base == underflows[h]) {
751 if (!check_underflow(e)) {
752 pr_debug("Underflows must be unconditional and "
753 "use the STANDARD target with "
754 "ACCEPT/DROP\n");
755 return -EINVAL;
756 }
757 newinfo->underflow[h] = underflows[h];
758 }
759 }
760
761 /* Clear counters and comefrom */
762 e->counters = ((struct xt_counters) { 0, 0 });
763 e->comefrom = 0;
764 return 0;
765 }
766
767 static void
768 cleanup_entry(struct ipt_entry *e, struct net *net)
769 {
770 struct xt_tgdtor_param par;
771 struct xt_entry_target *t;
772 struct xt_entry_match *ematch;
773
774 /* Cleanup all matches */
775 xt_ematch_foreach(ematch, e)
776 cleanup_match(ematch, net);
777 t = ipt_get_target(e);
778
779 par.net = net;
780 par.target = t->u.kernel.target;
781 par.targinfo = t->data;
782 par.family = NFPROTO_IPV4;
783 if (par.target->destroy != NULL)
784 par.target->destroy(&par);
785 module_put(par.target->me);
786 }
787
788 /* Checks and translates the user-supplied table segment (held in
789 newinfo) */
790 static int
791 translate_table(struct net *net, struct xt_table_info *newinfo, void *entry0,
792 const struct ipt_replace *repl)
793 {
794 struct ipt_entry *iter;
795 unsigned int i;
796 int ret = 0;
797
798 newinfo->size = repl->size;
799 newinfo->number = repl->num_entries;
800
801 /* Init all hooks to impossible value. */
802 for (i = 0; i < NF_INET_NUMHOOKS; i++) {
803 newinfo->hook_entry[i] = 0xFFFFFFFF;
804 newinfo->underflow[i] = 0xFFFFFFFF;
805 }
806
807 duprintf("translate_table: size %u\n", newinfo->size);
808 i = 0;
809 /* Walk through entries, checking offsets. */
810 xt_entry_foreach(iter, entry0, newinfo->size) {
811 ret = check_entry_size_and_hooks(iter, newinfo, entry0,
812 entry0 + repl->size,
813 repl->hook_entry,
814 repl->underflow,
815 repl->valid_hooks);
816 if (ret != 0)
817 return ret;
818 ++i;
819 if (strcmp(ipt_get_target(iter)->u.user.name,
820 XT_ERROR_TARGET) == 0)
821 ++newinfo->stacksize;
822 }
823
824 if (i != repl->num_entries) {
825 duprintf("translate_table: %u not %u entries\n",
826 i, repl->num_entries);
827 return -EINVAL;
828 }
829
830 /* Check hooks all assigned */
831 for (i = 0; i < NF_INET_NUMHOOKS; i++) {
832 /* Only hooks which are valid */
833 if (!(repl->valid_hooks & (1 << i)))
834 continue;
835 if (newinfo->hook_entry[i] == 0xFFFFFFFF) {
836 duprintf("Invalid hook entry %u %u\n",
837 i, repl->hook_entry[i]);
838 return -EINVAL;
839 }
840 if (newinfo->underflow[i] == 0xFFFFFFFF) {
841 duprintf("Invalid underflow %u %u\n",
842 i, repl->underflow[i]);
843 return -EINVAL;
844 }
845 }
846
847 if (!mark_source_chains(newinfo, repl->valid_hooks, entry0))
848 return -ELOOP;
849
850 /* Finally, each sanity check must pass */
851 i = 0;
852 xt_entry_foreach(iter, entry0, newinfo->size) {
853 ret = find_check_entry(iter, net, repl->name, repl->size);
854 if (ret != 0)
855 break;
856 ++i;
857 }
858
859 if (ret != 0) {
860 xt_entry_foreach(iter, entry0, newinfo->size) {
861 if (i-- == 0)
862 break;
863 cleanup_entry(iter, net);
864 }
865 return ret;
866 }
867
868 /* And one copy for every other CPU */
869 for_each_possible_cpu(i) {
870 if (newinfo->entries[i] && newinfo->entries[i] != entry0)
871 memcpy(newinfo->entries[i], entry0, newinfo->size);
872 }
873
874 return ret;
875 }
876
877 static void
878 get_counters(const struct xt_table_info *t,
879 struct xt_counters counters[])
880 {
881 struct ipt_entry *iter;
882 unsigned int cpu;
883 unsigned int i;
884
885 for_each_possible_cpu(cpu) {
886 seqcount_t *s = &per_cpu(xt_recseq, cpu);
887
888 i = 0;
889 xt_entry_foreach(iter, t->entries[cpu], t->size) {
890 u64 bcnt, pcnt;
891 unsigned int start;
892
893 do {
894 start = read_seqcount_begin(s);
895 bcnt = iter->counters.bcnt;
896 pcnt = iter->counters.pcnt;
897 } while (read_seqcount_retry(s, start));
898
899 ADD_COUNTER(counters[i], bcnt, pcnt);
900 ++i; /* macro does multi eval of i */
901 }
902 }
903 }
904
905 static struct xt_counters *alloc_counters(const struct xt_table *table)
906 {
907 unsigned int countersize;
908 struct xt_counters *counters;
909 const struct xt_table_info *private = table->private;
910
911 /* We need atomic snapshot of counters: rest doesn't change
912 (other than comefrom, which userspace doesn't care
913 about). */
914 countersize = sizeof(struct xt_counters) * private->number;
915 counters = vzalloc(countersize);
916
917 if (counters == NULL)
918 return ERR_PTR(-ENOMEM);
919
920 get_counters(private, counters);
921
922 return counters;
923 }
924
925 static int
926 copy_entries_to_user(unsigned int total_size,
927 const struct xt_table *table,
928 void __user *userptr)
929 {
930 unsigned int off, num;
931 const struct ipt_entry *e;
932 struct xt_counters *counters;
933 const struct xt_table_info *private = table->private;
934 int ret = 0;
935 const void *loc_cpu_entry;
936
937 counters = alloc_counters(table);
938 if (IS_ERR(counters))
939 return PTR_ERR(counters);
940
941 /* choose the copy that is on our node/cpu, ...
942 * This choice is lazy (because current thread is
943 * allowed to migrate to another cpu)
944 */
945 loc_cpu_entry = private->entries[raw_smp_processor_id()];
946 if (copy_to_user(userptr, loc_cpu_entry, total_size) != 0) {
947 ret = -EFAULT;
948 goto free_counters;
949 }
950
951 /* FIXME: use iterator macros --RR */
952 /* ... then go back and fix counters and names */
953 for (off = 0, num = 0; off < total_size; off += e->next_offset, num++){
954 unsigned int i;
955 const struct xt_entry_match *m;
956 const struct xt_entry_target *t;
957
958 e = (struct ipt_entry *)(loc_cpu_entry + off);
959 if (copy_to_user(userptr + off
960 + offsetof(struct ipt_entry, counters),
961 &counters[num],
962 sizeof(counters[num])) != 0) {
963 ret = -EFAULT;
964 goto free_counters;
965 }
966
967 for (i = sizeof(struct ipt_entry);
968 i < e->target_offset;
969 i += m->u.match_size) {
970 m = (void *)e + i;
971
972 if (copy_to_user(userptr + off + i
973 + offsetof(struct xt_entry_match,
974 u.user.name),
975 m->u.kernel.match->name,
976 strlen(m->u.kernel.match->name)+1)
977 != 0) {
978 ret = -EFAULT;
979 goto free_counters;
980 }
981 }
982
983 t = ipt_get_target_c(e);
984 if (copy_to_user(userptr + off + e->target_offset
985 + offsetof(struct xt_entry_target,
986 u.user.name),
987 t->u.kernel.target->name,
988 strlen(t->u.kernel.target->name)+1) != 0) {
989 ret = -EFAULT;
990 goto free_counters;
991 }
992 }
993
994 free_counters:
995 vfree(counters);
996 return ret;
997 }
998
999 #ifdef CONFIG_COMPAT
1000 static void compat_standard_from_user(void *dst, const void *src)
1001 {
1002 int v = *(compat_int_t *)src;
1003
1004 if (v > 0)
1005 v += xt_compat_calc_jump(AF_INET, v);
1006 memcpy(dst, &v, sizeof(v));
1007 }
1008
1009 static int compat_standard_to_user(void __user *dst, const void *src)
1010 {
1011 compat_int_t cv = *(int *)src;
1012
1013 if (cv > 0)
1014 cv -= xt_compat_calc_jump(AF_INET, cv);
1015 return copy_to_user(dst, &cv, sizeof(cv)) ? -EFAULT : 0;
1016 }
1017
1018 static int compat_calc_entry(const struct ipt_entry *e,
1019 const struct xt_table_info *info,
1020 const void *base, struct xt_table_info *newinfo)
1021 {
1022 const struct xt_entry_match *ematch;
1023 const struct xt_entry_target *t;
1024 unsigned int entry_offset;
1025 int off, i, ret;
1026
1027 off = sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);
1028 entry_offset = (void *)e - base;
1029 xt_ematch_foreach(ematch, e)
1030 off += xt_compat_match_offset(ematch->u.kernel.match);
1031 t = ipt_get_target_c(e);
1032 off += xt_compat_target_offset(t->u.kernel.target);
1033 newinfo->size -= off;
1034 ret = xt_compat_add_offset(AF_INET, entry_offset, off);
1035 if (ret)
1036 return ret;
1037
1038 for (i = 0; i < NF_INET_NUMHOOKS; i++) {
1039 if (info->hook_entry[i] &&
1040 (e < (struct ipt_entry *)(base + info->hook_entry[i])))
1041 newinfo->hook_entry[i] -= off;
1042 if (info->underflow[i] &&
1043 (e < (struct ipt_entry *)(base + info->underflow[i])))
1044 newinfo->underflow[i] -= off;
1045 }
1046 return 0;
1047 }
1048
1049 static int compat_table_info(const struct xt_table_info *info,
1050 struct xt_table_info *newinfo)
1051 {
1052 struct ipt_entry *iter;
1053 void *loc_cpu_entry;
1054 int ret;
1055
1056 if (!newinfo || !info)
1057 return -EINVAL;
1058
1059 /* we dont care about newinfo->entries[] */
1060 memcpy(newinfo, info, offsetof(struct xt_table_info, entries));
1061 newinfo->initial_entries = 0;
1062 loc_cpu_entry = info->entries[raw_smp_processor_id()];
1063 xt_compat_init_offsets(AF_INET, info->number);
1064 xt_entry_foreach(iter, loc_cpu_entry, info->size) {
1065 ret = compat_calc_entry(iter, info, loc_cpu_entry, newinfo);
1066 if (ret != 0)
1067 return ret;
1068 }
1069 return 0;
1070 }
1071 #endif
1072
1073 static int get_info(struct net *net, void __user *user,
1074 const int *len, int compat)
1075 {
1076 char name[XT_TABLE_MAXNAMELEN];
1077 struct xt_table *t;
1078 int ret;
1079
1080 if (*len != sizeof(struct ipt_getinfo)) {
1081 duprintf("length %u != %zu\n", *len,
1082 sizeof(struct ipt_getinfo));
1083 return -EINVAL;
1084 }
1085
1086 if (copy_from_user(name, user, sizeof(name)) != 0)
1087 return -EFAULT;
1088
1089 name[XT_TABLE_MAXNAMELEN-1] = '\0';
1090 #ifdef CONFIG_COMPAT
1091 if (compat)
1092 xt_compat_lock(AF_INET);
1093 #endif
1094 t = try_then_request_module(xt_find_table_lock(net, AF_INET, name),
1095 "iptable_%s", name);
1096 if (!IS_ERR_OR_NULL(t)) {
1097 struct ipt_getinfo info;
1098 const struct xt_table_info *private = t->private;
1099 #ifdef CONFIG_COMPAT
1100 struct xt_table_info tmp;
1101
1102 if (compat) {
1103 ret = compat_table_info(private, &tmp);
1104 xt_compat_flush_offsets(AF_INET);
1105 private = &tmp;
1106 }
1107 #endif
1108 memset(&info, 0, sizeof(info));
1109 info.valid_hooks = t->valid_hooks;
1110 memcpy(info.hook_entry, private->hook_entry,
1111 sizeof(info.hook_entry));
1112 memcpy(info.underflow, private->underflow,
1113 sizeof(info.underflow));
1114 info.num_entries = private->number;
1115 info.size = private->size;
1116 strcpy(info.name, name);
1117
1118 if (copy_to_user(user, &info, *len) != 0)
1119 ret = -EFAULT;
1120 else
1121 ret = 0;
1122
1123 xt_table_unlock(t);
1124 module_put(t->me);
1125 } else
1126 ret = t ? PTR_ERR(t) : -ENOENT;
1127 #ifdef CONFIG_COMPAT
1128 if (compat)
1129 xt_compat_unlock(AF_INET);
1130 #endif
1131 return ret;
1132 }
1133
1134 static int
1135 get_entries(struct net *net, struct ipt_get_entries __user *uptr,
1136 const int *len)
1137 {
1138 int ret;
1139 struct ipt_get_entries get;
1140 struct xt_table *t;
1141
1142 if (*len < sizeof(get)) {
1143 duprintf("get_entries: %u < %zu\n", *len, sizeof(get));
1144 return -EINVAL;
1145 }
1146 if (copy_from_user(&get, uptr, sizeof(get)) != 0)
1147 return -EFAULT;
1148 if (*len != sizeof(struct ipt_get_entries) + get.size) {
1149 duprintf("get_entries: %u != %zu\n",
1150 *len, sizeof(get) + get.size);
1151 return -EINVAL;
1152 }
1153
1154 t = xt_find_table_lock(net, AF_INET, get.name);
1155 if (!IS_ERR_OR_NULL(t)) {
1156 const struct xt_table_info *private = t->private;
1157 duprintf("t->private->number = %u\n", private->number);
1158 if (get.size == private->size)
1159 ret = copy_entries_to_user(private->size,
1160 t, uptr->entrytable);
1161 else {
1162 duprintf("get_entries: I've got %u not %u!\n",
1163 private->size, get.size);
1164 ret = -EAGAIN;
1165 }
1166 module_put(t->me);
1167 xt_table_unlock(t);
1168 } else
1169 ret = t ? PTR_ERR(t) : -ENOENT;
1170
1171 return ret;
1172 }
1173
1174 static int
1175 __do_replace(struct net *net, const char *name, unsigned int valid_hooks,
1176 struct xt_table_info *newinfo, unsigned int num_counters,
1177 void __user *counters_ptr)
1178 {
1179 int ret;
1180 struct xt_table *t;
1181 struct xt_table_info *oldinfo;
1182 struct xt_counters *counters;
1183 void *loc_cpu_old_entry;
1184 struct ipt_entry *iter;
1185
1186 ret = 0;
1187 counters = vzalloc(num_counters * sizeof(struct xt_counters));
1188 if (!counters) {
1189 ret = -ENOMEM;
1190 goto out;
1191 }
1192
1193 t = try_then_request_module(xt_find_table_lock(net, AF_INET, name),
1194 "iptable_%s", name);
1195 if (IS_ERR_OR_NULL(t)) {
1196 ret = t ? PTR_ERR(t) : -ENOENT;
1197 goto free_newinfo_counters_untrans;
1198 }
1199
1200 /* You lied! */
1201 if (valid_hooks != t->valid_hooks) {
1202 duprintf("Valid hook crap: %08X vs %08X\n",
1203 valid_hooks, t->valid_hooks);
1204 ret = -EINVAL;
1205 goto put_module;
1206 }
1207
1208 oldinfo = xt_replace_table(t, num_counters, newinfo, &ret);
1209 if (!oldinfo)
1210 goto put_module;
1211
1212 /* Update module usage count based on number of rules */
1213 duprintf("do_replace: oldnum=%u, initnum=%u, newnum=%u\n",
1214 oldinfo->number, oldinfo->initial_entries, newinfo->number);
1215 if ((oldinfo->number > oldinfo->initial_entries) ||
1216 (newinfo->number <= oldinfo->initial_entries))
1217 module_put(t->me);
1218 if ((oldinfo->number > oldinfo->initial_entries) &&
1219 (newinfo->number <= oldinfo->initial_entries))
1220 module_put(t->me);
1221
1222 /* Get the old counters, and synchronize with replace */
1223 get_counters(oldinfo, counters);
1224
1225 /* Decrease module usage counts and free resource */
1226 loc_cpu_old_entry = oldinfo->entries[raw_smp_processor_id()];
1227 xt_entry_foreach(iter, loc_cpu_old_entry, oldinfo->size)
1228 cleanup_entry(iter, net);
1229
1230 xt_free_table_info(oldinfo);
1231 if (copy_to_user(counters_ptr, counters,
1232 sizeof(struct xt_counters) * num_counters) != 0) {
1233 /* Silent error, can't fail, new table is already in place */
1234 net_warn_ratelimited("iptables: counters copy to user failed while replacing table\n");
1235 }
1236 vfree(counters);
1237 xt_table_unlock(t);
1238 return ret;
1239
1240 put_module:
1241 module_put(t->me);
1242 xt_table_unlock(t);
1243 free_newinfo_counters_untrans:
1244 vfree(counters);
1245 out:
1246 return ret;
1247 }
1248
1249 static int
1250 do_replace(struct net *net, const void __user *user, unsigned int len)
1251 {
1252 int ret;
1253 struct ipt_replace tmp;
1254 struct xt_table_info *newinfo;
1255 void *loc_cpu_entry;
1256 struct ipt_entry *iter;
1257
1258 if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
1259 return -EFAULT;
1260
1261 /* overflow check */
1262 if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))
1263 return -ENOMEM;
1264 tmp.name[sizeof(tmp.name)-1] = 0;
1265
1266 newinfo = xt_alloc_table_info(tmp.size);
1267 if (!newinfo)
1268 return -ENOMEM;
1269
1270 /* choose the copy that is on our node/cpu */
1271 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
1272 if (copy_from_user(loc_cpu_entry, user + sizeof(tmp),
1273 tmp.size) != 0) {
1274 ret = -EFAULT;
1275 goto free_newinfo;
1276 }
1277
1278 ret = translate_table(net, newinfo, loc_cpu_entry, &tmp);
1279 if (ret != 0)
1280 goto free_newinfo;
1281
1282 duprintf("Translated table\n");
1283
1284 ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,
1285 tmp.num_counters, tmp.counters);
1286 if (ret)
1287 goto free_newinfo_untrans;
1288 return 0;
1289
1290 free_newinfo_untrans:
1291 xt_entry_foreach(iter, loc_cpu_entry, newinfo->size)
1292 cleanup_entry(iter, net);
1293 free_newinfo:
1294 xt_free_table_info(newinfo);
1295 return ret;
1296 }
1297
1298 static int
1299 do_add_counters(struct net *net, const void __user *user,
1300 unsigned int len, int compat)
1301 {
1302 unsigned int i, curcpu;
1303 struct xt_counters_info tmp;
1304 struct xt_counters *paddc;
1305 unsigned int num_counters;
1306 const char *name;
1307 int size;
1308 void *ptmp;
1309 struct xt_table *t;
1310 const struct xt_table_info *private;
1311 int ret = 0;
1312 void *loc_cpu_entry;
1313 struct ipt_entry *iter;
1314 unsigned int addend;
1315 #ifdef CONFIG_COMPAT
1316 struct compat_xt_counters_info compat_tmp;
1317
1318 if (compat) {
1319 ptmp = &compat_tmp;
1320 size = sizeof(struct compat_xt_counters_info);
1321 } else
1322 #endif
1323 {
1324 ptmp = &tmp;
1325 size = sizeof(struct xt_counters_info);
1326 }
1327
1328 if (copy_from_user(ptmp, user, size) != 0)
1329 return -EFAULT;
1330
1331 #ifdef CONFIG_COMPAT
1332 if (compat) {
1333 num_counters = compat_tmp.num_counters;
1334 name = compat_tmp.name;
1335 } else
1336 #endif
1337 {
1338 num_counters = tmp.num_counters;
1339 name = tmp.name;
1340 }
1341
1342 if (len != size + num_counters * sizeof(struct xt_counters))
1343 return -EINVAL;
1344
1345 paddc = vmalloc(len - size);
1346 if (!paddc)
1347 return -ENOMEM;
1348
1349 if (copy_from_user(paddc, user + size, len - size) != 0) {
1350 ret = -EFAULT;
1351 goto free;
1352 }
1353
1354 t = xt_find_table_lock(net, AF_INET, name);
1355 if (IS_ERR_OR_NULL(t)) {
1356 ret = t ? PTR_ERR(t) : -ENOENT;
1357 goto free;
1358 }
1359
1360 local_bh_disable();
1361 private = t->private;
1362 if (private->number != num_counters) {
1363 ret = -EINVAL;
1364 goto unlock_up_free;
1365 }
1366
1367 i = 0;
1368 /* Choose the copy that is on our node */
1369 curcpu = smp_processor_id();
1370 loc_cpu_entry = private->entries[curcpu];
1371 addend = xt_write_recseq_begin();
1372 xt_entry_foreach(iter, loc_cpu_entry, private->size) {
1373 ADD_COUNTER(iter->counters, paddc[i].bcnt, paddc[i].pcnt);
1374 ++i;
1375 }
1376 xt_write_recseq_end(addend);
1377 unlock_up_free:
1378 local_bh_enable();
1379 xt_table_unlock(t);
1380 module_put(t->me);
1381 free:
1382 vfree(paddc);
1383
1384 return ret;
1385 }
1386
1387 #ifdef CONFIG_COMPAT
1388 struct compat_ipt_replace {
1389 char name[XT_TABLE_MAXNAMELEN];
1390 u32 valid_hooks;
1391 u32 num_entries;
1392 u32 size;
1393 u32 hook_entry[NF_INET_NUMHOOKS];
1394 u32 underflow[NF_INET_NUMHOOKS];
1395 u32 num_counters;
1396 compat_uptr_t counters; /* struct xt_counters * */
1397 struct compat_ipt_entry entries[0];
1398 };
1399
1400 static int
1401 compat_copy_entry_to_user(struct ipt_entry *e, void __user **dstptr,
1402 unsigned int *size, struct xt_counters *counters,
1403 unsigned int i)
1404 {
1405 struct xt_entry_target *t;
1406 struct compat_ipt_entry __user *ce;
1407 u_int16_t target_offset, next_offset;
1408 compat_uint_t origsize;
1409 const struct xt_entry_match *ematch;
1410 int ret = 0;
1411
1412 origsize = *size;
1413 ce = (struct compat_ipt_entry __user *)*dstptr;
1414 if (copy_to_user(ce, e, sizeof(struct ipt_entry)) != 0 ||
1415 copy_to_user(&ce->counters, &counters[i],
1416 sizeof(counters[i])) != 0)
1417 return -EFAULT;
1418
1419 *dstptr += sizeof(struct compat_ipt_entry);
1420 *size -= sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);
1421
1422 xt_ematch_foreach(ematch, e) {
1423 ret = xt_compat_match_to_user(ematch, dstptr, size);
1424 if (ret != 0)
1425 return ret;
1426 }
1427 target_offset = e->target_offset - (origsize - *size);
1428 t = ipt_get_target(e);
1429 ret = xt_compat_target_to_user(t, dstptr, size);
1430 if (ret)
1431 return ret;
1432 next_offset = e->next_offset - (origsize - *size);
1433 if (put_user(target_offset, &ce->target_offset) != 0 ||
1434 put_user(next_offset, &ce->next_offset) != 0)
1435 return -EFAULT;
1436 return 0;
1437 }
1438
1439 static int
1440 compat_find_calc_match(struct xt_entry_match *m,
1441 const char *name,
1442 const struct ipt_ip *ip,
1443 unsigned int hookmask,
1444 int *size)
1445 {
1446 struct xt_match *match;
1447
1448 match = xt_request_find_match(NFPROTO_IPV4, m->u.user.name,
1449 m->u.user.revision);
1450 if (IS_ERR(match)) {
1451 duprintf("compat_check_calc_match: `%s' not found\n",
1452 m->u.user.name);
1453 return PTR_ERR(match);
1454 }
1455 m->u.kernel.match = match;
1456 *size += xt_compat_match_offset(match);
1457 return 0;
1458 }
1459
1460 static void compat_release_entry(struct compat_ipt_entry *e)
1461 {
1462 struct xt_entry_target *t;
1463 struct xt_entry_match *ematch;
1464
1465 /* Cleanup all matches */
1466 xt_ematch_foreach(ematch, e)
1467 module_put(ematch->u.kernel.match->me);
1468 t = compat_ipt_get_target(e);
1469 module_put(t->u.kernel.target->me);
1470 }
1471
1472 static int
1473 check_compat_entry_size_and_hooks(struct compat_ipt_entry *e,
1474 struct xt_table_info *newinfo,
1475 unsigned int *size,
1476 const unsigned char *base,
1477 const unsigned char *limit,
1478 const unsigned int *hook_entries,
1479 const unsigned int *underflows,
1480 const char *name)
1481 {
1482 struct xt_entry_match *ematch;
1483 struct xt_entry_target *t;
1484 struct xt_target *target;
1485 unsigned int entry_offset;
1486 unsigned int j;
1487 int ret, off, h;
1488
1489 duprintf("check_compat_entry_size_and_hooks %p\n", e);
1490 if ((unsigned long)e % __alignof__(struct compat_ipt_entry) != 0 ||
1491 (unsigned char *)e + sizeof(struct compat_ipt_entry) >= limit ||
1492 (unsigned char *)e + e->next_offset > 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);
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);