blob: f28403ff7648e286c85d131d1a848f01f1d35489 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001#ifndef _NET_NEIGHBOUR_H
2#define _NET_NEIGHBOUR_H
3
Thomas Graf9067c722006-08-07 17:57:44 -07004#include <linux/neighbour.h>
5
Linus Torvalds1da177e2005-04-16 15:20:36 -07006/*
7 * Generic neighbour manipulation
8 *
9 * Authors:
10 * Pedro Roque <roque@di.fc.ul.pt>
11 * Alexey Kuznetsov <kuznet@ms2.inr.ac.ru>
12 *
13 * Changes:
14 *
15 * Harald Welte: <laforge@gnumonks.org>
16 * - Add neighbour cache statistics like rtstat
17 */
18
Linus Torvalds1da177e2005-04-16 15:20:36 -070019#include <asm/atomic.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070020#include <linux/netdevice.h>
Arnaldo Carvalho de Melo14c85022005-12-27 02:43:12 -020021#include <linux/skbuff.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070022#include <linux/rcupdate.h>
23#include <linux/seq_file.h>
24
25#include <linux/err.h>
26#include <linux/sysctl.h>
Eric Dumazete4c4e442009-07-30 03:15:07 +000027#include <linux/workqueue.h>
Thomas Grafc8822a42007-03-22 11:50:06 -070028#include <net/rtnetlink.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070029
Pavel Emelyanov39971552008-01-10 22:37:16 -080030/*
31 * NUD stands for "neighbor unreachability detection"
32 */
33
Linus Torvalds1da177e2005-04-16 15:20:36 -070034#define NUD_IN_TIMER (NUD_INCOMPLETE|NUD_REACHABLE|NUD_DELAY|NUD_PROBE)
35#define NUD_VALID (NUD_PERMANENT|NUD_NOARP|NUD_REACHABLE|NUD_PROBE|NUD_STALE|NUD_DELAY)
36#define NUD_CONNECTED (NUD_PERMANENT|NUD_NOARP|NUD_REACHABLE)
37
38struct neighbour;
39
40struct neigh_parms
41{
YOSHIFUJI Hideaki57da52c2008-03-26 03:49:59 +090042#ifdef CONFIG_NET_NS
Eric W. Biederman426b5302008-01-24 00:13:18 -080043 struct net *net;
YOSHIFUJI Hideaki57da52c2008-03-26 03:49:59 +090044#endif
Thomas Grafc7fb64d2005-06-18 22:50:55 -070045 struct net_device *dev;
Linus Torvalds1da177e2005-04-16 15:20:36 -070046 struct neigh_parms *next;
47 int (*neigh_setup)(struct neighbour *);
Alexey Kuznetsovecbb4162007-03-24 12:52:16 -070048 void (*neigh_cleanup)(struct neighbour *);
Linus Torvalds1da177e2005-04-16 15:20:36 -070049 struct neigh_table *tbl;
Linus Torvalds1da177e2005-04-16 15:20:36 -070050
51 void *sysctl_table;
52
53 int dead;
54 atomic_t refcnt;
55 struct rcu_head rcu_head;
56
57 int base_reachable_time;
58 int retrans_time;
59 int gc_staletime;
60 int reachable_time;
61 int delay_probe_time;
62
63 int queue_len;
64 int ucast_probes;
65 int app_probes;
66 int mcast_probes;
67 int anycast_delay;
68 int proxy_delay;
69 int proxy_qlen;
70 int locktime;
71};
72
73struct neigh_statistics
74{
75 unsigned long allocs; /* number of allocated neighs */
76 unsigned long destroys; /* number of destroyed neighs */
77 unsigned long hash_grows; /* number of hash resizes */
78
Neil Horman9a6d2762008-07-16 20:50:49 -070079 unsigned long res_failed; /* number of failed resolutions */
Linus Torvalds1da177e2005-04-16 15:20:36 -070080
81 unsigned long lookups; /* number of lookups */
82 unsigned long hits; /* number of hits (among lookups) */
83
84 unsigned long rcv_probes_mcast; /* number of received mcast ipv6 */
85 unsigned long rcv_probes_ucast; /* number of received ucast ipv6 */
86
87 unsigned long periodic_gc_runs; /* number of periodic GC runs */
88 unsigned long forced_gc_runs; /* number of forced GC runs */
Neil Horman9a6d2762008-07-16 20:50:49 -070089
90 unsigned long unres_discards; /* number of unresolved drops */
Linus Torvalds1da177e2005-04-16 15:20:36 -070091};
92
Christoph Lameter4ea73342009-10-03 19:48:22 +090093#define NEIGH_CACHE_STAT_INC(tbl, field) this_cpu_inc((tbl)->stats->field)
Linus Torvalds1da177e2005-04-16 15:20:36 -070094
95struct neighbour
96{
97 struct neighbour *next;
98 struct neigh_table *tbl;
99 struct neigh_parms *parms;
100 struct net_device *dev;
101 unsigned long used;
102 unsigned long confirmed;
103 unsigned long updated;
104 __u8 flags;
105 __u8 nud_state;
106 __u8 type;
107 __u8 dead;
108 atomic_t probes;
109 rwlock_t lock;
Stephen Hemmingerd9244242006-08-10 23:03:23 -0700110 unsigned char ha[ALIGN(MAX_ADDR_LEN, sizeof(unsigned long))];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700111 struct hh_cache *hh;
112 atomic_t refcnt;
113 int (*output)(struct sk_buff *skb);
114 struct sk_buff_head arp_queue;
115 struct timer_list timer;
Stephen Hemminger89d69d22009-09-01 11:13:19 +0000116 const struct neigh_ops *ops;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117 u8 primary_key[0];
118};
119
120struct neigh_ops
121{
122 int family;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700123 void (*solicit)(struct neighbour *, struct sk_buff*);
124 void (*error_report)(struct neighbour *, struct sk_buff*);
125 int (*output)(struct sk_buff*);
126 int (*connected_output)(struct sk_buff*);
127 int (*hh_output)(struct sk_buff*);
128 int (*queue_xmit)(struct sk_buff*);
129};
130
131struct pneigh_entry
132{
133 struct pneigh_entry *next;
YOSHIFUJI Hideaki57da52c2008-03-26 03:49:59 +0900134#ifdef CONFIG_NET_NS
Eric W. Biederman426b5302008-01-24 00:13:18 -0800135 struct net *net;
YOSHIFUJI Hideaki57da52c2008-03-26 03:49:59 +0900136#endif
Eric W. Biederman426b5302008-01-24 00:13:18 -0800137 struct net_device *dev;
Ville Nuorvala62dd9312006-09-22 14:43:19 -0700138 u8 flags;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700139 u8 key[0];
140};
141
142/*
143 * neighbour table manipulation
144 */
145
146
147struct neigh_table
148{
149 struct neigh_table *next;
150 int family;
151 int entry_size;
152 int key_len;
153 __u32 (*hash)(const void *pkey, const struct net_device *);
154 int (*constructor)(struct neighbour *);
155 int (*pconstructor)(struct pneigh_entry *);
156 void (*pdestructor)(struct pneigh_entry *);
157 void (*proxy_redo)(struct sk_buff *skb);
158 char *id;
159 struct neigh_parms parms;
160 /* HACK. gc_* shoul follow parms without a gap! */
161 int gc_interval;
162 int gc_thresh1;
163 int gc_thresh2;
164 int gc_thresh3;
165 unsigned long last_flush;
Eric Dumazete4c4e442009-07-30 03:15:07 +0000166 struct delayed_work gc_work;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700167 struct timer_list proxy_timer;
168 struct sk_buff_head proxy_queue;
169 atomic_t entries;
170 rwlock_t lock;
171 unsigned long last_rand;
Christoph Lametere18b8902006-12-06 20:33:20 -0800172 struct kmem_cache *kmem_cachep;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700173 struct neigh_statistics *stats;
174 struct neighbour **hash_buckets;
175 unsigned int hash_mask;
176 __u32 hash_rnd;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700177 struct pneigh_entry **phash_buckets;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700178};
179
180/* flags for neigh_update() */
181#define NEIGH_UPDATE_F_OVERRIDE 0x00000001
182#define NEIGH_UPDATE_F_WEAK_OVERRIDE 0x00000002
183#define NEIGH_UPDATE_F_OVERRIDE_ISROUTER 0x00000004
184#define NEIGH_UPDATE_F_ISROUTER 0x40000000
185#define NEIGH_UPDATE_F_ADMIN 0x80000000
186
187extern void neigh_table_init(struct neigh_table *tbl);
Simon Kelleybd89efc2006-05-12 14:56:08 -0700188extern void neigh_table_init_no_netlink(struct neigh_table *tbl);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700189extern int neigh_table_clear(struct neigh_table *tbl);
190extern struct neighbour * neigh_lookup(struct neigh_table *tbl,
191 const void *pkey,
192 struct net_device *dev);
193extern struct neighbour * neigh_lookup_nodev(struct neigh_table *tbl,
Eric W. Biederman426b5302008-01-24 00:13:18 -0800194 struct net *net,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700195 const void *pkey);
196extern struct neighbour * neigh_create(struct neigh_table *tbl,
197 const void *pkey,
198 struct net_device *dev);
199extern void neigh_destroy(struct neighbour *neigh);
200extern int __neigh_event_send(struct neighbour *neigh, struct sk_buff *skb);
201extern int neigh_update(struct neighbour *neigh, const u8 *lladdr, u8 new,
202 u32 flags);
203extern void neigh_changeaddr(struct neigh_table *tbl, struct net_device *dev);
204extern int neigh_ifdown(struct neigh_table *tbl, struct net_device *dev);
205extern int neigh_resolve_output(struct sk_buff *skb);
206extern int neigh_connected_output(struct sk_buff *skb);
207extern int neigh_compat_output(struct sk_buff *skb);
208extern struct neighbour *neigh_event_ns(struct neigh_table *tbl,
209 u8 *lladdr, void *saddr,
210 struct net_device *dev);
211
212extern struct neigh_parms *neigh_parms_alloc(struct net_device *dev, struct neigh_table *tbl);
213extern void neigh_parms_release(struct neigh_table *tbl, struct neigh_parms *parms);
YOSHIFUJI Hideaki57da52c2008-03-26 03:49:59 +0900214
215static inline
216struct net *neigh_parms_net(const struct neigh_parms *parms)
217{
Eric Dumazete42ea982008-11-12 00:54:54 -0800218 return read_pnet(&parms->net);
YOSHIFUJI Hideaki57da52c2008-03-26 03:49:59 +0900219}
220
Linus Torvalds1da177e2005-04-16 15:20:36 -0700221extern unsigned long neigh_rand_reach_time(unsigned long base);
222
223extern void pneigh_enqueue(struct neigh_table *tbl, struct neigh_parms *p,
224 struct sk_buff *skb);
Eric W. Biederman426b5302008-01-24 00:13:18 -0800225extern struct pneigh_entry *pneigh_lookup(struct neigh_table *tbl, struct net *net, const void *key, struct net_device *dev, int creat);
Pavel Emelyanovfa86d322008-03-24 14:48:59 -0700226extern struct pneigh_entry *__pneigh_lookup(struct neigh_table *tbl,
227 struct net *net,
228 const void *key,
229 struct net_device *dev);
Eric W. Biederman426b5302008-01-24 00:13:18 -0800230extern int pneigh_delete(struct neigh_table *tbl, struct net *net, const void *key, struct net_device *dev);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231
YOSHIFUJI Hideaki57da52c2008-03-26 03:49:59 +0900232static inline
233struct net *pneigh_net(const struct pneigh_entry *pneigh)
234{
Eric Dumazete42ea982008-11-12 00:54:54 -0800235 return read_pnet(&pneigh->net);
YOSHIFUJI Hideaki57da52c2008-03-26 03:49:59 +0900236}
237
Linus Torvalds1da177e2005-04-16 15:20:36 -0700238extern void neigh_app_ns(struct neighbour *n);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700239extern void neigh_for_each(struct neigh_table *tbl, void (*cb)(struct neighbour *, void *), void *cookie);
240extern void __neigh_for_each_release(struct neigh_table *tbl, int (*cb)(struct neighbour *));
241extern void pneigh_for_each(struct neigh_table *tbl, void (*cb)(struct pneigh_entry *));
242
243struct neigh_seq_state {
Denis V. Lunev42508462008-01-10 03:53:12 -0800244 struct seq_net_private p;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700245 struct neigh_table *tbl;
246 void *(*neigh_sub_iter)(struct neigh_seq_state *state,
247 struct neighbour *n, loff_t *pos);
248 unsigned int bucket;
249 unsigned int flags;
250#define NEIGH_SEQ_NEIGH_ONLY 0x00000001
251#define NEIGH_SEQ_IS_PNEIGH 0x00000002
252#define NEIGH_SEQ_SKIP_NOARP 0x00000004
253};
254extern void *neigh_seq_start(struct seq_file *, loff_t *, struct neigh_table *, unsigned int);
255extern void *neigh_seq_next(struct seq_file *, void *, loff_t *);
256extern void neigh_seq_stop(struct seq_file *, void *);
257
258extern int neigh_sysctl_register(struct net_device *dev,
259 struct neigh_parms *p,
260 int p_id, int pdev_id,
261 char *p_name,
262 proc_handler *proc_handler,
263 ctl_handler *strategy);
264extern void neigh_sysctl_unregister(struct neigh_parms *p);
265
266static inline void __neigh_parms_put(struct neigh_parms *parms)
267{
268 atomic_dec(&parms->refcnt);
269}
270
Linus Torvalds1da177e2005-04-16 15:20:36 -0700271static inline struct neigh_parms *neigh_parms_clone(struct neigh_parms *parms)
272{
273 atomic_inc(&parms->refcnt);
274 return parms;
275}
276
277/*
278 * Neighbour references
279 */
280
281static inline void neigh_release(struct neighbour *neigh)
282{
283 if (atomic_dec_and_test(&neigh->refcnt))
284 neigh_destroy(neigh);
285}
286
287static inline struct neighbour * neigh_clone(struct neighbour *neigh)
288{
289 if (neigh)
290 atomic_inc(&neigh->refcnt);
291 return neigh;
292}
293
294#define neigh_hold(n) atomic_inc(&(n)->refcnt)
295
296static inline void neigh_confirm(struct neighbour *neigh)
297{
298 if (neigh)
299 neigh->confirmed = jiffies;
300}
301
Linus Torvalds1da177e2005-04-16 15:20:36 -0700302static inline int neigh_event_send(struct neighbour *neigh, struct sk_buff *skb)
303{
304 neigh->used = jiffies;
305 if (!(neigh->nud_state&(NUD_CONNECTED|NUD_DELAY|NUD_PROBE)))
306 return __neigh_event_send(neigh, skb);
307 return 0;
308}
309
Stephen Hemminger3644f0c2006-12-07 15:08:17 -0800310static inline int neigh_hh_output(struct hh_cache *hh, struct sk_buff *skb)
311{
312 unsigned seq;
313 int hh_len;
314
315 do {
316 int hh_alen;
317
318 seq = read_seqbegin(&hh->hh_lock);
319 hh_len = hh->hh_len;
320 hh_alen = HH_DATA_ALIGN(hh_len);
321 memcpy(skb->data - hh_alen, hh->hh_data, hh_alen);
322 } while (read_seqretry(&hh->hh_lock, seq));
323
324 skb_push(skb, hh_len);
325 return hh->hh_output(skb);
326}
327
Linus Torvalds1da177e2005-04-16 15:20:36 -0700328static inline struct neighbour *
329__neigh_lookup(struct neigh_table *tbl, const void *pkey, struct net_device *dev, int creat)
330{
331 struct neighbour *n = neigh_lookup(tbl, pkey, dev);
332
333 if (n || !creat)
334 return n;
335
336 n = neigh_create(tbl, pkey, dev);
337 return IS_ERR(n) ? NULL : n;
338}
339
340static inline struct neighbour *
341__neigh_lookup_errno(struct neigh_table *tbl, const void *pkey,
342 struct net_device *dev)
343{
344 struct neighbour *n = neigh_lookup(tbl, pkey, dev);
345
346 if (n)
347 return n;
348
349 return neigh_create(tbl, pkey, dev);
350}
351
Patrick McHardya61bbcf2005-08-14 17:24:31 -0700352struct neighbour_cb {
353 unsigned long sched_next;
354 unsigned int flags;
355};
356
357#define LOCALLY_ENQUEUED 0x1
358
359#define NEIGH_CB(skb) ((struct neighbour_cb *)(skb)->cb)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700360
361#endif