fib_rules.c 17 KB

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