dn_route.c 44 KB

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