af_rose.c 38 KB

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