fib_rules.h 4.1 KB
Newer Older
1
/* SPDX-License-Identifier: GPL-2.0 */
2 3 4 5
#ifndef __NET_FIB_RULES_H
#define __NET_FIB_RULES_H

#include <linux/types.h>
6
#include <linux/slab.h>
7 8
#include <linux/netdevice.h>
#include <linux/fib_rules.h>
9
#include <linux/refcount.h>
10
#include <net/flow.h>
11
#include <net/rtnetlink.h>
12
#include <net/fib_notifier.h>
13

14 15 16 17 18
struct fib_kuid_range {
	kuid_t start;
	kuid_t end;
};

E
Eric Dumazet 已提交
19
struct fib_rule {
20
	struct list_head	list;
21
	int			iifindex;
22
	int			oifindex;
23 24
	u32			mark;
	u32			mark_mask;
25 26 27
	u32			flags;
	u32			table;
	u8			action;
D
David Ahern 已提交
28 29
	u8			l3mdev;
	/* 2 bytes hole, try to use */
T
Thomas Graf 已提交
30
	u32			target;
31
	__be64			tun_id;
E
Eric Dumazet 已提交
32
	struct fib_rule __rcu	*ctarget;
33 34
	struct net		*fr_net;

35
	refcount_t		refcnt;
36 37 38
	u32			pref;
	int			suppress_ifgroup;
	int			suppress_prefixlen;
39
	char			iifname[IFNAMSIZ];
40
	char			oifname[IFNAMSIZ];
41
	struct fib_kuid_range	uid_range;
42 43 44
	struct rcu_head		rcu;
};

E
Eric Dumazet 已提交
45
struct fib_lookup_arg {
46 47 48
	void			*lookup_ptr;
	void			*result;
	struct fib_rule		*rule;
D
David Ahern 已提交
49
	u32			table;
E
Eric Dumazet 已提交
50
	int			flags;
51 52
#define FIB_LOOKUP_NOREF		1
#define FIB_LOOKUP_IGNORE_LINKSTATE	2
53 54
};

E
Eric Dumazet 已提交
55
struct fib_rules_ops {
56 57 58
	int			family;
	struct list_head	list;
	int			rule_size;
59
	int			addr_size;
T
Thomas Graf 已提交
60 61
	int			unresolved_rules;
	int			nr_goto_rules;
62
	unsigned int		fib_rules_seq;
63 64 65 66

	int			(*action)(struct fib_rule *,
					  struct flowi *, int,
					  struct fib_lookup_arg *);
67 68
	bool			(*suppress)(struct fib_rule *,
					    struct fib_lookup_arg *);
69 70 71 72 73 74
	int			(*match)(struct fib_rule *,
					 struct flowi *, int);
	int			(*configure)(struct fib_rule *,
					     struct sk_buff *,
					     struct fib_rule_hdr *,
					     struct nlattr **);
75
	int			(*delete)(struct fib_rule *);
76 77 78 79 80
	int			(*compare)(struct fib_rule *,
					   struct fib_rule_hdr *,
					   struct nlattr **);
	int			(*fill)(struct fib_rule *, struct sk_buff *,
					struct fib_rule_hdr *);
81
	size_t			(*nlmsg_payload)(struct fib_rule *);
82

83 84
	/* Called after modifications to the rules set, must flush
	 * the route cache if one exists. */
85
	void			(*flush_cache)(struct fib_rules_ops *ops);
86

87
	int			nlgroup;
88
	const struct nla_policy	*policy;
89
	struct list_head	rules_list;
90
	struct module		*owner;
91
	struct net		*fro_net;
92
	struct rcu_head		rcu;
93 94
};

95 96 97 98 99
struct fib_rule_notifier_info {
	struct fib_notifier_info info; /* must be first */
	struct fib_rule *rule;
};

100
#define FRA_GENERIC_POLICY \
101
	[FRA_IIFNAME]	= { .type = NLA_STRING, .len = IFNAMSIZ - 1 }, \
102
	[FRA_OIFNAME]	= { .type = NLA_STRING, .len = IFNAMSIZ - 1 }, \
103 104 105
	[FRA_PRIORITY]	= { .type = NLA_U32 }, \
	[FRA_FWMARK]	= { .type = NLA_U32 }, \
	[FRA_FWMASK]	= { .type = NLA_U32 }, \
T
Thomas Graf 已提交
106
	[FRA_TABLE]     = { .type = NLA_U32 }, \
107
	[FRA_SUPPRESS_PREFIXLEN] = { .type = NLA_U32 }, \
108
	[FRA_SUPPRESS_IFGROUP] = { .type = NLA_U32 }, \
D
David Ahern 已提交
109
	[FRA_GOTO]	= { .type = NLA_U32 }, \
110 111
	[FRA_L3MDEV]	= { .type = NLA_U8 }, \
	[FRA_UID_RANGE]	= { .len = sizeof(struct fib_rule_uid_range) }
112

113 114
static inline void fib_rule_get(struct fib_rule *rule)
{
115
	refcount_inc(&rule->refcnt);
116 117 118 119
}

static inline void fib_rule_put(struct fib_rule *rule)
{
120
	if (refcount_dec_and_test(&rule->refcnt))
121
		kfree_rcu(rule, rcu);
122 123
}

D
David Ahern 已提交
124 125 126 127 128 129 130 131 132 133 134 135 136 137
#ifdef CONFIG_NET_L3_MASTER_DEV
static inline u32 fib_rule_get_table(struct fib_rule *rule,
				     struct fib_lookup_arg *arg)
{
	return rule->l3mdev ? arg->table : rule->table;
}
#else
static inline u32 fib_rule_get_table(struct fib_rule *rule,
				     struct fib_lookup_arg *arg)
{
	return rule->table;
}
#endif

138 139 140 141 142 143 144
static inline u32 frh_get_table(struct fib_rule_hdr *frh, struct nlattr **nla)
{
	if (nla[FRA_TABLE])
		return nla_get_u32(nla[FRA_TABLE]);
	return frh->table;
}

145 146 147
struct fib_rules_ops *fib_rules_register(const struct fib_rules_ops *,
					 struct net *);
void fib_rules_unregister(struct fib_rules_ops *);
148

149 150 151 152
int fib_rules_lookup(struct fib_rules_ops *, struct flowi *, int flags,
		     struct fib_lookup_arg *);
int fib_default_rule_add(struct fib_rules_ops *, u32 pref, u32 table,
			 u32 flags);
153
bool fib_rule_matchall(const struct fib_rule *rule);
154 155
int fib_rules_dump(struct net *net, struct notifier_block *nb, int family);
unsigned int fib_rules_seq_read(struct net *net, int family);
D
David Ahern 已提交
156

157 158 159 160
int fib_nl_newrule(struct sk_buff *skb, struct nlmsghdr *nlh,
		   struct netlink_ext_ack *extack);
int fib_nl_delrule(struct sk_buff *skb, struct nlmsghdr *nlh,
		   struct netlink_ext_ack *extack);
161
#endif