dn_route.c 47 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939
  1. /*
  2. * DECnet An implementation of the DECnet protocol suite for the LINUX
  3. * operating system. DECnet is implemented using the BSD Socket
  4. * interface as the means of communication with the user level.
  5. *
  6. * DECnet Routing Functions (Endnode and Router)
  7. *
  8. * Authors: Steve Whitehouse <SteveW@ACM.org>
  9. * Eduardo Marcelo Serrat <emserrat@geocities.com>
  10. *
  11. * Changes:
  12. * Steve Whitehouse : Fixes to allow "intra-ethernet" and
  13. * "return-to-sender" bits on outgoing
  14. * packets.
  15. * Steve Whitehouse : Timeouts for cached routes.
  16. * Steve Whitehouse : Use dst cache for input routes too.
  17. * Steve Whitehouse : Fixed error values in dn_send_skb.
  18. * Steve Whitehouse : Rework routing functions to better fit
  19. * DECnet routing design
  20. * Alexey Kuznetsov : New SMP locking
  21. * Steve Whitehouse : More SMP locking changes & dn_cache_dump()
  22. * Steve Whitehouse : Prerouting NF hook, now really is prerouting.
  23. * Fixed possible skb leak in rtnetlink funcs.
  24. * Steve Whitehouse : Dave Miller's dynamic hash table sizing and
  25. * Alexey Kuznetsov's finer grained locking
  26. * from ipv4/route.c.
  27. * Steve Whitehouse : Routing is now starting to look like a
  28. * sensible set of code now, mainly due to
  29. * my copying the IPv4 routing code. The
  30. * hooks here are modified and will continue
  31. * to evolve for a while.
  32. * Steve Whitehouse : Real SMP at last :-) Also new netfilter
  33. * stuff. Look out raw sockets your days
  34. * are numbered!
  35. * Steve Whitehouse : Added return-to-sender functions. Added
  36. * backlog congestion level return codes.
  37. * Steve Whitehouse : Fixed bug where routes were set up with
  38. * no ref count on net devices.
  39. * Steve Whitehouse : RCU for the route cache
  40. * Steve Whitehouse : Preparations for the flow cache
  41. * Steve Whitehouse : Prepare for nonlinear skbs
  42. */
  43. /******************************************************************************
  44. (c) 1995-1998 E.M. Serrat emserrat@geocities.com
  45. This program is free software; you can redistribute it and/or modify
  46. it under the terms of the GNU General Public License as published by
  47. the Free Software Foundation; either version 2 of the License, or
  48. any later version.
  49. This program is distributed in the hope that it will be useful,
  50. but WITHOUT ANY WARRANTY; without even the implied warranty of
  51. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  52. GNU General Public License for more details.
  53. *******************************************************************************/
  54. #include <linux/errno.h>
  55. #include <linux/types.h>
  56. #include <linux/socket.h>
  57. #include <linux/in.h>
  58. #include <linux/kernel.h>
  59. #include <linux/sockios.h>
  60. #include <linux/net.h>
  61. #include <linux/netdevice.h>
  62. #include <linux/inet.h>
  63. #include <linux/route.h>
  64. #include <linux/in_route.h>
  65. #include <linux/slab.h>
  66. #include <net/sock.h>
  67. #include <linux/mm.h>
  68. #include <linux/proc_fs.h>
  69. #include <linux/seq_file.h>
  70. #include <linux/init.h>
  71. #include <linux/rtnetlink.h>
  72. #include <linux/string.h>
  73. #include <linux/netfilter_decnet.h>
  74. #include <linux/rcupdate.h>
  75. #include <linux/times.h>
  76. #include <linux/export.h>
  77. #include <asm/errno.h>
  78. #include <net/net_namespace.h>
  79. #include <net/netlink.h>
  80. #include <net/neighbour.h>
  81. #include <net/dst.h>
  82. #include <net/flow.h>
  83. #include <net/fib_rules.h>
  84. #include <net/dn.h>
  85. #include <net/dn_dev.h>
  86. #include <net/dn_nsp.h>
  87. #include <net/dn_route.h>
  88. #include <net/dn_neigh.h>
  89. #include <net/dn_fib.h>
  90. struct dn_rt_hash_bucket
  91. {
  92. struct dn_route __rcu *chain;
  93. spinlock_t lock;
  94. };
  95. extern struct neigh_table dn_neigh_table;
  96. static unsigned char dn_hiord_addr[6] = {0xAA,0x00,0x04,0x00,0x00,0x00};
  97. static const int dn_rt_min_delay = 2 * HZ;
  98. static const int dn_rt_max_delay = 10 * HZ;
  99. static const int dn_rt_mtu_expires = 10 * 60 * HZ;
  100. static unsigned long dn_rt_deadline;
  101. static int dn_dst_gc(struct dst_ops *ops);
  102. static struct dst_entry *dn_dst_check(struct dst_entry *, __u32);
  103. static unsigned int dn_dst_default_advmss(const struct dst_entry *dst);
  104. static unsigned int dn_dst_mtu(const struct dst_entry *dst);
  105. static void dn_dst_destroy(struct dst_entry *);
  106. static void dn_dst_ifdown(struct dst_entry *, struct net_device *dev, int how);
  107. static struct dst_entry *dn_dst_negative_advice(struct dst_entry *);
  108. static void dn_dst_link_failure(struct sk_buff *);
  109. static void dn_dst_update_pmtu(struct dst_entry *dst, struct sock *sk,
  110. struct sk_buff *skb , u32 mtu);
  111. static void dn_dst_redirect(struct dst_entry *dst, struct sock *sk,
  112. struct sk_buff *skb);
  113. static struct neighbour *dn_dst_neigh_lookup(const struct dst_entry *dst,
  114. struct sk_buff *skb,
  115. const void *daddr);
  116. static int dn_route_input(struct sk_buff *);
  117. static void dn_run_flush(unsigned long dummy);
  118. static struct dn_rt_hash_bucket *dn_rt_hash_table;
  119. static unsigned int dn_rt_hash_mask;
  120. static struct timer_list dn_route_timer;
  121. static DEFINE_TIMER(dn_rt_flush_timer, dn_run_flush, 0, 0);
  122. int decnet_dst_gc_interval = 2;
  123. static struct dst_ops dn_dst_ops = {
  124. .family = PF_DECnet,
  125. .gc_thresh = 128,
  126. .gc = dn_dst_gc,
  127. .check = dn_dst_check,
  128. .default_advmss = dn_dst_default_advmss,
  129. .mtu = dn_dst_mtu,
  130. .cow_metrics = dst_cow_metrics_generic,
  131. .destroy = dn_dst_destroy,
  132. .ifdown = dn_dst_ifdown,
  133. .negative_advice = dn_dst_negative_advice,
  134. .link_failure = dn_dst_link_failure,
  135. .update_pmtu = dn_dst_update_pmtu,
  136. .redirect = dn_dst_redirect,
  137. .neigh_lookup = dn_dst_neigh_lookup,
  138. };
  139. static void dn_dst_destroy(struct dst_entry *dst)
  140. {
  141. struct dn_route *rt = (struct dn_route *) dst;
  142. if (rt->n)
  143. neigh_release(rt->n);
  144. dst_destroy_metrics_generic(dst);
  145. }
  146. static void dn_dst_ifdown(struct dst_entry *dst, struct net_device *dev, int how)
  147. {
  148. if (how) {
  149. struct dn_route *rt = (struct dn_route *) dst;
  150. struct neighbour *n = rt->n;
  151. if (n && n->dev == dev) {
  152. n->dev = dev_net(dev)->loopback_dev;
  153. dev_hold(n->dev);
  154. dev_put(dev);
  155. }
  156. }
  157. }
  158. static __inline__ unsigned int dn_hash(__le16 src, __le16 dst)
  159. {
  160. __u16 tmp = (__u16 __force)(src ^ dst);
  161. tmp ^= (tmp >> 3);
  162. tmp ^= (tmp >> 5);
  163. tmp ^= (tmp >> 10);
  164. return dn_rt_hash_mask & (unsigned int)tmp;
  165. }
  166. static inline void dnrt_free(struct dn_route *rt)
  167. {
  168. call_rcu_bh(&rt->dst.rcu_head, dst_rcu_free);
  169. }
  170. static void dn_dst_check_expire(unsigned long dummy)
  171. {
  172. int i;
  173. struct dn_route *rt;
  174. struct dn_route __rcu **rtp;
  175. unsigned long now = jiffies;
  176. unsigned long expire = 120 * HZ;
  177. for (i = 0; i <= dn_rt_hash_mask; i++) {
  178. rtp = &dn_rt_hash_table[i].chain;
  179. spin_lock(&dn_rt_hash_table[i].lock);
  180. while ((rt = rcu_dereference_protected(*rtp,
  181. lockdep_is_held(&dn_rt_hash_table[i].lock))) != NULL) {
  182. if (atomic_read(&rt->dst.__refcnt) ||
  183. (now - rt->dst.lastuse) < expire) {
  184. rtp = &rt->dst.dn_next;
  185. continue;
  186. }
  187. *rtp = rt->dst.dn_next;
  188. rt->dst.dn_next = NULL;
  189. dnrt_free(rt);
  190. }
  191. spin_unlock(&dn_rt_hash_table[i].lock);
  192. if ((jiffies - now) > 0)
  193. break;
  194. }
  195. mod_timer(&dn_route_timer, now + decnet_dst_gc_interval * HZ);
  196. }
  197. static int dn_dst_gc(struct dst_ops *ops)
  198. {
  199. struct dn_route *rt;
  200. struct dn_route __rcu **rtp;
  201. int i;
  202. unsigned long now = jiffies;
  203. unsigned long expire = 10 * HZ;
  204. for (i = 0; i <= dn_rt_hash_mask; i++) {
  205. spin_lock_bh(&dn_rt_hash_table[i].lock);
  206. rtp = &dn_rt_hash_table[i].chain;
  207. while ((rt = rcu_dereference_protected(*rtp,
  208. lockdep_is_held(&dn_rt_hash_table[i].lock))) != NULL) {
  209. if (atomic_read(&rt->dst.__refcnt) ||
  210. (now - rt->dst.lastuse) < expire) {
  211. rtp = &rt->dst.dn_next;
  212. continue;
  213. }
  214. *rtp = rt->dst.dn_next;
  215. rt->dst.dn_next = NULL;
  216. dnrt_free(rt);
  217. break;
  218. }
  219. spin_unlock_bh(&dn_rt_hash_table[i].lock);
  220. }
  221. return 0;
  222. }
  223. /*
  224. * The decnet standards don't impose a particular minimum mtu, what they
  225. * do insist on is that the routing layer accepts a datagram of at least
  226. * 230 bytes long. Here we have to subtract the routing header length from
  227. * 230 to get the minimum acceptable mtu. If there is no neighbour, then we
  228. * assume the worst and use a long header size.
  229. *
  230. * We update both the mtu and the advertised mss (i.e. the segment size we
  231. * advertise to the other end).
  232. */
  233. static void dn_dst_update_pmtu(struct dst_entry *dst, struct sock *sk,
  234. struct sk_buff *skb, u32 mtu)
  235. {
  236. struct dn_route *rt = (struct dn_route *) dst;
  237. struct neighbour *n = rt->n;
  238. u32 min_mtu = 230;
  239. struct dn_dev *dn;
  240. dn = n ? rcu_dereference_raw(n->dev->dn_ptr) : NULL;
  241. if (dn && dn->use_long == 0)
  242. min_mtu -= 6;
  243. else
  244. min_mtu -= 21;
  245. if (dst_metric(dst, RTAX_MTU) > mtu && mtu >= min_mtu) {
  246. if (!(dst_metric_locked(dst, RTAX_MTU))) {
  247. dst_metric_set(dst, RTAX_MTU, mtu);
  248. dst_set_expires(dst, dn_rt_mtu_expires);
  249. }
  250. if (!(dst_metric_locked(dst, RTAX_ADVMSS))) {
  251. u32 mss = mtu - DN_MAX_NSP_DATA_HEADER;
  252. u32 existing_mss = dst_metric_raw(dst, RTAX_ADVMSS);
  253. if (!existing_mss || existing_mss > mss)
  254. dst_metric_set(dst, RTAX_ADVMSS, mss);
  255. }
  256. }
  257. }
  258. static void dn_dst_redirect(struct dst_entry *dst, struct sock *sk,
  259. struct sk_buff *skb)
  260. {
  261. }
  262. /*
  263. * When a route has been marked obsolete. (e.g. routing cache flush)
  264. */
  265. static struct dst_entry *dn_dst_check(struct dst_entry *dst, __u32 cookie)
  266. {
  267. return NULL;
  268. }
  269. static struct dst_entry *dn_dst_negative_advice(struct dst_entry *dst)
  270. {
  271. dst_release(dst);
  272. return NULL;
  273. }
  274. static void dn_dst_link_failure(struct sk_buff *skb)
  275. {
  276. }
  277. static inline int compare_keys(struct flowidn *fl1, struct flowidn *fl2)
  278. {
  279. return ((fl1->daddr ^ fl2->daddr) |
  280. (fl1->saddr ^ fl2->saddr) |
  281. (fl1->flowidn_mark ^ fl2->flowidn_mark) |
  282. (fl1->flowidn_scope ^ fl2->flowidn_scope) |
  283. (fl1->flowidn_oif ^ fl2->flowidn_oif) |
  284. (fl1->flowidn_iif ^ fl2->flowidn_iif)) == 0;
  285. }
  286. static int dn_insert_route(struct dn_route *rt, unsigned int hash, struct dn_route **rp)
  287. {
  288. struct dn_route *rth;
  289. struct dn_route __rcu **rthp;
  290. unsigned long now = jiffies;
  291. rthp = &dn_rt_hash_table[hash].chain;
  292. spin_lock_bh(&dn_rt_hash_table[hash].lock);
  293. while ((rth = rcu_dereference_protected(*rthp,
  294. lockdep_is_held(&dn_rt_hash_table[hash].lock))) != NULL) {
  295. if (compare_keys(&rth->fld, &rt->fld)) {
  296. /* Put it first */
  297. *rthp = rth->dst.dn_next;
  298. rcu_assign_pointer(rth->dst.dn_next,
  299. dn_rt_hash_table[hash].chain);
  300. rcu_assign_pointer(dn_rt_hash_table[hash].chain, rth);
  301. dst_use(&rth->dst, now);
  302. spin_unlock_bh(&dn_rt_hash_table[hash].lock);
  303. dst_free(&rt->dst);
  304. *rp = rth;
  305. return 0;
  306. }
  307. rthp = &rth->dst.dn_next;
  308. }
  309. rcu_assign_pointer(rt->dst.dn_next, dn_rt_hash_table[hash].chain);
  310. rcu_assign_pointer(dn_rt_hash_table[hash].chain, rt);
  311. dst_use(&rt->dst, now);
  312. spin_unlock_bh(&dn_rt_hash_table[hash].lock);
  313. *rp = rt;
  314. return 0;
  315. }
  316. static void dn_run_flush(unsigned long dummy)
  317. {
  318. int i;
  319. struct dn_route *rt, *next;
  320. for (i = 0; i < dn_rt_hash_mask; i++) {
  321. spin_lock_bh(&dn_rt_hash_table[i].lock);
  322. if ((rt = xchg((struct dn_route **)&dn_rt_hash_table[i].chain, NULL)) == NULL)
  323. goto nothing_to_declare;
  324. for(; rt; rt = next) {
  325. next = rcu_dereference_raw(rt->dst.dn_next);
  326. RCU_INIT_POINTER(rt->dst.dn_next, NULL);
  327. dnrt_free(rt);
  328. }
  329. nothing_to_declare:
  330. spin_unlock_bh(&dn_rt_hash_table[i].lock);
  331. }
  332. }
  333. static DEFINE_SPINLOCK(dn_rt_flush_lock);
  334. void dn_rt_cache_flush(int delay)
  335. {
  336. unsigned long now = jiffies;
  337. int user_mode = !in_interrupt();
  338. if (delay < 0)
  339. delay = dn_rt_min_delay;
  340. spin_lock_bh(&dn_rt_flush_lock);
  341. if (del_timer(&dn_rt_flush_timer) && delay > 0 && dn_rt_deadline) {
  342. long tmo = (long)(dn_rt_deadline - now);
  343. if (user_mode && tmo < dn_rt_max_delay - dn_rt_min_delay)
  344. tmo = 0;
  345. if (delay > tmo)
  346. delay = tmo;
  347. }
  348. if (delay <= 0) {
  349. spin_unlock_bh(&dn_rt_flush_lock);
  350. dn_run_flush(0);
  351. return;
  352. }
  353. if (dn_rt_deadline == 0)
  354. dn_rt_deadline = now + dn_rt_max_delay;
  355. dn_rt_flush_timer.expires = now + delay;
  356. add_timer(&dn_rt_flush_timer);
  357. spin_unlock_bh(&dn_rt_flush_lock);
  358. }
  359. /**
  360. * dn_return_short - Return a short packet to its sender
  361. * @skb: The packet to return
  362. *
  363. */
  364. static int dn_return_short(struct sk_buff *skb)
  365. {
  366. struct dn_skb_cb *cb;
  367. unsigned char *ptr;
  368. __le16 *src;
  369. __le16 *dst;
  370. /* Add back headers */
  371. skb_push(skb, skb->data - skb_network_header(skb));
  372. if ((skb = skb_unshare(skb, GFP_ATOMIC)) == NULL)
  373. return NET_RX_DROP;
  374. cb = DN_SKB_CB(skb);
  375. /* Skip packet length and point to flags */
  376. ptr = skb->data + 2;
  377. *ptr++ = (cb->rt_flags & ~DN_RT_F_RQR) | DN_RT_F_RTS;
  378. dst = (__le16 *)ptr;
  379. ptr += 2;
  380. src = (__le16 *)ptr;
  381. ptr += 2;
  382. *ptr = 0; /* Zero hop count */
  383. swap(*src, *dst);
  384. skb->pkt_type = PACKET_OUTGOING;
  385. dn_rt_finish_output(skb, NULL, NULL);
  386. return NET_RX_SUCCESS;
  387. }
  388. /**
  389. * dn_return_long - Return a long packet to its sender
  390. * @skb: The long format packet to return
  391. *
  392. */
  393. static int dn_return_long(struct sk_buff *skb)
  394. {
  395. struct dn_skb_cb *cb;
  396. unsigned char *ptr;
  397. unsigned char *src_addr, *dst_addr;
  398. unsigned char tmp[ETH_ALEN];
  399. /* Add back all headers */
  400. skb_push(skb, skb->data - skb_network_header(skb));
  401. if ((skb = skb_unshare(skb, GFP_ATOMIC)) == NULL)
  402. return NET_RX_DROP;
  403. cb = DN_SKB_CB(skb);
  404. /* Ignore packet length and point to flags */
  405. ptr = skb->data + 2;
  406. /* Skip padding */
  407. if (*ptr & DN_RT_F_PF) {
  408. char padlen = (*ptr & ~DN_RT_F_PF);
  409. ptr += padlen;
  410. }
  411. *ptr++ = (cb->rt_flags & ~DN_RT_F_RQR) | DN_RT_F_RTS;
  412. ptr += 2;
  413. dst_addr = ptr;
  414. ptr += 8;
  415. src_addr = ptr;
  416. ptr += 6;
  417. *ptr = 0; /* Zero hop count */
  418. /* Swap source and destination */
  419. memcpy(tmp, src_addr, ETH_ALEN);
  420. memcpy(src_addr, dst_addr, ETH_ALEN);
  421. memcpy(dst_addr, tmp, ETH_ALEN);
  422. skb->pkt_type = PACKET_OUTGOING;
  423. dn_rt_finish_output(skb, dst_addr, src_addr);
  424. return NET_RX_SUCCESS;
  425. }
  426. /**
  427. * dn_route_rx_packet - Try and find a route for an incoming packet
  428. * @skb: The packet to find a route for
  429. *
  430. * Returns: result of input function if route is found, error code otherwise
  431. */
  432. static int dn_route_rx_packet(struct net *net, struct sock *sk, struct sk_buff *skb)
  433. {
  434. struct dn_skb_cb *cb;
  435. int err;
  436. if ((err = dn_route_input(skb)) == 0)
  437. return dst_input(skb);
  438. cb = DN_SKB_CB(skb);
  439. if (decnet_debug_level & 4) {
  440. char *devname = skb->dev ? skb->dev->name : "???";
  441. printk(KERN_DEBUG
  442. "DECnet: dn_route_rx_packet: rt_flags=0x%02x dev=%s len=%d src=0x%04hx dst=0x%04hx err=%d type=%d\n",
  443. (int)cb->rt_flags, devname, skb->len,
  444. le16_to_cpu(cb->src), le16_to_cpu(cb->dst),
  445. err, skb->pkt_type);
  446. }
  447. if ((skb->pkt_type == PACKET_HOST) && (cb->rt_flags & DN_RT_F_RQR)) {
  448. switch (cb->rt_flags & DN_RT_PKT_MSK) {
  449. case DN_RT_PKT_SHORT:
  450. return dn_return_short(skb);
  451. case DN_RT_PKT_LONG:
  452. return dn_return_long(skb);
  453. }
  454. }
  455. kfree_skb(skb);
  456. return NET_RX_DROP;
  457. }
  458. static int dn_route_rx_long(struct sk_buff *skb)
  459. {
  460. struct dn_skb_cb *cb = DN_SKB_CB(skb);
  461. unsigned char *ptr = skb->data;
  462. if (!pskb_may_pull(skb, 21)) /* 20 for long header, 1 for shortest nsp */
  463. goto drop_it;
  464. skb_pull(skb, 20);
  465. skb_reset_transport_header(skb);
  466. /* Destination info */
  467. ptr += 2;
  468. cb->dst = dn_eth2dn(ptr);
  469. if (memcmp(ptr, dn_hiord_addr, 4) != 0)
  470. goto drop_it;
  471. ptr += 6;
  472. /* Source info */
  473. ptr += 2;
  474. cb->src = dn_eth2dn(ptr);
  475. if (memcmp(ptr, dn_hiord_addr, 4) != 0)
  476. goto drop_it;
  477. ptr += 6;
  478. /* Other junk */
  479. ptr++;
  480. cb->hops = *ptr++; /* Visit Count */
  481. return NF_HOOK(NFPROTO_DECNET, NF_DN_PRE_ROUTING,
  482. &init_net, NULL, skb, skb->dev, NULL,
  483. dn_route_rx_packet);
  484. drop_it:
  485. kfree_skb(skb);
  486. return NET_RX_DROP;
  487. }
  488. static int dn_route_rx_short(struct sk_buff *skb)
  489. {
  490. struct dn_skb_cb *cb = DN_SKB_CB(skb);
  491. unsigned char *ptr = skb->data;
  492. if (!pskb_may_pull(skb, 6)) /* 5 for short header + 1 for shortest nsp */
  493. goto drop_it;
  494. skb_pull(skb, 5);
  495. skb_reset_transport_header(skb);
  496. cb->dst = *(__le16 *)ptr;
  497. ptr += 2;
  498. cb->src = *(__le16 *)ptr;
  499. ptr += 2;
  500. cb->hops = *ptr & 0x3f;
  501. return NF_HOOK(NFPROTO_DECNET, NF_DN_PRE_ROUTING,
  502. &init_net, NULL, skb, skb->dev, NULL,
  503. dn_route_rx_packet);
  504. drop_it:
  505. kfree_skb(skb);
  506. return NET_RX_DROP;
  507. }
  508. static int dn_route_discard(struct net *net, struct sock *sk, struct sk_buff *skb)
  509. {
  510. /*
  511. * I know we drop the packet here, but thats considered success in
  512. * this case
  513. */
  514. kfree_skb(skb);
  515. return NET_RX_SUCCESS;
  516. }
  517. static int dn_route_ptp_hello(struct net *net, struct sock *sk, struct sk_buff *skb)
  518. {
  519. dn_dev_hello(skb);
  520. dn_neigh_pointopoint_hello(skb);
  521. return NET_RX_SUCCESS;
  522. }
  523. int dn_route_rcv(struct sk_buff *skb, struct net_device *dev, struct packet_type *pt, struct net_device *orig_dev)
  524. {
  525. struct dn_skb_cb *cb;
  526. unsigned char flags = 0;
  527. __u16 len = le16_to_cpu(*(__le16 *)skb->data);
  528. struct dn_dev *dn = rcu_dereference(dev->dn_ptr);
  529. unsigned char padlen = 0;
  530. if (!net_eq(dev_net(dev), &init_net))
  531. goto dump_it;
  532. if (dn == NULL)
  533. goto dump_it;
  534. if ((skb = skb_share_check(skb, GFP_ATOMIC)) == NULL)
  535. goto out;
  536. if (!pskb_may_pull(skb, 3))
  537. goto dump_it;
  538. skb_pull(skb, 2);
  539. if (len > skb->len)
  540. goto dump_it;
  541. skb_trim(skb, len);
  542. flags = *skb->data;
  543. cb = DN_SKB_CB(skb);
  544. cb->stamp = jiffies;
  545. cb->iif = dev->ifindex;
  546. /*
  547. * If we have padding, remove it.
  548. */
  549. if (flags & DN_RT_F_PF) {
  550. padlen = flags & ~DN_RT_F_PF;
  551. if (!pskb_may_pull(skb, padlen + 1))
  552. goto dump_it;
  553. skb_pull(skb, padlen);
  554. flags = *skb->data;
  555. }
  556. skb_reset_network_header(skb);
  557. /*
  558. * Weed out future version DECnet
  559. */
  560. if (flags & DN_RT_F_VER)
  561. goto dump_it;
  562. cb->rt_flags = flags;
  563. if (decnet_debug_level & 1)
  564. printk(KERN_DEBUG
  565. "dn_route_rcv: got 0x%02x from %s [%d %d %d]\n",
  566. (int)flags, (dev) ? dev->name : "???", len, skb->len,
  567. padlen);
  568. if (flags & DN_RT_PKT_CNTL) {
  569. if (unlikely(skb_linearize(skb)))
  570. goto dump_it;
  571. switch (flags & DN_RT_CNTL_MSK) {
  572. case DN_RT_PKT_INIT:
  573. dn_dev_init_pkt(skb);
  574. break;
  575. case DN_RT_PKT_VERI:
  576. dn_dev_veri_pkt(skb);
  577. break;
  578. }
  579. if (dn->parms.state != DN_DEV_S_RU)
  580. goto dump_it;
  581. switch (flags & DN_RT_CNTL_MSK) {
  582. case DN_RT_PKT_HELO:
  583. return NF_HOOK(NFPROTO_DECNET, NF_DN_HELLO,
  584. &init_net, NULL, skb, skb->dev, NULL,
  585. dn_route_ptp_hello);
  586. case DN_RT_PKT_L1RT:
  587. case DN_RT_PKT_L2RT:
  588. return NF_HOOK(NFPROTO_DECNET, NF_DN_ROUTE,
  589. &init_net, NULL, skb, skb->dev, NULL,
  590. dn_route_discard);
  591. case DN_RT_PKT_ERTH:
  592. return NF_HOOK(NFPROTO_DECNET, NF_DN_HELLO,
  593. &init_net, NULL, skb, skb->dev, NULL,
  594. dn_neigh_router_hello);
  595. case DN_RT_PKT_EEDH:
  596. return NF_HOOK(NFPROTO_DECNET, NF_DN_HELLO,
  597. &init_net, NULL, skb, skb->dev, NULL,
  598. dn_neigh_endnode_hello);
  599. }
  600. } else {
  601. if (dn->parms.state != DN_DEV_S_RU)
  602. goto dump_it;
  603. skb_pull(skb, 1); /* Pull flags */
  604. switch (flags & DN_RT_PKT_MSK) {
  605. case DN_RT_PKT_LONG:
  606. return dn_route_rx_long(skb);
  607. case DN_RT_PKT_SHORT:
  608. return dn_route_rx_short(skb);
  609. }
  610. }
  611. dump_it:
  612. kfree_skb(skb);
  613. out:
  614. return NET_RX_DROP;
  615. }
  616. static int dn_output(struct net *net, struct sock *sk, struct sk_buff *skb)
  617. {
  618. struct dst_entry *dst = skb_dst(skb);
  619. struct dn_route *rt = (struct dn_route *)dst;
  620. struct net_device *dev = dst->dev;
  621. struct dn_skb_cb *cb = DN_SKB_CB(skb);
  622. int err = -EINVAL;
  623. if (rt->n == NULL)
  624. goto error;
  625. skb->dev = dev;
  626. cb->src = rt->rt_saddr;
  627. cb->dst = rt->rt_daddr;
  628. /*
  629. * Always set the Intra-Ethernet bit on all outgoing packets
  630. * originated on this node. Only valid flag from upper layers
  631. * is return-to-sender-requested. Set hop count to 0 too.
  632. */
  633. cb->rt_flags &= ~DN_RT_F_RQR;
  634. cb->rt_flags |= DN_RT_F_IE;
  635. cb->hops = 0;
  636. return NF_HOOK(NFPROTO_DECNET, NF_DN_LOCAL_OUT,
  637. &init_net, sk, skb, NULL, dev,
  638. dn_to_neigh_output);
  639. error:
  640. net_dbg_ratelimited("dn_output: This should not happen\n");
  641. kfree_skb(skb);
  642. return err;
  643. }
  644. static int dn_forward(struct sk_buff *skb)
  645. {
  646. struct dn_skb_cb *cb = DN_SKB_CB(skb);
  647. struct dst_entry *dst = skb_dst(skb);
  648. struct dn_dev *dn_db = rcu_dereference(dst->dev->dn_ptr);
  649. struct dn_route *rt;
  650. int header_len;
  651. struct net_device *dev = skb->dev;
  652. if (skb->pkt_type != PACKET_HOST)
  653. goto drop;
  654. /* Ensure that we have enough space for headers */
  655. rt = (struct dn_route *)skb_dst(skb);
  656. header_len = dn_db->use_long ? 21 : 6;
  657. if (skb_cow(skb, LL_RESERVED_SPACE(rt->dst.dev)+header_len))
  658. goto drop;
  659. /*
  660. * Hop count exceeded.
  661. */
  662. if (++cb->hops > 30)
  663. goto drop;
  664. skb->dev = rt->dst.dev;
  665. /*
  666. * If packet goes out same interface it came in on, then set
  667. * the Intra-Ethernet bit. This has no effect for short
  668. * packets, so we don't need to test for them here.
  669. */
  670. cb->rt_flags &= ~DN_RT_F_IE;
  671. if (rt->rt_flags & RTCF_DOREDIRECT)
  672. cb->rt_flags |= DN_RT_F_IE;
  673. return NF_HOOK(NFPROTO_DECNET, NF_DN_FORWARD,
  674. &init_net, NULL, skb, dev, skb->dev,
  675. dn_to_neigh_output);
  676. drop:
  677. kfree_skb(skb);
  678. return NET_RX_DROP;
  679. }
  680. /*
  681. * Used to catch bugs. This should never normally get
  682. * called.
  683. */
  684. static int dn_rt_bug_out(struct net *net, struct sock *sk, struct sk_buff *skb)
  685. {
  686. struct dn_skb_cb *cb = DN_SKB_CB(skb);
  687. net_dbg_ratelimited("dn_rt_bug: skb from:%04x to:%04x\n",
  688. le16_to_cpu(cb->src), le16_to_cpu(cb->dst));
  689. kfree_skb(skb);
  690. return NET_RX_DROP;
  691. }
  692. static int dn_rt_bug(struct sk_buff *skb)
  693. {
  694. struct dn_skb_cb *cb = DN_SKB_CB(skb);
  695. net_dbg_ratelimited("dn_rt_bug: skb from:%04x to:%04x\n",
  696. le16_to_cpu(cb->src), le16_to_cpu(cb->dst));
  697. kfree_skb(skb);
  698. return NET_RX_DROP;
  699. }
  700. static unsigned int dn_dst_default_advmss(const struct dst_entry *dst)
  701. {
  702. return dn_mss_from_pmtu(dst->dev, dst_mtu(dst));
  703. }
  704. static unsigned int dn_dst_mtu(const struct dst_entry *dst)
  705. {
  706. unsigned int mtu = dst_metric_raw(dst, RTAX_MTU);
  707. return mtu ? : dst->dev->mtu;
  708. }
  709. static struct neighbour *dn_dst_neigh_lookup(const struct dst_entry *dst,
  710. struct sk_buff *skb,
  711. const void *daddr)
  712. {
  713. return __neigh_lookup_errno(&dn_neigh_table, daddr, dst->dev);
  714. }
  715. static int dn_rt_set_next_hop(struct dn_route *rt, struct dn_fib_res *res)
  716. {
  717. struct dn_fib_info *fi = res->fi;
  718. struct net_device *dev = rt->dst.dev;
  719. unsigned int mss_metric;
  720. struct neighbour *n;
  721. if (fi) {
  722. if (DN_FIB_RES_GW(*res) &&
  723. DN_FIB_RES_NH(*res).nh_scope == RT_SCOPE_LINK)
  724. rt->rt_gateway = DN_FIB_RES_GW(*res);
  725. dst_init_metrics(&rt->dst, fi->fib_metrics, true);
  726. }
  727. rt->rt_type = res->type;
  728. if (dev != NULL && rt->n == NULL) {
  729. n = __neigh_lookup_errno(&dn_neigh_table, &rt->rt_gateway, dev);
  730. if (IS_ERR(n))
  731. return PTR_ERR(n);
  732. rt->n = n;
  733. }
  734. if (dst_metric(&rt->dst, RTAX_MTU) > rt->dst.dev->mtu)
  735. dst_metric_set(&rt->dst, RTAX_MTU, rt->dst.dev->mtu);
  736. mss_metric = dst_metric_raw(&rt->dst, RTAX_ADVMSS);
  737. if (mss_metric) {
  738. unsigned int mss = dn_mss_from_pmtu(dev, dst_mtu(&rt->dst));
  739. if (mss_metric > mss)
  740. dst_metric_set(&rt->dst, RTAX_ADVMSS, mss);
  741. }
  742. return 0;
  743. }
  744. static inline int dn_match_addr(__le16 addr1, __le16 addr2)
  745. {
  746. __u16 tmp = le16_to_cpu(addr1) ^ le16_to_cpu(addr2);
  747. int match = 16;
  748. while(tmp) {
  749. tmp >>= 1;
  750. match--;
  751. }
  752. return match;
  753. }
  754. static __le16 dnet_select_source(const struct net_device *dev, __le16 daddr, int scope)
  755. {
  756. __le16 saddr = 0;
  757. struct dn_dev *dn_db;
  758. struct dn_ifaddr *ifa;
  759. int best_match = 0;
  760. int ret;
  761. rcu_read_lock();
  762. dn_db = rcu_dereference(dev->dn_ptr);
  763. for (ifa = rcu_dereference(dn_db->ifa_list);
  764. ifa != NULL;
  765. ifa = rcu_dereference(ifa->ifa_next)) {
  766. if (ifa->ifa_scope > scope)
  767. continue;
  768. if (!daddr) {
  769. saddr = ifa->ifa_local;
  770. break;
  771. }
  772. ret = dn_match_addr(daddr, ifa->ifa_local);
  773. if (ret > best_match)
  774. saddr = ifa->ifa_local;
  775. if (best_match == 0)
  776. saddr = ifa->ifa_local;
  777. }
  778. rcu_read_unlock();
  779. return saddr;
  780. }
  781. static inline __le16 __dn_fib_res_prefsrc(struct dn_fib_res *res)
  782. {
  783. return dnet_select_source(DN_FIB_RES_DEV(*res), DN_FIB_RES_GW(*res), res->scope);
  784. }
  785. static inline __le16 dn_fib_rules_map_destination(__le16 daddr, struct dn_fib_res *res)
  786. {
  787. __le16 mask = dnet_make_mask(res->prefixlen);
  788. return (daddr&~mask)|res->fi->fib_nh->nh_gw;
  789. }
  790. static int dn_route_output_slow(struct dst_entry **pprt, const struct flowidn *oldflp, int try_hard)
  791. {
  792. struct flowidn fld = {
  793. .daddr = oldflp->daddr,
  794. .saddr = oldflp->saddr,
  795. .flowidn_scope = RT_SCOPE_UNIVERSE,
  796. .flowidn_mark = oldflp->flowidn_mark,
  797. .flowidn_iif = LOOPBACK_IFINDEX,
  798. .flowidn_oif = oldflp->flowidn_oif,
  799. };
  800. struct dn_route *rt = NULL;
  801. struct net_device *dev_out = NULL, *dev;
  802. struct neighbour *neigh = NULL;
  803. unsigned int hash;
  804. unsigned int flags = 0;
  805. struct dn_fib_res res = { .fi = NULL, .type = RTN_UNICAST };
  806. int err;
  807. int free_res = 0;
  808. __le16 gateway = 0;
  809. if (decnet_debug_level & 16)
  810. printk(KERN_DEBUG
  811. "dn_route_output_slow: dst=%04x src=%04x mark=%d"
  812. " iif=%d oif=%d\n", le16_to_cpu(oldflp->daddr),
  813. le16_to_cpu(oldflp->saddr),
  814. oldflp->flowidn_mark, LOOPBACK_IFINDEX,
  815. oldflp->flowidn_oif);
  816. /* If we have an output interface, verify its a DECnet device */
  817. if (oldflp->flowidn_oif) {
  818. dev_out = dev_get_by_index(&init_net, oldflp->flowidn_oif);
  819. err = -ENODEV;
  820. if (dev_out && dev_out->dn_ptr == NULL) {
  821. dev_put(dev_out);
  822. dev_out = NULL;
  823. }
  824. if (dev_out == NULL)
  825. goto out;
  826. }
  827. /* If we have a source address, verify that its a local address */
  828. if (oldflp->saddr) {
  829. err = -EADDRNOTAVAIL;
  830. if (dev_out) {
  831. if (dn_dev_islocal(dev_out, oldflp->saddr))
  832. goto source_ok;
  833. dev_put(dev_out);
  834. goto out;
  835. }
  836. rcu_read_lock();
  837. for_each_netdev_rcu(&init_net, dev) {
  838. if (!dev->dn_ptr)
  839. continue;
  840. if (!dn_dev_islocal(dev, oldflp->saddr))
  841. continue;
  842. if ((dev->flags & IFF_LOOPBACK) &&
  843. oldflp->daddr &&
  844. !dn_dev_islocal(dev, oldflp->daddr))
  845. continue;
  846. dev_out = dev;
  847. break;
  848. }
  849. rcu_read_unlock();
  850. if (dev_out == NULL)
  851. goto out;
  852. dev_hold(dev_out);
  853. source_ok:
  854. ;
  855. }
  856. /* No destination? Assume its local */
  857. if (!fld.daddr) {
  858. fld.daddr = fld.saddr;
  859. if (dev_out)
  860. dev_put(dev_out);
  861. err = -EINVAL;
  862. dev_out = init_net.loopback_dev;
  863. if (!dev_out->dn_ptr)
  864. goto out;
  865. err = -EADDRNOTAVAIL;
  866. dev_hold(dev_out);
  867. if (!fld.daddr) {
  868. fld.daddr =
  869. fld.saddr = dnet_select_source(dev_out, 0,
  870. RT_SCOPE_HOST);
  871. if (!fld.daddr)
  872. goto out;
  873. }
  874. fld.flowidn_oif = LOOPBACK_IFINDEX;
  875. res.type = RTN_LOCAL;
  876. goto make_route;
  877. }
  878. if (decnet_debug_level & 16)
  879. printk(KERN_DEBUG
  880. "dn_route_output_slow: initial checks complete."
  881. " dst=%04x src=%04x oif=%d try_hard=%d\n",
  882. le16_to_cpu(fld.daddr), le16_to_cpu(fld.saddr),
  883. fld.flowidn_oif, try_hard);
  884. /*
  885. * N.B. If the kernel is compiled without router support then
  886. * dn_fib_lookup() will evaluate to non-zero so this if () block
  887. * will always be executed.
  888. */
  889. err = -ESRCH;
  890. if (try_hard || (err = dn_fib_lookup(&fld, &res)) != 0) {
  891. struct dn_dev *dn_db;
  892. if (err != -ESRCH)
  893. goto out;
  894. /*
  895. * Here the fallback is basically the standard algorithm for
  896. * routing in endnodes which is described in the DECnet routing
  897. * docs
  898. *
  899. * If we are not trying hard, look in neighbour cache.
  900. * The result is tested to ensure that if a specific output
  901. * device/source address was requested, then we honour that
  902. * here
  903. */
  904. if (!try_hard) {
  905. neigh = neigh_lookup_nodev(&dn_neigh_table, &init_net, &fld.daddr);
  906. if (neigh) {
  907. if ((oldflp->flowidn_oif &&
  908. (neigh->dev->ifindex != oldflp->flowidn_oif)) ||
  909. (oldflp->saddr &&
  910. (!dn_dev_islocal(neigh->dev,
  911. oldflp->saddr)))) {
  912. neigh_release(neigh);
  913. neigh = NULL;
  914. } else {
  915. if (dev_out)
  916. dev_put(dev_out);
  917. if (dn_dev_islocal(neigh->dev, fld.daddr)) {
  918. dev_out = init_net.loopback_dev;
  919. res.type = RTN_LOCAL;
  920. } else {
  921. dev_out = neigh->dev;
  922. }
  923. dev_hold(dev_out);
  924. goto select_source;
  925. }
  926. }
  927. }
  928. /* Not there? Perhaps its a local address */
  929. if (dev_out == NULL)
  930. dev_out = dn_dev_get_default();
  931. err = -ENODEV;
  932. if (dev_out == NULL)
  933. goto out;
  934. dn_db = rcu_dereference_raw(dev_out->dn_ptr);
  935. if (!dn_db)
  936. goto e_inval;
  937. /* Possible improvement - check all devices for local addr */
  938. if (dn_dev_islocal(dev_out, fld.daddr)) {
  939. dev_put(dev_out);
  940. dev_out = init_net.loopback_dev;
  941. dev_hold(dev_out);
  942. res.type = RTN_LOCAL;
  943. goto select_source;
  944. }
  945. /* Not local either.... try sending it to the default router */
  946. neigh = neigh_clone(dn_db->router);
  947. BUG_ON(neigh && neigh->dev != dev_out);
  948. /* Ok then, we assume its directly connected and move on */
  949. select_source:
  950. if (neigh)
  951. gateway = ((struct dn_neigh *)neigh)->addr;
  952. if (gateway == 0)
  953. gateway = fld.daddr;
  954. if (fld.saddr == 0) {
  955. fld.saddr = dnet_select_source(dev_out, gateway,
  956. res.type == RTN_LOCAL ?
  957. RT_SCOPE_HOST :
  958. RT_SCOPE_LINK);
  959. if (fld.saddr == 0 && res.type != RTN_LOCAL)
  960. goto e_addr;
  961. }
  962. fld.flowidn_oif = dev_out->ifindex;
  963. goto make_route;
  964. }
  965. free_res = 1;
  966. if (res.type == RTN_NAT)
  967. goto e_inval;
  968. if (res.type == RTN_LOCAL) {
  969. if (!fld.saddr)
  970. fld.saddr = fld.daddr;
  971. if (dev_out)
  972. dev_put(dev_out);
  973. dev_out = init_net.loopback_dev;
  974. dev_hold(dev_out);
  975. if (!dev_out->dn_ptr)
  976. goto e_inval;
  977. fld.flowidn_oif = dev_out->ifindex;
  978. if (res.fi)
  979. dn_fib_info_put(res.fi);
  980. res.fi = NULL;
  981. goto make_route;
  982. }
  983. if (res.fi->fib_nhs > 1 && fld.flowidn_oif == 0)
  984. dn_fib_select_multipath(&fld, &res);
  985. /*
  986. * We could add some logic to deal with default routes here and
  987. * get rid of some of the special casing above.
  988. */
  989. if (!fld.saddr)
  990. fld.saddr = DN_FIB_RES_PREFSRC(res);
  991. if (dev_out)
  992. dev_put(dev_out);
  993. dev_out = DN_FIB_RES_DEV(res);
  994. dev_hold(dev_out);
  995. fld.flowidn_oif = dev_out->ifindex;
  996. gateway = DN_FIB_RES_GW(res);
  997. make_route:
  998. if (dev_out->flags & IFF_LOOPBACK)
  999. flags |= RTCF_LOCAL;
  1000. rt = dst_alloc(&dn_dst_ops, dev_out, 0, DST_OBSOLETE_NONE, DST_HOST);
  1001. if (rt == NULL)
  1002. goto e_nobufs;
  1003. memset(&rt->fld, 0, sizeof(rt->fld));
  1004. rt->fld.saddr = oldflp->saddr;
  1005. rt->fld.daddr = oldflp->daddr;
  1006. rt->fld.flowidn_oif = oldflp->flowidn_oif;
  1007. rt->fld.flowidn_iif = 0;
  1008. rt->fld.flowidn_mark = oldflp->flowidn_mark;
  1009. rt->rt_saddr = fld.saddr;
  1010. rt->rt_daddr = fld.daddr;
  1011. rt->rt_gateway = gateway ? gateway : fld.daddr;
  1012. rt->rt_local_src = fld.saddr;
  1013. rt->rt_dst_map = fld.daddr;
  1014. rt->rt_src_map = fld.saddr;
  1015. rt->n = neigh;
  1016. neigh = NULL;
  1017. rt->dst.lastuse = jiffies;
  1018. rt->dst.output = dn_output;
  1019. rt->dst.input = dn_rt_bug;
  1020. rt->rt_flags = flags;
  1021. if (flags & RTCF_LOCAL)
  1022. rt->dst.input = dn_nsp_rx;
  1023. err = dn_rt_set_next_hop(rt, &res);
  1024. if (err)
  1025. goto e_neighbour;
  1026. hash = dn_hash(rt->fld.saddr, rt->fld.daddr);
  1027. dn_insert_route(rt, hash, (struct dn_route **)pprt);
  1028. done:
  1029. if (neigh)
  1030. neigh_release(neigh);
  1031. if (free_res)
  1032. dn_fib_res_put(&res);
  1033. if (dev_out)
  1034. dev_put(dev_out);
  1035. out:
  1036. return err;
  1037. e_addr:
  1038. err = -EADDRNOTAVAIL;
  1039. goto done;
  1040. e_inval:
  1041. err = -EINVAL;
  1042. goto done;
  1043. e_nobufs:
  1044. err = -ENOBUFS;
  1045. goto done;
  1046. e_neighbour:
  1047. dst_free(&rt->dst);
  1048. goto e_nobufs;
  1049. }
  1050. /*
  1051. * N.B. The flags may be moved into the flowi at some future stage.
  1052. */
  1053. static int __dn_route_output_key(struct dst_entry **pprt, const struct flowidn *flp, int flags)
  1054. {
  1055. unsigned int hash = dn_hash(flp->saddr, flp->daddr);
  1056. struct dn_route *rt = NULL;
  1057. if (!(flags & MSG_TRYHARD)) {
  1058. rcu_read_lock_bh();
  1059. for (rt = rcu_dereference_bh(dn_rt_hash_table[hash].chain); rt;
  1060. rt = rcu_dereference_bh(rt->dst.dn_next)) {
  1061. if ((flp->daddr == rt->fld.daddr) &&
  1062. (flp->saddr == rt->fld.saddr) &&
  1063. (flp->flowidn_mark == rt->fld.flowidn_mark) &&
  1064. dn_is_output_route(rt) &&
  1065. (rt->fld.flowidn_oif == flp->flowidn_oif)) {
  1066. dst_use(&rt->dst, jiffies);
  1067. rcu_read_unlock_bh();
  1068. *pprt = &rt->dst;
  1069. return 0;
  1070. }
  1071. }
  1072. rcu_read_unlock_bh();
  1073. }
  1074. return dn_route_output_slow(pprt, flp, flags);
  1075. }
  1076. static int dn_route_output_key(struct dst_entry **pprt, struct flowidn *flp, int flags)
  1077. {
  1078. int err;
  1079. err = __dn_route_output_key(pprt, flp, flags);
  1080. if (err == 0 && flp->flowidn_proto) {
  1081. *pprt = xfrm_lookup(&init_net, *pprt,
  1082. flowidn_to_flowi(flp), NULL, 0);
  1083. if (IS_ERR(*pprt)) {
  1084. err = PTR_ERR(*pprt);
  1085. *pprt = NULL;
  1086. }
  1087. }
  1088. return err;
  1089. }
  1090. int dn_route_output_sock(struct dst_entry __rcu **pprt, struct flowidn *fl, struct sock *sk, int flags)
  1091. {
  1092. int err;
  1093. err = __dn_route_output_key(pprt, fl, flags & MSG_TRYHARD);
  1094. if (err == 0 && fl->flowidn_proto) {
  1095. *pprt = xfrm_lookup(&init_net, *pprt,
  1096. flowidn_to_flowi(fl), sk, 0);
  1097. if (IS_ERR(*pprt)) {
  1098. err = PTR_ERR(*pprt);
  1099. *pprt = NULL;
  1100. }
  1101. }
  1102. return err;
  1103. }
  1104. static int dn_route_input_slow(struct sk_buff *skb)
  1105. {
  1106. struct dn_route *rt = NULL;
  1107. struct dn_skb_cb *cb = DN_SKB_CB(skb);
  1108. struct net_device *in_dev = skb->dev;
  1109. struct net_device *out_dev = NULL;
  1110. struct dn_dev *dn_db;
  1111. struct neighbour *neigh = NULL;
  1112. unsigned int hash;
  1113. int flags = 0;
  1114. __le16 gateway = 0;
  1115. __le16 local_src = 0;
  1116. struct flowidn fld = {
  1117. .daddr = cb->dst,
  1118. .saddr = cb->src,
  1119. .flowidn_scope = RT_SCOPE_UNIVERSE,
  1120. .flowidn_mark = skb->mark,
  1121. .flowidn_iif = skb->dev->ifindex,
  1122. };
  1123. struct dn_fib_res res = { .fi = NULL, .type = RTN_UNREACHABLE };
  1124. int err = -EINVAL;
  1125. int free_res = 0;
  1126. dev_hold(in_dev);
  1127. if ((dn_db = rcu_dereference(in_dev->dn_ptr)) == NULL)
  1128. goto out;
  1129. /* Zero source addresses are not allowed */
  1130. if (fld.saddr == 0)
  1131. goto out;
  1132. /*
  1133. * In this case we've just received a packet from a source
  1134. * outside ourselves pretending to come from us. We don't
  1135. * allow it any further to prevent routing loops, spoofing and
  1136. * other nasties. Loopback packets already have the dst attached
  1137. * so this only affects packets which have originated elsewhere.
  1138. */
  1139. err = -ENOTUNIQ;
  1140. if (dn_dev_islocal(in_dev, cb->src))
  1141. goto out;
  1142. err = dn_fib_lookup(&fld, &res);
  1143. if (err) {
  1144. if (err != -ESRCH)
  1145. goto out;
  1146. /*
  1147. * Is the destination us ?
  1148. */
  1149. if (!dn_dev_islocal(in_dev, cb->dst))
  1150. goto e_inval;
  1151. res.type = RTN_LOCAL;
  1152. } else {
  1153. __le16 src_map = fld.saddr;
  1154. free_res = 1;
  1155. out_dev = DN_FIB_RES_DEV(res);
  1156. if (out_dev == NULL) {
  1157. net_crit_ratelimited("Bug in dn_route_input_slow() No output device\n");
  1158. goto e_inval;
  1159. }
  1160. dev_hold(out_dev);
  1161. if (res.r)
  1162. src_map = fld.saddr; /* no NAT support for now */
  1163. gateway = DN_FIB_RES_GW(res);
  1164. if (res.type == RTN_NAT) {
  1165. fld.daddr = dn_fib_rules_map_destination(fld.daddr, &res);
  1166. dn_fib_res_put(&res);
  1167. free_res = 0;
  1168. if (dn_fib_lookup(&fld, &res))
  1169. goto e_inval;
  1170. free_res = 1;
  1171. if (res.type != RTN_UNICAST)
  1172. goto e_inval;
  1173. flags |= RTCF_DNAT;
  1174. gateway = fld.daddr;
  1175. }
  1176. fld.saddr = src_map;
  1177. }
  1178. switch(res.type) {
  1179. case RTN_UNICAST:
  1180. /*
  1181. * Forwarding check here, we only check for forwarding
  1182. * being turned off, if you want to only forward intra
  1183. * area, its up to you to set the routing tables up
  1184. * correctly.
  1185. */
  1186. if (dn_db->parms.forwarding == 0)
  1187. goto e_inval;
  1188. if (res.fi->fib_nhs > 1 && fld.flowidn_oif == 0)
  1189. dn_fib_select_multipath(&fld, &res);
  1190. /*
  1191. * Check for out_dev == in_dev. We use the RTCF_DOREDIRECT
  1192. * flag as a hint to set the intra-ethernet bit when
  1193. * forwarding. If we've got NAT in operation, we don't do
  1194. * this optimisation.
  1195. */
  1196. if (out_dev == in_dev && !(flags & RTCF_NAT))
  1197. flags |= RTCF_DOREDIRECT;
  1198. local_src = DN_FIB_RES_PREFSRC(res);
  1199. case RTN_BLACKHOLE:
  1200. case RTN_UNREACHABLE:
  1201. break;
  1202. case RTN_LOCAL:
  1203. flags |= RTCF_LOCAL;
  1204. fld.saddr = cb->dst;
  1205. fld.daddr = cb->src;
  1206. /* Routing tables gave us a gateway */
  1207. if (gateway)
  1208. goto make_route;
  1209. /* Packet was intra-ethernet, so we know its on-link */
  1210. if (cb->rt_flags & DN_RT_F_IE) {
  1211. gateway = cb->src;
  1212. goto make_route;
  1213. }
  1214. /* Use the default router if there is one */
  1215. neigh = neigh_clone(dn_db->router);
  1216. if (neigh) {
  1217. gateway = ((struct dn_neigh *)neigh)->addr;
  1218. goto make_route;
  1219. }
  1220. /* Close eyes and pray */
  1221. gateway = cb->src;
  1222. goto make_route;
  1223. default:
  1224. goto e_inval;
  1225. }
  1226. make_route:
  1227. rt = dst_alloc(&dn_dst_ops, out_dev, 0, DST_OBSOLETE_NONE, DST_HOST);
  1228. if (rt == NULL)
  1229. goto e_nobufs;
  1230. memset(&rt->fld, 0, sizeof(rt->fld));
  1231. rt->rt_saddr = fld.saddr;
  1232. rt->rt_daddr = fld.daddr;
  1233. rt->rt_gateway = fld.daddr;
  1234. if (gateway)
  1235. rt->rt_gateway = gateway;
  1236. rt->rt_local_src = local_src ? local_src : rt->rt_saddr;
  1237. rt->rt_dst_map = fld.daddr;
  1238. rt->rt_src_map = fld.saddr;
  1239. rt->fld.saddr = cb->src;
  1240. rt->fld.daddr = cb->dst;
  1241. rt->fld.flowidn_oif = 0;
  1242. rt->fld.flowidn_iif = in_dev->ifindex;
  1243. rt->fld.flowidn_mark = fld.flowidn_mark;
  1244. rt->n = neigh;
  1245. rt->dst.lastuse = jiffies;
  1246. rt->dst.output = dn_rt_bug_out;
  1247. switch (res.type) {
  1248. case RTN_UNICAST:
  1249. rt->dst.input = dn_forward;
  1250. break;
  1251. case RTN_LOCAL:
  1252. rt->dst.output = dn_output;
  1253. rt->dst.input = dn_nsp_rx;
  1254. rt->dst.dev = in_dev;
  1255. flags |= RTCF_LOCAL;
  1256. break;
  1257. default:
  1258. case RTN_UNREACHABLE:
  1259. case RTN_BLACKHOLE:
  1260. rt->dst.input = dst_discard;
  1261. }
  1262. rt->rt_flags = flags;
  1263. err = dn_rt_set_next_hop(rt, &res);
  1264. if (err)
  1265. goto e_neighbour;
  1266. hash = dn_hash(rt->fld.saddr, rt->fld.daddr);
  1267. dn_insert_route(rt, hash, &rt);
  1268. skb_dst_set(skb, &rt->dst);
  1269. done:
  1270. if (neigh)
  1271. neigh_release(neigh);
  1272. if (free_res)
  1273. dn_fib_res_put(&res);
  1274. dev_put(in_dev);
  1275. if (out_dev)
  1276. dev_put(out_dev);
  1277. out:
  1278. return err;
  1279. e_inval:
  1280. err = -EINVAL;
  1281. goto done;
  1282. e_nobufs:
  1283. err = -ENOBUFS;
  1284. goto done;
  1285. e_neighbour:
  1286. dst_free(&rt->dst);
  1287. goto done;
  1288. }
  1289. static int dn_route_input(struct sk_buff *skb)
  1290. {
  1291. struct dn_route *rt;
  1292. struct dn_skb_cb *cb = DN_SKB_CB(skb);
  1293. unsigned int hash = dn_hash(cb->src, cb->dst);
  1294. if (skb_dst(skb))
  1295. return 0;
  1296. rcu_read_lock();
  1297. for(rt = rcu_dereference(dn_rt_hash_table[hash].chain); rt != NULL;
  1298. rt = rcu_dereference(rt->dst.dn_next)) {
  1299. if ((rt->fld.saddr == cb->src) &&
  1300. (rt->fld.daddr == cb->dst) &&
  1301. (rt->fld.flowidn_oif == 0) &&
  1302. (rt->fld.flowidn_mark == skb->mark) &&
  1303. (rt->fld.flowidn_iif == cb->iif)) {
  1304. dst_use(&rt->dst, jiffies);
  1305. rcu_read_unlock();
  1306. skb_dst_set(skb, (struct dst_entry *)rt);
  1307. return 0;
  1308. }
  1309. }
  1310. rcu_read_unlock();
  1311. return dn_route_input_slow(skb);
  1312. }
  1313. static int dn_rt_fill_info(struct sk_buff *skb, u32 portid, u32 seq,
  1314. int event, int nowait, unsigned int flags)
  1315. {
  1316. struct dn_route *rt = (struct dn_route *)skb_dst(skb);
  1317. struct rtmsg *r;
  1318. struct nlmsghdr *nlh;
  1319. long expires;
  1320. nlh = nlmsg_put(skb, portid, seq, event, sizeof(*r), flags);
  1321. if (!nlh)
  1322. return -EMSGSIZE;
  1323. r = nlmsg_data(nlh);
  1324. r->rtm_family = AF_DECnet;
  1325. r->rtm_dst_len = 16;
  1326. r->rtm_src_len = 0;
  1327. r->rtm_tos = 0;
  1328. r->rtm_table = RT_TABLE_MAIN;
  1329. r->rtm_type = rt->rt_type;
  1330. r->rtm_flags = (rt->rt_flags & ~0xFFFF) | RTM_F_CLONED;
  1331. r->rtm_scope = RT_SCOPE_UNIVERSE;
  1332. r->rtm_protocol = RTPROT_UNSPEC;
  1333. if (rt->rt_flags & RTCF_NOTIFY)
  1334. r->rtm_flags |= RTM_F_NOTIFY;
  1335. if (nla_put_u32(skb, RTA_TABLE, RT_TABLE_MAIN) < 0 ||
  1336. nla_put_le16(skb, RTA_DST, rt->rt_daddr) < 0)
  1337. goto errout;
  1338. if (rt->fld.saddr) {
  1339. r->rtm_src_len = 16;
  1340. if (nla_put_le16(skb, RTA_SRC, rt->fld.saddr) < 0)
  1341. goto errout;
  1342. }
  1343. if (rt->dst.dev &&
  1344. nla_put_u32(skb, RTA_OIF, rt->dst.dev->ifindex) < 0)
  1345. goto errout;
  1346. /*
  1347. * Note to self - change this if input routes reverse direction when
  1348. * they deal only with inputs and not with replies like they do
  1349. * currently.
  1350. */
  1351. if (nla_put_le16(skb, RTA_PREFSRC, rt->rt_local_src) < 0)
  1352. goto errout;
  1353. if (rt->rt_daddr != rt->rt_gateway &&
  1354. nla_put_le16(skb, RTA_GATEWAY, rt->rt_gateway) < 0)
  1355. goto errout;
  1356. if (rtnetlink_put_metrics(skb, dst_metrics_ptr(&rt->dst)) < 0)
  1357. goto errout;
  1358. expires = rt->dst.expires ? rt->dst.expires - jiffies : 0;
  1359. if (rtnl_put_cacheinfo(skb, &rt->dst, 0, expires,
  1360. rt->dst.error) < 0)
  1361. goto errout;
  1362. if (dn_is_input_route(rt) &&
  1363. nla_put_u32(skb, RTA_IIF, rt->fld.flowidn_iif) < 0)
  1364. goto errout;
  1365. nlmsg_end(skb, nlh);
  1366. return 0;
  1367. errout:
  1368. nlmsg_cancel(skb, nlh);
  1369. return -EMSGSIZE;
  1370. }
  1371. const struct nla_policy rtm_dn_policy[RTA_MAX + 1] = {
  1372. [RTA_DST] = { .type = NLA_U16 },
  1373. [RTA_SRC] = { .type = NLA_U16 },
  1374. [RTA_IIF] = { .type = NLA_U32 },
  1375. [RTA_OIF] = { .type = NLA_U32 },
  1376. [RTA_GATEWAY] = { .type = NLA_U16 },
  1377. [RTA_PRIORITY] = { .type = NLA_U32 },
  1378. [RTA_PREFSRC] = { .type = NLA_U16 },
  1379. [RTA_METRICS] = { .type = NLA_NESTED },
  1380. [RTA_MULTIPATH] = { .type = NLA_NESTED },
  1381. [RTA_TABLE] = { .type = NLA_U32 },
  1382. [RTA_MARK] = { .type = NLA_U32 },
  1383. };
  1384. /*
  1385. * This is called by both endnodes and routers now.
  1386. */
  1387. static int dn_cache_getroute(struct sk_buff *in_skb, struct nlmsghdr *nlh)
  1388. {
  1389. struct net *net = sock_net(in_skb->sk);
  1390. struct rtmsg *rtm = nlmsg_data(nlh);
  1391. struct dn_route *rt = NULL;
  1392. struct dn_skb_cb *cb;
  1393. int err;
  1394. struct sk_buff *skb;
  1395. struct flowidn fld;
  1396. struct nlattr *tb[RTA_MAX+1];
  1397. if (!net_eq(net, &init_net))
  1398. return -EINVAL;
  1399. err = nlmsg_parse(nlh, sizeof(*rtm), tb, RTA_MAX, rtm_dn_policy);
  1400. if (err < 0)
  1401. return err;
  1402. memset(&fld, 0, sizeof(fld));
  1403. fld.flowidn_proto = DNPROTO_NSP;
  1404. skb = nlmsg_new(NLMSG_DEFAULT_SIZE, GFP_KERNEL);
  1405. if (skb == NULL)
  1406. return -ENOBUFS;
  1407. skb_reset_mac_header(skb);
  1408. cb = DN_SKB_CB(skb);
  1409. if (tb[RTA_SRC])
  1410. fld.saddr = nla_get_le16(tb[RTA_SRC]);
  1411. if (tb[RTA_DST])
  1412. fld.daddr = nla_get_le16(tb[RTA_DST]);
  1413. if (tb[RTA_IIF])
  1414. fld.flowidn_iif = nla_get_u32(tb[RTA_IIF]);
  1415. if (fld.flowidn_iif) {
  1416. struct net_device *dev;
  1417. dev = __dev_get_by_index(&init_net, fld.flowidn_iif);
  1418. if (!dev || !dev->dn_ptr) {
  1419. kfree_skb(skb);
  1420. return -ENODEV;
  1421. }
  1422. skb->protocol = htons(ETH_P_DNA_RT);
  1423. skb->dev = dev;
  1424. cb->src = fld.saddr;
  1425. cb->dst = fld.daddr;
  1426. local_bh_disable();
  1427. err = dn_route_input(skb);
  1428. local_bh_enable();
  1429. memset(cb, 0, sizeof(struct dn_skb_cb));
  1430. rt = (struct dn_route *)skb_dst(skb);
  1431. if (!err && -rt->dst.error)
  1432. err = rt->dst.error;
  1433. } else {
  1434. if (tb[RTA_OIF])
  1435. fld.flowidn_oif = nla_get_u32(tb[RTA_OIF]);
  1436. err = dn_route_output_key((struct dst_entry **)&rt, &fld, 0);
  1437. }
  1438. skb->dev = NULL;
  1439. if (err)
  1440. goto out_free;
  1441. skb_dst_set(skb, &rt->dst);
  1442. if (rtm->rtm_flags & RTM_F_NOTIFY)
  1443. rt->rt_flags |= RTCF_NOTIFY;
  1444. err = dn_rt_fill_info(skb, NETLINK_CB(in_skb).portid, nlh->nlmsg_seq, RTM_NEWROUTE, 0, 0);
  1445. if (err < 0) {
  1446. err = -EMSGSIZE;
  1447. goto out_free;
  1448. }
  1449. return rtnl_unicast(skb, &init_net, NETLINK_CB(in_skb).portid);
  1450. out_free:
  1451. kfree_skb(skb);
  1452. return err;
  1453. }
  1454. /*
  1455. * For routers, this is called from dn_fib_dump, but for endnodes its
  1456. * called directly from the rtnetlink dispatch table.
  1457. */
  1458. int dn_cache_dump(struct sk_buff *skb, struct netlink_callback *cb)
  1459. {
  1460. struct net *net = sock_net(skb->sk);
  1461. struct dn_route *rt;
  1462. int h, s_h;
  1463. int idx, s_idx;
  1464. struct rtmsg *rtm;
  1465. if (!net_eq(net, &init_net))
  1466. return 0;
  1467. if (nlmsg_len(cb->nlh) < sizeof(struct rtmsg))
  1468. return -EINVAL;
  1469. rtm = nlmsg_data(cb->nlh);
  1470. if (!(rtm->rtm_flags & RTM_F_CLONED))
  1471. return 0;
  1472. s_h = cb->args[0];
  1473. s_idx = idx = cb->args[1];
  1474. for(h = 0; h <= dn_rt_hash_mask; h++) {
  1475. if (h < s_h)
  1476. continue;
  1477. if (h > s_h)
  1478. s_idx = 0;
  1479. rcu_read_lock_bh();
  1480. for(rt = rcu_dereference_bh(dn_rt_hash_table[h].chain), idx = 0;
  1481. rt;
  1482. rt = rcu_dereference_bh(rt->dst.dn_next), idx++) {
  1483. if (idx < s_idx)
  1484. continue;
  1485. skb_dst_set(skb, dst_clone(&rt->dst));
  1486. if (dn_rt_fill_info(skb, NETLINK_CB(cb->skb).portid,
  1487. cb->nlh->nlmsg_seq, RTM_NEWROUTE,
  1488. 1, NLM_F_MULTI) < 0) {
  1489. skb_dst_drop(skb);
  1490. rcu_read_unlock_bh();
  1491. goto done;
  1492. }
  1493. skb_dst_drop(skb);
  1494. }
  1495. rcu_read_unlock_bh();
  1496. }
  1497. done:
  1498. cb->args[0] = h;
  1499. cb->args[1] = idx;
  1500. return skb->len;
  1501. }
  1502. #ifdef CONFIG_PROC_FS
  1503. struct dn_rt_cache_iter_state {
  1504. int bucket;
  1505. };
  1506. static struct dn_route *dn_rt_cache_get_first(struct seq_file *seq)
  1507. {
  1508. struct dn_route *rt = NULL;
  1509. struct dn_rt_cache_iter_state *s = seq->private;
  1510. for(s->bucket = dn_rt_hash_mask; s->bucket >= 0; --s->bucket) {
  1511. rcu_read_lock_bh();
  1512. rt = rcu_dereference_bh(dn_rt_hash_table[s->bucket].chain);
  1513. if (rt)
  1514. break;
  1515. rcu_read_unlock_bh();
  1516. }
  1517. return rt;
  1518. }
  1519. static struct dn_route *dn_rt_cache_get_next(struct seq_file *seq, struct dn_route *rt)
  1520. {
  1521. struct dn_rt_cache_iter_state *s = seq->private;
  1522. rt = rcu_dereference_bh(rt->dst.dn_next);
  1523. while (!rt) {
  1524. rcu_read_unlock_bh();
  1525. if (--s->bucket < 0)
  1526. break;
  1527. rcu_read_lock_bh();
  1528. rt = rcu_dereference_bh(dn_rt_hash_table[s->bucket].chain);
  1529. }
  1530. return rt;
  1531. }
  1532. static void *dn_rt_cache_seq_start(struct seq_file *seq, loff_t *pos)
  1533. {
  1534. struct dn_route *rt = dn_rt_cache_get_first(seq);
  1535. if (rt) {
  1536. while(*pos && (rt = dn_rt_cache_get_next(seq, rt)))
  1537. --*pos;
  1538. }
  1539. return *pos ? NULL : rt;
  1540. }
  1541. static void *dn_rt_cache_seq_next(struct seq_file *seq, void *v, loff_t *pos)
  1542. {
  1543. struct dn_route *rt = dn_rt_cache_get_next(seq, v);
  1544. ++*pos;
  1545. return rt;
  1546. }
  1547. static void dn_rt_cache_seq_stop(struct seq_file *seq, void *v)
  1548. {
  1549. if (v)
  1550. rcu_read_unlock_bh();
  1551. }
  1552. static int dn_rt_cache_seq_show(struct seq_file *seq, void *v)
  1553. {
  1554. struct dn_route *rt = v;
  1555. char buf1[DN_ASCBUF_LEN], buf2[DN_ASCBUF_LEN];
  1556. seq_printf(seq, "%-8s %-7s %-7s %04d %04d %04d\n",
  1557. rt->dst.dev ? rt->dst.dev->name : "*",
  1558. dn_addr2asc(le16_to_cpu(rt->rt_daddr), buf1),
  1559. dn_addr2asc(le16_to_cpu(rt->rt_saddr), buf2),
  1560. atomic_read(&rt->dst.__refcnt),
  1561. rt->dst.__use, 0);
  1562. return 0;
  1563. }
  1564. static const struct seq_operations dn_rt_cache_seq_ops = {
  1565. .start = dn_rt_cache_seq_start,
  1566. .next = dn_rt_cache_seq_next,
  1567. .stop = dn_rt_cache_seq_stop,
  1568. .show = dn_rt_cache_seq_show,
  1569. };
  1570. static int dn_rt_cache_seq_open(struct inode *inode, struct file *file)
  1571. {
  1572. return seq_open_private(file, &dn_rt_cache_seq_ops,
  1573. sizeof(struct dn_rt_cache_iter_state));
  1574. }
  1575. static const struct file_operations dn_rt_cache_seq_fops = {
  1576. .owner = THIS_MODULE,
  1577. .open = dn_rt_cache_seq_open,
  1578. .read = seq_read,
  1579. .llseek = seq_lseek,
  1580. .release = seq_release_private,
  1581. };
  1582. #endif /* CONFIG_PROC_FS */
  1583. void __init dn_route_init(void)
  1584. {
  1585. int i, goal, order;
  1586. dn_dst_ops.kmem_cachep =
  1587. kmem_cache_create("dn_dst_cache", sizeof(struct dn_route), 0,
  1588. SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
  1589. dst_entries_init(&dn_dst_ops);
  1590. setup_timer(&dn_route_timer, dn_dst_check_expire, 0);
  1591. dn_route_timer.expires = jiffies + decnet_dst_gc_interval * HZ;
  1592. add_timer(&dn_route_timer);
  1593. goal = totalram_pages >> (26 - PAGE_SHIFT);
  1594. for(order = 0; (1UL << order) < goal; order++)
  1595. /* NOTHING */;
  1596. /*
  1597. * Only want 1024 entries max, since the table is very, very unlikely
  1598. * to be larger than that.
  1599. */
  1600. while(order && ((((1UL << order) * PAGE_SIZE) /
  1601. sizeof(struct dn_rt_hash_bucket)) >= 2048))
  1602. order--;
  1603. do {
  1604. dn_rt_hash_mask = (1UL << order) * PAGE_SIZE /
  1605. sizeof(struct dn_rt_hash_bucket);
  1606. while(dn_rt_hash_mask & (dn_rt_hash_mask - 1))
  1607. dn_rt_hash_mask--;
  1608. dn_rt_hash_table = (struct dn_rt_hash_bucket *)
  1609. __get_free_pages(GFP_ATOMIC, order);
  1610. } while (dn_rt_hash_table == NULL && --order > 0);
  1611. if (!dn_rt_hash_table)
  1612. panic("Failed to allocate DECnet route cache hash table\n");
  1613. printk(KERN_INFO
  1614. "DECnet: Routing cache hash table of %u buckets, %ldKbytes\n",
  1615. dn_rt_hash_mask,
  1616. (long)(dn_rt_hash_mask*sizeof(struct dn_rt_hash_bucket))/1024);
  1617. dn_rt_hash_mask--;
  1618. for(i = 0; i <= dn_rt_hash_mask; i++) {
  1619. spin_lock_init(&dn_rt_hash_table[i].lock);
  1620. dn_rt_hash_table[i].chain = NULL;
  1621. }
  1622. dn_dst_ops.gc_thresh = (dn_rt_hash_mask + 1);
  1623. proc_create("decnet_cache", S_IRUGO, init_net.proc_net,
  1624. &dn_rt_cache_seq_fops);
  1625. #ifdef CONFIG_DECNET_ROUTER
  1626. rtnl_register(PF_DECnet, RTM_GETROUTE, dn_cache_getroute,
  1627. dn_fib_dump, NULL);
  1628. #else
  1629. rtnl_register(PF_DECnet, RTM_GETROUTE, dn_cache_getroute,
  1630. dn_cache_dump, NULL);
  1631. #endif
  1632. }
  1633. void __exit dn_route_cleanup(void)
  1634. {
  1635. del_timer(&dn_route_timer);
  1636. dn_run_flush(0);
  1637. remove_proc_entry("decnet_cache", init_net.proc_net);
  1638. dst_entries_destroy(&dn_dst_ops);
  1639. }