2019-05-27 06:55:01 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-or-later
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
*
|
|
|
|
* Copyright Jonathan Naylor G4KLX (g4klx@g4klx.demon.co.uk)
|
|
|
|
* Copyright Darryl Miles G7LED (dlm@g7led.demon.co.uk)
|
|
|
|
*/
|
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/socket.h>
|
|
|
|
#include <linux/in.h>
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/timer.h>
|
|
|
|
#include <linux/string.h>
|
|
|
|
#include <linux/sockios.h>
|
|
|
|
#include <linux/net.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 08:04:11 +00:00
|
|
|
#include <linux/slab.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <net/ax25.h>
|
|
|
|
#include <linux/inet.h>
|
|
|
|
#include <linux/netdevice.h>
|
|
|
|
#include <linux/skbuff.h>
|
|
|
|
#include <net/sock.h>
|
2014-10-17 20:00:22 +00:00
|
|
|
#include <linux/uaccess.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/fcntl.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/interrupt.h>
|
|
|
|
#include <net/netrom.h>
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is where all NET/ROM frames pass, except for IP-over-NET/ROM which
|
|
|
|
* cannot be fragmented in this manner.
|
|
|
|
*/
|
|
|
|
void nr_output(struct sock *sk, struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
struct sk_buff *skbn;
|
|
|
|
unsigned char transport[NR_TRANSPORT_LEN];
|
|
|
|
int err, frontlen, len;
|
|
|
|
|
|
|
|
if (skb->len - NR_TRANSPORT_LEN > NR_MAX_PACKET_SIZE) {
|
|
|
|
/* Save a copy of the Transport Header */
|
2007-03-27 21:55:52 +00:00
|
|
|
skb_copy_from_linear_data(skb, transport, NR_TRANSPORT_LEN);
|
2005-04-16 22:20:36 +00:00
|
|
|
skb_pull(skb, NR_TRANSPORT_LEN);
|
|
|
|
|
|
|
|
frontlen = skb_headroom(skb);
|
|
|
|
|
|
|
|
while (skb->len > 0) {
|
|
|
|
if ((skbn = sock_alloc_send_skb(sk, frontlen + NR_MAX_PACKET_SIZE, 0, &err)) == NULL)
|
|
|
|
return;
|
|
|
|
|
|
|
|
skb_reserve(skbn, frontlen);
|
|
|
|
|
|
|
|
len = (NR_MAX_PACKET_SIZE > skb->len) ? skb->len : NR_MAX_PACKET_SIZE;
|
|
|
|
|
|
|
|
/* Copy the user data */
|
2007-03-27 21:55:52 +00:00
|
|
|
skb_copy_from_linear_data(skb, skb_put(skbn, len), len);
|
2005-04-16 22:20:36 +00:00
|
|
|
skb_pull(skb, len);
|
|
|
|
|
|
|
|
/* Duplicate the Transport Header */
|
|
|
|
skb_push(skbn, NR_TRANSPORT_LEN);
|
2007-03-31 14:55:19 +00:00
|
|
|
skb_copy_to_linear_data(skbn, transport,
|
|
|
|
NR_TRANSPORT_LEN);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (skb->len > 0)
|
|
|
|
skbn->data[4] |= NR_MORE_FLAG;
|
|
|
|
|
|
|
|
skb_queue_tail(&sk->sk_write_queue, skbn); /* Throw it on the queue */
|
|
|
|
}
|
|
|
|
|
|
|
|
kfree_skb(skb);
|
|
|
|
} else {
|
|
|
|
skb_queue_tail(&sk->sk_write_queue, skb); /* Throw it on the queue */
|
|
|
|
}
|
|
|
|
|
|
|
|
nr_kick(sk);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This procedure is passed a buffer descriptor for an iframe. It builds
|
|
|
|
* the rest of the control part of the frame and then writes it out.
|
|
|
|
*/
|
|
|
|
static void nr_send_iframe(struct sock *sk, struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
struct nr_sock *nr = nr_sk(sk);
|
|
|
|
|
|
|
|
if (skb == NULL)
|
|
|
|
return;
|
|
|
|
|
|
|
|
skb->data[2] = nr->vs;
|
|
|
|
skb->data[3] = nr->vr;
|
|
|
|
|
|
|
|
if (nr->condition & NR_COND_OWN_RX_BUSY)
|
|
|
|
skb->data[4] |= NR_CHOKE_FLAG;
|
|
|
|
|
|
|
|
nr_start_idletimer(sk);
|
|
|
|
|
|
|
|
nr_transmit_buffer(sk, skb);
|
|
|
|
}
|
|
|
|
|
|
|
|
void nr_send_nak_frame(struct sock *sk)
|
|
|
|
{
|
|
|
|
struct sk_buff *skb, *skbn;
|
|
|
|
struct nr_sock *nr = nr_sk(sk);
|
|
|
|
|
|
|
|
if ((skb = skb_peek(&nr->ack_queue)) == NULL)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if ((skbn = skb_clone(skb, GFP_ATOMIC)) == NULL)
|
|
|
|
return;
|
|
|
|
|
|
|
|
skbn->data[2] = nr->va;
|
|
|
|
skbn->data[3] = nr->vr;
|
|
|
|
|
|
|
|
if (nr->condition & NR_COND_OWN_RX_BUSY)
|
|
|
|
skbn->data[4] |= NR_CHOKE_FLAG;
|
|
|
|
|
|
|
|
nr_transmit_buffer(sk, skbn);
|
|
|
|
|
|
|
|
nr->condition &= ~NR_COND_ACK_PENDING;
|
|
|
|
nr->vl = nr->vr;
|
|
|
|
|
|
|
|
nr_stop_t1timer(sk);
|
|
|
|
}
|
|
|
|
|
|
|
|
void nr_kick(struct sock *sk)
|
|
|
|
{
|
|
|
|
struct nr_sock *nr = nr_sk(sk);
|
|
|
|
struct sk_buff *skb, *skbn;
|
|
|
|
unsigned short start, end;
|
|
|
|
|
|
|
|
if (nr->state != NR_STATE_3)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (nr->condition & NR_COND_PEER_RX_BUSY)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (!skb_peek(&sk->sk_write_queue))
|
|
|
|
return;
|
|
|
|
|
|
|
|
start = (skb_peek(&nr->ack_queue) == NULL) ? nr->va : nr->vs;
|
|
|
|
end = (nr->va + nr->window) % NR_MODULUS;
|
|
|
|
|
|
|
|
if (start == end)
|
|
|
|
return;
|
|
|
|
|
|
|
|
nr->vs = start;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Transmit data until either we're out of data to send or
|
|
|
|
* the window is full.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Dequeue the frame and copy it.
|
|
|
|
*/
|
|
|
|
skb = skb_dequeue(&sk->sk_write_queue);
|
|
|
|
|
|
|
|
do {
|
|
|
|
if ((skbn = skb_clone(skb, GFP_ATOMIC)) == NULL) {
|
|
|
|
skb_queue_head(&sk->sk_write_queue, skb);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
skb_set_owner_w(skbn, sk);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Transmit the frame copy.
|
|
|
|
*/
|
|
|
|
nr_send_iframe(sk, skbn);
|
|
|
|
|
|
|
|
nr->vs = (nr->vs + 1) % NR_MODULUS;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Requeue the original data frame.
|
|
|
|
*/
|
|
|
|
skb_queue_tail(&nr->ack_queue, skb);
|
|
|
|
|
|
|
|
} while (nr->vs != end &&
|
|
|
|
(skb = skb_dequeue(&sk->sk_write_queue)) != NULL);
|
|
|
|
|
|
|
|
nr->vl = nr->vr;
|
|
|
|
nr->condition &= ~NR_COND_ACK_PENDING;
|
|
|
|
|
|
|
|
if (!nr_t1timer_running(sk))
|
|
|
|
nr_start_t1timer(sk);
|
|
|
|
}
|
|
|
|
|
|
|
|
void nr_transmit_buffer(struct sock *sk, struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
struct nr_sock *nr = nr_sk(sk);
|
|
|
|
unsigned char *dptr;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Add the protocol byte and network header.
|
|
|
|
*/
|
|
|
|
dptr = skb_push(skb, NR_NETWORK_LEN);
|
|
|
|
|
|
|
|
memcpy(dptr, &nr->source_addr, AX25_ADDR_LEN);
|
|
|
|
dptr[6] &= ~AX25_CBIT;
|
|
|
|
dptr[6] &= ~AX25_EBIT;
|
|
|
|
dptr[6] |= AX25_SSSID_SPARE;
|
|
|
|
dptr += AX25_ADDR_LEN;
|
|
|
|
|
|
|
|
memcpy(dptr, &nr->dest_addr, AX25_ADDR_LEN);
|
|
|
|
dptr[6] &= ~AX25_CBIT;
|
|
|
|
dptr[6] |= AX25_EBIT;
|
|
|
|
dptr[6] |= AX25_SSSID_SPARE;
|
|
|
|
dptr += AX25_ADDR_LEN;
|
|
|
|
|
|
|
|
*dptr++ = sysctl_netrom_network_ttl_initialiser;
|
|
|
|
|
|
|
|
if (!nr_route_frame(skb, NULL)) {
|
|
|
|
kfree_skb(skb);
|
|
|
|
nr_disconnect(sk, ENETUNREACH);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The following routines are taken from page 170 of the 7th ARRL Computer
|
|
|
|
* Networking Conference paper, as is the whole state machine.
|
|
|
|
*/
|
|
|
|
|
|
|
|
void nr_establish_data_link(struct sock *sk)
|
|
|
|
{
|
|
|
|
struct nr_sock *nr = nr_sk(sk);
|
|
|
|
|
|
|
|
nr->condition = 0x00;
|
|
|
|
nr->n2count = 0;
|
|
|
|
|
|
|
|
nr_write_internal(sk, NR_CONNREQ);
|
|
|
|
|
|
|
|
nr_stop_t2timer(sk);
|
|
|
|
nr_stop_t4timer(sk);
|
|
|
|
nr_stop_idletimer(sk);
|
|
|
|
nr_start_t1timer(sk);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Never send a NAK when we are CHOKEd.
|
|
|
|
*/
|
|
|
|
void nr_enquiry_response(struct sock *sk)
|
|
|
|
{
|
|
|
|
struct nr_sock *nr = nr_sk(sk);
|
|
|
|
int frametype = NR_INFOACK;
|
|
|
|
|
|
|
|
if (nr->condition & NR_COND_OWN_RX_BUSY) {
|
|
|
|
frametype |= NR_CHOKE_FLAG;
|
|
|
|
} else {
|
|
|
|
if (skb_peek(&nr->reseq_queue) != NULL)
|
|
|
|
frametype |= NR_NAK_FLAG;
|
|
|
|
}
|
|
|
|
|
|
|
|
nr_write_internal(sk, frametype);
|
|
|
|
|
|
|
|
nr->vl = nr->vr;
|
|
|
|
nr->condition &= ~NR_COND_ACK_PENDING;
|
|
|
|
}
|
|
|
|
|
|
|
|
void nr_check_iframes_acked(struct sock *sk, unsigned short nr)
|
|
|
|
{
|
|
|
|
struct nr_sock *nrom = nr_sk(sk);
|
|
|
|
|
|
|
|
if (nrom->vs == nr) {
|
|
|
|
nr_frames_acked(sk, nr);
|
|
|
|
nr_stop_t1timer(sk);
|
|
|
|
nrom->n2count = 0;
|
|
|
|
} else {
|
|
|
|
if (nrom->va != nr) {
|
|
|
|
nr_frames_acked(sk, nr);
|
|
|
|
nr_start_t1timer(sk);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|