[deliverable/linux.git] / net / ipv4 / inetpeer.c

/*
 *		INETPEER - A storage for permanent information about peers
 *
 *  This source is covered by the GNU GPL, the same as all kernel sources.
 *
 *  Authors:	Andrey V. Savochkin <saw@msu.ru>
 */

#include <linux/module.h>
#include <linux/types.h>
#include <linux/slab.h>
#include <linux/interrupt.h>
#include <linux/spinlock.h>
#include <linux/random.h>
#include <linux/timer.h>
#include <linux/time.h>
#include <linux/kernel.h>
#include <linux/mm.h>
#include <linux/net.h>
#include <linux/workqueue.h>
#include <net/ip.h>
#include <net/inetpeer.h>
#include <net/secure_seq.h>

/*
 *  Theory of operations.
 *  We keep one entry for each peer IP address.  The nodes contains long-living
 *  information about the peer which doesn't depend on routes.
 *
 *  Nodes are removed only when reference counter goes to 0.
 *  When it's happened the node may be removed when a sufficient amount of
 *  time has been passed since its last use.  The less-recently-used entry can
 *  also be removed if the pool is overloaded i.e. if the total amount of
 *  entries is greater-or-equal than the threshold.
 *
 *  Node pool is organised as an AVL tree.
 *  Such an implementation has been chosen not just for fun.  It's a way to
 *  prevent easy and efficient DoS attacks by creating hash collisions.  A huge
 *  amount of long living nodes in a single hash slot would significantly delay
 *  lookups performed with disabled BHs.
 *
 *  Serialisation issues.
 *  1.  Nodes may appear in the tree only with the pool lock held.
 *  2.  Nodes may disappear from the tree only with the pool lock held
 *      AND reference count being 0.
 *  3.  Global variable peer_total is modified under the pool lock.
 *  4.  struct inet_peer fields modification:
 *		avl_left, avl_right, avl_parent, avl_height: pool lock
 *		refcnt: atomically against modifications on other CPU;
 *		   usually under some other lock to prevent node disappearing
 *		daddr: unchangeable
 */

static struct kmem_cache *peer_cachep __read_mostly;

static LIST_HEAD(gc_list);
static const int gc_delay = 60 * HZ;
static struct delayed_work gc_work;
static DEFINE_SPINLOCK(gc_lock);

#define node_height(x) x->avl_height

#define peer_avl_empty ((struct inet_peer *)&peer_fake_node)
#define peer_avl_empty_rcu ((struct inet_peer __rcu __force *)&peer_fake_node)
static const struct inet_peer peer_fake_node = {
	.avl_left	= peer_avl_empty_rcu,
	.avl_right	= peer_avl_empty_rcu,
	.avl_height	= 0
};

void inet_peer_base_init(struct inet_peer_base *bp)
{
	bp->root = peer_avl_empty_rcu;
	seqlock_init(&bp->lock);
	bp->flush_seq = ~0U;
	bp->total = 0;
}
EXPORT_SYMBOL_GPL(inet_peer_base_init);

static atomic_t v4_seq = ATOMIC_INIT(0);
static atomic_t v6_seq = ATOMIC_INIT(0);

static atomic_t *inetpeer_seq_ptr(int family)
{
	return (family == AF_INET ? &v4_seq : &v6_seq);
}

static inline void flush_check(struct inet_peer_base *base, int family)
{
	atomic_t *fp = inetpeer_seq_ptr(family);

	if (unlikely(base->flush_seq != atomic_read(fp))) {
		inetpeer_invalidate_tree(base);
		base->flush_seq = atomic_read(fp);
	}
}

#define PEER_MAXDEPTH 40 /* sufficient for about 2^27 nodes */

/* Exported for sysctl_net_ipv4.  */
int inet_peer_threshold __read_mostly = 65536 + 128;	/* start to throw entries more
					 * aggressively at this stage */
int inet_peer_minttl __read_mostly = 120 * HZ;	/* TTL under high load: 120 sec */
int inet_peer_maxttl __read_mostly = 10 * 60 * HZ;	/* usual time to live: 10 min */

static void inetpeer_gc_worker(struct work_struct *work)
{
	struct inet_peer *p, *n, *c;
	struct list_head list;

	spin_lock_bh(&gc_lock);
	list_replace_init(&gc_list, &list);
	spin_unlock_bh(&gc_lock);

	if (list_empty(&list))
		return;

	list_for_each_entry_safe(p, n, &list, gc_list) {

		if (need_resched())
			cond_resched();

		c = rcu_dereference_protected(p->avl_left, 1);
		if (c != peer_avl_empty) {
			list_add_tail(&c->gc_list, &list);
			p->avl_left = peer_avl_empty_rcu;
		}

		c = rcu_dereference_protected(p->avl_right, 1);
		if (c != peer_avl_empty) {
			list_add_tail(&c->gc_list, &list);
			p->avl_right = peer_avl_empty_rcu;
		}

		n = list_entry(p->gc_list.next, struct inet_peer, gc_list);

		if (!atomic_read(&p->refcnt)) {
			list_del(&p->gc_list);
			kmem_cache_free(peer_cachep, p);
		}
	}

	if (list_empty(&list))
		return;

	spin_lock_bh(&gc_lock);
	list_splice(&list, &gc_list);
	spin_unlock_bh(&gc_lock);

	schedule_delayed_work(&gc_work, gc_delay);
}

/* Called from ip_output.c:ip_init  */
void __init inet_initpeers(void)
{
	struct sysinfo si;

	/* Use the straight interface to information about memory. */
	si_meminfo(&si);
	/* The values below were suggested by Alexey Kuznetsov
	 * <kuznet@ms2.inr.ac.ru>.  I don't have any opinion about the values
	 * myself.  --SAW
	 */
	if (si.totalram <= (32768*1024)/PAGE_SIZE)
		inet_peer_threshold >>= 1; /* max pool size about 1MB on IA32 */
	if (si.totalram <= (16384*1024)/PAGE_SIZE)
		inet_peer_threshold >>= 1; /* about 512KB */
	if (si.totalram <= (8192*1024)/PAGE_SIZE)
		inet_peer_threshold >>= 2; /* about 128KB */

	peer_cachep = kmem_cache_create("inet_peer_cache",
			sizeof(struct inet_peer),
			0, SLAB_HWCACHE_ALIGN | SLAB_PANIC,
			NULL);

	INIT_DEFERRABLE_WORK(&gc_work, inetpeer_gc_worker);
}

static int addr_compare(const struct inetpeer_addr *a,
			const struct inetpeer_addr *b)
{
	int i, n = (a->family == AF_INET ? 1 : 4);

	for (i = 0; i < n; i++) {
		if (a->addr.a6[i] == b->addr.a6[i])
			continue;
		if ((__force u32)a->addr.a6[i] < (__force u32)b->addr.a6[i])
			return -1;
		return 1;
	}

	return 0;
}

#define rcu_deref_locked(X, BASE)				\
	rcu_dereference_protected(X, lockdep_is_held(&(BASE)->lock.lock))

/*
 * Called with local BH disabled and the pool lock held.
 */
#define lookup(_daddr, _stack, _base)				\
({								\
	struct inet_peer *u;					\
	struct inet_peer __rcu **v;				\
								\
	stackptr = _stack;					\
	*stackptr++ = &_base->root;				\
	for (u = rcu_deref_locked(_base->root, _base);		\
	     u != peer_avl_empty;) {				\
		int cmp = addr_compare(_daddr, &u->daddr);	\
		if (cmp == 0)					\
			break;					\
		if (cmp == -1)					\
			v = &u->avl_left;			\
		else						\
			v = &u->avl_right;			\
		*stackptr++ = v;				\
		u = rcu_deref_locked(*v, _base);		\
	}							\
	u;							\
})

/*
 * Called with rcu_read_lock()
 * Because we hold no lock against a writer, its quite possible we fall
 * in an endless loop.
 * But every pointer we follow is guaranteed to be valid thanks to RCU.
 * We exit from this function if number of links exceeds PEER_MAXDEPTH
 */
static struct inet_peer *lookup_rcu(const struct inetpeer_addr *daddr,
				    struct inet_peer_base *base)
{
	struct inet_peer *u = rcu_dereference(base->root);
	int count = 0;

	while (u != peer_avl_empty) {
		int cmp = addr_compare(daddr, &u->daddr);
		if (cmp == 0) {
			/* Before taking a reference, check if this entry was
			 * deleted (refcnt=-1)
			 */
			if (!atomic_add_unless(&u->refcnt, 1, -1))
				u = NULL;
			return u;
		}
		if (cmp == -1)
			u = rcu_dereference(u->avl_left);
		else
			u = rcu_dereference(u->avl_right);
		if (unlikely(++count == PEER_MAXDEPTH))
			break;
	}
	return NULL;
}

/* Called with local BH disabled and the pool lock held. */
#define lookup_rightempty(start, base)				\
({								\
	struct inet_peer *u;					\
	struct inet_peer __rcu **v;				\
	*stackptr++ = &start->avl_left;				\
	v = &start->avl_left;					\
	for (u = rcu_deref_locked(*v, base);			\
	     u->avl_right != peer_avl_empty_rcu;) {		\
		v = &u->avl_right;				\
		*stackptr++ = v;				\
		u = rcu_deref_locked(*v, base);			\
	}							\
	u;							\
})

/* Called with local BH disabled and the pool lock held.
 * Variable names are the proof of operation correctness.
 * Look into mm/map_avl.c for more detail description of the ideas.
 */
static void peer_avl_rebalance(struct inet_peer __rcu **stack[],
			       struct inet_peer __rcu ***stackend,
			       struct inet_peer_base *base)
{
	struct inet_peer __rcu **nodep;
	struct inet_peer *node, *l, *r;
	int lh, rh;

	while (stackend > stack) {
		nodep = *--stackend;
		node = rcu_deref_locked(*nodep, base);
		l = rcu_deref_locked(node->avl_left, base);
		r = rcu_deref_locked(node->avl_right, base);
		lh = node_height(l);
		rh = node_height(r);
		if (lh > rh + 1) { /* l: RH+2 */
			struct inet_peer *ll, *lr, *lrl, *lrr;
			int lrh;
			ll = rcu_deref_locked(l->avl_left, base);
			lr = rcu_deref_locked(l->avl_right, base);
			lrh = node_height(lr);
			if (lrh <= node_height(ll)) {	/* ll: RH+1 */
				RCU_INIT_POINTER(node->avl_left, lr);	/* lr: RH or RH+1 */
				RCU_INIT_POINTER(node->avl_right, r);	/* r: RH */
				node->avl_height = lrh + 1; /* RH+1 or RH+2 */
				RCU_INIT_POINTER(l->avl_left, ll);       /* ll: RH+1 */
				RCU_INIT_POINTER(l->avl_right, node);	/* node: RH+1 or RH+2 */
				l->avl_height = node->avl_height + 1;
				RCU_INIT_POINTER(*nodep, l);
			} else { /* ll: RH, lr: RH+1 */
				lrl = rcu_deref_locked(lr->avl_left, base);/* lrl: RH or RH-1 */
				lrr = rcu_deref_locked(lr->avl_right, base);/* lrr: RH or RH-1 */
				RCU_INIT_POINTER(node->avl_left, lrr);	/* lrr: RH or RH-1 */
				RCU_INIT_POINTER(node->avl_right, r);	/* r: RH */
				node->avl_height = rh + 1; /* node: RH+1 */
				RCU_INIT_POINTER(l->avl_left, ll);	/* ll: RH */
				RCU_INIT_POINTER(l->avl_right, lrl);	/* lrl: RH or RH-1 */
				l->avl_height = rh + 1;	/* l: RH+1 */
				RCU_INIT_POINTER(lr->avl_left, l);	/* l: RH+1 */
				RCU_INIT_POINTER(lr->avl_right, node);	/* node: RH+1 */
				lr->avl_height = rh + 2;
				RCU_INIT_POINTER(*nodep, lr);
			}
		} else if (rh > lh + 1) { /* r: LH+2 */
			struct inet_peer *rr, *rl, *rlr, *rll;
			int rlh;
			rr = rcu_deref_locked(r->avl_right, base);
			rl = rcu_deref_locked(r->avl_left, base);
			rlh = node_height(rl);
			if (rlh <= node_height(rr)) {	/* rr: LH+1 */
				RCU_INIT_POINTER(node->avl_right, rl);	/* rl: LH or LH+1 */
				RCU_INIT_POINTER(node->avl_left, l);	/* l: LH */
				node->avl_height = rlh + 1; /* LH+1 or LH+2 */
				RCU_INIT_POINTER(r->avl_right, rr);	/* rr: LH+1 */
				RCU_INIT_POINTER(r->avl_left, node);	/* node: LH+1 or LH+2 */
				r->avl_height = node->avl_height + 1;
				RCU_INIT_POINTER(*nodep, r);
			} else { /* rr: RH, rl: RH+1 */
				rlr = rcu_deref_locked(rl->avl_right, base);/* rlr: LH or LH-1 */
				rll = rcu_deref_locked(rl->avl_left, base);/* rll: LH or LH-1 */
				RCU_INIT_POINTER(node->avl_right, rll);	/* rll: LH or LH-1 */
				RCU_INIT_POINTER(node->avl_left, l);	/* l: LH */
				node->avl_height = lh + 1; /* node: LH+1 */
				RCU_INIT_POINTER(r->avl_right, rr);	/* rr: LH */
				RCU_INIT_POINTER(r->avl_left, rlr);	/* rlr: LH or LH-1 */
				r->avl_height = lh + 1;	/* r: LH+1 */
				RCU_INIT_POINTER(rl->avl_right, r);	/* r: LH+1 */
				RCU_INIT_POINTER(rl->avl_left, node);	/* node: LH+1 */
				rl->avl_height = lh + 2;
				RCU_INIT_POINTER(*nodep, rl);
			}
		} else {
			node->avl_height = (lh > rh ? lh : rh) + 1;
		}
	}
}

/* Called with local BH disabled and the pool lock held. */
#define link_to_pool(n, base)					\
do {								\
	n->avl_height = 1;					\
	n->avl_left = peer_avl_empty_rcu;			\
	n->avl_right = peer_avl_empty_rcu;			\
	/* lockless readers can catch us now */			\
	rcu_assign_pointer(**--stackptr, n);			\
	peer_avl_rebalance(stack, stackptr, base);		\
} while (0)

static void inetpeer_free_rcu(struct rcu_head *head)
{
	kmem_cache_free(peer_cachep, container_of(head, struct inet_peer, rcu));
}

static void unlink_from_pool(struct inet_peer *p, struct inet_peer_base *base,
			     struct inet_peer __rcu **stack[PEER_MAXDEPTH])
{
	struct inet_peer __rcu ***stackptr, ***delp;

	if (lookup(&p->daddr, stack, base) != p)
		BUG();
	delp = stackptr - 1; /* *delp[0] == p */
	if (p->avl_left == peer_avl_empty_rcu) {
		*delp[0] = p->avl_right;
		--stackptr;
	} else {
		/* look for a node to insert instead of p */
		struct inet_peer *t;
		t = lookup_rightempty(p, base);
		BUG_ON(rcu_deref_locked(*stackptr[-1], base) != t);
		**--stackptr = t->avl_left;
		/* t is removed, t->daddr > x->daddr for any
		 * x in p->avl_left subtree.
		 * Put t in the old place of p. */
		RCU_INIT_POINTER(*delp[0], t);
		t->avl_left = p->avl_left;
		t->avl_right = p->avl_right;
		t->avl_height = p->avl_height;
		BUG_ON(delp[1] != &p->avl_left);
		delp[1] = &t->avl_left; /* was &p->avl_left */
	}
	peer_avl_rebalance(stack, stackptr, base);
	base->total--;
	call_rcu(&p->rcu, inetpeer_free_rcu);
}

/* perform garbage collect on all items stacked during a lookup */
static int inet_peer_gc(struct inet_peer_base *base,
			struct inet_peer __rcu **stack[PEER_MAXDEPTH],
			struct inet_peer __rcu ***stackptr)
{
	struct inet_peer *p, *gchead = NULL;
	__u32 delta, ttl;
	int cnt = 0;

	if (base->total >= inet_peer_threshold)
		ttl = 0; /* be aggressive */
	else
		ttl = inet_peer_maxttl
				- (inet_peer_maxttl - inet_peer_minttl) / HZ *
					base->total / inet_peer_threshold * HZ;
	stackptr--; /* last stack slot is peer_avl_empty */
	while (stackptr > stack) {
		stackptr--;
		p = rcu_deref_locked(**stackptr, base);
		if (atomic_read(&p->refcnt) == 0) {
			smp_rmb();
			delta = (__u32)jiffies - p->dtime;
			if (delta >= ttl &&
			    atomic_cmpxchg(&p->refcnt, 0, -1) == 0) {
				p->gc_next = gchead;
				gchead = p;
			}
		}
	}
	while ((p = gchead) != NULL) {
		gchead = p->gc_next;
		cnt++;
		unlink_from_pool(p, base, stack);
	}
	return cnt;
}

struct inet_peer *inet_getpeer(struct inet_peer_base *base,
			       const struct inetpeer_addr *daddr,
			       int create)
{
	struct inet_peer __rcu **stack[PEER_MAXDEPTH], ***stackptr;
	struct inet_peer *p;
	unsigned int sequence;
	int invalidated, gccnt = 0;

	flush_check(base, daddr->family);

	/* Attempt a lockless lookup first.
	 * Because of a concurrent writer, we might not find an existing entry.
	 */
	rcu_read_lock();
	sequence = read_seqbegin(&base->lock);
	p = lookup_rcu(daddr, base);
	invalidated = read_seqretry(&base->lock, sequence);
	rcu_read_unlock();

	if (p)
		return p;

	/* If no writer did a change during our lookup, we can return early. */
	if (!create && !invalidated)
		return NULL;

	/* retry an exact lookup, taking the lock before.
	 * At least, nodes should be hot in our cache.
	 */
	write_seqlock_bh(&base->lock);
relookup:
	p = lookup(daddr, stack, base);
	if (p != peer_avl_empty) {
		atomic_inc(&p->refcnt);
		write_sequnlock_bh(&base->lock);
		return p;
	}
	if (!gccnt) {
		gccnt = inet_peer_gc(base, stack, stackptr);
		if (gccnt && create)
			goto relookup;
	}
	p = create ? kmem_cache_alloc(peer_cachep, GFP_ATOMIC) : NULL;
	if (p) {
		p->daddr = *daddr;
		atomic_set(&p->refcnt, 1);
		atomic_set(&p->rid, 0);
		p->metrics[RTAX_LOCK-1] = INETPEER_METRICS_NEW;
		p->rate_tokens = 0;
		/* 60*HZ is arbitrary, but chosen enough high so that the first
		 * calculation of tokens is at its maximum.
		 */
		p->rate_last = jiffies - 60*HZ;
		INIT_LIST_HEAD(&p->gc_list);

		/* Link the node. */
		link_to_pool(p, base);
		base->total++;
	}
	write_sequnlock_bh(&base->lock);

	return p;
}
EXPORT_SYMBOL_GPL(inet_getpeer);

void inet_putpeer(struct inet_peer *p)
{
	p->dtime = (__u32)jiffies;
	smp_mb__before_atomic();
	atomic_dec(&p->refcnt);
}
EXPORT_SYMBOL_GPL(inet_putpeer);

/*
 *	Check transmit rate limitation for given message.
 *	The rate information is held in the inet_peer entries now.
 *	This function is generic and could be used for other purposes
 *	too. It uses a Token bucket filter as suggested by Alexey Kuznetsov.
 *
 *	Note that the same inet_peer fields are modified by functions in
 *	route.c too, but these work for packet destinations while xrlim_allow
 *	works for icmp destinations. This means the rate limiting information
 *	for one "ip object" is shared - and these ICMPs are twice limited:
 *	by source and by destination.
 *
 *	RFC 1812: 4.3.2.8 SHOULD be able to limit error message rate
 *			  SHOULD allow setting of rate limits
 *
 * 	Shared between ICMPv4 and ICMPv6.
 */
#define XRLIM_BURST_FACTOR 6
bool inet_peer_xrlim_allow(struct inet_peer *peer, int timeout)
{
	unsigned long now, token;
	bool rc = false;

	if (!peer)
		return true;

	token = peer->rate_tokens;
	now = jiffies;
	token += now - peer->rate_last;
	peer->rate_last = now;
	if (token > XRLIM_BURST_FACTOR * timeout)
		token = XRLIM_BURST_FACTOR * timeout;
	if (token >= timeout) {
		token -= timeout;
		rc = true;
	}
	peer->rate_tokens = token;
	return rc;
}
EXPORT_SYMBOL(inet_peer_xrlim_allow);

static void inetpeer_inval_rcu(struct rcu_head *head)
{
	struct inet_peer *p = container_of(head, struct inet_peer, gc_rcu);

	spin_lock_bh(&gc_lock);
	list_add_tail(&p->gc_list, &gc_list);
	spin_unlock_bh(&gc_lock);

	schedule_delayed_work(&gc_work, gc_delay);
}

void inetpeer_invalidate_tree(struct inet_peer_base *base)
{
	struct inet_peer *root;

	write_seqlock_bh(&base->lock);

	root = rcu_deref_locked(base->root, base);
	if (root != peer_avl_empty) {
		base->root = peer_avl_empty_rcu;
		base->total = 0;
		call_rcu(&root->gc_rcu, inetpeer_inval_rcu);
	}

	write_sequnlock_bh(&base->lock);
}
EXPORT_SYMBOL(inetpeer_invalidate_tree);
Commit	Line	Data
1da177e4 LT	1	/*
	2	* INETPEER - A storage for permanent information about peers
	3	*
	4	* This source is covered by the GNU GPL, the same as all kernel sources.
	5	*
1da177e4 LT	6	* Authors: Andrey V. Savochkin <saw@msu.ru>
	7	*/
	8
	9	#include <linux/module.h>
	10	#include <linux/types.h>
	11	#include <linux/slab.h>
	12	#include <linux/interrupt.h>
	13	#include <linux/spinlock.h>
	14	#include <linux/random.h>
1da177e4 LT	15	#include <linux/timer.h>
	16	#include <linux/time.h>
	17	#include <linux/kernel.h>
	18	#include <linux/mm.h>
	19	#include <linux/net.h>
5faa5df1	20	#include <linux/workqueue.h>
20380731	21	#include <net/ip.h>
1da177e4	22	#include <net/inetpeer.h>
6e5714ea	23	#include <net/secure_seq.h>
1da177e4 LT	24
	25	/*
	26	* Theory of operations.
	27	* We keep one entry for each peer IP address. The nodes contains long-living
	28	* information about the peer which doesn't depend on routes.
1da177e4	29	*
1da177e4 LT	30	* Nodes are removed only when reference counter goes to 0.
	31	* When it's happened the node may be removed when a sufficient amount of
	32	* time has been passed since its last use. The less-recently-used entry can
	33	* also be removed if the pool is overloaded i.e. if the total amount of
	34	* entries is greater-or-equal than the threshold.
	35	*
	36	* Node pool is organised as an AVL tree.
	37	* Such an implementation has been chosen not just for fun. It's a way to
	38	* prevent easy and efficient DoS attacks by creating hash collisions. A huge
	39	* amount of long living nodes in a single hash slot would significantly delay
	40	* lookups performed with disabled BHs.
	41	*
	42	* Serialisation issues.
aa1039e7 ED	43	* 1. Nodes may appear in the tree only with the pool lock held.
aa1039e7 ED	44	* 2. Nodes may disappear from the tree only with the pool lock held
1da177e4	45	* AND reference count being 0.
4b9d9be8 ED	46	* 3. Global variable peer_total is modified under the pool lock.
4b9d9be8 ED	47	* 4. struct inet_peer fields modification:
1da177e4	48	* avl_left, avl_right, avl_parent, avl_height: pool lock
1da177e4 LT	49	* refcnt: atomically against modifications on other CPU;
1da177e4 LT	50	* usually under some other lock to prevent node disappearing
582a72da	51	* daddr: unchangeable
1da177e4 LT	52	*/
1da177e4 LT	53
e18b890b	54	static struct kmem_cache *peer_cachep __read_mostly;
1da177e4	55
5faa5df1 SK	56	static LIST_HEAD(gc_list);
	57	static const int gc_delay = 60 * HZ;
	58	static struct delayed_work gc_work;
	59	static DEFINE_SPINLOCK(gc_lock);
	60
1da177e4	61	#define node_height(x) x->avl_height
d6cc1d64 ED	62
d6cc1d64 ED	63	#define peer_avl_empty ((struct inet_peer *)&peer_fake_node)
b914c4ea	64	#define peer_avl_empty_rcu ((struct inet_peer __rcu __force *)&peer_fake_node)
d6cc1d64	65	static const struct inet_peer peer_fake_node = {
b914c4ea ED	66	.avl_left = peer_avl_empty_rcu,
b914c4ea ED	67	.avl_right = peer_avl_empty_rcu,
1da177e4 LT	68	.avl_height = 0
1da177e4 LT	69	};
d6cc1d64	70
c3426b47 DM	71	void inet_peer_base_init(struct inet_peer_base *bp)
	72	{
	73	bp->root = peer_avl_empty_rcu;
	74	seqlock_init(&bp->lock);
b48c80ec	75	bp->flush_seq = ~0U;
c3426b47 DM	76	bp->total = 0;
	77	}
	78	EXPORT_SYMBOL_GPL(inet_peer_base_init);
021e9299	79
b48c80ec DM	80	static atomic_t v4_seq = ATOMIC_INIT(0);
	81	static atomic_t v6_seq = ATOMIC_INIT(0);
	82
	83	static atomic_t *inetpeer_seq_ptr(int family)
	84	{
	85	return (family == AF_INET ? &v4_seq : &v6_seq);
	86	}
	87
	88	static inline void flush_check(struct inet_peer_base *base, int family)
	89	{
	90	atomic_t *fp = inetpeer_seq_ptr(family);
	91
	92	if (unlikely(base->flush_seq != atomic_read(fp))) {
	93	inetpeer_invalidate_tree(base);
	94	base->flush_seq = atomic_read(fp);
	95	}
	96	}
	97
1da177e4 LT	98	#define PEER_MAXDEPTH 40 /* sufficient for about 2^27 nodes */
1da177e4 LT	99
1da177e4	100	/* Exported for sysctl_net_ipv4. */
243bbcaa	101	int inet_peer_threshold __read_mostly = 65536 + 128; /* start to throw entries more
1da177e4	102	* aggressively at this stage */
243bbcaa ED	103	int inet_peer_minttl __read_mostly = 120 * HZ; /* TTL under high load: 120 sec */
243bbcaa ED	104	int inet_peer_maxttl __read_mostly = 10 * 60 * HZ; /* usual time to live: 10 min */
1da177e4	105
5faa5df1 SK	106	static void inetpeer_gc_worker(struct work_struct *work)
5faa5df1 SK	107	{
da557374	108	struct inet_peer p, n, *c;
851bdd11	109	struct list_head list;
5faa5df1 SK	110
	111	spin_lock_bh(&gc_lock);
	112	list_replace_init(&gc_list, &list);
	113	spin_unlock_bh(&gc_lock);
	114
	115	if (list_empty(&list))
	116	return;
	117
	118	list_for_each_entry_safe(p, n, &list, gc_list) {
	119
da557374	120	if (need_resched())
5faa5df1 SK	121	cond_resched();
5faa5df1 SK	122
da557374 ED	123	c = rcu_dereference_protected(p->avl_left, 1);
	124	if (c != peer_avl_empty) {
	125	list_add_tail(&c->gc_list, &list);
	126	p->avl_left = peer_avl_empty_rcu;
5faa5df1 SK	127	}
5faa5df1 SK	128
da557374 ED	129	c = rcu_dereference_protected(p->avl_right, 1);
	130	if (c != peer_avl_empty) {
	131	list_add_tail(&c->gc_list, &list);
	132	p->avl_right = peer_avl_empty_rcu;
5faa5df1 SK	133	}
	134
	135	n = list_entry(p->gc_list.next, struct inet_peer, gc_list);
	136
	137	if (!atomic_read(&p->refcnt)) {
	138	list_del(&p->gc_list);
	139	kmem_cache_free(peer_cachep, p);
	140	}
	141	}
	142
	143	if (list_empty(&list))
	144	return;
	145
	146	spin_lock_bh(&gc_lock);
	147	list_splice(&list, &gc_list);
	148	spin_unlock_bh(&gc_lock);
	149
	150	schedule_delayed_work(&gc_work, gc_delay);
	151	}
1da177e4 LT	152
	153	/* Called from ip_output.c:ip_init */
	154	void __init inet_initpeers(void)
	155	{
	156	struct sysinfo si;
	157
	158	/* Use the straight interface to information about memory. */
	159	si_meminfo(&si);
	160	/* The values below were suggested by Alexey Kuznetsov
	161	* <kuznet@ms2.inr.ac.ru>. I don't have any opinion about the values
	162	* myself. --SAW
	163	*/
	164	if (si.totalram <= (32768*1024)/PAGE_SIZE)
	165	inet_peer_threshold >>= 1; /* max pool size about 1MB on IA32 */
	166	if (si.totalram <= (16384*1024)/PAGE_SIZE)
	167	inet_peer_threshold >>= 1; /* about 512KB */
	168	if (si.totalram <= (8192*1024)/PAGE_SIZE)
	169	inet_peer_threshold >>= 2; /* about 128KB */
	170
	171	peer_cachep = kmem_cache_create("inet_peer_cache",
	172	sizeof(struct inet_peer),
317fe0e6	173	0, SLAB_HWCACHE_ALIGN \| SLAB_PANIC,
20c2df83	174	NULL);
1da177e4	175
203b42f7	176	INIT_DEFERRABLE_WORK(&gc_work, inetpeer_gc_worker);
1da177e4 LT	177	}
1da177e4 LT	178
8790ca17 DM	179	static int addr_compare(const struct inetpeer_addr *a,
8790ca17 DM	180	const struct inetpeer_addr *b)
02663045 DM	181	{
	182	int i, n = (a->family == AF_INET ? 1 : 4);
	183
	184	for (i = 0; i < n; i++) {
7a71ed89	185	if (a->addr.a6[i] == b->addr.a6[i])
02663045	186	continue;
747465ef	187	if ((__force u32)a->addr.a6[i] < (__force u32)b->addr.a6[i])
02663045 DM	188	return -1;
	189	return 1;
	190	}
	191
	192	return 0;
	193	}
	194
65e8354e ED	195	#define rcu_deref_locked(X, BASE) \
	196	rcu_dereference_protected(X, lockdep_is_held(&(BASE)->lock.lock))
	197
243bbcaa ED	198	/*
243bbcaa ED	199	* Called with local BH disabled and the pool lock held.
243bbcaa	200	*/
98158f5a	201	#define lookup(_daddr, _stack, _base) \
1da177e4	202	({ \
b914c4ea ED	203	struct inet_peer *u; \
b914c4ea ED	204	struct inet_peer __rcu **v; \
aa1039e7 ED	205	\
aa1039e7 ED	206	stackptr = _stack; \
98158f5a	207	*stackptr++ = &_base->root; \
65e8354e	208	for (u = rcu_deref_locked(_base->root, _base); \
0c9a67d2	209	u != peer_avl_empty;) { \
02663045 DM	210	int cmp = addr_compare(_daddr, &u->daddr); \
02663045 DM	211	if (cmp == 0) \
1da177e4	212	break; \
02663045	213	if (cmp == -1) \
1da177e4 LT	214	v = &u->avl_left; \
	215	else \
	216	v = &u->avl_right; \
aa1039e7	217	*stackptr++ = v; \
65e8354e	218	u = rcu_deref_locked(*v, _base); \
1da177e4 LT	219	} \
	220	u; \
	221	})
	222
aa1039e7	223	/*
7b46ac4e	224	* Called with rcu_read_lock()
aa1039e7 ED	225	* Because we hold no lock against a writer, its quite possible we fall
	226	* in an endless loop.
	227	* But every pointer we follow is guaranteed to be valid thanks to RCU.
	228	* We exit from this function if number of links exceeds PEER_MAXDEPTH
	229	*/
7b46ac4e	230	static struct inet_peer lookup_rcu(const struct inetpeer_addr daddr,
4b9d9be8	231	struct inet_peer_base *base)
aa1039e7	232	{
7b46ac4e	233	struct inet_peer *u = rcu_dereference(base->root);
aa1039e7 ED	234	int count = 0;
	235
	236	while (u != peer_avl_empty) {
02663045 DM	237	int cmp = addr_compare(daddr, &u->daddr);
02663045 DM	238	if (cmp == 0) {
5f2f8920	239	/* Before taking a reference, check if this entry was
4b9d9be8	240	* deleted (refcnt=-1)
5f2f8920	241	*/
4b9d9be8	242	if (!atomic_add_unless(&u->refcnt, 1, -1))
aa1039e7 ED	243	u = NULL;
	244	return u;
	245	}
02663045	246	if (cmp == -1)
7b46ac4e	247	u = rcu_dereference(u->avl_left);
aa1039e7	248	else
7b46ac4e	249	u = rcu_dereference(u->avl_right);
aa1039e7 ED	250	if (unlikely(++count == PEER_MAXDEPTH))
	251	break;
	252	}
	253	return NULL;
	254	}
	255
	256	/* Called with local BH disabled and the pool lock held. */
98158f5a	257	#define lookup_rightempty(start, base) \
1da177e4	258	({ \
b914c4ea ED	259	struct inet_peer *u; \
b914c4ea ED	260	struct inet_peer __rcu **v; \
1da177e4 LT	261	*stackptr++ = &start->avl_left; \
1da177e4 LT	262	v = &start->avl_left; \
65e8354e	263	for (u = rcu_deref_locked(*v, base); \
0c9a67d2	264	u->avl_right != peer_avl_empty_rcu;) { \
1da177e4 LT	265	v = &u->avl_right; \
1da177e4 LT	266	*stackptr++ = v; \
65e8354e	267	u = rcu_deref_locked(*v, base); \
1da177e4 LT	268	} \
	269	u; \
	270	})
	271
aa1039e7	272	/* Called with local BH disabled and the pool lock held.
1da177e4	273	* Variable names are the proof of operation correctness.
aa1039e7 ED	274	* Look into mm/map_avl.c for more detail description of the ideas.
aa1039e7 ED	275	*/
b914c4ea	276	static void peer_avl_rebalance(struct inet_peer __rcu **stack[],
98158f5a DM	277	struct inet_peer __rcu ***stackend,
98158f5a DM	278	struct inet_peer_base *base)
1da177e4	279	{
b914c4ea ED	280	struct inet_peer __rcu **nodep;
b914c4ea ED	281	struct inet_peer node, l, *r;
1da177e4 LT	282	int lh, rh;
	283
	284	while (stackend > stack) {
	285	nodep = *--stackend;
65e8354e ED	286	node = rcu_deref_locked(*nodep, base);
	287	l = rcu_deref_locked(node->avl_left, base);
	288	r = rcu_deref_locked(node->avl_right, base);
1da177e4 LT	289	lh = node_height(l);
	290	rh = node_height(r);
	291	if (lh > rh + 1) { /* l: RH+2 */
	292	struct inet_peer ll, lr, lrl, lrr;
	293	int lrh;
65e8354e ED	294	ll = rcu_deref_locked(l->avl_left, base);
65e8354e ED	295	lr = rcu_deref_locked(l->avl_right, base);
1da177e4 LT	296	lrh = node_height(lr);
1da177e4 LT	297	if (lrh <= node_height(ll)) { /* ll: RH+1 */
b914c4ea ED	298	RCU_INIT_POINTER(node->avl_left, lr); /* lr: RH or RH+1 */
b914c4ea ED	299	RCU_INIT_POINTER(node->avl_right, r); /* r: RH */
1da177e4	300	node->avl_height = lrh + 1; /* RH+1 or RH+2 */
b914c4ea ED	301	RCU_INIT_POINTER(l->avl_left, ll); /* ll: RH+1 */
b914c4ea ED	302	RCU_INIT_POINTER(l->avl_right, node); /* node: RH+1 or RH+2 */
1da177e4	303	l->avl_height = node->avl_height + 1;
b914c4ea	304	RCU_INIT_POINTER(*nodep, l);
1da177e4	305	} else { /* ll: RH, lr: RH+1 */
65e8354e ED	306	lrl = rcu_deref_locked(lr->avl_left, base);/* lrl: RH or RH-1 */
65e8354e ED	307	lrr = rcu_deref_locked(lr->avl_right, base);/* lrr: RH or RH-1 */
b914c4ea ED	308	RCU_INIT_POINTER(node->avl_left, lrr); /* lrr: RH or RH-1 */
b914c4ea ED	309	RCU_INIT_POINTER(node->avl_right, r); /* r: RH */
1da177e4	310	node->avl_height = rh + 1; /* node: RH+1 */
b914c4ea ED	311	RCU_INIT_POINTER(l->avl_left, ll); /* ll: RH */
b914c4ea ED	312	RCU_INIT_POINTER(l->avl_right, lrl); /* lrl: RH or RH-1 */
1da177e4	313	l->avl_height = rh + 1; /* l: RH+1 */
b914c4ea ED	314	RCU_INIT_POINTER(lr->avl_left, l); /* l: RH+1 */
b914c4ea ED	315	RCU_INIT_POINTER(lr->avl_right, node); /* node: RH+1 */
1da177e4	316	lr->avl_height = rh + 2;
b914c4ea	317	RCU_INIT_POINTER(*nodep, lr);
1da177e4 LT	318	}
	319	} else if (rh > lh + 1) { /* r: LH+2 */
	320	struct inet_peer rr, rl, rlr, rll;
	321	int rlh;
65e8354e ED	322	rr = rcu_deref_locked(r->avl_right, base);
65e8354e ED	323	rl = rcu_deref_locked(r->avl_left, base);
1da177e4 LT	324	rlh = node_height(rl);
1da177e4 LT	325	if (rlh <= node_height(rr)) { /* rr: LH+1 */
b914c4ea ED	326	RCU_INIT_POINTER(node->avl_right, rl); /* rl: LH or LH+1 */
b914c4ea ED	327	RCU_INIT_POINTER(node->avl_left, l); /* l: LH */
1da177e4	328	node->avl_height = rlh + 1; /* LH+1 or LH+2 */
b914c4ea ED	329	RCU_INIT_POINTER(r->avl_right, rr); /* rr: LH+1 */
b914c4ea ED	330	RCU_INIT_POINTER(r->avl_left, node); /* node: LH+1 or LH+2 */
1da177e4	331	r->avl_height = node->avl_height + 1;
b914c4ea	332	RCU_INIT_POINTER(*nodep, r);
1da177e4	333	} else { /* rr: RH, rl: RH+1 */
65e8354e ED	334	rlr = rcu_deref_locked(rl->avl_right, base);/* rlr: LH or LH-1 */
65e8354e ED	335	rll = rcu_deref_locked(rl->avl_left, base);/* rll: LH or LH-1 */
b914c4ea ED	336	RCU_INIT_POINTER(node->avl_right, rll); /* rll: LH or LH-1 */
b914c4ea ED	337	RCU_INIT_POINTER(node->avl_left, l); /* l: LH */
1da177e4	338	node->avl_height = lh + 1; /* node: LH+1 */
b914c4ea ED	339	RCU_INIT_POINTER(r->avl_right, rr); /* rr: LH */
b914c4ea ED	340	RCU_INIT_POINTER(r->avl_left, rlr); /* rlr: LH or LH-1 */
1da177e4	341	r->avl_height = lh + 1; /* r: LH+1 */
b914c4ea ED	342	RCU_INIT_POINTER(rl->avl_right, r); /* r: LH+1 */
b914c4ea ED	343	RCU_INIT_POINTER(rl->avl_left, node); /* node: LH+1 */
1da177e4	344	rl->avl_height = lh + 2;
b914c4ea	345	RCU_INIT_POINTER(*nodep, rl);
1da177e4 LT	346	}
	347	} else {
	348	node->avl_height = (lh > rh ? lh : rh) + 1;
	349	}
	350	}
	351	}
	352
aa1039e7	353	/* Called with local BH disabled and the pool lock held. */
98158f5a	354	#define link_to_pool(n, base) \
1da177e4 LT	355	do { \
1da177e4 LT	356	n->avl_height = 1; \
b914c4ea ED	357	n->avl_left = peer_avl_empty_rcu; \
	358	n->avl_right = peer_avl_empty_rcu; \
	359	/* lockless readers can catch us now */ \
	360	rcu_assign_pointer(**--stackptr, n); \
98158f5a	361	peer_avl_rebalance(stack, stackptr, base); \
d6cc1d64	362	} while (0)
1da177e4	363
aa1039e7 ED	364	static void inetpeer_free_rcu(struct rcu_head *head)
	365	{
	366	kmem_cache_free(peer_cachep, container_of(head, struct inet_peer, rcu));
	367	}
	368
66944e1c ED	369	static void unlink_from_pool(struct inet_peer p, struct inet_peer_base base,
66944e1c ED	370	struct inet_peer __rcu **stack[PEER_MAXDEPTH])
1da177e4	371	{
4b9d9be8 ED	372	struct inet_peer __rcu *stackptr, *delp;
	373
	374	if (lookup(&p->daddr, stack, base) != p)
	375	BUG();
	376	delp = stackptr - 1; /* delp[0] == p /
	377	if (p->avl_left == peer_avl_empty_rcu) {
	378	*delp[0] = p->avl_right;
	379	--stackptr;
	380	} else {
	381	/* look for a node to insert instead of p */
	382	struct inet_peer *t;
	383	t = lookup_rightempty(p, base);
	384	BUG_ON(rcu_deref_locked(*stackptr[-1], base) != t);
	385	**--stackptr = t->avl_left;
	386	/* t is removed, t->daddr > x->daddr for any
	387	* x in p->avl_left subtree.
	388	* Put t in the old place of p. */
	389	RCU_INIT_POINTER(*delp[0], t);
	390	t->avl_left = p->avl_left;
	391	t->avl_right = p->avl_right;
	392	t->avl_height = p->avl_height;
	393	BUG_ON(delp[1] != &p->avl_left);
	394	delp[1] = &t->avl_left; /* was &p->avl_left */
1da177e4	395	}
4b9d9be8 ED	396	peer_avl_rebalance(stack, stackptr, base);
	397	base->total--;
	398	call_rcu(&p->rcu, inetpeer_free_rcu);
1da177e4 LT	399	}
1da177e4 LT	400
4b9d9be8 ED	401	/* perform garbage collect on all items stacked during a lookup */
	402	static int inet_peer_gc(struct inet_peer_base *base,
	403	struct inet_peer __rcu **stack[PEER_MAXDEPTH],
	404	struct inet_peer __rcu ***stackptr)
98158f5a	405	{
4b9d9be8 ED	406	struct inet_peer p, gchead = NULL;
	407	__u32 delta, ttl;
	408	int cnt = 0;
d71209de	409
4b9d9be8 ED	410	if (base->total >= inet_peer_threshold)
	411	ttl = 0; /* be aggressive */
	412	else
	413	ttl = inet_peer_maxttl
	414	- (inet_peer_maxttl - inet_peer_minttl) / HZ *
	415	base->total / inet_peer_threshold * HZ;
	416	stackptr--; /* last stack slot is peer_avl_empty */
	417	while (stackptr > stack) {
	418	stackptr--;
	419	p = rcu_deref_locked(**stackptr, base);
6d1a3e04 ED	420	if (atomic_read(&p->refcnt) == 0) {
	421	smp_rmb();
	422	delta = (__u32)jiffies - p->dtime;
	423	if (delta >= ttl &&
	424	atomic_cmpxchg(&p->refcnt, 0, -1) == 0) {
	425	p->gc_next = gchead;
	426	gchead = p;
	427	}
1da177e4	428	}
1da177e4	429	}
4b9d9be8 ED	430	while ((p = gchead) != NULL) {
	431	gchead = p->gc_next;
	432	cnt++;
	433	unlink_from_pool(p, base, stack);
	434	}
	435	return cnt;
1da177e4 LT	436	}
1da177e4 LT	437
c0efc887	438	struct inet_peer inet_getpeer(struct inet_peer_base base,
c8a627ed G	439	const struct inetpeer_addr *daddr,
c8a627ed G	440	int create)
1da177e4	441	{
b914c4ea	442	struct inet_peer __rcu stack[PEER_MAXDEPTH], *stackptr;
98158f5a	443	struct inet_peer *p;
65e8354e	444	unsigned int sequence;
4b9d9be8	445	int invalidated, gccnt = 0;
1da177e4	446
b48c80ec DM	447	flush_check(base, daddr->family);
b48c80ec DM	448
4b9d9be8	449	/* Attempt a lockless lookup first.
aa1039e7 ED	450	* Because of a concurrent writer, we might not find an existing entry.
aa1039e7 ED	451	*/
7b46ac4e	452	rcu_read_lock();
65e8354e	453	sequence = read_seqbegin(&base->lock);
4b9d9be8	454	p = lookup_rcu(daddr, base);
65e8354e	455	invalidated = read_seqretry(&base->lock, sequence);
7b46ac4e	456	rcu_read_unlock();
aa1039e7	457
4b9d9be8	458	if (p)
aa1039e7	459	return p;
1da177e4	460
65e8354e ED	461	/* If no writer did a change during our lookup, we can return early. */
	462	if (!create && !invalidated)
	463	return NULL;
	464
aa1039e7 ED	465	/* retry an exact lookup, taking the lock before.
	466	* At least, nodes should be hot in our cache.
	467	*/
65e8354e	468	write_seqlock_bh(&base->lock);
4b9d9be8	469	relookup:
02663045	470	p = lookup(daddr, stack, base);
1da177e4	471	if (p != peer_avl_empty) {
4b9d9be8	472	atomic_inc(&p->refcnt);
65e8354e	473	write_sequnlock_bh(&base->lock);
4b9d9be8 ED	474	return p;
	475	}
	476	if (!gccnt) {
	477	gccnt = inet_peer_gc(base, stack, stackptr);
	478	if (gccnt && create)
	479	goto relookup;
1da177e4	480	}
aa1039e7 ED	481	p = create ? kmem_cache_alloc(peer_cachep, GFP_ATOMIC) : NULL;
aa1039e7 ED	482	if (p) {
b534ecf1	483	p->daddr = *daddr;
aa1039e7 ED	484	atomic_set(&p->refcnt, 1);
aa1039e7 ED	485	atomic_set(&p->rid, 0);
144001bd	486	p->metrics[RTAX_LOCK-1] = INETPEER_METRICS_NEW;
92d86829	487	p->rate_tokens = 0;
bc9259a8 ND	488	/* 60*HZ is arbitrary, but chosen enough high so that the first
	489	* calculation of tokens is at its maximum.
	490	*/
	491	p->rate_last = jiffies - 60*HZ;
5faa5df1	492	INIT_LIST_HEAD(&p->gc_list);
aa1039e7 ED	493
aa1039e7 ED	494	/* Link the node. */
98158f5a DM	495	link_to_pool(p, base);
98158f5a DM	496	base->total++;
aa1039e7	497	}
65e8354e	498	write_sequnlock_bh(&base->lock);
1da177e4	499
1da177e4 LT	500	return p;
1da177e4 LT	501	}
b3419363	502	EXPORT_SYMBOL_GPL(inet_getpeer);
98158f5a	503
4663afe2 ED	504	void inet_putpeer(struct inet_peer *p)
4663afe2 ED	505	{
4b9d9be8	506	p->dtime = (__u32)jiffies;
4e857c58	507	smp_mb__before_atomic();
4b9d9be8	508	atomic_dec(&p->refcnt);
4663afe2	509	}
b3419363	510	EXPORT_SYMBOL_GPL(inet_putpeer);
92d86829 DM	511
	512	/*
	513	* Check transmit rate limitation for given message.
	514	* The rate information is held in the inet_peer entries now.
	515	* This function is generic and could be used for other purposes
	516	* too. It uses a Token bucket filter as suggested by Alexey Kuznetsov.
	517	*
	518	* Note that the same inet_peer fields are modified by functions in
	519	* route.c too, but these work for packet destinations while xrlim_allow
	520	* works for icmp destinations. This means the rate limiting information
	521	* for one "ip object" is shared - and these ICMPs are twice limited:
	522	* by source and by destination.
	523	*
	524	* RFC 1812: 4.3.2.8 SHOULD be able to limit error message rate
	525	* SHOULD allow setting of rate limits
	526	*
	527	* Shared between ICMPv4 and ICMPv6.
	528	*/
	529	#define XRLIM_BURST_FACTOR 6
	530	bool inet_peer_xrlim_allow(struct inet_peer *peer, int timeout)
	531	{
	532	unsigned long now, token;
	533	bool rc = false;
	534
	535	if (!peer)
	536	return true;
	537
	538	token = peer->rate_tokens;
	539	now = jiffies;
	540	token += now - peer->rate_last;
	541	peer->rate_last = now;
	542	if (token > XRLIM_BURST_FACTOR * timeout)
	543	token = XRLIM_BURST_FACTOR * timeout;
	544	if (token >= timeout) {
	545	token -= timeout;
	546	rc = true;
	547	}
	548	peer->rate_tokens = token;
	549	return rc;
	550	}
	551	EXPORT_SYMBOL(inet_peer_xrlim_allow);
5faa5df1	552
55432d2b ED	553	static void inetpeer_inval_rcu(struct rcu_head *head)
	554	{
	555	struct inet_peer *p = container_of(head, struct inet_peer, gc_rcu);
	556
	557	spin_lock_bh(&gc_lock);
	558	list_add_tail(&p->gc_list, &gc_list);
	559	spin_unlock_bh(&gc_lock);
	560
	561	schedule_delayed_work(&gc_work, gc_delay);
	562	}
	563
56a6b248	564	void inetpeer_invalidate_tree(struct inet_peer_base *base)
5faa5df1	565	{
da557374	566	struct inet_peer *root;
5faa5df1 SK	567
	568	write_seqlock_bh(&base->lock);
	569
da557374 ED	570	root = rcu_deref_locked(base->root, base);
	571	if (root != peer_avl_empty) {
	572	base->root = peer_avl_empty_rcu;
5faa5df1	573	base->total = 0;
da557374	574	call_rcu(&root->gc_rcu, inetpeer_inval_rcu);
5faa5df1 SK	575	}
5faa5df1 SK	576
5faa5df1 SK	577	write_sequnlock_bh(&base->lock);
	578	}
	579	EXPORT_SYMBOL(inetpeer_invalidate_tree);