fib_rules.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780
  1. /*
  2. * net/core/fib_rules.c Generic Routing Rules
  3. *
  4. * This program is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU General Public License as
  6. * published by the Free Software Foundation, version 2.
  7. *
  8. * Authors: Thomas Graf <tgraf@suug.ch>
  9. */
  10. #include <linux/types.h>
  11. #include <linux/kernel.h>
  12. #include <linux/slab.h>
  13. #include <linux/list.h>
  14. #include <linux/module.h>
  15. #include <net/net_namespace.h>
  16. #include <net/sock.h>
  17. #include <net/fib_rules.h>
  18. int fib_default_rule_add(struct fib_rules_ops *ops,
  19. u32 pref, u32 table, u32 flags)
  20. {
  21. struct fib_rule *r;
  22. r = kzalloc(ops->rule_size, GFP_KERNEL);
  23. if (r == NULL)
  24. return -ENOMEM;
  25. atomic_set(&r->refcnt, 1);
  26. r->action = FR_ACT_TO_TBL;
  27. r->pref = pref;
  28. r->table = table;
  29. r->flags = flags;
  30. r->fr_net = hold_net(ops->fro_net);
  31. /* The lock is not required here, the list in unreacheable
  32. * at the moment this function is called */
  33. list_add_tail(&r->list, &ops->rules_list);
  34. return 0;
  35. }
  36. EXPORT_SYMBOL(fib_default_rule_add);
  37. u32 fib_default_rule_pref(struct fib_rules_ops *ops)
  38. {
  39. struct list_head *pos;
  40. struct fib_rule *rule;
  41. if (!list_empty(&ops->rules_list)) {
  42. pos = ops->rules_list.next;
  43. if (pos->next != &ops->rules_list) {
  44. rule = list_entry(pos->next, struct fib_rule, list);
  45. if (rule->pref)
  46. return rule->pref - 1;
  47. }
  48. }
  49. return 0;
  50. }
  51. EXPORT_SYMBOL(fib_default_rule_pref);
  52. static void notify_rule_change(int event, struct fib_rule *rule,
  53. struct fib_rules_ops *ops, struct nlmsghdr *nlh,
  54. u32 pid);
  55. static struct fib_rules_ops *lookup_rules_ops(struct net *net, int family)
  56. {
  57. struct fib_rules_ops *ops;
  58. rcu_read_lock();
  59. list_for_each_entry_rcu(ops, &net->rules_ops, list) {
  60. if (ops->family == family) {
  61. if (!try_module_get(ops->owner))
  62. ops = NULL;
  63. rcu_read_unlock();
  64. return ops;
  65. }
  66. }
  67. rcu_read_unlock();
  68. return NULL;
  69. }
  70. static void rules_ops_put(struct fib_rules_ops *ops)
  71. {
  72. if (ops)
  73. module_put(ops->owner);
  74. }
  75. static void flush_route_cache(struct fib_rules_ops *ops)
  76. {
  77. if (ops->flush_cache)
  78. ops->flush_cache(ops);
  79. }
  80. static int __fib_rules_register(struct fib_rules_ops *ops)
  81. {
  82. int err = -EEXIST;
  83. struct fib_rules_ops *o;
  84. struct net *net;
  85. net = ops->fro_net;
  86. if (ops->rule_size < sizeof(struct fib_rule))
  87. return -EINVAL;
  88. if (ops->match == NULL || ops->configure == NULL ||
  89. ops->compare == NULL || ops->fill == NULL ||
  90. ops->action == NULL)
  91. return -EINVAL;
  92. spin_lock(&net->rules_mod_lock);
  93. list_for_each_entry(o, &net->rules_ops, list)
  94. if (ops->family == o->family)
  95. goto errout;
  96. hold_net(net);
  97. list_add_tail_rcu(&ops->list, &net->rules_ops);
  98. err = 0;
  99. errout:
  100. spin_unlock(&net->rules_mod_lock);
  101. return err;
  102. }
  103. struct fib_rules_ops *
  104. fib_rules_register(const struct fib_rules_ops *tmpl, struct net *net)
  105. {
  106. struct fib_rules_ops *ops;
  107. int err;
  108. ops = kmemdup(tmpl, sizeof(*ops), GFP_KERNEL);
  109. if (ops == NULL)
  110. return ERR_PTR(-ENOMEM);
  111. INIT_LIST_HEAD(&ops->rules_list);
  112. ops->fro_net = net;
  113. err = __fib_rules_register(ops);
  114. if (err) {
  115. kfree(ops);
  116. ops = ERR_PTR(err);
  117. }
  118. return ops;
  119. }
  120. EXPORT_SYMBOL_GPL(fib_rules_register);
  121. static void fib_rules_cleanup_ops(struct fib_rules_ops *ops)
  122. {
  123. struct fib_rule *rule, *tmp;
  124. list_for_each_entry_safe(rule, tmp, &ops->rules_list, list) {
  125. list_del_rcu(&rule->list);
  126. if (ops->delete)
  127. ops->delete(rule);
  128. fib_rule_put(rule);
  129. }
  130. }
  131. static void fib_rules_put_rcu(struct rcu_head *head)
  132. {
  133. struct fib_rules_ops *ops = container_of(head, struct fib_rules_ops, rcu);
  134. struct net *net = ops->fro_net;
  135. release_net(net);
  136. kfree(ops);
  137. }
  138. void fib_rules_unregister(struct fib_rules_ops *ops)
  139. {
  140. struct net *net = ops->fro_net;
  141. spin_lock(&net->rules_mod_lock);
  142. list_del_rcu(&ops->list);
  143. fib_rules_cleanup_ops(ops);
  144. spin_unlock(&net->rules_mod_lock);
  145. call_rcu(&ops->rcu, fib_rules_put_rcu);
  146. }
  147. EXPORT_SYMBOL_GPL(fib_rules_unregister);
  148. static int fib_rule_match(struct fib_rule *rule, struct fib_rules_ops *ops,
  149. struct flowi *fl, int flags)
  150. {
  151. int ret = 0;
  152. if (rule->iifindex && (rule->iifindex != fl->flowi_iif))
  153. goto out;
  154. if (rule->oifindex && (rule->oifindex != fl->flowi_oif))
  155. goto out;
  156. if ((rule->mark ^ fl->flowi_mark) & rule->mark_mask)
  157. goto out;
  158. ret = ops->match(rule, fl, flags);
  159. out:
  160. return (rule->flags & FIB_RULE_INVERT) ? !ret : ret;
  161. }
  162. int fib_rules_lookup(struct fib_rules_ops *ops, struct flowi *fl,
  163. int flags, struct fib_lookup_arg *arg)
  164. {
  165. struct fib_rule *rule;
  166. int err;
  167. rcu_read_lock();
  168. list_for_each_entry_rcu(rule, &ops->rules_list, list) {
  169. jumped:
  170. if (!fib_rule_match(rule, ops, fl, flags))
  171. continue;
  172. if (rule->action == FR_ACT_GOTO) {
  173. struct fib_rule *target;
  174. target = rcu_dereference(rule->ctarget);
  175. if (target == NULL) {
  176. continue;
  177. } else {
  178. rule = target;
  179. goto jumped;
  180. }
  181. } else if (rule->action == FR_ACT_NOP)
  182. continue;
  183. else
  184. err = ops->action(rule, fl, flags, arg);
  185. if (!err && ops->suppress && ops->suppress(rule, arg))
  186. continue;
  187. if (err != -EAGAIN) {
  188. if ((arg->flags & FIB_LOOKUP_NOREF) ||
  189. likely(atomic_inc_not_zero(&rule->refcnt))) {
  190. arg->rule = rule;
  191. goto out;
  192. }
  193. break;
  194. }
  195. }
  196. err = -ESRCH;
  197. out:
  198. rcu_read_unlock();
  199. return err;
  200. }
  201. EXPORT_SYMBOL_GPL(fib_rules_lookup);
  202. static int validate_rulemsg(struct fib_rule_hdr *frh, struct nlattr **tb,
  203. struct fib_rules_ops *ops)
  204. {
  205. int err = -EINVAL;
  206. if (frh->src_len)
  207. if (tb[FRA_SRC] == NULL ||
  208. frh->src_len > (ops->addr_size * 8) ||
  209. nla_len(tb[FRA_SRC]) != ops->addr_size)
  210. goto errout;
  211. if (frh->dst_len)
  212. if (tb[FRA_DST] == NULL ||
  213. frh->dst_len > (ops->addr_size * 8) ||
  214. nla_len(tb[FRA_DST]) != ops->addr_size)
  215. goto errout;
  216. err = 0;
  217. errout:
  218. return err;
  219. }
  220. static int fib_nl_newrule(struct sk_buff *skb, struct nlmsghdr* nlh)
  221. {
  222. struct net *net = sock_net(skb->sk);
  223. struct fib_rule_hdr *frh = nlmsg_data(nlh);
  224. struct fib_rules_ops *ops = NULL;
  225. struct fib_rule *rule, *r, *last = NULL;
  226. struct nlattr *tb[FRA_MAX+1];
  227. int err = -EINVAL, unresolved = 0;
  228. if (nlh->nlmsg_len < nlmsg_msg_size(sizeof(*frh)))
  229. goto errout;
  230. ops = lookup_rules_ops(net, frh->family);
  231. if (ops == NULL) {
  232. err = -EAFNOSUPPORT;
  233. goto errout;
  234. }
  235. err = nlmsg_parse(nlh, sizeof(*frh), tb, FRA_MAX, ops->policy);
  236. if (err < 0)
  237. goto errout;
  238. err = validate_rulemsg(frh, tb, ops);
  239. if (err < 0)
  240. goto errout;
  241. rule = kzalloc(ops->rule_size, GFP_KERNEL);
  242. if (rule == NULL) {
  243. err = -ENOMEM;
  244. goto errout;
  245. }
  246. rule->fr_net = hold_net(net);
  247. if (tb[FRA_PRIORITY])
  248. rule->pref = nla_get_u32(tb[FRA_PRIORITY]);
  249. if (tb[FRA_IIFNAME]) {
  250. struct net_device *dev;
  251. rule->iifindex = -1;
  252. nla_strlcpy(rule->iifname, tb[FRA_IIFNAME], IFNAMSIZ);
  253. dev = __dev_get_by_name(net, rule->iifname);
  254. if (dev)
  255. rule->iifindex = dev->ifindex;
  256. }
  257. if (tb[FRA_OIFNAME]) {
  258. struct net_device *dev;
  259. rule->oifindex = -1;
  260. nla_strlcpy(rule->oifname, tb[FRA_OIFNAME], IFNAMSIZ);
  261. dev = __dev_get_by_name(net, rule->oifname);
  262. if (dev)
  263. rule->oifindex = dev->ifindex;
  264. }
  265. if (tb[FRA_FWMARK]) {
  266. rule->mark = nla_get_u32(tb[FRA_FWMARK]);
  267. if (rule->mark)
  268. /* compatibility: if the mark value is non-zero all bits
  269. * are compared unless a mask is explicitly specified.
  270. */
  271. rule->mark_mask = 0xFFFFFFFF;
  272. }
  273. if (tb[FRA_FWMASK])
  274. rule->mark_mask = nla_get_u32(tb[FRA_FWMASK]);
  275. rule->action = frh->action;
  276. rule->flags = frh->flags;
  277. rule->table = frh_get_table(frh, tb);
  278. if (tb[FRA_TABLE_PREFIXLEN_MIN])
  279. rule->table_prefixlen_min = nla_get_u8(tb[FRA_TABLE_PREFIXLEN_MIN]);
  280. if (!tb[FRA_PRIORITY] && ops->default_pref)
  281. rule->pref = ops->default_pref(ops);
  282. err = -EINVAL;
  283. if (tb[FRA_GOTO]) {
  284. if (rule->action != FR_ACT_GOTO)
  285. goto errout_free;
  286. rule->target = nla_get_u32(tb[FRA_GOTO]);
  287. /* Backward jumps are prohibited to avoid endless loops */
  288. if (rule->target <= rule->pref)
  289. goto errout_free;
  290. list_for_each_entry(r, &ops->rules_list, list) {
  291. if (r->pref == rule->target) {
  292. RCU_INIT_POINTER(rule->ctarget, r);
  293. break;
  294. }
  295. }
  296. if (rcu_dereference_protected(rule->ctarget, 1) == NULL)
  297. unresolved = 1;
  298. } else if (rule->action == FR_ACT_GOTO)
  299. goto errout_free;
  300. err = ops->configure(rule, skb, frh, tb);
  301. if (err < 0)
  302. goto errout_free;
  303. list_for_each_entry(r, &ops->rules_list, list) {
  304. if (r->pref > rule->pref)
  305. break;
  306. last = r;
  307. }
  308. fib_rule_get(rule);
  309. if (last)
  310. list_add_rcu(&rule->list, &last->list);
  311. else
  312. list_add_rcu(&rule->list, &ops->rules_list);
  313. if (ops->unresolved_rules) {
  314. /*
  315. * There are unresolved goto rules in the list, check if
  316. * any of them are pointing to this new rule.
  317. */
  318. list_for_each_entry(r, &ops->rules_list, list) {
  319. if (r->action == FR_ACT_GOTO &&
  320. r->target == rule->pref &&
  321. rtnl_dereference(r->ctarget) == NULL) {
  322. rcu_assign_pointer(r->ctarget, rule);
  323. if (--ops->unresolved_rules == 0)
  324. break;
  325. }
  326. }
  327. }
  328. if (rule->action == FR_ACT_GOTO)
  329. ops->nr_goto_rules++;
  330. if (unresolved)
  331. ops->unresolved_rules++;
  332. notify_rule_change(RTM_NEWRULE, rule, ops, nlh, NETLINK_CB(skb).portid);
  333. flush_route_cache(ops);
  334. rules_ops_put(ops);
  335. return 0;
  336. errout_free:
  337. release_net(rule->fr_net);
  338. kfree(rule);
  339. errout:
  340. rules_ops_put(ops);
  341. return err;
  342. }
  343. static int fib_nl_delrule(struct sk_buff *skb, struct nlmsghdr* nlh)
  344. {
  345. struct net *net = sock_net(skb->sk);
  346. struct fib_rule_hdr *frh = nlmsg_data(nlh);
  347. struct fib_rules_ops *ops = NULL;
  348. struct fib_rule *rule, *tmp;
  349. struct nlattr *tb[FRA_MAX+1];
  350. int err = -EINVAL;
  351. if (nlh->nlmsg_len < nlmsg_msg_size(sizeof(*frh)))
  352. goto errout;
  353. ops = lookup_rules_ops(net, frh->family);
  354. if (ops == NULL) {
  355. err = -EAFNOSUPPORT;
  356. goto errout;
  357. }
  358. err = nlmsg_parse(nlh, sizeof(*frh), tb, FRA_MAX, ops->policy);
  359. if (err < 0)
  360. goto errout;
  361. err = validate_rulemsg(frh, tb, ops);
  362. if (err < 0)
  363. goto errout;
  364. list_for_each_entry(rule, &ops->rules_list, list) {
  365. if (frh->action && (frh->action != rule->action))
  366. continue;
  367. if (frh->table && (frh_get_table(frh, tb) != rule->table))
  368. continue;
  369. if (tb[FRA_PRIORITY] &&
  370. (rule->pref != nla_get_u32(tb[FRA_PRIORITY])))
  371. continue;
  372. if (tb[FRA_IIFNAME] &&
  373. nla_strcmp(tb[FRA_IIFNAME], rule->iifname))
  374. continue;
  375. if (tb[FRA_OIFNAME] &&
  376. nla_strcmp(tb[FRA_OIFNAME], rule->oifname))
  377. continue;
  378. if (tb[FRA_FWMARK] &&
  379. (rule->mark != nla_get_u32(tb[FRA_FWMARK])))
  380. continue;
  381. if (tb[FRA_FWMASK] &&
  382. (rule->mark_mask != nla_get_u32(tb[FRA_FWMASK])))
  383. continue;
  384. if (!ops->compare(rule, frh, tb))
  385. continue;
  386. if (rule->flags & FIB_RULE_PERMANENT) {
  387. err = -EPERM;
  388. goto errout;
  389. }
  390. list_del_rcu(&rule->list);
  391. if (rule->action == FR_ACT_GOTO) {
  392. ops->nr_goto_rules--;
  393. if (rtnl_dereference(rule->ctarget) == NULL)
  394. ops->unresolved_rules--;
  395. }
  396. /*
  397. * Check if this rule is a target to any of them. If so,
  398. * disable them. As this operation is eventually very
  399. * expensive, it is only performed if goto rules have
  400. * actually been added.
  401. */
  402. if (ops->nr_goto_rules > 0) {
  403. list_for_each_entry(tmp, &ops->rules_list, list) {
  404. if (rtnl_dereference(tmp->ctarget) == rule) {
  405. RCU_INIT_POINTER(tmp->ctarget, NULL);
  406. ops->unresolved_rules++;
  407. }
  408. }
  409. }
  410. notify_rule_change(RTM_DELRULE, rule, ops, nlh,
  411. NETLINK_CB(skb).portid);
  412. if (ops->delete)
  413. ops->delete(rule);
  414. fib_rule_put(rule);
  415. flush_route_cache(ops);
  416. rules_ops_put(ops);
  417. return 0;
  418. }
  419. err = -ENOENT;
  420. errout:
  421. rules_ops_put(ops);
  422. return err;
  423. }
  424. static inline size_t fib_rule_nlmsg_size(struct fib_rules_ops *ops,
  425. struct fib_rule *rule)
  426. {
  427. size_t payload = NLMSG_ALIGN(sizeof(struct fib_rule_hdr))
  428. + nla_total_size(IFNAMSIZ) /* FRA_IIFNAME */
  429. + nla_total_size(IFNAMSIZ) /* FRA_OIFNAME */
  430. + nla_total_size(4) /* FRA_PRIORITY */
  431. + nla_total_size(4) /* FRA_TABLE */
  432. + nla_total_size(1) /* FRA_TABLE_PREFIXLEN_MIN */
  433. + nla_total_size(4) /* FRA_FWMARK */
  434. + nla_total_size(4); /* FRA_FWMASK */
  435. if (ops->nlmsg_payload)
  436. payload += ops->nlmsg_payload(rule);
  437. return payload;
  438. }
  439. static int fib_nl_fill_rule(struct sk_buff *skb, struct fib_rule *rule,
  440. u32 pid, u32 seq, int type, int flags,
  441. struct fib_rules_ops *ops)
  442. {
  443. struct nlmsghdr *nlh;
  444. struct fib_rule_hdr *frh;
  445. nlh = nlmsg_put(skb, pid, seq, type, sizeof(*frh), flags);
  446. if (nlh == NULL)
  447. return -EMSGSIZE;
  448. frh = nlmsg_data(nlh);
  449. frh->family = ops->family;
  450. frh->table = rule->table;
  451. if (nla_put_u32(skb, FRA_TABLE, rule->table))
  452. goto nla_put_failure;
  453. if (nla_put_u8(skb, FRA_TABLE_PREFIXLEN_MIN, rule->table_prefixlen_min))
  454. goto nla_put_failure;
  455. frh->res1 = 0;
  456. frh->res2 = 0;
  457. frh->action = rule->action;
  458. frh->flags = rule->flags;
  459. if (rule->action == FR_ACT_GOTO &&
  460. rcu_access_pointer(rule->ctarget) == NULL)
  461. frh->flags |= FIB_RULE_UNRESOLVED;
  462. if (rule->iifname[0]) {
  463. if (nla_put_string(skb, FRA_IIFNAME, rule->iifname))
  464. goto nla_put_failure;
  465. if (rule->iifindex == -1)
  466. frh->flags |= FIB_RULE_IIF_DETACHED;
  467. }
  468. if (rule->oifname[0]) {
  469. if (nla_put_string(skb, FRA_OIFNAME, rule->oifname))
  470. goto nla_put_failure;
  471. if (rule->oifindex == -1)
  472. frh->flags |= FIB_RULE_OIF_DETACHED;
  473. }
  474. if ((rule->pref &&
  475. nla_put_u32(skb, FRA_PRIORITY, rule->pref)) ||
  476. (rule->mark &&
  477. nla_put_u32(skb, FRA_FWMARK, rule->mark)) ||
  478. ((rule->mark_mask || rule->mark) &&
  479. nla_put_u32(skb, FRA_FWMASK, rule->mark_mask)) ||
  480. (rule->target &&
  481. nla_put_u32(skb, FRA_GOTO, rule->target)))
  482. goto nla_put_failure;
  483. if (ops->fill(rule, skb, frh) < 0)
  484. goto nla_put_failure;
  485. return nlmsg_end(skb, nlh);
  486. nla_put_failure:
  487. nlmsg_cancel(skb, nlh);
  488. return -EMSGSIZE;
  489. }
  490. static int dump_rules(struct sk_buff *skb, struct netlink_callback *cb,
  491. struct fib_rules_ops *ops)
  492. {
  493. int idx = 0;
  494. struct fib_rule *rule;
  495. rcu_read_lock();
  496. list_for_each_entry_rcu(rule, &ops->rules_list, list) {
  497. if (idx < cb->args[1])
  498. goto skip;
  499. if (fib_nl_fill_rule(skb, rule, NETLINK_CB(cb->skb).portid,
  500. cb->nlh->nlmsg_seq, RTM_NEWRULE,
  501. NLM_F_MULTI, ops) < 0)
  502. break;
  503. skip:
  504. idx++;
  505. }
  506. rcu_read_unlock();
  507. cb->args[1] = idx;
  508. rules_ops_put(ops);
  509. return skb->len;
  510. }
  511. static int fib_nl_dumprule(struct sk_buff *skb, struct netlink_callback *cb)
  512. {
  513. struct net *net = sock_net(skb->sk);
  514. struct fib_rules_ops *ops;
  515. int idx = 0, family;
  516. family = rtnl_msg_family(cb->nlh);
  517. if (family != AF_UNSPEC) {
  518. /* Protocol specific dump request */
  519. ops = lookup_rules_ops(net, family);
  520. if (ops == NULL)
  521. return -EAFNOSUPPORT;
  522. return dump_rules(skb, cb, ops);
  523. }
  524. rcu_read_lock();
  525. list_for_each_entry_rcu(ops, &net->rules_ops, list) {
  526. if (idx < cb->args[0] || !try_module_get(ops->owner))
  527. goto skip;
  528. if (dump_rules(skb, cb, ops) < 0)
  529. break;
  530. cb->args[1] = 0;
  531. skip:
  532. idx++;
  533. }
  534. rcu_read_unlock();
  535. cb->args[0] = idx;
  536. return skb->len;
  537. }
  538. static void notify_rule_change(int event, struct fib_rule *rule,
  539. struct fib_rules_ops *ops, struct nlmsghdr *nlh,
  540. u32 pid)
  541. {
  542. struct net *net;
  543. struct sk_buff *skb;
  544. int err = -ENOBUFS;
  545. net = ops->fro_net;
  546. skb = nlmsg_new(fib_rule_nlmsg_size(ops, rule), GFP_KERNEL);
  547. if (skb == NULL)
  548. goto errout;
  549. err = fib_nl_fill_rule(skb, rule, pid, nlh->nlmsg_seq, event, 0, ops);
  550. if (err < 0) {
  551. /* -EMSGSIZE implies BUG in fib_rule_nlmsg_size() */
  552. WARN_ON(err == -EMSGSIZE);
  553. kfree_skb(skb);
  554. goto errout;
  555. }
  556. rtnl_notify(skb, net, pid, ops->nlgroup, nlh, GFP_KERNEL);
  557. return;
  558. errout:
  559. if (err < 0)
  560. rtnl_set_sk_err(net, ops->nlgroup, err);
  561. }
  562. static void attach_rules(struct list_head *rules, struct net_device *dev)
  563. {
  564. struct fib_rule *rule;
  565. list_for_each_entry(rule, rules, list) {
  566. if (rule->iifindex == -1 &&
  567. strcmp(dev->name, rule->iifname) == 0)
  568. rule->iifindex = dev->ifindex;
  569. if (rule->oifindex == -1 &&
  570. strcmp(dev->name, rule->oifname) == 0)
  571. rule->oifindex = dev->ifindex;
  572. }
  573. }
  574. static void detach_rules(struct list_head *rules, struct net_device *dev)
  575. {
  576. struct fib_rule *rule;
  577. list_for_each_entry(rule, rules, list) {
  578. if (rule->iifindex == dev->ifindex)
  579. rule->iifindex = -1;
  580. if (rule->oifindex == dev->ifindex)
  581. rule->oifindex = -1;
  582. }
  583. }
  584. static int fib_rules_event(struct notifier_block *this, unsigned long event,
  585. void *ptr)
  586. {
  587. struct net_device *dev = netdev_notifier_info_to_dev(ptr);
  588. struct net *net = dev_net(dev);
  589. struct fib_rules_ops *ops;
  590. ASSERT_RTNL();
  591. switch (event) {
  592. case NETDEV_REGISTER:
  593. list_for_each_entry(ops, &net->rules_ops, list)
  594. attach_rules(&ops->rules_list, dev);
  595. break;
  596. case NETDEV_UNREGISTER:
  597. list_for_each_entry(ops, &net->rules_ops, list)
  598. detach_rules(&ops->rules_list, dev);
  599. break;
  600. }
  601. return NOTIFY_DONE;
  602. }
  603. static struct notifier_block fib_rules_notifier = {
  604. .notifier_call = fib_rules_event,
  605. };
  606. static int __net_init fib_rules_net_init(struct net *net)
  607. {
  608. INIT_LIST_HEAD(&net->rules_ops);
  609. spin_lock_init(&net->rules_mod_lock);
  610. return 0;
  611. }
  612. static struct pernet_operations fib_rules_net_ops = {
  613. .init = fib_rules_net_init,
  614. };
  615. static int __init fib_rules_init(void)
  616. {
  617. int err;
  618. rtnl_register(PF_UNSPEC, RTM_NEWRULE, fib_nl_newrule, NULL, NULL);
  619. rtnl_register(PF_UNSPEC, RTM_DELRULE, fib_nl_delrule, NULL, NULL);
  620. rtnl_register(PF_UNSPEC, RTM_GETRULE, NULL, fib_nl_dumprule, NULL);
  621. err = register_pernet_subsys(&fib_rules_net_ops);
  622. if (err < 0)
  623. goto fail;
  624. err = register_netdevice_notifier(&fib_rules_notifier);
  625. if (err < 0)
  626. goto fail_unregister;
  627. return 0;
  628. fail_unregister:
  629. unregister_pernet_subsys(&fib_rules_net_ops);
  630. fail:
  631. rtnl_unregister(PF_UNSPEC, RTM_NEWRULE);
  632. rtnl_unregister(PF_UNSPEC, RTM_DELRULE);
  633. rtnl_unregister(PF_UNSPEC, RTM_GETRULE);
  634. return err;
  635. }
  636. subsys_initcall(fib_rules_init);