af_rose.c 38 KB

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