ax25_out.c 8.7 KB

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