fib_rules.c 24 KB

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