af_rose.c 38 KB

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