dn_route.c 44 KB

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