af_rose.c 38 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676
  1. /*
  2. * This program is free software; you can redistribute it and/or modify
  3. * it under the terms of the GNU General Public License as published by
  4. * the Free Software Foundation; either version 2 of the License, or
  5. * (at your option) any later version.
  6. *
  7. * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx.demon.co.uk)
  8. * Copyright (C) Alan Cox GW4PTS (alan@lxorguk.ukuu.org.uk)
  9. * Copyright (C) Terry Dawson VK2KTJ (terry@animats.net)
  10. * Copyright (C) Tomi Manninen OH2BNS (oh2bns@sral.fi)
  11. */
  12. #include <linux/capability.h>
  13. #include <linux/module.h>
  14. #include <linux/moduleparam.h>
  15. #include <linux/init.h>
  16. #include <linux/errno.h>
  17. #include <linux/types.h>
  18. #include <linux/socket.h>
  19. #include <linux/in.h>
  20. #include <linux/kernel.h>
  21. #include <linux/sched.h>
  22. #include <linux/spinlock.h>
  23. #include <linux/timer.h>
  24. #include <linux/string.h>
  25. #include <linux/sockios.h>
  26. #include <linux/net.h>
  27. #include <linux/stat.h>
  28. #include <net/net_namespace.h>
  29. #include <net/ax25.h>
  30. #include <linux/inet.h>
  31. #include <linux/netdevice.h>
  32. #include <linux/if_arp.h>
  33. #include <linux/skbuff.h>
  34. #include <net/sock.h>
  35. #include <asm/system.h>
  36. #include <asm/uaccess.h>
  37. #include <linux/fcntl.h>
  38. #include <linux/termios.h>
  39. #include <linux/mm.h>
  40. #include <linux/interrupt.h>
  41. #include <linux/notifier.h>
  42. #include <net/rose.h>
  43. #include <linux/proc_fs.h>
  44. #include <linux/seq_file.h>
  45. #include <net/tcp_states.h>
  46. #include <net/ip.h>
  47. #include <net/arp.h>
  48. static int rose_ndevs = 10;
  49. int sysctl_rose_restart_request_timeout = ROSE_DEFAULT_T0;
  50. int sysctl_rose_call_request_timeout = ROSE_DEFAULT_T1;
  51. int sysctl_rose_reset_request_timeout = ROSE_DEFAULT_T2;
  52. int sysctl_rose_clear_request_timeout = ROSE_DEFAULT_T3;
  53. int sysctl_rose_no_activity_timeout = ROSE_DEFAULT_IDLE;
  54. int sysctl_rose_ack_hold_back_timeout = ROSE_DEFAULT_HB;
  55. int sysctl_rose_routing_control = ROSE_DEFAULT_ROUTING;
  56. int sysctl_rose_link_fail_timeout = ROSE_DEFAULT_FAIL_TIMEOUT;
  57. int sysctl_rose_maximum_vcs = ROSE_DEFAULT_MAXVC;
  58. int sysctl_rose_window_size = ROSE_DEFAULT_WINDOW_SIZE;
  59. static HLIST_HEAD(rose_list);
  60. static DEFINE_SPINLOCK(rose_list_lock);
  61. static struct proto_ops rose_proto_ops;
  62. ax25_address rose_callsign;
  63. /*
  64. * ROSE network devices are virtual network devices encapsulating ROSE
  65. * frames into AX.25 which will be sent through an AX.25 device, so form a
  66. * special "super class" of normal net devices; split their locks off into a
  67. * separate class since they always nest.
  68. */
  69. static struct lock_class_key rose_netdev_xmit_lock_key;
  70. static struct lock_class_key rose_netdev_addr_lock_key;
  71. static void rose_set_lockdep_one(struct net_device *dev,
  72. struct netdev_queue *txq,
  73. void *_unused)
  74. {
  75. lockdep_set_class(&txq->_xmit_lock, &rose_netdev_xmit_lock_key);
  76. }
  77. static void rose_set_lockdep_key(struct net_device *dev)
  78. {
  79. lockdep_set_class(&dev->addr_list_lock, &rose_netdev_addr_lock_key);
  80. netdev_for_each_tx_queue(dev, rose_set_lockdep_one, NULL);
  81. }
  82. /*
  83. * Convert a ROSE address into text.
  84. */
  85. const char *rose2asc(const rose_address *addr)
  86. {
  87. static char buffer[11];
  88. if (addr->rose_addr[0] == 0x00 && addr->rose_addr[1] == 0x00 &&
  89. addr->rose_addr[2] == 0x00 && addr->rose_addr[3] == 0x00 &&
  90. addr->rose_addr[4] == 0x00) {
  91. strcpy(buffer, "*");
  92. } else {
  93. sprintf(buffer, "%02X%02X%02X%02X%02X", addr->rose_addr[0] & 0xFF,
  94. addr->rose_addr[1] & 0xFF,
  95. addr->rose_addr[2] & 0xFF,
  96. addr->rose_addr[3] & 0xFF,
  97. addr->rose_addr[4] & 0xFF);
  98. }
  99. return buffer;
  100. }
  101. /*
  102. * Compare two ROSE addresses, 0 == equal.
  103. */
  104. int rosecmp(rose_address *addr1, rose_address *addr2)
  105. {
  106. int i;
  107. for (i = 0; i < 5; i++)
  108. if (addr1->rose_addr[i] != addr2->rose_addr[i])
  109. return 1;
  110. return 0;
  111. }
  112. /*
  113. * Compare two ROSE addresses for only mask digits, 0 == equal.
  114. */
  115. int rosecmpm(rose_address *addr1, rose_address *addr2, unsigned short mask)
  116. {
  117. unsigned int i, j;
  118. if (mask > 10)
  119. return 1;
  120. for (i = 0; i < mask; i++) {
  121. j = i / 2;
  122. if ((i % 2) != 0) {
  123. if ((addr1->rose_addr[j] & 0x0F) != (addr2->rose_addr[j] & 0x0F))
  124. return 1;
  125. } else {
  126. if ((addr1->rose_addr[j] & 0xF0) != (addr2->rose_addr[j] & 0xF0))
  127. return 1;
  128. }
  129. }
  130. return 0;
  131. }
  132. /*
  133. * Socket removal during an interrupt is now safe.
  134. */
  135. static void rose_remove_socket(struct sock *sk)
  136. {
  137. spin_lock_bh(&rose_list_lock);
  138. sk_del_node_init(sk);
  139. spin_unlock_bh(&rose_list_lock);
  140. }
  141. /*
  142. * Kill all bound sockets on a broken link layer connection to a
  143. * particular neighbour.
  144. */
  145. void rose_kill_by_neigh(struct rose_neigh *neigh)
  146. {
  147. struct sock *s;
  148. struct hlist_node *node;
  149. spin_lock_bh(&rose_list_lock);
  150. sk_for_each(s, node, &rose_list) {
  151. struct rose_sock *rose = rose_sk(s);
  152. if (rose->neighbour == neigh) {
  153. rose_disconnect(s, ENETUNREACH, ROSE_OUT_OF_ORDER, 0);
  154. rose->neighbour->use--;
  155. rose->neighbour = NULL;
  156. }
  157. }
  158. spin_unlock_bh(&rose_list_lock);
  159. }
  160. /*
  161. * Kill all bound sockets on a dropped device.
  162. */
  163. static void rose_kill_by_device(struct net_device *dev)
  164. {
  165. struct sock *s;
  166. struct hlist_node *node;
  167. spin_lock_bh(&rose_list_lock);
  168. sk_for_each(s, node, &rose_list) {
  169. struct rose_sock *rose = rose_sk(s);
  170. if (rose->device == dev) {
  171. rose_disconnect(s, ENETUNREACH, ROSE_OUT_OF_ORDER, 0);
  172. rose->neighbour->use--;
  173. rose->device = NULL;
  174. }
  175. }
  176. spin_unlock_bh(&rose_list_lock);
  177. }
  178. /*
  179. * Handle device status changes.
  180. */
  181. static int rose_device_event(struct notifier_block *this, unsigned long event,
  182. void *ptr)
  183. {
  184. struct net_device *dev = (struct net_device *)ptr;
  185. if (!net_eq(dev_net(dev), &init_net))
  186. return NOTIFY_DONE;
  187. if (event != NETDEV_DOWN)
  188. return NOTIFY_DONE;
  189. switch (dev->type) {
  190. case ARPHRD_ROSE:
  191. rose_kill_by_device(dev);
  192. break;
  193. case ARPHRD_AX25:
  194. rose_link_device_down(dev);
  195. rose_rt_device_down(dev);
  196. break;
  197. }
  198. return NOTIFY_DONE;
  199. }
  200. /*
  201. * Add a socket to the bound sockets list.
  202. */
  203. static void rose_insert_socket(struct sock *sk)
  204. {
  205. spin_lock_bh(&rose_list_lock);
  206. sk_add_node(sk, &rose_list);
  207. spin_unlock_bh(&rose_list_lock);
  208. }
  209. /*
  210. * Find a socket that wants to accept the Call Request we just
  211. * received.
  212. */
  213. static struct sock *rose_find_listener(rose_address *addr, ax25_address *call)
  214. {
  215. struct sock *s;
  216. struct hlist_node *node;
  217. spin_lock_bh(&rose_list_lock);
  218. sk_for_each(s, node, &rose_list) {
  219. struct rose_sock *rose = rose_sk(s);
  220. if (!rosecmp(&rose->source_addr, addr) &&
  221. !ax25cmp(&rose->source_call, call) &&
  222. !rose->source_ndigis && s->sk_state == TCP_LISTEN)
  223. goto found;
  224. }
  225. sk_for_each(s, node, &rose_list) {
  226. struct rose_sock *rose = rose_sk(s);
  227. if (!rosecmp(&rose->source_addr, addr) &&
  228. !ax25cmp(&rose->source_call, &null_ax25_address) &&
  229. s->sk_state == TCP_LISTEN)
  230. goto found;
  231. }
  232. s = NULL;
  233. found:
  234. spin_unlock_bh(&rose_list_lock);
  235. return s;
  236. }
  237. /*
  238. * Find a connected ROSE socket given my LCI and device.
  239. */
  240. struct sock *rose_find_socket(unsigned int lci, struct rose_neigh *neigh)
  241. {
  242. struct sock *s;
  243. struct hlist_node *node;
  244. spin_lock_bh(&rose_list_lock);
  245. sk_for_each(s, node, &rose_list) {
  246. struct rose_sock *rose = rose_sk(s);
  247. if (rose->lci == lci && rose->neighbour == neigh)
  248. goto found;
  249. }
  250. s = NULL;
  251. found:
  252. spin_unlock_bh(&rose_list_lock);
  253. return s;
  254. }
  255. /*
  256. * Find a unique LCI for a given device.
  257. */
  258. unsigned int rose_new_lci(struct rose_neigh *neigh)
  259. {
  260. int lci;
  261. if (neigh->dce_mode) {
  262. for (lci = 1; lci <= sysctl_rose_maximum_vcs; lci++)
  263. if (rose_find_socket(lci, neigh) == NULL && rose_route_free_lci(lci, neigh) == NULL)
  264. return lci;
  265. } else {
  266. for (lci = sysctl_rose_maximum_vcs; lci > 0; lci--)
  267. if (rose_find_socket(lci, neigh) == NULL && rose_route_free_lci(lci, neigh) == NULL)
  268. return lci;
  269. }
  270. return 0;
  271. }
  272. /*
  273. * Deferred destroy.
  274. */
  275. void rose_destroy_socket(struct sock *);
  276. /*
  277. * Handler for deferred kills.
  278. */
  279. static void rose_destroy_timer(unsigned long data)
  280. {
  281. rose_destroy_socket((struct sock *)data);
  282. }
  283. /*
  284. * This is called from user mode and the timers. Thus it protects itself
  285. * against interrupt users but doesn't worry about being called during
  286. * work. Once it is removed from the queue no interrupt or bottom half
  287. * will touch it and we are (fairly 8-) ) safe.
  288. */
  289. void rose_destroy_socket(struct sock *sk)
  290. {
  291. struct sk_buff *skb;
  292. rose_remove_socket(sk);
  293. rose_stop_heartbeat(sk);
  294. rose_stop_idletimer(sk);
  295. rose_stop_timer(sk);
  296. rose_clear_queues(sk); /* Flush the queues */
  297. while ((skb = skb_dequeue(&sk->sk_receive_queue)) != NULL) {
  298. if (skb->sk != sk) { /* A pending connection */
  299. /* Queue the unaccepted socket for death */
  300. sock_set_flag(skb->sk, SOCK_DEAD);
  301. rose_start_heartbeat(skb->sk);
  302. rose_sk(skb->sk)->state = ROSE_STATE_0;
  303. }
  304. kfree_skb(skb);
  305. }
  306. if (sk_has_allocations(sk)) {
  307. /* Defer: outstanding buffers */
  308. setup_timer(&sk->sk_timer, rose_destroy_timer,
  309. (unsigned long)sk);
  310. sk->sk_timer.expires = jiffies + 10 * HZ;
  311. add_timer(&sk->sk_timer);
  312. } else
  313. sock_put(sk);
  314. }
  315. /*
  316. * Handling for system calls applied via the various interfaces to a
  317. * ROSE socket object.
  318. */
  319. static int rose_setsockopt(struct socket *sock, int level, int optname,
  320. char __user *optval, int optlen)
  321. {
  322. struct sock *sk = sock->sk;
  323. struct rose_sock *rose = rose_sk(sk);
  324. int opt;
  325. if (level != SOL_ROSE)
  326. return -ENOPROTOOPT;
  327. if (optlen < sizeof(int))
  328. return -EINVAL;
  329. if (get_user(opt, (int __user *)optval))
  330. return -EFAULT;
  331. switch (optname) {
  332. case ROSE_DEFER:
  333. rose->defer = opt ? 1 : 0;
  334. return 0;
  335. case ROSE_T1:
  336. if (opt < 1)
  337. return -EINVAL;
  338. rose->t1 = opt * HZ;
  339. return 0;
  340. case ROSE_T2:
  341. if (opt < 1)
  342. return -EINVAL;
  343. rose->t2 = opt * HZ;
  344. return 0;
  345. case ROSE_T3:
  346. if (opt < 1)
  347. return -EINVAL;
  348. rose->t3 = opt * HZ;
  349. return 0;
  350. case ROSE_HOLDBACK:
  351. if (opt < 1)
  352. return -EINVAL;
  353. rose->hb = opt * HZ;
  354. return 0;
  355. case ROSE_IDLE:
  356. if (opt < 0)
  357. return -EINVAL;
  358. rose->idle = opt * 60 * HZ;
  359. return 0;
  360. case ROSE_QBITINCL:
  361. rose->qbitincl = opt ? 1 : 0;
  362. return 0;
  363. default:
  364. return -ENOPROTOOPT;
  365. }
  366. }
  367. static int rose_getsockopt(struct socket *sock, int level, int optname,
  368. char __user *optval, int __user *optlen)
  369. {
  370. struct sock *sk = sock->sk;
  371. struct rose_sock *rose = rose_sk(sk);
  372. int val = 0;
  373. int len;
  374. if (level != SOL_ROSE)
  375. return -ENOPROTOOPT;
  376. if (get_user(len, optlen))
  377. return -EFAULT;
  378. if (len < 0)
  379. return -EINVAL;
  380. switch (optname) {
  381. case ROSE_DEFER:
  382. val = rose->defer;
  383. break;
  384. case ROSE_T1:
  385. val = rose->t1 / HZ;
  386. break;
  387. case ROSE_T2:
  388. val = rose->t2 / HZ;
  389. break;
  390. case ROSE_T3:
  391. val = rose->t3 / HZ;
  392. break;
  393. case ROSE_HOLDBACK:
  394. val = rose->hb / HZ;
  395. break;
  396. case ROSE_IDLE:
  397. val = rose->idle / (60 * HZ);
  398. break;
  399. case ROSE_QBITINCL:
  400. val = rose->qbitincl;
  401. break;
  402. default:
  403. return -ENOPROTOOPT;
  404. }
  405. len = min_t(unsigned int, len, sizeof(int));
  406. if (put_user(len, optlen))
  407. return -EFAULT;
  408. return copy_to_user(optval, &val, len) ? -EFAULT : 0;
  409. }
  410. static int rose_listen(struct socket *sock, int backlog)
  411. {
  412. struct sock *sk = sock->sk;
  413. if (sk->sk_state != TCP_LISTEN) {
  414. struct rose_sock *rose = rose_sk(sk);
  415. rose->dest_ndigis = 0;
  416. memset(&rose->dest_addr, 0, ROSE_ADDR_LEN);
  417. memset(&rose->dest_call, 0, AX25_ADDR_LEN);
  418. memset(rose->dest_digis, 0, AX25_ADDR_LEN * ROSE_MAX_DIGIS);
  419. sk->sk_max_ack_backlog = backlog;
  420. sk->sk_state = TCP_LISTEN;
  421. return 0;
  422. }
  423. return -EOPNOTSUPP;
  424. }
  425. static struct proto rose_proto = {
  426. .name = "ROSE",
  427. .owner = THIS_MODULE,
  428. .obj_size = sizeof(struct rose_sock),
  429. };
  430. static int rose_create(struct net *net, struct socket *sock, int protocol)
  431. {
  432. struct sock *sk;
  433. struct rose_sock *rose;
  434. if (net != &init_net)
  435. return -EAFNOSUPPORT;
  436. if (sock->type != SOCK_SEQPACKET || protocol != 0)
  437. return -ESOCKTNOSUPPORT;
  438. sk = sk_alloc(net, PF_ROSE, GFP_ATOMIC, &rose_proto);
  439. if (sk == NULL)
  440. return -ENOMEM;
  441. rose = rose_sk(sk);
  442. sock_init_data(sock, sk);
  443. skb_queue_head_init(&rose->ack_queue);
  444. #ifdef M_BIT
  445. skb_queue_head_init(&rose->frag_queue);
  446. rose->fraglen = 0;
  447. #endif
  448. sock->ops = &rose_proto_ops;
  449. sk->sk_protocol = protocol;
  450. init_timer(&rose->timer);
  451. init_timer(&rose->idletimer);
  452. rose->t1 = msecs_to_jiffies(sysctl_rose_call_request_timeout);
  453. rose->t2 = msecs_to_jiffies(sysctl_rose_reset_request_timeout);
  454. rose->t3 = msecs_to_jiffies(sysctl_rose_clear_request_timeout);
  455. rose->hb = msecs_to_jiffies(sysctl_rose_ack_hold_back_timeout);
  456. rose->idle = msecs_to_jiffies(sysctl_rose_no_activity_timeout);
  457. rose->state = ROSE_STATE_0;
  458. return 0;
  459. }
  460. static struct sock *rose_make_new(struct sock *osk)
  461. {
  462. struct sock *sk;
  463. struct rose_sock *rose, *orose;
  464. if (osk->sk_type != SOCK_SEQPACKET)
  465. return NULL;
  466. sk = sk_alloc(sock_net(osk), PF_ROSE, GFP_ATOMIC, &rose_proto);
  467. if (sk == NULL)
  468. return NULL;
  469. rose = rose_sk(sk);
  470. sock_init_data(NULL, sk);
  471. skb_queue_head_init(&rose->ack_queue);
  472. #ifdef M_BIT
  473. skb_queue_head_init(&rose->frag_queue);
  474. rose->fraglen = 0;
  475. #endif
  476. sk->sk_type = osk->sk_type;
  477. sk->sk_priority = osk->sk_priority;
  478. sk->sk_protocol = osk->sk_protocol;
  479. sk->sk_rcvbuf = osk->sk_rcvbuf;
  480. sk->sk_sndbuf = osk->sk_sndbuf;
  481. sk->sk_state = TCP_ESTABLISHED;
  482. sock_copy_flags(sk, osk);
  483. init_timer(&rose->timer);
  484. init_timer(&rose->idletimer);
  485. orose = rose_sk(osk);
  486. rose->t1 = orose->t1;
  487. rose->t2 = orose->t2;
  488. rose->t3 = orose->t3;
  489. rose->hb = orose->hb;
  490. rose->idle = orose->idle;
  491. rose->defer = orose->defer;
  492. rose->device = orose->device;
  493. rose->qbitincl = orose->qbitincl;
  494. return sk;
  495. }
  496. static int rose_release(struct socket *sock)
  497. {
  498. struct sock *sk = sock->sk;
  499. struct rose_sock *rose;
  500. if (sk == NULL) return 0;
  501. sock_hold(sk);
  502. sock_orphan(sk);
  503. lock_sock(sk);
  504. rose = rose_sk(sk);
  505. switch (rose->state) {
  506. case ROSE_STATE_0:
  507. release_sock(sk);
  508. rose_disconnect(sk, 0, -1, -1);
  509. lock_sock(sk);
  510. rose_destroy_socket(sk);
  511. break;
  512. case ROSE_STATE_2:
  513. rose->neighbour->use--;
  514. release_sock(sk);
  515. rose_disconnect(sk, 0, -1, -1);
  516. lock_sock(sk);
  517. rose_destroy_socket(sk);
  518. break;
  519. case ROSE_STATE_1:
  520. case ROSE_STATE_3:
  521. case ROSE_STATE_4:
  522. case ROSE_STATE_5:
  523. rose_clear_queues(sk);
  524. rose_stop_idletimer(sk);
  525. rose_write_internal(sk, ROSE_CLEAR_REQUEST);
  526. rose_start_t3timer(sk);
  527. rose->state = ROSE_STATE_2;
  528. sk->sk_state = TCP_CLOSE;
  529. sk->sk_shutdown |= SEND_SHUTDOWN;
  530. sk->sk_state_change(sk);
  531. sock_set_flag(sk, SOCK_DEAD);
  532. sock_set_flag(sk, SOCK_DESTROY);
  533. break;
  534. default:
  535. break;
  536. }
  537. sock->sk = NULL;
  538. release_sock(sk);
  539. sock_put(sk);
  540. return 0;
  541. }
  542. static int rose_bind(struct socket *sock, struct sockaddr *uaddr, int addr_len)
  543. {
  544. struct sock *sk = sock->sk;
  545. struct rose_sock *rose = rose_sk(sk);
  546. struct sockaddr_rose *addr = (struct sockaddr_rose *)uaddr;
  547. struct net_device *dev;
  548. ax25_address *source;
  549. ax25_uid_assoc *user;
  550. int n;
  551. if (!sock_flag(sk, SOCK_ZAPPED))
  552. return -EINVAL;
  553. if (addr_len != sizeof(struct sockaddr_rose) && addr_len != sizeof(struct full_sockaddr_rose))
  554. return -EINVAL;
  555. if (addr->srose_family != AF_ROSE)
  556. return -EINVAL;
  557. if (addr_len == sizeof(struct sockaddr_rose) && addr->srose_ndigis > 1)
  558. return -EINVAL;
  559. if (addr->srose_ndigis > ROSE_MAX_DIGIS)
  560. return -EINVAL;
  561. if ((dev = rose_dev_get(&addr->srose_addr)) == NULL) {
  562. SOCK_DEBUG(sk, "ROSE: bind failed: invalid address\n");
  563. return -EADDRNOTAVAIL;
  564. }
  565. source = &addr->srose_call;
  566. user = ax25_findbyuid(current_euid());
  567. if (user) {
  568. rose->source_call = user->call;
  569. ax25_uid_put(user);
  570. } else {
  571. if (ax25_uid_policy && !capable(CAP_NET_BIND_SERVICE))
  572. return -EACCES;
  573. rose->source_call = *source;
  574. }
  575. rose->source_addr = addr->srose_addr;
  576. rose->device = dev;
  577. rose->source_ndigis = addr->srose_ndigis;
  578. if (addr_len == sizeof(struct full_sockaddr_rose)) {
  579. struct full_sockaddr_rose *full_addr = (struct full_sockaddr_rose *)uaddr;
  580. for (n = 0 ; n < addr->srose_ndigis ; n++)
  581. rose->source_digis[n] = full_addr->srose_digis[n];
  582. } else {
  583. if (rose->source_ndigis == 1) {
  584. rose->source_digis[0] = addr->srose_digi;
  585. }
  586. }
  587. rose_insert_socket(sk);
  588. sock_reset_flag(sk, SOCK_ZAPPED);
  589. SOCK_DEBUG(sk, "ROSE: socket is bound\n");
  590. return 0;
  591. }
  592. static int rose_connect(struct socket *sock, struct sockaddr *uaddr, int addr_len, int flags)
  593. {
  594. struct sock *sk = sock->sk;
  595. struct rose_sock *rose = rose_sk(sk);
  596. struct sockaddr_rose *addr = (struct sockaddr_rose *)uaddr;
  597. unsigned char cause, diagnostic;
  598. struct net_device *dev;
  599. ax25_uid_assoc *user;
  600. int n, err = 0;
  601. if (addr_len != sizeof(struct sockaddr_rose) && addr_len != sizeof(struct full_sockaddr_rose))
  602. return -EINVAL;
  603. if (addr->srose_family != AF_ROSE)
  604. return -EINVAL;
  605. if (addr_len == sizeof(struct sockaddr_rose) && addr->srose_ndigis > 1)
  606. return -EINVAL;
  607. if (addr->srose_ndigis > ROSE_MAX_DIGIS)
  608. return -EINVAL;
  609. /* Source + Destination digis should not exceed ROSE_MAX_DIGIS */
  610. if ((rose->source_ndigis + addr->srose_ndigis) > ROSE_MAX_DIGIS)
  611. return -EINVAL;
  612. lock_sock(sk);
  613. if (sk->sk_state == TCP_ESTABLISHED && sock->state == SS_CONNECTING) {
  614. /* Connect completed during a ERESTARTSYS event */
  615. sock->state = SS_CONNECTED;
  616. goto out_release;
  617. }
  618. if (sk->sk_state == TCP_CLOSE && sock->state == SS_CONNECTING) {
  619. sock->state = SS_UNCONNECTED;
  620. err = -ECONNREFUSED;
  621. goto out_release;
  622. }
  623. if (sk->sk_state == TCP_ESTABLISHED) {
  624. /* No reconnect on a seqpacket socket */
  625. err = -EISCONN;
  626. goto out_release;
  627. }
  628. sk->sk_state = TCP_CLOSE;
  629. sock->state = SS_UNCONNECTED;
  630. rose->neighbour = rose_get_neigh(&addr->srose_addr, &cause,
  631. &diagnostic, 0);
  632. if (!rose->neighbour) {
  633. err = -ENETUNREACH;
  634. goto out_release;
  635. }
  636. rose->lci = rose_new_lci(rose->neighbour);
  637. if (!rose->lci) {
  638. err = -ENETUNREACH;
  639. goto out_release;
  640. }
  641. if (sock_flag(sk, SOCK_ZAPPED)) { /* Must bind first - autobinding in this may or may not work */
  642. sock_reset_flag(sk, SOCK_ZAPPED);
  643. if ((dev = rose_dev_first()) == NULL) {
  644. err = -ENETUNREACH;
  645. goto out_release;
  646. }
  647. user = ax25_findbyuid(current_euid());
  648. if (!user) {
  649. err = -EINVAL;
  650. goto out_release;
  651. }
  652. memcpy(&rose->source_addr, dev->dev_addr, ROSE_ADDR_LEN);
  653. rose->source_call = user->call;
  654. rose->device = dev;
  655. ax25_uid_put(user);
  656. rose_insert_socket(sk); /* Finish the bind */
  657. }
  658. rose_try_next_neigh:
  659. rose->dest_addr = addr->srose_addr;
  660. rose->dest_call = addr->srose_call;
  661. rose->rand = ((long)rose & 0xFFFF) + rose->lci;
  662. rose->dest_ndigis = addr->srose_ndigis;
  663. if (addr_len == sizeof(struct full_sockaddr_rose)) {
  664. struct full_sockaddr_rose *full_addr = (struct full_sockaddr_rose *)uaddr;
  665. for (n = 0 ; n < addr->srose_ndigis ; n++)
  666. rose->dest_digis[n] = full_addr->srose_digis[n];
  667. } else {
  668. if (rose->dest_ndigis == 1) {
  669. rose->dest_digis[0] = addr->srose_digi;
  670. }
  671. }
  672. /* Move to connecting socket, start sending Connect Requests */
  673. sock->state = SS_CONNECTING;
  674. sk->sk_state = TCP_SYN_SENT;
  675. rose->state = ROSE_STATE_1;
  676. rose->neighbour->use++;
  677. rose_write_internal(sk, ROSE_CALL_REQUEST);
  678. rose_start_heartbeat(sk);
  679. rose_start_t1timer(sk);
  680. /* Now the loop */
  681. if (sk->sk_state != TCP_ESTABLISHED && (flags & O_NONBLOCK)) {
  682. err = -EINPROGRESS;
  683. goto out_release;
  684. }
  685. /*
  686. * A Connect Ack with Choke or timeout or failed routing will go to
  687. * closed.
  688. */
  689. if (sk->sk_state == TCP_SYN_SENT) {
  690. DEFINE_WAIT(wait);
  691. for (;;) {
  692. prepare_to_wait(sk->sk_sleep, &wait,
  693. TASK_INTERRUPTIBLE);
  694. if (sk->sk_state != TCP_SYN_SENT)
  695. break;
  696. if (!signal_pending(current)) {
  697. release_sock(sk);
  698. schedule();
  699. lock_sock(sk);
  700. continue;
  701. }
  702. err = -ERESTARTSYS;
  703. break;
  704. }
  705. finish_wait(sk->sk_sleep, &wait);
  706. if (err)
  707. goto out_release;
  708. }
  709. if (sk->sk_state != TCP_ESTABLISHED) {
  710. /* Try next neighbour */
  711. rose->neighbour = rose_get_neigh(&addr->srose_addr, &cause, &diagnostic, 0);
  712. if (rose->neighbour)
  713. goto rose_try_next_neigh;
  714. /* No more neighbours */
  715. sock->state = SS_UNCONNECTED;
  716. err = sock_error(sk); /* Always set at this point */
  717. goto out_release;
  718. }
  719. sock->state = SS_CONNECTED;
  720. out_release:
  721. release_sock(sk);
  722. return err;
  723. }
  724. static int rose_accept(struct socket *sock, struct socket *newsock, int flags)
  725. {
  726. struct sk_buff *skb;
  727. struct sock *newsk;
  728. DEFINE_WAIT(wait);
  729. struct sock *sk;
  730. int err = 0;
  731. if ((sk = sock->sk) == NULL)
  732. return -EINVAL;
  733. lock_sock(sk);
  734. if (sk->sk_type != SOCK_SEQPACKET) {
  735. err = -EOPNOTSUPP;
  736. goto out_release;
  737. }
  738. if (sk->sk_state != TCP_LISTEN) {
  739. err = -EINVAL;
  740. goto out_release;
  741. }
  742. /*
  743. * The write queue this time is holding sockets ready to use
  744. * hooked into the SABM we saved
  745. */
  746. for (;;) {
  747. prepare_to_wait(sk->sk_sleep, &wait, TASK_INTERRUPTIBLE);
  748. skb = skb_dequeue(&sk->sk_receive_queue);
  749. if (skb)
  750. break;
  751. if (flags & O_NONBLOCK) {
  752. err = -EWOULDBLOCK;
  753. break;
  754. }
  755. if (!signal_pending(current)) {
  756. release_sock(sk);
  757. schedule();
  758. lock_sock(sk);
  759. continue;
  760. }
  761. err = -ERESTARTSYS;
  762. break;
  763. }
  764. finish_wait(sk->sk_sleep, &wait);
  765. if (err)
  766. goto out_release;
  767. newsk = skb->sk;
  768. sock_graft(newsk, newsock);
  769. /* Now attach up the new socket */
  770. skb->sk = NULL;
  771. kfree_skb(skb);
  772. sk->sk_ack_backlog--;
  773. out_release:
  774. release_sock(sk);
  775. return err;
  776. }
  777. static int rose_getname(struct socket *sock, struct sockaddr *uaddr,
  778. int *uaddr_len, int peer)
  779. {
  780. struct full_sockaddr_rose *srose = (struct full_sockaddr_rose *)uaddr;
  781. struct sock *sk = sock->sk;
  782. struct rose_sock *rose = rose_sk(sk);
  783. int n;
  784. if (peer != 0) {
  785. if (sk->sk_state != TCP_ESTABLISHED)
  786. return -ENOTCONN;
  787. srose->srose_family = AF_ROSE;
  788. srose->srose_addr = rose->dest_addr;
  789. srose->srose_call = rose->dest_call;
  790. srose->srose_ndigis = rose->dest_ndigis;
  791. for (n = 0; n < rose->dest_ndigis; n++)
  792. srose->srose_digis[n] = rose->dest_digis[n];
  793. } else {
  794. srose->srose_family = AF_ROSE;
  795. srose->srose_addr = rose->source_addr;
  796. srose->srose_call = rose->source_call;
  797. srose->srose_ndigis = rose->source_ndigis;
  798. for (n = 0; n < rose->source_ndigis; n++)
  799. srose->srose_digis[n] = rose->source_digis[n];
  800. }
  801. *uaddr_len = sizeof(struct full_sockaddr_rose);
  802. return 0;
  803. }
  804. int rose_rx_call_request(struct sk_buff *skb, struct net_device *dev, struct rose_neigh *neigh, unsigned int lci)
  805. {
  806. struct sock *sk;
  807. struct sock *make;
  808. struct rose_sock *make_rose;
  809. struct rose_facilities_struct facilities;
  810. int n, len;
  811. skb->sk = NULL; /* Initially we don't know who it's for */
  812. /*
  813. * skb->data points to the rose frame start
  814. */
  815. memset(&facilities, 0x00, sizeof(struct rose_facilities_struct));
  816. len = (((skb->data[3] >> 4) & 0x0F) + 1) >> 1;
  817. len += (((skb->data[3] >> 0) & 0x0F) + 1) >> 1;
  818. if (!rose_parse_facilities(skb->data + len + 4, &facilities)) {
  819. rose_transmit_clear_request(neigh, lci, ROSE_INVALID_FACILITY, 76);
  820. return 0;
  821. }
  822. sk = rose_find_listener(&facilities.source_addr, &facilities.source_call);
  823. /*
  824. * We can't accept the Call Request.
  825. */
  826. if (sk == NULL || sk_acceptq_is_full(sk) ||
  827. (make = rose_make_new(sk)) == NULL) {
  828. rose_transmit_clear_request(neigh, lci, ROSE_NETWORK_CONGESTION, 120);
  829. return 0;
  830. }
  831. skb->sk = make;
  832. make->sk_state = TCP_ESTABLISHED;
  833. make_rose = rose_sk(make);
  834. make_rose->lci = lci;
  835. make_rose->dest_addr = facilities.dest_addr;
  836. make_rose->dest_call = facilities.dest_call;
  837. make_rose->dest_ndigis = facilities.dest_ndigis;
  838. for (n = 0 ; n < facilities.dest_ndigis ; n++)
  839. make_rose->dest_digis[n] = facilities.dest_digis[n];
  840. make_rose->source_addr = facilities.source_addr;
  841. make_rose->source_call = facilities.source_call;
  842. make_rose->source_ndigis = facilities.source_ndigis;
  843. for (n = 0 ; n < facilities.source_ndigis ; n++)
  844. make_rose->source_digis[n]= facilities.source_digis[n];
  845. make_rose->neighbour = neigh;
  846. make_rose->device = dev;
  847. make_rose->facilities = facilities;
  848. make_rose->neighbour->use++;
  849. if (rose_sk(sk)->defer) {
  850. make_rose->state = ROSE_STATE_5;
  851. } else {
  852. rose_write_internal(make, ROSE_CALL_ACCEPTED);
  853. make_rose->state = ROSE_STATE_3;
  854. rose_start_idletimer(make);
  855. }
  856. make_rose->condition = 0x00;
  857. make_rose->vs = 0;
  858. make_rose->va = 0;
  859. make_rose->vr = 0;
  860. make_rose->vl = 0;
  861. sk->sk_ack_backlog++;
  862. rose_insert_socket(make);
  863. skb_queue_head(&sk->sk_receive_queue, skb);
  864. rose_start_heartbeat(make);
  865. if (!sock_flag(sk, SOCK_DEAD))
  866. sk->sk_data_ready(sk, skb->len);
  867. return 1;
  868. }
  869. static int rose_sendmsg(struct kiocb *iocb, struct socket *sock,
  870. struct msghdr *msg, size_t len)
  871. {
  872. struct sock *sk = sock->sk;
  873. struct rose_sock *rose = rose_sk(sk);
  874. struct sockaddr_rose *usrose = (struct sockaddr_rose *)msg->msg_name;
  875. int err;
  876. struct full_sockaddr_rose srose;
  877. struct sk_buff *skb;
  878. unsigned char *asmptr;
  879. int n, size, qbit = 0;
  880. if (msg->msg_flags & ~(MSG_DONTWAIT|MSG_EOR|MSG_CMSG_COMPAT))
  881. return -EINVAL;
  882. if (sock_flag(sk, SOCK_ZAPPED))
  883. return -EADDRNOTAVAIL;
  884. if (sk->sk_shutdown & SEND_SHUTDOWN) {
  885. send_sig(SIGPIPE, current, 0);
  886. return -EPIPE;
  887. }
  888. if (rose->neighbour == NULL || rose->device == NULL)
  889. return -ENETUNREACH;
  890. if (usrose != NULL) {
  891. if (msg->msg_namelen != sizeof(struct sockaddr_rose) && msg->msg_namelen != sizeof(struct full_sockaddr_rose))
  892. return -EINVAL;
  893. memset(&srose, 0, sizeof(struct full_sockaddr_rose));
  894. memcpy(&srose, usrose, msg->msg_namelen);
  895. if (rosecmp(&rose->dest_addr, &srose.srose_addr) != 0 ||
  896. ax25cmp(&rose->dest_call, &srose.srose_call) != 0)
  897. return -EISCONN;
  898. if (srose.srose_ndigis != rose->dest_ndigis)
  899. return -EISCONN;
  900. if (srose.srose_ndigis == rose->dest_ndigis) {
  901. for (n = 0 ; n < srose.srose_ndigis ; n++)
  902. if (ax25cmp(&rose->dest_digis[n],
  903. &srose.srose_digis[n]))
  904. return -EISCONN;
  905. }
  906. if (srose.srose_family != AF_ROSE)
  907. return -EINVAL;
  908. } else {
  909. if (sk->sk_state != TCP_ESTABLISHED)
  910. return -ENOTCONN;
  911. srose.srose_family = AF_ROSE;
  912. srose.srose_addr = rose->dest_addr;
  913. srose.srose_call = rose->dest_call;
  914. srose.srose_ndigis = rose->dest_ndigis;
  915. for (n = 0 ; n < rose->dest_ndigis ; n++)
  916. srose.srose_digis[n] = rose->dest_digis[n];
  917. }
  918. SOCK_DEBUG(sk, "ROSE: sendto: Addresses built.\n");
  919. /* Build a packet */
  920. SOCK_DEBUG(sk, "ROSE: sendto: building packet.\n");
  921. /* Sanity check the packet size */
  922. if (len > 65535)
  923. return -EMSGSIZE;
  924. size = len + AX25_BPQ_HEADER_LEN + AX25_MAX_HEADER_LEN + ROSE_MIN_LEN;
  925. if ((skb = sock_alloc_send_skb(sk, size, msg->msg_flags & MSG_DONTWAIT, &err)) == NULL)
  926. return err;
  927. skb_reserve(skb, AX25_BPQ_HEADER_LEN + AX25_MAX_HEADER_LEN + ROSE_MIN_LEN);
  928. /*
  929. * Put the data on the end
  930. */
  931. SOCK_DEBUG(sk, "ROSE: Appending user data\n");
  932. skb_reset_transport_header(skb);
  933. skb_put(skb, len);
  934. err = memcpy_fromiovec(skb_transport_header(skb), msg->msg_iov, len);
  935. if (err) {
  936. kfree_skb(skb);
  937. return err;
  938. }
  939. /*
  940. * If the Q BIT Include socket option is in force, the first
  941. * byte of the user data is the logical value of the Q Bit.
  942. */
  943. if (rose->qbitincl) {
  944. qbit = skb->data[0];
  945. skb_pull(skb, 1);
  946. }
  947. /*
  948. * Push down the ROSE header
  949. */
  950. asmptr = skb_push(skb, ROSE_MIN_LEN);
  951. SOCK_DEBUG(sk, "ROSE: Building Network Header.\n");
  952. /* Build a ROSE Network header */
  953. asmptr[0] = ((rose->lci >> 8) & 0x0F) | ROSE_GFI;
  954. asmptr[1] = (rose->lci >> 0) & 0xFF;
  955. asmptr[2] = ROSE_DATA;
  956. if (qbit)
  957. asmptr[0] |= ROSE_Q_BIT;
  958. SOCK_DEBUG(sk, "ROSE: Built header.\n");
  959. SOCK_DEBUG(sk, "ROSE: Transmitting buffer\n");
  960. if (sk->sk_state != TCP_ESTABLISHED) {
  961. kfree_skb(skb);
  962. return -ENOTCONN;
  963. }
  964. #ifdef M_BIT
  965. #define ROSE_PACLEN (256-ROSE_MIN_LEN)
  966. if (skb->len - ROSE_MIN_LEN > ROSE_PACLEN) {
  967. unsigned char header[ROSE_MIN_LEN];
  968. struct sk_buff *skbn;
  969. int frontlen;
  970. int lg;
  971. /* Save a copy of the Header */
  972. skb_copy_from_linear_data(skb, header, ROSE_MIN_LEN);
  973. skb_pull(skb, ROSE_MIN_LEN);
  974. frontlen = skb_headroom(skb);
  975. while (skb->len > 0) {
  976. if ((skbn = sock_alloc_send_skb(sk, frontlen + ROSE_PACLEN, 0, &err)) == NULL) {
  977. kfree_skb(skb);
  978. return err;
  979. }
  980. skbn->sk = sk;
  981. skbn->free = 1;
  982. skbn->arp = 1;
  983. skb_reserve(skbn, frontlen);
  984. lg = (ROSE_PACLEN > skb->len) ? skb->len : ROSE_PACLEN;
  985. /* Copy the user data */
  986. skb_copy_from_linear_data(skb, skb_put(skbn, lg), lg);
  987. skb_pull(skb, lg);
  988. /* Duplicate the Header */
  989. skb_push(skbn, ROSE_MIN_LEN);
  990. skb_copy_to_linear_data(skbn, header, ROSE_MIN_LEN);
  991. if (skb->len > 0)
  992. skbn->data[2] |= M_BIT;
  993. skb_queue_tail(&sk->sk_write_queue, skbn); /* Throw it on the queue */
  994. }
  995. skb->free = 1;
  996. kfree_skb(skb);
  997. } else {
  998. skb_queue_tail(&sk->sk_write_queue, skb); /* Throw it on the queue */
  999. }
  1000. #else
  1001. skb_queue_tail(&sk->sk_write_queue, skb); /* Shove it onto the queue */
  1002. #endif
  1003. rose_kick(sk);
  1004. return len;
  1005. }
  1006. static int rose_recvmsg(struct kiocb *iocb, struct socket *sock,
  1007. struct msghdr *msg, size_t size, int flags)
  1008. {
  1009. struct sock *sk = sock->sk;
  1010. struct rose_sock *rose = rose_sk(sk);
  1011. struct sockaddr_rose *srose = (struct sockaddr_rose *)msg->msg_name;
  1012. size_t copied;
  1013. unsigned char *asmptr;
  1014. struct sk_buff *skb;
  1015. int n, er, qbit;
  1016. /*
  1017. * This works for seqpacket too. The receiver has ordered the queue for
  1018. * us! We do one quick check first though
  1019. */
  1020. if (sk->sk_state != TCP_ESTABLISHED)
  1021. return -ENOTCONN;
  1022. /* Now we can treat all alike */
  1023. if ((skb = skb_recv_datagram(sk, flags & ~MSG_DONTWAIT, flags & MSG_DONTWAIT, &er)) == NULL)
  1024. return er;
  1025. qbit = (skb->data[0] & ROSE_Q_BIT) == ROSE_Q_BIT;
  1026. skb_pull(skb, ROSE_MIN_LEN);
  1027. if (rose->qbitincl) {
  1028. asmptr = skb_push(skb, 1);
  1029. *asmptr = qbit;
  1030. }
  1031. skb_reset_transport_header(skb);
  1032. copied = skb->len;
  1033. if (copied > size) {
  1034. copied = size;
  1035. msg->msg_flags |= MSG_TRUNC;
  1036. }
  1037. skb_copy_datagram_iovec(skb, 0, msg->msg_iov, copied);
  1038. if (srose != NULL) {
  1039. srose->srose_family = AF_ROSE;
  1040. srose->srose_addr = rose->dest_addr;
  1041. srose->srose_call = rose->dest_call;
  1042. srose->srose_ndigis = rose->dest_ndigis;
  1043. if (msg->msg_namelen >= sizeof(struct full_sockaddr_rose)) {
  1044. struct full_sockaddr_rose *full_srose = (struct full_sockaddr_rose *)msg->msg_name;
  1045. for (n = 0 ; n < rose->dest_ndigis ; n++)
  1046. full_srose->srose_digis[n] = rose->dest_digis[n];
  1047. msg->msg_namelen = sizeof(struct full_sockaddr_rose);
  1048. } else {
  1049. if (rose->dest_ndigis >= 1) {
  1050. srose->srose_ndigis = 1;
  1051. srose->srose_digi = rose->dest_digis[0];
  1052. }
  1053. msg->msg_namelen = sizeof(struct sockaddr_rose);
  1054. }
  1055. }
  1056. skb_free_datagram(sk, skb);
  1057. return copied;
  1058. }
  1059. static int rose_ioctl(struct socket *sock, unsigned int cmd, unsigned long arg)
  1060. {
  1061. struct sock *sk = sock->sk;
  1062. struct rose_sock *rose = rose_sk(sk);
  1063. void __user *argp = (void __user *)arg;
  1064. switch (cmd) {
  1065. case TIOCOUTQ: {
  1066. long amount;
  1067. amount = sk->sk_sndbuf - atomic_read(&sk->sk_wmem_alloc);
  1068. if (amount < 0)
  1069. amount = 0;
  1070. return put_user(amount, (unsigned int __user *) argp);
  1071. }
  1072. case TIOCINQ: {
  1073. struct sk_buff *skb;
  1074. long amount = 0L;
  1075. /* These two are safe on a single CPU system as only user tasks fiddle here */
  1076. if ((skb = skb_peek(&sk->sk_receive_queue)) != NULL)
  1077. amount = skb->len;
  1078. return put_user(amount, (unsigned int __user *) argp);
  1079. }
  1080. case SIOCGSTAMP:
  1081. return sock_get_timestamp(sk, (struct timeval __user *) argp);
  1082. case SIOCGSTAMPNS:
  1083. return sock_get_timestampns(sk, (struct timespec __user *) argp);
  1084. case SIOCGIFADDR:
  1085. case SIOCSIFADDR:
  1086. case SIOCGIFDSTADDR:
  1087. case SIOCSIFDSTADDR:
  1088. case SIOCGIFBRDADDR:
  1089. case SIOCSIFBRDADDR:
  1090. case SIOCGIFNETMASK:
  1091. case SIOCSIFNETMASK:
  1092. case SIOCGIFMETRIC:
  1093. case SIOCSIFMETRIC:
  1094. return -EINVAL;
  1095. case SIOCADDRT:
  1096. case SIOCDELRT:
  1097. case SIOCRSCLRRT:
  1098. if (!capable(CAP_NET_ADMIN))
  1099. return -EPERM;
  1100. return rose_rt_ioctl(cmd, argp);
  1101. case SIOCRSGCAUSE: {
  1102. struct rose_cause_struct rose_cause;
  1103. rose_cause.cause = rose->cause;
  1104. rose_cause.diagnostic = rose->diagnostic;
  1105. return copy_to_user(argp, &rose_cause, sizeof(struct rose_cause_struct)) ? -EFAULT : 0;
  1106. }
  1107. case SIOCRSSCAUSE: {
  1108. struct rose_cause_struct rose_cause;
  1109. if (copy_from_user(&rose_cause, argp, sizeof(struct rose_cause_struct)))
  1110. return -EFAULT;
  1111. rose->cause = rose_cause.cause;
  1112. rose->diagnostic = rose_cause.diagnostic;
  1113. return 0;
  1114. }
  1115. case SIOCRSSL2CALL:
  1116. if (!capable(CAP_NET_ADMIN)) return -EPERM;
  1117. if (ax25cmp(&rose_callsign, &null_ax25_address) != 0)
  1118. ax25_listen_release(&rose_callsign, NULL);
  1119. if (copy_from_user(&rose_callsign, argp, sizeof(ax25_address)))
  1120. return -EFAULT;
  1121. if (ax25cmp(&rose_callsign, &null_ax25_address) != 0)
  1122. return ax25_listen_register(&rose_callsign, NULL);
  1123. return 0;
  1124. case SIOCRSGL2CALL:
  1125. return copy_to_user(argp, &rose_callsign, sizeof(ax25_address)) ? -EFAULT : 0;
  1126. case SIOCRSACCEPT:
  1127. if (rose->state == ROSE_STATE_5) {
  1128. rose_write_internal(sk, ROSE_CALL_ACCEPTED);
  1129. rose_start_idletimer(sk);
  1130. rose->condition = 0x00;
  1131. rose->vs = 0;
  1132. rose->va = 0;
  1133. rose->vr = 0;
  1134. rose->vl = 0;
  1135. rose->state = ROSE_STATE_3;
  1136. }
  1137. return 0;
  1138. default:
  1139. return -ENOIOCTLCMD;
  1140. }
  1141. return 0;
  1142. }
  1143. #ifdef CONFIG_PROC_FS
  1144. static void *rose_info_start(struct seq_file *seq, loff_t *pos)
  1145. __acquires(rose_list_lock)
  1146. {
  1147. int i;
  1148. struct sock *s;
  1149. struct hlist_node *node;
  1150. spin_lock_bh(&rose_list_lock);
  1151. if (*pos == 0)
  1152. return SEQ_START_TOKEN;
  1153. i = 1;
  1154. sk_for_each(s, node, &rose_list) {
  1155. if (i == *pos)
  1156. return s;
  1157. ++i;
  1158. }
  1159. return NULL;
  1160. }
  1161. static void *rose_info_next(struct seq_file *seq, void *v, loff_t *pos)
  1162. {
  1163. ++*pos;
  1164. return (v == SEQ_START_TOKEN) ? sk_head(&rose_list)
  1165. : sk_next((struct sock *)v);
  1166. }
  1167. static void rose_info_stop(struct seq_file *seq, void *v)
  1168. __releases(rose_list_lock)
  1169. {
  1170. spin_unlock_bh(&rose_list_lock);
  1171. }
  1172. static int rose_info_show(struct seq_file *seq, void *v)
  1173. {
  1174. char buf[11];
  1175. if (v == SEQ_START_TOKEN)
  1176. seq_puts(seq,
  1177. "dest_addr dest_call src_addr src_call dev lci neigh st vs vr va t t1 t2 t3 hb idle Snd-Q Rcv-Q inode\n");
  1178. else {
  1179. struct sock *s = v;
  1180. struct rose_sock *rose = rose_sk(s);
  1181. const char *devname, *callsign;
  1182. const struct net_device *dev = rose->device;
  1183. if (!dev)
  1184. devname = "???";
  1185. else
  1186. devname = dev->name;
  1187. seq_printf(seq, "%-10s %-9s ",
  1188. rose2asc(&rose->dest_addr),
  1189. ax2asc(buf, &rose->dest_call));
  1190. if (ax25cmp(&rose->source_call, &null_ax25_address) == 0)
  1191. callsign = "??????-?";
  1192. else
  1193. callsign = ax2asc(buf, &rose->source_call);
  1194. seq_printf(seq,
  1195. "%-10s %-9s %-5s %3.3X %05d %d %d %d %d %3lu %3lu %3lu %3lu %3lu %3lu/%03lu %5d %5d %ld\n",
  1196. rose2asc(&rose->source_addr),
  1197. callsign,
  1198. devname,
  1199. rose->lci & 0x0FFF,
  1200. (rose->neighbour) ? rose->neighbour->number : 0,
  1201. rose->state,
  1202. rose->vs,
  1203. rose->vr,
  1204. rose->va,
  1205. ax25_display_timer(&rose->timer) / HZ,
  1206. rose->t1 / HZ,
  1207. rose->t2 / HZ,
  1208. rose->t3 / HZ,
  1209. rose->hb / HZ,
  1210. ax25_display_timer(&rose->idletimer) / (60 * HZ),
  1211. rose->idle / (60 * HZ),
  1212. atomic_read(&s->sk_wmem_alloc),
  1213. atomic_read(&s->sk_rmem_alloc),
  1214. s->sk_socket ? SOCK_INODE(s->sk_socket)->i_ino : 0L);
  1215. }
  1216. return 0;
  1217. }
  1218. static const struct seq_operations rose_info_seqops = {
  1219. .start = rose_info_start,
  1220. .next = rose_info_next,
  1221. .stop = rose_info_stop,
  1222. .show = rose_info_show,
  1223. };
  1224. static int rose_info_open(struct inode *inode, struct file *file)
  1225. {
  1226. return seq_open(file, &rose_info_seqops);
  1227. }
  1228. static const struct file_operations rose_info_fops = {
  1229. .owner = THIS_MODULE,
  1230. .open = rose_info_open,
  1231. .read = seq_read,
  1232. .llseek = seq_lseek,
  1233. .release = seq_release,
  1234. };
  1235. #endif /* CONFIG_PROC_FS */
  1236. static struct net_proto_family rose_family_ops = {
  1237. .family = PF_ROSE,
  1238. .create = rose_create,
  1239. .owner = THIS_MODULE,
  1240. };
  1241. static struct proto_ops rose_proto_ops = {
  1242. .family = PF_ROSE,
  1243. .owner = THIS_MODULE,
  1244. .release = rose_release,
  1245. .bind = rose_bind,
  1246. .connect = rose_connect,
  1247. .socketpair = sock_no_socketpair,
  1248. .accept = rose_accept,
  1249. .getname = rose_getname,
  1250. .poll = datagram_poll,
  1251. .ioctl = rose_ioctl,
  1252. .listen = rose_listen,
  1253. .shutdown = sock_no_shutdown,
  1254. .setsockopt = rose_setsockopt,
  1255. .getsockopt = rose_getsockopt,
  1256. .sendmsg = rose_sendmsg,
  1257. .recvmsg = rose_recvmsg,
  1258. .mmap = sock_no_mmap,
  1259. .sendpage = sock_no_sendpage,
  1260. };
  1261. static struct notifier_block rose_dev_notifier = {
  1262. .notifier_call = rose_device_event,
  1263. };
  1264. static struct net_device **dev_rose;
  1265. static struct ax25_protocol rose_pid = {
  1266. .pid = AX25_P_ROSE,
  1267. .func = rose_route_frame
  1268. };
  1269. static struct ax25_linkfail rose_linkfail_notifier = {
  1270. .func = rose_link_failed
  1271. };
  1272. static int __init rose_proto_init(void)
  1273. {
  1274. int i;
  1275. int rc;
  1276. if (rose_ndevs > 0x7FFFFFFF/sizeof(struct net_device *)) {
  1277. printk(KERN_ERR "ROSE: rose_proto_init - rose_ndevs parameter to large\n");
  1278. rc = -EINVAL;
  1279. goto out;
  1280. }
  1281. rc = proto_register(&rose_proto, 0);
  1282. if (rc != 0)
  1283. goto out;
  1284. rose_callsign = null_ax25_address;
  1285. dev_rose = kzalloc(rose_ndevs * sizeof(struct net_device *), GFP_KERNEL);
  1286. if (dev_rose == NULL) {
  1287. printk(KERN_ERR "ROSE: rose_proto_init - unable to allocate device structure\n");
  1288. rc = -ENOMEM;
  1289. goto out_proto_unregister;
  1290. }
  1291. for (i = 0; i < rose_ndevs; i++) {
  1292. struct net_device *dev;
  1293. char name[IFNAMSIZ];
  1294. sprintf(name, "rose%d", i);
  1295. dev = alloc_netdev(0, name, rose_setup);
  1296. if (!dev) {
  1297. printk(KERN_ERR "ROSE: rose_proto_init - unable to allocate memory\n");
  1298. rc = -ENOMEM;
  1299. goto fail;
  1300. }
  1301. rc = register_netdev(dev);
  1302. if (rc) {
  1303. printk(KERN_ERR "ROSE: netdevice registration failed\n");
  1304. free_netdev(dev);
  1305. goto fail;
  1306. }
  1307. rose_set_lockdep_key(dev);
  1308. dev_rose[i] = dev;
  1309. }
  1310. sock_register(&rose_family_ops);
  1311. register_netdevice_notifier(&rose_dev_notifier);
  1312. ax25_register_pid(&rose_pid);
  1313. ax25_linkfail_register(&rose_linkfail_notifier);
  1314. #ifdef CONFIG_SYSCTL
  1315. rose_register_sysctl();
  1316. #endif
  1317. rose_loopback_init();
  1318. rose_add_loopback_neigh();
  1319. proc_net_fops_create(&init_net, "rose", S_IRUGO, &rose_info_fops);
  1320. proc_net_fops_create(&init_net, "rose_neigh", S_IRUGO, &rose_neigh_fops);
  1321. proc_net_fops_create(&init_net, "rose_nodes", S_IRUGO, &rose_nodes_fops);
  1322. proc_net_fops_create(&init_net, "rose_routes", S_IRUGO, &rose_routes_fops);
  1323. out:
  1324. return rc;
  1325. fail:
  1326. while (--i >= 0) {
  1327. unregister_netdev(dev_rose[i]);
  1328. free_netdev(dev_rose[i]);
  1329. }
  1330. kfree(dev_rose);
  1331. out_proto_unregister:
  1332. proto_unregister(&rose_proto);
  1333. goto out;
  1334. }
  1335. module_init(rose_proto_init);
  1336. module_param(rose_ndevs, int, 0);
  1337. MODULE_PARM_DESC(rose_ndevs, "number of ROSE devices");
  1338. MODULE_AUTHOR("Jonathan Naylor G4KLX <g4klx@g4klx.demon.co.uk>");
  1339. MODULE_DESCRIPTION("The amateur radio ROSE network layer protocol");
  1340. MODULE_LICENSE("GPL");
  1341. MODULE_ALIAS_NETPROTO(PF_ROSE);
  1342. static void __exit rose_exit(void)
  1343. {
  1344. int i;
  1345. proc_net_remove(&init_net, "rose");
  1346. proc_net_remove(&init_net, "rose_neigh");
  1347. proc_net_remove(&init_net, "rose_nodes");
  1348. proc_net_remove(&init_net, "rose_routes");
  1349. rose_loopback_clear();
  1350. rose_rt_free();
  1351. ax25_protocol_release(AX25_P_ROSE);
  1352. ax25_linkfail_release(&rose_linkfail_notifier);
  1353. if (ax25cmp(&rose_callsign, &null_ax25_address) != 0)
  1354. ax25_listen_release(&rose_callsign, NULL);
  1355. #ifdef CONFIG_SYSCTL
  1356. rose_unregister_sysctl();
  1357. #endif
  1358. unregister_netdevice_notifier(&rose_dev_notifier);
  1359. sock_unregister(PF_ROSE);
  1360. for (i = 0; i < rose_ndevs; i++) {
  1361. struct net_device *dev = dev_rose[i];
  1362. if (dev) {
  1363. unregister_netdev(dev);
  1364. free_netdev(dev);
  1365. }
  1366. }
  1367. kfree(dev_rose);
  1368. proto_unregister(&rose_proto);
  1369. }
  1370. module_exit(rose_exit);