/* * Rose release 001 * * This is ALPHA test software. This code may break your machine, randomly fail to work with new * releases, misbehave and/or generally screw up. It might even work. * * This code REQUIRES 2.1.15 or higher/ NET3.038 * * This module: * This module is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version * 2 of the License, or (at your option) any later version. * * History * Rose 001 Jonathan(G4KLX) Cloned from nr_out.c */ #include #if defined(CONFIG_ROSE) || defined(CONFIG_ROSE_MODULE) #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include /* * This is where all Rose frames pass; */ void rose_output(struct sock *sk, struct sk_buff *skb) { struct sk_buff *skbn; unsigned char header[ROSE_MIN_LEN]; int err, frontlen, len; if (skb->len - ROSE_MIN_LEN > ROSE_MAX_PACKET_SIZE) { /* Save a copy of the Header */ memcpy(header, skb->data, ROSE_MIN_LEN); skb_pull(skb, ROSE_MIN_LEN); frontlen = skb_headroom(skb); while (skb->len > 0) { if ((skbn = sock_alloc_send_skb(sk, frontlen + ROSE_MAX_PACKET_SIZE, 0, 0, &err)) == NULL) return; skb_reserve(skbn, frontlen); len = (ROSE_MAX_PACKET_SIZE > skb->len) ? skb->len : ROSE_MAX_PACKET_SIZE; /* Copy the user data */ memcpy(skb_put(skbn, len), skb->data, len); skb_pull(skb, len); /* Duplicate the Header */ skb_push(skbn, ROSE_MIN_LEN); memcpy(skbn->data, header, ROSE_MIN_LEN); if (skb->len > 0) skbn->data[2] |= ROSE_M_BIT; skb_queue_tail(&sk->write_queue, skbn); /* Throw it on the queue */ } kfree_skb(skb, FREE_WRITE); } else { skb_queue_tail(&sk->write_queue, skb); /* Throw it on the queue */ } if (sk->protinfo.rose->state == ROSE_STATE_3) rose_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 rose_send_iframe(struct sock *sk, struct sk_buff *skb) { if (skb == NULL) return; skb->data[2] |= (sk->protinfo.rose->vr << 5) & 0xE0; skb->data[2] |= (sk->protinfo.rose->vs << 1) & 0x0E; rose_transmit_link(skb, sk->protinfo.rose->neighbour); } void rose_kick(struct sock *sk) { struct sk_buff *skb; unsigned short end; del_timer(&sk->timer); end = (sk->protinfo.rose->va + ROSE_MAX_WINDOW_SIZE) % ROSE_MODULUS; if (!(sk->protinfo.rose->condition & ROSE_COND_PEER_RX_BUSY) && sk->protinfo.rose->vs != end && skb_peek(&sk->write_queue) != NULL) { /* * Transmit data until either we're out of data to send or * the window is full. */ skb = skb_dequeue(&sk->write_queue); do { /* * Transmit the frame. */ rose_send_iframe(sk, skb); sk->protinfo.rose->vs = (sk->protinfo.rose->vs + 1) % ROSE_MODULUS; } while (sk->protinfo.rose->vs != end && (skb = skb_dequeue(&sk->write_queue)) != NULL); sk->protinfo.rose->vl = sk->protinfo.rose->vr; sk->protinfo.rose->condition &= ~ROSE_COND_ACK_PENDING; sk->protinfo.rose->timer = 0; } rose_set_timer(sk); } /* * The following routines are taken from page 170 of the 7th ARRL Computer * Networking Conference paper, as is the whole state machine. */ void rose_enquiry_response(struct sock *sk) { if (sk->protinfo.rose->condition & ROSE_COND_OWN_RX_BUSY) rose_write_internal(sk, ROSE_RNR); else rose_write_internal(sk, ROSE_RR); sk->protinfo.rose->vl = sk->protinfo.rose->vr; sk->protinfo.rose->condition &= ~ROSE_COND_ACK_PENDING; sk->protinfo.rose->timer = 0; } void rose_check_iframes_acked(struct sock *sk, unsigned short nr) { if (sk->protinfo.rose->vs == nr) { sk->protinfo.rose->va = nr; } else { if (sk->protinfo.rose->va != nr) sk->protinfo.rose->va = nr; } } #endif