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 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
20 #include <linux/slab.h>
21 #include <linux/types.h>
22 #include <linux/kernel.h>
23 #include <linux/module.h>
24 #include <linux/socket.h>
25 #include <linux/netdevice.h>
26 #include <linux/proc_fs.h>
28 #include <linux/sysctl.h>
30 #include <linux/times.h>
31 #include <net/net_namespace.h>
32 #include <net/neighbour.h>
35 #include <net/netevent.h>
36 #include <net/netlink.h>
37 #include <linux/rtnetlink.h>
38 #include <linux/random.h>
39 #include <linux/string.h>
40 #include <linux/log2.h>
44 #define neigh_dbg(level, fmt, ...) \
46 if (level <= NEIGH_DEBUG) \
47 pr_debug(fmt, ##__VA_ARGS__); \
50 #define PNEIGH_HASHMASK 0xF
52 static void neigh_timer_handler(unsigned long arg);
53 static void __neigh_notify(struct neighbour *n, int type, int flags);
54 static void neigh_update_notify(struct neighbour *neigh);
55 static int pneigh_ifdown(struct neigh_table *tbl, struct net_device *dev);
57 static struct neigh_table *neigh_tables;
59 static const struct file_operations neigh_stat_seq_fops;
63 Neighbour hash table buckets are protected with rwlock tbl->lock.
65 - All the scans/updates to hash buckets MUST be made under this lock.
66 - NOTHING clever should be made under this lock: no callbacks
67 to protocol backends, no attempts to send something to network.
68 It will result in deadlocks, if backend/driver wants to use neighbour
70 - If the entry requires some non-trivial actions, increase
71 its reference count and release table lock.
73 Neighbour entries are protected:
74 - with reference count.
75 - with rwlock neigh->lock
77 Reference count prevents destruction.
79 neigh->lock mainly serializes ll address data and its validity state.
80 However, the same lock is used to protect another entry fields:
84 Again, nothing clever shall be made under neigh->lock,
85 the most complicated procedure, which we allow is dev->hard_header.
86 It is supposed, that dev->hard_header is simplistic and does
87 not make callbacks to neighbour tables.
89 The last lock is neigh_tbl_lock. It is pure SMP lock, protecting
90 list of neighbour tables. This list is used only in process context,
93 static DEFINE_RWLOCK(neigh_tbl_lock);
95 static int neigh_blackhole(struct neighbour *neigh, struct sk_buff *skb)
101 static void neigh_cleanup_and_release(struct neighbour *neigh)
103 if (neigh->parms->neigh_cleanup)
104 neigh->parms->neigh_cleanup(neigh);
106 __neigh_notify(neigh, RTM_DELNEIGH, 0);
107 neigh_release(neigh);
111 * It is random distribution in the interval (1/2)*base...(3/2)*base.
112 * It corresponds to default IPv6 settings and is not overridable,
113 * because it is really reasonable choice.
116 unsigned long neigh_rand_reach_time(unsigned long base)
118 return base ? (net_random() % base) + (base >> 1) : 0;
120 EXPORT_SYMBOL(neigh_rand_reach_time);
123 static int neigh_forced_gc(struct neigh_table *tbl)
127 struct neigh_hash_table *nht;
129 NEIGH_CACHE_STAT_INC(tbl, forced_gc_runs);
131 write_lock_bh(&tbl->lock);
132 nht = rcu_dereference_protected(tbl->nht,
133 lockdep_is_held(&tbl->lock));
134 for (i = 0; i < (1 << nht->hash_shift); i++) {
136 struct neighbour __rcu **np;
138 np = &nht->hash_buckets[i];
139 while ((n = rcu_dereference_protected(*np,
140 lockdep_is_held(&tbl->lock))) != NULL) {
141 /* Neighbour record may be discarded if:
142 * - nobody refers to it.
143 * - it is not permanent
145 write_lock(&n->lock);
146 if (atomic_read(&n->refcnt) == 1 &&
147 !(n->nud_state & NUD_PERMANENT)) {
148 rcu_assign_pointer(*np,
149 rcu_dereference_protected(n->next,
150 lockdep_is_held(&tbl->lock)));
153 write_unlock(&n->lock);
154 neigh_cleanup_and_release(n);
157 write_unlock(&n->lock);
162 tbl->last_flush = jiffies;
164 write_unlock_bh(&tbl->lock);
169 static void neigh_add_timer(struct neighbour *n, unsigned long when)
172 if (unlikely(mod_timer(&n->timer, when))) {
173 printk("NEIGH: BUG, double timer add, state is %x\n",
179 static int neigh_del_timer(struct neighbour *n)
181 if ((n->nud_state & NUD_IN_TIMER) &&
182 del_timer(&n->timer)) {
189 static void pneigh_queue_purge(struct sk_buff_head *list)
193 while ((skb = skb_dequeue(list)) != NULL) {
199 static void neigh_flush_dev(struct neigh_table *tbl, struct net_device *dev)
202 struct neigh_hash_table *nht;
204 nht = rcu_dereference_protected(tbl->nht,
205 lockdep_is_held(&tbl->lock));
207 for (i = 0; i < (1 << nht->hash_shift); i++) {
209 struct neighbour __rcu **np = &nht->hash_buckets[i];
211 while ((n = rcu_dereference_protected(*np,
212 lockdep_is_held(&tbl->lock))) != NULL) {
213 if (dev && n->dev != dev) {
217 rcu_assign_pointer(*np,
218 rcu_dereference_protected(n->next,
219 lockdep_is_held(&tbl->lock)));
220 write_lock(&n->lock);
224 if (atomic_read(&n->refcnt) != 1) {
225 /* The most unpleasant situation.
226 We must destroy neighbour entry,
227 but someone still uses it.
229 The destroy will be delayed until
230 the last user releases us, but
231 we must kill timers etc. and move
234 __skb_queue_purge(&n->arp_queue);
235 n->arp_queue_len_bytes = 0;
236 n->output = neigh_blackhole;
237 if (n->nud_state & NUD_VALID)
238 n->nud_state = NUD_NOARP;
240 n->nud_state = NUD_NONE;
241 neigh_dbg(2, "neigh %p is stray\n", n);
243 write_unlock(&n->lock);
244 neigh_cleanup_and_release(n);
249 void neigh_changeaddr(struct neigh_table *tbl, struct net_device *dev)
251 write_lock_bh(&tbl->lock);
252 neigh_flush_dev(tbl, dev);
253 write_unlock_bh(&tbl->lock);
255 EXPORT_SYMBOL(neigh_changeaddr);
257 int neigh_ifdown(struct neigh_table *tbl, struct net_device *dev)
259 write_lock_bh(&tbl->lock);
260 neigh_flush_dev(tbl, dev);
261 pneigh_ifdown(tbl, dev);
262 write_unlock_bh(&tbl->lock);
264 del_timer_sync(&tbl->proxy_timer);
265 pneigh_queue_purge(&tbl->proxy_queue);
268 EXPORT_SYMBOL(neigh_ifdown);
270 static struct neighbour *neigh_alloc(struct neigh_table *tbl, struct net_device *dev)
272 struct neighbour *n = NULL;
273 unsigned long now = jiffies;
276 entries = atomic_inc_return(&tbl->entries) - 1;
277 if (entries >= tbl->gc_thresh3 ||
278 (entries >= tbl->gc_thresh2 &&
279 time_after(now, tbl->last_flush + 5 * HZ))) {
280 if (!neigh_forced_gc(tbl) &&
281 entries >= tbl->gc_thresh3)
285 n = kzalloc(tbl->entry_size + dev->neigh_priv_len, GFP_ATOMIC);
289 __skb_queue_head_init(&n->arp_queue);
290 rwlock_init(&n->lock);
291 seqlock_init(&n->ha_lock);
292 n->updated = n->used = now;
293 n->nud_state = NUD_NONE;
294 n->output = neigh_blackhole;
295 seqlock_init(&n->hh.hh_lock);
296 n->parms = neigh_parms_clone(&tbl->parms);
297 setup_timer(&n->timer, neigh_timer_handler, (unsigned long)n);
299 NEIGH_CACHE_STAT_INC(tbl, allocs);
301 atomic_set(&n->refcnt, 1);
307 atomic_dec(&tbl->entries);
311 static void neigh_get_hash_rnd(u32 *x)
313 get_random_bytes(x, sizeof(*x));
317 static struct neigh_hash_table *neigh_hash_alloc(unsigned int shift)
319 size_t size = (1 << shift) * sizeof(struct neighbour *);
320 struct neigh_hash_table *ret;
321 struct neighbour __rcu **buckets;
324 ret = kmalloc(sizeof(*ret), GFP_ATOMIC);
327 if (size <= PAGE_SIZE)
328 buckets = kzalloc(size, GFP_ATOMIC);
330 buckets = (struct neighbour __rcu **)
331 __get_free_pages(GFP_ATOMIC | __GFP_ZERO,
337 ret->hash_buckets = buckets;
338 ret->hash_shift = shift;
339 for (i = 0; i < NEIGH_NUM_HASH_RND; i++)
340 neigh_get_hash_rnd(&ret->hash_rnd[i]);
344 static void neigh_hash_free_rcu(struct rcu_head *head)
346 struct neigh_hash_table *nht = container_of(head,
347 struct neigh_hash_table,
349 size_t size = (1 << nht->hash_shift) * sizeof(struct neighbour *);
350 struct neighbour __rcu **buckets = nht->hash_buckets;
352 if (size <= PAGE_SIZE)
355 free_pages((unsigned long)buckets, get_order(size));
359 static struct neigh_hash_table *neigh_hash_grow(struct neigh_table *tbl,
360 unsigned long new_shift)
362 unsigned int i, hash;
363 struct neigh_hash_table *new_nht, *old_nht;
365 NEIGH_CACHE_STAT_INC(tbl, hash_grows);
367 old_nht = rcu_dereference_protected(tbl->nht,
368 lockdep_is_held(&tbl->lock));
369 new_nht = neigh_hash_alloc(new_shift);
373 for (i = 0; i < (1 << old_nht->hash_shift); i++) {
374 struct neighbour *n, *next;
376 for (n = rcu_dereference_protected(old_nht->hash_buckets[i],
377 lockdep_is_held(&tbl->lock));
380 hash = tbl->hash(n->primary_key, n->dev,
383 hash >>= (32 - new_nht->hash_shift);
384 next = rcu_dereference_protected(n->next,
385 lockdep_is_held(&tbl->lock));
387 rcu_assign_pointer(n->next,
388 rcu_dereference_protected(
389 new_nht->hash_buckets[hash],
390 lockdep_is_held(&tbl->lock)));
391 rcu_assign_pointer(new_nht->hash_buckets[hash], n);
395 rcu_assign_pointer(tbl->nht, new_nht);
396 call_rcu(&old_nht->rcu, neigh_hash_free_rcu);
400 struct neighbour *neigh_lookup(struct neigh_table *tbl, const void *pkey,
401 struct net_device *dev)
404 int key_len = tbl->key_len;
406 struct neigh_hash_table *nht;
408 NEIGH_CACHE_STAT_INC(tbl, lookups);
411 nht = rcu_dereference_bh(tbl->nht);
412 hash_val = tbl->hash(pkey, dev, nht->hash_rnd) >> (32 - nht->hash_shift);
414 for (n = rcu_dereference_bh(nht->hash_buckets[hash_val]);
416 n = rcu_dereference_bh(n->next)) {
417 if (dev == n->dev && !memcmp(n->primary_key, pkey, key_len)) {
418 if (!atomic_inc_not_zero(&n->refcnt))
420 NEIGH_CACHE_STAT_INC(tbl, hits);
425 rcu_read_unlock_bh();
428 EXPORT_SYMBOL(neigh_lookup);
430 struct neighbour *neigh_lookup_nodev(struct neigh_table *tbl, struct net *net,
434 int key_len = tbl->key_len;
436 struct neigh_hash_table *nht;
438 NEIGH_CACHE_STAT_INC(tbl, lookups);
441 nht = rcu_dereference_bh(tbl->nht);
442 hash_val = tbl->hash(pkey, NULL, nht->hash_rnd) >> (32 - nht->hash_shift);
444 for (n = rcu_dereference_bh(nht->hash_buckets[hash_val]);
446 n = rcu_dereference_bh(n->next)) {
447 if (!memcmp(n->primary_key, pkey, key_len) &&
448 net_eq(dev_net(n->dev), net)) {
449 if (!atomic_inc_not_zero(&n->refcnt))
451 NEIGH_CACHE_STAT_INC(tbl, hits);
456 rcu_read_unlock_bh();
459 EXPORT_SYMBOL(neigh_lookup_nodev);
461 struct neighbour *__neigh_create(struct neigh_table *tbl, const void *pkey,
462 struct net_device *dev, bool want_ref)
465 int key_len = tbl->key_len;
467 struct neighbour *n1, *rc, *n = neigh_alloc(tbl, dev);
468 struct neigh_hash_table *nht;
471 rc = ERR_PTR(-ENOBUFS);
475 memcpy(n->primary_key, pkey, key_len);
479 /* Protocol specific setup. */
480 if (tbl->constructor && (error = tbl->constructor(n)) < 0) {
482 goto out_neigh_release;
485 if (dev->netdev_ops->ndo_neigh_construct) {
486 error = dev->netdev_ops->ndo_neigh_construct(n);
489 goto out_neigh_release;
493 /* Device specific setup. */
494 if (n->parms->neigh_setup &&
495 (error = n->parms->neigh_setup(n)) < 0) {
497 goto out_neigh_release;
500 n->confirmed = jiffies - (n->parms->base_reachable_time << 1);
502 write_lock_bh(&tbl->lock);
503 nht = rcu_dereference_protected(tbl->nht,
504 lockdep_is_held(&tbl->lock));
506 if (atomic_read(&tbl->entries) > (1 << nht->hash_shift))
507 nht = neigh_hash_grow(tbl, nht->hash_shift + 1);
509 hash_val = tbl->hash(pkey, dev, nht->hash_rnd) >> (32 - nht->hash_shift);
511 if (n->parms->dead) {
512 rc = ERR_PTR(-EINVAL);
516 for (n1 = rcu_dereference_protected(nht->hash_buckets[hash_val],
517 lockdep_is_held(&tbl->lock));
519 n1 = rcu_dereference_protected(n1->next,
520 lockdep_is_held(&tbl->lock))) {
521 if (dev == n1->dev && !memcmp(n1->primary_key, pkey, key_len)) {
532 rcu_assign_pointer(n->next,
533 rcu_dereference_protected(nht->hash_buckets[hash_val],
534 lockdep_is_held(&tbl->lock)));
535 rcu_assign_pointer(nht->hash_buckets[hash_val], n);
536 write_unlock_bh(&tbl->lock);
537 neigh_dbg(2, "neigh %p is created\n", n);
542 write_unlock_bh(&tbl->lock);
547 EXPORT_SYMBOL(__neigh_create);
549 static u32 pneigh_hash(const void *pkey, int key_len)
551 u32 hash_val = *(u32 *)(pkey + key_len - 4);
552 hash_val ^= (hash_val >> 16);
553 hash_val ^= hash_val >> 8;
554 hash_val ^= hash_val >> 4;
555 hash_val &= PNEIGH_HASHMASK;
559 static struct pneigh_entry *__pneigh_lookup_1(struct pneigh_entry *n,
563 struct net_device *dev)
566 if (!memcmp(n->key, pkey, key_len) &&
567 net_eq(pneigh_net(n), net) &&
568 (n->dev == dev || !n->dev))
575 struct pneigh_entry *__pneigh_lookup(struct neigh_table *tbl,
576 struct net *net, const void *pkey, struct net_device *dev)
578 int key_len = tbl->key_len;
579 u32 hash_val = pneigh_hash(pkey, key_len);
581 return __pneigh_lookup_1(tbl->phash_buckets[hash_val],
582 net, pkey, key_len, dev);
584 EXPORT_SYMBOL_GPL(__pneigh_lookup);
586 struct pneigh_entry * pneigh_lookup(struct neigh_table *tbl,
587 struct net *net, const void *pkey,
588 struct net_device *dev, int creat)
590 struct pneigh_entry *n;
591 int key_len = tbl->key_len;
592 u32 hash_val = pneigh_hash(pkey, key_len);
594 read_lock_bh(&tbl->lock);
595 n = __pneigh_lookup_1(tbl->phash_buckets[hash_val],
596 net, pkey, key_len, dev);
597 read_unlock_bh(&tbl->lock);
604 n = kmalloc(sizeof(*n) + key_len, GFP_KERNEL);
608 write_pnet(&n->net, hold_net(net));
609 memcpy(n->key, pkey, key_len);
614 if (tbl->pconstructor && tbl->pconstructor(n)) {
623 write_lock_bh(&tbl->lock);
624 n->next = tbl->phash_buckets[hash_val];
625 tbl->phash_buckets[hash_val] = n;
626 write_unlock_bh(&tbl->lock);
630 EXPORT_SYMBOL(pneigh_lookup);
633 int pneigh_delete(struct neigh_table *tbl, struct net *net, const void *pkey,
634 struct net_device *dev)
636 struct pneigh_entry *n, **np;
637 int key_len = tbl->key_len;
638 u32 hash_val = pneigh_hash(pkey, key_len);
640 write_lock_bh(&tbl->lock);
641 for (np = &tbl->phash_buckets[hash_val]; (n = *np) != NULL;
643 if (!memcmp(n->key, pkey, key_len) && n->dev == dev &&
644 net_eq(pneigh_net(n), net)) {
646 write_unlock_bh(&tbl->lock);
647 if (tbl->pdestructor)
651 release_net(pneigh_net(n));
656 write_unlock_bh(&tbl->lock);
660 static int pneigh_ifdown(struct neigh_table *tbl, struct net_device *dev)
662 struct pneigh_entry *n, **np;
665 for (h = 0; h <= PNEIGH_HASHMASK; h++) {
666 np = &tbl->phash_buckets[h];
667 while ((n = *np) != NULL) {
668 if (!dev || n->dev == dev) {
670 if (tbl->pdestructor)
674 release_net(pneigh_net(n));
684 static void neigh_parms_destroy(struct neigh_parms *parms);
686 static inline void neigh_parms_put(struct neigh_parms *parms)
688 if (atomic_dec_and_test(&parms->refcnt))
689 neigh_parms_destroy(parms);
693 * neighbour must already be out of the table;
696 void neigh_destroy(struct neighbour *neigh)
698 struct net_device *dev = neigh->dev;
700 NEIGH_CACHE_STAT_INC(neigh->tbl, destroys);
703 pr_warn("Destroying alive neighbour %p\n", neigh);
708 if (neigh_del_timer(neigh))
709 pr_warn("Impossible event\n");
711 write_lock_bh(&neigh->lock);
712 __skb_queue_purge(&neigh->arp_queue);
713 write_unlock_bh(&neigh->lock);
714 neigh->arp_queue_len_bytes = 0;
716 if (dev->netdev_ops->ndo_neigh_destroy)
717 dev->netdev_ops->ndo_neigh_destroy(neigh);
720 neigh_parms_put(neigh->parms);
722 neigh_dbg(2, "neigh %p is destroyed\n", neigh);
724 atomic_dec(&neigh->tbl->entries);
725 kfree_rcu(neigh, rcu);
727 EXPORT_SYMBOL(neigh_destroy);
729 /* Neighbour state is suspicious;
732 Called with write_locked neigh.
734 static void neigh_suspect(struct neighbour *neigh)
736 neigh_dbg(2, "neigh %p is suspected\n", neigh);
738 neigh->output = neigh->ops->output;
741 /* Neighbour state is OK;
744 Called with write_locked neigh.
746 static void neigh_connect(struct neighbour *neigh)
748 neigh_dbg(2, "neigh %p is connected\n", neigh);
750 neigh->output = neigh->ops->connected_output;
753 static void neigh_periodic_work(struct work_struct *work)
755 struct neigh_table *tbl = container_of(work, struct neigh_table, gc_work.work);
757 struct neighbour __rcu **np;
759 struct neigh_hash_table *nht;
761 NEIGH_CACHE_STAT_INC(tbl, periodic_gc_runs);
763 write_lock_bh(&tbl->lock);
764 nht = rcu_dereference_protected(tbl->nht,
765 lockdep_is_held(&tbl->lock));
768 * periodically recompute ReachableTime from random function
771 if (time_after(jiffies, tbl->last_rand + 300 * HZ)) {
772 struct neigh_parms *p;
773 tbl->last_rand = jiffies;
774 for (p = &tbl->parms; p; p = p->next)
776 neigh_rand_reach_time(p->base_reachable_time);
779 if (atomic_read(&tbl->entries) < tbl->gc_thresh1)
782 for (i = 0 ; i < (1 << nht->hash_shift); i++) {
783 np = &nht->hash_buckets[i];
785 while ((n = rcu_dereference_protected(*np,
786 lockdep_is_held(&tbl->lock))) != NULL) {
789 write_lock(&n->lock);
791 state = n->nud_state;
792 if (state & (NUD_PERMANENT | NUD_IN_TIMER)) {
793 write_unlock(&n->lock);
797 if (time_before(n->used, n->confirmed))
798 n->used = n->confirmed;
800 if (atomic_read(&n->refcnt) == 1 &&
801 (state == NUD_FAILED ||
802 time_after(jiffies, n->used + n->parms->gc_staletime))) {
805 write_unlock(&n->lock);
806 neigh_cleanup_and_release(n);
809 write_unlock(&n->lock);
815 * It's fine to release lock here, even if hash table
816 * grows while we are preempted.
818 write_unlock_bh(&tbl->lock);
820 write_lock_bh(&tbl->lock);
821 nht = rcu_dereference_protected(tbl->nht,
822 lockdep_is_held(&tbl->lock));
825 /* Cycle through all hash buckets every base_reachable_time/2 ticks.
826 * ARP entry timeouts range from 1/2 base_reachable_time to 3/2
827 * base_reachable_time.
829 schedule_delayed_work(&tbl->gc_work,
830 tbl->parms.base_reachable_time >> 1);
831 write_unlock_bh(&tbl->lock);
834 static __inline__ int neigh_max_probes(struct neighbour *n)
836 struct neigh_parms *p = n->parms;
837 return (n->nud_state & NUD_PROBE) ?
839 p->ucast_probes + p->app_probes + p->mcast_probes;
842 static void neigh_invalidate(struct neighbour *neigh)
843 __releases(neigh->lock)
844 __acquires(neigh->lock)
848 NEIGH_CACHE_STAT_INC(neigh->tbl, res_failed);
849 neigh_dbg(2, "neigh %p is failed\n", neigh);
850 neigh->updated = jiffies;
852 /* It is very thin place. report_unreachable is very complicated
853 routine. Particularly, it can hit the same neighbour entry!
855 So that, we try to be accurate and avoid dead loop. --ANK
857 while (neigh->nud_state == NUD_FAILED &&
858 (skb = __skb_dequeue(&neigh->arp_queue)) != NULL) {
859 write_unlock(&neigh->lock);
860 neigh->ops->error_report(neigh, skb);
861 write_lock(&neigh->lock);
863 __skb_queue_purge(&neigh->arp_queue);
864 neigh->arp_queue_len_bytes = 0;
867 static void neigh_probe(struct neighbour *neigh)
868 __releases(neigh->lock)
870 struct sk_buff *skb = skb_peek(&neigh->arp_queue);
871 /* keep skb alive even if arp_queue overflows */
873 skb = skb_copy(skb, GFP_ATOMIC);
874 write_unlock(&neigh->lock);
875 neigh->ops->solicit(neigh, skb);
876 atomic_inc(&neigh->probes);
880 /* Called when a timer expires for a neighbour entry. */
882 static void neigh_timer_handler(unsigned long arg)
884 unsigned long now, next;
885 struct neighbour *neigh = (struct neighbour *)arg;
889 write_lock(&neigh->lock);
891 state = neigh->nud_state;
895 if (!(state & NUD_IN_TIMER))
898 if (state & NUD_REACHABLE) {
899 if (time_before_eq(now,
900 neigh->confirmed + neigh->parms->reachable_time)) {
901 neigh_dbg(2, "neigh %p is still alive\n", neigh);
902 next = neigh->confirmed + neigh->parms->reachable_time;
903 } else if (time_before_eq(now,
904 neigh->used + neigh->parms->delay_probe_time)) {
905 neigh_dbg(2, "neigh %p is delayed\n", neigh);
906 neigh->nud_state = NUD_DELAY;
907 neigh->updated = jiffies;
908 neigh_suspect(neigh);
909 next = now + neigh->parms->delay_probe_time;
911 neigh_dbg(2, "neigh %p is suspected\n", neigh);
912 neigh->nud_state = NUD_STALE;
913 neigh->updated = jiffies;
914 neigh_suspect(neigh);
917 } else if (state & NUD_DELAY) {
918 if (time_before_eq(now,
919 neigh->confirmed + neigh->parms->delay_probe_time)) {
920 neigh_dbg(2, "neigh %p is now reachable\n", neigh);
921 neigh->nud_state = NUD_REACHABLE;
922 neigh->updated = jiffies;
923 neigh_connect(neigh);
925 next = neigh->confirmed + neigh->parms->reachable_time;
927 neigh_dbg(2, "neigh %p is probed\n", neigh);
928 neigh->nud_state = NUD_PROBE;
929 neigh->updated = jiffies;
930 atomic_set(&neigh->probes, 0);
931 next = now + neigh->parms->retrans_time;
934 /* NUD_PROBE|NUD_INCOMPLETE */
935 next = now + neigh->parms->retrans_time;
938 if ((neigh->nud_state & (NUD_INCOMPLETE | NUD_PROBE)) &&
939 atomic_read(&neigh->probes) >= neigh_max_probes(neigh)) {
940 neigh->nud_state = NUD_FAILED;
942 neigh_invalidate(neigh);
945 if (neigh->nud_state & NUD_IN_TIMER) {
946 if (time_before(next, jiffies + HZ/2))
947 next = jiffies + HZ/2;
948 if (!mod_timer(&neigh->timer, next))
951 if (neigh->nud_state & (NUD_INCOMPLETE | NUD_PROBE)) {
955 write_unlock(&neigh->lock);
959 neigh_update_notify(neigh);
961 neigh_release(neigh);
964 int __neigh_event_send(struct neighbour *neigh, struct sk_buff *skb)
967 bool immediate_probe = false;
969 write_lock_bh(&neigh->lock);
972 if (neigh->nud_state & (NUD_CONNECTED | NUD_DELAY | NUD_PROBE))
975 if (!(neigh->nud_state & (NUD_STALE | NUD_INCOMPLETE))) {
976 if (neigh->parms->mcast_probes + neigh->parms->app_probes) {
977 unsigned long next, now = jiffies;
979 atomic_set(&neigh->probes, neigh->parms->ucast_probes);
980 neigh->nud_state = NUD_INCOMPLETE;
981 neigh->updated = now;
982 next = now + max(neigh->parms->retrans_time, HZ/2);
983 neigh_add_timer(neigh, next);
984 immediate_probe = true;
986 neigh->nud_state = NUD_FAILED;
987 neigh->updated = jiffies;
988 write_unlock_bh(&neigh->lock);
993 } else if (neigh->nud_state & NUD_STALE) {
994 neigh_dbg(2, "neigh %p is delayed\n", neigh);
995 neigh->nud_state = NUD_DELAY;
996 neigh->updated = jiffies;
997 neigh_add_timer(neigh,
998 jiffies + neigh->parms->delay_probe_time);
1001 if (neigh->nud_state == NUD_INCOMPLETE) {
1003 while (neigh->arp_queue_len_bytes + skb->truesize >
1004 neigh->parms->queue_len_bytes) {
1005 struct sk_buff *buff;
1007 buff = __skb_dequeue(&neigh->arp_queue);
1010 neigh->arp_queue_len_bytes -= buff->truesize;
1012 NEIGH_CACHE_STAT_INC(neigh->tbl, unres_discards);
1015 __skb_queue_tail(&neigh->arp_queue, skb);
1016 neigh->arp_queue_len_bytes += skb->truesize;
1021 if (immediate_probe)
1024 write_unlock(&neigh->lock);
1028 EXPORT_SYMBOL(__neigh_event_send);
1030 static void neigh_update_hhs(struct neighbour *neigh)
1032 struct hh_cache *hh;
1033 void (*update)(struct hh_cache*, const struct net_device*, const unsigned char *)
1036 if (neigh->dev->header_ops)
1037 update = neigh->dev->header_ops->cache_update;
1042 write_seqlock_bh(&hh->hh_lock);
1043 update(hh, neigh->dev, neigh->ha);
1044 write_sequnlock_bh(&hh->hh_lock);
1051 /* Generic update routine.
1052 -- lladdr is new lladdr or NULL, if it is not supplied.
1053 -- new is new state.
1055 NEIGH_UPDATE_F_OVERRIDE allows to override existing lladdr,
1057 NEIGH_UPDATE_F_WEAK_OVERRIDE will suspect existing "connected"
1058 lladdr instead of overriding it
1060 It also allows to retain current state
1061 if lladdr is unchanged.
1062 NEIGH_UPDATE_F_ADMIN means that the change is administrative.
1064 NEIGH_UPDATE_F_OVERRIDE_ISROUTER allows to override existing
1066 NEIGH_UPDATE_F_ISROUTER indicates if the neighbour is known as
1069 Caller MUST hold reference count on the entry.
1072 int neigh_update(struct neighbour *neigh, const u8 *lladdr, u8 new,
1078 struct net_device *dev;
1079 int update_isrouter = 0;
1081 write_lock_bh(&neigh->lock);
1084 old = neigh->nud_state;
1087 if (!(flags & NEIGH_UPDATE_F_ADMIN) &&
1088 (old & (NUD_NOARP | NUD_PERMANENT)))
1091 if (!(new & NUD_VALID)) {
1092 neigh_del_timer(neigh);
1093 if (old & NUD_CONNECTED)
1094 neigh_suspect(neigh);
1095 neigh->nud_state = new;
1097 notify = old & NUD_VALID;
1098 if ((old & (NUD_INCOMPLETE | NUD_PROBE)) &&
1099 (new & NUD_FAILED)) {
1100 neigh_invalidate(neigh);
1106 /* Compare new lladdr with cached one */
1107 if (!dev->addr_len) {
1108 /* First case: device needs no address. */
1110 } else if (lladdr) {
1111 /* The second case: if something is already cached
1112 and a new address is proposed:
1114 - if they are different, check override flag
1116 if ((old & NUD_VALID) &&
1117 !memcmp(lladdr, neigh->ha, dev->addr_len))
1120 /* No address is supplied; if we know something,
1121 use it, otherwise discard the request.
1124 if (!(old & NUD_VALID))
1129 if (new & NUD_CONNECTED)
1130 neigh->confirmed = jiffies;
1131 neigh->updated = jiffies;
1133 /* If entry was valid and address is not changed,
1134 do not change entry state, if new one is STALE.
1137 update_isrouter = flags & NEIGH_UPDATE_F_OVERRIDE_ISROUTER;
1138 if (old & NUD_VALID) {
1139 if (lladdr != neigh->ha && !(flags & NEIGH_UPDATE_F_OVERRIDE)) {
1140 update_isrouter = 0;
1141 if ((flags & NEIGH_UPDATE_F_WEAK_OVERRIDE) &&
1142 (old & NUD_CONNECTED)) {
1148 if (lladdr == neigh->ha && new == NUD_STALE &&
1149 ((flags & NEIGH_UPDATE_F_WEAK_OVERRIDE) ||
1150 (old & NUD_CONNECTED))
1157 neigh_del_timer(neigh);
1158 if (new & NUD_IN_TIMER)
1159 neigh_add_timer(neigh, (jiffies +
1160 ((new & NUD_REACHABLE) ?
1161 neigh->parms->reachable_time :
1163 neigh->nud_state = new;
1166 if (lladdr != neigh->ha) {
1167 write_seqlock(&neigh->ha_lock);
1168 memcpy(&neigh->ha, lladdr, dev->addr_len);
1169 write_sequnlock(&neigh->ha_lock);
1170 neigh_update_hhs(neigh);
1171 if (!(new & NUD_CONNECTED))
1172 neigh->confirmed = jiffies -
1173 (neigh->parms->base_reachable_time << 1);
1178 if (new & NUD_CONNECTED)
1179 neigh_connect(neigh);
1181 neigh_suspect(neigh);
1182 if (!(old & NUD_VALID)) {
1183 struct sk_buff *skb;
1185 /* Again: avoid dead loop if something went wrong */
1187 while (neigh->nud_state & NUD_VALID &&
1188 (skb = __skb_dequeue(&neigh->arp_queue)) != NULL) {
1189 struct dst_entry *dst = skb_dst(skb);
1190 struct neighbour *n2, *n1 = neigh;
1191 write_unlock_bh(&neigh->lock);
1195 /* Why not just use 'neigh' as-is? The problem is that
1196 * things such as shaper, eql, and sch_teql can end up
1197 * using alternative, different, neigh objects to output
1198 * the packet in the output path. So what we need to do
1199 * here is re-lookup the top-level neigh in the path so
1200 * we can reinject the packet there.
1204 n2 = dst_neigh_lookup_skb(dst, skb);
1208 n1->output(n1, skb);
1213 write_lock_bh(&neigh->lock);
1215 __skb_queue_purge(&neigh->arp_queue);
1216 neigh->arp_queue_len_bytes = 0;
1219 if (update_isrouter) {
1220 neigh->flags = (flags & NEIGH_UPDATE_F_ISROUTER) ?
1221 (neigh->flags | NTF_ROUTER) :
1222 (neigh->flags & ~NTF_ROUTER);
1224 write_unlock_bh(&neigh->lock);
1227 neigh_update_notify(neigh);
1231 EXPORT_SYMBOL(neigh_update);
1233 struct neighbour *neigh_event_ns(struct neigh_table *tbl,
1234 u8 *lladdr, void *saddr,
1235 struct net_device *dev)
1237 struct neighbour *neigh = __neigh_lookup(tbl, saddr, dev,
1238 lladdr || !dev->addr_len);
1240 neigh_update(neigh, lladdr, NUD_STALE,
1241 NEIGH_UPDATE_F_OVERRIDE);
1244 EXPORT_SYMBOL(neigh_event_ns);
1246 /* called with read_lock_bh(&n->lock); */
1247 static void neigh_hh_init(struct neighbour *n, struct dst_entry *dst)
1249 struct net_device *dev = dst->dev;
1250 __be16 prot = dst->ops->protocol;
1251 struct hh_cache *hh = &n->hh;
1253 write_lock_bh(&n->lock);
1255 /* Only one thread can come in here and initialize the
1259 dev->header_ops->cache(n, hh, prot);
1261 write_unlock_bh(&n->lock);
1264 /* This function can be used in contexts, where only old dev_queue_xmit
1265 * worked, f.e. if you want to override normal output path (eql, shaper),
1266 * but resolution is not made yet.
1269 int neigh_compat_output(struct neighbour *neigh, struct sk_buff *skb)
1271 struct net_device *dev = skb->dev;
1273 __skb_pull(skb, skb_network_offset(skb));
1275 if (dev_hard_header(skb, dev, ntohs(skb->protocol), NULL, NULL,
1277 dev_rebuild_header(skb))
1280 return dev_queue_xmit(skb);
1282 EXPORT_SYMBOL(neigh_compat_output);
1284 /* Slow and careful. */
1286 int neigh_resolve_output(struct neighbour *neigh, struct sk_buff *skb)
1288 struct dst_entry *dst = skb_dst(skb);
1294 if (!neigh_event_send(neigh, skb)) {
1296 struct net_device *dev = neigh->dev;
1299 if (dev->header_ops->cache && !neigh->hh.hh_len)
1300 neigh_hh_init(neigh, dst);
1303 __skb_pull(skb, skb_network_offset(skb));
1304 seq = read_seqbegin(&neigh->ha_lock);
1305 err = dev_hard_header(skb, dev, ntohs(skb->protocol),
1306 neigh->ha, NULL, skb->len);
1307 } while (read_seqretry(&neigh->ha_lock, seq));
1310 rc = dev_queue_xmit(skb);
1317 neigh_dbg(1, "%s: dst=%p neigh=%p\n", __func__, dst, neigh);
1323 EXPORT_SYMBOL(neigh_resolve_output);
1325 /* As fast as possible without hh cache */
1327 int neigh_connected_output(struct neighbour *neigh, struct sk_buff *skb)
1329 struct net_device *dev = neigh->dev;
1334 __skb_pull(skb, skb_network_offset(skb));
1335 seq = read_seqbegin(&neigh->ha_lock);
1336 err = dev_hard_header(skb, dev, ntohs(skb->protocol),
1337 neigh->ha, NULL, skb->len);
1338 } while (read_seqretry(&neigh->ha_lock, seq));
1341 err = dev_queue_xmit(skb);
1348 EXPORT_SYMBOL(neigh_connected_output);
1350 int neigh_direct_output(struct neighbour *neigh, struct sk_buff *skb)
1352 return dev_queue_xmit(skb);
1354 EXPORT_SYMBOL(neigh_direct_output);
1356 static void neigh_proxy_process(unsigned long arg)
1358 struct neigh_table *tbl = (struct neigh_table *)arg;
1359 long sched_next = 0;
1360 unsigned long now = jiffies;
1361 struct sk_buff *skb, *n;
1363 spin_lock(&tbl->proxy_queue.lock);
1365 skb_queue_walk_safe(&tbl->proxy_queue, skb, n) {
1366 long tdif = NEIGH_CB(skb)->sched_next - now;
1369 struct net_device *dev = skb->dev;
1371 __skb_unlink(skb, &tbl->proxy_queue);
1372 if (tbl->proxy_redo && netif_running(dev)) {
1374 tbl->proxy_redo(skb);
1381 } else if (!sched_next || tdif < sched_next)
1384 del_timer(&tbl->proxy_timer);
1386 mod_timer(&tbl->proxy_timer, jiffies + sched_next);
1387 spin_unlock(&tbl->proxy_queue.lock);
1390 void pneigh_enqueue(struct neigh_table *tbl, struct neigh_parms *p,
1391 struct sk_buff *skb)
1393 unsigned long now = jiffies;
1394 unsigned long sched_next = now + (net_random() % p->proxy_delay);
1396 if (tbl->proxy_queue.qlen > p->proxy_qlen) {
1401 NEIGH_CB(skb)->sched_next = sched_next;
1402 NEIGH_CB(skb)->flags |= LOCALLY_ENQUEUED;
1404 spin_lock(&tbl->proxy_queue.lock);
1405 if (del_timer(&tbl->proxy_timer)) {
1406 if (time_before(tbl->proxy_timer.expires, sched_next))
1407 sched_next = tbl->proxy_timer.expires;
1411 __skb_queue_tail(&tbl->proxy_queue, skb);
1412 mod_timer(&tbl->proxy_timer, sched_next);
1413 spin_unlock(&tbl->proxy_queue.lock);
1415 EXPORT_SYMBOL(pneigh_enqueue);
1417 static inline struct neigh_parms *lookup_neigh_parms(struct neigh_table *tbl,
1418 struct net *net, int ifindex)
1420 struct neigh_parms *p;
1422 for (p = &tbl->parms; p; p = p->next) {
1423 if ((p->dev && p->dev->ifindex == ifindex && net_eq(neigh_parms_net(p), net)) ||
1424 (!p->dev && !ifindex))
1431 struct neigh_parms *neigh_parms_alloc(struct net_device *dev,
1432 struct neigh_table *tbl)
1434 struct neigh_parms *p, *ref;
1435 struct net *net = dev_net(dev);
1436 const struct net_device_ops *ops = dev->netdev_ops;
1438 ref = lookup_neigh_parms(tbl, net, 0);
1442 p = kmemdup(ref, sizeof(*p), GFP_KERNEL);
1445 atomic_set(&p->refcnt, 1);
1447 neigh_rand_reach_time(p->base_reachable_time);
1450 write_pnet(&p->net, hold_net(net));
1451 p->sysctl_table = NULL;
1453 if (ops->ndo_neigh_setup && ops->ndo_neigh_setup(dev, p)) {
1460 write_lock_bh(&tbl->lock);
1461 p->next = tbl->parms.next;
1462 tbl->parms.next = p;
1463 write_unlock_bh(&tbl->lock);
1467 EXPORT_SYMBOL(neigh_parms_alloc);
1469 static void neigh_rcu_free_parms(struct rcu_head *head)
1471 struct neigh_parms *parms =
1472 container_of(head, struct neigh_parms, rcu_head);
1474 neigh_parms_put(parms);
1477 void neigh_parms_release(struct neigh_table *tbl, struct neigh_parms *parms)
1479 struct neigh_parms **p;
1481 if (!parms || parms == &tbl->parms)
1483 write_lock_bh(&tbl->lock);
1484 for (p = &tbl->parms.next; *p; p = &(*p)->next) {
1488 write_unlock_bh(&tbl->lock);
1490 dev_put(parms->dev);
1491 call_rcu(&parms->rcu_head, neigh_rcu_free_parms);
1495 write_unlock_bh(&tbl->lock);
1496 neigh_dbg(1, "%s: not found\n", __func__);
1498 EXPORT_SYMBOL(neigh_parms_release);
1500 static void neigh_parms_destroy(struct neigh_parms *parms)
1502 release_net(neigh_parms_net(parms));
1506 static struct lock_class_key neigh_table_proxy_queue_class;
1508 static void neigh_table_init_no_netlink(struct neigh_table *tbl)
1510 unsigned long now = jiffies;
1511 unsigned long phsize;
1513 write_pnet(&tbl->parms.net, &init_net);
1514 atomic_set(&tbl->parms.refcnt, 1);
1515 tbl->parms.reachable_time =
1516 neigh_rand_reach_time(tbl->parms.base_reachable_time);
1518 tbl->stats = alloc_percpu(struct neigh_statistics);
1520 panic("cannot create neighbour cache statistics");
1522 #ifdef CONFIG_PROC_FS
1523 if (!proc_create_data(tbl->id, 0, init_net.proc_net_stat,
1524 &neigh_stat_seq_fops, tbl))
1525 panic("cannot create neighbour proc dir entry");
1528 RCU_INIT_POINTER(tbl->nht, neigh_hash_alloc(3));
1530 phsize = (PNEIGH_HASHMASK + 1) * sizeof(struct pneigh_entry *);
1531 tbl->phash_buckets = kzalloc(phsize, GFP_KERNEL);
1533 if (!tbl->nht || !tbl->phash_buckets)
1534 panic("cannot allocate neighbour cache hashes");
1536 if (!tbl->entry_size)
1537 tbl->entry_size = ALIGN(offsetof(struct neighbour, primary_key) +
1538 tbl->key_len, NEIGH_PRIV_ALIGN);
1540 WARN_ON(tbl->entry_size % NEIGH_PRIV_ALIGN);
1542 rwlock_init(&tbl->lock);
1543 INIT_DEFERRABLE_WORK(&tbl->gc_work, neigh_periodic_work);
1544 schedule_delayed_work(&tbl->gc_work, tbl->parms.reachable_time);
1545 setup_timer(&tbl->proxy_timer, neigh_proxy_process, (unsigned long)tbl);
1546 skb_queue_head_init_class(&tbl->proxy_queue,
1547 &neigh_table_proxy_queue_class);
1549 tbl->last_flush = now;
1550 tbl->last_rand = now + tbl->parms.reachable_time * 20;
1553 void neigh_table_init(struct neigh_table *tbl)
1555 struct neigh_table *tmp;
1557 neigh_table_init_no_netlink(tbl);
1558 write_lock(&neigh_tbl_lock);
1559 for (tmp = neigh_tables; tmp; tmp = tmp->next) {
1560 if (tmp->family == tbl->family)
1563 tbl->next = neigh_tables;
1565 write_unlock(&neigh_tbl_lock);
1567 if (unlikely(tmp)) {
1568 pr_err("Registering multiple tables for family %d\n",
1573 EXPORT_SYMBOL(neigh_table_init);
1575 int neigh_table_clear(struct neigh_table *tbl)
1577 struct neigh_table **tp;
1579 /* It is not clean... Fix it to unload IPv6 module safely */
1580 cancel_delayed_work_sync(&tbl->gc_work);
1581 del_timer_sync(&tbl->proxy_timer);
1582 pneigh_queue_purge(&tbl->proxy_queue);
1583 neigh_ifdown(tbl, NULL);
1584 if (atomic_read(&tbl->entries))
1585 pr_crit("neighbour leakage\n");
1586 write_lock(&neigh_tbl_lock);
1587 for (tp = &neigh_tables; *tp; tp = &(*tp)->next) {
1593 write_unlock(&neigh_tbl_lock);
1595 call_rcu(&rcu_dereference_protected(tbl->nht, 1)->rcu,
1596 neigh_hash_free_rcu);
1599 kfree(tbl->phash_buckets);
1600 tbl->phash_buckets = NULL;
1602 remove_proc_entry(tbl->id, init_net.proc_net_stat);
1604 free_percpu(tbl->stats);
1609 EXPORT_SYMBOL(neigh_table_clear);
1611 static int neigh_delete(struct sk_buff *skb, struct nlmsghdr *nlh)
1613 struct net *net = sock_net(skb->sk);
1615 struct nlattr *dst_attr;
1616 struct neigh_table *tbl;
1617 struct net_device *dev = NULL;
1621 if (nlmsg_len(nlh) < sizeof(*ndm))
1624 dst_attr = nlmsg_find_attr(nlh, sizeof(*ndm), NDA_DST);
1625 if (dst_attr == NULL)
1628 ndm = nlmsg_data(nlh);
1629 if (ndm->ndm_ifindex) {
1630 dev = __dev_get_by_index(net, ndm->ndm_ifindex);
1637 read_lock(&neigh_tbl_lock);
1638 for (tbl = neigh_tables; tbl; tbl = tbl->next) {
1639 struct neighbour *neigh;
1641 if (tbl->family != ndm->ndm_family)
1643 read_unlock(&neigh_tbl_lock);
1645 if (nla_len(dst_attr) < tbl->key_len)
1648 if (ndm->ndm_flags & NTF_PROXY) {
1649 err = pneigh_delete(tbl, net, nla_data(dst_attr), dev);
1656 neigh = neigh_lookup(tbl, nla_data(dst_attr), dev);
1657 if (neigh == NULL) {
1662 err = neigh_update(neigh, NULL, NUD_FAILED,
1663 NEIGH_UPDATE_F_OVERRIDE |
1664 NEIGH_UPDATE_F_ADMIN);
1665 neigh_release(neigh);
1668 read_unlock(&neigh_tbl_lock);
1669 err = -EAFNOSUPPORT;
1675 static int neigh_add(struct sk_buff *skb, struct nlmsghdr *nlh)
1677 struct net *net = sock_net(skb->sk);
1679 struct nlattr *tb[NDA_MAX+1];
1680 struct neigh_table *tbl;
1681 struct net_device *dev = NULL;
1685 err = nlmsg_parse(nlh, sizeof(*ndm), tb, NDA_MAX, NULL);
1690 if (tb[NDA_DST] == NULL)
1693 ndm = nlmsg_data(nlh);
1694 if (ndm->ndm_ifindex) {
1695 dev = __dev_get_by_index(net, ndm->ndm_ifindex);
1701 if (tb[NDA_LLADDR] && nla_len(tb[NDA_LLADDR]) < dev->addr_len)
1705 read_lock(&neigh_tbl_lock);
1706 for (tbl = neigh_tables; tbl; tbl = tbl->next) {
1707 int flags = NEIGH_UPDATE_F_ADMIN | NEIGH_UPDATE_F_OVERRIDE;
1708 struct neighbour *neigh;
1711 if (tbl->family != ndm->ndm_family)
1713 read_unlock(&neigh_tbl_lock);
1715 if (nla_len(tb[NDA_DST]) < tbl->key_len)
1717 dst = nla_data(tb[NDA_DST]);
1718 lladdr = tb[NDA_LLADDR] ? nla_data(tb[NDA_LLADDR]) : NULL;
1720 if (ndm->ndm_flags & NTF_PROXY) {
1721 struct pneigh_entry *pn;
1724 pn = pneigh_lookup(tbl, net, dst, dev, 1);
1726 pn->flags = ndm->ndm_flags;
1735 neigh = neigh_lookup(tbl, dst, dev);
1736 if (neigh == NULL) {
1737 if (!(nlh->nlmsg_flags & NLM_F_CREATE)) {
1742 neigh = __neigh_lookup_errno(tbl, dst, dev);
1743 if (IS_ERR(neigh)) {
1744 err = PTR_ERR(neigh);
1748 if (nlh->nlmsg_flags & NLM_F_EXCL) {
1750 neigh_release(neigh);
1754 if (!(nlh->nlmsg_flags & NLM_F_REPLACE))
1755 flags &= ~NEIGH_UPDATE_F_OVERRIDE;
1758 if (ndm->ndm_flags & NTF_USE) {
1759 neigh_event_send(neigh, NULL);
1762 err = neigh_update(neigh, lladdr, ndm->ndm_state, flags);
1763 neigh_release(neigh);
1767 read_unlock(&neigh_tbl_lock);
1768 err = -EAFNOSUPPORT;
1773 static int neightbl_fill_parms(struct sk_buff *skb, struct neigh_parms *parms)
1775 struct nlattr *nest;
1777 nest = nla_nest_start(skb, NDTA_PARMS);
1782 nla_put_u32(skb, NDTPA_IFINDEX, parms->dev->ifindex)) ||
1783 nla_put_u32(skb, NDTPA_REFCNT, atomic_read(&parms->refcnt)) ||
1784 nla_put_u32(skb, NDTPA_QUEUE_LENBYTES, parms->queue_len_bytes) ||
1785 /* approximative value for deprecated QUEUE_LEN (in packets) */
1786 nla_put_u32(skb, NDTPA_QUEUE_LEN,
1787 parms->queue_len_bytes / SKB_TRUESIZE(ETH_FRAME_LEN)) ||
1788 nla_put_u32(skb, NDTPA_PROXY_QLEN, parms->proxy_qlen) ||
1789 nla_put_u32(skb, NDTPA_APP_PROBES, parms->app_probes) ||
1790 nla_put_u32(skb, NDTPA_UCAST_PROBES, parms->ucast_probes) ||
1791 nla_put_u32(skb, NDTPA_MCAST_PROBES, parms->mcast_probes) ||
1792 nla_put_msecs(skb, NDTPA_REACHABLE_TIME, parms->reachable_time) ||
1793 nla_put_msecs(skb, NDTPA_BASE_REACHABLE_TIME,
1794 parms->base_reachable_time) ||
1795 nla_put_msecs(skb, NDTPA_GC_STALETIME, parms->gc_staletime) ||
1796 nla_put_msecs(skb, NDTPA_DELAY_PROBE_TIME,
1797 parms->delay_probe_time) ||
1798 nla_put_msecs(skb, NDTPA_RETRANS_TIME, parms->retrans_time) ||
1799 nla_put_msecs(skb, NDTPA_ANYCAST_DELAY, parms->anycast_delay) ||
1800 nla_put_msecs(skb, NDTPA_PROXY_DELAY, parms->proxy_delay) ||
1801 nla_put_msecs(skb, NDTPA_LOCKTIME, parms->locktime))
1802 goto nla_put_failure;
1803 return nla_nest_end(skb, nest);
1806 nla_nest_cancel(skb, nest);
1810 static int neightbl_fill_info(struct sk_buff *skb, struct neigh_table *tbl,
1811 u32 pid, u32 seq, int type, int flags)
1813 struct nlmsghdr *nlh;
1814 struct ndtmsg *ndtmsg;
1816 nlh = nlmsg_put(skb, pid, seq, type, sizeof(*ndtmsg), flags);
1820 ndtmsg = nlmsg_data(nlh);
1822 read_lock_bh(&tbl->lock);
1823 ndtmsg->ndtm_family = tbl->family;
1824 ndtmsg->ndtm_pad1 = 0;
1825 ndtmsg->ndtm_pad2 = 0;
1827 if (nla_put_string(skb, NDTA_NAME, tbl->id) ||
1828 nla_put_msecs(skb, NDTA_GC_INTERVAL, tbl->gc_interval) ||
1829 nla_put_u32(skb, NDTA_THRESH1, tbl->gc_thresh1) ||
1830 nla_put_u32(skb, NDTA_THRESH2, tbl->gc_thresh2) ||
1831 nla_put_u32(skb, NDTA_THRESH3, tbl->gc_thresh3))
1832 goto nla_put_failure;
1834 unsigned long now = jiffies;
1835 unsigned int flush_delta = now - tbl->last_flush;
1836 unsigned int rand_delta = now - tbl->last_rand;
1837 struct neigh_hash_table *nht;
1838 struct ndt_config ndc = {
1839 .ndtc_key_len = tbl->key_len,
1840 .ndtc_entry_size = tbl->entry_size,
1841 .ndtc_entries = atomic_read(&tbl->entries),
1842 .ndtc_last_flush = jiffies_to_msecs(flush_delta),
1843 .ndtc_last_rand = jiffies_to_msecs(rand_delta),
1844 .ndtc_proxy_qlen = tbl->proxy_queue.qlen,
1848 nht = rcu_dereference_bh(tbl->nht);
1849 ndc.ndtc_hash_rnd = nht->hash_rnd[0];
1850 ndc.ndtc_hash_mask = ((1 << nht->hash_shift) - 1);
1851 rcu_read_unlock_bh();
1853 if (nla_put(skb, NDTA_CONFIG, sizeof(ndc), &ndc))
1854 goto nla_put_failure;
1859 struct ndt_stats ndst;
1861 memset(&ndst, 0, sizeof(ndst));
1863 for_each_possible_cpu(cpu) {
1864 struct neigh_statistics *st;
1866 st = per_cpu_ptr(tbl->stats, cpu);
1867 ndst.ndts_allocs += st->allocs;
1868 ndst.ndts_destroys += st->destroys;
1869 ndst.ndts_hash_grows += st->hash_grows;
1870 ndst.ndts_res_failed += st->res_failed;
1871 ndst.ndts_lookups += st->lookups;
1872 ndst.ndts_hits += st->hits;
1873 ndst.ndts_rcv_probes_mcast += st->rcv_probes_mcast;
1874 ndst.ndts_rcv_probes_ucast += st->rcv_probes_ucast;
1875 ndst.ndts_periodic_gc_runs += st->periodic_gc_runs;
1876 ndst.ndts_forced_gc_runs += st->forced_gc_runs;
1879 if (nla_put(skb, NDTA_STATS, sizeof(ndst), &ndst))
1880 goto nla_put_failure;
1883 BUG_ON(tbl->parms.dev);
1884 if (neightbl_fill_parms(skb, &tbl->parms) < 0)
1885 goto nla_put_failure;
1887 read_unlock_bh(&tbl->lock);
1888 return nlmsg_end(skb, nlh);
1891 read_unlock_bh(&tbl->lock);
1892 nlmsg_cancel(skb, nlh);
1896 static int neightbl_fill_param_info(struct sk_buff *skb,
1897 struct neigh_table *tbl,
1898 struct neigh_parms *parms,
1899 u32 pid, u32 seq, int type,
1902 struct ndtmsg *ndtmsg;
1903 struct nlmsghdr *nlh;
1905 nlh = nlmsg_put(skb, pid, seq, type, sizeof(*ndtmsg), flags);
1909 ndtmsg = nlmsg_data(nlh);
1911 read_lock_bh(&tbl->lock);
1912 ndtmsg->ndtm_family = tbl->family;
1913 ndtmsg->ndtm_pad1 = 0;
1914 ndtmsg->ndtm_pad2 = 0;
1916 if (nla_put_string(skb, NDTA_NAME, tbl->id) < 0 ||
1917 neightbl_fill_parms(skb, parms) < 0)
1920 read_unlock_bh(&tbl->lock);
1921 return nlmsg_end(skb, nlh);
1923 read_unlock_bh(&tbl->lock);
1924 nlmsg_cancel(skb, nlh);
1928 static const struct nla_policy nl_neightbl_policy[NDTA_MAX+1] = {
1929 [NDTA_NAME] = { .type = NLA_STRING },
1930 [NDTA_THRESH1] = { .type = NLA_U32 },
1931 [NDTA_THRESH2] = { .type = NLA_U32 },
1932 [NDTA_THRESH3] = { .type = NLA_U32 },
1933 [NDTA_GC_INTERVAL] = { .type = NLA_U64 },
1934 [NDTA_PARMS] = { .type = NLA_NESTED },
1937 static const struct nla_policy nl_ntbl_parm_policy[NDTPA_MAX+1] = {
1938 [NDTPA_IFINDEX] = { .type = NLA_U32 },
1939 [NDTPA_QUEUE_LEN] = { .type = NLA_U32 },
1940 [NDTPA_PROXY_QLEN] = { .type = NLA_U32 },
1941 [NDTPA_APP_PROBES] = { .type = NLA_U32 },
1942 [NDTPA_UCAST_PROBES] = { .type = NLA_U32 },
1943 [NDTPA_MCAST_PROBES] = { .type = NLA_U32 },
1944 [NDTPA_BASE_REACHABLE_TIME] = { .type = NLA_U64 },
1945 [NDTPA_GC_STALETIME] = { .type = NLA_U64 },
1946 [NDTPA_DELAY_PROBE_TIME] = { .type = NLA_U64 },
1947 [NDTPA_RETRANS_TIME] = { .type = NLA_U64 },
1948 [NDTPA_ANYCAST_DELAY] = { .type = NLA_U64 },
1949 [NDTPA_PROXY_DELAY] = { .type = NLA_U64 },
1950 [NDTPA_LOCKTIME] = { .type = NLA_U64 },
1953 static int neightbl_set(struct sk_buff *skb, struct nlmsghdr *nlh)
1955 struct net *net = sock_net(skb->sk);
1956 struct neigh_table *tbl;
1957 struct ndtmsg *ndtmsg;
1958 struct nlattr *tb[NDTA_MAX+1];
1961 err = nlmsg_parse(nlh, sizeof(*ndtmsg), tb, NDTA_MAX,
1962 nl_neightbl_policy);
1966 if (tb[NDTA_NAME] == NULL) {
1971 ndtmsg = nlmsg_data(nlh);
1972 read_lock(&neigh_tbl_lock);
1973 for (tbl = neigh_tables; tbl; tbl = tbl->next) {
1974 if (ndtmsg->ndtm_family && tbl->family != ndtmsg->ndtm_family)
1977 if (nla_strcmp(tb[NDTA_NAME], tbl->id) == 0)
1987 * We acquire tbl->lock to be nice to the periodic timers and
1988 * make sure they always see a consistent set of values.
1990 write_lock_bh(&tbl->lock);
1992 if (tb[NDTA_PARMS]) {
1993 struct nlattr *tbp[NDTPA_MAX+1];
1994 struct neigh_parms *p;
1997 err = nla_parse_nested(tbp, NDTPA_MAX, tb[NDTA_PARMS],
1998 nl_ntbl_parm_policy);
2000 goto errout_tbl_lock;
2002 if (tbp[NDTPA_IFINDEX])
2003 ifindex = nla_get_u32(tbp[NDTPA_IFINDEX]);
2005 p = lookup_neigh_parms(tbl, net, ifindex);
2008 goto errout_tbl_lock;
2011 for (i = 1; i <= NDTPA_MAX; i++) {
2016 case NDTPA_QUEUE_LEN:
2017 p->queue_len_bytes = nla_get_u32(tbp[i]) *
2018 SKB_TRUESIZE(ETH_FRAME_LEN);
2020 case NDTPA_QUEUE_LENBYTES:
2021 p->queue_len_bytes = nla_get_u32(tbp[i]);
2023 case NDTPA_PROXY_QLEN:
2024 p->proxy_qlen = nla_get_u32(tbp[i]);
2026 case NDTPA_APP_PROBES:
2027 p->app_probes = nla_get_u32(tbp[i]);
2029 case NDTPA_UCAST_PROBES:
2030 p->ucast_probes = nla_get_u32(tbp[i]);
2032 case NDTPA_MCAST_PROBES:
2033 p->mcast_probes = nla_get_u32(tbp[i]);
2035 case NDTPA_BASE_REACHABLE_TIME:
2036 p->base_reachable_time = nla_get_msecs(tbp[i]);
2038 case NDTPA_GC_STALETIME:
2039 p->gc_staletime = nla_get_msecs(tbp[i]);
2041 case NDTPA_DELAY_PROBE_TIME:
2042 p->delay_probe_time = nla_get_msecs(tbp[i]);
2044 case NDTPA_RETRANS_TIME:
2045 p->retrans_time = nla_get_msecs(tbp[i]);
2047 case NDTPA_ANYCAST_DELAY:
2048 p->anycast_delay = nla_get_msecs(tbp[i]);
2050 case NDTPA_PROXY_DELAY:
2051 p->proxy_delay = nla_get_msecs(tbp[i]);
2053 case NDTPA_LOCKTIME:
2054 p->locktime = nla_get_msecs(tbp[i]);
2060 if (tb[NDTA_THRESH1])
2061 tbl->gc_thresh1 = nla_get_u32(tb[NDTA_THRESH1]);
2063 if (tb[NDTA_THRESH2])
2064 tbl->gc_thresh2 = nla_get_u32(tb[NDTA_THRESH2]);
2066 if (tb[NDTA_THRESH3])
2067 tbl->gc_thresh3 = nla_get_u32(tb[NDTA_THRESH3]);
2069 if (tb[NDTA_GC_INTERVAL])
2070 tbl->gc_interval = nla_get_msecs(tb[NDTA_GC_INTERVAL]);
2075 write_unlock_bh(&tbl->lock);
2077 read_unlock(&neigh_tbl_lock);
2082 static int neightbl_dump_info(struct sk_buff *skb, struct netlink_callback *cb)
2084 struct net *net = sock_net(skb->sk);
2085 int family, tidx, nidx = 0;
2086 int tbl_skip = cb->args[0];
2087 int neigh_skip = cb->args[1];
2088 struct neigh_table *tbl;
2090 family = ((struct rtgenmsg *) nlmsg_data(cb->nlh))->rtgen_family;
2092 read_lock(&neigh_tbl_lock);
2093 for (tbl = neigh_tables, tidx = 0; tbl; tbl = tbl->next, tidx++) {
2094 struct neigh_parms *p;
2096 if (tidx < tbl_skip || (family && tbl->family != family))
2099 if (neightbl_fill_info(skb, tbl, NETLINK_CB(cb->skb).portid,
2100 cb->nlh->nlmsg_seq, RTM_NEWNEIGHTBL,
2104 for (nidx = 0, p = tbl->parms.next; p; p = p->next) {
2105 if (!net_eq(neigh_parms_net(p), net))
2108 if (nidx < neigh_skip)
2111 if (neightbl_fill_param_info(skb, tbl, p,
2112 NETLINK_CB(cb->skb).portid,
2124 read_unlock(&neigh_tbl_lock);
2131 static int neigh_fill_info(struct sk_buff *skb, struct neighbour *neigh,
2132 u32 pid, u32 seq, int type, unsigned int flags)
2134 unsigned long now = jiffies;
2135 struct nda_cacheinfo ci;
2136 struct nlmsghdr *nlh;
2139 nlh = nlmsg_put(skb, pid, seq, type, sizeof(*ndm), flags);
2143 ndm = nlmsg_data(nlh);
2144 ndm->ndm_family = neigh->ops->family;
2147 ndm->ndm_flags = neigh->flags;
2148 ndm->ndm_type = neigh->type;
2149 ndm->ndm_ifindex = neigh->dev->ifindex;
2151 if (nla_put(skb, NDA_DST, neigh->tbl->key_len, neigh->primary_key))
2152 goto nla_put_failure;
2154 read_lock_bh(&neigh->lock);
2155 ndm->ndm_state = neigh->nud_state;
2156 if (neigh->nud_state & NUD_VALID) {
2157 char haddr[MAX_ADDR_LEN];
2159 neigh_ha_snapshot(haddr, neigh, neigh->dev);
2160 if (nla_put(skb, NDA_LLADDR, neigh->dev->addr_len, haddr) < 0) {
2161 read_unlock_bh(&neigh->lock);
2162 goto nla_put_failure;
2166 ci.ndm_used = jiffies_to_clock_t(now - neigh->used);
2167 ci.ndm_confirmed = jiffies_to_clock_t(now - neigh->confirmed);
2168 ci.ndm_updated = jiffies_to_clock_t(now - neigh->updated);
2169 ci.ndm_refcnt = atomic_read(&neigh->refcnt) - 1;
2170 read_unlock_bh(&neigh->lock);
2172 if (nla_put_u32(skb, NDA_PROBES, atomic_read(&neigh->probes)) ||
2173 nla_put(skb, NDA_CACHEINFO, sizeof(ci), &ci))
2174 goto nla_put_failure;
2176 return nlmsg_end(skb, nlh);
2179 nlmsg_cancel(skb, nlh);
2183 static int pneigh_fill_info(struct sk_buff *skb, struct pneigh_entry *pn,
2184 u32 pid, u32 seq, int type, unsigned int flags,
2185 struct neigh_table *tbl)
2187 struct nlmsghdr *nlh;
2190 nlh = nlmsg_put(skb, pid, seq, type, sizeof(*ndm), flags);
2194 ndm = nlmsg_data(nlh);
2195 ndm->ndm_family = tbl->family;
2198 ndm->ndm_flags = pn->flags | NTF_PROXY;
2199 ndm->ndm_type = NDA_DST;
2200 ndm->ndm_ifindex = pn->dev->ifindex;
2201 ndm->ndm_state = NUD_NONE;
2203 if (nla_put(skb, NDA_DST, tbl->key_len, pn->key))
2204 goto nla_put_failure;
2206 return nlmsg_end(skb, nlh);
2209 nlmsg_cancel(skb, nlh);
2213 static void neigh_update_notify(struct neighbour *neigh)
2215 call_netevent_notifiers(NETEVENT_NEIGH_UPDATE, neigh);
2216 __neigh_notify(neigh, RTM_NEWNEIGH, 0);
2219 static int neigh_dump_table(struct neigh_table *tbl, struct sk_buff *skb,
2220 struct netlink_callback *cb)
2222 struct net *net = sock_net(skb->sk);
2223 struct neighbour *n;
2224 int rc, h, s_h = cb->args[1];
2225 int idx, s_idx = idx = cb->args[2];
2226 struct neigh_hash_table *nht;
2229 nht = rcu_dereference_bh(tbl->nht);
2231 for (h = s_h; h < (1 << nht->hash_shift); h++) {
2234 for (n = rcu_dereference_bh(nht->hash_buckets[h]), idx = 0;
2236 n = rcu_dereference_bh(n->next)) {
2237 if (!net_eq(dev_net(n->dev), net))
2241 if (neigh_fill_info(skb, n, NETLINK_CB(cb->skb).portid,
2244 NLM_F_MULTI) <= 0) {
2254 rcu_read_unlock_bh();
2260 static int pneigh_dump_table(struct neigh_table *tbl, struct sk_buff *skb,
2261 struct netlink_callback *cb)
2263 struct pneigh_entry *n;
2264 struct net *net = sock_net(skb->sk);
2265 int rc, h, s_h = cb->args[3];
2266 int idx, s_idx = idx = cb->args[4];
2268 read_lock_bh(&tbl->lock);
2270 for (h = s_h; h <= PNEIGH_HASHMASK; h++) {
2273 for (n = tbl->phash_buckets[h], idx = 0; n; n = n->next) {
2274 if (dev_net(n->dev) != net)
2278 if (pneigh_fill_info(skb, n, NETLINK_CB(cb->skb).portid,
2281 NLM_F_MULTI, tbl) <= 0) {
2282 read_unlock_bh(&tbl->lock);
2291 read_unlock_bh(&tbl->lock);
2300 static int neigh_dump_info(struct sk_buff *skb, struct netlink_callback *cb)
2302 struct neigh_table *tbl;
2307 read_lock(&neigh_tbl_lock);
2308 family = ((struct rtgenmsg *) nlmsg_data(cb->nlh))->rtgen_family;
2310 /* check for full ndmsg structure presence, family member is
2311 * the same for both structures
2313 if (nlmsg_len(cb->nlh) >= sizeof(struct ndmsg) &&
2314 ((struct ndmsg *) nlmsg_data(cb->nlh))->ndm_flags == NTF_PROXY)
2319 for (tbl = neigh_tables, t = 0; tbl;
2320 tbl = tbl->next, t++) {
2321 if (t < s_t || (family && tbl->family != family))
2324 memset(&cb->args[1], 0, sizeof(cb->args) -
2325 sizeof(cb->args[0]));
2327 err = pneigh_dump_table(tbl, skb, cb);
2329 err = neigh_dump_table(tbl, skb, cb);
2333 read_unlock(&neigh_tbl_lock);
2339 void neigh_for_each(struct neigh_table *tbl, void (*cb)(struct neighbour *, void *), void *cookie)
2342 struct neigh_hash_table *nht;
2345 nht = rcu_dereference_bh(tbl->nht);
2347 read_lock(&tbl->lock); /* avoid resizes */
2348 for (chain = 0; chain < (1 << nht->hash_shift); chain++) {
2349 struct neighbour *n;
2351 for (n = rcu_dereference_bh(nht->hash_buckets[chain]);
2353 n = rcu_dereference_bh(n->next))
2356 read_unlock(&tbl->lock);
2357 rcu_read_unlock_bh();
2359 EXPORT_SYMBOL(neigh_for_each);
2361 /* The tbl->lock must be held as a writer and BH disabled. */
2362 void __neigh_for_each_release(struct neigh_table *tbl,
2363 int (*cb)(struct neighbour *))
2366 struct neigh_hash_table *nht;
2368 nht = rcu_dereference_protected(tbl->nht,
2369 lockdep_is_held(&tbl->lock));
2370 for (chain = 0; chain < (1 << nht->hash_shift); chain++) {
2371 struct neighbour *n;
2372 struct neighbour __rcu **np;
2374 np = &nht->hash_buckets[chain];
2375 while ((n = rcu_dereference_protected(*np,
2376 lockdep_is_held(&tbl->lock))) != NULL) {
2379 write_lock(&n->lock);
2382 rcu_assign_pointer(*np,
2383 rcu_dereference_protected(n->next,
2384 lockdep_is_held(&tbl->lock)));
2388 write_unlock(&n->lock);
2390 neigh_cleanup_and_release(n);
2394 EXPORT_SYMBOL(__neigh_for_each_release);
2396 #ifdef CONFIG_PROC_FS
2398 static struct neighbour *neigh_get_first(struct seq_file *seq)
2400 struct neigh_seq_state *state = seq->private;
2401 struct net *net = seq_file_net(seq);
2402 struct neigh_hash_table *nht = state->nht;
2403 struct neighbour *n = NULL;
2404 int bucket = state->bucket;
2406 state->flags &= ~NEIGH_SEQ_IS_PNEIGH;
2407 for (bucket = 0; bucket < (1 << nht->hash_shift); bucket++) {
2408 n = rcu_dereference_bh(nht->hash_buckets[bucket]);
2411 if (!net_eq(dev_net(n->dev), net))
2413 if (state->neigh_sub_iter) {
2417 v = state->neigh_sub_iter(state, n, &fakep);
2421 if (!(state->flags & NEIGH_SEQ_SKIP_NOARP))
2423 if (n->nud_state & ~NUD_NOARP)
2426 n = rcu_dereference_bh(n->next);
2432 state->bucket = bucket;
2437 static struct neighbour *neigh_get_next(struct seq_file *seq,
2438 struct neighbour *n,
2441 struct neigh_seq_state *state = seq->private;
2442 struct net *net = seq_file_net(seq);
2443 struct neigh_hash_table *nht = state->nht;
2445 if (state->neigh_sub_iter) {
2446 void *v = state->neigh_sub_iter(state, n, pos);
2450 n = rcu_dereference_bh(n->next);
2454 if (!net_eq(dev_net(n->dev), net))
2456 if (state->neigh_sub_iter) {
2457 void *v = state->neigh_sub_iter(state, n, pos);
2462 if (!(state->flags & NEIGH_SEQ_SKIP_NOARP))
2465 if (n->nud_state & ~NUD_NOARP)
2468 n = rcu_dereference_bh(n->next);
2474 if (++state->bucket >= (1 << nht->hash_shift))
2477 n = rcu_dereference_bh(nht->hash_buckets[state->bucket]);
2485 static struct neighbour *neigh_get_idx(struct seq_file *seq, loff_t *pos)
2487 struct neighbour *n = neigh_get_first(seq);
2492 n = neigh_get_next(seq, n, pos);
2497 return *pos ? NULL : n;
2500 static struct pneigh_entry *pneigh_get_first(struct seq_file *seq)
2502 struct neigh_seq_state *state = seq->private;
2503 struct net *net = seq_file_net(seq);
2504 struct neigh_table *tbl = state->tbl;
2505 struct pneigh_entry *pn = NULL;
2506 int bucket = state->bucket;
2508 state->flags |= NEIGH_SEQ_IS_PNEIGH;
2509 for (bucket = 0; bucket <= PNEIGH_HASHMASK; bucket++) {
2510 pn = tbl->phash_buckets[bucket];
2511 while (pn && !net_eq(pneigh_net(pn), net))
2516 state->bucket = bucket;
2521 static struct pneigh_entry *pneigh_get_next(struct seq_file *seq,
2522 struct pneigh_entry *pn,
2525 struct neigh_seq_state *state = seq->private;
2526 struct net *net = seq_file_net(seq);
2527 struct neigh_table *tbl = state->tbl;
2531 } while (pn && !net_eq(pneigh_net(pn), net));
2534 if (++state->bucket > PNEIGH_HASHMASK)
2536 pn = tbl->phash_buckets[state->bucket];
2537 while (pn && !net_eq(pneigh_net(pn), net))
2549 static struct pneigh_entry *pneigh_get_idx(struct seq_file *seq, loff_t *pos)
2551 struct pneigh_entry *pn = pneigh_get_first(seq);
2556 pn = pneigh_get_next(seq, pn, pos);
2561 return *pos ? NULL : pn;
2564 static void *neigh_get_idx_any(struct seq_file *seq, loff_t *pos)
2566 struct neigh_seq_state *state = seq->private;
2568 loff_t idxpos = *pos;
2570 rc = neigh_get_idx(seq, &idxpos);
2571 if (!rc && !(state->flags & NEIGH_SEQ_NEIGH_ONLY))
2572 rc = pneigh_get_idx(seq, &idxpos);
2577 void *neigh_seq_start(struct seq_file *seq, loff_t *pos, struct neigh_table *tbl, unsigned int neigh_seq_flags)
2580 struct neigh_seq_state *state = seq->private;
2584 state->flags = (neigh_seq_flags & ~NEIGH_SEQ_IS_PNEIGH);
2587 state->nht = rcu_dereference_bh(tbl->nht);
2589 return *pos ? neigh_get_idx_any(seq, pos) : SEQ_START_TOKEN;
2591 EXPORT_SYMBOL(neigh_seq_start);
2593 void *neigh_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2595 struct neigh_seq_state *state;
2598 if (v == SEQ_START_TOKEN) {
2599 rc = neigh_get_first(seq);
2603 state = seq->private;
2604 if (!(state->flags & NEIGH_SEQ_IS_PNEIGH)) {
2605 rc = neigh_get_next(seq, v, NULL);
2608 if (!(state->flags & NEIGH_SEQ_NEIGH_ONLY))
2609 rc = pneigh_get_first(seq);
2611 BUG_ON(state->flags & NEIGH_SEQ_NEIGH_ONLY);
2612 rc = pneigh_get_next(seq, v, NULL);
2618 EXPORT_SYMBOL(neigh_seq_next);
2620 void neigh_seq_stop(struct seq_file *seq, void *v)
2623 rcu_read_unlock_bh();
2625 EXPORT_SYMBOL(neigh_seq_stop);
2627 /* statistics via seq_file */
2629 static void *neigh_stat_seq_start(struct seq_file *seq, loff_t *pos)
2631 struct neigh_table *tbl = seq->private;
2635 return SEQ_START_TOKEN;
2637 for (cpu = *pos-1; cpu < nr_cpu_ids; ++cpu) {
2638 if (!cpu_possible(cpu))
2641 return per_cpu_ptr(tbl->stats, cpu);
2646 static void *neigh_stat_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2648 struct neigh_table *tbl = seq->private;
2651 for (cpu = *pos; cpu < nr_cpu_ids; ++cpu) {
2652 if (!cpu_possible(cpu))
2655 return per_cpu_ptr(tbl->stats, cpu);
2660 static void neigh_stat_seq_stop(struct seq_file *seq, void *v)
2665 static int neigh_stat_seq_show(struct seq_file *seq, void *v)
2667 struct neigh_table *tbl = seq->private;
2668 struct neigh_statistics *st = v;
2670 if (v == SEQ_START_TOKEN) {
2671 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");
2675 seq_printf(seq, "%08x %08lx %08lx %08lx %08lx %08lx %08lx "
2676 "%08lx %08lx %08lx %08lx %08lx\n",
2677 atomic_read(&tbl->entries),
2688 st->rcv_probes_mcast,
2689 st->rcv_probes_ucast,
2691 st->periodic_gc_runs,
2699 static const struct seq_operations neigh_stat_seq_ops = {
2700 .start = neigh_stat_seq_start,
2701 .next = neigh_stat_seq_next,
2702 .stop = neigh_stat_seq_stop,
2703 .show = neigh_stat_seq_show,
2706 static int neigh_stat_seq_open(struct inode *inode, struct file *file)
2708 int ret = seq_open(file, &neigh_stat_seq_ops);
2711 struct seq_file *sf = file->private_data;
2712 sf->private = PDE_DATA(inode);
2717 static const struct file_operations neigh_stat_seq_fops = {
2718 .owner = THIS_MODULE,
2719 .open = neigh_stat_seq_open,
2721 .llseek = seq_lseek,
2722 .release = seq_release,
2725 #endif /* CONFIG_PROC_FS */
2727 static inline size_t neigh_nlmsg_size(void)
2729 return NLMSG_ALIGN(sizeof(struct ndmsg))
2730 + nla_total_size(MAX_ADDR_LEN) /* NDA_DST */
2731 + nla_total_size(MAX_ADDR_LEN) /* NDA_LLADDR */
2732 + nla_total_size(sizeof(struct nda_cacheinfo))
2733 + nla_total_size(4); /* NDA_PROBES */
2736 static void __neigh_notify(struct neighbour *n, int type, int flags)
2738 struct net *net = dev_net(n->dev);
2739 struct sk_buff *skb;
2742 skb = nlmsg_new(neigh_nlmsg_size(), GFP_ATOMIC);
2746 err = neigh_fill_info(skb, n, 0, 0, type, flags);
2748 /* -EMSGSIZE implies BUG in neigh_nlmsg_size() */
2749 WARN_ON(err == -EMSGSIZE);
2753 rtnl_notify(skb, net, 0, RTNLGRP_NEIGH, NULL, GFP_ATOMIC);
2757 rtnl_set_sk_err(net, RTNLGRP_NEIGH, err);
2761 void neigh_app_ns(struct neighbour *n)
2763 __neigh_notify(n, RTM_GETNEIGH, NLM_F_REQUEST);
2765 EXPORT_SYMBOL(neigh_app_ns);
2766 #endif /* CONFIG_ARPD */
2768 #ifdef CONFIG_SYSCTL
2770 static int unres_qlen_max = INT_MAX / SKB_TRUESIZE(ETH_FRAME_LEN);
2772 static int proc_unres_qlen(ctl_table *ctl, int write, void __user *buffer,
2773 size_t *lenp, loff_t *ppos)
2776 ctl_table tmp = *ctl;
2779 tmp.extra2 = &unres_qlen_max;
2782 size = *(int *)ctl->data / SKB_TRUESIZE(ETH_FRAME_LEN);
2783 ret = proc_dointvec_minmax(&tmp, write, buffer, lenp, ppos);
2786 *(int *)ctl->data = size * SKB_TRUESIZE(ETH_FRAME_LEN);
2791 NEIGH_VAR_MCAST_PROBE,
2792 NEIGH_VAR_UCAST_PROBE,
2793 NEIGH_VAR_APP_PROBE,
2794 NEIGH_VAR_RETRANS_TIME,
2795 NEIGH_VAR_BASE_REACHABLE_TIME,
2796 NEIGH_VAR_DELAY_PROBE_TIME,
2797 NEIGH_VAR_GC_STALETIME,
2798 NEIGH_VAR_QUEUE_LEN,
2799 NEIGH_VAR_QUEUE_LEN_BYTES,
2800 NEIGH_VAR_PROXY_QLEN,
2801 NEIGH_VAR_ANYCAST_DELAY,
2802 NEIGH_VAR_PROXY_DELAY,
2804 NEIGH_VAR_RETRANS_TIME_MS,
2805 NEIGH_VAR_BASE_REACHABLE_TIME_MS,
2806 NEIGH_VAR_GC_INTERVAL,
2807 NEIGH_VAR_GC_THRESH1,
2808 NEIGH_VAR_GC_THRESH2,
2809 NEIGH_VAR_GC_THRESH3,
2813 static struct neigh_sysctl_table {
2814 struct ctl_table_header *sysctl_header;
2815 struct ctl_table neigh_vars[NEIGH_VAR_MAX + 1];
2816 } neigh_sysctl_template __read_mostly = {
2818 [NEIGH_VAR_MCAST_PROBE] = {
2819 .procname = "mcast_solicit",
2820 .maxlen = sizeof(int),
2822 .proc_handler = proc_dointvec,
2824 [NEIGH_VAR_UCAST_PROBE] = {
2825 .procname = "ucast_solicit",
2826 .maxlen = sizeof(int),
2828 .proc_handler = proc_dointvec,
2830 [NEIGH_VAR_APP_PROBE] = {
2831 .procname = "app_solicit",
2832 .maxlen = sizeof(int),
2834 .proc_handler = proc_dointvec,
2836 [NEIGH_VAR_RETRANS_TIME] = {
2837 .procname = "retrans_time",
2838 .maxlen = sizeof(int),
2840 .proc_handler = proc_dointvec_userhz_jiffies,
2842 [NEIGH_VAR_BASE_REACHABLE_TIME] = {
2843 .procname = "base_reachable_time",
2844 .maxlen = sizeof(int),
2846 .proc_handler = proc_dointvec_jiffies,
2848 [NEIGH_VAR_DELAY_PROBE_TIME] = {
2849 .procname = "delay_first_probe_time",
2850 .maxlen = sizeof(int),
2852 .proc_handler = proc_dointvec_jiffies,
2854 [NEIGH_VAR_GC_STALETIME] = {
2855 .procname = "gc_stale_time",
2856 .maxlen = sizeof(int),
2858 .proc_handler = proc_dointvec_jiffies,
2860 [NEIGH_VAR_QUEUE_LEN] = {
2861 .procname = "unres_qlen",
2862 .maxlen = sizeof(int),
2864 .proc_handler = proc_unres_qlen,
2866 [NEIGH_VAR_QUEUE_LEN_BYTES] = {
2867 .procname = "unres_qlen_bytes",
2868 .maxlen = sizeof(int),
2871 .proc_handler = proc_dointvec_minmax,
2873 [NEIGH_VAR_PROXY_QLEN] = {
2874 .procname = "proxy_qlen",
2875 .maxlen = sizeof(int),
2877 .proc_handler = proc_dointvec,
2879 [NEIGH_VAR_ANYCAST_DELAY] = {
2880 .procname = "anycast_delay",
2881 .maxlen = sizeof(int),
2883 .proc_handler = proc_dointvec_userhz_jiffies,
2885 [NEIGH_VAR_PROXY_DELAY] = {
2886 .procname = "proxy_delay",
2887 .maxlen = sizeof(int),
2889 .proc_handler = proc_dointvec_userhz_jiffies,
2891 [NEIGH_VAR_LOCKTIME] = {
2892 .procname = "locktime",
2893 .maxlen = sizeof(int),
2895 .proc_handler = proc_dointvec_userhz_jiffies,
2897 [NEIGH_VAR_RETRANS_TIME_MS] = {
2898 .procname = "retrans_time_ms",
2899 .maxlen = sizeof(int),
2901 .proc_handler = proc_dointvec_ms_jiffies,
2903 [NEIGH_VAR_BASE_REACHABLE_TIME_MS] = {
2904 .procname = "base_reachable_time_ms",
2905 .maxlen = sizeof(int),
2907 .proc_handler = proc_dointvec_ms_jiffies,
2909 [NEIGH_VAR_GC_INTERVAL] = {
2910 .procname = "gc_interval",
2911 .maxlen = sizeof(int),
2913 .proc_handler = proc_dointvec_jiffies,
2915 [NEIGH_VAR_GC_THRESH1] = {
2916 .procname = "gc_thresh1",
2917 .maxlen = sizeof(int),
2919 .proc_handler = proc_dointvec,
2921 [NEIGH_VAR_GC_THRESH2] = {
2922 .procname = "gc_thresh2",
2923 .maxlen = sizeof(int),
2925 .proc_handler = proc_dointvec,
2927 [NEIGH_VAR_GC_THRESH3] = {
2928 .procname = "gc_thresh3",
2929 .maxlen = sizeof(int),
2931 .proc_handler = proc_dointvec,
2937 int neigh_sysctl_register(struct net_device *dev, struct neigh_parms *p,
2938 char *p_name, proc_handler *handler)
2940 struct neigh_sysctl_table *t;
2941 const char *dev_name_source = NULL;
2942 char neigh_path[ sizeof("net//neigh/") + IFNAMSIZ + IFNAMSIZ ];
2944 t = kmemdup(&neigh_sysctl_template, sizeof(*t), GFP_KERNEL);
2948 t->neigh_vars[NEIGH_VAR_MCAST_PROBE].data = &p->mcast_probes;
2949 t->neigh_vars[NEIGH_VAR_UCAST_PROBE].data = &p->ucast_probes;
2950 t->neigh_vars[NEIGH_VAR_APP_PROBE].data = &p->app_probes;
2951 t->neigh_vars[NEIGH_VAR_RETRANS_TIME].data = &p->retrans_time;
2952 t->neigh_vars[NEIGH_VAR_BASE_REACHABLE_TIME].data = &p->base_reachable_time;
2953 t->neigh_vars[NEIGH_VAR_DELAY_PROBE_TIME].data = &p->delay_probe_time;
2954 t->neigh_vars[NEIGH_VAR_GC_STALETIME].data = &p->gc_staletime;
2955 t->neigh_vars[NEIGH_VAR_QUEUE_LEN].data = &p->queue_len_bytes;
2956 t->neigh_vars[NEIGH_VAR_QUEUE_LEN_BYTES].data = &p->queue_len_bytes;
2957 t->neigh_vars[NEIGH_VAR_PROXY_QLEN].data = &p->proxy_qlen;
2958 t->neigh_vars[NEIGH_VAR_ANYCAST_DELAY].data = &p->anycast_delay;
2959 t->neigh_vars[NEIGH_VAR_PROXY_DELAY].data = &p->proxy_delay;
2960 t->neigh_vars[NEIGH_VAR_LOCKTIME].data = &p->locktime;
2961 t->neigh_vars[NEIGH_VAR_RETRANS_TIME_MS].data = &p->retrans_time;
2962 t->neigh_vars[NEIGH_VAR_BASE_REACHABLE_TIME_MS].data = &p->base_reachable_time;
2965 dev_name_source = dev->name;
2966 /* Terminate the table early */
2967 memset(&t->neigh_vars[NEIGH_VAR_GC_INTERVAL], 0,
2968 sizeof(t->neigh_vars[NEIGH_VAR_GC_INTERVAL]));
2970 dev_name_source = "default";
2971 t->neigh_vars[NEIGH_VAR_GC_INTERVAL].data = (int *)(p + 1);
2972 t->neigh_vars[NEIGH_VAR_GC_THRESH1].data = (int *)(p + 1) + 1;
2973 t->neigh_vars[NEIGH_VAR_GC_THRESH2].data = (int *)(p + 1) + 2;
2974 t->neigh_vars[NEIGH_VAR_GC_THRESH3].data = (int *)(p + 1) + 3;
2980 t->neigh_vars[NEIGH_VAR_RETRANS_TIME].proc_handler = handler;
2981 t->neigh_vars[NEIGH_VAR_RETRANS_TIME].extra1 = dev;
2983 t->neigh_vars[NEIGH_VAR_BASE_REACHABLE_TIME].proc_handler = handler;
2984 t->neigh_vars[NEIGH_VAR_BASE_REACHABLE_TIME].extra1 = dev;
2985 /* RetransTime (in milliseconds)*/
2986 t->neigh_vars[NEIGH_VAR_RETRANS_TIME_MS].proc_handler = handler;
2987 t->neigh_vars[NEIGH_VAR_RETRANS_TIME_MS].extra1 = dev;
2988 /* ReachableTime (in milliseconds) */
2989 t->neigh_vars[NEIGH_VAR_BASE_REACHABLE_TIME_MS].proc_handler = handler;
2990 t->neigh_vars[NEIGH_VAR_BASE_REACHABLE_TIME_MS].extra1 = dev;
2993 /* Don't export sysctls to unprivileged users */
2994 if (neigh_parms_net(p)->user_ns != &init_user_ns)
2995 t->neigh_vars[0].procname = NULL;
2997 snprintf(neigh_path, sizeof(neigh_path), "net/%s/neigh/%s",
2998 p_name, dev_name_source);
3000 register_net_sysctl(neigh_parms_net(p), neigh_path, t->neigh_vars);
3001 if (!t->sysctl_header)
3004 p->sysctl_table = t;
3012 EXPORT_SYMBOL(neigh_sysctl_register);
3014 void neigh_sysctl_unregister(struct neigh_parms *p)
3016 if (p->sysctl_table) {
3017 struct neigh_sysctl_table *t = p->sysctl_table;
3018 p->sysctl_table = NULL;
3019 unregister_net_sysctl_table(t->sysctl_header);
3023 EXPORT_SYMBOL(neigh_sysctl_unregister);
3025 #endif /* CONFIG_SYSCTL */
3027 static int __init neigh_init(void)
3029 rtnl_register(PF_UNSPEC, RTM_NEWNEIGH, neigh_add, NULL, NULL);
3030 rtnl_register(PF_UNSPEC, RTM_DELNEIGH, neigh_delete, NULL, NULL);
3031 rtnl_register(PF_UNSPEC, RTM_GETNEIGH, NULL, neigh_dump_info, NULL);
3033 rtnl_register(PF_UNSPEC, RTM_GETNEIGHTBL, NULL, neightbl_dump_info,
3035 rtnl_register(PF_UNSPEC, RTM_SETNEIGHTBL, neightbl_set, NULL, NULL);
3040 subsys_initcall(neigh_init);