af_rose.c 38 KB

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