af_rose.c 38 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661
  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 const 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. char *rose2asc(char *buf, const rose_address *addr)
  86. {
  87. if (addr->rose_addr[0] == 0x00 && addr->rose_addr[1] == 0x00 &&
  88. addr->rose_addr[2] == 0x00 && addr->rose_addr[3] == 0x00 &&
  89. addr->rose_addr[4] == 0x00) {
  90. strcpy(buf, "*");
  91. } else {
  92. sprintf(buf, "%02X%02X%02X%02X%02X", addr->rose_addr[0] & 0xFF,
  93. addr->rose_addr[1] & 0xFF,
  94. addr->rose_addr[2] & 0xFF,
  95. addr->rose_addr[3] & 0xFF,
  96. addr->rose_addr[4] & 0xFF);
  97. }
  98. return buf;
  99. }
  100. /*
  101. * Compare two ROSE addresses, 0 == equal.
  102. */
  103. int rosecmp(rose_address *addr1, rose_address *addr2)
  104. {
  105. int i;
  106. for (i = 0; i < 5; i++)
  107. if (addr1->rose_addr[i] != addr2->rose_addr[i])
  108. return 1;
  109. return 0;
  110. }
  111. /*
  112. * Compare two ROSE addresses for only mask digits, 0 == equal.
  113. */
  114. int rosecmpm(rose_address *addr1, rose_address *addr2, unsigned short mask)
  115. {
  116. unsigned int i, j;
  117. if (mask > 10)
  118. return 1;
  119. for (i = 0; i < mask; i++) {
  120. j = i / 2;
  121. if ((i % 2) != 0) {
  122. if ((addr1->rose_addr[j] & 0x0F) != (addr2->rose_addr[j] & 0x0F))
  123. return 1;
  124. } else {
  125. if ((addr1->rose_addr[j] & 0xF0) != (addr2->rose_addr[j] & 0xF0))
  126. return 1;
  127. }
  128. }
  129. return 0;
  130. }
  131. /*
  132. * Socket removal during an interrupt is now safe.
  133. */
  134. static void rose_remove_socket(struct sock *sk)
  135. {
  136. spin_lock_bh(&rose_list_lock);
  137. sk_del_node_init(sk);
  138. spin_unlock_bh(&rose_list_lock);
  139. }
  140. /*
  141. * Kill all bound sockets on a broken link layer connection to a
  142. * particular neighbour.
  143. */
  144. void rose_kill_by_neigh(struct rose_neigh *neigh)
  145. {
  146. struct sock *s;
  147. struct hlist_node *node;
  148. spin_lock_bh(&rose_list_lock);
  149. sk_for_each(s, node, &rose_list) {
  150. struct rose_sock *rose = rose_sk(s);
  151. if (rose->neighbour == neigh) {
  152. rose_disconnect(s, ENETUNREACH, ROSE_OUT_OF_ORDER, 0);
  153. rose->neighbour->use--;
  154. rose->neighbour = NULL;
  155. }
  156. }
  157. spin_unlock_bh(&rose_list_lock);
  158. }
  159. /*
  160. * Kill all bound sockets on a dropped device.
  161. */
  162. static void rose_kill_by_device(struct net_device *dev)
  163. {
  164. struct sock *s;
  165. struct hlist_node *node;
  166. spin_lock_bh(&rose_list_lock);
  167. sk_for_each(s, node, &rose_list) {
  168. struct rose_sock *rose = rose_sk(s);
  169. if (rose->device == dev) {
  170. rose_disconnect(s, ENETUNREACH, ROSE_OUT_OF_ORDER, 0);
  171. rose->neighbour->use--;
  172. rose->device = NULL;
  173. }
  174. }
  175. spin_unlock_bh(&rose_list_lock);
  176. }
  177. /*
  178. * Handle device status changes.
  179. */
  180. static int rose_device_event(struct notifier_block *this, unsigned long event,
  181. void *ptr)
  182. {
  183. struct net_device *dev = (struct net_device *)ptr;
  184. if (!net_eq(dev_net(dev), &init_net))
  185. return NOTIFY_DONE;
  186. if (event != NETDEV_DOWN)
  187. return NOTIFY_DONE;
  188. switch (dev->type) {
  189. case ARPHRD_ROSE:
  190. rose_kill_by_device(dev);
  191. break;
  192. case ARPHRD_AX25:
  193. rose_link_device_down(dev);
  194. rose_rt_device_down(dev);
  195. break;
  196. }
  197. return NOTIFY_DONE;
  198. }
  199. /*
  200. * Add a socket to the bound sockets list.
  201. */
  202. static void rose_insert_socket(struct sock *sk)
  203. {
  204. spin_lock_bh(&rose_list_lock);
  205. sk_add_node(sk, &rose_list);
  206. spin_unlock_bh(&rose_list_lock);
  207. }
  208. /*
  209. * Find a socket that wants to accept the Call Request we just
  210. * received.
  211. */
  212. static struct sock *rose_find_listener(rose_address *addr, ax25_address *call)
  213. {
  214. struct sock *s;
  215. struct hlist_node *node;
  216. spin_lock_bh(&rose_list_lock);
  217. sk_for_each(s, node, &rose_list) {
  218. struct rose_sock *rose = rose_sk(s);
  219. if (!rosecmp(&rose->source_addr, addr) &&
  220. !ax25cmp(&rose->source_call, call) &&
  221. !rose->source_ndigis && s->sk_state == TCP_LISTEN)
  222. goto found;
  223. }
  224. sk_for_each(s, node, &rose_list) {
  225. struct rose_sock *rose = rose_sk(s);
  226. if (!rosecmp(&rose->source_addr, addr) &&
  227. !ax25cmp(&rose->source_call, &null_ax25_address) &&
  228. s->sk_state == TCP_LISTEN)
  229. goto found;
  230. }
  231. s = NULL;
  232. found:
  233. spin_unlock_bh(&rose_list_lock);
  234. return s;
  235. }
  236. /*
  237. * Find a connected ROSE socket given my LCI and device.
  238. */
  239. struct sock *rose_find_socket(unsigned int lci, struct rose_neigh *neigh)
  240. {
  241. struct sock *s;
  242. struct hlist_node *node;
  243. spin_lock_bh(&rose_list_lock);
  244. sk_for_each(s, node, &rose_list) {
  245. struct rose_sock *rose = rose_sk(s);
  246. if (rose->lci == lci && rose->neighbour == neigh)
  247. goto found;
  248. }
  249. s = NULL;
  250. found:
  251. spin_unlock_bh(&rose_list_lock);
  252. return s;
  253. }
  254. /*
  255. * Find a unique LCI for a given device.
  256. */
  257. unsigned int rose_new_lci(struct rose_neigh *neigh)
  258. {
  259. int lci;
  260. if (neigh->dce_mode) {
  261. for (lci = 1; lci <= sysctl_rose_maximum_vcs; lci++)
  262. if (rose_find_socket(lci, neigh) == NULL && rose_route_free_lci(lci, neigh) == NULL)
  263. return lci;
  264. } else {
  265. for (lci = sysctl_rose_maximum_vcs; lci > 0; lci--)
  266. if (rose_find_socket(lci, neigh) == NULL && rose_route_free_lci(lci, neigh) == NULL)
  267. return lci;
  268. }
  269. return 0;
  270. }
  271. /*
  272. * Deferred destroy.
  273. */
  274. void rose_destroy_socket(struct sock *);
  275. /*
  276. * Handler for deferred kills.
  277. */
  278. static void rose_destroy_timer(unsigned long data)
  279. {
  280. rose_destroy_socket((struct sock *)data);
  281. }
  282. /*
  283. * This is called from user mode and the timers. Thus it protects itself
  284. * against interrupt users but doesn't worry about being called during
  285. * work. Once it is removed from the queue no interrupt or bottom half
  286. * will touch it and we are (fairly 8-) ) safe.
  287. */
  288. void rose_destroy_socket(struct sock *sk)
  289. {
  290. struct sk_buff *skb;
  291. rose_remove_socket(sk);
  292. rose_stop_heartbeat(sk);
  293. rose_stop_idletimer(sk);
  294. rose_stop_timer(sk);
  295. rose_clear_queues(sk); /* Flush the queues */
  296. while ((skb = skb_dequeue(&sk->sk_receive_queue)) != NULL) {
  297. if (skb->sk != sk) { /* A pending connection */
  298. /* Queue the unaccepted socket for death */
  299. sock_set_flag(skb->sk, SOCK_DEAD);
  300. rose_start_heartbeat(skb->sk);
  301. rose_sk(skb->sk)->state = ROSE_STATE_0;
  302. }
  303. kfree_skb(skb);
  304. }
  305. if (sk_has_allocations(sk)) {
  306. /* Defer: outstanding buffers */
  307. setup_timer(&sk->sk_timer, rose_destroy_timer,
  308. (unsigned long)sk);
  309. sk->sk_timer.expires = jiffies + 10 * HZ;
  310. add_timer(&sk->sk_timer);
  311. } else
  312. sock_put(sk);
  313. }
  314. /*
  315. * Handling for system calls applied via the various interfaces to a
  316. * ROSE socket object.
  317. */
  318. static int rose_setsockopt(struct socket *sock, int level, int optname,
  319. char __user *optval, unsigned int optlen)
  320. {
  321. struct sock *sk = sock->sk;
  322. struct rose_sock *rose = rose_sk(sk);
  323. int opt;
  324. if (level != SOL_ROSE)
  325. return -ENOPROTOOPT;
  326. if (optlen < sizeof(int))
  327. return -EINVAL;
  328. if (get_user(opt, (int __user *)optval))
  329. return -EFAULT;
  330. switch (optname) {
  331. case ROSE_DEFER:
  332. rose->defer = opt ? 1 : 0;
  333. return 0;
  334. case ROSE_T1:
  335. if (opt < 1)
  336. return -EINVAL;
  337. rose->t1 = opt * HZ;
  338. return 0;
  339. case ROSE_T2:
  340. if (opt < 1)
  341. return -EINVAL;
  342. rose->t2 = opt * HZ;
  343. return 0;
  344. case ROSE_T3:
  345. if (opt < 1)
  346. return -EINVAL;
  347. rose->t3 = opt * HZ;
  348. return 0;
  349. case ROSE_HOLDBACK:
  350. if (opt < 1)
  351. return -EINVAL;
  352. rose->hb = opt * HZ;
  353. return 0;
  354. case ROSE_IDLE:
  355. if (opt < 0)
  356. return -EINVAL;
  357. rose->idle = opt * 60 * HZ;
  358. return 0;
  359. case ROSE_QBITINCL:
  360. rose->qbitincl = opt ? 1 : 0;
  361. return 0;
  362. default:
  363. return -ENOPROTOOPT;
  364. }
  365. }
  366. static int rose_getsockopt(struct socket *sock, int level, int optname,
  367. char __user *optval, int __user *optlen)
  368. {
  369. struct sock *sk = sock->sk;
  370. struct rose_sock *rose = rose_sk(sk);
  371. int val = 0;
  372. int len;
  373. if (level != SOL_ROSE)
  374. return -ENOPROTOOPT;
  375. if (get_user(len, optlen))
  376. return -EFAULT;
  377. if (len < 0)
  378. return -EINVAL;
  379. switch (optname) {
  380. case ROSE_DEFER:
  381. val = rose->defer;
  382. break;
  383. case ROSE_T1:
  384. val = rose->t1 / HZ;
  385. break;
  386. case ROSE_T2:
  387. val = rose->t2 / HZ;
  388. break;
  389. case ROSE_T3:
  390. val = rose->t3 / HZ;
  391. break;
  392. case ROSE_HOLDBACK:
  393. val = rose->hb / HZ;
  394. break;
  395. case ROSE_IDLE:
  396. val = rose->idle / (60 * HZ);
  397. break;
  398. case ROSE_QBITINCL:
  399. val = rose->qbitincl;
  400. break;
  401. default:
  402. return -ENOPROTOOPT;
  403. }
  404. len = min_t(unsigned int, len, sizeof(int));
  405. if (put_user(len, optlen))
  406. return -EFAULT;
  407. return copy_to_user(optval, &val, len) ? -EFAULT : 0;
  408. }
  409. static int rose_listen(struct socket *sock, int backlog)
  410. {
  411. struct sock *sk = sock->sk;
  412. if (sk->sk_state != TCP_LISTEN) {
  413. struct rose_sock *rose = rose_sk(sk);
  414. rose->dest_ndigis = 0;
  415. memset(&rose->dest_addr, 0, ROSE_ADDR_LEN);
  416. memset(&rose->dest_call, 0, AX25_ADDR_LEN);
  417. memset(rose->dest_digis, 0, AX25_ADDR_LEN * ROSE_MAX_DIGIS);
  418. sk->sk_max_ack_backlog = backlog;
  419. sk->sk_state = TCP_LISTEN;
  420. return 0;
  421. }
  422. return -EOPNOTSUPP;
  423. }
  424. static struct proto rose_proto = {
  425. .name = "ROSE",
  426. .owner = THIS_MODULE,
  427. .obj_size = sizeof(struct rose_sock),
  428. };
  429. static int rose_create(struct net *net, struct socket *sock, int protocol,
  430. int kern)
  431. {
  432. struct sock *sk;
  433. struct rose_sock *rose;
  434. if (!net_eq(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. memset(srose, 0, sizeof(*srose));
  785. if (peer != 0) {
  786. if (sk->sk_state != TCP_ESTABLISHED)
  787. return -ENOTCONN;
  788. srose->srose_family = AF_ROSE;
  789. srose->srose_addr = rose->dest_addr;
  790. srose->srose_call = rose->dest_call;
  791. srose->srose_ndigis = rose->dest_ndigis;
  792. for (n = 0; n < rose->dest_ndigis; n++)
  793. srose->srose_digis[n] = rose->dest_digis[n];
  794. } else {
  795. srose->srose_family = AF_ROSE;
  796. srose->srose_addr = rose->source_addr;
  797. srose->srose_call = rose->source_call;
  798. srose->srose_ndigis = rose->source_ndigis;
  799. for (n = 0; n < rose->source_ndigis; n++)
  800. srose->srose_digis[n] = rose->source_digis[n];
  801. }
  802. *uaddr_len = sizeof(struct full_sockaddr_rose);
  803. return 0;
  804. }
  805. int rose_rx_call_request(struct sk_buff *skb, struct net_device *dev, struct rose_neigh *neigh, unsigned int lci)
  806. {
  807. struct sock *sk;
  808. struct sock *make;
  809. struct rose_sock *make_rose;
  810. struct rose_facilities_struct facilities;
  811. int n, len;
  812. skb->sk = NULL; /* Initially we don't know who it's for */
  813. /*
  814. * skb->data points to the rose frame start
  815. */
  816. memset(&facilities, 0x00, sizeof(struct rose_facilities_struct));
  817. len = (((skb->data[3] >> 4) & 0x0F) + 1) >> 1;
  818. len += (((skb->data[3] >> 0) & 0x0F) + 1) >> 1;
  819. if (!rose_parse_facilities(skb->data + len + 4, &facilities)) {
  820. rose_transmit_clear_request(neigh, lci, ROSE_INVALID_FACILITY, 76);
  821. return 0;
  822. }
  823. sk = rose_find_listener(&facilities.source_addr, &facilities.source_call);
  824. /*
  825. * We can't accept the Call Request.
  826. */
  827. if (sk == NULL || sk_acceptq_is_full(sk) ||
  828. (make = rose_make_new(sk)) == NULL) {
  829. rose_transmit_clear_request(neigh, lci, ROSE_NETWORK_CONGESTION, 120);
  830. return 0;
  831. }
  832. skb->sk = make;
  833. make->sk_state = TCP_ESTABLISHED;
  834. make_rose = rose_sk(make);
  835. make_rose->lci = lci;
  836. make_rose->dest_addr = facilities.dest_addr;
  837. make_rose->dest_call = facilities.dest_call;
  838. make_rose->dest_ndigis = facilities.dest_ndigis;
  839. for (n = 0 ; n < facilities.dest_ndigis ; n++)
  840. make_rose->dest_digis[n] = facilities.dest_digis[n];
  841. make_rose->source_addr = facilities.source_addr;
  842. make_rose->source_call = facilities.source_call;
  843. make_rose->source_ndigis = facilities.source_ndigis;
  844. for (n = 0 ; n < facilities.source_ndigis ; n++)
  845. make_rose->source_digis[n]= facilities.source_digis[n];
  846. make_rose->neighbour = neigh;
  847. make_rose->device = dev;
  848. make_rose->facilities = facilities;
  849. make_rose->neighbour->use++;
  850. if (rose_sk(sk)->defer) {
  851. make_rose->state = ROSE_STATE_5;
  852. } else {
  853. rose_write_internal(make, ROSE_CALL_ACCEPTED);
  854. make_rose->state = ROSE_STATE_3;
  855. rose_start_idletimer(make);
  856. }
  857. make_rose->condition = 0x00;
  858. make_rose->vs = 0;
  859. make_rose->va = 0;
  860. make_rose->vr = 0;
  861. make_rose->vl = 0;
  862. sk->sk_ack_backlog++;
  863. rose_insert_socket(make);
  864. skb_queue_head(&sk->sk_receive_queue, skb);
  865. rose_start_heartbeat(make);
  866. if (!sock_flag(sk, SOCK_DEAD))
  867. sk->sk_data_ready(sk, skb->len);
  868. return 1;
  869. }
  870. static int rose_sendmsg(struct kiocb *iocb, struct socket *sock,
  871. struct msghdr *msg, size_t len)
  872. {
  873. struct sock *sk = sock->sk;
  874. struct rose_sock *rose = rose_sk(sk);
  875. struct sockaddr_rose *usrose = (struct sockaddr_rose *)msg->msg_name;
  876. int err;
  877. struct full_sockaddr_rose srose;
  878. struct sk_buff *skb;
  879. unsigned char *asmptr;
  880. int n, size, qbit = 0;
  881. if (msg->msg_flags & ~(MSG_DONTWAIT|MSG_EOR|MSG_CMSG_COMPAT))
  882. return -EINVAL;
  883. if (sock_flag(sk, SOCK_ZAPPED))
  884. return -EADDRNOTAVAIL;
  885. if (sk->sk_shutdown & SEND_SHUTDOWN) {
  886. send_sig(SIGPIPE, current, 0);
  887. return -EPIPE;
  888. }
  889. if (rose->neighbour == NULL || rose->device == NULL)
  890. return -ENETUNREACH;
  891. if (usrose != NULL) {
  892. if (msg->msg_namelen != sizeof(struct sockaddr_rose) && msg->msg_namelen != sizeof(struct full_sockaddr_rose))
  893. return -EINVAL;
  894. memset(&srose, 0, sizeof(struct full_sockaddr_rose));
  895. memcpy(&srose, usrose, msg->msg_namelen);
  896. if (rosecmp(&rose->dest_addr, &srose.srose_addr) != 0 ||
  897. ax25cmp(&rose->dest_call, &srose.srose_call) != 0)
  898. return -EISCONN;
  899. if (srose.srose_ndigis != rose->dest_ndigis)
  900. return -EISCONN;
  901. if (srose.srose_ndigis == rose->dest_ndigis) {
  902. for (n = 0 ; n < srose.srose_ndigis ; n++)
  903. if (ax25cmp(&rose->dest_digis[n],
  904. &srose.srose_digis[n]))
  905. return -EISCONN;
  906. }
  907. if (srose.srose_family != AF_ROSE)
  908. return -EINVAL;
  909. } else {
  910. if (sk->sk_state != TCP_ESTABLISHED)
  911. return -ENOTCONN;
  912. srose.srose_family = AF_ROSE;
  913. srose.srose_addr = rose->dest_addr;
  914. srose.srose_call = rose->dest_call;
  915. srose.srose_ndigis = rose->dest_ndigis;
  916. for (n = 0 ; n < rose->dest_ndigis ; n++)
  917. srose.srose_digis[n] = rose->dest_digis[n];
  918. }
  919. SOCK_DEBUG(sk, "ROSE: sendto: Addresses built.\n");
  920. /* Build a packet */
  921. SOCK_DEBUG(sk, "ROSE: sendto: building packet.\n");
  922. /* Sanity check the packet size */
  923. if (len > 65535)
  924. return -EMSGSIZE;
  925. size = len + AX25_BPQ_HEADER_LEN + AX25_MAX_HEADER_LEN + ROSE_MIN_LEN;
  926. if ((skb = sock_alloc_send_skb(sk, size, msg->msg_flags & MSG_DONTWAIT, &err)) == NULL)
  927. return err;
  928. skb_reserve(skb, AX25_BPQ_HEADER_LEN + AX25_MAX_HEADER_LEN + ROSE_MIN_LEN);
  929. /*
  930. * Put the data on the end
  931. */
  932. SOCK_DEBUG(sk, "ROSE: Appending user data\n");
  933. skb_reset_transport_header(skb);
  934. skb_put(skb, len);
  935. err = memcpy_fromiovec(skb_transport_header(skb), msg->msg_iov, len);
  936. if (err) {
  937. kfree_skb(skb);
  938. return err;
  939. }
  940. /*
  941. * If the Q BIT Include socket option is in force, the first
  942. * byte of the user data is the logical value of the Q Bit.
  943. */
  944. if (rose->qbitincl) {
  945. qbit = skb->data[0];
  946. skb_pull(skb, 1);
  947. }
  948. /*
  949. * Push down the ROSE header
  950. */
  951. asmptr = skb_push(skb, ROSE_MIN_LEN);
  952. SOCK_DEBUG(sk, "ROSE: Building Network Header.\n");
  953. /* Build a ROSE Network header */
  954. asmptr[0] = ((rose->lci >> 8) & 0x0F) | ROSE_GFI;
  955. asmptr[1] = (rose->lci >> 0) & 0xFF;
  956. asmptr[2] = ROSE_DATA;
  957. if (qbit)
  958. asmptr[0] |= ROSE_Q_BIT;
  959. SOCK_DEBUG(sk, "ROSE: Built header.\n");
  960. SOCK_DEBUG(sk, "ROSE: Transmitting buffer\n");
  961. if (sk->sk_state != TCP_ESTABLISHED) {
  962. kfree_skb(skb);
  963. return -ENOTCONN;
  964. }
  965. #ifdef M_BIT
  966. #define ROSE_PACLEN (256-ROSE_MIN_LEN)
  967. if (skb->len - ROSE_MIN_LEN > ROSE_PACLEN) {
  968. unsigned char header[ROSE_MIN_LEN];
  969. struct sk_buff *skbn;
  970. int frontlen;
  971. int lg;
  972. /* Save a copy of the Header */
  973. skb_copy_from_linear_data(skb, header, ROSE_MIN_LEN);
  974. skb_pull(skb, ROSE_MIN_LEN);
  975. frontlen = skb_headroom(skb);
  976. while (skb->len > 0) {
  977. if ((skbn = sock_alloc_send_skb(sk, frontlen + ROSE_PACLEN, 0, &err)) == NULL) {
  978. kfree_skb(skb);
  979. return err;
  980. }
  981. skbn->sk = sk;
  982. skbn->free = 1;
  983. skbn->arp = 1;
  984. skb_reserve(skbn, frontlen);
  985. lg = (ROSE_PACLEN > skb->len) ? skb->len : ROSE_PACLEN;
  986. /* Copy the user data */
  987. skb_copy_from_linear_data(skb, skb_put(skbn, lg), lg);
  988. skb_pull(skb, lg);
  989. /* Duplicate the Header */
  990. skb_push(skbn, ROSE_MIN_LEN);
  991. skb_copy_to_linear_data(skbn, header, ROSE_MIN_LEN);
  992. if (skb->len > 0)
  993. skbn->data[2] |= M_BIT;
  994. skb_queue_tail(&sk->sk_write_queue, skbn); /* Throw it on the queue */
  995. }
  996. skb->free = 1;
  997. kfree_skb(skb);
  998. } else {
  999. skb_queue_tail(&sk->sk_write_queue, skb); /* Throw it on the queue */
  1000. }
  1001. #else
  1002. skb_queue_tail(&sk->sk_write_queue, skb); /* Shove it onto the queue */
  1003. #endif
  1004. rose_kick(sk);
  1005. return len;
  1006. }
  1007. static int rose_recvmsg(struct kiocb *iocb, struct socket *sock,
  1008. struct msghdr *msg, size_t size, int flags)
  1009. {
  1010. struct sock *sk = sock->sk;
  1011. struct rose_sock *rose = rose_sk(sk);
  1012. struct sockaddr_rose *srose = (struct sockaddr_rose *)msg->msg_name;
  1013. size_t copied;
  1014. unsigned char *asmptr;
  1015. struct sk_buff *skb;
  1016. int n, er, qbit;
  1017. /*
  1018. * This works for seqpacket too. The receiver has ordered the queue for
  1019. * us! We do one quick check first though
  1020. */
  1021. if (sk->sk_state != TCP_ESTABLISHED)
  1022. return -ENOTCONN;
  1023. /* Now we can treat all alike */
  1024. if ((skb = skb_recv_datagram(sk, flags & ~MSG_DONTWAIT, flags & MSG_DONTWAIT, &er)) == NULL)
  1025. return er;
  1026. qbit = (skb->data[0] & ROSE_Q_BIT) == ROSE_Q_BIT;
  1027. skb_pull(skb, ROSE_MIN_LEN);
  1028. if (rose->qbitincl) {
  1029. asmptr = skb_push(skb, 1);
  1030. *asmptr = qbit;
  1031. }
  1032. skb_reset_transport_header(skb);
  1033. copied = skb->len;
  1034. if (copied > size) {
  1035. copied = size;
  1036. msg->msg_flags |= MSG_TRUNC;
  1037. }
  1038. skb_copy_datagram_iovec(skb, 0, msg->msg_iov, copied);
  1039. if (srose != NULL) {
  1040. srose->srose_family = AF_ROSE;
  1041. srose->srose_addr = rose->dest_addr;
  1042. srose->srose_call = rose->dest_call;
  1043. srose->srose_ndigis = rose->dest_ndigis;
  1044. if (msg->msg_namelen >= sizeof(struct full_sockaddr_rose)) {
  1045. struct full_sockaddr_rose *full_srose = (struct full_sockaddr_rose *)msg->msg_name;
  1046. for (n = 0 ; n < rose->dest_ndigis ; n++)
  1047. full_srose->srose_digis[n] = rose->dest_digis[n];
  1048. msg->msg_namelen = sizeof(struct full_sockaddr_rose);
  1049. } else {
  1050. if (rose->dest_ndigis >= 1) {
  1051. srose->srose_ndigis = 1;
  1052. srose->srose_digi = rose->dest_digis[0];
  1053. }
  1054. msg->msg_namelen = sizeof(struct sockaddr_rose);
  1055. }
  1056. }
  1057. skb_free_datagram(sk, skb);
  1058. return copied;
  1059. }
  1060. static int rose_ioctl(struct socket *sock, unsigned int cmd, unsigned long arg)
  1061. {
  1062. struct sock *sk = sock->sk;
  1063. struct rose_sock *rose = rose_sk(sk);
  1064. void __user *argp = (void __user *)arg;
  1065. switch (cmd) {
  1066. case TIOCOUTQ: {
  1067. long amount;
  1068. amount = sk->sk_sndbuf - sk_wmem_alloc_get(sk);
  1069. if (amount < 0)
  1070. amount = 0;
  1071. return put_user(amount, (unsigned int __user *) argp);
  1072. }
  1073. case TIOCINQ: {
  1074. struct sk_buff *skb;
  1075. long amount = 0L;
  1076. /* These two are safe on a single CPU system as only user tasks fiddle here */
  1077. if ((skb = skb_peek(&sk->sk_receive_queue)) != NULL)
  1078. amount = skb->len;
  1079. return put_user(amount, (unsigned int __user *) argp);
  1080. }
  1081. case SIOCGSTAMP:
  1082. return sock_get_timestamp(sk, (struct timeval __user *) argp);
  1083. case SIOCGSTAMPNS:
  1084. return sock_get_timestampns(sk, (struct timespec __user *) argp);
  1085. case SIOCGIFADDR:
  1086. case SIOCSIFADDR:
  1087. case SIOCGIFDSTADDR:
  1088. case SIOCSIFDSTADDR:
  1089. case SIOCGIFBRDADDR:
  1090. case SIOCSIFBRDADDR:
  1091. case SIOCGIFNETMASK:
  1092. case SIOCSIFNETMASK:
  1093. case SIOCGIFMETRIC:
  1094. case SIOCSIFMETRIC:
  1095. return -EINVAL;
  1096. case SIOCADDRT:
  1097. case SIOCDELRT:
  1098. case SIOCRSCLRRT:
  1099. if (!capable(CAP_NET_ADMIN))
  1100. return -EPERM;
  1101. return rose_rt_ioctl(cmd, argp);
  1102. case SIOCRSGCAUSE: {
  1103. struct rose_cause_struct rose_cause;
  1104. rose_cause.cause = rose->cause;
  1105. rose_cause.diagnostic = rose->diagnostic;
  1106. return copy_to_user(argp, &rose_cause, sizeof(struct rose_cause_struct)) ? -EFAULT : 0;
  1107. }
  1108. case SIOCRSSCAUSE: {
  1109. struct rose_cause_struct rose_cause;
  1110. if (copy_from_user(&rose_cause, argp, sizeof(struct rose_cause_struct)))
  1111. return -EFAULT;
  1112. rose->cause = rose_cause.cause;
  1113. rose->diagnostic = rose_cause.diagnostic;
  1114. return 0;
  1115. }
  1116. case SIOCRSSL2CALL:
  1117. if (!capable(CAP_NET_ADMIN)) return -EPERM;
  1118. if (ax25cmp(&rose_callsign, &null_ax25_address) != 0)
  1119. ax25_listen_release(&rose_callsign, NULL);
  1120. if (copy_from_user(&rose_callsign, argp, sizeof(ax25_address)))
  1121. return -EFAULT;
  1122. if (ax25cmp(&rose_callsign, &null_ax25_address) != 0)
  1123. return ax25_listen_register(&rose_callsign, NULL);
  1124. return 0;
  1125. case SIOCRSGL2CALL:
  1126. return copy_to_user(argp, &rose_callsign, sizeof(ax25_address)) ? -EFAULT : 0;
  1127. case SIOCRSACCEPT:
  1128. if (rose->state == ROSE_STATE_5) {
  1129. rose_write_internal(sk, ROSE_CALL_ACCEPTED);
  1130. rose_start_idletimer(sk);
  1131. rose->condition = 0x00;
  1132. rose->vs = 0;
  1133. rose->va = 0;
  1134. rose->vr = 0;
  1135. rose->vl = 0;
  1136. rose->state = ROSE_STATE_3;
  1137. }
  1138. return 0;
  1139. default:
  1140. return -ENOIOCTLCMD;
  1141. }
  1142. return 0;
  1143. }
  1144. #ifdef CONFIG_PROC_FS
  1145. static void *rose_info_start(struct seq_file *seq, loff_t *pos)
  1146. __acquires(rose_list_lock)
  1147. {
  1148. spin_lock_bh(&rose_list_lock);
  1149. return seq_hlist_start_head(&rose_list, *pos);
  1150. }
  1151. static void *rose_info_next(struct seq_file *seq, void *v, loff_t *pos)
  1152. {
  1153. return seq_hlist_next(v, &rose_list, pos);
  1154. }
  1155. static void rose_info_stop(struct seq_file *seq, void *v)
  1156. __releases(rose_list_lock)
  1157. {
  1158. spin_unlock_bh(&rose_list_lock);
  1159. }
  1160. static int rose_info_show(struct seq_file *seq, void *v)
  1161. {
  1162. char buf[11], rsbuf[11];
  1163. if (v == SEQ_START_TOKEN)
  1164. seq_puts(seq,
  1165. "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");
  1166. else {
  1167. struct sock *s = sk_entry(v);
  1168. struct rose_sock *rose = rose_sk(s);
  1169. const char *devname, *callsign;
  1170. const struct net_device *dev = rose->device;
  1171. if (!dev)
  1172. devname = "???";
  1173. else
  1174. devname = dev->name;
  1175. seq_printf(seq, "%-10s %-9s ",
  1176. rose2asc(rsbuf, &rose->dest_addr),
  1177. ax2asc(buf, &rose->dest_call));
  1178. if (ax25cmp(&rose->source_call, &null_ax25_address) == 0)
  1179. callsign = "??????-?";
  1180. else
  1181. callsign = ax2asc(buf, &rose->source_call);
  1182. seq_printf(seq,
  1183. "%-10s %-9s %-5s %3.3X %05d %d %d %d %d %3lu %3lu %3lu %3lu %3lu %3lu/%03lu %5d %5d %ld\n",
  1184. rose2asc(rsbuf, &rose->source_addr),
  1185. callsign,
  1186. devname,
  1187. rose->lci & 0x0FFF,
  1188. (rose->neighbour) ? rose->neighbour->number : 0,
  1189. rose->state,
  1190. rose->vs,
  1191. rose->vr,
  1192. rose->va,
  1193. ax25_display_timer(&rose->timer) / HZ,
  1194. rose->t1 / HZ,
  1195. rose->t2 / HZ,
  1196. rose->t3 / HZ,
  1197. rose->hb / HZ,
  1198. ax25_display_timer(&rose->idletimer) / (60 * HZ),
  1199. rose->idle / (60 * HZ),
  1200. sk_wmem_alloc_get(s),
  1201. sk_rmem_alloc_get(s),
  1202. s->sk_socket ? SOCK_INODE(s->sk_socket)->i_ino : 0L);
  1203. }
  1204. return 0;
  1205. }
  1206. static const struct seq_operations rose_info_seqops = {
  1207. .start = rose_info_start,
  1208. .next = rose_info_next,
  1209. .stop = rose_info_stop,
  1210. .show = rose_info_show,
  1211. };
  1212. static int rose_info_open(struct inode *inode, struct file *file)
  1213. {
  1214. return seq_open(file, &rose_info_seqops);
  1215. }
  1216. static const struct file_operations rose_info_fops = {
  1217. .owner = THIS_MODULE,
  1218. .open = rose_info_open,
  1219. .read = seq_read,
  1220. .llseek = seq_lseek,
  1221. .release = seq_release,
  1222. };
  1223. #endif /* CONFIG_PROC_FS */
  1224. static const struct net_proto_family rose_family_ops = {
  1225. .family = PF_ROSE,
  1226. .create = rose_create,
  1227. .owner = THIS_MODULE,
  1228. };
  1229. static const struct proto_ops rose_proto_ops = {
  1230. .family = PF_ROSE,
  1231. .owner = THIS_MODULE,
  1232. .release = rose_release,
  1233. .bind = rose_bind,
  1234. .connect = rose_connect,
  1235. .socketpair = sock_no_socketpair,
  1236. .accept = rose_accept,
  1237. .getname = rose_getname,
  1238. .poll = datagram_poll,
  1239. .ioctl = rose_ioctl,
  1240. .listen = rose_listen,
  1241. .shutdown = sock_no_shutdown,
  1242. .setsockopt = rose_setsockopt,
  1243. .getsockopt = rose_getsockopt,
  1244. .sendmsg = rose_sendmsg,
  1245. .recvmsg = rose_recvmsg,
  1246. .mmap = sock_no_mmap,
  1247. .sendpage = sock_no_sendpage,
  1248. };
  1249. static struct notifier_block rose_dev_notifier = {
  1250. .notifier_call = rose_device_event,
  1251. };
  1252. static struct net_device **dev_rose;
  1253. static struct ax25_protocol rose_pid = {
  1254. .pid = AX25_P_ROSE,
  1255. .func = rose_route_frame
  1256. };
  1257. static struct ax25_linkfail rose_linkfail_notifier = {
  1258. .func = rose_link_failed
  1259. };
  1260. static int __init rose_proto_init(void)
  1261. {
  1262. int i;
  1263. int rc;
  1264. if (rose_ndevs > 0x7FFFFFFF/sizeof(struct net_device *)) {
  1265. printk(KERN_ERR "ROSE: rose_proto_init - rose_ndevs parameter to large\n");
  1266. rc = -EINVAL;
  1267. goto out;
  1268. }
  1269. rc = proto_register(&rose_proto, 0);
  1270. if (rc != 0)
  1271. goto out;
  1272. rose_callsign = null_ax25_address;
  1273. dev_rose = kzalloc(rose_ndevs * sizeof(struct net_device *), GFP_KERNEL);
  1274. if (dev_rose == NULL) {
  1275. printk(KERN_ERR "ROSE: rose_proto_init - unable to allocate device structure\n");
  1276. rc = -ENOMEM;
  1277. goto out_proto_unregister;
  1278. }
  1279. for (i = 0; i < rose_ndevs; i++) {
  1280. struct net_device *dev;
  1281. char name[IFNAMSIZ];
  1282. sprintf(name, "rose%d", i);
  1283. dev = alloc_netdev(0, name, rose_setup);
  1284. if (!dev) {
  1285. printk(KERN_ERR "ROSE: rose_proto_init - unable to allocate memory\n");
  1286. rc = -ENOMEM;
  1287. goto fail;
  1288. }
  1289. rc = register_netdev(dev);
  1290. if (rc) {
  1291. printk(KERN_ERR "ROSE: netdevice registration failed\n");
  1292. free_netdev(dev);
  1293. goto fail;
  1294. }
  1295. rose_set_lockdep_key(dev);
  1296. dev_rose[i] = dev;
  1297. }
  1298. sock_register(&rose_family_ops);
  1299. register_netdevice_notifier(&rose_dev_notifier);
  1300. ax25_register_pid(&rose_pid);
  1301. ax25_linkfail_register(&rose_linkfail_notifier);
  1302. #ifdef CONFIG_SYSCTL
  1303. rose_register_sysctl();
  1304. #endif
  1305. rose_loopback_init();
  1306. rose_add_loopback_neigh();
  1307. proc_net_fops_create(&init_net, "rose", S_IRUGO, &rose_info_fops);
  1308. proc_net_fops_create(&init_net, "rose_neigh", S_IRUGO, &rose_neigh_fops);
  1309. proc_net_fops_create(&init_net, "rose_nodes", S_IRUGO, &rose_nodes_fops);
  1310. proc_net_fops_create(&init_net, "rose_routes", S_IRUGO, &rose_routes_fops);
  1311. out:
  1312. return rc;
  1313. fail:
  1314. while (--i >= 0) {
  1315. unregister_netdev(dev_rose[i]);
  1316. free_netdev(dev_rose[i]);
  1317. }
  1318. kfree(dev_rose);
  1319. out_proto_unregister:
  1320. proto_unregister(&rose_proto);
  1321. goto out;
  1322. }
  1323. module_init(rose_proto_init);
  1324. module_param(rose_ndevs, int, 0);
  1325. MODULE_PARM_DESC(rose_ndevs, "number of ROSE devices");
  1326. MODULE_AUTHOR("Jonathan Naylor G4KLX <g4klx@g4klx.demon.co.uk>");
  1327. MODULE_DESCRIPTION("The amateur radio ROSE network layer protocol");
  1328. MODULE_LICENSE("GPL");
  1329. MODULE_ALIAS_NETPROTO(PF_ROSE);
  1330. static void __exit rose_exit(void)
  1331. {
  1332. int i;
  1333. proc_net_remove(&init_net, "rose");
  1334. proc_net_remove(&init_net, "rose_neigh");
  1335. proc_net_remove(&init_net, "rose_nodes");
  1336. proc_net_remove(&init_net, "rose_routes");
  1337. rose_loopback_clear();
  1338. rose_rt_free();
  1339. ax25_protocol_release(AX25_P_ROSE);
  1340. ax25_linkfail_release(&rose_linkfail_notifier);
  1341. if (ax25cmp(&rose_callsign, &null_ax25_address) != 0)
  1342. ax25_listen_release(&rose_callsign, NULL);
  1343. #ifdef CONFIG_SYSCTL
  1344. rose_unregister_sysctl();
  1345. #endif
  1346. unregister_netdevice_notifier(&rose_dev_notifier);
  1347. sock_unregister(PF_ROSE);
  1348. for (i = 0; i < rose_ndevs; i++) {
  1349. struct net_device *dev = dev_rose[i];
  1350. if (dev) {
  1351. unregister_netdev(dev);
  1352. free_netdev(dev);
  1353. }
  1354. }
  1355. kfree(dev_rose);
  1356. proto_unregister(&rose_proto);
  1357. }
  1358. module_exit(rose_exit);