fib_semantics.c 35 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477
  1. /*
  2. * INET An implementation of the TCP/IP protocol suite for the LINUX
  3. * operating system. INET is implemented using the BSD Socket
  4. * interface as the means of communication with the user level.
  5. *
  6. * IPv4 Forwarding Information Base: semantics.
  7. *
  8. * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
  9. *
  10. * This program is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU General Public License
  12. * as published by the Free Software Foundation; either version
  13. * 2 of the License, or (at your option) any later version.
  14. */
  15. #include <asm/uaccess.h>
  16. #include <linux/bitops.h>
  17. #include <linux/types.h>
  18. #include <linux/kernel.h>
  19. #include <linux/jiffies.h>
  20. #include <linux/mm.h>
  21. #include <linux/string.h>
  22. #include <linux/socket.h>
  23. #include <linux/sockios.h>
  24. #include <linux/errno.h>
  25. #include <linux/in.h>
  26. #include <linux/inet.h>
  27. #include <linux/inetdevice.h>
  28. #include <linux/netdevice.h>
  29. #include <linux/if_arp.h>
  30. #include <linux/proc_fs.h>
  31. #include <linux/skbuff.h>
  32. #include <linux/init.h>
  33. #include <linux/slab.h>
  34. #include <net/arp.h>
  35. #include <net/ip.h>
  36. #include <net/protocol.h>
  37. #include <net/route.h>
  38. #include <net/tcp.h>
  39. #include <net/sock.h>
  40. #include <net/ip_fib.h>
  41. #include <net/netlink.h>
  42. #include <net/nexthop.h>
  43. #include <net/lwtunnel.h>
  44. #include "fib_lookup.h"
  45. static DEFINE_SPINLOCK(fib_info_lock);
  46. static struct hlist_head *fib_info_hash;
  47. static struct hlist_head *fib_info_laddrhash;
  48. static unsigned int fib_info_hash_size;
  49. static unsigned int fib_info_cnt;
  50. #define DEVINDEX_HASHBITS 8
  51. #define DEVINDEX_HASHSIZE (1U << DEVINDEX_HASHBITS)
  52. static struct hlist_head fib_info_devhash[DEVINDEX_HASHSIZE];
  53. #ifdef CONFIG_IP_ROUTE_MULTIPATH
  54. static DEFINE_SPINLOCK(fib_multipath_lock);
  55. #define for_nexthops(fi) { \
  56. int nhsel; const struct fib_nh *nh; \
  57. for (nhsel = 0, nh = (fi)->fib_nh; \
  58. nhsel < (fi)->fib_nhs; \
  59. nh++, nhsel++)
  60. #define change_nexthops(fi) { \
  61. int nhsel; struct fib_nh *nexthop_nh; \
  62. for (nhsel = 0, nexthop_nh = (struct fib_nh *)((fi)->fib_nh); \
  63. nhsel < (fi)->fib_nhs; \
  64. nexthop_nh++, nhsel++)
  65. #else /* CONFIG_IP_ROUTE_MULTIPATH */
  66. /* Hope, that gcc will optimize it to get rid of dummy loop */
  67. #define for_nexthops(fi) { \
  68. int nhsel; const struct fib_nh *nh = (fi)->fib_nh; \
  69. for (nhsel = 0; nhsel < 1; nhsel++)
  70. #define change_nexthops(fi) { \
  71. int nhsel; \
  72. struct fib_nh *nexthop_nh = (struct fib_nh *)((fi)->fib_nh); \
  73. for (nhsel = 0; nhsel < 1; nhsel++)
  74. #endif /* CONFIG_IP_ROUTE_MULTIPATH */
  75. #define endfor_nexthops(fi) }
  76. const struct fib_prop fib_props[RTN_MAX + 1] = {
  77. [RTN_UNSPEC] = {
  78. .error = 0,
  79. .scope = RT_SCOPE_NOWHERE,
  80. },
  81. [RTN_UNICAST] = {
  82. .error = 0,
  83. .scope = RT_SCOPE_UNIVERSE,
  84. },
  85. [RTN_LOCAL] = {
  86. .error = 0,
  87. .scope = RT_SCOPE_HOST,
  88. },
  89. [RTN_BROADCAST] = {
  90. .error = 0,
  91. .scope = RT_SCOPE_LINK,
  92. },
  93. [RTN_ANYCAST] = {
  94. .error = 0,
  95. .scope = RT_SCOPE_LINK,
  96. },
  97. [RTN_MULTICAST] = {
  98. .error = 0,
  99. .scope = RT_SCOPE_UNIVERSE,
  100. },
  101. [RTN_BLACKHOLE] = {
  102. .error = -EINVAL,
  103. .scope = RT_SCOPE_UNIVERSE,
  104. },
  105. [RTN_UNREACHABLE] = {
  106. .error = -EHOSTUNREACH,
  107. .scope = RT_SCOPE_UNIVERSE,
  108. },
  109. [RTN_PROHIBIT] = {
  110. .error = -EACCES,
  111. .scope = RT_SCOPE_UNIVERSE,
  112. },
  113. [RTN_THROW] = {
  114. .error = -EAGAIN,
  115. .scope = RT_SCOPE_UNIVERSE,
  116. },
  117. [RTN_NAT] = {
  118. .error = -EINVAL,
  119. .scope = RT_SCOPE_NOWHERE,
  120. },
  121. [RTN_XRESOLVE] = {
  122. .error = -EINVAL,
  123. .scope = RT_SCOPE_NOWHERE,
  124. },
  125. };
  126. static void rt_fibinfo_free(struct rtable __rcu **rtp)
  127. {
  128. struct rtable *rt = rcu_dereference_protected(*rtp, 1);
  129. if (!rt)
  130. return;
  131. /* Not even needed : RCU_INIT_POINTER(*rtp, NULL);
  132. * because we waited an RCU grace period before calling
  133. * free_fib_info_rcu()
  134. */
  135. dst_free(&rt->dst);
  136. }
  137. static void free_nh_exceptions(struct fib_nh *nh)
  138. {
  139. struct fnhe_hash_bucket *hash;
  140. int i;
  141. hash = rcu_dereference_protected(nh->nh_exceptions, 1);
  142. if (!hash)
  143. return;
  144. for (i = 0; i < FNHE_HASH_SIZE; i++) {
  145. struct fib_nh_exception *fnhe;
  146. fnhe = rcu_dereference_protected(hash[i].chain, 1);
  147. while (fnhe) {
  148. struct fib_nh_exception *next;
  149. next = rcu_dereference_protected(fnhe->fnhe_next, 1);
  150. rt_fibinfo_free(&fnhe->fnhe_rth_input);
  151. rt_fibinfo_free(&fnhe->fnhe_rth_output);
  152. kfree(fnhe);
  153. fnhe = next;
  154. }
  155. }
  156. kfree(hash);
  157. }
  158. static void rt_fibinfo_free_cpus(struct rtable __rcu * __percpu *rtp)
  159. {
  160. int cpu;
  161. if (!rtp)
  162. return;
  163. for_each_possible_cpu(cpu) {
  164. struct rtable *rt;
  165. rt = rcu_dereference_protected(*per_cpu_ptr(rtp, cpu), 1);
  166. if (rt)
  167. dst_free(&rt->dst);
  168. }
  169. free_percpu(rtp);
  170. }
  171. /* Release a nexthop info record */
  172. static void free_fib_info_rcu(struct rcu_head *head)
  173. {
  174. struct fib_info *fi = container_of(head, struct fib_info, rcu);
  175. change_nexthops(fi) {
  176. if (nexthop_nh->nh_dev)
  177. dev_put(nexthop_nh->nh_dev);
  178. lwtunnel_state_put(nexthop_nh->nh_lwtstate);
  179. free_nh_exceptions(nexthop_nh);
  180. rt_fibinfo_free_cpus(nexthop_nh->nh_pcpu_rth_output);
  181. rt_fibinfo_free(&nexthop_nh->nh_rth_input);
  182. } endfor_nexthops(fi);
  183. if (fi->fib_metrics != (u32 *) dst_default_metrics)
  184. kfree(fi->fib_metrics);
  185. kfree(fi);
  186. }
  187. void free_fib_info(struct fib_info *fi)
  188. {
  189. if (fi->fib_dead == 0) {
  190. pr_warn("Freeing alive fib_info %p\n", fi);
  191. return;
  192. }
  193. fib_info_cnt--;
  194. #ifdef CONFIG_IP_ROUTE_CLASSID
  195. change_nexthops(fi) {
  196. if (nexthop_nh->nh_tclassid)
  197. fi->fib_net->ipv4.fib_num_tclassid_users--;
  198. } endfor_nexthops(fi);
  199. #endif
  200. call_rcu(&fi->rcu, free_fib_info_rcu);
  201. }
  202. void fib_release_info(struct fib_info *fi)
  203. {
  204. spin_lock_bh(&fib_info_lock);
  205. if (fi && --fi->fib_treeref == 0) {
  206. hlist_del(&fi->fib_hash);
  207. if (fi->fib_prefsrc)
  208. hlist_del(&fi->fib_lhash);
  209. change_nexthops(fi) {
  210. if (!nexthop_nh->nh_dev)
  211. continue;
  212. hlist_del(&nexthop_nh->nh_hash);
  213. } endfor_nexthops(fi)
  214. fi->fib_dead = 1;
  215. fib_info_put(fi);
  216. }
  217. spin_unlock_bh(&fib_info_lock);
  218. }
  219. static inline int nh_comp(const struct fib_info *fi, const struct fib_info *ofi)
  220. {
  221. const struct fib_nh *onh = ofi->fib_nh;
  222. for_nexthops(fi) {
  223. if (nh->nh_oif != onh->nh_oif ||
  224. nh->nh_gw != onh->nh_gw ||
  225. nh->nh_scope != onh->nh_scope ||
  226. #ifdef CONFIG_IP_ROUTE_MULTIPATH
  227. nh->nh_weight != onh->nh_weight ||
  228. #endif
  229. #ifdef CONFIG_IP_ROUTE_CLASSID
  230. nh->nh_tclassid != onh->nh_tclassid ||
  231. #endif
  232. lwtunnel_cmp_encap(nh->nh_lwtstate, onh->nh_lwtstate) ||
  233. ((nh->nh_flags ^ onh->nh_flags) & ~RTNH_COMPARE_MASK))
  234. return -1;
  235. onh++;
  236. } endfor_nexthops(fi);
  237. return 0;
  238. }
  239. static inline unsigned int fib_devindex_hashfn(unsigned int val)
  240. {
  241. unsigned int mask = DEVINDEX_HASHSIZE - 1;
  242. return (val ^
  243. (val >> DEVINDEX_HASHBITS) ^
  244. (val >> (DEVINDEX_HASHBITS * 2))) & mask;
  245. }
  246. static inline unsigned int fib_info_hashfn(const struct fib_info *fi)
  247. {
  248. unsigned int mask = (fib_info_hash_size - 1);
  249. unsigned int val = fi->fib_nhs;
  250. val ^= (fi->fib_protocol << 8) | fi->fib_scope;
  251. val ^= (__force u32)fi->fib_prefsrc;
  252. val ^= fi->fib_priority;
  253. for_nexthops(fi) {
  254. val ^= fib_devindex_hashfn(nh->nh_oif);
  255. } endfor_nexthops(fi)
  256. return (val ^ (val >> 7) ^ (val >> 12)) & mask;
  257. }
  258. static struct fib_info *fib_find_info(const struct fib_info *nfi)
  259. {
  260. struct hlist_head *head;
  261. struct fib_info *fi;
  262. unsigned int hash;
  263. hash = fib_info_hashfn(nfi);
  264. head = &fib_info_hash[hash];
  265. hlist_for_each_entry(fi, head, fib_hash) {
  266. if (!net_eq(fi->fib_net, nfi->fib_net))
  267. continue;
  268. if (fi->fib_nhs != nfi->fib_nhs)
  269. continue;
  270. if (nfi->fib_protocol == fi->fib_protocol &&
  271. nfi->fib_scope == fi->fib_scope &&
  272. nfi->fib_prefsrc == fi->fib_prefsrc &&
  273. nfi->fib_priority == fi->fib_priority &&
  274. nfi->fib_type == fi->fib_type &&
  275. memcmp(nfi->fib_metrics, fi->fib_metrics,
  276. sizeof(u32) * RTAX_MAX) == 0 &&
  277. !((nfi->fib_flags ^ fi->fib_flags) & ~RTNH_COMPARE_MASK) &&
  278. (nfi->fib_nhs == 0 || nh_comp(fi, nfi) == 0))
  279. return fi;
  280. }
  281. return NULL;
  282. }
  283. /* Check, that the gateway is already configured.
  284. * Used only by redirect accept routine.
  285. */
  286. int ip_fib_check_default(__be32 gw, struct net_device *dev)
  287. {
  288. struct hlist_head *head;
  289. struct fib_nh *nh;
  290. unsigned int hash;
  291. spin_lock(&fib_info_lock);
  292. hash = fib_devindex_hashfn(dev->ifindex);
  293. head = &fib_info_devhash[hash];
  294. hlist_for_each_entry(nh, head, nh_hash) {
  295. if (nh->nh_dev == dev &&
  296. nh->nh_gw == gw &&
  297. !(nh->nh_flags & RTNH_F_DEAD)) {
  298. spin_unlock(&fib_info_lock);
  299. return 0;
  300. }
  301. }
  302. spin_unlock(&fib_info_lock);
  303. return -1;
  304. }
  305. static inline size_t fib_nlmsg_size(struct fib_info *fi)
  306. {
  307. size_t payload = NLMSG_ALIGN(sizeof(struct rtmsg))
  308. + nla_total_size(4) /* RTA_TABLE */
  309. + nla_total_size(4) /* RTA_DST */
  310. + nla_total_size(4) /* RTA_PRIORITY */
  311. + nla_total_size(4) /* RTA_PREFSRC */
  312. + nla_total_size(TCP_CA_NAME_MAX); /* RTAX_CC_ALGO */
  313. /* space for nested metrics */
  314. payload += nla_total_size((RTAX_MAX * nla_total_size(4)));
  315. if (fi->fib_nhs) {
  316. size_t nh_encapsize = 0;
  317. /* Also handles the special case fib_nhs == 1 */
  318. /* each nexthop is packed in an attribute */
  319. size_t nhsize = nla_total_size(sizeof(struct rtnexthop));
  320. /* may contain flow and gateway attribute */
  321. nhsize += 2 * nla_total_size(4);
  322. /* grab encap info */
  323. for_nexthops(fi) {
  324. if (nh->nh_lwtstate) {
  325. /* RTA_ENCAP_TYPE */
  326. nh_encapsize += lwtunnel_get_encap_size(
  327. nh->nh_lwtstate);
  328. /* RTA_ENCAP */
  329. nh_encapsize += nla_total_size(2);
  330. }
  331. } endfor_nexthops(fi);
  332. /* all nexthops are packed in a nested attribute */
  333. payload += nla_total_size((fi->fib_nhs * nhsize) +
  334. nh_encapsize);
  335. }
  336. return payload;
  337. }
  338. void rtmsg_fib(int event, __be32 key, struct fib_alias *fa,
  339. int dst_len, u32 tb_id, const struct nl_info *info,
  340. unsigned int nlm_flags)
  341. {
  342. struct sk_buff *skb;
  343. u32 seq = info->nlh ? info->nlh->nlmsg_seq : 0;
  344. int err = -ENOBUFS;
  345. skb = nlmsg_new(fib_nlmsg_size(fa->fa_info), GFP_KERNEL);
  346. if (!skb)
  347. goto errout;
  348. err = fib_dump_info(skb, info->portid, seq, event, tb_id,
  349. fa->fa_type, key, dst_len,
  350. fa->fa_tos, fa->fa_info, nlm_flags);
  351. if (err < 0) {
  352. /* -EMSGSIZE implies BUG in fib_nlmsg_size() */
  353. WARN_ON(err == -EMSGSIZE);
  354. kfree_skb(skb);
  355. goto errout;
  356. }
  357. rtnl_notify(skb, info->nl_net, info->portid, RTNLGRP_IPV4_ROUTE,
  358. info->nlh, GFP_KERNEL);
  359. return;
  360. errout:
  361. if (err < 0)
  362. rtnl_set_sk_err(info->nl_net, RTNLGRP_IPV4_ROUTE, err);
  363. }
  364. static int fib_detect_death(struct fib_info *fi, int order,
  365. struct fib_info **last_resort, int *last_idx,
  366. int dflt)
  367. {
  368. struct neighbour *n;
  369. int state = NUD_NONE;
  370. n = neigh_lookup(&arp_tbl, &fi->fib_nh[0].nh_gw, fi->fib_dev);
  371. if (n) {
  372. state = n->nud_state;
  373. neigh_release(n);
  374. } else {
  375. return 0;
  376. }
  377. if (state == NUD_REACHABLE)
  378. return 0;
  379. if ((state & NUD_VALID) && order != dflt)
  380. return 0;
  381. if ((state & NUD_VALID) ||
  382. (*last_idx < 0 && order > dflt && state != NUD_INCOMPLETE)) {
  383. *last_resort = fi;
  384. *last_idx = order;
  385. }
  386. return 1;
  387. }
  388. #ifdef CONFIG_IP_ROUTE_MULTIPATH
  389. static int fib_count_nexthops(struct rtnexthop *rtnh, int remaining)
  390. {
  391. int nhs = 0;
  392. while (rtnh_ok(rtnh, remaining)) {
  393. nhs++;
  394. rtnh = rtnh_next(rtnh, &remaining);
  395. }
  396. /* leftover implies invalid nexthop configuration, discard it */
  397. return remaining > 0 ? 0 : nhs;
  398. }
  399. static int fib_get_nhs(struct fib_info *fi, struct rtnexthop *rtnh,
  400. int remaining, struct fib_config *cfg)
  401. {
  402. struct net *net = cfg->fc_nlinfo.nl_net;
  403. int ret;
  404. change_nexthops(fi) {
  405. int attrlen;
  406. if (!rtnh_ok(rtnh, remaining))
  407. return -EINVAL;
  408. nexthop_nh->nh_flags =
  409. (cfg->fc_flags & ~0xFF) | rtnh->rtnh_flags;
  410. nexthop_nh->nh_oif = rtnh->rtnh_ifindex;
  411. nexthop_nh->nh_weight = rtnh->rtnh_hops + 1;
  412. attrlen = rtnh_attrlen(rtnh);
  413. if (attrlen > 0) {
  414. struct nlattr *nla, *attrs = rtnh_attrs(rtnh);
  415. nla = nla_find(attrs, attrlen, RTA_GATEWAY);
  416. nexthop_nh->nh_gw = nla ? nla_get_in_addr(nla) : 0;
  417. #ifdef CONFIG_IP_ROUTE_CLASSID
  418. nla = nla_find(attrs, attrlen, RTA_FLOW);
  419. nexthop_nh->nh_tclassid = nla ? nla_get_u32(nla) : 0;
  420. if (nexthop_nh->nh_tclassid)
  421. fi->fib_net->ipv4.fib_num_tclassid_users++;
  422. #endif
  423. nla = nla_find(attrs, attrlen, RTA_ENCAP);
  424. if (nla) {
  425. struct lwtunnel_state *lwtstate;
  426. struct net_device *dev = NULL;
  427. struct nlattr *nla_entype;
  428. nla_entype = nla_find(attrs, attrlen,
  429. RTA_ENCAP_TYPE);
  430. if (!nla_entype)
  431. goto err_inval;
  432. if (cfg->fc_oif)
  433. dev = __dev_get_by_index(net, cfg->fc_oif);
  434. ret = lwtunnel_build_state(dev, nla_get_u16(
  435. nla_entype),
  436. nla, &lwtstate);
  437. if (ret)
  438. goto errout;
  439. lwtunnel_state_get(lwtstate);
  440. nexthop_nh->nh_lwtstate = lwtstate;
  441. }
  442. }
  443. rtnh = rtnh_next(rtnh, &remaining);
  444. } endfor_nexthops(fi);
  445. return 0;
  446. err_inval:
  447. ret = -EINVAL;
  448. errout:
  449. return ret;
  450. }
  451. #endif
  452. int fib_encap_match(struct net *net, u16 encap_type,
  453. struct nlattr *encap,
  454. int oif, const struct fib_nh *nh)
  455. {
  456. struct lwtunnel_state *lwtstate;
  457. struct net_device *dev = NULL;
  458. int ret;
  459. if (encap_type == LWTUNNEL_ENCAP_NONE)
  460. return 0;
  461. if (oif)
  462. dev = __dev_get_by_index(net, oif);
  463. ret = lwtunnel_build_state(dev, encap_type,
  464. encap, &lwtstate);
  465. if (!ret)
  466. return lwtunnel_cmp_encap(lwtstate, nh->nh_lwtstate);
  467. return 0;
  468. }
  469. int fib_nh_match(struct fib_config *cfg, struct fib_info *fi)
  470. {
  471. struct net *net = cfg->fc_nlinfo.nl_net;
  472. #ifdef CONFIG_IP_ROUTE_MULTIPATH
  473. struct rtnexthop *rtnh;
  474. int remaining;
  475. #endif
  476. if (cfg->fc_priority && cfg->fc_priority != fi->fib_priority)
  477. return 1;
  478. if (cfg->fc_oif || cfg->fc_gw) {
  479. if (cfg->fc_encap) {
  480. if (fib_encap_match(net, cfg->fc_encap_type,
  481. cfg->fc_encap, cfg->fc_oif,
  482. fi->fib_nh))
  483. return 1;
  484. }
  485. if ((!cfg->fc_oif || cfg->fc_oif == fi->fib_nh->nh_oif) &&
  486. (!cfg->fc_gw || cfg->fc_gw == fi->fib_nh->nh_gw))
  487. return 0;
  488. return 1;
  489. }
  490. #ifdef CONFIG_IP_ROUTE_MULTIPATH
  491. if (!cfg->fc_mp)
  492. return 0;
  493. rtnh = cfg->fc_mp;
  494. remaining = cfg->fc_mp_len;
  495. for_nexthops(fi) {
  496. int attrlen;
  497. if (!rtnh_ok(rtnh, remaining))
  498. return -EINVAL;
  499. if (rtnh->rtnh_ifindex && rtnh->rtnh_ifindex != nh->nh_oif)
  500. return 1;
  501. attrlen = rtnh_attrlen(rtnh);
  502. if (attrlen > 0) {
  503. struct nlattr *nla, *attrs = rtnh_attrs(rtnh);
  504. nla = nla_find(attrs, attrlen, RTA_GATEWAY);
  505. if (nla && nla_get_in_addr(nla) != nh->nh_gw)
  506. return 1;
  507. #ifdef CONFIG_IP_ROUTE_CLASSID
  508. nla = nla_find(attrs, attrlen, RTA_FLOW);
  509. if (nla && nla_get_u32(nla) != nh->nh_tclassid)
  510. return 1;
  511. #endif
  512. }
  513. rtnh = rtnh_next(rtnh, &remaining);
  514. } endfor_nexthops(fi);
  515. #endif
  516. return 0;
  517. }
  518. /*
  519. * Picture
  520. * -------
  521. *
  522. * Semantics of nexthop is very messy by historical reasons.
  523. * We have to take into account, that:
  524. * a) gateway can be actually local interface address,
  525. * so that gatewayed route is direct.
  526. * b) gateway must be on-link address, possibly
  527. * described not by an ifaddr, but also by a direct route.
  528. * c) If both gateway and interface are specified, they should not
  529. * contradict.
  530. * d) If we use tunnel routes, gateway could be not on-link.
  531. *
  532. * Attempt to reconcile all of these (alas, self-contradictory) conditions
  533. * results in pretty ugly and hairy code with obscure logic.
  534. *
  535. * I chose to generalized it instead, so that the size
  536. * of code does not increase practically, but it becomes
  537. * much more general.
  538. * Every prefix is assigned a "scope" value: "host" is local address,
  539. * "link" is direct route,
  540. * [ ... "site" ... "interior" ... ]
  541. * and "universe" is true gateway route with global meaning.
  542. *
  543. * Every prefix refers to a set of "nexthop"s (gw, oif),
  544. * where gw must have narrower scope. This recursion stops
  545. * when gw has LOCAL scope or if "nexthop" is declared ONLINK,
  546. * which means that gw is forced to be on link.
  547. *
  548. * Code is still hairy, but now it is apparently logically
  549. * consistent and very flexible. F.e. as by-product it allows
  550. * to co-exists in peace independent exterior and interior
  551. * routing processes.
  552. *
  553. * Normally it looks as following.
  554. *
  555. * {universe prefix} -> (gw, oif) [scope link]
  556. * |
  557. * |-> {link prefix} -> (gw, oif) [scope local]
  558. * |
  559. * |-> {local prefix} (terminal node)
  560. */
  561. static int fib_check_nh(struct fib_config *cfg, struct fib_info *fi,
  562. struct fib_nh *nh)
  563. {
  564. int err;
  565. struct net *net;
  566. struct net_device *dev;
  567. net = cfg->fc_nlinfo.nl_net;
  568. if (nh->nh_gw) {
  569. struct fib_result res;
  570. if (nh->nh_flags & RTNH_F_ONLINK) {
  571. if (cfg->fc_scope >= RT_SCOPE_LINK)
  572. return -EINVAL;
  573. if (inet_addr_type(net, nh->nh_gw) != RTN_UNICAST)
  574. return -EINVAL;
  575. dev = __dev_get_by_index(net, nh->nh_oif);
  576. if (!dev)
  577. return -ENODEV;
  578. if (!(dev->flags & IFF_UP))
  579. return -ENETDOWN;
  580. if (!netif_carrier_ok(dev))
  581. nh->nh_flags |= RTNH_F_LINKDOWN;
  582. nh->nh_dev = dev;
  583. dev_hold(dev);
  584. nh->nh_scope = RT_SCOPE_LINK;
  585. return 0;
  586. }
  587. rcu_read_lock();
  588. {
  589. struct flowi4 fl4 = {
  590. .daddr = nh->nh_gw,
  591. .flowi4_scope = cfg->fc_scope + 1,
  592. .flowi4_oif = nh->nh_oif,
  593. .flowi4_iif = LOOPBACK_IFINDEX,
  594. };
  595. /* It is not necessary, but requires a bit of thinking */
  596. if (fl4.flowi4_scope < RT_SCOPE_LINK)
  597. fl4.flowi4_scope = RT_SCOPE_LINK;
  598. err = fib_lookup(net, &fl4, &res,
  599. FIB_LOOKUP_IGNORE_LINKSTATE);
  600. if (err) {
  601. rcu_read_unlock();
  602. return err;
  603. }
  604. }
  605. err = -EINVAL;
  606. if (res.type != RTN_UNICAST && res.type != RTN_LOCAL)
  607. goto out;
  608. nh->nh_scope = res.scope;
  609. nh->nh_oif = FIB_RES_OIF(res);
  610. nh->nh_dev = dev = FIB_RES_DEV(res);
  611. if (!dev)
  612. goto out;
  613. dev_hold(dev);
  614. if (!netif_carrier_ok(dev))
  615. nh->nh_flags |= RTNH_F_LINKDOWN;
  616. err = (dev->flags & IFF_UP) ? 0 : -ENETDOWN;
  617. } else {
  618. struct in_device *in_dev;
  619. if (nh->nh_flags & (RTNH_F_PERVASIVE | RTNH_F_ONLINK))
  620. return -EINVAL;
  621. rcu_read_lock();
  622. err = -ENODEV;
  623. in_dev = inetdev_by_index(net, nh->nh_oif);
  624. if (!in_dev)
  625. goto out;
  626. err = -ENETDOWN;
  627. if (!(in_dev->dev->flags & IFF_UP))
  628. goto out;
  629. nh->nh_dev = in_dev->dev;
  630. dev_hold(nh->nh_dev);
  631. nh->nh_scope = RT_SCOPE_HOST;
  632. if (!netif_carrier_ok(nh->nh_dev))
  633. nh->nh_flags |= RTNH_F_LINKDOWN;
  634. err = 0;
  635. }
  636. out:
  637. rcu_read_unlock();
  638. return err;
  639. }
  640. static inline unsigned int fib_laddr_hashfn(__be32 val)
  641. {
  642. unsigned int mask = (fib_info_hash_size - 1);
  643. return ((__force u32)val ^
  644. ((__force u32)val >> 7) ^
  645. ((__force u32)val >> 14)) & mask;
  646. }
  647. static struct hlist_head *fib_info_hash_alloc(int bytes)
  648. {
  649. if (bytes <= PAGE_SIZE)
  650. return kzalloc(bytes, GFP_KERNEL);
  651. else
  652. return (struct hlist_head *)
  653. __get_free_pages(GFP_KERNEL | __GFP_ZERO,
  654. get_order(bytes));
  655. }
  656. static void fib_info_hash_free(struct hlist_head *hash, int bytes)
  657. {
  658. if (!hash)
  659. return;
  660. if (bytes <= PAGE_SIZE)
  661. kfree(hash);
  662. else
  663. free_pages((unsigned long) hash, get_order(bytes));
  664. }
  665. static void fib_info_hash_move(struct hlist_head *new_info_hash,
  666. struct hlist_head *new_laddrhash,
  667. unsigned int new_size)
  668. {
  669. struct hlist_head *old_info_hash, *old_laddrhash;
  670. unsigned int old_size = fib_info_hash_size;
  671. unsigned int i, bytes;
  672. spin_lock_bh(&fib_info_lock);
  673. old_info_hash = fib_info_hash;
  674. old_laddrhash = fib_info_laddrhash;
  675. fib_info_hash_size = new_size;
  676. for (i = 0; i < old_size; i++) {
  677. struct hlist_head *head = &fib_info_hash[i];
  678. struct hlist_node *n;
  679. struct fib_info *fi;
  680. hlist_for_each_entry_safe(fi, n, head, fib_hash) {
  681. struct hlist_head *dest;
  682. unsigned int new_hash;
  683. new_hash = fib_info_hashfn(fi);
  684. dest = &new_info_hash[new_hash];
  685. hlist_add_head(&fi->fib_hash, dest);
  686. }
  687. }
  688. fib_info_hash = new_info_hash;
  689. for (i = 0; i < old_size; i++) {
  690. struct hlist_head *lhead = &fib_info_laddrhash[i];
  691. struct hlist_node *n;
  692. struct fib_info *fi;
  693. hlist_for_each_entry_safe(fi, n, lhead, fib_lhash) {
  694. struct hlist_head *ldest;
  695. unsigned int new_hash;
  696. new_hash = fib_laddr_hashfn(fi->fib_prefsrc);
  697. ldest = &new_laddrhash[new_hash];
  698. hlist_add_head(&fi->fib_lhash, ldest);
  699. }
  700. }
  701. fib_info_laddrhash = new_laddrhash;
  702. spin_unlock_bh(&fib_info_lock);
  703. bytes = old_size * sizeof(struct hlist_head *);
  704. fib_info_hash_free(old_info_hash, bytes);
  705. fib_info_hash_free(old_laddrhash, bytes);
  706. }
  707. __be32 fib_info_update_nh_saddr(struct net *net, struct fib_nh *nh)
  708. {
  709. nh->nh_saddr = inet_select_addr(nh->nh_dev,
  710. nh->nh_gw,
  711. nh->nh_parent->fib_scope);
  712. nh->nh_saddr_genid = atomic_read(&net->ipv4.dev_addr_genid);
  713. return nh->nh_saddr;
  714. }
  715. struct fib_info *fib_create_info(struct fib_config *cfg)
  716. {
  717. int err;
  718. struct fib_info *fi = NULL;
  719. struct fib_info *ofi;
  720. int nhs = 1;
  721. struct net *net = cfg->fc_nlinfo.nl_net;
  722. if (cfg->fc_type > RTN_MAX)
  723. goto err_inval;
  724. /* Fast check to catch the most weird cases */
  725. if (fib_props[cfg->fc_type].scope > cfg->fc_scope)
  726. goto err_inval;
  727. #ifdef CONFIG_IP_ROUTE_MULTIPATH
  728. if (cfg->fc_mp) {
  729. nhs = fib_count_nexthops(cfg->fc_mp, cfg->fc_mp_len);
  730. if (nhs == 0)
  731. goto err_inval;
  732. }
  733. #endif
  734. err = -ENOBUFS;
  735. if (fib_info_cnt >= fib_info_hash_size) {
  736. unsigned int new_size = fib_info_hash_size << 1;
  737. struct hlist_head *new_info_hash;
  738. struct hlist_head *new_laddrhash;
  739. unsigned int bytes;
  740. if (!new_size)
  741. new_size = 16;
  742. bytes = new_size * sizeof(struct hlist_head *);
  743. new_info_hash = fib_info_hash_alloc(bytes);
  744. new_laddrhash = fib_info_hash_alloc(bytes);
  745. if (!new_info_hash || !new_laddrhash) {
  746. fib_info_hash_free(new_info_hash, bytes);
  747. fib_info_hash_free(new_laddrhash, bytes);
  748. } else
  749. fib_info_hash_move(new_info_hash, new_laddrhash, new_size);
  750. if (!fib_info_hash_size)
  751. goto failure;
  752. }
  753. fi = kzalloc(sizeof(*fi)+nhs*sizeof(struct fib_nh), GFP_KERNEL);
  754. if (!fi)
  755. goto failure;
  756. fib_info_cnt++;
  757. if (cfg->fc_mx) {
  758. fi->fib_metrics = kzalloc(sizeof(u32) * RTAX_MAX, GFP_KERNEL);
  759. if (!fi->fib_metrics)
  760. goto failure;
  761. } else
  762. fi->fib_metrics = (u32 *) dst_default_metrics;
  763. fi->fib_net = net;
  764. fi->fib_protocol = cfg->fc_protocol;
  765. fi->fib_scope = cfg->fc_scope;
  766. fi->fib_flags = cfg->fc_flags;
  767. fi->fib_priority = cfg->fc_priority;
  768. fi->fib_prefsrc = cfg->fc_prefsrc;
  769. fi->fib_type = cfg->fc_type;
  770. fi->fib_nhs = nhs;
  771. change_nexthops(fi) {
  772. nexthop_nh->nh_parent = fi;
  773. nexthop_nh->nh_pcpu_rth_output = alloc_percpu(struct rtable __rcu *);
  774. if (!nexthop_nh->nh_pcpu_rth_output)
  775. goto failure;
  776. } endfor_nexthops(fi)
  777. if (cfg->fc_mx) {
  778. struct nlattr *nla;
  779. int remaining;
  780. nla_for_each_attr(nla, cfg->fc_mx, cfg->fc_mx_len, remaining) {
  781. int type = nla_type(nla);
  782. if (type) {
  783. u32 val;
  784. if (type > RTAX_MAX)
  785. goto err_inval;
  786. if (type == RTAX_CC_ALGO) {
  787. char tmp[TCP_CA_NAME_MAX];
  788. nla_strlcpy(tmp, nla, sizeof(tmp));
  789. val = tcp_ca_get_key_by_name(tmp);
  790. if (val == TCP_CA_UNSPEC)
  791. goto err_inval;
  792. } else {
  793. val = nla_get_u32(nla);
  794. }
  795. if (type == RTAX_ADVMSS && val > 65535 - 40)
  796. val = 65535 - 40;
  797. if (type == RTAX_MTU && val > 65535 - 15)
  798. val = 65535 - 15;
  799. fi->fib_metrics[type - 1] = val;
  800. }
  801. }
  802. }
  803. if (cfg->fc_mp) {
  804. #ifdef CONFIG_IP_ROUTE_MULTIPATH
  805. err = fib_get_nhs(fi, cfg->fc_mp, cfg->fc_mp_len, cfg);
  806. if (err != 0)
  807. goto failure;
  808. if (cfg->fc_oif && fi->fib_nh->nh_oif != cfg->fc_oif)
  809. goto err_inval;
  810. if (cfg->fc_gw && fi->fib_nh->nh_gw != cfg->fc_gw)
  811. goto err_inval;
  812. #ifdef CONFIG_IP_ROUTE_CLASSID
  813. if (cfg->fc_flow && fi->fib_nh->nh_tclassid != cfg->fc_flow)
  814. goto err_inval;
  815. #endif
  816. #else
  817. goto err_inval;
  818. #endif
  819. } else {
  820. struct fib_nh *nh = fi->fib_nh;
  821. if (cfg->fc_encap) {
  822. struct lwtunnel_state *lwtstate;
  823. struct net_device *dev = NULL;
  824. if (cfg->fc_encap_type == LWTUNNEL_ENCAP_NONE)
  825. goto err_inval;
  826. if (cfg->fc_oif)
  827. dev = __dev_get_by_index(net, cfg->fc_oif);
  828. err = lwtunnel_build_state(dev, cfg->fc_encap_type,
  829. cfg->fc_encap, &lwtstate);
  830. if (err)
  831. goto failure;
  832. lwtunnel_state_get(lwtstate);
  833. nh->nh_lwtstate = lwtstate;
  834. }
  835. nh->nh_oif = cfg->fc_oif;
  836. nh->nh_gw = cfg->fc_gw;
  837. nh->nh_flags = cfg->fc_flags;
  838. #ifdef CONFIG_IP_ROUTE_CLASSID
  839. nh->nh_tclassid = cfg->fc_flow;
  840. if (nh->nh_tclassid)
  841. fi->fib_net->ipv4.fib_num_tclassid_users++;
  842. #endif
  843. #ifdef CONFIG_IP_ROUTE_MULTIPATH
  844. nh->nh_weight = 1;
  845. #endif
  846. }
  847. if (fib_props[cfg->fc_type].error) {
  848. if (cfg->fc_gw || cfg->fc_oif || cfg->fc_mp)
  849. goto err_inval;
  850. goto link_it;
  851. } else {
  852. switch (cfg->fc_type) {
  853. case RTN_UNICAST:
  854. case RTN_LOCAL:
  855. case RTN_BROADCAST:
  856. case RTN_ANYCAST:
  857. case RTN_MULTICAST:
  858. break;
  859. default:
  860. goto err_inval;
  861. }
  862. }
  863. if (cfg->fc_scope > RT_SCOPE_HOST)
  864. goto err_inval;
  865. if (cfg->fc_scope == RT_SCOPE_HOST) {
  866. struct fib_nh *nh = fi->fib_nh;
  867. /* Local address is added. */
  868. if (nhs != 1 || nh->nh_gw)
  869. goto err_inval;
  870. nh->nh_scope = RT_SCOPE_NOWHERE;
  871. nh->nh_dev = dev_get_by_index(net, fi->fib_nh->nh_oif);
  872. err = -ENODEV;
  873. if (!nh->nh_dev)
  874. goto failure;
  875. } else {
  876. int linkdown = 0;
  877. change_nexthops(fi) {
  878. err = fib_check_nh(cfg, fi, nexthop_nh);
  879. if (err != 0)
  880. goto failure;
  881. if (nexthop_nh->nh_flags & RTNH_F_LINKDOWN)
  882. linkdown++;
  883. } endfor_nexthops(fi)
  884. if (linkdown == fi->fib_nhs)
  885. fi->fib_flags |= RTNH_F_LINKDOWN;
  886. }
  887. if (fi->fib_prefsrc) {
  888. if (cfg->fc_type != RTN_LOCAL || !cfg->fc_dst ||
  889. fi->fib_prefsrc != cfg->fc_dst)
  890. if (inet_addr_type(net, fi->fib_prefsrc) != RTN_LOCAL)
  891. goto err_inval;
  892. }
  893. change_nexthops(fi) {
  894. fib_info_update_nh_saddr(net, nexthop_nh);
  895. } endfor_nexthops(fi)
  896. link_it:
  897. ofi = fib_find_info(fi);
  898. if (ofi) {
  899. fi->fib_dead = 1;
  900. free_fib_info(fi);
  901. ofi->fib_treeref++;
  902. return ofi;
  903. }
  904. fi->fib_treeref++;
  905. atomic_inc(&fi->fib_clntref);
  906. spin_lock_bh(&fib_info_lock);
  907. hlist_add_head(&fi->fib_hash,
  908. &fib_info_hash[fib_info_hashfn(fi)]);
  909. if (fi->fib_prefsrc) {
  910. struct hlist_head *head;
  911. head = &fib_info_laddrhash[fib_laddr_hashfn(fi->fib_prefsrc)];
  912. hlist_add_head(&fi->fib_lhash, head);
  913. }
  914. change_nexthops(fi) {
  915. struct hlist_head *head;
  916. unsigned int hash;
  917. if (!nexthop_nh->nh_dev)
  918. continue;
  919. hash = fib_devindex_hashfn(nexthop_nh->nh_dev->ifindex);
  920. head = &fib_info_devhash[hash];
  921. hlist_add_head(&nexthop_nh->nh_hash, head);
  922. } endfor_nexthops(fi)
  923. spin_unlock_bh(&fib_info_lock);
  924. return fi;
  925. err_inval:
  926. err = -EINVAL;
  927. failure:
  928. if (fi) {
  929. fi->fib_dead = 1;
  930. free_fib_info(fi);
  931. }
  932. return ERR_PTR(err);
  933. }
  934. int fib_dump_info(struct sk_buff *skb, u32 portid, u32 seq, int event,
  935. u32 tb_id, u8 type, __be32 dst, int dst_len, u8 tos,
  936. struct fib_info *fi, unsigned int flags)
  937. {
  938. struct nlmsghdr *nlh;
  939. struct rtmsg *rtm;
  940. nlh = nlmsg_put(skb, portid, seq, event, sizeof(*rtm), flags);
  941. if (!nlh)
  942. return -EMSGSIZE;
  943. rtm = nlmsg_data(nlh);
  944. rtm->rtm_family = AF_INET;
  945. rtm->rtm_dst_len = dst_len;
  946. rtm->rtm_src_len = 0;
  947. rtm->rtm_tos = tos;
  948. if (tb_id < 256)
  949. rtm->rtm_table = tb_id;
  950. else
  951. rtm->rtm_table = RT_TABLE_COMPAT;
  952. if (nla_put_u32(skb, RTA_TABLE, tb_id))
  953. goto nla_put_failure;
  954. rtm->rtm_type = type;
  955. rtm->rtm_flags = fi->fib_flags;
  956. rtm->rtm_scope = fi->fib_scope;
  957. rtm->rtm_protocol = fi->fib_protocol;
  958. if (rtm->rtm_dst_len &&
  959. nla_put_in_addr(skb, RTA_DST, dst))
  960. goto nla_put_failure;
  961. if (fi->fib_priority &&
  962. nla_put_u32(skb, RTA_PRIORITY, fi->fib_priority))
  963. goto nla_put_failure;
  964. if (rtnetlink_put_metrics(skb, fi->fib_metrics) < 0)
  965. goto nla_put_failure;
  966. if (fi->fib_prefsrc &&
  967. nla_put_in_addr(skb, RTA_PREFSRC, fi->fib_prefsrc))
  968. goto nla_put_failure;
  969. if (fi->fib_nhs == 1) {
  970. struct in_device *in_dev;
  971. if (fi->fib_nh->nh_gw &&
  972. nla_put_in_addr(skb, RTA_GATEWAY, fi->fib_nh->nh_gw))
  973. goto nla_put_failure;
  974. if (fi->fib_nh->nh_oif &&
  975. nla_put_u32(skb, RTA_OIF, fi->fib_nh->nh_oif))
  976. goto nla_put_failure;
  977. if (fi->fib_nh->nh_flags & RTNH_F_LINKDOWN) {
  978. in_dev = __in_dev_get_rtnl(fi->fib_nh->nh_dev);
  979. if (in_dev &&
  980. IN_DEV_IGNORE_ROUTES_WITH_LINKDOWN(in_dev))
  981. rtm->rtm_flags |= RTNH_F_DEAD;
  982. }
  983. #ifdef CONFIG_IP_ROUTE_CLASSID
  984. if (fi->fib_nh[0].nh_tclassid &&
  985. nla_put_u32(skb, RTA_FLOW, fi->fib_nh[0].nh_tclassid))
  986. goto nla_put_failure;
  987. #endif
  988. if (fi->fib_nh->nh_lwtstate)
  989. lwtunnel_fill_encap(skb, fi->fib_nh->nh_lwtstate);
  990. }
  991. #ifdef CONFIG_IP_ROUTE_MULTIPATH
  992. if (fi->fib_nhs > 1) {
  993. struct rtnexthop *rtnh;
  994. struct nlattr *mp;
  995. mp = nla_nest_start(skb, RTA_MULTIPATH);
  996. if (!mp)
  997. goto nla_put_failure;
  998. for_nexthops(fi) {
  999. struct in_device *in_dev;
  1000. rtnh = nla_reserve_nohdr(skb, sizeof(*rtnh));
  1001. if (!rtnh)
  1002. goto nla_put_failure;
  1003. rtnh->rtnh_flags = nh->nh_flags & 0xFF;
  1004. if (nh->nh_flags & RTNH_F_LINKDOWN) {
  1005. in_dev = __in_dev_get_rtnl(nh->nh_dev);
  1006. if (in_dev &&
  1007. IN_DEV_IGNORE_ROUTES_WITH_LINKDOWN(in_dev))
  1008. rtnh->rtnh_flags |= RTNH_F_DEAD;
  1009. }
  1010. rtnh->rtnh_hops = nh->nh_weight - 1;
  1011. rtnh->rtnh_ifindex = nh->nh_oif;
  1012. if (nh->nh_gw &&
  1013. nla_put_in_addr(skb, RTA_GATEWAY, nh->nh_gw))
  1014. goto nla_put_failure;
  1015. #ifdef CONFIG_IP_ROUTE_CLASSID
  1016. if (nh->nh_tclassid &&
  1017. nla_put_u32(skb, RTA_FLOW, nh->nh_tclassid))
  1018. goto nla_put_failure;
  1019. #endif
  1020. if (nh->nh_lwtstate)
  1021. lwtunnel_fill_encap(skb, nh->nh_lwtstate);
  1022. /* length of rtnetlink header + attributes */
  1023. rtnh->rtnh_len = nlmsg_get_pos(skb) - (void *) rtnh;
  1024. } endfor_nexthops(fi);
  1025. nla_nest_end(skb, mp);
  1026. }
  1027. #endif
  1028. nlmsg_end(skb, nlh);
  1029. return 0;
  1030. nla_put_failure:
  1031. nlmsg_cancel(skb, nlh);
  1032. return -EMSGSIZE;
  1033. }
  1034. /*
  1035. * Update FIB if:
  1036. * - local address disappeared -> we must delete all the entries
  1037. * referring to it.
  1038. * - device went down -> we must shutdown all nexthops going via it.
  1039. */
  1040. int fib_sync_down_addr(struct net *net, __be32 local)
  1041. {
  1042. int ret = 0;
  1043. unsigned int hash = fib_laddr_hashfn(local);
  1044. struct hlist_head *head = &fib_info_laddrhash[hash];
  1045. struct fib_info *fi;
  1046. if (!fib_info_laddrhash || local == 0)
  1047. return 0;
  1048. hlist_for_each_entry(fi, head, fib_lhash) {
  1049. if (!net_eq(fi->fib_net, net))
  1050. continue;
  1051. if (fi->fib_prefsrc == local) {
  1052. fi->fib_flags |= RTNH_F_DEAD;
  1053. ret++;
  1054. }
  1055. }
  1056. return ret;
  1057. }
  1058. int fib_sync_down_dev(struct net_device *dev, unsigned long event)
  1059. {
  1060. int ret = 0;
  1061. int scope = RT_SCOPE_NOWHERE;
  1062. struct fib_info *prev_fi = NULL;
  1063. unsigned int hash = fib_devindex_hashfn(dev->ifindex);
  1064. struct hlist_head *head = &fib_info_devhash[hash];
  1065. struct fib_nh *nh;
  1066. if (event == NETDEV_UNREGISTER ||
  1067. event == NETDEV_DOWN)
  1068. scope = -1;
  1069. hlist_for_each_entry(nh, head, nh_hash) {
  1070. struct fib_info *fi = nh->nh_parent;
  1071. int dead;
  1072. BUG_ON(!fi->fib_nhs);
  1073. if (nh->nh_dev != dev || fi == prev_fi)
  1074. continue;
  1075. prev_fi = fi;
  1076. dead = 0;
  1077. change_nexthops(fi) {
  1078. if (nexthop_nh->nh_flags & RTNH_F_DEAD)
  1079. dead++;
  1080. else if (nexthop_nh->nh_dev == dev &&
  1081. nexthop_nh->nh_scope != scope) {
  1082. switch (event) {
  1083. case NETDEV_DOWN:
  1084. case NETDEV_UNREGISTER:
  1085. nexthop_nh->nh_flags |= RTNH_F_DEAD;
  1086. /* fall through */
  1087. case NETDEV_CHANGE:
  1088. nexthop_nh->nh_flags |= RTNH_F_LINKDOWN;
  1089. break;
  1090. }
  1091. #ifdef CONFIG_IP_ROUTE_MULTIPATH
  1092. spin_lock_bh(&fib_multipath_lock);
  1093. fi->fib_power -= nexthop_nh->nh_power;
  1094. nexthop_nh->nh_power = 0;
  1095. spin_unlock_bh(&fib_multipath_lock);
  1096. #endif
  1097. dead++;
  1098. }
  1099. #ifdef CONFIG_IP_ROUTE_MULTIPATH
  1100. if (event == NETDEV_UNREGISTER &&
  1101. nexthop_nh->nh_dev == dev) {
  1102. dead = fi->fib_nhs;
  1103. break;
  1104. }
  1105. #endif
  1106. } endfor_nexthops(fi)
  1107. if (dead == fi->fib_nhs) {
  1108. switch (event) {
  1109. case NETDEV_DOWN:
  1110. case NETDEV_UNREGISTER:
  1111. fi->fib_flags |= RTNH_F_DEAD;
  1112. /* fall through */
  1113. case NETDEV_CHANGE:
  1114. fi->fib_flags |= RTNH_F_LINKDOWN;
  1115. break;
  1116. }
  1117. ret++;
  1118. }
  1119. }
  1120. return ret;
  1121. }
  1122. /* Must be invoked inside of an RCU protected region. */
  1123. void fib_select_default(struct fib_result *res)
  1124. {
  1125. struct fib_info *fi = NULL, *last_resort = NULL;
  1126. struct hlist_head *fa_head = res->fa_head;
  1127. struct fib_table *tb = res->table;
  1128. int order = -1, last_idx = -1;
  1129. struct fib_alias *fa;
  1130. hlist_for_each_entry_rcu(fa, fa_head, fa_list) {
  1131. struct fib_info *next_fi = fa->fa_info;
  1132. if (next_fi->fib_scope != res->scope ||
  1133. fa->fa_type != RTN_UNICAST)
  1134. continue;
  1135. if (next_fi->fib_priority > res->fi->fib_priority)
  1136. break;
  1137. if (!next_fi->fib_nh[0].nh_gw ||
  1138. next_fi->fib_nh[0].nh_scope != RT_SCOPE_LINK)
  1139. continue;
  1140. fib_alias_accessed(fa);
  1141. if (!fi) {
  1142. if (next_fi != res->fi)
  1143. break;
  1144. } else if (!fib_detect_death(fi, order, &last_resort,
  1145. &last_idx, tb->tb_default)) {
  1146. fib_result_assign(res, fi);
  1147. tb->tb_default = order;
  1148. goto out;
  1149. }
  1150. fi = next_fi;
  1151. order++;
  1152. }
  1153. if (order <= 0 || !fi) {
  1154. tb->tb_default = -1;
  1155. goto out;
  1156. }
  1157. if (!fib_detect_death(fi, order, &last_resort, &last_idx,
  1158. tb->tb_default)) {
  1159. fib_result_assign(res, fi);
  1160. tb->tb_default = order;
  1161. goto out;
  1162. }
  1163. if (last_idx >= 0)
  1164. fib_result_assign(res, last_resort);
  1165. tb->tb_default = last_idx;
  1166. out:
  1167. return;
  1168. }
  1169. /*
  1170. * Dead device goes up. We wake up dead nexthops.
  1171. * It takes sense only on multipath routes.
  1172. */
  1173. int fib_sync_up(struct net_device *dev, unsigned int nh_flags)
  1174. {
  1175. struct fib_info *prev_fi;
  1176. unsigned int hash;
  1177. struct hlist_head *head;
  1178. struct fib_nh *nh;
  1179. int ret;
  1180. if (!(dev->flags & IFF_UP))
  1181. return 0;
  1182. prev_fi = NULL;
  1183. hash = fib_devindex_hashfn(dev->ifindex);
  1184. head = &fib_info_devhash[hash];
  1185. ret = 0;
  1186. hlist_for_each_entry(nh, head, nh_hash) {
  1187. struct fib_info *fi = nh->nh_parent;
  1188. int alive;
  1189. BUG_ON(!fi->fib_nhs);
  1190. if (nh->nh_dev != dev || fi == prev_fi)
  1191. continue;
  1192. prev_fi = fi;
  1193. alive = 0;
  1194. change_nexthops(fi) {
  1195. if (!(nexthop_nh->nh_flags & nh_flags)) {
  1196. alive++;
  1197. continue;
  1198. }
  1199. if (!nexthop_nh->nh_dev ||
  1200. !(nexthop_nh->nh_dev->flags & IFF_UP))
  1201. continue;
  1202. if (nexthop_nh->nh_dev != dev ||
  1203. !__in_dev_get_rtnl(dev))
  1204. continue;
  1205. alive++;
  1206. #ifdef CONFIG_IP_ROUTE_MULTIPATH
  1207. spin_lock_bh(&fib_multipath_lock);
  1208. nexthop_nh->nh_power = 0;
  1209. nexthop_nh->nh_flags &= ~nh_flags;
  1210. spin_unlock_bh(&fib_multipath_lock);
  1211. #else
  1212. nexthop_nh->nh_flags &= ~nh_flags;
  1213. #endif
  1214. } endfor_nexthops(fi)
  1215. if (alive > 0) {
  1216. fi->fib_flags &= ~nh_flags;
  1217. ret++;
  1218. }
  1219. }
  1220. return ret;
  1221. }
  1222. #ifdef CONFIG_IP_ROUTE_MULTIPATH
  1223. /*
  1224. * The algorithm is suboptimal, but it provides really
  1225. * fair weighted route distribution.
  1226. */
  1227. void fib_select_multipath(struct fib_result *res)
  1228. {
  1229. struct fib_info *fi = res->fi;
  1230. struct in_device *in_dev;
  1231. int w;
  1232. spin_lock_bh(&fib_multipath_lock);
  1233. if (fi->fib_power <= 0) {
  1234. int power = 0;
  1235. change_nexthops(fi) {
  1236. in_dev = __in_dev_get_rcu(nexthop_nh->nh_dev);
  1237. if (nexthop_nh->nh_flags & RTNH_F_DEAD)
  1238. continue;
  1239. if (in_dev &&
  1240. IN_DEV_IGNORE_ROUTES_WITH_LINKDOWN(in_dev) &&
  1241. nexthop_nh->nh_flags & RTNH_F_LINKDOWN)
  1242. continue;
  1243. power += nexthop_nh->nh_weight;
  1244. nexthop_nh->nh_power = nexthop_nh->nh_weight;
  1245. } endfor_nexthops(fi);
  1246. fi->fib_power = power;
  1247. if (power <= 0) {
  1248. spin_unlock_bh(&fib_multipath_lock);
  1249. /* Race condition: route has just become dead. */
  1250. res->nh_sel = 0;
  1251. return;
  1252. }
  1253. }
  1254. /* w should be random number [0..fi->fib_power-1],
  1255. * it is pretty bad approximation.
  1256. */
  1257. w = jiffies % fi->fib_power;
  1258. change_nexthops(fi) {
  1259. if (!(nexthop_nh->nh_flags & RTNH_F_DEAD) &&
  1260. nexthop_nh->nh_power) {
  1261. w -= nexthop_nh->nh_power;
  1262. if (w <= 0) {
  1263. nexthop_nh->nh_power--;
  1264. fi->fib_power--;
  1265. res->nh_sel = nhsel;
  1266. spin_unlock_bh(&fib_multipath_lock);
  1267. return;
  1268. }
  1269. }
  1270. } endfor_nexthops(fi);
  1271. /* Race condition: route has just become dead. */
  1272. res->nh_sel = 0;
  1273. spin_unlock_bh(&fib_multipath_lock);
  1274. }
  1275. #endif