af_rose.c 38 KB

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