af_rose.c 37 KB

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