ip_tables.c 55.2 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4
/*
 * Packet matching code.
 *
 * 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>
L
Linus Torvalds 已提交
7 8 9 10 11
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation.
 */
12
#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
L
Linus Torvalds 已提交
13
#include <linux/cache.h>
14
#include <linux/capability.h>
L
Linus Torvalds 已提交
15 16 17 18 19 20 21
#include <linux/skbuff.h>
#include <linux/kmod.h>
#include <linux/vmalloc.h>
#include <linux/netdevice.h>
#include <linux/module.h>
#include <linux/icmp.h>
#include <net/ip.h>
22
#include <net/compat.h>
L
Linus Torvalds 已提交
23
#include <asm/uaccess.h>
I
Ingo Molnar 已提交
24
#include <linux/mutex.h>
L
Linus Torvalds 已提交
25 26
#include <linux/proc_fs.h>
#include <linux/err.h>
27
#include <linux/cpumask.h>
L
Linus Torvalds 已提交
28

29
#include <linux/netfilter/x_tables.h>
L
Linus Torvalds 已提交
30
#include <linux/netfilter_ipv4/ip_tables.h>
31
#include <net/netfilter/nf_log.h>
32
#include "../../netfilter/xt_repldata.h"
L
Linus Torvalds 已提交
33 34 35 36 37 38 39 40 41 42

MODULE_LICENSE("GPL");
MODULE_AUTHOR("Netfilter Core Team <coreteam@netfilter.org>");
MODULE_DESCRIPTION("IPv4 packet filter");

/*#define DEBUG_IP_FIREWALL*/
/*#define DEBUG_ALLOW_ALL*/ /* Useful for remote debugging */
/*#define DEBUG_IP_FIREWALL_USER*/

#ifdef DEBUG_IP_FIREWALL
43
#define dprintf(format, args...) pr_info(format , ## args)
L
Linus Torvalds 已提交
44 45 46 47 48
#else
#define dprintf(format, args...)
#endif

#ifdef DEBUG_IP_FIREWALL_USER
49
#define duprintf(format, args...) pr_info(format , ## args)
L
Linus Torvalds 已提交
50 51 52 53 54
#else
#define duprintf(format, args...)
#endif

#ifdef CONFIG_NETFILTER_DEBUG
55
#define IP_NF_ASSERT(x)		WARN_ON(!(x))
L
Linus Torvalds 已提交
56 57 58 59 60 61 62 63 64 65
#else
#define IP_NF_ASSERT(x)
#endif

#if 0
/* All the better to debug you with... */
#define static
#define inline
#endif

66 67 68 69 70 71
void *ipt_alloc_initial_table(const struct xt_table *info)
{
	return xt_alloc_initial_table(ipt, IPT);
}
EXPORT_SYMBOL_GPL(ipt_alloc_initial_table);

L
Linus Torvalds 已提交
72
/* Returns whether matches rule or not. */
73
/* Performance critical - called for every packet */
74
static inline bool
L
Linus Torvalds 已提交
75 76 77 78 79 80 81 82
ip_packet_match(const struct iphdr *ip,
		const char *indev,
		const char *outdev,
		const struct ipt_ip *ipinfo,
		int isfrag)
{
	unsigned long ret;

83
#define FWINV(bool, invflg) ((bool) ^ !!(ipinfo->invflags & (invflg)))
L
Linus Torvalds 已提交
84 85

	if (FWINV((ip->saddr&ipinfo->smsk.s_addr) != ipinfo->src.s_addr,
86 87 88
		  IPT_INV_SRCIP) ||
	    FWINV((ip->daddr&ipinfo->dmsk.s_addr) != ipinfo->dst.s_addr,
		  IPT_INV_DSTIP)) {
L
Linus Torvalds 已提交
89 90
		dprintf("Source or dest mismatch.\n");

91 92
		dprintf("SRC: %pI4. Mask: %pI4. Target: %pI4.%s\n",
			&ip->saddr, &ipinfo->smsk.s_addr, &ipinfo->src.s_addr,
L
Linus Torvalds 已提交
93
			ipinfo->invflags & IPT_INV_SRCIP ? " (INV)" : "");
94 95
		dprintf("DST: %pI4 Mask: %pI4 Target: %pI4.%s\n",
			&ip->daddr, &ipinfo->dmsk.s_addr, &ipinfo->dst.s_addr,
L
Linus Torvalds 已提交
96
			ipinfo->invflags & IPT_INV_DSTIP ? " (INV)" : "");
97
		return false;
L
Linus Torvalds 已提交
98 99
	}

100
	ret = ifname_compare_aligned(indev, ipinfo->iniface, ipinfo->iniface_mask);
L
Linus Torvalds 已提交
101 102 103 104 105

	if (FWINV(ret != 0, IPT_INV_VIA_IN)) {
		dprintf("VIA in mismatch (%s vs %s).%s\n",
			indev, ipinfo->iniface,
			ipinfo->invflags&IPT_INV_VIA_IN ?" (INV)":"");
106
		return false;
L
Linus Torvalds 已提交
107 108
	}

109
	ret = ifname_compare_aligned(outdev, ipinfo->outiface, ipinfo->outiface_mask);
L
Linus Torvalds 已提交
110 111 112 113 114

	if (FWINV(ret != 0, IPT_INV_VIA_OUT)) {
		dprintf("VIA out mismatch (%s vs %s).%s\n",
			outdev, ipinfo->outiface,
			ipinfo->invflags&IPT_INV_VIA_OUT ?" (INV)":"");
115
		return false;
L
Linus Torvalds 已提交
116 117 118
	}

	/* Check specific protocol */
119 120
	if (ipinfo->proto &&
	    FWINV(ip->protocol != ipinfo->proto, IPT_INV_PROTO)) {
L
Linus Torvalds 已提交
121 122 123
		dprintf("Packet protocol %hi does not match %hi.%s\n",
			ip->protocol, ipinfo->proto,
			ipinfo->invflags&IPT_INV_PROTO ? " (INV)":"");
124
		return false;
L
Linus Torvalds 已提交
125 126 127 128 129 130 131
	}

	/* If we have a fragment rule but the packet is not a fragment
	 * then we return zero */
	if (FWINV((ipinfo->flags&IPT_F_FRAG) && !isfrag, IPT_INV_FRAG)) {
		dprintf("Fragment rule but not fragment.%s\n",
			ipinfo->invflags & IPT_INV_FRAG ? " (INV)" : "");
132
		return false;
L
Linus Torvalds 已提交
133 134
	}

135
	return true;
L
Linus Torvalds 已提交
136 137
}

138
static bool
L
Linus Torvalds 已提交
139 140 141 142 143
ip_checkentry(const struct ipt_ip *ip)
{
	if (ip->flags & ~IPT_F_MASK) {
		duprintf("Unknown flag bits set: %08X\n",
			 ip->flags & ~IPT_F_MASK);
144
		return false;
L
Linus Torvalds 已提交
145 146 147 148
	}
	if (ip->invflags & ~IPT_INV_MASK) {
		duprintf("Unknown invflag bits set: %08X\n",
			 ip->invflags & ~IPT_INV_MASK);
149
		return false;
L
Linus Torvalds 已提交
150
	}
151
	return true;
L
Linus Torvalds 已提交
152 153 154
}

static unsigned int
155
ipt_error(struct sk_buff *skb, const struct xt_action_param *par)
L
Linus Torvalds 已提交
156
{
157
	net_info_ratelimited("error: `%s'\n", (const char *)par->targinfo);
L
Linus Torvalds 已提交
158 159 160 161

	return NF_DROP;
}

162
/* Performance critical */
L
Linus Torvalds 已提交
163
static inline struct ipt_entry *
164
get_entry(const void *base, unsigned int offset)
L
Linus Torvalds 已提交
165 166 167 168
{
	return (struct ipt_entry *)(base + offset);
}

169
/* All zeroes == unconditional rule. */
170
/* Mildly perf critical (only if packet tracing is on) */
171
static inline bool unconditional(const struct ipt_ip *ip)
172
{
173
	static const struct ipt_ip uncond;
174

175
	return memcmp(ip, &uncond, sizeof(uncond)) == 0;
176
#undef FWINV
177 178
}

179
/* for const-correctness */
180
static inline const struct xt_entry_target *
181 182 183 184 185
ipt_get_target_c(const struct ipt_entry *e)
{
	return ipt_get_target((struct ipt_entry *)e);
}

186
#if IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TRACE)
187
static const char *const hooknames[] = {
188 189
	[NF_INET_PRE_ROUTING]		= "PREROUTING",
	[NF_INET_LOCAL_IN]		= "INPUT",
190
	[NF_INET_FORWARD]		= "FORWARD",
191 192
	[NF_INET_LOCAL_OUT]		= "OUTPUT",
	[NF_INET_POST_ROUTING]		= "POSTROUTING",
193 194 195 196 197 198 199 200
};

enum nf_ip_trace_comments {
	NF_IP_TRACE_COMMENT_RULE,
	NF_IP_TRACE_COMMENT_RETURN,
	NF_IP_TRACE_COMMENT_POLICY,
};

201
static const char *const comments[] = {
202 203 204 205 206 207 208 209 210 211 212 213 214 215 216
	[NF_IP_TRACE_COMMENT_RULE]	= "rule",
	[NF_IP_TRACE_COMMENT_RETURN]	= "return",
	[NF_IP_TRACE_COMMENT_POLICY]	= "policy",
};

static struct nf_loginfo trace_loginfo = {
	.type = NF_LOG_TYPE_LOG,
	.u = {
		.log = {
			.level = 4,
			.logflags = NF_LOG_MASK,
		},
	},
};

217
/* Mildly perf critical (only if packet tracing is on) */
218
static inline int
219
get_chainname_rulenum(const struct ipt_entry *s, const struct ipt_entry *e,
220 221
		      const char *hookname, const char **chainname,
		      const char **comment, unsigned int *rulenum)
222
{
223
	const struct xt_standard_target *t = (void *)ipt_get_target_c(s);
224

225
	if (strcmp(t->target.u.kernel.target->name, XT_ERROR_TARGET) == 0) {
226 227 228 229 230 231
		/* Head of user chain: ERROR target with chainname */
		*chainname = t->target.data;
		(*rulenum) = 0;
	} else if (s == e) {
		(*rulenum)++;

232 233
		if (s->target_offset == sizeof(struct ipt_entry) &&
		    strcmp(t->target.u.kernel.target->name,
234
			   XT_STANDARD_TARGET) == 0 &&
235 236
		   t->verdict < 0 &&
		   unconditional(&s->ip)) {
237 238
			/* Tail of chains: STANDARD target (return/policy) */
			*comment = *chainname == hookname
239 240
				? comments[NF_IP_TRACE_COMMENT_POLICY]
				: comments[NF_IP_TRACE_COMMENT_RETURN];
241 242 243 244 245 246 247 248
		}
		return 1;
	} else
		(*rulenum)++;

	return 0;
}

249
static void trace_packet(const struct sk_buff *skb,
250 251 252
			 unsigned int hook,
			 const struct net_device *in,
			 const struct net_device *out,
253
			 const char *tablename,
254 255
			 const struct xt_table_info *private,
			 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 266
	root = get_entry(table_base, private->hook_entry[hook]);

267 268
	hookname = chainname = hooknames[hook];
	comment = comments[NF_IP_TRACE_COMMENT_RULE];
269

270 271 272 273
	xt_entry_foreach(iter, root, private->size - private->hook_entry[hook])
		if (get_chainname_rulenum(iter, e, hookname,
		    &chainname, &comment, &rulenum) != 0)
			break;
274

275 276 277
	nf_log_trace(net, AF_INET, hook, skb, in, out, &trace_loginfo,
		     "TRACE: %s:%s:%s:%u ",
		     tablename, chainname, comment, rulenum);
278 279 280
}
#endif

281 282 283 284 285 286
static inline __pure
struct ipt_entry *ipt_next_entry(const struct ipt_entry *entry)
{
	return (void *)entry + entry->next_offset;
}

L
Linus Torvalds 已提交
287 288
/* Returns one of the generic firewall policies, like NF_ACCEPT. */
unsigned int
289
ipt_do_table(struct sk_buff *skb,
L
Linus Torvalds 已提交
290 291 292
	     unsigned int hook,
	     const struct net_device *in,
	     const struct net_device *out,
293
	     struct xt_table *table)
L
Linus Torvalds 已提交
294 295
{
	static const char nulldevname[IFNAMSIZ] __attribute__((aligned(sizeof(long))));
296
	const struct iphdr *ip;
L
Linus Torvalds 已提交
297 298 299
	/* Initializing verdict to NF_DROP keeps gcc happy. */
	unsigned int verdict = NF_DROP;
	const char *indev, *outdev;
300
	const void *table_base;
301 302
	struct ipt_entry *e, **jumpstack;
	unsigned int *stackptr, origptr, cpu;
303
	const struct xt_table_info *private;
304
	struct xt_action_param acpar;
305
	unsigned int addend;
L
Linus Torvalds 已提交
306 307

	/* Initialization */
308
	ip = ip_hdr(skb);
L
Linus Torvalds 已提交
309 310 311 312 313 314 315 316
	indev = in ? in->name : nulldevname;
	outdev = out ? out->name : nulldevname;
	/* We handle fragments by dealing with the first fragment as
	 * if it was a normal packet.  All other fragments are treated
	 * normally, except that they will NEVER match rules that ask
	 * things we don't know, ie. tcp syn flag or ports).  If the
	 * rule is also a fragment-specific rule, non-fragments won't
	 * match it. */
317 318
	acpar.fragoff = ntohs(ip->frag_off) & IP_OFFSET;
	acpar.thoff   = ip_hdrlen(skb);
319
	acpar.hotdrop = false;
320 321 322 323
	acpar.in      = in;
	acpar.out     = out;
	acpar.family  = NFPROTO_IPV4;
	acpar.hooknum = hook;
L
Linus Torvalds 已提交
324 325

	IP_NF_ASSERT(table->valid_hooks & (1 << hook));
326 327
	local_bh_disable();
	addend = xt_write_recseq_begin();
328
	private = table->private;
329
	cpu        = smp_processor_id();
330 331 332 333 334
	/*
	 * Ensure we load private-> members after we've fetched the base
	 * pointer.
	 */
	smp_read_barrier_depends();
335 336
	table_base = private->entries[cpu];
	jumpstack  = (struct ipt_entry **)private->jumpstack[cpu];
337
	stackptr   = per_cpu_ptr(private->stackptr, cpu);
338
	origptr    = *stackptr;
339

340
	e = get_entry(table_base, private->hook_entry[hook]);
L
Linus Torvalds 已提交
341

342
	pr_debug("Entering %s(hook %u); sp at %u (UF %p)\n",
343 344
		 table->name, hook, origptr,
		 get_entry(table_base, private->underflow[hook]));
L
Linus Torvalds 已提交
345 346

	do {
347
		const struct xt_entry_target *t;
348
		const struct xt_entry_match *ematch;
349

L
Linus Torvalds 已提交
350
		IP_NF_ASSERT(e);
351
		if (!ip_packet_match(ip, indev, outdev,
352
		    &e->ip, acpar.fragoff)) {
353
 no_match:
354 355 356
			e = ipt_next_entry(e);
			continue;
		}
L
Linus Torvalds 已提交
357

358
		xt_ematch_foreach(ematch, e) {
359 360 361
			acpar.match     = ematch->u.kernel.match;
			acpar.matchinfo = ematch->data;
			if (!acpar.match->match(skb, &acpar))
362
				goto no_match;
363
		}
364

365
		ADD_COUNTER(e->counters, skb->len, 1);
L
Linus Torvalds 已提交
366

367 368
		t = ipt_get_target(e);
		IP_NF_ASSERT(t->u.kernel.target);
369

370
#if IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TRACE)
371 372 373 374
		/* The packet is traced: log it */
		if (unlikely(skb->nf_trace))
			trace_packet(skb, hook, in, out,
				     table->name, private, e);
375
#endif
376 377 378 379
		/* Standard target? */
		if (!t->u.kernel.target->target) {
			int v;

380
			v = ((struct xt_standard_target *)t)->verdict;
381 382
			if (v < 0) {
				/* Pop from stack? */
383
				if (v != XT_RETURN) {
384
					verdict = (unsigned int)(-v) - 1;
385
					break;
L
Linus Torvalds 已提交
386
				}
387
				if (*stackptr <= origptr) {
388 389
					e = get_entry(table_base,
					    private->underflow[hook]);
390
					pr_debug("Underflow (this is normal) "
391 392 393
						 "to %p\n", e);
				} else {
					e = jumpstack[--*stackptr];
394
					pr_debug("Pulled %p out from pos %u\n",
395 396 397
						 e, *stackptr);
					e = ipt_next_entry(e);
				}
398 399
				continue;
			}
400 401
			if (table_base + v != ipt_next_entry(e) &&
			    !(e->ip.flags & IPT_F_GOTO)) {
402 403 404 405 406
				if (*stackptr >= private->stacksize) {
					verdict = NF_DROP;
					break;
				}
				jumpstack[(*stackptr)++] = e;
407
				pr_debug("Pushed %p into pos %u\n",
408
					 e, *stackptr - 1);
409
			}
L
Linus Torvalds 已提交
410

411
			e = get_entry(table_base, v);
412 413 414
			continue;
		}

415 416
		acpar.target   = t->u.kernel.target;
		acpar.targinfo = t->data;
417

418
		verdict = t->u.kernel.target->target(skb, &acpar);
419 420
		/* Target might have changed stuff. */
		ip = ip_hdr(skb);
421
		if (verdict == XT_CONTINUE)
422 423 424 425
			e = ipt_next_entry(e);
		else
			/* Verdict */
			break;
426
	} while (!acpar.hotdrop);
427
	pr_debug("Exiting %s; resetting sp from %u to %u\n",
428 429
		 __func__, *stackptr, origptr);
	*stackptr = origptr;
430 431 432
 	xt_write_recseq_end(addend);
 	local_bh_enable();

L
Linus Torvalds 已提交
433 434 435
#ifdef DEBUG_ALLOW_ALL
	return NF_ACCEPT;
#else
436
	if (acpar.hotdrop)
L
Linus Torvalds 已提交
437 438 439 440 441 442 443 444
		return NF_DROP;
	else return verdict;
#endif
}

/* Figures out from what hook each rule can be called: returns 0 if
   there are loops.  Puts hook bitmask in comefrom. */
static int
445
mark_source_chains(const struct xt_table_info *newinfo,
446
		   unsigned int valid_hooks, void *entry0)
L
Linus Torvalds 已提交
447 448 449 450 451
{
	unsigned int hook;

	/* No recursion; use packet counter to save back ptrs (reset
	   to 0 as we leave), and comefrom to save source hook bitmask */
452
	for (hook = 0; hook < NF_INET_NUMHOOKS; hook++) {
L
Linus Torvalds 已提交
453
		unsigned int pos = newinfo->hook_entry[hook];
454
		struct ipt_entry *e = (struct ipt_entry *)(entry0 + pos);
L
Linus Torvalds 已提交
455 456 457 458 459 460 461 462

		if (!(valid_hooks & (1 << hook)))
			continue;

		/* Set initial back pointer. */
		e->counters.pcnt = pos;

		for (;;) {
463
			const struct xt_standard_target *t
464
				= (void *)ipt_get_target_c(e);
465
			int visited = e->comefrom & (1 << hook);
L
Linus Torvalds 已提交
466

467
			if (e->comefrom & (1 << NF_INET_NUMHOOKS)) {
468
				pr_err("iptables: loop hook %u pos %u %08X.\n",
L
Linus Torvalds 已提交
469 470 471
				       hook, pos, e->comefrom);
				return 0;
			}
472
			e->comefrom |= ((1 << hook) | (1 << NF_INET_NUMHOOKS));
L
Linus Torvalds 已提交
473 474

			/* Unconditional return/END. */
475 476
			if ((e->target_offset == sizeof(struct ipt_entry) &&
			     (strcmp(t->target.u.user.name,
477
				     XT_STANDARD_TARGET) == 0) &&
478 479
			     t->verdict < 0 && unconditional(&e->ip)) ||
			    visited) {
L
Linus Torvalds 已提交
480 481
				unsigned int oldpos, size;

482
				if ((strcmp(t->target.u.user.name,
483
			    		    XT_STANDARD_TARGET) == 0) &&
484
				    t->verdict < -NF_MAX_VERDICT - 1) {
485 486 487 488 489 490
					duprintf("mark_source_chains: bad "
						"negative verdict (%i)\n",
								t->verdict);
					return 0;
				}

L
Linus Torvalds 已提交
491 492 493
				/* Return: backtrack through the last
				   big jump. */
				do {
494
					e->comefrom ^= (1<<NF_INET_NUMHOOKS);
L
Linus Torvalds 已提交
495 496
#ifdef DEBUG_IP_FIREWALL_USER
					if (e->comefrom
497
					    & (1 << NF_INET_NUMHOOKS)) {
L
Linus Torvalds 已提交
498 499 500 501 502 503 504 505 506 507 508 509 510 511 512
						duprintf("Back unset "
							 "on hook %u "
							 "rule %u\n",
							 hook, pos);
					}
#endif
					oldpos = pos;
					pos = e->counters.pcnt;
					e->counters.pcnt = 0;

					/* We're at the start. */
					if (pos == oldpos)
						goto next;

					e = (struct ipt_entry *)
513
						(entry0 + pos);
L
Linus Torvalds 已提交
514 515 516 517 518
				} while (oldpos == pos + e->next_offset);

				/* Move along one */
				size = e->next_offset;
				e = (struct ipt_entry *)
519
					(entry0 + pos + size);
L
Linus Torvalds 已提交
520 521 522 523 524 525
				e->counters.pcnt = pos;
				pos += size;
			} else {
				int newpos = t->verdict;

				if (strcmp(t->target.u.user.name,
526
					   XT_STANDARD_TARGET) == 0 &&
527
				    newpos >= 0) {
528 529 530 531 532 533 534
					if (newpos > newinfo->size -
						sizeof(struct ipt_entry)) {
						duprintf("mark_source_chains: "
							"bad verdict (%i)\n",
								newpos);
						return 0;
					}
L
Linus Torvalds 已提交
535 536 537 538 539 540 541 542
					/* This a jump; chase it. */
					duprintf("Jump rule %u -> %u\n",
						 pos, newpos);
				} else {
					/* ... this is a fallthru */
					newpos = pos + e->next_offset;
				}
				e = (struct ipt_entry *)
543
					(entry0 + newpos);
L
Linus Torvalds 已提交
544 545 546 547 548 549 550 551 552 553
				e->counters.pcnt = pos;
				pos = newpos;
			}
		}
		next:
		duprintf("Finished chain %u\n", hook);
	}
	return 1;
}

554
static void cleanup_match(struct xt_entry_match *m, struct net *net)
L
Linus Torvalds 已提交
555
{
556 557
	struct xt_mtdtor_param par;

558
	par.net       = net;
559 560
	par.match     = m->u.kernel.match;
	par.matchinfo = m->data;
561
	par.family    = NFPROTO_IPV4;
562 563 564
	if (par.match->destroy != NULL)
		par.match->destroy(&par);
	module_put(par.match->me);
L
Linus Torvalds 已提交
565 566
}

567
static int
568
check_entry(const struct ipt_entry *e, const char *name)
569
{
570
	const struct xt_entry_target *t;
571 572

	if (!ip_checkentry(&e->ip)) {
573
		duprintf("ip check failed %p %s.\n", e, name);
574 575 576
		return -EINVAL;
	}

577
	if (e->target_offset + sizeof(struct xt_entry_target) >
578
	    e->next_offset)
579 580
		return -EINVAL;

581
	t = ipt_get_target_c(e);
582 583 584 585 586 587
	if (e->target_offset + t->u.target_size > e->next_offset)
		return -EINVAL;

	return 0;
}

588
static int
589
check_match(struct xt_entry_match *m, struct xt_mtchk_param *par)
590
{
591
	const struct ipt_ip *ip = par->entryinfo;
592 593
	int ret;

594 595 596
	par->match     = m->u.kernel.match;
	par->matchinfo = m->data;

597
	ret = xt_check_match(par, m->u.match_size - sizeof(*m),
598
	      ip->proto, ip->invflags & IPT_INV_PROTO);
599
	if (ret < 0) {
600
		duprintf("check failed for `%s'.\n", par->match->name);
601
		return ret;
602
	}
603
	return 0;
604 605
}

606
static int
607
find_check_match(struct xt_entry_match *m, struct xt_mtchk_param *par)
L
Linus Torvalds 已提交
608
{
609
	struct xt_match *match;
610
	int ret;
L
Linus Torvalds 已提交
611

612 613 614
	match = xt_request_find_match(NFPROTO_IPV4, m->u.user.name,
				      m->u.user.revision);
	if (IS_ERR(match)) {
615
		duprintf("find_check_match: `%s' not found\n", m->u.user.name);
616
		return PTR_ERR(match);
L
Linus Torvalds 已提交
617 618 619
	}
	m->u.kernel.match = match;

620
	ret = check_match(m, par);
621 622 623
	if (ret)
		goto err;

L
Linus Torvalds 已提交
624
	return 0;
625 626 627
err:
	module_put(m->u.kernel.match->me);
	return ret;
L
Linus Torvalds 已提交
628 629
}

630
static int check_target(struct ipt_entry *e, struct net *net, const char *name)
631
{
632
	struct xt_entry_target *t = ipt_get_target(e);
633
	struct xt_tgchk_param par = {
634
		.net       = net,
635 636 637 638 639
		.table     = name,
		.entryinfo = e,
		.target    = t->u.kernel.target,
		.targinfo  = t->data,
		.hook_mask = e->comefrom,
640
		.family    = NFPROTO_IPV4,
641
	};
642
	int ret;
643

644
	ret = xt_check_target(&par, t->u.target_size - sizeof(*t),
645
	      e->ip.proto, e->ip.invflags & IPT_INV_PROTO);
646
	if (ret < 0) {
647
		duprintf("check failed for `%s'.\n",
648
			 t->u.kernel.target->name);
649
		return ret;
650
	}
651
	return 0;
652
}
L
Linus Torvalds 已提交
653

654
static int
655
find_check_entry(struct ipt_entry *e, struct net *net, const char *name,
656
		 unsigned int size)
L
Linus Torvalds 已提交
657
{
658
	struct xt_entry_target *t;
659
	struct xt_target *target;
L
Linus Torvalds 已提交
660 661
	int ret;
	unsigned int j;
662
	struct xt_mtchk_param mtpar;
663
	struct xt_entry_match *ematch;
L
Linus Torvalds 已提交
664

665 666 667
	ret = check_entry(e, name);
	if (ret)
		return ret;
668

L
Linus Torvalds 已提交
669
	j = 0;
670
	mtpar.net	= net;
671 672 673
	mtpar.table     = name;
	mtpar.entryinfo = &e->ip;
	mtpar.hook_mask = e->comefrom;
674
	mtpar.family    = NFPROTO_IPV4;
675
	xt_ematch_foreach(ematch, e) {
676
		ret = find_check_match(ematch, &mtpar);
677
		if (ret != 0)
678 679
			goto cleanup_matches;
		++j;
680
	}
L
Linus Torvalds 已提交
681 682

	t = ipt_get_target(e);
683 684 685
	target = xt_request_find_target(NFPROTO_IPV4, t->u.user.name,
					t->u.user.revision);
	if (IS_ERR(target)) {
686
		duprintf("find_check_entry: `%s' not found\n", t->u.user.name);
687
		ret = PTR_ERR(target);
L
Linus Torvalds 已提交
688 689 690 691
		goto cleanup_matches;
	}
	t->u.kernel.target = target;

692
	ret = check_target(e, net, name);
693 694
	if (ret)
		goto err;
L
Linus Torvalds 已提交
695
	return 0;
696 697
 err:
	module_put(t->u.kernel.target->me);
L
Linus Torvalds 已提交
698
 cleanup_matches:
699 700
	xt_ematch_foreach(ematch, e) {
		if (j-- == 0)
701
			break;
702 703
		cleanup_match(ematch, net);
	}
L
Linus Torvalds 已提交
704 705 706
	return ret;
}

707
static bool check_underflow(const struct ipt_entry *e)
708
{
709
	const struct xt_entry_target *t;
710 711 712 713
	unsigned int verdict;

	if (!unconditional(&e->ip))
		return false;
714
	t = ipt_get_target_c(e);
715 716
	if (strcmp(t->u.user.name, XT_STANDARD_TARGET) != 0)
		return false;
717
	verdict = ((struct xt_standard_target *)t)->verdict;
718 719 720 721
	verdict = -verdict - 1;
	return verdict == NF_DROP || verdict == NF_ACCEPT;
}

722
static int
L
Linus Torvalds 已提交
723
check_entry_size_and_hooks(struct ipt_entry *e,
724
			   struct xt_table_info *newinfo,
725 726
			   const unsigned char *base,
			   const unsigned char *limit,
L
Linus Torvalds 已提交
727 728
			   const unsigned int *hook_entries,
			   const unsigned int *underflows,
729
			   unsigned int valid_hooks)
L
Linus Torvalds 已提交
730 731 732
{
	unsigned int h;

733 734
	if ((unsigned long)e % __alignof__(struct ipt_entry) != 0 ||
	    (unsigned char *)e + sizeof(struct ipt_entry) >= limit) {
L
Linus Torvalds 已提交
735 736 737 738 739
		duprintf("Bad offset %p\n", e);
		return -EINVAL;
	}

	if (e->next_offset
740
	    < sizeof(struct ipt_entry) + sizeof(struct xt_entry_target)) {
L
Linus Torvalds 已提交
741 742 743 744 745 746
		duprintf("checking: element %p size %u\n",
			 e, e->next_offset);
		return -EINVAL;
	}

	/* Check hooks & underflows */
747
	for (h = 0; h < NF_INET_NUMHOOKS; h++) {
748 749
		if (!(valid_hooks & (1 << h)))
			continue;
L
Linus Torvalds 已提交
750 751
		if ((unsigned char *)e - base == hook_entries[h])
			newinfo->hook_entry[h] = hook_entries[h];
752
		if ((unsigned char *)e - base == underflows[h]) {
753 754 755 756
			if (!check_underflow(e)) {
				pr_err("Underflows must be unconditional and "
				       "use the STANDARD target with "
				       "ACCEPT/DROP\n");
757 758
				return -EINVAL;
			}
L
Linus Torvalds 已提交
759
			newinfo->underflow[h] = underflows[h];
760
		}
L
Linus Torvalds 已提交
761 762 763
	}

	/* Clear counters and comefrom */
764
	e->counters = ((struct xt_counters) { 0, 0 });
L
Linus Torvalds 已提交
765 766 767 768
	e->comefrom = 0;
	return 0;
}

769 770
static void
cleanup_entry(struct ipt_entry *e, struct net *net)
L
Linus Torvalds 已提交
771
{
772
	struct xt_tgdtor_param par;
773
	struct xt_entry_target *t;
774
	struct xt_entry_match *ematch;
L
Linus Torvalds 已提交
775 776

	/* Cleanup all matches */
777
	xt_ematch_foreach(ematch, e)
778
		cleanup_match(ematch, net);
L
Linus Torvalds 已提交
779
	t = ipt_get_target(e);
780

781
	par.net      = net;
782 783
	par.target   = t->u.kernel.target;
	par.targinfo = t->data;
784
	par.family   = NFPROTO_IPV4;
785 786 787
	if (par.target->destroy != NULL)
		par.target->destroy(&par);
	module_put(par.target->me);
L
Linus Torvalds 已提交
788 789 790 791 792
}

/* Checks and translates the user-supplied table segment (held in
   newinfo) */
static int
793 794
translate_table(struct net *net, struct xt_table_info *newinfo, void *entry0,
                const struct ipt_replace *repl)
L
Linus Torvalds 已提交
795
{
796
	struct ipt_entry *iter;
L
Linus Torvalds 已提交
797
	unsigned int i;
798
	int ret = 0;
L
Linus Torvalds 已提交
799

800 801
	newinfo->size = repl->size;
	newinfo->number = repl->num_entries;
L
Linus Torvalds 已提交
802 803

	/* Init all hooks to impossible value. */
804
	for (i = 0; i < NF_INET_NUMHOOKS; i++) {
L
Linus Torvalds 已提交
805 806 807 808 809 810 811
		newinfo->hook_entry[i] = 0xFFFFFFFF;
		newinfo->underflow[i] = 0xFFFFFFFF;
	}

	duprintf("translate_table: size %u\n", newinfo->size);
	i = 0;
	/* Walk through entries, checking offsets. */
812 813
	xt_entry_foreach(iter, entry0, newinfo->size) {
		ret = check_entry_size_and_hooks(iter, newinfo, entry0,
814 815 816 817
						 entry0 + repl->size,
						 repl->hook_entry,
						 repl->underflow,
						 repl->valid_hooks);
818
		if (ret != 0)
819 820
			return ret;
		++i;
821 822 823
		if (strcmp(ipt_get_target(iter)->u.user.name,
		    XT_ERROR_TARGET) == 0)
			++newinfo->stacksize;
824
	}
L
Linus Torvalds 已提交
825

826
	if (i != repl->num_entries) {
L
Linus Torvalds 已提交
827
		duprintf("translate_table: %u not %u entries\n",
828
			 i, repl->num_entries);
L
Linus Torvalds 已提交
829 830 831 832
		return -EINVAL;
	}

	/* Check hooks all assigned */
833
	for (i = 0; i < NF_INET_NUMHOOKS; i++) {
L
Linus Torvalds 已提交
834
		/* Only hooks which are valid */
835
		if (!(repl->valid_hooks & (1 << i)))
L
Linus Torvalds 已提交
836 837 838
			continue;
		if (newinfo->hook_entry[i] == 0xFFFFFFFF) {
			duprintf("Invalid hook entry %u %u\n",
839
				 i, repl->hook_entry[i]);
L
Linus Torvalds 已提交
840 841 842 843
			return -EINVAL;
		}
		if (newinfo->underflow[i] == 0xFFFFFFFF) {
			duprintf("Invalid underflow %u %u\n",
844
				 i, repl->underflow[i]);
L
Linus Torvalds 已提交
845 846 847 848
			return -EINVAL;
		}
	}

849
	if (!mark_source_chains(newinfo, repl->valid_hooks, entry0))
850 851
		return -ELOOP;

L
Linus Torvalds 已提交
852 853
	/* Finally, each sanity check must pass */
	i = 0;
854
	xt_entry_foreach(iter, entry0, newinfo->size) {
855
		ret = find_check_entry(iter, net, repl->name, repl->size);
856 857
		if (ret != 0)
			break;
858
		++i;
859
	}
L
Linus Torvalds 已提交
860

861
	if (ret != 0) {
862 863
		xt_entry_foreach(iter, entry0, newinfo->size) {
			if (i-- == 0)
864
				break;
865 866
			cleanup_entry(iter, net);
		}
867 868
		return ret;
	}
L
Linus Torvalds 已提交
869 870

	/* And one copy for every other CPU */
871
	for_each_possible_cpu(i) {
872 873
		if (newinfo->entries[i] && newinfo->entries[i] != entry0)
			memcpy(newinfo->entries[i], entry0, newinfo->size);
L
Linus Torvalds 已提交
874 875 876 877 878 879
	}

	return ret;
}

static void
880 881
get_counters(const struct xt_table_info *t,
	     struct xt_counters counters[])
L
Linus Torvalds 已提交
882
{
883
	struct ipt_entry *iter;
L
Linus Torvalds 已提交
884 885 886
	unsigned int cpu;
	unsigned int i;

887
	for_each_possible_cpu(cpu) {
888
		seqcount_t *s = &per_cpu(xt_recseq, cpu);
889

L
Linus Torvalds 已提交
890
		i = 0;
891
		xt_entry_foreach(iter, t->entries[cpu], t->size) {
892 893 894 895
			u64 bcnt, pcnt;
			unsigned int start;

			do {
896
				start = read_seqcount_begin(s);
897 898
				bcnt = iter->counters.bcnt;
				pcnt = iter->counters.pcnt;
899
			} while (read_seqcount_retry(s, start));
900 901

			ADD_COUNTER(counters[i], bcnt, pcnt);
902 903
			++i; /* macro does multi eval of i */
		}
L
Linus Torvalds 已提交
904
	}
905 906
}

907
static struct xt_counters *alloc_counters(const struct xt_table *table)
L
Linus Torvalds 已提交
908
{
909
	unsigned int countersize;
910
	struct xt_counters *counters;
911
	const struct xt_table_info *private = table->private;
L
Linus Torvalds 已提交
912 913 914 915

	/* We need atomic snapshot of counters: rest doesn't change
	   (other than comefrom, which userspace doesn't care
	   about). */
916
	countersize = sizeof(struct xt_counters) * private->number;
917
	counters = vzalloc(countersize);
L
Linus Torvalds 已提交
918 919

	if (counters == NULL)
920
		return ERR_PTR(-ENOMEM);
921

922
	get_counters(private, counters);
L
Linus Torvalds 已提交
923

924 925 926 927 928
	return counters;
}

static int
copy_entries_to_user(unsigned int total_size,
929
		     const struct xt_table *table,
930 931 932
		     void __user *userptr)
{
	unsigned int off, num;
933
	const struct ipt_entry *e;
934
	struct xt_counters *counters;
935
	const struct xt_table_info *private = table->private;
936
	int ret = 0;
937
	const void *loc_cpu_entry;
938 939 940 941 942

	counters = alloc_counters(table);
	if (IS_ERR(counters))
		return PTR_ERR(counters);

943 944 945 946
	/* choose the copy that is on our node/cpu, ...
	 * This choice is lazy (because current thread is
	 * allowed to migrate to another cpu)
	 */
947
	loc_cpu_entry = private->entries[raw_smp_processor_id()];
948
	if (copy_to_user(userptr, loc_cpu_entry, total_size) != 0) {
L
Linus Torvalds 已提交
949 950 951 952 953 954 955 956
		ret = -EFAULT;
		goto free_counters;
	}

	/* FIXME: use iterator macros --RR */
	/* ... then go back and fix counters and names */
	for (off = 0, num = 0; off < total_size; off += e->next_offset, num++){
		unsigned int i;
957 958
		const struct xt_entry_match *m;
		const struct xt_entry_target *t;
L
Linus Torvalds 已提交
959

960
		e = (struct ipt_entry *)(loc_cpu_entry + off);
L
Linus Torvalds 已提交
961 962 963 964 965 966 967 968 969 970 971 972 973 974
		if (copy_to_user(userptr + off
				 + offsetof(struct ipt_entry, counters),
				 &counters[num],
				 sizeof(counters[num])) != 0) {
			ret = -EFAULT;
			goto free_counters;
		}

		for (i = sizeof(struct ipt_entry);
		     i < e->target_offset;
		     i += m->u.match_size) {
			m = (void *)e + i;

			if (copy_to_user(userptr + off + i
975
					 + offsetof(struct xt_entry_match,
L
Linus Torvalds 已提交
976 977 978 979 980 981 982 983 984
						    u.user.name),
					 m->u.kernel.match->name,
					 strlen(m->u.kernel.match->name)+1)
			    != 0) {
				ret = -EFAULT;
				goto free_counters;
			}
		}

985
		t = ipt_get_target_c(e);
L
Linus Torvalds 已提交
986
		if (copy_to_user(userptr + off + e->target_offset
987
				 + offsetof(struct xt_entry_target,
L
Linus Torvalds 已提交
988 989 990 991 992 993 994 995 996 997 998 999 1000
					    u.user.name),
				 t->u.kernel.target->name,
				 strlen(t->u.kernel.target->name)+1) != 0) {
			ret = -EFAULT;
			goto free_counters;
		}
	}

 free_counters:
	vfree(counters);
	return ret;
}

1001
#ifdef CONFIG_COMPAT
1002
static void compat_standard_from_user(void *dst, const void *src)
1003
{
1004
	int v = *(compat_int_t *)src;
1005

1006
	if (v > 0)
1007
		v += xt_compat_calc_jump(AF_INET, v);
1008 1009
	memcpy(dst, &v, sizeof(v));
}
1010

1011
static int compat_standard_to_user(void __user *dst, const void *src)
1012
{
1013
	compat_int_t cv = *(int *)src;
1014

1015
	if (cv > 0)
1016
		cv -= xt_compat_calc_jump(AF_INET, cv);
1017
	return copy_to_user(dst, &cv, sizeof(cv)) ? -EFAULT : 0;
1018 1019
}

1020
static int compat_calc_entry(const struct ipt_entry *e,
1021
			     const struct xt_table_info *info,
1022
			     const void *base, struct xt_table_info *newinfo)
1023
{
1024
	const struct xt_entry_match *ematch;
1025
	const struct xt_entry_target *t;
1026
	unsigned int entry_offset;
1027 1028
	int off, i, ret;

1029
	off = sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);
1030
	entry_offset = (void *)e - base;
1031
	xt_ematch_foreach(ematch, e)
1032
		off += xt_compat_match_offset(ematch->u.kernel.match);
1033
	t = ipt_get_target_c(e);
1034
	off += xt_compat_target_offset(t->u.kernel.target);
1035
	newinfo->size -= off;
1036
	ret = xt_compat_add_offset(AF_INET, entry_offset, off);
1037 1038 1039
	if (ret)
		return ret;

1040
	for (i = 0; i < NF_INET_NUMHOOKS; i++) {
1041 1042
		if (info->hook_entry[i] &&
		    (e < (struct ipt_entry *)(base + info->hook_entry[i])))
1043
			newinfo->hook_entry[i] -= off;
1044 1045
		if (info->underflow[i] &&
		    (e < (struct ipt_entry *)(base + info->underflow[i])))
1046 1047 1048 1049 1050
			newinfo->underflow[i] -= off;
	}
	return 0;
}

1051
static int compat_table_info(const struct xt_table_info *info,
1052
			     struct xt_table_info *newinfo)
1053
{
1054
	struct ipt_entry *iter;
1055
	void *loc_cpu_entry;
1056
	int ret;
1057 1058 1059 1060

	if (!newinfo || !info)
		return -EINVAL;

1061 1062 1063
	/* we dont care about newinfo->entries[] */
	memcpy(newinfo, info, offsetof(struct xt_table_info, entries));
	newinfo->initial_entries = 0;
1064
	loc_cpu_entry = info->entries[raw_smp_processor_id()];
1065
	xt_compat_init_offsets(AF_INET, info->number);
1066 1067 1068
	xt_entry_foreach(iter, loc_cpu_entry, info->size) {
		ret = compat_calc_entry(iter, info, loc_cpu_entry, newinfo);
		if (ret != 0)
1069
			return ret;
1070
	}
1071
	return 0;
1072 1073 1074
}
#endif

1075 1076
static int get_info(struct net *net, void __user *user,
                    const int *len, int compat)
1077
{
1078
	char name[XT_TABLE_MAXNAMELEN];
1079
	struct xt_table *t;
1080 1081 1082
	int ret;

	if (*len != sizeof(struct ipt_getinfo)) {
1083 1084
		duprintf("length %u != %zu\n", *len,
			 sizeof(struct ipt_getinfo));
1085 1086 1087 1088 1089 1090
		return -EINVAL;
	}

	if (copy_from_user(name, user, sizeof(name)) != 0)
		return -EFAULT;

1091
	name[XT_TABLE_MAXNAMELEN-1] = '\0';
1092 1093 1094 1095
#ifdef CONFIG_COMPAT
	if (compat)
		xt_compat_lock(AF_INET);
#endif
1096
	t = try_then_request_module(xt_find_table_lock(net, AF_INET, name),
1097
				    "iptable_%s", name);
1098
	if (!IS_ERR_OR_NULL(t)) {
1099
		struct ipt_getinfo info;
1100
		const struct xt_table_info *private = t->private;
1101
#ifdef CONFIG_COMPAT
1102 1103
		struct xt_table_info tmp;

1104 1105
		if (compat) {
			ret = compat_table_info(private, &tmp);
1106
			xt_compat_flush_offsets(AF_INET);
1107
			private = &tmp;
1108 1109
		}
#endif
1110
		memset(&info, 0, sizeof(info));
1111 1112
		info.valid_hooks = t->valid_hooks;
		memcpy(info.hook_entry, private->hook_entry,
1113
		       sizeof(info.hook_entry));
1114
		memcpy(info.underflow, private->underflow,
1115
		       sizeof(info.underflow));
1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136
		info.num_entries = private->number;
		info.size = private->size;
		strcpy(info.name, name);

		if (copy_to_user(user, &info, *len) != 0)
			ret = -EFAULT;
		else
			ret = 0;

		xt_table_unlock(t);
		module_put(t->me);
	} else
		ret = t ? PTR_ERR(t) : -ENOENT;
#ifdef CONFIG_COMPAT
	if (compat)
		xt_compat_unlock(AF_INET);
#endif
	return ret;
}

static int
1137 1138
get_entries(struct net *net, struct ipt_get_entries __user *uptr,
	    const int *len)
1139 1140 1141
{
	int ret;
	struct ipt_get_entries get;
1142
	struct xt_table *t;
1143 1144

	if (*len < sizeof(get)) {
1145
		duprintf("get_entries: %u < %zu\n", *len, sizeof(get));
1146 1147 1148 1149 1150
		return -EINVAL;
	}
	if (copy_from_user(&get, uptr, sizeof(get)) != 0)
		return -EFAULT;
	if (*len != sizeof(struct ipt_get_entries) + get.size) {
1151 1152
		duprintf("get_entries: %u != %zu\n",
			 *len, sizeof(get) + get.size);
1153 1154 1155
		return -EINVAL;
	}

1156
	t = xt_find_table_lock(net, AF_INET, get.name);
1157
	if (!IS_ERR_OR_NULL(t)) {
1158
		const struct xt_table_info *private = t->private;
1159
		duprintf("t->private->number = %u\n", private->number);
1160 1161 1162 1163 1164
		if (get.size == private->size)
			ret = copy_entries_to_user(private->size,
						   t, uptr->entrytable);
		else {
			duprintf("get_entries: I've got %u not %u!\n",
1165
				 private->size, get.size);
1166
			ret = -EAGAIN;
1167 1168 1169 1170 1171 1172 1173 1174 1175 1176
		}
		module_put(t->me);
		xt_table_unlock(t);
	} else
		ret = t ? PTR_ERR(t) : -ENOENT;

	return ret;
}

static int
1177
__do_replace(struct net *net, const char *name, unsigned int valid_hooks,
1178 1179
	     struct xt_table_info *newinfo, unsigned int num_counters,
	     void __user *counters_ptr)
1180 1181
{
	int ret;
1182
	struct xt_table *t;
1183 1184 1185
	struct xt_table_info *oldinfo;
	struct xt_counters *counters;
	void *loc_cpu_old_entry;
1186
	struct ipt_entry *iter;
1187 1188

	ret = 0;
1189
	counters = vzalloc(num_counters * sizeof(struct xt_counters));
1190 1191 1192 1193 1194
	if (!counters) {
		ret = -ENOMEM;
		goto out;
	}

1195
	t = try_then_request_module(xt_find_table_lock(net, AF_INET, name),
1196
				    "iptable_%s", name);
1197
	if (IS_ERR_OR_NULL(t)) {
1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223
		ret = t ? PTR_ERR(t) : -ENOENT;
		goto free_newinfo_counters_untrans;
	}

	/* You lied! */
	if (valid_hooks != t->valid_hooks) {
		duprintf("Valid hook crap: %08X vs %08X\n",
			 valid_hooks, t->valid_hooks);
		ret = -EINVAL;
		goto put_module;
	}

	oldinfo = xt_replace_table(t, num_counters, newinfo, &ret);
	if (!oldinfo)
		goto put_module;

	/* Update module usage count based on number of rules */
	duprintf("do_replace: oldnum=%u, initnum=%u, newnum=%u\n",
		oldinfo->number, oldinfo->initial_entries, newinfo->number);
	if ((oldinfo->number > oldinfo->initial_entries) ||
	    (newinfo->number <= oldinfo->initial_entries))
		module_put(t->me);
	if ((oldinfo->number > oldinfo->initial_entries) &&
	    (newinfo->number <= oldinfo->initial_entries))
		module_put(t->me);

1224
	/* Get the old counters, and synchronize with replace */
1225
	get_counters(oldinfo, counters);
1226

1227 1228
	/* Decrease module usage counts and free resource */
	loc_cpu_old_entry = oldinfo->entries[raw_smp_processor_id()];
1229
	xt_entry_foreach(iter, loc_cpu_old_entry, oldinfo->size)
1230
		cleanup_entry(iter, net);
1231

1232 1233
	xt_free_table_info(oldinfo);
	if (copy_to_user(counters_ptr, counters,
1234 1235 1236 1237
			 sizeof(struct xt_counters) * num_counters) != 0) {
		/* Silent error, can't fail, new table is already in place */
		net_warn_ratelimited("iptables: counters copy to user failed while replacing table\n");
	}
1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251
	vfree(counters);
	xt_table_unlock(t);
	return ret;

 put_module:
	module_put(t->me);
	xt_table_unlock(t);
 free_newinfo_counters_untrans:
	vfree(counters);
 out:
	return ret;
}

static int
1252
do_replace(struct net *net, const void __user *user, unsigned int len)
1253 1254 1255 1256 1257
{
	int ret;
	struct ipt_replace tmp;
	struct xt_table_info *newinfo;
	void *loc_cpu_entry;
1258
	struct ipt_entry *iter;
1259 1260 1261 1262 1263 1264 1265

	if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
		return -EFAULT;

	/* overflow check */
	if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))
		return -ENOMEM;
1266
	tmp.name[sizeof(tmp.name)-1] = 0;
1267 1268 1269 1270 1271

	newinfo = xt_alloc_table_info(tmp.size);
	if (!newinfo)
		return -ENOMEM;

1272
	/* choose the copy that is on our node/cpu */
1273 1274 1275 1276 1277 1278 1279
	loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
	if (copy_from_user(loc_cpu_entry, user + sizeof(tmp),
			   tmp.size) != 0) {
		ret = -EFAULT;
		goto free_newinfo;
	}

1280
	ret = translate_table(net, newinfo, loc_cpu_entry, &tmp);
1281 1282 1283
	if (ret != 0)
		goto free_newinfo;

1284
	duprintf("Translated table\n");
1285

1286
	ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,
1287
			   tmp.num_counters, tmp.counters);
1288 1289 1290 1291 1292
	if (ret)
		goto free_newinfo_untrans;
	return 0;

 free_newinfo_untrans:
1293
	xt_entry_foreach(iter, loc_cpu_entry, newinfo->size)
1294
		cleanup_entry(iter, net);
1295 1296 1297 1298 1299 1300
 free_newinfo:
	xt_free_table_info(newinfo);
	return ret;
}

static int
1301 1302
do_add_counters(struct net *net, const void __user *user,
                unsigned int len, int compat)
1303
{
1304
	unsigned int i, curcpu;
1305 1306 1307
	struct xt_counters_info tmp;
	struct xt_counters *paddc;
	unsigned int num_counters;
1308
	const char *name;
1309 1310
	int size;
	void *ptmp;
1311
	struct xt_table *t;
1312
	const struct xt_table_info *private;
1313 1314
	int ret = 0;
	void *loc_cpu_entry;
1315
	struct ipt_entry *iter;
1316
	unsigned int addend;
1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346
#ifdef CONFIG_COMPAT
	struct compat_xt_counters_info compat_tmp;

	if (compat) {
		ptmp = &compat_tmp;
		size = sizeof(struct compat_xt_counters_info);
	} else
#endif
	{
		ptmp = &tmp;
		size = sizeof(struct xt_counters_info);
	}

	if (copy_from_user(ptmp, user, size) != 0)
		return -EFAULT;

#ifdef CONFIG_COMPAT
	if (compat) {
		num_counters = compat_tmp.num_counters;
		name = compat_tmp.name;
	} else
#endif
	{
		num_counters = tmp.num_counters;
		name = tmp.name;
	}

	if (len != size + num_counters * sizeof(struct xt_counters))
		return -EINVAL;

E
Eric Dumazet 已提交
1347
	paddc = vmalloc(len - size);
1348 1349 1350 1351 1352 1353 1354 1355
	if (!paddc)
		return -ENOMEM;

	if (copy_from_user(paddc, user + size, len - size) != 0) {
		ret = -EFAULT;
		goto free;
	}

1356
	t = xt_find_table_lock(net, AF_INET, name);
1357
	if (IS_ERR_OR_NULL(t)) {
1358 1359 1360 1361
		ret = t ? PTR_ERR(t) : -ENOENT;
		goto free;
	}

1362
	local_bh_disable();
1363 1364 1365 1366 1367 1368 1369 1370
	private = t->private;
	if (private->number != num_counters) {
		ret = -EINVAL;
		goto unlock_up_free;
	}

	i = 0;
	/* Choose the copy that is on our node */
1371 1372
	curcpu = smp_processor_id();
	loc_cpu_entry = private->entries[curcpu];
1373
	addend = xt_write_recseq_begin();
1374 1375 1376 1377
	xt_entry_foreach(iter, loc_cpu_entry, private->size) {
		ADD_COUNTER(iter->counters, paddc[i].bcnt, paddc[i].pcnt);
		++i;
	}
1378
	xt_write_recseq_end(addend);
1379
 unlock_up_free:
1380
	local_bh_enable();
1381 1382 1383 1384 1385 1386 1387 1388 1389 1390
	xt_table_unlock(t);
	module_put(t->me);
 free:
	vfree(paddc);

	return ret;
}

#ifdef CONFIG_COMPAT
struct compat_ipt_replace {
1391
	char			name[XT_TABLE_MAXNAMELEN];
1392 1393 1394
	u32			valid_hooks;
	u32			num_entries;
	u32			size;
1395 1396
	u32			hook_entry[NF_INET_NUMHOOKS];
	u32			underflow[NF_INET_NUMHOOKS];
1397
	u32			num_counters;
1398
	compat_uptr_t		counters;	/* struct xt_counters * */
1399 1400 1401
	struct compat_ipt_entry	entries[0];
};

1402 1403
static int
compat_copy_entry_to_user(struct ipt_entry *e, void __user **dstptr,
1404
			  unsigned int *size, struct xt_counters *counters,
1405
			  unsigned int i)
1406
{
1407
	struct xt_entry_target *t;
1408 1409 1410
	struct compat_ipt_entry __user *ce;
	u_int16_t target_offset, next_offset;
	compat_uint_t origsize;
1411 1412
	const struct xt_entry_match *ematch;
	int ret = 0;
1413 1414 1415

	origsize = *size;
	ce = (struct compat_ipt_entry __user *)*dstptr;
1416 1417 1418 1419
	if (copy_to_user(ce, e, sizeof(struct ipt_entry)) != 0 ||
	    copy_to_user(&ce->counters, &counters[i],
	    sizeof(counters[i])) != 0)
		return -EFAULT;
1420

1421
	*dstptr += sizeof(struct compat_ipt_entry);
1422 1423
	*size -= sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);

1424 1425 1426
	xt_ematch_foreach(ematch, e) {
		ret = xt_compat_match_to_user(ematch, dstptr, size);
		if (ret != 0)
1427
			return ret;
1428
	}
1429 1430
	target_offset = e->target_offset - (origsize - *size);
	t = ipt_get_target(e);
1431
	ret = xt_compat_target_to_user(t, dstptr, size);
1432
	if (ret)
1433
		return ret;
1434
	next_offset = e->next_offset - (origsize - *size);
1435 1436 1437
	if (put_user(target_offset, &ce->target_offset) != 0 ||
	    put_user(next_offset, &ce->next_offset) != 0)
		return -EFAULT;
1438 1439 1440
	return 0;
}

1441
static int
1442
compat_find_calc_match(struct xt_entry_match *m,
1443 1444 1445
		       const char *name,
		       const struct ipt_ip *ip,
		       unsigned int hookmask,
1446
		       int *size)
1447
{
1448
	struct xt_match *match;
1449

1450 1451 1452
	match = xt_request_find_match(NFPROTO_IPV4, m->u.user.name,
				      m->u.user.revision);
	if (IS_ERR(match)) {
1453
		duprintf("compat_check_calc_match: `%s' not found\n",
1454
			 m->u.user.name);
1455
		return PTR_ERR(match);
1456 1457
	}
	m->u.kernel.match = match;
1458
	*size += xt_compat_match_offset(match);
1459 1460 1461
	return 0;
}

1462
static void compat_release_entry(struct compat_ipt_entry *e)
1463
{
1464
	struct xt_entry_target *t;
1465
	struct xt_entry_match *ematch;
1466 1467

	/* Cleanup all matches */
1468
	xt_ematch_foreach(ematch, e)
1469
		module_put(ematch->u.kernel.match->me);
1470
	t = compat_ipt_get_target(e);
1471 1472 1473
	module_put(t->u.kernel.target->me);
}

1474
static int
1475
check_compat_entry_size_and_hooks(struct compat_ipt_entry *e,
1476 1477
				  struct xt_table_info *newinfo,
				  unsigned int *size,
1478 1479 1480 1481
				  const unsigned char *base,
				  const unsigned char *limit,
				  const unsigned int *hook_entries,
				  const unsigned int *underflows,
1482
				  const char *name)
1483
{
1484
	struct xt_entry_match *ematch;
1485
	struct xt_entry_target *t;
1486
	struct xt_target *target;
1487
	unsigned int entry_offset;
1488 1489
	unsigned int j;
	int ret, off, h;
1490 1491

	duprintf("check_compat_entry_size_and_hooks %p\n", e);
1492 1493
	if ((unsigned long)e % __alignof__(struct compat_ipt_entry) != 0 ||
	    (unsigned char *)e + sizeof(struct compat_ipt_entry) >= limit) {
1494 1495 1496 1497 1498
		duprintf("Bad offset %p, limit = %p\n", e, limit);
		return -EINVAL;
	}

	if (e->next_offset < sizeof(struct compat_ipt_entry) +
1499
			     sizeof(struct compat_xt_entry_target)) {
1500 1501 1502 1503 1504
		duprintf("checking: element %p size %u\n",
			 e, e->next_offset);
		return -EINVAL;
	}

1505 1506
	/* For purposes of check_entry casting the compat entry is fine */
	ret = check_entry((struct ipt_entry *)e, name);
1507 1508
	if (ret)
		return ret;
1509

1510
	off = sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);
1511 1512
	entry_offset = (void *)e - (void *)base;
	j = 0;
1513 1514
	xt_ematch_foreach(ematch, e) {
		ret = compat_find_calc_match(ematch, name,
1515
					     &e->ip, e->comefrom, &off);
1516
		if (ret != 0)
1517 1518
			goto release_matches;
		++j;
1519
	}
1520

1521
	t = compat_ipt_get_target(e);
1522 1523 1524
	target = xt_request_find_target(NFPROTO_IPV4, t->u.user.name,
					t->u.user.revision);
	if (IS_ERR(target)) {
1525
		duprintf("check_compat_entry_size_and_hooks: `%s' not found\n",
1526
			 t->u.user.name);
1527
		ret = PTR_ERR(target);
1528
		goto release_matches;
1529 1530 1531
	}
	t->u.kernel.target = target;

1532
	off += xt_compat_target_offset(target);
1533
	*size += off;
1534
	ret = xt_compat_add_offset(AF_INET, entry_offset, off);
1535 1536 1537 1538
	if (ret)
		goto out;

	/* Check hooks & underflows */
1539
	for (h = 0; h < NF_INET_NUMHOOKS; h++) {
1540 1541 1542 1543 1544 1545 1546
		if ((unsigned char *)e - base == hook_entries[h])
			newinfo->hook_entry[h] = hook_entries[h];
		if ((unsigned char *)e - base == underflows[h])
			newinfo->underflow[h] = underflows[h];
	}

	/* Clear counters and comefrom */
1547
	memset(&e->counters, 0, sizeof(e->counters));
1548 1549
	e->comefrom = 0;
	return 0;
1550

1551
out:
1552
	module_put(t->u.kernel.target->me);
1553
release_matches:
1554 1555
	xt_ematch_foreach(ematch, e) {
		if (j-- == 0)
1556
			break;
1557 1558
		module_put(ematch->u.kernel.match->me);
	}
1559 1560 1561
	return ret;
}

1562
static int
1563
compat_copy_entry_from_user(struct compat_ipt_entry *e, void **dstptr,
1564 1565
			    unsigned int *size, const char *name,
			    struct xt_table_info *newinfo, unsigned char *base)
1566
{
1567
	struct xt_entry_target *t;
1568
	struct xt_target *target;
1569 1570
	struct ipt_entry *de;
	unsigned int origsize;
1571
	int ret, h;
1572
	struct xt_entry_match *ematch;
1573 1574 1575 1576 1577

	ret = 0;
	origsize = *size;
	de = (struct ipt_entry *)*dstptr;
	memcpy(de, e, sizeof(struct ipt_entry));
1578
	memcpy(&de->counters, &e->counters, sizeof(e->counters));
1579

1580
	*dstptr += sizeof(struct ipt_entry);
1581 1582
	*size += sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);

1583 1584 1585
	xt_ematch_foreach(ematch, e) {
		ret = xt_compat_match_from_user(ematch, dstptr, size);
		if (ret != 0)
1586
			return ret;
1587
	}
1588
	de->target_offset = e->target_offset - (origsize - *size);
1589
	t = compat_ipt_get_target(e);
1590
	target = t->u.kernel.target;
1591
	xt_compat_target_from_user(t, dstptr, size);
1592 1593

	de->next_offset = e->next_offset - (origsize - *size);
1594
	for (h = 0; h < NF_INET_NUMHOOKS; h++) {
1595 1596 1597 1598 1599
		if ((unsigned char *)de - base < newinfo->hook_entry[h])
			newinfo->hook_entry[h] -= origsize - *size;
		if ((unsigned char *)de - base < newinfo->underflow[h])
			newinfo->underflow[h] -= origsize - *size;
	}
1600 1601 1602
	return ret;
}

1603
static int
1604
compat_check_entry(struct ipt_entry *e, struct net *net, const char *name)
1605
{
1606
	struct xt_entry_match *ematch;
1607
	struct xt_mtchk_param mtpar;
1608
	unsigned int j;
1609
	int ret = 0;
1610

1611
	j = 0;
1612
	mtpar.net	= net;
1613 1614 1615
	mtpar.table     = name;
	mtpar.entryinfo = &e->ip;
	mtpar.hook_mask = e->comefrom;
1616
	mtpar.family    = NFPROTO_IPV4;
1617
	xt_ematch_foreach(ematch, e) {
1618
		ret = check_match(ematch, &mtpar);
1619
		if (ret != 0)
1620 1621
			goto cleanup_matches;
		++j;
1622
	}
1623

1624
	ret = check_target(e, net, name);
1625 1626 1627 1628 1629
	if (ret)
		goto cleanup_matches;
	return 0;

 cleanup_matches:
1630 1631
	xt_ematch_foreach(ematch, e) {
		if (j-- == 0)
1632
			break;
1633 1634
		cleanup_match(ematch, net);
	}
1635
	return ret;
1636 1637
}

L
Linus Torvalds 已提交
1638
static int
1639 1640
translate_compat_table(struct net *net,
		       const char *name,
1641 1642 1643 1644 1645 1646 1647
		       unsigned int valid_hooks,
		       struct xt_table_info **pinfo,
		       void **pentry0,
		       unsigned int total_size,
		       unsigned int number,
		       unsigned int *hook_entries,
		       unsigned int *underflows)
L
Linus Torvalds 已提交
1648
{
1649
	unsigned int i, j;
1650 1651
	struct xt_table_info *newinfo, *info;
	void *pos, *entry0, *entry1;
1652 1653
	struct compat_ipt_entry *iter0;
	struct ipt_entry *iter1;
1654
	unsigned int size;
1655
	int ret;
L
Linus Torvalds 已提交
1656

1657 1658 1659 1660 1661 1662
	info = *pinfo;
	entry0 = *pentry0;
	size = total_size;
	info->number = number;

	/* Init all hooks to impossible value. */
1663
	for (i = 0; i < NF_INET_NUMHOOKS; i++) {
1664 1665 1666 1667 1668
		info->hook_entry[i] = 0xFFFFFFFF;
		info->underflow[i] = 0xFFFFFFFF;
	}

	duprintf("translate_compat_table: size %u\n", info->size);
1669
	j = 0;
1670
	xt_compat_lock(AF_INET);
1671
	xt_compat_init_offsets(AF_INET, number);
1672
	/* Walk through entries, checking offsets. */
1673 1674
	xt_entry_foreach(iter0, entry0, total_size) {
		ret = check_compat_entry_size_and_hooks(iter0, info, &size,
1675 1676 1677 1678 1679
							entry0,
							entry0 + total_size,
							hook_entries,
							underflows,
							name);
1680
		if (ret != 0)
1681 1682
			goto out_unlock;
		++j;
1683
	}
1684 1685

	ret = -EINVAL;
1686
	if (j != number) {
1687
		duprintf("translate_compat_table: %u not %u entries\n",
1688
			 j, number);
1689 1690 1691 1692
		goto out_unlock;
	}

	/* Check hooks all assigned */
1693
	for (i = 0; i < NF_INET_NUMHOOKS; i++) {
1694 1695 1696 1697 1698 1699 1700
		/* Only hooks which are valid */
		if (!(valid_hooks & (1 << i)))
			continue;
		if (info->hook_entry[i] == 0xFFFFFFFF) {
			duprintf("Invalid hook entry %u %u\n",
				 i, hook_entries[i]);
			goto out_unlock;
L
Linus Torvalds 已提交
1701
		}
1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714
		if (info->underflow[i] == 0xFFFFFFFF) {
			duprintf("Invalid underflow %u %u\n",
				 i, underflows[i]);
			goto out_unlock;
		}
	}

	ret = -ENOMEM;
	newinfo = xt_alloc_table_info(size);
	if (!newinfo)
		goto out_unlock;

	newinfo->number = number;
1715
	for (i = 0; i < NF_INET_NUMHOOKS; i++) {
1716 1717 1718 1719 1720
		newinfo->hook_entry[i] = info->hook_entry[i];
		newinfo->underflow[i] = info->underflow[i];
	}
	entry1 = newinfo->entries[raw_smp_processor_id()];
	pos = entry1;
1721
	size = total_size;
1722
	xt_entry_foreach(iter0, entry0, total_size) {
1723 1724
		ret = compat_copy_entry_from_user(iter0, &pos, &size,
						  name, newinfo, entry1);
1725 1726 1727
		if (ret != 0)
			break;
	}
1728
	xt_compat_flush_offsets(AF_INET);
1729 1730 1731 1732 1733 1734 1735 1736
	xt_compat_unlock(AF_INET);
	if (ret)
		goto free_newinfo;

	ret = -ELOOP;
	if (!mark_source_chains(newinfo, valid_hooks, entry1))
		goto free_newinfo;

1737
	i = 0;
1738
	xt_entry_foreach(iter1, entry1, newinfo->size) {
1739
		ret = compat_check_entry(iter1, net, name);
1740 1741
		if (ret != 0)
			break;
1742
		++i;
1743 1744 1745
		if (strcmp(ipt_get_target(iter1)->u.user.name,
		    XT_ERROR_TARGET) == 0)
			++newinfo->stacksize;
1746
	}
1747
	if (ret) {
1748 1749 1750 1751 1752 1753
		/*
		 * The first i matches need cleanup_entry (calls ->destroy)
		 * because they had called ->check already. The other j-i
		 * entries need only release.
		 */
		int skip = i;
1754
		j -= i;
1755 1756 1757
		xt_entry_foreach(iter0, entry0, newinfo->size) {
			if (skip-- > 0)
				continue;
1758
			if (j-- == 0)
1759
				break;
1760
			compat_release_entry(iter0);
1761
		}
1762 1763
		xt_entry_foreach(iter1, entry1, newinfo->size) {
			if (i-- == 0)
1764
				break;
1765 1766
			cleanup_entry(iter1, net);
		}
1767 1768 1769
		xt_free_table_info(newinfo);
		return ret;
	}
1770

1771
	/* And one copy for every other CPU */
A
Andrew Morton 已提交
1772
	for_each_possible_cpu(i)
1773 1774 1775 1776 1777 1778 1779
		if (newinfo->entries[i] && newinfo->entries[i] != entry1)
			memcpy(newinfo->entries[i], entry1, newinfo->size);

	*pinfo = newinfo;
	*pentry0 = entry1;
	xt_free_table_info(info);
	return 0;
L
Linus Torvalds 已提交
1780

1781 1782 1783
free_newinfo:
	xt_free_table_info(newinfo);
out:
1784 1785
	xt_entry_foreach(iter0, entry0, total_size) {
		if (j-- == 0)
1786
			break;
1787 1788
		compat_release_entry(iter0);
	}
L
Linus Torvalds 已提交
1789
	return ret;
1790
out_unlock:
1791
	xt_compat_flush_offsets(AF_INET);
1792 1793
	xt_compat_unlock(AF_INET);
	goto out;
L
Linus Torvalds 已提交
1794 1795 1796
}

static int
1797
compat_do_replace(struct net *net, void __user *user, unsigned int len)
L
Linus Torvalds 已提交
1798 1799
{
	int ret;
1800 1801 1802
	struct compat_ipt_replace tmp;
	struct xt_table_info *newinfo;
	void *loc_cpu_entry;
1803
	struct ipt_entry *iter;
L
Linus Torvalds 已提交
1804 1805 1806 1807

	if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
		return -EFAULT;

1808
	/* overflow check */
1809
	if (tmp.size >= INT_MAX / num_possible_cpus())
1810 1811 1812
		return -ENOMEM;
	if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))
		return -ENOMEM;
1813
	tmp.name[sizeof(tmp.name)-1] = 0;
1814

1815
	newinfo = xt_alloc_table_info(tmp.size);
L
Linus Torvalds 已提交
1816 1817 1818
	if (!newinfo)
		return -ENOMEM;

1819
	/* choose the copy that is on our node/cpu */
1820 1821
	loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
	if (copy_from_user(loc_cpu_entry, user + sizeof(tmp),
L
Linus Torvalds 已提交
1822 1823 1824 1825 1826
			   tmp.size) != 0) {
		ret = -EFAULT;
		goto free_newinfo;
	}

1827
	ret = translate_compat_table(net, tmp.name, tmp.valid_hooks,
1828 1829 1830
				     &newinfo, &loc_cpu_entry, tmp.size,
				     tmp.num_entries, tmp.hook_entry,
				     tmp.underflow);
1831
	if (ret != 0)
L
Linus Torvalds 已提交
1832 1833
		goto free_newinfo;

1834
	duprintf("compat_do_replace: Translated table\n");
L
Linus Torvalds 已提交
1835

1836
	ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,
1837
			   tmp.num_counters, compat_ptr(tmp.counters));
1838 1839 1840
	if (ret)
		goto free_newinfo_untrans;
	return 0;
L
Linus Torvalds 已提交
1841

1842
 free_newinfo_untrans:
1843
	xt_entry_foreach(iter, loc_cpu_entry, newinfo->size)
1844
		cleanup_entry(iter, net);
1845 1846 1847 1848
 free_newinfo:
	xt_free_table_info(newinfo);
	return ret;
}
L
Linus Torvalds 已提交
1849

1850 1851
static int
compat_do_ipt_set_ctl(struct sock *sk,	int cmd, void __user *user,
1852
		      unsigned int len)
1853 1854
{
	int ret;
L
Linus Torvalds 已提交
1855

1856
	if (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))
1857
		return -EPERM;
L
Linus Torvalds 已提交
1858

1859 1860
	switch (cmd) {
	case IPT_SO_SET_REPLACE:
1861
		ret = compat_do_replace(sock_net(sk), user, len);
1862
		break;
L
Linus Torvalds 已提交
1863

1864
	case IPT_SO_SET_ADD_COUNTERS:
1865
		ret = do_add_counters(sock_net(sk), user, len, 1);
1866 1867 1868 1869 1870 1871
		break;

	default:
		duprintf("do_ipt_set_ctl:  unknown request %i\n", cmd);
		ret = -EINVAL;
	}
L
Linus Torvalds 已提交
1872 1873 1874 1875

	return ret;
}

1876
struct compat_ipt_get_entries {
1877
	char name[XT_TABLE_MAXNAMELEN];
1878 1879 1880
	compat_uint_t size;
	struct compat_ipt_entry entrytable[0];
};
L
Linus Torvalds 已提交
1881

1882 1883 1884
static int
compat_copy_entries_to_user(unsigned int total_size, struct xt_table *table,
			    void __user *userptr)
1885 1886
{
	struct xt_counters *counters;
1887
	const struct xt_table_info *private = table->private;
1888 1889 1890
	void __user *pos;
	unsigned int size;
	int ret = 0;
1891
	const void *loc_cpu_entry;
1892
	unsigned int i = 0;
1893
	struct ipt_entry *iter;
L
Linus Torvalds 已提交
1894

1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905
	counters = alloc_counters(table);
	if (IS_ERR(counters))
		return PTR_ERR(counters);

	/* choose the copy that is on our node/cpu, ...
	 * This choice is lazy (because current thread is
	 * allowed to migrate to another cpu)
	 */
	loc_cpu_entry = private->entries[raw_smp_processor_id()];
	pos = userptr;
	size = total_size;
1906 1907
	xt_entry_foreach(iter, loc_cpu_entry, total_size) {
		ret = compat_copy_entry_to_user(iter, &pos,
1908
						&size, counters, i++);
1909 1910 1911
		if (ret != 0)
			break;
	}
1912 1913 1914

	vfree(counters);
	return ret;
L
Linus Torvalds 已提交
1915 1916 1917
}

static int
1918 1919
compat_get_entries(struct net *net, struct compat_ipt_get_entries __user *uptr,
		   int *len)
L
Linus Torvalds 已提交
1920
{
1921 1922
	int ret;
	struct compat_ipt_get_entries get;
1923
	struct xt_table *t;
L
Linus Torvalds 已提交
1924

1925
	if (*len < sizeof(get)) {
1926
		duprintf("compat_get_entries: %u < %zu\n", *len, sizeof(get));
L
Linus Torvalds 已提交
1927
		return -EINVAL;
1928
	}
L
Linus Torvalds 已提交
1929

1930 1931
	if (copy_from_user(&get, uptr, sizeof(get)) != 0)
		return -EFAULT;
L
Linus Torvalds 已提交
1932

1933
	if (*len != sizeof(struct compat_ipt_get_entries) + get.size) {
1934 1935
		duprintf("compat_get_entries: %u != %zu\n",
			 *len, sizeof(get) + get.size);
1936
		return -EINVAL;
L
Linus Torvalds 已提交
1937 1938
	}

1939
	xt_compat_lock(AF_INET);
1940
	t = xt_find_table_lock(net, AF_INET, get.name);
1941
	if (!IS_ERR_OR_NULL(t)) {
1942
		const struct xt_table_info *private = t->private;
1943
		struct xt_table_info info;
1944
		duprintf("t->private->number = %u\n", private->number);
1945 1946 1947
		ret = compat_table_info(private, &info);
		if (!ret && get.size == info.size) {
			ret = compat_copy_entries_to_user(private->size,
1948
							  t, uptr->entrytable);
1949 1950
		} else if (!ret) {
			duprintf("compat_get_entries: I've got %u not %u!\n",
1951
				 private->size, get.size);
1952
			ret = -EAGAIN;
1953
		}
1954
		xt_compat_flush_offsets(AF_INET);
1955 1956 1957
		module_put(t->me);
		xt_table_unlock(t);
	} else
L
Linus Torvalds 已提交
1958 1959
		ret = t ? PTR_ERR(t) : -ENOENT;

1960 1961 1962
	xt_compat_unlock(AF_INET);
	return ret;
}
L
Linus Torvalds 已提交
1963

1964 1965
static int do_ipt_get_ctl(struct sock *, int, void __user *, int *);

1966 1967 1968 1969
static int
compat_do_ipt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len)
{
	int ret;
L
Linus Torvalds 已提交
1970

1971
	if (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))
1972 1973
		return -EPERM;

1974 1975
	switch (cmd) {
	case IPT_SO_GET_INFO:
1976
		ret = get_info(sock_net(sk), user, len, 1);
1977 1978
		break;
	case IPT_SO_GET_ENTRIES:
1979
		ret = compat_get_entries(sock_net(sk), user, len);
1980 1981
		break;
	default:
1982
		ret = do_ipt_get_ctl(sk, cmd, user, len);
1983
	}
L
Linus Torvalds 已提交
1984 1985
	return ret;
}
1986
#endif
L
Linus Torvalds 已提交
1987 1988

static int
1989
do_ipt_set_ctl(struct sock *sk, int cmd, void __user *user, unsigned int len)
L
Linus Torvalds 已提交
1990 1991 1992
{
	int ret;

1993
	if (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))
L
Linus Torvalds 已提交
1994 1995 1996 1997
		return -EPERM;

	switch (cmd) {
	case IPT_SO_SET_REPLACE:
1998
		ret = do_replace(sock_net(sk), user, len);
L
Linus Torvalds 已提交
1999 2000 2001
		break;

	case IPT_SO_SET_ADD_COUNTERS:
2002
		ret = do_add_counters(sock_net(sk), user, len, 0);
L
Linus Torvalds 已提交
2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017
		break;

	default:
		duprintf("do_ipt_set_ctl:  unknown request %i\n", cmd);
		ret = -EINVAL;
	}

	return ret;
}

static int
do_ipt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len)
{
	int ret;

2018
	if (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))
L
Linus Torvalds 已提交
2019 2020 2021
		return -EPERM;

	switch (cmd) {
2022
	case IPT_SO_GET_INFO:
2023
		ret = get_info(sock_net(sk), user, len, 0);
2024
		break;
L
Linus Torvalds 已提交
2025

2026
	case IPT_SO_GET_ENTRIES:
2027
		ret = get_entries(sock_net(sk), user, len);
L
Linus Torvalds 已提交
2028 2029 2030 2031
		break;

	case IPT_SO_GET_REVISION_MATCH:
	case IPT_SO_GET_REVISION_TARGET: {
2032
		struct xt_get_revision rev;
2033
		int target;
L
Linus Torvalds 已提交
2034 2035 2036 2037 2038 2039 2040 2041 2042

		if (*len != sizeof(rev)) {
			ret = -EINVAL;
			break;
		}
		if (copy_from_user(&rev, user, sizeof(rev)) != 0) {
			ret = -EFAULT;
			break;
		}
2043
		rev.name[sizeof(rev.name)-1] = 0;
L
Linus Torvalds 已提交
2044 2045

		if (cmd == IPT_SO_GET_REVISION_TARGET)
2046
			target = 1;
L
Linus Torvalds 已提交
2047
		else
2048
			target = 0;
L
Linus Torvalds 已提交
2049

2050 2051 2052
		try_then_request_module(xt_find_revision(AF_INET, rev.name,
							 rev.revision,
							 target, &ret),
L
Linus Torvalds 已提交
2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064
					"ipt_%s", rev.name);
		break;
	}

	default:
		duprintf("do_ipt_get_ctl: unknown request %i\n", cmd);
		ret = -EINVAL;
	}

	return ret;
}

2065 2066
struct xt_table *ipt_register_table(struct net *net,
				    const struct xt_table *table,
2067
				    const struct ipt_replace *repl)
L
Linus Torvalds 已提交
2068 2069
{
	int ret;
2070
	struct xt_table_info *newinfo;
2071
	struct xt_table_info bootstrap = {0};
2072
	void *loc_cpu_entry;
2073
	struct xt_table *new_table;
L
Linus Torvalds 已提交
2074

2075
	newinfo = xt_alloc_table_info(repl->size);
2076 2077 2078 2079
	if (!newinfo) {
		ret = -ENOMEM;
		goto out;
	}
L
Linus Torvalds 已提交
2080

2081
	/* choose the copy on our node/cpu, but dont care about preemption */
2082 2083
	loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
	memcpy(loc_cpu_entry, repl->entries, repl->size);
L
Linus Torvalds 已提交
2084

2085
	ret = translate_table(net, newinfo, loc_cpu_entry, repl);
2086 2087
	if (ret != 0)
		goto out_free;
L
Linus Torvalds 已提交
2088

2089
	new_table = xt_register_table(net, table, &bootstrap, newinfo);
2090
	if (IS_ERR(new_table)) {
2091 2092
		ret = PTR_ERR(new_table);
		goto out_free;
L
Linus Torvalds 已提交
2093 2094
	}

2095 2096 2097 2098 2099 2100
	return new_table;

out_free:
	xt_free_table_info(newinfo);
out:
	return ERR_PTR(ret);
L
Linus Torvalds 已提交
2101 2102
}

2103
void ipt_unregister_table(struct net *net, struct xt_table *table)
L
Linus Torvalds 已提交
2104
{
2105
	struct xt_table_info *private;
2106
	void *loc_cpu_entry;
2107
	struct module *table_owner = table->me;
2108
	struct ipt_entry *iter;
2109

2110
	private = xt_unregister_table(table);
L
Linus Torvalds 已提交
2111 2112

	/* Decrease module usage counts and free resources */
2113
	loc_cpu_entry = private->entries[raw_smp_processor_id()];
2114
	xt_entry_foreach(iter, loc_cpu_entry, private->size)
2115
		cleanup_entry(iter, net);
2116 2117
	if (private->number > private->initial_entries)
		module_put(table_owner);
2118
	xt_free_table_info(private);
L
Linus Torvalds 已提交
2119 2120 2121
}

/* Returns 1 if the type and code is matched by the range, 0 otherwise */
2122
static inline bool
L
Linus Torvalds 已提交
2123 2124
icmp_type_code_match(u_int8_t test_type, u_int8_t min_code, u_int8_t max_code,
		     u_int8_t type, u_int8_t code,
2125
		     bool invert)
L
Linus Torvalds 已提交
2126
{
2127 2128
	return ((test_type == 0xFF) ||
		(type == test_type && code >= min_code && code <= max_code))
L
Linus Torvalds 已提交
2129 2130 2131
		^ invert;
}

2132
static bool
2133
icmp_match(const struct sk_buff *skb, struct xt_action_param *par)
L
Linus Torvalds 已提交
2134
{
2135 2136
	const struct icmphdr *ic;
	struct icmphdr _icmph;
2137
	const struct ipt_icmp *icmpinfo = par->matchinfo;
L
Linus Torvalds 已提交
2138 2139

	/* Must not be a fragment. */
2140
	if (par->fragoff != 0)
2141
		return false;
L
Linus Torvalds 已提交
2142

2143
	ic = skb_header_pointer(skb, par->thoff, sizeof(_icmph), &_icmph);
L
Linus Torvalds 已提交
2144 2145 2146 2147 2148
	if (ic == NULL) {
		/* We've been asked to examine this packet, and we
		 * can't.  Hence, no choice but to drop.
		 */
		duprintf("Dropping evil ICMP tinygram.\n");
2149
		par->hotdrop = true;
2150
		return false;
L
Linus Torvalds 已提交
2151 2152 2153 2154 2155 2156 2157 2158 2159
	}

	return icmp_type_code_match(icmpinfo->type,
				    icmpinfo->code[0],
				    icmpinfo->code[1],
				    ic->type, ic->code,
				    !!(icmpinfo->invflags&IPT_ICMP_INV));
}

2160
static int icmp_checkentry(const struct xt_mtchk_param *par)
L
Linus Torvalds 已提交
2161
{
2162
	const struct ipt_icmp *icmpinfo = par->matchinfo;
L
Linus Torvalds 已提交
2163

2164
	/* Must specify no unknown invflags */
2165
	return (icmpinfo->invflags & ~IPT_ICMP_INV) ? -EINVAL : 0;
L
Linus Torvalds 已提交
2166 2167
}

2168 2169
static struct xt_target ipt_builtin_tg[] __read_mostly = {
	{
2170
		.name             = XT_STANDARD_TARGET,
2171 2172
		.targetsize       = sizeof(int),
		.family           = NFPROTO_IPV4,
2173
#ifdef CONFIG_COMPAT
2174 2175 2176
		.compatsize       = sizeof(compat_int_t),
		.compat_from_user = compat_standard_from_user,
		.compat_to_user   = compat_standard_to_user,
2177
#endif
2178 2179
	},
	{
2180
		.name             = XT_ERROR_TARGET,
2181
		.target           = ipt_error,
2182
		.targetsize       = XT_FUNCTION_MAXNAMELEN,
2183 2184
		.family           = NFPROTO_IPV4,
	},
L
Linus Torvalds 已提交
2185 2186 2187 2188 2189 2190 2191
};

static struct nf_sockopt_ops ipt_sockopts = {
	.pf		= PF_INET,
	.set_optmin	= IPT_BASE_CTL,
	.set_optmax	= IPT_SO_SET_MAX+1,
	.set		= do_ipt_set_ctl,
2192 2193 2194
#ifdef CONFIG_COMPAT
	.compat_set	= compat_do_ipt_set_ctl,
#endif
L
Linus Torvalds 已提交
2195 2196 2197
	.get_optmin	= IPT_BASE_CTL,
	.get_optmax	= IPT_SO_GET_MAX+1,
	.get		= do_ipt_get_ctl,
2198 2199 2200
#ifdef CONFIG_COMPAT
	.compat_get	= compat_do_ipt_get_ctl,
#endif
2201
	.owner		= THIS_MODULE,
L
Linus Torvalds 已提交
2202 2203
};

2204 2205 2206 2207 2208 2209 2210 2211 2212
static struct xt_match ipt_builtin_mt[] __read_mostly = {
	{
		.name       = "icmp",
		.match      = icmp_match,
		.matchsize  = sizeof(struct ipt_icmp),
		.checkentry = icmp_checkentry,
		.proto      = IPPROTO_ICMP,
		.family     = NFPROTO_IPV4,
	},
L
Linus Torvalds 已提交
2213 2214
};

2215 2216
static int __net_init ip_tables_net_init(struct net *net)
{
2217
	return xt_proto_init(net, NFPROTO_IPV4);
2218 2219 2220 2221
}

static void __net_exit ip_tables_net_exit(struct net *net)
{
2222
	xt_proto_fini(net, NFPROTO_IPV4);
2223 2224 2225 2226 2227 2228 2229
}

static struct pernet_operations ip_tables_net_ops = {
	.init = ip_tables_net_init,
	.exit = ip_tables_net_exit,
};

2230
static int __init ip_tables_init(void)
L
Linus Torvalds 已提交
2231 2232 2233
{
	int ret;

2234
	ret = register_pernet_subsys(&ip_tables_net_ops);
2235 2236
	if (ret < 0)
		goto err1;
2237

L
Lucas De Marchi 已提交
2238
	/* No one else will be downing sem now, so we won't sleep */
2239
	ret = xt_register_targets(ipt_builtin_tg, ARRAY_SIZE(ipt_builtin_tg));
2240 2241
	if (ret < 0)
		goto err2;
2242
	ret = xt_register_matches(ipt_builtin_mt, ARRAY_SIZE(ipt_builtin_mt));
2243 2244
	if (ret < 0)
		goto err4;
L
Linus Torvalds 已提交
2245 2246 2247

	/* Register setsockopt */
	ret = nf_register_sockopt(&ipt_sockopts);
2248 2249
	if (ret < 0)
		goto err5;
L
Linus Torvalds 已提交
2250

2251
	pr_info("(C) 2000-2006 Netfilter Core Team\n");
L
Linus Torvalds 已提交
2252
	return 0;
2253 2254

err5:
2255
	xt_unregister_matches(ipt_builtin_mt, ARRAY_SIZE(ipt_builtin_mt));
2256
err4:
2257
	xt_unregister_targets(ipt_builtin_tg, ARRAY_SIZE(ipt_builtin_tg));
2258
err2:
2259
	unregister_pernet_subsys(&ip_tables_net_ops);
2260 2261
err1:
	return ret;
L
Linus Torvalds 已提交
2262 2263
}

2264
static void __exit ip_tables_fini(void)
L
Linus Torvalds 已提交
2265 2266
{
	nf_unregister_sockopt(&ipt_sockopts);
2267

2268 2269
	xt_unregister_matches(ipt_builtin_mt, ARRAY_SIZE(ipt_builtin_mt));
	xt_unregister_targets(ipt_builtin_tg, ARRAY_SIZE(ipt_builtin_tg));
2270
	unregister_pernet_subsys(&ip_tables_net_ops);
L
Linus Torvalds 已提交
2271 2272 2273 2274 2275
}

EXPORT_SYMBOL(ipt_register_table);
EXPORT_SYMBOL(ipt_unregister_table);
EXPORT_SYMBOL(ipt_do_table);
2276 2277
module_init(ip_tables_init);
module_exit(ip_tables_fini);