ax25_out.c 8.7 KB

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