ax25_out.c 8.9 KB

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