2019-05-31 16:09:32 +08:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-only
|
2006-08-04 18:38:38 +08:00
|
|
|
/*
|
|
|
|
|
* net/core/fib_rules.c Generic Routing Rules
|
|
|
|
|
*
|
|
|
|
|
* Authors: Thomas Graf <tgraf@suug.ch>
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include <linux/types.h>
|
|
|
|
|
#include <linux/kernel.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 16:04:11 +08:00
|
|
|
#include <linux/slab.h>
|
2006-08-04 18:38:38 +08:00
|
|
|
#include <linux/list.h>
|
2011-05-27 21:12:25 +08:00
|
|
|
#include <linux/module.h>
|
2007-09-12 19:02:17 +08:00
|
|
|
#include <net/net_namespace.h>
|
2007-09-18 02:56:21 +08:00
|
|
|
#include <net/sock.h>
|
2006-08-04 18:38:38 +08:00
|
|
|
#include <net/fib_rules.h>
|
2015-07-21 16:44:01 +08:00
|
|
|
#include <net/ip_tunnels.h>
|
2020-07-27 06:48:16 +08:00
|
|
|
#include <linux/indirect_call_wrapper.h>
|
2006-08-04 18:38:38 +08:00
|
|
|
|
2020-09-09 00:18:12 +08:00
|
|
|
#if defined(CONFIG_IPV6) && defined(CONFIG_IPV6_MULTIPLE_TABLES)
|
2020-08-01 11:01:10 +08:00
|
|
|
#ifdef CONFIG_IP_MULTIPLE_TABLES
|
2020-07-30 02:10:18 +08:00
|
|
|
#define INDIRECT_CALL_MT(f, f2, f1, ...) \
|
|
|
|
|
INDIRECT_CALL_INET(f, f2, f1, __VA_ARGS__)
|
|
|
|
|
#else
|
2020-08-01 11:01:10 +08:00
|
|
|
#define INDIRECT_CALL_MT(f, f2, f1, ...) INDIRECT_CALL_1(f, f2, __VA_ARGS__)
|
|
|
|
|
#endif
|
2020-08-03 21:19:48 +08:00
|
|
|
#elif defined(CONFIG_IP_MULTIPLE_TABLES)
|
2020-07-30 02:10:18 +08:00
|
|
|
#define INDIRECT_CALL_MT(f, f2, f1, ...) INDIRECT_CALL_1(f, f1, __VA_ARGS__)
|
2020-08-01 11:01:10 +08:00
|
|
|
#else
|
|
|
|
|
#define INDIRECT_CALL_MT(f, f2, f1, ...) f(__VA_ARGS__)
|
2020-07-30 02:10:18 +08:00
|
|
|
#endif
|
|
|
|
|
|
2016-11-04 01:23:42 +08:00
|
|
|
static const struct fib_kuid_range fib_kuid_range_unset = {
|
|
|
|
|
KUIDT_INIT(0),
|
|
|
|
|
KUIDT_INIT(~0),
|
|
|
|
|
};
|
|
|
|
|
|
ipv4: fib_rules: Check if rule is a default rule
Currently, when non-default (custom) FIB rules are used, devices capable
of layer 3 offloading flush their tables and let the kernel do the
forwarding instead.
When these devices' drivers are loaded they register to the FIB
notification chain, which lets them know about the existence of any
custom FIB rules. This is done by sending a RULE_ADD notification based
on the value of 'net->ipv4.fib_has_custom_rules'.
This approach is problematic when VRF offload is taken into account, as
upon the creation of the first VRF netdev, a l3mdev rule is programmed
to direct skbs to the VRF's table.
Instead of merely reading the above value and sending a single RULE_ADD
notification, we should iterate over all the FIB rules and send a
detailed notification for each, thereby allowing offloading drivers to
sanitize the rules they don't support and potentially flush their
tables.
While l3mdev rules are uniquely marked, the default rules are not.
Therefore, when they are being notified they might invoke offloading
drivers to unnecessarily flush their tables.
Solve this by adding an helper to check if a FIB rule is a default rule.
Namely, its selector should match all packets and its action should
point to the local, main or default tables.
As noted by David Ahern, uniquely marking the default rules is
insufficient. When using VRFs, it's common to avoid false hits by moving
the rule for the local table to just before the main table:
Default configuration:
$ ip rule show
0: from all lookup local
32766: from all lookup main
32767: from all lookup default
Common configuration with VRFs:
$ ip rule show
1000: from all lookup [l3mdev-table]
32765: from all lookup local
32766: from all lookup main
32767: from all lookup default
Signed-off-by: Ido Schimmel <idosch@mellanox.com>
Signed-off-by: Jiri Pirko <jiri@mellanox.com>
Acked-by: David Ahern <dsa@cumulusnetworks.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2017-03-16 16:08:12 +08:00
|
|
|
bool fib_rule_matchall(const struct fib_rule *rule)
|
|
|
|
|
{
|
|
|
|
|
if (rule->iifindex || rule->oifindex || rule->mark || rule->tun_id ||
|
|
|
|
|
rule->flags)
|
|
|
|
|
return false;
|
|
|
|
|
if (rule->suppress_ifgroup != -1 || rule->suppress_prefixlen != -1)
|
|
|
|
|
return false;
|
|
|
|
|
if (!uid_eq(rule->uid_range.start, fib_kuid_range_unset.start) ||
|
|
|
|
|
!uid_eq(rule->uid_range.end, fib_kuid_range_unset.end))
|
|
|
|
|
return false;
|
2018-03-01 11:40:16 +08:00
|
|
|
if (fib_rule_port_range_set(&rule->sport_range))
|
|
|
|
|
return false;
|
|
|
|
|
if (fib_rule_port_range_set(&rule->dport_range))
|
|
|
|
|
return false;
|
ipv4: fib_rules: Check if rule is a default rule
Currently, when non-default (custom) FIB rules are used, devices capable
of layer 3 offloading flush their tables and let the kernel do the
forwarding instead.
When these devices' drivers are loaded they register to the FIB
notification chain, which lets them know about the existence of any
custom FIB rules. This is done by sending a RULE_ADD notification based
on the value of 'net->ipv4.fib_has_custom_rules'.
This approach is problematic when VRF offload is taken into account, as
upon the creation of the first VRF netdev, a l3mdev rule is programmed
to direct skbs to the VRF's table.
Instead of merely reading the above value and sending a single RULE_ADD
notification, we should iterate over all the FIB rules and send a
detailed notification for each, thereby allowing offloading drivers to
sanitize the rules they don't support and potentially flush their
tables.
While l3mdev rules are uniquely marked, the default rules are not.
Therefore, when they are being notified they might invoke offloading
drivers to unnecessarily flush their tables.
Solve this by adding an helper to check if a FIB rule is a default rule.
Namely, its selector should match all packets and its action should
point to the local, main or default tables.
As noted by David Ahern, uniquely marking the default rules is
insufficient. When using VRFs, it's common to avoid false hits by moving
the rule for the local table to just before the main table:
Default configuration:
$ ip rule show
0: from all lookup local
32766: from all lookup main
32767: from all lookup default
Common configuration with VRFs:
$ ip rule show
1000: from all lookup [l3mdev-table]
32765: from all lookup local
32766: from all lookup main
32767: from all lookup default
Signed-off-by: Ido Schimmel <idosch@mellanox.com>
Signed-off-by: Jiri Pirko <jiri@mellanox.com>
Acked-by: David Ahern <dsa@cumulusnetworks.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2017-03-16 16:08:12 +08:00
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
EXPORT_SYMBOL_GPL(fib_rule_matchall);
|
|
|
|
|
|
2007-11-11 14:12:03 +08:00
|
|
|
int fib_default_rule_add(struct fib_rules_ops *ops,
|
|
|
|
|
u32 pref, u32 table, u32 flags)
|
|
|
|
|
{
|
|
|
|
|
struct fib_rule *r;
|
|
|
|
|
|
memcg: enable accounting for IP address and routing-related objects
An netadmin inside container can use 'ip a a' and 'ip r a'
to assign a large number of ipv4/ipv6 addresses and routing entries
and force kernel to allocate megabytes of unaccounted memory
for long-lived per-netdevice related kernel objects:
'struct in_ifaddr', 'struct inet6_ifaddr', 'struct fib6_node',
'struct rt6_info', 'struct fib_rules' and ip_fib caches.
These objects can be manually removed, though usually they lives
in memory till destroy of its net namespace.
It makes sense to account for them to restrict the host's memory
consumption from inside the memcg-limited container.
One of such objects is the 'struct fib6_node' mostly allocated in
net/ipv6/route.c::__ip6_ins_rt() inside the lock_bh()/unlock_bh() section:
write_lock_bh(&table->tb6_lock);
err = fib6_add(&table->tb6_root, rt, info, mxc);
write_unlock_bh(&table->tb6_lock);
In this case it is not enough to simply add SLAB_ACCOUNT to corresponding
kmem cache. The proper memory cgroup still cannot be found due to the
incorrect 'in_interrupt()' check used in memcg_kmem_bypass().
Obsoleted in_interrupt() does not describe real execution context properly.
>From include/linux/preempt.h:
The following macros are deprecated and should not be used in new code:
in_interrupt() - We're in NMI,IRQ,SoftIRQ context or have BH disabled
To verify the current execution context new macro should be used instead:
in_task() - We're in task context
Signed-off-by: Vasily Averin <vvs@virtuozzo.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2021-07-19 18:44:31 +08:00
|
|
|
r = kzalloc(ops->rule_size, GFP_KERNEL_ACCOUNT);
|
2007-11-11 14:12:03 +08:00
|
|
|
if (r == NULL)
|
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
2017-06-30 18:08:06 +08:00
|
|
|
refcount_set(&r->refcnt, 1);
|
2007-11-11 14:12:03 +08:00
|
|
|
r->action = FR_ACT_TO_TBL;
|
|
|
|
|
r->pref = pref;
|
|
|
|
|
r->table = table;
|
|
|
|
|
r->flags = flags;
|
2018-02-20 21:55:58 +08:00
|
|
|
r->proto = RTPROT_KERNEL;
|
2015-03-12 12:04:08 +08:00
|
|
|
r->fr_net = ops->fro_net;
|
2016-11-04 01:23:42 +08:00
|
|
|
r->uid_range = fib_kuid_range_unset;
|
2007-11-11 14:12:03 +08:00
|
|
|
|
2013-08-03 20:14:43 +08:00
|
|
|
r->suppress_prefixlen = -1;
|
|
|
|
|
r->suppress_ifgroup = -1;
|
|
|
|
|
|
2007-11-11 14:12:03 +08:00
|
|
|
/* The lock is not required here, the list in unreacheable
|
|
|
|
|
* at the moment this function is called */
|
|
|
|
|
list_add_tail(&r->list, &ops->rules_list);
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
EXPORT_SYMBOL(fib_default_rule_add);
|
|
|
|
|
|
2015-09-09 20:20:56 +08:00
|
|
|
static u32 fib_default_rule_pref(struct fib_rules_ops *ops)
|
2010-04-13 13:03:15 +08:00
|
|
|
{
|
|
|
|
|
struct list_head *pos;
|
|
|
|
|
struct fib_rule *rule;
|
|
|
|
|
|
|
|
|
|
if (!list_empty(&ops->rules_list)) {
|
|
|
|
|
pos = ops->rules_list.next;
|
|
|
|
|
if (pos->next != &ops->rules_list) {
|
|
|
|
|
rule = list_entry(pos->next, struct fib_rule, list);
|
|
|
|
|
if (rule->pref)
|
|
|
|
|
return rule->pref - 1;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2008-01-21 08:46:41 +08:00
|
|
|
static void notify_rule_change(int event, struct fib_rule *rule,
|
2006-08-15 15:32:48 +08:00
|
|
|
struct fib_rules_ops *ops, struct nlmsghdr *nlh,
|
|
|
|
|
u32 pid);
|
2006-08-04 18:38:38 +08:00
|
|
|
|
2008-01-10 19:20:28 +08:00
|
|
|
static struct fib_rules_ops *lookup_rules_ops(struct net *net, int family)
|
2006-08-04 18:38:38 +08:00
|
|
|
{
|
|
|
|
|
struct fib_rules_ops *ops;
|
|
|
|
|
|
|
|
|
|
rcu_read_lock();
|
2008-01-10 19:20:28 +08:00
|
|
|
list_for_each_entry_rcu(ops, &net->rules_ops, list) {
|
2006-08-04 18:38:38 +08:00
|
|
|
if (ops->family == family) {
|
|
|
|
|
if (!try_module_get(ops->owner))
|
|
|
|
|
ops = NULL;
|
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
return ops;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void rules_ops_put(struct fib_rules_ops *ops)
|
|
|
|
|
{
|
|
|
|
|
if (ops)
|
|
|
|
|
module_put(ops->owner);
|
|
|
|
|
}
|
|
|
|
|
|
2007-03-28 04:56:52 +08:00
|
|
|
static void flush_route_cache(struct fib_rules_ops *ops)
|
|
|
|
|
{
|
|
|
|
|
if (ops->flush_cache)
|
2008-07-06 10:01:28 +08:00
|
|
|
ops->flush_cache(ops);
|
2007-03-28 04:56:52 +08:00
|
|
|
}
|
|
|
|
|
|
2009-12-04 04:22:55 +08:00
|
|
|
static int __fib_rules_register(struct fib_rules_ops *ops)
|
2006-08-04 18:38:38 +08:00
|
|
|
{
|
|
|
|
|
int err = -EEXIST;
|
|
|
|
|
struct fib_rules_ops *o;
|
2008-01-21 08:46:41 +08:00
|
|
|
struct net *net;
|
|
|
|
|
|
|
|
|
|
net = ops->fro_net;
|
2006-08-04 18:38:38 +08:00
|
|
|
|
|
|
|
|
if (ops->rule_size < sizeof(struct fib_rule))
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
|
|
if (ops->match == NULL || ops->configure == NULL ||
|
|
|
|
|
ops->compare == NULL || ops->fill == NULL ||
|
|
|
|
|
ops->action == NULL)
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
2008-01-10 19:20:28 +08:00
|
|
|
spin_lock(&net->rules_mod_lock);
|
|
|
|
|
list_for_each_entry(o, &net->rules_ops, list)
|
2006-08-04 18:38:38 +08:00
|
|
|
if (ops->family == o->family)
|
|
|
|
|
goto errout;
|
|
|
|
|
|
2008-01-10 19:20:28 +08:00
|
|
|
list_add_tail_rcu(&ops->list, &net->rules_ops);
|
2006-08-04 18:38:38 +08:00
|
|
|
err = 0;
|
|
|
|
|
errout:
|
2008-01-10 19:20:28 +08:00
|
|
|
spin_unlock(&net->rules_mod_lock);
|
2006-08-04 18:38:38 +08:00
|
|
|
|
|
|
|
|
return err;
|
|
|
|
|
}
|
|
|
|
|
|
2009-12-04 04:22:55 +08:00
|
|
|
struct fib_rules_ops *
|
2010-04-26 22:02:04 +08:00
|
|
|
fib_rules_register(const struct fib_rules_ops *tmpl, struct net *net)
|
2009-12-04 04:22:55 +08:00
|
|
|
{
|
|
|
|
|
struct fib_rules_ops *ops;
|
|
|
|
|
int err;
|
|
|
|
|
|
2010-03-10 04:03:38 +08:00
|
|
|
ops = kmemdup(tmpl, sizeof(*ops), GFP_KERNEL);
|
2009-12-04 04:22:55 +08:00
|
|
|
if (ops == NULL)
|
|
|
|
|
return ERR_PTR(-ENOMEM);
|
|
|
|
|
|
|
|
|
|
INIT_LIST_HEAD(&ops->rules_list);
|
|
|
|
|
ops->fro_net = net;
|
|
|
|
|
|
|
|
|
|
err = __fib_rules_register(ops);
|
|
|
|
|
if (err) {
|
|
|
|
|
kfree(ops);
|
|
|
|
|
ops = ERR_PTR(err);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return ops;
|
|
|
|
|
}
|
2006-08-04 18:38:38 +08:00
|
|
|
EXPORT_SYMBOL_GPL(fib_rules_register);
|
|
|
|
|
|
2010-10-05 04:14:17 +08:00
|
|
|
static void fib_rules_cleanup_ops(struct fib_rules_ops *ops)
|
2006-08-04 18:38:38 +08:00
|
|
|
{
|
|
|
|
|
struct fib_rule *rule, *tmp;
|
|
|
|
|
|
2007-09-17 06:44:27 +08:00
|
|
|
list_for_each_entry_safe(rule, tmp, &ops->rules_list, list) {
|
2006-08-04 18:38:38 +08:00
|
|
|
list_del_rcu(&rule->list);
|
2012-06-29 16:32:45 +08:00
|
|
|
if (ops->delete)
|
|
|
|
|
ops->delete(rule);
|
2006-08-04 18:38:38 +08:00
|
|
|
fib_rule_put(rule);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2008-01-21 08:46:41 +08:00
|
|
|
void fib_rules_unregister(struct fib_rules_ops *ops)
|
2006-08-04 18:38:38 +08:00
|
|
|
{
|
2008-01-21 08:46:41 +08:00
|
|
|
struct net *net = ops->fro_net;
|
2006-08-04 18:38:38 +08:00
|
|
|
|
2008-01-10 19:20:28 +08:00
|
|
|
spin_lock(&net->rules_mod_lock);
|
2008-01-15 14:59:30 +08:00
|
|
|
list_del_rcu(&ops->list);
|
2008-01-10 19:20:28 +08:00
|
|
|
spin_unlock(&net->rules_mod_lock);
|
2006-08-04 18:38:38 +08:00
|
|
|
|
2015-04-01 02:01:46 +08:00
|
|
|
fib_rules_cleanup_ops(ops);
|
2015-03-12 12:04:08 +08:00
|
|
|
kfree_rcu(ops, rcu);
|
2006-08-04 18:38:38 +08:00
|
|
|
}
|
|
|
|
|
EXPORT_SYMBOL_GPL(fib_rules_unregister);
|
|
|
|
|
|
2016-11-04 01:23:42 +08:00
|
|
|
static int uid_range_set(struct fib_kuid_range *range)
|
|
|
|
|
{
|
|
|
|
|
return uid_valid(range->start) && uid_valid(range->end);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static struct fib_kuid_range nla_get_kuid_range(struct nlattr **tb)
|
|
|
|
|
{
|
|
|
|
|
struct fib_rule_uid_range *in;
|
|
|
|
|
struct fib_kuid_range out;
|
|
|
|
|
|
|
|
|
|
in = (struct fib_rule_uid_range *)nla_data(tb[FRA_UID_RANGE]);
|
|
|
|
|
|
|
|
|
|
out.start = make_kuid(current_user_ns(), in->start);
|
|
|
|
|
out.end = make_kuid(current_user_ns(), in->end);
|
|
|
|
|
|
|
|
|
|
return out;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int nla_put_uid_range(struct sk_buff *skb, struct fib_kuid_range *range)
|
|
|
|
|
{
|
|
|
|
|
struct fib_rule_uid_range out = {
|
|
|
|
|
from_kuid_munged(current_user_ns(), range->start),
|
|
|
|
|
from_kuid_munged(current_user_ns(), range->end)
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
return nla_put(skb, FRA_UID_RANGE, sizeof(out), &out);
|
|
|
|
|
}
|
|
|
|
|
|
2018-03-01 11:40:16 +08:00
|
|
|
static int nla_get_port_range(struct nlattr *pattr,
|
|
|
|
|
struct fib_rule_port_range *port_range)
|
|
|
|
|
{
|
|
|
|
|
const struct fib_rule_port_range *pr = nla_data(pattr);
|
|
|
|
|
|
|
|
|
|
if (!fib_rule_port_range_valid(pr))
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
|
|
port_range->start = pr->start;
|
|
|
|
|
port_range->end = pr->end;
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int nla_put_port_range(struct sk_buff *skb, int attrtype,
|
|
|
|
|
struct fib_rule_port_range *range)
|
|
|
|
|
{
|
|
|
|
|
return nla_put(skb, attrtype, sizeof(*range), range);
|
|
|
|
|
}
|
|
|
|
|
|
2006-11-10 07:23:20 +08:00
|
|
|
static int fib_rule_match(struct fib_rule *rule, struct fib_rules_ops *ops,
|
2016-06-09 01:55:39 +08:00
|
|
|
struct flowi *fl, int flags,
|
|
|
|
|
struct fib_lookup_arg *arg)
|
2006-11-10 07:23:20 +08:00
|
|
|
{
|
|
|
|
|
int ret = 0;
|
|
|
|
|
|
2011-03-12 13:29:39 +08:00
|
|
|
if (rule->iifindex && (rule->iifindex != fl->flowi_iif))
|
2006-11-10 07:23:20 +08:00
|
|
|
goto out;
|
|
|
|
|
|
2011-03-12 13:29:39 +08:00
|
|
|
if (rule->oifindex && (rule->oifindex != fl->flowi_oif))
|
2009-12-03 09:25:56 +08:00
|
|
|
goto out;
|
|
|
|
|
|
2011-03-12 13:29:39 +08:00
|
|
|
if ((rule->mark ^ fl->flowi_mark) & rule->mark_mask)
|
2006-11-10 07:23:20 +08:00
|
|
|
goto out;
|
|
|
|
|
|
2015-07-21 16:44:01 +08:00
|
|
|
if (rule->tun_id && (rule->tun_id != fl->flowi_tun_key.tun_id))
|
|
|
|
|
goto out;
|
|
|
|
|
|
2016-06-09 01:55:39 +08:00
|
|
|
if (rule->l3mdev && !l3mdev_fib_rule_match(rule->fr_net, fl, arg))
|
|
|
|
|
goto out;
|
|
|
|
|
|
2016-11-04 01:23:42 +08:00
|
|
|
if (uid_lt(fl->flowi_uid, rule->uid_range.start) ||
|
|
|
|
|
uid_gt(fl->flowi_uid, rule->uid_range.end))
|
|
|
|
|
goto out;
|
|
|
|
|
|
2020-07-30 02:10:18 +08:00
|
|
|
ret = INDIRECT_CALL_MT(ops->match,
|
|
|
|
|
fib6_rule_match,
|
|
|
|
|
fib4_rule_match,
|
|
|
|
|
rule, fl, flags);
|
2006-11-10 07:23:20 +08:00
|
|
|
out:
|
|
|
|
|
return (rule->flags & FIB_RULE_INVERT) ? !ret : ret;
|
|
|
|
|
}
|
|
|
|
|
|
2006-08-04 18:38:38 +08:00
|
|
|
int fib_rules_lookup(struct fib_rules_ops *ops, struct flowi *fl,
|
|
|
|
|
int flags, struct fib_lookup_arg *arg)
|
|
|
|
|
{
|
|
|
|
|
struct fib_rule *rule;
|
|
|
|
|
int err;
|
|
|
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
|
|
2007-09-17 06:44:27 +08:00
|
|
|
list_for_each_entry_rcu(rule, &ops->rules_list, list) {
|
2007-03-27 08:14:15 +08:00
|
|
|
jumped:
|
2016-06-09 01:55:39 +08:00
|
|
|
if (!fib_rule_match(rule, ops, fl, flags, arg))
|
2006-08-04 18:38:38 +08:00
|
|
|
continue;
|
|
|
|
|
|
2007-03-27 08:14:15 +08:00
|
|
|
if (rule->action == FR_ACT_GOTO) {
|
|
|
|
|
struct fib_rule *target;
|
|
|
|
|
|
|
|
|
|
target = rcu_dereference(rule->ctarget);
|
|
|
|
|
if (target == NULL) {
|
|
|
|
|
continue;
|
|
|
|
|
} else {
|
|
|
|
|
rule = target;
|
|
|
|
|
goto jumped;
|
|
|
|
|
}
|
2007-03-27 08:38:53 +08:00
|
|
|
} else if (rule->action == FR_ACT_NOP)
|
|
|
|
|
continue;
|
|
|
|
|
else
|
2020-07-30 02:10:18 +08:00
|
|
|
err = INDIRECT_CALL_MT(ops->action,
|
|
|
|
|
fib6_rule_action,
|
|
|
|
|
fib4_rule_action,
|
|
|
|
|
rule, fl, flags, arg);
|
|
|
|
|
|
|
|
|
|
if (!err && ops->suppress && INDIRECT_CALL_MT(ops->suppress,
|
|
|
|
|
fib6_rule_suppress,
|
|
|
|
|
fib4_rule_suppress,
|
|
|
|
|
rule, arg))
|
2013-08-01 08:17:15 +08:00
|
|
|
continue;
|
|
|
|
|
|
2006-08-04 18:38:38 +08:00
|
|
|
if (err != -EAGAIN) {
|
2010-10-05 18:41:36 +08:00
|
|
|
if ((arg->flags & FIB_LOOKUP_NOREF) ||
|
2017-06-30 18:08:06 +08:00
|
|
|
likely(refcount_inc_not_zero(&rule->refcnt))) {
|
2010-09-27 12:18:27 +08:00
|
|
|
arg->rule = rule;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
break;
|
2006-08-04 18:38:38 +08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2007-03-31 04:34:27 +08:00
|
|
|
err = -ESRCH;
|
2006-08-04 18:38:38 +08:00
|
|
|
out:
|
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
|
|
|
|
|
return err;
|
|
|
|
|
}
|
|
|
|
|
EXPORT_SYMBOL_GPL(fib_rules_lookup);
|
|
|
|
|
|
2019-10-03 17:49:27 +08:00
|
|
|
static int call_fib_rule_notifier(struct notifier_block *nb,
|
2017-08-03 19:28:14 +08:00
|
|
|
enum fib_event_type event_type,
|
2019-10-03 17:49:30 +08:00
|
|
|
struct fib_rule *rule, int family,
|
|
|
|
|
struct netlink_ext_ack *extack)
|
2017-08-03 19:28:14 +08:00
|
|
|
{
|
|
|
|
|
struct fib_rule_notifier_info info = {
|
|
|
|
|
.info.family = family,
|
2019-10-03 17:49:30 +08:00
|
|
|
.info.extack = extack,
|
2017-08-03 19:28:14 +08:00
|
|
|
.rule = rule,
|
|
|
|
|
};
|
|
|
|
|
|
2019-10-03 17:49:27 +08:00
|
|
|
return call_fib_notifier(nb, event_type, &info.info);
|
2017-08-03 19:28:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int call_fib_rule_notifiers(struct net *net,
|
|
|
|
|
enum fib_event_type event_type,
|
|
|
|
|
struct fib_rule *rule,
|
2017-10-28 08:37:13 +08:00
|
|
|
struct fib_rules_ops *ops,
|
|
|
|
|
struct netlink_ext_ack *extack)
|
2017-08-03 19:28:14 +08:00
|
|
|
{
|
|
|
|
|
struct fib_rule_notifier_info info = {
|
|
|
|
|
.info.family = ops->family,
|
2017-10-28 08:37:13 +08:00
|
|
|
.info.extack = extack,
|
2017-08-03 19:28:14 +08:00
|
|
|
.rule = rule,
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
ops->fib_rules_seq++;
|
|
|
|
|
return call_fib_notifiers(net, event_type, &info.info);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Called with rcu_read_lock() */
|
2019-10-03 17:49:30 +08:00
|
|
|
int fib_rules_dump(struct net *net, struct notifier_block *nb, int family,
|
|
|
|
|
struct netlink_ext_ack *extack)
|
2017-08-03 19:28:14 +08:00
|
|
|
{
|
|
|
|
|
struct fib_rules_ops *ops;
|
|
|
|
|
struct fib_rule *rule;
|
2019-10-03 17:49:28 +08:00
|
|
|
int err = 0;
|
2017-08-03 19:28:14 +08:00
|
|
|
|
|
|
|
|
ops = lookup_rules_ops(net, family);
|
|
|
|
|
if (!ops)
|
|
|
|
|
return -EAFNOSUPPORT;
|
2019-10-03 17:49:28 +08:00
|
|
|
list_for_each_entry_rcu(rule, &ops->rules_list, list) {
|
|
|
|
|
err = call_fib_rule_notifier(nb, FIB_EVENT_RULE_ADD,
|
2019-10-03 17:49:30 +08:00
|
|
|
rule, family, extack);
|
2019-10-03 17:49:28 +08:00
|
|
|
if (err)
|
|
|
|
|
break;
|
|
|
|
|
}
|
2017-08-03 19:28:14 +08:00
|
|
|
rules_ops_put(ops);
|
|
|
|
|
|
2019-10-03 17:49:28 +08:00
|
|
|
return err;
|
2017-08-03 19:28:14 +08:00
|
|
|
}
|
|
|
|
|
EXPORT_SYMBOL_GPL(fib_rules_dump);
|
|
|
|
|
|
|
|
|
|
unsigned int fib_rules_seq_read(struct net *net, int family)
|
|
|
|
|
{
|
|
|
|
|
unsigned int fib_rules_seq;
|
|
|
|
|
struct fib_rules_ops *ops;
|
|
|
|
|
|
|
|
|
|
ASSERT_RTNL();
|
|
|
|
|
|
|
|
|
|
ops = lookup_rules_ops(net, family);
|
|
|
|
|
if (!ops)
|
|
|
|
|
return 0;
|
|
|
|
|
fib_rules_seq = ops->fib_rules_seq;
|
|
|
|
|
rules_ops_put(ops);
|
|
|
|
|
|
|
|
|
|
return fib_rules_seq;
|
|
|
|
|
}
|
|
|
|
|
EXPORT_SYMBOL_GPL(fib_rules_seq_read);
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
static struct fib_rule *rule_find(struct fib_rules_ops *ops,
|
|
|
|
|
struct fib_rule_hdr *frh,
|
|
|
|
|
struct nlattr **tb,
|
|
|
|
|
struct fib_rule *rule,
|
|
|
|
|
bool user_priority)
|
2016-06-29 15:22:10 +08:00
|
|
|
{
|
|
|
|
|
struct fib_rule *r;
|
|
|
|
|
|
|
|
|
|
list_for_each_entry(r, &ops->rules_list, list) {
|
2018-04-22 00:41:30 +08:00
|
|
|
if (rule->action && r->action != rule->action)
|
2016-06-29 15:22:10 +08:00
|
|
|
continue;
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (rule->table && r->table != rule->table)
|
2016-06-29 15:22:10 +08:00
|
|
|
continue;
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (user_priority && r->pref != rule->pref)
|
2016-06-29 15:22:10 +08:00
|
|
|
continue;
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (rule->iifname[0] &&
|
|
|
|
|
memcmp(r->iifname, rule->iifname, IFNAMSIZ))
|
2016-06-29 15:22:10 +08:00
|
|
|
continue;
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (rule->oifname[0] &&
|
|
|
|
|
memcmp(r->oifname, rule->oifname, IFNAMSIZ))
|
2016-06-29 15:22:10 +08:00
|
|
|
continue;
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (rule->mark && r->mark != rule->mark)
|
2016-06-29 15:22:10 +08:00
|
|
|
continue;
|
|
|
|
|
|
2018-06-26 07:39:32 +08:00
|
|
|
if (rule->suppress_ifgroup != -1 &&
|
|
|
|
|
r->suppress_ifgroup != rule->suppress_ifgroup)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (rule->suppress_prefixlen != -1 &&
|
|
|
|
|
r->suppress_prefixlen != rule->suppress_prefixlen)
|
|
|
|
|
continue;
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (rule->mark_mask && r->mark_mask != rule->mark_mask)
|
2016-06-29 15:22:10 +08:00
|
|
|
continue;
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (rule->tun_id && r->tun_id != rule->tun_id)
|
2016-06-29 15:22:10 +08:00
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (r->fr_net != rule->fr_net)
|
|
|
|
|
continue;
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (rule->l3mdev && r->l3mdev != rule->l3mdev)
|
2016-06-29 15:22:10 +08:00
|
|
|
continue;
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (uid_range_set(&rule->uid_range) &&
|
|
|
|
|
(!uid_eq(r->uid_range.start, rule->uid_range.start) ||
|
|
|
|
|
!uid_eq(r->uid_range.end, rule->uid_range.end)))
|
2016-11-06 23:16:25 +08:00
|
|
|
continue;
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (rule->ip_proto && r->ip_proto != rule->ip_proto)
|
2018-03-01 11:40:16 +08:00
|
|
|
continue;
|
|
|
|
|
|
2018-06-30 05:32:15 +08:00
|
|
|
if (rule->proto && r->proto != rule->proto)
|
|
|
|
|
continue;
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (fib_rule_port_range_set(&rule->sport_range) &&
|
|
|
|
|
!fib_rule_port_range_compare(&r->sport_range,
|
2018-03-01 11:40:16 +08:00
|
|
|
&rule->sport_range))
|
|
|
|
|
continue;
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (fib_rule_port_range_set(&rule->dport_range) &&
|
|
|
|
|
!fib_rule_port_range_compare(&r->dport_range,
|
2018-03-01 11:40:16 +08:00
|
|
|
&rule->dport_range))
|
|
|
|
|
continue;
|
|
|
|
|
|
2016-06-29 15:22:10 +08:00
|
|
|
if (!ops->compare(r, frh, tb))
|
|
|
|
|
continue;
|
2018-04-22 00:41:30 +08:00
|
|
|
return r;
|
2016-06-29 15:22:10 +08:00
|
|
|
}
|
2018-04-22 00:41:30 +08:00
|
|
|
|
|
|
|
|
return NULL;
|
2016-06-29 15:22:10 +08:00
|
|
|
}
|
|
|
|
|
|
2018-04-25 09:36:07 +08:00
|
|
|
#ifdef CONFIG_NET_L3_MASTER_DEV
|
|
|
|
|
static int fib_nl2rule_l3mdev(struct nlattr *nla, struct fib_rule *nlrule,
|
|
|
|
|
struct netlink_ext_ack *extack)
|
|
|
|
|
{
|
|
|
|
|
nlrule->l3mdev = nla_get_u8(nla);
|
|
|
|
|
if (nlrule->l3mdev != 1) {
|
|
|
|
|
NL_SET_ERR_MSG(extack, "Invalid l3mdev attribute");
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
#else
|
|
|
|
|
static int fib_nl2rule_l3mdev(struct nlattr *nla, struct fib_rule *nlrule,
|
|
|
|
|
struct netlink_ext_ack *extack)
|
|
|
|
|
{
|
|
|
|
|
NL_SET_ERR_MSG(extack, "l3mdev support is not enabled in kernel");
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
static int fib_nl2rule(struct sk_buff *skb, struct nlmsghdr *nlh,
|
|
|
|
|
struct netlink_ext_ack *extack,
|
|
|
|
|
struct fib_rules_ops *ops,
|
|
|
|
|
struct nlattr *tb[],
|
|
|
|
|
struct fib_rule **rule,
|
|
|
|
|
bool *user_priority)
|
2006-08-04 18:38:38 +08:00
|
|
|
{
|
2008-03-26 01:26:21 +08:00
|
|
|
struct net *net = sock_net(skb->sk);
|
2006-08-04 18:38:38 +08:00
|
|
|
struct fib_rule_hdr *frh = nlmsg_data(nlh);
|
2018-04-22 00:41:30 +08:00
|
|
|
struct fib_rule *nlrule = NULL;
|
|
|
|
|
int err = -EINVAL;
|
2006-08-04 18:38:38 +08:00
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (frh->src_len)
|
|
|
|
|
if (!tb[FRA_SRC] ||
|
|
|
|
|
frh->src_len > (ops->addr_size * 8) ||
|
2018-04-22 00:41:31 +08:00
|
|
|
nla_len(tb[FRA_SRC]) != ops->addr_size) {
|
|
|
|
|
NL_SET_ERR_MSG(extack, "Invalid source address");
|
2018-04-22 00:41:30 +08:00
|
|
|
goto errout;
|
2018-04-22 00:41:31 +08:00
|
|
|
}
|
2006-08-04 18:38:38 +08:00
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (frh->dst_len)
|
|
|
|
|
if (!tb[FRA_DST] ||
|
|
|
|
|
frh->dst_len > (ops->addr_size * 8) ||
|
2018-04-22 00:41:31 +08:00
|
|
|
nla_len(tb[FRA_DST]) != ops->addr_size) {
|
|
|
|
|
NL_SET_ERR_MSG(extack, "Invalid dst address");
|
2018-04-22 00:41:30 +08:00
|
|
|
goto errout;
|
2018-04-22 00:41:31 +08:00
|
|
|
}
|
2007-03-25 03:46:02 +08:00
|
|
|
|
memcg: enable accounting for IP address and routing-related objects
An netadmin inside container can use 'ip a a' and 'ip r a'
to assign a large number of ipv4/ipv6 addresses and routing entries
and force kernel to allocate megabytes of unaccounted memory
for long-lived per-netdevice related kernel objects:
'struct in_ifaddr', 'struct inet6_ifaddr', 'struct fib6_node',
'struct rt6_info', 'struct fib_rules' and ip_fib caches.
These objects can be manually removed, though usually they lives
in memory till destroy of its net namespace.
It makes sense to account for them to restrict the host's memory
consumption from inside the memcg-limited container.
One of such objects is the 'struct fib6_node' mostly allocated in
net/ipv6/route.c::__ip6_ins_rt() inside the lock_bh()/unlock_bh() section:
write_lock_bh(&table->tb6_lock);
err = fib6_add(&table->tb6_root, rt, info, mxc);
write_unlock_bh(&table->tb6_lock);
In this case it is not enough to simply add SLAB_ACCOUNT to corresponding
kmem cache. The proper memory cgroup still cannot be found due to the
incorrect 'in_interrupt()' check used in memcg_kmem_bypass().
Obsoleted in_interrupt() does not describe real execution context properly.
>From include/linux/preempt.h:
The following macros are deprecated and should not be used in new code:
in_interrupt() - We're in NMI,IRQ,SoftIRQ context or have BH disabled
To verify the current execution context new macro should be used instead:
in_task() - We're in task context
Signed-off-by: Vasily Averin <vvs@virtuozzo.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2021-07-19 18:44:31 +08:00
|
|
|
nlrule = kzalloc(ops->rule_size, GFP_KERNEL_ACCOUNT);
|
2018-04-22 00:41:30 +08:00
|
|
|
if (!nlrule) {
|
2006-08-04 18:38:38 +08:00
|
|
|
err = -ENOMEM;
|
|
|
|
|
goto errout;
|
|
|
|
|
}
|
2018-04-22 00:41:30 +08:00
|
|
|
refcount_set(&nlrule->refcnt, 1);
|
|
|
|
|
nlrule->fr_net = net;
|
2006-08-04 18:38:38 +08:00
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (tb[FRA_PRIORITY]) {
|
|
|
|
|
nlrule->pref = nla_get_u32(tb[FRA_PRIORITY]);
|
|
|
|
|
*user_priority = true;
|
|
|
|
|
} else {
|
|
|
|
|
nlrule->pref = fib_default_rule_pref(ops);
|
|
|
|
|
}
|
2006-08-04 18:38:38 +08:00
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
nlrule->proto = tb[FRA_PROTOCOL] ?
|
2018-02-24 03:01:52 +08:00
|
|
|
nla_get_u8(tb[FRA_PROTOCOL]) : RTPROT_UNSPEC;
|
|
|
|
|
|
2009-12-03 09:25:54 +08:00
|
|
|
if (tb[FRA_IIFNAME]) {
|
2006-08-04 18:38:38 +08:00
|
|
|
struct net_device *dev;
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
nlrule->iifindex = -1;
|
2020-11-16 01:08:06 +08:00
|
|
|
nla_strscpy(nlrule->iifname, tb[FRA_IIFNAME], IFNAMSIZ);
|
2018-04-22 00:41:30 +08:00
|
|
|
dev = __dev_get_by_name(net, nlrule->iifname);
|
2006-08-04 18:38:38 +08:00
|
|
|
if (dev)
|
2018-04-22 00:41:30 +08:00
|
|
|
nlrule->iifindex = dev->ifindex;
|
2006-08-04 18:38:38 +08:00
|
|
|
}
|
|
|
|
|
|
2009-12-03 09:25:56 +08:00
|
|
|
if (tb[FRA_OIFNAME]) {
|
|
|
|
|
struct net_device *dev;
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
nlrule->oifindex = -1;
|
2020-11-16 01:08:06 +08:00
|
|
|
nla_strscpy(nlrule->oifname, tb[FRA_OIFNAME], IFNAMSIZ);
|
2018-04-22 00:41:30 +08:00
|
|
|
dev = __dev_get_by_name(net, nlrule->oifname);
|
2009-12-03 09:25:56 +08:00
|
|
|
if (dev)
|
2018-04-22 00:41:30 +08:00
|
|
|
nlrule->oifindex = dev->ifindex;
|
2009-12-03 09:25:56 +08:00
|
|
|
}
|
|
|
|
|
|
2006-11-10 07:22:18 +08:00
|
|
|
if (tb[FRA_FWMARK]) {
|
2018-04-22 00:41:30 +08:00
|
|
|
nlrule->mark = nla_get_u32(tb[FRA_FWMARK]);
|
|
|
|
|
if (nlrule->mark)
|
2006-11-10 07:22:18 +08:00
|
|
|
/* compatibility: if the mark value is non-zero all bits
|
|
|
|
|
* are compared unless a mask is explicitly specified.
|
|
|
|
|
*/
|
2018-04-22 00:41:30 +08:00
|
|
|
nlrule->mark_mask = 0xFFFFFFFF;
|
2006-11-10 07:22:18 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (tb[FRA_FWMASK])
|
2018-04-22 00:41:30 +08:00
|
|
|
nlrule->mark_mask = nla_get_u32(tb[FRA_FWMASK]);
|
2006-11-10 07:22:18 +08:00
|
|
|
|
2015-07-21 16:44:01 +08:00
|
|
|
if (tb[FRA_TUN_ID])
|
2018-04-22 00:41:30 +08:00
|
|
|
nlrule->tun_id = nla_get_be64(tb[FRA_TUN_ID]);
|
2015-07-21 16:44:01 +08:00
|
|
|
|
2017-04-26 22:03:50 +08:00
|
|
|
err = -EINVAL;
|
2018-04-25 09:36:07 +08:00
|
|
|
if (tb[FRA_L3MDEV] &&
|
|
|
|
|
fib_nl2rule_l3mdev(tb[FRA_L3MDEV], nlrule, extack) < 0)
|
|
|
|
|
goto errout_free;
|
2016-06-09 01:55:39 +08:00
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
nlrule->action = frh->action;
|
|
|
|
|
nlrule->flags = frh->flags;
|
|
|
|
|
nlrule->table = frh_get_table(frh, tb);
|
2013-08-03 20:14:43 +08:00
|
|
|
if (tb[FRA_SUPPRESS_PREFIXLEN])
|
2018-04-22 00:41:30 +08:00
|
|
|
nlrule->suppress_prefixlen = nla_get_u32(tb[FRA_SUPPRESS_PREFIXLEN]);
|
2013-08-03 20:14:43 +08:00
|
|
|
else
|
2018-04-22 00:41:30 +08:00
|
|
|
nlrule->suppress_prefixlen = -1;
|
2006-08-04 18:38:38 +08:00
|
|
|
|
2013-08-02 23:19:56 +08:00
|
|
|
if (tb[FRA_SUPPRESS_IFGROUP])
|
2018-04-22 00:41:30 +08:00
|
|
|
nlrule->suppress_ifgroup = nla_get_u32(tb[FRA_SUPPRESS_IFGROUP]);
|
2013-08-03 20:14:43 +08:00
|
|
|
else
|
2018-04-22 00:41:30 +08:00
|
|
|
nlrule->suppress_ifgroup = -1;
|
2013-08-02 23:19:56 +08:00
|
|
|
|
2007-03-27 08:14:15 +08:00
|
|
|
if (tb[FRA_GOTO]) {
|
2018-04-22 00:41:31 +08:00
|
|
|
if (nlrule->action != FR_ACT_GOTO) {
|
|
|
|
|
NL_SET_ERR_MSG(extack, "Unexpected goto");
|
2007-03-27 08:14:15 +08:00
|
|
|
goto errout_free;
|
2018-04-22 00:41:31 +08:00
|
|
|
}
|
2007-03-27 08:14:15 +08:00
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
nlrule->target = nla_get_u32(tb[FRA_GOTO]);
|
2007-03-27 08:14:15 +08:00
|
|
|
/* Backward jumps are prohibited to avoid endless loops */
|
2018-04-22 00:41:31 +08:00
|
|
|
if (nlrule->target <= nlrule->pref) {
|
|
|
|
|
NL_SET_ERR_MSG(extack, "Backward goto not supported");
|
2007-03-27 08:14:15 +08:00
|
|
|
goto errout_free;
|
2018-04-22 00:41:31 +08:00
|
|
|
}
|
2018-04-22 00:41:30 +08:00
|
|
|
} else if (nlrule->action == FR_ACT_GOTO) {
|
2018-04-22 00:41:31 +08:00
|
|
|
NL_SET_ERR_MSG(extack, "Missing goto target for action goto");
|
2007-03-27 08:14:15 +08:00
|
|
|
goto errout_free;
|
2018-04-22 00:41:30 +08:00
|
|
|
}
|
2007-03-27 08:14:15 +08:00
|
|
|
|
2018-04-22 00:41:31 +08:00
|
|
|
if (nlrule->l3mdev && nlrule->table) {
|
|
|
|
|
NL_SET_ERR_MSG(extack, "l3mdev and table are mutually exclusive");
|
2016-06-09 01:55:39 +08:00
|
|
|
goto errout_free;
|
2018-04-22 00:41:31 +08:00
|
|
|
}
|
2016-06-09 01:55:39 +08:00
|
|
|
|
2016-11-04 01:23:42 +08:00
|
|
|
if (tb[FRA_UID_RANGE]) {
|
|
|
|
|
if (current_user_ns() != net->user_ns) {
|
|
|
|
|
err = -EPERM;
|
2018-04-22 00:41:31 +08:00
|
|
|
NL_SET_ERR_MSG(extack, "No permission to set uid");
|
2016-11-04 01:23:42 +08:00
|
|
|
goto errout_free;
|
|
|
|
|
}
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
nlrule->uid_range = nla_get_kuid_range(tb);
|
2016-11-04 01:23:42 +08:00
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (!uid_range_set(&nlrule->uid_range) ||
|
2018-04-22 00:41:31 +08:00
|
|
|
!uid_lte(nlrule->uid_range.start, nlrule->uid_range.end)) {
|
|
|
|
|
NL_SET_ERR_MSG(extack, "Invalid uid range");
|
2016-11-04 01:23:42 +08:00
|
|
|
goto errout_free;
|
2018-04-22 00:41:31 +08:00
|
|
|
}
|
2016-11-04 01:23:42 +08:00
|
|
|
} else {
|
2018-04-22 00:41:30 +08:00
|
|
|
nlrule->uid_range = fib_kuid_range_unset;
|
2016-11-04 01:23:42 +08:00
|
|
|
}
|
|
|
|
|
|
2018-03-01 11:40:16 +08:00
|
|
|
if (tb[FRA_IP_PROTO])
|
2018-04-22 00:41:30 +08:00
|
|
|
nlrule->ip_proto = nla_get_u8(tb[FRA_IP_PROTO]);
|
2018-03-01 11:40:16 +08:00
|
|
|
|
|
|
|
|
if (tb[FRA_SPORT_RANGE]) {
|
|
|
|
|
err = nla_get_port_range(tb[FRA_SPORT_RANGE],
|
2018-04-22 00:41:30 +08:00
|
|
|
&nlrule->sport_range);
|
2018-04-22 00:41:31 +08:00
|
|
|
if (err) {
|
|
|
|
|
NL_SET_ERR_MSG(extack, "Invalid sport range");
|
2018-03-01 11:40:16 +08:00
|
|
|
goto errout_free;
|
2018-04-22 00:41:31 +08:00
|
|
|
}
|
2018-03-01 11:40:16 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (tb[FRA_DPORT_RANGE]) {
|
|
|
|
|
err = nla_get_port_range(tb[FRA_DPORT_RANGE],
|
2018-04-22 00:41:30 +08:00
|
|
|
&nlrule->dport_range);
|
2018-04-22 00:41:31 +08:00
|
|
|
if (err) {
|
|
|
|
|
NL_SET_ERR_MSG(extack, "Invalid dport range");
|
2018-03-01 11:40:16 +08:00
|
|
|
goto errout_free;
|
2018-04-22 00:41:31 +08:00
|
|
|
}
|
2018-03-01 11:40:16 +08:00
|
|
|
}
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
*rule = nlrule;
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
errout_free:
|
|
|
|
|
kfree(nlrule);
|
|
|
|
|
errout:
|
|
|
|
|
return err;
|
|
|
|
|
}
|
|
|
|
|
|
2018-06-30 05:32:15 +08:00
|
|
|
static int rule_exists(struct fib_rules_ops *ops, struct fib_rule_hdr *frh,
|
|
|
|
|
struct nlattr **tb, struct fib_rule *rule)
|
|
|
|
|
{
|
|
|
|
|
struct fib_rule *r;
|
|
|
|
|
|
|
|
|
|
list_for_each_entry(r, &ops->rules_list, list) {
|
|
|
|
|
if (r->action != rule->action)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (r->table != rule->table)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (r->pref != rule->pref)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (memcmp(r->iifname, rule->iifname, IFNAMSIZ))
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (memcmp(r->oifname, rule->oifname, IFNAMSIZ))
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (r->mark != rule->mark)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (r->suppress_ifgroup != rule->suppress_ifgroup)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (r->suppress_prefixlen != rule->suppress_prefixlen)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (r->mark_mask != rule->mark_mask)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (r->tun_id != rule->tun_id)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (r->fr_net != rule->fr_net)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (r->l3mdev != rule->l3mdev)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (!uid_eq(r->uid_range.start, rule->uid_range.start) ||
|
|
|
|
|
!uid_eq(r->uid_range.end, rule->uid_range.end))
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (r->ip_proto != rule->ip_proto)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (r->proto != rule->proto)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (!fib_rule_port_range_compare(&r->sport_range,
|
|
|
|
|
&rule->sport_range))
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (!fib_rule_port_range_compare(&r->dport_range,
|
|
|
|
|
&rule->dport_range))
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (!ops->compare(r, frh, tb))
|
|
|
|
|
continue;
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
int fib_nl_newrule(struct sk_buff *skb, struct nlmsghdr *nlh,
|
|
|
|
|
struct netlink_ext_ack *extack)
|
|
|
|
|
{
|
|
|
|
|
struct net *net = sock_net(skb->sk);
|
|
|
|
|
struct fib_rule_hdr *frh = nlmsg_data(nlh);
|
|
|
|
|
struct fib_rules_ops *ops = NULL;
|
|
|
|
|
struct fib_rule *rule = NULL, *r, *last = NULL;
|
|
|
|
|
struct nlattr *tb[FRA_MAX + 1];
|
|
|
|
|
int err = -EINVAL, unresolved = 0;
|
|
|
|
|
bool user_priority = false;
|
|
|
|
|
|
2018-04-22 00:41:31 +08:00
|
|
|
if (nlh->nlmsg_len < nlmsg_msg_size(sizeof(*frh))) {
|
|
|
|
|
NL_SET_ERR_MSG(extack, "Invalid msg length");
|
2018-04-22 00:41:30 +08:00
|
|
|
goto errout;
|
2018-04-22 00:41:31 +08:00
|
|
|
}
|
2018-04-22 00:41:30 +08:00
|
|
|
|
|
|
|
|
ops = lookup_rules_ops(net, frh->family);
|
|
|
|
|
if (!ops) {
|
|
|
|
|
err = -EAFNOSUPPORT;
|
2018-04-22 00:41:31 +08:00
|
|
|
NL_SET_ERR_MSG(extack, "Rule family not supported");
|
2018-04-22 00:41:30 +08:00
|
|
|
goto errout;
|
|
|
|
|
}
|
|
|
|
|
|
netlink: make validation more configurable for future strictness
We currently have two levels of strict validation:
1) liberal (default)
- undefined (type >= max) & NLA_UNSPEC attributes accepted
- attribute length >= expected accepted
- garbage at end of message accepted
2) strict (opt-in)
- NLA_UNSPEC attributes accepted
- attribute length >= expected accepted
Split out parsing strictness into four different options:
* TRAILING - check that there's no trailing data after parsing
attributes (in message or nested)
* MAXTYPE - reject attrs > max known type
* UNSPEC - reject attributes with NLA_UNSPEC policy entries
* STRICT_ATTRS - strictly validate attribute size
The default for future things should be *everything*.
The current *_strict() is a combination of TRAILING and MAXTYPE,
and is renamed to _deprecated_strict().
The current regular parsing has none of this, and is renamed to
*_parse_deprecated().
Additionally it allows us to selectively set one of the new flags
even on old policies. Notably, the UNSPEC flag could be useful in
this case, since it can be arranged (by filling in the policy) to
not be an incompatible userspace ABI change, but would then going
forward prevent forgetting attribute entries. Similar can apply
to the POLICY flag.
We end up with the following renames:
* nla_parse -> nla_parse_deprecated
* nla_parse_strict -> nla_parse_deprecated_strict
* nlmsg_parse -> nlmsg_parse_deprecated
* nlmsg_parse_strict -> nlmsg_parse_deprecated_strict
* nla_parse_nested -> nla_parse_nested_deprecated
* nla_validate_nested -> nla_validate_nested_deprecated
Using spatch, of course:
@@
expression TB, MAX, HEAD, LEN, POL, EXT;
@@
-nla_parse(TB, MAX, HEAD, LEN, POL, EXT)
+nla_parse_deprecated(TB, MAX, HEAD, LEN, POL, EXT)
@@
expression NLH, HDRLEN, TB, MAX, POL, EXT;
@@
-nlmsg_parse(NLH, HDRLEN, TB, MAX, POL, EXT)
+nlmsg_parse_deprecated(NLH, HDRLEN, TB, MAX, POL, EXT)
@@
expression NLH, HDRLEN, TB, MAX, POL, EXT;
@@
-nlmsg_parse_strict(NLH, HDRLEN, TB, MAX, POL, EXT)
+nlmsg_parse_deprecated_strict(NLH, HDRLEN, TB, MAX, POL, EXT)
@@
expression TB, MAX, NLA, POL, EXT;
@@
-nla_parse_nested(TB, MAX, NLA, POL, EXT)
+nla_parse_nested_deprecated(TB, MAX, NLA, POL, EXT)
@@
expression START, MAX, POL, EXT;
@@
-nla_validate_nested(START, MAX, POL, EXT)
+nla_validate_nested_deprecated(START, MAX, POL, EXT)
@@
expression NLH, HDRLEN, MAX, POL, EXT;
@@
-nlmsg_validate(NLH, HDRLEN, MAX, POL, EXT)
+nlmsg_validate_deprecated(NLH, HDRLEN, MAX, POL, EXT)
For this patch, don't actually add the strict, non-renamed versions
yet so that it breaks compile if I get it wrong.
Also, while at it, make nla_validate and nla_parse go down to a
common __nla_validate_parse() function to avoid code duplication.
Ultimately, this allows us to have very strict validation for every
new caller of nla_parse()/nlmsg_parse() etc as re-introduced in the
next patch, while existing things will continue to work as is.
In effect then, this adds fully strict validation for any new command.
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2019-04-26 20:07:28 +08:00
|
|
|
err = nlmsg_parse_deprecated(nlh, sizeof(*frh), tb, FRA_MAX,
|
|
|
|
|
ops->policy, extack);
|
2018-04-22 00:41:31 +08:00
|
|
|
if (err < 0) {
|
|
|
|
|
NL_SET_ERR_MSG(extack, "Error parsing msg");
|
2018-04-22 00:41:30 +08:00
|
|
|
goto errout;
|
2018-04-22 00:41:31 +08:00
|
|
|
}
|
2018-04-22 00:41:30 +08:00
|
|
|
|
|
|
|
|
err = fib_nl2rule(skb, nlh, extack, ops, tb, &rule, &user_priority);
|
|
|
|
|
if (err)
|
|
|
|
|
goto errout;
|
|
|
|
|
|
2019-06-05 12:27:14 +08:00
|
|
|
if ((nlh->nlmsg_flags & NLM_F_EXCL) &&
|
|
|
|
|
rule_exists(ops, frh, tb, rule)) {
|
|
|
|
|
err = -EEXIST;
|
2016-06-29 15:22:10 +08:00
|
|
|
goto errout_free;
|
|
|
|
|
}
|
|
|
|
|
|
2018-04-22 00:41:31 +08:00
|
|
|
err = ops->configure(rule, skb, frh, tb, extack);
|
2006-08-04 18:38:38 +08:00
|
|
|
if (err < 0)
|
|
|
|
|
goto errout_free;
|
|
|
|
|
|
2018-03-28 09:21:56 +08:00
|
|
|
err = call_fib_rule_notifiers(net, FIB_EVENT_RULE_ADD, rule, ops,
|
|
|
|
|
extack);
|
|
|
|
|
if (err < 0)
|
|
|
|
|
goto errout_free;
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
list_for_each_entry(r, &ops->rules_list, list) {
|
|
|
|
|
if (r->pref == rule->target) {
|
|
|
|
|
RCU_INIT_POINTER(rule->ctarget, r);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (rcu_dereference_protected(rule->ctarget, 1) == NULL)
|
|
|
|
|
unresolved = 1;
|
|
|
|
|
|
2007-09-17 06:44:27 +08:00
|
|
|
list_for_each_entry(r, &ops->rules_list, list) {
|
2006-08-04 18:38:38 +08:00
|
|
|
if (r->pref > rule->pref)
|
|
|
|
|
break;
|
|
|
|
|
last = r;
|
|
|
|
|
}
|
|
|
|
|
|
2010-10-23 17:44:25 +08:00
|
|
|
if (last)
|
|
|
|
|
list_add_rcu(&rule->list, &last->list);
|
|
|
|
|
else
|
|
|
|
|
list_add_rcu(&rule->list, &ops->rules_list);
|
|
|
|
|
|
2007-03-27 08:14:15 +08:00
|
|
|
if (ops->unresolved_rules) {
|
|
|
|
|
/*
|
|
|
|
|
* There are unresolved goto rules in the list, check if
|
|
|
|
|
* any of them are pointing to this new rule.
|
|
|
|
|
*/
|
2007-09-17 06:44:27 +08:00
|
|
|
list_for_each_entry(r, &ops->rules_list, list) {
|
2007-03-27 08:14:15 +08:00
|
|
|
if (r->action == FR_ACT_GOTO &&
|
2011-09-11 23:36:05 +08:00
|
|
|
r->target == rule->pref &&
|
|
|
|
|
rtnl_dereference(r->ctarget) == NULL) {
|
2007-03-27 08:14:15 +08:00
|
|
|
rcu_assign_pointer(r->ctarget, rule);
|
|
|
|
|
if (--ops->unresolved_rules == 0)
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (rule->action == FR_ACT_GOTO)
|
|
|
|
|
ops->nr_goto_rules++;
|
|
|
|
|
|
|
|
|
|
if (unresolved)
|
|
|
|
|
ops->unresolved_rules++;
|
|
|
|
|
|
2015-07-21 16:44:01 +08:00
|
|
|
if (rule->tun_id)
|
|
|
|
|
ip_tunnel_need_metadata();
|
|
|
|
|
|
2012-09-08 04:12:54 +08:00
|
|
|
notify_rule_change(RTM_NEWRULE, rule, ops, nlh, NETLINK_CB(skb).portid);
|
2007-03-28 04:56:52 +08:00
|
|
|
flush_route_cache(ops);
|
2006-08-04 18:38:38 +08:00
|
|
|
rules_ops_put(ops);
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
errout_free:
|
|
|
|
|
kfree(rule);
|
|
|
|
|
errout:
|
|
|
|
|
rules_ops_put(ops);
|
|
|
|
|
return err;
|
|
|
|
|
}
|
2016-06-09 01:55:39 +08:00
|
|
|
EXPORT_SYMBOL_GPL(fib_nl_newrule);
|
2006-08-04 18:38:38 +08:00
|
|
|
|
2017-04-17 00:48:24 +08:00
|
|
|
int fib_nl_delrule(struct sk_buff *skb, struct nlmsghdr *nlh,
|
|
|
|
|
struct netlink_ext_ack *extack)
|
2006-08-04 18:38:38 +08:00
|
|
|
{
|
2008-03-26 01:26:21 +08:00
|
|
|
struct net *net = sock_net(skb->sk);
|
2006-08-04 18:38:38 +08:00
|
|
|
struct fib_rule_hdr *frh = nlmsg_data(nlh);
|
|
|
|
|
struct fib_rules_ops *ops = NULL;
|
2018-04-22 00:41:30 +08:00
|
|
|
struct fib_rule *rule = NULL, *r, *nlrule = NULL;
|
2006-08-04 18:38:38 +08:00
|
|
|
struct nlattr *tb[FRA_MAX+1];
|
|
|
|
|
int err = -EINVAL;
|
2018-04-22 00:41:30 +08:00
|
|
|
bool user_priority = false;
|
2006-08-04 18:38:38 +08:00
|
|
|
|
2018-04-22 00:41:31 +08:00
|
|
|
if (nlh->nlmsg_len < nlmsg_msg_size(sizeof(*frh))) {
|
|
|
|
|
NL_SET_ERR_MSG(extack, "Invalid msg length");
|
2006-08-04 18:38:38 +08:00
|
|
|
goto errout;
|
2018-04-22 00:41:31 +08:00
|
|
|
}
|
2006-08-04 18:38:38 +08:00
|
|
|
|
2008-01-10 19:20:28 +08:00
|
|
|
ops = lookup_rules_ops(net, frh->family);
|
2006-08-04 18:38:38 +08:00
|
|
|
if (ops == NULL) {
|
2008-07-02 10:59:37 +08:00
|
|
|
err = -EAFNOSUPPORT;
|
2018-04-22 00:41:31 +08:00
|
|
|
NL_SET_ERR_MSG(extack, "Rule family not supported");
|
2006-08-04 18:38:38 +08:00
|
|
|
goto errout;
|
|
|
|
|
}
|
|
|
|
|
|
netlink: make validation more configurable for future strictness
We currently have two levels of strict validation:
1) liberal (default)
- undefined (type >= max) & NLA_UNSPEC attributes accepted
- attribute length >= expected accepted
- garbage at end of message accepted
2) strict (opt-in)
- NLA_UNSPEC attributes accepted
- attribute length >= expected accepted
Split out parsing strictness into four different options:
* TRAILING - check that there's no trailing data after parsing
attributes (in message or nested)
* MAXTYPE - reject attrs > max known type
* UNSPEC - reject attributes with NLA_UNSPEC policy entries
* STRICT_ATTRS - strictly validate attribute size
The default for future things should be *everything*.
The current *_strict() is a combination of TRAILING and MAXTYPE,
and is renamed to _deprecated_strict().
The current regular parsing has none of this, and is renamed to
*_parse_deprecated().
Additionally it allows us to selectively set one of the new flags
even on old policies. Notably, the UNSPEC flag could be useful in
this case, since it can be arranged (by filling in the policy) to
not be an incompatible userspace ABI change, but would then going
forward prevent forgetting attribute entries. Similar can apply
to the POLICY flag.
We end up with the following renames:
* nla_parse -> nla_parse_deprecated
* nla_parse_strict -> nla_parse_deprecated_strict
* nlmsg_parse -> nlmsg_parse_deprecated
* nlmsg_parse_strict -> nlmsg_parse_deprecated_strict
* nla_parse_nested -> nla_parse_nested_deprecated
* nla_validate_nested -> nla_validate_nested_deprecated
Using spatch, of course:
@@
expression TB, MAX, HEAD, LEN, POL, EXT;
@@
-nla_parse(TB, MAX, HEAD, LEN, POL, EXT)
+nla_parse_deprecated(TB, MAX, HEAD, LEN, POL, EXT)
@@
expression NLH, HDRLEN, TB, MAX, POL, EXT;
@@
-nlmsg_parse(NLH, HDRLEN, TB, MAX, POL, EXT)
+nlmsg_parse_deprecated(NLH, HDRLEN, TB, MAX, POL, EXT)
@@
expression NLH, HDRLEN, TB, MAX, POL, EXT;
@@
-nlmsg_parse_strict(NLH, HDRLEN, TB, MAX, POL, EXT)
+nlmsg_parse_deprecated_strict(NLH, HDRLEN, TB, MAX, POL, EXT)
@@
expression TB, MAX, NLA, POL, EXT;
@@
-nla_parse_nested(TB, MAX, NLA, POL, EXT)
+nla_parse_nested_deprecated(TB, MAX, NLA, POL, EXT)
@@
expression START, MAX, POL, EXT;
@@
-nla_validate_nested(START, MAX, POL, EXT)
+nla_validate_nested_deprecated(START, MAX, POL, EXT)
@@
expression NLH, HDRLEN, MAX, POL, EXT;
@@
-nlmsg_validate(NLH, HDRLEN, MAX, POL, EXT)
+nlmsg_validate_deprecated(NLH, HDRLEN, MAX, POL, EXT)
For this patch, don't actually add the strict, non-renamed versions
yet so that it breaks compile if I get it wrong.
Also, while at it, make nla_validate and nla_parse go down to a
common __nla_validate_parse() function to avoid code duplication.
Ultimately, this allows us to have very strict validation for every
new caller of nla_parse()/nlmsg_parse() etc as re-introduced in the
next patch, while existing things will continue to work as is.
In effect then, this adds fully strict validation for any new command.
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2019-04-26 20:07:28 +08:00
|
|
|
err = nlmsg_parse_deprecated(nlh, sizeof(*frh), tb, FRA_MAX,
|
|
|
|
|
ops->policy, extack);
|
2018-04-22 00:41:31 +08:00
|
|
|
if (err < 0) {
|
|
|
|
|
NL_SET_ERR_MSG(extack, "Error parsing msg");
|
2006-08-04 18:38:38 +08:00
|
|
|
goto errout;
|
2018-04-22 00:41:31 +08:00
|
|
|
}
|
2006-08-04 18:38:38 +08:00
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
err = fib_nl2rule(skb, nlh, extack, ops, tb, &nlrule, &user_priority);
|
|
|
|
|
if (err)
|
2007-03-25 03:46:02 +08:00
|
|
|
goto errout;
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
rule = rule_find(ops, frh, tb, nlrule, user_priority);
|
|
|
|
|
if (!rule) {
|
|
|
|
|
err = -ENOENT;
|
|
|
|
|
goto errout;
|
2016-11-04 01:23:42 +08:00
|
|
|
}
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (rule->flags & FIB_RULE_PERMANENT) {
|
|
|
|
|
err = -EPERM;
|
|
|
|
|
goto errout;
|
2018-03-01 11:40:16 +08:00
|
|
|
}
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (ops->delete) {
|
|
|
|
|
err = ops->delete(rule);
|
2018-03-01 11:40:16 +08:00
|
|
|
if (err)
|
|
|
|
|
goto errout;
|
|
|
|
|
}
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (rule->tun_id)
|
|
|
|
|
ip_tunnel_unneed_metadata();
|
2015-03-07 05:47:00 +08:00
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
list_del_rcu(&rule->list);
|
2015-07-21 16:44:01 +08:00
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
if (rule->action == FR_ACT_GOTO) {
|
|
|
|
|
ops->nr_goto_rules--;
|
|
|
|
|
if (rtnl_dereference(rule->ctarget) == NULL)
|
|
|
|
|
ops->unresolved_rules--;
|
|
|
|
|
}
|
2007-03-27 08:14:15 +08:00
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
/*
|
|
|
|
|
* Check if this rule is a target to any of them. If so,
|
|
|
|
|
* adjust to the next one with the same preference or
|
|
|
|
|
* disable them. As this operation is eventually very
|
|
|
|
|
* expensive, it is only performed if goto rules, except
|
|
|
|
|
* current if it is goto rule, have actually been added.
|
|
|
|
|
*/
|
|
|
|
|
if (ops->nr_goto_rules > 0) {
|
|
|
|
|
struct fib_rule *n;
|
|
|
|
|
|
|
|
|
|
n = list_next_entry(rule, list);
|
|
|
|
|
if (&n->list == &ops->rules_list || n->pref != rule->pref)
|
|
|
|
|
n = NULL;
|
|
|
|
|
list_for_each_entry(r, &ops->rules_list, list) {
|
|
|
|
|
if (rtnl_dereference(r->ctarget) != rule)
|
|
|
|
|
continue;
|
|
|
|
|
rcu_assign_pointer(r->ctarget, n);
|
|
|
|
|
if (!n)
|
|
|
|
|
ops->unresolved_rules++;
|
2007-03-27 08:14:15 +08:00
|
|
|
}
|
2006-08-04 18:38:38 +08:00
|
|
|
}
|
|
|
|
|
|
2018-04-22 00:41:30 +08:00
|
|
|
call_fib_rule_notifiers(net, FIB_EVENT_RULE_DEL, rule, ops,
|
|
|
|
|
NULL);
|
|
|
|
|
notify_rule_change(RTM_DELRULE, rule, ops, nlh,
|
|
|
|
|
NETLINK_CB(skb).portid);
|
|
|
|
|
fib_rule_put(rule);
|
|
|
|
|
flush_route_cache(ops);
|
|
|
|
|
rules_ops_put(ops);
|
|
|
|
|
kfree(nlrule);
|
|
|
|
|
return 0;
|
|
|
|
|
|
2006-08-04 18:38:38 +08:00
|
|
|
errout:
|
2018-07-30 21:07:24 +08:00
|
|
|
kfree(nlrule);
|
2006-08-04 18:38:38 +08:00
|
|
|
rules_ops_put(ops);
|
|
|
|
|
return err;
|
|
|
|
|
}
|
2016-06-09 01:55:39 +08:00
|
|
|
EXPORT_SYMBOL_GPL(fib_nl_delrule);
|
2006-08-04 18:38:38 +08:00
|
|
|
|
2006-11-11 06:10:15 +08:00
|
|
|
static inline size_t fib_rule_nlmsg_size(struct fib_rules_ops *ops,
|
|
|
|
|
struct fib_rule *rule)
|
|
|
|
|
{
|
|
|
|
|
size_t payload = NLMSG_ALIGN(sizeof(struct fib_rule_hdr))
|
2009-12-03 09:25:54 +08:00
|
|
|
+ nla_total_size(IFNAMSIZ) /* FRA_IIFNAME */
|
2009-12-03 09:25:56 +08:00
|
|
|
+ nla_total_size(IFNAMSIZ) /* FRA_OIFNAME */
|
2006-11-11 06:10:15 +08:00
|
|
|
+ nla_total_size(4) /* FRA_PRIORITY */
|
|
|
|
|
+ nla_total_size(4) /* FRA_TABLE */
|
2013-08-03 20:14:43 +08:00
|
|
|
+ nla_total_size(4) /* FRA_SUPPRESS_PREFIXLEN */
|
2013-08-02 23:19:56 +08:00
|
|
|
+ nla_total_size(4) /* FRA_SUPPRESS_IFGROUP */
|
2006-11-11 06:10:15 +08:00
|
|
|
+ nla_total_size(4) /* FRA_FWMARK */
|
2015-07-21 16:44:01 +08:00
|
|
|
+ nla_total_size(4) /* FRA_FWMASK */
|
2016-11-04 01:23:42 +08:00
|
|
|
+ nla_total_size_64bit(8) /* FRA_TUN_ID */
|
2018-02-24 03:01:52 +08:00
|
|
|
+ nla_total_size(sizeof(struct fib_kuid_range))
|
2018-03-01 11:40:16 +08:00
|
|
|
+ nla_total_size(1) /* FRA_PROTOCOL */
|
|
|
|
|
+ nla_total_size(1) /* FRA_IP_PROTO */
|
|
|
|
|
+ nla_total_size(sizeof(struct fib_rule_port_range)) /* FRA_SPORT_RANGE */
|
|
|
|
|
+ nla_total_size(sizeof(struct fib_rule_port_range)); /* FRA_DPORT_RANGE */
|
2006-11-11 06:10:15 +08:00
|
|
|
|
|
|
|
|
if (ops->nlmsg_payload)
|
|
|
|
|
payload += ops->nlmsg_payload(rule);
|
|
|
|
|
|
|
|
|
|
return payload;
|
|
|
|
|
}
|
|
|
|
|
|
2006-08-04 18:38:38 +08:00
|
|
|
static int fib_nl_fill_rule(struct sk_buff *skb, struct fib_rule *rule,
|
|
|
|
|
u32 pid, u32 seq, int type, int flags,
|
|
|
|
|
struct fib_rules_ops *ops)
|
|
|
|
|
{
|
|
|
|
|
struct nlmsghdr *nlh;
|
|
|
|
|
struct fib_rule_hdr *frh;
|
|
|
|
|
|
|
|
|
|
nlh = nlmsg_put(skb, pid, seq, type, sizeof(*frh), flags);
|
|
|
|
|
if (nlh == NULL)
|
2007-02-01 15:16:40 +08:00
|
|
|
return -EMSGSIZE;
|
2006-08-04 18:38:38 +08:00
|
|
|
|
|
|
|
|
frh = nlmsg_data(nlh);
|
2010-04-13 13:03:16 +08:00
|
|
|
frh->family = ops->family;
|
2020-02-12 23:43:41 +08:00
|
|
|
frh->table = rule->table < 256 ? rule->table : RT_TABLE_COMPAT;
|
2012-04-02 08:47:01 +08:00
|
|
|
if (nla_put_u32(skb, FRA_TABLE, rule->table))
|
|
|
|
|
goto nla_put_failure;
|
2013-08-03 20:14:43 +08:00
|
|
|
if (nla_put_u32(skb, FRA_SUPPRESS_PREFIXLEN, rule->suppress_prefixlen))
|
2013-08-01 08:17:15 +08:00
|
|
|
goto nla_put_failure;
|
2006-08-04 18:38:38 +08:00
|
|
|
frh->res1 = 0;
|
2018-02-24 03:01:52 +08:00
|
|
|
frh->res2 = 0;
|
2006-08-04 18:38:38 +08:00
|
|
|
frh->action = rule->action;
|
|
|
|
|
frh->flags = rule->flags;
|
2018-02-24 03:01:52 +08:00
|
|
|
|
|
|
|
|
if (nla_put_u8(skb, FRA_PROTOCOL, rule->proto))
|
|
|
|
|
goto nla_put_failure;
|
2006-08-04 18:38:38 +08:00
|
|
|
|
2010-10-26 17:24:55 +08:00
|
|
|
if (rule->action == FR_ACT_GOTO &&
|
2011-08-12 03:30:52 +08:00
|
|
|
rcu_access_pointer(rule->ctarget) == NULL)
|
2007-03-27 08:14:15 +08:00
|
|
|
frh->flags |= FIB_RULE_UNRESOLVED;
|
|
|
|
|
|
2009-12-03 09:25:54 +08:00
|
|
|
if (rule->iifname[0]) {
|
2012-04-02 08:47:01 +08:00
|
|
|
if (nla_put_string(skb, FRA_IIFNAME, rule->iifname))
|
|
|
|
|
goto nla_put_failure;
|
2009-12-03 09:25:54 +08:00
|
|
|
if (rule->iifindex == -1)
|
|
|
|
|
frh->flags |= FIB_RULE_IIF_DETACHED;
|
2007-03-27 08:37:59 +08:00
|
|
|
}
|
|
|
|
|
|
2009-12-03 09:25:56 +08:00
|
|
|
if (rule->oifname[0]) {
|
2012-04-02 08:47:01 +08:00
|
|
|
if (nla_put_string(skb, FRA_OIFNAME, rule->oifname))
|
|
|
|
|
goto nla_put_failure;
|
2009-12-03 09:25:56 +08:00
|
|
|
if (rule->oifindex == -1)
|
|
|
|
|
frh->flags |= FIB_RULE_OIF_DETACHED;
|
|
|
|
|
}
|
|
|
|
|
|
2012-04-02 08:47:01 +08:00
|
|
|
if ((rule->pref &&
|
|
|
|
|
nla_put_u32(skb, FRA_PRIORITY, rule->pref)) ||
|
|
|
|
|
(rule->mark &&
|
|
|
|
|
nla_put_u32(skb, FRA_FWMARK, rule->mark)) ||
|
|
|
|
|
((rule->mark_mask || rule->mark) &&
|
|
|
|
|
nla_put_u32(skb, FRA_FWMASK, rule->mark_mask)) ||
|
|
|
|
|
(rule->target &&
|
2015-07-21 16:44:01 +08:00
|
|
|
nla_put_u32(skb, FRA_GOTO, rule->target)) ||
|
|
|
|
|
(rule->tun_id &&
|
2016-06-09 01:55:39 +08:00
|
|
|
nla_put_be64(skb, FRA_TUN_ID, rule->tun_id, FRA_PAD)) ||
|
|
|
|
|
(rule->l3mdev &&
|
2016-11-04 01:23:42 +08:00
|
|
|
nla_put_u8(skb, FRA_L3MDEV, rule->l3mdev)) ||
|
|
|
|
|
(uid_range_set(&rule->uid_range) &&
|
2018-03-01 11:40:16 +08:00
|
|
|
nla_put_uid_range(skb, &rule->uid_range)) ||
|
|
|
|
|
(fib_rule_port_range_set(&rule->sport_range) &&
|
|
|
|
|
nla_put_port_range(skb, FRA_SPORT_RANGE, &rule->sport_range)) ||
|
|
|
|
|
(fib_rule_port_range_set(&rule->dport_range) &&
|
|
|
|
|
nla_put_port_range(skb, FRA_DPORT_RANGE, &rule->dport_range)) ||
|
|
|
|
|
(rule->ip_proto && nla_put_u8(skb, FRA_IP_PROTO, rule->ip_proto)))
|
2012-04-02 08:47:01 +08:00
|
|
|
goto nla_put_failure;
|
2013-08-02 23:19:56 +08:00
|
|
|
|
|
|
|
|
if (rule->suppress_ifgroup != -1) {
|
|
|
|
|
if (nla_put_u32(skb, FRA_SUPPRESS_IFGROUP, rule->suppress_ifgroup))
|
|
|
|
|
goto nla_put_failure;
|
|
|
|
|
}
|
|
|
|
|
|
2009-05-21 08:26:23 +08:00
|
|
|
if (ops->fill(rule, skb, frh) < 0)
|
2006-08-04 18:38:38 +08:00
|
|
|
goto nla_put_failure;
|
|
|
|
|
|
2015-01-17 05:09:00 +08:00
|
|
|
nlmsg_end(skb, nlh);
|
|
|
|
|
return 0;
|
2006-08-04 18:38:38 +08:00
|
|
|
|
|
|
|
|
nla_put_failure:
|
2007-02-01 15:16:40 +08:00
|
|
|
nlmsg_cancel(skb, nlh);
|
|
|
|
|
return -EMSGSIZE;
|
2006-08-04 18:38:38 +08:00
|
|
|
}
|
|
|
|
|
|
2007-03-26 14:24:24 +08:00
|
|
|
static int dump_rules(struct sk_buff *skb, struct netlink_callback *cb,
|
|
|
|
|
struct fib_rules_ops *ops)
|
2006-08-04 18:38:38 +08:00
|
|
|
{
|
|
|
|
|
int idx = 0;
|
|
|
|
|
struct fib_rule *rule;
|
2015-09-23 12:40:22 +08:00
|
|
|
int err = 0;
|
2006-08-04 18:38:38 +08:00
|
|
|
|
2011-04-28 06:56:07 +08:00
|
|
|
rcu_read_lock();
|
|
|
|
|
list_for_each_entry_rcu(rule, &ops->rules_list, list) {
|
2007-03-26 14:24:24 +08:00
|
|
|
if (idx < cb->args[1])
|
2006-08-04 18:38:38 +08:00
|
|
|
goto skip;
|
|
|
|
|
|
2015-09-23 12:40:22 +08:00
|
|
|
err = fib_nl_fill_rule(skb, rule, NETLINK_CB(cb->skb).portid,
|
|
|
|
|
cb->nlh->nlmsg_seq, RTM_NEWRULE,
|
|
|
|
|
NLM_F_MULTI, ops);
|
|
|
|
|
if (err)
|
2006-08-04 18:38:38 +08:00
|
|
|
break;
|
|
|
|
|
skip:
|
|
|
|
|
idx++;
|
|
|
|
|
}
|
2011-05-25 15:34:04 +08:00
|
|
|
rcu_read_unlock();
|
2007-03-26 14:24:24 +08:00
|
|
|
cb->args[1] = idx;
|
2006-08-04 18:38:38 +08:00
|
|
|
rules_ops_put(ops);
|
|
|
|
|
|
2015-09-23 12:40:22 +08:00
|
|
|
return err;
|
2006-08-04 18:38:38 +08:00
|
|
|
}
|
|
|
|
|
|
2018-10-08 11:16:39 +08:00
|
|
|
static int fib_valid_dumprule_req(const struct nlmsghdr *nlh,
|
|
|
|
|
struct netlink_ext_ack *extack)
|
|
|
|
|
{
|
|
|
|
|
struct fib_rule_hdr *frh;
|
|
|
|
|
|
|
|
|
|
if (nlh->nlmsg_len < nlmsg_msg_size(sizeof(*frh))) {
|
|
|
|
|
NL_SET_ERR_MSG(extack, "Invalid header for fib rule dump request");
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
frh = nlmsg_data(nlh);
|
|
|
|
|
if (frh->dst_len || frh->src_len || frh->tos || frh->table ||
|
|
|
|
|
frh->res1 || frh->res2 || frh->action || frh->flags) {
|
|
|
|
|
NL_SET_ERR_MSG(extack,
|
|
|
|
|
"Invalid values in header for fib rule dump request");
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (nlmsg_attrlen(nlh, sizeof(*frh))) {
|
|
|
|
|
NL_SET_ERR_MSG(extack, "Invalid data after header in fib rule dump request");
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2007-03-26 14:24:24 +08:00
|
|
|
static int fib_nl_dumprule(struct sk_buff *skb, struct netlink_callback *cb)
|
|
|
|
|
{
|
2018-10-08 11:16:39 +08:00
|
|
|
const struct nlmsghdr *nlh = cb->nlh;
|
2008-03-26 01:26:21 +08:00
|
|
|
struct net *net = sock_net(skb->sk);
|
2007-03-26 14:24:24 +08:00
|
|
|
struct fib_rules_ops *ops;
|
|
|
|
|
int idx = 0, family;
|
|
|
|
|
|
2018-10-08 11:16:39 +08:00
|
|
|
if (cb->strict_check) {
|
|
|
|
|
int err = fib_valid_dumprule_req(nlh, cb->extack);
|
|
|
|
|
|
|
|
|
|
if (err < 0)
|
|
|
|
|
return err;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
family = rtnl_msg_family(nlh);
|
2007-03-26 14:24:24 +08:00
|
|
|
if (family != AF_UNSPEC) {
|
|
|
|
|
/* Protocol specific dump request */
|
2008-01-10 19:20:28 +08:00
|
|
|
ops = lookup_rules_ops(net, family);
|
2007-03-26 14:24:24 +08:00
|
|
|
if (ops == NULL)
|
|
|
|
|
return -EAFNOSUPPORT;
|
|
|
|
|
|
2015-09-23 12:40:22 +08:00
|
|
|
dump_rules(skb, cb, ops);
|
|
|
|
|
|
|
|
|
|
return skb->len;
|
2007-03-26 14:24:24 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
rcu_read_lock();
|
2008-01-10 19:20:28 +08:00
|
|
|
list_for_each_entry_rcu(ops, &net->rules_ops, list) {
|
2007-03-26 14:24:24 +08:00
|
|
|
if (idx < cb->args[0] || !try_module_get(ops->owner))
|
|
|
|
|
goto skip;
|
|
|
|
|
|
|
|
|
|
if (dump_rules(skb, cb, ops) < 0)
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
cb->args[1] = 0;
|
2010-03-10 04:03:38 +08:00
|
|
|
skip:
|
2007-03-26 14:24:24 +08:00
|
|
|
idx++;
|
|
|
|
|
}
|
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
cb->args[0] = idx;
|
|
|
|
|
|
|
|
|
|
return skb->len;
|
|
|
|
|
}
|
2006-08-04 18:38:38 +08:00
|
|
|
|
2008-01-21 08:46:41 +08:00
|
|
|
static void notify_rule_change(int event, struct fib_rule *rule,
|
2006-08-15 15:32:48 +08:00
|
|
|
struct fib_rules_ops *ops, struct nlmsghdr *nlh,
|
|
|
|
|
u32 pid)
|
2006-08-04 18:38:38 +08:00
|
|
|
{
|
2008-01-21 08:46:41 +08:00
|
|
|
struct net *net;
|
2006-08-15 15:32:48 +08:00
|
|
|
struct sk_buff *skb;
|
2021-06-02 22:06:58 +08:00
|
|
|
int err = -ENOMEM;
|
2006-08-04 18:38:38 +08:00
|
|
|
|
2008-01-21 08:46:41 +08:00
|
|
|
net = ops->fro_net;
|
2006-11-11 06:10:15 +08:00
|
|
|
skb = nlmsg_new(fib_rule_nlmsg_size(ops, rule), GFP_KERNEL);
|
2006-08-04 18:38:38 +08:00
|
|
|
if (skb == NULL)
|
2006-08-15 15:32:48 +08:00
|
|
|
goto errout;
|
|
|
|
|
|
|
|
|
|
err = fib_nl_fill_rule(skb, rule, pid, nlh->nlmsg_seq, event, 0, ops);
|
2007-02-01 15:16:40 +08:00
|
|
|
if (err < 0) {
|
|
|
|
|
/* -EMSGSIZE implies BUG in fib_rule_nlmsg_size() */
|
|
|
|
|
WARN_ON(err == -EMSGSIZE);
|
|
|
|
|
kfree_skb(skb);
|
|
|
|
|
goto errout;
|
|
|
|
|
}
|
2008-01-21 08:46:41 +08:00
|
|
|
|
2009-02-25 15:18:28 +08:00
|
|
|
rtnl_notify(skb, net, pid, ops->nlgroup, nlh, GFP_KERNEL);
|
|
|
|
|
return;
|
2006-08-15 15:32:48 +08:00
|
|
|
errout:
|
|
|
|
|
if (err < 0)
|
2008-01-10 19:20:28 +08:00
|
|
|
rtnl_set_sk_err(net, ops->nlgroup, err);
|
2006-08-04 18:38:38 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void attach_rules(struct list_head *rules, struct net_device *dev)
|
|
|
|
|
{
|
|
|
|
|
struct fib_rule *rule;
|
|
|
|
|
|
|
|
|
|
list_for_each_entry(rule, rules, list) {
|
2009-12-03 09:25:54 +08:00
|
|
|
if (rule->iifindex == -1 &&
|
|
|
|
|
strcmp(dev->name, rule->iifname) == 0)
|
|
|
|
|
rule->iifindex = dev->ifindex;
|
2009-12-03 09:25:56 +08:00
|
|
|
if (rule->oifindex == -1 &&
|
|
|
|
|
strcmp(dev->name, rule->oifname) == 0)
|
|
|
|
|
rule->oifindex = dev->ifindex;
|
2006-08-04 18:38:38 +08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void detach_rules(struct list_head *rules, struct net_device *dev)
|
|
|
|
|
{
|
|
|
|
|
struct fib_rule *rule;
|
|
|
|
|
|
2009-12-03 09:25:56 +08:00
|
|
|
list_for_each_entry(rule, rules, list) {
|
2009-12-03 09:25:54 +08:00
|
|
|
if (rule->iifindex == dev->ifindex)
|
|
|
|
|
rule->iifindex = -1;
|
2009-12-03 09:25:56 +08:00
|
|
|
if (rule->oifindex == dev->ifindex)
|
|
|
|
|
rule->oifindex = -1;
|
|
|
|
|
}
|
2006-08-04 18:38:38 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static int fib_rules_event(struct notifier_block *this, unsigned long event,
|
2013-05-28 09:30:21 +08:00
|
|
|
void *ptr)
|
2006-08-04 18:38:38 +08:00
|
|
|
{
|
2013-05-28 09:30:21 +08:00
|
|
|
struct net_device *dev = netdev_notifier_info_to_dev(ptr);
|
2008-03-25 20:47:49 +08:00
|
|
|
struct net *net = dev_net(dev);
|
2006-08-04 18:38:38 +08:00
|
|
|
struct fib_rules_ops *ops;
|
|
|
|
|
|
2012-08-23 05:50:59 +08:00
|
|
|
ASSERT_RTNL();
|
2006-08-04 18:38:38 +08:00
|
|
|
|
|
|
|
|
switch (event) {
|
|
|
|
|
case NETDEV_REGISTER:
|
2008-01-10 19:20:28 +08:00
|
|
|
list_for_each_entry(ops, &net->rules_ops, list)
|
2007-09-17 06:44:27 +08:00
|
|
|
attach_rules(&ops->rules_list, dev);
|
2006-08-04 18:38:38 +08:00
|
|
|
break;
|
|
|
|
|
|
2014-02-08 08:23:48 +08:00
|
|
|
case NETDEV_CHANGENAME:
|
|
|
|
|
list_for_each_entry(ops, &net->rules_ops, list) {
|
|
|
|
|
detach_rules(&ops->rules_list, dev);
|
|
|
|
|
attach_rules(&ops->rules_list, dev);
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
2006-08-04 18:38:38 +08:00
|
|
|
case NETDEV_UNREGISTER:
|
2008-01-10 19:20:28 +08:00
|
|
|
list_for_each_entry(ops, &net->rules_ops, list)
|
2007-09-17 06:44:27 +08:00
|
|
|
detach_rules(&ops->rules_list, dev);
|
2006-08-04 18:38:38 +08:00
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return NOTIFY_DONE;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static struct notifier_block fib_rules_notifier = {
|
|
|
|
|
.notifier_call = fib_rules_event,
|
|
|
|
|
};
|
|
|
|
|
|
2010-01-17 11:35:32 +08:00
|
|
|
static int __net_init fib_rules_net_init(struct net *net)
|
2008-01-10 19:20:28 +08:00
|
|
|
{
|
|
|
|
|
INIT_LIST_HEAD(&net->rules_ops);
|
|
|
|
|
spin_lock_init(&net->rules_mod_lock);
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2017-11-13 03:30:01 +08:00
|
|
|
static void __net_exit fib_rules_net_exit(struct net *net)
|
|
|
|
|
{
|
|
|
|
|
WARN_ON_ONCE(!list_empty(&net->rules_ops));
|
|
|
|
|
}
|
|
|
|
|
|
2008-01-10 19:20:28 +08:00
|
|
|
static struct pernet_operations fib_rules_net_ops = {
|
|
|
|
|
.init = fib_rules_net_init,
|
2017-11-13 03:30:01 +08:00
|
|
|
.exit = fib_rules_net_exit,
|
2008-01-10 19:20:28 +08:00
|
|
|
};
|
|
|
|
|
|
2006-08-04 18:38:38 +08:00
|
|
|
static int __init fib_rules_init(void)
|
|
|
|
|
{
|
2008-01-10 19:20:28 +08:00
|
|
|
int err;
|
2017-08-10 02:41:48 +08:00
|
|
|
rtnl_register(PF_UNSPEC, RTM_NEWRULE, fib_nl_newrule, NULL, 0);
|
|
|
|
|
rtnl_register(PF_UNSPEC, RTM_DELRULE, fib_nl_delrule, NULL, 0);
|
|
|
|
|
rtnl_register(PF_UNSPEC, RTM_GETRULE, NULL, fib_nl_dumprule, 0);
|
2007-03-26 14:20:05 +08:00
|
|
|
|
2008-11-08 14:52:34 +08:00
|
|
|
err = register_pernet_subsys(&fib_rules_net_ops);
|
2008-01-10 19:20:28 +08:00
|
|
|
if (err < 0)
|
|
|
|
|
goto fail;
|
|
|
|
|
|
2008-11-08 14:52:34 +08:00
|
|
|
err = register_netdevice_notifier(&fib_rules_notifier);
|
2008-01-10 19:20:28 +08:00
|
|
|
if (err < 0)
|
|
|
|
|
goto fail_unregister;
|
2008-11-08 14:52:34 +08:00
|
|
|
|
2008-01-10 19:20:28 +08:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
fail_unregister:
|
2008-11-08 14:52:34 +08:00
|
|
|
unregister_pernet_subsys(&fib_rules_net_ops);
|
2008-01-10 19:20:28 +08:00
|
|
|
fail:
|
|
|
|
|
rtnl_unregister(PF_UNSPEC, RTM_NEWRULE);
|
|
|
|
|
rtnl_unregister(PF_UNSPEC, RTM_DELRULE);
|
|
|
|
|
rtnl_unregister(PF_UNSPEC, RTM_GETRULE);
|
|
|
|
|
return err;
|
2006-08-04 18:38:38 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
subsys_initcall(fib_rules_init);
|
