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/netdevice.h>
23 #include <linux/proc_fs.h>
25 #include <linux/sysctl.h>
27 #include <linux/times.h>
28 #include <net/net_namespace.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>
37 #include <linux/log2.h>
41 #define NEIGH_PRINTK(x...) printk(x)
42 #define NEIGH_NOPRINTK(x...) do { ; } while(0)
43 #define NEIGH_PRINTK0 NEIGH_PRINTK
44 #define NEIGH_PRINTK1 NEIGH_NOPRINTK
45 #define NEIGH_PRINTK2 NEIGH_NOPRINTK
49 #define NEIGH_PRINTK1 NEIGH_PRINTK
53 #define NEIGH_PRINTK2 NEIGH_PRINTK
56 #define PNEIGH_HASHMASK 0xF
58 static void neigh_timer_handler(unsigned long arg);
59 static void __neigh_notify(struct neighbour *n, int type, int flags);
60 static void neigh_update_notify(struct neighbour *neigh);
61 static int pneigh_ifdown(struct neigh_table *tbl, struct net_device *dev);
63 static struct neigh_table *neigh_tables;
65 static const struct file_operations neigh_stat_seq_fops;
69 Neighbour hash table buckets are protected with rwlock tbl->lock.
71 - All the scans/updates to hash buckets MUST be made under this lock.
72 - NOTHING clever should be made under this lock: no callbacks
73 to protocol backends, no attempts to send something to network.
74 It will result in deadlocks, if backend/driver wants to use neighbour
76 - If the entry requires some non-trivial actions, increase
77 its reference count and release table lock.
79 Neighbour entries are protected:
80 - with reference count.
81 - with rwlock neigh->lock
83 Reference count prevents destruction.
85 neigh->lock mainly serializes ll address data and its validity state.
86 However, the same lock is used to protect another entry fields:
90 Again, nothing clever shall be made under neigh->lock,
91 the most complicated procedure, which we allow is dev->hard_header.
92 It is supposed, that dev->hard_header is simplistic and does
93 not make callbacks to neighbour tables.
95 The last lock is neigh_tbl_lock. It is pure SMP lock, protecting
96 list of neighbour tables. This list is used only in process context,
99 static DEFINE_RWLOCK(neigh_tbl_lock);
101 static int neigh_blackhole(struct sk_buff *skb)
107 static void neigh_cleanup_and_release(struct neighbour *neigh)
109 if (neigh->parms->neigh_cleanup)
110 neigh->parms->neigh_cleanup(neigh);
112 __neigh_notify(neigh, RTM_DELNEIGH, 0);
113 neigh_release(neigh);
117 * It is random distribution in the interval (1/2)*base...(3/2)*base.
118 * It corresponds to default IPv6 settings and is not overridable,
119 * because it is really reasonable choice.
122 unsigned long neigh_rand_reach_time(unsigned long base)
124 return (base ? (net_random() % base) + (base >> 1) : 0);
126 EXPORT_SYMBOL(neigh_rand_reach_time);
129 static int neigh_forced_gc(struct neigh_table *tbl)
134 NEIGH_CACHE_STAT_INC(tbl, forced_gc_runs);
136 write_lock_bh(&tbl->lock);
137 for (i = 0; i <= tbl->hash_mask; i++) {
138 struct neighbour *n, **np;
140 np = &tbl->hash_buckets[i];
141 while ((n = *np) != NULL) {
142 /* Neighbour record may be discarded if:
143 * - nobody refers to it.
144 * - it is not permanent
146 write_lock(&n->lock);
147 if (atomic_read(&n->refcnt) == 1 &&
148 !(n->nud_state & NUD_PERMANENT)) {
152 write_unlock(&n->lock);
153 neigh_cleanup_and_release(n);
156 write_unlock(&n->lock);
161 tbl->last_flush = jiffies;
163 write_unlock_bh(&tbl->lock);
168 static void neigh_add_timer(struct neighbour *n, unsigned long when)
171 if (unlikely(mod_timer(&n->timer, when))) {
172 printk("NEIGH: BUG, double timer add, state is %x\n",
178 static int neigh_del_timer(struct neighbour *n)
180 if ((n->nud_state & NUD_IN_TIMER) &&
181 del_timer(&n->timer)) {
188 static void pneigh_queue_purge(struct sk_buff_head *list)
192 while ((skb = skb_dequeue(list)) != NULL) {
198 static void neigh_flush_dev(struct neigh_table *tbl, struct net_device *dev)
202 for (i = 0; i <= tbl->hash_mask; i++) {
203 struct neighbour *n, **np = &tbl->hash_buckets[i];
205 while ((n = *np) != NULL) {
206 if (dev && n->dev != dev) {
211 write_lock(&n->lock);
215 if (atomic_read(&n->refcnt) != 1) {
216 /* The most unpleasant situation.
217 We must destroy neighbour entry,
218 but someone still uses it.
220 The destroy will be delayed until
221 the last user releases us, but
222 we must kill timers etc. and move
225 skb_queue_purge(&n->arp_queue);
226 n->output = neigh_blackhole;
227 if (n->nud_state & NUD_VALID)
228 n->nud_state = NUD_NOARP;
230 n->nud_state = NUD_NONE;
231 NEIGH_PRINTK2("neigh %p is stray.\n", n);
233 write_unlock(&n->lock);
234 neigh_cleanup_and_release(n);
239 void neigh_changeaddr(struct neigh_table *tbl, struct net_device *dev)
241 write_lock_bh(&tbl->lock);
242 neigh_flush_dev(tbl, dev);
243 write_unlock_bh(&tbl->lock);
245 EXPORT_SYMBOL(neigh_changeaddr);
247 int neigh_ifdown(struct neigh_table *tbl, struct net_device *dev)
249 write_lock_bh(&tbl->lock);
250 neigh_flush_dev(tbl, dev);
251 pneigh_ifdown(tbl, dev);
252 write_unlock_bh(&tbl->lock);
254 del_timer_sync(&tbl->proxy_timer);
255 pneigh_queue_purge(&tbl->proxy_queue);
258 EXPORT_SYMBOL(neigh_ifdown);
260 static struct neighbour *neigh_alloc(struct neigh_table *tbl)
262 struct neighbour *n = NULL;
263 unsigned long now = jiffies;
266 entries = atomic_inc_return(&tbl->entries) - 1;
267 if (entries >= tbl->gc_thresh3 ||
268 (entries >= tbl->gc_thresh2 &&
269 time_after(now, tbl->last_flush + 5 * HZ))) {
270 if (!neigh_forced_gc(tbl) &&
271 entries >= tbl->gc_thresh3)
275 n = kmem_cache_zalloc(tbl->kmem_cachep, GFP_ATOMIC);
279 skb_queue_head_init(&n->arp_queue);
280 rwlock_init(&n->lock);
281 n->updated = n->used = now;
282 n->nud_state = NUD_NONE;
283 n->output = neigh_blackhole;
284 n->parms = neigh_parms_clone(&tbl->parms);
285 setup_timer(&n->timer, neigh_timer_handler, (unsigned long)n);
287 NEIGH_CACHE_STAT_INC(tbl, allocs);
289 atomic_set(&n->refcnt, 1);
295 atomic_dec(&tbl->entries);
299 static struct neighbour **neigh_hash_alloc(unsigned int entries)
301 unsigned long size = entries * sizeof(struct neighbour *);
302 struct neighbour **ret;
304 if (size <= PAGE_SIZE) {
305 ret = kzalloc(size, GFP_ATOMIC);
307 ret = (struct neighbour **)
308 __get_free_pages(GFP_ATOMIC|__GFP_ZERO, get_order(size));
313 static void neigh_hash_free(struct neighbour **hash, unsigned int entries)
315 unsigned long size = entries * sizeof(struct neighbour *);
317 if (size <= PAGE_SIZE)
320 free_pages((unsigned long)hash, get_order(size));
323 static void neigh_hash_grow(struct neigh_table *tbl, unsigned long new_entries)
325 struct neighbour **new_hash, **old_hash;
326 unsigned int i, new_hash_mask, old_entries;
328 NEIGH_CACHE_STAT_INC(tbl, hash_grows);
330 BUG_ON(!is_power_of_2(new_entries));
331 new_hash = neigh_hash_alloc(new_entries);
335 old_entries = tbl->hash_mask + 1;
336 new_hash_mask = new_entries - 1;
337 old_hash = tbl->hash_buckets;
339 get_random_bytes(&tbl->hash_rnd, sizeof(tbl->hash_rnd));
340 for (i = 0; i < old_entries; i++) {
341 struct neighbour *n, *next;
343 for (n = old_hash[i]; n; n = next) {
344 unsigned int hash_val = tbl->hash(n->primary_key, n->dev);
346 hash_val &= new_hash_mask;
349 n->next = new_hash[hash_val];
350 new_hash[hash_val] = n;
353 tbl->hash_buckets = new_hash;
354 tbl->hash_mask = new_hash_mask;
356 neigh_hash_free(old_hash, old_entries);
359 struct neighbour *neigh_lookup(struct neigh_table *tbl, const void *pkey,
360 struct net_device *dev)
363 int key_len = tbl->key_len;
366 NEIGH_CACHE_STAT_INC(tbl, lookups);
368 read_lock_bh(&tbl->lock);
369 hash_val = tbl->hash(pkey, dev);
370 for (n = tbl->hash_buckets[hash_val & tbl->hash_mask]; n; n = n->next) {
371 if (dev == n->dev && !memcmp(n->primary_key, pkey, key_len)) {
373 NEIGH_CACHE_STAT_INC(tbl, hits);
377 read_unlock_bh(&tbl->lock);
380 EXPORT_SYMBOL(neigh_lookup);
382 struct neighbour *neigh_lookup_nodev(struct neigh_table *tbl, struct net *net,
386 int key_len = tbl->key_len;
389 NEIGH_CACHE_STAT_INC(tbl, lookups);
391 read_lock_bh(&tbl->lock);
392 hash_val = tbl->hash(pkey, NULL);
393 for (n = tbl->hash_buckets[hash_val & tbl->hash_mask]; n; n = n->next) {
394 if (!memcmp(n->primary_key, pkey, key_len) &&
395 net_eq(dev_net(n->dev), net)) {
397 NEIGH_CACHE_STAT_INC(tbl, hits);
401 read_unlock_bh(&tbl->lock);
404 EXPORT_SYMBOL(neigh_lookup_nodev);
406 struct neighbour *neigh_create(struct neigh_table *tbl, const void *pkey,
407 struct net_device *dev)
410 int key_len = tbl->key_len;
412 struct neighbour *n1, *rc, *n = neigh_alloc(tbl);
415 rc = ERR_PTR(-ENOBUFS);
419 memcpy(n->primary_key, pkey, key_len);
423 /* Protocol specific setup. */
424 if (tbl->constructor && (error = tbl->constructor(n)) < 0) {
426 goto out_neigh_release;
429 /* Device specific setup. */
430 if (n->parms->neigh_setup &&
431 (error = n->parms->neigh_setup(n)) < 0) {
433 goto out_neigh_release;
436 n->confirmed = jiffies - (n->parms->base_reachable_time << 1);
438 write_lock_bh(&tbl->lock);
440 if (atomic_read(&tbl->entries) > (tbl->hash_mask + 1))
441 neigh_hash_grow(tbl, (tbl->hash_mask + 1) << 1);
443 hash_val = tbl->hash(pkey, dev) & tbl->hash_mask;
445 if (n->parms->dead) {
446 rc = ERR_PTR(-EINVAL);
450 for (n1 = tbl->hash_buckets[hash_val]; n1; n1 = n1->next) {
451 if (dev == n1->dev && !memcmp(n1->primary_key, pkey, key_len)) {
458 n->next = tbl->hash_buckets[hash_val];
459 tbl->hash_buckets[hash_val] = n;
462 write_unlock_bh(&tbl->lock);
463 NEIGH_PRINTK2("neigh %p is created.\n", n);
468 write_unlock_bh(&tbl->lock);
473 EXPORT_SYMBOL(neigh_create);
475 static u32 pneigh_hash(const void *pkey, int key_len)
477 u32 hash_val = *(u32 *)(pkey + key_len - 4);
478 hash_val ^= (hash_val >> 16);
479 hash_val ^= hash_val >> 8;
480 hash_val ^= hash_val >> 4;
481 hash_val &= PNEIGH_HASHMASK;
485 static struct pneigh_entry *__pneigh_lookup_1(struct pneigh_entry *n,
489 struct net_device *dev)
492 if (!memcmp(n->key, pkey, key_len) &&
493 net_eq(pneigh_net(n), net) &&
494 (n->dev == dev || !n->dev))
501 struct pneigh_entry *__pneigh_lookup(struct neigh_table *tbl,
502 struct net *net, const void *pkey, struct net_device *dev)
504 int key_len = tbl->key_len;
505 u32 hash_val = pneigh_hash(pkey, key_len);
507 return __pneigh_lookup_1(tbl->phash_buckets[hash_val],
508 net, pkey, key_len, dev);
510 EXPORT_SYMBOL_GPL(__pneigh_lookup);
512 struct pneigh_entry * pneigh_lookup(struct neigh_table *tbl,
513 struct net *net, const void *pkey,
514 struct net_device *dev, int creat)
516 struct pneigh_entry *n;
517 int key_len = tbl->key_len;
518 u32 hash_val = pneigh_hash(pkey, key_len);
520 read_lock_bh(&tbl->lock);
521 n = __pneigh_lookup_1(tbl->phash_buckets[hash_val],
522 net, pkey, key_len, dev);
523 read_unlock_bh(&tbl->lock);
530 n = kmalloc(sizeof(*n) + key_len, GFP_KERNEL);
534 write_pnet(&n->net, hold_net(net));
535 memcpy(n->key, pkey, key_len);
540 if (tbl->pconstructor && tbl->pconstructor(n)) {
549 write_lock_bh(&tbl->lock);
550 n->next = tbl->phash_buckets[hash_val];
551 tbl->phash_buckets[hash_val] = n;
552 write_unlock_bh(&tbl->lock);
556 EXPORT_SYMBOL(pneigh_lookup);
559 int pneigh_delete(struct neigh_table *tbl, struct net *net, const void *pkey,
560 struct net_device *dev)
562 struct pneigh_entry *n, **np;
563 int key_len = tbl->key_len;
564 u32 hash_val = pneigh_hash(pkey, key_len);
566 write_lock_bh(&tbl->lock);
567 for (np = &tbl->phash_buckets[hash_val]; (n = *np) != NULL;
569 if (!memcmp(n->key, pkey, key_len) && n->dev == dev &&
570 net_eq(pneigh_net(n), net)) {
572 write_unlock_bh(&tbl->lock);
573 if (tbl->pdestructor)
577 release_net(pneigh_net(n));
582 write_unlock_bh(&tbl->lock);
586 static int pneigh_ifdown(struct neigh_table *tbl, struct net_device *dev)
588 struct pneigh_entry *n, **np;
591 for (h = 0; h <= PNEIGH_HASHMASK; h++) {
592 np = &tbl->phash_buckets[h];
593 while ((n = *np) != NULL) {
594 if (!dev || n->dev == dev) {
596 if (tbl->pdestructor)
600 release_net(pneigh_net(n));
610 static void neigh_parms_destroy(struct neigh_parms *parms);
612 static inline void neigh_parms_put(struct neigh_parms *parms)
614 if (atomic_dec_and_test(&parms->refcnt))
615 neigh_parms_destroy(parms);
619 * neighbour must already be out of the table;
622 void neigh_destroy(struct neighbour *neigh)
626 NEIGH_CACHE_STAT_INC(neigh->tbl, destroys);
630 "Destroying alive neighbour %p\n", neigh);
635 if (neigh_del_timer(neigh))
636 printk(KERN_WARNING "Impossible event.\n");
638 while ((hh = neigh->hh) != NULL) {
639 neigh->hh = hh->hh_next;
642 write_seqlock_bh(&hh->hh_lock);
643 hh->hh_output = neigh_blackhole;
644 write_sequnlock_bh(&hh->hh_lock);
645 if (atomic_dec_and_test(&hh->hh_refcnt))
649 skb_queue_purge(&neigh->arp_queue);
652 neigh_parms_put(neigh->parms);
654 NEIGH_PRINTK2("neigh %p is destroyed.\n", neigh);
656 atomic_dec(&neigh->tbl->entries);
657 kmem_cache_free(neigh->tbl->kmem_cachep, neigh);
659 EXPORT_SYMBOL(neigh_destroy);
661 /* Neighbour state is suspicious;
664 Called with write_locked neigh.
666 static void neigh_suspect(struct neighbour *neigh)
670 NEIGH_PRINTK2("neigh %p is suspected.\n", neigh);
672 neigh->output = neigh->ops->output;
674 for (hh = neigh->hh; hh; hh = hh->hh_next)
675 hh->hh_output = neigh->ops->output;
678 /* Neighbour state is OK;
681 Called with write_locked neigh.
683 static void neigh_connect(struct neighbour *neigh)
687 NEIGH_PRINTK2("neigh %p is connected.\n", neigh);
689 neigh->output = neigh->ops->connected_output;
691 for (hh = neigh->hh; hh; hh = hh->hh_next)
692 hh->hh_output = neigh->ops->hh_output;
695 static void neigh_periodic_work(struct work_struct *work)
697 struct neigh_table *tbl = container_of(work, struct neigh_table, gc_work.work);
698 struct neighbour *n, **np;
701 NEIGH_CACHE_STAT_INC(tbl, periodic_gc_runs);
703 write_lock_bh(&tbl->lock);
706 * periodically recompute ReachableTime from random function
709 if (time_after(jiffies, tbl->last_rand + 300 * HZ)) {
710 struct neigh_parms *p;
711 tbl->last_rand = jiffies;
712 for (p = &tbl->parms; p; p = p->next)
714 neigh_rand_reach_time(p->base_reachable_time);
717 for (i = 0 ; i <= tbl->hash_mask; i++) {
718 np = &tbl->hash_buckets[i];
720 while ((n = *np) != NULL) {
723 write_lock(&n->lock);
725 state = n->nud_state;
726 if (state & (NUD_PERMANENT | NUD_IN_TIMER)) {
727 write_unlock(&n->lock);
731 if (time_before(n->used, n->confirmed))
732 n->used = n->confirmed;
734 if (atomic_read(&n->refcnt) == 1 &&
735 (state == NUD_FAILED ||
736 time_after(jiffies, n->used + n->parms->gc_staletime))) {
739 write_unlock(&n->lock);
740 neigh_cleanup_and_release(n);
743 write_unlock(&n->lock);
749 * It's fine to release lock here, even if hash table
750 * grows while we are preempted.
752 write_unlock_bh(&tbl->lock);
754 write_lock_bh(&tbl->lock);
756 /* Cycle through all hash buckets every base_reachable_time/2 ticks.
757 * ARP entry timeouts range from 1/2 base_reachable_time to 3/2
758 * base_reachable_time.
760 schedule_delayed_work(&tbl->gc_work,
761 tbl->parms.base_reachable_time >> 1);
762 write_unlock_bh(&tbl->lock);
765 static __inline__ int neigh_max_probes(struct neighbour *n)
767 struct neigh_parms *p = n->parms;
768 return (n->nud_state & NUD_PROBE ?
770 p->ucast_probes + p->app_probes + p->mcast_probes);
773 static void neigh_invalidate(struct neighbour *neigh)
774 __releases(neigh->lock)
775 __acquires(neigh->lock)
779 NEIGH_CACHE_STAT_INC(neigh->tbl, res_failed);
780 NEIGH_PRINTK2("neigh %p is failed.\n", neigh);
781 neigh->updated = jiffies;
783 /* It is very thin place. report_unreachable is very complicated
784 routine. Particularly, it can hit the same neighbour entry!
786 So that, we try to be accurate and avoid dead loop. --ANK
788 while (neigh->nud_state == NUD_FAILED &&
789 (skb = __skb_dequeue(&neigh->arp_queue)) != NULL) {
790 write_unlock(&neigh->lock);
791 neigh->ops->error_report(neigh, skb);
792 write_lock(&neigh->lock);
794 skb_queue_purge(&neigh->arp_queue);
797 /* Called when a timer expires for a neighbour entry. */
799 static void neigh_timer_handler(unsigned long arg)
801 unsigned long now, next;
802 struct neighbour *neigh = (struct neighbour *)arg;
806 write_lock(&neigh->lock);
808 state = neigh->nud_state;
812 if (!(state & NUD_IN_TIMER)) {
814 printk(KERN_WARNING "neigh: timer & !nud_in_timer\n");
819 if (state & NUD_REACHABLE) {
820 if (time_before_eq(now,
821 neigh->confirmed + neigh->parms->reachable_time)) {
822 NEIGH_PRINTK2("neigh %p is still alive.\n", neigh);
823 next = neigh->confirmed + neigh->parms->reachable_time;
824 } else if (time_before_eq(now,
825 neigh->used + neigh->parms->delay_probe_time)) {
826 NEIGH_PRINTK2("neigh %p is delayed.\n", neigh);
827 neigh->nud_state = NUD_DELAY;
828 neigh->updated = jiffies;
829 neigh_suspect(neigh);
830 next = now + neigh->parms->delay_probe_time;
832 NEIGH_PRINTK2("neigh %p is suspected.\n", neigh);
833 neigh->nud_state = NUD_STALE;
834 neigh->updated = jiffies;
835 neigh_suspect(neigh);
838 } else if (state & NUD_DELAY) {
839 if (time_before_eq(now,
840 neigh->confirmed + neigh->parms->delay_probe_time)) {
841 NEIGH_PRINTK2("neigh %p is now reachable.\n", neigh);
842 neigh->nud_state = NUD_REACHABLE;
843 neigh->updated = jiffies;
844 neigh_connect(neigh);
846 next = neigh->confirmed + neigh->parms->reachable_time;
848 NEIGH_PRINTK2("neigh %p is probed.\n", neigh);
849 neigh->nud_state = NUD_PROBE;
850 neigh->updated = jiffies;
851 atomic_set(&neigh->probes, 0);
852 next = now + neigh->parms->retrans_time;
855 /* NUD_PROBE|NUD_INCOMPLETE */
856 next = now + neigh->parms->retrans_time;
859 if ((neigh->nud_state & (NUD_INCOMPLETE | NUD_PROBE)) &&
860 atomic_read(&neigh->probes) >= neigh_max_probes(neigh)) {
861 neigh->nud_state = NUD_FAILED;
863 neigh_invalidate(neigh);
866 if (neigh->nud_state & NUD_IN_TIMER) {
867 if (time_before(next, jiffies + HZ/2))
868 next = jiffies + HZ/2;
869 if (!mod_timer(&neigh->timer, next))
872 if (neigh->nud_state & (NUD_INCOMPLETE | NUD_PROBE)) {
873 struct sk_buff *skb = skb_peek(&neigh->arp_queue);
874 /* keep skb alive even if arp_queue overflows */
876 skb = skb_copy(skb, GFP_ATOMIC);
877 write_unlock(&neigh->lock);
878 neigh->ops->solicit(neigh, skb);
879 atomic_inc(&neigh->probes);
883 write_unlock(&neigh->lock);
887 neigh_update_notify(neigh);
889 neigh_release(neigh);
892 int __neigh_event_send(struct neighbour *neigh, struct sk_buff *skb)
897 write_lock_bh(&neigh->lock);
900 if (neigh->nud_state & (NUD_CONNECTED | NUD_DELAY | NUD_PROBE))
905 if (!(neigh->nud_state & (NUD_STALE | NUD_INCOMPLETE))) {
906 if (neigh->parms->mcast_probes + neigh->parms->app_probes) {
907 atomic_set(&neigh->probes, neigh->parms->ucast_probes);
908 neigh->nud_state = NUD_INCOMPLETE;
909 neigh->updated = jiffies;
910 neigh_add_timer(neigh, now + 1);
912 neigh->nud_state = NUD_FAILED;
913 neigh->updated = jiffies;
914 write_unlock_bh(&neigh->lock);
919 } else if (neigh->nud_state & NUD_STALE) {
920 NEIGH_PRINTK2("neigh %p is delayed.\n", neigh);
921 neigh->nud_state = NUD_DELAY;
922 neigh->updated = jiffies;
923 neigh_add_timer(neigh,
924 jiffies + neigh->parms->delay_probe_time);
927 if (neigh->nud_state == NUD_INCOMPLETE) {
929 if (skb_queue_len(&neigh->arp_queue) >=
930 neigh->parms->queue_len) {
931 struct sk_buff *buff;
932 buff = __skb_dequeue(&neigh->arp_queue);
934 NEIGH_CACHE_STAT_INC(neigh->tbl, unres_discards);
936 __skb_queue_tail(&neigh->arp_queue, skb);
941 write_unlock_bh(&neigh->lock);
944 EXPORT_SYMBOL(__neigh_event_send);
946 static void neigh_update_hhs(struct neighbour *neigh)
949 void (*update)(struct hh_cache*, const struct net_device*, const unsigned char *)
950 = neigh->dev->header_ops->cache_update;
953 for (hh = neigh->hh; hh; hh = hh->hh_next) {
954 write_seqlock_bh(&hh->hh_lock);
955 update(hh, neigh->dev, neigh->ha);
956 write_sequnlock_bh(&hh->hh_lock);
963 /* Generic update routine.
964 -- lladdr is new lladdr or NULL, if it is not supplied.
967 NEIGH_UPDATE_F_OVERRIDE allows to override existing lladdr,
969 NEIGH_UPDATE_F_WEAK_OVERRIDE will suspect existing "connected"
970 lladdr instead of overriding it
972 It also allows to retain current state
973 if lladdr is unchanged.
974 NEIGH_UPDATE_F_ADMIN means that the change is administrative.
976 NEIGH_UPDATE_F_OVERRIDE_ISROUTER allows to override existing
978 NEIGH_UPDATE_F_ISROUTER indicates if the neighbour is known as
981 Caller MUST hold reference count on the entry.
984 int neigh_update(struct neighbour *neigh, const u8 *lladdr, u8 new,
990 struct net_device *dev;
991 int update_isrouter = 0;
993 write_lock_bh(&neigh->lock);
996 old = neigh->nud_state;
999 if (!(flags & NEIGH_UPDATE_F_ADMIN) &&
1000 (old & (NUD_NOARP | NUD_PERMANENT)))
1003 if (!(new & NUD_VALID)) {
1004 neigh_del_timer(neigh);
1005 if (old & NUD_CONNECTED)
1006 neigh_suspect(neigh);
1007 neigh->nud_state = new;
1009 notify = old & NUD_VALID;
1010 if ((old & (NUD_INCOMPLETE | NUD_PROBE)) &&
1011 (new & NUD_FAILED)) {
1012 neigh_invalidate(neigh);
1018 /* Compare new lladdr with cached one */
1019 if (!dev->addr_len) {
1020 /* First case: device needs no address. */
1022 } else if (lladdr) {
1023 /* The second case: if something is already cached
1024 and a new address is proposed:
1026 - if they are different, check override flag
1028 if ((old & NUD_VALID) &&
1029 !memcmp(lladdr, neigh->ha, dev->addr_len))
1032 /* No address is supplied; if we know something,
1033 use it, otherwise discard the request.
1036 if (!(old & NUD_VALID))
1041 if (new & NUD_CONNECTED)
1042 neigh->confirmed = jiffies;
1043 neigh->updated = jiffies;
1045 /* If entry was valid and address is not changed,
1046 do not change entry state, if new one is STALE.
1049 update_isrouter = flags & NEIGH_UPDATE_F_OVERRIDE_ISROUTER;
1050 if (old & NUD_VALID) {
1051 if (lladdr != neigh->ha && !(flags & NEIGH_UPDATE_F_OVERRIDE)) {
1052 update_isrouter = 0;
1053 if ((flags & NEIGH_UPDATE_F_WEAK_OVERRIDE) &&
1054 (old & NUD_CONNECTED)) {
1060 if (lladdr == neigh->ha && new == NUD_STALE &&
1061 ((flags & NEIGH_UPDATE_F_WEAK_OVERRIDE) ||
1062 (old & NUD_CONNECTED))
1069 neigh_del_timer(neigh);
1070 if (new & NUD_IN_TIMER)
1071 neigh_add_timer(neigh, (jiffies +
1072 ((new & NUD_REACHABLE) ?
1073 neigh->parms->reachable_time :
1075 neigh->nud_state = new;
1078 if (lladdr != neigh->ha) {
1079 memcpy(&neigh->ha, lladdr, dev->addr_len);
1080 neigh_update_hhs(neigh);
1081 if (!(new & NUD_CONNECTED))
1082 neigh->confirmed = jiffies -
1083 (neigh->parms->base_reachable_time << 1);
1088 if (new & NUD_CONNECTED)
1089 neigh_connect(neigh);
1091 neigh_suspect(neigh);
1092 if (!(old & NUD_VALID)) {
1093 struct sk_buff *skb;
1095 /* Again: avoid dead loop if something went wrong */
1097 while (neigh->nud_state & NUD_VALID &&
1098 (skb = __skb_dequeue(&neigh->arp_queue)) != NULL) {
1099 struct neighbour *n1 = neigh;
1100 write_unlock_bh(&neigh->lock);
1101 /* On shaper/eql skb->dst->neighbour != neigh :( */
1102 if (skb_dst(skb) && skb_dst(skb)->neighbour)
1103 n1 = skb_dst(skb)->neighbour;
1105 write_lock_bh(&neigh->lock);
1107 skb_queue_purge(&neigh->arp_queue);
1110 if (update_isrouter) {
1111 neigh->flags = (flags & NEIGH_UPDATE_F_ISROUTER) ?
1112 (neigh->flags | NTF_ROUTER) :
1113 (neigh->flags & ~NTF_ROUTER);
1115 write_unlock_bh(&neigh->lock);
1118 neigh_update_notify(neigh);
1122 EXPORT_SYMBOL(neigh_update);
1124 struct neighbour *neigh_event_ns(struct neigh_table *tbl,
1125 u8 *lladdr, void *saddr,
1126 struct net_device *dev)
1128 struct neighbour *neigh = __neigh_lookup(tbl, saddr, dev,
1129 lladdr || !dev->addr_len);
1131 neigh_update(neigh, lladdr, NUD_STALE,
1132 NEIGH_UPDATE_F_OVERRIDE);
1135 EXPORT_SYMBOL(neigh_event_ns);
1137 static void neigh_hh_init(struct neighbour *n, struct dst_entry *dst,
1140 struct hh_cache *hh;
1141 struct net_device *dev = dst->dev;
1143 for (hh = n->hh; hh; hh = hh->hh_next)
1144 if (hh->hh_type == protocol)
1147 if (!hh && (hh = kzalloc(sizeof(*hh), GFP_ATOMIC)) != NULL) {
1148 seqlock_init(&hh->hh_lock);
1149 hh->hh_type = protocol;
1150 atomic_set(&hh->hh_refcnt, 0);
1153 if (dev->header_ops->cache(n, hh)) {
1157 atomic_inc(&hh->hh_refcnt);
1158 hh->hh_next = n->hh;
1160 if (n->nud_state & NUD_CONNECTED)
1161 hh->hh_output = n->ops->hh_output;
1163 hh->hh_output = n->ops->output;
1167 atomic_inc(&hh->hh_refcnt);
1172 /* This function can be used in contexts, where only old dev_queue_xmit
1173 worked, f.e. if you want to override normal output path (eql, shaper),
1174 but resolution is not made yet.
1177 int neigh_compat_output(struct sk_buff *skb)
1179 struct net_device *dev = skb->dev;
1181 __skb_pull(skb, skb_network_offset(skb));
1183 if (dev_hard_header(skb, dev, ntohs(skb->protocol), NULL, NULL,
1185 dev->header_ops->rebuild(skb))
1188 return dev_queue_xmit(skb);
1190 EXPORT_SYMBOL(neigh_compat_output);
1192 /* Slow and careful. */
1194 int neigh_resolve_output(struct sk_buff *skb)
1196 struct dst_entry *dst = skb_dst(skb);
1197 struct neighbour *neigh;
1200 if (!dst || !(neigh = dst->neighbour))
1203 __skb_pull(skb, skb_network_offset(skb));
1205 if (!neigh_event_send(neigh, skb)) {
1207 struct net_device *dev = neigh->dev;
1208 if (dev->header_ops->cache && !dst->hh) {
1209 write_lock_bh(&neigh->lock);
1211 neigh_hh_init(neigh, dst, dst->ops->protocol);
1212 err = dev_hard_header(skb, dev, ntohs(skb->protocol),
1213 neigh->ha, NULL, skb->len);
1214 write_unlock_bh(&neigh->lock);
1216 read_lock_bh(&neigh->lock);
1217 err = dev_hard_header(skb, dev, ntohs(skb->protocol),
1218 neigh->ha, NULL, skb->len);
1219 read_unlock_bh(&neigh->lock);
1222 rc = neigh->ops->queue_xmit(skb);
1229 NEIGH_PRINTK1("neigh_resolve_output: dst=%p neigh=%p\n",
1230 dst, dst ? dst->neighbour : NULL);
1236 EXPORT_SYMBOL(neigh_resolve_output);
1238 /* As fast as possible without hh cache */
1240 int neigh_connected_output(struct sk_buff *skb)
1243 struct dst_entry *dst = skb_dst(skb);
1244 struct neighbour *neigh = dst->neighbour;
1245 struct net_device *dev = neigh->dev;
1247 __skb_pull(skb, skb_network_offset(skb));
1249 read_lock_bh(&neigh->lock);
1250 err = dev_hard_header(skb, dev, ntohs(skb->protocol),
1251 neigh->ha, NULL, skb->len);
1252 read_unlock_bh(&neigh->lock);
1254 err = neigh->ops->queue_xmit(skb);
1261 EXPORT_SYMBOL(neigh_connected_output);
1263 static void neigh_proxy_process(unsigned long arg)
1265 struct neigh_table *tbl = (struct neigh_table *)arg;
1266 long sched_next = 0;
1267 unsigned long now = jiffies;
1268 struct sk_buff *skb, *n;
1270 spin_lock(&tbl->proxy_queue.lock);
1272 skb_queue_walk_safe(&tbl->proxy_queue, skb, n) {
1273 long tdif = NEIGH_CB(skb)->sched_next - now;
1276 struct net_device *dev = skb->dev;
1277 __skb_unlink(skb, &tbl->proxy_queue);
1278 if (tbl->proxy_redo && netif_running(dev))
1279 tbl->proxy_redo(skb);
1284 } else if (!sched_next || tdif < sched_next)
1287 del_timer(&tbl->proxy_timer);
1289 mod_timer(&tbl->proxy_timer, jiffies + sched_next);
1290 spin_unlock(&tbl->proxy_queue.lock);
1293 void pneigh_enqueue(struct neigh_table *tbl, struct neigh_parms *p,
1294 struct sk_buff *skb)
1296 unsigned long now = jiffies;
1297 unsigned long sched_next = now + (net_random() % p->proxy_delay);
1299 if (tbl->proxy_queue.qlen > p->proxy_qlen) {
1304 NEIGH_CB(skb)->sched_next = sched_next;
1305 NEIGH_CB(skb)->flags |= LOCALLY_ENQUEUED;
1307 spin_lock(&tbl->proxy_queue.lock);
1308 if (del_timer(&tbl->proxy_timer)) {
1309 if (time_before(tbl->proxy_timer.expires, sched_next))
1310 sched_next = tbl->proxy_timer.expires;
1314 __skb_queue_tail(&tbl->proxy_queue, skb);
1315 mod_timer(&tbl->proxy_timer, sched_next);
1316 spin_unlock(&tbl->proxy_queue.lock);
1318 EXPORT_SYMBOL(pneigh_enqueue);
1320 static inline struct neigh_parms *lookup_neigh_parms(struct neigh_table *tbl,
1321 struct net *net, int ifindex)
1323 struct neigh_parms *p;
1325 for (p = &tbl->parms; p; p = p->next) {
1326 if ((p->dev && p->dev->ifindex == ifindex && net_eq(neigh_parms_net(p), net)) ||
1327 (!p->dev && !ifindex))
1334 struct neigh_parms *neigh_parms_alloc(struct net_device *dev,
1335 struct neigh_table *tbl)
1337 struct neigh_parms *p, *ref;
1338 struct net *net = dev_net(dev);
1339 const struct net_device_ops *ops = dev->netdev_ops;
1341 ref = lookup_neigh_parms(tbl, net, 0);
1345 p = kmemdup(ref, sizeof(*p), GFP_KERNEL);
1348 atomic_set(&p->refcnt, 1);
1350 neigh_rand_reach_time(p->base_reachable_time);
1352 if (ops->ndo_neigh_setup && ops->ndo_neigh_setup(dev, p)) {
1359 write_pnet(&p->net, hold_net(net));
1360 p->sysctl_table = NULL;
1361 write_lock_bh(&tbl->lock);
1362 p->next = tbl->parms.next;
1363 tbl->parms.next = p;
1364 write_unlock_bh(&tbl->lock);
1368 EXPORT_SYMBOL(neigh_parms_alloc);
1370 static void neigh_rcu_free_parms(struct rcu_head *head)
1372 struct neigh_parms *parms =
1373 container_of(head, struct neigh_parms, rcu_head);
1375 neigh_parms_put(parms);
1378 void neigh_parms_release(struct neigh_table *tbl, struct neigh_parms *parms)
1380 struct neigh_parms **p;
1382 if (!parms || parms == &tbl->parms)
1384 write_lock_bh(&tbl->lock);
1385 for (p = &tbl->parms.next; *p; p = &(*p)->next) {
1389 write_unlock_bh(&tbl->lock);
1391 dev_put(parms->dev);
1392 call_rcu(&parms->rcu_head, neigh_rcu_free_parms);
1396 write_unlock_bh(&tbl->lock);
1397 NEIGH_PRINTK1("neigh_parms_release: not found\n");
1399 EXPORT_SYMBOL(neigh_parms_release);
1401 static void neigh_parms_destroy(struct neigh_parms *parms)
1403 release_net(neigh_parms_net(parms));
1407 static struct lock_class_key neigh_table_proxy_queue_class;
1409 void neigh_table_init_no_netlink(struct neigh_table *tbl)
1411 unsigned long now = jiffies;
1412 unsigned long phsize;
1414 write_pnet(&tbl->parms.net, &init_net);
1415 atomic_set(&tbl->parms.refcnt, 1);
1416 tbl->parms.reachable_time =
1417 neigh_rand_reach_time(tbl->parms.base_reachable_time);
1419 if (!tbl->kmem_cachep)
1421 kmem_cache_create(tbl->id, tbl->entry_size, 0,
1422 SLAB_HWCACHE_ALIGN|SLAB_PANIC,
1424 tbl->stats = alloc_percpu(struct neigh_statistics);
1426 panic("cannot create neighbour cache statistics");
1428 #ifdef CONFIG_PROC_FS
1429 if (!proc_create_data(tbl->id, 0, init_net.proc_net_stat,
1430 &neigh_stat_seq_fops, tbl))
1431 panic("cannot create neighbour proc dir entry");
1435 tbl->hash_buckets = neigh_hash_alloc(tbl->hash_mask + 1);
1437 phsize = (PNEIGH_HASHMASK + 1) * sizeof(struct pneigh_entry *);
1438 tbl->phash_buckets = kzalloc(phsize, GFP_KERNEL);
1440 if (!tbl->hash_buckets || !tbl->phash_buckets)
1441 panic("cannot allocate neighbour cache hashes");
1443 get_random_bytes(&tbl->hash_rnd, sizeof(tbl->hash_rnd));
1445 rwlock_init(&tbl->lock);
1446 INIT_DELAYED_WORK_DEFERRABLE(&tbl->gc_work, neigh_periodic_work);
1447 schedule_delayed_work(&tbl->gc_work, tbl->parms.reachable_time);
1448 setup_timer(&tbl->proxy_timer, neigh_proxy_process, (unsigned long)tbl);
1449 skb_queue_head_init_class(&tbl->proxy_queue,
1450 &neigh_table_proxy_queue_class);
1452 tbl->last_flush = now;
1453 tbl->last_rand = now + tbl->parms.reachable_time * 20;
1455 EXPORT_SYMBOL(neigh_table_init_no_netlink);
1457 void neigh_table_init(struct neigh_table *tbl)
1459 struct neigh_table *tmp;
1461 neigh_table_init_no_netlink(tbl);
1462 write_lock(&neigh_tbl_lock);
1463 for (tmp = neigh_tables; tmp; tmp = tmp->next) {
1464 if (tmp->family == tbl->family)
1467 tbl->next = neigh_tables;
1469 write_unlock(&neigh_tbl_lock);
1471 if (unlikely(tmp)) {
1472 printk(KERN_ERR "NEIGH: Registering multiple tables for "
1473 "family %d\n", tbl->family);
1477 EXPORT_SYMBOL(neigh_table_init);
1479 int neigh_table_clear(struct neigh_table *tbl)
1481 struct neigh_table **tp;
1483 /* It is not clean... Fix it to unload IPv6 module safely */
1484 cancel_delayed_work(&tbl->gc_work);
1485 flush_scheduled_work();
1486 del_timer_sync(&tbl->proxy_timer);
1487 pneigh_queue_purge(&tbl->proxy_queue);
1488 neigh_ifdown(tbl, NULL);
1489 if (atomic_read(&tbl->entries))
1490 printk(KERN_CRIT "neighbour leakage\n");
1491 write_lock(&neigh_tbl_lock);
1492 for (tp = &neigh_tables; *tp; tp = &(*tp)->next) {
1498 write_unlock(&neigh_tbl_lock);
1500 neigh_hash_free(tbl->hash_buckets, tbl->hash_mask + 1);
1501 tbl->hash_buckets = NULL;
1503 kfree(tbl->phash_buckets);
1504 tbl->phash_buckets = NULL;
1506 remove_proc_entry(tbl->id, init_net.proc_net_stat);
1508 free_percpu(tbl->stats);
1511 kmem_cache_destroy(tbl->kmem_cachep);
1512 tbl->kmem_cachep = NULL;
1516 EXPORT_SYMBOL(neigh_table_clear);
1518 static int neigh_delete(struct sk_buff *skb, struct nlmsghdr *nlh, void *arg)
1520 struct net *net = sock_net(skb->sk);
1522 struct nlattr *dst_attr;
1523 struct neigh_table *tbl;
1524 struct net_device *dev = NULL;
1527 if (nlmsg_len(nlh) < sizeof(*ndm))
1530 dst_attr = nlmsg_find_attr(nlh, sizeof(*ndm), NDA_DST);
1531 if (dst_attr == NULL)
1534 ndm = nlmsg_data(nlh);
1535 if (ndm->ndm_ifindex) {
1536 dev = dev_get_by_index(net, ndm->ndm_ifindex);
1543 read_lock(&neigh_tbl_lock);
1544 for (tbl = neigh_tables; tbl; tbl = tbl->next) {
1545 struct neighbour *neigh;
1547 if (tbl->family != ndm->ndm_family)
1549 read_unlock(&neigh_tbl_lock);
1551 if (nla_len(dst_attr) < tbl->key_len)
1554 if (ndm->ndm_flags & NTF_PROXY) {
1555 err = pneigh_delete(tbl, net, nla_data(dst_attr), dev);
1562 neigh = neigh_lookup(tbl, nla_data(dst_attr), dev);
1563 if (neigh == NULL) {
1568 err = neigh_update(neigh, NULL, NUD_FAILED,
1569 NEIGH_UPDATE_F_OVERRIDE |
1570 NEIGH_UPDATE_F_ADMIN);
1571 neigh_release(neigh);
1574 read_unlock(&neigh_tbl_lock);
1575 err = -EAFNOSUPPORT;
1584 static int neigh_add(struct sk_buff *skb, struct nlmsghdr *nlh, void *arg)
1586 struct net *net = sock_net(skb->sk);
1588 struct nlattr *tb[NDA_MAX+1];
1589 struct neigh_table *tbl;
1590 struct net_device *dev = NULL;
1593 err = nlmsg_parse(nlh, sizeof(*ndm), tb, NDA_MAX, NULL);
1598 if (tb[NDA_DST] == NULL)
1601 ndm = nlmsg_data(nlh);
1602 if (ndm->ndm_ifindex) {
1603 dev = dev_get_by_index(net, ndm->ndm_ifindex);
1609 if (tb[NDA_LLADDR] && nla_len(tb[NDA_LLADDR]) < dev->addr_len)
1613 read_lock(&neigh_tbl_lock);
1614 for (tbl = neigh_tables; tbl; tbl = tbl->next) {
1615 int flags = NEIGH_UPDATE_F_ADMIN | NEIGH_UPDATE_F_OVERRIDE;
1616 struct neighbour *neigh;
1619 if (tbl->family != ndm->ndm_family)
1621 read_unlock(&neigh_tbl_lock);
1623 if (nla_len(tb[NDA_DST]) < tbl->key_len)
1625 dst = nla_data(tb[NDA_DST]);
1626 lladdr = tb[NDA_LLADDR] ? nla_data(tb[NDA_LLADDR]) : NULL;
1628 if (ndm->ndm_flags & NTF_PROXY) {
1629 struct pneigh_entry *pn;
1632 pn = pneigh_lookup(tbl, net, dst, dev, 1);
1634 pn->flags = ndm->ndm_flags;
1643 neigh = neigh_lookup(tbl, dst, dev);
1644 if (neigh == NULL) {
1645 if (!(nlh->nlmsg_flags & NLM_F_CREATE)) {
1650 neigh = __neigh_lookup_errno(tbl, dst, dev);
1651 if (IS_ERR(neigh)) {
1652 err = PTR_ERR(neigh);
1656 if (nlh->nlmsg_flags & NLM_F_EXCL) {
1658 neigh_release(neigh);
1662 if (!(nlh->nlmsg_flags & NLM_F_REPLACE))
1663 flags &= ~NEIGH_UPDATE_F_OVERRIDE;
1666 if (ndm->ndm_flags & NTF_USE) {
1667 neigh_event_send(neigh, NULL);
1670 err = neigh_update(neigh, lladdr, ndm->ndm_state, flags);
1671 neigh_release(neigh);
1675 read_unlock(&neigh_tbl_lock);
1676 err = -EAFNOSUPPORT;
1685 static int neightbl_fill_parms(struct sk_buff *skb, struct neigh_parms *parms)
1687 struct nlattr *nest;
1689 nest = nla_nest_start(skb, NDTA_PARMS);
1694 NLA_PUT_U32(skb, NDTPA_IFINDEX, parms->dev->ifindex);
1696 NLA_PUT_U32(skb, NDTPA_REFCNT, atomic_read(&parms->refcnt));
1697 NLA_PUT_U32(skb, NDTPA_QUEUE_LEN, parms->queue_len);
1698 NLA_PUT_U32(skb, NDTPA_PROXY_QLEN, parms->proxy_qlen);
1699 NLA_PUT_U32(skb, NDTPA_APP_PROBES, parms->app_probes);
1700 NLA_PUT_U32(skb, NDTPA_UCAST_PROBES, parms->ucast_probes);
1701 NLA_PUT_U32(skb, NDTPA_MCAST_PROBES, parms->mcast_probes);
1702 NLA_PUT_MSECS(skb, NDTPA_REACHABLE_TIME, parms->reachable_time);
1703 NLA_PUT_MSECS(skb, NDTPA_BASE_REACHABLE_TIME,
1704 parms->base_reachable_time);
1705 NLA_PUT_MSECS(skb, NDTPA_GC_STALETIME, parms->gc_staletime);
1706 NLA_PUT_MSECS(skb, NDTPA_DELAY_PROBE_TIME, parms->delay_probe_time);
1707 NLA_PUT_MSECS(skb, NDTPA_RETRANS_TIME, parms->retrans_time);
1708 NLA_PUT_MSECS(skb, NDTPA_ANYCAST_DELAY, parms->anycast_delay);
1709 NLA_PUT_MSECS(skb, NDTPA_PROXY_DELAY, parms->proxy_delay);
1710 NLA_PUT_MSECS(skb, NDTPA_LOCKTIME, parms->locktime);
1712 return nla_nest_end(skb, nest);
1715 nla_nest_cancel(skb, nest);
1719 static int neightbl_fill_info(struct sk_buff *skb, struct neigh_table *tbl,
1720 u32 pid, u32 seq, int type, int flags)
1722 struct nlmsghdr *nlh;
1723 struct ndtmsg *ndtmsg;
1725 nlh = nlmsg_put(skb, pid, seq, type, sizeof(*ndtmsg), flags);
1729 ndtmsg = nlmsg_data(nlh);
1731 read_lock_bh(&tbl->lock);
1732 ndtmsg->ndtm_family = tbl->family;
1733 ndtmsg->ndtm_pad1 = 0;
1734 ndtmsg->ndtm_pad2 = 0;
1736 NLA_PUT_STRING(skb, NDTA_NAME, tbl->id);
1737 NLA_PUT_MSECS(skb, NDTA_GC_INTERVAL, tbl->gc_interval);
1738 NLA_PUT_U32(skb, NDTA_THRESH1, tbl->gc_thresh1);
1739 NLA_PUT_U32(skb, NDTA_THRESH2, tbl->gc_thresh2);
1740 NLA_PUT_U32(skb, NDTA_THRESH3, tbl->gc_thresh3);
1743 unsigned long now = jiffies;
1744 unsigned int flush_delta = now - tbl->last_flush;
1745 unsigned int rand_delta = now - tbl->last_rand;
1747 struct ndt_config ndc = {
1748 .ndtc_key_len = tbl->key_len,
1749 .ndtc_entry_size = tbl->entry_size,
1750 .ndtc_entries = atomic_read(&tbl->entries),
1751 .ndtc_last_flush = jiffies_to_msecs(flush_delta),
1752 .ndtc_last_rand = jiffies_to_msecs(rand_delta),
1753 .ndtc_hash_rnd = tbl->hash_rnd,
1754 .ndtc_hash_mask = tbl->hash_mask,
1755 .ndtc_proxy_qlen = tbl->proxy_queue.qlen,
1758 NLA_PUT(skb, NDTA_CONFIG, sizeof(ndc), &ndc);
1763 struct ndt_stats ndst;
1765 memset(&ndst, 0, sizeof(ndst));
1767 for_each_possible_cpu(cpu) {
1768 struct neigh_statistics *st;
1770 st = per_cpu_ptr(tbl->stats, cpu);
1771 ndst.ndts_allocs += st->allocs;
1772 ndst.ndts_destroys += st->destroys;
1773 ndst.ndts_hash_grows += st->hash_grows;
1774 ndst.ndts_res_failed += st->res_failed;
1775 ndst.ndts_lookups += st->lookups;
1776 ndst.ndts_hits += st->hits;
1777 ndst.ndts_rcv_probes_mcast += st->rcv_probes_mcast;
1778 ndst.ndts_rcv_probes_ucast += st->rcv_probes_ucast;
1779 ndst.ndts_periodic_gc_runs += st->periodic_gc_runs;
1780 ndst.ndts_forced_gc_runs += st->forced_gc_runs;
1783 NLA_PUT(skb, NDTA_STATS, sizeof(ndst), &ndst);
1786 BUG_ON(tbl->parms.dev);
1787 if (neightbl_fill_parms(skb, &tbl->parms) < 0)
1788 goto nla_put_failure;
1790 read_unlock_bh(&tbl->lock);
1791 return nlmsg_end(skb, nlh);
1794 read_unlock_bh(&tbl->lock);
1795 nlmsg_cancel(skb, nlh);
1799 static int neightbl_fill_param_info(struct sk_buff *skb,
1800 struct neigh_table *tbl,
1801 struct neigh_parms *parms,
1802 u32 pid, u32 seq, int type,
1805 struct ndtmsg *ndtmsg;
1806 struct nlmsghdr *nlh;
1808 nlh = nlmsg_put(skb, pid, seq, type, sizeof(*ndtmsg), flags);
1812 ndtmsg = nlmsg_data(nlh);
1814 read_lock_bh(&tbl->lock);
1815 ndtmsg->ndtm_family = tbl->family;
1816 ndtmsg->ndtm_pad1 = 0;
1817 ndtmsg->ndtm_pad2 = 0;
1819 if (nla_put_string(skb, NDTA_NAME, tbl->id) < 0 ||
1820 neightbl_fill_parms(skb, parms) < 0)
1823 read_unlock_bh(&tbl->lock);
1824 return nlmsg_end(skb, nlh);
1826 read_unlock_bh(&tbl->lock);
1827 nlmsg_cancel(skb, nlh);
1831 static const struct nla_policy nl_neightbl_policy[NDTA_MAX+1] = {
1832 [NDTA_NAME] = { .type = NLA_STRING },
1833 [NDTA_THRESH1] = { .type = NLA_U32 },
1834 [NDTA_THRESH2] = { .type = NLA_U32 },
1835 [NDTA_THRESH3] = { .type = NLA_U32 },
1836 [NDTA_GC_INTERVAL] = { .type = NLA_U64 },
1837 [NDTA_PARMS] = { .type = NLA_NESTED },
1840 static const struct nla_policy nl_ntbl_parm_policy[NDTPA_MAX+1] = {
1841 [NDTPA_IFINDEX] = { .type = NLA_U32 },
1842 [NDTPA_QUEUE_LEN] = { .type = NLA_U32 },
1843 [NDTPA_PROXY_QLEN] = { .type = NLA_U32 },
1844 [NDTPA_APP_PROBES] = { .type = NLA_U32 },
1845 [NDTPA_UCAST_PROBES] = { .type = NLA_U32 },
1846 [NDTPA_MCAST_PROBES] = { .type = NLA_U32 },
1847 [NDTPA_BASE_REACHABLE_TIME] = { .type = NLA_U64 },
1848 [NDTPA_GC_STALETIME] = { .type = NLA_U64 },
1849 [NDTPA_DELAY_PROBE_TIME] = { .type = NLA_U64 },
1850 [NDTPA_RETRANS_TIME] = { .type = NLA_U64 },
1851 [NDTPA_ANYCAST_DELAY] = { .type = NLA_U64 },
1852 [NDTPA_PROXY_DELAY] = { .type = NLA_U64 },
1853 [NDTPA_LOCKTIME] = { .type = NLA_U64 },
1856 static int neightbl_set(struct sk_buff *skb, struct nlmsghdr *nlh, void *arg)
1858 struct net *net = sock_net(skb->sk);
1859 struct neigh_table *tbl;
1860 struct ndtmsg *ndtmsg;
1861 struct nlattr *tb[NDTA_MAX+1];
1864 err = nlmsg_parse(nlh, sizeof(*ndtmsg), tb, NDTA_MAX,
1865 nl_neightbl_policy);
1869 if (tb[NDTA_NAME] == NULL) {
1874 ndtmsg = nlmsg_data(nlh);
1875 read_lock(&neigh_tbl_lock);
1876 for (tbl = neigh_tables; tbl; tbl = tbl->next) {
1877 if (ndtmsg->ndtm_family && tbl->family != ndtmsg->ndtm_family)
1880 if (nla_strcmp(tb[NDTA_NAME], tbl->id) == 0)
1890 * We acquire tbl->lock to be nice to the periodic timers and
1891 * make sure they always see a consistent set of values.
1893 write_lock_bh(&tbl->lock);
1895 if (tb[NDTA_PARMS]) {
1896 struct nlattr *tbp[NDTPA_MAX+1];
1897 struct neigh_parms *p;
1900 err = nla_parse_nested(tbp, NDTPA_MAX, tb[NDTA_PARMS],
1901 nl_ntbl_parm_policy);
1903 goto errout_tbl_lock;
1905 if (tbp[NDTPA_IFINDEX])
1906 ifindex = nla_get_u32(tbp[NDTPA_IFINDEX]);
1908 p = lookup_neigh_parms(tbl, net, ifindex);
1911 goto errout_tbl_lock;
1914 for (i = 1; i <= NDTPA_MAX; i++) {
1919 case NDTPA_QUEUE_LEN:
1920 p->queue_len = nla_get_u32(tbp[i]);
1922 case NDTPA_PROXY_QLEN:
1923 p->proxy_qlen = nla_get_u32(tbp[i]);
1925 case NDTPA_APP_PROBES:
1926 p->app_probes = nla_get_u32(tbp[i]);
1928 case NDTPA_UCAST_PROBES:
1929 p->ucast_probes = nla_get_u32(tbp[i]);
1931 case NDTPA_MCAST_PROBES:
1932 p->mcast_probes = nla_get_u32(tbp[i]);
1934 case NDTPA_BASE_REACHABLE_TIME:
1935 p->base_reachable_time = nla_get_msecs(tbp[i]);
1937 case NDTPA_GC_STALETIME:
1938 p->gc_staletime = nla_get_msecs(tbp[i]);
1940 case NDTPA_DELAY_PROBE_TIME:
1941 p->delay_probe_time = nla_get_msecs(tbp[i]);
1943 case NDTPA_RETRANS_TIME:
1944 p->retrans_time = nla_get_msecs(tbp[i]);
1946 case NDTPA_ANYCAST_DELAY:
1947 p->anycast_delay = nla_get_msecs(tbp[i]);
1949 case NDTPA_PROXY_DELAY:
1950 p->proxy_delay = nla_get_msecs(tbp[i]);
1952 case NDTPA_LOCKTIME:
1953 p->locktime = nla_get_msecs(tbp[i]);
1959 if (tb[NDTA_THRESH1])
1960 tbl->gc_thresh1 = nla_get_u32(tb[NDTA_THRESH1]);
1962 if (tb[NDTA_THRESH2])
1963 tbl->gc_thresh2 = nla_get_u32(tb[NDTA_THRESH2]);
1965 if (tb[NDTA_THRESH3])
1966 tbl->gc_thresh3 = nla_get_u32(tb[NDTA_THRESH3]);
1968 if (tb[NDTA_GC_INTERVAL])
1969 tbl->gc_interval = nla_get_msecs(tb[NDTA_GC_INTERVAL]);
1974 write_unlock_bh(&tbl->lock);
1976 read_unlock(&neigh_tbl_lock);
1981 static int neightbl_dump_info(struct sk_buff *skb, struct netlink_callback *cb)
1983 struct net *net = sock_net(skb->sk);
1984 int family, tidx, nidx = 0;
1985 int tbl_skip = cb->args[0];
1986 int neigh_skip = cb->args[1];
1987 struct neigh_table *tbl;
1989 family = ((struct rtgenmsg *) nlmsg_data(cb->nlh))->rtgen_family;
1991 read_lock(&neigh_tbl_lock);
1992 for (tbl = neigh_tables, tidx = 0; tbl; tbl = tbl->next, tidx++) {
1993 struct neigh_parms *p;
1995 if (tidx < tbl_skip || (family && tbl->family != family))
1998 if (neightbl_fill_info(skb, tbl, NETLINK_CB(cb->skb).pid,
1999 cb->nlh->nlmsg_seq, RTM_NEWNEIGHTBL,
2003 for (nidx = 0, p = tbl->parms.next; p; p = p->next) {
2004 if (!net_eq(neigh_parms_net(p), net))
2007 if (nidx < neigh_skip)
2010 if (neightbl_fill_param_info(skb, tbl, p,
2011 NETLINK_CB(cb->skb).pid,
2023 read_unlock(&neigh_tbl_lock);
2030 static int neigh_fill_info(struct sk_buff *skb, struct neighbour *neigh,
2031 u32 pid, u32 seq, int type, unsigned int flags)
2033 unsigned long now = jiffies;
2034 struct nda_cacheinfo ci;
2035 struct nlmsghdr *nlh;
2038 nlh = nlmsg_put(skb, pid, seq, type, sizeof(*ndm), flags);
2042 ndm = nlmsg_data(nlh);
2043 ndm->ndm_family = neigh->ops->family;
2046 ndm->ndm_flags = neigh->flags;
2047 ndm->ndm_type = neigh->type;
2048 ndm->ndm_ifindex = neigh->dev->ifindex;
2050 NLA_PUT(skb, NDA_DST, neigh->tbl->key_len, neigh->primary_key);
2052 read_lock_bh(&neigh->lock);
2053 ndm->ndm_state = neigh->nud_state;
2054 if ((neigh->nud_state & NUD_VALID) &&
2055 nla_put(skb, NDA_LLADDR, neigh->dev->addr_len, neigh->ha) < 0) {
2056 read_unlock_bh(&neigh->lock);
2057 goto nla_put_failure;
2060 ci.ndm_used = jiffies_to_clock_t(now - neigh->used);
2061 ci.ndm_confirmed = jiffies_to_clock_t(now - neigh->confirmed);
2062 ci.ndm_updated = jiffies_to_clock_t(now - neigh->updated);
2063 ci.ndm_refcnt = atomic_read(&neigh->refcnt) - 1;
2064 read_unlock_bh(&neigh->lock);
2066 NLA_PUT_U32(skb, NDA_PROBES, atomic_read(&neigh->probes));
2067 NLA_PUT(skb, NDA_CACHEINFO, sizeof(ci), &ci);
2069 return nlmsg_end(skb, nlh);
2072 nlmsg_cancel(skb, nlh);
2076 static void neigh_update_notify(struct neighbour *neigh)
2078 call_netevent_notifiers(NETEVENT_NEIGH_UPDATE, neigh);
2079 __neigh_notify(neigh, RTM_NEWNEIGH, 0);
2082 static int neigh_dump_table(struct neigh_table *tbl, struct sk_buff *skb,
2083 struct netlink_callback *cb)
2085 struct net * net = sock_net(skb->sk);
2086 struct neighbour *n;
2087 int rc, h, s_h = cb->args[1];
2088 int idx, s_idx = idx = cb->args[2];
2090 read_lock_bh(&tbl->lock);
2091 for (h = 0; h <= tbl->hash_mask; h++) {
2096 for (n = tbl->hash_buckets[h], idx = 0; n; n = n->next) {
2097 if (!net_eq(dev_net(n->dev), net))
2101 if (neigh_fill_info(skb, n, NETLINK_CB(cb->skb).pid,
2104 NLM_F_MULTI) <= 0) {
2105 read_unlock_bh(&tbl->lock);
2113 read_unlock_bh(&tbl->lock);
2121 static int neigh_dump_info(struct sk_buff *skb, struct netlink_callback *cb)
2123 struct neigh_table *tbl;
2126 read_lock(&neigh_tbl_lock);
2127 family = ((struct rtgenmsg *) nlmsg_data(cb->nlh))->rtgen_family;
2130 for (tbl = neigh_tables, t = 0; tbl; tbl = tbl->next, t++) {
2131 if (t < s_t || (family && tbl->family != family))
2134 memset(&cb->args[1], 0, sizeof(cb->args) -
2135 sizeof(cb->args[0]));
2136 if (neigh_dump_table(tbl, skb, cb) < 0)
2139 read_unlock(&neigh_tbl_lock);
2145 void neigh_for_each(struct neigh_table *tbl, void (*cb)(struct neighbour *, void *), void *cookie)
2149 read_lock_bh(&tbl->lock);
2150 for (chain = 0; chain <= tbl->hash_mask; chain++) {
2151 struct neighbour *n;
2153 for (n = tbl->hash_buckets[chain]; n; n = n->next)
2156 read_unlock_bh(&tbl->lock);
2158 EXPORT_SYMBOL(neigh_for_each);
2160 /* The tbl->lock must be held as a writer and BH disabled. */
2161 void __neigh_for_each_release(struct neigh_table *tbl,
2162 int (*cb)(struct neighbour *))
2166 for (chain = 0; chain <= tbl->hash_mask; chain++) {
2167 struct neighbour *n, **np;
2169 np = &tbl->hash_buckets[chain];
2170 while ((n = *np) != NULL) {
2173 write_lock(&n->lock);
2180 write_unlock(&n->lock);
2182 neigh_cleanup_and_release(n);
2186 EXPORT_SYMBOL(__neigh_for_each_release);
2188 #ifdef CONFIG_PROC_FS
2190 static struct neighbour *neigh_get_first(struct seq_file *seq)
2192 struct neigh_seq_state *state = seq->private;
2193 struct net *net = seq_file_net(seq);
2194 struct neigh_table *tbl = state->tbl;
2195 struct neighbour *n = NULL;
2196 int bucket = state->bucket;
2198 state->flags &= ~NEIGH_SEQ_IS_PNEIGH;
2199 for (bucket = 0; bucket <= tbl->hash_mask; bucket++) {
2200 n = tbl->hash_buckets[bucket];
2203 if (!net_eq(dev_net(n->dev), net))
2205 if (state->neigh_sub_iter) {
2209 v = state->neigh_sub_iter(state, n, &fakep);
2213 if (!(state->flags & NEIGH_SEQ_SKIP_NOARP))
2215 if (n->nud_state & ~NUD_NOARP)
2224 state->bucket = bucket;
2229 static struct neighbour *neigh_get_next(struct seq_file *seq,
2230 struct neighbour *n,
2233 struct neigh_seq_state *state = seq->private;
2234 struct net *net = seq_file_net(seq);
2235 struct neigh_table *tbl = state->tbl;
2237 if (state->neigh_sub_iter) {
2238 void *v = state->neigh_sub_iter(state, n, pos);
2246 if (!net_eq(dev_net(n->dev), net))
2248 if (state->neigh_sub_iter) {
2249 void *v = state->neigh_sub_iter(state, n, pos);
2254 if (!(state->flags & NEIGH_SEQ_SKIP_NOARP))
2257 if (n->nud_state & ~NUD_NOARP)
2266 if (++state->bucket > tbl->hash_mask)
2269 n = tbl->hash_buckets[state->bucket];
2277 static struct neighbour *neigh_get_idx(struct seq_file *seq, loff_t *pos)
2279 struct neighbour *n = neigh_get_first(seq);
2284 n = neigh_get_next(seq, n, pos);
2289 return *pos ? NULL : n;
2292 static struct pneigh_entry *pneigh_get_first(struct seq_file *seq)
2294 struct neigh_seq_state *state = seq->private;
2295 struct net *net = seq_file_net(seq);
2296 struct neigh_table *tbl = state->tbl;
2297 struct pneigh_entry *pn = NULL;
2298 int bucket = state->bucket;
2300 state->flags |= NEIGH_SEQ_IS_PNEIGH;
2301 for (bucket = 0; bucket <= PNEIGH_HASHMASK; bucket++) {
2302 pn = tbl->phash_buckets[bucket];
2303 while (pn && !net_eq(pneigh_net(pn), net))
2308 state->bucket = bucket;
2313 static struct pneigh_entry *pneigh_get_next(struct seq_file *seq,
2314 struct pneigh_entry *pn,
2317 struct neigh_seq_state *state = seq->private;
2318 struct net *net = seq_file_net(seq);
2319 struct neigh_table *tbl = state->tbl;
2323 if (++state->bucket > PNEIGH_HASHMASK)
2325 pn = tbl->phash_buckets[state->bucket];
2326 while (pn && !net_eq(pneigh_net(pn), net))
2338 static struct pneigh_entry *pneigh_get_idx(struct seq_file *seq, loff_t *pos)
2340 struct pneigh_entry *pn = pneigh_get_first(seq);
2345 pn = pneigh_get_next(seq, pn, pos);
2350 return *pos ? NULL : pn;
2353 static void *neigh_get_idx_any(struct seq_file *seq, loff_t *pos)
2355 struct neigh_seq_state *state = seq->private;
2357 loff_t idxpos = *pos;
2359 rc = neigh_get_idx(seq, &idxpos);
2360 if (!rc && !(state->flags & NEIGH_SEQ_NEIGH_ONLY))
2361 rc = pneigh_get_idx(seq, &idxpos);
2366 void *neigh_seq_start(struct seq_file *seq, loff_t *pos, struct neigh_table *tbl, unsigned int neigh_seq_flags)
2367 __acquires(tbl->lock)
2369 struct neigh_seq_state *state = seq->private;
2373 state->flags = (neigh_seq_flags & ~NEIGH_SEQ_IS_PNEIGH);
2375 read_lock_bh(&tbl->lock);
2377 return *pos ? neigh_get_idx_any(seq, pos) : SEQ_START_TOKEN;
2379 EXPORT_SYMBOL(neigh_seq_start);
2381 void *neigh_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2383 struct neigh_seq_state *state;
2386 if (v == SEQ_START_TOKEN) {
2387 rc = neigh_get_first(seq);
2391 state = seq->private;
2392 if (!(state->flags & NEIGH_SEQ_IS_PNEIGH)) {
2393 rc = neigh_get_next(seq, v, NULL);
2396 if (!(state->flags & NEIGH_SEQ_NEIGH_ONLY))
2397 rc = pneigh_get_first(seq);
2399 BUG_ON(state->flags & NEIGH_SEQ_NEIGH_ONLY);
2400 rc = pneigh_get_next(seq, v, NULL);
2406 EXPORT_SYMBOL(neigh_seq_next);
2408 void neigh_seq_stop(struct seq_file *seq, void *v)
2409 __releases(tbl->lock)
2411 struct neigh_seq_state *state = seq->private;
2412 struct neigh_table *tbl = state->tbl;
2414 read_unlock_bh(&tbl->lock);
2416 EXPORT_SYMBOL(neigh_seq_stop);
2418 /* statistics via seq_file */
2420 static void *neigh_stat_seq_start(struct seq_file *seq, loff_t *pos)
2422 struct neigh_table *tbl = seq->private;
2426 return SEQ_START_TOKEN;
2428 for (cpu = *pos-1; cpu < nr_cpu_ids; ++cpu) {
2429 if (!cpu_possible(cpu))
2432 return per_cpu_ptr(tbl->stats, cpu);
2437 static void *neigh_stat_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2439 struct neigh_table *tbl = seq->private;
2442 for (cpu = *pos; cpu < nr_cpu_ids; ++cpu) {
2443 if (!cpu_possible(cpu))
2446 return per_cpu_ptr(tbl->stats, cpu);
2451 static void neigh_stat_seq_stop(struct seq_file *seq, void *v)
2456 static int neigh_stat_seq_show(struct seq_file *seq, void *v)
2458 struct neigh_table *tbl = seq->private;
2459 struct neigh_statistics *st = v;
2461 if (v == SEQ_START_TOKEN) {
2462 seq_printf(seq, "entries allocs destroys hash_grows lookups hits res_failed rcv_probes_mcast rcv_probes_ucast periodic_gc_runs forced_gc_runs unresolved_discards\n");
2466 seq_printf(seq, "%08x %08lx %08lx %08lx %08lx %08lx %08lx "
2467 "%08lx %08lx %08lx %08lx %08lx\n",
2468 atomic_read(&tbl->entries),
2479 st->rcv_probes_mcast,
2480 st->rcv_probes_ucast,
2482 st->periodic_gc_runs,
2490 static const struct seq_operations neigh_stat_seq_ops = {
2491 .start = neigh_stat_seq_start,
2492 .next = neigh_stat_seq_next,
2493 .stop = neigh_stat_seq_stop,
2494 .show = neigh_stat_seq_show,
2497 static int neigh_stat_seq_open(struct inode *inode, struct file *file)
2499 int ret = seq_open(file, &neigh_stat_seq_ops);
2502 struct seq_file *sf = file->private_data;
2503 sf->private = PDE(inode)->data;
2508 static const struct file_operations neigh_stat_seq_fops = {
2509 .owner = THIS_MODULE,
2510 .open = neigh_stat_seq_open,
2512 .llseek = seq_lseek,
2513 .release = seq_release,
2516 #endif /* CONFIG_PROC_FS */
2518 static inline size_t neigh_nlmsg_size(void)
2520 return NLMSG_ALIGN(sizeof(struct ndmsg))
2521 + nla_total_size(MAX_ADDR_LEN) /* NDA_DST */
2522 + nla_total_size(MAX_ADDR_LEN) /* NDA_LLADDR */
2523 + nla_total_size(sizeof(struct nda_cacheinfo))
2524 + nla_total_size(4); /* NDA_PROBES */
2527 static void __neigh_notify(struct neighbour *n, int type, int flags)
2529 struct net *net = dev_net(n->dev);
2530 struct sk_buff *skb;
2533 skb = nlmsg_new(neigh_nlmsg_size(), GFP_ATOMIC);
2537 err = neigh_fill_info(skb, n, 0, 0, type, flags);
2539 /* -EMSGSIZE implies BUG in neigh_nlmsg_size() */
2540 WARN_ON(err == -EMSGSIZE);
2544 rtnl_notify(skb, net, 0, RTNLGRP_NEIGH, NULL, GFP_ATOMIC);
2548 rtnl_set_sk_err(net, RTNLGRP_NEIGH, err);
2552 void neigh_app_ns(struct neighbour *n)
2554 __neigh_notify(n, RTM_GETNEIGH, NLM_F_REQUEST);
2556 EXPORT_SYMBOL(neigh_app_ns);
2557 #endif /* CONFIG_ARPD */
2559 #ifdef CONFIG_SYSCTL
2561 #define NEIGH_VARS_MAX 19
2563 static struct neigh_sysctl_table {
2564 struct ctl_table_header *sysctl_header;
2565 struct ctl_table neigh_vars[NEIGH_VARS_MAX];
2567 } neigh_sysctl_template __read_mostly = {
2570 .procname = "mcast_solicit",
2571 .maxlen = sizeof(int),
2573 .proc_handler = proc_dointvec,
2576 .procname = "ucast_solicit",
2577 .maxlen = sizeof(int),
2579 .proc_handler = proc_dointvec,
2582 .procname = "app_solicit",
2583 .maxlen = sizeof(int),
2585 .proc_handler = proc_dointvec,
2588 .procname = "retrans_time",
2589 .maxlen = sizeof(int),
2591 .proc_handler = proc_dointvec_userhz_jiffies,
2594 .procname = "base_reachable_time",
2595 .maxlen = sizeof(int),
2597 .proc_handler = proc_dointvec_jiffies,
2600 .procname = "delay_first_probe_time",
2601 .maxlen = sizeof(int),
2603 .proc_handler = proc_dointvec_jiffies,
2606 .procname = "gc_stale_time",
2607 .maxlen = sizeof(int),
2609 .proc_handler = proc_dointvec_jiffies,
2612 .procname = "unres_qlen",
2613 .maxlen = sizeof(int),
2615 .proc_handler = proc_dointvec,
2618 .procname = "proxy_qlen",
2619 .maxlen = sizeof(int),
2621 .proc_handler = proc_dointvec,
2624 .procname = "anycast_delay",
2625 .maxlen = sizeof(int),
2627 .proc_handler = proc_dointvec_userhz_jiffies,
2630 .procname = "proxy_delay",
2631 .maxlen = sizeof(int),
2633 .proc_handler = proc_dointvec_userhz_jiffies,
2636 .procname = "locktime",
2637 .maxlen = sizeof(int),
2639 .proc_handler = proc_dointvec_userhz_jiffies,
2642 .procname = "retrans_time_ms",
2643 .maxlen = sizeof(int),
2645 .proc_handler = proc_dointvec_ms_jiffies,
2648 .procname = "base_reachable_time_ms",
2649 .maxlen = sizeof(int),
2651 .proc_handler = proc_dointvec_ms_jiffies,
2654 .procname = "gc_interval",
2655 .maxlen = sizeof(int),
2657 .proc_handler = proc_dointvec_jiffies,
2660 .procname = "gc_thresh1",
2661 .maxlen = sizeof(int),
2663 .proc_handler = proc_dointvec,
2666 .procname = "gc_thresh2",
2667 .maxlen = sizeof(int),
2669 .proc_handler = proc_dointvec,
2672 .procname = "gc_thresh3",
2673 .maxlen = sizeof(int),
2675 .proc_handler = proc_dointvec,
2681 int neigh_sysctl_register(struct net_device *dev, struct neigh_parms *p,
2682 char *p_name, proc_handler *handler)
2684 struct neigh_sysctl_table *t;
2685 const char *dev_name_source = NULL;
2687 #define NEIGH_CTL_PATH_ROOT 0
2688 #define NEIGH_CTL_PATH_PROTO 1
2689 #define NEIGH_CTL_PATH_NEIGH 2
2690 #define NEIGH_CTL_PATH_DEV 3
2692 struct ctl_path neigh_path[] = {
2693 { .procname = "net", },
2694 { .procname = "proto", },
2695 { .procname = "neigh", },
2696 { .procname = "default", },
2700 t = kmemdup(&neigh_sysctl_template, sizeof(*t), GFP_KERNEL);
2704 t->neigh_vars[0].data = &p->mcast_probes;
2705 t->neigh_vars[1].data = &p->ucast_probes;
2706 t->neigh_vars[2].data = &p->app_probes;
2707 t->neigh_vars[3].data = &p->retrans_time;
2708 t->neigh_vars[4].data = &p->base_reachable_time;
2709 t->neigh_vars[5].data = &p->delay_probe_time;
2710 t->neigh_vars[6].data = &p->gc_staletime;
2711 t->neigh_vars[7].data = &p->queue_len;
2712 t->neigh_vars[8].data = &p->proxy_qlen;
2713 t->neigh_vars[9].data = &p->anycast_delay;
2714 t->neigh_vars[10].data = &p->proxy_delay;
2715 t->neigh_vars[11].data = &p->locktime;
2716 t->neigh_vars[12].data = &p->retrans_time;
2717 t->neigh_vars[13].data = &p->base_reachable_time;
2720 dev_name_source = dev->name;
2721 /* Terminate the table early */
2722 memset(&t->neigh_vars[14], 0, sizeof(t->neigh_vars[14]));
2724 dev_name_source = neigh_path[NEIGH_CTL_PATH_DEV].procname;
2725 t->neigh_vars[14].data = (int *)(p + 1);
2726 t->neigh_vars[15].data = (int *)(p + 1) + 1;
2727 t->neigh_vars[16].data = (int *)(p + 1) + 2;
2728 t->neigh_vars[17].data = (int *)(p + 1) + 3;
2734 t->neigh_vars[3].proc_handler = handler;
2735 t->neigh_vars[3].extra1 = dev;
2737 t->neigh_vars[4].proc_handler = handler;
2738 t->neigh_vars[4].extra1 = dev;
2739 /* RetransTime (in milliseconds)*/
2740 t->neigh_vars[12].proc_handler = handler;
2741 t->neigh_vars[12].extra1 = dev;
2742 /* ReachableTime (in milliseconds) */
2743 t->neigh_vars[13].proc_handler = handler;
2744 t->neigh_vars[13].extra1 = dev;
2747 t->dev_name = kstrdup(dev_name_source, GFP_KERNEL);
2751 neigh_path[NEIGH_CTL_PATH_DEV].procname = t->dev_name;
2752 neigh_path[NEIGH_CTL_PATH_PROTO].procname = p_name;
2755 register_net_sysctl_table(neigh_parms_net(p), neigh_path, t->neigh_vars);
2756 if (!t->sysctl_header)
2759 p->sysctl_table = t;
2769 EXPORT_SYMBOL(neigh_sysctl_register);
2771 void neigh_sysctl_unregister(struct neigh_parms *p)
2773 if (p->sysctl_table) {
2774 struct neigh_sysctl_table *t = p->sysctl_table;
2775 p->sysctl_table = NULL;
2776 unregister_sysctl_table(t->sysctl_header);
2781 EXPORT_SYMBOL(neigh_sysctl_unregister);
2783 #endif /* CONFIG_SYSCTL */
2785 static int __init neigh_init(void)
2787 rtnl_register(PF_UNSPEC, RTM_NEWNEIGH, neigh_add, NULL);
2788 rtnl_register(PF_UNSPEC, RTM_DELNEIGH, neigh_delete, NULL);
2789 rtnl_register(PF_UNSPEC, RTM_GETNEIGH, NULL, neigh_dump_info);
2791 rtnl_register(PF_UNSPEC, RTM_GETNEIGHTBL, NULL, neightbl_dump_info);
2792 rtnl_register(PF_UNSPEC, RTM_SETNEIGHTBL, neightbl_set, NULL);
2797 subsys_initcall(neigh_init);