x_tables.c 21.6 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 47
	struct list_head match;
	struct list_head target;
	struct list_head tables;
48
#ifdef CONFIG_COMPAT
49
	struct mutex compat_mutex;
50 51
	struct compat_delta *compat_offsets;
#endif
52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67
};

static struct xt_af *xt;

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

enum {
	TABLE,
	TARGET,
	MATCH,
};

68
static const char *xt_prefix[NPROTO] = {
69 70
	[AF_INET]	= "ip",
	[AF_INET6]	= "ip6",
71 72 73
	[NF_ARP]	= "arp",
};

74 75
/* Registration hooks for targets. */
int
76
xt_register_target(struct xt_target *target)
77
{
78
	int ret, af = target->family;
79

I
Ingo Molnar 已提交
80
	ret = mutex_lock_interruptible(&xt[af].mutex);
81 82 83
	if (ret != 0)
		return ret;
	list_add(&target->list, &xt[af].target);
I
Ingo Molnar 已提交
84
	mutex_unlock(&xt[af].mutex);
85 86 87 88 89
	return ret;
}
EXPORT_SYMBOL(xt_register_target);

void
90
xt_unregister_target(struct xt_target *target)
91
{
92 93
	int af = target->family;

I
Ingo Molnar 已提交
94
	mutex_lock(&xt[af].mutex);
P
Patrick McHardy 已提交
95
	list_del(&target->list);
I
Ingo Molnar 已提交
96
	mutex_unlock(&xt[af].mutex);
97 98 99
}
EXPORT_SYMBOL(xt_unregister_target);

100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129
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);

130
int
131
xt_register_match(struct xt_match *match)
132
{
133
	int ret, af = match->family;
134

I
Ingo Molnar 已提交
135
	ret = mutex_lock_interruptible(&xt[af].mutex);
136 137 138 139
	if (ret != 0)
		return ret;

	list_add(&match->list, &xt[af].match);
I
Ingo Molnar 已提交
140
	mutex_unlock(&xt[af].mutex);
141 142 143 144 145 146

	return ret;
}
EXPORT_SYMBOL(xt_register_match);

void
147
xt_unregister_match(struct xt_match *match)
148
{
149 150
	int af =  match->family;

I
Ingo Molnar 已提交
151
	mutex_lock(&xt[af].mutex);
P
Patrick McHardy 已提交
152
	list_del(&match->list);
I
Ingo Molnar 已提交
153
	mutex_unlock(&xt[af].mutex);
154 155 156
}
EXPORT_SYMBOL(xt_unregister_match);

157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186
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);

187 188 189 190 191 192 193 194 195 196 197 198 199

/*
 * 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 已提交
200
	if (mutex_lock_interruptible(&xt[af].mutex) != 0)
201 202 203 204 205 206
		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 已提交
207
					mutex_unlock(&xt[af].mutex);
208 209 210 211 212 213
					return m;
				}
			} else
				err = -EPROTOTYPE; /* Found something. */
		}
	}
I
Ingo Molnar 已提交
214
	mutex_unlock(&xt[af].mutex);
215 216 217 218 219 220 221 222 223 224
	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 已提交
225
	if (mutex_lock_interruptible(&xt[af].mutex) != 0)
226 227 228 229 230 231
		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 已提交
232
					mutex_unlock(&xt[af].mutex);
233 234 235 236 237 238
					return t;
				}
			} else
				err = -EPROTOTYPE; /* Found something. */
		}
	}
I
Ingo Molnar 已提交
239
	mutex_unlock(&xt[af].mutex);
240 241 242 243 244 245 246 247 248
	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),
249
					 "%st_%s", xt_prefix[af], name);
250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293
	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)
{
	struct xt_match *m;
	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)
{
	struct xt_target *t;
	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 已提交
294
	if (mutex_lock_interruptible(&xt[af].mutex) != 0) {
295 296 297 298 299 300 301
		*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 已提交
302
	mutex_unlock(&xt[af].mutex);
303 304 305 306 307 308 309 310 311 312 313 314 315 316

	/* 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);

317
int xt_check_match(const struct xt_match *match, unsigned short family,
318
		   unsigned int size, const char *table, unsigned int hook_mask,
319 320 321 322 323 324 325 326 327 328 329 330 331 332
		   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) {
333 334
		printk("%s_tables: %s match: bad hook_mask %u/%u\n",
		       xt_prefix[family], match->name, hook_mask, match->hooks);
335 336 337 338 339 340 341 342 343 344 345
		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);

346
#ifdef CONFIG_COMPAT
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 388 389 390 391 392 393 394
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);

395
int xt_compat_match_offset(struct xt_match *match)
396
{
397 398 399 400 401
	u_int16_t csize = match->compatsize ? : match->matchsize;
	return XT_ALIGN(match->matchsize) - COMPAT_XT_ALIGN(csize);
}
EXPORT_SYMBOL_GPL(xt_compat_match_offset);

402 403
int xt_compat_match_from_user(struct xt_entry_match *m, void **dstptr,
			      int *size)
404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424
{
	struct xt_match *match = m->u.kernel.match;
	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;
425
	return 0;
426 427 428 429 430 431 432 433 434 435 436 437
}
EXPORT_SYMBOL_GPL(xt_compat_match_from_user);

int xt_compat_match_to_user(struct xt_entry_match *m, void __user **dstptr,
			    int *size)
{
	struct xt_match *match = m->u.kernel.match;
	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)) ||
438 439 440
	    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))
441
		return -EFAULT;
442 443 444 445 446 447 448

	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;
449
	}
450 451 452 453

	*size -= off;
	*dstptr += msize;
	return 0;
454
}
455 456
EXPORT_SYMBOL_GPL(xt_compat_match_to_user);
#endif /* CONFIG_COMPAT */
457

458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473
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) {
474 475 476
		printk("%s_tables: %s target: bad hook_mask %u/%u\n",
		       xt_prefix[family], target->name, hook_mask,
		       target->hooks);
477 478 479 480 481 482 483 484 485 486 487
		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);

488
#ifdef CONFIG_COMPAT
489
int xt_compat_target_offset(struct xt_target *target)
490
{
491 492 493 494 495 496
	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,
497
				int *size)
498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530
{
	struct xt_target *target = t->u.kernel.target;
	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,
			     int *size)
{
	struct xt_target *target = t->u.kernel.target;
	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)) ||
531 532 533
	    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))
534
		return -EFAULT;
535 536 537 538 539 540 541

	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;
542
	}
543 544 545 546

	*size -= off;
	*dstptr += tsize;
	return 0;
547
}
548
EXPORT_SYMBOL_GPL(xt_compat_target_to_user);
549 550
#endif

551 552 553 554 555 556 557 558 559
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;

560
	newinfo = kzalloc(XT_TABLE_INFO_SZ, GFP_KERNEL);
561 562 563 564 565
	if (!newinfo)
		return NULL;

	newinfo->size = size;

566
	for_each_possible_cpu(cpu) {
567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588
		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;

589
	for_each_possible_cpu(cpu) {
590 591 592 593 594 595 596 597 598 599 600 601 602 603
		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. */
struct xt_table *xt_find_table_lock(int af, const char *name)
{
	struct xt_table *t;

I
Ingo Molnar 已提交
604
	if (mutex_lock_interruptible(&xt[af].mutex) != 0)
605 606 607 608 609
		return ERR_PTR(-EINTR);

	list_for_each_entry(t, &xt[af].tables, list)
		if (strcmp(t->name, name) == 0 && try_module_get(t->me))
			return t;
I
Ingo Molnar 已提交
610
	mutex_unlock(&xt[af].mutex);
611 612 613 614 615 616
	return NULL;
}
EXPORT_SYMBOL_GPL(xt_find_table_lock);

void xt_table_unlock(struct xt_table *table)
{
I
Ingo Molnar 已提交
617
	mutex_unlock(&xt[table->af].mutex);
618 619 620
}
EXPORT_SYMBOL_GPL(xt_table_unlock);

621 622 623 624 625 626 627 628 629 630 631 632 633
#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
634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668

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);

int xt_register_table(struct xt_table *table,
		      struct xt_table_info *bootstrap,
		      struct xt_table_info *newinfo)
{
	int ret;
	struct xt_table_info *private;
P
Patrick McHardy 已提交
669
	struct xt_table *t;
670

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

	/* Don't autoload: we'd eat our tail... */
P
Patrick McHardy 已提交
676 677 678 679 680
	list_for_each_entry(t, &xt[table->af].tables, list) {
		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;

P
Patrick McHardy 已提交
695
	list_add(&table->list, &xt[table->af].tables);
696 697 698

	ret = 0;
 unlock:
I
Ingo Molnar 已提交
699
	mutex_unlock(&xt[table->af].mutex);
700 701 702 703 704 705 706 707
	return ret;
}
EXPORT_SYMBOL_GPL(xt_register_table);

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

I
Ingo Molnar 已提交
708
	mutex_lock(&xt[table->af].mutex);
709
	private = table->private;
P
Patrick McHardy 已提交
710
	list_del(&table->list);
I
Ingo Molnar 已提交
711
	mutex_unlock(&xt[table->af].mutex);
712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768

	return private;
}
EXPORT_SYMBOL_GPL(xt_unregister_table);

#ifdef CONFIG_PROC_FS
static struct list_head *xt_get_idx(struct list_head *list, struct seq_file *seq, loff_t pos)
{
	struct list_head *head = list->next;

	if (!head || list_empty(list))
		return NULL;

	while (pos && (head = head->next)) {
		if (head == list)
			return NULL;
		pos--;
	}
	return pos ? NULL : head;
}

static struct list_head *type2list(u_int16_t af, u_int16_t type)
{
	struct list_head *list;

	switch (type) {
	case TARGET:
		list = &xt[af].target;
		break;
	case MATCH:
		list = &xt[af].match;
		break;
	case TABLE:
		list = &xt[af].tables;
		break;
	default:
		list = NULL;
		break;
	}

	return list;
}

static void *xt_tgt_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 & 0xffff;
	u_int16_t type = (unsigned long)pde->data >> 16;
	struct list_head *list;

	if (af >= NPROTO)
		return NULL;

	list = type2list(af, type);
	if (!list)
		return NULL;

I
Ingo Molnar 已提交
769
	if (mutex_lock_interruptible(&xt[af].mutex) != 0)
770
		return NULL;
771

772 773 774 775 776 777 778 779 780 781 782 783
	return xt_get_idx(list, seq, *pos);
}

static void *xt_tgt_seq_next(struct seq_file *seq, void *v, loff_t *pos)
{
	struct proc_dir_entry *pde = seq->private;
	u_int16_t af = (unsigned long)pde->data & 0xffff;
	u_int16_t type = (unsigned long)pde->data >> 16;
	struct list_head *list;

	if (af >= NPROTO)
		return NULL;
784

785 786 787 788 789 790 791 792 793 794 795 796 797
	list = type2list(af, type);
	if (!list)
		return NULL;

	(*pos)++;
	return xt_get_idx(list, seq, *pos);
}

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

I
Ingo Molnar 已提交
798
	mutex_unlock(&xt[af].mutex);
799 800 801 802 803 804 805 806 807 808 809 810
}

static int xt_name_seq_show(struct seq_file *seq, void *v)
{
	char *name = (char *)v + sizeof(struct list_head);

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

811
static const struct seq_operations xt_tgt_seq_ops = {
812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832
	.start	= xt_tgt_seq_start,
	.next	= xt_tgt_seq_next,
	.stop	= xt_tgt_seq_stop,
	.show	= xt_name_seq_show,
};

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

	ret = seq_open(file, &xt_tgt_seq_ops);
	if (!ret) {
		struct seq_file *seq = file->private_data;
		struct proc_dir_entry *pde = PDE(inode);

		seq->private = pde;
	}

	return ret;
}

833
static const struct file_operations xt_file_ops = {
834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858
	.owner	 = THIS_MODULE,
	.open	 = xt_tgt_open,
	.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 */

int xt_proto_init(int af)
{
#ifdef CONFIG_PROC_FS
	char buf[XT_FUNCTION_MAXNAMELEN];
	struct proc_dir_entry *proc;
#endif

	if (af >= NPROTO)
		return -EINVAL;


#ifdef CONFIG_PROC_FS
859
	strlcpy(buf, xt_prefix[af], sizeof(buf));
860
	strlcat(buf, FORMAT_TABLES, sizeof(buf));
861
	proc = proc_net_fops_create(&init_net, buf, 0440, &xt_file_ops);
862 863 864 865 866
	if (!proc)
		goto out;
	proc->data = (void *) ((unsigned long) af | (TABLE << 16));


867
	strlcpy(buf, xt_prefix[af], sizeof(buf));
868
	strlcat(buf, FORMAT_MATCHES, sizeof(buf));
869
	proc = proc_net_fops_create(&init_net, buf, 0440, &xt_file_ops);
870 871 872 873
	if (!proc)
		goto out_remove_tables;
	proc->data = (void *) ((unsigned long) af | (MATCH << 16));

874
	strlcpy(buf, xt_prefix[af], sizeof(buf));
875
	strlcat(buf, FORMAT_TARGETS, sizeof(buf));
876
	proc = proc_net_fops_create(&init_net, buf, 0440, &xt_file_ops);
877 878 879 880 881 882 883 884 885
	if (!proc)
		goto out_remove_matches;
	proc->data = (void *) ((unsigned long) af | (TARGET << 16));
#endif

	return 0;

#ifdef CONFIG_PROC_FS
out_remove_matches:
886
	strlcpy(buf, xt_prefix[af], sizeof(buf));
887
	strlcat(buf, FORMAT_MATCHES, sizeof(buf));
888
	proc_net_remove(&init_net, buf);
889 890

out_remove_tables:
891
	strlcpy(buf, xt_prefix[af], sizeof(buf));
892
	strlcat(buf, FORMAT_TABLES, sizeof(buf));
893
	proc_net_remove(&init_net, buf);
894 895 896 897 898 899 900 901 902 903 904
out:
	return -1;
#endif
}
EXPORT_SYMBOL_GPL(xt_proto_init);

void xt_proto_fini(int af)
{
#ifdef CONFIG_PROC_FS
	char buf[XT_FUNCTION_MAXNAMELEN];

905
	strlcpy(buf, xt_prefix[af], sizeof(buf));
906
	strlcat(buf, FORMAT_TABLES, sizeof(buf));
907
	proc_net_remove(&init_net, buf);
908

909
	strlcpy(buf, xt_prefix[af], sizeof(buf));
910
	strlcat(buf, FORMAT_TARGETS, sizeof(buf));
911
	proc_net_remove(&init_net, buf);
912

913
	strlcpy(buf, xt_prefix[af], sizeof(buf));
914
	strlcat(buf, FORMAT_MATCHES, sizeof(buf));
915
	proc_net_remove(&init_net, buf);
916 917 918 919 920 921 922 923 924 925 926 927 928 929
#endif /*CONFIG_PROC_FS*/
}
EXPORT_SYMBOL_GPL(xt_proto_fini);


static int __init xt_init(void)
{
	int i;

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

	for (i = 0; i < NPROTO; i++) {
I
Ingo Molnar 已提交
930
		mutex_init(&xt[i].mutex);
931 932
#ifdef CONFIG_COMPAT
		mutex_init(&xt[i].compat_mutex);
933
		xt[i].compat_offsets = NULL;
934
#endif
935 936 937 938 939 940 941 942 943 944 945 946 947 948 949
		INIT_LIST_HEAD(&xt[i].target);
		INIT_LIST_HEAD(&xt[i].match);
		INIT_LIST_HEAD(&xt[i].tables);
	}
	return 0;
}

static void __exit xt_fini(void)
{
	kfree(xt);
}

module_init(xt_init);
module_exit(xt_fini);