fib_semantics.c 31 KB

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