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
);
62 void neigh_changeaddr(struct neigh_table
*tbl
, struct net_device
*dev
);
64 static struct neigh_table
*neigh_tables
;
66 static const struct file_operations neigh_stat_seq_fops
;
70 Neighbour hash table buckets are protected with rwlock tbl->lock.
72 - All the scans/updates to hash buckets MUST be made under this lock.
73 - NOTHING clever should be made under this lock: no callbacks
74 to protocol backends, no attempts to send something to network.
75 It will result in deadlocks, if backend/driver wants to use neighbour
77 - If the entry requires some non-trivial actions, increase
78 its reference count and release table lock.
80 Neighbour entries are protected:
81 - with reference count.
82 - with rwlock neigh->lock
84 Reference count prevents destruction.
86 neigh->lock mainly serializes ll address data and its validity state.
87 However, the same lock is used to protect another entry fields:
91 Again, nothing clever shall be made under neigh->lock,
92 the most complicated procedure, which we allow is dev->hard_header.
93 It is supposed, that dev->hard_header is simplistic and does
94 not make callbacks to neighbour tables.
96 The last lock is neigh_tbl_lock. It is pure SMP lock, protecting
97 list of neighbour tables. This list is used only in process context,
100 static DEFINE_RWLOCK(neigh_tbl_lock
);
102 static int neigh_blackhole(struct sk_buff
*skb
)
108 static void neigh_cleanup_and_release(struct neighbour
*neigh
)
110 if (neigh
->parms
->neigh_cleanup
)
111 neigh
->parms
->neigh_cleanup(neigh
);
113 __neigh_notify(neigh
, RTM_DELNEIGH
, 0);
114 neigh_release(neigh
);
118 * It is random distribution in the interval (1/2)*base...(3/2)*base.
119 * It corresponds to default IPv6 settings and is not overridable,
120 * because it is really reasonable choice.
123 unsigned long neigh_rand_reach_time(unsigned long base
)
125 return (base
? (net_random() % base
) + (base
>> 1) : 0);
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 int neigh_del_timer(struct neighbour
*n
)
170 if ((n
->nud_state
& NUD_IN_TIMER
) &&
171 del_timer(&n
->timer
)) {
178 static void pneigh_queue_purge(struct sk_buff_head
*list
)
182 while ((skb
= skb_dequeue(list
)) != NULL
) {
188 static void neigh_flush_dev(struct neigh_table
*tbl
, struct net_device
*dev
)
192 for (i
= 0; i
<= tbl
->hash_mask
; i
++) {
193 struct neighbour
*n
, **np
= &tbl
->hash_buckets
[i
];
195 while ((n
= *np
) != NULL
) {
196 if (dev
&& n
->dev
!= dev
) {
201 write_lock(&n
->lock
);
205 if (atomic_read(&n
->refcnt
) != 1) {
206 /* The most unpleasant situation.
207 We must destroy neighbour entry,
208 but someone still uses it.
210 The destroy will be delayed until
211 the last user releases us, but
212 we must kill timers etc. and move
215 skb_queue_purge(&n
->arp_queue
);
216 n
->output
= neigh_blackhole
;
217 if (n
->nud_state
& NUD_VALID
)
218 n
->nud_state
= NUD_NOARP
;
220 n
->nud_state
= NUD_NONE
;
221 NEIGH_PRINTK2("neigh %p is stray.\n", n
);
223 write_unlock(&n
->lock
);
224 neigh_cleanup_and_release(n
);
229 void neigh_changeaddr(struct neigh_table
*tbl
, struct net_device
*dev
)
231 write_lock_bh(&tbl
->lock
);
232 neigh_flush_dev(tbl
, dev
);
233 write_unlock_bh(&tbl
->lock
);
236 int neigh_ifdown(struct neigh_table
*tbl
, struct net_device
*dev
)
238 write_lock_bh(&tbl
->lock
);
239 neigh_flush_dev(tbl
, dev
);
240 pneigh_ifdown(tbl
, dev
);
241 write_unlock_bh(&tbl
->lock
);
243 del_timer_sync(&tbl
->proxy_timer
);
244 pneigh_queue_purge(&tbl
->proxy_queue
);
248 static struct neighbour
*neigh_alloc(struct neigh_table
*tbl
)
250 struct neighbour
*n
= NULL
;
251 unsigned long now
= jiffies
;
254 entries
= atomic_inc_return(&tbl
->entries
) - 1;
255 if (entries
>= tbl
->gc_thresh3
||
256 (entries
>= tbl
->gc_thresh2
&&
257 time_after(now
, tbl
->last_flush
+ 5 * HZ
))) {
258 if (!neigh_forced_gc(tbl
) &&
259 entries
>= tbl
->gc_thresh3
)
263 n
= kmem_cache_zalloc(tbl
->kmem_cachep
, GFP_ATOMIC
);
267 skb_queue_head_init(&n
->arp_queue
);
268 rwlock_init(&n
->lock
);
269 n
->updated
= n
->used
= now
;
270 n
->nud_state
= NUD_NONE
;
271 n
->output
= neigh_blackhole
;
272 n
->parms
= neigh_parms_clone(&tbl
->parms
);
273 setup_timer(&n
->timer
, neigh_timer_handler
, (unsigned long)n
);
275 NEIGH_CACHE_STAT_INC(tbl
, allocs
);
277 atomic_set(&n
->refcnt
, 1);
283 atomic_dec(&tbl
->entries
);
287 static struct neighbour
**neigh_hash_alloc(unsigned int entries
)
289 unsigned long size
= entries
* sizeof(struct neighbour
*);
290 struct neighbour
**ret
;
292 if (size
<= PAGE_SIZE
) {
293 ret
= kzalloc(size
, GFP_ATOMIC
);
295 ret
= (struct neighbour
**)
296 __get_free_pages(GFP_ATOMIC
|__GFP_ZERO
, get_order(size
));
301 static void neigh_hash_free(struct neighbour
**hash
, unsigned int entries
)
303 unsigned long size
= entries
* sizeof(struct neighbour
*);
305 if (size
<= PAGE_SIZE
)
308 free_pages((unsigned long)hash
, get_order(size
));
311 static void neigh_hash_grow(struct neigh_table
*tbl
, unsigned long new_entries
)
313 struct neighbour
**new_hash
, **old_hash
;
314 unsigned int i
, new_hash_mask
, old_entries
;
316 NEIGH_CACHE_STAT_INC(tbl
, hash_grows
);
318 BUG_ON(!is_power_of_2(new_entries
));
319 new_hash
= neigh_hash_alloc(new_entries
);
323 old_entries
= tbl
->hash_mask
+ 1;
324 new_hash_mask
= new_entries
- 1;
325 old_hash
= tbl
->hash_buckets
;
327 get_random_bytes(&tbl
->hash_rnd
, sizeof(tbl
->hash_rnd
));
328 for (i
= 0; i
< old_entries
; i
++) {
329 struct neighbour
*n
, *next
;
331 for (n
= old_hash
[i
]; n
; n
= next
) {
332 unsigned int hash_val
= tbl
->hash(n
->primary_key
, n
->dev
);
334 hash_val
&= new_hash_mask
;
337 n
->next
= new_hash
[hash_val
];
338 new_hash
[hash_val
] = n
;
341 tbl
->hash_buckets
= new_hash
;
342 tbl
->hash_mask
= new_hash_mask
;
344 neigh_hash_free(old_hash
, old_entries
);
347 struct neighbour
*neigh_lookup(struct neigh_table
*tbl
, const void *pkey
,
348 struct net_device
*dev
)
351 int key_len
= tbl
->key_len
;
352 u32 hash_val
= tbl
->hash(pkey
, dev
);
354 NEIGH_CACHE_STAT_INC(tbl
, lookups
);
356 read_lock_bh(&tbl
->lock
);
357 for (n
= tbl
->hash_buckets
[hash_val
& tbl
->hash_mask
]; n
; n
= n
->next
) {
358 if (dev
== n
->dev
&& !memcmp(n
->primary_key
, pkey
, key_len
)) {
360 NEIGH_CACHE_STAT_INC(tbl
, hits
);
364 read_unlock_bh(&tbl
->lock
);
368 struct neighbour
*neigh_lookup_nodev(struct neigh_table
*tbl
, const void *pkey
)
371 int key_len
= tbl
->key_len
;
372 u32 hash_val
= tbl
->hash(pkey
, NULL
);
374 NEIGH_CACHE_STAT_INC(tbl
, lookups
);
376 read_lock_bh(&tbl
->lock
);
377 for (n
= tbl
->hash_buckets
[hash_val
& tbl
->hash_mask
]; n
; n
= n
->next
) {
378 if (!memcmp(n
->primary_key
, pkey
, key_len
)) {
380 NEIGH_CACHE_STAT_INC(tbl
, hits
);
384 read_unlock_bh(&tbl
->lock
);
388 struct neighbour
*neigh_create(struct neigh_table
*tbl
, const void *pkey
,
389 struct net_device
*dev
)
392 int key_len
= tbl
->key_len
;
394 struct neighbour
*n1
, *rc
, *n
= neigh_alloc(tbl
);
397 rc
= ERR_PTR(-ENOBUFS
);
401 memcpy(n
->primary_key
, pkey
, key_len
);
405 /* Protocol specific setup. */
406 if (tbl
->constructor
&& (error
= tbl
->constructor(n
)) < 0) {
408 goto out_neigh_release
;
411 /* Device specific setup. */
412 if (n
->parms
->neigh_setup
&&
413 (error
= n
->parms
->neigh_setup(n
)) < 0) {
415 goto out_neigh_release
;
418 n
->confirmed
= jiffies
- (n
->parms
->base_reachable_time
<< 1);
420 write_lock_bh(&tbl
->lock
);
422 if (atomic_read(&tbl
->entries
) > (tbl
->hash_mask
+ 1))
423 neigh_hash_grow(tbl
, (tbl
->hash_mask
+ 1) << 1);
425 hash_val
= tbl
->hash(pkey
, dev
) & tbl
->hash_mask
;
427 if (n
->parms
->dead
) {
428 rc
= ERR_PTR(-EINVAL
);
432 for (n1
= tbl
->hash_buckets
[hash_val
]; n1
; n1
= n1
->next
) {
433 if (dev
== n1
->dev
&& !memcmp(n1
->primary_key
, pkey
, key_len
)) {
440 n
->next
= tbl
->hash_buckets
[hash_val
];
441 tbl
->hash_buckets
[hash_val
] = n
;
444 write_unlock_bh(&tbl
->lock
);
445 NEIGH_PRINTK2("neigh %p is created.\n", n
);
450 write_unlock_bh(&tbl
->lock
);
456 struct pneigh_entry
* pneigh_lookup(struct neigh_table
*tbl
, const void *pkey
,
457 struct net_device
*dev
, int creat
)
459 struct pneigh_entry
*n
;
460 int key_len
= tbl
->key_len
;
461 u32 hash_val
= *(u32
*)(pkey
+ key_len
- 4);
463 hash_val
^= (hash_val
>> 16);
464 hash_val
^= hash_val
>> 8;
465 hash_val
^= hash_val
>> 4;
466 hash_val
&= PNEIGH_HASHMASK
;
468 read_lock_bh(&tbl
->lock
);
470 for (n
= tbl
->phash_buckets
[hash_val
]; n
; n
= n
->next
) {
471 if (!memcmp(n
->key
, pkey
, key_len
) &&
472 (n
->dev
== dev
|| !n
->dev
)) {
473 read_unlock_bh(&tbl
->lock
);
477 read_unlock_bh(&tbl
->lock
);
484 n
= kmalloc(sizeof(*n
) + key_len
, GFP_KERNEL
);
488 memcpy(n
->key
, pkey
, key_len
);
493 if (tbl
->pconstructor
&& tbl
->pconstructor(n
)) {
501 write_lock_bh(&tbl
->lock
);
502 n
->next
= tbl
->phash_buckets
[hash_val
];
503 tbl
->phash_buckets
[hash_val
] = n
;
504 write_unlock_bh(&tbl
->lock
);
510 int pneigh_delete(struct neigh_table
*tbl
, const void *pkey
,
511 struct net_device
*dev
)
513 struct pneigh_entry
*n
, **np
;
514 int key_len
= tbl
->key_len
;
515 u32 hash_val
= *(u32
*)(pkey
+ key_len
- 4);
517 hash_val
^= (hash_val
>> 16);
518 hash_val
^= hash_val
>> 8;
519 hash_val
^= hash_val
>> 4;
520 hash_val
&= PNEIGH_HASHMASK
;
522 write_lock_bh(&tbl
->lock
);
523 for (np
= &tbl
->phash_buckets
[hash_val
]; (n
= *np
) != NULL
;
525 if (!memcmp(n
->key
, pkey
, key_len
) && n
->dev
== dev
) {
527 write_unlock_bh(&tbl
->lock
);
528 if (tbl
->pdestructor
)
536 write_unlock_bh(&tbl
->lock
);
540 static int pneigh_ifdown(struct neigh_table
*tbl
, struct net_device
*dev
)
542 struct pneigh_entry
*n
, **np
;
545 for (h
= 0; h
<= PNEIGH_HASHMASK
; h
++) {
546 np
= &tbl
->phash_buckets
[h
];
547 while ((n
= *np
) != NULL
) {
548 if (!dev
|| n
->dev
== dev
) {
550 if (tbl
->pdestructor
)
565 * neighbour must already be out of the table;
568 void neigh_destroy(struct neighbour
*neigh
)
572 NEIGH_CACHE_STAT_INC(neigh
->tbl
, destroys
);
576 "Destroying alive neighbour %p\n", neigh
);
581 if (neigh_del_timer(neigh
))
582 printk(KERN_WARNING
"Impossible event.\n");
584 while ((hh
= neigh
->hh
) != NULL
) {
585 neigh
->hh
= hh
->hh_next
;
588 write_seqlock_bh(&hh
->hh_lock
);
589 hh
->hh_output
= neigh_blackhole
;
590 write_sequnlock_bh(&hh
->hh_lock
);
591 if (atomic_dec_and_test(&hh
->hh_refcnt
))
595 skb_queue_purge(&neigh
->arp_queue
);
598 neigh_parms_put(neigh
->parms
);
600 NEIGH_PRINTK2("neigh %p is destroyed.\n", neigh
);
602 atomic_dec(&neigh
->tbl
->entries
);
603 kmem_cache_free(neigh
->tbl
->kmem_cachep
, neigh
);
606 /* Neighbour state is suspicious;
609 Called with write_locked neigh.
611 static void neigh_suspect(struct neighbour
*neigh
)
615 NEIGH_PRINTK2("neigh %p is suspected.\n", neigh
);
617 neigh
->output
= neigh
->ops
->output
;
619 for (hh
= neigh
->hh
; hh
; hh
= hh
->hh_next
)
620 hh
->hh_output
= neigh
->ops
->output
;
623 /* Neighbour state is OK;
626 Called with write_locked neigh.
628 static void neigh_connect(struct neighbour
*neigh
)
632 NEIGH_PRINTK2("neigh %p is connected.\n", neigh
);
634 neigh
->output
= neigh
->ops
->connected_output
;
636 for (hh
= neigh
->hh
; hh
; hh
= hh
->hh_next
)
637 hh
->hh_output
= neigh
->ops
->hh_output
;
640 static void neigh_periodic_timer(unsigned long arg
)
642 struct neigh_table
*tbl
= (struct neigh_table
*)arg
;
643 struct neighbour
*n
, **np
;
644 unsigned long expire
, now
= jiffies
;
646 NEIGH_CACHE_STAT_INC(tbl
, periodic_gc_runs
);
648 write_lock(&tbl
->lock
);
651 * periodically recompute ReachableTime from random function
654 if (time_after(now
, tbl
->last_rand
+ 300 * HZ
)) {
655 struct neigh_parms
*p
;
656 tbl
->last_rand
= now
;
657 for (p
= &tbl
->parms
; p
; p
= p
->next
)
659 neigh_rand_reach_time(p
->base_reachable_time
);
662 np
= &tbl
->hash_buckets
[tbl
->hash_chain_gc
];
663 tbl
->hash_chain_gc
= ((tbl
->hash_chain_gc
+ 1) & tbl
->hash_mask
);
665 while ((n
= *np
) != NULL
) {
668 write_lock(&n
->lock
);
670 state
= n
->nud_state
;
671 if (state
& (NUD_PERMANENT
| NUD_IN_TIMER
)) {
672 write_unlock(&n
->lock
);
676 if (time_before(n
->used
, n
->confirmed
))
677 n
->used
= n
->confirmed
;
679 if (atomic_read(&n
->refcnt
) == 1 &&
680 (state
== NUD_FAILED
||
681 time_after(now
, n
->used
+ n
->parms
->gc_staletime
))) {
684 write_unlock(&n
->lock
);
685 neigh_cleanup_and_release(n
);
688 write_unlock(&n
->lock
);
694 /* Cycle through all hash buckets every base_reachable_time/2 ticks.
695 * ARP entry timeouts range from 1/2 base_reachable_time to 3/2
696 * base_reachable_time.
698 expire
= tbl
->parms
.base_reachable_time
>> 1;
699 expire
/= (tbl
->hash_mask
+ 1);
704 mod_timer(&tbl
->gc_timer
, round_jiffies(now
+ expire
));
706 mod_timer(&tbl
->gc_timer
, now
+ expire
);
708 write_unlock(&tbl
->lock
);
711 static __inline__
int neigh_max_probes(struct neighbour
*n
)
713 struct neigh_parms
*p
= n
->parms
;
714 return (n
->nud_state
& NUD_PROBE
?
716 p
->ucast_probes
+ p
->app_probes
+ p
->mcast_probes
);
719 static inline void neigh_add_timer(struct neighbour
*n
, unsigned long when
)
721 if (unlikely(mod_timer(&n
->timer
, when
))) {
722 printk("NEIGH: BUG, double timer add, state is %x\n",
728 /* Called when a timer expires for a neighbour entry. */
730 static void neigh_timer_handler(unsigned long arg
)
732 unsigned long now
, next
;
733 struct neighbour
*neigh
= (struct neighbour
*)arg
;
737 write_lock(&neigh
->lock
);
739 state
= neigh
->nud_state
;
743 if (!(state
& NUD_IN_TIMER
)) {
745 printk(KERN_WARNING
"neigh: timer & !nud_in_timer\n");
750 if (state
& NUD_REACHABLE
) {
751 if (time_before_eq(now
,
752 neigh
->confirmed
+ neigh
->parms
->reachable_time
)) {
753 NEIGH_PRINTK2("neigh %p is still alive.\n", neigh
);
754 next
= neigh
->confirmed
+ neigh
->parms
->reachable_time
;
755 } else if (time_before_eq(now
,
756 neigh
->used
+ neigh
->parms
->delay_probe_time
)) {
757 NEIGH_PRINTK2("neigh %p is delayed.\n", neigh
);
758 neigh
->nud_state
= NUD_DELAY
;
759 neigh
->updated
= jiffies
;
760 neigh_suspect(neigh
);
761 next
= now
+ neigh
->parms
->delay_probe_time
;
763 NEIGH_PRINTK2("neigh %p is suspected.\n", neigh
);
764 neigh
->nud_state
= NUD_STALE
;
765 neigh
->updated
= jiffies
;
766 neigh_suspect(neigh
);
769 } else if (state
& NUD_DELAY
) {
770 if (time_before_eq(now
,
771 neigh
->confirmed
+ neigh
->parms
->delay_probe_time
)) {
772 NEIGH_PRINTK2("neigh %p is now reachable.\n", neigh
);
773 neigh
->nud_state
= NUD_REACHABLE
;
774 neigh
->updated
= jiffies
;
775 neigh_connect(neigh
);
777 next
= neigh
->confirmed
+ neigh
->parms
->reachable_time
;
779 NEIGH_PRINTK2("neigh %p is probed.\n", neigh
);
780 neigh
->nud_state
= NUD_PROBE
;
781 neigh
->updated
= jiffies
;
782 atomic_set(&neigh
->probes
, 0);
783 next
= now
+ neigh
->parms
->retrans_time
;
786 /* NUD_PROBE|NUD_INCOMPLETE */
787 next
= now
+ neigh
->parms
->retrans_time
;
790 if ((neigh
->nud_state
& (NUD_INCOMPLETE
| NUD_PROBE
)) &&
791 atomic_read(&neigh
->probes
) >= neigh_max_probes(neigh
)) {
794 neigh
->nud_state
= NUD_FAILED
;
795 neigh
->updated
= jiffies
;
797 NEIGH_CACHE_STAT_INC(neigh
->tbl
, res_failed
);
798 NEIGH_PRINTK2("neigh %p is failed.\n", neigh
);
800 /* It is very thin place. report_unreachable is very complicated
801 routine. Particularly, it can hit the same neighbour entry!
803 So that, we try to be accurate and avoid dead loop. --ANK
805 while (neigh
->nud_state
== NUD_FAILED
&&
806 (skb
= __skb_dequeue(&neigh
->arp_queue
)) != NULL
) {
807 write_unlock(&neigh
->lock
);
808 neigh
->ops
->error_report(neigh
, skb
);
809 write_lock(&neigh
->lock
);
811 skb_queue_purge(&neigh
->arp_queue
);
814 if (neigh
->nud_state
& NUD_IN_TIMER
) {
815 if (time_before(next
, jiffies
+ HZ
/2))
816 next
= jiffies
+ HZ
/2;
817 if (!mod_timer(&neigh
->timer
, next
))
820 if (neigh
->nud_state
& (NUD_INCOMPLETE
| NUD_PROBE
)) {
821 struct sk_buff
*skb
= skb_peek(&neigh
->arp_queue
);
822 /* keep skb alive even if arp_queue overflows */
825 write_unlock(&neigh
->lock
);
826 neigh
->ops
->solicit(neigh
, skb
);
827 atomic_inc(&neigh
->probes
);
832 write_unlock(&neigh
->lock
);
836 neigh_update_notify(neigh
);
838 neigh_release(neigh
);
841 int __neigh_event_send(struct neighbour
*neigh
, struct sk_buff
*skb
)
846 write_lock_bh(&neigh
->lock
);
849 if (neigh
->nud_state
& (NUD_CONNECTED
| NUD_DELAY
| NUD_PROBE
))
854 if (!(neigh
->nud_state
& (NUD_STALE
| NUD_INCOMPLETE
))) {
855 if (neigh
->parms
->mcast_probes
+ neigh
->parms
->app_probes
) {
856 atomic_set(&neigh
->probes
, neigh
->parms
->ucast_probes
);
857 neigh
->nud_state
= NUD_INCOMPLETE
;
858 neigh
->updated
= jiffies
;
860 neigh_add_timer(neigh
, now
+ 1);
862 neigh
->nud_state
= NUD_FAILED
;
863 neigh
->updated
= jiffies
;
864 write_unlock_bh(&neigh
->lock
);
870 } else if (neigh
->nud_state
& NUD_STALE
) {
871 NEIGH_PRINTK2("neigh %p is delayed.\n", neigh
);
873 neigh
->nud_state
= NUD_DELAY
;
874 neigh
->updated
= jiffies
;
875 neigh_add_timer(neigh
,
876 jiffies
+ neigh
->parms
->delay_probe_time
);
879 if (neigh
->nud_state
== NUD_INCOMPLETE
) {
881 if (skb_queue_len(&neigh
->arp_queue
) >=
882 neigh
->parms
->queue_len
) {
883 struct sk_buff
*buff
;
884 buff
= neigh
->arp_queue
.next
;
885 __skb_unlink(buff
, &neigh
->arp_queue
);
888 __skb_queue_tail(&neigh
->arp_queue
, skb
);
893 write_unlock_bh(&neigh
->lock
);
897 static void neigh_update_hhs(struct neighbour
*neigh
)
900 void (*update
)(struct hh_cache
*, const struct net_device
*, const unsigned char *)
901 = neigh
->dev
->header_ops
->cache_update
;
904 for (hh
= neigh
->hh
; hh
; hh
= hh
->hh_next
) {
905 write_seqlock_bh(&hh
->hh_lock
);
906 update(hh
, neigh
->dev
, neigh
->ha
);
907 write_sequnlock_bh(&hh
->hh_lock
);
914 /* Generic update routine.
915 -- lladdr is new lladdr or NULL, if it is not supplied.
918 NEIGH_UPDATE_F_OVERRIDE allows to override existing lladdr,
920 NEIGH_UPDATE_F_WEAK_OVERRIDE will suspect existing "connected"
921 lladdr instead of overriding it
923 It also allows to retain current state
924 if lladdr is unchanged.
925 NEIGH_UPDATE_F_ADMIN means that the change is administrative.
927 NEIGH_UPDATE_F_OVERRIDE_ISROUTER allows to override existing
929 NEIGH_UPDATE_F_ISROUTER indicates if the neighbour is known as
932 Caller MUST hold reference count on the entry.
935 int neigh_update(struct neighbour
*neigh
, const u8
*lladdr
, u8
new,
941 struct net_device
*dev
;
942 int update_isrouter
= 0;
944 write_lock_bh(&neigh
->lock
);
947 old
= neigh
->nud_state
;
950 if (!(flags
& NEIGH_UPDATE_F_ADMIN
) &&
951 (old
& (NUD_NOARP
| NUD_PERMANENT
)))
954 if (!(new & NUD_VALID
)) {
955 neigh_del_timer(neigh
);
956 if (old
& NUD_CONNECTED
)
957 neigh_suspect(neigh
);
958 neigh
->nud_state
= new;
960 notify
= old
& NUD_VALID
;
964 /* Compare new lladdr with cached one */
965 if (!dev
->addr_len
) {
966 /* First case: device needs no address. */
969 /* The second case: if something is already cached
970 and a new address is proposed:
972 - if they are different, check override flag
974 if ((old
& NUD_VALID
) &&
975 !memcmp(lladdr
, neigh
->ha
, dev
->addr_len
))
978 /* No address is supplied; if we know something,
979 use it, otherwise discard the request.
982 if (!(old
& NUD_VALID
))
987 if (new & NUD_CONNECTED
)
988 neigh
->confirmed
= jiffies
;
989 neigh
->updated
= jiffies
;
991 /* If entry was valid and address is not changed,
992 do not change entry state, if new one is STALE.
995 update_isrouter
= flags
& NEIGH_UPDATE_F_OVERRIDE_ISROUTER
;
996 if (old
& NUD_VALID
) {
997 if (lladdr
!= neigh
->ha
&& !(flags
& NEIGH_UPDATE_F_OVERRIDE
)) {
999 if ((flags
& NEIGH_UPDATE_F_WEAK_OVERRIDE
) &&
1000 (old
& NUD_CONNECTED
)) {
1006 if (lladdr
== neigh
->ha
&& new == NUD_STALE
&&
1007 ((flags
& NEIGH_UPDATE_F_WEAK_OVERRIDE
) ||
1008 (old
& NUD_CONNECTED
))
1015 neigh_del_timer(neigh
);
1016 if (new & NUD_IN_TIMER
) {
1018 neigh_add_timer(neigh
, (jiffies
+
1019 ((new & NUD_REACHABLE
) ?
1020 neigh
->parms
->reachable_time
:
1023 neigh
->nud_state
= new;
1026 if (lladdr
!= neigh
->ha
) {
1027 memcpy(&neigh
->ha
, lladdr
, dev
->addr_len
);
1028 neigh_update_hhs(neigh
);
1029 if (!(new & NUD_CONNECTED
))
1030 neigh
->confirmed
= jiffies
-
1031 (neigh
->parms
->base_reachable_time
<< 1);
1036 if (new & NUD_CONNECTED
)
1037 neigh_connect(neigh
);
1039 neigh_suspect(neigh
);
1040 if (!(old
& NUD_VALID
)) {
1041 struct sk_buff
*skb
;
1043 /* Again: avoid dead loop if something went wrong */
1045 while (neigh
->nud_state
& NUD_VALID
&&
1046 (skb
= __skb_dequeue(&neigh
->arp_queue
)) != NULL
) {
1047 struct neighbour
*n1
= neigh
;
1048 write_unlock_bh(&neigh
->lock
);
1049 /* On shaper/eql skb->dst->neighbour != neigh :( */
1050 if (skb
->dst
&& skb
->dst
->neighbour
)
1051 n1
= skb
->dst
->neighbour
;
1053 write_lock_bh(&neigh
->lock
);
1055 skb_queue_purge(&neigh
->arp_queue
);
1058 if (update_isrouter
) {
1059 neigh
->flags
= (flags
& NEIGH_UPDATE_F_ISROUTER
) ?
1060 (neigh
->flags
| NTF_ROUTER
) :
1061 (neigh
->flags
& ~NTF_ROUTER
);
1063 write_unlock_bh(&neigh
->lock
);
1066 neigh_update_notify(neigh
);
1071 struct neighbour
*neigh_event_ns(struct neigh_table
*tbl
,
1072 u8
*lladdr
, void *saddr
,
1073 struct net_device
*dev
)
1075 struct neighbour
*neigh
= __neigh_lookup(tbl
, saddr
, dev
,
1076 lladdr
|| !dev
->addr_len
);
1078 neigh_update(neigh
, lladdr
, NUD_STALE
,
1079 NEIGH_UPDATE_F_OVERRIDE
);
1083 static void neigh_hh_init(struct neighbour
*n
, struct dst_entry
*dst
,
1086 struct hh_cache
*hh
;
1087 struct net_device
*dev
= dst
->dev
;
1089 for (hh
= n
->hh
; hh
; hh
= hh
->hh_next
)
1090 if (hh
->hh_type
== protocol
)
1093 if (!hh
&& (hh
= kzalloc(sizeof(*hh
), GFP_ATOMIC
)) != NULL
) {
1094 seqlock_init(&hh
->hh_lock
);
1095 hh
->hh_type
= protocol
;
1096 atomic_set(&hh
->hh_refcnt
, 0);
1099 if (dev
->header_ops
->cache(n
, hh
)) {
1103 atomic_inc(&hh
->hh_refcnt
);
1104 hh
->hh_next
= n
->hh
;
1106 if (n
->nud_state
& NUD_CONNECTED
)
1107 hh
->hh_output
= n
->ops
->hh_output
;
1109 hh
->hh_output
= n
->ops
->output
;
1113 atomic_inc(&hh
->hh_refcnt
);
1118 /* This function can be used in contexts, where only old dev_queue_xmit
1119 worked, f.e. if you want to override normal output path (eql, shaper),
1120 but resolution is not made yet.
1123 int neigh_compat_output(struct sk_buff
*skb
)
1125 struct net_device
*dev
= skb
->dev
;
1127 __skb_pull(skb
, skb_network_offset(skb
));
1129 if (dev_hard_header(skb
, dev
, ntohs(skb
->protocol
), NULL
, NULL
,
1131 dev
->header_ops
->rebuild(skb
))
1134 return dev_queue_xmit(skb
);
1137 /* Slow and careful. */
1139 int neigh_resolve_output(struct sk_buff
*skb
)
1141 struct dst_entry
*dst
= skb
->dst
;
1142 struct neighbour
*neigh
;
1145 if (!dst
|| !(neigh
= dst
->neighbour
))
1148 __skb_pull(skb
, skb_network_offset(skb
));
1150 if (!neigh_event_send(neigh
, skb
)) {
1152 struct net_device
*dev
= neigh
->dev
;
1153 if (dev
->header_ops
->cache
&& !dst
->hh
) {
1154 write_lock_bh(&neigh
->lock
);
1156 neigh_hh_init(neigh
, dst
, dst
->ops
->protocol
);
1157 err
= dev_hard_header(skb
, dev
, ntohs(skb
->protocol
),
1158 neigh
->ha
, NULL
, skb
->len
);
1159 write_unlock_bh(&neigh
->lock
);
1161 read_lock_bh(&neigh
->lock
);
1162 err
= dev_hard_header(skb
, dev
, ntohs(skb
->protocol
),
1163 neigh
->ha
, NULL
, skb
->len
);
1164 read_unlock_bh(&neigh
->lock
);
1167 rc
= neigh
->ops
->queue_xmit(skb
);
1174 NEIGH_PRINTK1("neigh_resolve_output: dst=%p neigh=%p\n",
1175 dst
, dst
? dst
->neighbour
: NULL
);
1182 /* As fast as possible without hh cache */
1184 int neigh_connected_output(struct sk_buff
*skb
)
1187 struct dst_entry
*dst
= skb
->dst
;
1188 struct neighbour
*neigh
= dst
->neighbour
;
1189 struct net_device
*dev
= neigh
->dev
;
1191 __skb_pull(skb
, skb_network_offset(skb
));
1193 read_lock_bh(&neigh
->lock
);
1194 err
= dev_hard_header(skb
, dev
, ntohs(skb
->protocol
),
1195 neigh
->ha
, NULL
, skb
->len
);
1196 read_unlock_bh(&neigh
->lock
);
1198 err
= neigh
->ops
->queue_xmit(skb
);
1206 static void neigh_proxy_process(unsigned long arg
)
1208 struct neigh_table
*tbl
= (struct neigh_table
*)arg
;
1209 long sched_next
= 0;
1210 unsigned long now
= jiffies
;
1211 struct sk_buff
*skb
;
1213 spin_lock(&tbl
->proxy_queue
.lock
);
1215 skb
= tbl
->proxy_queue
.next
;
1217 while (skb
!= (struct sk_buff
*)&tbl
->proxy_queue
) {
1218 struct sk_buff
*back
= skb
;
1219 long tdif
= NEIGH_CB(back
)->sched_next
- now
;
1223 struct net_device
*dev
= back
->dev
;
1224 __skb_unlink(back
, &tbl
->proxy_queue
);
1225 if (tbl
->proxy_redo
&& netif_running(dev
))
1226 tbl
->proxy_redo(back
);
1231 } else if (!sched_next
|| tdif
< sched_next
)
1234 del_timer(&tbl
->proxy_timer
);
1236 mod_timer(&tbl
->proxy_timer
, jiffies
+ sched_next
);
1237 spin_unlock(&tbl
->proxy_queue
.lock
);
1240 void pneigh_enqueue(struct neigh_table
*tbl
, struct neigh_parms
*p
,
1241 struct sk_buff
*skb
)
1243 unsigned long now
= jiffies
;
1244 unsigned long sched_next
= now
+ (net_random() % p
->proxy_delay
);
1246 if (tbl
->proxy_queue
.qlen
> p
->proxy_qlen
) {
1251 NEIGH_CB(skb
)->sched_next
= sched_next
;
1252 NEIGH_CB(skb
)->flags
|= LOCALLY_ENQUEUED
;
1254 spin_lock(&tbl
->proxy_queue
.lock
);
1255 if (del_timer(&tbl
->proxy_timer
)) {
1256 if (time_before(tbl
->proxy_timer
.expires
, sched_next
))
1257 sched_next
= tbl
->proxy_timer
.expires
;
1259 dst_release(skb
->dst
);
1262 __skb_queue_tail(&tbl
->proxy_queue
, skb
);
1263 mod_timer(&tbl
->proxy_timer
, sched_next
);
1264 spin_unlock(&tbl
->proxy_queue
.lock
);
1268 struct neigh_parms
*neigh_parms_alloc(struct net_device
*dev
,
1269 struct neigh_table
*tbl
)
1271 struct neigh_parms
*p
= kmemdup(&tbl
->parms
, sizeof(*p
), GFP_KERNEL
);
1275 atomic_set(&p
->refcnt
, 1);
1276 INIT_RCU_HEAD(&p
->rcu_head
);
1278 neigh_rand_reach_time(p
->base_reachable_time
);
1280 if (dev
->neigh_setup
&& dev
->neigh_setup(dev
, p
)) {
1288 p
->sysctl_table
= NULL
;
1289 write_lock_bh(&tbl
->lock
);
1290 p
->next
= tbl
->parms
.next
;
1291 tbl
->parms
.next
= p
;
1292 write_unlock_bh(&tbl
->lock
);
1297 static void neigh_rcu_free_parms(struct rcu_head
*head
)
1299 struct neigh_parms
*parms
=
1300 container_of(head
, struct neigh_parms
, rcu_head
);
1302 neigh_parms_put(parms
);
1305 void neigh_parms_release(struct neigh_table
*tbl
, struct neigh_parms
*parms
)
1307 struct neigh_parms
**p
;
1309 if (!parms
|| parms
== &tbl
->parms
)
1311 write_lock_bh(&tbl
->lock
);
1312 for (p
= &tbl
->parms
.next
; *p
; p
= &(*p
)->next
) {
1316 write_unlock_bh(&tbl
->lock
);
1318 dev_put(parms
->dev
);
1319 call_rcu(&parms
->rcu_head
, neigh_rcu_free_parms
);
1323 write_unlock_bh(&tbl
->lock
);
1324 NEIGH_PRINTK1("neigh_parms_release: not found\n");
1327 void neigh_parms_destroy(struct neigh_parms
*parms
)
1332 static struct lock_class_key neigh_table_proxy_queue_class
;
1334 void neigh_table_init_no_netlink(struct neigh_table
*tbl
)
1336 unsigned long now
= jiffies
;
1337 unsigned long phsize
;
1339 atomic_set(&tbl
->parms
.refcnt
, 1);
1340 INIT_RCU_HEAD(&tbl
->parms
.rcu_head
);
1341 tbl
->parms
.reachable_time
=
1342 neigh_rand_reach_time(tbl
->parms
.base_reachable_time
);
1344 if (!tbl
->kmem_cachep
)
1346 kmem_cache_create(tbl
->id
, tbl
->entry_size
, 0,
1347 SLAB_HWCACHE_ALIGN
|SLAB_PANIC
,
1349 tbl
->stats
= alloc_percpu(struct neigh_statistics
);
1351 panic("cannot create neighbour cache statistics");
1353 #ifdef CONFIG_PROC_FS
1354 tbl
->pde
= create_proc_entry(tbl
->id
, 0, init_net
.proc_net_stat
);
1356 panic("cannot create neighbour proc dir entry");
1357 tbl
->pde
->proc_fops
= &neigh_stat_seq_fops
;
1358 tbl
->pde
->data
= tbl
;
1362 tbl
->hash_buckets
= neigh_hash_alloc(tbl
->hash_mask
+ 1);
1364 phsize
= (PNEIGH_HASHMASK
+ 1) * sizeof(struct pneigh_entry
*);
1365 tbl
->phash_buckets
= kzalloc(phsize
, GFP_KERNEL
);
1367 if (!tbl
->hash_buckets
|| !tbl
->phash_buckets
)
1368 panic("cannot allocate neighbour cache hashes");
1370 get_random_bytes(&tbl
->hash_rnd
, sizeof(tbl
->hash_rnd
));
1372 rwlock_init(&tbl
->lock
);
1373 setup_timer(&tbl
->gc_timer
, neigh_periodic_timer
, (unsigned long)tbl
);
1374 tbl
->gc_timer
.expires
= now
+ 1;
1375 add_timer(&tbl
->gc_timer
);
1377 setup_timer(&tbl
->proxy_timer
, neigh_proxy_process
, (unsigned long)tbl
);
1378 skb_queue_head_init_class(&tbl
->proxy_queue
,
1379 &neigh_table_proxy_queue_class
);
1381 tbl
->last_flush
= now
;
1382 tbl
->last_rand
= now
+ tbl
->parms
.reachable_time
* 20;
1385 void neigh_table_init(struct neigh_table
*tbl
)
1387 struct neigh_table
*tmp
;
1389 neigh_table_init_no_netlink(tbl
);
1390 write_lock(&neigh_tbl_lock
);
1391 for (tmp
= neigh_tables
; tmp
; tmp
= tmp
->next
) {
1392 if (tmp
->family
== tbl
->family
)
1395 tbl
->next
= neigh_tables
;
1397 write_unlock(&neigh_tbl_lock
);
1399 if (unlikely(tmp
)) {
1400 printk(KERN_ERR
"NEIGH: Registering multiple tables for "
1401 "family %d\n", tbl
->family
);
1406 int neigh_table_clear(struct neigh_table
*tbl
)
1408 struct neigh_table
**tp
;
1410 /* It is not clean... Fix it to unload IPv6 module safely */
1411 del_timer_sync(&tbl
->gc_timer
);
1412 del_timer_sync(&tbl
->proxy_timer
);
1413 pneigh_queue_purge(&tbl
->proxy_queue
);
1414 neigh_ifdown(tbl
, NULL
);
1415 if (atomic_read(&tbl
->entries
))
1416 printk(KERN_CRIT
"neighbour leakage\n");
1417 write_lock(&neigh_tbl_lock
);
1418 for (tp
= &neigh_tables
; *tp
; tp
= &(*tp
)->next
) {
1424 write_unlock(&neigh_tbl_lock
);
1426 neigh_hash_free(tbl
->hash_buckets
, tbl
->hash_mask
+ 1);
1427 tbl
->hash_buckets
= NULL
;
1429 kfree(tbl
->phash_buckets
);
1430 tbl
->phash_buckets
= NULL
;
1432 remove_proc_entry(tbl
->id
, init_net
.proc_net_stat
);
1434 free_percpu(tbl
->stats
);
1437 kmem_cache_destroy(tbl
->kmem_cachep
);
1438 tbl
->kmem_cachep
= NULL
;
1443 static int neigh_delete(struct sk_buff
*skb
, struct nlmsghdr
*nlh
, void *arg
)
1445 struct net
*net
= skb
->sk
->sk_net
;
1447 struct nlattr
*dst_attr
;
1448 struct neigh_table
*tbl
;
1449 struct net_device
*dev
= NULL
;
1452 if (nlmsg_len(nlh
) < sizeof(*ndm
))
1455 dst_attr
= nlmsg_find_attr(nlh
, sizeof(*ndm
), NDA_DST
);
1456 if (dst_attr
== NULL
)
1459 ndm
= nlmsg_data(nlh
);
1460 if (ndm
->ndm_ifindex
) {
1461 dev
= dev_get_by_index(net
, ndm
->ndm_ifindex
);
1468 read_lock(&neigh_tbl_lock
);
1469 for (tbl
= neigh_tables
; tbl
; tbl
= tbl
->next
) {
1470 struct neighbour
*neigh
;
1472 if (tbl
->family
!= ndm
->ndm_family
)
1474 read_unlock(&neigh_tbl_lock
);
1476 if (nla_len(dst_attr
) < tbl
->key_len
)
1479 if (ndm
->ndm_flags
& NTF_PROXY
) {
1480 err
= pneigh_delete(tbl
, nla_data(dst_attr
), dev
);
1487 neigh
= neigh_lookup(tbl
, nla_data(dst_attr
), dev
);
1488 if (neigh
== NULL
) {
1493 err
= neigh_update(neigh
, NULL
, NUD_FAILED
,
1494 NEIGH_UPDATE_F_OVERRIDE
|
1495 NEIGH_UPDATE_F_ADMIN
);
1496 neigh_release(neigh
);
1499 read_unlock(&neigh_tbl_lock
);
1500 err
= -EAFNOSUPPORT
;
1509 static int neigh_add(struct sk_buff
*skb
, struct nlmsghdr
*nlh
, void *arg
)
1511 struct net
*net
= skb
->sk
->sk_net
;
1513 struct nlattr
*tb
[NDA_MAX
+1];
1514 struct neigh_table
*tbl
;
1515 struct net_device
*dev
= NULL
;
1518 err
= nlmsg_parse(nlh
, sizeof(*ndm
), tb
, NDA_MAX
, NULL
);
1523 if (tb
[NDA_DST
] == NULL
)
1526 ndm
= nlmsg_data(nlh
);
1527 if (ndm
->ndm_ifindex
) {
1528 dev
= dev_get_by_index(net
, ndm
->ndm_ifindex
);
1534 if (tb
[NDA_LLADDR
] && nla_len(tb
[NDA_LLADDR
]) < dev
->addr_len
)
1538 read_lock(&neigh_tbl_lock
);
1539 for (tbl
= neigh_tables
; tbl
; tbl
= tbl
->next
) {
1540 int flags
= NEIGH_UPDATE_F_ADMIN
| NEIGH_UPDATE_F_OVERRIDE
;
1541 struct neighbour
*neigh
;
1544 if (tbl
->family
!= ndm
->ndm_family
)
1546 read_unlock(&neigh_tbl_lock
);
1548 if (nla_len(tb
[NDA_DST
]) < tbl
->key_len
)
1550 dst
= nla_data(tb
[NDA_DST
]);
1551 lladdr
= tb
[NDA_LLADDR
] ? nla_data(tb
[NDA_LLADDR
]) : NULL
;
1553 if (ndm
->ndm_flags
& NTF_PROXY
) {
1554 struct pneigh_entry
*pn
;
1557 pn
= pneigh_lookup(tbl
, dst
, dev
, 1);
1559 pn
->flags
= ndm
->ndm_flags
;
1568 neigh
= neigh_lookup(tbl
, dst
, dev
);
1569 if (neigh
== NULL
) {
1570 if (!(nlh
->nlmsg_flags
& NLM_F_CREATE
)) {
1575 neigh
= __neigh_lookup_errno(tbl
, dst
, dev
);
1576 if (IS_ERR(neigh
)) {
1577 err
= PTR_ERR(neigh
);
1581 if (nlh
->nlmsg_flags
& NLM_F_EXCL
) {
1583 neigh_release(neigh
);
1587 if (!(nlh
->nlmsg_flags
& NLM_F_REPLACE
))
1588 flags
&= ~NEIGH_UPDATE_F_OVERRIDE
;
1591 err
= neigh_update(neigh
, lladdr
, ndm
->ndm_state
, flags
);
1592 neigh_release(neigh
);
1596 read_unlock(&neigh_tbl_lock
);
1597 err
= -EAFNOSUPPORT
;
1606 static int neightbl_fill_parms(struct sk_buff
*skb
, struct neigh_parms
*parms
)
1608 struct nlattr
*nest
;
1610 nest
= nla_nest_start(skb
, NDTA_PARMS
);
1615 NLA_PUT_U32(skb
, NDTPA_IFINDEX
, parms
->dev
->ifindex
);
1617 NLA_PUT_U32(skb
, NDTPA_REFCNT
, atomic_read(&parms
->refcnt
));
1618 NLA_PUT_U32(skb
, NDTPA_QUEUE_LEN
, parms
->queue_len
);
1619 NLA_PUT_U32(skb
, NDTPA_PROXY_QLEN
, parms
->proxy_qlen
);
1620 NLA_PUT_U32(skb
, NDTPA_APP_PROBES
, parms
->app_probes
);
1621 NLA_PUT_U32(skb
, NDTPA_UCAST_PROBES
, parms
->ucast_probes
);
1622 NLA_PUT_U32(skb
, NDTPA_MCAST_PROBES
, parms
->mcast_probes
);
1623 NLA_PUT_MSECS(skb
, NDTPA_REACHABLE_TIME
, parms
->reachable_time
);
1624 NLA_PUT_MSECS(skb
, NDTPA_BASE_REACHABLE_TIME
,
1625 parms
->base_reachable_time
);
1626 NLA_PUT_MSECS(skb
, NDTPA_GC_STALETIME
, parms
->gc_staletime
);
1627 NLA_PUT_MSECS(skb
, NDTPA_DELAY_PROBE_TIME
, parms
->delay_probe_time
);
1628 NLA_PUT_MSECS(skb
, NDTPA_RETRANS_TIME
, parms
->retrans_time
);
1629 NLA_PUT_MSECS(skb
, NDTPA_ANYCAST_DELAY
, parms
->anycast_delay
);
1630 NLA_PUT_MSECS(skb
, NDTPA_PROXY_DELAY
, parms
->proxy_delay
);
1631 NLA_PUT_MSECS(skb
, NDTPA_LOCKTIME
, parms
->locktime
);
1633 return nla_nest_end(skb
, nest
);
1636 return nla_nest_cancel(skb
, nest
);
1639 static int neightbl_fill_info(struct sk_buff
*skb
, struct neigh_table
*tbl
,
1640 u32 pid
, u32 seq
, int type
, int flags
)
1642 struct nlmsghdr
*nlh
;
1643 struct ndtmsg
*ndtmsg
;
1645 nlh
= nlmsg_put(skb
, pid
, seq
, type
, sizeof(*ndtmsg
), flags
);
1649 ndtmsg
= nlmsg_data(nlh
);
1651 read_lock_bh(&tbl
->lock
);
1652 ndtmsg
->ndtm_family
= tbl
->family
;
1653 ndtmsg
->ndtm_pad1
= 0;
1654 ndtmsg
->ndtm_pad2
= 0;
1656 NLA_PUT_STRING(skb
, NDTA_NAME
, tbl
->id
);
1657 NLA_PUT_MSECS(skb
, NDTA_GC_INTERVAL
, tbl
->gc_interval
);
1658 NLA_PUT_U32(skb
, NDTA_THRESH1
, tbl
->gc_thresh1
);
1659 NLA_PUT_U32(skb
, NDTA_THRESH2
, tbl
->gc_thresh2
);
1660 NLA_PUT_U32(skb
, NDTA_THRESH3
, tbl
->gc_thresh3
);
1663 unsigned long now
= jiffies
;
1664 unsigned int flush_delta
= now
- tbl
->last_flush
;
1665 unsigned int rand_delta
= now
- tbl
->last_rand
;
1667 struct ndt_config ndc
= {
1668 .ndtc_key_len
= tbl
->key_len
,
1669 .ndtc_entry_size
= tbl
->entry_size
,
1670 .ndtc_entries
= atomic_read(&tbl
->entries
),
1671 .ndtc_last_flush
= jiffies_to_msecs(flush_delta
),
1672 .ndtc_last_rand
= jiffies_to_msecs(rand_delta
),
1673 .ndtc_hash_rnd
= tbl
->hash_rnd
,
1674 .ndtc_hash_mask
= tbl
->hash_mask
,
1675 .ndtc_hash_chain_gc
= tbl
->hash_chain_gc
,
1676 .ndtc_proxy_qlen
= tbl
->proxy_queue
.qlen
,
1679 NLA_PUT(skb
, NDTA_CONFIG
, sizeof(ndc
), &ndc
);
1684 struct ndt_stats ndst
;
1686 memset(&ndst
, 0, sizeof(ndst
));
1688 for_each_possible_cpu(cpu
) {
1689 struct neigh_statistics
*st
;
1691 st
= per_cpu_ptr(tbl
->stats
, cpu
);
1692 ndst
.ndts_allocs
+= st
->allocs
;
1693 ndst
.ndts_destroys
+= st
->destroys
;
1694 ndst
.ndts_hash_grows
+= st
->hash_grows
;
1695 ndst
.ndts_res_failed
+= st
->res_failed
;
1696 ndst
.ndts_lookups
+= st
->lookups
;
1697 ndst
.ndts_hits
+= st
->hits
;
1698 ndst
.ndts_rcv_probes_mcast
+= st
->rcv_probes_mcast
;
1699 ndst
.ndts_rcv_probes_ucast
+= st
->rcv_probes_ucast
;
1700 ndst
.ndts_periodic_gc_runs
+= st
->periodic_gc_runs
;
1701 ndst
.ndts_forced_gc_runs
+= st
->forced_gc_runs
;
1704 NLA_PUT(skb
, NDTA_STATS
, sizeof(ndst
), &ndst
);
1707 BUG_ON(tbl
->parms
.dev
);
1708 if (neightbl_fill_parms(skb
, &tbl
->parms
) < 0)
1709 goto nla_put_failure
;
1711 read_unlock_bh(&tbl
->lock
);
1712 return nlmsg_end(skb
, nlh
);
1715 read_unlock_bh(&tbl
->lock
);
1716 nlmsg_cancel(skb
, nlh
);
1720 static int neightbl_fill_param_info(struct sk_buff
*skb
,
1721 struct neigh_table
*tbl
,
1722 struct neigh_parms
*parms
,
1723 u32 pid
, u32 seq
, int type
,
1726 struct ndtmsg
*ndtmsg
;
1727 struct nlmsghdr
*nlh
;
1729 nlh
= nlmsg_put(skb
, pid
, seq
, type
, sizeof(*ndtmsg
), flags
);
1733 ndtmsg
= nlmsg_data(nlh
);
1735 read_lock_bh(&tbl
->lock
);
1736 ndtmsg
->ndtm_family
= tbl
->family
;
1737 ndtmsg
->ndtm_pad1
= 0;
1738 ndtmsg
->ndtm_pad2
= 0;
1740 if (nla_put_string(skb
, NDTA_NAME
, tbl
->id
) < 0 ||
1741 neightbl_fill_parms(skb
, parms
) < 0)
1744 read_unlock_bh(&tbl
->lock
);
1745 return nlmsg_end(skb
, nlh
);
1747 read_unlock_bh(&tbl
->lock
);
1748 nlmsg_cancel(skb
, nlh
);
1752 static inline struct neigh_parms
*lookup_neigh_params(struct neigh_table
*tbl
,
1755 struct neigh_parms
*p
;
1757 for (p
= &tbl
->parms
; p
; p
= p
->next
)
1758 if ((p
->dev
&& p
->dev
->ifindex
== ifindex
) ||
1759 (!p
->dev
&& !ifindex
))
1765 static const struct nla_policy nl_neightbl_policy
[NDTA_MAX
+1] = {
1766 [NDTA_NAME
] = { .type
= NLA_STRING
},
1767 [NDTA_THRESH1
] = { .type
= NLA_U32
},
1768 [NDTA_THRESH2
] = { .type
= NLA_U32
},
1769 [NDTA_THRESH3
] = { .type
= NLA_U32
},
1770 [NDTA_GC_INTERVAL
] = { .type
= NLA_U64
},
1771 [NDTA_PARMS
] = { .type
= NLA_NESTED
},
1774 static const struct nla_policy nl_ntbl_parm_policy
[NDTPA_MAX
+1] = {
1775 [NDTPA_IFINDEX
] = { .type
= NLA_U32
},
1776 [NDTPA_QUEUE_LEN
] = { .type
= NLA_U32
},
1777 [NDTPA_PROXY_QLEN
] = { .type
= NLA_U32
},
1778 [NDTPA_APP_PROBES
] = { .type
= NLA_U32
},
1779 [NDTPA_UCAST_PROBES
] = { .type
= NLA_U32
},
1780 [NDTPA_MCAST_PROBES
] = { .type
= NLA_U32
},
1781 [NDTPA_BASE_REACHABLE_TIME
] = { .type
= NLA_U64
},
1782 [NDTPA_GC_STALETIME
] = { .type
= NLA_U64
},
1783 [NDTPA_DELAY_PROBE_TIME
] = { .type
= NLA_U64
},
1784 [NDTPA_RETRANS_TIME
] = { .type
= NLA_U64
},
1785 [NDTPA_ANYCAST_DELAY
] = { .type
= NLA_U64
},
1786 [NDTPA_PROXY_DELAY
] = { .type
= NLA_U64
},
1787 [NDTPA_LOCKTIME
] = { .type
= NLA_U64
},
1790 static int neightbl_set(struct sk_buff
*skb
, struct nlmsghdr
*nlh
, void *arg
)
1792 struct neigh_table
*tbl
;
1793 struct ndtmsg
*ndtmsg
;
1794 struct nlattr
*tb
[NDTA_MAX
+1];
1797 err
= nlmsg_parse(nlh
, sizeof(*ndtmsg
), tb
, NDTA_MAX
,
1798 nl_neightbl_policy
);
1802 if (tb
[NDTA_NAME
] == NULL
) {
1807 ndtmsg
= nlmsg_data(nlh
);
1808 read_lock(&neigh_tbl_lock
);
1809 for (tbl
= neigh_tables
; tbl
; tbl
= tbl
->next
) {
1810 if (ndtmsg
->ndtm_family
&& tbl
->family
!= ndtmsg
->ndtm_family
)
1813 if (nla_strcmp(tb
[NDTA_NAME
], tbl
->id
) == 0)
1823 * We acquire tbl->lock to be nice to the periodic timers and
1824 * make sure they always see a consistent set of values.
1826 write_lock_bh(&tbl
->lock
);
1828 if (tb
[NDTA_PARMS
]) {
1829 struct nlattr
*tbp
[NDTPA_MAX
+1];
1830 struct neigh_parms
*p
;
1833 err
= nla_parse_nested(tbp
, NDTPA_MAX
, tb
[NDTA_PARMS
],
1834 nl_ntbl_parm_policy
);
1836 goto errout_tbl_lock
;
1838 if (tbp
[NDTPA_IFINDEX
])
1839 ifindex
= nla_get_u32(tbp
[NDTPA_IFINDEX
]);
1841 p
= lookup_neigh_params(tbl
, ifindex
);
1844 goto errout_tbl_lock
;
1847 for (i
= 1; i
<= NDTPA_MAX
; i
++) {
1852 case NDTPA_QUEUE_LEN
:
1853 p
->queue_len
= nla_get_u32(tbp
[i
]);
1855 case NDTPA_PROXY_QLEN
:
1856 p
->proxy_qlen
= nla_get_u32(tbp
[i
]);
1858 case NDTPA_APP_PROBES
:
1859 p
->app_probes
= nla_get_u32(tbp
[i
]);
1861 case NDTPA_UCAST_PROBES
:
1862 p
->ucast_probes
= nla_get_u32(tbp
[i
]);
1864 case NDTPA_MCAST_PROBES
:
1865 p
->mcast_probes
= nla_get_u32(tbp
[i
]);
1867 case NDTPA_BASE_REACHABLE_TIME
:
1868 p
->base_reachable_time
= nla_get_msecs(tbp
[i
]);
1870 case NDTPA_GC_STALETIME
:
1871 p
->gc_staletime
= nla_get_msecs(tbp
[i
]);
1873 case NDTPA_DELAY_PROBE_TIME
:
1874 p
->delay_probe_time
= nla_get_msecs(tbp
[i
]);
1876 case NDTPA_RETRANS_TIME
:
1877 p
->retrans_time
= nla_get_msecs(tbp
[i
]);
1879 case NDTPA_ANYCAST_DELAY
:
1880 p
->anycast_delay
= nla_get_msecs(tbp
[i
]);
1882 case NDTPA_PROXY_DELAY
:
1883 p
->proxy_delay
= nla_get_msecs(tbp
[i
]);
1885 case NDTPA_LOCKTIME
:
1886 p
->locktime
= nla_get_msecs(tbp
[i
]);
1892 if (tb
[NDTA_THRESH1
])
1893 tbl
->gc_thresh1
= nla_get_u32(tb
[NDTA_THRESH1
]);
1895 if (tb
[NDTA_THRESH2
])
1896 tbl
->gc_thresh2
= nla_get_u32(tb
[NDTA_THRESH2
]);
1898 if (tb
[NDTA_THRESH3
])
1899 tbl
->gc_thresh3
= nla_get_u32(tb
[NDTA_THRESH3
]);
1901 if (tb
[NDTA_GC_INTERVAL
])
1902 tbl
->gc_interval
= nla_get_msecs(tb
[NDTA_GC_INTERVAL
]);
1907 write_unlock_bh(&tbl
->lock
);
1909 read_unlock(&neigh_tbl_lock
);
1914 static int neightbl_dump_info(struct sk_buff
*skb
, struct netlink_callback
*cb
)
1916 int family
, tidx
, nidx
= 0;
1917 int tbl_skip
= cb
->args
[0];
1918 int neigh_skip
= cb
->args
[1];
1919 struct neigh_table
*tbl
;
1921 family
= ((struct rtgenmsg
*) nlmsg_data(cb
->nlh
))->rtgen_family
;
1923 read_lock(&neigh_tbl_lock
);
1924 for (tbl
= neigh_tables
, tidx
= 0; tbl
; tbl
= tbl
->next
, tidx
++) {
1925 struct neigh_parms
*p
;
1927 if (tidx
< tbl_skip
|| (family
&& tbl
->family
!= family
))
1930 if (neightbl_fill_info(skb
, tbl
, NETLINK_CB(cb
->skb
).pid
,
1931 cb
->nlh
->nlmsg_seq
, RTM_NEWNEIGHTBL
,
1935 for (nidx
= 0, p
= tbl
->parms
.next
; p
; p
= p
->next
, nidx
++) {
1936 if (nidx
< neigh_skip
)
1939 if (neightbl_fill_param_info(skb
, tbl
, p
,
1940 NETLINK_CB(cb
->skb
).pid
,
1950 read_unlock(&neigh_tbl_lock
);
1957 static int neigh_fill_info(struct sk_buff
*skb
, struct neighbour
*neigh
,
1958 u32 pid
, u32 seq
, int type
, unsigned int flags
)
1960 unsigned long now
= jiffies
;
1961 struct nda_cacheinfo ci
;
1962 struct nlmsghdr
*nlh
;
1965 nlh
= nlmsg_put(skb
, pid
, seq
, type
, sizeof(*ndm
), flags
);
1969 ndm
= nlmsg_data(nlh
);
1970 ndm
->ndm_family
= neigh
->ops
->family
;
1973 ndm
->ndm_flags
= neigh
->flags
;
1974 ndm
->ndm_type
= neigh
->type
;
1975 ndm
->ndm_ifindex
= neigh
->dev
->ifindex
;
1977 NLA_PUT(skb
, NDA_DST
, neigh
->tbl
->key_len
, neigh
->primary_key
);
1979 read_lock_bh(&neigh
->lock
);
1980 ndm
->ndm_state
= neigh
->nud_state
;
1981 if ((neigh
->nud_state
& NUD_VALID
) &&
1982 nla_put(skb
, NDA_LLADDR
, neigh
->dev
->addr_len
, neigh
->ha
) < 0) {
1983 read_unlock_bh(&neigh
->lock
);
1984 goto nla_put_failure
;
1987 ci
.ndm_used
= now
- neigh
->used
;
1988 ci
.ndm_confirmed
= now
- neigh
->confirmed
;
1989 ci
.ndm_updated
= now
- neigh
->updated
;
1990 ci
.ndm_refcnt
= atomic_read(&neigh
->refcnt
) - 1;
1991 read_unlock_bh(&neigh
->lock
);
1993 NLA_PUT_U32(skb
, NDA_PROBES
, atomic_read(&neigh
->probes
));
1994 NLA_PUT(skb
, NDA_CACHEINFO
, sizeof(ci
), &ci
);
1996 return nlmsg_end(skb
, nlh
);
1999 nlmsg_cancel(skb
, nlh
);
2003 static void neigh_update_notify(struct neighbour
*neigh
)
2005 call_netevent_notifiers(NETEVENT_NEIGH_UPDATE
, neigh
);
2006 __neigh_notify(neigh
, RTM_NEWNEIGH
, 0);
2009 static int neigh_dump_table(struct neigh_table
*tbl
, struct sk_buff
*skb
,
2010 struct netlink_callback
*cb
)
2012 struct neighbour
*n
;
2013 int rc
, h
, s_h
= cb
->args
[1];
2014 int idx
, s_idx
= idx
= cb
->args
[2];
2016 read_lock_bh(&tbl
->lock
);
2017 for (h
= 0; h
<= tbl
->hash_mask
; h
++) {
2022 for (n
= tbl
->hash_buckets
[h
], idx
= 0; n
; n
= n
->next
, idx
++) {
2025 if (neigh_fill_info(skb
, n
, NETLINK_CB(cb
->skb
).pid
,
2028 NLM_F_MULTI
) <= 0) {
2029 read_unlock_bh(&tbl
->lock
);
2035 read_unlock_bh(&tbl
->lock
);
2043 static int neigh_dump_info(struct sk_buff
*skb
, struct netlink_callback
*cb
)
2045 struct neigh_table
*tbl
;
2048 read_lock(&neigh_tbl_lock
);
2049 family
= ((struct rtgenmsg
*) nlmsg_data(cb
->nlh
))->rtgen_family
;
2052 for (tbl
= neigh_tables
, t
= 0; tbl
; tbl
= tbl
->next
, t
++) {
2053 if (t
< s_t
|| (family
&& tbl
->family
!= family
))
2056 memset(&cb
->args
[1], 0, sizeof(cb
->args
) -
2057 sizeof(cb
->args
[0]));
2058 if (neigh_dump_table(tbl
, skb
, cb
) < 0)
2061 read_unlock(&neigh_tbl_lock
);
2067 void neigh_for_each(struct neigh_table
*tbl
, void (*cb
)(struct neighbour
*, void *), void *cookie
)
2071 read_lock_bh(&tbl
->lock
);
2072 for (chain
= 0; chain
<= tbl
->hash_mask
; chain
++) {
2073 struct neighbour
*n
;
2075 for (n
= tbl
->hash_buckets
[chain
]; n
; n
= n
->next
)
2078 read_unlock_bh(&tbl
->lock
);
2080 EXPORT_SYMBOL(neigh_for_each
);
2082 /* The tbl->lock must be held as a writer and BH disabled. */
2083 void __neigh_for_each_release(struct neigh_table
*tbl
,
2084 int (*cb
)(struct neighbour
*))
2088 for (chain
= 0; chain
<= tbl
->hash_mask
; chain
++) {
2089 struct neighbour
*n
, **np
;
2091 np
= &tbl
->hash_buckets
[chain
];
2092 while ((n
= *np
) != NULL
) {
2095 write_lock(&n
->lock
);
2102 write_unlock(&n
->lock
);
2104 neigh_cleanup_and_release(n
);
2108 EXPORT_SYMBOL(__neigh_for_each_release
);
2110 #ifdef CONFIG_PROC_FS
2112 static struct neighbour
*neigh_get_first(struct seq_file
*seq
)
2114 struct neigh_seq_state
*state
= seq
->private;
2115 struct neigh_table
*tbl
= state
->tbl
;
2116 struct neighbour
*n
= NULL
;
2117 int bucket
= state
->bucket
;
2119 state
->flags
&= ~NEIGH_SEQ_IS_PNEIGH
;
2120 for (bucket
= 0; bucket
<= tbl
->hash_mask
; bucket
++) {
2121 n
= tbl
->hash_buckets
[bucket
];
2124 if (state
->neigh_sub_iter
) {
2128 v
= state
->neigh_sub_iter(state
, n
, &fakep
);
2132 if (!(state
->flags
& NEIGH_SEQ_SKIP_NOARP
))
2134 if (n
->nud_state
& ~NUD_NOARP
)
2143 state
->bucket
= bucket
;
2148 static struct neighbour
*neigh_get_next(struct seq_file
*seq
,
2149 struct neighbour
*n
,
2152 struct neigh_seq_state
*state
= seq
->private;
2153 struct neigh_table
*tbl
= state
->tbl
;
2155 if (state
->neigh_sub_iter
) {
2156 void *v
= state
->neigh_sub_iter(state
, n
, pos
);
2164 if (state
->neigh_sub_iter
) {
2165 void *v
= state
->neigh_sub_iter(state
, n
, pos
);
2170 if (!(state
->flags
& NEIGH_SEQ_SKIP_NOARP
))
2173 if (n
->nud_state
& ~NUD_NOARP
)
2182 if (++state
->bucket
> tbl
->hash_mask
)
2185 n
= tbl
->hash_buckets
[state
->bucket
];
2193 static struct neighbour
*neigh_get_idx(struct seq_file
*seq
, loff_t
*pos
)
2195 struct neighbour
*n
= neigh_get_first(seq
);
2199 n
= neigh_get_next(seq
, n
, pos
);
2204 return *pos
? NULL
: n
;
2207 static struct pneigh_entry
*pneigh_get_first(struct seq_file
*seq
)
2209 struct neigh_seq_state
*state
= seq
->private;
2210 struct neigh_table
*tbl
= state
->tbl
;
2211 struct pneigh_entry
*pn
= NULL
;
2212 int bucket
= state
->bucket
;
2214 state
->flags
|= NEIGH_SEQ_IS_PNEIGH
;
2215 for (bucket
= 0; bucket
<= PNEIGH_HASHMASK
; bucket
++) {
2216 pn
= tbl
->phash_buckets
[bucket
];
2220 state
->bucket
= bucket
;
2225 static struct pneigh_entry
*pneigh_get_next(struct seq_file
*seq
,
2226 struct pneigh_entry
*pn
,
2229 struct neigh_seq_state
*state
= seq
->private;
2230 struct neigh_table
*tbl
= state
->tbl
;
2234 if (++state
->bucket
> PNEIGH_HASHMASK
)
2236 pn
= tbl
->phash_buckets
[state
->bucket
];
2247 static struct pneigh_entry
*pneigh_get_idx(struct seq_file
*seq
, loff_t
*pos
)
2249 struct pneigh_entry
*pn
= pneigh_get_first(seq
);
2253 pn
= pneigh_get_next(seq
, pn
, pos
);
2258 return *pos
? NULL
: pn
;
2261 static void *neigh_get_idx_any(struct seq_file
*seq
, loff_t
*pos
)
2263 struct neigh_seq_state
*state
= seq
->private;
2266 rc
= neigh_get_idx(seq
, pos
);
2267 if (!rc
&& !(state
->flags
& NEIGH_SEQ_NEIGH_ONLY
))
2268 rc
= pneigh_get_idx(seq
, pos
);
2273 void *neigh_seq_start(struct seq_file
*seq
, loff_t
*pos
, struct neigh_table
*tbl
, unsigned int neigh_seq_flags
)
2275 struct neigh_seq_state
*state
= seq
->private;
2276 loff_t pos_minus_one
;
2280 state
->flags
= (neigh_seq_flags
& ~NEIGH_SEQ_IS_PNEIGH
);
2282 read_lock_bh(&tbl
->lock
);
2284 pos_minus_one
= *pos
- 1;
2285 return *pos
? neigh_get_idx_any(seq
, &pos_minus_one
) : SEQ_START_TOKEN
;
2287 EXPORT_SYMBOL(neigh_seq_start
);
2289 void *neigh_seq_next(struct seq_file
*seq
, void *v
, loff_t
*pos
)
2291 struct neigh_seq_state
*state
;
2294 if (v
== SEQ_START_TOKEN
) {
2295 rc
= neigh_get_idx(seq
, pos
);
2299 state
= seq
->private;
2300 if (!(state
->flags
& NEIGH_SEQ_IS_PNEIGH
)) {
2301 rc
= neigh_get_next(seq
, v
, NULL
);
2304 if (!(state
->flags
& NEIGH_SEQ_NEIGH_ONLY
))
2305 rc
= pneigh_get_first(seq
);
2307 BUG_ON(state
->flags
& NEIGH_SEQ_NEIGH_ONLY
);
2308 rc
= pneigh_get_next(seq
, v
, NULL
);
2314 EXPORT_SYMBOL(neigh_seq_next
);
2316 void neigh_seq_stop(struct seq_file
*seq
, void *v
)
2318 struct neigh_seq_state
*state
= seq
->private;
2319 struct neigh_table
*tbl
= state
->tbl
;
2321 read_unlock_bh(&tbl
->lock
);
2323 EXPORT_SYMBOL(neigh_seq_stop
);
2325 /* statistics via seq_file */
2327 static void *neigh_stat_seq_start(struct seq_file
*seq
, loff_t
*pos
)
2329 struct proc_dir_entry
*pde
= seq
->private;
2330 struct neigh_table
*tbl
= pde
->data
;
2334 return SEQ_START_TOKEN
;
2336 for (cpu
= *pos
-1; cpu
< NR_CPUS
; ++cpu
) {
2337 if (!cpu_possible(cpu
))
2340 return per_cpu_ptr(tbl
->stats
, cpu
);
2345 static void *neigh_stat_seq_next(struct seq_file
*seq
, void *v
, loff_t
*pos
)
2347 struct proc_dir_entry
*pde
= seq
->private;
2348 struct neigh_table
*tbl
= pde
->data
;
2351 for (cpu
= *pos
; cpu
< NR_CPUS
; ++cpu
) {
2352 if (!cpu_possible(cpu
))
2355 return per_cpu_ptr(tbl
->stats
, cpu
);
2360 static void neigh_stat_seq_stop(struct seq_file
*seq
, void *v
)
2365 static int neigh_stat_seq_show(struct seq_file
*seq
, void *v
)
2367 struct proc_dir_entry
*pde
= seq
->private;
2368 struct neigh_table
*tbl
= pde
->data
;
2369 struct neigh_statistics
*st
= v
;
2371 if (v
== SEQ_START_TOKEN
) {
2372 seq_printf(seq
, "entries allocs destroys hash_grows lookups hits res_failed rcv_probes_mcast rcv_probes_ucast periodic_gc_runs forced_gc_runs\n");
2376 seq_printf(seq
, "%08x %08lx %08lx %08lx %08lx %08lx %08lx "
2377 "%08lx %08lx %08lx %08lx\n",
2378 atomic_read(&tbl
->entries
),
2389 st
->rcv_probes_mcast
,
2390 st
->rcv_probes_ucast
,
2392 st
->periodic_gc_runs
,
2399 static const struct seq_operations neigh_stat_seq_ops
= {
2400 .start
= neigh_stat_seq_start
,
2401 .next
= neigh_stat_seq_next
,
2402 .stop
= neigh_stat_seq_stop
,
2403 .show
= neigh_stat_seq_show
,
2406 static int neigh_stat_seq_open(struct inode
*inode
, struct file
*file
)
2408 int ret
= seq_open(file
, &neigh_stat_seq_ops
);
2411 struct seq_file
*sf
= file
->private_data
;
2412 sf
->private = PDE(inode
);
2417 static const struct file_operations neigh_stat_seq_fops
= {
2418 .owner
= THIS_MODULE
,
2419 .open
= neigh_stat_seq_open
,
2421 .llseek
= seq_lseek
,
2422 .release
= seq_release
,
2425 #endif /* CONFIG_PROC_FS */
2427 static inline size_t neigh_nlmsg_size(void)
2429 return NLMSG_ALIGN(sizeof(struct ndmsg
))
2430 + nla_total_size(MAX_ADDR_LEN
) /* NDA_DST */
2431 + nla_total_size(MAX_ADDR_LEN
) /* NDA_LLADDR */
2432 + nla_total_size(sizeof(struct nda_cacheinfo
))
2433 + nla_total_size(4); /* NDA_PROBES */
2436 static void __neigh_notify(struct neighbour
*n
, int type
, int flags
)
2438 struct sk_buff
*skb
;
2441 skb
= nlmsg_new(neigh_nlmsg_size(), GFP_ATOMIC
);
2445 err
= neigh_fill_info(skb
, n
, 0, 0, type
, flags
);
2447 /* -EMSGSIZE implies BUG in neigh_nlmsg_size() */
2448 WARN_ON(err
== -EMSGSIZE
);
2452 err
= rtnl_notify(skb
, 0, RTNLGRP_NEIGH
, NULL
, GFP_ATOMIC
);
2455 rtnl_set_sk_err(RTNLGRP_NEIGH
, err
);
2459 void neigh_app_ns(struct neighbour
*n
)
2461 __neigh_notify(n
, RTM_GETNEIGH
, NLM_F_REQUEST
);
2463 #endif /* CONFIG_ARPD */
2465 #ifdef CONFIG_SYSCTL
2467 static struct neigh_sysctl_table
{
2468 struct ctl_table_header
*sysctl_header
;
2469 ctl_table neigh_vars
[__NET_NEIGH_MAX
];
2470 ctl_table neigh_dev
[2];
2471 ctl_table neigh_neigh_dir
[2];
2472 ctl_table neigh_proto_dir
[2];
2473 ctl_table neigh_root_dir
[2];
2474 } neigh_sysctl_template __read_mostly
= {
2477 .ctl_name
= NET_NEIGH_MCAST_SOLICIT
,
2478 .procname
= "mcast_solicit",
2479 .maxlen
= sizeof(int),
2481 .proc_handler
= &proc_dointvec
,
2484 .ctl_name
= NET_NEIGH_UCAST_SOLICIT
,
2485 .procname
= "ucast_solicit",
2486 .maxlen
= sizeof(int),
2488 .proc_handler
= &proc_dointvec
,
2491 .ctl_name
= NET_NEIGH_APP_SOLICIT
,
2492 .procname
= "app_solicit",
2493 .maxlen
= sizeof(int),
2495 .proc_handler
= &proc_dointvec
,
2498 .procname
= "retrans_time",
2499 .maxlen
= sizeof(int),
2501 .proc_handler
= &proc_dointvec_userhz_jiffies
,
2504 .ctl_name
= NET_NEIGH_REACHABLE_TIME
,
2505 .procname
= "base_reachable_time",
2506 .maxlen
= sizeof(int),
2508 .proc_handler
= &proc_dointvec_jiffies
,
2509 .strategy
= &sysctl_jiffies
,
2512 .ctl_name
= NET_NEIGH_DELAY_PROBE_TIME
,
2513 .procname
= "delay_first_probe_time",
2514 .maxlen
= sizeof(int),
2516 .proc_handler
= &proc_dointvec_jiffies
,
2517 .strategy
= &sysctl_jiffies
,
2520 .ctl_name
= NET_NEIGH_GC_STALE_TIME
,
2521 .procname
= "gc_stale_time",
2522 .maxlen
= sizeof(int),
2524 .proc_handler
= &proc_dointvec_jiffies
,
2525 .strategy
= &sysctl_jiffies
,
2528 .ctl_name
= NET_NEIGH_UNRES_QLEN
,
2529 .procname
= "unres_qlen",
2530 .maxlen
= sizeof(int),
2532 .proc_handler
= &proc_dointvec
,
2535 .ctl_name
= NET_NEIGH_PROXY_QLEN
,
2536 .procname
= "proxy_qlen",
2537 .maxlen
= sizeof(int),
2539 .proc_handler
= &proc_dointvec
,
2542 .procname
= "anycast_delay",
2543 .maxlen
= sizeof(int),
2545 .proc_handler
= &proc_dointvec_userhz_jiffies
,
2548 .procname
= "proxy_delay",
2549 .maxlen
= sizeof(int),
2551 .proc_handler
= &proc_dointvec_userhz_jiffies
,
2554 .procname
= "locktime",
2555 .maxlen
= sizeof(int),
2557 .proc_handler
= &proc_dointvec_userhz_jiffies
,
2560 .ctl_name
= NET_NEIGH_RETRANS_TIME_MS
,
2561 .procname
= "retrans_time_ms",
2562 .maxlen
= sizeof(int),
2564 .proc_handler
= &proc_dointvec_ms_jiffies
,
2565 .strategy
= &sysctl_ms_jiffies
,
2568 .ctl_name
= NET_NEIGH_REACHABLE_TIME_MS
,
2569 .procname
= "base_reachable_time_ms",
2570 .maxlen
= sizeof(int),
2572 .proc_handler
= &proc_dointvec_ms_jiffies
,
2573 .strategy
= &sysctl_ms_jiffies
,
2576 .ctl_name
= NET_NEIGH_GC_INTERVAL
,
2577 .procname
= "gc_interval",
2578 .maxlen
= sizeof(int),
2580 .proc_handler
= &proc_dointvec_jiffies
,
2581 .strategy
= &sysctl_jiffies
,
2584 .ctl_name
= NET_NEIGH_GC_THRESH1
,
2585 .procname
= "gc_thresh1",
2586 .maxlen
= sizeof(int),
2588 .proc_handler
= &proc_dointvec
,
2591 .ctl_name
= NET_NEIGH_GC_THRESH2
,
2592 .procname
= "gc_thresh2",
2593 .maxlen
= sizeof(int),
2595 .proc_handler
= &proc_dointvec
,
2598 .ctl_name
= NET_NEIGH_GC_THRESH3
,
2599 .procname
= "gc_thresh3",
2600 .maxlen
= sizeof(int),
2602 .proc_handler
= &proc_dointvec
,
2608 .ctl_name
= NET_PROTO_CONF_DEFAULT
,
2609 .procname
= "default",
2613 .neigh_neigh_dir
= {
2615 .procname
= "neigh",
2619 .neigh_proto_dir
= {
2626 .ctl_name
= CTL_NET
,
2633 int neigh_sysctl_register(struct net_device
*dev
, struct neigh_parms
*p
,
2634 int p_id
, int pdev_id
, char *p_name
,
2635 proc_handler
*handler
, ctl_handler
*strategy
)
2637 struct neigh_sysctl_table
*t
= kmemdup(&neigh_sysctl_template
,
2638 sizeof(*t
), GFP_KERNEL
);
2639 const char *dev_name_source
= NULL
;
2640 char *dev_name
= NULL
;
2645 t
->neigh_vars
[0].data
= &p
->mcast_probes
;
2646 t
->neigh_vars
[1].data
= &p
->ucast_probes
;
2647 t
->neigh_vars
[2].data
= &p
->app_probes
;
2648 t
->neigh_vars
[3].data
= &p
->retrans_time
;
2649 t
->neigh_vars
[4].data
= &p
->base_reachable_time
;
2650 t
->neigh_vars
[5].data
= &p
->delay_probe_time
;
2651 t
->neigh_vars
[6].data
= &p
->gc_staletime
;
2652 t
->neigh_vars
[7].data
= &p
->queue_len
;
2653 t
->neigh_vars
[8].data
= &p
->proxy_qlen
;
2654 t
->neigh_vars
[9].data
= &p
->anycast_delay
;
2655 t
->neigh_vars
[10].data
= &p
->proxy_delay
;
2656 t
->neigh_vars
[11].data
= &p
->locktime
;
2657 t
->neigh_vars
[12].data
= &p
->retrans_time
;
2658 t
->neigh_vars
[13].data
= &p
->base_reachable_time
;
2661 dev_name_source
= dev
->name
;
2662 t
->neigh_dev
[0].ctl_name
= dev
->ifindex
;
2663 /* Terminate the table early */
2664 memset(&t
->neigh_vars
[14], 0, sizeof(t
->neigh_vars
[14]));
2666 dev_name_source
= t
->neigh_dev
[0].procname
;
2667 t
->neigh_vars
[14].data
= (int *)(p
+ 1);
2668 t
->neigh_vars
[15].data
= (int *)(p
+ 1) + 1;
2669 t
->neigh_vars
[16].data
= (int *)(p
+ 1) + 2;
2670 t
->neigh_vars
[17].data
= (int *)(p
+ 1) + 3;
2674 if (handler
|| strategy
) {
2676 t
->neigh_vars
[3].proc_handler
= handler
;
2677 t
->neigh_vars
[3].strategy
= strategy
;
2678 t
->neigh_vars
[3].extra1
= dev
;
2680 t
->neigh_vars
[3].ctl_name
= CTL_UNNUMBERED
;
2682 t
->neigh_vars
[4].proc_handler
= handler
;
2683 t
->neigh_vars
[4].strategy
= strategy
;
2684 t
->neigh_vars
[4].extra1
= dev
;
2686 t
->neigh_vars
[4].ctl_name
= CTL_UNNUMBERED
;
2687 /* RetransTime (in milliseconds)*/
2688 t
->neigh_vars
[12].proc_handler
= handler
;
2689 t
->neigh_vars
[12].strategy
= strategy
;
2690 t
->neigh_vars
[12].extra1
= dev
;
2692 t
->neigh_vars
[12].ctl_name
= CTL_UNNUMBERED
;
2693 /* ReachableTime (in milliseconds) */
2694 t
->neigh_vars
[13].proc_handler
= handler
;
2695 t
->neigh_vars
[13].strategy
= strategy
;
2696 t
->neigh_vars
[13].extra1
= dev
;
2698 t
->neigh_vars
[13].ctl_name
= CTL_UNNUMBERED
;
2701 dev_name
= kstrdup(dev_name_source
, GFP_KERNEL
);
2707 t
->neigh_dev
[0].procname
= dev_name
;
2709 t
->neigh_neigh_dir
[0].ctl_name
= pdev_id
;
2711 t
->neigh_proto_dir
[0].procname
= p_name
;
2712 t
->neigh_proto_dir
[0].ctl_name
= p_id
;
2714 t
->neigh_dev
[0].child
= t
->neigh_vars
;
2715 t
->neigh_neigh_dir
[0].child
= t
->neigh_dev
;
2716 t
->neigh_proto_dir
[0].child
= t
->neigh_neigh_dir
;
2717 t
->neigh_root_dir
[0].child
= t
->neigh_proto_dir
;
2719 t
->sysctl_header
= register_sysctl_table(t
->neigh_root_dir
);
2720 if (!t
->sysctl_header
) {
2724 p
->sysctl_table
= t
;
2736 void neigh_sysctl_unregister(struct neigh_parms
*p
)
2738 if (p
->sysctl_table
) {
2739 struct neigh_sysctl_table
*t
= p
->sysctl_table
;
2740 p
->sysctl_table
= NULL
;
2741 unregister_sysctl_table(t
->sysctl_header
);
2742 kfree(t
->neigh_dev
[0].procname
);
2747 #endif /* CONFIG_SYSCTL */
2749 static int __init
neigh_init(void)
2751 rtnl_register(PF_UNSPEC
, RTM_NEWNEIGH
, neigh_add
, NULL
);
2752 rtnl_register(PF_UNSPEC
, RTM_DELNEIGH
, neigh_delete
, NULL
);
2753 rtnl_register(PF_UNSPEC
, RTM_GETNEIGH
, NULL
, neigh_dump_info
);
2755 rtnl_register(PF_UNSPEC
, RTM_GETNEIGHTBL
, NULL
, neightbl_dump_info
);
2756 rtnl_register(PF_UNSPEC
, RTM_SETNEIGHTBL
, neightbl_set
, NULL
);
2761 subsys_initcall(neigh_init
);
2763 EXPORT_SYMBOL(__neigh_event_send
);
2764 EXPORT_SYMBOL(neigh_changeaddr
);
2765 EXPORT_SYMBOL(neigh_compat_output
);
2766 EXPORT_SYMBOL(neigh_connected_output
);
2767 EXPORT_SYMBOL(neigh_create
);
2768 EXPORT_SYMBOL(neigh_destroy
);
2769 EXPORT_SYMBOL(neigh_event_ns
);
2770 EXPORT_SYMBOL(neigh_ifdown
);
2771 EXPORT_SYMBOL(neigh_lookup
);
2772 EXPORT_SYMBOL(neigh_lookup_nodev
);
2773 EXPORT_SYMBOL(neigh_parms_alloc
);
2774 EXPORT_SYMBOL(neigh_parms_release
);
2775 EXPORT_SYMBOL(neigh_rand_reach_time
);
2776 EXPORT_SYMBOL(neigh_resolve_output
);
2777 EXPORT_SYMBOL(neigh_table_clear
);
2778 EXPORT_SYMBOL(neigh_table_init
);
2779 EXPORT_SYMBOL(neigh_table_init_no_netlink
);
2780 EXPORT_SYMBOL(neigh_update
);
2781 EXPORT_SYMBOL(pneigh_enqueue
);
2782 EXPORT_SYMBOL(pneigh_lookup
);
2785 EXPORT_SYMBOL(neigh_app_ns
);
2787 #ifdef CONFIG_SYSCTL
2788 EXPORT_SYMBOL(neigh_sysctl_register
);
2789 EXPORT_SYMBOL(neigh_sysctl_unregister
);