989 lines · 22.2 KB · C
RawDownload
/* * net/core/fib_rules.c		Generic Routing Rules * *	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, version 2. * * Authors:	Thomas Graf <tgraf@suug.ch> */ #include <linux/types.h>#include <linux/kernel.h>#include <linux/slab.h>#include <linux/list.h>#include <linux/module.h>#include <net/net_namespace.h>#include <net/sock.h>#include <net/fib_rules.h>#include <net/ip_tunnels.h> static const struct fib_kuid_range fib_kuid_range_unset = {	KUIDT_INIT(0),	KUIDT_INIT(~0),}; 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;	return true;}EXPORT_SYMBOL_GPL(fib_rule_matchall); int fib_default_rule_add(struct fib_rules_ops *ops,			 u32 pref, u32 table, u32 flags){	struct fib_rule *r; 	r = kzalloc(ops->rule_size, GFP_KERNEL);	if (r == NULL)		return -ENOMEM; 	refcount_set(&r->refcnt, 1);	r->action = FR_ACT_TO_TBL;	r->pref = pref;	r->table = table;	r->flags = flags;	r->fr_net = ops->fro_net;	r->uid_range = fib_kuid_range_unset; 	r->suppress_prefixlen = -1;	r->suppress_ifgroup = -1; 	/* 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); static u32 fib_default_rule_pref(struct fib_rules_ops *ops){	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;} static void notify_rule_change(int event, struct fib_rule *rule,			       struct fib_rules_ops *ops, struct nlmsghdr *nlh,			       u32 pid); static struct fib_rules_ops *lookup_rules_ops(struct net *net, int family){	struct fib_rules_ops *ops; 	rcu_read_lock();	list_for_each_entry_rcu(ops, &net->rules_ops, list) {		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);} static void flush_route_cache(struct fib_rules_ops *ops){	if (ops->flush_cache)		ops->flush_cache(ops);} static int __fib_rules_register(struct fib_rules_ops *ops){	int err = -EEXIST;	struct fib_rules_ops *o;	struct net *net; 	net = ops->fro_net; 	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; 	spin_lock(&net->rules_mod_lock);	list_for_each_entry(o, &net->rules_ops, list)		if (ops->family == o->family)			goto errout; 	list_add_tail_rcu(&ops->list, &net->rules_ops);	err = 0;errout:	spin_unlock(&net->rules_mod_lock); 	return err;} struct fib_rules_ops *fib_rules_register(const struct fib_rules_ops *tmpl, struct net *net){	struct fib_rules_ops *ops;	int err; 	ops = kmemdup(tmpl, sizeof(*ops), GFP_KERNEL);	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;}EXPORT_SYMBOL_GPL(fib_rules_register); static void fib_rules_cleanup_ops(struct fib_rules_ops *ops){	struct fib_rule *rule, *tmp; 	list_for_each_entry_safe(rule, tmp, &ops->rules_list, list) {		list_del_rcu(&rule->list);		if (ops->delete)			ops->delete(rule);		fib_rule_put(rule);	}} void fib_rules_unregister(struct fib_rules_ops *ops){	struct net *net = ops->fro_net; 	spin_lock(&net->rules_mod_lock);	list_del_rcu(&ops->list);	spin_unlock(&net->rules_mod_lock); 	fib_rules_cleanup_ops(ops);	kfree_rcu(ops, rcu);}EXPORT_SYMBOL_GPL(fib_rules_unregister); 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);} static int fib_rule_match(struct fib_rule *rule, struct fib_rules_ops *ops,			  struct flowi *fl, int flags,			  struct fib_lookup_arg *arg){	int ret = 0; 	if (rule->iifindex && (rule->iifindex != fl->flowi_iif))		goto out; 	if (rule->oifindex && (rule->oifindex != fl->flowi_oif))		goto out; 	if ((rule->mark ^ fl->flowi_mark) & rule->mark_mask)		goto out; 	if (rule->tun_id && (rule->tun_id != fl->flowi_tun_key.tun_id))		goto out; 	if (rule->l3mdev && !l3mdev_fib_rule_match(rule->fr_net, fl, arg))		goto out; 	if (uid_lt(fl->flowi_uid, rule->uid_range.start) ||	    uid_gt(fl->flowi_uid, rule->uid_range.end))		goto out; 	ret = ops->match(rule, fl, flags);out:	return (rule->flags & FIB_RULE_INVERT) ? !ret : ret;} 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(); 	list_for_each_entry_rcu(rule, &ops->rules_list, list) {jumped:		if (!fib_rule_match(rule, ops, fl, flags, arg))			continue; 		if (rule->action == FR_ACT_GOTO) {			struct fib_rule *target; 			target = rcu_dereference(rule->ctarget);			if (target == NULL) {				continue;			} else {				rule = target;				goto jumped;			}		} else if (rule->action == FR_ACT_NOP)			continue;		else			err = ops->action(rule, fl, flags, arg); 		if (!err && ops->suppress && ops->suppress(rule, arg))			continue; 		if (err != -EAGAIN) {			if ((arg->flags & FIB_LOOKUP_NOREF) ||			    likely(refcount_inc_not_zero(&rule->refcnt))) {				arg->rule = rule;				goto out;			}			break;		}	} 	err = -ESRCH;out:	rcu_read_unlock(); 	return err;}EXPORT_SYMBOL_GPL(fib_rules_lookup); static int validate_rulemsg(struct fib_rule_hdr *frh, struct nlattr **tb,			    struct fib_rules_ops *ops){	int err = -EINVAL; 	if (frh->src_len)		if (tb[FRA_SRC] == NULL ||		    frh->src_len > (ops->addr_size * 8) ||		    nla_len(tb[FRA_SRC]) != ops->addr_size)			goto errout; 	if (frh->dst_len)		if (tb[FRA_DST] == NULL ||		    frh->dst_len > (ops->addr_size * 8) ||		    nla_len(tb[FRA_DST]) != ops->addr_size)			goto errout; 	err = 0;errout:	return err;} 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->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 (!ops->compare(r, frh, tb))			continue;		return 1;	}	return 0;} 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, *r, *last = NULL;	struct nlattr *tb[FRA_MAX+1];	int err = -EINVAL, unresolved = 0; 	if (nlh->nlmsg_len < nlmsg_msg_size(sizeof(*frh)))		goto errout; 	ops = lookup_rules_ops(net, frh->family);	if (ops == NULL) {		err = -EAFNOSUPPORT;		goto errout;	} 	err = nlmsg_parse(nlh, sizeof(*frh), tb, FRA_MAX, ops->policy, extack);	if (err < 0)		goto errout; 	err = validate_rulemsg(frh, tb, ops);	if (err < 0)		goto errout; 	rule = kzalloc(ops->rule_size, GFP_KERNEL);	if (rule == NULL) {		err = -ENOMEM;		goto errout;	}	refcount_set(&rule->refcnt, 1);	rule->fr_net = net; 	rule->pref = tb[FRA_PRIORITY] ? nla_get_u32(tb[FRA_PRIORITY])	                              : fib_default_rule_pref(ops); 	if (tb[FRA_IIFNAME]) {		struct net_device *dev; 		rule->iifindex = -1;		nla_strlcpy(rule->iifname, tb[FRA_IIFNAME], IFNAMSIZ);		dev = __dev_get_by_name(net, rule->iifname);		if (dev)			rule->iifindex = dev->ifindex;	} 	if (tb[FRA_OIFNAME]) {		struct net_device *dev; 		rule->oifindex = -1;		nla_strlcpy(rule->oifname, tb[FRA_OIFNAME], IFNAMSIZ);		dev = __dev_get_by_name(net, rule->oifname);		if (dev)			rule->oifindex = dev->ifindex;	} 	if (tb[FRA_FWMARK]) {		rule->mark = nla_get_u32(tb[FRA_FWMARK]);		if (rule->mark)			/* compatibility: if the mark value is non-zero all bits			 * are compared unless a mask is explicitly specified.			 */			rule->mark_mask = 0xFFFFFFFF;	} 	if (tb[FRA_FWMASK])		rule->mark_mask = nla_get_u32(tb[FRA_FWMASK]); 	if (tb[FRA_TUN_ID])		rule->tun_id = nla_get_be64(tb[FRA_TUN_ID]); 	err = -EINVAL;	if (tb[FRA_L3MDEV]) {#ifdef CONFIG_NET_L3_MASTER_DEV		rule->l3mdev = nla_get_u8(tb[FRA_L3MDEV]);		if (rule->l3mdev != 1)#endif			goto errout_free;	} 	rule->action = frh->action;	rule->flags = frh->flags;	rule->table = frh_get_table(frh, tb);	if (tb[FRA_SUPPRESS_PREFIXLEN])		rule->suppress_prefixlen = nla_get_u32(tb[FRA_SUPPRESS_PREFIXLEN]);	else		rule->suppress_prefixlen = -1; 	if (tb[FRA_SUPPRESS_IFGROUP])		rule->suppress_ifgroup = nla_get_u32(tb[FRA_SUPPRESS_IFGROUP]);	else		rule->suppress_ifgroup = -1; 	if (tb[FRA_GOTO]) {		if (rule->action != FR_ACT_GOTO)			goto errout_free; 		rule->target = nla_get_u32(tb[FRA_GOTO]);		/* Backward jumps are prohibited to avoid endless loops */		if (rule->target <= rule->pref)			goto errout_free; 		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;	} else if (rule->action == FR_ACT_GOTO)		goto errout_free; 	if (rule->l3mdev && rule->table)		goto errout_free; 	if (tb[FRA_UID_RANGE]) {		if (current_user_ns() != net->user_ns) {			err = -EPERM;			goto errout_free;		} 		rule->uid_range = nla_get_kuid_range(tb); 		if (!uid_range_set(&rule->uid_range) ||		    !uid_lte(rule->uid_range.start, rule->uid_range.end))			goto errout_free;

Lines 1–500 of 989.

Keyboard shortcuts

General

Show keyboard shortcuts
?
Focus the current search
/

Issues and pull requests

Open filters
f

Issues, pull requests and Inbox

Select next item
j↓
Select previous item
k↑
Open selected item
Enter
Dismiss filters or clear selection
Esc

Repository code

Go to file
t