fib_rules.c 27 KB

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