2 * Generic address resolution entity
5 * Pedro Roque <roque@di.fc.ul.pt>
6 * Alexey Kuznetsov <kuznet@ms2.inr.ac.ru>
8 * This program is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License
10 * as published by the Free Software Foundation; either version
11 * 2 of the License, or (at your option) any later version.
14 * Vitaly E. Lavrov releasing NULL neighbor in neigh_add.
15 * Harald Welte Add neighbour cache statistics like rtstat
18 #include <linux/types.h>
19 #include <linux/kernel.h>
20 #include <linux/module.h>
21 #include <linux/socket.h>
22 #include <linux/sched.h>
23 #include <linux/netdevice.h>
24 #include <linux/proc_fs.h>
26 #include <linux/sysctl.h>
28 #include <linux/times.h>
29 #include <net/neighbour.h>
32 #include <net/netevent.h>
33 #include <net/netlink.h>
34 #include <linux/rtnetlink.h>
35 #include <linux/random.h>
36 #include <linux/string.h>
40 #define NEIGH_PRINTK(x...) printk(x)
41 #define NEIGH_NOPRINTK(x...) do { ; } while(0)
42 #define NEIGH_PRINTK0 NEIGH_PRINTK
43 #define NEIGH_PRINTK1 NEIGH_NOPRINTK
44 #define NEIGH_PRINTK2 NEIGH_NOPRINTK
48 #define NEIGH_PRINTK1 NEIGH_PRINTK
52 #define NEIGH_PRINTK2 NEIGH_PRINTK
55 #define PNEIGH_HASHMASK 0xF
57 static void neigh_timer_handler(unsigned long arg);
59 static void neigh_app_notify(struct neighbour *n);
61 static int pneigh_ifdown(struct neigh_table *tbl, struct net_device *dev);
62 void neigh_changeaddr(struct neigh_table *tbl, struct net_device *dev);
64 static struct neigh_table *neigh_tables;
66 static struct file_operations neigh_stat_seq_fops;
70 Neighbour hash table buckets are protected with rwlock tbl->lock.
72 - All the scans/updates to hash buckets MUST be made under this lock.
73 - NOTHING clever should be made under this lock: no callbacks
74 to protocol backends, no attempts to send something to network.
75 It will result in deadlocks, if backend/driver wants to use neighbour
77 - If the entry requires some non-trivial actions, increase
78 its reference count and release table lock.
80 Neighbour entries are protected:
81 - with reference count.
82 - with rwlock neigh->lock
84 Reference count prevents destruction.
86 neigh->lock mainly serializes ll address data and its validity state.
87 However, the same lock is used to protect another entry fields:
91 Again, nothing clever shall be made under neigh->lock,
92 the most complicated procedure, which we allow is dev->hard_header.
93 It is supposed, that dev->hard_header is simplistic and does
94 not make callbacks to neighbour tables.
96 The last lock is neigh_tbl_lock. It is pure SMP lock, protecting
97 list of neighbour tables. This list is used only in process context,
100 static DEFINE_RWLOCK(neigh_tbl_lock);
102 static int neigh_blackhole(struct sk_buff *skb)
109 * It is random distribution in the interval (1/2)*base...(3/2)*base.
110 * It corresponds to default IPv6 settings and is not overridable,
111 * because it is really reasonable choice.
114 unsigned long neigh_rand_reach_time(unsigned long base)
116 return (base ? (net_random() % base) + (base >> 1) : 0);
120 static int neigh_forced_gc(struct neigh_table *tbl)
125 NEIGH_CACHE_STAT_INC(tbl, forced_gc_runs);
127 write_lock_bh(&tbl->lock);
128 for (i = 0; i <= tbl->hash_mask; i++) {
129 struct neighbour *n, **np;
131 np = &tbl->hash_buckets[i];
132 while ((n = *np) != NULL) {
133 /* Neighbour record may be discarded if:
134 * - nobody refers to it.
135 * - it is not permanent
137 write_lock(&n->lock);
138 if (atomic_read(&n->refcnt) == 1 &&
139 !(n->nud_state & NUD_PERMANENT)) {
143 write_unlock(&n->lock);
147 write_unlock(&n->lock);
152 tbl->last_flush = jiffies;
154 write_unlock_bh(&tbl->lock);
159 static int neigh_del_timer(struct neighbour *n)
161 if ((n->nud_state & NUD_IN_TIMER) &&
162 del_timer(&n->timer)) {
169 static void pneigh_queue_purge(struct sk_buff_head *list)
173 while ((skb = skb_dequeue(list)) != NULL) {
179 static void neigh_flush_dev(struct neigh_table *tbl, struct net_device *dev)
183 for (i = 0; i <= tbl->hash_mask; i++) {
184 struct neighbour *n, **np = &tbl->hash_buckets[i];
186 while ((n = *np) != NULL) {
187 if (dev && n->dev != dev) {
192 write_lock(&n->lock);
196 if (atomic_read(&n->refcnt) != 1) {
197 /* The most unpleasant situation.
198 We must destroy neighbour entry,
199 but someone still uses it.
201 The destroy will be delayed until
202 the last user releases us, but
203 we must kill timers etc. and move
206 skb_queue_purge(&n->arp_queue);
207 n->output = neigh_blackhole;
208 if (n->nud_state & NUD_VALID)
209 n->nud_state = NUD_NOARP;
211 n->nud_state = NUD_NONE;
212 NEIGH_PRINTK2("neigh %p is stray.\n", n);
214 write_unlock(&n->lock);
220 void neigh_changeaddr(struct neigh_table *tbl, struct net_device *dev)
222 write_lock_bh(&tbl->lock);
223 neigh_flush_dev(tbl, dev);
224 write_unlock_bh(&tbl->lock);
227 int neigh_ifdown(struct neigh_table *tbl, struct net_device *dev)
229 write_lock_bh(&tbl->lock);
230 neigh_flush_dev(tbl, dev);
231 pneigh_ifdown(tbl, dev);
232 write_unlock_bh(&tbl->lock);
234 del_timer_sync(&tbl->proxy_timer);
235 pneigh_queue_purge(&tbl->proxy_queue);
239 static struct neighbour *neigh_alloc(struct neigh_table *tbl)
241 struct neighbour *n = NULL;
242 unsigned long now = jiffies;
245 entries = atomic_inc_return(&tbl->entries) - 1;
246 if (entries >= tbl->gc_thresh3 ||
247 (entries >= tbl->gc_thresh2 &&
248 time_after(now, tbl->last_flush + 5 * HZ))) {
249 if (!neigh_forced_gc(tbl) &&
250 entries >= tbl->gc_thresh3)
254 n = kmem_cache_alloc(tbl->kmem_cachep, SLAB_ATOMIC);
258 memset(n, 0, tbl->entry_size);
260 skb_queue_head_init(&n->arp_queue);
261 rwlock_init(&n->lock);
262 n->updated = n->used = now;
263 n->nud_state = NUD_NONE;
264 n->output = neigh_blackhole;
265 n->parms = neigh_parms_clone(&tbl->parms);
266 init_timer(&n->timer);
267 n->timer.function = neigh_timer_handler;
268 n->timer.data = (unsigned long)n;
270 NEIGH_CACHE_STAT_INC(tbl, allocs);
272 atomic_set(&n->refcnt, 1);
278 atomic_dec(&tbl->entries);
282 static struct neighbour **neigh_hash_alloc(unsigned int entries)
284 unsigned long size = entries * sizeof(struct neighbour *);
285 struct neighbour **ret;
287 if (size <= PAGE_SIZE) {
288 ret = kzalloc(size, GFP_ATOMIC);
290 ret = (struct neighbour **)
291 __get_free_pages(GFP_ATOMIC|__GFP_ZERO, get_order(size));
296 static void neigh_hash_free(struct neighbour **hash, unsigned int entries)
298 unsigned long size = entries * sizeof(struct neighbour *);
300 if (size <= PAGE_SIZE)
303 free_pages((unsigned long)hash, get_order(size));
306 static void neigh_hash_grow(struct neigh_table *tbl, unsigned long new_entries)
308 struct neighbour **new_hash, **old_hash;
309 unsigned int i, new_hash_mask, old_entries;
311 NEIGH_CACHE_STAT_INC(tbl, hash_grows);
313 BUG_ON(new_entries & (new_entries - 1));
314 new_hash = neigh_hash_alloc(new_entries);
318 old_entries = tbl->hash_mask + 1;
319 new_hash_mask = new_entries - 1;
320 old_hash = tbl->hash_buckets;
322 get_random_bytes(&tbl->hash_rnd, sizeof(tbl->hash_rnd));
323 for (i = 0; i < old_entries; i++) {
324 struct neighbour *n, *next;
326 for (n = old_hash[i]; n; n = next) {
327 unsigned int hash_val = tbl->hash(n->primary_key, n->dev);
329 hash_val &= new_hash_mask;
332 n->next = new_hash[hash_val];
333 new_hash[hash_val] = n;
336 tbl->hash_buckets = new_hash;
337 tbl->hash_mask = new_hash_mask;
339 neigh_hash_free(old_hash, old_entries);
342 struct neighbour *neigh_lookup(struct neigh_table *tbl, const void *pkey,
343 struct net_device *dev)
346 int key_len = tbl->key_len;
347 u32 hash_val = tbl->hash(pkey, dev) & tbl->hash_mask;
349 NEIGH_CACHE_STAT_INC(tbl, lookups);
351 read_lock_bh(&tbl->lock);
352 for (n = tbl->hash_buckets[hash_val]; n; n = n->next) {
353 if (dev == n->dev && !memcmp(n->primary_key, pkey, key_len)) {
355 NEIGH_CACHE_STAT_INC(tbl, hits);
359 read_unlock_bh(&tbl->lock);
363 struct neighbour *neigh_lookup_nodev(struct neigh_table *tbl, const void *pkey)
366 int key_len = tbl->key_len;
367 u32 hash_val = tbl->hash(pkey, NULL) & tbl->hash_mask;
369 NEIGH_CACHE_STAT_INC(tbl, lookups);
371 read_lock_bh(&tbl->lock);
372 for (n = tbl->hash_buckets[hash_val]; n; n = n->next) {
373 if (!memcmp(n->primary_key, pkey, key_len)) {
375 NEIGH_CACHE_STAT_INC(tbl, hits);
379 read_unlock_bh(&tbl->lock);
383 struct neighbour *neigh_create(struct neigh_table *tbl, const void *pkey,
384 struct net_device *dev)
387 int key_len = tbl->key_len;
389 struct neighbour *n1, *rc, *n = neigh_alloc(tbl);
392 rc = ERR_PTR(-ENOBUFS);
396 memcpy(n->primary_key, pkey, key_len);
400 /* Protocol specific setup. */
401 if (tbl->constructor && (error = tbl->constructor(n)) < 0) {
403 goto out_neigh_release;
406 /* Device specific setup. */
407 if (n->parms->neigh_setup &&
408 (error = n->parms->neigh_setup(n)) < 0) {
410 goto out_neigh_release;
413 n->confirmed = jiffies - (n->parms->base_reachable_time << 1);
415 write_lock_bh(&tbl->lock);
417 if (atomic_read(&tbl->entries) > (tbl->hash_mask + 1))
418 neigh_hash_grow(tbl, (tbl->hash_mask + 1) << 1);
420 hash_val = tbl->hash(pkey, dev) & tbl->hash_mask;
422 if (n->parms->dead) {
423 rc = ERR_PTR(-EINVAL);
427 for (n1 = tbl->hash_buckets[hash_val]; n1; n1 = n1->next) {
428 if (dev == n1->dev && !memcmp(n1->primary_key, pkey, key_len)) {
435 n->next = tbl->hash_buckets[hash_val];
436 tbl->hash_buckets[hash_val] = n;
439 write_unlock_bh(&tbl->lock);
440 NEIGH_PRINTK2("neigh %p is created.\n", n);
445 write_unlock_bh(&tbl->lock);
451 struct pneigh_entry * pneigh_lookup(struct neigh_table *tbl, const void *pkey,
452 struct net_device *dev, int creat)
454 struct pneigh_entry *n;
455 int key_len = tbl->key_len;
456 u32 hash_val = *(u32 *)(pkey + key_len - 4);
458 hash_val ^= (hash_val >> 16);
459 hash_val ^= hash_val >> 8;
460 hash_val ^= hash_val >> 4;
461 hash_val &= PNEIGH_HASHMASK;
463 read_lock_bh(&tbl->lock);
465 for (n = tbl->phash_buckets[hash_val]; n; n = n->next) {
466 if (!memcmp(n->key, pkey, key_len) &&
467 (n->dev == dev || !n->dev)) {
468 read_unlock_bh(&tbl->lock);
472 read_unlock_bh(&tbl->lock);
477 n = kmalloc(sizeof(*n) + key_len, GFP_KERNEL);
481 memcpy(n->key, pkey, key_len);
486 if (tbl->pconstructor && tbl->pconstructor(n)) {
494 write_lock_bh(&tbl->lock);
495 n->next = tbl->phash_buckets[hash_val];
496 tbl->phash_buckets[hash_val] = n;
497 write_unlock_bh(&tbl->lock);
503 int pneigh_delete(struct neigh_table *tbl, const void *pkey,
504 struct net_device *dev)
506 struct pneigh_entry *n, **np;
507 int key_len = tbl->key_len;
508 u32 hash_val = *(u32 *)(pkey + key_len - 4);
510 hash_val ^= (hash_val >> 16);
511 hash_val ^= hash_val >> 8;
512 hash_val ^= hash_val >> 4;
513 hash_val &= PNEIGH_HASHMASK;
515 write_lock_bh(&tbl->lock);
516 for (np = &tbl->phash_buckets[hash_val]; (n = *np) != NULL;
518 if (!memcmp(n->key, pkey, key_len) && n->dev == dev) {
520 write_unlock_bh(&tbl->lock);
521 if (tbl->pdestructor)
529 write_unlock_bh(&tbl->lock);
533 static int pneigh_ifdown(struct neigh_table *tbl, struct net_device *dev)
535 struct pneigh_entry *n, **np;
538 for (h = 0; h <= PNEIGH_HASHMASK; h++) {
539 np = &tbl->phash_buckets[h];
540 while ((n = *np) != NULL) {
541 if (!dev || n->dev == dev) {
543 if (tbl->pdestructor)
558 * neighbour must already be out of the table;
561 void neigh_destroy(struct neighbour *neigh)
565 NEIGH_CACHE_STAT_INC(neigh->tbl, destroys);
569 "Destroying alive neighbour %p\n", neigh);
574 if (neigh_del_timer(neigh))
575 printk(KERN_WARNING "Impossible event.\n");
577 while ((hh = neigh->hh) != NULL) {
578 neigh->hh = hh->hh_next;
580 write_lock_bh(&hh->hh_lock);
581 hh->hh_output = neigh_blackhole;
582 write_unlock_bh(&hh->hh_lock);
583 if (atomic_dec_and_test(&hh->hh_refcnt))
587 if (neigh->parms->neigh_destructor)
588 (neigh->parms->neigh_destructor)(neigh);
590 skb_queue_purge(&neigh->arp_queue);
593 neigh_parms_put(neigh->parms);
595 NEIGH_PRINTK2("neigh %p is destroyed.\n", neigh);
597 atomic_dec(&neigh->tbl->entries);
598 kmem_cache_free(neigh->tbl->kmem_cachep, neigh);
601 /* Neighbour state is suspicious;
604 Called with write_locked neigh.
606 static void neigh_suspect(struct neighbour *neigh)
610 NEIGH_PRINTK2("neigh %p is suspected.\n", neigh);
612 neigh->output = neigh->ops->output;
614 for (hh = neigh->hh; hh; hh = hh->hh_next)
615 hh->hh_output = neigh->ops->output;
618 /* Neighbour state is OK;
621 Called with write_locked neigh.
623 static void neigh_connect(struct neighbour *neigh)
627 NEIGH_PRINTK2("neigh %p is connected.\n", neigh);
629 neigh->output = neigh->ops->connected_output;
631 for (hh = neigh->hh; hh; hh = hh->hh_next)
632 hh->hh_output = neigh->ops->hh_output;
635 static void neigh_periodic_timer(unsigned long arg)
637 struct neigh_table *tbl = (struct neigh_table *)arg;
638 struct neighbour *n, **np;
639 unsigned long expire, now = jiffies;
641 NEIGH_CACHE_STAT_INC(tbl, periodic_gc_runs);
643 write_lock(&tbl->lock);
646 * periodically recompute ReachableTime from random function
649 if (time_after(now, tbl->last_rand + 300 * HZ)) {
650 struct neigh_parms *p;
651 tbl->last_rand = now;
652 for (p = &tbl->parms; p; p = p->next)
654 neigh_rand_reach_time(p->base_reachable_time);
657 np = &tbl->hash_buckets[tbl->hash_chain_gc];
658 tbl->hash_chain_gc = ((tbl->hash_chain_gc + 1) & tbl->hash_mask);
660 while ((n = *np) != NULL) {
663 write_lock(&n->lock);
665 state = n->nud_state;
666 if (state & (NUD_PERMANENT | NUD_IN_TIMER)) {
667 write_unlock(&n->lock);
671 if (time_before(n->used, n->confirmed))
672 n->used = n->confirmed;
674 if (atomic_read(&n->refcnt) == 1 &&
675 (state == NUD_FAILED ||
676 time_after(now, n->used + n->parms->gc_staletime))) {
679 write_unlock(&n->lock);
683 write_unlock(&n->lock);
689 /* Cycle through all hash buckets every base_reachable_time/2 ticks.
690 * ARP entry timeouts range from 1/2 base_reachable_time to 3/2
691 * base_reachable_time.
693 expire = tbl->parms.base_reachable_time >> 1;
694 expire /= (tbl->hash_mask + 1);
698 mod_timer(&tbl->gc_timer, now + expire);
700 write_unlock(&tbl->lock);
703 static __inline__ int neigh_max_probes(struct neighbour *n)
705 struct neigh_parms *p = n->parms;
706 return (n->nud_state & NUD_PROBE ?
708 p->ucast_probes + p->app_probes + p->mcast_probes);
711 static inline void neigh_add_timer(struct neighbour *n, unsigned long when)
713 if (unlikely(mod_timer(&n->timer, when))) {
714 printk("NEIGH: BUG, double timer add, state is %x\n",
720 /* Called when a timer expires for a neighbour entry. */
722 static void neigh_timer_handler(unsigned long arg)
724 unsigned long now, next;
725 struct neighbour *neigh = (struct neighbour *)arg;
729 write_lock(&neigh->lock);
731 state = neigh->nud_state;
735 if (!(state & NUD_IN_TIMER)) {
737 printk(KERN_WARNING "neigh: timer & !nud_in_timer\n");
742 if (state & NUD_REACHABLE) {
743 if (time_before_eq(now,
744 neigh->confirmed + neigh->parms->reachable_time)) {
745 NEIGH_PRINTK2("neigh %p is still alive.\n", neigh);
746 next = neigh->confirmed + neigh->parms->reachable_time;
747 } else if (time_before_eq(now,
748 neigh->used + neigh->parms->delay_probe_time)) {
749 NEIGH_PRINTK2("neigh %p is delayed.\n", neigh);
750 neigh->nud_state = NUD_DELAY;
751 neigh->updated = jiffies;
752 neigh_suspect(neigh);
753 next = now + neigh->parms->delay_probe_time;
755 NEIGH_PRINTK2("neigh %p is suspected.\n", neigh);
756 neigh->nud_state = NUD_STALE;
757 neigh->updated = jiffies;
758 neigh_suspect(neigh);
761 } else if (state & NUD_DELAY) {
762 if (time_before_eq(now,
763 neigh->confirmed + neigh->parms->delay_probe_time)) {
764 NEIGH_PRINTK2("neigh %p is now reachable.\n", neigh);
765 neigh->nud_state = NUD_REACHABLE;
766 neigh->updated = jiffies;
767 neigh_connect(neigh);
769 next = neigh->confirmed + neigh->parms->reachable_time;
771 NEIGH_PRINTK2("neigh %p is probed.\n", neigh);
772 neigh->nud_state = NUD_PROBE;
773 neigh->updated = jiffies;
774 atomic_set(&neigh->probes, 0);
775 next = now + neigh->parms->retrans_time;
778 /* NUD_PROBE|NUD_INCOMPLETE */
779 next = now + neigh->parms->retrans_time;
782 if ((neigh->nud_state & (NUD_INCOMPLETE | NUD_PROBE)) &&
783 atomic_read(&neigh->probes) >= neigh_max_probes(neigh)) {
786 neigh->nud_state = NUD_FAILED;
787 neigh->updated = jiffies;
789 NEIGH_CACHE_STAT_INC(neigh->tbl, res_failed);
790 NEIGH_PRINTK2("neigh %p is failed.\n", neigh);
792 /* It is very thin place. report_unreachable is very complicated
793 routine. Particularly, it can hit the same neighbour entry!
795 So that, we try to be accurate and avoid dead loop. --ANK
797 while (neigh->nud_state == NUD_FAILED &&
798 (skb = __skb_dequeue(&neigh->arp_queue)) != NULL) {
799 write_unlock(&neigh->lock);
800 neigh->ops->error_report(neigh, skb);
801 write_lock(&neigh->lock);
803 skb_queue_purge(&neigh->arp_queue);
806 if (neigh->nud_state & NUD_IN_TIMER) {
807 if (time_before(next, jiffies + HZ/2))
808 next = jiffies + HZ/2;
809 if (!mod_timer(&neigh->timer, next))
812 if (neigh->nud_state & (NUD_INCOMPLETE | NUD_PROBE)) {
813 struct sk_buff *skb = skb_peek(&neigh->arp_queue);
814 /* keep skb alive even if arp_queue overflows */
817 write_unlock(&neigh->lock);
818 neigh->ops->solicit(neigh, skb);
819 atomic_inc(&neigh->probes);
824 write_unlock(&neigh->lock);
827 call_netevent_notifiers(NETEVENT_NEIGH_UPDATE, neigh);
830 if (notify && neigh->parms->app_probes)
831 neigh_app_notify(neigh);
833 neigh_release(neigh);
836 int __neigh_event_send(struct neighbour *neigh, struct sk_buff *skb)
841 write_lock_bh(&neigh->lock);
844 if (neigh->nud_state & (NUD_CONNECTED | NUD_DELAY | NUD_PROBE))
849 if (!(neigh->nud_state & (NUD_STALE | NUD_INCOMPLETE))) {
850 if (neigh->parms->mcast_probes + neigh->parms->app_probes) {
851 atomic_set(&neigh->probes, neigh->parms->ucast_probes);
852 neigh->nud_state = NUD_INCOMPLETE;
853 neigh->updated = jiffies;
855 neigh_add_timer(neigh, now + 1);
857 neigh->nud_state = NUD_FAILED;
858 neigh->updated = jiffies;
859 write_unlock_bh(&neigh->lock);
865 } else if (neigh->nud_state & NUD_STALE) {
866 NEIGH_PRINTK2("neigh %p is delayed.\n", neigh);
868 neigh->nud_state = NUD_DELAY;
869 neigh->updated = jiffies;
870 neigh_add_timer(neigh,
871 jiffies + neigh->parms->delay_probe_time);
874 if (neigh->nud_state == NUD_INCOMPLETE) {
876 if (skb_queue_len(&neigh->arp_queue) >=
877 neigh->parms->queue_len) {
878 struct sk_buff *buff;
879 buff = neigh->arp_queue.next;
880 __skb_unlink(buff, &neigh->arp_queue);
883 __skb_queue_tail(&neigh->arp_queue, skb);
888 write_unlock_bh(&neigh->lock);
892 static __inline__ void neigh_update_hhs(struct neighbour *neigh)
895 void (*update)(struct hh_cache*, struct net_device*, unsigned char *) =
896 neigh->dev->header_cache_update;
899 for (hh = neigh->hh; hh; hh = hh->hh_next) {
900 write_lock_bh(&hh->hh_lock);
901 update(hh, neigh->dev, neigh->ha);
902 write_unlock_bh(&hh->hh_lock);
909 /* Generic update routine.
910 -- lladdr is new lladdr or NULL, if it is not supplied.
913 NEIGH_UPDATE_F_OVERRIDE allows to override existing lladdr,
915 NEIGH_UPDATE_F_WEAK_OVERRIDE will suspect existing "connected"
916 lladdr instead of overriding it
918 It also allows to retain current state
919 if lladdr is unchanged.
920 NEIGH_UPDATE_F_ADMIN means that the change is administrative.
922 NEIGH_UPDATE_F_OVERRIDE_ISROUTER allows to override existing
924 NEIGH_UPDATE_F_ISROUTER indicates if the neighbour is known as
927 Caller MUST hold reference count on the entry.
930 int neigh_update(struct neighbour *neigh, const u8 *lladdr, u8 new,
936 struct net_device *dev;
937 int update_isrouter = 0;
939 write_lock_bh(&neigh->lock);
942 old = neigh->nud_state;
945 if (!(flags & NEIGH_UPDATE_F_ADMIN) &&
946 (old & (NUD_NOARP | NUD_PERMANENT)))
949 if (!(new & NUD_VALID)) {
950 neigh_del_timer(neigh);
951 if (old & NUD_CONNECTED)
952 neigh_suspect(neigh);
953 neigh->nud_state = new;
955 notify = old & NUD_VALID;
959 /* Compare new lladdr with cached one */
960 if (!dev->addr_len) {
961 /* First case: device needs no address. */
964 /* The second case: if something is already cached
965 and a new address is proposed:
967 - if they are different, check override flag
969 if ((old & NUD_VALID) &&
970 !memcmp(lladdr, neigh->ha, dev->addr_len))
973 /* No address is supplied; if we know something,
974 use it, otherwise discard the request.
977 if (!(old & NUD_VALID))
982 if (new & NUD_CONNECTED)
983 neigh->confirmed = jiffies;
984 neigh->updated = jiffies;
986 /* If entry was valid and address is not changed,
987 do not change entry state, if new one is STALE.
990 update_isrouter = flags & NEIGH_UPDATE_F_OVERRIDE_ISROUTER;
991 if (old & NUD_VALID) {
992 if (lladdr != neigh->ha && !(flags & NEIGH_UPDATE_F_OVERRIDE)) {
994 if ((flags & NEIGH_UPDATE_F_WEAK_OVERRIDE) &&
995 (old & NUD_CONNECTED)) {
1001 if (lladdr == neigh->ha && new == NUD_STALE &&
1002 ((flags & NEIGH_UPDATE_F_WEAK_OVERRIDE) ||
1003 (old & NUD_CONNECTED))
1010 neigh_del_timer(neigh);
1011 if (new & NUD_IN_TIMER) {
1013 neigh_add_timer(neigh, (jiffies +
1014 ((new & NUD_REACHABLE) ?
1015 neigh->parms->reachable_time :
1018 neigh->nud_state = new;
1021 if (lladdr != neigh->ha) {
1022 memcpy(&neigh->ha, lladdr, dev->addr_len);
1023 neigh_update_hhs(neigh);
1024 if (!(new & NUD_CONNECTED))
1025 neigh->confirmed = jiffies -
1026 (neigh->parms->base_reachable_time << 1);
1031 if (new & NUD_CONNECTED)
1032 neigh_connect(neigh);
1034 neigh_suspect(neigh);
1035 if (!(old & NUD_VALID)) {
1036 struct sk_buff *skb;
1038 /* Again: avoid dead loop if something went wrong */
1040 while (neigh->nud_state & NUD_VALID &&
1041 (skb = __skb_dequeue(&neigh->arp_queue)) != NULL) {
1042 struct neighbour *n1 = neigh;
1043 write_unlock_bh(&neigh->lock);
1044 /* On shaper/eql skb->dst->neighbour != neigh :( */
1045 if (skb->dst && skb->dst->neighbour)
1046 n1 = skb->dst->neighbour;
1048 write_lock_bh(&neigh->lock);
1050 skb_queue_purge(&neigh->arp_queue);
1053 if (update_isrouter) {
1054 neigh->flags = (flags & NEIGH_UPDATE_F_ISROUTER) ?
1055 (neigh->flags | NTF_ROUTER) :
1056 (neigh->flags & ~NTF_ROUTER);
1058 write_unlock_bh(&neigh->lock);
1061 call_netevent_notifiers(NETEVENT_NEIGH_UPDATE, neigh);
1063 if (notify && neigh->parms->app_probes)
1064 neigh_app_notify(neigh);
1069 struct neighbour *neigh_event_ns(struct neigh_table *tbl,
1070 u8 *lladdr, void *saddr,
1071 struct net_device *dev)
1073 struct neighbour *neigh = __neigh_lookup(tbl, saddr, dev,
1074 lladdr || !dev->addr_len);
1076 neigh_update(neigh, lladdr, NUD_STALE,
1077 NEIGH_UPDATE_F_OVERRIDE);
1081 static void neigh_hh_init(struct neighbour *n, struct dst_entry *dst,
1084 struct hh_cache *hh;
1085 struct net_device *dev = dst->dev;
1087 for (hh = n->hh; hh; hh = hh->hh_next)
1088 if (hh->hh_type == protocol)
1091 if (!hh && (hh = kzalloc(sizeof(*hh), GFP_ATOMIC)) != NULL) {
1092 rwlock_init(&hh->hh_lock);
1093 hh->hh_type = protocol;
1094 atomic_set(&hh->hh_refcnt, 0);
1096 if (dev->hard_header_cache(n, hh)) {
1100 atomic_inc(&hh->hh_refcnt);
1101 hh->hh_next = n->hh;
1103 if (n->nud_state & NUD_CONNECTED)
1104 hh->hh_output = n->ops->hh_output;
1106 hh->hh_output = n->ops->output;
1110 atomic_inc(&hh->hh_refcnt);
1115 /* This function can be used in contexts, where only old dev_queue_xmit
1116 worked, f.e. if you want to override normal output path (eql, shaper),
1117 but resolution is not made yet.
1120 int neigh_compat_output(struct sk_buff *skb)
1122 struct net_device *dev = skb->dev;
1124 __skb_pull(skb, skb->nh.raw - skb->data);
1126 if (dev->hard_header &&
1127 dev->hard_header(skb, dev, ntohs(skb->protocol), NULL, NULL,
1129 dev->rebuild_header(skb))
1132 return dev_queue_xmit(skb);
1135 /* Slow and careful. */
1137 int neigh_resolve_output(struct sk_buff *skb)
1139 struct dst_entry *dst = skb->dst;
1140 struct neighbour *neigh;
1143 if (!dst || !(neigh = dst->neighbour))
1146 __skb_pull(skb, skb->nh.raw - skb->data);
1148 if (!neigh_event_send(neigh, skb)) {
1150 struct net_device *dev = neigh->dev;
1151 if (dev->hard_header_cache && !dst->hh) {
1152 write_lock_bh(&neigh->lock);
1154 neigh_hh_init(neigh, dst, dst->ops->protocol);
1155 err = dev->hard_header(skb, dev, ntohs(skb->protocol),
1156 neigh->ha, NULL, skb->len);
1157 write_unlock_bh(&neigh->lock);
1159 read_lock_bh(&neigh->lock);
1160 err = dev->hard_header(skb, dev, ntohs(skb->protocol),
1161 neigh->ha, NULL, skb->len);
1162 read_unlock_bh(&neigh->lock);
1165 rc = neigh->ops->queue_xmit(skb);
1172 NEIGH_PRINTK1("neigh_resolve_output: dst=%p neigh=%p\n",
1173 dst, dst ? dst->neighbour : NULL);
1180 /* As fast as possible without hh cache */
1182 int neigh_connected_output(struct sk_buff *skb)
1185 struct dst_entry *dst = skb->dst;
1186 struct neighbour *neigh = dst->neighbour;
1187 struct net_device *dev = neigh->dev;
1189 __skb_pull(skb, skb->nh.raw - skb->data);
1191 read_lock_bh(&neigh->lock);
1192 err = dev->hard_header(skb, dev, ntohs(skb->protocol),
1193 neigh->ha, NULL, skb->len);
1194 read_unlock_bh(&neigh->lock);
1196 err = neigh->ops->queue_xmit(skb);
1204 static void neigh_proxy_process(unsigned long arg)
1206 struct neigh_table *tbl = (struct neigh_table *)arg;
1207 long sched_next = 0;
1208 unsigned long now = jiffies;
1209 struct sk_buff *skb;
1211 spin_lock(&tbl->proxy_queue.lock);
1213 skb = tbl->proxy_queue.next;
1215 while (skb != (struct sk_buff *)&tbl->proxy_queue) {
1216 struct sk_buff *back = skb;
1217 long tdif = NEIGH_CB(back)->sched_next - now;
1221 struct net_device *dev = back->dev;
1222 __skb_unlink(back, &tbl->proxy_queue);
1223 if (tbl->proxy_redo && netif_running(dev))
1224 tbl->proxy_redo(back);
1229 } else if (!sched_next || tdif < sched_next)
1232 del_timer(&tbl->proxy_timer);
1234 mod_timer(&tbl->proxy_timer, jiffies + sched_next);
1235 spin_unlock(&tbl->proxy_queue.lock);
1238 void pneigh_enqueue(struct neigh_table *tbl, struct neigh_parms *p,
1239 struct sk_buff *skb)
1241 unsigned long now = jiffies;
1242 unsigned long sched_next = now + (net_random() % p->proxy_delay);
1244 if (tbl->proxy_queue.qlen > p->proxy_qlen) {
1249 NEIGH_CB(skb)->sched_next = sched_next;
1250 NEIGH_CB(skb)->flags |= LOCALLY_ENQUEUED;
1252 spin_lock(&tbl->proxy_queue.lock);
1253 if (del_timer(&tbl->proxy_timer)) {
1254 if (time_before(tbl->proxy_timer.expires, sched_next))
1255 sched_next = tbl->proxy_timer.expires;
1257 dst_release(skb->dst);
1260 __skb_queue_tail(&tbl->proxy_queue, skb);
1261 mod_timer(&tbl->proxy_timer, sched_next);
1262 spin_unlock(&tbl->proxy_queue.lock);
1266 struct neigh_parms *neigh_parms_alloc(struct net_device *dev,
1267 struct neigh_table *tbl)
1269 struct neigh_parms *p = kmalloc(sizeof(*p), GFP_KERNEL);
1272 memcpy(p, &tbl->parms, sizeof(*p));
1274 atomic_set(&p->refcnt, 1);
1275 INIT_RCU_HEAD(&p->rcu_head);
1277 neigh_rand_reach_time(p->base_reachable_time);
1279 if (dev->neigh_setup && dev->neigh_setup(dev, p)) {
1287 p->sysctl_table = NULL;
1288 write_lock_bh(&tbl->lock);
1289 p->next = tbl->parms.next;
1290 tbl->parms.next = p;
1291 write_unlock_bh(&tbl->lock);
1296 static void neigh_rcu_free_parms(struct rcu_head *head)
1298 struct neigh_parms *parms =
1299 container_of(head, struct neigh_parms, rcu_head);
1301 neigh_parms_put(parms);
1304 void neigh_parms_release(struct neigh_table *tbl, struct neigh_parms *parms)
1306 struct neigh_parms **p;
1308 if (!parms || parms == &tbl->parms)
1310 write_lock_bh(&tbl->lock);
1311 for (p = &tbl->parms.next; *p; p = &(*p)->next) {
1315 write_unlock_bh(&tbl->lock);
1317 dev_put(parms->dev);
1318 call_rcu(&parms->rcu_head, neigh_rcu_free_parms);
1322 write_unlock_bh(&tbl->lock);
1323 NEIGH_PRINTK1("neigh_parms_release: not found\n");
1326 void neigh_parms_destroy(struct neigh_parms *parms)
1331 void neigh_table_init_no_netlink(struct neigh_table *tbl)
1333 unsigned long now = jiffies;
1334 unsigned long phsize;
1336 atomic_set(&tbl->parms.refcnt, 1);
1337 INIT_RCU_HEAD(&tbl->parms.rcu_head);
1338 tbl->parms.reachable_time =
1339 neigh_rand_reach_time(tbl->parms.base_reachable_time);
1341 if (!tbl->kmem_cachep)
1342 tbl->kmem_cachep = kmem_cache_create(tbl->id,
1344 0, SLAB_HWCACHE_ALIGN,
1347 if (!tbl->kmem_cachep)
1348 panic("cannot create neighbour cache");
1350 tbl->stats = alloc_percpu(struct neigh_statistics);
1352 panic("cannot create neighbour cache statistics");
1354 #ifdef CONFIG_PROC_FS
1355 tbl->pde = create_proc_entry(tbl->id, 0, proc_net_stat);
1357 panic("cannot create neighbour proc dir entry");
1358 tbl->pde->proc_fops = &neigh_stat_seq_fops;
1359 tbl->pde->data = tbl;
1363 tbl->hash_buckets = neigh_hash_alloc(tbl->hash_mask + 1);
1365 phsize = (PNEIGH_HASHMASK + 1) * sizeof(struct pneigh_entry *);
1366 tbl->phash_buckets = kzalloc(phsize, GFP_KERNEL);
1368 if (!tbl->hash_buckets || !tbl->phash_buckets)
1369 panic("cannot allocate neighbour cache hashes");
1371 get_random_bytes(&tbl->hash_rnd, sizeof(tbl->hash_rnd));
1373 rwlock_init(&tbl->lock);
1374 init_timer(&tbl->gc_timer);
1375 tbl->gc_timer.data = (unsigned long)tbl;
1376 tbl->gc_timer.function = neigh_periodic_timer;
1377 tbl->gc_timer.expires = now + 1;
1378 add_timer(&tbl->gc_timer);
1380 init_timer(&tbl->proxy_timer);
1381 tbl->proxy_timer.data = (unsigned long)tbl;
1382 tbl->proxy_timer.function = neigh_proxy_process;
1383 skb_queue_head_init(&tbl->proxy_queue);
1385 tbl->last_flush = now;
1386 tbl->last_rand = now + tbl->parms.reachable_time * 20;
1389 void neigh_table_init(struct neigh_table *tbl)
1391 struct neigh_table *tmp;
1393 neigh_table_init_no_netlink(tbl);
1394 write_lock(&neigh_tbl_lock);
1395 for (tmp = neigh_tables; tmp; tmp = tmp->next) {
1396 if (tmp->family == tbl->family)
1399 tbl->next = neigh_tables;
1401 write_unlock(&neigh_tbl_lock);
1403 if (unlikely(tmp)) {
1404 printk(KERN_ERR "NEIGH: Registering multiple tables for "
1405 "family %d\n", tbl->family);
1410 int neigh_table_clear(struct neigh_table *tbl)
1412 struct neigh_table **tp;
1414 /* It is not clean... Fix it to unload IPv6 module safely */
1415 del_timer_sync(&tbl->gc_timer);
1416 del_timer_sync(&tbl->proxy_timer);
1417 pneigh_queue_purge(&tbl->proxy_queue);
1418 neigh_ifdown(tbl, NULL);
1419 if (atomic_read(&tbl->entries))
1420 printk(KERN_CRIT "neighbour leakage\n");
1421 write_lock(&neigh_tbl_lock);
1422 for (tp = &neigh_tables; *tp; tp = &(*tp)->next) {
1428 write_unlock(&neigh_tbl_lock);
1430 neigh_hash_free(tbl->hash_buckets, tbl->hash_mask + 1);
1431 tbl->hash_buckets = NULL;
1433 kfree(tbl->phash_buckets);
1434 tbl->phash_buckets = NULL;
1436 free_percpu(tbl->stats);
1442 int neigh_delete(struct sk_buff *skb, struct nlmsghdr *nlh, void *arg)
1445 struct nlattr *dst_attr;
1446 struct neigh_table *tbl;
1447 struct net_device *dev = NULL;
1450 if (nlmsg_len(nlh) < sizeof(*ndm))
1453 dst_attr = nlmsg_find_attr(nlh, sizeof(*ndm), NDA_DST);
1454 if (dst_attr == NULL)
1457 ndm = nlmsg_data(nlh);
1458 if (ndm->ndm_ifindex) {
1459 dev = dev_get_by_index(ndm->ndm_ifindex);
1466 read_lock(&neigh_tbl_lock);
1467 for (tbl = neigh_tables; tbl; tbl = tbl->next) {
1468 struct neighbour *neigh;
1470 if (tbl->family != ndm->ndm_family)
1472 read_unlock(&neigh_tbl_lock);
1474 if (nla_len(dst_attr) < tbl->key_len)
1477 if (ndm->ndm_flags & NTF_PROXY) {
1478 err = pneigh_delete(tbl, nla_data(dst_attr), dev);
1485 neigh = neigh_lookup(tbl, nla_data(dst_attr), dev);
1486 if (neigh == NULL) {
1491 err = neigh_update(neigh, NULL, NUD_FAILED,
1492 NEIGH_UPDATE_F_OVERRIDE |
1493 NEIGH_UPDATE_F_ADMIN);
1494 neigh_release(neigh);
1497 read_unlock(&neigh_tbl_lock);
1498 err = -EAFNOSUPPORT;
1507 int neigh_add(struct sk_buff *skb, struct nlmsghdr *nlh, void *arg)
1510 struct nlattr *tb[NDA_MAX+1];
1511 struct neigh_table *tbl;
1512 struct net_device *dev = NULL;
1515 err = nlmsg_parse(nlh, sizeof(*ndm), tb, NDA_MAX, NULL);
1520 if (tb[NDA_DST] == NULL)
1523 ndm = nlmsg_data(nlh);
1524 if (ndm->ndm_ifindex) {
1525 dev = dev_get_by_index(ndm->ndm_ifindex);
1531 if (tb[NDA_LLADDR] && nla_len(tb[NDA_LLADDR]) < dev->addr_len)
1535 read_lock(&neigh_tbl_lock);
1536 for (tbl = neigh_tables; tbl; tbl = tbl->next) {
1537 int flags = NEIGH_UPDATE_F_ADMIN | NEIGH_UPDATE_F_OVERRIDE;
1538 struct neighbour *neigh;
1541 if (tbl->family != ndm->ndm_family)
1543 read_unlock(&neigh_tbl_lock);
1545 if (nla_len(tb[NDA_DST]) < tbl->key_len)
1547 dst = nla_data(tb[NDA_DST]);
1548 lladdr = tb[NDA_LLADDR] ? nla_data(tb[NDA_LLADDR]) : NULL;
1550 if (ndm->ndm_flags & NTF_PROXY) {
1552 if (pneigh_lookup(tbl, dst, dev, 1) == NULL)
1560 neigh = neigh_lookup(tbl, dst, dev);
1561 if (neigh == NULL) {
1562 if (!(nlh->nlmsg_flags & NLM_F_CREATE)) {
1567 neigh = __neigh_lookup_errno(tbl, dst, dev);
1568 if (IS_ERR(neigh)) {
1569 err = PTR_ERR(neigh);
1573 if (nlh->nlmsg_flags & NLM_F_EXCL) {
1575 neigh_release(neigh);
1579 if (!(nlh->nlmsg_flags & NLM_F_REPLACE))
1580 flags &= ~NEIGH_UPDATE_F_OVERRIDE;
1583 err = neigh_update(neigh, lladdr, ndm->ndm_state, flags);
1584 neigh_release(neigh);
1588 read_unlock(&neigh_tbl_lock);
1589 err = -EAFNOSUPPORT;
1598 static int neightbl_fill_parms(struct sk_buff *skb, struct neigh_parms *parms)
1600 struct rtattr *nest = NULL;
1602 nest = RTA_NEST(skb, NDTA_PARMS);
1605 RTA_PUT_U32(skb, NDTPA_IFINDEX, parms->dev->ifindex);
1607 RTA_PUT_U32(skb, NDTPA_REFCNT, atomic_read(&parms->refcnt));
1608 RTA_PUT_U32(skb, NDTPA_QUEUE_LEN, parms->queue_len);
1609 RTA_PUT_U32(skb, NDTPA_PROXY_QLEN, parms->proxy_qlen);
1610 RTA_PUT_U32(skb, NDTPA_APP_PROBES, parms->app_probes);
1611 RTA_PUT_U32(skb, NDTPA_UCAST_PROBES, parms->ucast_probes);
1612 RTA_PUT_U32(skb, NDTPA_MCAST_PROBES, parms->mcast_probes);
1613 RTA_PUT_MSECS(skb, NDTPA_REACHABLE_TIME, parms->reachable_time);
1614 RTA_PUT_MSECS(skb, NDTPA_BASE_REACHABLE_TIME,
1615 parms->base_reachable_time);
1616 RTA_PUT_MSECS(skb, NDTPA_GC_STALETIME, parms->gc_staletime);
1617 RTA_PUT_MSECS(skb, NDTPA_DELAY_PROBE_TIME, parms->delay_probe_time);
1618 RTA_PUT_MSECS(skb, NDTPA_RETRANS_TIME, parms->retrans_time);
1619 RTA_PUT_MSECS(skb, NDTPA_ANYCAST_DELAY, parms->anycast_delay);
1620 RTA_PUT_MSECS(skb, NDTPA_PROXY_DELAY, parms->proxy_delay);
1621 RTA_PUT_MSECS(skb, NDTPA_LOCKTIME, parms->locktime);
1623 return RTA_NEST_END(skb, nest);
1626 return RTA_NEST_CANCEL(skb, nest);
1629 static int neightbl_fill_info(struct neigh_table *tbl, struct sk_buff *skb,
1630 struct netlink_callback *cb)
1632 struct nlmsghdr *nlh;
1633 struct ndtmsg *ndtmsg;
1635 nlh = NLMSG_NEW_ANSWER(skb, cb, RTM_NEWNEIGHTBL, sizeof(struct ndtmsg),
1638 ndtmsg = NLMSG_DATA(nlh);
1640 read_lock_bh(&tbl->lock);
1641 ndtmsg->ndtm_family = tbl->family;
1642 ndtmsg->ndtm_pad1 = 0;
1643 ndtmsg->ndtm_pad2 = 0;
1645 RTA_PUT_STRING(skb, NDTA_NAME, tbl->id);
1646 RTA_PUT_MSECS(skb, NDTA_GC_INTERVAL, tbl->gc_interval);
1647 RTA_PUT_U32(skb, NDTA_THRESH1, tbl->gc_thresh1);
1648 RTA_PUT_U32(skb, NDTA_THRESH2, tbl->gc_thresh2);
1649 RTA_PUT_U32(skb, NDTA_THRESH3, tbl->gc_thresh3);
1652 unsigned long now = jiffies;
1653 unsigned int flush_delta = now - tbl->last_flush;
1654 unsigned int rand_delta = now - tbl->last_rand;
1656 struct ndt_config ndc = {
1657 .ndtc_key_len = tbl->key_len,
1658 .ndtc_entry_size = tbl->entry_size,
1659 .ndtc_entries = atomic_read(&tbl->entries),
1660 .ndtc_last_flush = jiffies_to_msecs(flush_delta),
1661 .ndtc_last_rand = jiffies_to_msecs(rand_delta),
1662 .ndtc_hash_rnd = tbl->hash_rnd,
1663 .ndtc_hash_mask = tbl->hash_mask,
1664 .ndtc_hash_chain_gc = tbl->hash_chain_gc,
1665 .ndtc_proxy_qlen = tbl->proxy_queue.qlen,
1668 RTA_PUT(skb, NDTA_CONFIG, sizeof(ndc), &ndc);
1673 struct ndt_stats ndst;
1675 memset(&ndst, 0, sizeof(ndst));
1677 for_each_possible_cpu(cpu) {
1678 struct neigh_statistics *st;
1680 st = per_cpu_ptr(tbl->stats, cpu);
1681 ndst.ndts_allocs += st->allocs;
1682 ndst.ndts_destroys += st->destroys;
1683 ndst.ndts_hash_grows += st->hash_grows;
1684 ndst.ndts_res_failed += st->res_failed;
1685 ndst.ndts_lookups += st->lookups;
1686 ndst.ndts_hits += st->hits;
1687 ndst.ndts_rcv_probes_mcast += st->rcv_probes_mcast;
1688 ndst.ndts_rcv_probes_ucast += st->rcv_probes_ucast;
1689 ndst.ndts_periodic_gc_runs += st->periodic_gc_runs;
1690 ndst.ndts_forced_gc_runs += st->forced_gc_runs;
1693 RTA_PUT(skb, NDTA_STATS, sizeof(ndst), &ndst);
1696 BUG_ON(tbl->parms.dev);
1697 if (neightbl_fill_parms(skb, &tbl->parms) < 0)
1698 goto rtattr_failure;
1700 read_unlock_bh(&tbl->lock);
1701 return NLMSG_END(skb, nlh);
1704 read_unlock_bh(&tbl->lock);
1705 return NLMSG_CANCEL(skb, nlh);
1711 static int neightbl_fill_param_info(struct neigh_table *tbl,
1712 struct neigh_parms *parms,
1713 struct sk_buff *skb,
1714 struct netlink_callback *cb)
1716 struct ndtmsg *ndtmsg;
1717 struct nlmsghdr *nlh;
1719 nlh = NLMSG_NEW_ANSWER(skb, cb, RTM_NEWNEIGHTBL, sizeof(struct ndtmsg),
1722 ndtmsg = NLMSG_DATA(nlh);
1724 read_lock_bh(&tbl->lock);
1725 ndtmsg->ndtm_family = tbl->family;
1726 ndtmsg->ndtm_pad1 = 0;
1727 ndtmsg->ndtm_pad2 = 0;
1728 RTA_PUT_STRING(skb, NDTA_NAME, tbl->id);
1730 if (neightbl_fill_parms(skb, parms) < 0)
1731 goto rtattr_failure;
1733 read_unlock_bh(&tbl->lock);
1734 return NLMSG_END(skb, nlh);
1737 read_unlock_bh(&tbl->lock);
1738 return NLMSG_CANCEL(skb, nlh);
1744 static inline struct neigh_parms *lookup_neigh_params(struct neigh_table *tbl,
1747 struct neigh_parms *p;
1749 for (p = &tbl->parms; p; p = p->next)
1750 if ((p->dev && p->dev->ifindex == ifindex) ||
1751 (!p->dev && !ifindex))
1757 int neightbl_set(struct sk_buff *skb, struct nlmsghdr *nlh, void *arg)
1759 struct neigh_table *tbl;
1760 struct ndtmsg *ndtmsg = NLMSG_DATA(nlh);
1761 struct rtattr **tb = arg;
1764 if (!tb[NDTA_NAME - 1] || !RTA_PAYLOAD(tb[NDTA_NAME - 1]))
1767 read_lock(&neigh_tbl_lock);
1768 for (tbl = neigh_tables; tbl; tbl = tbl->next) {
1769 if (ndtmsg->ndtm_family && tbl->family != ndtmsg->ndtm_family)
1772 if (!rtattr_strcmp(tb[NDTA_NAME - 1], tbl->id))
1782 * We acquire tbl->lock to be nice to the periodic timers and
1783 * make sure they always see a consistent set of values.
1785 write_lock_bh(&tbl->lock);
1787 if (tb[NDTA_THRESH1 - 1])
1788 tbl->gc_thresh1 = RTA_GET_U32(tb[NDTA_THRESH1 - 1]);
1790 if (tb[NDTA_THRESH2 - 1])
1791 tbl->gc_thresh2 = RTA_GET_U32(tb[NDTA_THRESH2 - 1]);
1793 if (tb[NDTA_THRESH3 - 1])
1794 tbl->gc_thresh3 = RTA_GET_U32(tb[NDTA_THRESH3 - 1]);
1796 if (tb[NDTA_GC_INTERVAL - 1])
1797 tbl->gc_interval = RTA_GET_MSECS(tb[NDTA_GC_INTERVAL - 1]);
1799 if (tb[NDTA_PARMS - 1]) {
1800 struct rtattr *tbp[NDTPA_MAX];
1801 struct neigh_parms *p;
1804 if (rtattr_parse_nested(tbp, NDTPA_MAX, tb[NDTA_PARMS - 1]) < 0)
1805 goto rtattr_failure;
1807 if (tbp[NDTPA_IFINDEX - 1])
1808 ifindex = RTA_GET_U32(tbp[NDTPA_IFINDEX - 1]);
1810 p = lookup_neigh_params(tbl, ifindex);
1813 goto rtattr_failure;
1816 if (tbp[NDTPA_QUEUE_LEN - 1])
1817 p->queue_len = RTA_GET_U32(tbp[NDTPA_QUEUE_LEN - 1]);
1819 if (tbp[NDTPA_PROXY_QLEN - 1])
1820 p->proxy_qlen = RTA_GET_U32(tbp[NDTPA_PROXY_QLEN - 1]);
1822 if (tbp[NDTPA_APP_PROBES - 1])
1823 p->app_probes = RTA_GET_U32(tbp[NDTPA_APP_PROBES - 1]);
1825 if (tbp[NDTPA_UCAST_PROBES - 1])
1827 RTA_GET_U32(tbp[NDTPA_UCAST_PROBES - 1]);
1829 if (tbp[NDTPA_MCAST_PROBES - 1])
1831 RTA_GET_U32(tbp[NDTPA_MCAST_PROBES - 1]);
1833 if (tbp[NDTPA_BASE_REACHABLE_TIME - 1])
1834 p->base_reachable_time =
1835 RTA_GET_MSECS(tbp[NDTPA_BASE_REACHABLE_TIME - 1]);
1837 if (tbp[NDTPA_GC_STALETIME - 1])
1839 RTA_GET_MSECS(tbp[NDTPA_GC_STALETIME - 1]);
1841 if (tbp[NDTPA_DELAY_PROBE_TIME - 1])
1842 p->delay_probe_time =
1843 RTA_GET_MSECS(tbp[NDTPA_DELAY_PROBE_TIME - 1]);
1845 if (tbp[NDTPA_RETRANS_TIME - 1])
1847 RTA_GET_MSECS(tbp[NDTPA_RETRANS_TIME - 1]);
1849 if (tbp[NDTPA_ANYCAST_DELAY - 1])
1851 RTA_GET_MSECS(tbp[NDTPA_ANYCAST_DELAY - 1]);
1853 if (tbp[NDTPA_PROXY_DELAY - 1])
1855 RTA_GET_MSECS(tbp[NDTPA_PROXY_DELAY - 1]);
1857 if (tbp[NDTPA_LOCKTIME - 1])
1858 p->locktime = RTA_GET_MSECS(tbp[NDTPA_LOCKTIME - 1]);
1864 write_unlock_bh(&tbl->lock);
1866 read_unlock(&neigh_tbl_lock);
1870 int neightbl_dump_info(struct sk_buff *skb, struct netlink_callback *cb)
1873 int s_idx = cb->args[0];
1874 struct neigh_table *tbl;
1876 family = ((struct rtgenmsg *)NLMSG_DATA(cb->nlh))->rtgen_family;
1878 read_lock(&neigh_tbl_lock);
1879 for (tbl = neigh_tables, idx = 0; tbl; tbl = tbl->next) {
1880 struct neigh_parms *p;
1882 if (idx < s_idx || (family && tbl->family != family))
1885 if (neightbl_fill_info(tbl, skb, cb) <= 0)
1888 for (++idx, p = tbl->parms.next; p; p = p->next, idx++) {
1892 if (neightbl_fill_param_info(tbl, p, skb, cb) <= 0)
1898 read_unlock(&neigh_tbl_lock);
1904 static int neigh_fill_info(struct sk_buff *skb, struct neighbour *neigh,
1905 u32 pid, u32 seq, int type, unsigned int flags)
1907 unsigned long now = jiffies;
1908 struct nda_cacheinfo ci;
1909 struct nlmsghdr *nlh;
1912 nlh = nlmsg_put(skb, pid, seq, type, sizeof(*ndm), flags);
1916 ndm = nlmsg_data(nlh);
1917 ndm->ndm_family = neigh->ops->family;
1920 ndm->ndm_flags = neigh->flags;
1921 ndm->ndm_type = neigh->type;
1922 ndm->ndm_ifindex = neigh->dev->ifindex;
1924 NLA_PUT(skb, NDA_DST, neigh->tbl->key_len, neigh->primary_key);
1926 read_lock_bh(&neigh->lock);
1927 ndm->ndm_state = neigh->nud_state;
1928 if ((neigh->nud_state & NUD_VALID) &&
1929 nla_put(skb, NDA_LLADDR, neigh->dev->addr_len, neigh->ha) < 0) {
1930 read_unlock_bh(&neigh->lock);
1931 goto nla_put_failure;
1934 ci.ndm_used = now - neigh->used;
1935 ci.ndm_confirmed = now - neigh->confirmed;
1936 ci.ndm_updated = now - neigh->updated;
1937 ci.ndm_refcnt = atomic_read(&neigh->refcnt) - 1;
1938 read_unlock_bh(&neigh->lock);
1940 NLA_PUT_U32(skb, NDA_PROBES, atomic_read(&neigh->probes));
1941 NLA_PUT(skb, NDA_CACHEINFO, sizeof(ci), &ci);
1943 return nlmsg_end(skb, nlh);
1946 return nlmsg_cancel(skb, nlh);
1950 static int neigh_dump_table(struct neigh_table *tbl, struct sk_buff *skb,
1951 struct netlink_callback *cb)
1953 struct neighbour *n;
1954 int rc, h, s_h = cb->args[1];
1955 int idx, s_idx = idx = cb->args[2];
1957 for (h = 0; h <= tbl->hash_mask; h++) {
1962 read_lock_bh(&tbl->lock);
1963 for (n = tbl->hash_buckets[h], idx = 0; n; n = n->next, idx++) {
1966 if (neigh_fill_info(skb, n, NETLINK_CB(cb->skb).pid,
1969 NLM_F_MULTI) <= 0) {
1970 read_unlock_bh(&tbl->lock);
1975 read_unlock_bh(&tbl->lock);
1984 int neigh_dump_info(struct sk_buff *skb, struct netlink_callback *cb)
1986 struct neigh_table *tbl;
1989 read_lock(&neigh_tbl_lock);
1990 family = ((struct rtgenmsg *) nlmsg_data(cb->nlh))->rtgen_family;
1993 for (tbl = neigh_tables, t = 0; tbl; tbl = tbl->next, t++) {
1994 if (t < s_t || (family && tbl->family != family))
1997 memset(&cb->args[1], 0, sizeof(cb->args) -
1998 sizeof(cb->args[0]));
1999 if (neigh_dump_table(tbl, skb, cb) < 0)
2002 read_unlock(&neigh_tbl_lock);
2008 void neigh_for_each(struct neigh_table *tbl, void (*cb)(struct neighbour *, void *), void *cookie)
2012 read_lock_bh(&tbl->lock);
2013 for (chain = 0; chain <= tbl->hash_mask; chain++) {
2014 struct neighbour *n;
2016 for (n = tbl->hash_buckets[chain]; n; n = n->next)
2019 read_unlock_bh(&tbl->lock);
2021 EXPORT_SYMBOL(neigh_for_each);
2023 /* The tbl->lock must be held as a writer and BH disabled. */
2024 void __neigh_for_each_release(struct neigh_table *tbl,
2025 int (*cb)(struct neighbour *))
2029 for (chain = 0; chain <= tbl->hash_mask; chain++) {
2030 struct neighbour *n, **np;
2032 np = &tbl->hash_buckets[chain];
2033 while ((n = *np) != NULL) {
2036 write_lock(&n->lock);
2043 write_unlock(&n->lock);
2049 EXPORT_SYMBOL(__neigh_for_each_release);
2051 #ifdef CONFIG_PROC_FS
2053 static struct neighbour *neigh_get_first(struct seq_file *seq)
2055 struct neigh_seq_state *state = seq->private;
2056 struct neigh_table *tbl = state->tbl;
2057 struct neighbour *n = NULL;
2058 int bucket = state->bucket;
2060 state->flags &= ~NEIGH_SEQ_IS_PNEIGH;
2061 for (bucket = 0; bucket <= tbl->hash_mask; bucket++) {
2062 n = tbl->hash_buckets[bucket];
2065 if (state->neigh_sub_iter) {
2069 v = state->neigh_sub_iter(state, n, &fakep);
2073 if (!(state->flags & NEIGH_SEQ_SKIP_NOARP))
2075 if (n->nud_state & ~NUD_NOARP)
2084 state->bucket = bucket;
2089 static struct neighbour *neigh_get_next(struct seq_file *seq,
2090 struct neighbour *n,
2093 struct neigh_seq_state *state = seq->private;
2094 struct neigh_table *tbl = state->tbl;
2096 if (state->neigh_sub_iter) {
2097 void *v = state->neigh_sub_iter(state, n, pos);
2105 if (state->neigh_sub_iter) {
2106 void *v = state->neigh_sub_iter(state, n, pos);
2111 if (!(state->flags & NEIGH_SEQ_SKIP_NOARP))
2114 if (n->nud_state & ~NUD_NOARP)
2123 if (++state->bucket > tbl->hash_mask)
2126 n = tbl->hash_buckets[state->bucket];
2134 static struct neighbour *neigh_get_idx(struct seq_file *seq, loff_t *pos)
2136 struct neighbour *n = neigh_get_first(seq);
2140 n = neigh_get_next(seq, n, pos);
2145 return *pos ? NULL : n;
2148 static struct pneigh_entry *pneigh_get_first(struct seq_file *seq)
2150 struct neigh_seq_state *state = seq->private;
2151 struct neigh_table *tbl = state->tbl;
2152 struct pneigh_entry *pn = NULL;
2153 int bucket = state->bucket;
2155 state->flags |= NEIGH_SEQ_IS_PNEIGH;
2156 for (bucket = 0; bucket <= PNEIGH_HASHMASK; bucket++) {
2157 pn = tbl->phash_buckets[bucket];
2161 state->bucket = bucket;
2166 static struct pneigh_entry *pneigh_get_next(struct seq_file *seq,
2167 struct pneigh_entry *pn,
2170 struct neigh_seq_state *state = seq->private;
2171 struct neigh_table *tbl = state->tbl;
2175 if (++state->bucket > PNEIGH_HASHMASK)
2177 pn = tbl->phash_buckets[state->bucket];
2188 static struct pneigh_entry *pneigh_get_idx(struct seq_file *seq, loff_t *pos)
2190 struct pneigh_entry *pn = pneigh_get_first(seq);
2194 pn = pneigh_get_next(seq, pn, pos);
2199 return *pos ? NULL : pn;
2202 static void *neigh_get_idx_any(struct seq_file *seq, loff_t *pos)
2204 struct neigh_seq_state *state = seq->private;
2207 rc = neigh_get_idx(seq, pos);
2208 if (!rc && !(state->flags & NEIGH_SEQ_NEIGH_ONLY))
2209 rc = pneigh_get_idx(seq, pos);
2214 void *neigh_seq_start(struct seq_file *seq, loff_t *pos, struct neigh_table *tbl, unsigned int neigh_seq_flags)
2216 struct neigh_seq_state *state = seq->private;
2217 loff_t pos_minus_one;
2221 state->flags = (neigh_seq_flags & ~NEIGH_SEQ_IS_PNEIGH);
2223 read_lock_bh(&tbl->lock);
2225 pos_minus_one = *pos - 1;
2226 return *pos ? neigh_get_idx_any(seq, &pos_minus_one) : SEQ_START_TOKEN;
2228 EXPORT_SYMBOL(neigh_seq_start);
2230 void *neigh_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2232 struct neigh_seq_state *state;
2235 if (v == SEQ_START_TOKEN) {
2236 rc = neigh_get_idx(seq, pos);
2240 state = seq->private;
2241 if (!(state->flags & NEIGH_SEQ_IS_PNEIGH)) {
2242 rc = neigh_get_next(seq, v, NULL);
2245 if (!(state->flags & NEIGH_SEQ_NEIGH_ONLY))
2246 rc = pneigh_get_first(seq);
2248 BUG_ON(state->flags & NEIGH_SEQ_NEIGH_ONLY);
2249 rc = pneigh_get_next(seq, v, NULL);
2255 EXPORT_SYMBOL(neigh_seq_next);
2257 void neigh_seq_stop(struct seq_file *seq, void *v)
2259 struct neigh_seq_state *state = seq->private;
2260 struct neigh_table *tbl = state->tbl;
2262 read_unlock_bh(&tbl->lock);
2264 EXPORT_SYMBOL(neigh_seq_stop);
2266 /* statistics via seq_file */
2268 static void *neigh_stat_seq_start(struct seq_file *seq, loff_t *pos)
2270 struct proc_dir_entry *pde = seq->private;
2271 struct neigh_table *tbl = pde->data;
2275 return SEQ_START_TOKEN;
2277 for (cpu = *pos-1; cpu < NR_CPUS; ++cpu) {
2278 if (!cpu_possible(cpu))
2281 return per_cpu_ptr(tbl->stats, cpu);
2286 static void *neigh_stat_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2288 struct proc_dir_entry *pde = seq->private;
2289 struct neigh_table *tbl = pde->data;
2292 for (cpu = *pos; cpu < NR_CPUS; ++cpu) {
2293 if (!cpu_possible(cpu))
2296 return per_cpu_ptr(tbl->stats, cpu);
2301 static void neigh_stat_seq_stop(struct seq_file *seq, void *v)
2306 static int neigh_stat_seq_show(struct seq_file *seq, void *v)
2308 struct proc_dir_entry *pde = seq->private;
2309 struct neigh_table *tbl = pde->data;
2310 struct neigh_statistics *st = v;
2312 if (v == SEQ_START_TOKEN) {
2313 seq_printf(seq, "entries allocs destroys hash_grows lookups hits res_failed rcv_probes_mcast rcv_probes_ucast periodic_gc_runs forced_gc_runs\n");
2317 seq_printf(seq, "%08x %08lx %08lx %08lx %08lx %08lx %08lx "
2318 "%08lx %08lx %08lx %08lx\n",
2319 atomic_read(&tbl->entries),
2330 st->rcv_probes_mcast,
2331 st->rcv_probes_ucast,
2333 st->periodic_gc_runs,
2340 static struct seq_operations neigh_stat_seq_ops = {
2341 .start = neigh_stat_seq_start,
2342 .next = neigh_stat_seq_next,
2343 .stop = neigh_stat_seq_stop,
2344 .show = neigh_stat_seq_show,
2347 static int neigh_stat_seq_open(struct inode *inode, struct file *file)
2349 int ret = seq_open(file, &neigh_stat_seq_ops);
2352 struct seq_file *sf = file->private_data;
2353 sf->private = PDE(inode);
2358 static struct file_operations neigh_stat_seq_fops = {
2359 .owner = THIS_MODULE,
2360 .open = neigh_stat_seq_open,
2362 .llseek = seq_lseek,
2363 .release = seq_release,
2366 #endif /* CONFIG_PROC_FS */
2369 void neigh_app_ns(struct neighbour *n)
2371 struct sk_buff *skb;
2373 skb = nlmsg_new(NLMSG_GOODSIZE, GFP_ATOMIC);
2377 if (neigh_fill_info(skb, n, 0, 0, RTM_GETNEIGH, NLM_F_REQUEST) <= 0)
2380 NETLINK_CB(skb).dst_group = RTNLGRP_NEIGH;
2381 netlink_broadcast(rtnl, skb, 0, RTNLGRP_NEIGH, GFP_ATOMIC);
2385 static void neigh_app_notify(struct neighbour *n)
2387 struct sk_buff *skb;
2389 skb = nlmsg_new(NLMSG_GOODSIZE, GFP_ATOMIC);
2393 if (neigh_fill_info(skb, n, 0, 0, RTM_NEWNEIGH, 0) <= 0)
2396 NETLINK_CB(skb).dst_group = RTNLGRP_NEIGH;
2397 netlink_broadcast(rtnl, skb, 0, RTNLGRP_NEIGH, GFP_ATOMIC);
2401 #endif /* CONFIG_ARPD */
2403 #ifdef CONFIG_SYSCTL
2405 static struct neigh_sysctl_table {
2406 struct ctl_table_header *sysctl_header;
2407 ctl_table neigh_vars[__NET_NEIGH_MAX];
2408 ctl_table neigh_dev[2];
2409 ctl_table neigh_neigh_dir[2];
2410 ctl_table neigh_proto_dir[2];
2411 ctl_table neigh_root_dir[2];
2412 } neigh_sysctl_template = {
2415 .ctl_name = NET_NEIGH_MCAST_SOLICIT,
2416 .procname = "mcast_solicit",
2417 .maxlen = sizeof(int),
2419 .proc_handler = &proc_dointvec,
2422 .ctl_name = NET_NEIGH_UCAST_SOLICIT,
2423 .procname = "ucast_solicit",
2424 .maxlen = sizeof(int),
2426 .proc_handler = &proc_dointvec,
2429 .ctl_name = NET_NEIGH_APP_SOLICIT,
2430 .procname = "app_solicit",
2431 .maxlen = sizeof(int),
2433 .proc_handler = &proc_dointvec,
2436 .ctl_name = NET_NEIGH_RETRANS_TIME,
2437 .procname = "retrans_time",
2438 .maxlen = sizeof(int),
2440 .proc_handler = &proc_dointvec_userhz_jiffies,
2443 .ctl_name = NET_NEIGH_REACHABLE_TIME,
2444 .procname = "base_reachable_time",
2445 .maxlen = sizeof(int),
2447 .proc_handler = &proc_dointvec_jiffies,
2448 .strategy = &sysctl_jiffies,
2451 .ctl_name = NET_NEIGH_DELAY_PROBE_TIME,
2452 .procname = "delay_first_probe_time",
2453 .maxlen = sizeof(int),
2455 .proc_handler = &proc_dointvec_jiffies,
2456 .strategy = &sysctl_jiffies,
2459 .ctl_name = NET_NEIGH_GC_STALE_TIME,
2460 .procname = "gc_stale_time",
2461 .maxlen = sizeof(int),
2463 .proc_handler = &proc_dointvec_jiffies,
2464 .strategy = &sysctl_jiffies,
2467 .ctl_name = NET_NEIGH_UNRES_QLEN,
2468 .procname = "unres_qlen",
2469 .maxlen = sizeof(int),
2471 .proc_handler = &proc_dointvec,
2474 .ctl_name = NET_NEIGH_PROXY_QLEN,
2475 .procname = "proxy_qlen",
2476 .maxlen = sizeof(int),
2478 .proc_handler = &proc_dointvec,
2481 .ctl_name = NET_NEIGH_ANYCAST_DELAY,
2482 .procname = "anycast_delay",
2483 .maxlen = sizeof(int),
2485 .proc_handler = &proc_dointvec_userhz_jiffies,
2488 .ctl_name = NET_NEIGH_PROXY_DELAY,
2489 .procname = "proxy_delay",
2490 .maxlen = sizeof(int),
2492 .proc_handler = &proc_dointvec_userhz_jiffies,
2495 .ctl_name = NET_NEIGH_LOCKTIME,
2496 .procname = "locktime",
2497 .maxlen = sizeof(int),
2499 .proc_handler = &proc_dointvec_userhz_jiffies,
2502 .ctl_name = NET_NEIGH_GC_INTERVAL,
2503 .procname = "gc_interval",
2504 .maxlen = sizeof(int),
2506 .proc_handler = &proc_dointvec_jiffies,
2507 .strategy = &sysctl_jiffies,
2510 .ctl_name = NET_NEIGH_GC_THRESH1,
2511 .procname = "gc_thresh1",
2512 .maxlen = sizeof(int),
2514 .proc_handler = &proc_dointvec,
2517 .ctl_name = NET_NEIGH_GC_THRESH2,
2518 .procname = "gc_thresh2",
2519 .maxlen = sizeof(int),
2521 .proc_handler = &proc_dointvec,
2524 .ctl_name = NET_NEIGH_GC_THRESH3,
2525 .procname = "gc_thresh3",
2526 .maxlen = sizeof(int),
2528 .proc_handler = &proc_dointvec,
2531 .ctl_name = NET_NEIGH_RETRANS_TIME_MS,
2532 .procname = "retrans_time_ms",
2533 .maxlen = sizeof(int),
2535 .proc_handler = &proc_dointvec_ms_jiffies,
2536 .strategy = &sysctl_ms_jiffies,
2539 .ctl_name = NET_NEIGH_REACHABLE_TIME_MS,
2540 .procname = "base_reachable_time_ms",
2541 .maxlen = sizeof(int),
2543 .proc_handler = &proc_dointvec_ms_jiffies,
2544 .strategy = &sysctl_ms_jiffies,
2549 .ctl_name = NET_PROTO_CONF_DEFAULT,
2550 .procname = "default",
2554 .neigh_neigh_dir = {
2556 .procname = "neigh",
2560 .neigh_proto_dir = {
2567 .ctl_name = CTL_NET,
2574 int neigh_sysctl_register(struct net_device *dev, struct neigh_parms *p,
2575 int p_id, int pdev_id, char *p_name,
2576 proc_handler *handler, ctl_handler *strategy)
2578 struct neigh_sysctl_table *t = kmalloc(sizeof(*t), GFP_KERNEL);
2579 const char *dev_name_source = NULL;
2580 char *dev_name = NULL;
2585 memcpy(t, &neigh_sysctl_template, sizeof(*t));
2586 t->neigh_vars[0].data = &p->mcast_probes;
2587 t->neigh_vars[1].data = &p->ucast_probes;
2588 t->neigh_vars[2].data = &p->app_probes;
2589 t->neigh_vars[3].data = &p->retrans_time;
2590 t->neigh_vars[4].data = &p->base_reachable_time;
2591 t->neigh_vars[5].data = &p->delay_probe_time;
2592 t->neigh_vars[6].data = &p->gc_staletime;
2593 t->neigh_vars[7].data = &p->queue_len;
2594 t->neigh_vars[8].data = &p->proxy_qlen;
2595 t->neigh_vars[9].data = &p->anycast_delay;
2596 t->neigh_vars[10].data = &p->proxy_delay;
2597 t->neigh_vars[11].data = &p->locktime;
2600 dev_name_source = dev->name;
2601 t->neigh_dev[0].ctl_name = dev->ifindex;
2602 t->neigh_vars[12].procname = NULL;
2603 t->neigh_vars[13].procname = NULL;
2604 t->neigh_vars[14].procname = NULL;
2605 t->neigh_vars[15].procname = NULL;
2607 dev_name_source = t->neigh_dev[0].procname;
2608 t->neigh_vars[12].data = (int *)(p + 1);
2609 t->neigh_vars[13].data = (int *)(p + 1) + 1;
2610 t->neigh_vars[14].data = (int *)(p + 1) + 2;
2611 t->neigh_vars[15].data = (int *)(p + 1) + 3;
2614 t->neigh_vars[16].data = &p->retrans_time;
2615 t->neigh_vars[17].data = &p->base_reachable_time;
2617 if (handler || strategy) {
2619 t->neigh_vars[3].proc_handler = handler;
2620 t->neigh_vars[3].strategy = strategy;
2621 t->neigh_vars[3].extra1 = dev;
2623 t->neigh_vars[4].proc_handler = handler;
2624 t->neigh_vars[4].strategy = strategy;
2625 t->neigh_vars[4].extra1 = dev;
2626 /* RetransTime (in milliseconds)*/
2627 t->neigh_vars[16].proc_handler = handler;
2628 t->neigh_vars[16].strategy = strategy;
2629 t->neigh_vars[16].extra1 = dev;
2630 /* ReachableTime (in milliseconds) */
2631 t->neigh_vars[17].proc_handler = handler;
2632 t->neigh_vars[17].strategy = strategy;
2633 t->neigh_vars[17].extra1 = dev;
2636 dev_name = kstrdup(dev_name_source, GFP_KERNEL);
2642 t->neigh_dev[0].procname = dev_name;
2644 t->neigh_neigh_dir[0].ctl_name = pdev_id;
2646 t->neigh_proto_dir[0].procname = p_name;
2647 t->neigh_proto_dir[0].ctl_name = p_id;
2649 t->neigh_dev[0].child = t->neigh_vars;
2650 t->neigh_neigh_dir[0].child = t->neigh_dev;
2651 t->neigh_proto_dir[0].child = t->neigh_neigh_dir;
2652 t->neigh_root_dir[0].child = t->neigh_proto_dir;
2654 t->sysctl_header = register_sysctl_table(t->neigh_root_dir, 0);
2655 if (!t->sysctl_header) {
2659 p->sysctl_table = t;
2671 void neigh_sysctl_unregister(struct neigh_parms *p)
2673 if (p->sysctl_table) {
2674 struct neigh_sysctl_table *t = p->sysctl_table;
2675 p->sysctl_table = NULL;
2676 unregister_sysctl_table(t->sysctl_header);
2677 kfree(t->neigh_dev[0].procname);
2682 #endif /* CONFIG_SYSCTL */
2684 EXPORT_SYMBOL(__neigh_event_send);
2685 EXPORT_SYMBOL(neigh_add);
2686 EXPORT_SYMBOL(neigh_changeaddr);
2687 EXPORT_SYMBOL(neigh_compat_output);
2688 EXPORT_SYMBOL(neigh_connected_output);
2689 EXPORT_SYMBOL(neigh_create);
2690 EXPORT_SYMBOL(neigh_delete);
2691 EXPORT_SYMBOL(neigh_destroy);
2692 EXPORT_SYMBOL(neigh_dump_info);
2693 EXPORT_SYMBOL(neigh_event_ns);
2694 EXPORT_SYMBOL(neigh_ifdown);
2695 EXPORT_SYMBOL(neigh_lookup);
2696 EXPORT_SYMBOL(neigh_lookup_nodev);
2697 EXPORT_SYMBOL(neigh_parms_alloc);
2698 EXPORT_SYMBOL(neigh_parms_release);
2699 EXPORT_SYMBOL(neigh_rand_reach_time);
2700 EXPORT_SYMBOL(neigh_resolve_output);
2701 EXPORT_SYMBOL(neigh_table_clear);
2702 EXPORT_SYMBOL(neigh_table_init);
2703 EXPORT_SYMBOL(neigh_table_init_no_netlink);
2704 EXPORT_SYMBOL(neigh_update);
2705 EXPORT_SYMBOL(neigh_update_hhs);
2706 EXPORT_SYMBOL(pneigh_enqueue);
2707 EXPORT_SYMBOL(pneigh_lookup);
2708 EXPORT_SYMBOL(neightbl_dump_info);
2709 EXPORT_SYMBOL(neightbl_set);
2712 EXPORT_SYMBOL(neigh_app_ns);
2714 #ifdef CONFIG_SYSCTL
2715 EXPORT_SYMBOL(neigh_sysctl_register);
2716 EXPORT_SYMBOL(neigh_sysctl_unregister);