blob: e650978daf279abe9b1277dabb22f2e865c64a7a [file] [log] [blame]
Vlad Yasevich60c778b2008-01-11 09:57:09 -05001/* SCTP kernel implementation
Linus Torvalds1da177e2005-04-16 15:20:36 -07002 * (C) Copyright IBM Corp. 2001, 2004
3 * Copyright (c) 1999-2000 Cisco, Inc.
4 * Copyright (c) 1999-2001 Motorola, Inc.
5 *
Vlad Yasevich60c778b2008-01-11 09:57:09 -05006 * This file is part of the SCTP kernel implementation
Linus Torvalds1da177e2005-04-16 15:20:36 -07007 *
8 * These functions handle output processing.
9 *
Vlad Yasevich60c778b2008-01-11 09:57:09 -050010 * This SCTP implementation is free software;
Linus Torvalds1da177e2005-04-16 15:20:36 -070011 * you can redistribute it and/or modify it under the terms of
12 * the GNU General Public License as published by
13 * the Free Software Foundation; either version 2, or (at your option)
14 * any later version.
15 *
Vlad Yasevich60c778b2008-01-11 09:57:09 -050016 * This SCTP implementation is distributed in the hope that it
Linus Torvalds1da177e2005-04-16 15:20:36 -070017 * will be useful, but WITHOUT ANY WARRANTY; without even the implied
18 * ************************
19 * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
20 * See the GNU General Public License for more details.
21 *
22 * You should have received a copy of the GNU General Public License
23 * along with GNU CC; see the file COPYING. If not, write to
24 * the Free Software Foundation, 59 Temple Place - Suite 330,
25 * Boston, MA 02111-1307, USA.
26 *
27 * Please send any bug reports or fixes you make to the
28 * email address(es):
Daniel Borkmann91705c62013-07-23 14:51:47 +020029 * lksctp developers <linux-sctp@vger.kernel.org>
Linus Torvalds1da177e2005-04-16 15:20:36 -070030 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070031 * Written or modified by:
32 * La Monte H.P. Yarroll <piggy@acm.org>
33 * Karl Knutson <karl@athena.chicago.il.us>
34 * Jon Grimm <jgrimm@austin.ibm.com>
35 * Sridhar Samudrala <sri@us.ibm.com>
Linus Torvalds1da177e2005-04-16 15:20:36 -070036 */
37
Joe Perches145ce502010-08-24 13:21:08 +000038#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
39
Linus Torvalds1da177e2005-04-16 15:20:36 -070040#include <linux/types.h>
41#include <linux/kernel.h>
42#include <linux/wait.h>
43#include <linux/time.h>
44#include <linux/ip.h>
45#include <linux/ipv6.h>
46#include <linux/init.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090047#include <linux/slab.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070048#include <net/inet_ecn.h>
Vlad Yasevich8d2f9e812009-03-21 13:41:09 -070049#include <net/ip.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070050#include <net/icmp.h>
Pavel Emelyanov7c73a6f2008-07-16 20:20:11 -070051#include <net/net_namespace.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070052
Linus Torvalds1da177e2005-04-16 15:20:36 -070053#include <linux/socket.h> /* for sa_family_t */
54#include <net/sock.h>
55
56#include <net/sctp/sctp.h>
57#include <net/sctp/sm.h>
Vlad Yasevich9ad09772007-12-16 14:06:41 -080058#include <net/sctp/checksum.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070059
60/* Forward declarations for private helpers. */
Neil Hormaned106272012-07-02 09:59:24 +000061static sctp_xmit_t __sctp_packet_append_chunk(struct sctp_packet *packet,
62 struct sctp_chunk *chunk);
Vlad Yaseviche83963b2009-08-07 10:43:07 -040063static sctp_xmit_t sctp_packet_can_append_data(struct sctp_packet *packet,
Linus Torvalds1da177e2005-04-16 15:20:36 -070064 struct sctp_chunk *chunk);
Vlad Yaseviche83963b2009-08-07 10:43:07 -040065static void sctp_packet_append_data(struct sctp_packet *packet,
66 struct sctp_chunk *chunk);
67static sctp_xmit_t sctp_packet_will_fit(struct sctp_packet *packet,
68 struct sctp_chunk *chunk,
69 u16 chunk_len);
Linus Torvalds1da177e2005-04-16 15:20:36 -070070
Wei Yongjunbe297142009-09-04 14:34:06 +080071static void sctp_packet_reset(struct sctp_packet *packet)
72{
73 packet->size = packet->overhead;
74 packet->has_cookie_echo = 0;
75 packet->has_sack = 0;
76 packet->has_data = 0;
77 packet->has_auth = 0;
78 packet->ipfragok = 0;
79 packet->auth = NULL;
80}
81
Linus Torvalds1da177e2005-04-16 15:20:36 -070082/* Config a packet.
83 * This appears to be a followup set of initializations.
84 */
85struct sctp_packet *sctp_packet_config(struct sctp_packet *packet,
86 __u32 vtag, int ecn_capable)
87{
88 struct sctp_chunk *chunk = NULL;
89
Daniel Borkmannbb333812013-06-28 19:49:40 +020090 pr_debug("%s: packet:%p vtag:0x%x\n", __func__, packet, vtag);
Linus Torvalds1da177e2005-04-16 15:20:36 -070091
92 packet->vtag = vtag;
Linus Torvalds1da177e2005-04-16 15:20:36 -070093
94 if (ecn_capable && sctp_packet_empty(packet)) {
95 chunk = sctp_get_ecne_prepend(packet->transport->asoc);
96
97 /* If there a is a prepend chunk stick it on the list before
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +090098 * any other chunks get appended.
99 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700100 if (chunk)
101 sctp_packet_append_chunk(packet, chunk);
102 }
103
104 return packet;
105}
106
107/* Initialize the packet structure. */
108struct sctp_packet *sctp_packet_init(struct sctp_packet *packet,
109 struct sctp_transport *transport,
110 __u16 sport, __u16 dport)
111{
112 struct sctp_association *asoc = transport->asoc;
113 size_t overhead;
114
Daniel Borkmannbb333812013-06-28 19:49:40 +0200115 pr_debug("%s: packet:%p transport:%p\n", __func__, packet, transport);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700116
117 packet->transport = transport;
118 packet->source_port = sport;
119 packet->destination_port = dport;
David S. Miller79af02c2005-07-08 21:47:49 -0700120 INIT_LIST_HEAD(&packet->chunk_list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700121 if (asoc) {
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900122 struct sctp_sock *sp = sctp_sk(asoc->base.sk);
123 overhead = sp->pf->af->net_header_len;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124 } else {
125 overhead = sizeof(struct ipv6hdr);
126 }
127 overhead += sizeof(struct sctphdr);
128 packet->overhead = overhead;
Wei Yongjunbe297142009-09-04 14:34:06 +0800129 sctp_packet_reset(packet);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700130 packet->vtag = 0;
Daniel Borkmann3e3251b2013-04-18 21:59:37 +0000131
Linus Torvalds1da177e2005-04-16 15:20:36 -0700132 return packet;
133}
134
135/* Free a packet. */
136void sctp_packet_free(struct sctp_packet *packet)
137{
David S. Miller79af02c2005-07-08 21:47:49 -0700138 struct sctp_chunk *chunk, *tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700139
Daniel Borkmannbb333812013-06-28 19:49:40 +0200140 pr_debug("%s: packet:%p\n", __func__, packet);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700141
David S. Miller79af02c2005-07-08 21:47:49 -0700142 list_for_each_entry_safe(chunk, tmp, &packet->chunk_list, list) {
143 list_del_init(&chunk->list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700144 sctp_chunk_free(chunk);
David S. Miller79af02c2005-07-08 21:47:49 -0700145 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700146}
147
148/* This routine tries to append the chunk to the offered packet. If adding
149 * the chunk causes the packet to exceed the path MTU and COOKIE_ECHO chunk
150 * is not present in the packet, it transmits the input packet.
151 * Data can be bundled with a packet containing a COOKIE_ECHO chunk as long
152 * as it can fit in the packet, but any more data that does not fit in this
153 * packet can be sent only after receiving the COOKIE_ACK.
154 */
155sctp_xmit_t sctp_packet_transmit_chunk(struct sctp_packet *packet,
Vlad Yasevich2e3216c2008-06-19 16:08:18 -0700156 struct sctp_chunk *chunk,
157 int one_packet)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700158{
159 sctp_xmit_t retval;
160 int error = 0;
161
Daniel Borkmannbb333812013-06-28 19:49:40 +0200162 pr_debug("%s: packet:%p chunk:%p\n", __func__, packet, chunk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700163
164 switch ((retval = (sctp_packet_append_chunk(packet, chunk)))) {
165 case SCTP_XMIT_PMTU_FULL:
166 if (!packet->has_cookie_echo) {
167 error = sctp_packet_transmit(packet);
168 if (error < 0)
169 chunk->skb->sk->sk_err = -error;
170
171 /* If we have an empty packet, then we can NOT ever
172 * return PMTU_FULL.
173 */
Vlad Yasevich2e3216c2008-06-19 16:08:18 -0700174 if (!one_packet)
175 retval = sctp_packet_append_chunk(packet,
176 chunk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700177 }
178 break;
179
180 case SCTP_XMIT_RWND_FULL:
181 case SCTP_XMIT_OK:
182 case SCTP_XMIT_NAGLE_DELAY:
183 break;
Stephen Hemminger3ff50b72007-04-20 17:09:22 -0700184 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700185
186 return retval;
187}
188
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700189/* Try to bundle an auth chunk into the packet. */
190static sctp_xmit_t sctp_packet_bundle_auth(struct sctp_packet *pkt,
191 struct sctp_chunk *chunk)
192{
193 struct sctp_association *asoc = pkt->transport->asoc;
194 struct sctp_chunk *auth;
195 sctp_xmit_t retval = SCTP_XMIT_OK;
196
197 /* if we don't have an association, we can't do authentication */
198 if (!asoc)
199 return retval;
200
201 /* See if this is an auth chunk we are bundling or if
202 * auth is already bundled.
203 */
Vlad Yasevich4007cc82009-09-04 18:21:00 -0400204 if (chunk->chunk_hdr->type == SCTP_CID_AUTH || pkt->has_auth)
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700205 return retval;
206
207 /* if the peer did not request this chunk to be authenticated,
208 * don't do it
209 */
210 if (!chunk->auth)
211 return retval;
212
213 auth = sctp_make_auth(asoc);
214 if (!auth)
215 return retval;
216
Neil Hormaned106272012-07-02 09:59:24 +0000217 retval = __sctp_packet_append_chunk(pkt, auth);
218
219 if (retval != SCTP_XMIT_OK)
220 sctp_chunk_free(auth);
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700221
222 return retval;
223}
224
Linus Torvalds1da177e2005-04-16 15:20:36 -0700225/* Try to bundle a SACK with the packet. */
226static sctp_xmit_t sctp_packet_bundle_sack(struct sctp_packet *pkt,
227 struct sctp_chunk *chunk)
228{
229 sctp_xmit_t retval = SCTP_XMIT_OK;
230
231 /* If sending DATA and haven't aleady bundled a SACK, try to
232 * bundle one in to the packet.
233 */
234 if (sctp_chunk_is_data(chunk) && !pkt->has_sack &&
235 !pkt->has_cookie_echo) {
236 struct sctp_association *asoc;
Doug Grahamaf87b822009-07-29 12:05:57 -0400237 struct timer_list *timer;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700238 asoc = pkt->transport->asoc;
Doug Grahamaf87b822009-07-29 12:05:57 -0400239 timer = &asoc->timers[SCTP_EVENT_TIMEOUT_SACK];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700240
Doug Grahamaf87b822009-07-29 12:05:57 -0400241 /* If the SACK timer is running, we have a pending SACK */
242 if (timer_pending(timer)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700243 struct sctp_chunk *sack;
Neil Horman42448542012-06-30 03:04:26 +0000244
245 if (pkt->transport->sack_generation !=
246 pkt->transport->asoc->peer.sack_generation)
247 return retval;
248
Linus Torvalds1da177e2005-04-16 15:20:36 -0700249 asoc->a_rwnd = asoc->rwnd;
250 sack = sctp_make_sack(asoc);
251 if (sack) {
Neil Hormaned106272012-07-02 09:59:24 +0000252 retval = __sctp_packet_append_chunk(pkt, sack);
253 if (retval != SCTP_XMIT_OK) {
254 sctp_chunk_free(sack);
255 goto out;
256 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700257 asoc->peer.sack_needed = 0;
Doug Grahamaf87b822009-07-29 12:05:57 -0400258 if (del_timer(timer))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700259 sctp_association_put(asoc);
260 }
261 }
262 }
Neil Hormaned106272012-07-02 09:59:24 +0000263out:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700264 return retval;
265}
266
Neil Hormaned106272012-07-02 09:59:24 +0000267
Linus Torvalds1da177e2005-04-16 15:20:36 -0700268/* Append a chunk to the offered packet reporting back any inability to do
269 * so.
270 */
Neil Hormaned106272012-07-02 09:59:24 +0000271static sctp_xmit_t __sctp_packet_append_chunk(struct sctp_packet *packet,
272 struct sctp_chunk *chunk)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700273{
274 sctp_xmit_t retval = SCTP_XMIT_OK;
275 __u16 chunk_len = WORD_ROUND(ntohs(chunk->chunk_hdr->length));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700276
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400277 /* Check to see if this chunk will fit into the packet */
278 retval = sctp_packet_will_fit(packet, chunk, chunk_len);
279 if (retval != SCTP_XMIT_OK)
280 goto finish;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700281
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400282 /* We believe that this chunk is OK to add to the packet */
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700283 switch (chunk->chunk_hdr->type) {
284 case SCTP_CID_DATA:
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400285 /* Account for the data being in the packet */
286 sctp_packet_append_data(packet, chunk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700287 /* Disallow SACK bundling after DATA. */
288 packet->has_sack = 1;
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700289 /* Disallow AUTH bundling after DATA */
290 packet->has_auth = 1;
291 /* Let it be knows that packet has DATA in it */
292 packet->has_data = 1;
Vlad Yasevich759af002009-01-22 14:53:01 -0800293 /* timestamp the chunk for rtx purposes */
294 chunk->sent_at = jiffies;
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700295 break;
296 case SCTP_CID_COOKIE_ECHO:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700297 packet->has_cookie_echo = 1;
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700298 break;
299
300 case SCTP_CID_SACK:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700301 packet->has_sack = 1;
Michele Baldessari196d6752012-12-01 04:49:42 +0000302 if (chunk->asoc)
303 chunk->asoc->stats.osacks++;
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700304 break;
305
306 case SCTP_CID_AUTH:
307 packet->has_auth = 1;
308 packet->auth = chunk;
309 break;
310 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700311
312 /* It is OK to send this chunk. */
David S. Miller79af02c2005-07-08 21:47:49 -0700313 list_add_tail(&chunk->list, &packet->chunk_list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700314 packet->size += chunk_len;
315 chunk->transport = packet->transport;
316finish:
317 return retval;
318}
319
Neil Hormaned106272012-07-02 09:59:24 +0000320/* Append a chunk to the offered packet reporting back any inability to do
321 * so.
322 */
323sctp_xmit_t sctp_packet_append_chunk(struct sctp_packet *packet,
324 struct sctp_chunk *chunk)
325{
326 sctp_xmit_t retval = SCTP_XMIT_OK;
327
Daniel Borkmannbb333812013-06-28 19:49:40 +0200328 pr_debug("%s: packet:%p chunk:%p\n", __func__, packet, chunk);
Neil Hormaned106272012-07-02 09:59:24 +0000329
330 /* Data chunks are special. Before seeing what else we can
331 * bundle into this packet, check to see if we are allowed to
332 * send this DATA.
333 */
334 if (sctp_chunk_is_data(chunk)) {
335 retval = sctp_packet_can_append_data(packet, chunk);
336 if (retval != SCTP_XMIT_OK)
337 goto finish;
338 }
339
340 /* Try to bundle AUTH chunk */
341 retval = sctp_packet_bundle_auth(packet, chunk);
342 if (retval != SCTP_XMIT_OK)
343 goto finish;
344
345 /* Try to bundle SACK chunk */
346 retval = sctp_packet_bundle_sack(packet, chunk);
347 if (retval != SCTP_XMIT_OK)
348 goto finish;
349
350 retval = __sctp_packet_append_chunk(packet, chunk);
351
352finish:
353 return retval;
354}
355
Thomas Graf4c3a5bd2012-09-03 04:27:42 +0000356static void sctp_packet_release_owner(struct sk_buff *skb)
357{
358 sk_free(skb->sk);
359}
360
361static void sctp_packet_set_owner_w(struct sk_buff *skb, struct sock *sk)
362{
363 skb_orphan(skb);
364 skb->sk = sk;
365 skb->destructor = sctp_packet_release_owner;
366
367 /*
368 * The data chunks have already been accounted for in sctp_sendmsg(),
369 * therefore only reserve a single byte to keep socket around until
370 * the packet has been transmitted.
371 */
372 atomic_inc(&sk->sk_wmem_alloc);
373}
374
Linus Torvalds1da177e2005-04-16 15:20:36 -0700375/* All packets are sent to the network through this function from
376 * sctp_outq_tail().
377 *
378 * The return value is a normal kernel error return value.
379 */
380int sctp_packet_transmit(struct sctp_packet *packet)
381{
382 struct sctp_transport *tp = packet->transport;
383 struct sctp_association *asoc = tp->asoc;
384 struct sctphdr *sh;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700385 struct sk_buff *nskb;
David S. Miller79af02c2005-07-08 21:47:49 -0700386 struct sctp_chunk *chunk, *tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700387 struct sock *sk;
388 int err = 0;
389 int padding; /* How much padding do we need? */
390 __u8 has_data = 0;
Sridhar Samudrala503b55f2006-06-17 22:57:28 -0700391 struct dst_entry *dst = tp->dst;
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700392 unsigned char *auth = NULL; /* pointer to auth in skb data */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700393
Daniel Borkmannbb333812013-06-28 19:49:40 +0200394 pr_debug("%s: packet:%p\n", __func__, packet);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700395
396 /* Do NOT generate a chunkless packet. */
David S. Miller79af02c2005-07-08 21:47:49 -0700397 if (list_empty(&packet->chunk_list))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700398 return err;
399
400 /* Set up convenience variables... */
David S. Miller79af02c2005-07-08 21:47:49 -0700401 chunk = list_entry(packet->chunk_list.next, struct sctp_chunk, list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700402 sk = chunk->skb->sk;
403
404 /* Allocate the new skb. */
Sridhar Samudrala594ccc12005-04-28 12:00:23 -0700405 nskb = alloc_skb(packet->size + LL_MAX_HEADER, GFP_ATOMIC);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700406 if (!nskb)
407 goto nomem;
408
409 /* Make sure the outbound skb has enough header room reserved. */
Sridhar Samudrala594ccc12005-04-28 12:00:23 -0700410 skb_reserve(nskb, packet->overhead + LL_MAX_HEADER);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700411
412 /* Set the owning socket so that we know where to get the
413 * destination IP address.
414 */
Thomas Graf4c3a5bd2012-09-03 04:27:42 +0000415 sctp_packet_set_owner_w(nskb, sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700416
Nicolas Dichtele0268862012-05-04 05:24:54 +0000417 if (!sctp_transport_dst_check(tp)) {
Sridhar Samudrala503b55f2006-06-17 22:57:28 -0700418 sctp_transport_route(tp, NULL, sctp_sk(sk));
419 if (asoc && (asoc->param_flags & SPP_PMTUD_ENABLE)) {
David S. Miller02f3d4c2012-07-16 03:57:14 -0700420 sctp_assoc_sync_pmtu(sk, asoc);
Sridhar Samudrala503b55f2006-06-17 22:57:28 -0700421 }
422 }
Eric Dumazetadf30902009-06-02 05:19:30 +0000423 dst = dst_clone(tp->dst);
424 skb_dst_set(nskb, dst);
Wei Yongjunff0ac742009-06-28 22:49:37 +0000425 if (!dst)
Sridhar Samudrala503b55f2006-06-17 22:57:28 -0700426 goto no_route;
Sridhar Samudrala503b55f2006-06-17 22:57:28 -0700427
Linus Torvalds1da177e2005-04-16 15:20:36 -0700428 /* Build the SCTP header. */
429 sh = (struct sctphdr *)skb_push(nskb, sizeof(struct sctphdr));
Jesse Brandeburg8dc92f72009-04-27 22:35:52 +0000430 skb_reset_transport_header(nskb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700431 sh->source = htons(packet->source_port);
432 sh->dest = htons(packet->destination_port);
433
434 /* From 6.8 Adler-32 Checksum Calculation:
435 * After the packet is constructed (containing the SCTP common
436 * header and one or more control or DATA chunks), the
437 * transmitter shall:
438 *
439 * 1) Fill in the proper Verification Tag in the SCTP common
440 * header and initialize the checksum field to 0's.
441 */
442 sh->vtag = htonl(packet->vtag);
443 sh->checksum = 0;
444
Linus Torvalds1da177e2005-04-16 15:20:36 -0700445 /**
446 * 6.10 Bundling
447 *
448 * An endpoint bundles chunks by simply including multiple
449 * chunks in one outbound SCTP packet. ...
450 */
451
452 /**
453 * 3.2 Chunk Field Descriptions
454 *
455 * The total length of a chunk (including Type, Length and
456 * Value fields) MUST be a multiple of 4 bytes. If the length
457 * of the chunk is not a multiple of 4 bytes, the sender MUST
458 * pad the chunk with all zero bytes and this padding is not
459 * included in the chunk length field. The sender should
460 * never pad with more than 3 bytes.
461 *
462 * [This whole comment explains WORD_ROUND() below.]
463 */
Daniel Borkmannbb333812013-06-28 19:49:40 +0200464
465 pr_debug("***sctp_transmit_packet***\n");
466
David S. Miller79af02c2005-07-08 21:47:49 -0700467 list_for_each_entry_safe(chunk, tmp, &packet->chunk_list, list) {
468 list_del_init(&chunk->list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700469 if (sctp_chunk_is_data(chunk)) {
Vlad Yasevichae19c542010-04-30 22:41:09 -0400470 /* 6.3.1 C4) When data is in flight and when allowed
471 * by rule C5, a new RTT measurement MUST be made each
472 * round trip. Furthermore, new RTT measurements
473 * SHOULD be made no more than once per round-trip
474 * for a given destination transport address.
475 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700476
Vlad Yasevichae19c542010-04-30 22:41:09 -0400477 if (!tp->rto_pending) {
478 chunk->rtt_in_progress = 1;
479 tp->rto_pending = 1;
Neil Hormand8dd1572009-11-23 15:54:00 -0500480 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700481 has_data = 1;
482 }
483
484 padding = WORD_ROUND(chunk->skb->len) - chunk->skb->len;
485 if (padding)
486 memset(skb_put(chunk->skb, padding), 0, padding);
487
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700488 /* if this is the auth chunk that we are adding,
489 * store pointer where it will be added and put
490 * the auth into the packet.
491 */
492 if (chunk == packet->auth)
493 auth = skb_tail_pointer(nskb);
494
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700495 memcpy(skb_put(nskb, chunk->skb->len),
Sridhar Samudrala503b55f2006-06-17 22:57:28 -0700496 chunk->skb->data, chunk->skb->len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700497
Daniel Borkmannbb333812013-06-28 19:49:40 +0200498 pr_debug("*** Chunk:%p[%s] %s 0x%x, length:%d, chunk->skb->len:%d, "
499 "rtt_in_progress:%d\n", chunk,
500 sctp_cname(SCTP_ST_CHUNK(chunk->chunk_hdr->type)),
501 chunk->has_tsn ? "TSN" : "No TSN",
502 chunk->has_tsn ? ntohl(chunk->subh.data_hdr->tsn) : 0,
503 ntohs(chunk->chunk_hdr->length), chunk->skb->len,
504 chunk->rtt_in_progress);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700505
506 /*
507 * If this is a control chunk, this is our last
508 * reference. Free data chunks after they've been
509 * acknowledged or have failed.
510 */
511 if (!sctp_chunk_is_data(chunk))
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900512 sctp_chunk_free(chunk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700513 }
514
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700515 /* SCTP-AUTH, Section 6.2
516 * The sender MUST calculate the MAC as described in RFC2104 [2]
517 * using the hash function H as described by the MAC Identifier and
518 * the shared association key K based on the endpoint pair shared key
519 * described by the shared key identifier. The 'data' used for the
520 * computation of the AUTH-chunk is given by the AUTH chunk with its
521 * HMAC field set to zero (as shown in Figure 6) followed by all
522 * chunks that are placed after the AUTH chunk in the SCTP packet.
523 */
524 if (auth)
525 sctp_auth_calculate_hmac(asoc, nskb,
526 (struct sctp_auth_chunk *)auth,
527 GFP_ATOMIC);
528
529 /* 2) Calculate the Adler-32 checksum of the whole packet,
530 * including the SCTP common header and all the
531 * chunks.
532 *
533 * Note: Adler-32 is no longer applicable, as has been replaced
534 * by CRC32-C as described in <draft-ietf-tsvwg-sctpcsum-02.txt>.
535 */
David S. Miller71acc0d2013-08-09 13:09:41 -0700536 if (!sctp_checksum_disable) {
Fan Du27127a82013-10-15 22:01:30 -0400537 if (!(dst->dev->features & NETIF_F_SCTP_CSUM) ||
Vlad Yasevichd2dbbba2013-10-15 22:01:31 -0400538 (dst_xfrm(dst) != NULL) || packet->ipfragok) {
Daniel Borkmanne6d8b642013-10-30 11:50:52 +0100539 sh->checksum = sctp_compute_cksum(nskb, 0);
Michał Mirosławb73c43f2011-07-13 14:10:29 +0000540 } else {
Lucas De Marchi25985ed2011-03-30 22:57:33 -0300541 /* no need to seed pseudo checksum for SCTP */
Jesse Brandeburg8dc92f72009-04-27 22:35:52 +0000542 nskb->ip_summed = CHECKSUM_PARTIAL;
543 nskb->csum_start = (skb_transport_header(nskb) -
544 nskb->head);
545 nskb->csum_offset = offsetof(struct sctphdr, checksum);
Jesse Brandeburg8dc92f72009-04-27 22:35:52 +0000546 }
547 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700548
Linus Torvalds1da177e2005-04-16 15:20:36 -0700549 /* IP layer ECN support
550 * From RFC 2481
551 * "The ECN-Capable Transport (ECT) bit would be set by the
552 * data sender to indicate that the end-points of the
553 * transport protocol are ECN-capable."
554 *
555 * Now setting the ECT bit all the time, as it should not cause
556 * any problems protocol-wise even if our peer ignores it.
557 *
558 * Note: The works for IPv6 layer checks this bit too later
559 * in transmission. See IP6_ECN_flow_xmit().
560 */
Vlad Yasevichb9031d92008-06-04 12:40:15 -0700561 (*tp->af_specific->ecn_capable)(nskb->sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700562
563 /* Set up the IP options. */
564 /* BUG: not implemented
565 * For v4 this all lives somewhere in sk->sk_opt...
566 */
567
568 /* Dump that on IP! */
Michele Baldessari196d6752012-12-01 04:49:42 +0000569 if (asoc) {
570 asoc->stats.opackets++;
571 if (asoc->peer.last_sent_to != tp)
572 /* Considering the multiple CPU scenario, this is a
573 * "correcter" place for last_sent_to. --xguo
574 */
575 asoc->peer.last_sent_to = tp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700576 }
577
578 if (has_data) {
579 struct timer_list *timer;
580 unsigned long timeout;
581
Linus Torvalds1da177e2005-04-16 15:20:36 -0700582 /* Restart the AUTOCLOSE timer when sending data. */
583 if (sctp_state(asoc, ESTABLISHED) && asoc->autoclose) {
584 timer = &asoc->timers[SCTP_EVENT_TIMEOUT_AUTOCLOSE];
585 timeout = asoc->timeouts[SCTP_EVENT_TIMEOUT_AUTOCLOSE];
586
587 if (!mod_timer(timer, jiffies + timeout))
588 sctp_association_hold(asoc);
589 }
590 }
591
Daniel Borkmannbb333812013-06-28 19:49:40 +0200592 pr_debug("***sctp_transmit_packet*** skb->len:%d\n", nskb->len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700593
Herbert Xuf8803742008-08-03 21:15:08 -0700594 nskb->local_df = packet->ipfragok;
595 (*tp->af_specific->sctp_xmit)(nskb, tp);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700596
597out:
Wei Yongjund521c082009-09-02 13:05:33 +0800598 sctp_packet_reset(packet);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700599 return err;
600no_route:
601 kfree_skb(nskb);
Eric W. Biedermanb01a2402012-08-06 08:47:55 +0000602 IP_INC_STATS_BH(sock_net(asoc->base.sk), IPSTATS_MIB_OUTNOROUTES);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700603
604 /* FIXME: Returning the 'err' will effect all the associations
605 * associated with a socket, although only one of the paths of the
606 * association is unreachable.
607 * The real failure of a transport or association can be passed on
608 * to the user via notifications. So setting this error may not be
609 * required.
610 */
611 /* err = -EHOSTUNREACH; */
612err:
613 /* Control chunks are unreliable so just drop them. DATA chunks
614 * will get resent or dropped later.
615 */
616
David S. Miller79af02c2005-07-08 21:47:49 -0700617 list_for_each_entry_safe(chunk, tmp, &packet->chunk_list, list) {
618 list_del_init(&chunk->list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700619 if (!sctp_chunk_is_data(chunk))
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900620 sctp_chunk_free(chunk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700621 }
622 goto out;
623nomem:
624 err = -ENOMEM;
625 goto err;
626}
627
628/********************************************************************
629 * 2nd Level Abstractions
630 ********************************************************************/
631
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400632/* This private function check to see if a chunk can be added */
633static sctp_xmit_t sctp_packet_can_append_data(struct sctp_packet *packet,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700634 struct sctp_chunk *chunk)
635{
636 sctp_xmit_t retval = SCTP_XMIT_OK;
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400637 size_t datasize, rwnd, inflight, flight_size;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700638 struct sctp_transport *transport = packet->transport;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700639 struct sctp_association *asoc = transport->asoc;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700640 struct sctp_outq *q = &asoc->outqueue;
641
642 /* RFC 2960 6.1 Transmission of DATA Chunks
643 *
644 * A) At any given time, the data sender MUST NOT transmit new data to
645 * any destination transport address if its peer's rwnd indicates
646 * that the peer has no buffer space (i.e. rwnd is 0, see Section
647 * 6.2.1). However, regardless of the value of rwnd (including if it
648 * is 0), the data sender can always have one DATA chunk in flight to
649 * the receiver if allowed by cwnd (see rule B below). This rule
650 * allows the sender to probe for a change in rwnd that the sender
651 * missed due to the SACK having been lost in transit from the data
652 * receiver to the data sender.
653 */
654
655 rwnd = asoc->peer.rwnd;
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400656 inflight = q->outstanding_bytes;
657 flight_size = transport->flight_size;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700658
659 datasize = sctp_data_size(chunk);
660
661 if (datasize > rwnd) {
662 if (inflight > 0) {
663 /* We have (at least) one data chunk in flight,
664 * so we can't fall back to rule 6.1 B).
665 */
666 retval = SCTP_XMIT_RWND_FULL;
667 goto finish;
668 }
669 }
670
Linus Torvalds1da177e2005-04-16 15:20:36 -0700671 /* RFC 2960 6.1 Transmission of DATA Chunks
672 *
673 * B) At any given time, the sender MUST NOT transmit new data
674 * to a given transport address if it has cwnd or more bytes
675 * of data outstanding to that transport address.
676 */
677 /* RFC 7.2.4 & the Implementers Guide 2.8.
678 *
679 * 3) ...
680 * When a Fast Retransmit is being performed the sender SHOULD
681 * ignore the value of cwnd and SHOULD NOT delay retransmission.
682 */
Neil Hormanc226ef92008-07-25 12:44:09 -0400683 if (chunk->fast_retransmit != SCTP_NEED_FRTX)
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400684 if (flight_size >= transport->cwnd) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700685 retval = SCTP_XMIT_RWND_FULL;
686 goto finish;
687 }
688
689 /* Nagle's algorithm to solve small-packet problem:
690 * Inhibit the sending of new chunks when new outgoing data arrives
691 * if any previously transmitted data on the connection remains
692 * unacknowledged.
693 */
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400694 if (!sctp_sk(asoc->base.sk)->nodelay && sctp_packet_empty(packet) &&
695 inflight && sctp_state(asoc, ESTABLISHED)) {
Eric Dumazet95c96172012-04-15 05:58:06 +0000696 unsigned int max = transport->pathmtu - packet->overhead;
697 unsigned int len = chunk->skb->len + q->out_qlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700698
699 /* Check whether this chunk and all the rest of pending
700 * data will fit or delay in hopes of bundling a full
701 * sized packet.
Vlad Yasevichcb95ea32009-09-04 18:20:59 -0400702 * Don't delay large message writes that may have been
703 * fragmeneted into small peices.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700704 */
Vlad Yasevich0e3aef82010-04-30 22:41:10 -0400705 if ((len < max) && chunk->msg->can_delay) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700706 retval = SCTP_XMIT_NAGLE_DELAY;
707 goto finish;
708 }
709 }
710
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400711finish:
712 return retval;
713}
714
715/* This private function does management things when adding DATA chunk */
716static void sctp_packet_append_data(struct sctp_packet *packet,
717 struct sctp_chunk *chunk)
718{
719 struct sctp_transport *transport = packet->transport;
720 size_t datasize = sctp_data_size(chunk);
721 struct sctp_association *asoc = transport->asoc;
722 u32 rwnd = asoc->peer.rwnd;
723
Linus Torvalds1da177e2005-04-16 15:20:36 -0700724 /* Keep track of how many bytes are in flight over this transport. */
725 transport->flight_size += datasize;
726
727 /* Keep track of how many bytes are in flight to the receiver. */
728 asoc->outqueue.outstanding_bytes += datasize;
729
Thomas Grafa76c0ad2011-12-19 04:11:40 +0000730 /* Update our view of the receiver's rwnd. */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700731 if (datasize < rwnd)
732 rwnd -= datasize;
733 else
734 rwnd = 0;
735
736 asoc->peer.rwnd = rwnd;
737 /* Has been accepted for transmission. */
738 if (!asoc->peer.prsctp_capable)
739 chunk->msg->can_abandon = 0;
Neil Hormand8dd1572009-11-23 15:54:00 -0500740 sctp_chunk_assign_tsn(chunk);
741 sctp_chunk_assign_ssn(chunk);
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400742}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700743
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400744static sctp_xmit_t sctp_packet_will_fit(struct sctp_packet *packet,
745 struct sctp_chunk *chunk,
746 u16 chunk_len)
747{
748 size_t psize;
749 size_t pmtu;
750 int too_big;
751 sctp_xmit_t retval = SCTP_XMIT_OK;
752
753 psize = packet->size;
754 pmtu = ((packet->transport->asoc) ?
755 (packet->transport->asoc->pathmtu) :
756 (packet->transport->pathmtu));
757
758 too_big = (psize + chunk_len > pmtu);
759
760 /* Decide if we need to fragment or resubmit later. */
761 if (too_big) {
762 /* It's OK to fragmet at IP level if any one of the following
763 * is true:
764 * 1. The packet is empty (meaning this chunk is greater
765 * the MTU)
766 * 2. The chunk we are adding is a control chunk
767 * 3. The packet doesn't have any data in it yet and data
768 * requires authentication.
769 */
770 if (sctp_packet_empty(packet) || !sctp_chunk_is_data(chunk) ||
771 (!packet->has_data && chunk->auth)) {
772 /* We no longer do re-fragmentation.
773 * Just fragment at the IP layer, if we
774 * actually hit this condition
775 */
776 packet->ipfragok = 1;
777 } else {
778 retval = SCTP_XMIT_PMTU_FULL;
779 }
780 }
781
Linus Torvalds1da177e2005-04-16 15:20:36 -0700782 return retval;
783}