af_rose.c 37 KB

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