fib_rules.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965
  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 (!uid_eq(r->uid_range.start, rule->uid_range.start) ||
  274. !uid_eq(r->uid_range.end, rule->uid_range.end))
  275. continue;
  276. if (!ops->compare(r, frh, tb))
  277. continue;
  278. return 1;
  279. }
  280. return 0;
  281. }
  282. int fib_nl_newrule(struct sk_buff *skb, struct nlmsghdr *nlh)
  283. {
  284. struct net *net = sock_net(skb->sk);
  285. struct fib_rule_hdr *frh = nlmsg_data(nlh);
  286. struct fib_rules_ops *ops = NULL;
  287. struct fib_rule *rule, *r, *last = NULL;
  288. struct nlattr *tb[FRA_MAX+1];
  289. int err = -EINVAL, unresolved = 0;
  290. if (nlh->nlmsg_len < nlmsg_msg_size(sizeof(*frh)))
  291. goto errout;
  292. ops = lookup_rules_ops(net, frh->family);
  293. if (ops == NULL) {
  294. err = -EAFNOSUPPORT;
  295. goto errout;
  296. }
  297. err = nlmsg_parse(nlh, sizeof(*frh), tb, FRA_MAX, ops->policy);
  298. if (err < 0)
  299. goto errout;
  300. err = validate_rulemsg(frh, tb, ops);
  301. if (err < 0)
  302. goto errout;
  303. rule = kzalloc(ops->rule_size, GFP_KERNEL);
  304. if (rule == NULL) {
  305. err = -ENOMEM;
  306. goto errout;
  307. }
  308. rule->fr_net = net;
  309. rule->pref = tb[FRA_PRIORITY] ? nla_get_u32(tb[FRA_PRIORITY])
  310. : fib_default_rule_pref(ops);
  311. if (tb[FRA_IIFNAME]) {
  312. struct net_device *dev;
  313. rule->iifindex = -1;
  314. nla_strlcpy(rule->iifname, tb[FRA_IIFNAME], IFNAMSIZ);
  315. dev = __dev_get_by_name(net, rule->iifname);
  316. if (dev)
  317. rule->iifindex = dev->ifindex;
  318. }
  319. if (tb[FRA_OIFNAME]) {
  320. struct net_device *dev;
  321. rule->oifindex = -1;
  322. nla_strlcpy(rule->oifname, tb[FRA_OIFNAME], IFNAMSIZ);
  323. dev = __dev_get_by_name(net, rule->oifname);
  324. if (dev)
  325. rule->oifindex = dev->ifindex;
  326. }
  327. if (tb[FRA_FWMARK]) {
  328. rule->mark = nla_get_u32(tb[FRA_FWMARK]);
  329. if (rule->mark)
  330. /* compatibility: if the mark value is non-zero all bits
  331. * are compared unless a mask is explicitly specified.
  332. */
  333. rule->mark_mask = 0xFFFFFFFF;
  334. }
  335. if (tb[FRA_FWMASK])
  336. rule->mark_mask = nla_get_u32(tb[FRA_FWMASK]);
  337. if (tb[FRA_TUN_ID])
  338. rule->tun_id = nla_get_be64(tb[FRA_TUN_ID]);
  339. if (tb[FRA_L3MDEV]) {
  340. #ifdef CONFIG_NET_L3_MASTER_DEV
  341. rule->l3mdev = nla_get_u8(tb[FRA_L3MDEV]);
  342. if (rule->l3mdev != 1)
  343. #endif
  344. goto errout_free;
  345. }
  346. rule->action = frh->action;
  347. rule->flags = frh->flags;
  348. rule->table = frh_get_table(frh, tb);
  349. if (tb[FRA_SUPPRESS_PREFIXLEN])
  350. rule->suppress_prefixlen = nla_get_u32(tb[FRA_SUPPRESS_PREFIXLEN]);
  351. else
  352. rule->suppress_prefixlen = -1;
  353. if (tb[FRA_SUPPRESS_IFGROUP])
  354. rule->suppress_ifgroup = nla_get_u32(tb[FRA_SUPPRESS_IFGROUP]);
  355. else
  356. rule->suppress_ifgroup = -1;
  357. err = -EINVAL;
  358. if (tb[FRA_GOTO]) {
  359. if (rule->action != FR_ACT_GOTO)
  360. goto errout_free;
  361. rule->target = nla_get_u32(tb[FRA_GOTO]);
  362. /* Backward jumps are prohibited to avoid endless loops */
  363. if (rule->target <= rule->pref)
  364. goto errout_free;
  365. list_for_each_entry(r, &ops->rules_list, list) {
  366. if (r->pref == rule->target) {
  367. RCU_INIT_POINTER(rule->ctarget, r);
  368. break;
  369. }
  370. }
  371. if (rcu_dereference_protected(rule->ctarget, 1) == NULL)
  372. unresolved = 1;
  373. } else if (rule->action == FR_ACT_GOTO)
  374. goto errout_free;
  375. if (rule->l3mdev && rule->table)
  376. goto errout_free;
  377. if (tb[FRA_UID_RANGE]) {
  378. if (current_user_ns() != net->user_ns) {
  379. err = -EPERM;
  380. goto errout_free;
  381. }
  382. rule->uid_range = nla_get_kuid_range(tb);
  383. if (!uid_range_set(&rule->uid_range) ||
  384. !uid_lte(rule->uid_range.start, rule->uid_range.end))
  385. goto errout_free;
  386. } else {
  387. rule->uid_range = fib_kuid_range_unset;
  388. }
  389. if ((nlh->nlmsg_flags & NLM_F_EXCL) &&
  390. rule_exists(ops, frh, tb, rule)) {
  391. err = -EEXIST;
  392. goto errout_free;
  393. }
  394. err = ops->configure(rule, skb, frh, tb);
  395. if (err < 0)
  396. goto errout_free;
  397. list_for_each_entry(r, &ops->rules_list, list) {
  398. if (r->pref > rule->pref)
  399. break;
  400. last = r;
  401. }
  402. fib_rule_get(rule);
  403. if (last)
  404. list_add_rcu(&rule->list, &last->list);
  405. else
  406. list_add_rcu(&rule->list, &ops->rules_list);
  407. if (ops->unresolved_rules) {
  408. /*
  409. * There are unresolved goto rules in the list, check if
  410. * any of them are pointing to this new rule.
  411. */
  412. list_for_each_entry(r, &ops->rules_list, list) {
  413. if (r->action == FR_ACT_GOTO &&
  414. r->target == rule->pref &&
  415. rtnl_dereference(r->ctarget) == NULL) {
  416. rcu_assign_pointer(r->ctarget, rule);
  417. if (--ops->unresolved_rules == 0)
  418. break;
  419. }
  420. }
  421. }
  422. if (rule->action == FR_ACT_GOTO)
  423. ops->nr_goto_rules++;
  424. if (unresolved)
  425. ops->unresolved_rules++;
  426. if (rule->tun_id)
  427. ip_tunnel_need_metadata();
  428. notify_rule_change(RTM_NEWRULE, rule, ops, nlh, NETLINK_CB(skb).portid);
  429. flush_route_cache(ops);
  430. rules_ops_put(ops);
  431. return 0;
  432. errout_free:
  433. kfree(rule);
  434. errout:
  435. rules_ops_put(ops);
  436. return err;
  437. }
  438. EXPORT_SYMBOL_GPL(fib_nl_newrule);
  439. int fib_nl_delrule(struct sk_buff *skb, struct nlmsghdr *nlh)
  440. {
  441. struct net *net = sock_net(skb->sk);
  442. struct fib_rule_hdr *frh = nlmsg_data(nlh);
  443. struct fib_rules_ops *ops = NULL;
  444. struct fib_rule *rule, *tmp;
  445. struct nlattr *tb[FRA_MAX+1];
  446. struct fib_kuid_range range;
  447. int err = -EINVAL;
  448. if (nlh->nlmsg_len < nlmsg_msg_size(sizeof(*frh)))
  449. goto errout;
  450. ops = lookup_rules_ops(net, frh->family);
  451. if (ops == NULL) {
  452. err = -EAFNOSUPPORT;
  453. goto errout;
  454. }
  455. err = nlmsg_parse(nlh, sizeof(*frh), tb, FRA_MAX, ops->policy);
  456. if (err < 0)
  457. goto errout;
  458. err = validate_rulemsg(frh, tb, ops);
  459. if (err < 0)
  460. goto errout;
  461. if (tb[FRA_UID_RANGE]) {
  462. range = nla_get_kuid_range(tb);
  463. if (!uid_range_set(&range))
  464. goto errout;
  465. } else {
  466. range = fib_kuid_range_unset;
  467. }
  468. list_for_each_entry(rule, &ops->rules_list, list) {
  469. if (frh->action && (frh->action != rule->action))
  470. continue;
  471. if (frh_get_table(frh, tb) &&
  472. (frh_get_table(frh, tb) != rule->table))
  473. continue;
  474. if (tb[FRA_PRIORITY] &&
  475. (rule->pref != nla_get_u32(tb[FRA_PRIORITY])))
  476. continue;
  477. if (tb[FRA_IIFNAME] &&
  478. nla_strcmp(tb[FRA_IIFNAME], rule->iifname))
  479. continue;
  480. if (tb[FRA_OIFNAME] &&
  481. nla_strcmp(tb[FRA_OIFNAME], rule->oifname))
  482. continue;
  483. if (tb[FRA_FWMARK] &&
  484. (rule->mark != nla_get_u32(tb[FRA_FWMARK])))
  485. continue;
  486. if (tb[FRA_FWMASK] &&
  487. (rule->mark_mask != nla_get_u32(tb[FRA_FWMASK])))
  488. continue;
  489. if (tb[FRA_TUN_ID] &&
  490. (rule->tun_id != nla_get_be64(tb[FRA_TUN_ID])))
  491. continue;
  492. if (tb[FRA_L3MDEV] &&
  493. (rule->l3mdev != nla_get_u8(tb[FRA_L3MDEV])))
  494. continue;
  495. if (uid_range_set(&range) &&
  496. (!uid_eq(rule->uid_range.start, range.start) ||
  497. !uid_eq(rule->uid_range.end, range.end)))
  498. continue;
  499. if (!ops->compare(rule, frh, tb))
  500. continue;
  501. if (rule->flags & FIB_RULE_PERMANENT) {
  502. err = -EPERM;
  503. goto errout;
  504. }
  505. if (ops->delete) {
  506. err = ops->delete(rule);
  507. if (err)
  508. goto errout;
  509. }
  510. if (rule->tun_id)
  511. ip_tunnel_unneed_metadata();
  512. list_del_rcu(&rule->list);
  513. if (rule->action == FR_ACT_GOTO) {
  514. ops->nr_goto_rules--;
  515. if (rtnl_dereference(rule->ctarget) == NULL)
  516. ops->unresolved_rules--;
  517. }
  518. /*
  519. * Check if this rule is a target to any of them. If so,
  520. * disable them. As this operation is eventually very
  521. * expensive, it is only performed if goto rules have
  522. * actually been added.
  523. */
  524. if (ops->nr_goto_rules > 0) {
  525. list_for_each_entry(tmp, &ops->rules_list, list) {
  526. if (rtnl_dereference(tmp->ctarget) == rule) {
  527. RCU_INIT_POINTER(tmp->ctarget, NULL);
  528. ops->unresolved_rules++;
  529. }
  530. }
  531. }
  532. notify_rule_change(RTM_DELRULE, rule, ops, nlh,
  533. NETLINK_CB(skb).portid);
  534. fib_rule_put(rule);
  535. flush_route_cache(ops);
  536. rules_ops_put(ops);
  537. return 0;
  538. }
  539. err = -ENOENT;
  540. errout:
  541. rules_ops_put(ops);
  542. return err;
  543. }
  544. EXPORT_SYMBOL_GPL(fib_nl_delrule);
  545. static inline size_t fib_rule_nlmsg_size(struct fib_rules_ops *ops,
  546. struct fib_rule *rule)
  547. {
  548. size_t payload = NLMSG_ALIGN(sizeof(struct fib_rule_hdr))
  549. + nla_total_size(IFNAMSIZ) /* FRA_IIFNAME */
  550. + nla_total_size(IFNAMSIZ) /* FRA_OIFNAME */
  551. + nla_total_size(4) /* FRA_PRIORITY */
  552. + nla_total_size(4) /* FRA_TABLE */
  553. + nla_total_size(4) /* FRA_SUPPRESS_PREFIXLEN */
  554. + nla_total_size(4) /* FRA_SUPPRESS_IFGROUP */
  555. + nla_total_size(4) /* FRA_FWMARK */
  556. + nla_total_size(4) /* FRA_FWMASK */
  557. + nla_total_size_64bit(8) /* FRA_TUN_ID */
  558. + nla_total_size(sizeof(struct fib_kuid_range));
  559. if (ops->nlmsg_payload)
  560. payload += ops->nlmsg_payload(rule);
  561. return payload;
  562. }
  563. static int fib_nl_fill_rule(struct sk_buff *skb, struct fib_rule *rule,
  564. u32 pid, u32 seq, int type, int flags,
  565. struct fib_rules_ops *ops)
  566. {
  567. struct nlmsghdr *nlh;
  568. struct fib_rule_hdr *frh;
  569. nlh = nlmsg_put(skb, pid, seq, type, sizeof(*frh), flags);
  570. if (nlh == NULL)
  571. return -EMSGSIZE;
  572. frh = nlmsg_data(nlh);
  573. frh->family = ops->family;
  574. frh->table = rule->table;
  575. if (nla_put_u32(skb, FRA_TABLE, rule->table))
  576. goto nla_put_failure;
  577. if (nla_put_u32(skb, FRA_SUPPRESS_PREFIXLEN, rule->suppress_prefixlen))
  578. goto nla_put_failure;
  579. frh->res1 = 0;
  580. frh->res2 = 0;
  581. frh->action = rule->action;
  582. frh->flags = rule->flags;
  583. if (rule->action == FR_ACT_GOTO &&
  584. rcu_access_pointer(rule->ctarget) == NULL)
  585. frh->flags |= FIB_RULE_UNRESOLVED;
  586. if (rule->iifname[0]) {
  587. if (nla_put_string(skb, FRA_IIFNAME, rule->iifname))
  588. goto nla_put_failure;
  589. if (rule->iifindex == -1)
  590. frh->flags |= FIB_RULE_IIF_DETACHED;
  591. }
  592. if (rule->oifname[0]) {
  593. if (nla_put_string(skb, FRA_OIFNAME, rule->oifname))
  594. goto nla_put_failure;
  595. if (rule->oifindex == -1)
  596. frh->flags |= FIB_RULE_OIF_DETACHED;
  597. }
  598. if ((rule->pref &&
  599. nla_put_u32(skb, FRA_PRIORITY, rule->pref)) ||
  600. (rule->mark &&
  601. nla_put_u32(skb, FRA_FWMARK, rule->mark)) ||
  602. ((rule->mark_mask || rule->mark) &&
  603. nla_put_u32(skb, FRA_FWMASK, rule->mark_mask)) ||
  604. (rule->target &&
  605. nla_put_u32(skb, FRA_GOTO, rule->target)) ||
  606. (rule->tun_id &&
  607. nla_put_be64(skb, FRA_TUN_ID, rule->tun_id, FRA_PAD)) ||
  608. (rule->l3mdev &&
  609. nla_put_u8(skb, FRA_L3MDEV, rule->l3mdev)) ||
  610. (uid_range_set(&rule->uid_range) &&
  611. nla_put_uid_range(skb, &rule->uid_range)))
  612. goto nla_put_failure;
  613. if (rule->suppress_ifgroup != -1) {
  614. if (nla_put_u32(skb, FRA_SUPPRESS_IFGROUP, rule->suppress_ifgroup))
  615. goto nla_put_failure;
  616. }
  617. if (ops->fill(rule, skb, frh) < 0)
  618. goto nla_put_failure;
  619. nlmsg_end(skb, nlh);
  620. return 0;
  621. nla_put_failure:
  622. nlmsg_cancel(skb, nlh);
  623. return -EMSGSIZE;
  624. }
  625. static int dump_rules(struct sk_buff *skb, struct netlink_callback *cb,
  626. struct fib_rules_ops *ops)
  627. {
  628. int idx = 0;
  629. struct fib_rule *rule;
  630. int err = 0;
  631. rcu_read_lock();
  632. list_for_each_entry_rcu(rule, &ops->rules_list, list) {
  633. if (idx < cb->args[1])
  634. goto skip;
  635. err = fib_nl_fill_rule(skb, rule, NETLINK_CB(cb->skb).portid,
  636. cb->nlh->nlmsg_seq, RTM_NEWRULE,
  637. NLM_F_MULTI, ops);
  638. if (err)
  639. break;
  640. skip:
  641. idx++;
  642. }
  643. rcu_read_unlock();
  644. cb->args[1] = idx;
  645. rules_ops_put(ops);
  646. return err;
  647. }
  648. static int fib_nl_dumprule(struct sk_buff *skb, struct netlink_callback *cb)
  649. {
  650. struct net *net = sock_net(skb->sk);
  651. struct fib_rules_ops *ops;
  652. int idx = 0, family;
  653. family = rtnl_msg_family(cb->nlh);
  654. if (family != AF_UNSPEC) {
  655. /* Protocol specific dump request */
  656. ops = lookup_rules_ops(net, family);
  657. if (ops == NULL)
  658. return -EAFNOSUPPORT;
  659. dump_rules(skb, cb, ops);
  660. return skb->len;
  661. }
  662. rcu_read_lock();
  663. list_for_each_entry_rcu(ops, &net->rules_ops, list) {
  664. if (idx < cb->args[0] || !try_module_get(ops->owner))
  665. goto skip;
  666. if (dump_rules(skb, cb, ops) < 0)
  667. break;
  668. cb->args[1] = 0;
  669. skip:
  670. idx++;
  671. }
  672. rcu_read_unlock();
  673. cb->args[0] = idx;
  674. return skb->len;
  675. }
  676. static void notify_rule_change(int event, struct fib_rule *rule,
  677. struct fib_rules_ops *ops, struct nlmsghdr *nlh,
  678. u32 pid)
  679. {
  680. struct net *net;
  681. struct sk_buff *skb;
  682. int err = -ENOBUFS;
  683. net = ops->fro_net;
  684. skb = nlmsg_new(fib_rule_nlmsg_size(ops, rule), GFP_KERNEL);
  685. if (skb == NULL)
  686. goto errout;
  687. err = fib_nl_fill_rule(skb, rule, pid, nlh->nlmsg_seq, event, 0, ops);
  688. if (err < 0) {
  689. /* -EMSGSIZE implies BUG in fib_rule_nlmsg_size() */
  690. WARN_ON(err == -EMSGSIZE);
  691. kfree_skb(skb);
  692. goto errout;
  693. }
  694. rtnl_notify(skb, net, pid, ops->nlgroup, nlh, GFP_KERNEL);
  695. return;
  696. errout:
  697. if (err < 0)
  698. rtnl_set_sk_err(net, ops->nlgroup, err);
  699. }
  700. static void attach_rules(struct list_head *rules, struct net_device *dev)
  701. {
  702. struct fib_rule *rule;
  703. list_for_each_entry(rule, rules, list) {
  704. if (rule->iifindex == -1 &&
  705. strcmp(dev->name, rule->iifname) == 0)
  706. rule->iifindex = dev->ifindex;
  707. if (rule->oifindex == -1 &&
  708. strcmp(dev->name, rule->oifname) == 0)
  709. rule->oifindex = dev->ifindex;
  710. }
  711. }
  712. static void detach_rules(struct list_head *rules, struct net_device *dev)
  713. {
  714. struct fib_rule *rule;
  715. list_for_each_entry(rule, rules, list) {
  716. if (rule->iifindex == dev->ifindex)
  717. rule->iifindex = -1;
  718. if (rule->oifindex == dev->ifindex)
  719. rule->oifindex = -1;
  720. }
  721. }
  722. static int fib_rules_event(struct notifier_block *this, unsigned long event,
  723. void *ptr)
  724. {
  725. struct net_device *dev = netdev_notifier_info_to_dev(ptr);
  726. struct net *net = dev_net(dev);
  727. struct fib_rules_ops *ops;
  728. ASSERT_RTNL();
  729. switch (event) {
  730. case NETDEV_REGISTER:
  731. list_for_each_entry(ops, &net->rules_ops, list)
  732. attach_rules(&ops->rules_list, dev);
  733. break;
  734. case NETDEV_CHANGENAME:
  735. list_for_each_entry(ops, &net->rules_ops, list) {
  736. detach_rules(&ops->rules_list, dev);
  737. attach_rules(&ops->rules_list, dev);
  738. }
  739. break;
  740. case NETDEV_UNREGISTER:
  741. list_for_each_entry(ops, &net->rules_ops, list)
  742. detach_rules(&ops->rules_list, dev);
  743. break;
  744. }
  745. return NOTIFY_DONE;
  746. }
  747. static struct notifier_block fib_rules_notifier = {
  748. .notifier_call = fib_rules_event,
  749. };
  750. static int __net_init fib_rules_net_init(struct net *net)
  751. {
  752. INIT_LIST_HEAD(&net->rules_ops);
  753. spin_lock_init(&net->rules_mod_lock);
  754. return 0;
  755. }
  756. static struct pernet_operations fib_rules_net_ops = {
  757. .init = fib_rules_net_init,
  758. };
  759. static int __init fib_rules_init(void)
  760. {
  761. int err;
  762. rtnl_register(PF_UNSPEC, RTM_NEWRULE, fib_nl_newrule, NULL, NULL);
  763. rtnl_register(PF_UNSPEC, RTM_DELRULE, fib_nl_delrule, NULL, NULL);
  764. rtnl_register(PF_UNSPEC, RTM_GETRULE, NULL, fib_nl_dumprule, NULL);
  765. err = register_pernet_subsys(&fib_rules_net_ops);
  766. if (err < 0)
  767. goto fail;
  768. err = register_netdevice_notifier(&fib_rules_notifier);
  769. if (err < 0)
  770. goto fail_unregister;
  771. return 0;
  772. fail_unregister:
  773. unregister_pernet_subsys(&fib_rules_net_ops);
  774. fail:
  775. rtnl_unregister(PF_UNSPEC, RTM_NEWRULE);
  776. rtnl_unregister(PF_UNSPEC, RTM_DELRULE);
  777. rtnl_unregister(PF_UNSPEC, RTM_GETRULE);
  778. return err;
  779. }
  780. subsys_initcall(fib_rules_init);