[mirror_ubuntu-bionic-kernel.git] / include / net / neighbour.h

#ifndef _NET_NEIGHBOUR_H
#define _NET_NEIGHBOUR_H

#include <linux/neighbour.h>

/*
 *	Generic neighbour manipulation
 *
 *	Authors:
 *	Pedro Roque		<roque@di.fc.ul.pt>
 *	Alexey Kuznetsov	<kuznet@ms2.inr.ac.ru>
 *
 * 	Changes:
 *
 *	Harald Welte:		<laforge@gnumonks.org>
 *		- Add neighbour cache statistics like rtstat
 */

#include <linux/atomic.h>
#include <linux/netdevice.h>
#include <linux/skbuff.h>
#include <linux/rcupdate.h>
#include <linux/seq_file.h>
#include <linux/bitmap.h>

#include <linux/err.h>
#include <linux/sysctl.h>
#include <linux/workqueue.h>
#include <net/rtnetlink.h>

/*
 * NUD stands for "neighbor unreachability detection"
 */

#define NUD_IN_TIMER	(NUD_INCOMPLETE|NUD_REACHABLE|NUD_DELAY|NUD_PROBE)
#define NUD_VALID	(NUD_PERMANENT|NUD_NOARP|NUD_REACHABLE|NUD_PROBE|NUD_STALE|NUD_DELAY)
#define NUD_CONNECTED	(NUD_PERMANENT|NUD_NOARP|NUD_REACHABLE)

struct neighbour;

enum {
	NEIGH_VAR_MCAST_PROBES,
	NEIGH_VAR_UCAST_PROBES,
	NEIGH_VAR_APP_PROBES,
	NEIGH_VAR_MCAST_REPROBES,
	NEIGH_VAR_RETRANS_TIME,
	NEIGH_VAR_BASE_REACHABLE_TIME,
	NEIGH_VAR_DELAY_PROBE_TIME,
	NEIGH_VAR_GC_STALETIME,
	NEIGH_VAR_QUEUE_LEN_BYTES,
	NEIGH_VAR_PROXY_QLEN,
	NEIGH_VAR_ANYCAST_DELAY,
	NEIGH_VAR_PROXY_DELAY,
	NEIGH_VAR_LOCKTIME,
#define NEIGH_VAR_DATA_MAX (NEIGH_VAR_LOCKTIME + 1)
	/* Following are used as a second way to access one of the above */
	NEIGH_VAR_QUEUE_LEN, /* same data as NEIGH_VAR_QUEUE_LEN_BYTES */
	NEIGH_VAR_RETRANS_TIME_MS, /* same data as NEIGH_VAR_RETRANS_TIME */
	NEIGH_VAR_BASE_REACHABLE_TIME_MS, /* same data as NEIGH_VAR_BASE_REACHABLE_TIME */
	/* Following are used by "default" only */
	NEIGH_VAR_GC_INTERVAL,
	NEIGH_VAR_GC_THRESH1,
	NEIGH_VAR_GC_THRESH2,
	NEIGH_VAR_GC_THRESH3,
	NEIGH_VAR_MAX
};

struct neigh_parms {
	possible_net_t net;
	struct net_device *dev;
	struct list_head list;
	int	(*neigh_setup)(struct neighbour *);
	void	(*neigh_cleanup)(struct neighbour *);
	struct neigh_table *tbl;

	void	*sysctl_table;

	int dead;
	atomic_t refcnt;
	struct rcu_head rcu_head;

	int	reachable_time;
	int	data[NEIGH_VAR_DATA_MAX];
	DECLARE_BITMAP(data_state, NEIGH_VAR_DATA_MAX);
};

static inline void neigh_var_set(struct neigh_parms *p, int index, int val)
{
	set_bit(index, p->data_state);
	p->data[index] = val;
}

#define NEIGH_VAR(p, attr) ((p)->data[NEIGH_VAR_ ## attr])

/* In ndo_neigh_setup, NEIGH_VAR_INIT should be used.
 * In other cases, NEIGH_VAR_SET should be used.
 */
#define NEIGH_VAR_INIT(p, attr, val) (NEIGH_VAR(p, attr) = val)
#define NEIGH_VAR_SET(p, attr, val) neigh_var_set(p, NEIGH_VAR_ ## attr, val)

static inline void neigh_parms_data_state_setall(struct neigh_parms *p)
{
	bitmap_fill(p->data_state, NEIGH_VAR_DATA_MAX);
}

static inline void neigh_parms_data_state_cleanall(struct neigh_parms *p)
{
	bitmap_zero(p->data_state, NEIGH_VAR_DATA_MAX);
}

struct neigh_statistics {
	unsigned long allocs;		/* number of allocated neighs */
	unsigned long destroys;		/* number of destroyed neighs */
	unsigned long hash_grows;	/* number of hash resizes */

	unsigned long res_failed;	/* number of failed resolutions */

	unsigned long lookups;		/* number of lookups */
	unsigned long hits;		/* number of hits (among lookups) */

	unsigned long rcv_probes_mcast;	/* number of received mcast ipv6 */
	unsigned long rcv_probes_ucast; /* number of received ucast ipv6 */

	unsigned long periodic_gc_runs;	/* number of periodic GC runs */
	unsigned long forced_gc_runs;	/* number of forced GC runs */

	unsigned long unres_discards;	/* number of unresolved drops */
};

#define NEIGH_CACHE_STAT_INC(tbl, field) this_cpu_inc((tbl)->stats->field)

struct neighbour {
	struct neighbour __rcu	*next;
	struct neigh_table	*tbl;
	struct neigh_parms	*parms;
	unsigned long		confirmed;
	unsigned long		updated;
	rwlock_t		lock;
	atomic_t		refcnt;
	struct sk_buff_head	arp_queue;
	unsigned int		arp_queue_len_bytes;
	struct timer_list	timer;
	unsigned long		used;
	atomic_t		probes;
	__u8			flags;
	__u8			nud_state;
	__u8			type;
	__u8			dead;
	seqlock_t		ha_lock;
	unsigned char		ha[ALIGN(MAX_ADDR_LEN, sizeof(unsigned long))];
	struct hh_cache		hh;
	int			(*output)(struct neighbour *, struct sk_buff *);
	const struct neigh_ops	*ops;
	struct rcu_head		rcu;
	struct net_device	*dev;
	u8			primary_key[0];
};

struct neigh_ops {
	int			family;
	void			(*solicit)(struct neighbour *, struct sk_buff *);
	void			(*error_report)(struct neighbour *, struct sk_buff *);
	int			(*output)(struct neighbour *, struct sk_buff *);
	int			(*connected_output)(struct neighbour *, struct sk_buff *);
};

struct pneigh_entry {
	struct pneigh_entry	*next;
	possible_net_t		net;
	struct net_device	*dev;
	u8			flags;
	u8			key[0];
};

/*
 *	neighbour table manipulation
 */

#define NEIGH_NUM_HASH_RND	4

struct neigh_hash_table {
	struct neighbour __rcu	**hash_buckets;
	unsigned int		hash_shift;
	__u32			hash_rnd[NEIGH_NUM_HASH_RND];
	struct rcu_head		rcu;
};


struct neigh_table {
	int			family;
	int			entry_size;
	int			key_len;
	__be16			protocol;
	__u32			(*hash)(const void *pkey,
					const struct net_device *dev,
					__u32 *hash_rnd);
	bool			(*key_eq)(const struct neighbour *, const void *pkey);
	int			(*constructor)(struct neighbour *);
	int			(*pconstructor)(struct pneigh_entry *);
	void			(*pdestructor)(struct pneigh_entry *);
	void			(*proxy_redo)(struct sk_buff *skb);
	char			*id;
	struct neigh_parms	parms;
	struct list_head	parms_list;
	int			gc_interval;
	int			gc_thresh1;
	int			gc_thresh2;
	int			gc_thresh3;
	unsigned long		last_flush;
	struct delayed_work	gc_work;
	struct timer_list 	proxy_timer;
	struct sk_buff_head	proxy_queue;
	atomic_t		entries;
	rwlock_t		lock;
	unsigned long		last_rand;
	struct neigh_statistics	__percpu *stats;
	struct neigh_hash_table __rcu *nht;
	struct pneigh_entry	**phash_buckets;
};

enum {
	NEIGH_ARP_TABLE = 0,
	NEIGH_ND_TABLE = 1,
	NEIGH_DN_TABLE = 2,
	NEIGH_NR_TABLES,
	NEIGH_LINK_TABLE = NEIGH_NR_TABLES /* Pseudo table for neigh_xmit */
};

static inline int neigh_parms_family(struct neigh_parms *p)
{
	return p->tbl->family;
}

#define NEIGH_PRIV_ALIGN	sizeof(long long)
#define NEIGH_ENTRY_SIZE(size)	ALIGN((size), NEIGH_PRIV_ALIGN)

static inline void *neighbour_priv(const struct neighbour *n)
{
	return (char *)n + n->tbl->entry_size;
}

/* flags for neigh_update() */
#define NEIGH_UPDATE_F_OVERRIDE			0x00000001
#define NEIGH_UPDATE_F_WEAK_OVERRIDE		0x00000002
#define NEIGH_UPDATE_F_OVERRIDE_ISROUTER	0x00000004
#define NEIGH_UPDATE_F_ISROUTER			0x40000000
#define NEIGH_UPDATE_F_ADMIN			0x80000000


static inline bool neigh_key_eq16(const struct neighbour *n, const void *pkey)
{
	return *(const u16 *)n->primary_key == *(const u16 *)pkey;
}

static inline bool neigh_key_eq32(const struct neighbour *n, const void *pkey)
{
	return *(const u32 *)n->primary_key == *(const u32 *)pkey;
}

static inline bool neigh_key_eq128(const struct neighbour *n, const void *pkey)
{
	const u32 *n32 = (const u32 *)n->primary_key;
	const u32 *p32 = pkey;

	return ((n32[0] ^ p32[0]) | (n32[1] ^ p32[1]) |
		(n32[2] ^ p32[2]) | (n32[3] ^ p32[3])) == 0;
}

static inline struct neighbour *___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)
{
	struct neigh_hash_table *nht = rcu_dereference_bh(tbl->nht);
	struct neighbour *n;
	u32 hash_val;

	hash_val = hash(pkey, dev, nht->hash_rnd) >> (32 - nht->hash_shift);
	for (n = rcu_dereference_bh(nht->hash_buckets[hash_val]);
	     n != NULL;
	     n = rcu_dereference_bh(n->next)) {
		if (n->dev == dev && key_eq(n, pkey))
			return n;
	}

	return NULL;
}

static inline struct neighbour *__neigh_lookup_noref(struct neigh_table *tbl,
						     const void *pkey,
						     struct net_device *dev)
{
	return ___neigh_lookup_noref(tbl, tbl->key_eq, tbl->hash, pkey, dev);
}

void neigh_table_init(int index, struct neigh_table *tbl);
int neigh_table_clear(int index, struct neigh_table *tbl);
struct neighbour *neigh_lookup(struct neigh_table *tbl, const void *pkey,
			       struct net_device *dev);
struct neighbour *neigh_lookup_nodev(struct neigh_table *tbl, struct net *net,
				     const void *pkey);
struct neighbour *__neigh_create(struct neigh_table *tbl, const void *pkey,
				 struct net_device *dev, bool want_ref);
static inline struct neighbour *neigh_create(struct neigh_table *tbl,
					     const void *pkey,
					     struct net_device *dev)
{
	return __neigh_create(tbl, pkey, dev, true);
}
void neigh_destroy(struct neighbour *neigh);
int __neigh_event_send(struct neighbour *neigh, struct sk_buff *skb);
int neigh_update(struct neighbour *neigh, const u8 *lladdr, u8 new, u32 flags);
void __neigh_set_probe_once(struct neighbour *neigh);
void neigh_changeaddr(struct neigh_table *tbl, struct net_device *dev);
int neigh_ifdown(struct neigh_table *tbl, struct net_device *dev);
int neigh_resolve_output(struct neighbour *neigh, struct sk_buff *skb);
int neigh_connected_output(struct neighbour *neigh, struct sk_buff *skb);
int neigh_direct_output(struct neighbour *neigh, struct sk_buff *skb);
struct neighbour *neigh_event_ns(struct neigh_table *tbl,
						u8 *lladdr, void *saddr,
						struct net_device *dev);

struct neigh_parms *neigh_parms_alloc(struct net_device *dev,
				      struct neigh_table *tbl);
void neigh_parms_release(struct neigh_table *tbl, struct neigh_parms *parms);

static inline
struct net *neigh_parms_net(const struct neigh_parms *parms)
{
	return read_pnet(&parms->net);
}

unsigned long neigh_rand_reach_time(unsigned long base);

void pneigh_enqueue(struct neigh_table *tbl, struct neigh_parms *p,
		    struct sk_buff *skb);
struct pneigh_entry *pneigh_lookup(struct neigh_table *tbl, struct net *net,
				   const void *key, struct net_device *dev,
				   int creat);
struct pneigh_entry *__pneigh_lookup(struct neigh_table *tbl, struct net *net,
				     const void *key, struct net_device *dev);
int pneigh_delete(struct neigh_table *tbl, struct net *net, const void *key,
		  struct net_device *dev);

static inline struct net *pneigh_net(const struct pneigh_entry *pneigh)
{
	return read_pnet(&pneigh->net);
}

void neigh_app_ns(struct neighbour *n);
void neigh_for_each(struct neigh_table *tbl,
		    void (*cb)(struct neighbour *, void *), void *cookie);
void __neigh_for_each_release(struct neigh_table *tbl,
			      int (*cb)(struct neighbour *));
int neigh_xmit(int fam, struct net_device *, const void *, struct sk_buff *);
void pneigh_for_each(struct neigh_table *tbl,
		     void (*cb)(struct pneigh_entry *));

struct neigh_seq_state {
	struct seq_net_private p;
	struct neigh_table *tbl;
	struct neigh_hash_table *nht;
	void *(*neigh_sub_iter)(struct neigh_seq_state *state,
				struct neighbour *n, loff_t *pos);
	unsigned int bucket;
	unsigned int flags;
#define NEIGH_SEQ_NEIGH_ONLY	0x00000001
#define NEIGH_SEQ_IS_PNEIGH	0x00000002
#define NEIGH_SEQ_SKIP_NOARP	0x00000004
};
void *neigh_seq_start(struct seq_file *, loff_t *, struct neigh_table *,
		      unsigned int);
void *neigh_seq_next(struct seq_file *, void *, loff_t *);
void neigh_seq_stop(struct seq_file *, void *);

int neigh_proc_dointvec(struct ctl_table *ctl, int write,
			void __user *buffer, size_t *lenp, loff_t *ppos);
int neigh_proc_dointvec_jiffies(struct ctl_table *ctl, int write,
				void __user *buffer,
				size_t *lenp, loff_t *ppos);
int neigh_proc_dointvec_ms_jiffies(struct ctl_table *ctl, int write,
				   void __user *buffer,
				   size_t *lenp, loff_t *ppos);

int neigh_sysctl_register(struct net_device *dev, struct neigh_parms *p,
			  proc_handler *proc_handler);
void neigh_sysctl_unregister(struct neigh_parms *p);

static inline void __neigh_parms_put(struct neigh_parms *parms)
{
	atomic_dec(&parms->refcnt);
}

static inline struct neigh_parms *neigh_parms_clone(struct neigh_parms *parms)
{
	atomic_inc(&parms->refcnt);
	return parms;
}

/*
 *	Neighbour references
 */

static inline void neigh_release(struct neighbour *neigh)
{
	if (atomic_dec_and_test(&neigh->refcnt))
		neigh_destroy(neigh);
}

static inline struct neighbour * neigh_clone(struct neighbour *neigh)
{
	if (neigh)
		atomic_inc(&neigh->refcnt);
	return neigh;
}

#define neigh_hold(n)	atomic_inc(&(n)->refcnt)

static inline int neigh_event_send(struct neighbour *neigh, struct sk_buff *skb)
{
	unsigned long now = jiffies;
	
	if (neigh->used != now)
		neigh->used = now;
	if (!(neigh->nud_state&(NUD_CONNECTED|NUD_DELAY|NUD_PROBE)))
		return __neigh_event_send(neigh, skb);
	return 0;
}

#if IS_ENABLED(CONFIG_BRIDGE_NETFILTER)
static inline int neigh_hh_bridge(struct hh_cache *hh, struct sk_buff *skb)
{
	unsigned int seq, hh_alen;

	do {
		seq = read_seqbegin(&hh->hh_lock);
		hh_alen = HH_DATA_ALIGN(ETH_HLEN);
		memcpy(skb->data - hh_alen, hh->hh_data, ETH_ALEN + hh_alen - ETH_HLEN);
	} while (read_seqretry(&hh->hh_lock, seq));
	return 0;
}
#endif

static inline int neigh_hh_output(const struct hh_cache *hh, struct sk_buff *skb)
{
	unsigned int seq;
	int hh_len;

	do {
		seq = read_seqbegin(&hh->hh_lock);
		hh_len = hh->hh_len;
		if (likely(hh_len <= HH_DATA_MOD)) {
			/* this is inlined by gcc */
			memcpy(skb->data - HH_DATA_MOD, hh->hh_data, HH_DATA_MOD);
		} else {
			int hh_alen = HH_DATA_ALIGN(hh_len);

			memcpy(skb->data - hh_alen, hh->hh_data, hh_alen);
		}
	} while (read_seqretry(&hh->hh_lock, seq));

	skb_push(skb, hh_len);
	return dev_queue_xmit(skb);
}

static inline struct neighbour *
__neigh_lookup(struct neigh_table *tbl, const void *pkey, struct net_device *dev, int creat)
{
	struct neighbour *n = neigh_lookup(tbl, pkey, dev);

	if (n || !creat)
		return n;

	n = neigh_create(tbl, pkey, dev);
	return IS_ERR(n) ? NULL : n;
}

static inline struct neighbour *
__neigh_lookup_errno(struct neigh_table *tbl, const void *pkey,
  struct net_device *dev)
{
	struct neighbour *n = neigh_lookup(tbl, pkey, dev);

	if (n)
		return n;

	return neigh_create(tbl, pkey, dev);
}

struct neighbour_cb {
	unsigned long sched_next;
	unsigned int flags;
};

#define LOCALLY_ENQUEUED 0x1

#define NEIGH_CB(skb)	((struct neighbour_cb *)(skb)->cb)

static inline void neigh_ha_snapshot(char *dst, const struct neighbour *n,
				     const struct net_device *dev)
{
	unsigned int seq;

	do {
		seq = read_seqbegin(&n->ha_lock);
		memcpy(dst, n->ha, dev->addr_len);
	} while (read_seqretry(&n->ha_lock, seq));
}


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