fib_rules.c 14.8 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
#include <net/fib_rules.h>

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

40 41
static void notify_rule_change(struct net *net, int event,
			       struct fib_rule *rule,
42 43
			       struct fib_rules_ops *ops, struct nlmsghdr *nlh,
			       u32 pid);
44

45
static struct fib_rules_ops *lookup_rules_ops(struct net *net, int family)
46 47 48 49
{
	struct fib_rules_ops *ops;

	rcu_read_lock();
50
	list_for_each_entry_rcu(ops, &net->rules_ops, list) {
51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68
		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);
}

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

75
int fib_rules_register(struct net *net, struct fib_rules_ops *ops)
76 77 78 79 80 81 82 83 84 85 86 87
{
	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;

88 89
	spin_lock(&net->rules_mod_lock);
	list_for_each_entry(o, &net->rules_ops, list)
90 91 92
		if (ops->family == o->family)
			goto errout;

93 94
	hold_net(net);
	list_add_tail_rcu(&ops->list, &net->rules_ops);
95 96
	err = 0;
errout:
97
	spin_unlock(&net->rules_mod_lock);
98 99 100 101 102 103

	return err;
}

EXPORT_SYMBOL_GPL(fib_rules_register);

104
void fib_rules_cleanup_ops(struct fib_rules_ops *ops)
105 106 107
{
	struct fib_rule *rule, *tmp;

108
	list_for_each_entry_safe(rule, tmp, &ops->rules_list, list) {
109 110 111 112
		list_del_rcu(&rule->list);
		fib_rule_put(rule);
	}
}
113
EXPORT_SYMBOL_GPL(fib_rules_cleanup_ops);
114

115
int fib_rules_unregister(struct net *net, struct fib_rules_ops *ops)
116 117 118 119
{
	int err = 0;
	struct fib_rules_ops *o;

120 121
	spin_lock(&net->rules_mod_lock);
	list_for_each_entry(o, &net->rules_ops, list) {
122 123
		if (o == ops) {
			list_del_rcu(&o->list);
124
			fib_rules_cleanup_ops(ops);
125 126 127 128 129 130
			goto out;
		}
	}

	err = -ENOENT;
out:
131
	spin_unlock(&net->rules_mod_lock);
132 133

	synchronize_rcu();
134 135
	if (!err)
		release_net(net);
136 137 138 139 140 141

	return err;
}

EXPORT_SYMBOL_GPL(fib_rules_unregister);

142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157
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;
}

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

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

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

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

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

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

	return err;
}

EXPORT_SYMBOL_GPL(fib_rules_lookup);

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

224
static int fib_nl_newrule(struct sk_buff *skb, struct nlmsghdr* nlh, void *arg)
225
{
226
	struct net *net = skb->sk->sk_net;
227 228 229 230
	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 已提交
231
	int err = -EINVAL, unresolved = 0;
232 233 234 235

	if (nlh->nlmsg_len < nlmsg_msg_size(sizeof(*frh)))
		goto errout;

236
	ops = lookup_rules_ops(net, frh->family);
237 238 239 240 241 242 243 244 245
	if (ops == NULL) {
		err = EAFNOSUPPORT;
		goto errout;
	}

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

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

250 251 252 253 254 255 256 257 258 259 260 261 262
	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;
263
		nla_strlcpy(rule->ifname, tb[FRA_IFNAME], IFNAMSIZ);
264
		dev = __dev_get_by_name(net, rule->ifname);
265 266 267 268
		if (dev)
			rule->ifindex = dev->ifindex;
	}

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

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

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

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

298
		list_for_each_entry(r, &ops->rules_list, list) {
T
Thomas Graf 已提交
299 300 301 302 303 304 305 306 307 308 309
			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;

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

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

	fib_rule_get(rule);

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

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

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

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

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

	if (nlh->nlmsg_len < nlmsg_msg_size(sizeof(*frh)))
		goto errout;

373
	ops = lookup_rules_ops(net, frh->family);
374 375 376 377 378 379 380 381 382
	if (ops == NULL) {
		err = EAFNOSUPPORT;
		goto errout;
	}

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

383 384 385 386
	err = validate_rulemsg(frh, tb, ops);
	if (err < 0)
		goto errout;

387
	list_for_each_entry(rule, &ops->rules_list, list) {
388 389 390
		if (frh->action && (frh->action != rule->action))
			continue;

391
		if (frh->table && (frh_get_table(frh, tb) != rule->table))
392 393 394 395 396 397 398 399 400 401
			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;

402 403 404 405 406 407 408 409
		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;

410 411 412 413 414 415 416 417 418
		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 已提交
419 420 421 422 423 424 425 426 427 428 429

		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) {
430
			list_for_each_entry(tmp, &ops->rules_list, list) {
T
Thomas Graf 已提交
431 432 433 434 435 436 437
				if (tmp->ctarget == rule) {
					rcu_assign_pointer(tmp->ctarget, NULL);
					ops->unresolved_rules++;
				}
			}
		}

438
		synchronize_rcu();
439
		notify_rule_change(net, RTM_DELRULE, rule, ops, nlh,
440
				   NETLINK_CB(skb).pid);
441
		fib_rule_put(rule);
442
		flush_route_cache(ops);
443 444 445 446 447 448 449 450 451 452
		rules_ops_put(ops);
		return 0;
	}

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

453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468
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;
}

469 470 471 472 473 474 475 476 477
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)
478
		return -EMSGSIZE;
479 480 481

	frh = nlmsg_data(nlh);
	frh->table = rule->table;
482
	NLA_PUT_U32(skb, FRA_TABLE, rule->table);
483 484 485 486 487
	frh->res1 = 0;
	frh->res2 = 0;
	frh->action = rule->action;
	frh->flags = rule->flags;

T
Thomas Graf 已提交
488 489 490
	if (rule->action == FR_ACT_GOTO && rule->ctarget == NULL)
		frh->flags |= FIB_RULE_UNRESOLVED;

491
	if (rule->ifname[0]) {
492 493
		NLA_PUT_STRING(skb, FRA_IFNAME, rule->ifname);

494 495 496 497
		if (rule->ifindex == -1)
			frh->flags |= FIB_RULE_DEV_DETACHED;
	}

498 499 500
	if (rule->pref)
		NLA_PUT_U32(skb, FRA_PRIORITY, rule->pref);

501 502 503 504 505 506
	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 已提交
507 508 509
	if (rule->target)
		NLA_PUT_U32(skb, FRA_GOTO, rule->target);

510 511 512 513 514 515
	if (ops->fill(rule, skb, nlh, frh) < 0)
		goto nla_put_failure;

	return nlmsg_end(skb, nlh);

nla_put_failure:
516 517
	nlmsg_cancel(skb, nlh);
	return -EMSGSIZE;
518 519
}

T
Thomas Graf 已提交
520 521
static int dump_rules(struct sk_buff *skb, struct netlink_callback *cb,
		      struct fib_rules_ops *ops)
522 523 524 525
{
	int idx = 0;
	struct fib_rule *rule;

526
	list_for_each_entry(rule, &ops->rules_list, list) {
T
Thomas Graf 已提交
527
		if (idx < cb->args[1])
528 529 530 531 532 533 534 535 536
			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 已提交
537
	cb->args[1] = idx;
538 539 540 541 542
	rules_ops_put(ops);

	return skb->len;
}

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

	family = rtnl_msg_family(cb->nlh);
	if (family != AF_UNSPEC) {
		/* Protocol specific dump request */
552
		ops = lookup_rules_ops(net, family);
T
Thomas Graf 已提交
553 554 555 556 557 558 559
		if (ops == NULL)
			return -EAFNOSUPPORT;

		return dump_rules(skb, cb, ops);
	}

	rcu_read_lock();
560
	list_for_each_entry_rcu(ops, &net->rules_ops, list) {
T
Thomas Graf 已提交
561 562 563 564 565 566 567 568 569 570 571 572 573 574 575
		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;
}
576

577
static void notify_rule_change(struct net *net, int event, struct fib_rule *rule,
578 579
			       struct fib_rules_ops *ops, struct nlmsghdr *nlh,
			       u32 pid)
580
{
581 582
	struct sk_buff *skb;
	int err = -ENOBUFS;
583

584
	skb = nlmsg_new(fib_rule_nlmsg_size(ops, rule), GFP_KERNEL);
585
	if (skb == NULL)
586 587 588
		goto errout;

	err = fib_nl_fill_rule(skb, rule, pid, nlh->nlmsg_seq, event, 0, ops);
589 590 591 592 593 594
	if (err < 0) {
		/* -EMSGSIZE implies BUG in fib_rule_nlmsg_size() */
		WARN_ON(err == -EMSGSIZE);
		kfree_skb(skb);
		goto errout;
	}
595
	err = rtnl_notify(skb, net, pid, ops->nlgroup, nlh, GFP_KERNEL);
596 597
errout:
	if (err < 0)
598
		rtnl_set_sk_err(net, ops->nlgroup, err);
599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625
}

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;
626
	struct net *net = dev->nd_net;
627 628 629 630 631 632 633
	struct fib_rules_ops *ops;

	ASSERT_RTNL();
	rcu_read_lock();

	switch (event) {
	case NETDEV_REGISTER:
634
		list_for_each_entry(ops, &net->rules_ops, list)
635
			attach_rules(&ops->rules_list, dev);
636 637 638
		break;

	case NETDEV_UNREGISTER:
639
		list_for_each_entry(ops, &net->rules_ops, list)
640
			detach_rules(&ops->rules_list, dev);
641 642 643 644 645 646 647 648 649 650 651 652
		break;
	}

	rcu_read_unlock();

	return NOTIFY_DONE;
}

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

653 654 655 656 657 658 659 660 661 662 663
static int fib_rules_net_init(struct net *net)
{
	INIT_LIST_HEAD(&net->rules_ops);
	spin_lock_init(&net->rules_mod_lock);
	return 0;
}

static struct pernet_operations fib_rules_net_ops = {
	.init = fib_rules_net_init,
};

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

671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686
	err = register_netdevice_notifier(&fib_rules_notifier);
	if (err < 0)
		goto fail;

	err = register_pernet_subsys(&fib_rules_net_ops);
	if (err < 0)
		goto fail_unregister;
	return 0;

fail_unregister:
	unregister_netdevice_notifier(&fib_rules_notifier);
fail:
	rtnl_unregister(PF_UNSPEC, RTM_NEWRULE);
	rtnl_unregister(PF_UNSPEC, RTM_DELRULE);
	rtnl_unregister(PF_UNSPEC, RTM_GETRULE);
	return err;
687 688 689
}

subsys_initcall(fib_rules_init);