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.
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)
11 #include <linux/errno.h>
12 #include <linux/types.h>
13 #include <linux/socket.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>
23 #include <linux/inet.h>
24 #include <linux/netdevice.h>
25 #include <linux/skbuff.h>
26 #include <linux/netfilter.h>
28 #include <asm/uaccess.h>
29 #include <asm/system.h>
30 #include <linux/fcntl.h>
32 #include <linux/interrupt.h>
34 static DEFINE_SPINLOCK(ax25_frag_lock);
36 ax25_cb *ax25_send_frame(struct sk_buff *skb, int paclen, ax25_address *src, ax25_address *dest, ax25_digi *digi, struct net_device *dev)
42 * Take the default packet length for the device if zero is
46 if ((ax25_dev = ax25_dev_ax25dev(dev)) == NULL)
49 paclen = ax25_dev->values[AX25_VALUES_PACLEN];
53 * Look for an existing connection.
55 if ((ax25 = ax25_find_cb(src, dest, digi, dev)) != NULL) {
56 ax25_output(ax25, paclen, skb);
57 return ax25; /* It already existed */
60 if ((ax25_dev = ax25_dev_ax25dev(dev)) == NULL)
63 if ((ax25 = ax25_create_cb()) == NULL)
66 ax25_fillin_cb(ax25, ax25_dev);
68 ax25->source_addr = *src;
69 ax25->dest_addr = *dest;
72 ax25->digipeat = kmemdup(digi, sizeof(*digi), GFP_ATOMIC);
73 if (ax25->digipeat == NULL) {
79 switch (ax25->ax25_dev->values[AX25_VALUES_PROTOCOL]) {
80 case AX25_PROTO_STD_SIMPLEX:
81 case AX25_PROTO_STD_DUPLEX:
82 ax25_std_establish_data_link(ax25);
85 #ifdef CONFIG_AX25_DAMA_SLAVE
86 case AX25_PROTO_DAMA_SLAVE:
87 if (ax25_dev->dama.slave)
88 ax25_ds_establish_data_link(ax25);
90 ax25_std_establish_data_link(ax25);
97 ax25->state = AX25_STATE_1;
99 ax25_start_heartbeat(ax25);
101 ax25_output(ax25, paclen, skb);
103 return ax25; /* We had to create it */
106 EXPORT_SYMBOL(ax25_send_frame);
109 * All outgoing AX.25 I frames pass via this routine. Therefore this is
110 * where the fragmentation of frames takes place. If fragment is set to
111 * zero then we are not allowed to do fragmentation, even if the frame
114 void ax25_output(ax25_cb *ax25, int paclen, struct sk_buff *skb)
116 struct sk_buff *skbn;
118 int frontlen, len, fragno, ka9qfrag, first = 1;
120 if ((skb->len - 1) > paclen) {
121 if (*skb->data == AX25_P_TEXT) {
122 skb_pull(skb, 1); /* skip PID */
125 paclen -= 2; /* Allow for fragment control info */
129 fragno = skb->len / paclen;
130 if (skb->len % paclen == 0) fragno--;
132 frontlen = skb_headroom(skb); /* Address space + CTRL */
134 while (skb->len > 0) {
135 spin_lock_bh(&ax25_frag_lock);
136 if ((skbn = alloc_skb(paclen + 2 + frontlen, GFP_ATOMIC)) == NULL) {
137 spin_unlock_bh(&ax25_frag_lock);
138 printk(KERN_CRIT "AX.25: ax25_output - out of memory\n");
143 skb_set_owner_w(skbn, skb->sk);
145 spin_unlock_bh(&ax25_frag_lock);
147 len = (paclen > skb->len) ? skb->len : paclen;
150 skb_reserve(skbn, frontlen + 2);
151 skbn->nh.raw = skbn->data + (skb->nh.raw - skb->data);
152 memcpy(skb_put(skbn, len), skb->data, len);
153 p = skb_push(skbn, 2);
155 *p++ = AX25_P_SEGMENT;
159 *p |= AX25_SEG_FIRST;
163 skb_reserve(skbn, frontlen + 1);
164 skbn->nh.raw = skbn->data + (skb->nh.raw - skb->data);
165 memcpy(skb_put(skbn, len), skb->data, len);
166 p = skb_push(skbn, 1);
171 skb_queue_tail(&ax25->write_queue, skbn); /* Throw it on the queue */
176 skb_queue_tail(&ax25->write_queue, skb); /* Throw it on the queue */
179 switch (ax25->ax25_dev->values[AX25_VALUES_PROTOCOL]) {
180 case AX25_PROTO_STD_SIMPLEX:
181 case AX25_PROTO_STD_DUPLEX:
185 #ifdef CONFIG_AX25_DAMA_SLAVE
187 * A DAMA slave is _required_ to work as normal AX.25L2V2
188 * if no DAMA master is available.
190 case AX25_PROTO_DAMA_SLAVE:
191 if (!ax25->ax25_dev->dama.slave) ax25_kick(ax25);
198 * This procedure is passed a buffer descriptor for an iframe. It builds
199 * the rest of the control part of the frame and then writes it out.
201 static void ax25_send_iframe(ax25_cb *ax25, struct sk_buff *skb, int poll_bit)
203 unsigned char *frame;
208 skb->nh.raw = skb->data;
210 if (ax25->modulus == AX25_MODULUS) {
211 frame = skb_push(skb, 1);
214 *frame |= (poll_bit) ? AX25_PF : 0;
215 *frame |= (ax25->vr << 5);
216 *frame |= (ax25->vs << 1);
218 frame = skb_push(skb, 2);
221 frame[0] |= (ax25->vs << 1);
222 frame[1] = (poll_bit) ? AX25_EPF : 0;
223 frame[1] |= (ax25->vr << 1);
226 ax25_start_idletimer(ax25);
228 ax25_transmit_buffer(ax25, skb, AX25_COMMAND);
231 void ax25_kick(ax25_cb *ax25)
233 struct sk_buff *skb, *skbn;
235 unsigned short start, end, next;
237 if (ax25->state != AX25_STATE_3 && ax25->state != AX25_STATE_4)
240 if (ax25->condition & AX25_COND_PEER_RX_BUSY)
243 if (skb_peek(&ax25->write_queue) == NULL)
246 start = (skb_peek(&ax25->ack_queue) == NULL) ? ax25->va : ax25->vs;
247 end = (ax25->va + ax25->window) % ax25->modulus;
255 * Transmit data until either we're out of data to send or
256 * the window is full. Send a poll on the final I frame if
257 * the window is filled.
261 * Dequeue the frame and copy it.
263 skb = skb_dequeue(&ax25->write_queue);
266 if ((skbn = skb_clone(skb, GFP_ATOMIC)) == NULL) {
267 skb_queue_head(&ax25->write_queue, skb);
272 skb_set_owner_w(skbn, skb->sk);
274 next = (ax25->vs + 1) % ax25->modulus;
275 last = (next == end);
278 * Transmit the frame copy.
279 * bke 960114: do not set the Poll bit on the last frame
282 switch (ax25->ax25_dev->values[AX25_VALUES_PROTOCOL]) {
283 case AX25_PROTO_STD_SIMPLEX:
284 case AX25_PROTO_STD_DUPLEX:
285 ax25_send_iframe(ax25, skbn, (last) ? AX25_POLLON : AX25_POLLOFF);
288 #ifdef CONFIG_AX25_DAMA_SLAVE
289 case AX25_PROTO_DAMA_SLAVE:
290 ax25_send_iframe(ax25, skbn, AX25_POLLOFF);
298 * Requeue the original data frame.
300 skb_queue_tail(&ax25->ack_queue, skb);
302 } while (!last && (skb = skb_dequeue(&ax25->write_queue)) != NULL);
304 ax25->condition &= ~AX25_COND_ACK_PENDING;
306 if (!ax25_t1timer_running(ax25)) {
307 ax25_stop_t3timer(ax25);
308 ax25_calculate_t1(ax25);
309 ax25_start_t1timer(ax25);
313 void ax25_transmit_buffer(ax25_cb *ax25, struct sk_buff *skb, int type)
315 struct sk_buff *skbn;
319 if (ax25->ax25_dev == NULL) {
320 ax25_disconnect(ax25, ENETUNREACH);
324 headroom = ax25_addr_size(ax25->digipeat);
326 if (skb_headroom(skb) < headroom) {
327 if ((skbn = skb_realloc_headroom(skb, headroom)) == NULL) {
328 printk(KERN_CRIT "AX.25: ax25_transmit_buffer - out of memory\n");
334 skb_set_owner_w(skbn, skb->sk);
340 ptr = skb_push(skb, headroom);
342 ax25_addr_build(ptr, &ax25->source_addr, &ax25->dest_addr, ax25->digipeat, type, ax25->modulus);
344 ax25_queue_xmit(skb, ax25->ax25_dev->dev);
348 * A small shim to dev_queue_xmit to add the KISS control byte, and do
349 * any packet forwarding in operation.
351 void ax25_queue_xmit(struct sk_buff *skb, struct net_device *dev)
355 skb->protocol = ax25_type_trans(skb, ax25_fwd_dev(dev));
357 ptr = skb_push(skb, 1);
358 *ptr = 0x00; /* KISS */
363 int ax25_check_iframes_acked(ax25_cb *ax25, unsigned short nr)
365 if (ax25->vs == nr) {
366 ax25_frames_acked(ax25, nr);
367 ax25_calculate_rtt(ax25);
368 ax25_stop_t1timer(ax25);
369 ax25_start_t3timer(ax25);
372 if (ax25->va != nr) {
373 ax25_frames_acked(ax25, nr);
374 ax25_calculate_t1(ax25);
375 ax25_start_t1timer(ax25);