[mirror_ubuntu-jammy-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;
	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_nh_upper_bound;

	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 */
	int				rt6i_nh_weight;
	unsigned short			rt6i_nfheader_len;
	u8				rt6i_protocol;
	u8				exception_bucket_flushed:1,
					should_flush:1,
					unused:6;
};

#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 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 = rt->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->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 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);
void fib6_update_sernum_upto_root(struct net *net, 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);

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