neighbour.c 38.7 KB
Newer Older
Linus Torvalds's avatar
Linus Torvalds committed
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66
/*
 *	Generic address resolution entity
 *
 *	Authors:
 *	Pedro Roque		<roque@di.fc.ul.pt>
 *	Alexey Kuznetsov	<kuznet@ms2.inr.ac.ru>
 *
 *	This program is free software; you can redistribute it and/or
 *      modify it under the terms of the GNU General Public License
 *      as published by the Free Software Foundation; either version
 *      2 of the License, or (at your option) any later version.
 *
 *	Fixes:
 *	Vitaly E. Lavrov	releasing NULL neighbor in neigh_add.
 */

#include <linux/config.h>
#include <linux/types.h>
#include <linux/kernel.h>
#include <linux/socket.h>
#include <linux/sched.h>
#include <linux/netdevice.h>
#ifdef CONFIG_SYSCTL
#include <linux/sysctl.h>
#endif
#include <net/neighbour.h>
#include <net/dst.h>
#include <net/sock.h>
#include <linux/rtnetlink.h>

#define NEIGH_DEBUG 1

#define NEIGH_PRINTK(x...) printk(x)
#define NEIGH_NOPRINTK(x...) do { ; } while(0)
#define NEIGH_PRINTK0 NEIGH_PRINTK
#define NEIGH_PRINTK1 NEIGH_NOPRINTK
#define NEIGH_PRINTK2 NEIGH_NOPRINTK

#if NEIGH_DEBUG >= 1
#undef NEIGH_PRINTK1
#define NEIGH_PRINTK1 NEIGH_PRINTK
#endif
#if NEIGH_DEBUG >= 2
#undef NEIGH_PRINTK2
#define NEIGH_PRINTK2 NEIGH_PRINTK
#endif

static void neigh_timer_handler(unsigned long arg);
#ifdef CONFIG_ARPD
static void neigh_app_notify(struct neighbour *n);
#endif
static int pneigh_ifdown(struct neigh_table *tbl, struct net_device *dev);

static int neigh_glbl_allocs;
static struct neigh_table *neigh_tables;

/*
   Neighbour hash table buckets are protected with rwlock tbl->lock.

   - All the scans/updates to hash buckets MUST be made under this lock.
   - NOTHING clever should be made under this lock: no callbacks
     to protocol backends, no attempts to send something to network.
     It will result in deadlocks, if backend/driver wants to use neighbour
     cache.
   - If the entry requires some non-trivial actions, increase
     its reference count and release table lock.
67

Linus Torvalds's avatar
Linus Torvalds committed
68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103
   Neighbour entries are protected:
   - with reference count.
   - with rwlock neigh->lock

   Reference count prevents destruction.

   neigh->lock mainly serializes ll address data and its validity state.
   However, the same lock is used to protect another entry fields:
    - timer
    - resolution queue

   Again, nothing clever shall be made under neigh->lock,
   the most complicated procedure, which we allow is dev->hard_header.
   It is supposed, that dev->hard_header is simplistic and does
   not make callbacks to neighbour tables.

   The last lock is neigh_tbl_lock. It is pure SMP lock, protecting
   list of neighbour tables. This list is used only in process context,
 */

static rwlock_t neigh_tbl_lock = RW_LOCK_UNLOCKED;

static int neigh_blackhole(struct sk_buff *skb)
{
	kfree_skb(skb);
	return -ENETDOWN;
}

/*
 * It is random distribution in the interval (1/2)*base...(3/2)*base.
 * It corresponds to default IPv6 settings and is not overridable,
 * because it is really reasonbale choice.
 */

unsigned long neigh_rand_reach_time(unsigned long base)
{
104
	return (net_random() % base) + (base >> 1);
Linus Torvalds's avatar
Linus Torvalds committed
105 106 107 108 109 110 111 112
}


static int neigh_forced_gc(struct neigh_table *tbl)
{
	int shrunk = 0;
	int i;

113
	for (i = 0; i <= NEIGH_HASHMASK; i++) {
Linus Torvalds's avatar
Linus Torvalds committed
114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130
		struct neighbour *n, **np;

		np = &tbl->hash_buckets[i];
		write_lock_bh(&tbl->lock);
		while ((n = *np) != NULL) {
			/* Neighbour record may be discarded if:
			   - nobody refers to it.
			   - it is not premanent
			   - (NEW and probably wrong)
			     INCOMPLETE entries are kept at least for
			     n->parms->retrans_time, otherwise we could
			     flood network with resolution requests.
			     It is not clear, what is better table overflow
			     or flooding.
			 */
			write_lock(&n->lock);
			if (atomic_read(&n->refcnt) == 1 &&
131
			    !(n->nud_state & NUD_PERMANENT) &&
Linus Torvalds's avatar
Linus Torvalds committed
132 133
			    (n->nud_state != NUD_INCOMPLETE ||
			     jiffies - n->used > n->parms->retrans_time)) {
134
				*np	= n->next;
Linus Torvalds's avatar
Linus Torvalds committed
135
				n->dead = 1;
136
				shrunk	= 1;
Linus Torvalds's avatar
Linus Torvalds committed
137 138 139 140 141 142 143 144 145
				write_unlock(&n->lock);
				neigh_release(n);
				continue;
			}
			write_unlock(&n->lock);
			np = &n->next;
		}
		write_unlock_bh(&tbl->lock);
	}
146

Linus Torvalds's avatar
Linus Torvalds committed
147 148 149 150 151 152
	tbl->last_flush = jiffies;
	return shrunk;
}

static int neigh_del_timer(struct neighbour *n)
{
153 154 155 156
	if ((n->nud_state & NUD_IN_TIMER) &&
	    del_timer(&n->timer)) {
		neigh_release(n);
		return 1;
Linus Torvalds's avatar
Linus Torvalds committed
157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176
	}
	return 0;
}

static void pneigh_queue_purge(struct sk_buff_head *list)
{
	struct sk_buff *skb;

	while ((skb = skb_dequeue(list)) != NULL) {
		dev_put(skb->dev);
		kfree_skb(skb);
	}
}

int neigh_ifdown(struct neigh_table *tbl, struct net_device *dev)
{
	int i;

	write_lock_bh(&tbl->lock);

177 178
	for (i = 0; i <= NEIGH_HASHMASK; i++) {
		struct neighbour *n, **np = &tbl->hash_buckets[i];
Linus Torvalds's avatar
Linus Torvalds committed
179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202

		while ((n = *np) != NULL) {
			if (dev && n->dev != dev) {
				np = &n->next;
				continue;
			}
			*np = n->next;
			write_lock(&n->lock);
			neigh_del_timer(n);
			n->dead = 1;

			if (atomic_read(&n->refcnt) != 1) {
				/* The most unpleasant situation.
				   We must destroy neighbour entry,
				   but someone still uses it.

				   The destroy will be delayed until
				   the last user releases us, but
				   we must kill timers etc. and move
				   it to safe state.
				 */
				n->parms = &tbl->parms;
				skb_queue_purge(&n->arp_queue);
				n->output = neigh_blackhole;
203
				if (n->nud_state & NUD_VALID)
Linus Torvalds's avatar
Linus Torvalds committed
204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223
					n->nud_state = NUD_NOARP;
				else
					n->nud_state = NUD_NONE;
				NEIGH_PRINTK2("neigh %p is stray.\n", n);
			}
			write_unlock(&n->lock);
			neigh_release(n);
		}
	}

	pneigh_ifdown(tbl, dev);
	write_unlock_bh(&tbl->lock);

	del_timer_sync(&tbl->proxy_timer);
	pneigh_queue_purge(&tbl->proxy_queue);
	return 0;
}

static struct neighbour *neigh_alloc(struct neigh_table *tbl)
{
224
	struct neighbour *n = NULL;
Linus Torvalds's avatar
Linus Torvalds committed
225 226 227 228
	unsigned long now = jiffies;

	if (tbl->entries > tbl->gc_thresh3 ||
	    (tbl->entries > tbl->gc_thresh2 &&
229 230
	     now - tbl->last_flush > 5 * HZ)) {
		if (!neigh_forced_gc(tbl) &&
Linus Torvalds's avatar
Linus Torvalds committed
231
		    tbl->entries > tbl->gc_thresh3)
232
			goto out;
Linus Torvalds's avatar
Linus Torvalds committed
233 234 235
	}

	n = kmem_cache_alloc(tbl->kmem_cachep, SLAB_ATOMIC);
236 237
	if (!n)
		goto out;
Linus Torvalds's avatar
Linus Torvalds committed
238 239 240 241

	memset(n, 0, tbl->entry_size);

	skb_queue_head_init(&n->arp_queue);
242 243 244 245 246
	n->lock		  = RW_LOCK_UNLOCKED;
	n->updated	  = n->used = now;
	n->nud_state	  = NUD_NONE;
	n->output	  = neigh_blackhole;
	n->parms	  = &tbl->parms;
Linus Torvalds's avatar
Linus Torvalds committed
247 248
	init_timer(&n->timer);
	n->timer.function = neigh_timer_handler;
249
	n->timer.data	  = (unsigned long)n;
Linus Torvalds's avatar
Linus Torvalds committed
250 251 252
	tbl->stats.allocs++;
	neigh_glbl_allocs++;
	tbl->entries++;
253
	n->tbl		  = tbl;
Linus Torvalds's avatar
Linus Torvalds committed
254
	atomic_set(&n->refcnt, 1);
255 256
	n->dead		  = 1;
out:
Linus Torvalds's avatar
Linus Torvalds committed
257 258 259 260 261 262 263 264
	return n;
}

struct neighbour *neigh_lookup(struct neigh_table *tbl, const void *pkey,
			       struct net_device *dev)
{
	struct neighbour *n;
	int key_len = tbl->key_len;
265
	u32 hash_val = tbl->hash(pkey, dev);
Linus Torvalds's avatar
Linus Torvalds committed
266 267 268

	read_lock_bh(&tbl->lock);
	for (n = tbl->hash_buckets[hash_val]; n; n = n->next) {
269
		if (dev == n->dev && !memcmp(n->primary_key, pkey, key_len)) {
Linus Torvalds's avatar
Linus Torvalds committed
270 271 272 273 274 275 276 277
			neigh_hold(n);
			break;
		}
	}
	read_unlock_bh(&tbl->lock);
	return n;
}

278 279
struct neighbour *neigh_create(struct neigh_table *tbl, const void *pkey,
			       struct net_device *dev)
Linus Torvalds's avatar
Linus Torvalds committed
280 281 282 283
{
	u32 hash_val;
	int key_len = tbl->key_len;
	int error;
284
	struct neighbour *n1, *rc, *n = neigh_alloc(tbl);
Linus Torvalds's avatar
Linus Torvalds committed
285

286 287 288 289
	if (!n) {
		rc = ERR_PTR(-ENOBUFS);
		goto out;
	}
Linus Torvalds's avatar
Linus Torvalds committed
290 291 292 293 294 295 296

	memcpy(n->primary_key, pkey, key_len);
	n->dev = dev;
	dev_hold(dev);

	/* Protocol specific setup. */
	if (tbl->constructor &&	(error = tbl->constructor(n)) < 0) {
297 298
		rc = ERR_PTR(error);
		goto out_neigh_release;
Linus Torvalds's avatar
Linus Torvalds committed
299 300 301
	}

	/* Device specific setup. */
Linus Torvalds's avatar
Linus Torvalds committed
302
	if (n->parms->neigh_setup &&
Linus Torvalds's avatar
Linus Torvalds committed
303
	    (error = n->parms->neigh_setup(n)) < 0) {
304 305
		rc = ERR_PTR(error);
		goto out_neigh_release;
Linus Torvalds's avatar
Linus Torvalds committed
306 307
	}

308
	n->confirmed = jiffies - (n->parms->base_reachable_time << 1);
Linus Torvalds's avatar
Linus Torvalds committed
309 310 311 312 313

	hash_val = tbl->hash(pkey, dev);

	write_lock_bh(&tbl->lock);
	for (n1 = tbl->hash_buckets[hash_val]; n1; n1 = n1->next) {
314
		if (dev == n1->dev && !memcmp(n1->primary_key, pkey, key_len)) {
Linus Torvalds's avatar
Linus Torvalds committed
315 316
			neigh_hold(n1);
			write_unlock_bh(&tbl->lock);
317 318
			rc = n1;
			goto out_neigh_release;
Linus Torvalds's avatar
Linus Torvalds committed
319 320 321 322 323 324 325 326 327
		}
	}

	n->next = tbl->hash_buckets[hash_val];
	tbl->hash_buckets[hash_val] = n;
	n->dead = 0;
	neigh_hold(n);
	write_unlock_bh(&tbl->lock);
	NEIGH_PRINTK2("neigh %p is created.\n", n);
328 329 330 331 332 333
	rc = n;
out:
	return rc;
out_neigh_release:
	neigh_release(n);
	goto out;
Linus Torvalds's avatar
Linus Torvalds committed
334 335 336 337 338 339 340
}

struct pneigh_entry * pneigh_lookup(struct neigh_table *tbl, const void *pkey,
				    struct net_device *dev, int creat)
{
	struct pneigh_entry *n;
	int key_len = tbl->key_len;
341
	u32 hash_val = *(u32 *)(pkey + key_len - 4);
Linus Torvalds's avatar
Linus Torvalds committed
342

343 344 345
	hash_val ^= (hash_val >> 16);
	hash_val ^= hash_val >> 8;
	hash_val ^= hash_val >> 4;
Linus Torvalds's avatar
Linus Torvalds committed
346 347 348 349 350
	hash_val &= PNEIGH_HASHMASK;

	read_lock_bh(&tbl->lock);

	for (n = tbl->phash_buckets[hash_val]; n; n = n->next) {
351
		if (!memcmp(n->key, pkey, key_len) &&
Linus Torvalds's avatar
Linus Torvalds committed
352 353
		    (n->dev == dev || !n->dev)) {
			read_unlock_bh(&tbl->lock);
354
			goto out;
Linus Torvalds's avatar
Linus Torvalds committed
355 356 357
		}
	}
	read_unlock_bh(&tbl->lock);
358
	n = NULL;
Linus Torvalds's avatar
Linus Torvalds committed
359
	if (!creat)
360
		goto out;
Linus Torvalds's avatar
Linus Torvalds committed
361 362

	n = kmalloc(sizeof(*n) + key_len, GFP_KERNEL);
363 364
	if (!n)
		goto out;
Linus Torvalds's avatar
Linus Torvalds committed
365 366 367 368 369 370

	memcpy(n->key, pkey, key_len);
	n->dev = dev;

	if (tbl->pconstructor && tbl->pconstructor(n)) {
		kfree(n);
371 372
		n = NULL;
		goto out;
Linus Torvalds's avatar
Linus Torvalds committed
373 374 375 376 377 378
	}

	write_lock_bh(&tbl->lock);
	n->next = tbl->phash_buckets[hash_val];
	tbl->phash_buckets[hash_val] = n;
	write_unlock_bh(&tbl->lock);
379
out:
Linus Torvalds's avatar
Linus Torvalds committed
380 381 382 383
	return n;
}


384 385
int pneigh_delete(struct neigh_table *tbl, const void *pkey,
		  struct net_device *dev)
Linus Torvalds's avatar
Linus Torvalds committed
386 387 388
{
	struct pneigh_entry *n, **np;
	int key_len = tbl->key_len;
389
	u32 hash_val = *(u32 *)(pkey + key_len - 4);
Linus Torvalds's avatar
Linus Torvalds committed
390

391 392 393
	hash_val ^= (hash_val >> 16);
	hash_val ^= hash_val >> 8;
	hash_val ^= hash_val >> 4;
Linus Torvalds's avatar
Linus Torvalds committed
394 395
	hash_val &= PNEIGH_HASHMASK;

396 397 398
	for (np = &tbl->phash_buckets[hash_val]; (n = *np) != NULL;
	     np = &n->next) {
		if (!memcmp(n->key, pkey, key_len) && n->dev == dev) {
Linus Torvalds's avatar
Linus Torvalds committed
399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415
			write_lock_bh(&tbl->lock);
			*np = n->next;
			write_unlock_bh(&tbl->lock);
			if (tbl->pdestructor)
				tbl->pdestructor(n);
			kfree(n);
			return 0;
		}
	}
	return -ENOENT;
}

static int pneigh_ifdown(struct neigh_table *tbl, struct net_device *dev)
{
	struct pneigh_entry *n, **np;
	u32 h;

416 417 418 419
	for (h = 0; h <= PNEIGH_HASHMASK; h++) {
		np = &tbl->phash_buckets[h];
		while ((n = *np) != NULL) {
			if (!dev || n->dev == dev) {
Linus Torvalds's avatar
Linus Torvalds committed
420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437
				*np = n->next;
				if (tbl->pdestructor)
					tbl->pdestructor(n);
				kfree(n);
				continue;
			}
			np = &n->next;
		}
	}
	return -ENOENT;
}


/*
 *	neighbour must already be out of the table;
 *
 */
void neigh_destroy(struct neighbour *neigh)
438
{
Linus Torvalds's avatar
Linus Torvalds committed
439 440 441
	struct hh_cache *hh;

	if (!neigh->dead) {
442
		printk(KERN_WARNING
443 444
		       "Destroying alive neighbour %p from %08lx\n", neigh);
		dump_stack();
Linus Torvalds's avatar
Linus Torvalds committed
445 446 447 448
		return;
	}

	if (neigh_del_timer(neigh))
449
		printk(KERN_WARNING "Impossible event.\n");
Linus Torvalds's avatar
Linus Torvalds committed
450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 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

	while ((hh = neigh->hh) != NULL) {
		neigh->hh = hh->hh_next;
		hh->hh_next = NULL;
		write_lock_bh(&hh->hh_lock);
		hh->hh_output = neigh_blackhole;
		write_unlock_bh(&hh->hh_lock);
		if (atomic_dec_and_test(&hh->hh_refcnt))
			kfree(hh);
	}

	if (neigh->ops && neigh->ops->destructor)
		(neigh->ops->destructor)(neigh);

	skb_queue_purge(&neigh->arp_queue);

	dev_put(neigh->dev);

	NEIGH_PRINTK2("neigh %p is destroyed.\n", neigh);

	neigh_glbl_allocs--;
	neigh->tbl->entries--;
	kmem_cache_free(neigh->tbl->kmem_cachep, neigh);
}

/* Neighbour state is suspicious;
   disable fast path.

   Called with write_locked neigh.
 */
static void neigh_suspect(struct neighbour *neigh)
{
	struct hh_cache *hh;

	NEIGH_PRINTK2("neigh %p is suspecteded.\n", neigh);

	neigh->output = neigh->ops->output;

	for (hh = neigh->hh; hh; hh = hh->hh_next)
		hh->hh_output = neigh->ops->output;
}

/* Neighbour state is OK;
   enable fast path.

   Called with write_locked neigh.
 */
static void neigh_connect(struct neighbour *neigh)
{
	struct hh_cache *hh;

	NEIGH_PRINTK2("neigh %p is connected.\n", neigh);

	neigh->output = neigh->ops->connected_output;

	for (hh = neigh->hh; hh; hh = hh->hh_next)
		hh->hh_output = neigh->ops->hh_output;
}

/*
   Transitions NUD_STALE <-> NUD_REACHABLE do not occur
   when fast path is built: we have no timers assotiated with
   these states, we do not have time to check state when sending.
   neigh_periodic_timer check periodically neigh->confirmed
   time and moves NUD_REACHABLE -> NUD_STALE.

   If a routine wants to know TRUE entry state, it calls
   neigh_sync before checking state.

   Called with write_locked neigh.
 */

static void neigh_sync(struct neighbour *n)
{
	unsigned long now = jiffies;
	u8 state = n->nud_state;

527
	if (state & (NUD_NOARP | NUD_PERMANENT))
Linus Torvalds's avatar
Linus Torvalds committed
528
		return;
529
	if (state & NUD_REACHABLE) {
Linus Torvalds's avatar
Linus Torvalds committed
530 531 532 533
		if (now - n->confirmed > n->parms->reachable_time) {
			n->nud_state = NUD_STALE;
			neigh_suspect(n);
		}
534
	} else if (state & NUD_VALID) {
Linus Torvalds's avatar
Linus Torvalds committed
535 536 537 538 539 540 541 542 543 544
		if (now - n->confirmed < n->parms->reachable_time) {
			neigh_del_timer(n);
			n->nud_state = NUD_REACHABLE;
			neigh_connect(n);
		}
	}
}

static void SMP_TIMER_NAME(neigh_periodic_timer)(unsigned long arg)
{
545
	struct neigh_table *tbl = (struct neigh_table *)arg;
Linus Torvalds's avatar
Linus Torvalds committed
546 547 548 549 550 551 552
	unsigned long now = jiffies;
	int i;


	write_lock(&tbl->lock);

	/*
553
	 *	periodically recompute ReachableTime from random function
Linus Torvalds's avatar
Linus Torvalds committed
554
	 */
555 556

	if (now - tbl->last_rand > 300 * HZ) {
Linus Torvalds's avatar
Linus Torvalds committed
557 558
		struct neigh_parms *p;
		tbl->last_rand = now;
559 560 561
		for (p = &tbl->parms; p; p = p->next)
			p->reachable_time =
				neigh_rand_reach_time(p->base_reachable_time);
Linus Torvalds's avatar
Linus Torvalds committed
562 563
	}

564
	for (i = 0; i <= NEIGH_HASHMASK; i++) {
Linus Torvalds's avatar
Linus Torvalds committed
565 566 567 568 569 570 571 572 573
		struct neighbour *n, **np;

		np = &tbl->hash_buckets[i];
		while ((n = *np) != NULL) {
			unsigned state;

			write_lock(&n->lock);

			state = n->nud_state;
574
			if (state & (NUD_PERMANENT | NUD_IN_TIMER)) {
Linus Torvalds's avatar
Linus Torvalds committed
575 576 577 578 579 580 581 582
				write_unlock(&n->lock);
				goto next_elt;
			}

			if ((long)(n->used - n->confirmed) < 0)
				n->used = n->confirmed;

			if (atomic_read(&n->refcnt) == 1 &&
583 584
			    (state == NUD_FAILED ||
			     now - n->used > n->parms->gc_staletime)) {
Linus Torvalds's avatar
Linus Torvalds committed
585 586 587 588 589 590 591
				*np = n->next;
				n->dead = 1;
				write_unlock(&n->lock);
				neigh_release(n);
				continue;
			}

592
			if (n->nud_state & NUD_REACHABLE &&
Linus Torvalds's avatar
Linus Torvalds committed
593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610
			    now - n->confirmed > n->parms->reachable_time) {
				n->nud_state = NUD_STALE;
				neigh_suspect(n);
			}
			write_unlock(&n->lock);

next_elt:
			np = &n->next;
		}
	}

	mod_timer(&tbl->gc_timer, now + tbl->gc_interval);
	write_unlock(&tbl->lock);
}

#ifdef CONFIG_SMP
static void neigh_periodic_timer(unsigned long arg)
{
611 612
	struct neigh_table *tbl = (struct neigh_table *)arg;

Linus Torvalds's avatar
Linus Torvalds committed
613 614 615 616 617 618 619 620 621 622 623 624 625
	tasklet_schedule(&tbl->gc_task);
}
#endif

static __inline__ int neigh_max_probes(struct neighbour *n)
{
	struct neigh_parms *p = n->parms;
	return p->ucast_probes + p->app_probes + p->mcast_probes;
}


/* Called when a timer expires for a neighbour entry. */

626
static void neigh_timer_handler(unsigned long arg)
Linus Torvalds's avatar
Linus Torvalds committed
627 628
{
	unsigned long now = jiffies;
629
	struct neighbour *neigh = (struct neighbour *)arg;
Linus Torvalds's avatar
Linus Torvalds committed
630 631 632 633 634 635 636
	unsigned state;
	int notify = 0;

	write_lock(&neigh->lock);

	state = neigh->nud_state;

637
	if (!(state & NUD_IN_TIMER)) {
Linus Torvalds's avatar
Linus Torvalds committed
638
#ifndef CONFIG_SMP
639
		printk(KERN_WARNING "neigh: timer & !nud_in_timer\n");
Linus Torvalds's avatar
Linus Torvalds committed
640 641 642 643
#endif
		goto out;
	}

644
	if ((state & NUD_VALID) &&
Linus Torvalds's avatar
Linus Torvalds committed
645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666
	    now - neigh->confirmed < neigh->parms->reachable_time) {
		neigh->nud_state = NUD_REACHABLE;
		NEIGH_PRINTK2("neigh %p is still alive.\n", neigh);
		neigh_connect(neigh);
		goto out;
	}
	if (state == NUD_DELAY) {
		NEIGH_PRINTK2("neigh %p is probed.\n", neigh);
		neigh->nud_state = NUD_PROBE;
		atomic_set(&neigh->probes, 0);
	}

	if (atomic_read(&neigh->probes) >= neigh_max_probes(neigh)) {
		struct sk_buff *skb;

		neigh->nud_state = NUD_FAILED;
		notify = 1;
		neigh->tbl->stats.res_failed++;
		NEIGH_PRINTK2("neigh %p is failed.\n", neigh);

		/* It is very thin place. report_unreachable is very complicated
		   routine. Particularly, it can hit the same neighbour entry!
667

Linus Torvalds's avatar
Linus Torvalds committed
668 669
		   So that, we try to be accurate and avoid dead loop. --ANK
		 */
670 671
		while (neigh->nud_state == NUD_FAILED &&
		       (skb = __skb_dequeue(&neigh->arp_queue)) != NULL) {
Linus Torvalds's avatar
Linus Torvalds committed
672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698
			write_unlock(&neigh->lock);
			neigh->ops->error_report(neigh, skb);
			write_lock(&neigh->lock);
		}
		skb_queue_purge(&neigh->arp_queue);
		goto out;
	}

	neigh->timer.expires = now + neigh->parms->retrans_time;
	add_timer(&neigh->timer);
	write_unlock(&neigh->lock);

	neigh->ops->solicit(neigh, skb_peek(&neigh->arp_queue));
	atomic_inc(&neigh->probes);
	return;

out:
	write_unlock(&neigh->lock);
#ifdef CONFIG_ARPD
	if (notify && neigh->parms->app_probes)
		neigh_app_notify(neigh);
#endif
	neigh_release(neigh);
}

int __neigh_event_send(struct neighbour *neigh, struct sk_buff *skb)
{
699 700
	int rc;

Linus Torvalds's avatar
Linus Torvalds committed
701
	write_lock_bh(&neigh->lock);
702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720

	rc = 0;
	if (neigh->nud_state & (NUD_CONNECTED | NUD_DELAY | NUD_PROBE))
		goto out_unlock_bh;

	if (!(neigh->nud_state & (NUD_STALE | NUD_INCOMPLETE))) {
		if (neigh->parms->mcast_probes + neigh->parms->app_probes) {
			atomic_set(&neigh->probes, neigh->parms->ucast_probes);
			neigh->nud_state     = NUD_INCOMPLETE;
			neigh_hold(neigh);
			neigh->timer.expires = jiffies +
					       neigh->parms->retrans_time;
			add_timer(&neigh->timer);
			write_unlock_bh(&neigh->lock);
			neigh->ops->solicit(neigh, skb);
			atomic_inc(&neigh->probes);
			write_lock_bh(&neigh->lock);
		} else {
			neigh->nud_state = NUD_FAILED;
Linus Torvalds's avatar
Linus Torvalds committed
721
			write_unlock_bh(&neigh->lock);
722 723 724

			if (skb)
				kfree_skb(skb);
Linus Torvalds's avatar
Linus Torvalds committed
725 726
			return 1;
		}
727 728 729 730 731 732 733 734 735 736 737 738
	}

	if (neigh->nud_state == NUD_INCOMPLETE) {
		if (skb) {
			if (skb_queue_len(&neigh->arp_queue) >=
			    neigh->parms->queue_len) {
				struct sk_buff *buff;
				buff = neigh->arp_queue.next;
				__skb_unlink(buff, &neigh->arp_queue);
				kfree_skb(buff);
			}
			__skb_queue_tail(&neigh->arp_queue, skb);
Linus Torvalds's avatar
Linus Torvalds committed
739
		}
740 741 742 743 744 745 746 747
		rc = 1;
	} else if (neigh->nud_state == NUD_STALE) {
		NEIGH_PRINTK2("neigh %p is delayed.\n", neigh);
		neigh_hold(neigh);
		neigh->nud_state = NUD_DELAY;
		neigh->timer.expires = jiffies + neigh->parms->delay_probe_time;
		add_timer(&neigh->timer);
		rc = 0;
Linus Torvalds's avatar
Linus Torvalds committed
748
	}
749
out_unlock_bh:
Linus Torvalds's avatar
Linus Torvalds committed
750
	write_unlock_bh(&neigh->lock);
751
	return rc;
Linus Torvalds's avatar
Linus Torvalds committed
752 753 754 755 756
}

static __inline__ void neigh_update_hhs(struct neighbour *neigh)
{
	struct hh_cache *hh;
757
	void (*update)(struct hh_cache*, struct net_device*, unsigned char *) =
Linus Torvalds's avatar
Linus Torvalds committed
758 759 760
		neigh->dev->header_cache_update;

	if (update) {
761
		for (hh = neigh->hh; hh; hh = hh->hh_next) {
Linus Torvalds's avatar
Linus Torvalds committed
762 763 764 765 766 767 768 769 770 771 772 773
			write_lock_bh(&hh->hh_lock);
			update(hh, neigh->dev, neigh->ha);
			write_unlock_bh(&hh->hh_lock);
		}
	}
}



/* Generic update routine.
   -- lladdr is new lladdr or NULL, if it is not supplied.
   -- new    is new state.
774 775
   -- override == 1 allows to override existing lladdr, if it is different.
   -- arp == 0 means that the change is administrative.
Linus Torvalds's avatar
Linus Torvalds committed
776 777 778 779

   Caller MUST hold reference count on the entry.
 */

780 781
int neigh_update(struct neighbour *neigh, const u8 *lladdr, u8 new,
		 int override, int arp)
Linus Torvalds's avatar
Linus Torvalds committed
782 783 784
{
	u8 old;
	int err;
785
#ifdef CONFIG_ARPD
Linus Torvalds's avatar
Linus Torvalds committed
786
	int notify = 0;
787 788
#endif
	struct net_device *dev;
Linus Torvalds's avatar
Linus Torvalds committed
789 790 791

	write_lock_bh(&neigh->lock);

792 793 794 795 796
	dev    = neigh->dev;
	old    = neigh->nud_state;
	err    = -EPERM;

	if (arp && (old & (NUD_NOARP | NUD_PERMANENT)))
Linus Torvalds's avatar
Linus Torvalds committed
797 798
		goto out;

799
	if (!(new & NUD_VALID)) {
Linus Torvalds's avatar
Linus Torvalds committed
800
		neigh_del_timer(neigh);
801
		if (old & NUD_CONNECTED)
Linus Torvalds's avatar
Linus Torvalds committed
802 803 804
			neigh_suspect(neigh);
		neigh->nud_state = new;
		err = 0;
805 806 807
#ifdef CONFIG_ARPD
		notify = old & NUD_VALID;
#endif
Linus Torvalds's avatar
Linus Torvalds committed
808 809 810 811
		goto out;
	}

	/* Compare new lladdr with cached one */
812
	if (!dev->addr_len) {
Linus Torvalds's avatar
Linus Torvalds committed
813 814 815 816 817 818 819 820
		/* First case: device needs no address. */
		lladdr = neigh->ha;
	} else if (lladdr) {
		/* The second case: if something is already cached
		   and a new address is proposed:
		   - compare new & old
		   - if they are different, check override flag
		 */
821 822
		if (old & NUD_VALID) {
			if (!memcmp(lladdr, neigh->ha, dev->addr_len))
Linus Torvalds's avatar
Linus Torvalds committed
823 824 825 826 827 828 829 830 831
				lladdr = neigh->ha;
			else if (!override)
				goto out;
		}
	} else {
		/* No address is supplied; if we know something,
		   use it, otherwise discard the request.
		 */
		err = -EINVAL;
832
		if (!(old & NUD_VALID))
Linus Torvalds's avatar
Linus Torvalds committed
833 834 835 836 837 838
			goto out;
		lladdr = neigh->ha;
	}

	neigh_sync(neigh);
	old = neigh->nud_state;
839
	if (new & NUD_CONNECTED)
Linus Torvalds's avatar
Linus Torvalds committed
840 841 842 843 844 845 846
		neigh->confirmed = jiffies;
	neigh->updated = jiffies;

	/* If entry was valid and address is not changed,
	   do not change entry state, if new one is STALE.
	 */
	err = 0;
847 848 849 850
	if ((old & NUD_VALID) && lladdr == neigh->ha &&
	    (new == old || (new == NUD_STALE && (old & NUD_CONNECTED))))
		goto out;

Linus Torvalds's avatar
Linus Torvalds committed
851 852 853 854 855
	neigh_del_timer(neigh);
	neigh->nud_state = new;
	if (lladdr != neigh->ha) {
		memcpy(&neigh->ha, lladdr, dev->addr_len);
		neigh_update_hhs(neigh);
856 857 858
		if (!(new & NUD_CONNECTED))
			neigh->confirmed = jiffies -
				      (neigh->parms->base_reachable_time << 1);
Linus Torvalds's avatar
Linus Torvalds committed
859 860 861 862 863 864
#ifdef CONFIG_ARPD
		notify = 1;
#endif
	}
	if (new == old)
		goto out;
865
	if (new & NUD_CONNECTED)
Linus Torvalds's avatar
Linus Torvalds committed
866 867 868
		neigh_connect(neigh);
	else
		neigh_suspect(neigh);
869
	if (!(old & NUD_VALID)) {
Linus Torvalds's avatar
Linus Torvalds committed
870 871 872 873
		struct sk_buff *skb;

		/* Again: avoid dead loop if something went wrong */

874 875
		while (neigh->nud_state & NUD_VALID &&
		       (skb = __skb_dequeue(&neigh->arp_queue)) != NULL) {
Linus Torvalds's avatar
Linus Torvalds committed
876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894
			struct neighbour *n1 = neigh;
			write_unlock_bh(&neigh->lock);
			/* On shaper/eql skb->dst->neighbour != neigh :( */
			if (skb->dst && skb->dst->neighbour)
				n1 = skb->dst->neighbour;
			n1->output(skb);
			write_lock_bh(&neigh->lock);
		}
		skb_queue_purge(&neigh->arp_queue);
	}
out:
	write_unlock_bh(&neigh->lock);
#ifdef CONFIG_ARPD
	if (notify && neigh->parms->app_probes)
		neigh_app_notify(neigh);
#endif
	return err;
}

895 896 897
struct neighbour *neigh_event_ns(struct neigh_table *tbl,
				 u8 *lladdr, void *saddr,
				 struct net_device *dev)
Linus Torvalds's avatar
Linus Torvalds committed
898
{
899 900
	struct neighbour *neigh = __neigh_lookup(tbl, saddr, dev,
						 lladdr || !dev->addr_len);
Linus Torvalds's avatar
Linus Torvalds committed
901 902 903 904 905
	if (neigh)
		neigh_update(neigh, lladdr, NUD_STALE, 1, 1);
	return neigh;
}

906 907
static void neigh_hh_init(struct neighbour *n, struct dst_entry *dst,
			  u16 protocol)
Linus Torvalds's avatar
Linus Torvalds committed
908
{
909
	struct hh_cache	*hh;
Linus Torvalds's avatar
Linus Torvalds committed
910 911
	struct net_device *dev = dst->dev;

912
	for (hh = n->hh; hh; hh = hh->hh_next)
Linus Torvalds's avatar
Linus Torvalds committed
913 914 915 916 917 918 919 920 921 922 923 924 925 926 927
		if (hh->hh_type == protocol)
			break;

	if (!hh && (hh = kmalloc(sizeof(*hh), GFP_ATOMIC)) != NULL) {
		memset(hh, 0, sizeof(struct hh_cache));
		hh->hh_lock = RW_LOCK_UNLOCKED;
		hh->hh_type = protocol;
		atomic_set(&hh->hh_refcnt, 0);
		hh->hh_next = NULL;
		if (dev->hard_header_cache(n, hh)) {
			kfree(hh);
			hh = NULL;
		} else {
			atomic_inc(&hh->hh_refcnt);
			hh->hh_next = n->hh;
928 929
			n->hh	    = hh;
			if (n->nud_state & NUD_CONNECTED)
Linus Torvalds's avatar
Linus Torvalds committed
930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952
				hh->hh_output = n->ops->hh_output;
			else
				hh->hh_output = n->ops->output;
		}
	}
	if (hh)	{
		atomic_inc(&hh->hh_refcnt);
		dst->hh = hh;
	}
}

/* This function can be used in contexts, where only old dev_queue_xmit
   worked, f.e. if you want to override normal output path (eql, shaper),
   but resoltution is not made yet.
 */

int neigh_compat_output(struct sk_buff *skb)
{
	struct net_device *dev = skb->dev;

	__skb_pull(skb, skb->nh.raw - skb->data);

	if (dev->hard_header &&
953 954
	    dev->hard_header(skb, dev, ntohs(skb->protocol), NULL, NULL,
		    	     skb->len) < 0 &&
Linus Torvalds's avatar
Linus Torvalds committed
955 956 957 958 959 960 961 962 963 964 965 966
	    dev->rebuild_header(skb))
		return 0;

	return dev_queue_xmit(skb);
}

/* Slow and careful. */

int neigh_resolve_output(struct sk_buff *skb)
{
	struct dst_entry *dst = skb->dst;
	struct neighbour *neigh;
967
	int rc = 0;
Linus Torvalds's avatar
Linus Torvalds committed
968 969 970 971 972 973

	if (!dst || !(neigh = dst->neighbour))
		goto discard;

	__skb_pull(skb, skb->nh.raw - skb->data);

974
	if (!neigh_event_send(neigh, skb)) {
Linus Torvalds's avatar
Linus Torvalds committed
975 976
		int err;
		struct net_device *dev = neigh->dev;
977
		if (dev->hard_header_cache && !dst->hh) {
Linus Torvalds's avatar
Linus Torvalds committed
978
			write_lock_bh(&neigh->lock);
979
			if (!dst->hh)
Linus Torvalds's avatar
Linus Torvalds committed
980
				neigh_hh_init(neigh, dst, dst->ops->protocol);
981 982
			err = dev->hard_header(skb, dev, ntohs(skb->protocol),
					       neigh->ha, NULL, skb->len);
Linus Torvalds's avatar
Linus Torvalds committed
983 984 985
			write_unlock_bh(&neigh->lock);
		} else {
			read_lock_bh(&neigh->lock);
986 987
			err = dev->hard_header(skb, dev, ntohs(skb->protocol),
					       neigh->ha, NULL, skb->len);
Linus Torvalds's avatar
Linus Torvalds committed
988 989 990
			read_unlock_bh(&neigh->lock);
		}
		if (err >= 0)
991 992 993
			rc = neigh->ops->queue_xmit(skb);
		else
			goto out_kfree_skb;
Linus Torvalds's avatar
Linus Torvalds committed
994
	}
995 996
out:
	return rc;
Linus Torvalds's avatar
Linus Torvalds committed
997
discard:
998 999 1000 1001
	NEIGH_PRINTK1("neigh_resolve_output: dst=%p neigh=%p\n",
		      dst, dst ? dst->neighbour : NULL);
out_kfree_skb:
	rc = -EINVAL;
Linus Torvalds's avatar
Linus Torvalds committed
1002
	kfree_skb(skb);
1003
	goto out;
Linus Torvalds's avatar
Linus Torvalds committed
1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017
}

/* As fast as possible without hh cache */

int neigh_connected_output(struct sk_buff *skb)
{
	int err;
	struct dst_entry *dst = skb->dst;
	struct neighbour *neigh = dst->neighbour;
	struct net_device *dev = neigh->dev;

	__skb_pull(skb, skb->nh.raw - skb->data);

	read_lock_bh(&neigh->lock);
1018 1019
	err = dev->hard_header(skb, dev, ntohs(skb->protocol),
			       neigh->ha, NULL, skb->len);
Linus Torvalds's avatar
Linus Torvalds committed
1020 1021
	read_unlock_bh(&neigh->lock);
	if (err >= 0)
1022 1023 1024 1025 1026 1027
		err = neigh->ops->queue_xmit(skb);
	else {
		err = -EINVAL;
		kfree_skb(skb);
	}
	return err;
Linus Torvalds's avatar
Linus Torvalds committed
1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040
}

static void neigh_proxy_process(unsigned long arg)
{
	struct neigh_table *tbl = (struct neigh_table *)arg;
	long sched_next = 0;
	unsigned long now = jiffies;
	struct sk_buff *skb;

	spin_lock(&tbl->proxy_queue.lock);

	skb = tbl->proxy_queue.next;

1041
	while (skb != (struct sk_buff *)&tbl->proxy_queue) {
Linus Torvalds's avatar
Linus Torvalds committed
1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067
		struct sk_buff *back = skb;
		long tdif = back->stamp.tv_usec - now;

		skb = skb->next;
		if (tdif <= 0) {
			struct net_device *dev = back->dev;
			__skb_unlink(back, &tbl->proxy_queue);
			if (tbl->proxy_redo && netif_running(dev))
				tbl->proxy_redo(back);
			else
				kfree_skb(back);

			dev_put(dev);
		} else if (!sched_next || tdif < sched_next)
			sched_next = tdif;
	}
	del_timer(&tbl->proxy_timer);
	if (sched_next)
		mod_timer(&tbl->proxy_timer, jiffies + sched_next);
	spin_unlock(&tbl->proxy_queue.lock);
}

void pneigh_enqueue(struct neigh_table *tbl, struct neigh_parms *p,
		    struct sk_buff *skb)
{
	unsigned long now = jiffies;
1068
	long sched_next = net_random() % p->proxy_delay;
Linus Torvalds's avatar
Linus Torvalds committed
1069 1070 1071 1072 1073

	if (tbl->proxy_queue.qlen > p->proxy_qlen) {
		kfree_skb(skb);
		return;
	}
1074
	skb->stamp.tv_sec  = 0;
Linus Torvalds's avatar
Linus Torvalds committed
1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091
	skb->stamp.tv_usec = now + sched_next;

	spin_lock(&tbl->proxy_queue.lock);
	if (del_timer(&tbl->proxy_timer)) {
		long tval = tbl->proxy_timer.expires - now;
		if (tval < sched_next)
			sched_next = tval;
	}
	dst_release(skb->dst);
	skb->dst = NULL;
	dev_hold(skb->dev);
	__skb_queue_tail(&tbl->proxy_queue, skb);
	mod_timer(&tbl->proxy_timer, now + sched_next);
	spin_unlock(&tbl->proxy_queue.lock);
}


1092 1093
struct neigh_parms *neigh_parms_alloc(struct net_device *dev,
				      struct neigh_table *tbl)
Linus Torvalds's avatar
Linus Torvalds committed
1094
{
1095 1096
	struct neigh_parms *p = kmalloc(sizeof(*p), GFP_KERNEL);

Linus Torvalds's avatar
Linus Torvalds committed
1097 1098
	if (p) {
		memcpy(p, &tbl->parms, sizeof(*p));
1099 1100 1101 1102 1103 1104
		p->tbl		  = tbl;
		p->reachable_time =
				neigh_rand_reach_time(p->base_reachable_time);
		if (dev && dev->neigh_setup && dev->neigh_setup(dev, p)) {
			kfree(p);
			return NULL;
Linus Torvalds's avatar
Linus Torvalds committed
1105 1106
		}
		write_lock_bh(&tbl->lock);
1107
		p->next		= tbl->parms.next;
Linus Torvalds's avatar
Linus Torvalds committed
1108 1109 1110 1111 1112 1113 1114 1115 1116
		tbl->parms.next = p;
		write_unlock_bh(&tbl->lock);
	}
	return p;
}

void neigh_parms_release(struct neigh_table *tbl, struct neigh_parms *parms)
{
	struct neigh_parms **p;
1117 1118

	if (!parms || parms == &tbl->parms)
Linus Torvalds's avatar
Linus Torvalds committed
1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140
		return;
	write_lock_bh(&tbl->lock);
	for (p = &tbl->parms.next; *p; p = &(*p)->next) {
		if (*p == parms) {
			*p = parms->next;
			write_unlock_bh(&tbl->lock);
#ifdef CONFIG_SYSCTL
			neigh_sysctl_unregister(parms);
#endif
			kfree(parms);
			return;
		}
	}
	write_unlock_bh(&tbl->lock);
	NEIGH_PRINTK1("neigh_parms_release: not found\n");
}


void neigh_table_init(struct neigh_table *tbl)
{
	unsigned long now = jiffies;

1141 1142
	tbl->parms.reachable_time =
			  neigh_rand_reach_time(tbl->parms.base_reachable_time);
Linus Torvalds's avatar
Linus Torvalds committed
1143

1144
	if (!tbl->kmem_cachep)
Linus Torvalds's avatar
Linus Torvalds committed
1145
		tbl->kmem_cachep = kmem_cache_create(tbl->id,
1146 1147
						     (tbl->entry_size +
						      15) & ~15,
Linus Torvalds's avatar
Linus Torvalds committed
1148 1149 1150
						     0, SLAB_HWCACHE_ALIGN,
						     NULL, NULL);
#ifdef CONFIG_SMP
1151 1152
	tasklet_init(&tbl->gc_task, SMP_TIMER_NAME(neigh_periodic_timer),
		     (unsigned long)tbl);
Linus Torvalds's avatar
Linus Torvalds committed
1153
#endif
1154
	tbl->lock	       = RW_LOCK_UNLOCKED;
1155
	init_timer(&tbl->gc_timer);
1156
	tbl->gc_timer.data     = (unsigned long)tbl;
Linus Torvalds's avatar
Linus Torvalds committed
1157
	tbl->gc_timer.function = neigh_periodic_timer;
1158 1159
	tbl->gc_timer.expires  = now + tbl->gc_interval +
				 tbl->parms.reachable_time;
Linus Torvalds's avatar
Linus Torvalds committed
1160 1161 1162
	add_timer(&tbl->gc_timer);

	init_timer(&tbl->proxy_timer);
1163
	tbl->proxy_timer.data	  = (unsigned long)tbl;
Linus Torvalds's avatar
Linus Torvalds committed
1164 1165 1166 1167
	tbl->proxy_timer.function = neigh_proxy_process;
	skb_queue_head_init(&tbl->proxy_queue);

	tbl->last_flush = now;
1168
	tbl->last_rand	= now + tbl->parms.reachable_time * 20;
Linus Torvalds's avatar
Linus Torvalds committed
1169
	write_lock(&neigh_tbl_lock);
1170 1171
	tbl->next	= neigh_tables;
	neigh_tables	= tbl;
Linus Torvalds's avatar
Linus Torvalds committed
1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206
	write_unlock(&neigh_tbl_lock);
}

int neigh_table_clear(struct neigh_table *tbl)
{
	struct neigh_table **tp;

	/* It is not clean... Fix it to unload IPv6 module safely */
	del_timer_sync(&tbl->gc_timer);
	tasklet_kill(&tbl->gc_task);
	del_timer_sync(&tbl->proxy_timer);
	pneigh_queue_purge(&tbl->proxy_queue);
	neigh_ifdown(tbl, NULL);
	if (tbl->entries)
		printk(KERN_CRIT "neighbour leakage\n");
	write_lock(&neigh_tbl_lock);
	for (tp = &neigh_tables; *tp; tp = &(*tp)->next) {
		if (*tp == tbl) {
			*tp = tbl->next;
			break;
		}
	}
	write_unlock(&neigh_tbl_lock);
#ifdef CONFIG_SYSCTL
	neigh_sysctl_unregister(&tbl->parms);
#endif
	return 0;
}

int neigh_delete(struct sk_buff *skb, struct nlmsghdr *nlh, void *arg)
{
	struct ndmsg *ndm = NLMSG_DATA(nlh);
	struct rtattr **nda = arg;
	struct neigh_table *tbl;
	struct net_device *dev = NULL;
1207
	int err = -ENODEV;
Linus Torvalds's avatar
Linus Torvalds committed
1208

1209 1210 1211
	if (ndm->ndm_ifindex &&
	    (dev = dev_get_by_index(ndm->ndm_ifindex)) == NULL)
		goto out;
Linus Torvalds's avatar
Linus Torvalds committed
1212 1213

	read_lock(&neigh_tbl_lock);
1214
	for (tbl = neigh_tables; tbl; tbl = tbl->next) {
Linus Torvalds's avatar
Linus Torvalds committed
1215 1216 1217 1218 1219 1220 1221
		struct neighbour *n;

		if (tbl->family != ndm->ndm_family)
			continue;
		read_unlock(&neigh_tbl_lock);

		err = -EINVAL;
1222 1223 1224 1225 1226 1227 1228 1229
		if (!nda[NDA_DST - 1] ||
		    nda[NDA_DST - 1]->rta_len != RTA_LENGTH(tbl->key_len))
			goto out_dev_put;

		if (ndm->ndm_flags & NTF_PROXY) {
			err = pneigh_delete(tbl,
					    RTA_DATA(nda[NDA_DST - 1]), dev);
			goto out_dev_put;
Linus Torvalds's avatar
Linus Torvalds committed
1230 1231
		}

1232 1233
		if (!dev)
			goto out;
Linus Torvalds's avatar
Linus Torvalds committed
1234

1235
		n = neigh_lookup(tbl, RTA_DATA(nda[NDA_DST - 1]), dev);
Linus Torvalds's avatar
Linus Torvalds committed
1236 1237 1238 1239
		if (n) {
			err = neigh_update(n, NULL, NUD_FAILED, 1, 0);
			neigh_release(n);
		}
1240
		goto out_dev_put;
Linus Torvalds's avatar
Linus Torvalds committed
1241 1242
	}
	read_unlock(&neigh_tbl_lock);
1243 1244
	err = -EADDRNOTAVAIL;
out_dev_put:
Linus Torvalds's avatar
Linus Torvalds committed
1245 1246
	if (dev)
		dev_put(dev);
1247 1248
out:
	return err;
Linus Torvalds's avatar
Linus Torvalds committed
1249 1250 1251 1252 1253 1254 1255 1256
}

int neigh_add(struct sk_buff *skb, struct nlmsghdr *nlh, void *arg)
{
	struct ndmsg *ndm = NLMSG_DATA(nlh);
	struct rtattr **nda = arg;
	struct neigh_table *tbl;
	struct net_device *dev = NULL;
1257
	int err = -ENODEV;
Linus Torvalds's avatar
Linus Torvalds committed
1258

1259 1260 1261
	if (ndm->ndm_ifindex &&
	    (dev = dev_get_by_index(ndm->ndm_ifindex)) == NULL)
		goto out;
Linus Torvalds's avatar
Linus Torvalds committed
1262 1263

	read_lock(&neigh_tbl_lock);
1264
	for (tbl = neigh_tables; tbl; tbl = tbl->next) {
1265
		int override = 1;
Linus Torvalds's avatar
Linus Torvalds committed
1266 1267 1268 1269 1270 1271 1272
		struct neighbour *n;

		if (tbl->family != ndm->ndm_family)
			continue;
		read_unlock(&neigh_tbl_lock);

		err = -EINVAL;
1273 1274 1275 1276
		if (!nda[NDA_DST - 1] ||
		    nda[NDA_DST - 1]->rta_len != RTA_LENGTH(tbl->key_len))
			goto out_dev_put;
		if (ndm->ndm_flags & NTF_PROXY) {
Linus Torvalds's avatar
Linus Torvalds committed
1277
			err = -ENOBUFS;
1278 1279
			if (pneigh_lookup(tbl,
					  RTA_DATA(nda[NDA_DST - 1]), dev, 1))
Linus Torvalds's avatar
Linus Torvalds committed
1280
				err = 0;
1281
			goto out_dev_put;
Linus Torvalds's avatar
Linus Torvalds committed
1282 1283
		}
		err = -EINVAL;
1284
		if (!dev)
Linus Torvalds's avatar
Linus Torvalds committed
1285
			goto out;
1286 1287 1288
		if (nda[NDA_LLADDR - 1] &&
		    nda[NDA_LLADDR - 1]->rta_len != RTA_LENGTH(dev->addr_len))
			goto out_dev_put;
Linus Torvalds's avatar
Linus Torvalds committed
1289
		err = 0;
1290
		n = neigh_lookup(tbl, RTA_DATA(nda[NDA_DST - 1]), dev);
Linus Torvalds's avatar
Linus Torvalds committed
1291
		if (n) {
1292
			if (nlh->nlmsg_flags & NLM_F_EXCL)
Linus Torvalds's avatar
Linus Torvalds committed
1293
				err = -EEXIST;
1294 1295
			override = nlh->nlmsg_flags & NLM_F_REPLACE;
		} else if (!(nlh->nlmsg_flags & NLM_F_CREATE))
Linus Torvalds's avatar
Linus Torvalds committed
1296 1297
			err = -ENOENT;
		else {
1298 1299
			n = __neigh_lookup_errno(tbl, RTA_DATA(nda[NDA_DST - 1]),
						 dev);
Linus Torvalds's avatar
Linus Torvalds committed
1300 1301 1302 1303 1304
			if (IS_ERR(n)) {
				err = PTR_ERR(n);
				n = NULL;
			}
		}
1305 1306 1307 1308
		if (!err) {
			err = neigh_update(n, nda[NDA_LLADDR - 1] ?
						RTA_DATA(nda[NDA_LLADDR - 1]) :
						NULL,
Linus Torvalds's avatar
Linus Torvalds committed
1309
					   ndm->ndm_state,
1310
					   override, 0);
Linus Torvalds's avatar
Linus Torvalds committed
1311 1312 1313
		}
		if (n)
			neigh_release(n);
1314
		goto out_dev_put;
Linus Torvalds's avatar
Linus Torvalds committed
1315 1316
	}

1317 1318 1319
	read_unlock(&neigh_tbl_lock);
	err = -EADDRNOTAVAIL;
out_dev_put:
Linus Torvalds's avatar
Linus Torvalds committed
1320 1321
	if (dev)
		dev_put(dev);
1322 1323
out:
	return err;
Linus Torvalds's avatar
Linus Torvalds committed
1324 1325 1326 1327 1328 1329 1330
}


static int neigh_fill_info(struct sk_buff *skb, struct neighbour *n,
			   u32 pid, u32 seq, int event)
{
	unsigned long now = jiffies;
1331
	unsigned char *b = skb->tail;
Linus Torvalds's avatar
Linus Torvalds committed
1332 1333
	struct nda_cacheinfo ci;
	int locked = 0;
1334 1335 1336
	struct nlmsghdr *nlh = NLMSG_PUT(skb, pid, seq, event,
					 sizeof(struct ndmsg));
	struct ndmsg *ndm = NLMSG_DATA(nlh);
Linus Torvalds's avatar
Linus Torvalds committed
1337

1338 1339 1340
	ndm->ndm_family	 = n->ops->family;
	ndm->ndm_flags	 = n->flags;
	ndm->ndm_type	 = n->type;
Linus Torvalds's avatar
Linus Torvalds committed
1341 1342 1343
	ndm->ndm_ifindex = n->dev->ifindex;
	RTA_PUT(skb, NDA_DST, n->tbl->key_len, n->primary_key);
	read_lock_bh(&n->lock);
1344 1345 1346
	locked		 = 1;
	ndm->ndm_state	 = n->nud_state;
	if (n->nud_state & NUD_VALID)
Linus Torvalds's avatar
Linus Torvalds committed
1347
		RTA_PUT(skb, NDA_LLADDR, n->dev->addr_len, n->ha);
1348
	ci.ndm_used	 = now - n->used;
Linus Torvalds's avatar
Linus Torvalds committed
1349
	ci.ndm_confirmed = now - n->confirmed;
1350 1351
	ci.ndm_updated	 = now - n->updated;
	ci.ndm_refcnt	 = atomic_read(&n->refcnt) - 1;
Linus Torvalds's avatar
Linus Torvalds committed
1352
	read_unlock_bh(&n->lock);
1353
	locked		 = 0;
Linus Torvalds's avatar
Linus Torvalds committed
1354
	RTA_PUT(skb, NDA_CACHEINFO, sizeof(ci), &ci);
1355
	nlh->nlmsg_len	 = skb->tail - b;
Linus Torvalds's avatar
Linus Torvalds committed
1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366
	return skb->len;

nlmsg_failure:
rtattr_failure:
	if (locked)
		read_unlock_bh(&n->lock);
	skb_trim(skb, b - skb->data);
	return -1;
}


1367 1368
static int neigh_dump_table(struct neigh_table *tbl, struct sk_buff *skb,
			    struct netlink_callback *cb)
Linus Torvalds's avatar
Linus Torvalds committed
1369 1370
{
	struct neighbour *n;
1371 1372
	int rc, h, s_h = cb->args[1];
	int idx, s_idx = idx = cb->args[2];
Linus Torvalds's avatar
Linus Torvalds committed
1373

1374 1375 1376
	for (h = 0; h <= NEIGH_HASHMASK; h++) {
		if (h < s_h)
			continue;
Linus Torvalds's avatar
Linus Torvalds committed
1377 1378 1379
		if (h > s_h)
			s_idx = 0;
		read_lock_bh(&tbl->lock);
1380
		for (n = tbl->hash_buckets[h], idx = 0; n; n = n->next, idx++) {
Linus Torvalds's avatar
Linus Torvalds committed
1381 1382 1383
			if (idx < s_idx)
				continue;
			if (neigh_fill_info(skb, n, NETLINK_CB(cb->skb).pid,
1384 1385
					    cb->nlh->nlmsg_seq,
					    RTM_NEWNEIGH) <= 0) {
Linus Torvalds's avatar
Linus Torvalds committed
1386
				read_unlock_bh(&tbl->lock);
1387 1388
				rc = -1;
				goto out;
Linus Torvalds's avatar
Linus Torvalds committed
1389 1390 1391 1392
			}
		}
		read_unlock_bh(&tbl->lock);
	}
1393 1394
	rc = skb->len;
out:
Linus Torvalds's avatar
Linus Torvalds committed
1395 1396
	cb->args[1] = h;
	cb->args[2] = idx;
1397
	return rc;
Linus Torvalds's avatar
Linus Torvalds committed
1398 1399 1400 1401 1402
}

int neigh_dump_info(struct sk_buff *skb, struct netlink_callback *cb)
{
	struct neigh_table *tbl;
1403
	int t, family, s_t;
Linus Torvalds's avatar
Linus Torvalds committed
1404

1405 1406
	read_lock(&neigh_tbl_lock);
	family = ((struct rtgenmsg *)NLMSG_DATA(cb->nlh))->rtgen_family;
Linus Torvalds's avatar
Linus Torvalds committed
1407 1408
	s_t = cb->args[0];

1409 1410
	for (tbl = neigh_tables, t = 0; tbl; tbl = tbl->next, t++) {
		if (t < s_t || (family && tbl->family != family))
Linus Torvalds's avatar
Linus Torvalds committed
1411 1412
			continue;
		if (t > s_t)
1413 1414 1415
			memset(&cb->args[1], 0, sizeof(cb->args) -
						sizeof(cb->args[0]));
		if (neigh_dump_table(tbl, skb, cb) < 0)
Linus Torvalds's avatar
Linus Torvalds committed
1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427
			break;
	}
	read_unlock(&neigh_tbl_lock);

	cb->args[0] = t;
	return skb->len;
}

#ifdef CONFIG_ARPD
void neigh_app_ns(struct neighbour *n)
{
	struct nlmsghdr  *nlh;
1428 1429
	int size = NLMSG_SPACE(sizeof(struct ndmsg) + 256);
	struct sk_buff *skb = alloc_skb(size, GFP_ATOMIC);
Linus Torvalds's avatar
Linus Torvalds committed
1430 1431 1432 1433 1434 1435 1436 1437

	if (!skb)
		return;

	if (neigh_fill_info(skb, n, 0, 0, RTM_GETNEIGH) < 0) {
		kfree_skb(skb);
		return;
	}
1438 1439
	nlh			   = (struct nlmsghdr *)skb->data;
	nlh->nlmsg_flags	   = NLM_F_REQUEST;
Linus Torvalds's avatar
Linus Torvalds committed
1440 1441 1442 1443 1444 1445
	NETLINK_CB(skb).dst_groups = RTMGRP_NEIGH;
	netlink_broadcast(rtnl, skb, 0, RTMGRP_NEIGH, GFP_ATOMIC);
}

static void neigh_app_notify(struct neighbour *n)
{
1446 1447 1448
	struct nlmsghdr *nlh;
	int size = NLMSG_SPACE(sizeof(struct ndmsg) + 256);
	struct sk_buff *skb = alloc_skb(size, GFP_ATOMIC);
Linus Torvalds's avatar
Linus Torvalds committed
1449 1450 1451 1452 1453 1454 1455 1456

	if (!skb)
		return;

	if (neigh_fill_info(skb, n, 0, 0, RTM_NEWNEIGH) < 0) {
		kfree_skb(skb);
		return;
	}
1457
	nlh			   = (struct nlmsghdr *)skb->data;
Linus Torvalds's avatar
Linus Torvalds committed
1458 1459 1460 1461
	NETLINK_CB(skb).dst_groups = RTMGRP_NEIGH;
	netlink_broadcast(rtnl, skb, 0, RTMGRP_NEIGH, GFP_ATOMIC);
}

Linus Torvalds's avatar
Linus Torvalds committed
1462
#endif /* CONFIG_ARPD */
Linus Torvalds's avatar
Linus Torvalds committed
1463 1464 1465

#ifdef CONFIG_SYSCTL

1466
struct neigh_sysctl_table {
Linus Torvalds's avatar
Linus Torvalds committed
1467
	struct ctl_table_header *sysctl_header;
1468 1469 1470 1471 1472
	ctl_table		neigh_vars[17];
	ctl_table		neigh_dev[2];
	ctl_table		neigh_neigh_dir[2];
	ctl_table		neigh_proto_dir[2];
	ctl_table		neigh_root_dir[2];
Linus Torvalds's avatar
Linus Torvalds committed
1473
} neigh_sysctl_template = {
1474
	.neigh_vars = {
1475
		{
1476 1477 1478 1479 1480
			.ctl_name	= NET_NEIGH_MCAST_SOLICIT,
			.procname	= "mcast_solicit",
			.maxlen		= sizeof(int),
			.mode		= 0644,
			.proc_handler	= &proc_dointvec,
1481 1482
		},
		{
1483 1484 1485 1486 1487
			.ctl_name	= NET_NEIGH_UCAST_SOLICIT,
			.procname	= "ucast_solicit",
			.maxlen		= sizeof(int),
			.mode		= 0644,
			.proc_handler	= &proc_dointvec,
1488 1489
		},
		{
1490 1491 1492 1493 1494
			.ctl_name	= NET_NEIGH_APP_SOLICIT,
			.procname	= "app_solicit",
			.maxlen		= sizeof(int),
			.mode		= 0644,
			.proc_handler	= &proc_dointvec,
1495 1496
		},
		{
1497 1498 1499 1500 1501
			.ctl_name	= NET_NEIGH_RETRANS_TIME,
			.procname	= "retrans_time",
			.maxlen		= sizeof(int),
			.mode		= 0644,
			.proc_handler	= &proc_dointvec,
1502 1503
		},
		{
1504 1505 1506 1507 1508
			.ctl_name	= NET_NEIGH_REACHABLE_TIME,
			.procname	= "base_reachable_time",
			.maxlen		= sizeof(int),
			.mode		= 0644,
			.proc_handler	= &proc_dointvec_jiffies,
1509 1510
		},
		{
1511 1512 1513 1514 1515
			.ctl_name	= NET_NEIGH_DELAY_PROBE_TIME,
			.procname	= "delay_first_probe_time",
			.maxlen		= sizeof(int),
			.mode		= 0644,
			.proc_handler	= &proc_dointvec_jiffies,
1516 1517
		},
		{
1518 1519 1520 1521 1522
			.ctl_name	= NET_NEIGH_GC_STALE_TIME,
			.procname	= "gc_stale_time",
			.maxlen		= sizeof(int),
			.mode		= 0644,
			.proc_handler	= &proc_dointvec_jiffies,
1523 1524
		},
		{
1525 1526 1527 1528 1529
			.ctl_name	= NET_NEIGH_UNRES_QLEN,
			.procname	= "unres_qlen",
			.maxlen		= sizeof(int),
			.mode		= 0644,
			.proc_handler	= &proc_dointvec,
1530 1531
		},
		{
1532 1533 1534 1535 1536
			.ctl_name	= NET_NEIGH_PROXY_QLEN,
			.procname	= "proxy_qlen",
			.maxlen		= sizeof(int),
			.mode		= 0644,
			.proc_handler	= &proc_dointvec,
1537 1538
		},
		{
1539 1540 1541 1542 1543
			.ctl_name	= NET_NEIGH_ANYCAST_DELAY,
			.procname	= "anycast_delay",
			.maxlen		= sizeof(int),
			.mode		= 0644,
			.proc_handler	= &proc_dointvec,
1544 1545
		},
		{
1546 1547 1548 1549 1550
			.ctl_name	= NET_NEIGH_PROXY_DELAY,
			.procname	= "proxy_delay",
			.maxlen		= sizeof(int),
			.mode		= 0644,
			.proc_handler	= &proc_dointvec,
1551 1552
		},
		{
1553 1554 1555 1556 1557
			.ctl_name	= NET_NEIGH_LOCKTIME,
			.procname	= "locktime",
			.maxlen		= sizeof(int),
			.mode		= 0644,
			.proc_handler	= &proc_dointvec,
1558 1559
		},
		{
1560 1561 1562 1563 1564
			.ctl_name	= NET_NEIGH_GC_INTERVAL,
			.procname	= "gc_interval",
			.maxlen		= sizeof(int),
			.mode		= 0644,
			.proc_handler	= &proc_dointvec_jiffies,
1565 1566
		},
		{
1567 1568 1569 1570 1571
			.ctl_name	= NET_NEIGH_GC_THRESH1,
			.procname	= "gc_thresh1",
			.maxlen		= sizeof(int),
			.mode		= 0644,
			.proc_handler	= &proc_dointvec,
1572 1573
		},
		{
1574 1575 1576 1577 1578
			.ctl_name	= NET_NEIGH_GC_THRESH2,
			.procname	= "gc_thresh2",
			.maxlen		= sizeof(int),
			.mode		= 0644,
			.proc_handler	= &proc_dointvec,
1579 1580
		},
		{
1581 1582 1583 1584 1585
			.ctl_name	= NET_NEIGH_GC_THRESH3,
			.procname	= "gc_thresh3",
			.maxlen		= sizeof(int),
			.mode		= 0644,
			.proc_handler	= &proc_dointvec,
1586 1587
		},
	},
1588
	.neigh_dev = {
1589
		{
1590 1591 1592
			.ctl_name	= NET_PROTO_CONF_DEFAULT,
			.procname	= "default",
			.mode		= 0555,
1593 1594
		},
	},
1595
	.neigh_neigh_dir = {
1596
		{
1597 1598
			.procname	= "neigh",
			.mode		= 0555,
1599 1600
		},
	},
1601
	.neigh_proto_dir = {
1602
		{
1603
			.mode		= 0555,
1604 1605
		},
	},
1606
	.neigh_root_dir = {
1607
		{
1608 1609 1610
			.ctl_name	= CTL_NET,
			.procname	= "net",
			.mode		= 0555,
1611 1612
		},
	},
Linus Torvalds's avatar
Linus Torvalds committed
1613 1614 1615 1616 1617
};

int neigh_sysctl_register(struct net_device *dev, struct neigh_parms *p,
			  int p_id, int pdev_id, char *p_name)
{
1618
	struct neigh_sysctl_table *t = kmalloc(sizeof(*t), GFP_KERNEL);
Linus Torvalds's avatar
Linus Torvalds committed
1619

1620
	if (!t)
Linus Torvalds's avatar
Linus Torvalds committed
1621 1622
		return -ENOBUFS;
	memcpy(t, &neigh_sysctl_template, sizeof(*t));
1623 1624 1625 1626 1627 1628 1629 1630 1631 1632
	t->neigh_vars[0].data  = &p->mcast_probes;
	t->neigh_vars[1].data  = &p->ucast_probes;
	t->neigh_vars[2].data  = &p->app_probes;
	t->neigh_vars[3].data  = &p->retrans_time;
	t->neigh_vars[4].data  = &p->base_reachable_time;
	t->neigh_vars[5].data  = &p->delay_probe_time;
	t->neigh_vars[6].data  = &p->gc_staletime;
	t->neigh_vars[7].data  = &p->queue_len;
	t->neigh_vars[8].data  = &p->proxy_qlen;
	t->neigh_vars[9].data  = &p->anycast_delay;
Linus Torvalds's avatar
Linus Torvalds committed
1633 1634 1635 1636 1637 1638 1639
	t->neigh_vars[10].data = &p->proxy_delay;
	t->neigh_vars[11].data = &p->locktime;
	if (dev) {
		t->neigh_dev[0].procname = dev->name;
		t->neigh_dev[0].ctl_name = dev->ifindex;
		memset(&t->neigh_vars[12], 0, sizeof(ctl_table));
	} else {
1640 1641 1642 1643
		t->neigh_vars[12].data = (int *)(p + 1);
		t->neigh_vars[13].data = (int *)(p + 1) + 1;
		t->neigh_vars[14].data = (int *)(p + 1) + 2;
		t->neigh_vars[15].data = (int *)(p + 1) + 3;
Linus Torvalds's avatar
Linus Torvalds committed
1644 1645 1646 1647 1648 1649
	}
	t->neigh_neigh_dir[0].ctl_name = pdev_id;

	t->neigh_proto_dir[0].procname = p_name;
	t->neigh_proto_dir[0].ctl_name = p_id;

1650 1651 1652 1653
	t->neigh_dev[0].child	       = t->neigh_vars;
	t->neigh_neigh_dir[0].child    = t->neigh_dev;
	t->neigh_proto_dir[0].child    = t->neigh_neigh_dir;
	t->neigh_root_dir[0].child     = t->neigh_proto_dir;
Linus Torvalds's avatar
Linus Torvalds committed
1654 1655

	t->sysctl_header = register_sysctl_table(t->neigh_root_dir, 0);
1656
	if (!t->sysctl_header) {
Linus Torvalds's avatar
Linus Torvalds committed
1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674
		kfree(t);
		return -ENOBUFS;
	}
	p->sysctl_table = t;
	return 0;
}

void neigh_sysctl_unregister(struct neigh_parms *p)
{
	if (p->sysctl_table) {
		struct neigh_sysctl_table *t = p->sysctl_table;
		p->sysctl_table = NULL;
		unregister_sysctl_table(t->sysctl_header);
		kfree(t);
	}
}

#endif	/* CONFIG_SYSCTL */