1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _NET_NEIGHBOUR_H
3 #define _NET_NEIGHBOUR_H
4
5 #include <linux/neighbour.h>
6
7 /*
8 * Generic neighbour manipulation
9 *
10 * Authors:
11 * Pedro Roque <roque@di.fc.ul.pt>
12 * Alexey Kuznetsov <kuznet@ms2.inr.ac.ru>
13 *
14 * Changes:
15 *
16 * Harald Welte: <laforge@gnumonks.org>
17 * - Add neighbour cache statistics like rtstat
18 */
19
20 #include <linux/atomic.h>
21 #include <linux/refcount.h>
22 #include <linux/netdevice.h>
23 #include <linux/skbuff.h>
24 #include <linux/rcupdate.h>
25 #include <linux/seq_file.h>
26 #include <linux/bitmap.h>
27
28 #include <linux/err.h>
29 #include <linux/sysctl.h>
30 #include <linux/workqueue.h>
31 #include <linux/android_kabi.h>
32 #include <net/rtnetlink.h>
33
34 /*
35 * NUD stands for "neighbor unreachability detection"
36 */
37
38 #define NUD_IN_TIMER (NUD_INCOMPLETE|NUD_REACHABLE|NUD_DELAY|NUD_PROBE)
39 #define NUD_VALID (NUD_PERMANENT|NUD_NOARP|NUD_REACHABLE|NUD_PROBE|NUD_STALE|NUD_DELAY)
40 #define NUD_CONNECTED (NUD_PERMANENT|NUD_NOARP|NUD_REACHABLE)
41
42 struct neighbour;
43
44 enum {
45 NEIGH_VAR_MCAST_PROBES,
46 NEIGH_VAR_UCAST_PROBES,
47 NEIGH_VAR_APP_PROBES,
48 NEIGH_VAR_MCAST_REPROBES,
49 NEIGH_VAR_RETRANS_TIME,
50 NEIGH_VAR_BASE_REACHABLE_TIME,
51 NEIGH_VAR_DELAY_PROBE_TIME,
52 NEIGH_VAR_GC_STALETIME,
53 NEIGH_VAR_QUEUE_LEN_BYTES,
54 NEIGH_VAR_PROXY_QLEN,
55 NEIGH_VAR_ANYCAST_DELAY,
56 NEIGH_VAR_PROXY_DELAY,
57 NEIGH_VAR_LOCKTIME,
58 #define NEIGH_VAR_DATA_MAX (NEIGH_VAR_LOCKTIME + 1)
59 /* Following are used as a second way to access one of the above */
60 NEIGH_VAR_QUEUE_LEN, /* same data as NEIGH_VAR_QUEUE_LEN_BYTES */
61 NEIGH_VAR_RETRANS_TIME_MS, /* same data as NEIGH_VAR_RETRANS_TIME */
62 NEIGH_VAR_BASE_REACHABLE_TIME_MS, /* same data as NEIGH_VAR_BASE_REACHABLE_TIME */
63 /* Following are used by "default" only */
64 NEIGH_VAR_GC_INTERVAL,
65 NEIGH_VAR_GC_THRESH1,
66 NEIGH_VAR_GC_THRESH2,
67 NEIGH_VAR_GC_THRESH3,
68 NEIGH_VAR_MAX
69 };
70
71 struct neigh_parms {
72 possible_net_t net;
73 struct net_device *dev;
74 struct list_head list;
75 int (*neigh_setup)(struct neighbour *);
76 struct neigh_table *tbl;
77
78 void *sysctl_table;
79
80 int dead;
81 refcount_t refcnt;
82 struct rcu_head rcu_head;
83
84 int reachable_time;
85 int data[NEIGH_VAR_DATA_MAX];
86 DECLARE_BITMAP(data_state, NEIGH_VAR_DATA_MAX);
87
88 ANDROID_KABI_RESERVE(1);
89 };
90
neigh_var_set(struct neigh_parms * p,int index,int val)91 static inline void neigh_var_set(struct neigh_parms *p, int index, int val)
92 {
93 set_bit(index, p->data_state);
94 p->data[index] = val;
95 }
96
97 #define NEIGH_VAR(p, attr) ((p)->data[NEIGH_VAR_ ## attr])
98
99 /* In ndo_neigh_setup, NEIGH_VAR_INIT should be used.
100 * In other cases, NEIGH_VAR_SET should be used.
101 */
102 #define NEIGH_VAR_INIT(p, attr, val) (NEIGH_VAR(p, attr) = val)
103 #define NEIGH_VAR_SET(p, attr, val) neigh_var_set(p, NEIGH_VAR_ ## attr, val)
104
neigh_parms_data_state_setall(struct neigh_parms * p)105 static inline void neigh_parms_data_state_setall(struct neigh_parms *p)
106 {
107 bitmap_fill(p->data_state, NEIGH_VAR_DATA_MAX);
108 }
109
neigh_parms_data_state_cleanall(struct neigh_parms * p)110 static inline void neigh_parms_data_state_cleanall(struct neigh_parms *p)
111 {
112 bitmap_zero(p->data_state, NEIGH_VAR_DATA_MAX);
113 }
114
115 struct neigh_statistics {
116 unsigned long allocs; /* number of allocated neighs */
117 unsigned long destroys; /* number of destroyed neighs */
118 unsigned long hash_grows; /* number of hash resizes */
119
120 unsigned long res_failed; /* number of failed resolutions */
121
122 unsigned long lookups; /* number of lookups */
123 unsigned long hits; /* number of hits (among lookups) */
124
125 unsigned long rcv_probes_mcast; /* number of received mcast ipv6 */
126 unsigned long rcv_probes_ucast; /* number of received ucast ipv6 */
127
128 unsigned long periodic_gc_runs; /* number of periodic GC runs */
129 unsigned long forced_gc_runs; /* number of forced GC runs */
130
131 unsigned long unres_discards; /* number of unresolved drops */
132 unsigned long table_fulls; /* times even gc couldn't help */
133 };
134
135 #define NEIGH_CACHE_STAT_INC(tbl, field) this_cpu_inc((tbl)->stats->field)
136
137 struct neighbour {
138 struct neighbour __rcu *next;
139 struct neigh_table *tbl;
140 struct neigh_parms *parms;
141 unsigned long confirmed;
142 unsigned long updated;
143 rwlock_t lock;
144 refcount_t refcnt;
145 unsigned int arp_queue_len_bytes;
146 struct sk_buff_head arp_queue;
147 struct timer_list timer;
148 unsigned long used;
149 atomic_t probes;
150 __u8 flags;
151 __u8 nud_state;
152 __u8 type;
153 __u8 dead;
154 u8 protocol;
155 seqlock_t ha_lock;
156 unsigned char ha[ALIGN(MAX_ADDR_LEN, sizeof(unsigned long))] __aligned(8);
157 struct hh_cache hh;
158 int (*output)(struct neighbour *, struct sk_buff *);
159 const struct neigh_ops *ops;
160 struct list_head gc_list;
161 struct rcu_head rcu;
162 struct net_device *dev;
163
164 ANDROID_KABI_RESERVE(1);
165
166 u8 primary_key[0];
167 } __randomize_layout;
168
169 struct neigh_ops {
170 int family;
171 void (*solicit)(struct neighbour *, struct sk_buff *);
172 void (*error_report)(struct neighbour *, struct sk_buff *);
173 int (*output)(struct neighbour *, struct sk_buff *);
174 int (*connected_output)(struct neighbour *, struct sk_buff *);
175 };
176
177 struct pneigh_entry {
178 struct pneigh_entry *next;
179 possible_net_t net;
180 struct net_device *dev;
181 u8 flags;
182 u8 protocol;
183 u8 key[];
184 };
185
186 /*
187 * neighbour table manipulation
188 */
189
190 #define NEIGH_NUM_HASH_RND 4
191
192 struct neigh_hash_table {
193 struct neighbour __rcu **hash_buckets;
194 unsigned int hash_shift;
195 __u32 hash_rnd[NEIGH_NUM_HASH_RND];
196 struct rcu_head rcu;
197 };
198
199
200 struct neigh_table {
201 int family;
202 unsigned int entry_size;
203 unsigned int key_len;
204 __be16 protocol;
205 __u32 (*hash)(const void *pkey,
206 const struct net_device *dev,
207 __u32 *hash_rnd);
208 bool (*key_eq)(const struct neighbour *, const void *pkey);
209 int (*constructor)(struct neighbour *);
210 int (*pconstructor)(struct pneigh_entry *);
211 void (*pdestructor)(struct pneigh_entry *);
212 void (*proxy_redo)(struct sk_buff *skb);
213 int (*is_multicast)(const void *pkey);
214 bool (*allow_add)(const struct net_device *dev,
215 struct netlink_ext_ack *extack);
216 char *id;
217 struct neigh_parms parms;
218 struct list_head parms_list;
219 int gc_interval;
220 int gc_thresh1;
221 int gc_thresh2;
222 int gc_thresh3;
223 unsigned long last_flush;
224 struct delayed_work gc_work;
225 struct timer_list proxy_timer;
226 struct sk_buff_head proxy_queue;
227 atomic_t entries;
228 atomic_t gc_entries;
229 struct list_head gc_list;
230 rwlock_t lock;
231 unsigned long last_rand;
232 struct neigh_statistics __percpu *stats;
233 struct neigh_hash_table __rcu *nht;
234 struct pneigh_entry **phash_buckets;
235
236 ANDROID_KABI_RESERVE(1);
237 };
238
239 enum {
240 NEIGH_ARP_TABLE = 0,
241 NEIGH_ND_TABLE = 1,
242 NEIGH_DN_TABLE = 2,
243 NEIGH_NR_TABLES,
244 NEIGH_LINK_TABLE = NEIGH_NR_TABLES /* Pseudo table for neigh_xmit */
245 };
246
neigh_parms_family(struct neigh_parms * p)247 static inline int neigh_parms_family(struct neigh_parms *p)
248 {
249 return p->tbl->family;
250 }
251
252 #define NEIGH_PRIV_ALIGN sizeof(long long)
253 #define NEIGH_ENTRY_SIZE(size) ALIGN((size), NEIGH_PRIV_ALIGN)
254
neighbour_priv(const struct neighbour * n)255 static inline void *neighbour_priv(const struct neighbour *n)
256 {
257 return (char *)n + n->tbl->entry_size;
258 }
259
260 /* flags for neigh_update() */
261 #define NEIGH_UPDATE_F_OVERRIDE 0x00000001
262 #define NEIGH_UPDATE_F_WEAK_OVERRIDE 0x00000002
263 #define NEIGH_UPDATE_F_OVERRIDE_ISROUTER 0x00000004
264 #define NEIGH_UPDATE_F_USE 0x10000000
265 #define NEIGH_UPDATE_F_EXT_LEARNED 0x20000000
266 #define NEIGH_UPDATE_F_ISROUTER 0x40000000
267 #define NEIGH_UPDATE_F_ADMIN 0x80000000
268
269 extern const struct nla_policy nda_policy[];
270
neigh_key_eq16(const struct neighbour * n,const void * pkey)271 static inline bool neigh_key_eq16(const struct neighbour *n, const void *pkey)
272 {
273 return *(const u16 *)n->primary_key == *(const u16 *)pkey;
274 }
275
neigh_key_eq32(const struct neighbour * n,const void * pkey)276 static inline bool neigh_key_eq32(const struct neighbour *n, const void *pkey)
277 {
278 return *(const u32 *)n->primary_key == *(const u32 *)pkey;
279 }
280
neigh_key_eq128(const struct neighbour * n,const void * pkey)281 static inline bool neigh_key_eq128(const struct neighbour *n, const void *pkey)
282 {
283 const u32 *n32 = (const u32 *)n->primary_key;
284 const u32 *p32 = pkey;
285
286 return ((n32[0] ^ p32[0]) | (n32[1] ^ p32[1]) |
287 (n32[2] ^ p32[2]) | (n32[3] ^ p32[3])) == 0;
288 }
289
___neigh_lookup_noref(struct neigh_table * tbl,bool (* key_eq)(const struct neighbour * n,const void * pkey),__u32 (* hash)(const void * pkey,const struct net_device * dev,__u32 * hash_rnd),const void * pkey,struct net_device * dev)290 static inline struct neighbour *___neigh_lookup_noref(
291 struct neigh_table *tbl,
292 bool (*key_eq)(const struct neighbour *n, const void *pkey),
293 __u32 (*hash)(const void *pkey,
294 const struct net_device *dev,
295 __u32 *hash_rnd),
296 const void *pkey,
297 struct net_device *dev)
298 {
299 struct neigh_hash_table *nht = rcu_dereference_bh(tbl->nht);
300 struct neighbour *n;
301 u32 hash_val;
302
303 hash_val = hash(pkey, dev, nht->hash_rnd) >> (32 - nht->hash_shift);
304 for (n = rcu_dereference_bh(nht->hash_buckets[hash_val]);
305 n != NULL;
306 n = rcu_dereference_bh(n->next)) {
307 if (n->dev == dev && key_eq(n, pkey))
308 return n;
309 }
310
311 return NULL;
312 }
313
__neigh_lookup_noref(struct neigh_table * tbl,const void * pkey,struct net_device * dev)314 static inline struct neighbour *__neigh_lookup_noref(struct neigh_table *tbl,
315 const void *pkey,
316 struct net_device *dev)
317 {
318 return ___neigh_lookup_noref(tbl, tbl->key_eq, tbl->hash, pkey, dev);
319 }
320
321 void neigh_table_init(int index, struct neigh_table *tbl);
322 int neigh_table_clear(int index, struct neigh_table *tbl);
323 struct neighbour *neigh_lookup(struct neigh_table *tbl, const void *pkey,
324 struct net_device *dev);
325 struct neighbour *neigh_lookup_nodev(struct neigh_table *tbl, struct net *net,
326 const void *pkey);
327 struct neighbour *__neigh_create(struct neigh_table *tbl, const void *pkey,
328 struct net_device *dev, bool want_ref);
neigh_create(struct neigh_table * tbl,const void * pkey,struct net_device * dev)329 static inline struct neighbour *neigh_create(struct neigh_table *tbl,
330 const void *pkey,
331 struct net_device *dev)
332 {
333 return __neigh_create(tbl, pkey, dev, true);
334 }
335 void neigh_destroy(struct neighbour *neigh);
336 int __neigh_event_send(struct neighbour *neigh, struct sk_buff *skb);
337 int neigh_update(struct neighbour *neigh, const u8 *lladdr, u8 new, u32 flags,
338 u32 nlmsg_pid);
339 void __neigh_set_probe_once(struct neighbour *neigh);
340 bool neigh_remove_one(struct neighbour *ndel, struct neigh_table *tbl);
341 void neigh_changeaddr(struct neigh_table *tbl, struct net_device *dev);
342 int neigh_ifdown(struct neigh_table *tbl, struct net_device *dev);
343 int neigh_carrier_down(struct neigh_table *tbl, struct net_device *dev);
344 int neigh_resolve_output(struct neighbour *neigh, struct sk_buff *skb);
345 int neigh_connected_output(struct neighbour *neigh, struct sk_buff *skb);
346 int neigh_direct_output(struct neighbour *neigh, struct sk_buff *skb);
347 struct neighbour *neigh_event_ns(struct neigh_table *tbl,
348 u8 *lladdr, void *saddr,
349 struct net_device *dev);
350
351 struct neigh_parms *neigh_parms_alloc(struct net_device *dev,
352 struct neigh_table *tbl);
353 void neigh_parms_release(struct neigh_table *tbl, struct neigh_parms *parms);
354
355 static inline
neigh_parms_net(const struct neigh_parms * parms)356 struct net *neigh_parms_net(const struct neigh_parms *parms)
357 {
358 return read_pnet(&parms->net);
359 }
360
361 unsigned long neigh_rand_reach_time(unsigned long base);
362
363 void pneigh_enqueue(struct neigh_table *tbl, struct neigh_parms *p,
364 struct sk_buff *skb);
365 struct pneigh_entry *pneigh_lookup(struct neigh_table *tbl, struct net *net,
366 const void *key, struct net_device *dev,
367 int creat);
368 struct pneigh_entry *__pneigh_lookup(struct neigh_table *tbl, struct net *net,
369 const void *key, struct net_device *dev);
370 int pneigh_delete(struct neigh_table *tbl, struct net *net, const void *key,
371 struct net_device *dev);
372
pneigh_net(const struct pneigh_entry * pneigh)373 static inline struct net *pneigh_net(const struct pneigh_entry *pneigh)
374 {
375 return read_pnet(&pneigh->net);
376 }
377
378 void neigh_app_ns(struct neighbour *n);
379 void neigh_for_each(struct neigh_table *tbl,
380 void (*cb)(struct neighbour *, void *), void *cookie);
381 void __neigh_for_each_release(struct neigh_table *tbl,
382 int (*cb)(struct neighbour *));
383 int neigh_xmit(int fam, struct net_device *, const void *, struct sk_buff *);
384 void pneigh_for_each(struct neigh_table *tbl,
385 void (*cb)(struct pneigh_entry *));
386
387 struct neigh_seq_state {
388 struct seq_net_private p;
389 struct neigh_table *tbl;
390 struct neigh_hash_table *nht;
391 void *(*neigh_sub_iter)(struct neigh_seq_state *state,
392 struct neighbour *n, loff_t *pos);
393 unsigned int bucket;
394 unsigned int flags;
395 #define NEIGH_SEQ_NEIGH_ONLY 0x00000001
396 #define NEIGH_SEQ_IS_PNEIGH 0x00000002
397 #define NEIGH_SEQ_SKIP_NOARP 0x00000004
398 };
399 void *neigh_seq_start(struct seq_file *, loff_t *, struct neigh_table *,
400 unsigned int);
401 void *neigh_seq_next(struct seq_file *, void *, loff_t *);
402 void neigh_seq_stop(struct seq_file *, void *);
403
404 int neigh_proc_dointvec(struct ctl_table *ctl, int write,
405 void *buffer, size_t *lenp, loff_t *ppos);
406 int neigh_proc_dointvec_jiffies(struct ctl_table *ctl, int write,
407 void *buffer,
408 size_t *lenp, loff_t *ppos);
409 int neigh_proc_dointvec_ms_jiffies(struct ctl_table *ctl, int write,
410 void *buffer, size_t *lenp, loff_t *ppos);
411
412 int neigh_sysctl_register(struct net_device *dev, struct neigh_parms *p,
413 proc_handler *proc_handler);
414 void neigh_sysctl_unregister(struct neigh_parms *p);
415
__neigh_parms_put(struct neigh_parms * parms)416 static inline void __neigh_parms_put(struct neigh_parms *parms)
417 {
418 refcount_dec(&parms->refcnt);
419 }
420
neigh_parms_clone(struct neigh_parms * parms)421 static inline struct neigh_parms *neigh_parms_clone(struct neigh_parms *parms)
422 {
423 refcount_inc(&parms->refcnt);
424 return parms;
425 }
426
427 /*
428 * Neighbour references
429 */
430
neigh_release(struct neighbour * neigh)431 static inline void neigh_release(struct neighbour *neigh)
432 {
433 if (refcount_dec_and_test(&neigh->refcnt))
434 neigh_destroy(neigh);
435 }
436
neigh_clone(struct neighbour * neigh)437 static inline struct neighbour * neigh_clone(struct neighbour *neigh)
438 {
439 if (neigh)
440 refcount_inc(&neigh->refcnt);
441 return neigh;
442 }
443
444 #define neigh_hold(n) refcount_inc(&(n)->refcnt)
445
neigh_event_send(struct neighbour * neigh,struct sk_buff * skb)446 static inline int neigh_event_send(struct neighbour *neigh, struct sk_buff *skb)
447 {
448 unsigned long now = jiffies;
449
450 if (READ_ONCE(neigh->used) != now)
451 WRITE_ONCE(neigh->used, now);
452 if (!(neigh->nud_state&(NUD_CONNECTED|NUD_DELAY|NUD_PROBE)))
453 return __neigh_event_send(neigh, skb);
454 return 0;
455 }
456
457 #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER)
neigh_hh_bridge(struct hh_cache * hh,struct sk_buff * skb)458 static inline int neigh_hh_bridge(struct hh_cache *hh, struct sk_buff *skb)
459 {
460 unsigned int seq, hh_alen;
461
462 do {
463 seq = read_seqbegin(&hh->hh_lock);
464 hh_alen = HH_DATA_ALIGN(ETH_HLEN);
465 memcpy(skb->data - hh_alen, hh->hh_data, ETH_ALEN + hh_alen - ETH_HLEN);
466 } while (read_seqretry(&hh->hh_lock, seq));
467 return 0;
468 }
469 #endif
470
neigh_hh_output(const struct hh_cache * hh,struct sk_buff * skb)471 static inline int neigh_hh_output(const struct hh_cache *hh, struct sk_buff *skb)
472 {
473 unsigned int hh_alen = 0;
474 unsigned int seq;
475 unsigned int hh_len;
476
477 do {
478 seq = read_seqbegin(&hh->hh_lock);
479 hh_len = READ_ONCE(hh->hh_len);
480 if (likely(hh_len <= HH_DATA_MOD)) {
481 hh_alen = HH_DATA_MOD;
482
483 /* skb_push() would proceed silently if we have room for
484 * the unaligned size but not for the aligned size:
485 * check headroom explicitly.
486 */
487 if (likely(skb_headroom(skb) >= HH_DATA_MOD)) {
488 /* this is inlined by gcc */
489 memcpy(skb->data - HH_DATA_MOD, hh->hh_data,
490 HH_DATA_MOD);
491 }
492 } else {
493 hh_alen = HH_DATA_ALIGN(hh_len);
494
495 if (likely(skb_headroom(skb) >= hh_alen)) {
496 memcpy(skb->data - hh_alen, hh->hh_data,
497 hh_alen);
498 }
499 }
500 } while (read_seqretry(&hh->hh_lock, seq));
501
502 if (WARN_ON_ONCE(skb_headroom(skb) < hh_alen)) {
503 kfree_skb(skb);
504 return NET_XMIT_DROP;
505 }
506
507 __skb_push(skb, hh_len);
508 return dev_queue_xmit(skb);
509 }
510
neigh_output(struct neighbour * n,struct sk_buff * skb,bool skip_cache)511 static inline int neigh_output(struct neighbour *n, struct sk_buff *skb,
512 bool skip_cache)
513 {
514 const struct hh_cache *hh = &n->hh;
515
516 /* n->nud_state and hh->hh_len could be changed under us.
517 * neigh_hh_output() is taking care of the race later.
518 */
519 if (!skip_cache &&
520 (READ_ONCE(n->nud_state) & NUD_CONNECTED) &&
521 READ_ONCE(hh->hh_len))
522 return neigh_hh_output(hh, skb);
523
524 return n->output(n, skb);
525 }
526
527 static inline struct neighbour *
__neigh_lookup(struct neigh_table * tbl,const void * pkey,struct net_device * dev,int creat)528 __neigh_lookup(struct neigh_table *tbl, const void *pkey, struct net_device *dev, int creat)
529 {
530 struct neighbour *n = neigh_lookup(tbl, pkey, dev);
531
532 if (n || !creat)
533 return n;
534
535 n = neigh_create(tbl, pkey, dev);
536 return IS_ERR(n) ? NULL : n;
537 }
538
539 static inline struct neighbour *
__neigh_lookup_errno(struct neigh_table * tbl,const void * pkey,struct net_device * dev)540 __neigh_lookup_errno(struct neigh_table *tbl, const void *pkey,
541 struct net_device *dev)
542 {
543 struct neighbour *n = neigh_lookup(tbl, pkey, dev);
544
545 if (n)
546 return n;
547
548 return neigh_create(tbl, pkey, dev);
549 }
550
551 struct neighbour_cb {
552 unsigned long sched_next;
553 unsigned int flags;
554 };
555
556 #define LOCALLY_ENQUEUED 0x1
557
558 #define NEIGH_CB(skb) ((struct neighbour_cb *)(skb)->cb)
559
neigh_ha_snapshot(char * dst,const struct neighbour * n,const struct net_device * dev)560 static inline void neigh_ha_snapshot(char *dst, const struct neighbour *n,
561 const struct net_device *dev)
562 {
563 unsigned int seq;
564
565 do {
566 seq = read_seqbegin(&n->ha_lock);
567 memcpy(dst, n->ha, dev->addr_len);
568 } while (read_seqretry(&n->ha_lock, seq));
569 }
570
neigh_update_is_router(struct neighbour * neigh,u32 flags,int * notify)571 static inline void neigh_update_is_router(struct neighbour *neigh, u32 flags,
572 int *notify)
573 {
574 u8 ndm_flags = 0;
575
576 ndm_flags |= (flags & NEIGH_UPDATE_F_ISROUTER) ? NTF_ROUTER : 0;
577 if ((neigh->flags ^ ndm_flags) & NTF_ROUTER) {
578 if (ndm_flags & NTF_ROUTER)
579 neigh->flags |= NTF_ROUTER;
580 else
581 neigh->flags &= ~NTF_ROUTER;
582 *notify = 1;
583 }
584 }
585 #endif
586