[mirror_ubuntu-artful-kernel.git] / include / net / dst.h

/*
 * net/dst.h	Protocol independent destination cache definitions.
 *
 * Authors:	Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
 *
 */

#ifndef _NET_DST_H
#define _NET_DST_H

#include <net/dst_ops.h>
#include <linux/netdevice.h>
#include <linux/rtnetlink.h>
#include <linux/rcupdate.h>
#include <linux/bug.h>
#include <linux/jiffies.h>
#include <net/neighbour.h>
#include <asm/processor.h>

#define DST_GC_MIN	(HZ/10)
#define DST_GC_INC	(HZ/2)
#define DST_GC_MAX	(120*HZ)

/* Each dst_entry has reference count and sits in some parent list(s).
 * When it is removed from parent list, it is "freed" (dst_free).
 * After this it enters dead state (dst->obsolete > 0) and if its refcnt
 * is zero, it can be destroyed immediately, otherwise it is added
 * to gc list and garbage collector periodically checks the refcnt.
 */

struct sk_buff;

struct dst_entry {
	struct rcu_head		rcu_head;
	struct dst_entry	*child;
	struct net_device       *dev;
	struct  dst_ops	        *ops;
	unsigned long		_metrics;
	unsigned long           expires;
	struct dst_entry	*path;
	struct dst_entry	*from;
#ifdef CONFIG_XFRM
	struct xfrm_state	*xfrm;
#else
	void			*__pad1;
#endif
	int			(*input)(struct sk_buff *);
	int			(*output)(struct sock *sk, struct sk_buff *skb);

	unsigned short		flags;
#define DST_HOST		0x0001
#define DST_NOXFRM		0x0002
#define DST_NOPOLICY		0x0004
#define DST_NOHASH		0x0008
#define DST_NOCACHE		0x0010
#define DST_NOCOUNT		0x0020
#define DST_FAKE_RTABLE		0x0040
#define DST_XFRM_TUNNEL		0x0080
#define DST_XFRM_QUEUE		0x0100

	unsigned short		pending_confirm;

	short			error;

	/* A non-zero value of dst->obsolete forces by-hand validation
	 * of the route entry.  Positive values are set by the generic
	 * dst layer to indicate that the entry has been forcefully
	 * destroyed.
	 *
	 * Negative values are used by the implementation layer code to
	 * force invocation of the dst_ops->check() method.
	 */
	short			obsolete;
#define DST_OBSOLETE_NONE	0
#define DST_OBSOLETE_DEAD	2
#define DST_OBSOLETE_FORCE_CHK	-1
#define DST_OBSOLETE_KILL	-2
	unsigned short		header_len;	/* more space at head required */
	unsigned short		trailer_len;	/* space to reserve at tail */
#ifdef CONFIG_IP_ROUTE_CLASSID
	__u32			tclassid;
#else
	__u32			__pad2;
#endif

	/*
	 * Align __refcnt to a 64 bytes alignment
	 * (L1_CACHE_SIZE would be too much)
	 */
#ifdef CONFIG_64BIT
	long			__pad_to_align_refcnt[2];
#endif
	/*
	 * __refcnt wants to be on a different cache line from
	 * input/output/ops or performance tanks badly
	 */
	atomic_t		__refcnt;	/* client references	*/
	int			__use;
	unsigned long		lastuse;
	union {
		struct dst_entry	*next;
		struct rtable __rcu	*rt_next;
		struct rt6_info		*rt6_next;
		struct dn_route __rcu	*dn_next;
	};
};

u32 *dst_cow_metrics_generic(struct dst_entry *dst, unsigned long old);
extern const u32 dst_default_metrics[];

#define DST_METRICS_READ_ONLY		0x1UL
#define DST_METRICS_FLAGS		0x3UL
#define __DST_METRICS_PTR(Y)	\
	((u32 *)((Y) & ~DST_METRICS_FLAGS))
#define DST_METRICS_PTR(X)	__DST_METRICS_PTR((X)->_metrics)

static inline bool dst_metrics_read_only(const struct dst_entry *dst)
{
	return dst->_metrics & DST_METRICS_READ_ONLY;
}

void __dst_destroy_metrics_generic(struct dst_entry *dst, unsigned long old);

static inline void dst_destroy_metrics_generic(struct dst_entry *dst)
{
	unsigned long val = dst->_metrics;
	if (!(val & DST_METRICS_READ_ONLY))
		__dst_destroy_metrics_generic(dst, val);
}

static inline u32 *dst_metrics_write_ptr(struct dst_entry *dst)
{
	unsigned long p = dst->_metrics;

	BUG_ON(!p);

	if (p & DST_METRICS_READ_ONLY)
		return dst->ops->cow_metrics(dst, p);
	return __DST_METRICS_PTR(p);
}

/* This may only be invoked before the entry has reached global
 * visibility.
 */
static inline void dst_init_metrics(struct dst_entry *dst,
				    const u32 *src_metrics,
				    bool read_only)
{
	dst->_metrics = ((unsigned long) src_metrics) |
		(read_only ? DST_METRICS_READ_ONLY : 0);
}

static inline void dst_copy_metrics(struct dst_entry *dest, const struct dst_entry *src)
{
	u32 *dst_metrics = dst_metrics_write_ptr(dest);

	if (dst_metrics) {
		u32 *src_metrics = DST_METRICS_PTR(src);

		memcpy(dst_metrics, src_metrics, RTAX_MAX * sizeof(u32));
	}
}

static inline u32 *dst_metrics_ptr(struct dst_entry *dst)
{
	return DST_METRICS_PTR(dst);
}

static inline u32
dst_metric_raw(const struct dst_entry *dst, const int metric)
{
	u32 *p = DST_METRICS_PTR(dst);

	return p[metric-1];
}

static inline u32
dst_metric(const struct dst_entry *dst, const int metric)
{
	WARN_ON_ONCE(metric == RTAX_HOPLIMIT ||
		     metric == RTAX_ADVMSS ||
		     metric == RTAX_MTU);
	return dst_metric_raw(dst, metric);
}

static inline u32
dst_metric_advmss(const struct dst_entry *dst)
{
	u32 advmss = dst_metric_raw(dst, RTAX_ADVMSS);

	if (!advmss)
		advmss = dst->ops->default_advmss(dst);

	return advmss;
}

static inline void dst_metric_set(struct dst_entry *dst, int metric, u32 val)
{
	u32 *p = dst_metrics_write_ptr(dst);

	if (p)
		p[metric-1] = val;
}

static inline u32
dst_feature(const struct dst_entry *dst, u32 feature)
{
	return dst_metric(dst, RTAX_FEATURES) & feature;
}

static inline u32 dst_mtu(const struct dst_entry *dst)
{
	return dst->ops->mtu(dst);
}

/* RTT metrics are stored in milliseconds for user ABI, but used as jiffies */
static inline unsigned long dst_metric_rtt(const struct dst_entry *dst, int metric)
{
	return msecs_to_jiffies(dst_metric(dst, metric));
}

static inline u32
dst_allfrag(const struct dst_entry *dst)
{
	int ret = dst_feature(dst,  RTAX_FEATURE_ALLFRAG);
	return ret;
}

static inline int
dst_metric_locked(const struct dst_entry *dst, int metric)
{
	return dst_metric(dst, RTAX_LOCK) & (1<<metric);
}

static inline void dst_hold(struct dst_entry *dst)
{
	/*
	 * If your kernel compilation stops here, please check
	 * __pad_to_align_refcnt declaration in struct dst_entry
	 */
	BUILD_BUG_ON(offsetof(struct dst_entry, __refcnt) & 63);
	atomic_inc(&dst->__refcnt);
}

static inline void dst_use(struct dst_entry *dst, unsigned long time)
{
	dst_hold(dst);
	dst->__use++;
	dst->lastuse = time;
}

static inline void dst_use_noref(struct dst_entry *dst, unsigned long time)
{
	dst->__use++;
	dst->lastuse = time;
}

static inline struct dst_entry *dst_clone(struct dst_entry *dst)
{
	if (dst)
		atomic_inc(&dst->__refcnt);
	return dst;
}

void dst_release(struct dst_entry *dst);

static inline void refdst_drop(unsigned long refdst)
{
	if (!(refdst & SKB_DST_NOREF))
		dst_release((struct dst_entry *)(refdst & SKB_DST_PTRMASK));
}

/**
 * skb_dst_drop - drops skb dst
 * @skb: buffer
 *
 * Drops dst reference count if a reference was taken.
 */
static inline void skb_dst_drop(struct sk_buff *skb)
{
	if (skb->_skb_refdst) {
		refdst_drop(skb->_skb_refdst);
		skb->_skb_refdst = 0UL;
	}
}

static inline void skb_dst_copy(struct sk_buff *nskb, const struct sk_buff *oskb)
{
	nskb->_skb_refdst = oskb->_skb_refdst;
	if (!(nskb->_skb_refdst & SKB_DST_NOREF))
		dst_clone(skb_dst(nskb));
}

/**
 * skb_dst_force - makes sure skb dst is refcounted
 * @skb: buffer
 *
 * If dst is not yet refcounted, let's do it
 */
static inline void skb_dst_force(struct sk_buff *skb)
{
	if (skb_dst_is_noref(skb)) {
		WARN_ON(!rcu_read_lock_held());
		skb->_skb_refdst &= ~SKB_DST_NOREF;
		dst_clone(skb_dst(skb));
	}
}


/**
 *	__skb_tunnel_rx - prepare skb for rx reinsert
 *	@skb: buffer
 *	@dev: tunnel device
 *	@net: netns for packet i/o
 *
 *	After decapsulation, packet is going to re-enter (netif_rx()) our stack,
 *	so make some cleanups. (no accounting done)
 */
static inline void __skb_tunnel_rx(struct sk_buff *skb, struct net_device *dev,
				   struct net *net)
{
	skb->dev = dev;

	/*
	 * Clear hash so that we can recalulate the hash for the
	 * encapsulated packet, unless we have already determine the hash
	 * over the L4 4-tuple.
	 */
	skb_clear_hash_if_not_l4(skb);
	skb_set_queue_mapping(skb, 0);
	skb_scrub_packet(skb, !net_eq(net, dev_net(dev)));
}

/**
 *	skb_tunnel_rx - prepare skb for rx reinsert
 *	@skb: buffer
 *	@dev: tunnel device
 *
 *	After decapsulation, packet is going to re-enter (netif_rx()) our stack,
 *	so make some cleanups, and perform accounting.
 *	Note: this accounting is not SMP safe.
 */
static inline void skb_tunnel_rx(struct sk_buff *skb, struct net_device *dev,
				 struct net *net)
{
	/* TODO : stats should be SMP safe */
	dev->stats.rx_packets++;
	dev->stats.rx_bytes += skb->len;
	__skb_tunnel_rx(skb, dev, net);
}

int dst_discard_sk(struct sock *sk, struct sk_buff *skb);
static inline int dst_discard(struct sk_buff *skb)
{
	return dst_discard_sk(skb->sk, skb);
}
void *dst_alloc(struct dst_ops *ops, struct net_device *dev, int initial_ref,
		int initial_obsolete, unsigned short flags);
void __dst_free(struct dst_entry *dst);
struct dst_entry *dst_destroy(struct dst_entry *dst);

static inline void dst_free(struct dst_entry *dst)
{
	if (dst->obsolete > 0)
		return;
	if (!atomic_read(&dst->__refcnt)) {
		dst = dst_destroy(dst);
		if (!dst)
			return;
	}
	__dst_free(dst);
}

static inline void dst_rcu_free(struct rcu_head *head)
{
	struct dst_entry *dst = container_of(head, struct dst_entry, rcu_head);
	dst_free(dst);
}

static inline void dst_confirm(struct dst_entry *dst)
{
	dst->pending_confirm = 1;
}

static inline int dst_neigh_output(struct dst_entry *dst, struct neighbour *n,
				   struct sk_buff *skb)
{
	const struct hh_cache *hh;

	if (dst->pending_confirm) {
		unsigned long now = jiffies;

		dst->pending_confirm = 0;
		/* avoid dirtying neighbour */
		if (n->confirmed != now)
			n->confirmed = now;
	}

	hh = &n->hh;
	if ((n->nud_state & NUD_CONNECTED) && hh->hh_len)
		return neigh_hh_output(hh, skb);
	else
		return n->output(n, skb);
}

static inline struct neighbour *dst_neigh_lookup(const struct dst_entry *dst, const void *daddr)
{
	struct neighbour *n = dst->ops->neigh_lookup(dst, NULL, daddr);
	return IS_ERR(n) ? NULL : n;
}

static inline struct neighbour *dst_neigh_lookup_skb(const struct dst_entry *dst,
						     struct sk_buff *skb)
{
	struct neighbour *n =  dst->ops->neigh_lookup(dst, skb, NULL);
	return IS_ERR(n) ? NULL : n;
}

static inline void dst_link_failure(struct sk_buff *skb)
{
	struct dst_entry *dst = skb_dst(skb);
	if (dst && dst->ops && dst->ops->link_failure)
		dst->ops->link_failure(skb);
}

static inline void dst_set_expires(struct dst_entry *dst, int timeout)
{
	unsigned long expires = jiffies + timeout;

	if (expires == 0)
		expires = 1;

	if (dst->expires == 0 || time_before(expires, dst->expires))
		dst->expires = expires;
}

/* Output packet to network from transport.  */
static inline int dst_output_sk(struct sock *sk, struct sk_buff *skb)
{
	return skb_dst(skb)->output(sk, skb);
}
static inline int dst_output(struct sk_buff *skb)
{
	return dst_output_sk(skb->sk, skb);
}

/* Input packet from network to transport.  */
static inline int dst_input(struct sk_buff *skb)
{
	return skb_dst(skb)->input(skb);
}

static inline struct dst_entry *dst_check(struct dst_entry *dst, u32 cookie)
{
	if (dst->obsolete)
		dst = dst->ops->check(dst, cookie);
	return dst;
}

void dst_init(void);

/* Flags for xfrm_lookup flags argument. */
enum {
	XFRM_LOOKUP_ICMP = 1 << 0,
	XFRM_LOOKUP_QUEUE = 1 << 1,
	XFRM_LOOKUP_KEEP_DST_REF = 1 << 2,
};

struct flowi;
#ifndef CONFIG_XFRM
static inline struct dst_entry *xfrm_lookup(struct net *net,
					    struct dst_entry *dst_orig,
					    const struct flowi *fl, struct sock *sk,
					    int flags)
{
	return dst_orig;
}

static inline struct dst_entry *xfrm_lookup_route(struct net *net,
						  struct dst_entry *dst_orig,
						  const struct flowi *fl,
						  struct sock *sk,
						  int flags)
{
	return dst_orig;
}

static inline struct xfrm_state *dst_xfrm(const struct dst_entry *dst)
{
	return NULL;
}

#else
struct dst_entry *xfrm_lookup(struct net *net, struct dst_entry *dst_orig,
			      const struct flowi *fl, struct sock *sk,
			      int flags);

struct dst_entry *xfrm_lookup_route(struct net *net, struct dst_entry *dst_orig,
				    const struct flowi *fl, struct sock *sk,
				    int flags);

/* skb attached with this dst needs transformation if dst->xfrm is valid */
static inline struct xfrm_state *dst_xfrm(const struct dst_entry *dst)
{
	return dst->xfrm;
}
#endif

#endif /* _NET_DST_H */
Commit	Line	Data
1da177e4 LT	1	/*
	2	* net/dst.h Protocol independent destination cache definitions.
	3	*
	4	* Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
	5	*
	6	*/
	7
	8	#ifndef _NET_DST_H
	9	#define _NET_DST_H
	10
86393e52	11	#include <net/dst_ops.h>
14c85021	12	#include <linux/netdevice.h>
1da177e4 LT	13	#include <linux/rtnetlink.h>
1da177e4 LT	14	#include <linux/rcupdate.h>
187f1882	15	#include <linux/bug.h>
1da177e4 LT	16	#include <linux/jiffies.h>
	17	#include <net/neighbour.h>
	18	#include <asm/processor.h>
	19
1da177e4 LT	20	#define DST_GC_MIN (HZ/10)
	21	#define DST_GC_INC (HZ/2)
	22	#define DST_GC_MAX (120*HZ)
	23
	24	/* Each dst_entry has reference count and sits in some parent list(s).
	25	* When it is removed from parent list, it is "freed" (dst_free).
	26	* After this it enters dead state (dst->obsolete > 0) and if its refcnt
	27	* is zero, it can be destroyed immediately, otherwise it is added
	28	* to gc list and garbage collector periodically checks the refcnt.
	29	*/
	30
	31	struct sk_buff;
	32
fd2c3ef7	33	struct dst_entry {
1e19e02c	34	struct rcu_head rcu_head;
1da177e4 LT	35	struct dst_entry *child;
1da177e4 LT	36	struct net_device *dev;
62fa8a84 DM	37	struct dst_ops *ops;
62fa8a84 DM	38	unsigned long _metrics;
ecd98837	39	unsigned long expires;
f1dd9c37	40	struct dst_entry *path;
ecd98837	41	struct dst_entry *from;
def8b4fa	42	#ifdef CONFIG_XFRM
1da177e4	43	struct xfrm_state *xfrm;
5635c10d ED	44	#else
5635c10d ED	45	void *__pad1;
def8b4fa	46	#endif
7f95e188	47	int (input)(struct sk_buff );
aad88724	48	int (output)(struct sock sk, struct sk_buff *skb);
1da177e4	49
5110effe	50	unsigned short flags;
f6b72b62 DM	51	#define DST_HOST 0x0001
	52	#define DST_NOXFRM 0x0002
	53	#define DST_NOPOLICY 0x0004
	54	#define DST_NOHASH 0x0008
	55	#define DST_NOCACHE 0x0010
	56	#define DST_NOCOUNT 0x0020
e90c1483 HFS	57	#define DST_FAKE_RTABLE 0x0040
	58	#define DST_XFRM_TUNNEL 0x0080
	59	#define DST_XFRM_QUEUE 0x0100
f6b72b62	60
5110effe DM	61	unsigned short pending_confirm;
5110effe DM	62
62fa8a84	63	short error;
f5b0a874 DM	64
	65	/* A non-zero value of dst->obsolete forces by-hand validation
	66	* of the route entry. Positive values are set by the generic
	67	* dst layer to indicate that the entry has been forcefully
	68	* destroyed.
	69	*
	70	* Negative values are used by the implementation layer code to
	71	* force invocation of the dst_ops->check() method.
	72	*/
62fa8a84	73	short obsolete;
f5b0a874 DM	74	#define DST_OBSOLETE_NONE 0
	75	#define DST_OBSOLETE_DEAD 2
	76	#define DST_OBSOLETE_FORCE_CHK -1
ceb33206	77	#define DST_OBSOLETE_KILL -2
62fa8a84 DM	78	unsigned short header_len; /* more space at head required */
62fa8a84 DM	79	unsigned short trailer_len; /* space to reserve at tail */
c7066f70	80	#ifdef CONFIG_IP_ROUTE_CLASSID
f1dd9c37	81	__u32 tclassid;
5635c10d ED	82	#else
5635c10d ED	83	__u32 __pad2;
f1dd9c37 ZY	84	#endif
f1dd9c37 ZY	85
5635c10d ED	86	/*
	87	* Align __refcnt to a 64 bytes alignment
	88	* (L1_CACHE_SIZE would be too much)
	89	*/
	90	#ifdef CONFIG_64BIT
f6b72b62	91	long __pad_to_align_refcnt[2];
5635c10d	92	#endif
f1dd9c37 ZY	93	/*
	94	* __refcnt wants to be on a different cache line from
	95	* input/output/ops or performance tanks badly
	96	*/
1e19e02c ED	97	atomic_t __refcnt; /* client references */
1e19e02c ED	98	int __use;
f1dd9c37	99	unsigned long lastuse;
1e19e02c	100	union {
fc766e4c ED	101	struct dst_entry *next;
	102	struct rtable __rcu *rt_next;
	103	struct rt6_info *rt6_next;
	104	struct dn_route __rcu *dn_next;
1e19e02c	105	};
1da177e4 LT	106	};
1da177e4 LT	107
a4023dd0	108	u32 dst_cow_metrics_generic(struct dst_entry dst, unsigned long old);
a37e6e34	109	extern const u32 dst_default_metrics[];
62fa8a84	110
e5fd387a	111	#define DST_METRICS_READ_ONLY 0x1UL
e5fd387a	112	#define DST_METRICS_FLAGS 0x3UL
62fa8a84	113	#define __DST_METRICS_PTR(Y) \
e5fd387a	114	((u32 *)((Y) & ~DST_METRICS_FLAGS))
62fa8a84 DM	115	#define DST_METRICS_PTR(X) __DST_METRICS_PTR((X)->_metrics)
	116
	117	static inline bool dst_metrics_read_only(const struct dst_entry *dst)
	118	{
	119	return dst->_metrics & DST_METRICS_READ_ONLY;
	120	}
	121
a4023dd0	122	void __dst_destroy_metrics_generic(struct dst_entry *dst, unsigned long old);
62fa8a84 DM	123
	124	static inline void dst_destroy_metrics_generic(struct dst_entry *dst)
	125	{
	126	unsigned long val = dst->_metrics;
	127	if (!(val & DST_METRICS_READ_ONLY))
	128	__dst_destroy_metrics_generic(dst, val);
	129	}
	130
	131	static inline u32 dst_metrics_write_ptr(struct dst_entry dst)
	132	{
	133	unsigned long p = dst->_metrics;
	134
1f37070d SH	135	BUG_ON(!p);
1f37070d SH	136
62fa8a84 DM	137	if (p & DST_METRICS_READ_ONLY)
	138	return dst->ops->cow_metrics(dst, p);
	139	return __DST_METRICS_PTR(p);
	140	}
	141
	142	/* This may only be invoked before the entry has reached global
	143	* visibility.
	144	*/
	145	static inline void dst_init_metrics(struct dst_entry *dst,
	146	const u32 *src_metrics,
	147	bool read_only)
	148	{
	149	dst->_metrics = ((unsigned long) src_metrics) \|
	150	(read_only ? DST_METRICS_READ_ONLY : 0);
	151	}
	152
	153	static inline void dst_copy_metrics(struct dst_entry dest, const struct dst_entry src)
	154	{
	155	u32 *dst_metrics = dst_metrics_write_ptr(dest);
	156
	157	if (dst_metrics) {
	158	u32 *src_metrics = DST_METRICS_PTR(src);
	159
	160	memcpy(dst_metrics, src_metrics, RTAX_MAX * sizeof(u32));
	161	}
	162	}
	163
	164	static inline u32 dst_metrics_ptr(struct dst_entry dst)
	165	{
	166	return DST_METRICS_PTR(dst);
	167	}
	168
1da177e4	169	static inline u32
5170ae82	170	dst_metric_raw(const struct dst_entry *dst, const int metric)
1da177e4	171	{
62fa8a84 DM	172	u32 *p = DST_METRICS_PTR(dst);
	173
	174	return p[metric-1];
defb3519 DM	175	}
defb3519 DM	176
5170ae82 DM	177	static inline u32
	178	dst_metric(const struct dst_entry *dst, const int metric)
	179	{
0dbaee3b	180	WARN_ON_ONCE(metric == RTAX_HOPLIMIT \|\|
d33e4553 DM	181	metric == RTAX_ADVMSS \|\|
d33e4553 DM	182	metric == RTAX_MTU);
5170ae82 DM	183	return dst_metric_raw(dst, metric);
	184	}
	185
0dbaee3b DM	186	static inline u32
	187	dst_metric_advmss(const struct dst_entry *dst)
	188	{
	189	u32 advmss = dst_metric_raw(dst, RTAX_ADVMSS);
	190
	191	if (!advmss)
	192	advmss = dst->ops->default_advmss(dst);
	193
	194	return advmss;
	195	}
	196
defb3519 DM	197	static inline void dst_metric_set(struct dst_entry *dst, int metric, u32 val)
defb3519 DM	198	{
62fa8a84	199	u32 *p = dst_metrics_write_ptr(dst);
defb3519	200
62fa8a84 DM	201	if (p)
62fa8a84 DM	202	p[metric-1] = val;
1da177e4 LT	203	}
1da177e4 LT	204
0c3adfb8 GBY	205	static inline u32
	206	dst_feature(const struct dst_entry *dst, u32 feature)
	207	{
bb5b7c11	208	return dst_metric(dst, RTAX_FEATURES) & feature;
0c3adfb8 GBY	209	}
0c3adfb8 GBY	210
1da177e4 LT	211	static inline u32 dst_mtu(const struct dst_entry *dst)
1da177e4 LT	212	{
618f9bc7	213	return dst->ops->mtu(dst);
1da177e4 LT	214	}
1da177e4 LT	215
c1e20f7c SH	216	/* RTT metrics are stored in milliseconds for user ABI, but used as jiffies */
	217	static inline unsigned long dst_metric_rtt(const struct dst_entry *dst, int metric)
	218	{
	219	return msecs_to_jiffies(dst_metric(dst, metric));
	220	}
	221
1da177e4 LT	222	static inline u32
	223	dst_allfrag(const struct dst_entry *dst)
	224	{
0c3adfb8	225	int ret = dst_feature(dst, RTAX_FEATURE_ALLFRAG);
1da177e4 LT	226	return ret;
	227	}
	228
	229	static inline int
d33e4553	230	dst_metric_locked(const struct dst_entry *dst, int metric)
1da177e4 LT	231	{
	232	return dst_metric(dst, RTAX_LOCK) & (1<<metric);
	233	}
	234
7f95e188	235	static inline void dst_hold(struct dst_entry *dst)
1da177e4	236	{
5635c10d ED	237	/*
	238	* If your kernel compilation stops here, please check
	239	* __pad_to_align_refcnt declaration in struct dst_entry
	240	*/
	241	BUILD_BUG_ON(offsetof(struct dst_entry, __refcnt) & 63);
1da177e4 LT	242	atomic_inc(&dst->__refcnt);
	243	}
	244
03f49f34 PE	245	static inline void dst_use(struct dst_entry *dst, unsigned long time)
	246	{
	247	dst_hold(dst);
	248	dst->__use++;
	249	dst->lastuse = time;
	250	}
	251
7fee226a ED	252	static inline void dst_use_noref(struct dst_entry *dst, unsigned long time)
	253	{
	254	dst->__use++;
	255	dst->lastuse = time;
	256	}
	257
7f95e188	258	static inline struct dst_entry dst_clone(struct dst_entry dst)
1da177e4 LT	259	{
	260	if (dst)
	261	atomic_inc(&dst->__refcnt);
	262	return dst;
	263	}
	264
a4023dd0	265	void dst_release(struct dst_entry *dst);
7fee226a ED	266
	267	static inline void refdst_drop(unsigned long refdst)
	268	{
	269	if (!(refdst & SKB_DST_NOREF))
	270	dst_release((struct dst_entry *)(refdst & SKB_DST_PTRMASK));
	271	}
	272
	273	/**
	274	* skb_dst_drop - drops skb dst
	275	* @skb: buffer
	276	*
	277	* Drops dst reference count if a reference was taken.
	278	*/
adf30907 ED	279	static inline void skb_dst_drop(struct sk_buff *skb)
adf30907 ED	280	{
7fee226a ED	281	if (skb->_skb_refdst) {
	282	refdst_drop(skb->_skb_refdst);
	283	skb->_skb_refdst = 0UL;
	284	}
	285	}
	286
	287	static inline void skb_dst_copy(struct sk_buff nskb, const struct sk_buff oskb)
	288	{
	289	nskb->_skb_refdst = oskb->_skb_refdst;
	290	if (!(nskb->_skb_refdst & SKB_DST_NOREF))
	291	dst_clone(skb_dst(nskb));
	292	}
	293
	294	/**
	295	* skb_dst_force - makes sure skb dst is refcounted
	296	* @skb: buffer
	297	*
	298	* If dst is not yet refcounted, let's do it
	299	*/
	300	static inline void skb_dst_force(struct sk_buff *skb)
	301	{
	302	if (skb_dst_is_noref(skb)) {
	303	WARN_ON(!rcu_read_lock_held());
	304	skb->_skb_refdst &= ~SKB_DST_NOREF;
	305	dst_clone(skb_dst(skb));
	306	}
adf30907	307	}
1da177e4	308
d19d56dd	309
290b895e ED	310	/**
	311	* __skb_tunnel_rx - prepare skb for rx reinsert
	312	* @skb: buffer
	313	* @dev: tunnel device
ea23192e	314	* @net: netns for packet i/o
290b895e ED	315	*
	316	* After decapsulation, packet is going to re-enter (netif_rx()) our stack,
	317	* so make some cleanups. (no accounting done)
	318	*/
ea23192e ND	319	static inline void __skb_tunnel_rx(struct sk_buff skb, struct net_device dev,
ea23192e ND	320	struct net *net)
290b895e ED	321	{
290b895e ED	322	skb->dev = dev;
bdeab991 TH	323
bdeab991 TH	324	/*
7539fadc	325	* Clear hash so that we can recalulate the hash for the
bdeab991 TH	326	* encapsulated packet, unless we have already determine the hash
	327	* over the L4 4-tuple.
	328	*/
7539fadc	329	skb_clear_hash_if_not_l4(skb);
290b895e	330	skb_set_queue_mapping(skb, 0);
ea23192e	331	skb_scrub_packet(skb, !net_eq(net, dev_net(dev)));
290b895e ED	332	}
290b895e ED	333
d19d56dd ED	334	/**
	335	* skb_tunnel_rx - prepare skb for rx reinsert
	336	* @skb: buffer
	337	* @dev: tunnel device
	338	*
	339	* After decapsulation, packet is going to re-enter (netif_rx()) our stack,
	340	* so make some cleanups, and perform accounting.
290b895e	341	* Note: this accounting is not SMP safe.
d19d56dd	342	*/
ea23192e ND	343	static inline void skb_tunnel_rx(struct sk_buff skb, struct net_device dev,
ea23192e ND	344	struct net *net)
d19d56dd	345	{
d19d56dd ED	346	/* TODO : stats should be SMP safe */
	347	dev->stats.rx_packets++;
	348	dev->stats.rx_bytes += skb->len;
ea23192e	349	__skb_tunnel_rx(skb, dev, net);
d19d56dd ED	350	}
d19d56dd ED	351
aad88724 ED	352	int dst_discard_sk(struct sock sk, struct sk_buff skb);
	353	static inline int dst_discard(struct sk_buff *skb)
	354	{
	355	return dst_discard_sk(skb->sk, skb);
	356	}
a4023dd0 JP	357	void dst_alloc(struct dst_ops ops, struct net_device *dev, int initial_ref,
	358	int initial_obsolete, unsigned short flags);
	359	void __dst_free(struct dst_entry *dst);
	360	struct dst_entry dst_destroy(struct dst_entry dst);
1da177e4	361
7f95e188	362	static inline void dst_free(struct dst_entry *dst)
1da177e4	363	{
f5b0a874	364	if (dst->obsolete > 0)
1da177e4 LT	365	return;
	366	if (!atomic_read(&dst->__refcnt)) {
	367	dst = dst_destroy(dst);
	368	if (!dst)
	369	return;
	370	}
	371	__dst_free(dst);
	372	}
	373
	374	static inline void dst_rcu_free(struct rcu_head *head)
	375	{
	376	struct dst_entry *dst = container_of(head, struct dst_entry, rcu_head);
	377	dst_free(dst);
	378	}
	379
	380	static inline void dst_confirm(struct dst_entry *dst)
	381	{
5110effe DM	382	dst->pending_confirm = 1;
5110effe DM	383	}
f2c31e32	384
5110effe DM	385	static inline int dst_neigh_output(struct dst_entry dst, struct neighbour n,
	386	struct sk_buff *skb)
	387	{
425f09ab ED	388	const struct hh_cache *hh;
	389
	390	if (dst->pending_confirm) {
	391	unsigned long now = jiffies;
5110effe	392
5110effe	393	dst->pending_confirm = 0;
425f09ab ED	394	/* avoid dirtying neighbour */
	395	if (n->confirmed != now)
	396	n->confirmed = now;
69cce1d1	397	}
5110effe DM	398
	399	hh = &n->hh;
	400	if ((n->nud_state & NUD_CONNECTED) && hh->hh_len)
	401	return neigh_hh_output(hh, skb);
	402	else
	403	return n->output(n, skb);
1da177e4 LT	404	}
1da177e4 LT	405
d3aaeb38 DM	406	static inline struct neighbour dst_neigh_lookup(const struct dst_entry dst, const void *daddr)
d3aaeb38 DM	407	{
aaa0c23c ZZ	408	struct neighbour *n = dst->ops->neigh_lookup(dst, NULL, daddr);
aaa0c23c ZZ	409	return IS_ERR(n) ? NULL : n;
f894cbf8 DM	410	}
	411
	412	static inline struct neighbour dst_neigh_lookup_skb(const struct dst_entry dst,
	413	struct sk_buff *skb)
	414	{
aaa0c23c ZZ	415	struct neighbour *n = dst->ops->neigh_lookup(dst, skb, NULL);
aaa0c23c ZZ	416	return IS_ERR(n) ? NULL : n;
d3aaeb38 DM	417	}
d3aaeb38 DM	418
1da177e4 LT	419	static inline void dst_link_failure(struct sk_buff *skb)
1da177e4 LT	420	{
adf30907	421	struct dst_entry *dst = skb_dst(skb);
1da177e4 LT	422	if (dst && dst->ops && dst->ops->link_failure)
	423	dst->ops->link_failure(skb);
	424	}
	425
	426	static inline void dst_set_expires(struct dst_entry *dst, int timeout)
	427	{
	428	unsigned long expires = jiffies + timeout;
	429
	430	if (expires == 0)
	431	expires = 1;
	432
	433	if (dst->expires == 0 \|\| time_before(expires, dst->expires))
	434	dst->expires = expires;
	435	}
	436
	437	/* Output packet to network from transport. */
aad88724 ED	438	static inline int dst_output_sk(struct sock sk, struct sk_buff skb)
	439	{
	440	return skb_dst(skb)->output(sk, skb);
	441	}
1da177e4 LT	442	static inline int dst_output(struct sk_buff *skb)
1da177e4 LT	443	{
aad88724	444	return dst_output_sk(skb->sk, skb);
1da177e4 LT	445	}
	446
	447	/* Input packet from network to transport. */
	448	static inline int dst_input(struct sk_buff *skb)
	449	{
adf30907	450	return skb_dst(skb)->input(skb);
1da177e4 LT	451	}
	452
	453	static inline struct dst_entry dst_check(struct dst_entry dst, u32 cookie)
	454	{
	455	if (dst->obsolete)
	456	dst = dst->ops->check(dst, cookie);
	457	return dst;
	458	}
	459
a4023dd0	460	void dst_init(void);
1da177e4	461
815f4e57 HX	462	/* Flags for xfrm_lookup flags argument. */
815f4e57 HX	463	enum {
80c0bc9e	464	XFRM_LOOKUP_ICMP = 1 << 0,
b8c203b2	465	XFRM_LOOKUP_QUEUE = 1 << 1,
ac37e251	466	XFRM_LOOKUP_KEEP_DST_REF = 1 << 2,
815f4e57 HX	467	};
815f4e57 HX	468
1da177e4 LT	469	struct flowi;
1da177e4 LT	470	#ifndef CONFIG_XFRM
452edd59 DM	471	static inline struct dst_entry xfrm_lookup(struct net net,
	472	struct dst_entry *dst_orig,
	473	const struct flowi fl, struct sock sk,
	474	int flags)
1da177e4	475	{
452edd59	476	return dst_orig;
f92ee619 SK	477	}
	478
	479	static inline struct dst_entry xfrm_lookup_route(struct net net,
	480	struct dst_entry *dst_orig,
	481	const struct flowi *fl,
	482	struct sock *sk,
	483	int flags)
	484	{
	485	return dst_orig;
	486	}
e87b3998 VY	487
	488	static inline struct xfrm_state dst_xfrm(const struct dst_entry dst)
	489	{
	490	return NULL;
	491	}
	492
1da177e4	493	#else
a4023dd0 JP	494	struct dst_entry xfrm_lookup(struct net net, struct dst_entry *dst_orig,
	495	const struct flowi fl, struct sock sk,
	496	int flags);
e87b3998	497
f92ee619 SK	498	struct dst_entry xfrm_lookup_route(struct net net, struct dst_entry *dst_orig,
	499	const struct flowi fl, struct sock sk,
	500	int flags);
	501
e87b3998 VY	502	/* skb attached with this dst needs transformation if dst->xfrm is valid */
	503	static inline struct xfrm_state dst_xfrm(const struct dst_entry dst)
	504	{
	505	return dst->xfrm;
	506	}
1da177e4	507	#endif
1da177e4 LT	508
1da177e4 LT	509	#endif /* _NET_DST_H */