af_rose.c 39 KB

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