fib_rules.c 29 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235
  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->suppress_ifgroup != -1 &&
  338. r->suppress_ifgroup != rule->suppress_ifgroup)
  339. continue;
  340. if (rule->suppress_prefixlen != -1 &&
  341. r->suppress_prefixlen != rule->suppress_prefixlen)
  342. continue;
  343. if (rule->mark_mask && r->mark_mask != rule->mark_mask)
  344. continue;
  345. if (rule->tun_id && r->tun_id != rule->tun_id)
  346. continue;
  347. if (r->fr_net != rule->fr_net)
  348. continue;
  349. if (rule->l3mdev && r->l3mdev != rule->l3mdev)
  350. continue;
  351. if (uid_range_set(&rule->uid_range) &&
  352. (!uid_eq(r->uid_range.start, rule->uid_range.start) ||
  353. !uid_eq(r->uid_range.end, rule->uid_range.end)))
  354. continue;
  355. if (rule->ip_proto && r->ip_proto != rule->ip_proto)
  356. continue;
  357. if (rule->proto && r->proto != rule->proto)
  358. continue;
  359. if (fib_rule_port_range_set(&rule->sport_range) &&
  360. !fib_rule_port_range_compare(&r->sport_range,
  361. &rule->sport_range))
  362. continue;
  363. if (fib_rule_port_range_set(&rule->dport_range) &&
  364. !fib_rule_port_range_compare(&r->dport_range,
  365. &rule->dport_range))
  366. continue;
  367. if (!ops->compare(r, frh, tb))
  368. continue;
  369. return r;
  370. }
  371. return NULL;
  372. }
  373. #ifdef CONFIG_NET_L3_MASTER_DEV
  374. static int fib_nl2rule_l3mdev(struct nlattr *nla, struct fib_rule *nlrule,
  375. struct netlink_ext_ack *extack)
  376. {
  377. nlrule->l3mdev = nla_get_u8(nla);
  378. if (nlrule->l3mdev != 1) {
  379. NL_SET_ERR_MSG(extack, "Invalid l3mdev attribute");
  380. return -1;
  381. }
  382. return 0;
  383. }
  384. #else
  385. static int fib_nl2rule_l3mdev(struct nlattr *nla, struct fib_rule *nlrule,
  386. struct netlink_ext_ack *extack)
  387. {
  388. NL_SET_ERR_MSG(extack, "l3mdev support is not enabled in kernel");
  389. return -1;
  390. }
  391. #endif
  392. static int fib_nl2rule(struct sk_buff *skb, struct nlmsghdr *nlh,
  393. struct netlink_ext_ack *extack,
  394. struct fib_rules_ops *ops,
  395. struct nlattr *tb[],
  396. struct fib_rule **rule,
  397. bool *user_priority)
  398. {
  399. struct net *net = sock_net(skb->sk);
  400. struct fib_rule_hdr *frh = nlmsg_data(nlh);
  401. struct fib_rule *nlrule = NULL;
  402. int err = -EINVAL;
  403. if (frh->src_len)
  404. if (!tb[FRA_SRC] ||
  405. frh->src_len > (ops->addr_size * 8) ||
  406. nla_len(tb[FRA_SRC]) != ops->addr_size) {
  407. NL_SET_ERR_MSG(extack, "Invalid source address");
  408. goto errout;
  409. }
  410. if (frh->dst_len)
  411. if (!tb[FRA_DST] ||
  412. frh->dst_len > (ops->addr_size * 8) ||
  413. nla_len(tb[FRA_DST]) != ops->addr_size) {
  414. NL_SET_ERR_MSG(extack, "Invalid dst address");
  415. goto errout;
  416. }
  417. nlrule = kzalloc(ops->rule_size, GFP_KERNEL);
  418. if (!nlrule) {
  419. err = -ENOMEM;
  420. goto errout;
  421. }
  422. refcount_set(&nlrule->refcnt, 1);
  423. nlrule->fr_net = net;
  424. if (tb[FRA_PRIORITY]) {
  425. nlrule->pref = nla_get_u32(tb[FRA_PRIORITY]);
  426. *user_priority = true;
  427. } else {
  428. nlrule->pref = fib_default_rule_pref(ops);
  429. }
  430. nlrule->proto = tb[FRA_PROTOCOL] ?
  431. nla_get_u8(tb[FRA_PROTOCOL]) : RTPROT_UNSPEC;
  432. if (tb[FRA_IIFNAME]) {
  433. struct net_device *dev;
  434. nlrule->iifindex = -1;
  435. nla_strlcpy(nlrule->iifname, tb[FRA_IIFNAME], IFNAMSIZ);
  436. dev = __dev_get_by_name(net, nlrule->iifname);
  437. if (dev)
  438. nlrule->iifindex = dev->ifindex;
  439. }
  440. if (tb[FRA_OIFNAME]) {
  441. struct net_device *dev;
  442. nlrule->oifindex = -1;
  443. nla_strlcpy(nlrule->oifname, tb[FRA_OIFNAME], IFNAMSIZ);
  444. dev = __dev_get_by_name(net, nlrule->oifname);
  445. if (dev)
  446. nlrule->oifindex = dev->ifindex;
  447. }
  448. if (tb[FRA_FWMARK]) {
  449. nlrule->mark = nla_get_u32(tb[FRA_FWMARK]);
  450. if (nlrule->mark)
  451. /* compatibility: if the mark value is non-zero all bits
  452. * are compared unless a mask is explicitly specified.
  453. */
  454. nlrule->mark_mask = 0xFFFFFFFF;
  455. }
  456. if (tb[FRA_FWMASK])
  457. nlrule->mark_mask = nla_get_u32(tb[FRA_FWMASK]);
  458. if (tb[FRA_TUN_ID])
  459. nlrule->tun_id = nla_get_be64(tb[FRA_TUN_ID]);
  460. err = -EINVAL;
  461. if (tb[FRA_L3MDEV] &&
  462. fib_nl2rule_l3mdev(tb[FRA_L3MDEV], nlrule, extack) < 0)
  463. goto errout_free;
  464. nlrule->action = frh->action;
  465. nlrule->flags = frh->flags;
  466. nlrule->table = frh_get_table(frh, tb);
  467. if (tb[FRA_SUPPRESS_PREFIXLEN])
  468. nlrule->suppress_prefixlen = nla_get_u32(tb[FRA_SUPPRESS_PREFIXLEN]);
  469. else
  470. nlrule->suppress_prefixlen = -1;
  471. if (tb[FRA_SUPPRESS_IFGROUP])
  472. nlrule->suppress_ifgroup = nla_get_u32(tb[FRA_SUPPRESS_IFGROUP]);
  473. else
  474. nlrule->suppress_ifgroup = -1;
  475. if (tb[FRA_GOTO]) {
  476. if (nlrule->action != FR_ACT_GOTO) {
  477. NL_SET_ERR_MSG(extack, "Unexpected goto");
  478. goto errout_free;
  479. }
  480. nlrule->target = nla_get_u32(tb[FRA_GOTO]);
  481. /* Backward jumps are prohibited to avoid endless loops */
  482. if (nlrule->target <= nlrule->pref) {
  483. NL_SET_ERR_MSG(extack, "Backward goto not supported");
  484. goto errout_free;
  485. }
  486. } else if (nlrule->action == FR_ACT_GOTO) {
  487. NL_SET_ERR_MSG(extack, "Missing goto target for action goto");
  488. goto errout_free;
  489. }
  490. if (nlrule->l3mdev && nlrule->table) {
  491. NL_SET_ERR_MSG(extack, "l3mdev and table are mutually exclusive");
  492. goto errout_free;
  493. }
  494. if (tb[FRA_UID_RANGE]) {
  495. if (current_user_ns() != net->user_ns) {
  496. err = -EPERM;
  497. NL_SET_ERR_MSG(extack, "No permission to set uid");
  498. goto errout_free;
  499. }
  500. nlrule->uid_range = nla_get_kuid_range(tb);
  501. if (!uid_range_set(&nlrule->uid_range) ||
  502. !uid_lte(nlrule->uid_range.start, nlrule->uid_range.end)) {
  503. NL_SET_ERR_MSG(extack, "Invalid uid range");
  504. goto errout_free;
  505. }
  506. } else {
  507. nlrule->uid_range = fib_kuid_range_unset;
  508. }
  509. if (tb[FRA_IP_PROTO])
  510. nlrule->ip_proto = nla_get_u8(tb[FRA_IP_PROTO]);
  511. if (tb[FRA_SPORT_RANGE]) {
  512. err = nla_get_port_range(tb[FRA_SPORT_RANGE],
  513. &nlrule->sport_range);
  514. if (err) {
  515. NL_SET_ERR_MSG(extack, "Invalid sport range");
  516. goto errout_free;
  517. }
  518. }
  519. if (tb[FRA_DPORT_RANGE]) {
  520. err = nla_get_port_range(tb[FRA_DPORT_RANGE],
  521. &nlrule->dport_range);
  522. if (err) {
  523. NL_SET_ERR_MSG(extack, "Invalid dport range");
  524. goto errout_free;
  525. }
  526. }
  527. *rule = nlrule;
  528. return 0;
  529. errout_free:
  530. kfree(nlrule);
  531. errout:
  532. return err;
  533. }
  534. static int rule_exists(struct fib_rules_ops *ops, struct fib_rule_hdr *frh,
  535. struct nlattr **tb, struct fib_rule *rule)
  536. {
  537. struct fib_rule *r;
  538. list_for_each_entry(r, &ops->rules_list, list) {
  539. if (r->action != rule->action)
  540. continue;
  541. if (r->table != rule->table)
  542. continue;
  543. if (r->pref != rule->pref)
  544. continue;
  545. if (memcmp(r->iifname, rule->iifname, IFNAMSIZ))
  546. continue;
  547. if (memcmp(r->oifname, rule->oifname, IFNAMSIZ))
  548. continue;
  549. if (r->mark != rule->mark)
  550. continue;
  551. if (r->suppress_ifgroup != rule->suppress_ifgroup)
  552. continue;
  553. if (r->suppress_prefixlen != rule->suppress_prefixlen)
  554. continue;
  555. if (r->mark_mask != rule->mark_mask)
  556. continue;
  557. if (r->tun_id != rule->tun_id)
  558. continue;
  559. if (r->fr_net != rule->fr_net)
  560. continue;
  561. if (r->l3mdev != rule->l3mdev)
  562. continue;
  563. if (!uid_eq(r->uid_range.start, rule->uid_range.start) ||
  564. !uid_eq(r->uid_range.end, rule->uid_range.end))
  565. continue;
  566. if (r->ip_proto != rule->ip_proto)
  567. continue;
  568. if (r->proto != rule->proto)
  569. continue;
  570. if (!fib_rule_port_range_compare(&r->sport_range,
  571. &rule->sport_range))
  572. continue;
  573. if (!fib_rule_port_range_compare(&r->dport_range,
  574. &rule->dport_range))
  575. continue;
  576. if (!ops->compare(r, frh, tb))
  577. continue;
  578. return 1;
  579. }
  580. return 0;
  581. }
  582. int fib_nl_newrule(struct sk_buff *skb, struct nlmsghdr *nlh,
  583. struct netlink_ext_ack *extack)
  584. {
  585. struct net *net = sock_net(skb->sk);
  586. struct fib_rule_hdr *frh = nlmsg_data(nlh);
  587. struct fib_rules_ops *ops = NULL;
  588. struct fib_rule *rule = NULL, *r, *last = NULL;
  589. struct nlattr *tb[FRA_MAX + 1];
  590. int err = -EINVAL, unresolved = 0;
  591. bool user_priority = false;
  592. if (nlh->nlmsg_len < nlmsg_msg_size(sizeof(*frh))) {
  593. NL_SET_ERR_MSG(extack, "Invalid msg length");
  594. goto errout;
  595. }
  596. ops = lookup_rules_ops(net, frh->family);
  597. if (!ops) {
  598. err = -EAFNOSUPPORT;
  599. NL_SET_ERR_MSG(extack, "Rule family not supported");
  600. goto errout;
  601. }
  602. err = nlmsg_parse(nlh, sizeof(*frh), tb, FRA_MAX, ops->policy, extack);
  603. if (err < 0) {
  604. NL_SET_ERR_MSG(extack, "Error parsing msg");
  605. goto errout;
  606. }
  607. err = fib_nl2rule(skb, nlh, extack, ops, tb, &rule, &user_priority);
  608. if (err)
  609. goto errout;
  610. if ((nlh->nlmsg_flags & NLM_F_EXCL) &&
  611. rule_exists(ops, frh, tb, rule)) {
  612. err = -EEXIST;
  613. goto errout_free;
  614. }
  615. err = ops->configure(rule, skb, frh, tb, extack);
  616. if (err < 0)
  617. goto errout_free;
  618. err = call_fib_rule_notifiers(net, FIB_EVENT_RULE_ADD, rule, ops,
  619. extack);
  620. if (err < 0)
  621. goto errout_free;
  622. list_for_each_entry(r, &ops->rules_list, list) {
  623. if (r->pref == rule->target) {
  624. RCU_INIT_POINTER(rule->ctarget, r);
  625. break;
  626. }
  627. }
  628. if (rcu_dereference_protected(rule->ctarget, 1) == NULL)
  629. unresolved = 1;
  630. list_for_each_entry(r, &ops->rules_list, list) {
  631. if (r->pref > rule->pref)
  632. break;
  633. last = r;
  634. }
  635. if (last)
  636. list_add_rcu(&rule->list, &last->list);
  637. else
  638. list_add_rcu(&rule->list, &ops->rules_list);
  639. if (ops->unresolved_rules) {
  640. /*
  641. * There are unresolved goto rules in the list, check if
  642. * any of them are pointing to this new rule.
  643. */
  644. list_for_each_entry(r, &ops->rules_list, list) {
  645. if (r->action == FR_ACT_GOTO &&
  646. r->target == rule->pref &&
  647. rtnl_dereference(r->ctarget) == NULL) {
  648. rcu_assign_pointer(r->ctarget, rule);
  649. if (--ops->unresolved_rules == 0)
  650. break;
  651. }
  652. }
  653. }
  654. if (rule->action == FR_ACT_GOTO)
  655. ops->nr_goto_rules++;
  656. if (unresolved)
  657. ops->unresolved_rules++;
  658. if (rule->tun_id)
  659. ip_tunnel_need_metadata();
  660. notify_rule_change(RTM_NEWRULE, rule, ops, nlh, NETLINK_CB(skb).portid);
  661. flush_route_cache(ops);
  662. rules_ops_put(ops);
  663. return 0;
  664. errout_free:
  665. kfree(rule);
  666. errout:
  667. rules_ops_put(ops);
  668. return err;
  669. }
  670. EXPORT_SYMBOL_GPL(fib_nl_newrule);
  671. int fib_nl_delrule(struct sk_buff *skb, struct nlmsghdr *nlh,
  672. struct netlink_ext_ack *extack)
  673. {
  674. struct net *net = sock_net(skb->sk);
  675. struct fib_rule_hdr *frh = nlmsg_data(nlh);
  676. struct fib_rules_ops *ops = NULL;
  677. struct fib_rule *rule = NULL, *r, *nlrule = NULL;
  678. struct nlattr *tb[FRA_MAX+1];
  679. int err = -EINVAL;
  680. bool user_priority = false;
  681. if (nlh->nlmsg_len < nlmsg_msg_size(sizeof(*frh))) {
  682. NL_SET_ERR_MSG(extack, "Invalid msg length");
  683. goto errout;
  684. }
  685. ops = lookup_rules_ops(net, frh->family);
  686. if (ops == NULL) {
  687. err = -EAFNOSUPPORT;
  688. NL_SET_ERR_MSG(extack, "Rule family not supported");
  689. goto errout;
  690. }
  691. err = nlmsg_parse(nlh, sizeof(*frh), tb, FRA_MAX, ops->policy, extack);
  692. if (err < 0) {
  693. NL_SET_ERR_MSG(extack, "Error parsing msg");
  694. goto errout;
  695. }
  696. err = fib_nl2rule(skb, nlh, extack, ops, tb, &nlrule, &user_priority);
  697. if (err)
  698. goto errout;
  699. rule = rule_find(ops, frh, tb, nlrule, user_priority);
  700. if (!rule) {
  701. err = -ENOENT;
  702. goto errout;
  703. }
  704. if (rule->flags & FIB_RULE_PERMANENT) {
  705. err = -EPERM;
  706. goto errout;
  707. }
  708. if (ops->delete) {
  709. err = ops->delete(rule);
  710. if (err)
  711. goto errout;
  712. }
  713. if (rule->tun_id)
  714. ip_tunnel_unneed_metadata();
  715. list_del_rcu(&rule->list);
  716. if (rule->action == FR_ACT_GOTO) {
  717. ops->nr_goto_rules--;
  718. if (rtnl_dereference(rule->ctarget) == NULL)
  719. ops->unresolved_rules--;
  720. }
  721. /*
  722. * Check if this rule is a target to any of them. If so,
  723. * adjust to the next one with the same preference or
  724. * disable them. As this operation is eventually very
  725. * expensive, it is only performed if goto rules, except
  726. * current if it is goto rule, have actually been added.
  727. */
  728. if (ops->nr_goto_rules > 0) {
  729. struct fib_rule *n;
  730. n = list_next_entry(rule, list);
  731. if (&n->list == &ops->rules_list || n->pref != rule->pref)
  732. n = NULL;
  733. list_for_each_entry(r, &ops->rules_list, list) {
  734. if (rtnl_dereference(r->ctarget) != rule)
  735. continue;
  736. rcu_assign_pointer(r->ctarget, n);
  737. if (!n)
  738. ops->unresolved_rules++;
  739. }
  740. }
  741. call_fib_rule_notifiers(net, FIB_EVENT_RULE_DEL, rule, ops,
  742. NULL);
  743. notify_rule_change(RTM_DELRULE, rule, ops, nlh,
  744. NETLINK_CB(skb).portid);
  745. fib_rule_put(rule);
  746. flush_route_cache(ops);
  747. rules_ops_put(ops);
  748. kfree(nlrule);
  749. return 0;
  750. errout:
  751. kfree(nlrule);
  752. rules_ops_put(ops);
  753. return err;
  754. }
  755. EXPORT_SYMBOL_GPL(fib_nl_delrule);
  756. static inline size_t fib_rule_nlmsg_size(struct fib_rules_ops *ops,
  757. struct fib_rule *rule)
  758. {
  759. size_t payload = NLMSG_ALIGN(sizeof(struct fib_rule_hdr))
  760. + nla_total_size(IFNAMSIZ) /* FRA_IIFNAME */
  761. + nla_total_size(IFNAMSIZ) /* FRA_OIFNAME */
  762. + nla_total_size(4) /* FRA_PRIORITY */
  763. + nla_total_size(4) /* FRA_TABLE */
  764. + nla_total_size(4) /* FRA_SUPPRESS_PREFIXLEN */
  765. + nla_total_size(4) /* FRA_SUPPRESS_IFGROUP */
  766. + nla_total_size(4) /* FRA_FWMARK */
  767. + nla_total_size(4) /* FRA_FWMASK */
  768. + nla_total_size_64bit(8) /* FRA_TUN_ID */
  769. + nla_total_size(sizeof(struct fib_kuid_range))
  770. + nla_total_size(1) /* FRA_PROTOCOL */
  771. + nla_total_size(1) /* FRA_IP_PROTO */
  772. + nla_total_size(sizeof(struct fib_rule_port_range)) /* FRA_SPORT_RANGE */
  773. + nla_total_size(sizeof(struct fib_rule_port_range)); /* FRA_DPORT_RANGE */
  774. if (ops->nlmsg_payload)
  775. payload += ops->nlmsg_payload(rule);
  776. return payload;
  777. }
  778. static int fib_nl_fill_rule(struct sk_buff *skb, struct fib_rule *rule,
  779. u32 pid, u32 seq, int type, int flags,
  780. struct fib_rules_ops *ops)
  781. {
  782. struct nlmsghdr *nlh;
  783. struct fib_rule_hdr *frh;
  784. nlh = nlmsg_put(skb, pid, seq, type, sizeof(*frh), flags);
  785. if (nlh == NULL)
  786. return -EMSGSIZE;
  787. frh = nlmsg_data(nlh);
  788. frh->family = ops->family;
  789. frh->table = rule->table < 256 ? rule->table : RT_TABLE_COMPAT;
  790. if (nla_put_u32(skb, FRA_TABLE, rule->table))
  791. goto nla_put_failure;
  792. if (nla_put_u32(skb, FRA_SUPPRESS_PREFIXLEN, rule->suppress_prefixlen))
  793. goto nla_put_failure;
  794. frh->res1 = 0;
  795. frh->res2 = 0;
  796. frh->action = rule->action;
  797. frh->flags = rule->flags;
  798. if (nla_put_u8(skb, FRA_PROTOCOL, rule->proto))
  799. goto nla_put_failure;
  800. if (rule->action == FR_ACT_GOTO &&
  801. rcu_access_pointer(rule->ctarget) == NULL)
  802. frh->flags |= FIB_RULE_UNRESOLVED;
  803. if (rule->iifname[0]) {
  804. if (nla_put_string(skb, FRA_IIFNAME, rule->iifname))
  805. goto nla_put_failure;
  806. if (rule->iifindex == -1)
  807. frh->flags |= FIB_RULE_IIF_DETACHED;
  808. }
  809. if (rule->oifname[0]) {
  810. if (nla_put_string(skb, FRA_OIFNAME, rule->oifname))
  811. goto nla_put_failure;
  812. if (rule->oifindex == -1)
  813. frh->flags |= FIB_RULE_OIF_DETACHED;
  814. }
  815. if ((rule->pref &&
  816. nla_put_u32(skb, FRA_PRIORITY, rule->pref)) ||
  817. (rule->mark &&
  818. nla_put_u32(skb, FRA_FWMARK, rule->mark)) ||
  819. ((rule->mark_mask || rule->mark) &&
  820. nla_put_u32(skb, FRA_FWMASK, rule->mark_mask)) ||
  821. (rule->target &&
  822. nla_put_u32(skb, FRA_GOTO, rule->target)) ||
  823. (rule->tun_id &&
  824. nla_put_be64(skb, FRA_TUN_ID, rule->tun_id, FRA_PAD)) ||
  825. (rule->l3mdev &&
  826. nla_put_u8(skb, FRA_L3MDEV, rule->l3mdev)) ||
  827. (uid_range_set(&rule->uid_range) &&
  828. nla_put_uid_range(skb, &rule->uid_range)) ||
  829. (fib_rule_port_range_set(&rule->sport_range) &&
  830. nla_put_port_range(skb, FRA_SPORT_RANGE, &rule->sport_range)) ||
  831. (fib_rule_port_range_set(&rule->dport_range) &&
  832. nla_put_port_range(skb, FRA_DPORT_RANGE, &rule->dport_range)) ||
  833. (rule->ip_proto && nla_put_u8(skb, FRA_IP_PROTO, rule->ip_proto)))
  834. goto nla_put_failure;
  835. if (rule->suppress_ifgroup != -1) {
  836. if (nla_put_u32(skb, FRA_SUPPRESS_IFGROUP, rule->suppress_ifgroup))
  837. goto nla_put_failure;
  838. }
  839. if (ops->fill(rule, skb, frh) < 0)
  840. goto nla_put_failure;
  841. nlmsg_end(skb, nlh);
  842. return 0;
  843. nla_put_failure:
  844. nlmsg_cancel(skb, nlh);
  845. return -EMSGSIZE;
  846. }
  847. static int dump_rules(struct sk_buff *skb, struct netlink_callback *cb,
  848. struct fib_rules_ops *ops)
  849. {
  850. int idx = 0;
  851. struct fib_rule *rule;
  852. int err = 0;
  853. rcu_read_lock();
  854. list_for_each_entry_rcu(rule, &ops->rules_list, list) {
  855. if (idx < cb->args[1])
  856. goto skip;
  857. err = fib_nl_fill_rule(skb, rule, NETLINK_CB(cb->skb).portid,
  858. cb->nlh->nlmsg_seq, RTM_NEWRULE,
  859. NLM_F_MULTI, ops);
  860. if (err)
  861. break;
  862. skip:
  863. idx++;
  864. }
  865. rcu_read_unlock();
  866. cb->args[1] = idx;
  867. rules_ops_put(ops);
  868. return err;
  869. }
  870. static int fib_nl_dumprule(struct sk_buff *skb, struct netlink_callback *cb)
  871. {
  872. struct net *net = sock_net(skb->sk);
  873. struct fib_rules_ops *ops;
  874. int idx = 0, family;
  875. family = rtnl_msg_family(cb->nlh);
  876. if (family != AF_UNSPEC) {
  877. /* Protocol specific dump request */
  878. ops = lookup_rules_ops(net, family);
  879. if (ops == NULL)
  880. return -EAFNOSUPPORT;
  881. dump_rules(skb, cb, ops);
  882. return skb->len;
  883. }
  884. rcu_read_lock();
  885. list_for_each_entry_rcu(ops, &net->rules_ops, list) {
  886. if (idx < cb->args[0] || !try_module_get(ops->owner))
  887. goto skip;
  888. if (dump_rules(skb, cb, ops) < 0)
  889. break;
  890. cb->args[1] = 0;
  891. skip:
  892. idx++;
  893. }
  894. rcu_read_unlock();
  895. cb->args[0] = idx;
  896. return skb->len;
  897. }
  898. static void notify_rule_change(int event, struct fib_rule *rule,
  899. struct fib_rules_ops *ops, struct nlmsghdr *nlh,
  900. u32 pid)
  901. {
  902. struct net *net;
  903. struct sk_buff *skb;
  904. int err = -ENOBUFS;
  905. net = ops->fro_net;
  906. skb = nlmsg_new(fib_rule_nlmsg_size(ops, rule), GFP_KERNEL);
  907. if (skb == NULL)
  908. goto errout;
  909. err = fib_nl_fill_rule(skb, rule, pid, nlh->nlmsg_seq, event, 0, ops);
  910. if (err < 0) {
  911. /* -EMSGSIZE implies BUG in fib_rule_nlmsg_size() */
  912. WARN_ON(err == -EMSGSIZE);
  913. kfree_skb(skb);
  914. goto errout;
  915. }
  916. rtnl_notify(skb, net, pid, ops->nlgroup, nlh, GFP_KERNEL);
  917. return;
  918. errout:
  919. if (err < 0)
  920. rtnl_set_sk_err(net, ops->nlgroup, err);
  921. }
  922. static void attach_rules(struct list_head *rules, struct net_device *dev)
  923. {
  924. struct fib_rule *rule;
  925. list_for_each_entry(rule, rules, list) {
  926. if (rule->iifindex == -1 &&
  927. strcmp(dev->name, rule->iifname) == 0)
  928. rule->iifindex = dev->ifindex;
  929. if (rule->oifindex == -1 &&
  930. strcmp(dev->name, rule->oifname) == 0)
  931. rule->oifindex = dev->ifindex;
  932. }
  933. }
  934. static void detach_rules(struct list_head *rules, struct net_device *dev)
  935. {
  936. struct fib_rule *rule;
  937. list_for_each_entry(rule, rules, list) {
  938. if (rule->iifindex == dev->ifindex)
  939. rule->iifindex = -1;
  940. if (rule->oifindex == dev->ifindex)
  941. rule->oifindex = -1;
  942. }
  943. }
  944. static int fib_rules_event(struct notifier_block *this, unsigned long event,
  945. void *ptr)
  946. {
  947. struct net_device *dev = netdev_notifier_info_to_dev(ptr);
  948. struct net *net = dev_net(dev);
  949. struct fib_rules_ops *ops;
  950. ASSERT_RTNL();
  951. switch (event) {
  952. case NETDEV_REGISTER:
  953. list_for_each_entry(ops, &net->rules_ops, list)
  954. attach_rules(&ops->rules_list, dev);
  955. break;
  956. case NETDEV_CHANGENAME:
  957. list_for_each_entry(ops, &net->rules_ops, list) {
  958. detach_rules(&ops->rules_list, dev);
  959. attach_rules(&ops->rules_list, dev);
  960. }
  961. break;
  962. case NETDEV_UNREGISTER:
  963. list_for_each_entry(ops, &net->rules_ops, list)
  964. detach_rules(&ops->rules_list, dev);
  965. break;
  966. }
  967. return NOTIFY_DONE;
  968. }
  969. static struct notifier_block fib_rules_notifier = {
  970. .notifier_call = fib_rules_event,
  971. };
  972. static int __net_init fib_rules_net_init(struct net *net)
  973. {
  974. INIT_LIST_HEAD(&net->rules_ops);
  975. spin_lock_init(&net->rules_mod_lock);
  976. return 0;
  977. }
  978. static void __net_exit fib_rules_net_exit(struct net *net)
  979. {
  980. WARN_ON_ONCE(!list_empty(&net->rules_ops));
  981. }
  982. static struct pernet_operations fib_rules_net_ops = {
  983. .init = fib_rules_net_init,
  984. .exit = fib_rules_net_exit,
  985. };
  986. static int __init fib_rules_init(void)
  987. {
  988. int err;
  989. rtnl_register(PF_UNSPEC, RTM_NEWRULE, fib_nl_newrule, NULL, 0);
  990. rtnl_register(PF_UNSPEC, RTM_DELRULE, fib_nl_delrule, NULL, 0);
  991. rtnl_register(PF_UNSPEC, RTM_GETRULE, NULL, fib_nl_dumprule, 0);
  992. err = register_pernet_subsys(&fib_rules_net_ops);
  993. if (err < 0)
  994. goto fail;
  995. err = register_netdevice_notifier(&fib_rules_notifier);
  996. if (err < 0)
  997. goto fail_unregister;
  998. return 0;
  999. fail_unregister:
  1000. unregister_pernet_subsys(&fib_rules_net_ops);
  1001. fail:
  1002. rtnl_unregister(PF_UNSPEC, RTM_NEWRULE);
  1003. rtnl_unregister(PF_UNSPEC, RTM_DELRULE);
  1004. rtnl_unregister(PF_UNSPEC, RTM_GETRULE);
  1005. return err;
  1006. }
  1007. subsys_initcall(fib_rules_init);