[linux-block.git] / include / net / ip6_fib.h

/*
 *	Linux INET6 implementation 
 *
 *	Authors:
 *	Pedro Roque		<roque@di.fc.ul.pt>	
 *
 *	This program is free software; you can redistribute it and/or
 *      modify it under the terms of the GNU General Public License
 *      as published by the Free Software Foundation; either version
 *      2 of the License, or (at your option) any later version.
 */

#ifndef _IP6_FIB_H
#define _IP6_FIB_H

#include <linux/ipv6_route.h>
#include <linux/rtnetlink.h>
#include <linux/spinlock.h>
#include <linux/notifier.h>
#include <net/dst.h>
#include <net/flow.h>
#include <net/netlink.h>
#include <net/inetpeer.h>
#include <net/fib_notifier.h>

#ifdef CONFIG_IPV6_MULTIPLE_TABLES
#define FIB6_TABLE_HASHSZ 256
#else
#define FIB6_TABLE_HASHSZ 1
#endif

#define RT6_DEBUG 2

#if RT6_DEBUG >= 3
#define RT6_TRACE(x...) pr_debug(x)
#else
#define RT6_TRACE(x...) do { ; } while (0)
#endif

struct rt6_info;

struct fib6_config {
	u32		fc_table;
	u32		fc_metric;
	int		fc_dst_len;
	int		fc_src_len;
	int		fc_ifindex;
	u32		fc_flags;
	u32		fc_protocol;
	u16		fc_type;        /* only 8 bits are used */
	u16		fc_delete_all_nh : 1,
			__unused : 15;

	struct in6_addr	fc_dst;
	struct in6_addr	fc_src;
	struct in6_addr	fc_prefsrc;
	struct in6_addr	fc_gateway;

	unsigned long	fc_expires;
	struct nlattr	*fc_mx;
	int		fc_mx_len;
	int		fc_mp_len;
	struct nlattr	*fc_mp;

	struct nl_info	fc_nlinfo;
	struct nlattr	*fc_encap;
	u16		fc_encap_type;
};

struct fib6_node {
	struct fib6_node __rcu	*parent;
	struct fib6_node __rcu	*left;
	struct fib6_node __rcu	*right;
#ifdef CONFIG_IPV6_SUBTREES
	struct fib6_node __rcu	*subtree;
#endif
	struct rt6_info __rcu	*leaf;

	__u16			fn_bit;		/* bit key */
	__u16			fn_flags;
	int			fn_sernum;
	struct rt6_info __rcu	*rr_ptr;
	struct rcu_head		rcu;
};

struct fib6_gc_args {
	int			timeout;
	int			more;
};

#ifndef CONFIG_IPV6_SUBTREES
#define FIB6_SUBTREE(fn)	NULL
#else
#define FIB6_SUBTREE(fn)	(rcu_dereference_protected((fn)->subtree, 1))
#endif

/*
 *	routing information
 *
 */

struct rt6key {
	struct in6_addr	addr;
	int		plen;
};

struct fib6_table;

struct rt6_exception_bucket {
	struct hlist_head	chain;
	int			depth;
};

struct rt6_exception {
	struct hlist_node	hlist;
	struct rt6_info		*rt6i;
	unsigned long		stamp;
	struct rcu_head		rcu;
};

#define FIB6_EXCEPTION_BUCKET_SIZE_SHIFT 10
#define FIB6_EXCEPTION_BUCKET_SIZE (1 << FIB6_EXCEPTION_BUCKET_SIZE_SHIFT)
#define FIB6_MAX_DEPTH 5

struct fib6_nh {
	struct in6_addr		nh_gw;
	struct net_device	*nh_dev;
	struct lwtunnel_state	*nh_lwtstate;

	unsigned int		nh_flags;
	atomic_t		nh_upper_bound;
	int			nh_weight;
};

struct rt6_info {
	struct dst_entry		dst;
	struct rt6_info __rcu		*rt6_next;
	struct rt6_info			*from;

	/*
	 * Tail elements of dst_entry (__refcnt etc.)
	 * and these elements (rarely used in hot path) are in
	 * the same cache line.
	 */
	struct fib6_table		*rt6i_table;
	struct fib6_node __rcu		*rt6i_node;

	struct in6_addr			rt6i_gateway;

	/* Multipath routes:
	 * siblings is a list of rt6_info that have the the same metric/weight,
	 * destination, but not the same gateway. nsiblings is just a cache
	 * to speed up lookup.
	 */
	struct list_head		rt6i_siblings;
	unsigned int			rt6i_nsiblings;

	atomic_t			rt6i_ref;

	/* These are in a separate cache line. */
	struct rt6key			rt6i_dst ____cacheline_aligned_in_smp;
	u32				rt6i_flags;
	struct rt6key			rt6i_src;
	struct rt6key			rt6i_prefsrc;

	struct list_head		rt6i_uncached;
	struct uncached_list		*rt6i_uncached_list;

	struct inet6_dev		*rt6i_idev;
	struct rt6_info * __percpu	*rt6i_pcpu;
	struct rt6_exception_bucket __rcu *rt6i_exception_bucket;

	u32				rt6i_metric;
	/* more non-fragment space at head required */
	unsigned short			rt6i_nfheader_len;
	u8				rt6i_protocol;
	u8				fib6_type;
	u8				exception_bucket_flushed:1,
					should_flush:1,
					dst_nocount:1,
					dst_nopolicy:1,
					dst_host:1,
					unused:3;

	unsigned long			expires;
	struct dst_metrics		*fib6_metrics;
#define fib6_pmtu		fib6_metrics->metrics[RTAX_MTU-1]
	struct fib6_nh			fib6_nh;
};

#define for_each_fib6_node_rt_rcu(fn)					\
	for (rt = rcu_dereference((fn)->leaf); rt;			\
	     rt = rcu_dereference(rt->rt6_next))

#define for_each_fib6_walker_rt(w)					\
	for (rt = (w)->leaf; rt;					\
	     rt = rcu_dereference_protected(rt->rt6_next, 1))

static inline struct inet6_dev *ip6_dst_idev(struct dst_entry *dst)
{
	return ((struct rt6_info *)dst)->rt6i_idev;
}

static inline void fib6_clean_expires(struct rt6_info *f6i)
{
	f6i->rt6i_flags &= ~RTF_EXPIRES;
	f6i->expires = 0;
}

static inline void fib6_set_expires(struct rt6_info *f6i,
				    unsigned long expires)
{
	f6i->expires = expires;
	f6i->rt6i_flags |= RTF_EXPIRES;
}

static inline bool fib6_check_expired(const struct rt6_info *f6i)
{
	if (f6i->rt6i_flags & RTF_EXPIRES)
		return time_after(jiffies, f6i->expires);
	return false;
}

static inline void rt6_clean_expires(struct rt6_info *rt)
{
	rt->rt6i_flags &= ~RTF_EXPIRES;
	rt->dst.expires = 0;
}

static inline void rt6_set_expires(struct rt6_info *rt, unsigned long expires)
{
	rt->dst.expires = expires;
	rt->rt6i_flags |= RTF_EXPIRES;
}

static inline void rt6_update_expires(struct rt6_info *rt0, int timeout)
{
	if (!(rt0->rt6i_flags & RTF_EXPIRES) && rt0->from)
		rt0->dst.expires = rt0->from->expires;

	dst_set_expires(&rt0->dst, timeout);
	rt0->rt6i_flags |= RTF_EXPIRES;
}

/* Function to safely get fn->sernum for passed in rt
 * and store result in passed in cookie.
 * Return true if we can get cookie safely
 * Return false if not
 */
static inline bool rt6_get_cookie_safe(const struct rt6_info *rt,
				       u32 *cookie)
{
	struct fib6_node *fn;
	bool status = false;

	rcu_read_lock();
	fn = rcu_dereference(rt->rt6i_node);

	if (fn) {
		*cookie = fn->fn_sernum;
		/* pairs with smp_wmb() in fib6_update_sernum_upto_root() */
		smp_rmb();
		status = true;
	}

	rcu_read_unlock();
	return status;
}

static inline u32 rt6_get_cookie(const struct rt6_info *rt)
{
	u32 cookie = 0;

	if (rt->rt6i_flags & RTF_PCPU ||
	    (unlikely(!list_empty(&rt->rt6i_uncached)) && rt->from))
		rt = rt->from;

	rt6_get_cookie_safe(rt, &cookie);

	return cookie;
}

static inline void ip6_rt_put(struct rt6_info *rt)
{
	/* dst_release() accepts a NULL parameter.
	 * We rely on dst being first structure in struct rt6_info
	 */
	BUILD_BUG_ON(offsetof(struct rt6_info, dst) != 0);
	dst_release(&rt->dst);
}

void rt6_free_pcpu(struct rt6_info *non_pcpu_rt);

static inline void rt6_hold(struct rt6_info *rt)
{
	atomic_inc(&rt->rt6i_ref);
}

static inline void rt6_release(struct rt6_info *rt)
{
	if (atomic_dec_and_test(&rt->rt6i_ref)) {
		rt6_free_pcpu(rt);
		dst_dev_put(&rt->dst);
		dst_release(&rt->dst);
	}
}

enum fib6_walk_state {
#ifdef CONFIG_IPV6_SUBTREES
	FWS_S,
#endif
	FWS_L,
	FWS_R,
	FWS_C,
	FWS_U
};

struct fib6_walker {
	struct list_head lh;
	struct fib6_node *root, *node;
	struct rt6_info *leaf;
	enum fib6_walk_state state;
	unsigned int skip;
	unsigned int count;
	int (*func)(struct fib6_walker *);
	void *args;
};

struct rt6_statistics {
	__u32		fib_nodes;		/* all fib6 nodes */
	__u32		fib_route_nodes;	/* intermediate nodes */
	__u32		fib_rt_entries;		/* rt entries in fib table */
	__u32		fib_rt_cache;		/* cached rt entries in exception table */
	__u32		fib_discarded_routes;	/* total number of routes delete */

	/* The following stats are not protected by any lock */
	atomic_t	fib_rt_alloc;		/* total number of routes alloced */
	atomic_t	fib_rt_uncache;		/* rt entries in uncached list */
};

#define RTN_TL_ROOT	0x0001
#define RTN_ROOT	0x0002		/* tree root node		*/
#define RTN_RTINFO	0x0004		/* node with valid routing info	*/

/*
 *	priority levels (or metrics)
 *
 */


struct fib6_table {
	struct hlist_node	tb6_hlist;
	u32			tb6_id;
	spinlock_t		tb6_lock;
	struct fib6_node	tb6_root;
	struct inet_peer_base	tb6_peers;
	unsigned int		flags;
	unsigned int		fib_seq;
#define RT6_TABLE_HAS_DFLT_ROUTER	BIT(0)
};

#define RT6_TABLE_UNSPEC	RT_TABLE_UNSPEC
#define RT6_TABLE_MAIN		RT_TABLE_MAIN
#define RT6_TABLE_DFLT		RT6_TABLE_MAIN
#define RT6_TABLE_INFO		RT6_TABLE_MAIN
#define RT6_TABLE_PREFIX	RT6_TABLE_MAIN

#ifdef CONFIG_IPV6_MULTIPLE_TABLES
#define FIB6_TABLE_MIN		1
#define FIB6_TABLE_MAX		RT_TABLE_MAX
#define RT6_TABLE_LOCAL		RT_TABLE_LOCAL
#else
#define FIB6_TABLE_MIN		RT_TABLE_MAIN
#define FIB6_TABLE_MAX		FIB6_TABLE_MIN
#define RT6_TABLE_LOCAL		RT6_TABLE_MAIN
#endif

typedef struct rt6_info *(*pol_lookup_t)(struct net *,
					 struct fib6_table *,
					 struct flowi6 *,
					 const struct sk_buff *, int);

struct fib6_entry_notifier_info {
	struct fib_notifier_info info; /* must be first */
	struct rt6_info *rt;
};

/*
 *	exported functions
 */

struct fib6_table *fib6_get_table(struct net *net, u32 id);
struct fib6_table *fib6_new_table(struct net *net, u32 id);
struct dst_entry *fib6_rule_lookup(struct net *net, struct flowi6 *fl6,
				   const struct sk_buff *skb,
				   int flags, pol_lookup_t lookup);

struct fib6_node *fib6_lookup(struct fib6_node *root,
			      const struct in6_addr *daddr,
			      const struct in6_addr *saddr);

struct fib6_node *fib6_locate(struct fib6_node *root,
			      const struct in6_addr *daddr, int dst_len,
			      const struct in6_addr *saddr, int src_len,
			      bool exact_match);

void fib6_clean_all(struct net *net, int (*func)(struct rt6_info *, void *arg),
		    void *arg);

int fib6_add(struct fib6_node *root, struct rt6_info *rt,
	     struct nl_info *info, struct netlink_ext_ack *extack);
int fib6_del(struct rt6_info *rt, struct nl_info *info);

void inet6_rt_notify(int event, struct rt6_info *rt, struct nl_info *info,
		     unsigned int flags);

void fib6_run_gc(unsigned long expires, struct net *net, bool force);

void fib6_gc_cleanup(void);

int fib6_init(void);

int ipv6_route_open(struct inode *inode, struct file *file);

int call_fib6_notifier(struct notifier_block *nb, struct net *net,
		       enum fib_event_type event_type,
		       struct fib_notifier_info *info);
int call_fib6_notifiers(struct net *net, enum fib_event_type event_type,
			struct fib_notifier_info *info);

int __net_init fib6_notifier_init(struct net *net);
void __net_exit fib6_notifier_exit(struct net *net);

unsigned int fib6_tables_seq_read(struct net *net);
int fib6_tables_dump(struct net *net, struct notifier_block *nb);

void fib6_update_sernum(struct net *net, struct rt6_info *rt);
void fib6_update_sernum_upto_root(struct net *net, struct rt6_info *rt);

void fib6_metric_set(struct rt6_info *f6i, int metric, u32 val);
static inline bool fib6_metric_locked(struct rt6_info *f6i, int metric)
{
	return !!(f6i->fib6_metrics->metrics[RTAX_LOCK - 1] & (1 << metric));
}

#ifdef CONFIG_IPV6_MULTIPLE_TABLES
int fib6_rules_init(void);
void fib6_rules_cleanup(void);
bool fib6_rule_default(const struct fib_rule *rule);
int fib6_rules_dump(struct net *net, struct notifier_block *nb);
unsigned int fib6_rules_seq_read(struct net *net);

static inline bool fib6_rules_early_flow_dissect(struct net *net,
						 struct sk_buff *skb,
						 struct flowi6 *fl6,
						 struct flow_keys *flkeys)
{
	unsigned int flag = FLOW_DISSECTOR_F_STOP_AT_ENCAP;

	if (!net->ipv6.fib6_rules_require_fldissect)
		return false;

	skb_flow_dissect_flow_keys(skb, flkeys, flag);
	fl6->fl6_sport = flkeys->ports.src;
	fl6->fl6_dport = flkeys->ports.dst;
	fl6->flowi6_proto = flkeys->basic.ip_proto;

	return true;
}
#else
static inline int               fib6_rules_init(void)
{
	return 0;
}
static inline void              fib6_rules_cleanup(void)
{
	return ;
}
static inline bool fib6_rule_default(const struct fib_rule *rule)
{
	return true;
}
static inline int fib6_rules_dump(struct net *net, struct notifier_block *nb)
{
	return 0;
}
static inline unsigned int fib6_rules_seq_read(struct net *net)
{
	return 0;
}
static inline bool fib6_rules_early_flow_dissect(struct net *net,
						 struct sk_buff *skb,
						 struct flowi6 *fl6,
						 struct flow_keys *flkeys)
{
	return false;
}
#endif
#endif
Commit	Line	Data
1da177e4 LT	1	/*
	2	* Linux INET6 implementation
	3	*
	4	* Authors:
	5	* Pedro Roque <roque@di.fc.ul.pt>
	6	*
	7	* This program is free software; you can redistribute it and/or
	8	* modify it under the terms of the GNU General Public License
	9	* as published by the Free Software Foundation; either version
	10	* 2 of the License, or (at your option) any later version.
	11	*/
	12
	13	#ifndef _IP6_FIB_H
	14	#define _IP6_FIB_H
	15
1da177e4	16	#include <linux/ipv6_route.h>
1da177e4 LT	17	#include <linux/rtnetlink.h>
1da177e4 LT	18	#include <linux/spinlock.h>
16ab6d7d	19	#include <linux/notifier.h>
86872cb5 TG	20	#include <net/dst.h>
	21	#include <net/flow.h>
	22	#include <net/netlink.h>
b3419363	23	#include <net/inetpeer.h>
16ab6d7d	24	#include <net/fib_notifier.h>
1da177e4	25
a33bc5c1 NH	26	#ifdef CONFIG_IPV6_MULTIPLE_TABLES
	27	#define FIB6_TABLE_HASHSZ 256
	28	#else
	29	#define FIB6_TABLE_HASHSZ 1
	30	#endif
	31
c757faa8 WW	32	#define RT6_DEBUG 2
	33
	34	#if RT6_DEBUG >= 3
	35	#define RT6_TRACE(x...) pr_debug(x)
	36	#else
	37	#define RT6_TRACE(x...) do { ; } while (0)
	38	#endif
	39
1da177e4 LT	40	struct rt6_info;
1da177e4 LT	41
fd2c3ef7	42	struct fib6_config {
86872cb5 TG	43	u32 fc_table;
	44	u32 fc_metric;
	45	int fc_dst_len;
	46	int fc_src_len;
	47	int fc_ifindex;
	48	u32 fc_flags;
	49	u32 fc_protocol;
0ae81335 DA	50	u16 fc_type; /* only 8 bits are used */
	51	u16 fc_delete_all_nh : 1,
	52	__unused : 15;
86872cb5 TG	53
	54	struct in6_addr fc_dst;
	55	struct in6_addr fc_src;
c3968a85	56	struct in6_addr fc_prefsrc;
86872cb5 TG	57	struct in6_addr fc_gateway;
	58
	59	unsigned long fc_expires;
	60	struct nlattr *fc_mx;
	61	int fc_mx_len;
51ebd318 ND	62	int fc_mp_len;
51ebd318 ND	63	struct nlattr *fc_mp;
86872cb5 TG	64
86872cb5 TG	65	struct nl_info fc_nlinfo;
19e42e45 RP	66	struct nlattr *fc_encap;
19e42e45 RP	67	u16 fc_encap_type;
86872cb5 TG	68	};
86872cb5 TG	69
fd2c3ef7	70	struct fib6_node {
66f5d6ce WW	71	struct fib6_node __rcu *parent;
	72	struct fib6_node __rcu *left;
	73	struct fib6_node __rcu *right;
8bce65b9	74	#ifdef CONFIG_IPV6_SUBTREES
66f5d6ce	75	struct fib6_node __rcu *subtree;
8bce65b9	76	#endif
66f5d6ce	77	struct rt6_info __rcu *leaf;
1da177e4 LT	78
	79	__u16 fn_bit; /* bit key */
	80	__u16 fn_flags;
42b18706	81	int fn_sernum;
66f5d6ce	82	struct rt6_info __rcu *rr_ptr;
c5cff856	83	struct rcu_head rcu;
1da177e4 LT	84	};
1da177e4 LT	85
c757faa8 WW	86	struct fib6_gc_args {
	87	int timeout;
	88	int more;
	89	};
	90
7fc33165 YH	91	#ifndef CONFIG_IPV6_SUBTREES
	92	#define FIB6_SUBTREE(fn) NULL
	93	#else
66f5d6ce	94	#define FIB6_SUBTREE(fn) (rcu_dereference_protected((fn)->subtree, 1))
7fc33165	95	#endif
1da177e4 LT	96
	97	/*
	98	* routing information
	99	*
	100	*/
	101
fd2c3ef7	102	struct rt6key {
1da177e4 LT	103	struct in6_addr addr;
	104	int plen;
	105	};
	106
c71099ac TG	107	struct fib6_table;
c71099ac TG	108
35732d01 WW	109	struct rt6_exception_bucket {
	110	struct hlist_head chain;
	111	int depth;
	112	};
	113
	114	struct rt6_exception {
	115	struct hlist_node hlist;
	116	struct rt6_info *rt6i;
	117	unsigned long stamp;
	118	struct rcu_head rcu;
	119	};
	120
	121	#define FIB6_EXCEPTION_BUCKET_SIZE_SHIFT 10
	122	#define FIB6_EXCEPTION_BUCKET_SIZE (1 << FIB6_EXCEPTION_BUCKET_SIZE_SHIFT)
	123	#define FIB6_MAX_DEPTH 5
	124
5e670d84 DA	125	struct fib6_nh {
	126	struct in6_addr nh_gw;
	127	struct net_device *nh_dev;
	128	struct lwtunnel_state *nh_lwtstate;
	129
	130	unsigned int nh_flags;
	131	atomic_t nh_upper_bound;
	132	int nh_weight;
	133	};
	134
fd2c3ef7	135	struct rt6_info {
d8d1f30b	136	struct dst_entry dst;
071fb37e	137	struct rt6_info __rcu *rt6_next;
3a2232e9	138	struct rt6_info *from;
1da177e4	139
bd2c77a0 YH	140	/*
	141	* Tail elements of dst_entry (__refcnt etc.)
	142	* and these elements (rarely used in hot path) are in
	143	* the same cache line.
	144	*/
	145	struct fib6_table *rt6i_table;
4e587ea7	146	struct fib6_node __rcu *rt6i_node;
1da177e4 LT	147
1da177e4 LT	148	struct in6_addr rt6i_gateway;
1da177e4	149
51ebd318 ND	150	/* Multipath routes:
	151	* siblings is a list of rt6_info that have the the same metric/weight,
	152	* destination, but not the same gateway. nsiblings is just a cache
	153	* to speed up lookup.
	154	*/
	155	struct list_head rt6i_siblings;
	156	unsigned int rt6i_nsiblings;
	157
bd2c77a0	158	atomic_t rt6i_ref;
a47ed4cd	159
bd2c77a0 YH	160	/* These are in a separate cache line. */
	161	struct rt6key rt6i_dst ____cacheline_aligned_in_smp;
	162	u32 rt6i_flags;
	163	struct rt6key rt6i_src;
c3968a85	164	struct rt6key rt6i_prefsrc;
b4ce9277	165
8d0b94af MKL	166	struct list_head rt6i_uncached;
	167	struct uncached_list *rt6i_uncached_list;
	168
bd2c77a0	169	struct inet6_dev *rt6i_idev;
d52d3997	170	struct rt6_info * __percpu *rt6i_pcpu;
35732d01	171	struct rt6_exception_bucket __rcu *rt6i_exception_bucket;
b4ce9277	172
705f1c86	173	u32 rt6i_metric;
bd2c77a0 YH	174	/* more non-fragment space at head required */
bd2c77a0 YH	175	unsigned short rt6i_nfheader_len;
bd2c77a0	176	u8 rt6i_protocol;
e8478e80	177	u8 fib6_type;
35732d01	178	u8 exception_bucket_flushed:1,
a2c554d3	179	should_flush:1,
3b6761d1 DA	180	dst_nocount:1,
	181	dst_nopolicy:1,
	182	dst_host:1,
	183	unused:3;
5e670d84	184
14895687	185	unsigned long expires;
d4ead6b3 DA	186	struct dst_metrics *fib6_metrics;
d4ead6b3 DA	187	#define fib6_pmtu fib6_metrics->metrics[RTAX_MTU-1]
5e670d84	188	struct fib6_nh fib6_nh;
1da177e4 LT	189	};
1da177e4 LT	190
66f5d6ce WW	191	#define for_each_fib6_node_rt_rcu(fn) \
66f5d6ce WW	192	for (rt = rcu_dereference((fn)->leaf); rt; \
071fb37e	193	rt = rcu_dereference(rt->rt6_next))
66f5d6ce WW	194
	195	#define for_each_fib6_walker_rt(w) \
	196	for (rt = (w)->leaf; rt; \
071fb37e	197	rt = rcu_dereference_protected(rt->rt6_next, 1))
66f5d6ce	198
7a3025b1 YH	199	static inline struct inet6_dev ip6_dst_idev(struct dst_entry dst)
	200	{
	201	return ((struct rt6_info *)dst)->rt6i_idev;
	202	}
	203
14895687 DA	204	static inline void fib6_clean_expires(struct rt6_info *f6i)
	205	{
	206	f6i->rt6i_flags &= ~RTF_EXPIRES;
	207	f6i->expires = 0;
	208	}
	209
	210	static inline void fib6_set_expires(struct rt6_info *f6i,
	211	unsigned long expires)
	212	{
	213	f6i->expires = expires;
	214	f6i->rt6i_flags \|= RTF_EXPIRES;
	215	}
	216
	217	static inline bool fib6_check_expired(const struct rt6_info *f6i)
	218	{
	219	if (f6i->rt6i_flags & RTF_EXPIRES)
	220	return time_after(jiffies, f6i->expires);
	221	return false;
	222	}
	223
1716a961 G	224	static inline void rt6_clean_expires(struct rt6_info *rt)
1716a961 G	225	{
1716a961	226	rt->rt6i_flags &= ~RTF_EXPIRES;
01ba16d6	227	rt->dst.expires = 0;
1716a961 G	228	}
	229
	230	static inline void rt6_set_expires(struct rt6_info *rt, unsigned long expires)
	231	{
1716a961	232	rt->dst.expires = expires;
ecd98837	233	rt->rt6i_flags \|= RTF_EXPIRES;
1716a961 G	234	}
1716a961 G	235
ecd98837	236	static inline void rt6_update_expires(struct rt6_info *rt0, int timeout)
1716a961	237	{
14895687 DA	238	if (!(rt0->rt6i_flags & RTF_EXPIRES) && rt0->from)
14895687 DA	239	rt0->dst.expires = rt0->from->expires;
ecd98837	240
ecd98837 YH	241	dst_set_expires(&rt0->dst, timeout);
ecd98837 YH	242	rt0->rt6i_flags \|= RTF_EXPIRES;
1716a961	243	}
b197df4f	244
c5cff856 WW	245	/* Function to safely get fn->sernum for passed in rt
	246	* and store result in passed in cookie.
	247	* Return true if we can get cookie safely
	248	* Return false if not
	249	*/
	250	static inline bool rt6_get_cookie_safe(const struct rt6_info *rt,
	251	u32 *cookie)
	252	{
	253	struct fib6_node *fn;
	254	bool status = false;
	255
	256	rcu_read_lock();
	257	fn = rcu_dereference(rt->rt6i_node);
	258
	259	if (fn) {
	260	*cookie = fn->fn_sernum;
bbd63f06 WW	261	/* pairs with smp_wmb() in fib6_update_sernum_upto_root() */
bbd63f06 WW	262	smp_rmb();
c5cff856 WW	263	status = true;
	264	}
	265
	266	rcu_read_unlock();
	267	return status;
	268	}
	269
b197df4f MKL	270	static inline u32 rt6_get_cookie(const struct rt6_info *rt)
b197df4f MKL	271	{
c5cff856 WW	272	u32 cookie = 0;
c5cff856 WW	273
02bcf4e0	274	if (rt->rt6i_flags & RTF_PCPU \|\|
3a2232e9 DM	275	(unlikely(!list_empty(&rt->rt6i_uncached)) && rt->from))
3a2232e9 DM	276	rt = rt->from;
3da59bd9	277
c5cff856 WW	278	rt6_get_cookie_safe(rt, &cookie);
	279
	280	return cookie;
b197df4f	281	}
1716a961	282
94e187c0 AW	283	static inline void ip6_rt_put(struct rt6_info *rt)
	284	{
	285	/* dst_release() accepts a NULL parameter.
	286	* We rely on dst being first structure in struct rt6_info
	287	*/
	288	BUILD_BUG_ON(offsetof(struct rt6_info, dst) != 0);
	289	dst_release(&rt->dst);
	290	}
	291
a460aa83 IS	292	void rt6_free_pcpu(struct rt6_info *non_pcpu_rt);
	293
	294	static inline void rt6_hold(struct rt6_info *rt)
	295	{
	296	atomic_inc(&rt->rt6i_ref);
	297	}
	298
	299	static inline void rt6_release(struct rt6_info *rt)
	300	{
	301	if (atomic_dec_and_test(&rt->rt6i_ref)) {
	302	rt6_free_pcpu(rt);
	303	dst_dev_put(&rt->dst);
	304	dst_release(&rt->dst);
	305	}
	306	}
	307
94b2cfe0 HFS	308	enum fib6_walk_state {
	309	#ifdef CONFIG_IPV6_SUBTREES
	310	FWS_S,
	311	#endif
	312	FWS_L,
	313	FWS_R,
	314	FWS_C,
	315	FWS_U
	316	};
	317
	318	struct fib6_walker {
bbef49da	319	struct list_head lh;
1da177e4 LT	320	struct fib6_node root, node;
1da177e4 LT	321	struct rt6_info *leaf;
94b2cfe0	322	enum fib6_walk_state state;
2bec5a36 PM	323	unsigned int skip;
2bec5a36 PM	324	unsigned int count;
94b2cfe0	325	int (func)(struct fib6_walker );
1da177e4 LT	326	void *args;
	327	};
	328
1da177e4	329	struct rt6_statistics {
81eb8447 WW	330	__u32 fib_nodes; /* all fib6 nodes */
	331	__u32 fib_route_nodes; /* intermediate nodes */
	332	__u32 fib_rt_entries; /* rt entries in fib table */
	333	__u32 fib_rt_cache; /* cached rt entries in exception table */
	334	__u32 fib_discarded_routes; /* total number of routes delete */
	335
	336	/* The following stats are not protected by any lock */
	337	atomic_t fib_rt_alloc; /* total number of routes alloced */
	338	atomic_t fib_rt_uncache; /* rt entries in uncached list */
1da177e4 LT	339	};
	340
	341	#define RTN_TL_ROOT 0x0001
	342	#define RTN_ROOT 0x0002 /* tree root node */
	343	#define RTN_RTINFO 0x0004 /* node with valid routing info */
	344
	345	/*
	346	* priority levels (or metrics)
	347	*
	348	*/
	349
1da177e4	350
c71099ac TG	351	struct fib6_table {
	352	struct hlist_node tb6_hlist;
	353	u32 tb6_id;
66f5d6ce	354	spinlock_t tb6_lock;
c71099ac	355	struct fib6_node tb6_root;
8e773277	356	struct inet_peer_base tb6_peers;
830218c1	357	unsigned int flags;
e1ee0a5b	358	unsigned int fib_seq;
830218c1	359	#define RT6_TABLE_HAS_DFLT_ROUTER BIT(0)
c71099ac TG	360	};
	361
	362	#define RT6_TABLE_UNSPEC RT_TABLE_UNSPEC
	363	#define RT6_TABLE_MAIN RT_TABLE_MAIN
c71099ac TG	364	#define RT6_TABLE_DFLT RT6_TABLE_MAIN
	365	#define RT6_TABLE_INFO RT6_TABLE_MAIN
	366	#define RT6_TABLE_PREFIX RT6_TABLE_MAIN
	367
	368	#ifdef CONFIG_IPV6_MULTIPLE_TABLES
	369	#define FIB6_TABLE_MIN 1
	370	#define FIB6_TABLE_MAX RT_TABLE_MAX
101367c2	371	#define RT6_TABLE_LOCAL RT_TABLE_LOCAL
c71099ac TG	372	#else
	373	#define FIB6_TABLE_MIN RT_TABLE_MAIN
	374	#define FIB6_TABLE_MAX FIB6_TABLE_MIN
101367c2	375	#define RT6_TABLE_LOCAL RT6_TABLE_MAIN
c71099ac TG	376	#endif
c71099ac TG	377
8ed67789 DL	378	typedef struct rt6_info (pol_lookup_t)(struct net *,
8ed67789 DL	379	struct fib6_table *,
b75cc8f9 DA	380	struct flowi6 *,
b75cc8f9 DA	381	const struct sk_buff *, int);
1da177e4	382
df77fe4d IS	383	struct fib6_entry_notifier_info {
	384	struct fib_notifier_info info; /* must be first */
	385	struct rt6_info *rt;
	386	};
	387
1da177e4 LT	388	/*
	389	* exported functions
	390	*/
	391
5c3a0fd7 JP	392	struct fib6_table fib6_get_table(struct net net, u32 id);
	393	struct fib6_table fib6_new_table(struct net net, u32 id);
	394	struct dst_entry fib6_rule_lookup(struct net net, struct flowi6 *fl6,
b75cc8f9	395	const struct sk_buff *skb,
5c3a0fd7	396	int flags, pol_lookup_t lookup);
c71099ac	397
5c3a0fd7 JP	398	struct fib6_node fib6_lookup(struct fib6_node root,
	399	const struct in6_addr *daddr,
	400	const struct in6_addr *saddr);
1da177e4	401
5c3a0fd7 JP	402	struct fib6_node fib6_locate(struct fib6_node root,
5c3a0fd7 JP	403	const struct in6_addr *daddr, int dst_len,
38fbeeee WW	404	const struct in6_addr *saddr, int src_len,
38fbeeee WW	405	bool exact_match);
1da177e4	406
5c3a0fd7	407	void fib6_clean_all(struct net net, int (func)(struct rt6_info , void arg),
0c3584d5	408	void *arg);
c71099ac	409
e715b6d3	410	int fib6_add(struct fib6_node root, struct rt6_info rt,
d4ead6b3	411	struct nl_info info, struct netlink_ext_ack extack);
5c3a0fd7	412	int fib6_del(struct rt6_info rt, struct nl_info info);
1da177e4	413
37a1d361 RP	414	void inet6_rt_notify(int event, struct rt6_info rt, struct nl_info info,
37a1d361 RP	415	unsigned int flags);
1da177e4	416
5c3a0fd7	417	void fib6_run_gc(unsigned long expires, struct net *net, bool force);
1da177e4	418
5c3a0fd7	419	void fib6_gc_cleanup(void);
1da177e4	420
5c3a0fd7	421	int fib6_init(void);
101367c2	422
8d2ca1d7 HFS	423	int ipv6_route_open(struct inode inode, struct file file);
8d2ca1d7 HFS	424
16ab6d7d IS	425	int call_fib6_notifier(struct notifier_block nb, struct net net,
	426	enum fib_event_type event_type,
	427	struct fib_notifier_info *info);
	428	int call_fib6_notifiers(struct net *net, enum fib_event_type event_type,
	429	struct fib_notifier_info *info);
	430
	431	int __net_init fib6_notifier_init(struct net *net);
	432	void __net_exit fib6_notifier_exit(struct net *net);
	433
e1ee0a5b IS	434	unsigned int fib6_tables_seq_read(struct net *net);
	435	int fib6_tables_dump(struct net net, struct notifier_block nb);
	436
7aef6859	437	void fib6_update_sernum(struct net net, struct rt6_info rt);
4a8e56ee	438	void fib6_update_sernum_upto_root(struct net net, struct rt6_info rt);
180ca444	439
d4ead6b3 DA	440	void fib6_metric_set(struct rt6_info *f6i, int metric, u32 val);
	441	static inline bool fib6_metric_locked(struct rt6_info *f6i, int metric)
	442	{
	443	return !!(f6i->fib6_metrics->metrics[RTAX_LOCK - 1] & (1 << metric));
	444	}
	445
7e5449c2	446	#ifdef CONFIG_IPV6_MULTIPLE_TABLES
5c3a0fd7 JP	447	int fib6_rules_init(void);
5c3a0fd7 JP	448	void fib6_rules_cleanup(void);
e3ea9731	449	bool fib6_rule_default(const struct fib_rule *rule);
dcb18f76 IS	450	int fib6_rules_dump(struct net net, struct notifier_block nb);
dcb18f76 IS	451	unsigned int fib6_rules_seq_read(struct net *net);
5e5d6fed RP	452
	453	static inline bool fib6_rules_early_flow_dissect(struct net *net,
	454	struct sk_buff *skb,
	455	struct flowi6 *fl6,
	456	struct flow_keys *flkeys)
	457	{
	458	unsigned int flag = FLOW_DISSECTOR_F_STOP_AT_ENCAP;
	459
	460	if (!net->ipv6.fib6_rules_require_fldissect)
	461	return false;
	462
	463	skb_flow_dissect_flow_keys(skb, flkeys, flag);
	464	fl6->fl6_sport = flkeys->ports.src;
	465	fl6->fl6_dport = flkeys->ports.dst;
	466	fl6->flowi6_proto = flkeys->basic.ip_proto;
	467
	468	return true;
	469	}
7e5449c2 DL	470	#else
	471	static inline int fib6_rules_init(void)
	472	{
	473	return 0;
	474	}
	475	static inline void fib6_rules_cleanup(void)
	476	{
	477	return ;
	478	}
e3ea9731 IS	479	static inline bool fib6_rule_default(const struct fib_rule *rule)
	480	{
	481	return true;
	482	}
dcb18f76 IS	483	static inline int fib6_rules_dump(struct net net, struct notifier_block nb)
	484	{
	485	return 0;
	486	}
	487	static inline unsigned int fib6_rules_seq_read(struct net *net)
	488	{
	489	return 0;
	490	}
5e5d6fed RP	491	static inline bool fib6_rules_early_flow_dissect(struct net *net,
	492	struct sk_buff *skb,
	493	struct flowi6 *fl6,
	494	struct flow_keys *flkeys)
	495	{
	496	return false;
	497	}
7e5449c2	498	#endif
1da177e4	499	#endif