af_rose.c 38 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675
  1. /*
  2. * This program is free software; you can redistribute it and/or modify
  3. * it under the terms of the GNU General Public License as published by
  4. * the Free Software Foundation; either version 2 of the License, or
  5. * (at your option) any later version.
  6. *
  7. * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx.demon.co.uk)
  8. * Copyright (C) Alan Cox GW4PTS (alan@lxorguk.ukuu.org.uk)
  9. * Copyright (C) Terry Dawson VK2KTJ (terry@animats.net)
  10. * Copyright (C) Tomi Manninen OH2BNS (oh2bns@sral.fi)
  11. */
  12. #include <linux/capability.h>
  13. #include <linux/module.h>
  14. #include <linux/moduleparam.h>
  15. #include <linux/init.h>
  16. #include <linux/errno.h>
  17. #include <linux/types.h>
  18. #include <linux/socket.h>
  19. #include <linux/in.h>
  20. #include <linux/kernel.h>
  21. #include <linux/sched.h>
  22. #include <linux/spinlock.h>
  23. #include <linux/timer.h>
  24. #include <linux/string.h>
  25. #include <linux/sockios.h>
  26. #include <linux/net.h>
  27. #include <linux/stat.h>
  28. #include <net/net_namespace.h>
  29. #include <net/ax25.h>
  30. #include <linux/inet.h>
  31. #include <linux/netdevice.h>
  32. #include <linux/if_arp.h>
  33. #include <linux/skbuff.h>
  34. #include <net/sock.h>
  35. #include <asm/system.h>
  36. #include <asm/uaccess.h>
  37. #include <linux/fcntl.h>
  38. #include <linux/termios.h>
  39. #include <linux/mm.h>
  40. #include <linux/interrupt.h>
  41. #include <linux/notifier.h>
  42. #include <net/rose.h>
  43. #include <linux/proc_fs.h>
  44. #include <linux/seq_file.h>
  45. #include <net/tcp_states.h>
  46. #include <net/ip.h>
  47. #include <net/arp.h>
  48. static int rose_ndevs = 10;
  49. int sysctl_rose_restart_request_timeout = ROSE_DEFAULT_T0;
  50. int sysctl_rose_call_request_timeout = ROSE_DEFAULT_T1;
  51. int sysctl_rose_reset_request_timeout = ROSE_DEFAULT_T2;
  52. int sysctl_rose_clear_request_timeout = ROSE_DEFAULT_T3;
  53. int sysctl_rose_no_activity_timeout = ROSE_DEFAULT_IDLE;
  54. int sysctl_rose_ack_hold_back_timeout = ROSE_DEFAULT_HB;
  55. int sysctl_rose_routing_control = ROSE_DEFAULT_ROUTING;
  56. int sysctl_rose_link_fail_timeout = ROSE_DEFAULT_FAIL_TIMEOUT;
  57. int sysctl_rose_maximum_vcs = ROSE_DEFAULT_MAXVC;
  58. int sysctl_rose_window_size = ROSE_DEFAULT_WINDOW_SIZE;
  59. static HLIST_HEAD(rose_list);
  60. static DEFINE_SPINLOCK(rose_list_lock);
  61. static struct proto_ops rose_proto_ops;
  62. ax25_address rose_callsign;
  63. /*
  64. * ROSE network devices are virtual network devices encapsulating ROSE
  65. * frames into AX.25 which will be sent through an AX.25 device, so form a
  66. * special "super class" of normal net devices; split their locks off into a
  67. * separate class since they always nest.
  68. */
  69. static struct lock_class_key rose_netdev_xmit_lock_key;
  70. 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, 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. {
  431. struct sock *sk;
  432. struct rose_sock *rose;
  433. if (net != &init_net)
  434. return -EAFNOSUPPORT;
  435. if (sock->type != SOCK_SEQPACKET || protocol != 0)
  436. return -ESOCKTNOSUPPORT;
  437. sk = sk_alloc(net, PF_ROSE, GFP_ATOMIC, &rose_proto);
  438. if (sk == NULL)
  439. return -ENOMEM;
  440. rose = rose_sk(sk);
  441. sock_init_data(sock, sk);
  442. skb_queue_head_init(&rose->ack_queue);
  443. #ifdef M_BIT
  444. skb_queue_head_init(&rose->frag_queue);
  445. rose->fraglen = 0;
  446. #endif
  447. sock->ops = &rose_proto_ops;
  448. sk->sk_protocol = protocol;
  449. init_timer(&rose->timer);
  450. init_timer(&rose->idletimer);
  451. rose->t1 = msecs_to_jiffies(sysctl_rose_call_request_timeout);
  452. rose->t2 = msecs_to_jiffies(sysctl_rose_reset_request_timeout);
  453. rose->t3 = msecs_to_jiffies(sysctl_rose_clear_request_timeout);
  454. rose->hb = msecs_to_jiffies(sysctl_rose_ack_hold_back_timeout);
  455. rose->idle = msecs_to_jiffies(sysctl_rose_no_activity_timeout);
  456. rose->state = ROSE_STATE_0;
  457. return 0;
  458. }
  459. static struct sock *rose_make_new(struct sock *osk)
  460. {
  461. struct sock *sk;
  462. struct rose_sock *rose, *orose;
  463. if (osk->sk_type != SOCK_SEQPACKET)
  464. return NULL;
  465. sk = sk_alloc(sock_net(osk), PF_ROSE, GFP_ATOMIC, &rose_proto);
  466. if (sk == NULL)
  467. return NULL;
  468. rose = rose_sk(sk);
  469. sock_init_data(NULL, sk);
  470. skb_queue_head_init(&rose->ack_queue);
  471. #ifdef M_BIT
  472. skb_queue_head_init(&rose->frag_queue);
  473. rose->fraglen = 0;
  474. #endif
  475. sk->sk_type = osk->sk_type;
  476. sk->sk_priority = osk->sk_priority;
  477. sk->sk_protocol = osk->sk_protocol;
  478. sk->sk_rcvbuf = osk->sk_rcvbuf;
  479. sk->sk_sndbuf = osk->sk_sndbuf;
  480. sk->sk_state = TCP_ESTABLISHED;
  481. sock_copy_flags(sk, osk);
  482. init_timer(&rose->timer);
  483. init_timer(&rose->idletimer);
  484. orose = rose_sk(osk);
  485. rose->t1 = orose->t1;
  486. rose->t2 = orose->t2;
  487. rose->t3 = orose->t3;
  488. rose->hb = orose->hb;
  489. rose->idle = orose->idle;
  490. rose->defer = orose->defer;
  491. rose->device = orose->device;
  492. rose->qbitincl = orose->qbitincl;
  493. return sk;
  494. }
  495. static int rose_release(struct socket *sock)
  496. {
  497. struct sock *sk = sock->sk;
  498. struct rose_sock *rose;
  499. if (sk == NULL) return 0;
  500. sock_hold(sk);
  501. sock_orphan(sk);
  502. lock_sock(sk);
  503. rose = rose_sk(sk);
  504. switch (rose->state) {
  505. case ROSE_STATE_0:
  506. release_sock(sk);
  507. rose_disconnect(sk, 0, -1, -1);
  508. lock_sock(sk);
  509. rose_destroy_socket(sk);
  510. break;
  511. case ROSE_STATE_2:
  512. rose->neighbour->use--;
  513. release_sock(sk);
  514. rose_disconnect(sk, 0, -1, -1);
  515. lock_sock(sk);
  516. rose_destroy_socket(sk);
  517. break;
  518. case ROSE_STATE_1:
  519. case ROSE_STATE_3:
  520. case ROSE_STATE_4:
  521. case ROSE_STATE_5:
  522. rose_clear_queues(sk);
  523. rose_stop_idletimer(sk);
  524. rose_write_internal(sk, ROSE_CLEAR_REQUEST);
  525. rose_start_t3timer(sk);
  526. rose->state = ROSE_STATE_2;
  527. sk->sk_state = TCP_CLOSE;
  528. sk->sk_shutdown |= SEND_SHUTDOWN;
  529. sk->sk_state_change(sk);
  530. sock_set_flag(sk, SOCK_DEAD);
  531. sock_set_flag(sk, SOCK_DESTROY);
  532. break;
  533. default:
  534. break;
  535. }
  536. sock->sk = NULL;
  537. release_sock(sk);
  538. sock_put(sk);
  539. return 0;
  540. }
  541. static int rose_bind(struct socket *sock, struct sockaddr *uaddr, int addr_len)
  542. {
  543. struct sock *sk = sock->sk;
  544. struct rose_sock *rose = rose_sk(sk);
  545. struct sockaddr_rose *addr = (struct sockaddr_rose *)uaddr;
  546. struct net_device *dev;
  547. ax25_address *source;
  548. ax25_uid_assoc *user;
  549. int n;
  550. if (!sock_flag(sk, SOCK_ZAPPED))
  551. return -EINVAL;
  552. if (addr_len != sizeof(struct sockaddr_rose) && addr_len != sizeof(struct full_sockaddr_rose))
  553. return -EINVAL;
  554. if (addr->srose_family != AF_ROSE)
  555. return -EINVAL;
  556. if (addr_len == sizeof(struct sockaddr_rose) && addr->srose_ndigis > 1)
  557. return -EINVAL;
  558. if (addr->srose_ndigis > ROSE_MAX_DIGIS)
  559. return -EINVAL;
  560. if ((dev = rose_dev_get(&addr->srose_addr)) == NULL) {
  561. SOCK_DEBUG(sk, "ROSE: bind failed: invalid address\n");
  562. return -EADDRNOTAVAIL;
  563. }
  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. SOCK_DEBUG(sk, "ROSE: socket is bound\n");
  589. return 0;
  590. }
  591. static int rose_connect(struct socket *sock, struct sockaddr *uaddr, int addr_len, int flags)
  592. {
  593. struct sock *sk = sock->sk;
  594. struct rose_sock *rose = rose_sk(sk);
  595. struct sockaddr_rose *addr = (struct sockaddr_rose *)uaddr;
  596. unsigned char cause, diagnostic;
  597. struct net_device *dev;
  598. ax25_uid_assoc *user;
  599. int n, err = 0;
  600. if (addr_len != sizeof(struct sockaddr_rose) && addr_len != sizeof(struct full_sockaddr_rose))
  601. return -EINVAL;
  602. if (addr->srose_family != AF_ROSE)
  603. return -EINVAL;
  604. if (addr_len == sizeof(struct sockaddr_rose) && addr->srose_ndigis > 1)
  605. return -EINVAL;
  606. if (addr->srose_ndigis > ROSE_MAX_DIGIS)
  607. return -EINVAL;
  608. /* Source + Destination digis should not exceed ROSE_MAX_DIGIS */
  609. if ((rose->source_ndigis + addr->srose_ndigis) > ROSE_MAX_DIGIS)
  610. return -EINVAL;
  611. lock_sock(sk);
  612. if (sk->sk_state == TCP_ESTABLISHED && sock->state == SS_CONNECTING) {
  613. /* Connect completed during a ERESTARTSYS event */
  614. sock->state = SS_CONNECTED;
  615. goto out_release;
  616. }
  617. if (sk->sk_state == TCP_CLOSE && sock->state == SS_CONNECTING) {
  618. sock->state = SS_UNCONNECTED;
  619. err = -ECONNREFUSED;
  620. goto out_release;
  621. }
  622. if (sk->sk_state == TCP_ESTABLISHED) {
  623. /* No reconnect on a seqpacket socket */
  624. err = -EISCONN;
  625. goto out_release;
  626. }
  627. sk->sk_state = TCP_CLOSE;
  628. sock->state = SS_UNCONNECTED;
  629. rose->neighbour = rose_get_neigh(&addr->srose_addr, &cause,
  630. &diagnostic, 0);
  631. if (!rose->neighbour) {
  632. err = -ENETUNREACH;
  633. goto out_release;
  634. }
  635. rose->lci = rose_new_lci(rose->neighbour);
  636. if (!rose->lci) {
  637. err = -ENETUNREACH;
  638. goto out_release;
  639. }
  640. if (sock_flag(sk, SOCK_ZAPPED)) { /* Must bind first - autobinding in this may or may not work */
  641. sock_reset_flag(sk, SOCK_ZAPPED);
  642. if ((dev = rose_dev_first()) == NULL) {
  643. err = -ENETUNREACH;
  644. goto out_release;
  645. }
  646. user = ax25_findbyuid(current_euid());
  647. if (!user) {
  648. err = -EINVAL;
  649. goto out_release;
  650. }
  651. memcpy(&rose->source_addr, dev->dev_addr, ROSE_ADDR_LEN);
  652. rose->source_call = user->call;
  653. rose->device = dev;
  654. ax25_uid_put(user);
  655. rose_insert_socket(sk); /* Finish the bind */
  656. }
  657. rose_try_next_neigh:
  658. rose->dest_addr = addr->srose_addr;
  659. rose->dest_call = addr->srose_call;
  660. rose->rand = ((long)rose & 0xFFFF) + rose->lci;
  661. rose->dest_ndigis = addr->srose_ndigis;
  662. if (addr_len == sizeof(struct full_sockaddr_rose)) {
  663. struct full_sockaddr_rose *full_addr = (struct full_sockaddr_rose *)uaddr;
  664. for (n = 0 ; n < addr->srose_ndigis ; n++)
  665. rose->dest_digis[n] = full_addr->srose_digis[n];
  666. } else {
  667. if (rose->dest_ndigis == 1) {
  668. rose->dest_digis[0] = addr->srose_digi;
  669. }
  670. }
  671. /* Move to connecting socket, start sending Connect Requests */
  672. sock->state = SS_CONNECTING;
  673. sk->sk_state = TCP_SYN_SENT;
  674. rose->state = ROSE_STATE_1;
  675. rose->neighbour->use++;
  676. rose_write_internal(sk, ROSE_CALL_REQUEST);
  677. rose_start_heartbeat(sk);
  678. rose_start_t1timer(sk);
  679. /* Now the loop */
  680. if (sk->sk_state != TCP_ESTABLISHED && (flags & O_NONBLOCK)) {
  681. err = -EINPROGRESS;
  682. goto out_release;
  683. }
  684. /*
  685. * A Connect Ack with Choke or timeout or failed routing will go to
  686. * closed.
  687. */
  688. if (sk->sk_state == TCP_SYN_SENT) {
  689. DEFINE_WAIT(wait);
  690. for (;;) {
  691. prepare_to_wait(sk->sk_sleep, &wait,
  692. TASK_INTERRUPTIBLE);
  693. if (sk->sk_state != TCP_SYN_SENT)
  694. break;
  695. if (!signal_pending(current)) {
  696. release_sock(sk);
  697. schedule();
  698. lock_sock(sk);
  699. continue;
  700. }
  701. err = -ERESTARTSYS;
  702. break;
  703. }
  704. finish_wait(sk->sk_sleep, &wait);
  705. if (err)
  706. goto out_release;
  707. }
  708. if (sk->sk_state != TCP_ESTABLISHED) {
  709. /* Try next neighbour */
  710. rose->neighbour = rose_get_neigh(&addr->srose_addr, &cause, &diagnostic, 0);
  711. if (rose->neighbour)
  712. goto rose_try_next_neigh;
  713. /* No more neighbours */
  714. sock->state = SS_UNCONNECTED;
  715. err = sock_error(sk); /* Always set at this point */
  716. goto out_release;
  717. }
  718. sock->state = SS_CONNECTED;
  719. out_release:
  720. release_sock(sk);
  721. return err;
  722. }
  723. static int rose_accept(struct socket *sock, struct socket *newsock, int flags)
  724. {
  725. struct sk_buff *skb;
  726. struct sock *newsk;
  727. DEFINE_WAIT(wait);
  728. struct sock *sk;
  729. int err = 0;
  730. if ((sk = sock->sk) == NULL)
  731. return -EINVAL;
  732. lock_sock(sk);
  733. if (sk->sk_type != SOCK_SEQPACKET) {
  734. err = -EOPNOTSUPP;
  735. goto out_release;
  736. }
  737. if (sk->sk_state != TCP_LISTEN) {
  738. err = -EINVAL;
  739. goto out_release;
  740. }
  741. /*
  742. * The write queue this time is holding sockets ready to use
  743. * hooked into the SABM we saved
  744. */
  745. for (;;) {
  746. prepare_to_wait(sk->sk_sleep, &wait, TASK_INTERRUPTIBLE);
  747. skb = skb_dequeue(&sk->sk_receive_queue);
  748. if (skb)
  749. break;
  750. if (flags & O_NONBLOCK) {
  751. err = -EWOULDBLOCK;
  752. break;
  753. }
  754. if (!signal_pending(current)) {
  755. release_sock(sk);
  756. schedule();
  757. lock_sock(sk);
  758. continue;
  759. }
  760. err = -ERESTARTSYS;
  761. break;
  762. }
  763. finish_wait(sk->sk_sleep, &wait);
  764. if (err)
  765. goto out_release;
  766. newsk = skb->sk;
  767. sock_graft(newsk, newsock);
  768. /* Now attach up the new socket */
  769. skb->sk = NULL;
  770. kfree_skb(skb);
  771. sk->sk_ack_backlog--;
  772. out_release:
  773. release_sock(sk);
  774. return err;
  775. }
  776. static int rose_getname(struct socket *sock, struct sockaddr *uaddr,
  777. int *uaddr_len, int peer)
  778. {
  779. struct full_sockaddr_rose *srose = (struct full_sockaddr_rose *)uaddr;
  780. struct sock *sk = sock->sk;
  781. struct rose_sock *rose = rose_sk(sk);
  782. int n;
  783. if (peer != 0) {
  784. if (sk->sk_state != TCP_ESTABLISHED)
  785. return -ENOTCONN;
  786. srose->srose_family = AF_ROSE;
  787. srose->srose_addr = rose->dest_addr;
  788. srose->srose_call = rose->dest_call;
  789. srose->srose_ndigis = rose->dest_ndigis;
  790. for (n = 0; n < rose->dest_ndigis; n++)
  791. srose->srose_digis[n] = rose->dest_digis[n];
  792. } else {
  793. srose->srose_family = AF_ROSE;
  794. srose->srose_addr = rose->source_addr;
  795. srose->srose_call = rose->source_call;
  796. srose->srose_ndigis = rose->source_ndigis;
  797. for (n = 0; n < rose->source_ndigis; n++)
  798. srose->srose_digis[n] = rose->source_digis[n];
  799. }
  800. *uaddr_len = sizeof(struct full_sockaddr_rose);
  801. return 0;
  802. }
  803. int rose_rx_call_request(struct sk_buff *skb, struct net_device *dev, struct rose_neigh *neigh, unsigned int lci)
  804. {
  805. struct sock *sk;
  806. struct sock *make;
  807. struct rose_sock *make_rose;
  808. struct rose_facilities_struct facilities;
  809. int n, len;
  810. skb->sk = NULL; /* Initially we don't know who it's for */
  811. /*
  812. * skb->data points to the rose frame start
  813. */
  814. memset(&facilities, 0x00, sizeof(struct rose_facilities_struct));
  815. len = (((skb->data[3] >> 4) & 0x0F) + 1) >> 1;
  816. len += (((skb->data[3] >> 0) & 0x0F) + 1) >> 1;
  817. if (!rose_parse_facilities(skb->data + len + 4, &facilities)) {
  818. rose_transmit_clear_request(neigh, lci, ROSE_INVALID_FACILITY, 76);
  819. return 0;
  820. }
  821. sk = rose_find_listener(&facilities.source_addr, &facilities.source_call);
  822. /*
  823. * We can't accept the Call Request.
  824. */
  825. if (sk == NULL || sk_acceptq_is_full(sk) ||
  826. (make = rose_make_new(sk)) == NULL) {
  827. rose_transmit_clear_request(neigh, lci, ROSE_NETWORK_CONGESTION, 120);
  828. return 0;
  829. }
  830. skb->sk = make;
  831. make->sk_state = TCP_ESTABLISHED;
  832. make_rose = rose_sk(make);
  833. make_rose->lci = lci;
  834. make_rose->dest_addr = facilities.dest_addr;
  835. make_rose->dest_call = facilities.dest_call;
  836. make_rose->dest_ndigis = facilities.dest_ndigis;
  837. for (n = 0 ; n < facilities.dest_ndigis ; n++)
  838. make_rose->dest_digis[n] = facilities.dest_digis[n];
  839. make_rose->source_addr = facilities.source_addr;
  840. make_rose->source_call = facilities.source_call;
  841. make_rose->source_ndigis = facilities.source_ndigis;
  842. for (n = 0 ; n < facilities.source_ndigis ; n++)
  843. make_rose->source_digis[n]= facilities.source_digis[n];
  844. make_rose->neighbour = neigh;
  845. make_rose->device = dev;
  846. make_rose->facilities = facilities;
  847. make_rose->neighbour->use++;
  848. if (rose_sk(sk)->defer) {
  849. make_rose->state = ROSE_STATE_5;
  850. } else {
  851. rose_write_internal(make, ROSE_CALL_ACCEPTED);
  852. make_rose->state = ROSE_STATE_3;
  853. rose_start_idletimer(make);
  854. }
  855. make_rose->condition = 0x00;
  856. make_rose->vs = 0;
  857. make_rose->va = 0;
  858. make_rose->vr = 0;
  859. make_rose->vl = 0;
  860. sk->sk_ack_backlog++;
  861. rose_insert_socket(make);
  862. skb_queue_head(&sk->sk_receive_queue, skb);
  863. rose_start_heartbeat(make);
  864. if (!sock_flag(sk, SOCK_DEAD))
  865. sk->sk_data_ready(sk, skb->len);
  866. return 1;
  867. }
  868. static int rose_sendmsg(struct kiocb *iocb, struct socket *sock,
  869. struct msghdr *msg, size_t len)
  870. {
  871. struct sock *sk = sock->sk;
  872. struct rose_sock *rose = rose_sk(sk);
  873. struct sockaddr_rose *usrose = (struct sockaddr_rose *)msg->msg_name;
  874. int err;
  875. struct full_sockaddr_rose srose;
  876. struct sk_buff *skb;
  877. unsigned char *asmptr;
  878. int n, size, qbit = 0;
  879. if (msg->msg_flags & ~(MSG_DONTWAIT|MSG_EOR|MSG_CMSG_COMPAT))
  880. return -EINVAL;
  881. if (sock_flag(sk, SOCK_ZAPPED))
  882. return -EADDRNOTAVAIL;
  883. if (sk->sk_shutdown & SEND_SHUTDOWN) {
  884. send_sig(SIGPIPE, current, 0);
  885. return -EPIPE;
  886. }
  887. if (rose->neighbour == NULL || rose->device == NULL)
  888. return -ENETUNREACH;
  889. if (usrose != NULL) {
  890. if (msg->msg_namelen != sizeof(struct sockaddr_rose) && msg->msg_namelen != sizeof(struct full_sockaddr_rose))
  891. return -EINVAL;
  892. memset(&srose, 0, sizeof(struct full_sockaddr_rose));
  893. memcpy(&srose, usrose, msg->msg_namelen);
  894. if (rosecmp(&rose->dest_addr, &srose.srose_addr) != 0 ||
  895. ax25cmp(&rose->dest_call, &srose.srose_call) != 0)
  896. return -EISCONN;
  897. if (srose.srose_ndigis != rose->dest_ndigis)
  898. return -EISCONN;
  899. if (srose.srose_ndigis == rose->dest_ndigis) {
  900. for (n = 0 ; n < srose.srose_ndigis ; n++)
  901. if (ax25cmp(&rose->dest_digis[n],
  902. &srose.srose_digis[n]))
  903. return -EISCONN;
  904. }
  905. if (srose.srose_family != AF_ROSE)
  906. return -EINVAL;
  907. } else {
  908. if (sk->sk_state != TCP_ESTABLISHED)
  909. return -ENOTCONN;
  910. srose.srose_family = AF_ROSE;
  911. srose.srose_addr = rose->dest_addr;
  912. srose.srose_call = rose->dest_call;
  913. srose.srose_ndigis = rose->dest_ndigis;
  914. for (n = 0 ; n < rose->dest_ndigis ; n++)
  915. srose.srose_digis[n] = rose->dest_digis[n];
  916. }
  917. SOCK_DEBUG(sk, "ROSE: sendto: Addresses built.\n");
  918. /* Build a packet */
  919. SOCK_DEBUG(sk, "ROSE: sendto: building packet.\n");
  920. /* Sanity check the packet size */
  921. if (len > 65535)
  922. return -EMSGSIZE;
  923. size = len + AX25_BPQ_HEADER_LEN + AX25_MAX_HEADER_LEN + ROSE_MIN_LEN;
  924. if ((skb = sock_alloc_send_skb(sk, size, msg->msg_flags & MSG_DONTWAIT, &err)) == NULL)
  925. return err;
  926. skb_reserve(skb, AX25_BPQ_HEADER_LEN + AX25_MAX_HEADER_LEN + ROSE_MIN_LEN);
  927. /*
  928. * Put the data on the end
  929. */
  930. SOCK_DEBUG(sk, "ROSE: Appending user data\n");
  931. skb_reset_transport_header(skb);
  932. skb_put(skb, len);
  933. err = memcpy_fromiovec(skb_transport_header(skb), msg->msg_iov, len);
  934. if (err) {
  935. kfree_skb(skb);
  936. return err;
  937. }
  938. /*
  939. * If the Q BIT Include socket option is in force, the first
  940. * byte of the user data is the logical value of the Q Bit.
  941. */
  942. if (rose->qbitincl) {
  943. qbit = skb->data[0];
  944. skb_pull(skb, 1);
  945. }
  946. /*
  947. * Push down the ROSE header
  948. */
  949. asmptr = skb_push(skb, ROSE_MIN_LEN);
  950. SOCK_DEBUG(sk, "ROSE: Building Network Header.\n");
  951. /* Build a ROSE Network header */
  952. asmptr[0] = ((rose->lci >> 8) & 0x0F) | ROSE_GFI;
  953. asmptr[1] = (rose->lci >> 0) & 0xFF;
  954. asmptr[2] = ROSE_DATA;
  955. if (qbit)
  956. asmptr[0] |= ROSE_Q_BIT;
  957. SOCK_DEBUG(sk, "ROSE: Built header.\n");
  958. SOCK_DEBUG(sk, "ROSE: Transmitting buffer\n");
  959. if (sk->sk_state != TCP_ESTABLISHED) {
  960. kfree_skb(skb);
  961. return -ENOTCONN;
  962. }
  963. #ifdef M_BIT
  964. #define ROSE_PACLEN (256-ROSE_MIN_LEN)
  965. if (skb->len - ROSE_MIN_LEN > ROSE_PACLEN) {
  966. unsigned char header[ROSE_MIN_LEN];
  967. struct sk_buff *skbn;
  968. int frontlen;
  969. int lg;
  970. /* Save a copy of the Header */
  971. skb_copy_from_linear_data(skb, header, ROSE_MIN_LEN);
  972. skb_pull(skb, ROSE_MIN_LEN);
  973. frontlen = skb_headroom(skb);
  974. while (skb->len > 0) {
  975. if ((skbn = sock_alloc_send_skb(sk, frontlen + ROSE_PACLEN, 0, &err)) == NULL) {
  976. kfree_skb(skb);
  977. return err;
  978. }
  979. skbn->sk = sk;
  980. skbn->free = 1;
  981. skbn->arp = 1;
  982. skb_reserve(skbn, frontlen);
  983. lg = (ROSE_PACLEN > skb->len) ? skb->len : ROSE_PACLEN;
  984. /* Copy the user data */
  985. skb_copy_from_linear_data(skb, skb_put(skbn, lg), lg);
  986. skb_pull(skb, lg);
  987. /* Duplicate the Header */
  988. skb_push(skbn, ROSE_MIN_LEN);
  989. skb_copy_to_linear_data(skbn, header, ROSE_MIN_LEN);
  990. if (skb->len > 0)
  991. skbn->data[2] |= M_BIT;
  992. skb_queue_tail(&sk->sk_write_queue, skbn); /* Throw it on the queue */
  993. }
  994. skb->free = 1;
  995. kfree_skb(skb);
  996. } else {
  997. skb_queue_tail(&sk->sk_write_queue, skb); /* Throw it on the queue */
  998. }
  999. #else
  1000. skb_queue_tail(&sk->sk_write_queue, skb); /* Shove it onto the queue */
  1001. #endif
  1002. rose_kick(sk);
  1003. return len;
  1004. }
  1005. static int rose_recvmsg(struct kiocb *iocb, struct socket *sock,
  1006. struct msghdr *msg, size_t size, int flags)
  1007. {
  1008. struct sock *sk = sock->sk;
  1009. struct rose_sock *rose = rose_sk(sk);
  1010. struct sockaddr_rose *srose = (struct sockaddr_rose *)msg->msg_name;
  1011. size_t copied;
  1012. unsigned char *asmptr;
  1013. struct sk_buff *skb;
  1014. int n, er, qbit;
  1015. /*
  1016. * This works for seqpacket too. The receiver has ordered the queue for
  1017. * us! We do one quick check first though
  1018. */
  1019. if (sk->sk_state != TCP_ESTABLISHED)
  1020. return -ENOTCONN;
  1021. /* Now we can treat all alike */
  1022. if ((skb = skb_recv_datagram(sk, flags & ~MSG_DONTWAIT, flags & MSG_DONTWAIT, &er)) == NULL)
  1023. return er;
  1024. qbit = (skb->data[0] & ROSE_Q_BIT) == ROSE_Q_BIT;
  1025. skb_pull(skb, ROSE_MIN_LEN);
  1026. if (rose->qbitincl) {
  1027. asmptr = skb_push(skb, 1);
  1028. *asmptr = qbit;
  1029. }
  1030. skb_reset_transport_header(skb);
  1031. copied = skb->len;
  1032. if (copied > size) {
  1033. copied = size;
  1034. msg->msg_flags |= MSG_TRUNC;
  1035. }
  1036. skb_copy_datagram_iovec(skb, 0, msg->msg_iov, copied);
  1037. if (srose != NULL) {
  1038. srose->srose_family = AF_ROSE;
  1039. srose->srose_addr = rose->dest_addr;
  1040. srose->srose_call = rose->dest_call;
  1041. srose->srose_ndigis = rose->dest_ndigis;
  1042. if (msg->msg_namelen >= sizeof(struct full_sockaddr_rose)) {
  1043. struct full_sockaddr_rose *full_srose = (struct full_sockaddr_rose *)msg->msg_name;
  1044. for (n = 0 ; n < rose->dest_ndigis ; n++)
  1045. full_srose->srose_digis[n] = rose->dest_digis[n];
  1046. msg->msg_namelen = sizeof(struct full_sockaddr_rose);
  1047. } else {
  1048. if (rose->dest_ndigis >= 1) {
  1049. srose->srose_ndigis = 1;
  1050. srose->srose_digi = rose->dest_digis[0];
  1051. }
  1052. msg->msg_namelen = sizeof(struct sockaddr_rose);
  1053. }
  1054. }
  1055. skb_free_datagram(sk, skb);
  1056. return copied;
  1057. }
  1058. static int rose_ioctl(struct socket *sock, unsigned int cmd, unsigned long arg)
  1059. {
  1060. struct sock *sk = sock->sk;
  1061. struct rose_sock *rose = rose_sk(sk);
  1062. void __user *argp = (void __user *)arg;
  1063. switch (cmd) {
  1064. case TIOCOUTQ: {
  1065. long amount;
  1066. amount = sk->sk_sndbuf - sk_wmem_alloc_get(sk);
  1067. if (amount < 0)
  1068. amount = 0;
  1069. return put_user(amount, (unsigned int __user *) argp);
  1070. }
  1071. case TIOCINQ: {
  1072. struct sk_buff *skb;
  1073. long amount = 0L;
  1074. /* These two are safe on a single CPU system as only user tasks fiddle here */
  1075. if ((skb = skb_peek(&sk->sk_receive_queue)) != NULL)
  1076. amount = skb->len;
  1077. return put_user(amount, (unsigned int __user *) argp);
  1078. }
  1079. case SIOCGSTAMP:
  1080. return sock_get_timestamp(sk, (struct timeval __user *) argp);
  1081. case SIOCGSTAMPNS:
  1082. return sock_get_timestampns(sk, (struct timespec __user *) argp);
  1083. case SIOCGIFADDR:
  1084. case SIOCSIFADDR:
  1085. case SIOCGIFDSTADDR:
  1086. case SIOCSIFDSTADDR:
  1087. case SIOCGIFBRDADDR:
  1088. case SIOCSIFBRDADDR:
  1089. case SIOCGIFNETMASK:
  1090. case SIOCSIFNETMASK:
  1091. case SIOCGIFMETRIC:
  1092. case SIOCSIFMETRIC:
  1093. return -EINVAL;
  1094. case SIOCADDRT:
  1095. case SIOCDELRT:
  1096. case SIOCRSCLRRT:
  1097. if (!capable(CAP_NET_ADMIN))
  1098. return -EPERM;
  1099. return rose_rt_ioctl(cmd, argp);
  1100. case SIOCRSGCAUSE: {
  1101. struct rose_cause_struct rose_cause;
  1102. rose_cause.cause = rose->cause;
  1103. rose_cause.diagnostic = rose->diagnostic;
  1104. return copy_to_user(argp, &rose_cause, sizeof(struct rose_cause_struct)) ? -EFAULT : 0;
  1105. }
  1106. case SIOCRSSCAUSE: {
  1107. struct rose_cause_struct rose_cause;
  1108. if (copy_from_user(&rose_cause, argp, sizeof(struct rose_cause_struct)))
  1109. return -EFAULT;
  1110. rose->cause = rose_cause.cause;
  1111. rose->diagnostic = rose_cause.diagnostic;
  1112. return 0;
  1113. }
  1114. case SIOCRSSL2CALL:
  1115. if (!capable(CAP_NET_ADMIN)) return -EPERM;
  1116. if (ax25cmp(&rose_callsign, &null_ax25_address) != 0)
  1117. ax25_listen_release(&rose_callsign, NULL);
  1118. if (copy_from_user(&rose_callsign, argp, sizeof(ax25_address)))
  1119. return -EFAULT;
  1120. if (ax25cmp(&rose_callsign, &null_ax25_address) != 0)
  1121. return ax25_listen_register(&rose_callsign, NULL);
  1122. return 0;
  1123. case SIOCRSGL2CALL:
  1124. return copy_to_user(argp, &rose_callsign, sizeof(ax25_address)) ? -EFAULT : 0;
  1125. case SIOCRSACCEPT:
  1126. if (rose->state == ROSE_STATE_5) {
  1127. rose_write_internal(sk, ROSE_CALL_ACCEPTED);
  1128. rose_start_idletimer(sk);
  1129. rose->condition = 0x00;
  1130. rose->vs = 0;
  1131. rose->va = 0;
  1132. rose->vr = 0;
  1133. rose->vl = 0;
  1134. rose->state = ROSE_STATE_3;
  1135. }
  1136. return 0;
  1137. default:
  1138. return -ENOIOCTLCMD;
  1139. }
  1140. return 0;
  1141. }
  1142. #ifdef CONFIG_PROC_FS
  1143. static void *rose_info_start(struct seq_file *seq, loff_t *pos)
  1144. __acquires(rose_list_lock)
  1145. {
  1146. int i;
  1147. struct sock *s;
  1148. struct hlist_node *node;
  1149. spin_lock_bh(&rose_list_lock);
  1150. if (*pos == 0)
  1151. return SEQ_START_TOKEN;
  1152. i = 1;
  1153. sk_for_each(s, node, &rose_list) {
  1154. if (i == *pos)
  1155. return s;
  1156. ++i;
  1157. }
  1158. return NULL;
  1159. }
  1160. static void *rose_info_next(struct seq_file *seq, void *v, loff_t *pos)
  1161. {
  1162. ++*pos;
  1163. return (v == SEQ_START_TOKEN) ? sk_head(&rose_list)
  1164. : sk_next((struct sock *)v);
  1165. }
  1166. static void rose_info_stop(struct seq_file *seq, void *v)
  1167. __releases(rose_list_lock)
  1168. {
  1169. spin_unlock_bh(&rose_list_lock);
  1170. }
  1171. static int rose_info_show(struct seq_file *seq, void *v)
  1172. {
  1173. char buf[11], rsbuf[11];
  1174. if (v == SEQ_START_TOKEN)
  1175. seq_puts(seq,
  1176. "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");
  1177. else {
  1178. struct sock *s = v;
  1179. struct rose_sock *rose = rose_sk(s);
  1180. const char *devname, *callsign;
  1181. const struct net_device *dev = rose->device;
  1182. if (!dev)
  1183. devname = "???";
  1184. else
  1185. devname = dev->name;
  1186. seq_printf(seq, "%-10s %-9s ",
  1187. rose2asc(rsbuf, &rose->dest_addr),
  1188. ax2asc(buf, &rose->dest_call));
  1189. if (ax25cmp(&rose->source_call, &null_ax25_address) == 0)
  1190. callsign = "??????-?";
  1191. else
  1192. callsign = ax2asc(buf, &rose->source_call);
  1193. seq_printf(seq,
  1194. "%-10s %-9s %-5s %3.3X %05d %d %d %d %d %3lu %3lu %3lu %3lu %3lu %3lu/%03lu %5d %5d %ld\n",
  1195. rose2asc(rsbuf, &rose->source_addr),
  1196. callsign,
  1197. devname,
  1198. rose->lci & 0x0FFF,
  1199. (rose->neighbour) ? rose->neighbour->number : 0,
  1200. rose->state,
  1201. rose->vs,
  1202. rose->vr,
  1203. rose->va,
  1204. ax25_display_timer(&rose->timer) / HZ,
  1205. rose->t1 / HZ,
  1206. rose->t2 / HZ,
  1207. rose->t3 / HZ,
  1208. rose->hb / HZ,
  1209. ax25_display_timer(&rose->idletimer) / (60 * HZ),
  1210. rose->idle / (60 * HZ),
  1211. sk_wmem_alloc_get(s),
  1212. sk_rmem_alloc_get(s),
  1213. s->sk_socket ? SOCK_INODE(s->sk_socket)->i_ino : 0L);
  1214. }
  1215. return 0;
  1216. }
  1217. static const struct seq_operations rose_info_seqops = {
  1218. .start = rose_info_start,
  1219. .next = rose_info_next,
  1220. .stop = rose_info_stop,
  1221. .show = rose_info_show,
  1222. };
  1223. static int rose_info_open(struct inode *inode, struct file *file)
  1224. {
  1225. return seq_open(file, &rose_info_seqops);
  1226. }
  1227. static const struct file_operations rose_info_fops = {
  1228. .owner = THIS_MODULE,
  1229. .open = rose_info_open,
  1230. .read = seq_read,
  1231. .llseek = seq_lseek,
  1232. .release = seq_release,
  1233. };
  1234. #endif /* CONFIG_PROC_FS */
  1235. static struct net_proto_family rose_family_ops = {
  1236. .family = PF_ROSE,
  1237. .create = rose_create,
  1238. .owner = THIS_MODULE,
  1239. };
  1240. static struct proto_ops rose_proto_ops = {
  1241. .family = PF_ROSE,
  1242. .owner = THIS_MODULE,
  1243. .release = rose_release,
  1244. .bind = rose_bind,
  1245. .connect = rose_connect,
  1246. .socketpair = sock_no_socketpair,
  1247. .accept = rose_accept,
  1248. .getname = rose_getname,
  1249. .poll = datagram_poll,
  1250. .ioctl = rose_ioctl,
  1251. .listen = rose_listen,
  1252. .shutdown = sock_no_shutdown,
  1253. .setsockopt = rose_setsockopt,
  1254. .getsockopt = rose_getsockopt,
  1255. .sendmsg = rose_sendmsg,
  1256. .recvmsg = rose_recvmsg,
  1257. .mmap = sock_no_mmap,
  1258. .sendpage = sock_no_sendpage,
  1259. };
  1260. static struct notifier_block rose_dev_notifier = {
  1261. .notifier_call = rose_device_event,
  1262. };
  1263. static struct net_device **dev_rose;
  1264. static struct ax25_protocol rose_pid = {
  1265. .pid = AX25_P_ROSE,
  1266. .func = rose_route_frame
  1267. };
  1268. static struct ax25_linkfail rose_linkfail_notifier = {
  1269. .func = rose_link_failed
  1270. };
  1271. static int __init rose_proto_init(void)
  1272. {
  1273. int i;
  1274. int rc;
  1275. if (rose_ndevs > 0x7FFFFFFF/sizeof(struct net_device *)) {
  1276. printk(KERN_ERR "ROSE: rose_proto_init - rose_ndevs parameter to large\n");
  1277. rc = -EINVAL;
  1278. goto out;
  1279. }
  1280. rc = proto_register(&rose_proto, 0);
  1281. if (rc != 0)
  1282. goto out;
  1283. rose_callsign = null_ax25_address;
  1284. dev_rose = kzalloc(rose_ndevs * sizeof(struct net_device *), GFP_KERNEL);
  1285. if (dev_rose == NULL) {
  1286. printk(KERN_ERR "ROSE: rose_proto_init - unable to allocate device structure\n");
  1287. rc = -ENOMEM;
  1288. goto out_proto_unregister;
  1289. }
  1290. for (i = 0; i < rose_ndevs; i++) {
  1291. struct net_device *dev;
  1292. char name[IFNAMSIZ];
  1293. sprintf(name, "rose%d", i);
  1294. dev = alloc_netdev(0, name, rose_setup);
  1295. if (!dev) {
  1296. printk(KERN_ERR "ROSE: rose_proto_init - unable to allocate memory\n");
  1297. rc = -ENOMEM;
  1298. goto fail;
  1299. }
  1300. rc = register_netdev(dev);
  1301. if (rc) {
  1302. printk(KERN_ERR "ROSE: netdevice registration failed\n");
  1303. free_netdev(dev);
  1304. goto fail;
  1305. }
  1306. rose_set_lockdep_key(dev);
  1307. dev_rose[i] = dev;
  1308. }
  1309. sock_register(&rose_family_ops);
  1310. register_netdevice_notifier(&rose_dev_notifier);
  1311. ax25_register_pid(&rose_pid);
  1312. ax25_linkfail_register(&rose_linkfail_notifier);
  1313. #ifdef CONFIG_SYSCTL
  1314. rose_register_sysctl();
  1315. #endif
  1316. rose_loopback_init();
  1317. rose_add_loopback_neigh();
  1318. proc_net_fops_create(&init_net, "rose", S_IRUGO, &rose_info_fops);
  1319. proc_net_fops_create(&init_net, "rose_neigh", S_IRUGO, &rose_neigh_fops);
  1320. proc_net_fops_create(&init_net, "rose_nodes", S_IRUGO, &rose_nodes_fops);
  1321. proc_net_fops_create(&init_net, "rose_routes", S_IRUGO, &rose_routes_fops);
  1322. out:
  1323. return rc;
  1324. fail:
  1325. while (--i >= 0) {
  1326. unregister_netdev(dev_rose[i]);
  1327. free_netdev(dev_rose[i]);
  1328. }
  1329. kfree(dev_rose);
  1330. out_proto_unregister:
  1331. proto_unregister(&rose_proto);
  1332. goto out;
  1333. }
  1334. module_init(rose_proto_init);
  1335. module_param(rose_ndevs, int, 0);
  1336. MODULE_PARM_DESC(rose_ndevs, "number of ROSE devices");
  1337. MODULE_AUTHOR("Jonathan Naylor G4KLX <g4klx@g4klx.demon.co.uk>");
  1338. MODULE_DESCRIPTION("The amateur radio ROSE network layer protocol");
  1339. MODULE_LICENSE("GPL");
  1340. MODULE_ALIAS_NETPROTO(PF_ROSE);
  1341. static void __exit rose_exit(void)
  1342. {
  1343. int i;
  1344. proc_net_remove(&init_net, "rose");
  1345. proc_net_remove(&init_net, "rose_neigh");
  1346. proc_net_remove(&init_net, "rose_nodes");
  1347. proc_net_remove(&init_net, "rose_routes");
  1348. rose_loopback_clear();
  1349. rose_rt_free();
  1350. ax25_protocol_release(AX25_P_ROSE);
  1351. ax25_linkfail_release(&rose_linkfail_notifier);
  1352. if (ax25cmp(&rose_callsign, &null_ax25_address) != 0)
  1353. ax25_listen_release(&rose_callsign, NULL);
  1354. #ifdef CONFIG_SYSCTL
  1355. rose_unregister_sysctl();
  1356. #endif
  1357. unregister_netdevice_notifier(&rose_dev_notifier);
  1358. sock_unregister(PF_ROSE);
  1359. for (i = 0; i < rose_ndevs; i++) {
  1360. struct net_device *dev = dev_rose[i];
  1361. if (dev) {
  1362. unregister_netdev(dev);
  1363. free_netdev(dev);
  1364. }
  1365. }
  1366. kfree(dev_rose);
  1367. proto_unregister(&rose_proto);
  1368. }
  1369. module_exit(rose_exit);