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