ip_tables.c 55.4 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>
L
Linus Torvalds 已提交
6 7 8 9 10
 *
 * 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.
 */
11
#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
L
Linus Torvalds 已提交
12
#include <linux/cache.h>
13
#include <linux/capability.h>
L
Linus Torvalds 已提交
14 15 16 17 18 19 20
#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>
21
#include <net/compat.h>
L
Linus Torvalds 已提交
22
#include <asm/uaccess.h>
I
Ingo Molnar 已提交
23
#include <linux/mutex.h>
L
Linus Torvalds 已提交
24 25
#include <linux/proc_fs.h>
#include <linux/err.h>
26
#include <linux/cpumask.h>
L
Linus Torvalds 已提交
27

28
#include <linux/netfilter/x_tables.h>
L
Linus Torvalds 已提交
29
#include <linux/netfilter_ipv4/ip_tables.h>
30
#include <net/netfilter/nf_log.h>
31
#include "../../netfilter/xt_repldata.h"
L
Linus Torvalds 已提交
32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57

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
#define dprintf(format, args...)  printk(format , ## args)
#else
#define dprintf(format, args...)
#endif

#ifdef DEBUG_IP_FIREWALL_USER
#define duprintf(format, args...) printk(format , ## args)
#else
#define duprintf(format, args...)
#endif

#ifdef CONFIG_NETFILTER_DEBUG
#define IP_NF_ASSERT(x)						\
do {								\
	if (!(x))						\
		printk("IP_NF_ASSERT: %s:%s:%u\n",		\
58
		       __func__, __FILE__, __LINE__);	\
L
Linus Torvalds 已提交
59 60 61 62 63 64 65 66 67 68 69
} while(0)
#else
#define IP_NF_ASSERT(x)
#endif

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

70 71 72 73 74 75
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 已提交
76 77 78 79 80 81 82 83 84 85
/*
   We keep a set of rules for each CPU, so we can avoid write-locking
   them in the softirq when updating the counters and therefore
   only need to read-lock in the softirq; doing a write_lock_bh() in user
   context stops packets coming through and allows user context to read
   the counters or update the rules.

   Hence the start of any table is given by get_table() below.  */

/* Returns whether matches rule or not. */
86
/* Performance critical - called for every packet */
87
static inline bool
L
Linus Torvalds 已提交
88 89 90 91 92 93 94 95
ip_packet_match(const struct iphdr *ip,
		const char *indev,
		const char *outdev,
		const struct ipt_ip *ipinfo,
		int isfrag)
{
	unsigned long ret;

96
#define FWINV(bool, invflg) ((bool) ^ !!(ipinfo->invflags & (invflg)))
L
Linus Torvalds 已提交
97 98

	if (FWINV((ip->saddr&ipinfo->smsk.s_addr) != ipinfo->src.s_addr,
99 100 101
		  IPT_INV_SRCIP) ||
	    FWINV((ip->daddr&ipinfo->dmsk.s_addr) != ipinfo->dst.s_addr,
		  IPT_INV_DSTIP)) {
L
Linus Torvalds 已提交
102 103
		dprintf("Source or dest mismatch.\n");

104 105
		dprintf("SRC: %pI4. Mask: %pI4. Target: %pI4.%s\n",
			&ip->saddr, &ipinfo->smsk.s_addr, &ipinfo->src.s_addr,
L
Linus Torvalds 已提交
106
			ipinfo->invflags & IPT_INV_SRCIP ? " (INV)" : "");
107 108
		dprintf("DST: %pI4 Mask: %pI4 Target: %pI4.%s\n",
			&ip->daddr, &ipinfo->dmsk.s_addr, &ipinfo->dst.s_addr,
L
Linus Torvalds 已提交
109
			ipinfo->invflags & IPT_INV_DSTIP ? " (INV)" : "");
110
		return false;
L
Linus Torvalds 已提交
111 112
	}

113
	ret = ifname_compare_aligned(indev, ipinfo->iniface, ipinfo->iniface_mask);
L
Linus Torvalds 已提交
114 115 116 117 118

	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)":"");
119
		return false;
L
Linus Torvalds 已提交
120 121
	}

122
	ret = ifname_compare_aligned(outdev, ipinfo->outiface, ipinfo->outiface_mask);
L
Linus Torvalds 已提交
123 124 125 126 127

	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)":"");
128
		return false;
L
Linus Torvalds 已提交
129 130 131
	}

	/* Check specific protocol */
132 133
	if (ipinfo->proto &&
	    FWINV(ip->protocol != ipinfo->proto, IPT_INV_PROTO)) {
L
Linus Torvalds 已提交
134 135 136
		dprintf("Packet protocol %hi does not match %hi.%s\n",
			ip->protocol, ipinfo->proto,
			ipinfo->invflags&IPT_INV_PROTO ? " (INV)":"");
137
		return false;
L
Linus Torvalds 已提交
138 139 140 141 142 143 144
	}

	/* 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)" : "");
145
		return false;
L
Linus Torvalds 已提交
146 147
	}

148
	return true;
L
Linus Torvalds 已提交
149 150
}

151
static bool
L
Linus Torvalds 已提交
152 153 154 155 156
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);
157
		return false;
L
Linus Torvalds 已提交
158 159 160 161
	}
	if (ip->invflags & ~IPT_INV_MASK) {
		duprintf("Unknown invflag bits set: %08X\n",
			 ip->invflags & ~IPT_INV_MASK);
162
		return false;
L
Linus Torvalds 已提交
163
	}
164
	return true;
L
Linus Torvalds 已提交
165 166 167
}

static unsigned int
168
ipt_error(struct sk_buff *skb, const struct xt_target_param *par)
L
Linus Torvalds 已提交
169 170
{
	if (net_ratelimit())
171 172
		printk("ip_tables: error: `%s'\n",
		       (const char *)par->targinfo);
L
Linus Torvalds 已提交
173 174 175 176

	return NF_DROP;
}

177 178
/* Performance critical - called for every packet */
static inline bool
179 180
do_match(struct ipt_entry_match *m, const struct sk_buff *skb,
	 struct xt_match_param *par)
L
Linus Torvalds 已提交
181
{
182 183 184
	par->match     = m->u.kernel.match;
	par->matchinfo = m->data;

L
Linus Torvalds 已提交
185
	/* Stop iteration if it doesn't match */
186
	if (!m->u.kernel.match->match(skb, par))
187
		return true;
L
Linus Torvalds 已提交
188
	else
189
		return false;
L
Linus Torvalds 已提交
190 191
}

192
/* Performance critical */
L
Linus Torvalds 已提交
193 194 195 196 197 198
static inline struct ipt_entry *
get_entry(void *base, unsigned int offset)
{
	return (struct ipt_entry *)(base + offset);
}

199
/* All zeroes == unconditional rule. */
200
/* Mildly perf critical (only if packet tracing is on) */
201
static inline bool unconditional(const struct ipt_ip *ip)
202
{
203
	static const struct ipt_ip uncond;
204

205
	return memcmp(ip, &uncond, sizeof(uncond)) == 0;
206
#undef FWINV
207 208 209 210
}

#if defined(CONFIG_NETFILTER_XT_TARGET_TRACE) || \
    defined(CONFIG_NETFILTER_XT_TARGET_TRACE_MODULE)
211
static const char *const hooknames[] = {
212 213
	[NF_INET_PRE_ROUTING]		= "PREROUTING",
	[NF_INET_LOCAL_IN]		= "INPUT",
214
	[NF_INET_FORWARD]		= "FORWARD",
215 216
	[NF_INET_LOCAL_OUT]		= "OUTPUT",
	[NF_INET_POST_ROUTING]		= "POSTROUTING",
217 218 219 220 221 222 223 224
};

enum nf_ip_trace_comments {
	NF_IP_TRACE_COMMENT_RULE,
	NF_IP_TRACE_COMMENT_RETURN,
	NF_IP_TRACE_COMMENT_POLICY,
};

225
static const char *const comments[] = {
226 227 228 229 230 231 232 233 234 235 236 237 238 239 240
	[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,
		},
	},
};

241
/* Mildly perf critical (only if packet tracing is on) */
242 243
static inline int
get_chainname_rulenum(struct ipt_entry *s, struct ipt_entry *e,
244 245
		      const char *hookname, const char **chainname,
		      const char **comment, unsigned int *rulenum)
246 247 248 249 250 251 252 253 254 255
{
	struct ipt_standard_target *t = (void *)ipt_get_target(s);

	if (strcmp(t->target.u.kernel.target->name, IPT_ERROR_TARGET) == 0) {
		/* Head of user chain: ERROR target with chainname */
		*chainname = t->target.data;
		(*rulenum) = 0;
	} else if (s == e) {
		(*rulenum)++;

256 257 258 259 260
		if (s->target_offset == sizeof(struct ipt_entry) &&
		    strcmp(t->target.u.kernel.target->name,
			   IPT_STANDARD_TARGET) == 0 &&
		   t->verdict < 0 &&
		   unconditional(&s->ip)) {
261 262
			/* Tail of chains: STANDARD target (return/policy) */
			*comment = *chainname == hookname
263 264
				? comments[NF_IP_TRACE_COMMENT_POLICY]
				: comments[NF_IP_TRACE_COMMENT_RETURN];
265 266 267 268 269 270 271 272 273 274 275 276
		}
		return 1;
	} else
		(*rulenum)++;

	return 0;
}

static void trace_packet(struct sk_buff *skb,
			 unsigned int hook,
			 const struct net_device *in,
			 const struct net_device *out,
277
			 const char *tablename,
278 279 280 281
			 struct xt_table_info *private,
			 struct ipt_entry *e)
{
	void *table_base;
282
	const struct ipt_entry *root;
283
	const char *hookname, *chainname, *comment;
284 285
	unsigned int rulenum = 0;

286
	table_base = private->entries[smp_processor_id()];
287 288
	root = get_entry(table_base, private->hook_entry[hook]);

289 290
	hookname = chainname = hooknames[hook];
	comment = comments[NF_IP_TRACE_COMMENT_RULE];
291 292 293 294 295 296 297 298 299 300 301 302

	IPT_ENTRY_ITERATE(root,
			  private->size - private->hook_entry[hook],
			  get_chainname_rulenum,
			  e, hookname, &chainname, &comment, &rulenum);

	nf_log_packet(AF_INET, hook, skb, in, out, &trace_loginfo,
		      "TRACE: %s:%s:%s:%u ",
		      tablename, chainname, comment, rulenum);
}
#endif

303 304 305 306 307 308
static inline __pure
struct ipt_entry *ipt_next_entry(const struct ipt_entry *entry)
{
	return (void *)entry + entry->next_offset;
}

L
Linus Torvalds 已提交
309 310
/* Returns one of the generic firewall policies, like NF_ACCEPT. */
unsigned int
311
ipt_do_table(struct sk_buff *skb,
L
Linus Torvalds 已提交
312 313 314
	     unsigned int hook,
	     const struct net_device *in,
	     const struct net_device *out,
315
	     struct xt_table *table)
L
Linus Torvalds 已提交
316
{
317 318
#define tb_comefrom ((struct ipt_entry *)table_base)->comefrom

L
Linus Torvalds 已提交
319
	static const char nulldevname[IFNAMSIZ] __attribute__((aligned(sizeof(long))));
320
	const struct iphdr *ip;
321
	bool hotdrop = false;
L
Linus Torvalds 已提交
322 323 324 325 326
	/* Initializing verdict to NF_DROP keeps gcc happy. */
	unsigned int verdict = NF_DROP;
	const char *indev, *outdev;
	void *table_base;
	struct ipt_entry *e, *back;
327
	struct xt_table_info *private;
328
	struct xt_match_param mtpar;
329
	struct xt_target_param tgpar;
L
Linus Torvalds 已提交
330 331

	/* Initialization */
332
	ip = ip_hdr(skb);
L
Linus Torvalds 已提交
333 334 335 336 337 338 339 340
	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. */
341 342 343
	mtpar.fragoff = ntohs(ip->frag_off) & IP_OFFSET;
	mtpar.thoff   = ip_hdrlen(skb);
	mtpar.hotdrop = &hotdrop;
344 345
	mtpar.in      = tgpar.in  = in;
	mtpar.out     = tgpar.out = out;
346
	mtpar.family  = tgpar.family = NFPROTO_IPV4;
347
	mtpar.hooknum = tgpar.hooknum = hook;
L
Linus Torvalds 已提交
348 349

	IP_NF_ASSERT(table->valid_hooks & (1 << hook));
350 351 352
	xt_info_rdlock_bh();
	private = table->private;
	table_base = private->entries[smp_processor_id()];
353

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

	/* For return from builtin chain */
357
	back = get_entry(table_base, private->underflow[hook]);
L
Linus Torvalds 已提交
358 359

	do {
360 361
		struct ipt_entry_target *t;

L
Linus Torvalds 已提交
362 363
		IP_NF_ASSERT(e);
		IP_NF_ASSERT(back);
364
		if (!ip_packet_match(ip, indev, outdev,
365 366
		    &e->ip, mtpar.fragoff) ||
		    IPT_MATCH_ITERATE(e, do_match, skb, &mtpar) != 0) {
367 368 369
			e = ipt_next_entry(e);
			continue;
		}
L
Linus Torvalds 已提交
370

371
		ADD_COUNTER(e->counters, ntohs(ip->tot_len), 1);
L
Linus Torvalds 已提交
372

373 374
		t = ipt_get_target(e);
		IP_NF_ASSERT(t->u.kernel.target);
375 376 377

#if defined(CONFIG_NETFILTER_XT_TARGET_TRACE) || \
    defined(CONFIG_NETFILTER_XT_TARGET_TRACE_MODULE)
378 379 380 381
		/* The packet is traced: log it */
		if (unlikely(skb->nf_trace))
			trace_packet(skb, hook, in, out,
				     table->name, private, e);
382
#endif
383 384 385 386 387 388 389 390 391 392
		/* Standard target? */
		if (!t->u.kernel.target->target) {
			int v;

			v = ((struct ipt_standard_target *)t)->verdict;
			if (v < 0) {
				/* Pop from stack? */
				if (v != IPT_RETURN) {
					verdict = (unsigned)(-v) - 1;
					break;
L
Linus Torvalds 已提交
393
				}
394 395 396 397
				e = back;
				back = get_entry(table_base, back->comefrom);
				continue;
			}
398 399
			if (table_base + v != ipt_next_entry(e) &&
			    !(e->ip.flags & IPT_F_GOTO)) {
400 401 402 403 404 405
				/* Save old back ptr in next entry */
				struct ipt_entry *next = ipt_next_entry(e);
				next->comefrom = (void *)back - table_base;
				/* set back pointer to next entry */
				back = next;
			}
L
Linus Torvalds 已提交
406

407
			e = get_entry(table_base, v);
408 409 410 411 412 413 414
			continue;
		}

		/* Targets which reenter must return
		   abs. verdicts */
		tgpar.target   = t->u.kernel.target;
		tgpar.targinfo = t->data;
415 416


L
Linus Torvalds 已提交
417
#ifdef CONFIG_NETFILTER_DEBUG
418
		tb_comefrom = 0xeeeeeeec;
L
Linus Torvalds 已提交
419
#endif
420
		verdict = t->u.kernel.target->target(skb, &tgpar);
L
Linus Torvalds 已提交
421
#ifdef CONFIG_NETFILTER_DEBUG
422
		if (tb_comefrom != 0xeeeeeeec && verdict == IPT_CONTINUE) {
423 424 425
			printk("Target %s reentered!\n",
			       t->u.kernel.target->name);
			verdict = NF_DROP;
L
Linus Torvalds 已提交
426
		}
427
		tb_comefrom = 0x57acc001;
428 429 430 431 432 433 434 435
#endif
		/* Target might have changed stuff. */
		ip = ip_hdr(skb);
		if (verdict == IPT_CONTINUE)
			e = ipt_next_entry(e);
		else
			/* Verdict */
			break;
L
Linus Torvalds 已提交
436
	} while (!hotdrop);
437
	xt_info_rdunlock_bh();
L
Linus Torvalds 已提交
438 439 440 441 442 443 444 445

#ifdef DEBUG_ALLOW_ALL
	return NF_ACCEPT;
#else
	if (hotdrop)
		return NF_DROP;
	else return verdict;
#endif
446 447

#undef tb_comefrom
L
Linus Torvalds 已提交
448 449 450 451 452
}

/* Figures out from what hook each rule can be called: returns 0 if
   there are loops.  Puts hook bitmask in comefrom. */
static int
453
mark_source_chains(struct xt_table_info *newinfo,
454
		   unsigned int valid_hooks, void *entry0)
L
Linus Torvalds 已提交
455 456 457 458 459
{
	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 */
460
	for (hook = 0; hook < NF_INET_NUMHOOKS; hook++) {
L
Linus Torvalds 已提交
461
		unsigned int pos = newinfo->hook_entry[hook];
462
		struct ipt_entry *e = (struct ipt_entry *)(entry0 + pos);
L
Linus Torvalds 已提交
463 464 465 466 467 468 469 470 471 472

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

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

		for (;;) {
			struct ipt_standard_target *t
				= (void *)ipt_get_target(e);
473
			int visited = e->comefrom & (1 << hook);
L
Linus Torvalds 已提交
474

475
			if (e->comefrom & (1 << NF_INET_NUMHOOKS)) {
L
Linus Torvalds 已提交
476 477 478 479
				printk("iptables: loop hook %u pos %u %08X.\n",
				       hook, pos, e->comefrom);
				return 0;
			}
480
			e->comefrom |= ((1 << hook) | (1 << NF_INET_NUMHOOKS));
L
Linus Torvalds 已提交
481 482

			/* Unconditional return/END. */
483 484 485 486 487
			if ((e->target_offset == sizeof(struct ipt_entry) &&
			     (strcmp(t->target.u.user.name,
				     IPT_STANDARD_TARGET) == 0) &&
			     t->verdict < 0 && unconditional(&e->ip)) ||
			    visited) {
L
Linus Torvalds 已提交
488 489
				unsigned int oldpos, size;

490 491 492
				if ((strcmp(t->target.u.user.name,
			    		    IPT_STANDARD_TARGET) == 0) &&
				    t->verdict < -NF_MAX_VERDICT - 1) {
493 494 495 496 497 498
					duprintf("mark_source_chains: bad "
						"negative verdict (%i)\n",
								t->verdict);
					return 0;
				}

L
Linus Torvalds 已提交
499 500 501
				/* Return: backtrack through the last
				   big jump. */
				do {
502
					e->comefrom ^= (1<<NF_INET_NUMHOOKS);
L
Linus Torvalds 已提交
503 504
#ifdef DEBUG_IP_FIREWALL_USER
					if (e->comefrom
505
					    & (1 << NF_INET_NUMHOOKS)) {
L
Linus Torvalds 已提交
506 507 508 509 510 511 512 513 514 515 516 517 518 519 520
						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 *)
521
						(entry0 + pos);
L
Linus Torvalds 已提交
522 523 524 525 526
				} while (oldpos == pos + e->next_offset);

				/* Move along one */
				size = e->next_offset;
				e = (struct ipt_entry *)
527
					(entry0 + pos + size);
L
Linus Torvalds 已提交
528 529 530 531 532 533
				e->counters.pcnt = pos;
				pos += size;
			} else {
				int newpos = t->verdict;

				if (strcmp(t->target.u.user.name,
534 535
					   IPT_STANDARD_TARGET) == 0 &&
				    newpos >= 0) {
536 537 538 539 540 541 542
					if (newpos > newinfo->size -
						sizeof(struct ipt_entry)) {
						duprintf("mark_source_chains: "
							"bad verdict (%i)\n",
								newpos);
						return 0;
					}
L
Linus Torvalds 已提交
543 544 545 546 547 548 549 550
					/* 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 *)
551
					(entry0 + newpos);
L
Linus Torvalds 已提交
552 553 554 555 556 557 558 559 560 561
				e->counters.pcnt = pos;
				pos = newpos;
			}
		}
		next:
		duprintf("Finished chain %u\n", hook);
	}
	return 1;
}

562
static int
563
cleanup_match(struct ipt_entry_match *m, struct net *net, unsigned int *i)
L
Linus Torvalds 已提交
564
{
565 566
	struct xt_mtdtor_param par;

L
Linus Torvalds 已提交
567 568 569
	if (i && (*i)-- == 0)
		return 1;

570
	par.net       = net;
571 572
	par.match     = m->u.kernel.match;
	par.matchinfo = m->data;
573
	par.family    = NFPROTO_IPV4;
574 575 576
	if (par.match->destroy != NULL)
		par.match->destroy(&par);
	module_put(par.match->me);
L
Linus Torvalds 已提交
577 578 579
	return 0;
}

580
static int
581 582 583 584 585 586 587 588 589
check_entry(struct ipt_entry *e, const char *name)
{
	struct ipt_entry_target *t;

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

590 591
	if (e->target_offset + sizeof(struct ipt_entry_target) >
	    e->next_offset)
592 593 594 595 596 597 598 599 600
		return -EINVAL;

	t = ipt_get_target(e);
	if (e->target_offset + t->u.target_size > e->next_offset)
		return -EINVAL;

	return 0;
}

601
static int
602 603
check_match(struct ipt_entry_match *m, struct xt_mtchk_param *par,
	    unsigned int *i)
604
{
605
	const struct ipt_ip *ip = par->entryinfo;
606 607
	int ret;

608 609 610
	par->match     = m->u.kernel.match;
	par->matchinfo = m->data;

611
	ret = xt_check_match(par, m->u.match_size - sizeof(*m),
612
	      ip->proto, ip->invflags & IPT_INV_PROTO);
613
	if (ret < 0) {
614
		duprintf("ip_tables: check failed for `%s'.\n",
615
			 par.match->name);
616
		return ret;
617
	}
618 619
	++*i;
	return 0;
620 621
}

622
static int
623
find_check_match(struct ipt_entry_match *m, struct xt_mtchk_param *par,
624
		 unsigned int *i)
L
Linus Torvalds 已提交
625
{
626
	struct xt_match *match;
627
	int ret;
L
Linus Torvalds 已提交
628

629
	match = try_then_request_module(xt_find_match(AF_INET, m->u.user.name,
630
						      m->u.user.revision),
L
Linus Torvalds 已提交
631 632
					"ipt_%s", m->u.user.name);
	if (IS_ERR(match) || !match) {
633
		duprintf("find_check_match: `%s' not found\n", m->u.user.name);
L
Linus Torvalds 已提交
634 635 636 637
		return match ? PTR_ERR(match) : -ENOENT;
	}
	m->u.kernel.match = match;

638
	ret = check_match(m, par, i);
639 640 641
	if (ret)
		goto err;

L
Linus Torvalds 已提交
642
	return 0;
643 644 645
err:
	module_put(m->u.kernel.match->me);
	return ret;
L
Linus Torvalds 已提交
646 647
}

648
static int check_target(struct ipt_entry *e, struct net *net, const char *name)
649
{
650 651
	struct ipt_entry_target *t = ipt_get_target(e);
	struct xt_tgchk_param par = {
652
		.net       = net,
653 654 655 656 657
		.table     = name,
		.entryinfo = e,
		.target    = t->u.kernel.target,
		.targinfo  = t->data,
		.hook_mask = e->comefrom,
658
		.family    = NFPROTO_IPV4,
659
	};
660
	int ret;
661

662
	ret = xt_check_target(&par, t->u.target_size - sizeof(*t),
663
	      e->ip.proto, e->ip.invflags & IPT_INV_PROTO);
664
	if (ret < 0) {
665 666
		duprintf("ip_tables: check failed for `%s'.\n",
			 t->u.kernel.target->name);
667
		return ret;
668
	}
669
	return 0;
670
}
L
Linus Torvalds 已提交
671

672
static int
673 674
find_check_entry(struct ipt_entry *e, struct net *net, const char *name,
		 unsigned int size, unsigned int *i)
L
Linus Torvalds 已提交
675 676
{
	struct ipt_entry_target *t;
677
	struct xt_target *target;
L
Linus Torvalds 已提交
678 679
	int ret;
	unsigned int j;
680
	struct xt_mtchk_param mtpar;
L
Linus Torvalds 已提交
681

682 683 684
	ret = check_entry(e, name);
	if (ret)
		return ret;
685

L
Linus Torvalds 已提交
686
	j = 0;
687
	mtpar.net	= net;
688 689 690
	mtpar.table     = name;
	mtpar.entryinfo = &e->ip;
	mtpar.hook_mask = e->comefrom;
691
	mtpar.family    = NFPROTO_IPV4;
692
	ret = IPT_MATCH_ITERATE(e, find_check_match, &mtpar, &j);
L
Linus Torvalds 已提交
693 694 695 696
	if (ret != 0)
		goto cleanup_matches;

	t = ipt_get_target(e);
697
	target = try_then_request_module(xt_find_target(AF_INET,
698 699
							t->u.user.name,
							t->u.user.revision),
L
Linus Torvalds 已提交
700 701
					 "ipt_%s", t->u.user.name);
	if (IS_ERR(target) || !target) {
702
		duprintf("find_check_entry: `%s' not found\n", t->u.user.name);
L
Linus Torvalds 已提交
703 704 705 706 707
		ret = target ? PTR_ERR(target) : -ENOENT;
		goto cleanup_matches;
	}
	t->u.kernel.target = target;

708
	ret = check_target(e, net, name);
709 710 711
	if (ret)
		goto err;

L
Linus Torvalds 已提交
712 713
	(*i)++;
	return 0;
714 715
 err:
	module_put(t->u.kernel.target->me);
L
Linus Torvalds 已提交
716
 cleanup_matches:
717
	IPT_MATCH_ITERATE(e, cleanup_match, net, &j);
L
Linus Torvalds 已提交
718 719 720
	return ret;
}

721 722 723 724 725 726 727 728 729 730 731 732 733 734 735
static bool check_underflow(struct ipt_entry *e)
{
	const struct ipt_entry_target *t;
	unsigned int verdict;

	if (!unconditional(&e->ip))
		return false;
	t = ipt_get_target(e);
	if (strcmp(t->u.user.name, XT_STANDARD_TARGET) != 0)
		return false;
	verdict = ((struct ipt_standard_target *)t)->verdict;
	verdict = -verdict - 1;
	return verdict == NF_DROP || verdict == NF_ACCEPT;
}

736
static int
L
Linus Torvalds 已提交
737
check_entry_size_and_hooks(struct ipt_entry *e,
738
			   struct xt_table_info *newinfo,
L
Linus Torvalds 已提交
739 740 741 742
			   unsigned char *base,
			   unsigned char *limit,
			   const unsigned int *hook_entries,
			   const unsigned int *underflows,
743
			   unsigned int valid_hooks,
L
Linus Torvalds 已提交
744 745 746 747
			   unsigned int *i)
{
	unsigned int h;

748 749
	if ((unsigned long)e % __alignof__(struct ipt_entry) != 0 ||
	    (unsigned char *)e + sizeof(struct ipt_entry) >= limit) {
L
Linus Torvalds 已提交
750 751 752 753 754 755 756 757 758 759 760 761
		duprintf("Bad offset %p\n", e);
		return -EINVAL;
	}

	if (e->next_offset
	    < sizeof(struct ipt_entry) + sizeof(struct ipt_entry_target)) {
		duprintf("checking: element %p size %u\n",
			 e, e->next_offset);
		return -EINVAL;
	}

	/* Check hooks & underflows */
762
	for (h = 0; h < NF_INET_NUMHOOKS; h++) {
763 764
		if (!(valid_hooks & (1 << h)))
			continue;
L
Linus Torvalds 已提交
765 766
		if ((unsigned char *)e - base == hook_entries[h])
			newinfo->hook_entry[h] = hook_entries[h];
767
		if ((unsigned char *)e - base == underflows[h]) {
768 769 770 771
			if (!check_underflow(e)) {
				pr_err("Underflows must be unconditional and "
				       "use the STANDARD target with "
				       "ACCEPT/DROP\n");
772 773
				return -EINVAL;
			}
L
Linus Torvalds 已提交
774
			newinfo->underflow[h] = underflows[h];
775
		}
L
Linus Torvalds 已提交
776 777 778
	}

	/* Clear counters and comefrom */
779
	e->counters = ((struct xt_counters) { 0, 0 });
L
Linus Torvalds 已提交
780 781 782 783 784 785
	e->comefrom = 0;

	(*i)++;
	return 0;
}

786
static int
787
cleanup_entry(struct ipt_entry *e, struct net *net, unsigned int *i)
L
Linus Torvalds 已提交
788
{
789
	struct xt_tgdtor_param par;
L
Linus Torvalds 已提交
790 791 792 793 794 795
	struct ipt_entry_target *t;

	if (i && (*i)-- == 0)
		return 1;

	/* Cleanup all matches */
796
	IPT_MATCH_ITERATE(e, cleanup_match, net, NULL);
L
Linus Torvalds 已提交
797
	t = ipt_get_target(e);
798

799
	par.net      = net;
800 801
	par.target   = t->u.kernel.target;
	par.targinfo = t->data;
802
	par.family   = NFPROTO_IPV4;
803 804 805
	if (par.target->destroy != NULL)
		par.target->destroy(&par);
	module_put(par.target->me);
L
Linus Torvalds 已提交
806 807 808 809 810 811
	return 0;
}

/* Checks and translates the user-supplied table segment (held in
   newinfo) */
static int
812 813
translate_table(struct net *net,
		const char *name,
L
Linus Torvalds 已提交
814
		unsigned int valid_hooks,
815
		struct xt_table_info *newinfo,
816
		void *entry0,
L
Linus Torvalds 已提交
817 818 819 820 821 822 823 824 825 826 827 828
		unsigned int size,
		unsigned int number,
		const unsigned int *hook_entries,
		const unsigned int *underflows)
{
	unsigned int i;
	int ret;

	newinfo->size = size;
	newinfo->number = number;

	/* Init all hooks to impossible value. */
829
	for (i = 0; i < NF_INET_NUMHOOKS; i++) {
L
Linus Torvalds 已提交
830 831 832 833 834 835 836
		newinfo->hook_entry[i] = 0xFFFFFFFF;
		newinfo->underflow[i] = 0xFFFFFFFF;
	}

	duprintf("translate_table: size %u\n", newinfo->size);
	i = 0;
	/* Walk through entries, checking offsets. */
837
	ret = IPT_ENTRY_ITERATE(entry0, newinfo->size,
L
Linus Torvalds 已提交
838 839
				check_entry_size_and_hooks,
				newinfo,
840 841
				entry0,
				entry0 + size,
842
				hook_entries, underflows, valid_hooks, &i);
L
Linus Torvalds 已提交
843 844 845 846 847 848 849 850 851 852
	if (ret != 0)
		return ret;

	if (i != number) {
		duprintf("translate_table: %u not %u entries\n",
			 i, number);
		return -EINVAL;
	}

	/* Check hooks all assigned */
853
	for (i = 0; i < NF_INET_NUMHOOKS; i++) {
L
Linus Torvalds 已提交
854 855 856 857 858 859 860 861 862 863 864 865 866 867 868
		/* Only hooks which are valid */
		if (!(valid_hooks & (1 << i)))
			continue;
		if (newinfo->hook_entry[i] == 0xFFFFFFFF) {
			duprintf("Invalid hook entry %u %u\n",
				 i, hook_entries[i]);
			return -EINVAL;
		}
		if (newinfo->underflow[i] == 0xFFFFFFFF) {
			duprintf("Invalid underflow %u %u\n",
				 i, underflows[i]);
			return -EINVAL;
		}
	}

869 870 871
	if (!mark_source_chains(newinfo, valid_hooks, entry0))
		return -ELOOP;

L
Linus Torvalds 已提交
872 873
	/* Finally, each sanity check must pass */
	i = 0;
874
	ret = IPT_ENTRY_ITERATE(entry0, newinfo->size,
875
				find_check_entry, net, name, size, &i);
L
Linus Torvalds 已提交
876

877 878
	if (ret != 0) {
		IPT_ENTRY_ITERATE(entry0, newinfo->size,
879
				cleanup_entry, net, &i);
880 881
		return ret;
	}
L
Linus Torvalds 已提交
882 883

	/* And one copy for every other CPU */
884
	for_each_possible_cpu(i) {
885 886
		if (newinfo->entries[i] && newinfo->entries[i] != entry0)
			memcpy(newinfo->entries[i], entry0, newinfo->size);
L
Linus Torvalds 已提交
887 888 889 890 891 892 893 894
	}

	return ret;
}

/* Gets counters. */
static inline int
add_entry_to_counter(const struct ipt_entry *e,
895
		     struct xt_counters total[],
L
Linus Torvalds 已提交
896 897 898 899 900 901 902 903
		     unsigned int *i)
{
	ADD_COUNTER(total[*i], e->counters.bcnt, e->counters.pcnt);

	(*i)++;
	return 0;
}

904 905 906 907 908 909 910 911 912 913 914
static inline int
set_entry_to_counter(const struct ipt_entry *e,
		     struct ipt_counters total[],
		     unsigned int *i)
{
	SET_COUNTER(total[*i], e->counters.bcnt, e->counters.pcnt);

	(*i)++;
	return 0;
}

L
Linus Torvalds 已提交
915
static void
916 917
get_counters(const struct xt_table_info *t,
	     struct xt_counters counters[])
L
Linus Torvalds 已提交
918 919 920
{
	unsigned int cpu;
	unsigned int i;
921 922 923 924
	unsigned int curcpu;

	/* Instead of clearing (by a previous call to memset())
	 * the counters and using adds, we set the counters
925 926 927 928
	 * with data used by 'current' CPU.
	 *
	 * Bottom half has to be disabled to prevent deadlock
	 * if new softirq were to run and call ipt_do_table
929
	 */
930 931
	local_bh_disable();
	curcpu = smp_processor_id();
932 933 934 935 936 937 938

	i = 0;
	IPT_ENTRY_ITERATE(t->entries[curcpu],
			  t->size,
			  set_entry_to_counter,
			  counters,
			  &i);
L
Linus Torvalds 已提交
939

940
	for_each_possible_cpu(cpu) {
941 942
		if (cpu == curcpu)
			continue;
L
Linus Torvalds 已提交
943
		i = 0;
944
		xt_info_wrlock(cpu);
945
		IPT_ENTRY_ITERATE(t->entries[cpu],
L
Linus Torvalds 已提交
946 947 948 949
				  t->size,
				  add_entry_to_counter,
				  counters,
				  &i);
950
		xt_info_wrunlock(cpu);
L
Linus Torvalds 已提交
951
	}
952 953 954
	local_bh_enable();
}

955
static struct xt_counters * alloc_counters(struct xt_table *table)
L
Linus Torvalds 已提交
956
{
957
	unsigned int countersize;
958
	struct xt_counters *counters;
959
	struct xt_table_info *private = table->private;
L
Linus Torvalds 已提交
960 961 962 963

	/* We need atomic snapshot of counters: rest doesn't change
	   (other than comefrom, which userspace doesn't care
	   about). */
964
	countersize = sizeof(struct xt_counters) * private->number;
965
	counters = vmalloc_node(countersize, numa_node_id());
L
Linus Torvalds 已提交
966 967

	if (counters == NULL)
968
		return ERR_PTR(-ENOMEM);
969

970
	get_counters(private, counters);
L
Linus Torvalds 已提交
971

972 973 974 975 976
	return counters;
}

static int
copy_entries_to_user(unsigned int total_size,
977
		     struct xt_table *table,
978 979 980 981 982
		     void __user *userptr)
{
	unsigned int off, num;
	struct ipt_entry *e;
	struct xt_counters *counters;
983
	const struct xt_table_info *private = table->private;
984
	int ret = 0;
985
	const void *loc_cpu_entry;
986 987 988 989 990

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

991 992 993 994
	/* choose the copy that is on our node/cpu, ...
	 * This choice is lazy (because current thread is
	 * allowed to migrate to another cpu)
	 */
995
	loc_cpu_entry = private->entries[raw_smp_processor_id()];
996
	if (copy_to_user(userptr, loc_cpu_entry, total_size) != 0) {
L
Linus Torvalds 已提交
997 998 999 1000 1001 1002 1003 1004
		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;
1005 1006
		const struct ipt_entry_match *m;
		const struct ipt_entry_target *t;
L
Linus Torvalds 已提交
1007

1008
		e = (struct ipt_entry *)(loc_cpu_entry + off);
L
Linus Torvalds 已提交
1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048
		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
					 + offsetof(struct ipt_entry_match,
						    u.user.name),
					 m->u.kernel.match->name,
					 strlen(m->u.kernel.match->name)+1)
			    != 0) {
				ret = -EFAULT;
				goto free_counters;
			}
		}

		t = ipt_get_target(e);
		if (copy_to_user(userptr + off + e->target_offset
				 + offsetof(struct ipt_entry_target,
					    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;
}

1049
#ifdef CONFIG_COMPAT
1050
static void compat_standard_from_user(void *dst, void *src)
1051
{
1052
	int v = *(compat_int_t *)src;
1053

1054
	if (v > 0)
1055
		v += xt_compat_calc_jump(AF_INET, v);
1056 1057
	memcpy(dst, &v, sizeof(v));
}
1058

1059
static int compat_standard_to_user(void __user *dst, void *src)
1060
{
1061
	compat_int_t cv = *(int *)src;
1062

1063
	if (cv > 0)
1064
		cv -= xt_compat_calc_jump(AF_INET, cv);
1065
	return copy_to_user(dst, &cv, sizeof(cv)) ? -EFAULT : 0;
1066 1067 1068
}

static inline int
1069
compat_calc_match(struct ipt_entry_match *m, int *size)
1070
{
1071
	*size += xt_compat_match_offset(m->u.kernel.match);
1072 1073 1074
	return 0;
}

1075
static int compat_calc_entry(struct ipt_entry *e,
1076 1077
			     const struct xt_table_info *info,
			     void *base, struct xt_table_info *newinfo)
1078 1079
{
	struct ipt_entry_target *t;
1080
	unsigned int entry_offset;
1081 1082
	int off, i, ret;

1083
	off = sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);
1084 1085 1086
	entry_offset = (void *)e - base;
	IPT_MATCH_ITERATE(e, compat_calc_match, &off);
	t = ipt_get_target(e);
1087
	off += xt_compat_target_offset(t->u.kernel.target);
1088
	newinfo->size -= off;
1089
	ret = xt_compat_add_offset(AF_INET, entry_offset, off);
1090 1091 1092
	if (ret)
		return ret;

1093
	for (i = 0; i < NF_INET_NUMHOOKS; i++) {
1094 1095
		if (info->hook_entry[i] &&
		    (e < (struct ipt_entry *)(base + info->hook_entry[i])))
1096
			newinfo->hook_entry[i] -= off;
1097 1098
		if (info->underflow[i] &&
		    (e < (struct ipt_entry *)(base + info->underflow[i])))
1099 1100 1101 1102 1103
			newinfo->underflow[i] -= off;
	}
	return 0;
}

1104
static int compat_table_info(const struct xt_table_info *info,
1105
			     struct xt_table_info *newinfo)
1106 1107 1108 1109 1110 1111
{
	void *loc_cpu_entry;

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

1112 1113 1114
	/* we dont care about newinfo->entries[] */
	memcpy(newinfo, info, offsetof(struct xt_table_info, entries));
	newinfo->initial_entries = 0;
1115 1116
	loc_cpu_entry = info->entries[raw_smp_processor_id()];
	return IPT_ENTRY_ITERATE(loc_cpu_entry, info->size,
1117 1118
				 compat_calc_entry, info, loc_cpu_entry,
				 newinfo);
1119 1120 1121
}
#endif

1122
static int get_info(struct net *net, void __user *user, int *len, int compat)
1123 1124
{
	char name[IPT_TABLE_MAXNAMELEN];
1125
	struct xt_table *t;
1126 1127 1128
	int ret;

	if (*len != sizeof(struct ipt_getinfo)) {
1129 1130
		duprintf("length %u != %zu\n", *len,
			 sizeof(struct ipt_getinfo));
1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141
		return -EINVAL;
	}

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

	name[IPT_TABLE_MAXNAMELEN-1] = '\0';
#ifdef CONFIG_COMPAT
	if (compat)
		xt_compat_lock(AF_INET);
#endif
1142
	t = try_then_request_module(xt_find_table_lock(net, AF_INET, name),
1143
				    "iptable_%s", name);
1144 1145
	if (t && !IS_ERR(t)) {
		struct ipt_getinfo info;
1146
		const struct xt_table_info *private = t->private;
1147
#ifdef CONFIG_COMPAT
1148 1149
		struct xt_table_info tmp;

1150 1151
		if (compat) {
			ret = compat_table_info(private, &tmp);
1152
			xt_compat_flush_offsets(AF_INET);
1153
			private = &tmp;
1154 1155 1156 1157
		}
#endif
		info.valid_hooks = t->valid_hooks;
		memcpy(info.hook_entry, private->hook_entry,
1158
		       sizeof(info.hook_entry));
1159
		memcpy(info.underflow, private->underflow,
1160
		       sizeof(info.underflow));
1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181
		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
1182
get_entries(struct net *net, struct ipt_get_entries __user *uptr, int *len)
1183 1184 1185
{
	int ret;
	struct ipt_get_entries get;
1186
	struct xt_table *t;
1187 1188

	if (*len < sizeof(get)) {
1189
		duprintf("get_entries: %u < %zu\n", *len, sizeof(get));
1190 1191 1192 1193 1194
		return -EINVAL;
	}
	if (copy_from_user(&get, uptr, sizeof(get)) != 0)
		return -EFAULT;
	if (*len != sizeof(struct ipt_get_entries) + get.size) {
1195 1196
		duprintf("get_entries: %u != %zu\n",
			 *len, sizeof(get) + get.size);
1197 1198 1199
		return -EINVAL;
	}

1200
	t = xt_find_table_lock(net, AF_INET, get.name);
1201
	if (t && !IS_ERR(t)) {
1202
		const struct xt_table_info *private = t->private;
1203
		duprintf("t->private->number = %u\n", private->number);
1204 1205 1206 1207 1208
		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",
1209
				 private->size, get.size);
1210
			ret = -EAGAIN;
1211 1212 1213 1214 1215 1216 1217 1218 1219 1220
		}
		module_put(t->me);
		xt_table_unlock(t);
	} else
		ret = t ? PTR_ERR(t) : -ENOENT;

	return ret;
}

static int
1221
__do_replace(struct net *net, const char *name, unsigned int valid_hooks,
1222 1223
	     struct xt_table_info *newinfo, unsigned int num_counters,
	     void __user *counters_ptr)
1224 1225
{
	int ret;
1226
	struct xt_table *t;
1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237
	struct xt_table_info *oldinfo;
	struct xt_counters *counters;
	void *loc_cpu_old_entry;

	ret = 0;
	counters = vmalloc(num_counters * sizeof(struct xt_counters));
	if (!counters) {
		ret = -ENOMEM;
		goto out;
	}

1238
	t = try_then_request_module(xt_find_table_lock(net, AF_INET, name),
1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266
				    "iptable_%s", name);
	if (!t || IS_ERR(t)) {
		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);

1267
	/* Get the old counters, and synchronize with replace */
1268
	get_counters(oldinfo, counters);
1269

1270 1271
	/* Decrease module usage counts and free resource */
	loc_cpu_old_entry = oldinfo->entries[raw_smp_processor_id()];
1272
	IPT_ENTRY_ITERATE(loc_cpu_old_entry, oldinfo->size, cleanup_entry,
1273
			  net, NULL);
1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291
	xt_free_table_info(oldinfo);
	if (copy_to_user(counters_ptr, counters,
			 sizeof(struct xt_counters) * num_counters) != 0)
		ret = -EFAULT;
	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
1292
do_replace(struct net *net, void __user *user, unsigned int len)
1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309
{
	int ret;
	struct ipt_replace tmp;
	struct xt_table_info *newinfo;
	void *loc_cpu_entry;

	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;

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

1310
	/* choose the copy that is on our node/cpu */
1311 1312 1313 1314 1315 1316 1317
	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;
	}

1318
	ret = translate_table(net, tmp.name, tmp.valid_hooks,
1319 1320 1321 1322 1323 1324 1325
			      newinfo, loc_cpu_entry, tmp.size, tmp.num_entries,
			      tmp.hook_entry, tmp.underflow);
	if (ret != 0)
		goto free_newinfo;

	duprintf("ip_tables: Translated table\n");

1326
	ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,
1327
			   tmp.num_counters, tmp.counters);
1328 1329 1330 1331 1332
	if (ret)
		goto free_newinfo_untrans;
	return 0;

 free_newinfo_untrans:
1333
	IPT_ENTRY_ITERATE(loc_cpu_entry, newinfo->size, cleanup_entry, net, NULL);
1334 1335 1336 1337 1338
 free_newinfo:
	xt_free_table_info(newinfo);
	return ret;
}

1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350
/* We're lazy, and add to the first CPU; overflow works its fey magic
 * and everything is OK. */
static int
add_counter_to_entry(struct ipt_entry *e,
		     const struct xt_counters addme[],
		     unsigned int *i)
{
	ADD_COUNTER(e->counters, addme[*i].bcnt, addme[*i].pcnt);

	(*i)++;
	return 0;
}
1351 1352

static int
1353
do_add_counters(struct net *net, void __user *user, unsigned int len, int compat)
1354
{
1355
	unsigned int i, curcpu;
1356 1357 1358
	struct xt_counters_info tmp;
	struct xt_counters *paddc;
	unsigned int num_counters;
1359
	const char *name;
1360 1361
	int size;
	void *ptmp;
1362
	struct xt_table *t;
1363
	const struct xt_table_info *private;
1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404
	int ret = 0;
	void *loc_cpu_entry;
#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;

	paddc = vmalloc_node(len - size, numa_node_id());
	if (!paddc)
		return -ENOMEM;

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

1405
	t = xt_find_table_lock(net, AF_INET, name);
1406 1407 1408 1409 1410
	if (!t || IS_ERR(t)) {
		ret = t ? PTR_ERR(t) : -ENOENT;
		goto free;
	}

1411
	local_bh_disable();
1412 1413 1414 1415 1416 1417 1418 1419
	private = t->private;
	if (private->number != num_counters) {
		ret = -EINVAL;
		goto unlock_up_free;
	}

	i = 0;
	/* Choose the copy that is on our node */
1420 1421 1422
	curcpu = smp_processor_id();
	loc_cpu_entry = private->entries[curcpu];
	xt_info_wrlock(curcpu);
1423 1424 1425 1426 1427
	IPT_ENTRY_ITERATE(loc_cpu_entry,
			  private->size,
			  add_counter_to_entry,
			  paddc,
			  &i);
1428
	xt_info_wrunlock(curcpu);
1429
 unlock_up_free:
1430
	local_bh_enable();
1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444
	xt_table_unlock(t);
	module_put(t->me);
 free:
	vfree(paddc);

	return ret;
}

#ifdef CONFIG_COMPAT
struct compat_ipt_replace {
	char			name[IPT_TABLE_MAXNAMELEN];
	u32			valid_hooks;
	u32			num_entries;
	u32			size;
1445 1446
	u32			hook_entry[NF_INET_NUMHOOKS];
	u32			underflow[NF_INET_NUMHOOKS];
1447 1448 1449 1450 1451
	u32			num_counters;
	compat_uptr_t		counters;	/* struct ipt_counters * */
	struct compat_ipt_entry	entries[0];
};

1452 1453
static int
compat_copy_entry_to_user(struct ipt_entry *e, void __user **dstptr,
1454
			  unsigned int *size, struct xt_counters *counters,
1455
			  unsigned int *i)
1456
{
1457
	struct ipt_entry_target *t;
1458 1459 1460 1461 1462 1463 1464 1465
	struct compat_ipt_entry __user *ce;
	u_int16_t target_offset, next_offset;
	compat_uint_t origsize;
	int ret;

	ret = -EFAULT;
	origsize = *size;
	ce = (struct compat_ipt_entry __user *)*dstptr;
1466
	if (copy_to_user(ce, e, sizeof(struct ipt_entry)))
1467 1468
		goto out;

1469 1470 1471
	if (copy_to_user(&ce->counters, &counters[*i], sizeof(counters[*i])))
		goto out;

1472
	*dstptr += sizeof(struct compat_ipt_entry);
1473 1474
	*size -= sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);

1475
	ret = IPT_MATCH_ITERATE(e, xt_compat_match_to_user, dstptr, size);
1476 1477 1478 1479
	target_offset = e->target_offset - (origsize - *size);
	if (ret)
		goto out;
	t = ipt_get_target(e);
1480
	ret = xt_compat_target_to_user(t, dstptr, size);
1481 1482 1483 1484
	if (ret)
		goto out;
	ret = -EFAULT;
	next_offset = e->next_offset - (origsize - *size);
1485
	if (put_user(target_offset, &ce->target_offset))
1486
		goto out;
1487
	if (put_user(next_offset, &ce->next_offset))
1488
		goto out;
1489 1490

	(*i)++;
1491 1492 1493 1494 1495
	return 0;
out:
	return ret;
}

1496
static int
1497
compat_find_calc_match(struct ipt_entry_match *m,
1498 1499 1500
		       const char *name,
		       const struct ipt_ip *ip,
		       unsigned int hookmask,
1501
		       int *size, unsigned int *i)
1502
{
1503
	struct xt_match *match;
1504 1505

	match = try_then_request_module(xt_find_match(AF_INET, m->u.user.name,
1506
						      m->u.user.revision),
1507 1508 1509
					"ipt_%s", m->u.user.name);
	if (IS_ERR(match) || !match) {
		duprintf("compat_check_calc_match: `%s' not found\n",
1510
			 m->u.user.name);
1511 1512 1513
		return match ? PTR_ERR(match) : -ENOENT;
	}
	m->u.kernel.match = match;
1514
	*size += xt_compat_match_offset(match);
1515 1516 1517 1518 1519

	(*i)++;
	return 0;
}

1520
static int
1521 1522 1523 1524 1525 1526 1527 1528 1529
compat_release_match(struct ipt_entry_match *m, unsigned int *i)
{
	if (i && (*i)-- == 0)
		return 1;

	module_put(m->u.kernel.match->me);
	return 0;
}

1530
static int
1531
compat_release_entry(struct compat_ipt_entry *e, unsigned int *i)
1532 1533 1534 1535 1536 1537 1538
{
	struct ipt_entry_target *t;

	if (i && (*i)-- == 0)
		return 1;

	/* Cleanup all matches */
1539 1540
	COMPAT_IPT_MATCH_ITERATE(e, compat_release_match, NULL);
	t = compat_ipt_get_target(e);
1541 1542 1543 1544
	module_put(t->u.kernel.target->me);
	return 0;
}

1545
static int
1546
check_compat_entry_size_and_hooks(struct compat_ipt_entry *e,
1547 1548 1549 1550 1551 1552 1553 1554
				  struct xt_table_info *newinfo,
				  unsigned int *size,
				  unsigned char *base,
				  unsigned char *limit,
				  unsigned int *hook_entries,
				  unsigned int *underflows,
				  unsigned int *i,
				  const char *name)
1555 1556
{
	struct ipt_entry_target *t;
1557
	struct xt_target *target;
1558
	unsigned int entry_offset;
1559 1560
	unsigned int j;
	int ret, off, h;
1561 1562

	duprintf("check_compat_entry_size_and_hooks %p\n", e);
1563 1564
	if ((unsigned long)e % __alignof__(struct compat_ipt_entry) != 0 ||
	    (unsigned char *)e + sizeof(struct compat_ipt_entry) >= limit) {
1565 1566 1567 1568 1569
		duprintf("Bad offset %p, limit = %p\n", e, limit);
		return -EINVAL;
	}

	if (e->next_offset < sizeof(struct compat_ipt_entry) +
1570
			     sizeof(struct compat_xt_entry_target)) {
1571 1572 1573 1574 1575
		duprintf("checking: element %p size %u\n",
			 e, e->next_offset);
		return -EINVAL;
	}

1576 1577
	/* For purposes of check_entry casting the compat entry is fine */
	ret = check_entry((struct ipt_entry *)e, name);
1578 1579
	if (ret)
		return ret;
1580

1581
	off = sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);
1582 1583
	entry_offset = (void *)e - (void *)base;
	j = 0;
1584 1585
	ret = COMPAT_IPT_MATCH_ITERATE(e, compat_find_calc_match, name,
				       &e->ip, e->comefrom, &off, &j);
1586
	if (ret != 0)
1587
		goto release_matches;
1588

1589
	t = compat_ipt_get_target(e);
1590
	target = try_then_request_module(xt_find_target(AF_INET,
1591 1592
							t->u.user.name,
							t->u.user.revision),
1593 1594
					 "ipt_%s", t->u.user.name);
	if (IS_ERR(target) || !target) {
1595
		duprintf("check_compat_entry_size_and_hooks: `%s' not found\n",
1596
			 t->u.user.name);
1597
		ret = target ? PTR_ERR(target) : -ENOENT;
1598
		goto release_matches;
1599 1600 1601
	}
	t->u.kernel.target = target;

1602
	off += xt_compat_target_offset(target);
1603
	*size += off;
1604
	ret = xt_compat_add_offset(AF_INET, entry_offset, off);
1605 1606 1607 1608
	if (ret)
		goto out;

	/* Check hooks & underflows */
1609
	for (h = 0; h < NF_INET_NUMHOOKS; h++) {
1610 1611 1612 1613 1614 1615 1616
		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 */
1617
	memset(&e->counters, 0, sizeof(e->counters));
1618 1619 1620 1621
	e->comefrom = 0;

	(*i)++;
	return 0;
1622

1623
out:
1624
	module_put(t->u.kernel.target->me);
1625 1626
release_matches:
	IPT_MATCH_ITERATE(e, compat_release_match, &j);
1627 1628 1629
	return ret;
}

1630
static int
1631
compat_copy_entry_from_user(struct compat_ipt_entry *e, void **dstptr,
1632 1633
			    unsigned int *size, const char *name,
			    struct xt_table_info *newinfo, unsigned char *base)
1634 1635
{
	struct ipt_entry_target *t;
1636
	struct xt_target *target;
1637 1638
	struct ipt_entry *de;
	unsigned int origsize;
1639
	int ret, h;
1640 1641 1642 1643 1644

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

1647
	*dstptr += sizeof(struct ipt_entry);
1648 1649
	*size += sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);

1650 1651
	ret = COMPAT_IPT_MATCH_ITERATE(e, xt_compat_match_from_user,
				       dstptr, size);
1652
	if (ret)
1653
		return ret;
1654
	de->target_offset = e->target_offset - (origsize - *size);
1655
	t = compat_ipt_get_target(e);
1656
	target = t->u.kernel.target;
1657
	xt_compat_target_from_user(t, dstptr, size);
1658 1659

	de->next_offset = e->next_offset - (origsize - *size);
1660
	for (h = 0; h < NF_INET_NUMHOOKS; h++) {
1661 1662 1663 1664 1665
		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;
	}
1666 1667 1668
	return ret;
}

1669
static int
1670
compat_check_entry(struct ipt_entry *e, struct net *net, const char *name,
1671
				     unsigned int *i)
1672
{
1673
	struct xt_mtchk_param mtpar;
1674 1675
	unsigned int j;
	int ret;
1676

1677
	j = 0;
1678
	mtpar.net	= net;
1679 1680 1681
	mtpar.table     = name;
	mtpar.entryinfo = &e->ip;
	mtpar.hook_mask = e->comefrom;
1682
	mtpar.family    = NFPROTO_IPV4;
1683
	ret = IPT_MATCH_ITERATE(e, check_match, &mtpar, &j);
1684
	if (ret)
1685 1686
		goto cleanup_matches;

1687
	ret = check_target(e, net, name);
1688 1689
	if (ret)
		goto cleanup_matches;
1690

1691 1692 1693 1694
	(*i)++;
	return 0;

 cleanup_matches:
1695
	IPT_MATCH_ITERATE(e, cleanup_match, net, &j);
1696
	return ret;
1697 1698
}

L
Linus Torvalds 已提交
1699
static int
1700 1701
translate_compat_table(struct net *net,
		       const char *name,
1702 1703 1704 1705 1706 1707 1708
		       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 已提交
1709
{
1710
	unsigned int i, j;
1711 1712 1713
	struct xt_table_info *newinfo, *info;
	void *pos, *entry0, *entry1;
	unsigned int size;
L
Linus Torvalds 已提交
1714 1715
	int ret;

1716 1717 1718 1719 1720 1721
	info = *pinfo;
	entry0 = *pentry0;
	size = total_size;
	info->number = number;

	/* Init all hooks to impossible value. */
1722
	for (i = 0; i < NF_INET_NUMHOOKS; i++) {
1723 1724 1725 1726 1727
		info->hook_entry[i] = 0xFFFFFFFF;
		info->underflow[i] = 0xFFFFFFFF;
	}

	duprintf("translate_compat_table: size %u\n", info->size);
1728
	j = 0;
1729 1730
	xt_compat_lock(AF_INET);
	/* Walk through entries, checking offsets. */
1731 1732 1733 1734 1735
	ret = COMPAT_IPT_ENTRY_ITERATE(entry0, total_size,
				       check_compat_entry_size_and_hooks,
				       info, &size, entry0,
				       entry0 + total_size,
				       hook_entries, underflows, &j, name);
1736 1737 1738 1739
	if (ret != 0)
		goto out_unlock;

	ret = -EINVAL;
1740
	if (j != number) {
1741
		duprintf("translate_compat_table: %u not %u entries\n",
1742
			 j, number);
1743 1744 1745 1746
		goto out_unlock;
	}

	/* Check hooks all assigned */
1747
	for (i = 0; i < NF_INET_NUMHOOKS; i++) {
1748 1749 1750 1751 1752 1753 1754
		/* 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 已提交
1755
		}
1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768
		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;
1769
	for (i = 0; i < NF_INET_NUMHOOKS; i++) {
1770 1771 1772 1773 1774
		newinfo->hook_entry[i] = info->hook_entry[i];
		newinfo->underflow[i] = info->underflow[i];
	}
	entry1 = newinfo->entries[raw_smp_processor_id()];
	pos = entry1;
1775
	size = total_size;
1776
	ret = COMPAT_IPT_ENTRY_ITERATE(entry0, total_size,
1777 1778
				       compat_copy_entry_from_user,
				       &pos, &size, name, newinfo, entry1);
1779
	xt_compat_flush_offsets(AF_INET);
1780 1781 1782 1783 1784 1785 1786 1787
	xt_compat_unlock(AF_INET);
	if (ret)
		goto free_newinfo;

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

1788
	i = 0;
1789
	ret = IPT_ENTRY_ITERATE(entry1, newinfo->size, compat_check_entry,
1790
				net, name, &i);
1791 1792
	if (ret) {
		j -= i;
1793 1794
		COMPAT_IPT_ENTRY_ITERATE_CONTINUE(entry0, newinfo->size, i,
						  compat_release_entry, &j);
1795
		IPT_ENTRY_ITERATE(entry1, newinfo->size, cleanup_entry, net, &i);
1796 1797 1798
		xt_free_table_info(newinfo);
		return ret;
	}
1799

1800
	/* And one copy for every other CPU */
A
Andrew Morton 已提交
1801
	for_each_possible_cpu(i)
1802 1803 1804 1805 1806 1807 1808
		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 已提交
1809

1810 1811 1812
free_newinfo:
	xt_free_table_info(newinfo);
out:
1813
	COMPAT_IPT_ENTRY_ITERATE(entry0, total_size, compat_release_entry, &j);
L
Linus Torvalds 已提交
1814
	return ret;
1815
out_unlock:
1816
	xt_compat_flush_offsets(AF_INET);
1817 1818
	xt_compat_unlock(AF_INET);
	goto out;
L
Linus Torvalds 已提交
1819 1820 1821
}

static int
1822
compat_do_replace(struct net *net, void __user *user, unsigned int len)
L
Linus Torvalds 已提交
1823 1824
{
	int ret;
1825 1826 1827
	struct compat_ipt_replace tmp;
	struct xt_table_info *newinfo;
	void *loc_cpu_entry;
L
Linus Torvalds 已提交
1828 1829 1830 1831

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

1832
	/* overflow check */
1833
	if (tmp.size >= INT_MAX / num_possible_cpus())
1834 1835 1836 1837
		return -ENOMEM;
	if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))
		return -ENOMEM;

1838
	newinfo = xt_alloc_table_info(tmp.size);
L
Linus Torvalds 已提交
1839 1840 1841
	if (!newinfo)
		return -ENOMEM;

1842
	/* choose the copy that is on our node/cpu */
1843 1844
	loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
	if (copy_from_user(loc_cpu_entry, user + sizeof(tmp),
L
Linus Torvalds 已提交
1845 1846 1847 1848 1849
			   tmp.size) != 0) {
		ret = -EFAULT;
		goto free_newinfo;
	}

1850
	ret = translate_compat_table(net, tmp.name, tmp.valid_hooks,
1851 1852 1853
				     &newinfo, &loc_cpu_entry, tmp.size,
				     tmp.num_entries, tmp.hook_entry,
				     tmp.underflow);
1854
	if (ret != 0)
L
Linus Torvalds 已提交
1855 1856
		goto free_newinfo;

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

1859
	ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,
1860
			   tmp.num_counters, compat_ptr(tmp.counters));
1861 1862 1863
	if (ret)
		goto free_newinfo_untrans;
	return 0;
L
Linus Torvalds 已提交
1864

1865
 free_newinfo_untrans:
1866
	IPT_ENTRY_ITERATE(loc_cpu_entry, newinfo->size, cleanup_entry, net, NULL);
1867 1868 1869 1870
 free_newinfo:
	xt_free_table_info(newinfo);
	return ret;
}
L
Linus Torvalds 已提交
1871

1872 1873
static int
compat_do_ipt_set_ctl(struct sock *sk,	int cmd, void __user *user,
1874
		      unsigned int len)
1875 1876
{
	int ret;
L
Linus Torvalds 已提交
1877

1878 1879
	if (!capable(CAP_NET_ADMIN))
		return -EPERM;
L
Linus Torvalds 已提交
1880

1881 1882
	switch (cmd) {
	case IPT_SO_SET_REPLACE:
1883
		ret = compat_do_replace(sock_net(sk), user, len);
1884
		break;
L
Linus Torvalds 已提交
1885

1886
	case IPT_SO_SET_ADD_COUNTERS:
1887
		ret = do_add_counters(sock_net(sk), user, len, 1);
1888 1889 1890 1891 1892 1893
		break;

	default:
		duprintf("do_ipt_set_ctl:  unknown request %i\n", cmd);
		ret = -EINVAL;
	}
L
Linus Torvalds 已提交
1894 1895 1896 1897

	return ret;
}

1898
struct compat_ipt_get_entries {
1899 1900 1901 1902
	char name[IPT_TABLE_MAXNAMELEN];
	compat_uint_t size;
	struct compat_ipt_entry entrytable[0];
};
L
Linus Torvalds 已提交
1903

1904 1905 1906
static int
compat_copy_entries_to_user(unsigned int total_size, struct xt_table *table,
			    void __user *userptr)
1907 1908
{
	struct xt_counters *counters;
1909
	const struct xt_table_info *private = table->private;
1910 1911 1912
	void __user *pos;
	unsigned int size;
	int ret = 0;
1913
	const void *loc_cpu_entry;
1914
	unsigned int i = 0;
L
Linus Torvalds 已提交
1915

1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927
	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;
	ret = IPT_ENTRY_ITERATE(loc_cpu_entry, total_size,
1928 1929
				compat_copy_entry_to_user,
				&pos, &size, counters, &i);
1930 1931 1932

	vfree(counters);
	return ret;
L
Linus Torvalds 已提交
1933 1934 1935
}

static int
1936 1937
compat_get_entries(struct net *net, struct compat_ipt_get_entries __user *uptr,
		   int *len)
L
Linus Torvalds 已提交
1938
{
1939 1940
	int ret;
	struct compat_ipt_get_entries get;
1941
	struct xt_table *t;
L
Linus Torvalds 已提交
1942

1943
	if (*len < sizeof(get)) {
1944
		duprintf("compat_get_entries: %u < %zu\n", *len, sizeof(get));
L
Linus Torvalds 已提交
1945
		return -EINVAL;
1946
	}
L
Linus Torvalds 已提交
1947

1948 1949
	if (copy_from_user(&get, uptr, sizeof(get)) != 0)
		return -EFAULT;
L
Linus Torvalds 已提交
1950

1951
	if (*len != sizeof(struct compat_ipt_get_entries) + get.size) {
1952 1953
		duprintf("compat_get_entries: %u != %zu\n",
			 *len, sizeof(get) + get.size);
1954
		return -EINVAL;
L
Linus Torvalds 已提交
1955 1956
	}

1957
	xt_compat_lock(AF_INET);
1958
	t = xt_find_table_lock(net, AF_INET, get.name);
1959
	if (t && !IS_ERR(t)) {
1960
		const struct xt_table_info *private = t->private;
1961
		struct xt_table_info info;
1962
		duprintf("t->private->number = %u\n", private->number);
1963 1964 1965
		ret = compat_table_info(private, &info);
		if (!ret && get.size == info.size) {
			ret = compat_copy_entries_to_user(private->size,
1966
							  t, uptr->entrytable);
1967 1968
		} else if (!ret) {
			duprintf("compat_get_entries: I've got %u not %u!\n",
1969
				 private->size, get.size);
1970
			ret = -EAGAIN;
1971
		}
1972
		xt_compat_flush_offsets(AF_INET);
1973 1974 1975
		module_put(t->me);
		xt_table_unlock(t);
	} else
L
Linus Torvalds 已提交
1976 1977
		ret = t ? PTR_ERR(t) : -ENOENT;

1978 1979 1980
	xt_compat_unlock(AF_INET);
	return ret;
}
L
Linus Torvalds 已提交
1981

1982 1983
static int do_ipt_get_ctl(struct sock *, int, void __user *, int *);

1984 1985 1986 1987
static int
compat_do_ipt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len)
{
	int ret;
L
Linus Torvalds 已提交
1988

1989 1990 1991
	if (!capable(CAP_NET_ADMIN))
		return -EPERM;

1992 1993
	switch (cmd) {
	case IPT_SO_GET_INFO:
1994
		ret = get_info(sock_net(sk), user, len, 1);
1995 1996
		break;
	case IPT_SO_GET_ENTRIES:
1997
		ret = compat_get_entries(sock_net(sk), user, len);
1998 1999
		break;
	default:
2000
		ret = do_ipt_get_ctl(sk, cmd, user, len);
2001
	}
L
Linus Torvalds 已提交
2002 2003
	return ret;
}
2004
#endif
L
Linus Torvalds 已提交
2005 2006

static int
2007
do_ipt_set_ctl(struct sock *sk, int cmd, void __user *user, unsigned int len)
L
Linus Torvalds 已提交
2008 2009 2010 2011 2012 2013 2014 2015
{
	int ret;

	if (!capable(CAP_NET_ADMIN))
		return -EPERM;

	switch (cmd) {
	case IPT_SO_SET_REPLACE:
2016
		ret = do_replace(sock_net(sk), user, len);
L
Linus Torvalds 已提交
2017 2018 2019
		break;

	case IPT_SO_SET_ADD_COUNTERS:
2020
		ret = do_add_counters(sock_net(sk), user, len, 0);
L
Linus Torvalds 已提交
2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039
		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;

	if (!capable(CAP_NET_ADMIN))
		return -EPERM;

	switch (cmd) {
2040
	case IPT_SO_GET_INFO:
2041
		ret = get_info(sock_net(sk), user, len, 0);
2042
		break;
L
Linus Torvalds 已提交
2043

2044
	case IPT_SO_GET_ENTRIES:
2045
		ret = get_entries(sock_net(sk), user, len);
L
Linus Torvalds 已提交
2046 2047 2048 2049 2050
		break;

	case IPT_SO_GET_REVISION_MATCH:
	case IPT_SO_GET_REVISION_TARGET: {
		struct ipt_get_revision rev;
2051
		int target;
L
Linus Torvalds 已提交
2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062

		if (*len != sizeof(rev)) {
			ret = -EINVAL;
			break;
		}
		if (copy_from_user(&rev, user, sizeof(rev)) != 0) {
			ret = -EFAULT;
			break;
		}

		if (cmd == IPT_SO_GET_REVISION_TARGET)
2063
			target = 1;
L
Linus Torvalds 已提交
2064
		else
2065
			target = 0;
L
Linus Torvalds 已提交
2066

2067 2068 2069
		try_then_request_module(xt_find_revision(AF_INET, rev.name,
							 rev.revision,
							 target, &ret),
L
Linus Torvalds 已提交
2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081
					"ipt_%s", rev.name);
		break;
	}

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

	return ret;
}

2082 2083
struct xt_table *ipt_register_table(struct net *net,
				    const struct xt_table *table,
2084
				    const struct ipt_replace *repl)
L
Linus Torvalds 已提交
2085 2086
{
	int ret;
2087
	struct xt_table_info *newinfo;
2088
	struct xt_table_info bootstrap
L
Linus Torvalds 已提交
2089
		= { 0, 0, 0, { 0 }, { 0 }, { } };
2090
	void *loc_cpu_entry;
2091
	struct xt_table *new_table;
L
Linus Torvalds 已提交
2092

2093
	newinfo = xt_alloc_table_info(repl->size);
2094 2095 2096 2097
	if (!newinfo) {
		ret = -ENOMEM;
		goto out;
	}
L
Linus Torvalds 已提交
2098

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

2103
	ret = translate_table(net, table->name, table->valid_hooks,
2104
			      newinfo, loc_cpu_entry, repl->size,
L
Linus Torvalds 已提交
2105 2106 2107
			      repl->num_entries,
			      repl->hook_entry,
			      repl->underflow);
2108 2109
	if (ret != 0)
		goto out_free;
L
Linus Torvalds 已提交
2110

2111
	new_table = xt_register_table(net, table, &bootstrap, newinfo);
2112
	if (IS_ERR(new_table)) {
2113 2114
		ret = PTR_ERR(new_table);
		goto out_free;
L
Linus Torvalds 已提交
2115 2116
	}

2117 2118 2119 2120 2121 2122
	return new_table;

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

2125
void ipt_unregister_table(struct net *net, struct xt_table *table)
L
Linus Torvalds 已提交
2126
{
2127
	struct xt_table_info *private;
2128
	void *loc_cpu_entry;
2129
	struct module *table_owner = table->me;
2130

2131
	private = xt_unregister_table(table);
L
Linus Torvalds 已提交
2132 2133

	/* Decrease module usage counts and free resources */
2134
	loc_cpu_entry = private->entries[raw_smp_processor_id()];
2135
	IPT_ENTRY_ITERATE(loc_cpu_entry, private->size, cleanup_entry, net, NULL);
2136 2137
	if (private->number > private->initial_entries)
		module_put(table_owner);
2138
	xt_free_table_info(private);
L
Linus Torvalds 已提交
2139 2140 2141
}

/* Returns 1 if the type and code is matched by the range, 0 otherwise */
2142
static inline bool
L
Linus Torvalds 已提交
2143 2144
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,
2145
		     bool invert)
L
Linus Torvalds 已提交
2146
{
2147 2148
	return ((test_type == 0xFF) ||
		(type == test_type && code >= min_code && code <= max_code))
L
Linus Torvalds 已提交
2149 2150 2151
		^ invert;
}

2152
static bool
2153
icmp_match(const struct sk_buff *skb, const struct xt_match_param *par)
L
Linus Torvalds 已提交
2154
{
2155 2156
	const struct icmphdr *ic;
	struct icmphdr _icmph;
2157
	const struct ipt_icmp *icmpinfo = par->matchinfo;
L
Linus Torvalds 已提交
2158 2159

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

2163
	ic = skb_header_pointer(skb, par->thoff, sizeof(_icmph), &_icmph);
L
Linus Torvalds 已提交
2164 2165 2166 2167 2168
	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");
2169
		*par->hotdrop = true;
2170
		return false;
L
Linus Torvalds 已提交
2171 2172 2173 2174 2175 2176 2177 2178 2179
	}

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

2180
static bool icmp_checkentry(const struct xt_mtchk_param *par)
L
Linus Torvalds 已提交
2181
{
2182
	const struct ipt_icmp *icmpinfo = par->matchinfo;
L
Linus Torvalds 已提交
2183

2184 2185
	/* Must specify no unknown invflags */
	return !(icmpinfo->invflags & ~IPT_ICMP_INV);
L
Linus Torvalds 已提交
2186 2187 2188
}

/* The built-in targets: standard (NULL) and error. */
2189
static struct xt_target ipt_standard_target __read_mostly = {
L
Linus Torvalds 已提交
2190
	.name		= IPT_STANDARD_TARGET,
2191
	.targetsize	= sizeof(int),
2192
	.family		= NFPROTO_IPV4,
2193
#ifdef CONFIG_COMPAT
2194 2195 2196
	.compatsize	= sizeof(compat_int_t),
	.compat_from_user = compat_standard_from_user,
	.compat_to_user	= compat_standard_to_user,
2197
#endif
L
Linus Torvalds 已提交
2198 2199
};

2200
static struct xt_target ipt_error_target __read_mostly = {
L
Linus Torvalds 已提交
2201 2202
	.name		= IPT_ERROR_TARGET,
	.target		= ipt_error,
2203
	.targetsize	= IPT_FUNCTION_MAXNAMELEN,
2204
	.family		= NFPROTO_IPV4,
L
Linus Torvalds 已提交
2205 2206 2207 2208 2209 2210 2211
};

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,
2212 2213 2214
#ifdef CONFIG_COMPAT
	.compat_set	= compat_do_ipt_set_ctl,
#endif
L
Linus Torvalds 已提交
2215 2216 2217
	.get_optmin	= IPT_BASE_CTL,
	.get_optmax	= IPT_SO_GET_MAX+1,
	.get		= do_ipt_get_ctl,
2218 2219 2220
#ifdef CONFIG_COMPAT
	.compat_get	= compat_do_ipt_get_ctl,
#endif
2221
	.owner		= THIS_MODULE,
L
Linus Torvalds 已提交
2222 2223
};

2224
static struct xt_match icmp_matchstruct __read_mostly = {
L
Linus Torvalds 已提交
2225
	.name		= "icmp",
2226 2227
	.match		= icmp_match,
	.matchsize	= sizeof(struct ipt_icmp),
2228
	.checkentry	= icmp_checkentry,
2229
	.proto		= IPPROTO_ICMP,
2230
	.family		= NFPROTO_IPV4,
L
Linus Torvalds 已提交
2231 2232
};

2233 2234
static int __net_init ip_tables_net_init(struct net *net)
{
2235
	return xt_proto_init(net, NFPROTO_IPV4);
2236 2237 2238 2239
}

static void __net_exit ip_tables_net_exit(struct net *net)
{
2240
	xt_proto_fini(net, NFPROTO_IPV4);
2241 2242 2243 2244 2245 2246 2247
}

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

2248
static int __init ip_tables_init(void)
L
Linus Torvalds 已提交
2249 2250 2251
{
	int ret;

2252
	ret = register_pernet_subsys(&ip_tables_net_ops);
2253 2254
	if (ret < 0)
		goto err1;
2255

L
Linus Torvalds 已提交
2256
	/* Noone else will be downing sem now, so we won't sleep */
2257 2258 2259 2260 2261 2262 2263 2264 2265
	ret = xt_register_target(&ipt_standard_target);
	if (ret < 0)
		goto err2;
	ret = xt_register_target(&ipt_error_target);
	if (ret < 0)
		goto err3;
	ret = xt_register_match(&icmp_matchstruct);
	if (ret < 0)
		goto err4;
L
Linus Torvalds 已提交
2266 2267 2268

	/* Register setsockopt */
	ret = nf_register_sockopt(&ipt_sockopts);
2269 2270
	if (ret < 0)
		goto err5;
L
Linus Torvalds 已提交
2271

2272
	printk(KERN_INFO "ip_tables: (C) 2000-2006 Netfilter Core Team\n");
L
Linus Torvalds 已提交
2273
	return 0;
2274 2275 2276 2277 2278 2279 2280 2281

err5:
	xt_unregister_match(&icmp_matchstruct);
err4:
	xt_unregister_target(&ipt_error_target);
err3:
	xt_unregister_target(&ipt_standard_target);
err2:
2282
	unregister_pernet_subsys(&ip_tables_net_ops);
2283 2284
err1:
	return ret;
L
Linus Torvalds 已提交
2285 2286
}

2287
static void __exit ip_tables_fini(void)
L
Linus Torvalds 已提交
2288 2289
{
	nf_unregister_sockopt(&ipt_sockopts);
2290

2291 2292 2293
	xt_unregister_match(&icmp_matchstruct);
	xt_unregister_target(&ipt_error_target);
	xt_unregister_target(&ipt_standard_target);
2294

2295
	unregister_pernet_subsys(&ip_tables_net_ops);
L
Linus Torvalds 已提交
2296 2297 2298 2299 2300
}

EXPORT_SYMBOL(ipt_register_table);
EXPORT_SYMBOL(ipt_unregister_table);
EXPORT_SYMBOL(ipt_do_table);
2301 2302
module_init(ip_tables_init);
module_exit(ip_tables_fini);