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/sched.h>
18 #include <linux/timer.h>
19 #include <linux/string.h>
20 #include <linux/sockios.h>
21 #include <linux/spinlock.h>
22 #include <linux/net.h>
24 #include <linux/inet.h>
25 #include <linux/netdevice.h>
26 #include <linux/skbuff.h>
27 #include <linux/netfilter.h>
29 #include <asm/uaccess.h>
30 #include <asm/system.h>
31 #include <linux/fcntl.h>
33 #include <linux/interrupt.h>
35 static DEFINE_SPINLOCK(ax25_frag_lock
);
37 ax25_cb
*ax25_send_frame(struct sk_buff
*skb
, int paclen
, ax25_address
*src
, ax25_address
*dest
, ax25_digi
*digi
, struct net_device
*dev
)
43 * Take the default packet length for the device if zero is
47 if ((ax25_dev
= ax25_dev_ax25dev(dev
)) == NULL
)
50 paclen
= ax25_dev
->values
[AX25_VALUES_PACLEN
];
54 * Look for an existing connection.
56 if ((ax25
= ax25_find_cb(src
, dest
, digi
, dev
)) != NULL
) {
57 ax25_output(ax25
, paclen
, skb
);
58 return ax25
; /* It already existed */
61 if ((ax25_dev
= ax25_dev_ax25dev(dev
)) == NULL
)
64 if ((ax25
= ax25_create_cb()) == NULL
)
67 ax25_fillin_cb(ax25
, ax25_dev
);
69 ax25
->source_addr
= *src
;
70 ax25
->dest_addr
= *dest
;
73 if ((ax25
->digipeat
= kmalloc(sizeof(ax25_digi
), GFP_ATOMIC
)) == NULL
) {
77 memcpy(ax25
->digipeat
, digi
, sizeof(ax25_digi
));
80 switch (ax25
->ax25_dev
->values
[AX25_VALUES_PROTOCOL
]) {
81 case AX25_PROTO_STD_SIMPLEX
:
82 case AX25_PROTO_STD_DUPLEX
:
83 ax25_std_establish_data_link(ax25
);
86 #ifdef CONFIG_AX25_DAMA_SLAVE
87 case AX25_PROTO_DAMA_SLAVE
:
88 if (ax25_dev
->dama
.slave
)
89 ax25_ds_establish_data_link(ax25
);
91 ax25_std_establish_data_link(ax25
);
98 ax25
->state
= AX25_STATE_1
;
100 ax25_start_heartbeat(ax25
);
102 ax25_output(ax25
, paclen
, skb
);
104 return ax25
; /* We had to create it */
107 EXPORT_SYMBOL(ax25_send_frame
);
110 * All outgoing AX.25 I frames pass via this routine. Therefore this is
111 * where the fragmentation of frames takes place. If fragment is set to
112 * zero then we are not allowed to do fragmentation, even if the frame
115 void ax25_output(ax25_cb
*ax25
, int paclen
, struct sk_buff
*skb
)
117 struct sk_buff
*skbn
;
119 int frontlen
, len
, fragno
, ka9qfrag
, first
= 1;
121 if ((skb
->len
- 1) > paclen
) {
122 if (*skb
->data
== AX25_P_TEXT
) {
123 skb_pull(skb
, 1); /* skip PID */
126 paclen
-= 2; /* Allow for fragment control info */
130 fragno
= skb
->len
/ paclen
;
131 if (skb
->len
% paclen
== 0) fragno
--;
133 frontlen
= skb_headroom(skb
); /* Address space + CTRL */
135 while (skb
->len
> 0) {
136 spin_lock_bh(&ax25_frag_lock
);
137 if ((skbn
= alloc_skb(paclen
+ 2 + frontlen
, GFP_ATOMIC
)) == NULL
) {
138 spin_unlock_bh(&ax25_frag_lock
);
139 printk(KERN_CRIT
"AX.25: ax25_output - out of memory\n");
144 skb_set_owner_w(skbn
, skb
->sk
);
146 spin_unlock_bh(&ax25_frag_lock
);
148 len
= (paclen
> skb
->len
) ? skb
->len
: paclen
;
151 skb_reserve(skbn
, frontlen
+ 2);
152 skbn
->nh
.raw
= skbn
->data
+ (skb
->nh
.raw
- skb
->data
);
153 memcpy(skb_put(skbn
, len
), skb
->data
, len
);
154 p
= skb_push(skbn
, 2);
156 *p
++ = AX25_P_SEGMENT
;
160 *p
|= AX25_SEG_FIRST
;
164 skb_reserve(skbn
, frontlen
+ 1);
165 skbn
->nh
.raw
= skbn
->data
+ (skb
->nh
.raw
- skb
->data
);
166 memcpy(skb_put(skbn
, len
), skb
->data
, len
);
167 p
= skb_push(skbn
, 1);
172 skb_queue_tail(&ax25
->write_queue
, skbn
); /* Throw it on the queue */
177 skb_queue_tail(&ax25
->write_queue
, skb
); /* Throw it on the queue */
180 switch (ax25
->ax25_dev
->values
[AX25_VALUES_PROTOCOL
]) {
181 case AX25_PROTO_STD_SIMPLEX
:
182 case AX25_PROTO_STD_DUPLEX
:
186 #ifdef CONFIG_AX25_DAMA_SLAVE
188 * A DAMA slave is _required_ to work as normal AX.25L2V2
189 * if no DAMA master is available.
191 case AX25_PROTO_DAMA_SLAVE
:
192 if (!ax25
->ax25_dev
->dama
.slave
) ax25_kick(ax25
);
199 * This procedure is passed a buffer descriptor for an iframe. It builds
200 * the rest of the control part of the frame and then writes it out.
202 static void ax25_send_iframe(ax25_cb
*ax25
, struct sk_buff
*skb
, int poll_bit
)
204 unsigned char *frame
;
209 skb
->nh
.raw
= skb
->data
;
211 if (ax25
->modulus
== AX25_MODULUS
) {
212 frame
= skb_push(skb
, 1);
215 *frame
|= (poll_bit
) ? AX25_PF
: 0;
216 *frame
|= (ax25
->vr
<< 5);
217 *frame
|= (ax25
->vs
<< 1);
219 frame
= skb_push(skb
, 2);
222 frame
[0] |= (ax25
->vs
<< 1);
223 frame
[1] = (poll_bit
) ? AX25_EPF
: 0;
224 frame
[1] |= (ax25
->vr
<< 1);
227 ax25_start_idletimer(ax25
);
229 ax25_transmit_buffer(ax25
, skb
, AX25_COMMAND
);
232 void ax25_kick(ax25_cb
*ax25
)
234 struct sk_buff
*skb
, *skbn
;
236 unsigned short start
, end
, next
;
238 if (ax25
->state
!= AX25_STATE_3
&& ax25
->state
!= AX25_STATE_4
)
241 if (ax25
->condition
& AX25_COND_PEER_RX_BUSY
)
244 if (skb_peek(&ax25
->write_queue
) == NULL
)
247 start
= (skb_peek(&ax25
->ack_queue
) == NULL
) ? ax25
->va
: ax25
->vs
;
248 end
= (ax25
->va
+ ax25
->window
) % ax25
->modulus
;
256 * Transmit data until either we're out of data to send or
257 * the window is full. Send a poll on the final I frame if
258 * the window is filled.
262 * Dequeue the frame and copy it.
264 skb
= skb_dequeue(&ax25
->write_queue
);
267 if ((skbn
= skb_clone(skb
, GFP_ATOMIC
)) == NULL
) {
268 skb_queue_head(&ax25
->write_queue
, skb
);
273 skb_set_owner_w(skbn
, skb
->sk
);
275 next
= (ax25
->vs
+ 1) % ax25
->modulus
;
276 last
= (next
== end
);
279 * Transmit the frame copy.
280 * bke 960114: do not set the Poll bit on the last frame
283 switch (ax25
->ax25_dev
->values
[AX25_VALUES_PROTOCOL
]) {
284 case AX25_PROTO_STD_SIMPLEX
:
285 case AX25_PROTO_STD_DUPLEX
:
286 ax25_send_iframe(ax25
, skbn
, (last
) ? AX25_POLLON
: AX25_POLLOFF
);
289 #ifdef CONFIG_AX25_DAMA_SLAVE
290 case AX25_PROTO_DAMA_SLAVE
:
291 ax25_send_iframe(ax25
, skbn
, AX25_POLLOFF
);
299 * Requeue the original data frame.
301 skb_queue_tail(&ax25
->ack_queue
, skb
);
303 } while (!last
&& (skb
= skb_dequeue(&ax25
->write_queue
)) != NULL
);
305 ax25
->condition
&= ~AX25_COND_ACK_PENDING
;
307 if (!ax25_t1timer_running(ax25
)) {
308 ax25_stop_t3timer(ax25
);
309 ax25_calculate_t1(ax25
);
310 ax25_start_t1timer(ax25
);
314 void ax25_transmit_buffer(ax25_cb
*ax25
, struct sk_buff
*skb
, int type
)
316 struct sk_buff
*skbn
;
320 if (ax25
->ax25_dev
== NULL
) {
321 ax25_disconnect(ax25
, ENETUNREACH
);
325 headroom
= ax25_addr_size(ax25
->digipeat
);
327 if (skb_headroom(skb
) < headroom
) {
328 if ((skbn
= skb_realloc_headroom(skb
, headroom
)) == NULL
) {
329 printk(KERN_CRIT
"AX.25: ax25_transmit_buffer - out of memory\n");
335 skb_set_owner_w(skbn
, skb
->sk
);
341 ptr
= skb_push(skb
, headroom
);
343 ax25_addr_build(ptr
, &ax25
->source_addr
, &ax25
->dest_addr
, ax25
->digipeat
, type
, ax25
->modulus
);
345 ax25_queue_xmit(skb
, ax25
->ax25_dev
->dev
);
349 * A small shim to dev_queue_xmit to add the KISS control byte, and do
350 * any packet forwarding in operation.
352 void ax25_queue_xmit(struct sk_buff
*skb
, struct net_device
*dev
)
356 skb
->protocol
= ax25_type_trans(skb
, ax25_fwd_dev(dev
));
358 ptr
= skb_push(skb
, 1);
359 *ptr
= 0x00; /* KISS */
364 int ax25_check_iframes_acked(ax25_cb
*ax25
, unsigned short nr
)
366 if (ax25
->vs
== nr
) {
367 ax25_frames_acked(ax25
, nr
);
368 ax25_calculate_rtt(ax25
);
369 ax25_stop_t1timer(ax25
);
370 ax25_start_t3timer(ax25
);
373 if (ax25
->va
!= nr
) {
374 ax25_frames_acked(ax25
, nr
);
375 ax25_calculate_t1(ax25
);
376 ax25_start_t1timer(ax25
);