af_rose.c 38 KB

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