af_rose.c 38 KB

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