blob: 9d87bba0ff1d34134093f34e4db3dc1b7e3dafd6 [file] [log] [blame]
Vlad Yasevich60c778b2008-01-11 09:57:09 -05001/* SCTP kernel implementation
Linus Torvalds1da177e2005-04-16 15:20:36 -07002 * Copyright (c) 1999-2000 Cisco, Inc.
3 * Copyright (c) 1999-2001 Motorola, Inc.
4 * Copyright (c) 2002 International Business Machines, Corp.
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +09005 *
Vlad Yasevich60c778b2008-01-11 09:57:09 -05006 * This file is part of the SCTP kernel implementation
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +09007 *
Linus Torvalds1da177e2005-04-16 15:20:36 -07008 * 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.
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +090013 *
Vlad Yasevich60c778b2008-01-11 09:57:09 -050014 * This SCTP implementation is free software;
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +090015 * you can redistribute it and/or modify it under the terms of
Linus Torvalds1da177e2005-04-16 15:20:36 -070016 * the GNU General Public License as published by
17 * the Free Software Foundation; either version 2, or (at your option)
18 * any later version.
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +090019 *
Vlad Yasevich60c778b2008-01-11 09:57:09 -050020 * This SCTP implementation is distributed in the hope that it
Linus Torvalds1da177e2005-04-16 15:20:36 -070021 * 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.
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +090025 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070026 * You should have received a copy of the GNU General Public License
Jeff Kirsher4b2f13a2013-12-06 06:28:48 -080027 * along with GNU CC; see the file COPYING. If not, see
28 * <http://www.gnu.org/licenses/>.
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +090029 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070030 * Please send any bug reports or fixes you make to the
31 * email address(es):
Daniel Borkmann91705c62013-07-23 14:51:47 +020032 * lksctp developers <linux-sctp@vger.kernel.org>
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +090033 *
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +090034 * Written or modified by:
Linus Torvalds1da177e2005-04-16 15:20:36 -070035 * La Monte H.P. Yarroll <piggy@acm.org>
36 * Karl Knutson <karl@athena.chicago.il.us>
Linus Torvalds1da177e2005-04-16 15:20:36 -070037 */
38
Joe Perches145ce502010-08-24 13:21:08 +000039#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
40
Linus Torvalds1da177e2005-04-16 15:20:36 -070041#include <net/sctp/sctp.h>
42#include <net/sctp/sm.h>
43#include <linux/interrupt.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090044#include <linux/slab.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070045
46/* Initialize an SCTP inqueue. */
47void sctp_inq_init(struct sctp_inq *queue)
48{
David S. Miller79af02c2005-07-08 21:47:49 -070049 INIT_LIST_HEAD(&queue->in_chunk_list);
Linus Torvalds1da177e2005-04-16 15:20:36 -070050 queue->in_progress = NULL;
51
52 /* Create a task for delivering data. */
David Howellsc4028952006-11-22 14:57:56 +000053 INIT_WORK(&queue->immediate, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -070054}
55
56/* Release the memory associated with an SCTP inqueue. */
57void sctp_inq_free(struct sctp_inq *queue)
58{
David S. Miller79af02c2005-07-08 21:47:49 -070059 struct sctp_chunk *chunk, *tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -070060
61 /* Empty the queue. */
David S. Miller79af02c2005-07-08 21:47:49 -070062 list_for_each_entry_safe(chunk, tmp, &queue->in_chunk_list, list) {
63 list_del_init(&chunk->list);
Linus Torvalds1da177e2005-04-16 15:20:36 -070064 sctp_chunk_free(chunk);
David S. Miller79af02c2005-07-08 21:47:49 -070065 }
Linus Torvalds1da177e2005-04-16 15:20:36 -070066
67 /* If there is a packet which is currently being worked on,
68 * free it as well.
69 */
Sridhar Samudrala7a48f922006-01-17 11:51:28 -080070 if (queue->in_progress) {
Linus Torvalds1da177e2005-04-16 15:20:36 -070071 sctp_chunk_free(queue->in_progress);
Sridhar Samudrala7a48f922006-01-17 11:51:28 -080072 queue->in_progress = NULL;
73 }
Linus Torvalds1da177e2005-04-16 15:20:36 -070074}
75
76/* Put a new packet in an SCTP inqueue.
77 * We assume that packet->sctp_hdr is set and in host byte order.
78 */
Sridhar Samudralaac0b0462006-08-22 00:15:33 -070079void sctp_inq_push(struct sctp_inq *q, struct sctp_chunk *chunk)
Linus Torvalds1da177e2005-04-16 15:20:36 -070080{
81 /* Directly call the packet handling routine. */
Vlad Yasevich027f6e12007-11-07 11:39:27 -050082 if (chunk->rcvr->dead) {
83 sctp_chunk_free(chunk);
84 return;
85 }
Linus Torvalds1da177e2005-04-16 15:20:36 -070086
87 /* We are now calling this either from the soft interrupt
88 * or from the backlog processing.
89 * Eventually, we should clean up inqueue to not rely
90 * on the BH related data structures.
91 */
Eric Dumazet860fbbc2016-04-29 14:16:51 -070092 local_bh_disable();
Sridhar Samudralaac0b0462006-08-22 00:15:33 -070093 list_add_tail(&chunk->list, &q->in_chunk_list);
Michele Baldessari196d6752012-12-01 04:49:42 +000094 if (chunk->asoc)
95 chunk->asoc->stats.ipackets++;
David Howellsc4028952006-11-22 14:57:56 +000096 q->immediate.func(&q->immediate);
Eric Dumazet860fbbc2016-04-29 14:16:51 -070097 local_bh_enable();
Linus Torvalds1da177e2005-04-16 15:20:36 -070098}
99
Vlad Yasevichbbd0d592007-10-03 17:51:34 -0700100/* Peek at the next chunk on the inqeue. */
101struct sctp_chunkhdr *sctp_inq_peek(struct sctp_inq *queue)
102{
103 struct sctp_chunk *chunk;
104 sctp_chunkhdr_t *ch = NULL;
105
106 chunk = queue->in_progress;
107 /* If there is no more chunks in this packet, say so */
108 if (chunk->singleton ||
109 chunk->end_of_packet ||
110 chunk->pdiscard)
111 return NULL;
112
113 ch = (sctp_chunkhdr_t *)chunk->chunk_end;
114
115 return ch;
116}
117
118
Linus Torvalds1da177e2005-04-16 15:20:36 -0700119/* Extract a chunk from an SCTP inqueue.
120 *
121 * WARNING: If you need to put the chunk on another queue, you need to
122 * make a shallow copy (clone) of it.
123 */
124struct sctp_chunk *sctp_inq_pop(struct sctp_inq *queue)
125{
126 struct sctp_chunk *chunk;
127 sctp_chunkhdr_t *ch = NULL;
128
129 /* The assumption is that we are safe to process the chunks
130 * at this time.
131 */
132
133 if ((chunk = queue->in_progress)) {
134 /* There is a packet that we have been working on.
135 * Any post processing work to do before we move on?
136 */
137 if (chunk->singleton ||
138 chunk->end_of_packet ||
139 chunk->pdiscard) {
140 sctp_chunk_free(chunk);
141 chunk = queue->in_progress = NULL;
142 } else {
143 /* Nothing to do. Next chunk in the packet, please. */
144 ch = (sctp_chunkhdr_t *) chunk->chunk_end;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700145 /* Force chunk->skb->data to chunk->chunk_end. */
Daniel Borkmann26b87c72014-10-09 22:55:33 +0200146 skb_pull(chunk->skb, chunk->chunk_end - chunk->skb->data);
147 /* We are guaranteed to pull a SCTP header. */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700148 }
149 }
150
151 /* Do we need to take the next packet out of the queue to process? */
152 if (!chunk) {
David S. Miller79af02c2005-07-08 21:47:49 -0700153 struct list_head *entry;
154
Linus Torvalds1da177e2005-04-16 15:20:36 -0700155 /* Is the queue empty? */
David S. Miller79af02c2005-07-08 21:47:49 -0700156 if (list_empty(&queue->in_chunk_list))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157 return NULL;
158
David S. Miller79af02c2005-07-08 21:47:49 -0700159 entry = queue->in_chunk_list.next;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700160 chunk = queue->in_progress =
David S. Miller79af02c2005-07-08 21:47:49 -0700161 list_entry(entry, struct sctp_chunk, list);
162 list_del_init(entry);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700163
164 /* This is the first chunk in the packet. */
165 chunk->singleton = 1;
166 ch = (sctp_chunkhdr_t *) chunk->skb->data;
Neil Horman7c3ceb4f2006-05-05 17:02:09 -0700167 chunk->data_accepted = 0;
Marcelo Ricardo Leitner486bdee2016-04-12 18:11:31 -0300168
169 if (chunk->asoc)
170 sock_rps_save_rxhash(chunk->asoc->base.sk, chunk->skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700171 }
172
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900173 chunk->chunk_hdr = ch;
174 chunk->chunk_end = ((__u8 *)ch) + WORD_ROUND(ntohs(ch->length));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700175 /* In the unlikely case of an IP reassembly, the skb could be
176 * non-linear. If so, update chunk_end so that it doesn't go past
177 * the skb->tail.
178 */
179 if (unlikely(skb_is_nonlinear(chunk->skb))) {
Arnaldo Carvalho de Melo27a884d2007-04-19 20:29:13 -0700180 if (chunk->chunk_end > skb_tail_pointer(chunk->skb))
181 chunk->chunk_end = skb_tail_pointer(chunk->skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700182 }
183 skb_pull(chunk->skb, sizeof(sctp_chunkhdr_t));
184 chunk->subh.v = NULL; /* Subheader is no longer valid. */
185
Daniel Borkmann26b87c72014-10-09 22:55:33 +0200186 if (chunk->chunk_end + sizeof(sctp_chunkhdr_t) <
187 skb_tail_pointer(chunk->skb)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700188 /* This is not a singleton */
189 chunk->singleton = 0;
Arnaldo Carvalho de Melo27a884d2007-04-19 20:29:13 -0700190 } else if (chunk->chunk_end > skb_tail_pointer(chunk->skb)) {
Daniel Borkmann26b87c72014-10-09 22:55:33 +0200191 /* Discard inside state machine. */
192 chunk->pdiscard = 1;
193 chunk->chunk_end = skb_tail_pointer(chunk->skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700194 } else {
195 /* We are at the end of the packet, so mark the chunk
196 * in case we need to send a SACK.
197 */
198 chunk->end_of_packet = 1;
199 }
200
Daniel Borkmannbb333812013-06-28 19:49:40 +0200201 pr_debug("+++sctp_inq_pop+++ chunk:%p[%s], length:%d, skb->len:%d\n",
202 chunk, sctp_cname(SCTP_ST_CHUNK(chunk->chunk_hdr->type)),
203 ntohs(chunk->chunk_hdr->length), chunk->skb->len);
204
Linus Torvalds1da177e2005-04-16 15:20:36 -0700205 return chunk;
206}
207
208/* Set a top-half handler.
209 *
210 * Originally, we the top-half handler was scheduled as a BH. We now
211 * call the handler directly in sctp_inq_push() at a time that
212 * we know we are lock safe.
213 * The intent is that this routine will pull stuff out of the
214 * inqueue and process it.
215 */
David Howellsc4028952006-11-22 14:57:56 +0000216void sctp_inq_set_th_handler(struct sctp_inq *q, work_func_t callback)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700217{
David Howellsc4028952006-11-22 14:57:56 +0000218 INIT_WORK(&q->immediate, callback);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700219}