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 if (neigh
->ops
->solicit
)
876 neigh
->ops
->solicit(neigh
, skb
);
877 atomic_inc(&neigh
->probes
);
881 /* Called when a timer expires for a neighbour entry. */
883 static void neigh_timer_handler(unsigned long arg
)
885 unsigned long now
, next
;
886 struct neighbour
*neigh
= (struct neighbour
*)arg
;
890 write_lock(&neigh
->lock
);
892 state
= neigh
->nud_state
;
896 if (!(state
& NUD_IN_TIMER
))
899 if (state
& NUD_REACHABLE
) {
900 if (time_before_eq(now
,
901 neigh
->confirmed
+ neigh
->parms
->reachable_time
)) {
902 neigh_dbg(2, "neigh %p is still alive\n", neigh
);
903 next
= neigh
->confirmed
+ neigh
->parms
->reachable_time
;
904 } else if (time_before_eq(now
,
905 neigh
->used
+ neigh
->parms
->delay_probe_time
)) {
906 neigh_dbg(2, "neigh %p is delayed\n", neigh
);
907 neigh
->nud_state
= NUD_DELAY
;
908 neigh
->updated
= jiffies
;
909 neigh_suspect(neigh
);
910 next
= now
+ neigh
->parms
->delay_probe_time
;
912 neigh_dbg(2, "neigh %p is suspected\n", neigh
);
913 neigh
->nud_state
= NUD_STALE
;
914 neigh
->updated
= jiffies
;
915 neigh_suspect(neigh
);
918 } else if (state
& NUD_DELAY
) {
919 if (time_before_eq(now
,
920 neigh
->confirmed
+ neigh
->parms
->delay_probe_time
)) {
921 neigh_dbg(2, "neigh %p is now reachable\n", neigh
);
922 neigh
->nud_state
= NUD_REACHABLE
;
923 neigh
->updated
= jiffies
;
924 neigh_connect(neigh
);
926 next
= neigh
->confirmed
+ neigh
->parms
->reachable_time
;
928 neigh_dbg(2, "neigh %p is probed\n", neigh
);
929 neigh
->nud_state
= NUD_PROBE
;
930 neigh
->updated
= jiffies
;
931 atomic_set(&neigh
->probes
, 0);
932 next
= now
+ neigh
->parms
->retrans_time
;
935 /* NUD_PROBE|NUD_INCOMPLETE */
936 next
= now
+ neigh
->parms
->retrans_time
;
939 if ((neigh
->nud_state
& (NUD_INCOMPLETE
| NUD_PROBE
)) &&
940 atomic_read(&neigh
->probes
) >= neigh_max_probes(neigh
)) {
941 neigh
->nud_state
= NUD_FAILED
;
943 neigh_invalidate(neigh
);
946 if (neigh
->nud_state
& NUD_IN_TIMER
) {
947 if (time_before(next
, jiffies
+ HZ
/2))
948 next
= jiffies
+ HZ
/2;
949 if (!mod_timer(&neigh
->timer
, next
))
952 if (neigh
->nud_state
& (NUD_INCOMPLETE
| NUD_PROBE
)) {
956 write_unlock(&neigh
->lock
);
960 neigh_update_notify(neigh
);
962 neigh_release(neigh
);
965 int __neigh_event_send(struct neighbour
*neigh
, struct sk_buff
*skb
)
968 bool immediate_probe
= false;
970 write_lock_bh(&neigh
->lock
);
973 if (neigh
->nud_state
& (NUD_CONNECTED
| NUD_DELAY
| NUD_PROBE
))
976 if (!(neigh
->nud_state
& (NUD_STALE
| NUD_INCOMPLETE
))) {
977 if (neigh
->parms
->mcast_probes
+ neigh
->parms
->app_probes
) {
978 unsigned long next
, now
= jiffies
;
980 atomic_set(&neigh
->probes
, neigh
->parms
->ucast_probes
);
981 neigh
->nud_state
= NUD_INCOMPLETE
;
982 neigh
->updated
= now
;
983 next
= now
+ max(neigh
->parms
->retrans_time
, HZ
/2);
984 neigh_add_timer(neigh
, next
);
985 immediate_probe
= true;
987 neigh
->nud_state
= NUD_FAILED
;
988 neigh
->updated
= jiffies
;
989 write_unlock_bh(&neigh
->lock
);
994 } else if (neigh
->nud_state
& NUD_STALE
) {
995 neigh_dbg(2, "neigh %p is delayed\n", neigh
);
996 neigh
->nud_state
= NUD_DELAY
;
997 neigh
->updated
= jiffies
;
998 neigh_add_timer(neigh
,
999 jiffies
+ neigh
->parms
->delay_probe_time
);
1002 if (neigh
->nud_state
== NUD_INCOMPLETE
) {
1004 while (neigh
->arp_queue_len_bytes
+ skb
->truesize
>
1005 neigh
->parms
->queue_len_bytes
) {
1006 struct sk_buff
*buff
;
1008 buff
= __skb_dequeue(&neigh
->arp_queue
);
1011 neigh
->arp_queue_len_bytes
-= buff
->truesize
;
1013 NEIGH_CACHE_STAT_INC(neigh
->tbl
, unres_discards
);
1016 __skb_queue_tail(&neigh
->arp_queue
, skb
);
1017 neigh
->arp_queue_len_bytes
+= skb
->truesize
;
1022 if (immediate_probe
)
1025 write_unlock(&neigh
->lock
);
1029 EXPORT_SYMBOL(__neigh_event_send
);
1031 static void neigh_update_hhs(struct neighbour
*neigh
)
1033 struct hh_cache
*hh
;
1034 void (*update
)(struct hh_cache
*, const struct net_device
*, const unsigned char *)
1037 if (neigh
->dev
->header_ops
)
1038 update
= neigh
->dev
->header_ops
->cache_update
;
1043 write_seqlock_bh(&hh
->hh_lock
);
1044 update(hh
, neigh
->dev
, neigh
->ha
);
1045 write_sequnlock_bh(&hh
->hh_lock
);
1052 /* Generic update routine.
1053 -- lladdr is new lladdr or NULL, if it is not supplied.
1054 -- new is new state.
1056 NEIGH_UPDATE_F_OVERRIDE allows to override existing lladdr,
1058 NEIGH_UPDATE_F_WEAK_OVERRIDE will suspect existing "connected"
1059 lladdr instead of overriding it
1061 It also allows to retain current state
1062 if lladdr is unchanged.
1063 NEIGH_UPDATE_F_ADMIN means that the change is administrative.
1065 NEIGH_UPDATE_F_OVERRIDE_ISROUTER allows to override existing
1067 NEIGH_UPDATE_F_ISROUTER indicates if the neighbour is known as
1070 Caller MUST hold reference count on the entry.
1073 int neigh_update(struct neighbour
*neigh
, const u8
*lladdr
, u8
new,
1079 struct net_device
*dev
;
1080 int update_isrouter
= 0;
1082 write_lock_bh(&neigh
->lock
);
1085 old
= neigh
->nud_state
;
1088 if (!(flags
& NEIGH_UPDATE_F_ADMIN
) &&
1089 (old
& (NUD_NOARP
| NUD_PERMANENT
)))
1092 if (!(new & NUD_VALID
)) {
1093 neigh_del_timer(neigh
);
1094 if (old
& NUD_CONNECTED
)
1095 neigh_suspect(neigh
);
1096 neigh
->nud_state
= new;
1098 notify
= old
& NUD_VALID
;
1099 if ((old
& (NUD_INCOMPLETE
| NUD_PROBE
)) &&
1100 (new & NUD_FAILED
)) {
1101 neigh_invalidate(neigh
);
1107 /* Compare new lladdr with cached one */
1108 if (!dev
->addr_len
) {
1109 /* First case: device needs no address. */
1111 } else if (lladdr
) {
1112 /* The second case: if something is already cached
1113 and a new address is proposed:
1115 - if they are different, check override flag
1117 if ((old
& NUD_VALID
) &&
1118 !memcmp(lladdr
, neigh
->ha
, dev
->addr_len
))
1121 /* No address is supplied; if we know something,
1122 use it, otherwise discard the request.
1125 if (!(old
& NUD_VALID
))
1130 if (new & NUD_CONNECTED
)
1131 neigh
->confirmed
= jiffies
;
1132 neigh
->updated
= jiffies
;
1134 /* If entry was valid and address is not changed,
1135 do not change entry state, if new one is STALE.
1138 update_isrouter
= flags
& NEIGH_UPDATE_F_OVERRIDE_ISROUTER
;
1139 if (old
& NUD_VALID
) {
1140 if (lladdr
!= neigh
->ha
&& !(flags
& NEIGH_UPDATE_F_OVERRIDE
)) {
1141 update_isrouter
= 0;
1142 if ((flags
& NEIGH_UPDATE_F_WEAK_OVERRIDE
) &&
1143 (old
& NUD_CONNECTED
)) {
1149 if (lladdr
== neigh
->ha
&& new == NUD_STALE
&&
1150 ((flags
& NEIGH_UPDATE_F_WEAK_OVERRIDE
) ||
1151 (old
& NUD_CONNECTED
))
1158 neigh_del_timer(neigh
);
1159 if (new & NUD_IN_TIMER
)
1160 neigh_add_timer(neigh
, (jiffies
+
1161 ((new & NUD_REACHABLE
) ?
1162 neigh
->parms
->reachable_time
:
1164 neigh
->nud_state
= new;
1167 if (lladdr
!= neigh
->ha
) {
1168 write_seqlock(&neigh
->ha_lock
);
1169 memcpy(&neigh
->ha
, lladdr
, dev
->addr_len
);
1170 write_sequnlock(&neigh
->ha_lock
);
1171 neigh_update_hhs(neigh
);
1172 if (!(new & NUD_CONNECTED
))
1173 neigh
->confirmed
= jiffies
-
1174 (neigh
->parms
->base_reachable_time
<< 1);
1179 if (new & NUD_CONNECTED
)
1180 neigh_connect(neigh
);
1182 neigh_suspect(neigh
);
1183 if (!(old
& NUD_VALID
)) {
1184 struct sk_buff
*skb
;
1186 /* Again: avoid dead loop if something went wrong */
1188 while (neigh
->nud_state
& NUD_VALID
&&
1189 (skb
= __skb_dequeue(&neigh
->arp_queue
)) != NULL
) {
1190 struct dst_entry
*dst
= skb_dst(skb
);
1191 struct neighbour
*n2
, *n1
= neigh
;
1192 write_unlock_bh(&neigh
->lock
);
1196 /* Why not just use 'neigh' as-is? The problem is that
1197 * things such as shaper, eql, and sch_teql can end up
1198 * using alternative, different, neigh objects to output
1199 * the packet in the output path. So what we need to do
1200 * here is re-lookup the top-level neigh in the path so
1201 * we can reinject the packet there.
1205 n2
= dst_neigh_lookup_skb(dst
, skb
);
1209 n1
->output(n1
, skb
);
1214 write_lock_bh(&neigh
->lock
);
1216 __skb_queue_purge(&neigh
->arp_queue
);
1217 neigh
->arp_queue_len_bytes
= 0;
1220 if (update_isrouter
) {
1221 neigh
->flags
= (flags
& NEIGH_UPDATE_F_ISROUTER
) ?
1222 (neigh
->flags
| NTF_ROUTER
) :
1223 (neigh
->flags
& ~NTF_ROUTER
);
1225 write_unlock_bh(&neigh
->lock
);
1228 neigh_update_notify(neigh
);
1232 EXPORT_SYMBOL(neigh_update
);
1234 struct neighbour
*neigh_event_ns(struct neigh_table
*tbl
,
1235 u8
*lladdr
, void *saddr
,
1236 struct net_device
*dev
)
1238 struct neighbour
*neigh
= __neigh_lookup(tbl
, saddr
, dev
,
1239 lladdr
|| !dev
->addr_len
);
1241 neigh_update(neigh
, lladdr
, NUD_STALE
,
1242 NEIGH_UPDATE_F_OVERRIDE
);
1245 EXPORT_SYMBOL(neigh_event_ns
);
1247 /* called with read_lock_bh(&n->lock); */
1248 static void neigh_hh_init(struct neighbour
*n
, struct dst_entry
*dst
)
1250 struct net_device
*dev
= dst
->dev
;
1251 __be16 prot
= dst
->ops
->protocol
;
1252 struct hh_cache
*hh
= &n
->hh
;
1254 write_lock_bh(&n
->lock
);
1256 /* Only one thread can come in here and initialize the
1260 dev
->header_ops
->cache(n
, hh
, prot
);
1262 write_unlock_bh(&n
->lock
);
1265 /* This function can be used in contexts, where only old dev_queue_xmit
1266 * worked, f.e. if you want to override normal output path (eql, shaper),
1267 * but resolution is not made yet.
1270 int neigh_compat_output(struct neighbour
*neigh
, struct sk_buff
*skb
)
1272 struct net_device
*dev
= skb
->dev
;
1274 __skb_pull(skb
, skb_network_offset(skb
));
1276 if (dev_hard_header(skb
, dev
, ntohs(skb
->protocol
), NULL
, NULL
,
1278 dev_rebuild_header(skb
))
1281 return dev_queue_xmit(skb
);
1283 EXPORT_SYMBOL(neigh_compat_output
);
1285 /* Slow and careful. */
1287 int neigh_resolve_output(struct neighbour
*neigh
, struct sk_buff
*skb
)
1289 struct dst_entry
*dst
= skb_dst(skb
);
1295 if (!neigh_event_send(neigh
, skb
)) {
1297 struct net_device
*dev
= neigh
->dev
;
1300 if (dev
->header_ops
->cache
&& !neigh
->hh
.hh_len
)
1301 neigh_hh_init(neigh
, dst
);
1304 __skb_pull(skb
, skb_network_offset(skb
));
1305 seq
= read_seqbegin(&neigh
->ha_lock
);
1306 err
= dev_hard_header(skb
, dev
, ntohs(skb
->protocol
),
1307 neigh
->ha
, NULL
, skb
->len
);
1308 } while (read_seqretry(&neigh
->ha_lock
, seq
));
1311 rc
= dev_queue_xmit(skb
);
1318 neigh_dbg(1, "%s: dst=%p neigh=%p\n", __func__
, dst
, neigh
);
1324 EXPORT_SYMBOL(neigh_resolve_output
);
1326 /* As fast as possible without hh cache */
1328 int neigh_connected_output(struct neighbour
*neigh
, struct sk_buff
*skb
)
1330 struct net_device
*dev
= neigh
->dev
;
1335 __skb_pull(skb
, skb_network_offset(skb
));
1336 seq
= read_seqbegin(&neigh
->ha_lock
);
1337 err
= dev_hard_header(skb
, dev
, ntohs(skb
->protocol
),
1338 neigh
->ha
, NULL
, skb
->len
);
1339 } while (read_seqretry(&neigh
->ha_lock
, seq
));
1342 err
= dev_queue_xmit(skb
);
1349 EXPORT_SYMBOL(neigh_connected_output
);
1351 int neigh_direct_output(struct neighbour
*neigh
, struct sk_buff
*skb
)
1353 return dev_queue_xmit(skb
);
1355 EXPORT_SYMBOL(neigh_direct_output
);
1357 static void neigh_proxy_process(unsigned long arg
)
1359 struct neigh_table
*tbl
= (struct neigh_table
*)arg
;
1360 long sched_next
= 0;
1361 unsigned long now
= jiffies
;
1362 struct sk_buff
*skb
, *n
;
1364 spin_lock(&tbl
->proxy_queue
.lock
);
1366 skb_queue_walk_safe(&tbl
->proxy_queue
, skb
, n
) {
1367 long tdif
= NEIGH_CB(skb
)->sched_next
- now
;
1370 struct net_device
*dev
= skb
->dev
;
1372 __skb_unlink(skb
, &tbl
->proxy_queue
);
1373 if (tbl
->proxy_redo
&& netif_running(dev
)) {
1375 tbl
->proxy_redo(skb
);
1382 } else if (!sched_next
|| tdif
< sched_next
)
1385 del_timer(&tbl
->proxy_timer
);
1387 mod_timer(&tbl
->proxy_timer
, jiffies
+ sched_next
);
1388 spin_unlock(&tbl
->proxy_queue
.lock
);
1391 void pneigh_enqueue(struct neigh_table
*tbl
, struct neigh_parms
*p
,
1392 struct sk_buff
*skb
)
1394 unsigned long now
= jiffies
;
1395 unsigned long sched_next
= now
+ (net_random() % p
->proxy_delay
);
1397 if (tbl
->proxy_queue
.qlen
> p
->proxy_qlen
) {
1402 NEIGH_CB(skb
)->sched_next
= sched_next
;
1403 NEIGH_CB(skb
)->flags
|= LOCALLY_ENQUEUED
;
1405 spin_lock(&tbl
->proxy_queue
.lock
);
1406 if (del_timer(&tbl
->proxy_timer
)) {
1407 if (time_before(tbl
->proxy_timer
.expires
, sched_next
))
1408 sched_next
= tbl
->proxy_timer
.expires
;
1412 __skb_queue_tail(&tbl
->proxy_queue
, skb
);
1413 mod_timer(&tbl
->proxy_timer
, sched_next
);
1414 spin_unlock(&tbl
->proxy_queue
.lock
);
1416 EXPORT_SYMBOL(pneigh_enqueue
);
1418 static inline struct neigh_parms
*lookup_neigh_parms(struct neigh_table
*tbl
,
1419 struct net
*net
, int ifindex
)
1421 struct neigh_parms
*p
;
1423 for (p
= &tbl
->parms
; p
; p
= p
->next
) {
1424 if ((p
->dev
&& p
->dev
->ifindex
== ifindex
&& net_eq(neigh_parms_net(p
), net
)) ||
1425 (!p
->dev
&& !ifindex
))
1432 struct neigh_parms
*neigh_parms_alloc(struct net_device
*dev
,
1433 struct neigh_table
*tbl
)
1435 struct neigh_parms
*p
, *ref
;
1436 struct net
*net
= dev_net(dev
);
1437 const struct net_device_ops
*ops
= dev
->netdev_ops
;
1439 ref
= lookup_neigh_parms(tbl
, net
, 0);
1443 p
= kmemdup(ref
, sizeof(*p
), GFP_KERNEL
);
1446 atomic_set(&p
->refcnt
, 1);
1448 neigh_rand_reach_time(p
->base_reachable_time
);
1451 write_pnet(&p
->net
, hold_net(net
));
1452 p
->sysctl_table
= NULL
;
1454 if (ops
->ndo_neigh_setup
&& ops
->ndo_neigh_setup(dev
, p
)) {
1461 write_lock_bh(&tbl
->lock
);
1462 p
->next
= tbl
->parms
.next
;
1463 tbl
->parms
.next
= p
;
1464 write_unlock_bh(&tbl
->lock
);
1468 EXPORT_SYMBOL(neigh_parms_alloc
);
1470 static void neigh_rcu_free_parms(struct rcu_head
*head
)
1472 struct neigh_parms
*parms
=
1473 container_of(head
, struct neigh_parms
, rcu_head
);
1475 neigh_parms_put(parms
);
1478 void neigh_parms_release(struct neigh_table
*tbl
, struct neigh_parms
*parms
)
1480 struct neigh_parms
**p
;
1482 if (!parms
|| parms
== &tbl
->parms
)
1484 write_lock_bh(&tbl
->lock
);
1485 for (p
= &tbl
->parms
.next
; *p
; p
= &(*p
)->next
) {
1489 write_unlock_bh(&tbl
->lock
);
1491 dev_put(parms
->dev
);
1492 call_rcu(&parms
->rcu_head
, neigh_rcu_free_parms
);
1496 write_unlock_bh(&tbl
->lock
);
1497 neigh_dbg(1, "%s: not found\n", __func__
);
1499 EXPORT_SYMBOL(neigh_parms_release
);
1501 static void neigh_parms_destroy(struct neigh_parms
*parms
)
1503 release_net(neigh_parms_net(parms
));
1507 static struct lock_class_key neigh_table_proxy_queue_class
;
1509 static void neigh_table_init_no_netlink(struct neigh_table
*tbl
)
1511 unsigned long now
= jiffies
;
1512 unsigned long phsize
;
1514 write_pnet(&tbl
->parms
.net
, &init_net
);
1515 atomic_set(&tbl
->parms
.refcnt
, 1);
1516 tbl
->parms
.reachable_time
=
1517 neigh_rand_reach_time(tbl
->parms
.base_reachable_time
);
1519 tbl
->stats
= alloc_percpu(struct neigh_statistics
);
1521 panic("cannot create neighbour cache statistics");
1523 #ifdef CONFIG_PROC_FS
1524 if (!proc_create_data(tbl
->id
, 0, init_net
.proc_net_stat
,
1525 &neigh_stat_seq_fops
, tbl
))
1526 panic("cannot create neighbour proc dir entry");
1529 RCU_INIT_POINTER(tbl
->nht
, neigh_hash_alloc(3));
1531 phsize
= (PNEIGH_HASHMASK
+ 1) * sizeof(struct pneigh_entry
*);
1532 tbl
->phash_buckets
= kzalloc(phsize
, GFP_KERNEL
);
1534 if (!tbl
->nht
|| !tbl
->phash_buckets
)
1535 panic("cannot allocate neighbour cache hashes");
1537 if (!tbl
->entry_size
)
1538 tbl
->entry_size
= ALIGN(offsetof(struct neighbour
, primary_key
) +
1539 tbl
->key_len
, NEIGH_PRIV_ALIGN
);
1541 WARN_ON(tbl
->entry_size
% NEIGH_PRIV_ALIGN
);
1543 rwlock_init(&tbl
->lock
);
1544 INIT_DEFERRABLE_WORK(&tbl
->gc_work
, neigh_periodic_work
);
1545 schedule_delayed_work(&tbl
->gc_work
, tbl
->parms
.reachable_time
);
1546 setup_timer(&tbl
->proxy_timer
, neigh_proxy_process
, (unsigned long)tbl
);
1547 skb_queue_head_init_class(&tbl
->proxy_queue
,
1548 &neigh_table_proxy_queue_class
);
1550 tbl
->last_flush
= now
;
1551 tbl
->last_rand
= now
+ tbl
->parms
.reachable_time
* 20;
1554 void neigh_table_init(struct neigh_table
*tbl
)
1556 struct neigh_table
*tmp
;
1558 neigh_table_init_no_netlink(tbl
);
1559 write_lock(&neigh_tbl_lock
);
1560 for (tmp
= neigh_tables
; tmp
; tmp
= tmp
->next
) {
1561 if (tmp
->family
== tbl
->family
)
1564 tbl
->next
= neigh_tables
;
1566 write_unlock(&neigh_tbl_lock
);
1568 if (unlikely(tmp
)) {
1569 pr_err("Registering multiple tables for family %d\n",
1574 EXPORT_SYMBOL(neigh_table_init
);
1576 int neigh_table_clear(struct neigh_table
*tbl
)
1578 struct neigh_table
**tp
;
1580 /* It is not clean... Fix it to unload IPv6 module safely */
1581 cancel_delayed_work_sync(&tbl
->gc_work
);
1582 del_timer_sync(&tbl
->proxy_timer
);
1583 pneigh_queue_purge(&tbl
->proxy_queue
);
1584 neigh_ifdown(tbl
, NULL
);
1585 if (atomic_read(&tbl
->entries
))
1586 pr_crit("neighbour leakage\n");
1587 write_lock(&neigh_tbl_lock
);
1588 for (tp
= &neigh_tables
; *tp
; tp
= &(*tp
)->next
) {
1594 write_unlock(&neigh_tbl_lock
);
1596 call_rcu(&rcu_dereference_protected(tbl
->nht
, 1)->rcu
,
1597 neigh_hash_free_rcu
);
1600 kfree(tbl
->phash_buckets
);
1601 tbl
->phash_buckets
= NULL
;
1603 remove_proc_entry(tbl
->id
, init_net
.proc_net_stat
);
1605 free_percpu(tbl
->stats
);
1610 EXPORT_SYMBOL(neigh_table_clear
);
1612 static int neigh_delete(struct sk_buff
*skb
, struct nlmsghdr
*nlh
)
1614 struct net
*net
= sock_net(skb
->sk
);
1616 struct nlattr
*dst_attr
;
1617 struct neigh_table
*tbl
;
1618 struct net_device
*dev
= NULL
;
1622 if (nlmsg_len(nlh
) < sizeof(*ndm
))
1625 dst_attr
= nlmsg_find_attr(nlh
, sizeof(*ndm
), NDA_DST
);
1626 if (dst_attr
== NULL
)
1629 ndm
= nlmsg_data(nlh
);
1630 if (ndm
->ndm_ifindex
) {
1631 dev
= __dev_get_by_index(net
, ndm
->ndm_ifindex
);
1638 read_lock(&neigh_tbl_lock
);
1639 for (tbl
= neigh_tables
; tbl
; tbl
= tbl
->next
) {
1640 struct neighbour
*neigh
;
1642 if (tbl
->family
!= ndm
->ndm_family
)
1644 read_unlock(&neigh_tbl_lock
);
1646 if (nla_len(dst_attr
) < tbl
->key_len
)
1649 if (ndm
->ndm_flags
& NTF_PROXY
) {
1650 err
= pneigh_delete(tbl
, net
, nla_data(dst_attr
), dev
);
1657 neigh
= neigh_lookup(tbl
, nla_data(dst_attr
), dev
);
1658 if (neigh
== NULL
) {
1663 err
= neigh_update(neigh
, NULL
, NUD_FAILED
,
1664 NEIGH_UPDATE_F_OVERRIDE
|
1665 NEIGH_UPDATE_F_ADMIN
);
1666 neigh_release(neigh
);
1669 read_unlock(&neigh_tbl_lock
);
1670 err
= -EAFNOSUPPORT
;
1676 static int neigh_add(struct sk_buff
*skb
, struct nlmsghdr
*nlh
)
1678 struct net
*net
= sock_net(skb
->sk
);
1680 struct nlattr
*tb
[NDA_MAX
+1];
1681 struct neigh_table
*tbl
;
1682 struct net_device
*dev
= NULL
;
1686 err
= nlmsg_parse(nlh
, sizeof(*ndm
), tb
, NDA_MAX
, NULL
);
1691 if (tb
[NDA_DST
] == NULL
)
1694 ndm
= nlmsg_data(nlh
);
1695 if (ndm
->ndm_ifindex
) {
1696 dev
= __dev_get_by_index(net
, ndm
->ndm_ifindex
);
1702 if (tb
[NDA_LLADDR
] && nla_len(tb
[NDA_LLADDR
]) < dev
->addr_len
)
1706 read_lock(&neigh_tbl_lock
);
1707 for (tbl
= neigh_tables
; tbl
; tbl
= tbl
->next
) {
1708 int flags
= NEIGH_UPDATE_F_ADMIN
| NEIGH_UPDATE_F_OVERRIDE
;
1709 struct neighbour
*neigh
;
1712 if (tbl
->family
!= ndm
->ndm_family
)
1714 read_unlock(&neigh_tbl_lock
);
1716 if (nla_len(tb
[NDA_DST
]) < tbl
->key_len
)
1718 dst
= nla_data(tb
[NDA_DST
]);
1719 lladdr
= tb
[NDA_LLADDR
] ? nla_data(tb
[NDA_LLADDR
]) : NULL
;
1721 if (ndm
->ndm_flags
& NTF_PROXY
) {
1722 struct pneigh_entry
*pn
;
1725 pn
= pneigh_lookup(tbl
, net
, dst
, dev
, 1);
1727 pn
->flags
= ndm
->ndm_flags
;
1736 neigh
= neigh_lookup(tbl
, dst
, dev
);
1737 if (neigh
== NULL
) {
1738 if (!(nlh
->nlmsg_flags
& NLM_F_CREATE
)) {
1743 neigh
= __neigh_lookup_errno(tbl
, dst
, dev
);
1744 if (IS_ERR(neigh
)) {
1745 err
= PTR_ERR(neigh
);
1749 if (nlh
->nlmsg_flags
& NLM_F_EXCL
) {
1751 neigh_release(neigh
);
1755 if (!(nlh
->nlmsg_flags
& NLM_F_REPLACE
))
1756 flags
&= ~NEIGH_UPDATE_F_OVERRIDE
;
1759 if (ndm
->ndm_flags
& NTF_USE
) {
1760 neigh_event_send(neigh
, NULL
);
1763 err
= neigh_update(neigh
, lladdr
, ndm
->ndm_state
, flags
);
1764 neigh_release(neigh
);
1768 read_unlock(&neigh_tbl_lock
);
1769 err
= -EAFNOSUPPORT
;
1774 static int neightbl_fill_parms(struct sk_buff
*skb
, struct neigh_parms
*parms
)
1776 struct nlattr
*nest
;
1778 nest
= nla_nest_start(skb
, NDTA_PARMS
);
1783 nla_put_u32(skb
, NDTPA_IFINDEX
, parms
->dev
->ifindex
)) ||
1784 nla_put_u32(skb
, NDTPA_REFCNT
, atomic_read(&parms
->refcnt
)) ||
1785 nla_put_u32(skb
, NDTPA_QUEUE_LENBYTES
, parms
->queue_len_bytes
) ||
1786 /* approximative value for deprecated QUEUE_LEN (in packets) */
1787 nla_put_u32(skb
, NDTPA_QUEUE_LEN
,
1788 parms
->queue_len_bytes
/ SKB_TRUESIZE(ETH_FRAME_LEN
)) ||
1789 nla_put_u32(skb
, NDTPA_PROXY_QLEN
, parms
->proxy_qlen
) ||
1790 nla_put_u32(skb
, NDTPA_APP_PROBES
, parms
->app_probes
) ||
1791 nla_put_u32(skb
, NDTPA_UCAST_PROBES
, parms
->ucast_probes
) ||
1792 nla_put_u32(skb
, NDTPA_MCAST_PROBES
, parms
->mcast_probes
) ||
1793 nla_put_msecs(skb
, NDTPA_REACHABLE_TIME
, parms
->reachable_time
) ||
1794 nla_put_msecs(skb
, NDTPA_BASE_REACHABLE_TIME
,
1795 parms
->base_reachable_time
) ||
1796 nla_put_msecs(skb
, NDTPA_GC_STALETIME
, parms
->gc_staletime
) ||
1797 nla_put_msecs(skb
, NDTPA_DELAY_PROBE_TIME
,
1798 parms
->delay_probe_time
) ||
1799 nla_put_msecs(skb
, NDTPA_RETRANS_TIME
, parms
->retrans_time
) ||
1800 nla_put_msecs(skb
, NDTPA_ANYCAST_DELAY
, parms
->anycast_delay
) ||
1801 nla_put_msecs(skb
, NDTPA_PROXY_DELAY
, parms
->proxy_delay
) ||
1802 nla_put_msecs(skb
, NDTPA_LOCKTIME
, parms
->locktime
))
1803 goto nla_put_failure
;
1804 return nla_nest_end(skb
, nest
);
1807 nla_nest_cancel(skb
, nest
);
1811 static int neightbl_fill_info(struct sk_buff
*skb
, struct neigh_table
*tbl
,
1812 u32 pid
, u32 seq
, int type
, int flags
)
1814 struct nlmsghdr
*nlh
;
1815 struct ndtmsg
*ndtmsg
;
1817 nlh
= nlmsg_put(skb
, pid
, seq
, type
, sizeof(*ndtmsg
), flags
);
1821 ndtmsg
= nlmsg_data(nlh
);
1823 read_lock_bh(&tbl
->lock
);
1824 ndtmsg
->ndtm_family
= tbl
->family
;
1825 ndtmsg
->ndtm_pad1
= 0;
1826 ndtmsg
->ndtm_pad2
= 0;
1828 if (nla_put_string(skb
, NDTA_NAME
, tbl
->id
) ||
1829 nla_put_msecs(skb
, NDTA_GC_INTERVAL
, tbl
->gc_interval
) ||
1830 nla_put_u32(skb
, NDTA_THRESH1
, tbl
->gc_thresh1
) ||
1831 nla_put_u32(skb
, NDTA_THRESH2
, tbl
->gc_thresh2
) ||
1832 nla_put_u32(skb
, NDTA_THRESH3
, tbl
->gc_thresh3
))
1833 goto nla_put_failure
;
1835 unsigned long now
= jiffies
;
1836 unsigned int flush_delta
= now
- tbl
->last_flush
;
1837 unsigned int rand_delta
= now
- tbl
->last_rand
;
1838 struct neigh_hash_table
*nht
;
1839 struct ndt_config ndc
= {
1840 .ndtc_key_len
= tbl
->key_len
,
1841 .ndtc_entry_size
= tbl
->entry_size
,
1842 .ndtc_entries
= atomic_read(&tbl
->entries
),
1843 .ndtc_last_flush
= jiffies_to_msecs(flush_delta
),
1844 .ndtc_last_rand
= jiffies_to_msecs(rand_delta
),
1845 .ndtc_proxy_qlen
= tbl
->proxy_queue
.qlen
,
1849 nht
= rcu_dereference_bh(tbl
->nht
);
1850 ndc
.ndtc_hash_rnd
= nht
->hash_rnd
[0];
1851 ndc
.ndtc_hash_mask
= ((1 << nht
->hash_shift
) - 1);
1852 rcu_read_unlock_bh();
1854 if (nla_put(skb
, NDTA_CONFIG
, sizeof(ndc
), &ndc
))
1855 goto nla_put_failure
;
1860 struct ndt_stats ndst
;
1862 memset(&ndst
, 0, sizeof(ndst
));
1864 for_each_possible_cpu(cpu
) {
1865 struct neigh_statistics
*st
;
1867 st
= per_cpu_ptr(tbl
->stats
, cpu
);
1868 ndst
.ndts_allocs
+= st
->allocs
;
1869 ndst
.ndts_destroys
+= st
->destroys
;
1870 ndst
.ndts_hash_grows
+= st
->hash_grows
;
1871 ndst
.ndts_res_failed
+= st
->res_failed
;
1872 ndst
.ndts_lookups
+= st
->lookups
;
1873 ndst
.ndts_hits
+= st
->hits
;
1874 ndst
.ndts_rcv_probes_mcast
+= st
->rcv_probes_mcast
;
1875 ndst
.ndts_rcv_probes_ucast
+= st
->rcv_probes_ucast
;
1876 ndst
.ndts_periodic_gc_runs
+= st
->periodic_gc_runs
;
1877 ndst
.ndts_forced_gc_runs
+= st
->forced_gc_runs
;
1880 if (nla_put(skb
, NDTA_STATS
, sizeof(ndst
), &ndst
))
1881 goto nla_put_failure
;
1884 BUG_ON(tbl
->parms
.dev
);
1885 if (neightbl_fill_parms(skb
, &tbl
->parms
) < 0)
1886 goto nla_put_failure
;
1888 read_unlock_bh(&tbl
->lock
);
1889 return nlmsg_end(skb
, nlh
);
1892 read_unlock_bh(&tbl
->lock
);
1893 nlmsg_cancel(skb
, nlh
);
1897 static int neightbl_fill_param_info(struct sk_buff
*skb
,
1898 struct neigh_table
*tbl
,
1899 struct neigh_parms
*parms
,
1900 u32 pid
, u32 seq
, int type
,
1903 struct ndtmsg
*ndtmsg
;
1904 struct nlmsghdr
*nlh
;
1906 nlh
= nlmsg_put(skb
, pid
, seq
, type
, sizeof(*ndtmsg
), flags
);
1910 ndtmsg
= nlmsg_data(nlh
);
1912 read_lock_bh(&tbl
->lock
);
1913 ndtmsg
->ndtm_family
= tbl
->family
;
1914 ndtmsg
->ndtm_pad1
= 0;
1915 ndtmsg
->ndtm_pad2
= 0;
1917 if (nla_put_string(skb
, NDTA_NAME
, tbl
->id
) < 0 ||
1918 neightbl_fill_parms(skb
, parms
) < 0)
1921 read_unlock_bh(&tbl
->lock
);
1922 return nlmsg_end(skb
, nlh
);
1924 read_unlock_bh(&tbl
->lock
);
1925 nlmsg_cancel(skb
, nlh
);
1929 static const struct nla_policy nl_neightbl_policy
[NDTA_MAX
+1] = {
1930 [NDTA_NAME
] = { .type
= NLA_STRING
},
1931 [NDTA_THRESH1
] = { .type
= NLA_U32
},
1932 [NDTA_THRESH2
] = { .type
= NLA_U32
},
1933 [NDTA_THRESH3
] = { .type
= NLA_U32
},
1934 [NDTA_GC_INTERVAL
] = { .type
= NLA_U64
},
1935 [NDTA_PARMS
] = { .type
= NLA_NESTED
},
1938 static const struct nla_policy nl_ntbl_parm_policy
[NDTPA_MAX
+1] = {
1939 [NDTPA_IFINDEX
] = { .type
= NLA_U32
},
1940 [NDTPA_QUEUE_LEN
] = { .type
= NLA_U32
},
1941 [NDTPA_PROXY_QLEN
] = { .type
= NLA_U32
},
1942 [NDTPA_APP_PROBES
] = { .type
= NLA_U32
},
1943 [NDTPA_UCAST_PROBES
] = { .type
= NLA_U32
},
1944 [NDTPA_MCAST_PROBES
] = { .type
= NLA_U32
},
1945 [NDTPA_BASE_REACHABLE_TIME
] = { .type
= NLA_U64
},
1946 [NDTPA_GC_STALETIME
] = { .type
= NLA_U64
},
1947 [NDTPA_DELAY_PROBE_TIME
] = { .type
= NLA_U64
},
1948 [NDTPA_RETRANS_TIME
] = { .type
= NLA_U64
},
1949 [NDTPA_ANYCAST_DELAY
] = { .type
= NLA_U64
},
1950 [NDTPA_PROXY_DELAY
] = { .type
= NLA_U64
},
1951 [NDTPA_LOCKTIME
] = { .type
= NLA_U64
},
1954 static int neightbl_set(struct sk_buff
*skb
, struct nlmsghdr
*nlh
)
1956 struct net
*net
= sock_net(skb
->sk
);
1957 struct neigh_table
*tbl
;
1958 struct ndtmsg
*ndtmsg
;
1959 struct nlattr
*tb
[NDTA_MAX
+1];
1962 err
= nlmsg_parse(nlh
, sizeof(*ndtmsg
), tb
, NDTA_MAX
,
1963 nl_neightbl_policy
);
1967 if (tb
[NDTA_NAME
] == NULL
) {
1972 ndtmsg
= nlmsg_data(nlh
);
1973 read_lock(&neigh_tbl_lock
);
1974 for (tbl
= neigh_tables
; tbl
; tbl
= tbl
->next
) {
1975 if (ndtmsg
->ndtm_family
&& tbl
->family
!= ndtmsg
->ndtm_family
)
1978 if (nla_strcmp(tb
[NDTA_NAME
], tbl
->id
) == 0)
1988 * We acquire tbl->lock to be nice to the periodic timers and
1989 * make sure they always see a consistent set of values.
1991 write_lock_bh(&tbl
->lock
);
1993 if (tb
[NDTA_PARMS
]) {
1994 struct nlattr
*tbp
[NDTPA_MAX
+1];
1995 struct neigh_parms
*p
;
1998 err
= nla_parse_nested(tbp
, NDTPA_MAX
, tb
[NDTA_PARMS
],
1999 nl_ntbl_parm_policy
);
2001 goto errout_tbl_lock
;
2003 if (tbp
[NDTPA_IFINDEX
])
2004 ifindex
= nla_get_u32(tbp
[NDTPA_IFINDEX
]);
2006 p
= lookup_neigh_parms(tbl
, net
, ifindex
);
2009 goto errout_tbl_lock
;
2012 for (i
= 1; i
<= NDTPA_MAX
; i
++) {
2017 case NDTPA_QUEUE_LEN
:
2018 p
->queue_len_bytes
= nla_get_u32(tbp
[i
]) *
2019 SKB_TRUESIZE(ETH_FRAME_LEN
);
2021 case NDTPA_QUEUE_LENBYTES
:
2022 p
->queue_len_bytes
= nla_get_u32(tbp
[i
]);
2024 case NDTPA_PROXY_QLEN
:
2025 p
->proxy_qlen
= nla_get_u32(tbp
[i
]);
2027 case NDTPA_APP_PROBES
:
2028 p
->app_probes
= nla_get_u32(tbp
[i
]);
2030 case NDTPA_UCAST_PROBES
:
2031 p
->ucast_probes
= nla_get_u32(tbp
[i
]);
2033 case NDTPA_MCAST_PROBES
:
2034 p
->mcast_probes
= nla_get_u32(tbp
[i
]);
2036 case NDTPA_BASE_REACHABLE_TIME
:
2037 p
->base_reachable_time
= nla_get_msecs(tbp
[i
]);
2039 case NDTPA_GC_STALETIME
:
2040 p
->gc_staletime
= nla_get_msecs(tbp
[i
]);
2042 case NDTPA_DELAY_PROBE_TIME
:
2043 p
->delay_probe_time
= nla_get_msecs(tbp
[i
]);
2045 case NDTPA_RETRANS_TIME
:
2046 p
->retrans_time
= nla_get_msecs(tbp
[i
]);
2048 case NDTPA_ANYCAST_DELAY
:
2049 p
->anycast_delay
= nla_get_msecs(tbp
[i
]);
2051 case NDTPA_PROXY_DELAY
:
2052 p
->proxy_delay
= nla_get_msecs(tbp
[i
]);
2054 case NDTPA_LOCKTIME
:
2055 p
->locktime
= nla_get_msecs(tbp
[i
]);
2061 if (tb
[NDTA_THRESH1
])
2062 tbl
->gc_thresh1
= nla_get_u32(tb
[NDTA_THRESH1
]);
2064 if (tb
[NDTA_THRESH2
])
2065 tbl
->gc_thresh2
= nla_get_u32(tb
[NDTA_THRESH2
]);
2067 if (tb
[NDTA_THRESH3
])
2068 tbl
->gc_thresh3
= nla_get_u32(tb
[NDTA_THRESH3
]);
2070 if (tb
[NDTA_GC_INTERVAL
])
2071 tbl
->gc_interval
= nla_get_msecs(tb
[NDTA_GC_INTERVAL
]);
2076 write_unlock_bh(&tbl
->lock
);
2078 read_unlock(&neigh_tbl_lock
);
2083 static int neightbl_dump_info(struct sk_buff
*skb
, struct netlink_callback
*cb
)
2085 struct net
*net
= sock_net(skb
->sk
);
2086 int family
, tidx
, nidx
= 0;
2087 int tbl_skip
= cb
->args
[0];
2088 int neigh_skip
= cb
->args
[1];
2089 struct neigh_table
*tbl
;
2091 family
= ((struct rtgenmsg
*) nlmsg_data(cb
->nlh
))->rtgen_family
;
2093 read_lock(&neigh_tbl_lock
);
2094 for (tbl
= neigh_tables
, tidx
= 0; tbl
; tbl
= tbl
->next
, tidx
++) {
2095 struct neigh_parms
*p
;
2097 if (tidx
< tbl_skip
|| (family
&& tbl
->family
!= family
))
2100 if (neightbl_fill_info(skb
, tbl
, NETLINK_CB(cb
->skb
).portid
,
2101 cb
->nlh
->nlmsg_seq
, RTM_NEWNEIGHTBL
,
2105 for (nidx
= 0, p
= tbl
->parms
.next
; p
; p
= p
->next
) {
2106 if (!net_eq(neigh_parms_net(p
), net
))
2109 if (nidx
< neigh_skip
)
2112 if (neightbl_fill_param_info(skb
, tbl
, p
,
2113 NETLINK_CB(cb
->skb
).portid
,
2125 read_unlock(&neigh_tbl_lock
);
2132 static int neigh_fill_info(struct sk_buff
*skb
, struct neighbour
*neigh
,
2133 u32 pid
, u32 seq
, int type
, unsigned int flags
)
2135 unsigned long now
= jiffies
;
2136 struct nda_cacheinfo ci
;
2137 struct nlmsghdr
*nlh
;
2140 nlh
= nlmsg_put(skb
, pid
, seq
, type
, sizeof(*ndm
), flags
);
2144 ndm
= nlmsg_data(nlh
);
2145 ndm
->ndm_family
= neigh
->ops
->family
;
2148 ndm
->ndm_flags
= neigh
->flags
;
2149 ndm
->ndm_type
= neigh
->type
;
2150 ndm
->ndm_ifindex
= neigh
->dev
->ifindex
;
2152 if (nla_put(skb
, NDA_DST
, neigh
->tbl
->key_len
, neigh
->primary_key
))
2153 goto nla_put_failure
;
2155 read_lock_bh(&neigh
->lock
);
2156 ndm
->ndm_state
= neigh
->nud_state
;
2157 if (neigh
->nud_state
& NUD_VALID
) {
2158 char haddr
[MAX_ADDR_LEN
];
2160 neigh_ha_snapshot(haddr
, neigh
, neigh
->dev
);
2161 if (nla_put(skb
, NDA_LLADDR
, neigh
->dev
->addr_len
, haddr
) < 0) {
2162 read_unlock_bh(&neigh
->lock
);
2163 goto nla_put_failure
;
2167 ci
.ndm_used
= jiffies_to_clock_t(now
- neigh
->used
);
2168 ci
.ndm_confirmed
= jiffies_to_clock_t(now
- neigh
->confirmed
);
2169 ci
.ndm_updated
= jiffies_to_clock_t(now
- neigh
->updated
);
2170 ci
.ndm_refcnt
= atomic_read(&neigh
->refcnt
) - 1;
2171 read_unlock_bh(&neigh
->lock
);
2173 if (nla_put_u32(skb
, NDA_PROBES
, atomic_read(&neigh
->probes
)) ||
2174 nla_put(skb
, NDA_CACHEINFO
, sizeof(ci
), &ci
))
2175 goto nla_put_failure
;
2177 return nlmsg_end(skb
, nlh
);
2180 nlmsg_cancel(skb
, nlh
);
2184 static int pneigh_fill_info(struct sk_buff
*skb
, struct pneigh_entry
*pn
,
2185 u32 pid
, u32 seq
, int type
, unsigned int flags
,
2186 struct neigh_table
*tbl
)
2188 struct nlmsghdr
*nlh
;
2191 nlh
= nlmsg_put(skb
, pid
, seq
, type
, sizeof(*ndm
), flags
);
2195 ndm
= nlmsg_data(nlh
);
2196 ndm
->ndm_family
= tbl
->family
;
2199 ndm
->ndm_flags
= pn
->flags
| NTF_PROXY
;
2200 ndm
->ndm_type
= NDA_DST
;
2201 ndm
->ndm_ifindex
= pn
->dev
->ifindex
;
2202 ndm
->ndm_state
= NUD_NONE
;
2204 if (nla_put(skb
, NDA_DST
, tbl
->key_len
, pn
->key
))
2205 goto nla_put_failure
;
2207 return nlmsg_end(skb
, nlh
);
2210 nlmsg_cancel(skb
, nlh
);
2214 static void neigh_update_notify(struct neighbour
*neigh
)
2216 call_netevent_notifiers(NETEVENT_NEIGH_UPDATE
, neigh
);
2217 __neigh_notify(neigh
, RTM_NEWNEIGH
, 0);
2220 static int neigh_dump_table(struct neigh_table
*tbl
, struct sk_buff
*skb
,
2221 struct netlink_callback
*cb
)
2223 struct net
*net
= sock_net(skb
->sk
);
2224 struct neighbour
*n
;
2225 int rc
, h
, s_h
= cb
->args
[1];
2226 int idx
, s_idx
= idx
= cb
->args
[2];
2227 struct neigh_hash_table
*nht
;
2230 nht
= rcu_dereference_bh(tbl
->nht
);
2232 for (h
= s_h
; h
< (1 << nht
->hash_shift
); h
++) {
2235 for (n
= rcu_dereference_bh(nht
->hash_buckets
[h
]), idx
= 0;
2237 n
= rcu_dereference_bh(n
->next
)) {
2238 if (!net_eq(dev_net(n
->dev
), net
))
2242 if (neigh_fill_info(skb
, n
, NETLINK_CB(cb
->skb
).portid
,
2245 NLM_F_MULTI
) <= 0) {
2255 rcu_read_unlock_bh();
2261 static int pneigh_dump_table(struct neigh_table
*tbl
, struct sk_buff
*skb
,
2262 struct netlink_callback
*cb
)
2264 struct pneigh_entry
*n
;
2265 struct net
*net
= sock_net(skb
->sk
);
2266 int rc
, h
, s_h
= cb
->args
[3];
2267 int idx
, s_idx
= idx
= cb
->args
[4];
2269 read_lock_bh(&tbl
->lock
);
2271 for (h
= s_h
; h
<= PNEIGH_HASHMASK
; h
++) {
2274 for (n
= tbl
->phash_buckets
[h
], idx
= 0; n
; n
= n
->next
) {
2275 if (dev_net(n
->dev
) != net
)
2279 if (pneigh_fill_info(skb
, n
, NETLINK_CB(cb
->skb
).portid
,
2282 NLM_F_MULTI
, tbl
) <= 0) {
2283 read_unlock_bh(&tbl
->lock
);
2292 read_unlock_bh(&tbl
->lock
);
2301 static int neigh_dump_info(struct sk_buff
*skb
, struct netlink_callback
*cb
)
2303 struct neigh_table
*tbl
;
2308 read_lock(&neigh_tbl_lock
);
2309 family
= ((struct rtgenmsg
*) nlmsg_data(cb
->nlh
))->rtgen_family
;
2311 /* check for full ndmsg structure presence, family member is
2312 * the same for both structures
2314 if (nlmsg_len(cb
->nlh
) >= sizeof(struct ndmsg
) &&
2315 ((struct ndmsg
*) nlmsg_data(cb
->nlh
))->ndm_flags
== NTF_PROXY
)
2320 for (tbl
= neigh_tables
, t
= 0; tbl
;
2321 tbl
= tbl
->next
, t
++) {
2322 if (t
< s_t
|| (family
&& tbl
->family
!= family
))
2325 memset(&cb
->args
[1], 0, sizeof(cb
->args
) -
2326 sizeof(cb
->args
[0]));
2328 err
= pneigh_dump_table(tbl
, skb
, cb
);
2330 err
= neigh_dump_table(tbl
, skb
, cb
);
2334 read_unlock(&neigh_tbl_lock
);
2340 void neigh_for_each(struct neigh_table
*tbl
, void (*cb
)(struct neighbour
*, void *), void *cookie
)
2343 struct neigh_hash_table
*nht
;
2346 nht
= rcu_dereference_bh(tbl
->nht
);
2348 read_lock(&tbl
->lock
); /* avoid resizes */
2349 for (chain
= 0; chain
< (1 << nht
->hash_shift
); chain
++) {
2350 struct neighbour
*n
;
2352 for (n
= rcu_dereference_bh(nht
->hash_buckets
[chain
]);
2354 n
= rcu_dereference_bh(n
->next
))
2357 read_unlock(&tbl
->lock
);
2358 rcu_read_unlock_bh();
2360 EXPORT_SYMBOL(neigh_for_each
);
2362 /* The tbl->lock must be held as a writer and BH disabled. */
2363 void __neigh_for_each_release(struct neigh_table
*tbl
,
2364 int (*cb
)(struct neighbour
*))
2367 struct neigh_hash_table
*nht
;
2369 nht
= rcu_dereference_protected(tbl
->nht
,
2370 lockdep_is_held(&tbl
->lock
));
2371 for (chain
= 0; chain
< (1 << nht
->hash_shift
); chain
++) {
2372 struct neighbour
*n
;
2373 struct neighbour __rcu
**np
;
2375 np
= &nht
->hash_buckets
[chain
];
2376 while ((n
= rcu_dereference_protected(*np
,
2377 lockdep_is_held(&tbl
->lock
))) != NULL
) {
2380 write_lock(&n
->lock
);
2383 rcu_assign_pointer(*np
,
2384 rcu_dereference_protected(n
->next
,
2385 lockdep_is_held(&tbl
->lock
)));
2389 write_unlock(&n
->lock
);
2391 neigh_cleanup_and_release(n
);
2395 EXPORT_SYMBOL(__neigh_for_each_release
);
2397 #ifdef CONFIG_PROC_FS
2399 static struct neighbour
*neigh_get_first(struct seq_file
*seq
)
2401 struct neigh_seq_state
*state
= seq
->private;
2402 struct net
*net
= seq_file_net(seq
);
2403 struct neigh_hash_table
*nht
= state
->nht
;
2404 struct neighbour
*n
= NULL
;
2405 int bucket
= state
->bucket
;
2407 state
->flags
&= ~NEIGH_SEQ_IS_PNEIGH
;
2408 for (bucket
= 0; bucket
< (1 << nht
->hash_shift
); bucket
++) {
2409 n
= rcu_dereference_bh(nht
->hash_buckets
[bucket
]);
2412 if (!net_eq(dev_net(n
->dev
), net
))
2414 if (state
->neigh_sub_iter
) {
2418 v
= state
->neigh_sub_iter(state
, n
, &fakep
);
2422 if (!(state
->flags
& NEIGH_SEQ_SKIP_NOARP
))
2424 if (n
->nud_state
& ~NUD_NOARP
)
2427 n
= rcu_dereference_bh(n
->next
);
2433 state
->bucket
= bucket
;
2438 static struct neighbour
*neigh_get_next(struct seq_file
*seq
,
2439 struct neighbour
*n
,
2442 struct neigh_seq_state
*state
= seq
->private;
2443 struct net
*net
= seq_file_net(seq
);
2444 struct neigh_hash_table
*nht
= state
->nht
;
2446 if (state
->neigh_sub_iter
) {
2447 void *v
= state
->neigh_sub_iter(state
, n
, pos
);
2451 n
= rcu_dereference_bh(n
->next
);
2455 if (!net_eq(dev_net(n
->dev
), net
))
2457 if (state
->neigh_sub_iter
) {
2458 void *v
= state
->neigh_sub_iter(state
, n
, pos
);
2463 if (!(state
->flags
& NEIGH_SEQ_SKIP_NOARP
))
2466 if (n
->nud_state
& ~NUD_NOARP
)
2469 n
= rcu_dereference_bh(n
->next
);
2475 if (++state
->bucket
>= (1 << nht
->hash_shift
))
2478 n
= rcu_dereference_bh(nht
->hash_buckets
[state
->bucket
]);
2486 static struct neighbour
*neigh_get_idx(struct seq_file
*seq
, loff_t
*pos
)
2488 struct neighbour
*n
= neigh_get_first(seq
);
2493 n
= neigh_get_next(seq
, n
, pos
);
2498 return *pos
? NULL
: n
;
2501 static struct pneigh_entry
*pneigh_get_first(struct seq_file
*seq
)
2503 struct neigh_seq_state
*state
= seq
->private;
2504 struct net
*net
= seq_file_net(seq
);
2505 struct neigh_table
*tbl
= state
->tbl
;
2506 struct pneigh_entry
*pn
= NULL
;
2507 int bucket
= state
->bucket
;
2509 state
->flags
|= NEIGH_SEQ_IS_PNEIGH
;
2510 for (bucket
= 0; bucket
<= PNEIGH_HASHMASK
; bucket
++) {
2511 pn
= tbl
->phash_buckets
[bucket
];
2512 while (pn
&& !net_eq(pneigh_net(pn
), net
))
2517 state
->bucket
= bucket
;
2522 static struct pneigh_entry
*pneigh_get_next(struct seq_file
*seq
,
2523 struct pneigh_entry
*pn
,
2526 struct neigh_seq_state
*state
= seq
->private;
2527 struct net
*net
= seq_file_net(seq
);
2528 struct neigh_table
*tbl
= state
->tbl
;
2532 } while (pn
&& !net_eq(pneigh_net(pn
), net
));
2535 if (++state
->bucket
> PNEIGH_HASHMASK
)
2537 pn
= tbl
->phash_buckets
[state
->bucket
];
2538 while (pn
&& !net_eq(pneigh_net(pn
), net
))
2550 static struct pneigh_entry
*pneigh_get_idx(struct seq_file
*seq
, loff_t
*pos
)
2552 struct pneigh_entry
*pn
= pneigh_get_first(seq
);
2557 pn
= pneigh_get_next(seq
, pn
, pos
);
2562 return *pos
? NULL
: pn
;
2565 static void *neigh_get_idx_any(struct seq_file
*seq
, loff_t
*pos
)
2567 struct neigh_seq_state
*state
= seq
->private;
2569 loff_t idxpos
= *pos
;
2571 rc
= neigh_get_idx(seq
, &idxpos
);
2572 if (!rc
&& !(state
->flags
& NEIGH_SEQ_NEIGH_ONLY
))
2573 rc
= pneigh_get_idx(seq
, &idxpos
);
2578 void *neigh_seq_start(struct seq_file
*seq
, loff_t
*pos
, struct neigh_table
*tbl
, unsigned int neigh_seq_flags
)
2581 struct neigh_seq_state
*state
= seq
->private;
2585 state
->flags
= (neigh_seq_flags
& ~NEIGH_SEQ_IS_PNEIGH
);
2588 state
->nht
= rcu_dereference_bh(tbl
->nht
);
2590 return *pos
? neigh_get_idx_any(seq
, pos
) : SEQ_START_TOKEN
;
2592 EXPORT_SYMBOL(neigh_seq_start
);
2594 void *neigh_seq_next(struct seq_file
*seq
, void *v
, loff_t
*pos
)
2596 struct neigh_seq_state
*state
;
2599 if (v
== SEQ_START_TOKEN
) {
2600 rc
= neigh_get_first(seq
);
2604 state
= seq
->private;
2605 if (!(state
->flags
& NEIGH_SEQ_IS_PNEIGH
)) {
2606 rc
= neigh_get_next(seq
, v
, NULL
);
2609 if (!(state
->flags
& NEIGH_SEQ_NEIGH_ONLY
))
2610 rc
= pneigh_get_first(seq
);
2612 BUG_ON(state
->flags
& NEIGH_SEQ_NEIGH_ONLY
);
2613 rc
= pneigh_get_next(seq
, v
, NULL
);
2619 EXPORT_SYMBOL(neigh_seq_next
);
2621 void neigh_seq_stop(struct seq_file
*seq
, void *v
)
2624 rcu_read_unlock_bh();
2626 EXPORT_SYMBOL(neigh_seq_stop
);
2628 /* statistics via seq_file */
2630 static void *neigh_stat_seq_start(struct seq_file
*seq
, loff_t
*pos
)
2632 struct neigh_table
*tbl
= seq
->private;
2636 return SEQ_START_TOKEN
;
2638 for (cpu
= *pos
-1; cpu
< nr_cpu_ids
; ++cpu
) {
2639 if (!cpu_possible(cpu
))
2642 return per_cpu_ptr(tbl
->stats
, cpu
);
2647 static void *neigh_stat_seq_next(struct seq_file
*seq
, void *v
, loff_t
*pos
)
2649 struct neigh_table
*tbl
= seq
->private;
2652 for (cpu
= *pos
; cpu
< nr_cpu_ids
; ++cpu
) {
2653 if (!cpu_possible(cpu
))
2656 return per_cpu_ptr(tbl
->stats
, cpu
);
2661 static void neigh_stat_seq_stop(struct seq_file
*seq
, void *v
)
2666 static int neigh_stat_seq_show(struct seq_file
*seq
, void *v
)
2668 struct neigh_table
*tbl
= seq
->private;
2669 struct neigh_statistics
*st
= v
;
2671 if (v
== SEQ_START_TOKEN
) {
2672 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");
2676 seq_printf(seq
, "%08x %08lx %08lx %08lx %08lx %08lx %08lx "
2677 "%08lx %08lx %08lx %08lx %08lx\n",
2678 atomic_read(&tbl
->entries
),
2689 st
->rcv_probes_mcast
,
2690 st
->rcv_probes_ucast
,
2692 st
->periodic_gc_runs
,
2700 static const struct seq_operations neigh_stat_seq_ops
= {
2701 .start
= neigh_stat_seq_start
,
2702 .next
= neigh_stat_seq_next
,
2703 .stop
= neigh_stat_seq_stop
,
2704 .show
= neigh_stat_seq_show
,
2707 static int neigh_stat_seq_open(struct inode
*inode
, struct file
*file
)
2709 int ret
= seq_open(file
, &neigh_stat_seq_ops
);
2712 struct seq_file
*sf
= file
->private_data
;
2713 sf
->private = PDE_DATA(inode
);
2718 static const struct file_operations neigh_stat_seq_fops
= {
2719 .owner
= THIS_MODULE
,
2720 .open
= neigh_stat_seq_open
,
2722 .llseek
= seq_lseek
,
2723 .release
= seq_release
,
2726 #endif /* CONFIG_PROC_FS */
2728 static inline size_t neigh_nlmsg_size(void)
2730 return NLMSG_ALIGN(sizeof(struct ndmsg
))
2731 + nla_total_size(MAX_ADDR_LEN
) /* NDA_DST */
2732 + nla_total_size(MAX_ADDR_LEN
) /* NDA_LLADDR */
2733 + nla_total_size(sizeof(struct nda_cacheinfo
))
2734 + nla_total_size(4); /* NDA_PROBES */
2737 static void __neigh_notify(struct neighbour
*n
, int type
, int flags
)
2739 struct net
*net
= dev_net(n
->dev
);
2740 struct sk_buff
*skb
;
2743 skb
= nlmsg_new(neigh_nlmsg_size(), GFP_ATOMIC
);
2747 err
= neigh_fill_info(skb
, n
, 0, 0, type
, flags
);
2749 /* -EMSGSIZE implies BUG in neigh_nlmsg_size() */
2750 WARN_ON(err
== -EMSGSIZE
);
2754 rtnl_notify(skb
, net
, 0, RTNLGRP_NEIGH
, NULL
, GFP_ATOMIC
);
2758 rtnl_set_sk_err(net
, RTNLGRP_NEIGH
, err
);
2762 void neigh_app_ns(struct neighbour
*n
)
2764 __neigh_notify(n
, RTM_GETNEIGH
, NLM_F_REQUEST
);
2766 EXPORT_SYMBOL(neigh_app_ns
);
2767 #endif /* CONFIG_ARPD */
2769 #ifdef CONFIG_SYSCTL
2771 static int unres_qlen_max
= INT_MAX
/ SKB_TRUESIZE(ETH_FRAME_LEN
);
2773 static int proc_unres_qlen(ctl_table
*ctl
, int write
, void __user
*buffer
,
2774 size_t *lenp
, loff_t
*ppos
)
2777 ctl_table tmp
= *ctl
;
2780 tmp
.extra2
= &unres_qlen_max
;
2783 size
= *(int *)ctl
->data
/ SKB_TRUESIZE(ETH_FRAME_LEN
);
2784 ret
= proc_dointvec_minmax(&tmp
, write
, buffer
, lenp
, ppos
);
2787 *(int *)ctl
->data
= size
* SKB_TRUESIZE(ETH_FRAME_LEN
);
2792 NEIGH_VAR_MCAST_PROBE
,
2793 NEIGH_VAR_UCAST_PROBE
,
2794 NEIGH_VAR_APP_PROBE
,
2795 NEIGH_VAR_RETRANS_TIME
,
2796 NEIGH_VAR_BASE_REACHABLE_TIME
,
2797 NEIGH_VAR_DELAY_PROBE_TIME
,
2798 NEIGH_VAR_GC_STALETIME
,
2799 NEIGH_VAR_QUEUE_LEN
,
2800 NEIGH_VAR_QUEUE_LEN_BYTES
,
2801 NEIGH_VAR_PROXY_QLEN
,
2802 NEIGH_VAR_ANYCAST_DELAY
,
2803 NEIGH_VAR_PROXY_DELAY
,
2805 NEIGH_VAR_RETRANS_TIME_MS
,
2806 NEIGH_VAR_BASE_REACHABLE_TIME_MS
,
2807 NEIGH_VAR_GC_INTERVAL
,
2808 NEIGH_VAR_GC_THRESH1
,
2809 NEIGH_VAR_GC_THRESH2
,
2810 NEIGH_VAR_GC_THRESH3
,
2814 static struct neigh_sysctl_table
{
2815 struct ctl_table_header
*sysctl_header
;
2816 struct ctl_table neigh_vars
[NEIGH_VAR_MAX
+ 1];
2817 } neigh_sysctl_template __read_mostly
= {
2819 [NEIGH_VAR_MCAST_PROBE
] = {
2820 .procname
= "mcast_solicit",
2821 .maxlen
= sizeof(int),
2823 .proc_handler
= proc_dointvec
,
2825 [NEIGH_VAR_UCAST_PROBE
] = {
2826 .procname
= "ucast_solicit",
2827 .maxlen
= sizeof(int),
2829 .proc_handler
= proc_dointvec
,
2831 [NEIGH_VAR_APP_PROBE
] = {
2832 .procname
= "app_solicit",
2833 .maxlen
= sizeof(int),
2835 .proc_handler
= proc_dointvec
,
2837 [NEIGH_VAR_RETRANS_TIME
] = {
2838 .procname
= "retrans_time",
2839 .maxlen
= sizeof(int),
2841 .proc_handler
= proc_dointvec_userhz_jiffies
,
2843 [NEIGH_VAR_BASE_REACHABLE_TIME
] = {
2844 .procname
= "base_reachable_time",
2845 .maxlen
= sizeof(int),
2847 .proc_handler
= proc_dointvec_jiffies
,
2849 [NEIGH_VAR_DELAY_PROBE_TIME
] = {
2850 .procname
= "delay_first_probe_time",
2851 .maxlen
= sizeof(int),
2853 .proc_handler
= proc_dointvec_jiffies
,
2855 [NEIGH_VAR_GC_STALETIME
] = {
2856 .procname
= "gc_stale_time",
2857 .maxlen
= sizeof(int),
2859 .proc_handler
= proc_dointvec_jiffies
,
2861 [NEIGH_VAR_QUEUE_LEN
] = {
2862 .procname
= "unres_qlen",
2863 .maxlen
= sizeof(int),
2865 .proc_handler
= proc_unres_qlen
,
2867 [NEIGH_VAR_QUEUE_LEN_BYTES
] = {
2868 .procname
= "unres_qlen_bytes",
2869 .maxlen
= sizeof(int),
2872 .proc_handler
= proc_dointvec_minmax
,
2874 [NEIGH_VAR_PROXY_QLEN
] = {
2875 .procname
= "proxy_qlen",
2876 .maxlen
= sizeof(int),
2878 .proc_handler
= proc_dointvec
,
2880 [NEIGH_VAR_ANYCAST_DELAY
] = {
2881 .procname
= "anycast_delay",
2882 .maxlen
= sizeof(int),
2884 .proc_handler
= proc_dointvec_userhz_jiffies
,
2886 [NEIGH_VAR_PROXY_DELAY
] = {
2887 .procname
= "proxy_delay",
2888 .maxlen
= sizeof(int),
2890 .proc_handler
= proc_dointvec_userhz_jiffies
,
2892 [NEIGH_VAR_LOCKTIME
] = {
2893 .procname
= "locktime",
2894 .maxlen
= sizeof(int),
2896 .proc_handler
= proc_dointvec_userhz_jiffies
,
2898 [NEIGH_VAR_RETRANS_TIME_MS
] = {
2899 .procname
= "retrans_time_ms",
2900 .maxlen
= sizeof(int),
2902 .proc_handler
= proc_dointvec_ms_jiffies
,
2904 [NEIGH_VAR_BASE_REACHABLE_TIME_MS
] = {
2905 .procname
= "base_reachable_time_ms",
2906 .maxlen
= sizeof(int),
2908 .proc_handler
= proc_dointvec_ms_jiffies
,
2910 [NEIGH_VAR_GC_INTERVAL
] = {
2911 .procname
= "gc_interval",
2912 .maxlen
= sizeof(int),
2914 .proc_handler
= proc_dointvec_jiffies
,
2916 [NEIGH_VAR_GC_THRESH1
] = {
2917 .procname
= "gc_thresh1",
2918 .maxlen
= sizeof(int),
2920 .proc_handler
= proc_dointvec
,
2922 [NEIGH_VAR_GC_THRESH2
] = {
2923 .procname
= "gc_thresh2",
2924 .maxlen
= sizeof(int),
2926 .proc_handler
= proc_dointvec
,
2928 [NEIGH_VAR_GC_THRESH3
] = {
2929 .procname
= "gc_thresh3",
2930 .maxlen
= sizeof(int),
2932 .proc_handler
= proc_dointvec
,
2938 int neigh_sysctl_register(struct net_device
*dev
, struct neigh_parms
*p
,
2939 char *p_name
, proc_handler
*handler
)
2941 struct neigh_sysctl_table
*t
;
2942 const char *dev_name_source
= NULL
;
2943 char neigh_path
[ sizeof("net//neigh/") + IFNAMSIZ
+ IFNAMSIZ
];
2945 t
= kmemdup(&neigh_sysctl_template
, sizeof(*t
), GFP_KERNEL
);
2949 t
->neigh_vars
[NEIGH_VAR_MCAST_PROBE
].data
= &p
->mcast_probes
;
2950 t
->neigh_vars
[NEIGH_VAR_UCAST_PROBE
].data
= &p
->ucast_probes
;
2951 t
->neigh_vars
[NEIGH_VAR_APP_PROBE
].data
= &p
->app_probes
;
2952 t
->neigh_vars
[NEIGH_VAR_RETRANS_TIME
].data
= &p
->retrans_time
;
2953 t
->neigh_vars
[NEIGH_VAR_BASE_REACHABLE_TIME
].data
= &p
->base_reachable_time
;
2954 t
->neigh_vars
[NEIGH_VAR_DELAY_PROBE_TIME
].data
= &p
->delay_probe_time
;
2955 t
->neigh_vars
[NEIGH_VAR_GC_STALETIME
].data
= &p
->gc_staletime
;
2956 t
->neigh_vars
[NEIGH_VAR_QUEUE_LEN
].data
= &p
->queue_len_bytes
;
2957 t
->neigh_vars
[NEIGH_VAR_QUEUE_LEN_BYTES
].data
= &p
->queue_len_bytes
;
2958 t
->neigh_vars
[NEIGH_VAR_PROXY_QLEN
].data
= &p
->proxy_qlen
;
2959 t
->neigh_vars
[NEIGH_VAR_ANYCAST_DELAY
].data
= &p
->anycast_delay
;
2960 t
->neigh_vars
[NEIGH_VAR_PROXY_DELAY
].data
= &p
->proxy_delay
;
2961 t
->neigh_vars
[NEIGH_VAR_LOCKTIME
].data
= &p
->locktime
;
2962 t
->neigh_vars
[NEIGH_VAR_RETRANS_TIME_MS
].data
= &p
->retrans_time
;
2963 t
->neigh_vars
[NEIGH_VAR_BASE_REACHABLE_TIME_MS
].data
= &p
->base_reachable_time
;
2966 dev_name_source
= dev
->name
;
2967 /* Terminate the table early */
2968 memset(&t
->neigh_vars
[NEIGH_VAR_GC_INTERVAL
], 0,
2969 sizeof(t
->neigh_vars
[NEIGH_VAR_GC_INTERVAL
]));
2971 dev_name_source
= "default";
2972 t
->neigh_vars
[NEIGH_VAR_GC_INTERVAL
].data
= (int *)(p
+ 1);
2973 t
->neigh_vars
[NEIGH_VAR_GC_THRESH1
].data
= (int *)(p
+ 1) + 1;
2974 t
->neigh_vars
[NEIGH_VAR_GC_THRESH2
].data
= (int *)(p
+ 1) + 2;
2975 t
->neigh_vars
[NEIGH_VAR_GC_THRESH3
].data
= (int *)(p
+ 1) + 3;
2981 t
->neigh_vars
[NEIGH_VAR_RETRANS_TIME
].proc_handler
= handler
;
2982 t
->neigh_vars
[NEIGH_VAR_RETRANS_TIME
].extra1
= dev
;
2984 t
->neigh_vars
[NEIGH_VAR_BASE_REACHABLE_TIME
].proc_handler
= handler
;
2985 t
->neigh_vars
[NEIGH_VAR_BASE_REACHABLE_TIME
].extra1
= dev
;
2986 /* RetransTime (in milliseconds)*/
2987 t
->neigh_vars
[NEIGH_VAR_RETRANS_TIME_MS
].proc_handler
= handler
;
2988 t
->neigh_vars
[NEIGH_VAR_RETRANS_TIME_MS
].extra1
= dev
;
2989 /* ReachableTime (in milliseconds) */
2990 t
->neigh_vars
[NEIGH_VAR_BASE_REACHABLE_TIME_MS
].proc_handler
= handler
;
2991 t
->neigh_vars
[NEIGH_VAR_BASE_REACHABLE_TIME_MS
].extra1
= dev
;
2994 /* Don't export sysctls to unprivileged users */
2995 if (neigh_parms_net(p
)->user_ns
!= &init_user_ns
)
2996 t
->neigh_vars
[0].procname
= NULL
;
2998 snprintf(neigh_path
, sizeof(neigh_path
), "net/%s/neigh/%s",
2999 p_name
, dev_name_source
);
3001 register_net_sysctl(neigh_parms_net(p
), neigh_path
, t
->neigh_vars
);
3002 if (!t
->sysctl_header
)
3005 p
->sysctl_table
= t
;
3013 EXPORT_SYMBOL(neigh_sysctl_register
);
3015 void neigh_sysctl_unregister(struct neigh_parms
*p
)
3017 if (p
->sysctl_table
) {
3018 struct neigh_sysctl_table
*t
= p
->sysctl_table
;
3019 p
->sysctl_table
= NULL
;
3020 unregister_net_sysctl_table(t
->sysctl_header
);
3024 EXPORT_SYMBOL(neigh_sysctl_unregister
);
3026 #endif /* CONFIG_SYSCTL */
3028 static int __init
neigh_init(void)
3030 rtnl_register(PF_UNSPEC
, RTM_NEWNEIGH
, neigh_add
, NULL
, NULL
);
3031 rtnl_register(PF_UNSPEC
, RTM_DELNEIGH
, neigh_delete
, NULL
, NULL
);
3032 rtnl_register(PF_UNSPEC
, RTM_GETNEIGH
, NULL
, neigh_dump_info
, NULL
);
3034 rtnl_register(PF_UNSPEC
, RTM_GETNEIGHTBL
, NULL
, neightbl_dump_info
,
3036 rtnl_register(PF_UNSPEC
, RTM_SETNEIGHTBL
, neightbl_set
, NULL
, NULL
);
3041 subsys_initcall(neigh_init
);