nf_conntrack_core.c 31.0 KB
Newer Older
1 2 3 4 5
/* Connection state tracking for netfilter.  This is separated from,
   but required by, the NAT layer; it can also be used by an iptables
   extension. */

/* (C) 1999-2001 Paul `Rusty' Russell
6
 * (C) 2002-2006 Netfilter Core Team <coreteam@netfilter.org>
7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
 * (C) 2003,2004 USAGI/WIDE Project <http://www.linux-ipv6.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/types.h>
#include <linux/netfilter.h>
#include <linux/module.h>
#include <linux/skbuff.h>
#include <linux/proc_fs.h>
#include <linux/vmalloc.h>
#include <linux/stddef.h>
#include <linux/slab.h>
#include <linux/random.h>
#include <linux/jhash.h>
#include <linux/err.h>
#include <linux/percpu.h>
#include <linux/moduleparam.h>
#include <linux/notifier.h>
#include <linux/kernel.h>
#include <linux/netdevice.h>
#include <linux/socket.h>
A
Al Viro 已提交
31
#include <linux/mm.h>
32 33 34

#include <net/netfilter/nf_conntrack.h>
#include <net/netfilter/nf_conntrack_l3proto.h>
35
#include <net/netfilter/nf_conntrack_l4proto.h>
36
#include <net/netfilter/nf_conntrack_expect.h>
37 38
#include <net/netfilter/nf_conntrack_helper.h>
#include <net/netfilter/nf_conntrack_core.h>
39
#include <net/netfilter/nf_conntrack_extend.h>
40

41
#define NF_CONNTRACK_VERSION	"0.5.0"
42 43 44 45 46 47 48 49

#if 0
#define DEBUGP printk
#else
#define DEBUGP(format, args...)
#endif

DEFINE_RWLOCK(nf_conntrack_lock);
50
EXPORT_SYMBOL_GPL(nf_conntrack_lock);
51 52 53

/* nf_conntrack_standalone needs this */
atomic_t nf_conntrack_count = ATOMIC_INIT(0);
54
EXPORT_SYMBOL_GPL(nf_conntrack_count);
55

56
unsigned int nf_conntrack_htable_size __read_mostly;
57 58
EXPORT_SYMBOL_GPL(nf_conntrack_htable_size);

59
int nf_conntrack_max __read_mostly;
60
EXPORT_SYMBOL_GPL(nf_conntrack_max);
61

62
struct hlist_head *nf_conntrack_hash __read_mostly;
63 64
EXPORT_SYMBOL_GPL(nf_conntrack_hash);

65
struct nf_conn nf_conntrack_untracked __read_mostly;
66 67
EXPORT_SYMBOL_GPL(nf_conntrack_untracked);

68
unsigned int nf_ct_log_invalid __read_mostly;
69
HLIST_HEAD(unconfirmed);
70
static int nf_conntrack_vmalloc __read_mostly;
71
static struct kmem_cache *nf_conntrack_cachep __read_mostly;
72
static unsigned int nf_conntrack_next_id;
73

74 75 76 77 78 79 80 81 82 83
DEFINE_PER_CPU(struct ip_conntrack_stat, nf_conntrack_stat);
EXPORT_PER_CPU_SYMBOL(nf_conntrack_stat);

static int nf_conntrack_hash_rnd_initted;
static unsigned int nf_conntrack_hash_rnd;

static u_int32_t __hash_conntrack(const struct nf_conntrack_tuple *tuple,
				  unsigned int size, unsigned int rnd)
{
	unsigned int a, b;
84 85 86 87 88

	a = jhash2(tuple->src.u3.all, ARRAY_SIZE(tuple->src.u3.all),
		   (tuple->src.l3num << 16) | tuple->dst.protonum);
	b = jhash2(tuple->dst.u3.all, ARRAY_SIZE(tuple->dst.u3.all),
		   (tuple->src.u.all << 16) | tuple->dst.u.all);
89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106

	return jhash_2words(a, b, rnd) % size;
}

static inline u_int32_t hash_conntrack(const struct nf_conntrack_tuple *tuple)
{
	return __hash_conntrack(tuple, nf_conntrack_htable_size,
				nf_conntrack_hash_rnd);
}

int
nf_ct_get_tuple(const struct sk_buff *skb,
		unsigned int nhoff,
		unsigned int dataoff,
		u_int16_t l3num,
		u_int8_t protonum,
		struct nf_conntrack_tuple *tuple,
		const struct nf_conntrack_l3proto *l3proto,
107
		const struct nf_conntrack_l4proto *l4proto)
108 109 110 111 112 113 114 115 116 117
{
	NF_CT_TUPLE_U_BLANK(tuple);

	tuple->src.l3num = l3num;
	if (l3proto->pkt_to_tuple(skb, nhoff, tuple) == 0)
		return 0;

	tuple->dst.protonum = protonum;
	tuple->dst.dir = IP_CT_DIR_ORIGINAL;

118
	return l4proto->pkt_to_tuple(skb, dataoff, tuple);
119
}
120
EXPORT_SYMBOL_GPL(nf_ct_get_tuple);
121 122 123 124 125

int
nf_ct_invert_tuple(struct nf_conntrack_tuple *inverse,
		   const struct nf_conntrack_tuple *orig,
		   const struct nf_conntrack_l3proto *l3proto,
126
		   const struct nf_conntrack_l4proto *l4proto)
127 128 129 130 131 132 133 134 135 136
{
	NF_CT_TUPLE_U_BLANK(inverse);

	inverse->src.l3num = orig->src.l3num;
	if (l3proto->invert_tuple(inverse, orig) == 0)
		return 0;

	inverse->dst.dir = !orig->dst.dir;

	inverse->dst.protonum = orig->dst.protonum;
137
	return l4proto->invert_tuple(inverse, orig);
138
}
139
EXPORT_SYMBOL_GPL(nf_ct_invert_tuple);
140 141 142 143 144

static void
clean_from_lists(struct nf_conn *ct)
{
	DEBUGP("clean_from_lists(%p)\n", ct);
145 146
	hlist_del(&ct->tuplehash[IP_CT_DIR_ORIGINAL].hnode);
	hlist_del(&ct->tuplehash[IP_CT_DIR_REPLY].hnode);
147 148

	/* Destroy all pending expectations */
149
	nf_ct_remove_expectations(ct);
150 151 152 153 154 155
}

static void
destroy_conntrack(struct nf_conntrack *nfct)
{
	struct nf_conn *ct = (struct nf_conn *)nfct;
156
	struct nf_conntrack_l4proto *l4proto;
157 158 159 160 161 162 163 164 165 166 167

	DEBUGP("destroy_conntrack(%p)\n", ct);
	NF_CT_ASSERT(atomic_read(&nfct->use) == 0);
	NF_CT_ASSERT(!timer_pending(&ct->timeout));

	nf_conntrack_event(IPCT_DESTROY, ct);
	set_bit(IPS_DYING_BIT, &ct->status);

	/* To make sure we don't get any weird locking issues here:
	 * destroy_conntrack() MUST NOT be called with a write lock
	 * to nf_conntrack_lock!!! -HW */
168 169 170
	rcu_read_lock();
	l4proto = __nf_ct_l4proto_find(ct->tuplehash[IP_CT_DIR_REPLY].tuple.src.l3num,
				       ct->tuplehash[IP_CT_DIR_REPLY].tuple.dst.protonum);
171 172
	if (l4proto && l4proto->destroy)
		l4proto->destroy(ct);
173

174 175
	nf_ct_ext_destroy(ct);

176
	rcu_read_unlock();
177 178 179 180 181 182

	write_lock_bh(&nf_conntrack_lock);
	/* Expectations will have been removed in clean_from_lists,
	 * except TFTP can create an expectation on the first packet,
	 * before connection is in the list, so we need to clean here,
	 * too. */
183
	nf_ct_remove_expectations(ct);
184 185 186

	/* We overload first tuple to link into unconfirmed list. */
	if (!nf_ct_is_confirmed(ct)) {
187 188
		BUG_ON(hlist_unhashed(&ct->tuplehash[IP_CT_DIR_ORIGINAL].hnode));
		hlist_del(&ct->tuplehash[IP_CT_DIR_ORIGINAL].hnode);
189 190 191 192 193 194 195 196 197 198 199 200 201 202 203
	}

	NF_CT_STAT_INC(delete);
	write_unlock_bh(&nf_conntrack_lock);

	if (ct->master)
		nf_ct_put(ct->master);

	DEBUGP("destroy_conntrack: returning ct=%p to slab\n", ct);
	nf_conntrack_free(ct);
}

static void death_by_timeout(unsigned long ul_conntrack)
{
	struct nf_conn *ct = (void *)ul_conntrack;
204
	struct nf_conn_help *help = nfct_help(ct);
205
	struct nf_conntrack_helper *helper;
206

207 208 209 210 211 212 213
	if (help) {
		rcu_read_lock();
		helper = rcu_dereference(help->helper);
		if (helper && helper->destroy)
			helper->destroy(ct);
		rcu_read_unlock();
	}
214 215 216 217 218 219 220 221 222 223

	write_lock_bh(&nf_conntrack_lock);
	/* Inside lock so preempt is disabled on module removal path.
	 * Otherwise we can get spurious warnings. */
	NF_CT_STAT_INC(delete_list);
	clean_from_lists(ct);
	write_unlock_bh(&nf_conntrack_lock);
	nf_ct_put(ct);
}

224
struct nf_conntrack_tuple_hash *
225 226 227 228
__nf_conntrack_find(const struct nf_conntrack_tuple *tuple,
		    const struct nf_conn *ignored_conntrack)
{
	struct nf_conntrack_tuple_hash *h;
229
	struct hlist_node *n;
230 231
	unsigned int hash = hash_conntrack(tuple);

232
	hlist_for_each_entry(h, n, &nf_conntrack_hash[hash], hnode) {
P
Patrick McHardy 已提交
233 234
		if (nf_ct_tuplehash_to_ctrack(h) != ignored_conntrack &&
		    nf_ct_tuple_equal(tuple, &h->tuple)) {
235 236 237 238 239 240 241 242
			NF_CT_STAT_INC(found);
			return h;
		}
		NF_CT_STAT_INC(searched);
	}

	return NULL;
}
243
EXPORT_SYMBOL_GPL(__nf_conntrack_find);
244 245 246

/* Find a connection corresponding to a tuple. */
struct nf_conntrack_tuple_hash *
247
nf_conntrack_find_get(const struct nf_conntrack_tuple *tuple)
248 249 250 251
{
	struct nf_conntrack_tuple_hash *h;

	read_lock_bh(&nf_conntrack_lock);
252
	h = __nf_conntrack_find(tuple, NULL);
253 254 255 256 257 258
	if (h)
		atomic_inc(&nf_ct_tuplehash_to_ctrack(h)->ct_general.use);
	read_unlock_bh(&nf_conntrack_lock);

	return h;
}
259
EXPORT_SYMBOL_GPL(nf_conntrack_find_get);
260

261 262
static void __nf_conntrack_hash_insert(struct nf_conn *ct,
				       unsigned int hash,
263
				       unsigned int repl_hash)
264 265
{
	ct->id = ++nf_conntrack_next_id;
266 267 268 269
	hlist_add_head(&ct->tuplehash[IP_CT_DIR_ORIGINAL].hnode,
		       &nf_conntrack_hash[hash]);
	hlist_add_head(&ct->tuplehash[IP_CT_DIR_REPLY].hnode,
		       &nf_conntrack_hash[repl_hash]);
270 271 272 273 274 275 276 277 278 279 280 281 282
}

void nf_conntrack_hash_insert(struct nf_conn *ct)
{
	unsigned int hash, repl_hash;

	hash = hash_conntrack(&ct->tuplehash[IP_CT_DIR_ORIGINAL].tuple);
	repl_hash = hash_conntrack(&ct->tuplehash[IP_CT_DIR_REPLY].tuple);

	write_lock_bh(&nf_conntrack_lock);
	__nf_conntrack_hash_insert(ct, hash, repl_hash);
	write_unlock_bh(&nf_conntrack_lock);
}
283
EXPORT_SYMBOL_GPL(nf_conntrack_hash_insert);
284

285 286 287 288 289
/* Confirm a connection given skb; places it in hash table */
int
__nf_conntrack_confirm(struct sk_buff **pskb)
{
	unsigned int hash, repl_hash;
P
Patrick McHardy 已提交
290
	struct nf_conntrack_tuple_hash *h;
291
	struct nf_conn *ct;
P
Patrick McHardy 已提交
292
	struct nf_conn_help *help;
293
	struct hlist_node *n;
294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322
	enum ip_conntrack_info ctinfo;

	ct = nf_ct_get(*pskb, &ctinfo);

	/* ipt_REJECT uses nf_conntrack_attach to attach related
	   ICMP/TCP RST packets in other direction.  Actual packet
	   which created connection will be IP_CT_NEW or for an
	   expected connection, IP_CT_RELATED. */
	if (CTINFO2DIR(ctinfo) != IP_CT_DIR_ORIGINAL)
		return NF_ACCEPT;

	hash = hash_conntrack(&ct->tuplehash[IP_CT_DIR_ORIGINAL].tuple);
	repl_hash = hash_conntrack(&ct->tuplehash[IP_CT_DIR_REPLY].tuple);

	/* We're not in hash table, and we refuse to set up related
	   connections for unconfirmed conns.  But packet copies and
	   REJECT will give spurious warnings here. */
	/* NF_CT_ASSERT(atomic_read(&ct->ct_general.use) == 1); */

	/* No external references means noone else could have
	   confirmed us. */
	NF_CT_ASSERT(!nf_ct_is_confirmed(ct));
	DEBUGP("Confirming conntrack %p\n", ct);

	write_lock_bh(&nf_conntrack_lock);

	/* See if there's one in the list already, including reverse:
	   NAT could have grabbed it without realizing, since we're
	   not in the hash.  If there is, we lost race. */
323
	hlist_for_each_entry(h, n, &nf_conntrack_hash[hash], hnode)
P
Patrick McHardy 已提交
324 325 326
		if (nf_ct_tuple_equal(&ct->tuplehash[IP_CT_DIR_ORIGINAL].tuple,
				      &h->tuple))
			goto out;
327
	hlist_for_each_entry(h, n, &nf_conntrack_hash[repl_hash], hnode)
P
Patrick McHardy 已提交
328 329 330
		if (nf_ct_tuple_equal(&ct->tuplehash[IP_CT_DIR_REPLY].tuple,
				      &h->tuple))
			goto out;
331

P
Patrick McHardy 已提交
332
	/* Remove from unconfirmed list */
333
	hlist_del(&ct->tuplehash[IP_CT_DIR_ORIGINAL].hnode);
P
Patrick McHardy 已提交
334 335 336 337 338 339 340 341 342 343 344 345 346 347

	__nf_conntrack_hash_insert(ct, hash, repl_hash);
	/* Timer relative to confirmation time, not original
	   setting time, otherwise we'd get timer wrap in
	   weird delay cases. */
	ct->timeout.expires += jiffies;
	add_timer(&ct->timeout);
	atomic_inc(&ct->ct_general.use);
	set_bit(IPS_CONFIRMED_BIT, &ct->status);
	NF_CT_STAT_INC(insert);
	write_unlock_bh(&nf_conntrack_lock);
	help = nfct_help(ct);
	if (help && help->helper)
		nf_conntrack_event_cache(IPCT_HELPER, *pskb);
348
#ifdef CONFIG_NF_NAT_NEEDED
P
Patrick McHardy 已提交
349 350 351
	if (test_bit(IPS_SRC_NAT_DONE_BIT, &ct->status) ||
	    test_bit(IPS_DST_NAT_DONE_BIT, &ct->status))
		nf_conntrack_event_cache(IPCT_NATINFO, *pskb);
352
#endif
P
Patrick McHardy 已提交
353 354 355
	nf_conntrack_event_cache(master_ct(ct) ?
				 IPCT_RELATED : IPCT_NEW, *pskb);
	return NF_ACCEPT;
356

P
Patrick McHardy 已提交
357
out:
358 359 360 361
	NF_CT_STAT_INC(insert_failed);
	write_unlock_bh(&nf_conntrack_lock);
	return NF_DROP;
}
362
EXPORT_SYMBOL_GPL(__nf_conntrack_confirm);
363 364 365 366 367 368 369 370 371 372 373 374 375 376 377

/* Returns true if a connection correspondings to the tuple (required
   for NAT). */
int
nf_conntrack_tuple_taken(const struct nf_conntrack_tuple *tuple,
			 const struct nf_conn *ignored_conntrack)
{
	struct nf_conntrack_tuple_hash *h;

	read_lock_bh(&nf_conntrack_lock);
	h = __nf_conntrack_find(tuple, ignored_conntrack);
	read_unlock_bh(&nf_conntrack_lock);

	return h != NULL;
}
378
EXPORT_SYMBOL_GPL(nf_conntrack_tuple_taken);
379 380 381

/* There's a small race here where we may free a just-assured
   connection.  Too bad: we're in trouble anyway. */
382
static int early_drop(struct hlist_head *chain)
383
{
384
	/* Use oldest entry, which is roughly LRU */
385
	struct nf_conntrack_tuple_hash *h;
P
Patrick McHardy 已提交
386
	struct nf_conn *ct = NULL, *tmp;
387
	struct hlist_node *n;
388 389 390
	int dropped = 0;

	read_lock_bh(&nf_conntrack_lock);
391
	hlist_for_each_entry(h, n, chain, hnode) {
P
Patrick McHardy 已提交
392
		tmp = nf_ct_tuplehash_to_ctrack(h);
393
		if (!test_bit(IPS_ASSURED_BIT, &tmp->status))
P
Patrick McHardy 已提交
394
			ct = tmp;
395
	}
396 397
	if (ct)
		atomic_inc(&ct->ct_general.use);
398 399 400 401 402 403 404 405
	read_unlock_bh(&nf_conntrack_lock);

	if (!ct)
		return dropped;

	if (del_timer(&ct->timeout)) {
		death_by_timeout((unsigned long)ct);
		dropped = 1;
406
		NF_CT_STAT_INC_ATOMIC(early_drop);
407 408 409 410 411
	}
	nf_ct_put(ct);
	return dropped;
}

412 413
struct nf_conn *nf_conntrack_alloc(const struct nf_conntrack_tuple *orig,
				   const struct nf_conntrack_tuple *repl)
414 415 416
{
	struct nf_conn *conntrack = NULL;

417
	if (unlikely(!nf_conntrack_hash_rnd_initted)) {
418 419 420 421
		get_random_bytes(&nf_conntrack_hash_rnd, 4);
		nf_conntrack_hash_rnd_initted = 1;
	}

422 423 424
	/* We don't want any race condition at early drop stage */
	atomic_inc(&nf_conntrack_count);

425
	if (nf_conntrack_max
426
	    && atomic_read(&nf_conntrack_count) > nf_conntrack_max) {
427 428 429
		unsigned int hash = hash_conntrack(orig);
		/* Try dropping from this hash chain. */
		if (!early_drop(&nf_conntrack_hash[hash])) {
430
			atomic_dec(&nf_conntrack_count);
431 432 433 434 435 436 437 438
			if (net_ratelimit())
				printk(KERN_WARNING
				       "nf_conntrack: table full, dropping"
				       " packet.\n");
			return ERR_PTR(-ENOMEM);
		}
	}

439
	conntrack = kmem_cache_zalloc(nf_conntrack_cachep, GFP_ATOMIC);
440
	if (conntrack == NULL) {
441 442 443
		DEBUGP("nf_conntrack_alloc: Can't alloc conntrack.\n");
		atomic_dec(&nf_conntrack_count);
		return ERR_PTR(-ENOMEM);
444 445 446 447 448 449
	}

	atomic_set(&conntrack->ct_general.use, 1);
	conntrack->tuplehash[IP_CT_DIR_ORIGINAL].tuple = *orig;
	conntrack->tuplehash[IP_CT_DIR_REPLY].tuple = *repl;
	/* Don't set timer yet: wait for confirmation */
P
Patrick McHardy 已提交
450 451
	setup_timer(&conntrack->timeout, death_by_timeout,
		    (unsigned long)conntrack);
452 453 454

	return conntrack;
}
455
EXPORT_SYMBOL_GPL(nf_conntrack_alloc);
456 457 458

void nf_conntrack_free(struct nf_conn *conntrack)
{
459
	nf_ct_ext_free(conntrack);
460
	kmem_cache_free(nf_conntrack_cachep, conntrack);
461 462
	atomic_dec(&nf_conntrack_count);
}
463
EXPORT_SYMBOL_GPL(nf_conntrack_free);
464 465 466 467 468 469

/* Allocate a new conntrack: we return -ENOMEM if classification
   failed due to stress.  Otherwise it really is unclassifiable. */
static struct nf_conntrack_tuple_hash *
init_conntrack(const struct nf_conntrack_tuple *tuple,
	       struct nf_conntrack_l3proto *l3proto,
470
	       struct nf_conntrack_l4proto *l4proto,
471 472 473 474
	       struct sk_buff *skb,
	       unsigned int dataoff)
{
	struct nf_conn *conntrack;
475
	struct nf_conn_help *help;
476 477 478
	struct nf_conntrack_tuple repl_tuple;
	struct nf_conntrack_expect *exp;

479
	if (!nf_ct_invert_tuple(&repl_tuple, tuple, l3proto, l4proto)) {
480 481 482 483
		DEBUGP("Can't invert tuple.\n");
		return NULL;
	}

484
	conntrack = nf_conntrack_alloc(tuple, &repl_tuple);
485 486 487 488 489
	if (conntrack == NULL || IS_ERR(conntrack)) {
		DEBUGP("Can't allocate conntrack.\n");
		return (struct nf_conntrack_tuple_hash *)conntrack;
	}

490
	if (!l4proto->new(conntrack, skb, dataoff)) {
491 492 493 494 495 496 497 498 499 500 501 502 503
		nf_conntrack_free(conntrack);
		DEBUGP("init conntrack: can't track with proto module\n");
		return NULL;
	}

	write_lock_bh(&nf_conntrack_lock);
	exp = find_expectation(tuple);
	if (exp) {
		DEBUGP("conntrack: expectation arrives ct=%p exp=%p\n",
			conntrack, exp);
		/* Welcome, Mr. Bond.  We've been expecting you... */
		__set_bit(IPS_EXPECTED_BIT, &conntrack->status);
		conntrack->master = exp->master;
504 505 506 507 508 509 510 511 512
		if (exp->helper) {
			help = nf_ct_ext_add(conntrack, NF_CT_EXT_HELPER,
					     GFP_ATOMIC);
			if (help)
				rcu_assign_pointer(help->helper, exp->helper);
			else
				DEBUGP("failed to add helper extension area");
		}

513 514
#ifdef CONFIG_NF_CONNTRACK_MARK
		conntrack->mark = exp->master->mark;
515 516 517
#endif
#ifdef CONFIG_NF_CONNTRACK_SECMARK
		conntrack->secmark = exp->master->secmark;
518 519 520
#endif
		nf_conntrack_get(&conntrack->master->ct_general);
		NF_CT_STAT_INC(expect_new);
521
	} else {
522 523 524 525 526 527 528 529 530 531 532 533
		struct nf_conntrack_helper *helper;

		helper = __nf_ct_helper_find(&repl_tuple);
		if (helper) {
			help = nf_ct_ext_add(conntrack, NF_CT_EXT_HELPER,
					     GFP_ATOMIC);
			if (help)
				/* not in hash table yet, so not strictly
				   necessary */
				rcu_assign_pointer(help->helper, helper);
			else
				DEBUGP("failed to add helper extension area");
534
		}
535
		NF_CT_STAT_INC(new);
536
	}
537 538

	/* Overload tuple linked list to put us in unconfirmed list. */
539 540
	hlist_add_head(&conntrack->tuplehash[IP_CT_DIR_ORIGINAL].hnode,
		       &unconfirmed);
541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559

	write_unlock_bh(&nf_conntrack_lock);

	if (exp) {
		if (exp->expectfn)
			exp->expectfn(conntrack, exp);
		nf_conntrack_expect_put(exp);
	}

	return &conntrack->tuplehash[IP_CT_DIR_ORIGINAL];
}

/* On success, returns conntrack ptr, sets skb->nfct and ctinfo */
static inline struct nf_conn *
resolve_normal_ct(struct sk_buff *skb,
		  unsigned int dataoff,
		  u_int16_t l3num,
		  u_int8_t protonum,
		  struct nf_conntrack_l3proto *l3proto,
560
		  struct nf_conntrack_l4proto *l4proto,
561 562 563 564 565 566 567
		  int *set_reply,
		  enum ip_conntrack_info *ctinfo)
{
	struct nf_conntrack_tuple tuple;
	struct nf_conntrack_tuple_hash *h;
	struct nf_conn *ct;

568
	if (!nf_ct_get_tuple(skb, skb_network_offset(skb),
569
			     dataoff, l3num, protonum, &tuple, l3proto,
570
			     l4proto)) {
571 572 573 574 575
		DEBUGP("resolve_normal_ct: Can't get tuple\n");
		return NULL;
	}

	/* look for tuple match */
576
	h = nf_conntrack_find_get(&tuple);
577
	if (!h) {
578
		h = init_conntrack(&tuple, l3proto, l4proto, skb, dataoff);
579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615
		if (!h)
			return NULL;
		if (IS_ERR(h))
			return (void *)h;
	}
	ct = nf_ct_tuplehash_to_ctrack(h);

	/* It exists; we have (non-exclusive) reference. */
	if (NF_CT_DIRECTION(h) == IP_CT_DIR_REPLY) {
		*ctinfo = IP_CT_ESTABLISHED + IP_CT_IS_REPLY;
		/* Please set reply bit if this packet OK */
		*set_reply = 1;
	} else {
		/* Once we've had two way comms, always ESTABLISHED. */
		if (test_bit(IPS_SEEN_REPLY_BIT, &ct->status)) {
			DEBUGP("nf_conntrack_in: normal packet for %p\n", ct);
			*ctinfo = IP_CT_ESTABLISHED;
		} else if (test_bit(IPS_EXPECTED_BIT, &ct->status)) {
			DEBUGP("nf_conntrack_in: related packet for %p\n", ct);
			*ctinfo = IP_CT_RELATED;
		} else {
			DEBUGP("nf_conntrack_in: new packet for %p\n", ct);
			*ctinfo = IP_CT_NEW;
		}
		*set_reply = 0;
	}
	skb->nfct = &ct->ct_general;
	skb->nfctinfo = *ctinfo;
	return ct;
}

unsigned int
nf_conntrack_in(int pf, unsigned int hooknum, struct sk_buff **pskb)
{
	struct nf_conn *ct;
	enum ip_conntrack_info ctinfo;
	struct nf_conntrack_l3proto *l3proto;
616
	struct nf_conntrack_l4proto *l4proto;
617 618 619 620 621 622 623
	unsigned int dataoff;
	u_int8_t protonum;
	int set_reply = 0;
	int ret;

	/* Previously seen (loopback or untracked)?  Ignore. */
	if ((*pskb)->nfct) {
624
		NF_CT_STAT_INC_ATOMIC(ignore);
625 626 627
		return NF_ACCEPT;
	}

628
	/* rcu_read_lock()ed by nf_hook_slow */
629
	l3proto = __nf_ct_l3proto_find((u_int16_t)pf);
630

631 632 633 634 635
	if ((ret = l3proto->prepare(pskb, hooknum, &dataoff, &protonum)) <= 0) {
		DEBUGP("not prepared to track yet or error occured\n");
		return -ret;
	}

636
	l4proto = __nf_ct_l4proto_find((u_int16_t)pf, protonum);
637 638 639 640

	/* It may be an special packet, error, unclean...
	 * inverse of the return code tells to the netfilter
	 * core what to do with the packet. */
641 642
	if (l4proto->error != NULL &&
	    (ret = l4proto->error(*pskb, dataoff, &ctinfo, pf, hooknum)) <= 0) {
643 644
		NF_CT_STAT_INC_ATOMIC(error);
		NF_CT_STAT_INC_ATOMIC(invalid);
645 646 647
		return -ret;
	}

648
	ct = resolve_normal_ct(*pskb, dataoff, pf, protonum, l3proto, l4proto,
649 650 651
			       &set_reply, &ctinfo);
	if (!ct) {
		/* Not valid part of a connection */
652
		NF_CT_STAT_INC_ATOMIC(invalid);
653 654 655 656 657
		return NF_ACCEPT;
	}

	if (IS_ERR(ct)) {
		/* Too stressed to deal. */
658
		NF_CT_STAT_INC_ATOMIC(drop);
659 660 661 662 663
		return NF_DROP;
	}

	NF_CT_ASSERT((*pskb)->nfct);

664
	ret = l4proto->packet(ct, *pskb, dataoff, ctinfo, pf, hooknum);
665 666 667 668 669 670
	if (ret < 0) {
		/* Invalid: inverse of the return code tells
		 * the netfilter core what to do */
		DEBUGP("nf_conntrack_in: Can't track with proto module\n");
		nf_conntrack_put((*pskb)->nfct);
		(*pskb)->nfct = NULL;
671
		NF_CT_STAT_INC_ATOMIC(invalid);
672 673 674 675 676 677 678 679
		return -ret;
	}

	if (set_reply && !test_and_set_bit(IPS_SEEN_REPLY_BIT, &ct->status))
		nf_conntrack_event_cache(IPCT_STATUS, *pskb);

	return ret;
}
680
EXPORT_SYMBOL_GPL(nf_conntrack_in);
681 682 683 684

int nf_ct_invert_tuplepr(struct nf_conntrack_tuple *inverse,
			 const struct nf_conntrack_tuple *orig)
{
685 686 687 688 689 690 691 692 693
	int ret;

	rcu_read_lock();
	ret = nf_ct_invert_tuple(inverse, orig,
				 __nf_ct_l3proto_find(orig->src.l3num),
				 __nf_ct_l4proto_find(orig->src.l3num,
						      orig->dst.protonum));
	rcu_read_unlock();
	return ret;
694
}
695
EXPORT_SYMBOL_GPL(nf_ct_invert_tuplepr);
696

697 698 699 700 701 702
/* Alter reply tuple (maybe alter helper).  This is for NAT, and is
   implicitly racy: see __nf_conntrack_confirm */
void nf_conntrack_alter_reply(struct nf_conn *ct,
			      const struct nf_conntrack_tuple *newreply)
{
	struct nf_conn_help *help = nfct_help(ct);
703
	struct nf_conntrack_helper *helper;
704 705 706 707 708 709 710 711 712

	write_lock_bh(&nf_conntrack_lock);
	/* Should be unconfirmed, so not in hash table yet */
	NF_CT_ASSERT(!nf_ct_is_confirmed(ct));

	DEBUGP("Altering reply tuple of %p to ", ct);
	NF_CT_DUMP_TUPLE(newreply);

	ct->tuplehash[IP_CT_DIR_REPLY].tuple = *newreply;
713 714 715 716 717 718 719 720
	if (ct->master || (help && help->expecting != 0))
		goto out;

	helper = __nf_ct_helper_find(newreply);
	if (helper == NULL) {
		if (help)
			rcu_assign_pointer(help->helper, NULL);
		goto out;
721
	}
722 723 724 725 726 727 728 729 730 731 732 733 734

	if (help == NULL) {
		help = nf_ct_ext_add(ct, NF_CT_EXT_HELPER, GFP_ATOMIC);
		if (help == NULL) {
			DEBUGP("failed to add helper extension area");
			goto out;
		}
	} else {
		memset(&help->help, 0, sizeof(help->help));
	}

	rcu_assign_pointer(help->helper, helper);
out:
735 736
	write_unlock_bh(&nf_conntrack_lock);
}
737
EXPORT_SYMBOL_GPL(nf_conntrack_alter_reply);
738

739 740 741 742 743 744 745 746 747 748 749 750 751 752
/* Refresh conntrack for this many jiffies and do accounting if do_acct is 1 */
void __nf_ct_refresh_acct(struct nf_conn *ct,
			  enum ip_conntrack_info ctinfo,
			  const struct sk_buff *skb,
			  unsigned long extra_jiffies,
			  int do_acct)
{
	int event = 0;

	NF_CT_ASSERT(ct->timeout.data == (unsigned long)ct);
	NF_CT_ASSERT(skb);

	write_lock_bh(&nf_conntrack_lock);

753 754 755 756 757 758
	/* Only update if this is not a fixed timeout */
	if (test_bit(IPS_FIXED_TIMEOUT_BIT, &ct->status)) {
		write_unlock_bh(&nf_conntrack_lock);
		return;
	}

759 760 761 762 763
	/* If not in hash table, timer will not be active yet */
	if (!nf_ct_is_confirmed(ct)) {
		ct->timeout.expires = extra_jiffies;
		event = IPCT_REFRESH;
	} else {
764 765 766 767 768 769 770 771
		unsigned long newtime = jiffies + extra_jiffies;

		/* Only update the timeout if the new timeout is at least
		   HZ jiffies from the old timeout. Need del_timer for race
		   avoidance (may already be dying). */
		if (newtime - ct->timeout.expires >= HZ
		    && del_timer(&ct->timeout)) {
			ct->timeout.expires = newtime;
772 773 774 775 776 777 778 779 780
			add_timer(&ct->timeout);
			event = IPCT_REFRESH;
		}
	}

#ifdef CONFIG_NF_CT_ACCT
	if (do_acct) {
		ct->counters[CTINFO2DIR(ctinfo)].packets++;
		ct->counters[CTINFO2DIR(ctinfo)].bytes +=
781
			skb->len - skb_network_offset(skb);
782 783 784 785

		if ((ct->counters[CTINFO2DIR(ctinfo)].packets & 0x80000000)
		    || (ct->counters[CTINFO2DIR(ctinfo)].bytes & 0x80000000))
			event |= IPCT_COUNTER_FILLING;
786 787 788 789 790 791 792 793 794
	}
#endif

	write_unlock_bh(&nf_conntrack_lock);

	/* must be unlocked when calling event cache */
	if (event)
		nf_conntrack_event_cache(event, skb);
}
795
EXPORT_SYMBOL_GPL(__nf_ct_refresh_acct);
796

797
#if defined(CONFIG_NF_CT_NETLINK) || defined(CONFIG_NF_CT_NETLINK_MODULE)
798 799 800

#include <linux/netfilter/nfnetlink.h>
#include <linux/netfilter/nfnetlink_conntrack.h>
I
Ingo Molnar 已提交
801 802
#include <linux/mutex.h>

803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818

/* Generic function for tcp/udp/sctp/dccp and alike. This needs to be
 * in ip_conntrack_core, since we don't want the protocols to autoload
 * or depend on ctnetlink */
int nf_ct_port_tuple_to_nfattr(struct sk_buff *skb,
			       const struct nf_conntrack_tuple *tuple)
{
	NFA_PUT(skb, CTA_PROTO_SRC_PORT, sizeof(u_int16_t),
		&tuple->src.u.tcp.port);
	NFA_PUT(skb, CTA_PROTO_DST_PORT, sizeof(u_int16_t),
		&tuple->dst.u.tcp.port);
	return 0;

nfattr_failure:
	return -1;
}
819
EXPORT_SYMBOL_GPL(nf_ct_port_tuple_to_nfattr);
820 821 822 823 824 825 826 827 828 829 830 831 832 833 834

static const size_t cta_min_proto[CTA_PROTO_MAX] = {
	[CTA_PROTO_SRC_PORT-1]  = sizeof(u_int16_t),
	[CTA_PROTO_DST_PORT-1]  = sizeof(u_int16_t)
};

int nf_ct_port_nfattr_to_tuple(struct nfattr *tb[],
			       struct nf_conntrack_tuple *t)
{
	if (!tb[CTA_PROTO_SRC_PORT-1] || !tb[CTA_PROTO_DST_PORT-1])
		return -EINVAL;

	if (nfattr_bad_size(tb, CTA_PROTO_MAX, cta_min_proto))
		return -EINVAL;

835 836
	t->src.u.tcp.port = *(__be16 *)NFA_DATA(tb[CTA_PROTO_SRC_PORT-1]);
	t->dst.u.tcp.port = *(__be16 *)NFA_DATA(tb[CTA_PROTO_DST_PORT-1]);
837 838 839

	return 0;
}
840
EXPORT_SYMBOL_GPL(nf_ct_port_nfattr_to_tuple);
841 842
#endif

843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860
/* Used by ipt_REJECT and ip6t_REJECT. */
void __nf_conntrack_attach(struct sk_buff *nskb, struct sk_buff *skb)
{
	struct nf_conn *ct;
	enum ip_conntrack_info ctinfo;

	/* This ICMP is in reverse direction to the packet which caused it */
	ct = nf_ct_get(skb, &ctinfo);
	if (CTINFO2DIR(ctinfo) == IP_CT_DIR_ORIGINAL)
		ctinfo = IP_CT_RELATED + IP_CT_IS_REPLY;
	else
		ctinfo = IP_CT_RELATED;

	/* Attach to new skbuff, and increment count */
	nskb->nfct = &ct->ct_general;
	nskb->nfctinfo = ctinfo;
	nf_conntrack_get(nskb->nfct);
}
861
EXPORT_SYMBOL_GPL(__nf_conntrack_attach);
862 863 864 865 866 867 868 869 870 871

static inline int
do_iter(const struct nf_conntrack_tuple_hash *i,
	int (*iter)(struct nf_conn *i, void *data),
	void *data)
{
	return iter(nf_ct_tuplehash_to_ctrack(i), data);
}

/* Bring out ya dead! */
P
Patrick McHardy 已提交
872
static struct nf_conn *
873 874 875
get_next_corpse(int (*iter)(struct nf_conn *i, void *data),
		void *data, unsigned int *bucket)
{
P
Patrick McHardy 已提交
876 877
	struct nf_conntrack_tuple_hash *h;
	struct nf_conn *ct;
878
	struct hlist_node *n;
879 880 881

	write_lock_bh(&nf_conntrack_lock);
	for (; *bucket < nf_conntrack_htable_size; (*bucket)++) {
882
		hlist_for_each_entry(h, n, &nf_conntrack_hash[*bucket], hnode) {
P
Patrick McHardy 已提交
883 884 885 886
			ct = nf_ct_tuplehash_to_ctrack(h);
			if (iter(ct, data))
				goto found;
		}
887
	}
888
	hlist_for_each_entry(h, n, &unconfirmed, hnode) {
P
Patrick McHardy 已提交
889 890
		ct = nf_ct_tuplehash_to_ctrack(h);
		if (iter(ct, data))
891
			set_bit(IPS_DYING_BIT, &ct->status);
P
Patrick McHardy 已提交
892
	}
893
	write_unlock_bh(&nf_conntrack_lock);
P
Patrick McHardy 已提交
894 895
	return NULL;
found:
896
	atomic_inc(&ct->ct_general.use);
897
	write_unlock_bh(&nf_conntrack_lock);
P
Patrick McHardy 已提交
898
	return ct;
899 900 901 902 903
}

void
nf_ct_iterate_cleanup(int (*iter)(struct nf_conn *i, void *data), void *data)
{
P
Patrick McHardy 已提交
904
	struct nf_conn *ct;
905 906
	unsigned int bucket = 0;

P
Patrick McHardy 已提交
907
	while ((ct = get_next_corpse(iter, data, &bucket)) != NULL) {
908 909 910 911 912 913 914 915
		/* Time to push up daises... */
		if (del_timer(&ct->timeout))
			death_by_timeout((unsigned long)ct);
		/* ... else the timer will get him soon. */

		nf_ct_put(ct);
	}
}
916
EXPORT_SYMBOL_GPL(nf_ct_iterate_cleanup);
917 918 919 920 921 922

static int kill_all(struct nf_conn *i, void *data)
{
	return 1;
}

923 924
static void free_conntrack_hash(struct hlist_head *hash, int vmalloced,
				int size)
925 926 927 928
{
	if (vmalloced)
		vfree(hash);
	else
929
		free_pages((unsigned long)hash,
930
			   get_order(sizeof(struct hlist_head) * size));
931 932
}

933
void nf_conntrack_flush(void)
934 935 936
{
	nf_ct_iterate_cleanup(kill_all, NULL);
}
937
EXPORT_SYMBOL_GPL(nf_conntrack_flush);
938

939 940 941 942
/* Mishearing the voices in his head, our hero wonders how he's
   supposed to kill the mall. */
void nf_conntrack_cleanup(void)
{
943
	rcu_assign_pointer(ip_ct_attach, NULL);
944

945 946 947 948 949 950 951
	/* This makes sure all current packets have passed through
	   netfilter framework.  Roll on, two-stage module
	   delete... */
	synchronize_net();

	nf_ct_event_cache_flush();
 i_see_dead_people:
952
	nf_conntrack_flush();
953 954 955 956
	if (atomic_read(&nf_conntrack_count) != 0) {
		schedule();
		goto i_see_dead_people;
	}
957 958 959
	/* wait until all references to nf_conntrack_untracked are dropped */
	while (atomic_read(&nf_conntrack_untracked.ct_general.use) > 1)
		schedule();
960

961 962
	rcu_assign_pointer(nf_ct_destroy, NULL);

963
	kmem_cache_destroy(nf_conntrack_cachep);
964 965 966
	kmem_cache_destroy(nf_conntrack_expect_cachep);
	free_conntrack_hash(nf_conntrack_hash, nf_conntrack_vmalloc,
			    nf_conntrack_htable_size);
967

968
	nf_conntrack_proto_fini();
969
	nf_conntrack_helper_fini();
970 971
}

972
static struct hlist_head *alloc_hashtable(int *sizep, int *vmalloced)
973
{
974
	struct hlist_head *hash;
975
	unsigned int size, i;
976

977
	*vmalloced = 0;
978

979
	size = *sizep = roundup(*sizep, PAGE_SIZE / sizeof(struct hlist_head));
980
	hash = (void*)__get_free_pages(GFP_KERNEL,
981
				       get_order(sizeof(struct hlist_head)
982
						 * size));
983
	if (!hash) {
984 985
		*vmalloced = 1;
		printk(KERN_WARNING "nf_conntrack: falling back to vmalloc.\n");
986
		hash = vmalloc(sizeof(struct hlist_head) * size);
987 988 989
	}

	if (hash)
990
		for (i = 0; i < size; i++)
991
			INIT_HLIST_HEAD(&hash[i]);
992 993 994 995 996 997 998 999 1000

	return hash;
}

int set_hashsize(const char *val, struct kernel_param *kp)
{
	int i, bucket, hashsize, vmalloced;
	int old_vmalloced, old_size;
	int rnd;
1001
	struct hlist_head *hash, *old_hash;
1002 1003 1004 1005 1006 1007 1008 1009 1010 1011
	struct nf_conntrack_tuple_hash *h;

	/* On boot, we can set this without any fancy locking. */
	if (!nf_conntrack_htable_size)
		return param_set_uint(val, kp);

	hashsize = simple_strtol(val, NULL, 0);
	if (!hashsize)
		return -EINVAL;

1012
	hash = alloc_hashtable(&hashsize, &vmalloced);
1013 1014 1015 1016 1017 1018 1019 1020 1021
	if (!hash)
		return -ENOMEM;

	/* We have to rehahs for the new table anyway, so we also can
	 * use a newrandom seed */
	get_random_bytes(&rnd, 4);

	write_lock_bh(&nf_conntrack_lock);
	for (i = 0; i < nf_conntrack_htable_size; i++) {
1022 1023 1024 1025
		while (!hlist_empty(&nf_conntrack_hash[i])) {
			h = hlist_entry(nf_conntrack_hash[i].first,
					struct nf_conntrack_tuple_hash, hnode);
			hlist_del(&h->hnode);
1026
			bucket = __hash_conntrack(&h->tuple, hashsize, rnd);
1027
			hlist_add_head(&h->hnode, &hash[bucket]);
1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048
		}
	}
	old_size = nf_conntrack_htable_size;
	old_vmalloced = nf_conntrack_vmalloc;
	old_hash = nf_conntrack_hash;

	nf_conntrack_htable_size = hashsize;
	nf_conntrack_vmalloc = vmalloced;
	nf_conntrack_hash = hash;
	nf_conntrack_hash_rnd = rnd;
	write_unlock_bh(&nf_conntrack_lock);

	free_conntrack_hash(old_hash, old_vmalloced, old_size);
	return 0;
}

module_param_call(hashsize, set_hashsize, param_get_uint,
		  &nf_conntrack_htable_size, 0600);

int __init nf_conntrack_init(void)
{
1049
	int max_factor = 8;
1050 1051 1052
	int ret;

	/* Idea from tcp.c: use 1/16384 of memory.  On i386: 32MB
1053
	 * machine has 512 buckets. >= 1GB machines have 16384 buckets. */
1054 1055 1056
	if (!nf_conntrack_htable_size) {
		nf_conntrack_htable_size
			= (((num_physpages << PAGE_SHIFT) / 16384)
1057
			   / sizeof(struct hlist_head));
1058
		if (num_physpages > (1024 * 1024 * 1024 / PAGE_SIZE))
1059 1060 1061 1062 1063 1064 1065 1066 1067
			nf_conntrack_htable_size = 16384;
		if (nf_conntrack_htable_size < 32)
			nf_conntrack_htable_size = 32;

		/* Use a max. factor of four by default to get the same max as
		 * with the old struct list_heads. When a table size is given
		 * we use the old value of 8 to avoid reducing the max.
		 * entries. */
		max_factor = 4;
1068
	}
1069
	nf_conntrack_hash = alloc_hashtable(&nf_conntrack_htable_size,
1070 1071 1072 1073 1074 1075
					    &nf_conntrack_vmalloc);
	if (!nf_conntrack_hash) {
		printk(KERN_ERR "Unable to create nf_conntrack_hash\n");
		goto err_out;
	}

1076
	nf_conntrack_max = max_factor * nf_conntrack_htable_size;
1077 1078 1079 1080 1081

	printk("nf_conntrack version %s (%u buckets, %d max)\n",
	       NF_CONNTRACK_VERSION, nf_conntrack_htable_size,
	       nf_conntrack_max);

1082 1083 1084 1085
	nf_conntrack_cachep = kmem_cache_create("nf_conntrack",
						sizeof(struct nf_conn),
						0, 0, NULL, NULL);
	if (!nf_conntrack_cachep) {
1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097
		printk(KERN_ERR "Unable to create nf_conn slab cache\n");
		goto err_free_hash;
	}

	nf_conntrack_expect_cachep = kmem_cache_create("nf_conntrack_expect",
					sizeof(struct nf_conntrack_expect),
					0, 0, NULL, NULL);
	if (!nf_conntrack_expect_cachep) {
		printk(KERN_ERR "Unable to create nf_expect slab cache\n");
		goto err_free_conntrack_slab;
	}

1098
	ret = nf_conntrack_proto_init();
1099 1100 1101
	if (ret < 0)
		goto out_free_expect_slab;

1102 1103 1104 1105
	ret = nf_conntrack_helper_init();
	if (ret < 0)
		goto out_fini_proto;

1106
	/* For use by REJECT target */
1107
	rcu_assign_pointer(ip_ct_attach, __nf_conntrack_attach);
1108
	rcu_assign_pointer(nf_ct_destroy, destroy_conntrack);
1109

1110 1111 1112 1113 1114 1115 1116 1117
	/* Set up fake conntrack:
	    - to never be deleted, not in any hashes */
	atomic_set(&nf_conntrack_untracked.ct_general.use, 1);
	/*  - and look it like as a confirmed connection */
	set_bit(IPS_CONFIRMED_BIT, &nf_conntrack_untracked.status);

	return ret;

1118 1119
out_fini_proto:
	nf_conntrack_proto_fini();
1120 1121
out_free_expect_slab:
	kmem_cache_destroy(nf_conntrack_expect_cachep);
1122
err_free_conntrack_slab:
1123
	kmem_cache_destroy(nf_conntrack_cachep);
1124 1125 1126 1127 1128 1129
err_free_hash:
	free_conntrack_hash(nf_conntrack_hash, nf_conntrack_vmalloc,
			    nf_conntrack_htable_size);
err_out:
	return -ENOMEM;
}