OpenCores
URL https://opencores.org/ocsvn/or1k/or1k/trunk

Subversion Repositories or1k

[/] [or1k/] [trunk/] [linux/] [linux-2.4/] [net/] [sctp/] [inqueue.c] - Blame information for rev 1765

Details | Compare with Previous | View Log

Line No. Rev Author Line
1 1275 phoenix
/* SCTP kernel reference Implementation
2
 * Copyright (c) 1999-2000 Cisco, Inc.
3
 * Copyright (c) 1999-2001 Motorola, Inc.
4
 * Copyright (c) 2002 International Business Machines, Corp.
5
 *
6
 * This file is part of the SCTP kernel reference Implementation
7
 *
8
 * These functions are the methods for accessing the SCTP inqueue.
9
 *
10
 * An SCTP inqueue is a queue into which you push SCTP packets
11
 * (which might be bundles or fragments of chunks) and out of which you
12
 * pop SCTP whole chunks.
13
 *
14
 * The SCTP reference implementation is free software;
15
 * you can redistribute it and/or modify it under the terms of
16
 * the GNU General Public License as published by
17
 * the Free Software Foundation; either version 2, or (at your option)
18
 * any later version.
19
 *
20
 * The SCTP reference implementation is distributed in the hope that it
21
 * will be useful, but WITHOUT ANY WARRANTY; without even the implied
22
 *                 ************************
23
 * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
24
 * See the GNU General Public License for more details.
25
 *
26
 * You should have received a copy of the GNU General Public License
27
 * along with GNU CC; see the file COPYING.  If not, write to
28
 * the Free Software Foundation, 59 Temple Place - Suite 330,
29
 * Boston, MA 02111-1307, USA.
30
 *
31
 * Please send any bug reports or fixes you make to the
32
 * email address(es):
33
 *    lksctp developers <lksctp-developers@lists.sourceforge.net>
34
 *
35
 * Or submit a bug report through the following website:
36
 *    http://www.sf.net/projects/lksctp
37
 *
38
 * Written or modified by:
39
 *    La Monte H.P. Yarroll <piggy@acm.org>
40
 *    Karl Knutson <karl@athena.chicago.il.us>
41
 *
42
 * Any bugs reported given to us we will try to fix... any fixes shared will
43
 * be incorporated into the next SCTP release.
44
 */
45
 
46
#include <net/sctp/sctp.h>
47
#include <net/sctp/sm.h>
48
#include <linux/interrupt.h>
49
 
50
/* Initialize an SCTP inqueue.  */
51
void sctp_inq_init(struct sctp_inq *queue)
52
{
53
        skb_queue_head_init(&queue->in);
54
        queue->in_progress = NULL;
55
 
56
        /* Create a task for delivering data.  */
57
        INIT_LIST_HEAD(&queue->immediate.list);
58
        queue->immediate.sync = 0;
59
        queue->immediate.routine = NULL;
60
        queue->immediate.data = NULL;
61
 
62
        queue->malloced = 0;
63
}
64
 
65
/* Create an initialized sctp_inq.  */
66
struct sctp_inq *sctp_inq_new(void)
67
{
68
        struct sctp_inq *retval;
69
 
70
        retval = t_new(struct sctp_inq, GFP_ATOMIC);
71
        if (retval) {
72
                sctp_inq_init(retval);
73
                retval->malloced = 1;
74
        }
75
        return retval;
76
}
77
 
78
/* Release the memory associated with an SCTP inqueue.  */
79
void sctp_inq_free(struct sctp_inq *queue)
80
{
81
        struct sctp_chunk *chunk;
82
 
83
        /* Empty the queue.  */
84
        while ((chunk = (struct sctp_chunk *) skb_dequeue(&queue->in)))
85
                sctp_chunk_free(chunk);
86
 
87
        /* If there is a packet which is currently being worked on,
88
         * free it as well.
89
         */
90
        if (queue->in_progress)
91
                sctp_chunk_free(queue->in_progress);
92
 
93
        if (queue->malloced) {
94
                /* Dump the master memory segment.  */
95
                kfree(queue);
96
        }
97
}
98
 
99
/* Put a new packet in an SCTP inqueue.
100
 * We assume that packet->sctp_hdr is set and in host byte order.
101
 */
102
void sctp_inq_push(struct sctp_inq *q, struct sctp_chunk *packet)
103
{
104
        /* Directly call the packet handling routine. */
105
 
106
        /* We are now calling this either from the soft interrupt
107
         * or from the backlog processing.
108
         * Eventually, we should clean up inqueue to not rely
109
         * on the BH related data structures.
110
         */
111
        skb_queue_tail(&(q->in), (struct sk_buff *) packet);
112
        q->immediate.routine(q->immediate.data);
113
}
114
 
115
/* Extract a chunk from an SCTP inqueue.
116
 *
117
 * WARNING:  If you need to put the chunk on another queue, you need to
118
 * make a shallow copy (clone) of it.
119
 */
120
struct sctp_chunk *sctp_inq_pop(struct sctp_inq *queue)
121
{
122
        struct sctp_chunk *chunk;
123
        sctp_chunkhdr_t *ch = NULL;
124
 
125
        /* The assumption is that we are safe to process the chunks
126
         * at this time.
127
         */
128
 
129
        if ((chunk = queue->in_progress)) {
130
                /* There is a packet that we have been working on.
131
                 * Any post processing work to do before we move on?
132
                 */
133
                if (chunk->singleton ||
134
                    chunk->end_of_packet ||
135
                    chunk->pdiscard) {
136
                        sctp_chunk_free(chunk);
137
                        chunk = queue->in_progress = NULL;
138
                } else {
139
                        /* Nothing to do. Next chunk in the packet, please. */
140
                        ch = (sctp_chunkhdr_t *) chunk->chunk_end;
141
 
142
                        /* Force chunk->skb->data to chunk->chunk_end.  */
143
                        skb_pull(chunk->skb,
144
                                 chunk->chunk_end - chunk->skb->data);
145
                }
146
        }
147
 
148
        /* Do we need to take the next packet out of the queue to process? */
149
        if (!chunk) {
150
                /* Is the queue empty?  */
151
                if (skb_queue_empty(&queue->in))
152
                        return NULL;
153
 
154
                chunk = queue->in_progress =
155
                        (struct sctp_chunk *) skb_dequeue(&queue->in);
156
 
157
                /* This is the first chunk in the packet.  */
158
                chunk->singleton = 1;
159
                ch = (sctp_chunkhdr_t *) chunk->skb->data;
160
        }
161
 
162
        chunk->chunk_hdr = ch;
163
        chunk->chunk_end = ((__u8 *) ch)
164
                + WORD_ROUND(ntohs(ch->length));
165
        skb_pull(chunk->skb, sizeof(sctp_chunkhdr_t));
166
        chunk->subh.v = NULL; /* Subheader is no longer valid.  */
167
 
168
        if (chunk->chunk_end < chunk->skb->tail) {
169
                /* This is not a singleton */
170
                chunk->singleton = 0;
171
        } else {
172
                /* We are at the end of the packet, so mark the chunk
173
                 * in case we need to send a SACK.
174
                 */
175
                chunk->end_of_packet = 1;
176
        }
177
 
178
        SCTP_DEBUG_PRINTK("+++sctp_inq_pop+++ chunk %p[%s],"
179
                          " length %d, skb->len %d\n",chunk,
180
                          sctp_cname(SCTP_ST_CHUNK(chunk->chunk_hdr->type)),
181
                          ntohs(chunk->chunk_hdr->length), chunk->skb->len);
182
        return chunk;
183
}
184
 
185
/* Set a top-half handler.
186
 *
187
 * Originally, we the top-half handler was scheduled as a BH.  We now
188
 * call the handler directly in sctp_inq_push() at a time that
189
 * we know we are lock safe.
190
 * The intent is that this routine will pull stuff out of the
191
 * inqueue and process it.
192
 */
193
void sctp_inq_set_th_handler(struct sctp_inq *q,
194
                                 void (*callback)(void *), void *arg)
195
{
196
        q->immediate.routine = callback;
197
        q->immediate.data = arg;
198
}
199
 

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.