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