af_rose.c 37 KB

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