x_tables.c 24.2 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
/*
 * x_tables core - Backend for {ip,ip6,arp}_tables
 *
 * Copyright (C) 2006-2006 Harald Welte <laforge@netfilter.org>
 *
 * Based on existing ip_tables code which is
 *   Copyright (C) 1999 Paul `Rusty' Russell & Michael J. Neuling
 *   Copyright (C) 2000-2005 Netfilter Core Team <coreteam@netfilter.org>
 *
 * 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.
 *
 */

#include <linux/kernel.h>
#include <linux/socket.h>
#include <linux/net.h>
#include <linux/proc_fs.h>
#include <linux/seq_file.h>
#include <linux/string.h>
#include <linux/vmalloc.h>
I
Ingo Molnar 已提交
23
#include <linux/mutex.h>
A
Al Viro 已提交
24
#include <linux/mm.h>
25
#include <net/net_namespace.h>
26 27 28 29

#include <linux/netfilter/x_tables.h>
#include <linux/netfilter_arp.h>

I
Ingo Molnar 已提交
30

31 32 33 34 35 36
MODULE_LICENSE("GPL");
MODULE_AUTHOR("Harald Welte <laforge@netfilter.org>");
MODULE_DESCRIPTION("[ip,ip6,arp]_tables backend module");

#define SMP_ALIGN(x) (((x) + SMP_CACHE_BYTES-1) & ~(SMP_CACHE_BYTES-1))

37 38 39 40 41 42
struct compat_delta {
	struct compat_delta *next;
	unsigned int offset;
	short delta;
};

43
struct xt_af {
I
Ingo Molnar 已提交
44
	struct mutex mutex;
45 46
	struct list_head match;
	struct list_head target;
47
#ifdef CONFIG_COMPAT
48
	struct mutex compat_mutex;
49 50
	struct compat_delta *compat_offsets;
#endif
51 52 53 54 55 56 57 58 59 60
};

static struct xt_af *xt;

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

61
static const char *const xt_prefix[NPROTO] = {
62 63
	[AF_INET]	= "ip",
	[AF_INET6]	= "ip6",
64 65 66
	[NF_ARP]	= "arp",
};

67 68
/* Registration hooks for targets. */
int
69
xt_register_target(struct xt_target *target)
70
{
71
	int ret, af = target->family;
72

I
Ingo Molnar 已提交
73
	ret = mutex_lock_interruptible(&xt[af].mutex);
74 75 76
	if (ret != 0)
		return ret;
	list_add(&target->list, &xt[af].target);
I
Ingo Molnar 已提交
77
	mutex_unlock(&xt[af].mutex);
78 79 80 81 82
	return ret;
}
EXPORT_SYMBOL(xt_register_target);

void
83
xt_unregister_target(struct xt_target *target)
84
{
85 86
	int af = target->family;

I
Ingo Molnar 已提交
87
	mutex_lock(&xt[af].mutex);
P
Patrick McHardy 已提交
88
	list_del(&target->list);
I
Ingo Molnar 已提交
89
	mutex_unlock(&xt[af].mutex);
90 91 92
}
EXPORT_SYMBOL(xt_unregister_target);

93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122
int
xt_register_targets(struct xt_target *target, unsigned int n)
{
	unsigned int i;
	int err = 0;

	for (i = 0; i < n; i++) {
		err = xt_register_target(&target[i]);
		if (err)
			goto err;
	}
	return err;

err:
	if (i > 0)
		xt_unregister_targets(target, i);
	return err;
}
EXPORT_SYMBOL(xt_register_targets);

void
xt_unregister_targets(struct xt_target *target, unsigned int n)
{
	unsigned int i;

	for (i = 0; i < n; i++)
		xt_unregister_target(&target[i]);
}
EXPORT_SYMBOL(xt_unregister_targets);

123
int
124
xt_register_match(struct xt_match *match)
125
{
126
	int ret, af = match->family;
127

I
Ingo Molnar 已提交
128
	ret = mutex_lock_interruptible(&xt[af].mutex);
129 130 131 132
	if (ret != 0)
		return ret;

	list_add(&match->list, &xt[af].match);
I
Ingo Molnar 已提交
133
	mutex_unlock(&xt[af].mutex);
134 135 136 137 138 139

	return ret;
}
EXPORT_SYMBOL(xt_register_match);

void
140
xt_unregister_match(struct xt_match *match)
141
{
142 143
	int af =  match->family;

I
Ingo Molnar 已提交
144
	mutex_lock(&xt[af].mutex);
P
Patrick McHardy 已提交
145
	list_del(&match->list);
I
Ingo Molnar 已提交
146
	mutex_unlock(&xt[af].mutex);
147 148 149
}
EXPORT_SYMBOL(xt_unregister_match);

150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179
int
xt_register_matches(struct xt_match *match, unsigned int n)
{
	unsigned int i;
	int err = 0;

	for (i = 0; i < n; i++) {
		err = xt_register_match(&match[i]);
		if (err)
			goto err;
	}
	return err;

err:
	if (i > 0)
		xt_unregister_matches(match, i);
	return err;
}
EXPORT_SYMBOL(xt_register_matches);

void
xt_unregister_matches(struct xt_match *match, unsigned int n)
{
	unsigned int i;

	for (i = 0; i < n; i++)
		xt_unregister_match(&match[i]);
}
EXPORT_SYMBOL(xt_unregister_matches);

180 181 182 183 184 185 186 187 188 189 190 191 192

/*
 * These are weird, but module loading must not be done with mutex
 * held (since they will register), and we have to have a single
 * function to use try_then_request_module().
 */

/* Find match, grabs ref.  Returns ERR_PTR() on error. */
struct xt_match *xt_find_match(int af, const char *name, u8 revision)
{
	struct xt_match *m;
	int err = 0;

I
Ingo Molnar 已提交
193
	if (mutex_lock_interruptible(&xt[af].mutex) != 0)
194 195 196 197 198 199
		return ERR_PTR(-EINTR);

	list_for_each_entry(m, &xt[af].match, list) {
		if (strcmp(m->name, name) == 0) {
			if (m->revision == revision) {
				if (try_module_get(m->me)) {
I
Ingo Molnar 已提交
200
					mutex_unlock(&xt[af].mutex);
201 202 203 204 205 206
					return m;
				}
			} else
				err = -EPROTOTYPE; /* Found something. */
		}
	}
I
Ingo Molnar 已提交
207
	mutex_unlock(&xt[af].mutex);
208 209 210 211 212 213 214 215 216 217
	return ERR_PTR(err);
}
EXPORT_SYMBOL(xt_find_match);

/* Find target, grabs ref.  Returns ERR_PTR() on error. */
struct xt_target *xt_find_target(int af, const char *name, u8 revision)
{
	struct xt_target *t;
	int err = 0;

I
Ingo Molnar 已提交
218
	if (mutex_lock_interruptible(&xt[af].mutex) != 0)
219 220 221 222 223 224
		return ERR_PTR(-EINTR);

	list_for_each_entry(t, &xt[af].target, list) {
		if (strcmp(t->name, name) == 0) {
			if (t->revision == revision) {
				if (try_module_get(t->me)) {
I
Ingo Molnar 已提交
225
					mutex_unlock(&xt[af].mutex);
226 227 228 229 230 231
					return t;
				}
			} else
				err = -EPROTOTYPE; /* Found something. */
		}
	}
I
Ingo Molnar 已提交
232
	mutex_unlock(&xt[af].mutex);
233 234 235 236 237 238 239 240 241
	return ERR_PTR(err);
}
EXPORT_SYMBOL(xt_find_target);

struct xt_target *xt_request_find_target(int af, const char *name, u8 revision)
{
	struct xt_target *target;

	target = try_then_request_module(xt_find_target(af, name, revision),
242
					 "%st_%s", xt_prefix[af], name);
243 244 245 246 247 248 249 250
	if (IS_ERR(target) || !target)
		return NULL;
	return target;
}
EXPORT_SYMBOL_GPL(xt_request_find_target);

static int match_revfn(int af, const char *name, u8 revision, int *bestp)
{
251
	const struct xt_match *m;
252 253 254 255 256 257 258 259 260 261 262 263 264 265 266
	int have_rev = 0;

	list_for_each_entry(m, &xt[af].match, list) {
		if (strcmp(m->name, name) == 0) {
			if (m->revision > *bestp)
				*bestp = m->revision;
			if (m->revision == revision)
				have_rev = 1;
		}
	}
	return have_rev;
}

static int target_revfn(int af, const char *name, u8 revision, int *bestp)
{
267
	const struct xt_target *t;
268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286
	int have_rev = 0;

	list_for_each_entry(t, &xt[af].target, list) {
		if (strcmp(t->name, name) == 0) {
			if (t->revision > *bestp)
				*bestp = t->revision;
			if (t->revision == revision)
				have_rev = 1;
		}
	}
	return have_rev;
}

/* Returns true or false (if no such extension at all) */
int xt_find_revision(int af, const char *name, u8 revision, int target,
		     int *err)
{
	int have_rev, best = -1;

I
Ingo Molnar 已提交
287
	if (mutex_lock_interruptible(&xt[af].mutex) != 0) {
288 289 290 291 292 293 294
		*err = -EINTR;
		return 1;
	}
	if (target == 1)
		have_rev = target_revfn(af, name, revision, &best);
	else
		have_rev = match_revfn(af, name, revision, &best);
I
Ingo Molnar 已提交
295
	mutex_unlock(&xt[af].mutex);
296 297 298 299 300 301 302 303 304 305 306 307 308 309

	/* Nothing at all?  Return 0 to try loading module. */
	if (best == -1) {
		*err = -ENOENT;
		return 0;
	}

	*err = best;
	if (!have_rev)
		*err = -EPROTONOSUPPORT;
	return 1;
}
EXPORT_SYMBOL_GPL(xt_find_revision);

310
int xt_check_match(const struct xt_match *match, unsigned short family,
311
		   unsigned int size, const char *table, unsigned int hook_mask,
312 313 314 315 316 317 318 319 320 321 322 323 324 325
		   unsigned short proto, int inv_proto)
{
	if (XT_ALIGN(match->matchsize) != size) {
		printk("%s_tables: %s match: invalid size %Zu != %u\n",
		       xt_prefix[family], match->name,
		       XT_ALIGN(match->matchsize), size);
		return -EINVAL;
	}
	if (match->table && strcmp(match->table, table)) {
		printk("%s_tables: %s match: only valid in %s table, not %s\n",
		       xt_prefix[family], match->name, match->table, table);
		return -EINVAL;
	}
	if (match->hooks && (hook_mask & ~match->hooks) != 0) {
326 327
		printk("%s_tables: %s match: bad hook_mask %u/%u\n",
		       xt_prefix[family], match->name, hook_mask, match->hooks);
328 329 330 331 332 333 334 335 336 337 338
		return -EINVAL;
	}
	if (match->proto && (match->proto != proto || inv_proto)) {
		printk("%s_tables: %s match: only valid for protocol %u\n",
		       xt_prefix[family], match->name, match->proto);
		return -EINVAL;
	}
	return 0;
}
EXPORT_SYMBOL_GPL(xt_check_match);

339
#ifdef CONFIG_COMPAT
340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387
int xt_compat_add_offset(int af, unsigned int offset, short delta)
{
	struct compat_delta *tmp;

	tmp = kmalloc(sizeof(struct compat_delta), GFP_KERNEL);
	if (!tmp)
		return -ENOMEM;

	tmp->offset = offset;
	tmp->delta = delta;

	if (xt[af].compat_offsets) {
		tmp->next = xt[af].compat_offsets->next;
		xt[af].compat_offsets->next = tmp;
	} else {
		xt[af].compat_offsets = tmp;
		tmp->next = NULL;
	}
	return 0;
}
EXPORT_SYMBOL_GPL(xt_compat_add_offset);

void xt_compat_flush_offsets(int af)
{
	struct compat_delta *tmp, *next;

	if (xt[af].compat_offsets) {
		for (tmp = xt[af].compat_offsets; tmp; tmp = next) {
			next = tmp->next;
			kfree(tmp);
		}
		xt[af].compat_offsets = NULL;
	}
}
EXPORT_SYMBOL_GPL(xt_compat_flush_offsets);

short xt_compat_calc_jump(int af, unsigned int offset)
{
	struct compat_delta *tmp;
	short delta;

	for (tmp = xt[af].compat_offsets, delta = 0; tmp; tmp = tmp->next)
		if (tmp->offset < offset)
			delta += tmp->delta;
	return delta;
}
EXPORT_SYMBOL_GPL(xt_compat_calc_jump);

388
int xt_compat_match_offset(const struct xt_match *match)
389
{
390 391 392 393 394
	u_int16_t csize = match->compatsize ? : match->matchsize;
	return XT_ALIGN(match->matchsize) - COMPAT_XT_ALIGN(csize);
}
EXPORT_SYMBOL_GPL(xt_compat_match_offset);

395
int xt_compat_match_from_user(struct xt_entry_match *m, void **dstptr,
396
			      unsigned int *size)
397
{
398
	const struct xt_match *match = m->u.kernel.match;
399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417
	struct compat_xt_entry_match *cm = (struct compat_xt_entry_match *)m;
	int pad, off = xt_compat_match_offset(match);
	u_int16_t msize = cm->u.user.match_size;

	m = *dstptr;
	memcpy(m, cm, sizeof(*cm));
	if (match->compat_from_user)
		match->compat_from_user(m->data, cm->data);
	else
		memcpy(m->data, cm->data, msize - sizeof(*cm));
	pad = XT_ALIGN(match->matchsize) - match->matchsize;
	if (pad > 0)
		memset(m->data + match->matchsize, 0, pad);

	msize += off;
	m->u.user.match_size = msize;

	*size += off;
	*dstptr += msize;
418
	return 0;
419 420 421 422
}
EXPORT_SYMBOL_GPL(xt_compat_match_from_user);

int xt_compat_match_to_user(struct xt_entry_match *m, void __user **dstptr,
423
			    unsigned int *size)
424
{
425
	const struct xt_match *match = m->u.kernel.match;
426 427 428 429 430
	struct compat_xt_entry_match __user *cm = *dstptr;
	int off = xt_compat_match_offset(match);
	u_int16_t msize = m->u.user.match_size - off;

	if (copy_to_user(cm, m, sizeof(*cm)) ||
431 432 433
	    put_user(msize, &cm->u.user.match_size) ||
	    copy_to_user(cm->u.user.name, m->u.kernel.match->name,
			 strlen(m->u.kernel.match->name) + 1))
434
		return -EFAULT;
435 436 437 438 439 440 441

	if (match->compat_to_user) {
		if (match->compat_to_user((void __user *)cm->data, m->data))
			return -EFAULT;
	} else {
		if (copy_to_user(cm->data, m->data, msize - sizeof(*cm)))
			return -EFAULT;
442
	}
443 444 445 446

	*size -= off;
	*dstptr += msize;
	return 0;
447
}
448 449
EXPORT_SYMBOL_GPL(xt_compat_match_to_user);
#endif /* CONFIG_COMPAT */
450

451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466
int xt_check_target(const struct xt_target *target, unsigned short family,
		    unsigned int size, const char *table, unsigned int hook_mask,
		    unsigned short proto, int inv_proto)
{
	if (XT_ALIGN(target->targetsize) != size) {
		printk("%s_tables: %s target: invalid size %Zu != %u\n",
		       xt_prefix[family], target->name,
		       XT_ALIGN(target->targetsize), size);
		return -EINVAL;
	}
	if (target->table && strcmp(target->table, table)) {
		printk("%s_tables: %s target: only valid in %s table, not %s\n",
		       xt_prefix[family], target->name, target->table, table);
		return -EINVAL;
	}
	if (target->hooks && (hook_mask & ~target->hooks) != 0) {
467 468 469
		printk("%s_tables: %s target: bad hook_mask %u/%u\n",
		       xt_prefix[family], target->name, hook_mask,
		       target->hooks);
470 471 472 473 474 475 476 477 478 479 480
		return -EINVAL;
	}
	if (target->proto && (target->proto != proto || inv_proto)) {
		printk("%s_tables: %s target: only valid for protocol %u\n",
		       xt_prefix[family], target->name, target->proto);
		return -EINVAL;
	}
	return 0;
}
EXPORT_SYMBOL_GPL(xt_check_target);

481
#ifdef CONFIG_COMPAT
482
int xt_compat_target_offset(const struct xt_target *target)
483
{
484 485 486 487 488 489
	u_int16_t csize = target->compatsize ? : target->targetsize;
	return XT_ALIGN(target->targetsize) - COMPAT_XT_ALIGN(csize);
}
EXPORT_SYMBOL_GPL(xt_compat_target_offset);

void xt_compat_target_from_user(struct xt_entry_target *t, void **dstptr,
490
				unsigned int *size)
491
{
492
	const struct xt_target *target = t->u.kernel.target;
493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515
	struct compat_xt_entry_target *ct = (struct compat_xt_entry_target *)t;
	int pad, off = xt_compat_target_offset(target);
	u_int16_t tsize = ct->u.user.target_size;

	t = *dstptr;
	memcpy(t, ct, sizeof(*ct));
	if (target->compat_from_user)
		target->compat_from_user(t->data, ct->data);
	else
		memcpy(t->data, ct->data, tsize - sizeof(*ct));
	pad = XT_ALIGN(target->targetsize) - target->targetsize;
	if (pad > 0)
		memset(t->data + target->targetsize, 0, pad);

	tsize += off;
	t->u.user.target_size = tsize;

	*size += off;
	*dstptr += tsize;
}
EXPORT_SYMBOL_GPL(xt_compat_target_from_user);

int xt_compat_target_to_user(struct xt_entry_target *t, void __user **dstptr,
516
			     unsigned int *size)
517
{
518
	const struct xt_target *target = t->u.kernel.target;
519 520 521 522 523
	struct compat_xt_entry_target __user *ct = *dstptr;
	int off = xt_compat_target_offset(target);
	u_int16_t tsize = t->u.user.target_size - off;

	if (copy_to_user(ct, t, sizeof(*ct)) ||
524 525 526
	    put_user(tsize, &ct->u.user.target_size) ||
	    copy_to_user(ct->u.user.name, t->u.kernel.target->name,
			 strlen(t->u.kernel.target->name) + 1))
527
		return -EFAULT;
528 529 530 531 532 533 534

	if (target->compat_to_user) {
		if (target->compat_to_user((void __user *)ct->data, t->data))
			return -EFAULT;
	} else {
		if (copy_to_user(ct->data, t->data, tsize - sizeof(*ct)))
			return -EFAULT;
535
	}
536 537 538 539

	*size -= off;
	*dstptr += tsize;
	return 0;
540
}
541
EXPORT_SYMBOL_GPL(xt_compat_target_to_user);
542 543
#endif

544 545 546 547 548 549 550 551 552
struct xt_table_info *xt_alloc_table_info(unsigned int size)
{
	struct xt_table_info *newinfo;
	int cpu;

	/* Pedantry: prevent them from hitting BUG() in vmalloc.c --RR */
	if ((SMP_ALIGN(size) >> PAGE_SHIFT) + 2 > num_physpages)
		return NULL;

553
	newinfo = kzalloc(XT_TABLE_INFO_SZ, GFP_KERNEL);
554 555 556 557 558
	if (!newinfo)
		return NULL;

	newinfo->size = size;

559
	for_each_possible_cpu(cpu) {
560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581
		if (size <= PAGE_SIZE)
			newinfo->entries[cpu] = kmalloc_node(size,
							GFP_KERNEL,
							cpu_to_node(cpu));
		else
			newinfo->entries[cpu] = vmalloc_node(size,
							cpu_to_node(cpu));

		if (newinfo->entries[cpu] == NULL) {
			xt_free_table_info(newinfo);
			return NULL;
		}
	}

	return newinfo;
}
EXPORT_SYMBOL(xt_alloc_table_info);

void xt_free_table_info(struct xt_table_info *info)
{
	int cpu;

582
	for_each_possible_cpu(cpu) {
583 584 585 586 587 588 589 590 591 592
		if (info->size <= PAGE_SIZE)
			kfree(info->entries[cpu]);
		else
			vfree(info->entries[cpu]);
	}
	kfree(info);
}
EXPORT_SYMBOL(xt_free_table_info);

/* Find table by name, grabs mutex & ref.  Returns ERR_PTR() on error. */
593
struct xt_table *xt_find_table_lock(struct net *net, int af, const char *name)
594 595 596
{
	struct xt_table *t;

I
Ingo Molnar 已提交
597
	if (mutex_lock_interruptible(&xt[af].mutex) != 0)
598 599
		return ERR_PTR(-EINTR);

600
	list_for_each_entry(t, &net->xt.tables[af], list)
601 602
		if (strcmp(t->name, name) == 0 && try_module_get(t->me))
			return t;
I
Ingo Molnar 已提交
603
	mutex_unlock(&xt[af].mutex);
604 605 606 607 608 609
	return NULL;
}
EXPORT_SYMBOL_GPL(xt_find_table_lock);

void xt_table_unlock(struct xt_table *table)
{
I
Ingo Molnar 已提交
610
	mutex_unlock(&xt[table->af].mutex);
611 612 613
}
EXPORT_SYMBOL_GPL(xt_table_unlock);

614 615 616 617 618 619 620 621 622 623 624 625 626
#ifdef CONFIG_COMPAT
void xt_compat_lock(int af)
{
	mutex_lock(&xt[af].compat_mutex);
}
EXPORT_SYMBOL_GPL(xt_compat_lock);

void xt_compat_unlock(int af)
{
	mutex_unlock(&xt[af].compat_mutex);
}
EXPORT_SYMBOL_GPL(xt_compat_unlock);
#endif
627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655

struct xt_table_info *
xt_replace_table(struct xt_table *table,
	      unsigned int num_counters,
	      struct xt_table_info *newinfo,
	      int *error)
{
	struct xt_table_info *oldinfo, *private;

	/* Do the substitution. */
	write_lock_bh(&table->lock);
	private = table->private;
	/* Check inside lock: is the old number correct? */
	if (num_counters != private->number) {
		duprintf("num_counters != table->private->number (%u/%u)\n",
			 num_counters, private->number);
		write_unlock_bh(&table->lock);
		*error = -EAGAIN;
		return NULL;
	}
	oldinfo = private;
	table->private = newinfo;
	newinfo->initial_entries = oldinfo->initial_entries;
	write_unlock_bh(&table->lock);

	return oldinfo;
}
EXPORT_SYMBOL_GPL(xt_replace_table);

656
struct xt_table *xt_register_table(struct net *net, struct xt_table *table,
657 658
				   struct xt_table_info *bootstrap,
				   struct xt_table_info *newinfo)
659 660 661
{
	int ret;
	struct xt_table_info *private;
P
Patrick McHardy 已提交
662
	struct xt_table *t;
663

664 665 666 667 668 669 670
	/* Don't add one object to multiple lists. */
	table = kmemdup(table, sizeof(struct xt_table), GFP_KERNEL);
	if (!table) {
		ret = -ENOMEM;
		goto out;
	}

I
Ingo Molnar 已提交
671
	ret = mutex_lock_interruptible(&xt[table->af].mutex);
672
	if (ret != 0)
673
		goto out_free;
674 675

	/* Don't autoload: we'd eat our tail... */
676
	list_for_each_entry(t, &net->xt.tables[table->af], list) {
P
Patrick McHardy 已提交
677 678 679 680
		if (strcmp(t->name, table->name) == 0) {
			ret = -EEXIST;
			goto unlock;
		}
681 682 683 684
	}

	/* Simplifies replace_table code. */
	table->private = bootstrap;
685
	rwlock_init(&table->lock);
686 687 688 689 690 691 692 693 694
	if (!xt_replace_table(table, 0, newinfo, &ret))
		goto unlock;

	private = table->private;
	duprintf("table->private->number = %u\n", private->number);

	/* save number of initial entries */
	private->initial_entries = private->number;

695
	list_add(&table->list, &net->xt.tables[table->af]);
696 697
	mutex_unlock(&xt[table->af].mutex);
	return table;
698 699

 unlock:
I
Ingo Molnar 已提交
700
	mutex_unlock(&xt[table->af].mutex);
701 702
out_free:
	kfree(table);
703 704
out:
	return ERR_PTR(ret);
705 706 707 708 709 710 711
}
EXPORT_SYMBOL_GPL(xt_register_table);

void *xt_unregister_table(struct xt_table *table)
{
	struct xt_table_info *private;

I
Ingo Molnar 已提交
712
	mutex_lock(&xt[table->af].mutex);
713
	private = table->private;
P
Patrick McHardy 已提交
714
	list_del(&table->list);
I
Ingo Molnar 已提交
715
	mutex_unlock(&xt[table->af].mutex);
716
	kfree(table);
717 718 719 720 721 722

	return private;
}
EXPORT_SYMBOL_GPL(xt_unregister_table);

#ifdef CONFIG_PROC_FS
723 724 725 726
struct xt_names_priv {
	struct seq_net_private p;
	int af;
};
727
static void *xt_table_seq_start(struct seq_file *seq, loff_t *pos)
728
{
729
	struct xt_names_priv *priv = seq->private;
730
	struct net *net = seq_file_net(seq);
731
	int af = priv->af;
732

733
	mutex_lock(&xt[af].mutex);
734
	return seq_list_start(&net->xt.tables[af], *pos);
735
}
736

737 738
static void *xt_table_seq_next(struct seq_file *seq, void *v, loff_t *pos)
{
739
	struct xt_names_priv *priv = seq->private;
740
	struct net *net = seq_file_net(seq);
741
	int af = priv->af;
742

743
	return seq_list_next(v, &net->xt.tables[af], pos);
744 745
}

746
static void xt_table_seq_stop(struct seq_file *seq, void *v)
747
{
748 749
	struct xt_names_priv *priv = seq->private;
	int af = priv->af;
750

751 752
	mutex_unlock(&xt[af].mutex);
}
753

754 755 756
static int xt_table_seq_show(struct seq_file *seq, void *v)
{
	struct xt_table *table = list_entry(v, struct xt_table, list);
757

758 759 760 761 762
	if (strlen(table->name))
		return seq_printf(seq, "%s\n", table->name);
	else
		return 0;
}
763

764 765 766 767 768 769 770 771 772 773
static const struct seq_operations xt_table_seq_ops = {
	.start	= xt_table_seq_start,
	.next	= xt_table_seq_next,
	.stop	= xt_table_seq_stop,
	.show	= xt_table_seq_show,
};

static int xt_table_open(struct inode *inode, struct file *file)
{
	int ret;
774
	struct xt_names_priv *priv;
775

776 777
	ret = seq_open_net(inode, file, &xt_table_seq_ops,
			   sizeof(struct xt_names_priv));
778
	if (!ret) {
779 780
		priv = ((struct seq_file *)file->private_data)->private;
		priv->af = (unsigned long)PDE(inode)->data;
781 782
	}
	return ret;
783 784
}

785 786 787 788 789
static const struct file_operations xt_table_ops = {
	.owner	 = THIS_MODULE,
	.open	 = xt_table_open,
	.read	 = seq_read,
	.llseek	 = seq_lseek,
790
	.release = seq_release_net,
791 792 793
};

static void *xt_match_seq_start(struct seq_file *seq, loff_t *pos)
794
{
795 796
	struct proc_dir_entry *pde = (struct proc_dir_entry *)seq->private;
	u_int16_t af = (unsigned long)pde->data;
797

798 799 800
	mutex_lock(&xt[af].mutex);
	return seq_list_start(&xt[af].match, *pos);
}
801

802 803 804 805
static void *xt_match_seq_next(struct seq_file *seq, void *v, loff_t *pos)
{
	struct proc_dir_entry *pde = (struct proc_dir_entry *)seq->private;
	u_int16_t af = (unsigned long)pde->data;
806

807
	return seq_list_next(v, &xt[af].match, pos);
808 809
}

810
static void xt_match_seq_stop(struct seq_file *seq, void *v)
811 812
{
	struct proc_dir_entry *pde = seq->private;
813
	u_int16_t af = (unsigned long)pde->data;
814

I
Ingo Molnar 已提交
815
	mutex_unlock(&xt[af].mutex);
816 817
}

818
static int xt_match_seq_show(struct seq_file *seq, void *v)
819
{
820
	struct xt_match *match = list_entry(v, struct xt_match, list);
821

822 823
	if (strlen(match->name))
		return seq_printf(seq, "%s\n", match->name);
824 825 826 827
	else
		return 0;
}

828 829 830 831 832
static const struct seq_operations xt_match_seq_ops = {
	.start	= xt_match_seq_start,
	.next	= xt_match_seq_next,
	.stop	= xt_match_seq_stop,
	.show	= xt_match_seq_show,
833 834
};

835
static int xt_match_open(struct inode *inode, struct file *file)
836 837 838
{
	int ret;

839
	ret = seq_open(file, &xt_match_seq_ops);
840 841 842
	if (!ret) {
		struct seq_file *seq = file->private_data;

843
		seq->private = PDE(inode);
844
	}
845 846 847 848 849 850 851 852 853 854
	return ret;
}

static const struct file_operations xt_match_ops = {
	.owner	 = THIS_MODULE,
	.open	 = xt_match_open,
	.read	 = seq_read,
	.llseek	 = seq_lseek,
	.release = seq_release,
};
855

856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907
static void *xt_target_seq_start(struct seq_file *seq, loff_t *pos)
{
	struct proc_dir_entry *pde = (struct proc_dir_entry *)seq->private;
	u_int16_t af = (unsigned long)pde->data;

	mutex_lock(&xt[af].mutex);
	return seq_list_start(&xt[af].target, *pos);
}

static void *xt_target_seq_next(struct seq_file *seq, void *v, loff_t *pos)
{
	struct proc_dir_entry *pde = (struct proc_dir_entry *)seq->private;
	u_int16_t af = (unsigned long)pde->data;

	return seq_list_next(v, &xt[af].target, pos);
}

static void xt_target_seq_stop(struct seq_file *seq, void *v)
{
	struct proc_dir_entry *pde = seq->private;
	u_int16_t af = (unsigned long)pde->data;

	mutex_unlock(&xt[af].mutex);
}

static int xt_target_seq_show(struct seq_file *seq, void *v)
{
	struct xt_target *target = list_entry(v, struct xt_target, list);

	if (strlen(target->name))
		return seq_printf(seq, "%s\n", target->name);
	else
		return 0;
}

static const struct seq_operations xt_target_seq_ops = {
	.start	= xt_target_seq_start,
	.next	= xt_target_seq_next,
	.stop	= xt_target_seq_stop,
	.show	= xt_target_seq_show,
};

static int xt_target_open(struct inode *inode, struct file *file)
{
	int ret;

	ret = seq_open(file, &xt_target_seq_ops);
	if (!ret) {
		struct seq_file *seq = file->private_data;

		seq->private = PDE(inode);
	}
908 909 910
	return ret;
}

911
static const struct file_operations xt_target_ops = {
912
	.owner	 = THIS_MODULE,
913
	.open	 = xt_target_open,
914 915 916 917 918 919 920 921 922 923 924
	.read	 = seq_read,
	.llseek	 = seq_lseek,
	.release = seq_release,
};

#define FORMAT_TABLES	"_tables_names"
#define	FORMAT_MATCHES	"_tables_matches"
#define FORMAT_TARGETS 	"_tables_targets"

#endif /* CONFIG_PROC_FS */

925
int xt_proto_init(struct net *net, int af)
926 927 928 929 930 931 932 933 934 935 936
{
#ifdef CONFIG_PROC_FS
	char buf[XT_FUNCTION_MAXNAMELEN];
	struct proc_dir_entry *proc;
#endif

	if (af >= NPROTO)
		return -EINVAL;


#ifdef CONFIG_PROC_FS
937
	strlcpy(buf, xt_prefix[af], sizeof(buf));
938
	strlcat(buf, FORMAT_TABLES, sizeof(buf));
939 940
	proc = proc_create_data(buf, 0440, net->proc_net, &xt_table_ops,
				(void *)(unsigned long)af);
941 942 943
	if (!proc)
		goto out;

944
	strlcpy(buf, xt_prefix[af], sizeof(buf));
945
	strlcat(buf, FORMAT_MATCHES, sizeof(buf));
946 947
	proc = proc_create_data(buf, 0440, net->proc_net, &xt_match_ops,
				(void *)(unsigned long)af);
948 949 950
	if (!proc)
		goto out_remove_tables;

951
	strlcpy(buf, xt_prefix[af], sizeof(buf));
952
	strlcat(buf, FORMAT_TARGETS, sizeof(buf));
953 954
	proc = proc_create_data(buf, 0440, net->proc_net, &xt_target_ops,
				(void *)(unsigned long)af);
955 956 957 958 959 960 961 962
	if (!proc)
		goto out_remove_matches;
#endif

	return 0;

#ifdef CONFIG_PROC_FS
out_remove_matches:
963
	strlcpy(buf, xt_prefix[af], sizeof(buf));
964
	strlcat(buf, FORMAT_MATCHES, sizeof(buf));
965
	proc_net_remove(net, buf);
966 967

out_remove_tables:
968
	strlcpy(buf, xt_prefix[af], sizeof(buf));
969
	strlcat(buf, FORMAT_TABLES, sizeof(buf));
970
	proc_net_remove(net, buf);
971 972 973 974 975 976
out:
	return -1;
#endif
}
EXPORT_SYMBOL_GPL(xt_proto_init);

977
void xt_proto_fini(struct net *net, int af)
978 979 980 981
{
#ifdef CONFIG_PROC_FS
	char buf[XT_FUNCTION_MAXNAMELEN];

982
	strlcpy(buf, xt_prefix[af], sizeof(buf));
983
	strlcat(buf, FORMAT_TABLES, sizeof(buf));
984
	proc_net_remove(net, buf);
985

986
	strlcpy(buf, xt_prefix[af], sizeof(buf));
987
	strlcat(buf, FORMAT_TARGETS, sizeof(buf));
988
	proc_net_remove(net, buf);
989

990
	strlcpy(buf, xt_prefix[af], sizeof(buf));
991
	strlcat(buf, FORMAT_MATCHES, sizeof(buf));
992
	proc_net_remove(net, buf);
993 994 995 996
#endif /*CONFIG_PROC_FS*/
}
EXPORT_SYMBOL_GPL(xt_proto_fini);

997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008
static int __net_init xt_net_init(struct net *net)
{
	int i;

	for (i = 0; i < NPROTO; i++)
		INIT_LIST_HEAD(&net->xt.tables[i]);
	return 0;
}

static struct pernet_operations xt_net_ops = {
	.init = xt_net_init,
};
1009 1010 1011

static int __init xt_init(void)
{
1012
	int i, rv;
1013 1014 1015 1016 1017 1018

	xt = kmalloc(sizeof(struct xt_af) * NPROTO, GFP_KERNEL);
	if (!xt)
		return -ENOMEM;

	for (i = 0; i < NPROTO; i++) {
I
Ingo Molnar 已提交
1019
		mutex_init(&xt[i].mutex);
1020 1021
#ifdef CONFIG_COMPAT
		mutex_init(&xt[i].compat_mutex);
1022
		xt[i].compat_offsets = NULL;
1023
#endif
1024 1025 1026
		INIT_LIST_HEAD(&xt[i].target);
		INIT_LIST_HEAD(&xt[i].match);
	}
1027 1028 1029 1030
	rv = register_pernet_subsys(&xt_net_ops);
	if (rv < 0)
		kfree(xt);
	return rv;
1031 1032 1033 1034
}

static void __exit xt_fini(void)
{
1035
	unregister_pernet_subsys(&xt_net_ops);
1036 1037 1038 1039 1040 1041
	kfree(xt);
}

module_init(xt_init);
module_exit(xt_fini);