dn_route.c 44 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832
  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;
  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(dev_out = dev_base; dev_out; dev_out = dev_out->next) {
  774. if (!dev_out->dn_ptr)
  775. continue;
  776. if (!dn_dev_islocal(dev_out, oldflp->fld_src))
  777. continue;
  778. if ((dev_out->flags & IFF_LOOPBACK) &&
  779. oldflp->fld_dst &&
  780. !dn_dev_islocal(dev_out, oldflp->fld_dst))
  781. continue;
  782. break;
  783. }
  784. read_unlock(&dev_base_lock);
  785. if (dev_out == NULL)
  786. goto out;
  787. dev_hold(dev_out);
  788. source_ok:
  789. ;
  790. }
  791. /* No destination? Assume its local */
  792. if (!fl.fld_dst) {
  793. fl.fld_dst = fl.fld_src;
  794. err = -EADDRNOTAVAIL;
  795. if (dev_out)
  796. dev_put(dev_out);
  797. dev_out = &loopback_dev;
  798. dev_hold(dev_out);
  799. if (!fl.fld_dst) {
  800. fl.fld_dst =
  801. fl.fld_src = dnet_select_source(dev_out, 0,
  802. RT_SCOPE_HOST);
  803. if (!fl.fld_dst)
  804. goto out;
  805. }
  806. fl.oif = loopback_dev.ifindex;
  807. res.type = RTN_LOCAL;
  808. goto make_route;
  809. }
  810. if (decnet_debug_level & 16)
  811. printk(KERN_DEBUG
  812. "dn_route_output_slow: initial checks complete."
  813. " dst=%o4x src=%04x oif=%d try_hard=%d\n",
  814. dn_ntohs(fl.fld_dst), dn_ntohs(fl.fld_src),
  815. fl.oif, try_hard);
  816. /*
  817. * N.B. If the kernel is compiled without router support then
  818. * dn_fib_lookup() will evaluate to non-zero so this if () block
  819. * will always be executed.
  820. */
  821. err = -ESRCH;
  822. if (try_hard || (err = dn_fib_lookup(&fl, &res)) != 0) {
  823. struct dn_dev *dn_db;
  824. if (err != -ESRCH)
  825. goto out;
  826. /*
  827. * Here the fallback is basically the standard algorithm for
  828. * routing in endnodes which is described in the DECnet routing
  829. * docs
  830. *
  831. * If we are not trying hard, look in neighbour cache.
  832. * The result is tested to ensure that if a specific output
  833. * device/source address was requested, then we honour that
  834. * here
  835. */
  836. if (!try_hard) {
  837. neigh = neigh_lookup_nodev(&dn_neigh_table, &fl.fld_dst);
  838. if (neigh) {
  839. if ((oldflp->oif &&
  840. (neigh->dev->ifindex != oldflp->oif)) ||
  841. (oldflp->fld_src &&
  842. (!dn_dev_islocal(neigh->dev,
  843. oldflp->fld_src)))) {
  844. neigh_release(neigh);
  845. neigh = NULL;
  846. } else {
  847. if (dev_out)
  848. dev_put(dev_out);
  849. if (dn_dev_islocal(neigh->dev, fl.fld_dst)) {
  850. dev_out = &loopback_dev;
  851. res.type = RTN_LOCAL;
  852. } else {
  853. dev_out = neigh->dev;
  854. }
  855. dev_hold(dev_out);
  856. goto select_source;
  857. }
  858. }
  859. }
  860. /* Not there? Perhaps its a local address */
  861. if (dev_out == NULL)
  862. dev_out = dn_dev_get_default();
  863. err = -ENODEV;
  864. if (dev_out == NULL)
  865. goto out;
  866. dn_db = dev_out->dn_ptr;
  867. /* Possible improvement - check all devices for local addr */
  868. if (dn_dev_islocal(dev_out, fl.fld_dst)) {
  869. dev_put(dev_out);
  870. dev_out = &loopback_dev;
  871. dev_hold(dev_out);
  872. res.type = RTN_LOCAL;
  873. goto select_source;
  874. }
  875. /* Not local either.... try sending it to the default router */
  876. neigh = neigh_clone(dn_db->router);
  877. BUG_ON(neigh && neigh->dev != dev_out);
  878. /* Ok then, we assume its directly connected and move on */
  879. select_source:
  880. if (neigh)
  881. gateway = ((struct dn_neigh *)neigh)->addr;
  882. if (gateway == 0)
  883. gateway = fl.fld_dst;
  884. if (fl.fld_src == 0) {
  885. fl.fld_src = dnet_select_source(dev_out, gateway,
  886. res.type == RTN_LOCAL ?
  887. RT_SCOPE_HOST :
  888. RT_SCOPE_LINK);
  889. if (fl.fld_src == 0 && res.type != RTN_LOCAL)
  890. goto e_addr;
  891. }
  892. fl.oif = dev_out->ifindex;
  893. goto make_route;
  894. }
  895. free_res = 1;
  896. if (res.type == RTN_NAT)
  897. goto e_inval;
  898. if (res.type == RTN_LOCAL) {
  899. if (!fl.fld_src)
  900. fl.fld_src = fl.fld_dst;
  901. if (dev_out)
  902. dev_put(dev_out);
  903. dev_out = &loopback_dev;
  904. dev_hold(dev_out);
  905. fl.oif = dev_out->ifindex;
  906. if (res.fi)
  907. dn_fib_info_put(res.fi);
  908. res.fi = NULL;
  909. goto make_route;
  910. }
  911. if (res.fi->fib_nhs > 1 && fl.oif == 0)
  912. dn_fib_select_multipath(&fl, &res);
  913. /*
  914. * We could add some logic to deal with default routes here and
  915. * get rid of some of the special casing above.
  916. */
  917. if (!fl.fld_src)
  918. fl.fld_src = DN_FIB_RES_PREFSRC(res);
  919. if (dev_out)
  920. dev_put(dev_out);
  921. dev_out = DN_FIB_RES_DEV(res);
  922. dev_hold(dev_out);
  923. fl.oif = dev_out->ifindex;
  924. gateway = DN_FIB_RES_GW(res);
  925. make_route:
  926. if (dev_out->flags & IFF_LOOPBACK)
  927. flags |= RTCF_LOCAL;
  928. rt = dst_alloc(&dn_dst_ops);
  929. if (rt == NULL)
  930. goto e_nobufs;
  931. atomic_set(&rt->u.dst.__refcnt, 1);
  932. rt->u.dst.flags = DST_HOST;
  933. rt->fl.fld_src = oldflp->fld_src;
  934. rt->fl.fld_dst = oldflp->fld_dst;
  935. rt->fl.oif = oldflp->oif;
  936. rt->fl.iif = 0;
  937. rt->fl.mark = oldflp->mark;
  938. rt->rt_saddr = fl.fld_src;
  939. rt->rt_daddr = fl.fld_dst;
  940. rt->rt_gateway = gateway ? gateway : fl.fld_dst;
  941. rt->rt_local_src = fl.fld_src;
  942. rt->rt_dst_map = fl.fld_dst;
  943. rt->rt_src_map = fl.fld_src;
  944. rt->u.dst.dev = dev_out;
  945. dev_hold(dev_out);
  946. rt->u.dst.neighbour = neigh;
  947. neigh = NULL;
  948. rt->u.dst.lastuse = jiffies;
  949. rt->u.dst.output = dn_output;
  950. rt->u.dst.input = dn_rt_bug;
  951. rt->rt_flags = flags;
  952. if (flags & RTCF_LOCAL)
  953. rt->u.dst.input = dn_nsp_rx;
  954. err = dn_rt_set_next_hop(rt, &res);
  955. if (err)
  956. goto e_neighbour;
  957. hash = dn_hash(rt->fl.fld_src, rt->fl.fld_dst);
  958. dn_insert_route(rt, hash, (struct dn_route **)pprt);
  959. done:
  960. if (neigh)
  961. neigh_release(neigh);
  962. if (free_res)
  963. dn_fib_res_put(&res);
  964. if (dev_out)
  965. dev_put(dev_out);
  966. out:
  967. return err;
  968. e_addr:
  969. err = -EADDRNOTAVAIL;
  970. goto done;
  971. e_inval:
  972. err = -EINVAL;
  973. goto done;
  974. e_nobufs:
  975. err = -ENOBUFS;
  976. goto done;
  977. e_neighbour:
  978. dst_free(&rt->u.dst);
  979. goto e_nobufs;
  980. }
  981. /*
  982. * N.B. The flags may be moved into the flowi at some future stage.
  983. */
  984. static int __dn_route_output_key(struct dst_entry **pprt, const struct flowi *flp, int flags)
  985. {
  986. unsigned hash = dn_hash(flp->fld_src, flp->fld_dst);
  987. struct dn_route *rt = NULL;
  988. if (!(flags & MSG_TRYHARD)) {
  989. rcu_read_lock_bh();
  990. for(rt = rcu_dereference(dn_rt_hash_table[hash].chain); rt;
  991. rt = rcu_dereference(rt->u.dst.dn_next)) {
  992. if ((flp->fld_dst == rt->fl.fld_dst) &&
  993. (flp->fld_src == rt->fl.fld_src) &&
  994. (flp->mark == rt->fl.mark) &&
  995. (rt->fl.iif == 0) &&
  996. (rt->fl.oif == flp->oif)) {
  997. rt->u.dst.lastuse = jiffies;
  998. dst_hold(&rt->u.dst);
  999. rt->u.dst.__use++;
  1000. rcu_read_unlock_bh();
  1001. *pprt = &rt->u.dst;
  1002. return 0;
  1003. }
  1004. }
  1005. rcu_read_unlock_bh();
  1006. }
  1007. return dn_route_output_slow(pprt, flp, flags);
  1008. }
  1009. static int dn_route_output_key(struct dst_entry **pprt, struct flowi *flp, int flags)
  1010. {
  1011. int err;
  1012. err = __dn_route_output_key(pprt, flp, flags);
  1013. if (err == 0 && flp->proto) {
  1014. err = xfrm_lookup(pprt, flp, NULL, 0);
  1015. }
  1016. return err;
  1017. }
  1018. int dn_route_output_sock(struct dst_entry **pprt, struct flowi *fl, struct sock *sk, int flags)
  1019. {
  1020. int err;
  1021. err = __dn_route_output_key(pprt, fl, flags & MSG_TRYHARD);
  1022. if (err == 0 && fl->proto) {
  1023. err = xfrm_lookup(pprt, fl, sk, !(flags & MSG_DONTWAIT));
  1024. }
  1025. return err;
  1026. }
  1027. static int dn_route_input_slow(struct sk_buff *skb)
  1028. {
  1029. struct dn_route *rt = NULL;
  1030. struct dn_skb_cb *cb = DN_SKB_CB(skb);
  1031. struct net_device *in_dev = skb->dev;
  1032. struct net_device *out_dev = NULL;
  1033. struct dn_dev *dn_db;
  1034. struct neighbour *neigh = NULL;
  1035. unsigned hash;
  1036. int flags = 0;
  1037. __le16 gateway = 0;
  1038. __le16 local_src = 0;
  1039. struct flowi fl = { .nl_u = { .dn_u =
  1040. { .daddr = cb->dst,
  1041. .saddr = cb->src,
  1042. .scope = RT_SCOPE_UNIVERSE,
  1043. } },
  1044. .mark = skb->mark,
  1045. .iif = skb->dev->ifindex };
  1046. struct dn_fib_res res = { .fi = NULL, .type = RTN_UNREACHABLE };
  1047. int err = -EINVAL;
  1048. int free_res = 0;
  1049. dev_hold(in_dev);
  1050. if ((dn_db = in_dev->dn_ptr) == NULL)
  1051. goto out;
  1052. /* Zero source addresses are not allowed */
  1053. if (fl.fld_src == 0)
  1054. goto out;
  1055. /*
  1056. * In this case we've just received a packet from a source
  1057. * outside ourselves pretending to come from us. We don't
  1058. * allow it any further to prevent routing loops, spoofing and
  1059. * other nasties. Loopback packets already have the dst attached
  1060. * so this only affects packets which have originated elsewhere.
  1061. */
  1062. err = -ENOTUNIQ;
  1063. if (dn_dev_islocal(in_dev, cb->src))
  1064. goto out;
  1065. err = dn_fib_lookup(&fl, &res);
  1066. if (err) {
  1067. if (err != -ESRCH)
  1068. goto out;
  1069. /*
  1070. * Is the destination us ?
  1071. */
  1072. if (!dn_dev_islocal(in_dev, cb->dst))
  1073. goto e_inval;
  1074. res.type = RTN_LOCAL;
  1075. } else {
  1076. __le16 src_map = fl.fld_src;
  1077. free_res = 1;
  1078. out_dev = DN_FIB_RES_DEV(res);
  1079. if (out_dev == NULL) {
  1080. if (net_ratelimit())
  1081. printk(KERN_CRIT "Bug in dn_route_input_slow() "
  1082. "No output device\n");
  1083. goto e_inval;
  1084. }
  1085. dev_hold(out_dev);
  1086. if (res.r)
  1087. src_map = fl.fld_src; /* no NAT support for now */
  1088. gateway = DN_FIB_RES_GW(res);
  1089. if (res.type == RTN_NAT) {
  1090. fl.fld_dst = dn_fib_rules_map_destination(fl.fld_dst, &res);
  1091. dn_fib_res_put(&res);
  1092. free_res = 0;
  1093. if (dn_fib_lookup(&fl, &res))
  1094. goto e_inval;
  1095. free_res = 1;
  1096. if (res.type != RTN_UNICAST)
  1097. goto e_inval;
  1098. flags |= RTCF_DNAT;
  1099. gateway = fl.fld_dst;
  1100. }
  1101. fl.fld_src = src_map;
  1102. }
  1103. switch(res.type) {
  1104. case RTN_UNICAST:
  1105. /*
  1106. * Forwarding check here, we only check for forwarding
  1107. * being turned off, if you want to only forward intra
  1108. * area, its up to you to set the routing tables up
  1109. * correctly.
  1110. */
  1111. if (dn_db->parms.forwarding == 0)
  1112. goto e_inval;
  1113. if (res.fi->fib_nhs > 1 && fl.oif == 0)
  1114. dn_fib_select_multipath(&fl, &res);
  1115. /*
  1116. * Check for out_dev == in_dev. We use the RTCF_DOREDIRECT
  1117. * flag as a hint to set the intra-ethernet bit when
  1118. * forwarding. If we've got NAT in operation, we don't do
  1119. * this optimisation.
  1120. */
  1121. if (out_dev == in_dev && !(flags & RTCF_NAT))
  1122. flags |= RTCF_DOREDIRECT;
  1123. local_src = DN_FIB_RES_PREFSRC(res);
  1124. case RTN_BLACKHOLE:
  1125. case RTN_UNREACHABLE:
  1126. break;
  1127. case RTN_LOCAL:
  1128. flags |= RTCF_LOCAL;
  1129. fl.fld_src = cb->dst;
  1130. fl.fld_dst = cb->src;
  1131. /* Routing tables gave us a gateway */
  1132. if (gateway)
  1133. goto make_route;
  1134. /* Packet was intra-ethernet, so we know its on-link */
  1135. if (cb->rt_flags & DN_RT_F_IE) {
  1136. gateway = cb->src;
  1137. flags |= RTCF_DIRECTSRC;
  1138. goto make_route;
  1139. }
  1140. /* Use the default router if there is one */
  1141. neigh = neigh_clone(dn_db->router);
  1142. if (neigh) {
  1143. gateway = ((struct dn_neigh *)neigh)->addr;
  1144. goto make_route;
  1145. }
  1146. /* Close eyes and pray */
  1147. gateway = cb->src;
  1148. flags |= RTCF_DIRECTSRC;
  1149. goto make_route;
  1150. default:
  1151. goto e_inval;
  1152. }
  1153. make_route:
  1154. rt = dst_alloc(&dn_dst_ops);
  1155. if (rt == NULL)
  1156. goto e_nobufs;
  1157. rt->rt_saddr = fl.fld_src;
  1158. rt->rt_daddr = fl.fld_dst;
  1159. rt->rt_gateway = fl.fld_dst;
  1160. if (gateway)
  1161. rt->rt_gateway = gateway;
  1162. rt->rt_local_src = local_src ? local_src : rt->rt_saddr;
  1163. rt->rt_dst_map = fl.fld_dst;
  1164. rt->rt_src_map = fl.fld_src;
  1165. rt->fl.fld_src = cb->src;
  1166. rt->fl.fld_dst = cb->dst;
  1167. rt->fl.oif = 0;
  1168. rt->fl.iif = in_dev->ifindex;
  1169. rt->fl.mark = fl.mark;
  1170. rt->u.dst.flags = DST_HOST;
  1171. rt->u.dst.neighbour = neigh;
  1172. rt->u.dst.dev = out_dev;
  1173. rt->u.dst.lastuse = jiffies;
  1174. rt->u.dst.output = dn_rt_bug;
  1175. switch(res.type) {
  1176. case RTN_UNICAST:
  1177. rt->u.dst.input = dn_forward;
  1178. break;
  1179. case RTN_LOCAL:
  1180. rt->u.dst.output = dn_output;
  1181. rt->u.dst.input = dn_nsp_rx;
  1182. rt->u.dst.dev = in_dev;
  1183. flags |= RTCF_LOCAL;
  1184. break;
  1185. default:
  1186. case RTN_UNREACHABLE:
  1187. case RTN_BLACKHOLE:
  1188. rt->u.dst.input = dn_blackhole;
  1189. }
  1190. rt->rt_flags = flags;
  1191. if (rt->u.dst.dev)
  1192. dev_hold(rt->u.dst.dev);
  1193. err = dn_rt_set_next_hop(rt, &res);
  1194. if (err)
  1195. goto e_neighbour;
  1196. hash = dn_hash(rt->fl.fld_src, rt->fl.fld_dst);
  1197. dn_insert_route(rt, hash, (struct dn_route **)&skb->dst);
  1198. done:
  1199. if (neigh)
  1200. neigh_release(neigh);
  1201. if (free_res)
  1202. dn_fib_res_put(&res);
  1203. dev_put(in_dev);
  1204. if (out_dev)
  1205. dev_put(out_dev);
  1206. out:
  1207. return err;
  1208. e_inval:
  1209. err = -EINVAL;
  1210. goto done;
  1211. e_nobufs:
  1212. err = -ENOBUFS;
  1213. goto done;
  1214. e_neighbour:
  1215. dst_free(&rt->u.dst);
  1216. goto done;
  1217. }
  1218. int dn_route_input(struct sk_buff *skb)
  1219. {
  1220. struct dn_route *rt;
  1221. struct dn_skb_cb *cb = DN_SKB_CB(skb);
  1222. unsigned hash = dn_hash(cb->src, cb->dst);
  1223. if (skb->dst)
  1224. return 0;
  1225. rcu_read_lock();
  1226. for(rt = rcu_dereference(dn_rt_hash_table[hash].chain); rt != NULL;
  1227. rt = rcu_dereference(rt->u.dst.dn_next)) {
  1228. if ((rt->fl.fld_src == cb->src) &&
  1229. (rt->fl.fld_dst == cb->dst) &&
  1230. (rt->fl.oif == 0) &&
  1231. (rt->fl.mark == skb->mark) &&
  1232. (rt->fl.iif == cb->iif)) {
  1233. rt->u.dst.lastuse = jiffies;
  1234. dst_hold(&rt->u.dst);
  1235. rt->u.dst.__use++;
  1236. rcu_read_unlock();
  1237. skb->dst = (struct dst_entry *)rt;
  1238. return 0;
  1239. }
  1240. }
  1241. rcu_read_unlock();
  1242. return dn_route_input_slow(skb);
  1243. }
  1244. static int dn_rt_fill_info(struct sk_buff *skb, u32 pid, u32 seq,
  1245. int event, int nowait, unsigned int flags)
  1246. {
  1247. struct dn_route *rt = (struct dn_route *)skb->dst;
  1248. struct rtmsg *r;
  1249. struct nlmsghdr *nlh;
  1250. unsigned char *b = skb_tail_pointer(skb);
  1251. long expires;
  1252. nlh = NLMSG_NEW(skb, pid, seq, event, sizeof(*r), flags);
  1253. r = NLMSG_DATA(nlh);
  1254. r->rtm_family = AF_DECnet;
  1255. r->rtm_dst_len = 16;
  1256. r->rtm_src_len = 0;
  1257. r->rtm_tos = 0;
  1258. r->rtm_table = RT_TABLE_MAIN;
  1259. RTA_PUT_U32(skb, RTA_TABLE, RT_TABLE_MAIN);
  1260. r->rtm_type = rt->rt_type;
  1261. r->rtm_flags = (rt->rt_flags & ~0xFFFF) | RTM_F_CLONED;
  1262. r->rtm_scope = RT_SCOPE_UNIVERSE;
  1263. r->rtm_protocol = RTPROT_UNSPEC;
  1264. if (rt->rt_flags & RTCF_NOTIFY)
  1265. r->rtm_flags |= RTM_F_NOTIFY;
  1266. RTA_PUT(skb, RTA_DST, 2, &rt->rt_daddr);
  1267. if (rt->fl.fld_src) {
  1268. r->rtm_src_len = 16;
  1269. RTA_PUT(skb, RTA_SRC, 2, &rt->fl.fld_src);
  1270. }
  1271. if (rt->u.dst.dev)
  1272. RTA_PUT(skb, RTA_OIF, sizeof(int), &rt->u.dst.dev->ifindex);
  1273. /*
  1274. * Note to self - change this if input routes reverse direction when
  1275. * they deal only with inputs and not with replies like they do
  1276. * currently.
  1277. */
  1278. RTA_PUT(skb, RTA_PREFSRC, 2, &rt->rt_local_src);
  1279. if (rt->rt_daddr != rt->rt_gateway)
  1280. RTA_PUT(skb, RTA_GATEWAY, 2, &rt->rt_gateway);
  1281. if (rtnetlink_put_metrics(skb, rt->u.dst.metrics) < 0)
  1282. goto rtattr_failure;
  1283. expires = rt->u.dst.expires ? rt->u.dst.expires - jiffies : 0;
  1284. if (rtnl_put_cacheinfo(skb, &rt->u.dst, 0, 0, 0, expires,
  1285. rt->u.dst.error) < 0)
  1286. goto rtattr_failure;
  1287. if (rt->fl.iif)
  1288. RTA_PUT(skb, RTA_IIF, sizeof(int), &rt->fl.iif);
  1289. nlh->nlmsg_len = skb_tail_pointer(skb) - b;
  1290. return skb->len;
  1291. nlmsg_failure:
  1292. rtattr_failure:
  1293. nlmsg_trim(skb, b);
  1294. return -1;
  1295. }
  1296. /*
  1297. * This is called by both endnodes and routers now.
  1298. */
  1299. static int dn_cache_getroute(struct sk_buff *in_skb, struct nlmsghdr *nlh, void *arg)
  1300. {
  1301. struct rtattr **rta = arg;
  1302. struct rtmsg *rtm = NLMSG_DATA(nlh);
  1303. struct dn_route *rt = NULL;
  1304. struct dn_skb_cb *cb;
  1305. int err;
  1306. struct sk_buff *skb;
  1307. struct flowi fl;
  1308. memset(&fl, 0, sizeof(fl));
  1309. fl.proto = DNPROTO_NSP;
  1310. skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
  1311. if (skb == NULL)
  1312. return -ENOBUFS;
  1313. skb_reset_mac_header(skb);
  1314. cb = DN_SKB_CB(skb);
  1315. if (rta[RTA_SRC-1])
  1316. memcpy(&fl.fld_src, RTA_DATA(rta[RTA_SRC-1]), 2);
  1317. if (rta[RTA_DST-1])
  1318. memcpy(&fl.fld_dst, RTA_DATA(rta[RTA_DST-1]), 2);
  1319. if (rta[RTA_IIF-1])
  1320. memcpy(&fl.iif, RTA_DATA(rta[RTA_IIF-1]), sizeof(int));
  1321. if (fl.iif) {
  1322. struct net_device *dev;
  1323. if ((dev = dev_get_by_index(fl.iif)) == NULL) {
  1324. kfree_skb(skb);
  1325. return -ENODEV;
  1326. }
  1327. if (!dev->dn_ptr) {
  1328. dev_put(dev);
  1329. kfree_skb(skb);
  1330. return -ENODEV;
  1331. }
  1332. skb->protocol = __constant_htons(ETH_P_DNA_RT);
  1333. skb->dev = dev;
  1334. cb->src = fl.fld_src;
  1335. cb->dst = fl.fld_dst;
  1336. local_bh_disable();
  1337. err = dn_route_input(skb);
  1338. local_bh_enable();
  1339. memset(cb, 0, sizeof(struct dn_skb_cb));
  1340. rt = (struct dn_route *)skb->dst;
  1341. if (!err && -rt->u.dst.error)
  1342. err = rt->u.dst.error;
  1343. } else {
  1344. int oif = 0;
  1345. if (rta[RTA_OIF - 1])
  1346. memcpy(&oif, RTA_DATA(rta[RTA_OIF - 1]), sizeof(int));
  1347. fl.oif = oif;
  1348. err = dn_route_output_key((struct dst_entry **)&rt, &fl, 0);
  1349. }
  1350. if (skb->dev)
  1351. dev_put(skb->dev);
  1352. skb->dev = NULL;
  1353. if (err)
  1354. goto out_free;
  1355. skb->dst = &rt->u.dst;
  1356. if (rtm->rtm_flags & RTM_F_NOTIFY)
  1357. rt->rt_flags |= RTCF_NOTIFY;
  1358. err = dn_rt_fill_info(skb, NETLINK_CB(in_skb).pid, nlh->nlmsg_seq, RTM_NEWROUTE, 0, 0);
  1359. if (err == 0)
  1360. goto out_free;
  1361. if (err < 0) {
  1362. err = -EMSGSIZE;
  1363. goto out_free;
  1364. }
  1365. return rtnl_unicast(skb, NETLINK_CB(in_skb).pid);
  1366. out_free:
  1367. kfree_skb(skb);
  1368. return err;
  1369. }
  1370. /*
  1371. * For routers, this is called from dn_fib_dump, but for endnodes its
  1372. * called directly from the rtnetlink dispatch table.
  1373. */
  1374. int dn_cache_dump(struct sk_buff *skb, struct netlink_callback *cb)
  1375. {
  1376. struct dn_route *rt;
  1377. int h, s_h;
  1378. int idx, s_idx;
  1379. if (NLMSG_PAYLOAD(cb->nlh, 0) < sizeof(struct rtmsg))
  1380. return -EINVAL;
  1381. if (!(((struct rtmsg *)NLMSG_DATA(cb->nlh))->rtm_flags&RTM_F_CLONED))
  1382. return 0;
  1383. s_h = cb->args[0];
  1384. s_idx = idx = cb->args[1];
  1385. for(h = 0; h <= dn_rt_hash_mask; h++) {
  1386. if (h < s_h)
  1387. continue;
  1388. if (h > s_h)
  1389. s_idx = 0;
  1390. rcu_read_lock_bh();
  1391. for(rt = rcu_dereference(dn_rt_hash_table[h].chain), idx = 0;
  1392. rt;
  1393. rt = rcu_dereference(rt->u.dst.dn_next), idx++) {
  1394. if (idx < s_idx)
  1395. continue;
  1396. skb->dst = dst_clone(&rt->u.dst);
  1397. if (dn_rt_fill_info(skb, NETLINK_CB(cb->skb).pid,
  1398. cb->nlh->nlmsg_seq, RTM_NEWROUTE,
  1399. 1, NLM_F_MULTI) <= 0) {
  1400. dst_release(xchg(&skb->dst, NULL));
  1401. rcu_read_unlock_bh();
  1402. goto done;
  1403. }
  1404. dst_release(xchg(&skb->dst, NULL));
  1405. }
  1406. rcu_read_unlock_bh();
  1407. }
  1408. done:
  1409. cb->args[0] = h;
  1410. cb->args[1] = idx;
  1411. return skb->len;
  1412. }
  1413. #ifdef CONFIG_PROC_FS
  1414. struct dn_rt_cache_iter_state {
  1415. int bucket;
  1416. };
  1417. static struct dn_route *dn_rt_cache_get_first(struct seq_file *seq)
  1418. {
  1419. struct dn_route *rt = NULL;
  1420. struct dn_rt_cache_iter_state *s = seq->private;
  1421. for(s->bucket = dn_rt_hash_mask; s->bucket >= 0; --s->bucket) {
  1422. rcu_read_lock_bh();
  1423. rt = dn_rt_hash_table[s->bucket].chain;
  1424. if (rt)
  1425. break;
  1426. rcu_read_unlock_bh();
  1427. }
  1428. return rt;
  1429. }
  1430. static struct dn_route *dn_rt_cache_get_next(struct seq_file *seq, struct dn_route *rt)
  1431. {
  1432. struct dn_rt_cache_iter_state *s = rcu_dereference(seq->private);
  1433. rt = rt->u.dst.dn_next;
  1434. while(!rt) {
  1435. rcu_read_unlock_bh();
  1436. if (--s->bucket < 0)
  1437. break;
  1438. rcu_read_lock_bh();
  1439. rt = dn_rt_hash_table[s->bucket].chain;
  1440. }
  1441. return rt;
  1442. }
  1443. static void *dn_rt_cache_seq_start(struct seq_file *seq, loff_t *pos)
  1444. {
  1445. struct dn_route *rt = dn_rt_cache_get_first(seq);
  1446. if (rt) {
  1447. while(*pos && (rt = dn_rt_cache_get_next(seq, rt)))
  1448. --*pos;
  1449. }
  1450. return *pos ? NULL : rt;
  1451. }
  1452. static void *dn_rt_cache_seq_next(struct seq_file *seq, void *v, loff_t *pos)
  1453. {
  1454. struct dn_route *rt = dn_rt_cache_get_next(seq, v);
  1455. ++*pos;
  1456. return rt;
  1457. }
  1458. static void dn_rt_cache_seq_stop(struct seq_file *seq, void *v)
  1459. {
  1460. if (v)
  1461. rcu_read_unlock_bh();
  1462. }
  1463. static int dn_rt_cache_seq_show(struct seq_file *seq, void *v)
  1464. {
  1465. struct dn_route *rt = v;
  1466. char buf1[DN_ASCBUF_LEN], buf2[DN_ASCBUF_LEN];
  1467. seq_printf(seq, "%-8s %-7s %-7s %04d %04d %04d\n",
  1468. rt->u.dst.dev ? rt->u.dst.dev->name : "*",
  1469. dn_addr2asc(dn_ntohs(rt->rt_daddr), buf1),
  1470. dn_addr2asc(dn_ntohs(rt->rt_saddr), buf2),
  1471. atomic_read(&rt->u.dst.__refcnt),
  1472. rt->u.dst.__use,
  1473. (int) dst_metric(&rt->u.dst, RTAX_RTT));
  1474. return 0;
  1475. }
  1476. static struct seq_operations dn_rt_cache_seq_ops = {
  1477. .start = dn_rt_cache_seq_start,
  1478. .next = dn_rt_cache_seq_next,
  1479. .stop = dn_rt_cache_seq_stop,
  1480. .show = dn_rt_cache_seq_show,
  1481. };
  1482. static int dn_rt_cache_seq_open(struct inode *inode, struct file *file)
  1483. {
  1484. struct seq_file *seq;
  1485. int rc = -ENOMEM;
  1486. struct dn_rt_cache_iter_state *s = kmalloc(sizeof(*s), GFP_KERNEL);
  1487. if (!s)
  1488. goto out;
  1489. rc = seq_open(file, &dn_rt_cache_seq_ops);
  1490. if (rc)
  1491. goto out_kfree;
  1492. seq = file->private_data;
  1493. seq->private = s;
  1494. memset(s, 0, sizeof(*s));
  1495. out:
  1496. return rc;
  1497. out_kfree:
  1498. kfree(s);
  1499. goto out;
  1500. }
  1501. static const struct file_operations dn_rt_cache_seq_fops = {
  1502. .owner = THIS_MODULE,
  1503. .open = dn_rt_cache_seq_open,
  1504. .read = seq_read,
  1505. .llseek = seq_lseek,
  1506. .release = seq_release_private,
  1507. };
  1508. #endif /* CONFIG_PROC_FS */
  1509. void __init dn_route_init(void)
  1510. {
  1511. int i, goal, order;
  1512. dn_dst_ops.kmem_cachep =
  1513. kmem_cache_create("dn_dst_cache", sizeof(struct dn_route), 0,
  1514. SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL, NULL);
  1515. init_timer(&dn_route_timer);
  1516. dn_route_timer.function = dn_dst_check_expire;
  1517. dn_route_timer.expires = jiffies + decnet_dst_gc_interval * HZ;
  1518. add_timer(&dn_route_timer);
  1519. goal = num_physpages >> (26 - PAGE_SHIFT);
  1520. for(order = 0; (1UL << order) < goal; order++)
  1521. /* NOTHING */;
  1522. /*
  1523. * Only want 1024 entries max, since the table is very, very unlikely
  1524. * to be larger than that.
  1525. */
  1526. while(order && ((((1UL << order) * PAGE_SIZE) /
  1527. sizeof(struct dn_rt_hash_bucket)) >= 2048))
  1528. order--;
  1529. do {
  1530. dn_rt_hash_mask = (1UL << order) * PAGE_SIZE /
  1531. sizeof(struct dn_rt_hash_bucket);
  1532. while(dn_rt_hash_mask & (dn_rt_hash_mask - 1))
  1533. dn_rt_hash_mask--;
  1534. dn_rt_hash_table = (struct dn_rt_hash_bucket *)
  1535. __get_free_pages(GFP_ATOMIC, order);
  1536. } while (dn_rt_hash_table == NULL && --order > 0);
  1537. if (!dn_rt_hash_table)
  1538. panic("Failed to allocate DECnet route cache hash table\n");
  1539. printk(KERN_INFO
  1540. "DECnet: Routing cache hash table of %u buckets, %ldKbytes\n",
  1541. dn_rt_hash_mask,
  1542. (long)(dn_rt_hash_mask*sizeof(struct dn_rt_hash_bucket))/1024);
  1543. dn_rt_hash_mask--;
  1544. for(i = 0; i <= dn_rt_hash_mask; i++) {
  1545. spin_lock_init(&dn_rt_hash_table[i].lock);
  1546. dn_rt_hash_table[i].chain = NULL;
  1547. }
  1548. dn_dst_ops.gc_thresh = (dn_rt_hash_mask + 1);
  1549. proc_net_fops_create("decnet_cache", S_IRUGO, &dn_rt_cache_seq_fops);
  1550. #ifdef CONFIG_DECNET_ROUTER
  1551. rtnl_register(PF_DECnet, RTM_GETROUTE, dn_cache_getroute, dn_fib_dump);
  1552. #else
  1553. rtnl_register(PF_DECnet, RTM_GETROUTE, dn_cache_getroute,
  1554. dn_cache_dump);
  1555. #endif
  1556. }
  1557. void __exit dn_route_cleanup(void)
  1558. {
  1559. del_timer(&dn_route_timer);
  1560. dn_run_flush(0);
  1561. proc_net_remove("decnet_cache");
  1562. }