fib_rules.c 14.2 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13
/*
 * 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/list.h>
14
#include <net/net_namespace.h>
15
#include <net/sock.h>
16 17 18 19 20
#include <net/fib_rules.h>

static LIST_HEAD(rules_ops);
static DEFINE_SPINLOCK(rules_mod_lock);

21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42
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;

	atomic_set(&r->refcnt, 1);
	r->action = FR_ACT_TO_TBL;
	r->pref = pref;
	r->table = table;
	r->flags = flags;

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

43
static void notify_rule_change(int event, struct fib_rule *rule,
44 45
			       struct fib_rules_ops *ops, struct nlmsghdr *nlh,
			       u32 pid);
46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70

static struct fib_rules_ops *lookup_rules_ops(int family)
{
	struct fib_rules_ops *ops;

	rcu_read_lock();
	list_for_each_entry_rcu(ops, &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);
}

71 72 73 74 75 76
static void flush_route_cache(struct fib_rules_ops *ops)
{
	if (ops->flush_cache)
		ops->flush_cache();
}

77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108
int fib_rules_register(struct fib_rules_ops *ops)
{
	int err = -EEXIST;
	struct fib_rules_ops *o;

	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(&rules_mod_lock);
	list_for_each_entry(o, &rules_ops, list)
		if (ops->family == o->family)
			goto errout;

	list_add_tail_rcu(&ops->list, &rules_ops);
	err = 0;
errout:
	spin_unlock(&rules_mod_lock);

	return err;
}

EXPORT_SYMBOL_GPL(fib_rules_register);

static void cleanup_ops(struct fib_rules_ops *ops)
{
	struct fib_rule *rule, *tmp;

109
	list_for_each_entry_safe(rule, tmp, &ops->rules_list, list) {
110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139
		list_del_rcu(&rule->list);
		fib_rule_put(rule);
	}
}

int fib_rules_unregister(struct fib_rules_ops *ops)
{
	int err = 0;
	struct fib_rules_ops *o;

	spin_lock(&rules_mod_lock);
	list_for_each_entry(o, &rules_ops, list) {
		if (o == ops) {
			list_del_rcu(&o->list);
			cleanup_ops(ops);
			goto out;
		}
	}

	err = -ENOENT;
out:
	spin_unlock(&rules_mod_lock);

	synchronize_rcu();

	return err;
}

EXPORT_SYMBOL_GPL(fib_rules_unregister);

140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155
static int fib_rule_match(struct fib_rule *rule, struct fib_rules_ops *ops,
			  struct flowi *fl, int flags)
{
	int ret = 0;

	if (rule->ifindex && (rule->ifindex != fl->iif))
		goto out;

	if ((rule->mark ^ fl->mark) & rule->mark_mask)
		goto out;

	ret = ops->match(rule, fl, flags);
out:
	return (rule->flags & FIB_RULE_INVERT) ? !ret : ret;
}

156 157 158 159 160 161 162 163
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();

164
	list_for_each_entry_rcu(rule, &ops->rules_list, list) {
T
Thomas Graf 已提交
165
jumped:
166
		if (!fib_rule_match(rule, ops, fl, flags))
167 168
			continue;

T
Thomas Graf 已提交
169 170 171 172 173 174 175 176 177 178
		if (rule->action == FR_ACT_GOTO) {
			struct fib_rule *target;

			target = rcu_dereference(rule->ctarget);
			if (target == NULL) {
				continue;
			} else {
				rule = target;
				goto jumped;
			}
179 180 181
		} else if (rule->action == FR_ACT_NOP)
			continue;
		else
T
Thomas Graf 已提交
182 183
			err = ops->action(rule, fl, flags, arg);

184 185 186 187 188 189 190
		if (err != -EAGAIN) {
			fib_rule_get(rule);
			arg->rule = rule;
			goto out;
		}
	}

191
	err = -ESRCH;
192 193 194 195 196 197 198 199
out:
	rcu_read_unlock();

	return err;
}

EXPORT_SYMBOL_GPL(fib_rules_lookup);

200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221
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;
}

222
static int fib_nl_newrule(struct sk_buff *skb, struct nlmsghdr* nlh, void *arg)
223
{
224
	struct net *net = skb->sk->sk_net;
225 226 227 228
	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];
T
Thomas Graf 已提交
229
	int err = -EINVAL, unresolved = 0;
230

231 232 233
	if (net != &init_net)
		return -EINVAL;

234 235 236 237 238 239 240 241 242 243 244 245 246
	if (nlh->nlmsg_len < nlmsg_msg_size(sizeof(*frh)))
		goto errout;

	ops = lookup_rules_ops(frh->family);
	if (ops == NULL) {
		err = EAFNOSUPPORT;
		goto errout;
	}

	err = nlmsg_parse(nlh, sizeof(*frh), tb, FRA_MAX, ops->policy);
	if (err < 0)
		goto errout;

247 248 249 250
	err = validate_rulemsg(frh, tb, ops);
	if (err < 0)
		goto errout;

251 252 253 254 255 256 257 258 259 260 261 262 263
	rule = kzalloc(ops->rule_size, GFP_KERNEL);
	if (rule == NULL) {
		err = -ENOMEM;
		goto errout;
	}

	if (tb[FRA_PRIORITY])
		rule->pref = nla_get_u32(tb[FRA_PRIORITY]);

	if (tb[FRA_IFNAME]) {
		struct net_device *dev;

		rule->ifindex = -1;
264
		nla_strlcpy(rule->ifname, tb[FRA_IFNAME], IFNAMSIZ);
265
		dev = __dev_get_by_name(net, rule->ifname);
266 267 268 269
		if (dev)
			rule->ifindex = dev->ifindex;
	}

270 271 272 273 274 275 276 277 278 279 280 281
	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]);

282 283
	rule->action = frh->action;
	rule->flags = frh->flags;
284
	rule->table = frh_get_table(frh, tb);
285 286 287 288

	if (!rule->pref && ops->default_pref)
		rule->pref = ops->default_pref();

T
Thomas Graf 已提交
289 290 291 292 293 294 295 296 297 298
	err = -EINVAL;
	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;

299
		list_for_each_entry(r, &ops->rules_list, list) {
T
Thomas Graf 已提交
300 301 302 303 304 305 306 307 308 309 310
			if (r->pref == rule->target) {
				rule->ctarget = r;
				break;
			}
		}

		if (rule->ctarget == NULL)
			unresolved = 1;
	} else if (rule->action == FR_ACT_GOTO)
		goto errout_free;

311 312 313 314
	err = ops->configure(rule, skb, nlh, frh, tb);
	if (err < 0)
		goto errout_free;

315
	list_for_each_entry(r, &ops->rules_list, list) {
316 317 318 319 320 321 322
		if (r->pref > rule->pref)
			break;
		last = r;
	}

	fib_rule_get(rule);

T
Thomas Graf 已提交
323 324 325 326 327
	if (ops->unresolved_rules) {
		/*
		 * There are unresolved goto rules in the list, check if
		 * any of them are pointing to this new rule.
		 */
328
		list_for_each_entry(r, &ops->rules_list, list) {
T
Thomas Graf 已提交
329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344
			if (r->action == FR_ACT_GOTO &&
			    r->target == rule->pref) {
				BUG_ON(r->ctarget != NULL);
				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++;

345 346 347
	if (last)
		list_add_rcu(&rule->list, &last->list);
	else
348
		list_add_rcu(&rule->list, &ops->rules_list);
349

350
	notify_rule_change(RTM_NEWRULE, rule, ops, nlh, NETLINK_CB(skb).pid);
351
	flush_route_cache(ops);
352 353 354 355 356 357 358 359 360 361
	rules_ops_put(ops);
	return 0;

errout_free:
	kfree(rule);
errout:
	rules_ops_put(ops);
	return err;
}

362
static int fib_nl_delrule(struct sk_buff *skb, struct nlmsghdr* nlh, void *arg)
363
{
364
	struct net *net = skb->sk->sk_net;
365 366
	struct fib_rule_hdr *frh = nlmsg_data(nlh);
	struct fib_rules_ops *ops = NULL;
T
Thomas Graf 已提交
367
	struct fib_rule *rule, *tmp;
368 369 370
	struct nlattr *tb[FRA_MAX+1];
	int err = -EINVAL;

371 372 373
	if (net != &init_net)
		return -EINVAL;

374 375 376 377 378 379 380 381 382 383 384 385 386
	if (nlh->nlmsg_len < nlmsg_msg_size(sizeof(*frh)))
		goto errout;

	ops = lookup_rules_ops(frh->family);
	if (ops == NULL) {
		err = EAFNOSUPPORT;
		goto errout;
	}

	err = nlmsg_parse(nlh, sizeof(*frh), tb, FRA_MAX, ops->policy);
	if (err < 0)
		goto errout;

387 388 389 390
	err = validate_rulemsg(frh, tb, ops);
	if (err < 0)
		goto errout;

391
	list_for_each_entry(rule, &ops->rules_list, list) {
392 393 394
		if (frh->action && (frh->action != rule->action))
			continue;

395
		if (frh->table && (frh_get_table(frh, tb) != rule->table))
396 397 398 399 400 401 402 403 404 405
			continue;

		if (tb[FRA_PRIORITY] &&
		    (rule->pref != nla_get_u32(tb[FRA_PRIORITY])))
			continue;

		if (tb[FRA_IFNAME] &&
		    nla_strcmp(tb[FRA_IFNAME], rule->ifname))
			continue;

406 407 408 409 410 411 412 413
		if (tb[FRA_FWMARK] &&
		    (rule->mark != nla_get_u32(tb[FRA_FWMARK])))
			continue;

		if (tb[FRA_FWMASK] &&
		    (rule->mark_mask != nla_get_u32(tb[FRA_FWMASK])))
			continue;

414 415 416 417 418 419 420 421 422
		if (!ops->compare(rule, frh, tb))
			continue;

		if (rule->flags & FIB_RULE_PERMANENT) {
			err = -EPERM;
			goto errout;
		}

		list_del_rcu(&rule->list);
T
Thomas Graf 已提交
423 424 425 426 427 428 429 430 431 432 433

		if (rule->action == FR_ACT_GOTO)
			ops->nr_goto_rules--;

		/*
		 * Check if this rule is a target to any of them. If so,
		 * disable them. As this operation is eventually very
		 * expensive, it is only performed if goto rules have
		 * actually been added.
		 */
		if (ops->nr_goto_rules > 0) {
434
			list_for_each_entry(tmp, &ops->rules_list, list) {
T
Thomas Graf 已提交
435 436 437 438 439 440 441
				if (tmp->ctarget == rule) {
					rcu_assign_pointer(tmp->ctarget, NULL);
					ops->unresolved_rules++;
				}
			}
		}

442
		synchronize_rcu();
443 444
		notify_rule_change(RTM_DELRULE, rule, ops, nlh,
				   NETLINK_CB(skb).pid);
445
		fib_rule_put(rule);
446
		flush_route_cache(ops);
447 448 449 450 451 452 453 454 455 456
		rules_ops_put(ops);
		return 0;
	}

	err = -ENOENT;
errout:
	rules_ops_put(ops);
	return err;
}

457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472
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))
			 + nla_total_size(IFNAMSIZ) /* FRA_IFNAME */
			 + nla_total_size(4) /* FRA_PRIORITY */
			 + nla_total_size(4) /* FRA_TABLE */
			 + nla_total_size(4) /* FRA_FWMARK */
			 + nla_total_size(4); /* FRA_FWMASK */

	if (ops->nlmsg_payload)
		payload += ops->nlmsg_payload(rule);

	return payload;
}

473 474 475 476 477 478 479 480 481
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)
482
		return -EMSGSIZE;
483 484 485

	frh = nlmsg_data(nlh);
	frh->table = rule->table;
486
	NLA_PUT_U32(skb, FRA_TABLE, rule->table);
487 488 489 490 491
	frh->res1 = 0;
	frh->res2 = 0;
	frh->action = rule->action;
	frh->flags = rule->flags;

T
Thomas Graf 已提交
492 493 494
	if (rule->action == FR_ACT_GOTO && rule->ctarget == NULL)
		frh->flags |= FIB_RULE_UNRESOLVED;

495
	if (rule->ifname[0]) {
496 497
		NLA_PUT_STRING(skb, FRA_IFNAME, rule->ifname);

498 499 500 501
		if (rule->ifindex == -1)
			frh->flags |= FIB_RULE_DEV_DETACHED;
	}

502 503 504
	if (rule->pref)
		NLA_PUT_U32(skb, FRA_PRIORITY, rule->pref);

505 506 507 508 509 510
	if (rule->mark)
		NLA_PUT_U32(skb, FRA_FWMARK, rule->mark);

	if (rule->mark_mask || rule->mark)
		NLA_PUT_U32(skb, FRA_FWMASK, rule->mark_mask);

T
Thomas Graf 已提交
511 512 513
	if (rule->target)
		NLA_PUT_U32(skb, FRA_GOTO, rule->target);

514 515 516 517 518 519
	if (ops->fill(rule, skb, nlh, frh) < 0)
		goto nla_put_failure;

	return nlmsg_end(skb, nlh);

nla_put_failure:
520 521
	nlmsg_cancel(skb, nlh);
	return -EMSGSIZE;
522 523
}

T
Thomas Graf 已提交
524 525
static int dump_rules(struct sk_buff *skb, struct netlink_callback *cb,
		      struct fib_rules_ops *ops)
526 527 528 529
{
	int idx = 0;
	struct fib_rule *rule;

530
	list_for_each_entry(rule, &ops->rules_list, list) {
T
Thomas Graf 已提交
531
		if (idx < cb->args[1])
532 533 534 535 536 537 538 539 540
			goto skip;

		if (fib_nl_fill_rule(skb, rule, NETLINK_CB(cb->skb).pid,
				     cb->nlh->nlmsg_seq, RTM_NEWRULE,
				     NLM_F_MULTI, ops) < 0)
			break;
skip:
		idx++;
	}
T
Thomas Graf 已提交
541
	cb->args[1] = idx;
542 543 544 545 546
	rules_ops_put(ops);

	return skb->len;
}

T
Thomas Graf 已提交
547 548
static int fib_nl_dumprule(struct sk_buff *skb, struct netlink_callback *cb)
{
549
	struct net *net = skb->sk->sk_net;
T
Thomas Graf 已提交
550 551 552
	struct fib_rules_ops *ops;
	int idx = 0, family;

553 554 555
	if (net != &init_net)
		return -EINVAL;

T
Thomas Graf 已提交
556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582
	family = rtnl_msg_family(cb->nlh);
	if (family != AF_UNSPEC) {
		/* Protocol specific dump request */
		ops = lookup_rules_ops(family);
		if (ops == NULL)
			return -EAFNOSUPPORT;

		return dump_rules(skb, cb, ops);
	}

	rcu_read_lock();
	list_for_each_entry_rcu(ops, &rules_ops, list) {
		if (idx < cb->args[0] || !try_module_get(ops->owner))
			goto skip;

		if (dump_rules(skb, cb, ops) < 0)
			break;

		cb->args[1] = 0;
	skip:
		idx++;
	}
	rcu_read_unlock();
	cb->args[0] = idx;

	return skb->len;
}
583 584

static void notify_rule_change(int event, struct fib_rule *rule,
585 586
			       struct fib_rules_ops *ops, struct nlmsghdr *nlh,
			       u32 pid)
587
{
588 589
	struct sk_buff *skb;
	int err = -ENOBUFS;
590

591
	skb = nlmsg_new(fib_rule_nlmsg_size(ops, rule), GFP_KERNEL);
592
	if (skb == NULL)
593 594 595
		goto errout;

	err = fib_nl_fill_rule(skb, rule, pid, nlh->nlmsg_seq, event, 0, ops);
596 597 598 599 600 601
	if (err < 0) {
		/* -EMSGSIZE implies BUG in fib_rule_nlmsg_size() */
		WARN_ON(err == -EMSGSIZE);
		kfree_skb(skb);
		goto errout;
	}
602
	err = rtnl_notify(skb, &init_net, pid, ops->nlgroup, nlh, GFP_KERNEL);
603 604
errout:
	if (err < 0)
605
		rtnl_set_sk_err(&init_net, ops->nlgroup, err);
606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634
}

static void attach_rules(struct list_head *rules, struct net_device *dev)
{
	struct fib_rule *rule;

	list_for_each_entry(rule, rules, list) {
		if (rule->ifindex == -1 &&
		    strcmp(dev->name, rule->ifname) == 0)
			rule->ifindex = dev->ifindex;
	}
}

static void detach_rules(struct list_head *rules, struct net_device *dev)
{
	struct fib_rule *rule;

	list_for_each_entry(rule, rules, list)
		if (rule->ifindex == dev->ifindex)
			rule->ifindex = -1;
}


static int fib_rules_event(struct notifier_block *this, unsigned long event,
			    void *ptr)
{
	struct net_device *dev = ptr;
	struct fib_rules_ops *ops;

635 636 637
	if (dev->nd_net != &init_net)
		return NOTIFY_DONE;

638 639 640 641 642 643
	ASSERT_RTNL();
	rcu_read_lock();

	switch (event) {
	case NETDEV_REGISTER:
		list_for_each_entry(ops, &rules_ops, list)
644
			attach_rules(&ops->rules_list, dev);
645 646 647 648
		break;

	case NETDEV_UNREGISTER:
		list_for_each_entry(ops, &rules_ops, list)
649
			detach_rules(&ops->rules_list, dev);
650 651 652 653 654 655 656 657 658 659 660 661 662 663
		break;
	}

	rcu_read_unlock();

	return NOTIFY_DONE;
}

static struct notifier_block fib_rules_notifier = {
	.notifier_call = fib_rules_event,
};

static int __init fib_rules_init(void)
{
664 665
	rtnl_register(PF_UNSPEC, RTM_NEWRULE, fib_nl_newrule, NULL);
	rtnl_register(PF_UNSPEC, RTM_DELRULE, fib_nl_delrule, NULL);
T
Thomas Graf 已提交
666
	rtnl_register(PF_UNSPEC, RTM_GETRULE, NULL, fib_nl_dumprule);
667

668 669 670 671
	return register_netdevice_notifier(&fib_rules_notifier);
}

subsys_initcall(fib_rules_init);