[mirror_ubuntu-bionic-kernel.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

struct mx6_config {
	const u32 *mx;
	DECLARE_BITMAP(mx_valid, RTAX_MAX);
};

/*
 *	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 rt6_info {
	struct dst_entry		dst;

	/*
	 * 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;

	unsigned int			rt6i_nh_flags;

	/* 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;
	u32				rt6i_pmtu;
	/* more non-fragment space at head required */
	unsigned short			rt6i_nfheader_len;
	u8				rt6i_protocol;
	u8				exception_bucket_flushed:1,
					unused:7;
};

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

#define for_each_fib6_walker_rt(w)					\
	for (rt = (w)->leaf; rt;					\
	     rt = rcu_dereference_protected(rt->dst.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 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)
{
	struct rt6_info *rt;

	for (rt = rt0; rt && !(rt->rt6i_flags & RTF_EXPIRES);
	     rt = (struct rt6_info *)rt->dst.from);
	if (rt && rt != rt0)
		rt0->dst.expires = rt->dst.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->dst.from))
		rt = (struct rt6_info *)(rt->dst.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 *, 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,
				   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 mx6_config *mxc,
	     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 rt6_info *rt);

#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);
#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;
}
#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	96
e715b6d3 FW	97	struct mx6_config {
	98	const u32 *mx;
	99	DECLARE_BITMAP(mx_valid, RTAX_MAX);
	100	};
	101
1da177e4 LT	102	/*
	103	* routing information
	104	*
	105	*/
	106
fd2c3ef7	107	struct rt6key {
1da177e4 LT	108	struct in6_addr addr;
	109	int plen;
	110	};
	111
c71099ac TG	112	struct fib6_table;
c71099ac TG	113
35732d01 WW	114	struct rt6_exception_bucket {
	115	struct hlist_head chain;
	116	int depth;
	117	};
	118
	119	struct rt6_exception {
	120	struct hlist_node hlist;
	121	struct rt6_info *rt6i;
	122	unsigned long stamp;
	123	struct rcu_head rcu;
	124	};
	125
	126	#define FIB6_EXCEPTION_BUCKET_SIZE_SHIFT 10
	127	#define FIB6_EXCEPTION_BUCKET_SIZE (1 << FIB6_EXCEPTION_BUCKET_SIZE_SHIFT)
	128	#define FIB6_MAX_DEPTH 5
	129
fd2c3ef7	130	struct rt6_info {
d8d1f30b	131	struct dst_entry dst;
1da177e4	132
bd2c77a0 YH	133	/*
	134	* Tail elements of dst_entry (__refcnt etc.)
	135	* and these elements (rarely used in hot path) are in
	136	* the same cache line.
	137	*/
	138	struct fib6_table *rt6i_table;
4e587ea7	139	struct fib6_node __rcu *rt6i_node;
1da177e4 LT	140
1da177e4 LT	141	struct in6_addr rt6i_gateway;
1da177e4	142
51ebd318 ND	143	/* Multipath routes:
	144	* siblings is a list of rt6_info that have the the same metric/weight,
	145	* destination, but not the same gateway. nsiblings is just a cache
	146	* to speed up lookup.
	147	*/
	148	struct list_head rt6i_siblings;
	149	unsigned int rt6i_nsiblings;
	150
bd2c77a0	151	atomic_t rt6i_ref;
a47ed4cd	152
fe400799 IS	153	unsigned int rt6i_nh_flags;
fe400799 IS	154
bd2c77a0 YH	155	/* These are in a separate cache line. */
	156	struct rt6key rt6i_dst ____cacheline_aligned_in_smp;
	157	u32 rt6i_flags;
	158	struct rt6key rt6i_src;
c3968a85	159	struct rt6key rt6i_prefsrc;
b4ce9277	160
8d0b94af MKL	161	struct list_head rt6i_uncached;
	162	struct uncached_list *rt6i_uncached_list;
	163
bd2c77a0	164	struct inet6_dev *rt6i_idev;
d52d3997	165	struct rt6_info * __percpu *rt6i_pcpu;
35732d01	166	struct rt6_exception_bucket __rcu *rt6i_exception_bucket;
b4ce9277	167
705f1c86	168	u32 rt6i_metric;
4b32b5ad	169	u32 rt6i_pmtu;
bd2c77a0 YH	170	/* more non-fragment space at head required */
bd2c77a0 YH	171	unsigned short rt6i_nfheader_len;
bd2c77a0	172	u8 rt6i_protocol;
35732d01 WW	173	u8 exception_bucket_flushed:1,
35732d01 WW	174	unused:7;
1da177e4 LT	175	};
1da177e4 LT	176
66f5d6ce WW	177	#define for_each_fib6_node_rt_rcu(fn) \
	178	for (rt = rcu_dereference((fn)->leaf); rt; \
	179	rt = rcu_dereference(rt->dst.rt6_next))
	180
	181	#define for_each_fib6_walker_rt(w) \
	182	for (rt = (w)->leaf; rt; \
	183	rt = rcu_dereference_protected(rt->dst.rt6_next, 1))
	184
7a3025b1 YH	185	static inline struct inet6_dev ip6_dst_idev(struct dst_entry dst)
	186	{
	187	return ((struct rt6_info *)dst)->rt6i_idev;
	188	}
	189
1716a961 G	190	static inline void rt6_clean_expires(struct rt6_info *rt)
1716a961 G	191	{
1716a961	192	rt->rt6i_flags &= ~RTF_EXPIRES;
01ba16d6	193	rt->dst.expires = 0;
1716a961 G	194	}
	195
	196	static inline void rt6_set_expires(struct rt6_info *rt, unsigned long expires)
	197	{
1716a961	198	rt->dst.expires = expires;
ecd98837	199	rt->rt6i_flags \|= RTF_EXPIRES;
1716a961 G	200	}
1716a961 G	201
ecd98837	202	static inline void rt6_update_expires(struct rt6_info *rt0, int timeout)
1716a961	203	{
ecd98837 YH	204	struct rt6_info *rt;
	205
	206	for (rt = rt0; rt && !(rt->rt6i_flags & RTF_EXPIRES);
	207	rt = (struct rt6_info *)rt->dst.from);
	208	if (rt && rt != rt0)
	209	rt0->dst.expires = rt->dst.expires;
	210
	211	dst_set_expires(&rt0->dst, timeout);
	212	rt0->rt6i_flags \|= RTF_EXPIRES;
1716a961	213	}
b197df4f	214
c5cff856 WW	215	/* Function to safely get fn->sernum for passed in rt
	216	* and store result in passed in cookie.
	217	* Return true if we can get cookie safely
	218	* Return false if not
	219	*/
	220	static inline bool rt6_get_cookie_safe(const struct rt6_info *rt,
	221	u32 *cookie)
	222	{
	223	struct fib6_node *fn;
	224	bool status = false;
	225
	226	rcu_read_lock();
	227	fn = rcu_dereference(rt->rt6i_node);
	228
	229	if (fn) {
	230	*cookie = fn->fn_sernum;
bbd63f06 WW	231	/* pairs with smp_wmb() in fib6_update_sernum_upto_root() */
bbd63f06 WW	232	smp_rmb();
c5cff856 WW	233	status = true;
	234	}
	235
	236	rcu_read_unlock();
	237	return status;
	238	}
	239
b197df4f MKL	240	static inline u32 rt6_get_cookie(const struct rt6_info *rt)
b197df4f MKL	241	{
c5cff856 WW	242	u32 cookie = 0;
c5cff856 WW	243
02bcf4e0	244	if (rt->rt6i_flags & RTF_PCPU \|\|
a4c2fd7f	245	(unlikely(!list_empty(&rt->rt6i_uncached)) && rt->dst.from))
3da59bd9 MKL	246	rt = (struct rt6_info *)(rt->dst.from);
3da59bd9 MKL	247
c5cff856 WW	248	rt6_get_cookie_safe(rt, &cookie);
	249
	250	return cookie;
b197df4f	251	}
1716a961	252
94e187c0 AW	253	static inline void ip6_rt_put(struct rt6_info *rt)
	254	{
	255	/* dst_release() accepts a NULL parameter.
	256	* We rely on dst being first structure in struct rt6_info
	257	*/
	258	BUILD_BUG_ON(offsetof(struct rt6_info, dst) != 0);
	259	dst_release(&rt->dst);
	260	}
	261
a460aa83 IS	262	void rt6_free_pcpu(struct rt6_info *non_pcpu_rt);
	263
	264	static inline void rt6_hold(struct rt6_info *rt)
	265	{
	266	atomic_inc(&rt->rt6i_ref);
	267	}
	268
	269	static inline void rt6_release(struct rt6_info *rt)
	270	{
	271	if (atomic_dec_and_test(&rt->rt6i_ref)) {
	272	rt6_free_pcpu(rt);
	273	dst_dev_put(&rt->dst);
	274	dst_release(&rt->dst);
	275	}
	276	}
	277
94b2cfe0 HFS	278	enum fib6_walk_state {
	279	#ifdef CONFIG_IPV6_SUBTREES
	280	FWS_S,
	281	#endif
	282	FWS_L,
	283	FWS_R,
	284	FWS_C,
	285	FWS_U
	286	};
	287
	288	struct fib6_walker {
bbef49da	289	struct list_head lh;
1da177e4 LT	290	struct fib6_node root, node;
1da177e4 LT	291	struct rt6_info *leaf;
94b2cfe0	292	enum fib6_walk_state state;
2bec5a36 PM	293	unsigned int skip;
2bec5a36 PM	294	unsigned int count;
94b2cfe0	295	int (func)(struct fib6_walker );
1da177e4 LT	296	void *args;
	297	};
	298
1da177e4	299	struct rt6_statistics {
81eb8447 WW	300	__u32 fib_nodes; /* all fib6 nodes */
	301	__u32 fib_route_nodes; /* intermediate nodes */
	302	__u32 fib_rt_entries; /* rt entries in fib table */
	303	__u32 fib_rt_cache; /* cached rt entries in exception table */
	304	__u32 fib_discarded_routes; /* total number of routes delete */
	305
	306	/* The following stats are not protected by any lock */
	307	atomic_t fib_rt_alloc; /* total number of routes alloced */
	308	atomic_t fib_rt_uncache; /* rt entries in uncached list */
1da177e4 LT	309	};
	310
	311	#define RTN_TL_ROOT 0x0001
	312	#define RTN_ROOT 0x0002 /* tree root node */
	313	#define RTN_RTINFO 0x0004 /* node with valid routing info */
	314
	315	/*
	316	* priority levels (or metrics)
	317	*
	318	*/
	319
1da177e4	320
c71099ac TG	321	struct fib6_table {
	322	struct hlist_node tb6_hlist;
	323	u32 tb6_id;
66f5d6ce	324	spinlock_t tb6_lock;
c71099ac	325	struct fib6_node tb6_root;
8e773277	326	struct inet_peer_base tb6_peers;
830218c1	327	unsigned int flags;
e1ee0a5b	328	unsigned int fib_seq;
830218c1	329	#define RT6_TABLE_HAS_DFLT_ROUTER BIT(0)
c71099ac TG	330	};
	331
	332	#define RT6_TABLE_UNSPEC RT_TABLE_UNSPEC
	333	#define RT6_TABLE_MAIN RT_TABLE_MAIN
c71099ac TG	334	#define RT6_TABLE_DFLT RT6_TABLE_MAIN
	335	#define RT6_TABLE_INFO RT6_TABLE_MAIN
	336	#define RT6_TABLE_PREFIX RT6_TABLE_MAIN
	337
	338	#ifdef CONFIG_IPV6_MULTIPLE_TABLES
	339	#define FIB6_TABLE_MIN 1
	340	#define FIB6_TABLE_MAX RT_TABLE_MAX
101367c2	341	#define RT6_TABLE_LOCAL RT_TABLE_LOCAL
c71099ac TG	342	#else
	343	#define FIB6_TABLE_MIN RT_TABLE_MAIN
	344	#define FIB6_TABLE_MAX FIB6_TABLE_MIN
101367c2	345	#define RT6_TABLE_LOCAL RT6_TABLE_MAIN
c71099ac TG	346	#endif
c71099ac TG	347
8ed67789 DL	348	typedef struct rt6_info (pol_lookup_t)(struct net *,
8ed67789 DL	349	struct fib6_table *,
4c9483b2	350	struct flowi6 *, int);
1da177e4	351
df77fe4d IS	352	struct fib6_entry_notifier_info {
	353	struct fib_notifier_info info; /* must be first */
	354	struct rt6_info *rt;
	355	};
	356
1da177e4 LT	357	/*
	358	* exported functions
	359	*/
	360
5c3a0fd7 JP	361	struct fib6_table fib6_get_table(struct net net, u32 id);
	362	struct fib6_table fib6_new_table(struct net net, u32 id);
	363	struct dst_entry fib6_rule_lookup(struct net net, struct flowi6 *fl6,
	364	int flags, pol_lookup_t lookup);
c71099ac	365
5c3a0fd7 JP	366	struct fib6_node fib6_lookup(struct fib6_node root,
	367	const struct in6_addr *daddr,
	368	const struct in6_addr *saddr);
1da177e4	369
5c3a0fd7 JP	370	struct fib6_node fib6_locate(struct fib6_node root,
5c3a0fd7 JP	371	const struct in6_addr *daddr, int dst_len,
38fbeeee WW	372	const struct in6_addr *saddr, int src_len,
38fbeeee WW	373	bool exact_match);
1da177e4	374
5c3a0fd7	375	void fib6_clean_all(struct net net, int (func)(struct rt6_info , void arg),
0c3584d5	376	void *arg);
c71099ac	377
e715b6d3	378	int fib6_add(struct fib6_node root, struct rt6_info rt,
333c4301 DA	379	struct nl_info info, struct mx6_config mxc,
333c4301 DA	380	struct netlink_ext_ack *extack);
5c3a0fd7	381	int fib6_del(struct rt6_info rt, struct nl_info info);
1da177e4	382
37a1d361 RP	383	void inet6_rt_notify(int event, struct rt6_info rt, struct nl_info info,
37a1d361 RP	384	unsigned int flags);
1da177e4	385
5c3a0fd7	386	void fib6_run_gc(unsigned long expires, struct net *net, bool force);
1da177e4	387
5c3a0fd7	388	void fib6_gc_cleanup(void);
1da177e4	389
5c3a0fd7	390	int fib6_init(void);
101367c2	391
8d2ca1d7 HFS	392	int ipv6_route_open(struct inode inode, struct file file);
8d2ca1d7 HFS	393
16ab6d7d IS	394	int call_fib6_notifier(struct notifier_block nb, struct net net,
	395	enum fib_event_type event_type,
	396	struct fib_notifier_info *info);
	397	int call_fib6_notifiers(struct net *net, enum fib_event_type event_type,
	398	struct fib_notifier_info *info);
	399
	400	int __net_init fib6_notifier_init(struct net *net);
	401	void __net_exit fib6_notifier_exit(struct net *net);
	402
e1ee0a5b IS	403	unsigned int fib6_tables_seq_read(struct net *net);
	404	int fib6_tables_dump(struct net net, struct notifier_block nb);
	405
180ca444 WW	406	void fib6_update_sernum(struct rt6_info *rt);
180ca444 WW	407
7e5449c2	408	#ifdef CONFIG_IPV6_MULTIPLE_TABLES
5c3a0fd7 JP	409	int fib6_rules_init(void);
5c3a0fd7 JP	410	void fib6_rules_cleanup(void);
e3ea9731	411	bool fib6_rule_default(const struct fib_rule *rule);
dcb18f76 IS	412	int fib6_rules_dump(struct net net, struct notifier_block nb);
dcb18f76 IS	413	unsigned int fib6_rules_seq_read(struct net *net);
7e5449c2 DL	414	#else
	415	static inline int fib6_rules_init(void)
	416	{
	417	return 0;
	418	}
	419	static inline void fib6_rules_cleanup(void)
	420	{
	421	return ;
	422	}
e3ea9731 IS	423	static inline bool fib6_rule_default(const struct fib_rule *rule)
	424	{
	425	return true;
	426	}
dcb18f76 IS	427	static inline int fib6_rules_dump(struct net net, struct notifier_block nb)
	428	{
	429	return 0;
	430	}
	431	static inline unsigned int fib6_rules_seq_read(struct net *net)
	432	{
	433	return 0;
	434	}
7e5449c2	435	#endif
1da177e4	436	#endif