ax25_out.c 8.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397
  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) Alan Cox GW4PTS (alan@lxorguk.ukuu.org.uk)
  8. * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx.demon.co.uk)
  9. * Copyright (C) Joerg Reuter DL1BKE (jreuter@yaina.de)
  10. */
  11. #include <linux/errno.h>
  12. #include <linux/types.h>
  13. #include <linux/socket.h>
  14. #include <linux/in.h>
  15. #include <linux/kernel.h>
  16. #include <linux/module.h>
  17. #include <linux/timer.h>
  18. #include <linux/string.h>
  19. #include <linux/sockios.h>
  20. #include <linux/spinlock.h>
  21. #include <linux/net.h>
  22. #include <linux/slab.h>
  23. #include <net/ax25.h>
  24. #include <linux/inet.h>
  25. #include <linux/netdevice.h>
  26. #include <linux/skbuff.h>
  27. #include <net/sock.h>
  28. #include <asm/uaccess.h>
  29. #include <linux/fcntl.h>
  30. #include <linux/mm.h>
  31. #include <linux/interrupt.h>
  32. static DEFINE_SPINLOCK(ax25_frag_lock);
  33. ax25_cb *ax25_send_frame(struct sk_buff *skb, int paclen, ax25_address *src, ax25_address *dest, ax25_digi *digi, struct net_device *dev)
  34. {
  35. ax25_dev *ax25_dev;
  36. ax25_cb *ax25;
  37. /*
  38. * Take the default packet length for the device if zero is
  39. * specified.
  40. */
  41. if (paclen == 0) {
  42. if ((ax25_dev = ax25_dev_ax25dev(dev)) == NULL)
  43. return NULL;
  44. paclen = ax25_dev->values[AX25_VALUES_PACLEN];
  45. }
  46. /*
  47. * Look for an existing connection.
  48. */
  49. if ((ax25 = ax25_find_cb(src, dest, digi, dev)) != NULL) {
  50. ax25_output(ax25, paclen, skb);
  51. return ax25; /* It already existed */
  52. }
  53. if ((ax25_dev = ax25_dev_ax25dev(dev)) == NULL)
  54. return NULL;
  55. if ((ax25 = ax25_create_cb()) == NULL)
  56. return NULL;
  57. ax25_fillin_cb(ax25, ax25_dev);
  58. ax25->source_addr = *src;
  59. ax25->dest_addr = *dest;
  60. if (digi != NULL) {
  61. ax25->digipeat = kmemdup(digi, sizeof(*digi), GFP_ATOMIC);
  62. if (ax25->digipeat == NULL) {
  63. ax25_cb_put(ax25);
  64. return NULL;
  65. }
  66. }
  67. switch (ax25->ax25_dev->values[AX25_VALUES_PROTOCOL]) {
  68. case AX25_PROTO_STD_SIMPLEX:
  69. case AX25_PROTO_STD_DUPLEX:
  70. ax25_std_establish_data_link(ax25);
  71. break;
  72. #ifdef CONFIG_AX25_DAMA_SLAVE
  73. case AX25_PROTO_DAMA_SLAVE:
  74. if (ax25_dev->dama.slave)
  75. ax25_ds_establish_data_link(ax25);
  76. else
  77. ax25_std_establish_data_link(ax25);
  78. break;
  79. #endif
  80. }
  81. /*
  82. * There is one ref for the state machine; a caller needs
  83. * one more to put it back, just like with the existing one.
  84. */
  85. ax25_cb_hold(ax25);
  86. ax25_cb_add(ax25);
  87. ax25->state = AX25_STATE_1;
  88. ax25_start_heartbeat(ax25);
  89. ax25_output(ax25, paclen, skb);
  90. return ax25; /* We had to create it */
  91. }
  92. EXPORT_SYMBOL(ax25_send_frame);
  93. /*
  94. * All outgoing AX.25 I frames pass via this routine. Therefore this is
  95. * where the fragmentation of frames takes place. If fragment is set to
  96. * zero then we are not allowed to do fragmentation, even if the frame
  97. * is too large.
  98. */
  99. void ax25_output(ax25_cb *ax25, int paclen, struct sk_buff *skb)
  100. {
  101. struct sk_buff *skbn;
  102. unsigned char *p;
  103. int frontlen, len, fragno, ka9qfrag, first = 1;
  104. if (paclen < 16) {
  105. WARN_ON_ONCE(1);
  106. kfree_skb(skb);
  107. return;
  108. }
  109. if ((skb->len - 1) > paclen) {
  110. if (*skb->data == AX25_P_TEXT) {
  111. skb_pull(skb, 1); /* skip PID */
  112. ka9qfrag = 0;
  113. } else {
  114. paclen -= 2; /* Allow for fragment control info */
  115. ka9qfrag = 1;
  116. }
  117. fragno = skb->len / paclen;
  118. if (skb->len % paclen == 0) fragno--;
  119. frontlen = skb_headroom(skb); /* Address space + CTRL */
  120. while (skb->len > 0) {
  121. spin_lock_bh(&ax25_frag_lock);
  122. if ((skbn = alloc_skb(paclen + 2 + frontlen, GFP_ATOMIC)) == NULL) {
  123. spin_unlock_bh(&ax25_frag_lock);
  124. printk(KERN_CRIT "AX.25: ax25_output - out of memory\n");
  125. return;
  126. }
  127. if (skb->sk != NULL)
  128. skb_set_owner_w(skbn, skb->sk);
  129. spin_unlock_bh(&ax25_frag_lock);
  130. len = (paclen > skb->len) ? skb->len : paclen;
  131. if (ka9qfrag == 1) {
  132. skb_reserve(skbn, frontlen + 2);
  133. skb_set_network_header(skbn,
  134. skb_network_offset(skb));
  135. skb_copy_from_linear_data(skb, skb_put(skbn, len), len);
  136. p = skb_push(skbn, 2);
  137. *p++ = AX25_P_SEGMENT;
  138. *p = fragno--;
  139. if (first) {
  140. *p |= AX25_SEG_FIRST;
  141. first = 0;
  142. }
  143. } else {
  144. skb_reserve(skbn, frontlen + 1);
  145. skb_set_network_header(skbn,
  146. skb_network_offset(skb));
  147. skb_copy_from_linear_data(skb, skb_put(skbn, len), len);
  148. p = skb_push(skbn, 1);
  149. *p = AX25_P_TEXT;
  150. }
  151. skb_pull(skb, len);
  152. skb_queue_tail(&ax25->write_queue, skbn); /* Throw it on the queue */
  153. }
  154. kfree_skb(skb);
  155. } else {
  156. skb_queue_tail(&ax25->write_queue, skb); /* Throw it on the queue */
  157. }
  158. switch (ax25->ax25_dev->values[AX25_VALUES_PROTOCOL]) {
  159. case AX25_PROTO_STD_SIMPLEX:
  160. case AX25_PROTO_STD_DUPLEX:
  161. ax25_kick(ax25);
  162. break;
  163. #ifdef CONFIG_AX25_DAMA_SLAVE
  164. /*
  165. * A DAMA slave is _required_ to work as normal AX.25L2V2
  166. * if no DAMA master is available.
  167. */
  168. case AX25_PROTO_DAMA_SLAVE:
  169. if (!ax25->ax25_dev->dama.slave) ax25_kick(ax25);
  170. break;
  171. #endif
  172. }
  173. }
  174. /*
  175. * This procedure is passed a buffer descriptor for an iframe. It builds
  176. * the rest of the control part of the frame and then writes it out.
  177. */
  178. static void ax25_send_iframe(ax25_cb *ax25, struct sk_buff *skb, int poll_bit)
  179. {
  180. unsigned char *frame;
  181. if (skb == NULL)
  182. return;
  183. skb_reset_network_header(skb);
  184. if (ax25->modulus == AX25_MODULUS) {
  185. frame = skb_push(skb, 1);
  186. *frame = AX25_I;
  187. *frame |= (poll_bit) ? AX25_PF : 0;
  188. *frame |= (ax25->vr << 5);
  189. *frame |= (ax25->vs << 1);
  190. } else {
  191. frame = skb_push(skb, 2);
  192. frame[0] = AX25_I;
  193. frame[0] |= (ax25->vs << 1);
  194. frame[1] = (poll_bit) ? AX25_EPF : 0;
  195. frame[1] |= (ax25->vr << 1);
  196. }
  197. ax25_start_idletimer(ax25);
  198. ax25_transmit_buffer(ax25, skb, AX25_COMMAND);
  199. }
  200. void ax25_kick(ax25_cb *ax25)
  201. {
  202. struct sk_buff *skb, *skbn;
  203. int last = 1;
  204. unsigned short start, end, next;
  205. if (ax25->state != AX25_STATE_3 && ax25->state != AX25_STATE_4)
  206. return;
  207. if (ax25->condition & AX25_COND_PEER_RX_BUSY)
  208. return;
  209. if (skb_peek(&ax25->write_queue) == NULL)
  210. return;
  211. start = (skb_peek(&ax25->ack_queue) == NULL) ? ax25->va : ax25->vs;
  212. end = (ax25->va + ax25->window) % ax25->modulus;
  213. if (start == end)
  214. return;
  215. /*
  216. * Transmit data until either we're out of data to send or
  217. * the window is full. Send a poll on the final I frame if
  218. * the window is filled.
  219. */
  220. /*
  221. * Dequeue the frame and copy it.
  222. * Check for race with ax25_clear_queues().
  223. */
  224. skb = skb_dequeue(&ax25->write_queue);
  225. if (!skb)
  226. return;
  227. ax25->vs = start;
  228. do {
  229. if ((skbn = skb_clone(skb, GFP_ATOMIC)) == NULL) {
  230. skb_queue_head(&ax25->write_queue, skb);
  231. break;
  232. }
  233. if (skb->sk != NULL)
  234. skb_set_owner_w(skbn, skb->sk);
  235. next = (ax25->vs + 1) % ax25->modulus;
  236. last = (next == end);
  237. /*
  238. * Transmit the frame copy.
  239. * bke 960114: do not set the Poll bit on the last frame
  240. * in DAMA mode.
  241. */
  242. switch (ax25->ax25_dev->values[AX25_VALUES_PROTOCOL]) {
  243. case AX25_PROTO_STD_SIMPLEX:
  244. case AX25_PROTO_STD_DUPLEX:
  245. ax25_send_iframe(ax25, skbn, (last) ? AX25_POLLON : AX25_POLLOFF);
  246. break;
  247. #ifdef CONFIG_AX25_DAMA_SLAVE
  248. case AX25_PROTO_DAMA_SLAVE:
  249. ax25_send_iframe(ax25, skbn, AX25_POLLOFF);
  250. break;
  251. #endif
  252. }
  253. ax25->vs = next;
  254. /*
  255. * Requeue the original data frame.
  256. */
  257. skb_queue_tail(&ax25->ack_queue, skb);
  258. } while (!last && (skb = skb_dequeue(&ax25->write_queue)) != NULL);
  259. ax25->condition &= ~AX25_COND_ACK_PENDING;
  260. if (!ax25_t1timer_running(ax25)) {
  261. ax25_stop_t3timer(ax25);
  262. ax25_calculate_t1(ax25);
  263. ax25_start_t1timer(ax25);
  264. }
  265. }
  266. void ax25_transmit_buffer(ax25_cb *ax25, struct sk_buff *skb, int type)
  267. {
  268. struct sk_buff *skbn;
  269. unsigned char *ptr;
  270. int headroom;
  271. if (ax25->ax25_dev == NULL) {
  272. ax25_disconnect(ax25, ENETUNREACH);
  273. return;
  274. }
  275. headroom = ax25_addr_size(ax25->digipeat);
  276. if (skb_headroom(skb) < headroom) {
  277. if ((skbn = skb_realloc_headroom(skb, headroom)) == NULL) {
  278. printk(KERN_CRIT "AX.25: ax25_transmit_buffer - out of memory\n");
  279. kfree_skb(skb);
  280. return;
  281. }
  282. if (skb->sk != NULL)
  283. skb_set_owner_w(skbn, skb->sk);
  284. consume_skb(skb);
  285. skb = skbn;
  286. }
  287. ptr = skb_push(skb, headroom);
  288. ax25_addr_build(ptr, &ax25->source_addr, &ax25->dest_addr, ax25->digipeat, type, ax25->modulus);
  289. ax25_queue_xmit(skb, ax25->ax25_dev->dev);
  290. }
  291. /*
  292. * A small shim to dev_queue_xmit to add the KISS control byte, and do
  293. * any packet forwarding in operation.
  294. */
  295. void ax25_queue_xmit(struct sk_buff *skb, struct net_device *dev)
  296. {
  297. unsigned char *ptr;
  298. skb->protocol = ax25_type_trans(skb, ax25_fwd_dev(dev));
  299. ptr = skb_push(skb, 1);
  300. *ptr = 0x00; /* KISS */
  301. dev_queue_xmit(skb);
  302. }
  303. int ax25_check_iframes_acked(ax25_cb *ax25, unsigned short nr)
  304. {
  305. if (ax25->vs == nr) {
  306. ax25_frames_acked(ax25, nr);
  307. ax25_calculate_rtt(ax25);
  308. ax25_stop_t1timer(ax25);
  309. ax25_start_t3timer(ax25);
  310. return 1;
  311. } else {
  312. if (ax25->va != nr) {
  313. ax25_frames_acked(ax25, nr);
  314. ax25_calculate_t1(ax25);
  315. ax25_start_t1timer(ax25);
  316. return 1;
  317. }
  318. }
  319. return 0;
  320. }