fib_rules.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961
  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. #include <net/ip_tunnels.h>
  19. static const struct fib_kuid_range fib_kuid_range_unset = {
  20. KUIDT_INIT(0),
  21. KUIDT_INIT(~0),
  22. };
  23. int fib_default_rule_add(struct fib_rules_ops *ops,
  24. u32 pref, u32 table, u32 flags)
  25. {
  26. struct fib_rule *r;
  27. r = kzalloc(ops->rule_size, GFP_KERNEL);
  28. if (r == NULL)
  29. return -ENOMEM;
  30. atomic_set(&r->refcnt, 1);
  31. r->action = FR_ACT_TO_TBL;
  32. r->pref = pref;
  33. r->table = table;
  34. r->flags = flags;
  35. r->fr_net = ops->fro_net;
  36. r->uid_range = fib_kuid_range_unset;
  37. r->suppress_prefixlen = -1;
  38. r->suppress_ifgroup = -1;
  39. /* The lock is not required here, the list in unreacheable
  40. * at the moment this function is called */
  41. list_add_tail(&r->list, &ops->rules_list);
  42. return 0;
  43. }
  44. EXPORT_SYMBOL(fib_default_rule_add);
  45. static u32 fib_default_rule_pref(struct fib_rules_ops *ops)
  46. {
  47. struct list_head *pos;
  48. struct fib_rule *rule;
  49. if (!list_empty(&ops->rules_list)) {
  50. pos = ops->rules_list.next;
  51. if (pos->next != &ops->rules_list) {
  52. rule = list_entry(pos->next, struct fib_rule, list);
  53. if (rule->pref)
  54. return rule->pref - 1;
  55. }
  56. }
  57. return 0;
  58. }
  59. static void notify_rule_change(int event, struct fib_rule *rule,
  60. struct fib_rules_ops *ops, struct nlmsghdr *nlh,
  61. u32 pid);
  62. static struct fib_rules_ops *lookup_rules_ops(struct net *net, int family)
  63. {
  64. struct fib_rules_ops *ops;
  65. rcu_read_lock();
  66. list_for_each_entry_rcu(ops, &net->rules_ops, list) {
  67. if (ops->family == family) {
  68. if (!try_module_get(ops->owner))
  69. ops = NULL;
  70. rcu_read_unlock();
  71. return ops;
  72. }
  73. }
  74. rcu_read_unlock();
  75. return NULL;
  76. }
  77. static void rules_ops_put(struct fib_rules_ops *ops)
  78. {
  79. if (ops)
  80. module_put(ops->owner);
  81. }
  82. static void flush_route_cache(struct fib_rules_ops *ops)
  83. {
  84. if (ops->flush_cache)
  85. ops->flush_cache(ops);
  86. }
  87. static int __fib_rules_register(struct fib_rules_ops *ops)
  88. {
  89. int err = -EEXIST;
  90. struct fib_rules_ops *o;
  91. struct net *net;
  92. net = ops->fro_net;
  93. if (ops->rule_size < sizeof(struct fib_rule))
  94. return -EINVAL;
  95. if (ops->match == NULL || ops->configure == NULL ||
  96. ops->compare == NULL || ops->fill == NULL ||
  97. ops->action == NULL)
  98. return -EINVAL;
  99. spin_lock(&net->rules_mod_lock);
  100. list_for_each_entry(o, &net->rules_ops, list)
  101. if (ops->family == o->family)
  102. goto errout;
  103. list_add_tail_rcu(&ops->list, &net->rules_ops);
  104. err = 0;
  105. errout:
  106. spin_unlock(&net->rules_mod_lock);
  107. return err;
  108. }
  109. struct fib_rules_ops *
  110. fib_rules_register(const struct fib_rules_ops *tmpl, struct net *net)
  111. {
  112. struct fib_rules_ops *ops;
  113. int err;
  114. ops = kmemdup(tmpl, sizeof(*ops), GFP_KERNEL);
  115. if (ops == NULL)
  116. return ERR_PTR(-ENOMEM);
  117. INIT_LIST_HEAD(&ops->rules_list);
  118. ops->fro_net = net;
  119. err = __fib_rules_register(ops);
  120. if (err) {
  121. kfree(ops);
  122. ops = ERR_PTR(err);
  123. }
  124. return ops;
  125. }
  126. EXPORT_SYMBOL_GPL(fib_rules_register);
  127. static void fib_rules_cleanup_ops(struct fib_rules_ops *ops)
  128. {
  129. struct fib_rule *rule, *tmp;
  130. list_for_each_entry_safe(rule, tmp, &ops->rules_list, list) {
  131. list_del_rcu(&rule->list);
  132. if (ops->delete)
  133. ops->delete(rule);
  134. fib_rule_put(rule);
  135. }
  136. }
  137. void fib_rules_unregister(struct fib_rules_ops *ops)
  138. {
  139. struct net *net = ops->fro_net;
  140. spin_lock(&net->rules_mod_lock);
  141. list_del_rcu(&ops->list);
  142. spin_unlock(&net->rules_mod_lock);
  143. fib_rules_cleanup_ops(ops);
  144. kfree_rcu(ops, rcu);
  145. }
  146. EXPORT_SYMBOL_GPL(fib_rules_unregister);
  147. static int uid_range_set(struct fib_kuid_range *range)
  148. {
  149. return uid_valid(range->start) && uid_valid(range->end);
  150. }
  151. static struct fib_kuid_range nla_get_kuid_range(struct nlattr **tb)
  152. {
  153. struct fib_rule_uid_range *in;
  154. struct fib_kuid_range out;
  155. in = (struct fib_rule_uid_range *)nla_data(tb[FRA_UID_RANGE]);
  156. out.start = make_kuid(current_user_ns(), in->start);
  157. out.end = make_kuid(current_user_ns(), in->end);
  158. return out;
  159. }
  160. static int nla_put_uid_range(struct sk_buff *skb, struct fib_kuid_range *range)
  161. {
  162. struct fib_rule_uid_range out = {
  163. from_kuid_munged(current_user_ns(), range->start),
  164. from_kuid_munged(current_user_ns(), range->end)
  165. };
  166. return nla_put(skb, FRA_UID_RANGE, sizeof(out), &out);
  167. }
  168. static int fib_rule_match(struct fib_rule *rule, struct fib_rules_ops *ops,
  169. struct flowi *fl, int flags,
  170. struct fib_lookup_arg *arg)
  171. {
  172. int ret = 0;
  173. if (rule->iifindex && (rule->iifindex != fl->flowi_iif))
  174. goto out;
  175. if (rule->oifindex && (rule->oifindex != fl->flowi_oif))
  176. goto out;
  177. if ((rule->mark ^ fl->flowi_mark) & rule->mark_mask)
  178. goto out;
  179. if (rule->tun_id && (rule->tun_id != fl->flowi_tun_key.tun_id))
  180. goto out;
  181. if (rule->l3mdev && !l3mdev_fib_rule_match(rule->fr_net, fl, arg))
  182. goto out;
  183. if (uid_lt(fl->flowi_uid, rule->uid_range.start) ||
  184. uid_gt(fl->flowi_uid, rule->uid_range.end))
  185. goto out;
  186. ret = ops->match(rule, fl, flags);
  187. out:
  188. return (rule->flags & FIB_RULE_INVERT) ? !ret : ret;
  189. }
  190. int fib_rules_lookup(struct fib_rules_ops *ops, struct flowi *fl,
  191. int flags, struct fib_lookup_arg *arg)
  192. {
  193. struct fib_rule *rule;
  194. int err;
  195. rcu_read_lock();
  196. list_for_each_entry_rcu(rule, &ops->rules_list, list) {
  197. jumped:
  198. if (!fib_rule_match(rule, ops, fl, flags, arg))
  199. continue;
  200. if (rule->action == FR_ACT_GOTO) {
  201. struct fib_rule *target;
  202. target = rcu_dereference(rule->ctarget);
  203. if (target == NULL) {
  204. continue;
  205. } else {
  206. rule = target;
  207. goto jumped;
  208. }
  209. } else if (rule->action == FR_ACT_NOP)
  210. continue;
  211. else
  212. err = ops->action(rule, fl, flags, arg);
  213. if (!err && ops->suppress && ops->suppress(rule, arg))
  214. continue;
  215. if (err != -EAGAIN) {
  216. if ((arg->flags & FIB_LOOKUP_NOREF) ||
  217. likely(atomic_inc_not_zero(&rule->refcnt))) {
  218. arg->rule = rule;
  219. goto out;
  220. }
  221. break;
  222. }
  223. }
  224. err = -ESRCH;
  225. out:
  226. rcu_read_unlock();
  227. return err;
  228. }
  229. EXPORT_SYMBOL_GPL(fib_rules_lookup);
  230. static int validate_rulemsg(struct fib_rule_hdr *frh, struct nlattr **tb,
  231. struct fib_rules_ops *ops)
  232. {
  233. int err = -EINVAL;
  234. if (frh->src_len)
  235. if (tb[FRA_SRC] == NULL ||
  236. frh->src_len > (ops->addr_size * 8) ||
  237. nla_len(tb[FRA_SRC]) != ops->addr_size)
  238. goto errout;
  239. if (frh->dst_len)
  240. if (tb[FRA_DST] == NULL ||
  241. frh->dst_len > (ops->addr_size * 8) ||
  242. nla_len(tb[FRA_DST]) != ops->addr_size)
  243. goto errout;
  244. err = 0;
  245. errout:
  246. return err;
  247. }
  248. static int rule_exists(struct fib_rules_ops *ops, struct fib_rule_hdr *frh,
  249. struct nlattr **tb, struct fib_rule *rule)
  250. {
  251. struct fib_rule *r;
  252. list_for_each_entry(r, &ops->rules_list, list) {
  253. if (r->action != rule->action)
  254. continue;
  255. if (r->table != rule->table)
  256. continue;
  257. if (r->pref != rule->pref)
  258. continue;
  259. if (memcmp(r->iifname, rule->iifname, IFNAMSIZ))
  260. continue;
  261. if (memcmp(r->oifname, rule->oifname, IFNAMSIZ))
  262. continue;
  263. if (r->mark != rule->mark)
  264. continue;
  265. if (r->mark_mask != rule->mark_mask)
  266. continue;
  267. if (r->tun_id != rule->tun_id)
  268. continue;
  269. if (r->fr_net != rule->fr_net)
  270. continue;
  271. if (r->l3mdev != rule->l3mdev)
  272. continue;
  273. if (!ops->compare(r, frh, tb))
  274. continue;
  275. return 1;
  276. }
  277. return 0;
  278. }
  279. int fib_nl_newrule(struct sk_buff *skb, struct nlmsghdr *nlh)
  280. {
  281. struct net *net = sock_net(skb->sk);
  282. struct fib_rule_hdr *frh = nlmsg_data(nlh);
  283. struct fib_rules_ops *ops = NULL;
  284. struct fib_rule *rule, *r, *last = NULL;
  285. struct nlattr *tb[FRA_MAX+1];
  286. int err = -EINVAL, unresolved = 0;
  287. if (nlh->nlmsg_len < nlmsg_msg_size(sizeof(*frh)))
  288. goto errout;
  289. ops = lookup_rules_ops(net, frh->family);
  290. if (ops == NULL) {
  291. err = -EAFNOSUPPORT;
  292. goto errout;
  293. }
  294. err = nlmsg_parse(nlh, sizeof(*frh), tb, FRA_MAX, ops->policy);
  295. if (err < 0)
  296. goto errout;
  297. err = validate_rulemsg(frh, tb, ops);
  298. if (err < 0)
  299. goto errout;
  300. rule = kzalloc(ops->rule_size, GFP_KERNEL);
  301. if (rule == NULL) {
  302. err = -ENOMEM;
  303. goto errout;
  304. }
  305. rule->fr_net = net;
  306. rule->pref = tb[FRA_PRIORITY] ? nla_get_u32(tb[FRA_PRIORITY])
  307. : fib_default_rule_pref(ops);
  308. if (tb[FRA_IIFNAME]) {
  309. struct net_device *dev;
  310. rule->iifindex = -1;
  311. nla_strlcpy(rule->iifname, tb[FRA_IIFNAME], IFNAMSIZ);
  312. dev = __dev_get_by_name(net, rule->iifname);
  313. if (dev)
  314. rule->iifindex = dev->ifindex;
  315. }
  316. if (tb[FRA_OIFNAME]) {
  317. struct net_device *dev;
  318. rule->oifindex = -1;
  319. nla_strlcpy(rule->oifname, tb[FRA_OIFNAME], IFNAMSIZ);
  320. dev = __dev_get_by_name(net, rule->oifname);
  321. if (dev)
  322. rule->oifindex = dev->ifindex;
  323. }
  324. if (tb[FRA_FWMARK]) {
  325. rule->mark = nla_get_u32(tb[FRA_FWMARK]);
  326. if (rule->mark)
  327. /* compatibility: if the mark value is non-zero all bits
  328. * are compared unless a mask is explicitly specified.
  329. */
  330. rule->mark_mask = 0xFFFFFFFF;
  331. }
  332. if (tb[FRA_FWMASK])
  333. rule->mark_mask = nla_get_u32(tb[FRA_FWMASK]);
  334. if (tb[FRA_TUN_ID])
  335. rule->tun_id = nla_get_be64(tb[FRA_TUN_ID]);
  336. if (tb[FRA_L3MDEV]) {
  337. #ifdef CONFIG_NET_L3_MASTER_DEV
  338. rule->l3mdev = nla_get_u8(tb[FRA_L3MDEV]);
  339. if (rule->l3mdev != 1)
  340. #endif
  341. goto errout_free;
  342. }
  343. rule->action = frh->action;
  344. rule->flags = frh->flags;
  345. rule->table = frh_get_table(frh, tb);
  346. if (tb[FRA_SUPPRESS_PREFIXLEN])
  347. rule->suppress_prefixlen = nla_get_u32(tb[FRA_SUPPRESS_PREFIXLEN]);
  348. else
  349. rule->suppress_prefixlen = -1;
  350. if (tb[FRA_SUPPRESS_IFGROUP])
  351. rule->suppress_ifgroup = nla_get_u32(tb[FRA_SUPPRESS_IFGROUP]);
  352. else
  353. rule->suppress_ifgroup = -1;
  354. err = -EINVAL;
  355. if (tb[FRA_GOTO]) {
  356. if (rule->action != FR_ACT_GOTO)
  357. goto errout_free;
  358. rule->target = nla_get_u32(tb[FRA_GOTO]);
  359. /* Backward jumps are prohibited to avoid endless loops */
  360. if (rule->target <= rule->pref)
  361. goto errout_free;
  362. list_for_each_entry(r, &ops->rules_list, list) {
  363. if (r->pref == rule->target) {
  364. RCU_INIT_POINTER(rule->ctarget, r);
  365. break;
  366. }
  367. }
  368. if (rcu_dereference_protected(rule->ctarget, 1) == NULL)
  369. unresolved = 1;
  370. } else if (rule->action == FR_ACT_GOTO)
  371. goto errout_free;
  372. if (rule->l3mdev && rule->table)
  373. goto errout_free;
  374. if (tb[FRA_UID_RANGE]) {
  375. if (current_user_ns() != net->user_ns) {
  376. err = -EPERM;
  377. goto errout_free;
  378. }
  379. rule->uid_range = nla_get_kuid_range(tb);
  380. if (!uid_range_set(&rule->uid_range) ||
  381. !uid_lte(rule->uid_range.start, rule->uid_range.end))
  382. goto errout_free;
  383. } else {
  384. rule->uid_range = fib_kuid_range_unset;
  385. }
  386. if ((nlh->nlmsg_flags & NLM_F_EXCL) &&
  387. rule_exists(ops, frh, tb, rule)) {
  388. err = -EEXIST;
  389. goto errout_free;
  390. }
  391. err = ops->configure(rule, skb, frh, tb);
  392. if (err < 0)
  393. goto errout_free;
  394. list_for_each_entry(r, &ops->rules_list, list) {
  395. if (r->pref > rule->pref)
  396. break;
  397. last = r;
  398. }
  399. fib_rule_get(rule);
  400. if (last)
  401. list_add_rcu(&rule->list, &last->list);
  402. else
  403. list_add_rcu(&rule->list, &ops->rules_list);
  404. if (ops->unresolved_rules) {
  405. /*
  406. * There are unresolved goto rules in the list, check if
  407. * any of them are pointing to this new rule.
  408. */
  409. list_for_each_entry(r, &ops->rules_list, list) {
  410. if (r->action == FR_ACT_GOTO &&
  411. r->target == rule->pref &&
  412. rtnl_dereference(r->ctarget) == NULL) {
  413. rcu_assign_pointer(r->ctarget, rule);
  414. if (--ops->unresolved_rules == 0)
  415. break;
  416. }
  417. }
  418. }
  419. if (rule->action == FR_ACT_GOTO)
  420. ops->nr_goto_rules++;
  421. if (unresolved)
  422. ops->unresolved_rules++;
  423. if (rule->tun_id)
  424. ip_tunnel_need_metadata();
  425. notify_rule_change(RTM_NEWRULE, rule, ops, nlh, NETLINK_CB(skb).portid);
  426. flush_route_cache(ops);
  427. rules_ops_put(ops);
  428. return 0;
  429. errout_free:
  430. kfree(rule);
  431. errout:
  432. rules_ops_put(ops);
  433. return err;
  434. }
  435. EXPORT_SYMBOL_GPL(fib_nl_newrule);
  436. int fib_nl_delrule(struct sk_buff *skb, struct nlmsghdr *nlh)
  437. {
  438. struct net *net = sock_net(skb->sk);
  439. struct fib_rule_hdr *frh = nlmsg_data(nlh);
  440. struct fib_rules_ops *ops = NULL;
  441. struct fib_rule *rule, *tmp;
  442. struct nlattr *tb[FRA_MAX+1];
  443. struct fib_kuid_range range;
  444. int err = -EINVAL;
  445. if (nlh->nlmsg_len < nlmsg_msg_size(sizeof(*frh)))
  446. goto errout;
  447. ops = lookup_rules_ops(net, frh->family);
  448. if (ops == NULL) {
  449. err = -EAFNOSUPPORT;
  450. goto errout;
  451. }
  452. err = nlmsg_parse(nlh, sizeof(*frh), tb, FRA_MAX, ops->policy);
  453. if (err < 0)
  454. goto errout;
  455. err = validate_rulemsg(frh, tb, ops);
  456. if (err < 0)
  457. goto errout;
  458. if (tb[FRA_UID_RANGE]) {
  459. range = nla_get_kuid_range(tb);
  460. if (!uid_range_set(&range))
  461. goto errout;
  462. } else {
  463. range = fib_kuid_range_unset;
  464. }
  465. list_for_each_entry(rule, &ops->rules_list, list) {
  466. if (frh->action && (frh->action != rule->action))
  467. continue;
  468. if (frh_get_table(frh, tb) &&
  469. (frh_get_table(frh, tb) != rule->table))
  470. continue;
  471. if (tb[FRA_PRIORITY] &&
  472. (rule->pref != nla_get_u32(tb[FRA_PRIORITY])))
  473. continue;
  474. if (tb[FRA_IIFNAME] &&
  475. nla_strcmp(tb[FRA_IIFNAME], rule->iifname))
  476. continue;
  477. if (tb[FRA_OIFNAME] &&
  478. nla_strcmp(tb[FRA_OIFNAME], rule->oifname))
  479. continue;
  480. if (tb[FRA_FWMARK] &&
  481. (rule->mark != nla_get_u32(tb[FRA_FWMARK])))
  482. continue;
  483. if (tb[FRA_FWMASK] &&
  484. (rule->mark_mask != nla_get_u32(tb[FRA_FWMASK])))
  485. continue;
  486. if (tb[FRA_TUN_ID] &&
  487. (rule->tun_id != nla_get_be64(tb[FRA_TUN_ID])))
  488. continue;
  489. if (tb[FRA_L3MDEV] &&
  490. (rule->l3mdev != nla_get_u8(tb[FRA_L3MDEV])))
  491. continue;
  492. if (uid_range_set(&range) &&
  493. (!uid_eq(rule->uid_range.start, range.start) ||
  494. !uid_eq(rule->uid_range.end, range.end)))
  495. continue;
  496. if (!ops->compare(rule, frh, tb))
  497. continue;
  498. if (rule->flags & FIB_RULE_PERMANENT) {
  499. err = -EPERM;
  500. goto errout;
  501. }
  502. if (ops->delete) {
  503. err = ops->delete(rule);
  504. if (err)
  505. goto errout;
  506. }
  507. if (rule->tun_id)
  508. ip_tunnel_unneed_metadata();
  509. list_del_rcu(&rule->list);
  510. if (rule->action == FR_ACT_GOTO) {
  511. ops->nr_goto_rules--;
  512. if (rtnl_dereference(rule->ctarget) == NULL)
  513. ops->unresolved_rules--;
  514. }
  515. /*
  516. * Check if this rule is a target to any of them. If so,
  517. * disable them. As this operation is eventually very
  518. * expensive, it is only performed if goto rules have
  519. * actually been added.
  520. */
  521. if (ops->nr_goto_rules > 0) {
  522. list_for_each_entry(tmp, &ops->rules_list, list) {
  523. if (rtnl_dereference(tmp->ctarget) == rule) {
  524. RCU_INIT_POINTER(tmp->ctarget, NULL);
  525. ops->unresolved_rules++;
  526. }
  527. }
  528. }
  529. notify_rule_change(RTM_DELRULE, rule, ops, nlh,
  530. NETLINK_CB(skb).portid);
  531. fib_rule_put(rule);
  532. flush_route_cache(ops);
  533. rules_ops_put(ops);
  534. return 0;
  535. }
  536. err = -ENOENT;
  537. errout:
  538. rules_ops_put(ops);
  539. return err;
  540. }
  541. EXPORT_SYMBOL_GPL(fib_nl_delrule);
  542. static inline size_t fib_rule_nlmsg_size(struct fib_rules_ops *ops,
  543. struct fib_rule *rule)
  544. {
  545. size_t payload = NLMSG_ALIGN(sizeof(struct fib_rule_hdr))
  546. + nla_total_size(IFNAMSIZ) /* FRA_IIFNAME */
  547. + nla_total_size(IFNAMSIZ) /* FRA_OIFNAME */
  548. + nla_total_size(4) /* FRA_PRIORITY */
  549. + nla_total_size(4) /* FRA_TABLE */
  550. + nla_total_size(4) /* FRA_SUPPRESS_PREFIXLEN */
  551. + nla_total_size(4) /* FRA_SUPPRESS_IFGROUP */
  552. + nla_total_size(4) /* FRA_FWMARK */
  553. + nla_total_size(4) /* FRA_FWMASK */
  554. + nla_total_size_64bit(8) /* FRA_TUN_ID */
  555. + nla_total_size(sizeof(struct fib_kuid_range));
  556. if (ops->nlmsg_payload)
  557. payload += ops->nlmsg_payload(rule);
  558. return payload;
  559. }
  560. static int fib_nl_fill_rule(struct sk_buff *skb, struct fib_rule *rule,
  561. u32 pid, u32 seq, int type, int flags,
  562. struct fib_rules_ops *ops)
  563. {
  564. struct nlmsghdr *nlh;
  565. struct fib_rule_hdr *frh;
  566. nlh = nlmsg_put(skb, pid, seq, type, sizeof(*frh), flags);
  567. if (nlh == NULL)
  568. return -EMSGSIZE;
  569. frh = nlmsg_data(nlh);
  570. frh->family = ops->family;
  571. frh->table = rule->table;
  572. if (nla_put_u32(skb, FRA_TABLE, rule->table))
  573. goto nla_put_failure;
  574. if (nla_put_u32(skb, FRA_SUPPRESS_PREFIXLEN, rule->suppress_prefixlen))
  575. goto nla_put_failure;
  576. frh->res1 = 0;
  577. frh->res2 = 0;
  578. frh->action = rule->action;
  579. frh->flags = rule->flags;
  580. if (rule->action == FR_ACT_GOTO &&
  581. rcu_access_pointer(rule->ctarget) == NULL)
  582. frh->flags |= FIB_RULE_UNRESOLVED;
  583. if (rule->iifname[0]) {
  584. if (nla_put_string(skb, FRA_IIFNAME, rule->iifname))
  585. goto nla_put_failure;
  586. if (rule->iifindex == -1)
  587. frh->flags |= FIB_RULE_IIF_DETACHED;
  588. }
  589. if (rule->oifname[0]) {
  590. if (nla_put_string(skb, FRA_OIFNAME, rule->oifname))
  591. goto nla_put_failure;
  592. if (rule->oifindex == -1)
  593. frh->flags |= FIB_RULE_OIF_DETACHED;
  594. }
  595. if ((rule->pref &&
  596. nla_put_u32(skb, FRA_PRIORITY, rule->pref)) ||
  597. (rule->mark &&
  598. nla_put_u32(skb, FRA_FWMARK, rule->mark)) ||
  599. ((rule->mark_mask || rule->mark) &&
  600. nla_put_u32(skb, FRA_FWMASK, rule->mark_mask)) ||
  601. (rule->target &&
  602. nla_put_u32(skb, FRA_GOTO, rule->target)) ||
  603. (rule->tun_id &&
  604. nla_put_be64(skb, FRA_TUN_ID, rule->tun_id, FRA_PAD)) ||
  605. (rule->l3mdev &&
  606. nla_put_u8(skb, FRA_L3MDEV, rule->l3mdev)) ||
  607. (uid_range_set(&rule->uid_range) &&
  608. nla_put_uid_range(skb, &rule->uid_range)))
  609. goto nla_put_failure;
  610. if (rule->suppress_ifgroup != -1) {
  611. if (nla_put_u32(skb, FRA_SUPPRESS_IFGROUP, rule->suppress_ifgroup))
  612. goto nla_put_failure;
  613. }
  614. if (ops->fill(rule, skb, frh) < 0)
  615. goto nla_put_failure;
  616. nlmsg_end(skb, nlh);
  617. return 0;
  618. nla_put_failure:
  619. nlmsg_cancel(skb, nlh);
  620. return -EMSGSIZE;
  621. }
  622. static int dump_rules(struct sk_buff *skb, struct netlink_callback *cb,
  623. struct fib_rules_ops *ops)
  624. {
  625. int idx = 0;
  626. struct fib_rule *rule;
  627. int err = 0;
  628. rcu_read_lock();
  629. list_for_each_entry_rcu(rule, &ops->rules_list, list) {
  630. if (idx < cb->args[1])
  631. goto skip;
  632. err = fib_nl_fill_rule(skb, rule, NETLINK_CB(cb->skb).portid,
  633. cb->nlh->nlmsg_seq, RTM_NEWRULE,
  634. NLM_F_MULTI, ops);
  635. if (err)
  636. break;
  637. skip:
  638. idx++;
  639. }
  640. rcu_read_unlock();
  641. cb->args[1] = idx;
  642. rules_ops_put(ops);
  643. return err;
  644. }
  645. static int fib_nl_dumprule(struct sk_buff *skb, struct netlink_callback *cb)
  646. {
  647. struct net *net = sock_net(skb->sk);
  648. struct fib_rules_ops *ops;
  649. int idx = 0, family;
  650. family = rtnl_msg_family(cb->nlh);
  651. if (family != AF_UNSPEC) {
  652. /* Protocol specific dump request */
  653. ops = lookup_rules_ops(net, family);
  654. if (ops == NULL)
  655. return -EAFNOSUPPORT;
  656. dump_rules(skb, cb, ops);
  657. return skb->len;
  658. }
  659. rcu_read_lock();
  660. list_for_each_entry_rcu(ops, &net->rules_ops, list) {
  661. if (idx < cb->args[0] || !try_module_get(ops->owner))
  662. goto skip;
  663. if (dump_rules(skb, cb, ops) < 0)
  664. break;
  665. cb->args[1] = 0;
  666. skip:
  667. idx++;
  668. }
  669. rcu_read_unlock();
  670. cb->args[0] = idx;
  671. return skb->len;
  672. }
  673. static void notify_rule_change(int event, struct fib_rule *rule,
  674. struct fib_rules_ops *ops, struct nlmsghdr *nlh,
  675. u32 pid)
  676. {
  677. struct net *net;
  678. struct sk_buff *skb;
  679. int err = -ENOBUFS;
  680. net = ops->fro_net;
  681. skb = nlmsg_new(fib_rule_nlmsg_size(ops, rule), GFP_KERNEL);
  682. if (skb == NULL)
  683. goto errout;
  684. err = fib_nl_fill_rule(skb, rule, pid, nlh->nlmsg_seq, event, 0, ops);
  685. if (err < 0) {
  686. /* -EMSGSIZE implies BUG in fib_rule_nlmsg_size() */
  687. WARN_ON(err == -EMSGSIZE);
  688. kfree_skb(skb);
  689. goto errout;
  690. }
  691. rtnl_notify(skb, net, pid, ops->nlgroup, nlh, GFP_KERNEL);
  692. return;
  693. errout:
  694. if (err < 0)
  695. rtnl_set_sk_err(net, ops->nlgroup, err);
  696. }
  697. static void attach_rules(struct list_head *rules, struct net_device *dev)
  698. {
  699. struct fib_rule *rule;
  700. list_for_each_entry(rule, rules, list) {
  701. if (rule->iifindex == -1 &&
  702. strcmp(dev->name, rule->iifname) == 0)
  703. rule->iifindex = dev->ifindex;
  704. if (rule->oifindex == -1 &&
  705. strcmp(dev->name, rule->oifname) == 0)
  706. rule->oifindex = dev->ifindex;
  707. }
  708. }
  709. static void detach_rules(struct list_head *rules, struct net_device *dev)
  710. {
  711. struct fib_rule *rule;
  712. list_for_each_entry(rule, rules, list) {
  713. if (rule->iifindex == dev->ifindex)
  714. rule->iifindex = -1;
  715. if (rule->oifindex == dev->ifindex)
  716. rule->oifindex = -1;
  717. }
  718. }
  719. static int fib_rules_event(struct notifier_block *this, unsigned long event,
  720. void *ptr)
  721. {
  722. struct net_device *dev = netdev_notifier_info_to_dev(ptr);
  723. struct net *net = dev_net(dev);
  724. struct fib_rules_ops *ops;
  725. ASSERT_RTNL();
  726. switch (event) {
  727. case NETDEV_REGISTER:
  728. list_for_each_entry(ops, &net->rules_ops, list)
  729. attach_rules(&ops->rules_list, dev);
  730. break;
  731. case NETDEV_CHANGENAME:
  732. list_for_each_entry(ops, &net->rules_ops, list) {
  733. detach_rules(&ops->rules_list, dev);
  734. attach_rules(&ops->rules_list, dev);
  735. }
  736. break;
  737. case NETDEV_UNREGISTER:
  738. list_for_each_entry(ops, &net->rules_ops, list)
  739. detach_rules(&ops->rules_list, dev);
  740. break;
  741. }
  742. return NOTIFY_DONE;
  743. }
  744. static struct notifier_block fib_rules_notifier = {
  745. .notifier_call = fib_rules_event,
  746. };
  747. static int __net_init fib_rules_net_init(struct net *net)
  748. {
  749. INIT_LIST_HEAD(&net->rules_ops);
  750. spin_lock_init(&net->rules_mod_lock);
  751. return 0;
  752. }
  753. static struct pernet_operations fib_rules_net_ops = {
  754. .init = fib_rules_net_init,
  755. };
  756. static int __init fib_rules_init(void)
  757. {
  758. int err;
  759. rtnl_register(PF_UNSPEC, RTM_NEWRULE, fib_nl_newrule, NULL, NULL);
  760. rtnl_register(PF_UNSPEC, RTM_DELRULE, fib_nl_delrule, NULL, NULL);
  761. rtnl_register(PF_UNSPEC, RTM_GETRULE, NULL, fib_nl_dumprule, NULL);
  762. err = register_pernet_subsys(&fib_rules_net_ops);
  763. if (err < 0)
  764. goto fail;
  765. err = register_netdevice_notifier(&fib_rules_notifier);
  766. if (err < 0)
  767. goto fail_unregister;
  768. return 0;
  769. fail_unregister:
  770. unregister_pernet_subsys(&fib_rules_net_ops);
  771. fail:
  772. rtnl_unregister(PF_UNSPEC, RTM_NEWRULE);
  773. rtnl_unregister(PF_UNSPEC, RTM_DELRULE);
  774. rtnl_unregister(PF_UNSPEC, RTM_GETRULE);
  775. return err;
  776. }
  777. subsys_initcall(fib_rules_init);