blob: a46d1eb41762801e2d95011bf3af8327c57ebac2 [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):
29 * lksctp developers <lksctp-developers@lists.sourceforge.net>
30 *
31 * Or submit a bug report through the following website:
32 * http://www.sf.net/projects/lksctp
33 *
34 * Written or modified by:
35 * La Monte H.P. Yarroll <piggy@acm.org>
36 * Karl Knutson <karl@athena.chicago.il.us>
37 * Jon Grimm <jgrimm@austin.ibm.com>
38 * Sridhar Samudrala <sri@us.ibm.com>
39 *
40 * Any bugs reported given to us we will try to fix... any fixes shared will
41 * be incorporated into the next SCTP release.
42 */
43
Joe Perches145ce502010-08-24 13:21:08 +000044#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
45
Linus Torvalds1da177e2005-04-16 15:20:36 -070046#include <linux/types.h>
47#include <linux/kernel.h>
48#include <linux/wait.h>
49#include <linux/time.h>
50#include <linux/ip.h>
51#include <linux/ipv6.h>
52#include <linux/init.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090053#include <linux/slab.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070054#include <net/inet_ecn.h>
Vlad Yasevich8d2f9e812009-03-21 13:41:09 -070055#include <net/ip.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070056#include <net/icmp.h>
Pavel Emelyanov7c73a6f2008-07-16 20:20:11 -070057#include <net/net_namespace.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070058
Linus Torvalds1da177e2005-04-16 15:20:36 -070059#include <linux/socket.h> /* for sa_family_t */
60#include <net/sock.h>
61
62#include <net/sctp/sctp.h>
63#include <net/sctp/sm.h>
Vlad Yasevich9ad09772007-12-16 14:06:41 -080064#include <net/sctp/checksum.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070065
66/* Forward declarations for private helpers. */
Neil Hormaned106272012-07-02 09:59:24 +000067static sctp_xmit_t __sctp_packet_append_chunk(struct sctp_packet *packet,
68 struct sctp_chunk *chunk);
Vlad Yaseviche83963b2009-08-07 10:43:07 -040069static sctp_xmit_t sctp_packet_can_append_data(struct sctp_packet *packet,
Linus Torvalds1da177e2005-04-16 15:20:36 -070070 struct sctp_chunk *chunk);
Vlad Yaseviche83963b2009-08-07 10:43:07 -040071static void sctp_packet_append_data(struct sctp_packet *packet,
72 struct sctp_chunk *chunk);
73static sctp_xmit_t sctp_packet_will_fit(struct sctp_packet *packet,
74 struct sctp_chunk *chunk,
75 u16 chunk_len);
Linus Torvalds1da177e2005-04-16 15:20:36 -070076
Wei Yongjunbe297142009-09-04 14:34:06 +080077static void sctp_packet_reset(struct sctp_packet *packet)
78{
79 packet->size = packet->overhead;
80 packet->has_cookie_echo = 0;
81 packet->has_sack = 0;
82 packet->has_data = 0;
83 packet->has_auth = 0;
84 packet->ipfragok = 0;
85 packet->auth = NULL;
86}
87
Linus Torvalds1da177e2005-04-16 15:20:36 -070088/* Config a packet.
89 * This appears to be a followup set of initializations.
90 */
91struct sctp_packet *sctp_packet_config(struct sctp_packet *packet,
92 __u32 vtag, int ecn_capable)
93{
94 struct sctp_chunk *chunk = NULL;
95
Daniel Borkmannbb333812013-06-28 19:49:40 +020096 pr_debug("%s: packet:%p vtag:0x%x\n", __func__, packet, vtag);
Linus Torvalds1da177e2005-04-16 15:20:36 -070097
98 packet->vtag = vtag;
Linus Torvalds1da177e2005-04-16 15:20:36 -070099
100 if (ecn_capable && sctp_packet_empty(packet)) {
101 chunk = sctp_get_ecne_prepend(packet->transport->asoc);
102
103 /* If there a is a prepend chunk stick it on the list before
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900104 * any other chunks get appended.
105 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700106 if (chunk)
107 sctp_packet_append_chunk(packet, chunk);
108 }
109
110 return packet;
111}
112
113/* Initialize the packet structure. */
114struct sctp_packet *sctp_packet_init(struct sctp_packet *packet,
115 struct sctp_transport *transport,
116 __u16 sport, __u16 dport)
117{
118 struct sctp_association *asoc = transport->asoc;
119 size_t overhead;
120
Daniel Borkmannbb333812013-06-28 19:49:40 +0200121 pr_debug("%s: packet:%p transport:%p\n", __func__, packet, transport);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700122
123 packet->transport = transport;
124 packet->source_port = sport;
125 packet->destination_port = dport;
David S. Miller79af02c2005-07-08 21:47:49 -0700126 INIT_LIST_HEAD(&packet->chunk_list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700127 if (asoc) {
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900128 struct sctp_sock *sp = sctp_sk(asoc->base.sk);
129 overhead = sp->pf->af->net_header_len;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700130 } else {
131 overhead = sizeof(struct ipv6hdr);
132 }
133 overhead += sizeof(struct sctphdr);
134 packet->overhead = overhead;
Wei Yongjunbe297142009-09-04 14:34:06 +0800135 sctp_packet_reset(packet);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700136 packet->vtag = 0;
Daniel Borkmann3e3251b2013-04-18 21:59:37 +0000137
Linus Torvalds1da177e2005-04-16 15:20:36 -0700138 return packet;
139}
140
141/* Free a packet. */
142void sctp_packet_free(struct sctp_packet *packet)
143{
David S. Miller79af02c2005-07-08 21:47:49 -0700144 struct sctp_chunk *chunk, *tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700145
Daniel Borkmannbb333812013-06-28 19:49:40 +0200146 pr_debug("%s: packet:%p\n", __func__, packet);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700147
David S. Miller79af02c2005-07-08 21:47:49 -0700148 list_for_each_entry_safe(chunk, tmp, &packet->chunk_list, list) {
149 list_del_init(&chunk->list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700150 sctp_chunk_free(chunk);
David S. Miller79af02c2005-07-08 21:47:49 -0700151 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700152}
153
154/* This routine tries to append the chunk to the offered packet. If adding
155 * the chunk causes the packet to exceed the path MTU and COOKIE_ECHO chunk
156 * is not present in the packet, it transmits the input packet.
157 * Data can be bundled with a packet containing a COOKIE_ECHO chunk as long
158 * as it can fit in the packet, but any more data that does not fit in this
159 * packet can be sent only after receiving the COOKIE_ACK.
160 */
161sctp_xmit_t sctp_packet_transmit_chunk(struct sctp_packet *packet,
Vlad Yasevich2e3216c2008-06-19 16:08:18 -0700162 struct sctp_chunk *chunk,
163 int one_packet)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700164{
165 sctp_xmit_t retval;
166 int error = 0;
167
Daniel Borkmannbb333812013-06-28 19:49:40 +0200168 pr_debug("%s: packet:%p chunk:%p\n", __func__, packet, chunk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700169
170 switch ((retval = (sctp_packet_append_chunk(packet, chunk)))) {
171 case SCTP_XMIT_PMTU_FULL:
172 if (!packet->has_cookie_echo) {
173 error = sctp_packet_transmit(packet);
174 if (error < 0)
175 chunk->skb->sk->sk_err = -error;
176
177 /* If we have an empty packet, then we can NOT ever
178 * return PMTU_FULL.
179 */
Vlad Yasevich2e3216c2008-06-19 16:08:18 -0700180 if (!one_packet)
181 retval = sctp_packet_append_chunk(packet,
182 chunk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700183 }
184 break;
185
186 case SCTP_XMIT_RWND_FULL:
187 case SCTP_XMIT_OK:
188 case SCTP_XMIT_NAGLE_DELAY:
189 break;
Stephen Hemminger3ff50b72007-04-20 17:09:22 -0700190 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700191
192 return retval;
193}
194
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700195/* Try to bundle an auth chunk into the packet. */
196static sctp_xmit_t sctp_packet_bundle_auth(struct sctp_packet *pkt,
197 struct sctp_chunk *chunk)
198{
199 struct sctp_association *asoc = pkt->transport->asoc;
200 struct sctp_chunk *auth;
201 sctp_xmit_t retval = SCTP_XMIT_OK;
202
203 /* if we don't have an association, we can't do authentication */
204 if (!asoc)
205 return retval;
206
207 /* See if this is an auth chunk we are bundling or if
208 * auth is already bundled.
209 */
Vlad Yasevich4007cc82009-09-04 18:21:00 -0400210 if (chunk->chunk_hdr->type == SCTP_CID_AUTH || pkt->has_auth)
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700211 return retval;
212
213 /* if the peer did not request this chunk to be authenticated,
214 * don't do it
215 */
216 if (!chunk->auth)
217 return retval;
218
219 auth = sctp_make_auth(asoc);
220 if (!auth)
221 return retval;
222
Neil Hormaned106272012-07-02 09:59:24 +0000223 retval = __sctp_packet_append_chunk(pkt, auth);
224
225 if (retval != SCTP_XMIT_OK)
226 sctp_chunk_free(auth);
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700227
228 return retval;
229}
230
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231/* Try to bundle a SACK with the packet. */
232static sctp_xmit_t sctp_packet_bundle_sack(struct sctp_packet *pkt,
233 struct sctp_chunk *chunk)
234{
235 sctp_xmit_t retval = SCTP_XMIT_OK;
236
237 /* If sending DATA and haven't aleady bundled a SACK, try to
238 * bundle one in to the packet.
239 */
240 if (sctp_chunk_is_data(chunk) && !pkt->has_sack &&
241 !pkt->has_cookie_echo) {
242 struct sctp_association *asoc;
Doug Grahamaf87b822009-07-29 12:05:57 -0400243 struct timer_list *timer;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700244 asoc = pkt->transport->asoc;
Doug Grahamaf87b822009-07-29 12:05:57 -0400245 timer = &asoc->timers[SCTP_EVENT_TIMEOUT_SACK];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700246
Doug Grahamaf87b822009-07-29 12:05:57 -0400247 /* If the SACK timer is running, we have a pending SACK */
248 if (timer_pending(timer)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700249 struct sctp_chunk *sack;
Neil Horman42448542012-06-30 03:04:26 +0000250
251 if (pkt->transport->sack_generation !=
252 pkt->transport->asoc->peer.sack_generation)
253 return retval;
254
Linus Torvalds1da177e2005-04-16 15:20:36 -0700255 asoc->a_rwnd = asoc->rwnd;
256 sack = sctp_make_sack(asoc);
257 if (sack) {
Neil Hormaned106272012-07-02 09:59:24 +0000258 retval = __sctp_packet_append_chunk(pkt, sack);
259 if (retval != SCTP_XMIT_OK) {
260 sctp_chunk_free(sack);
261 goto out;
262 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700263 asoc->peer.sack_needed = 0;
Doug Grahamaf87b822009-07-29 12:05:57 -0400264 if (del_timer(timer))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700265 sctp_association_put(asoc);
266 }
267 }
268 }
Neil Hormaned106272012-07-02 09:59:24 +0000269out:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700270 return retval;
271}
272
Neil Hormaned106272012-07-02 09:59:24 +0000273
Linus Torvalds1da177e2005-04-16 15:20:36 -0700274/* Append a chunk to the offered packet reporting back any inability to do
275 * so.
276 */
Neil Hormaned106272012-07-02 09:59:24 +0000277static sctp_xmit_t __sctp_packet_append_chunk(struct sctp_packet *packet,
278 struct sctp_chunk *chunk)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700279{
280 sctp_xmit_t retval = SCTP_XMIT_OK;
281 __u16 chunk_len = WORD_ROUND(ntohs(chunk->chunk_hdr->length));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700282
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400283 /* Check to see if this chunk will fit into the packet */
284 retval = sctp_packet_will_fit(packet, chunk, chunk_len);
285 if (retval != SCTP_XMIT_OK)
286 goto finish;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700287
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400288 /* We believe that this chunk is OK to add to the packet */
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700289 switch (chunk->chunk_hdr->type) {
290 case SCTP_CID_DATA:
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400291 /* Account for the data being in the packet */
292 sctp_packet_append_data(packet, chunk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700293 /* Disallow SACK bundling after DATA. */
294 packet->has_sack = 1;
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700295 /* Disallow AUTH bundling after DATA */
296 packet->has_auth = 1;
297 /* Let it be knows that packet has DATA in it */
298 packet->has_data = 1;
Vlad Yasevich759af002009-01-22 14:53:01 -0800299 /* timestamp the chunk for rtx purposes */
300 chunk->sent_at = jiffies;
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700301 break;
302 case SCTP_CID_COOKIE_ECHO:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700303 packet->has_cookie_echo = 1;
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700304 break;
305
306 case SCTP_CID_SACK:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700307 packet->has_sack = 1;
Michele Baldessari196d6752012-12-01 04:49:42 +0000308 if (chunk->asoc)
309 chunk->asoc->stats.osacks++;
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700310 break;
311
312 case SCTP_CID_AUTH:
313 packet->has_auth = 1;
314 packet->auth = chunk;
315 break;
316 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700317
318 /* It is OK to send this chunk. */
David S. Miller79af02c2005-07-08 21:47:49 -0700319 list_add_tail(&chunk->list, &packet->chunk_list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700320 packet->size += chunk_len;
321 chunk->transport = packet->transport;
322finish:
323 return retval;
324}
325
Neil Hormaned106272012-07-02 09:59:24 +0000326/* Append a chunk to the offered packet reporting back any inability to do
327 * so.
328 */
329sctp_xmit_t sctp_packet_append_chunk(struct sctp_packet *packet,
330 struct sctp_chunk *chunk)
331{
332 sctp_xmit_t retval = SCTP_XMIT_OK;
333
Daniel Borkmannbb333812013-06-28 19:49:40 +0200334 pr_debug("%s: packet:%p chunk:%p\n", __func__, packet, chunk);
Neil Hormaned106272012-07-02 09:59:24 +0000335
336 /* Data chunks are special. Before seeing what else we can
337 * bundle into this packet, check to see if we are allowed to
338 * send this DATA.
339 */
340 if (sctp_chunk_is_data(chunk)) {
341 retval = sctp_packet_can_append_data(packet, chunk);
342 if (retval != SCTP_XMIT_OK)
343 goto finish;
344 }
345
346 /* Try to bundle AUTH chunk */
347 retval = sctp_packet_bundle_auth(packet, chunk);
348 if (retval != SCTP_XMIT_OK)
349 goto finish;
350
351 /* Try to bundle SACK chunk */
352 retval = sctp_packet_bundle_sack(packet, chunk);
353 if (retval != SCTP_XMIT_OK)
354 goto finish;
355
356 retval = __sctp_packet_append_chunk(packet, chunk);
357
358finish:
359 return retval;
360}
361
Thomas Graf4c3a5bd2012-09-03 04:27:42 +0000362static void sctp_packet_release_owner(struct sk_buff *skb)
363{
364 sk_free(skb->sk);
365}
366
367static void sctp_packet_set_owner_w(struct sk_buff *skb, struct sock *sk)
368{
369 skb_orphan(skb);
370 skb->sk = sk;
371 skb->destructor = sctp_packet_release_owner;
372
373 /*
374 * The data chunks have already been accounted for in sctp_sendmsg(),
375 * therefore only reserve a single byte to keep socket around until
376 * the packet has been transmitted.
377 */
378 atomic_inc(&sk->sk_wmem_alloc);
379}
380
Linus Torvalds1da177e2005-04-16 15:20:36 -0700381/* All packets are sent to the network through this function from
382 * sctp_outq_tail().
383 *
384 * The return value is a normal kernel error return value.
385 */
386int sctp_packet_transmit(struct sctp_packet *packet)
387{
388 struct sctp_transport *tp = packet->transport;
389 struct sctp_association *asoc = tp->asoc;
390 struct sctphdr *sh;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700391 struct sk_buff *nskb;
David S. Miller79af02c2005-07-08 21:47:49 -0700392 struct sctp_chunk *chunk, *tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700393 struct sock *sk;
394 int err = 0;
395 int padding; /* How much padding do we need? */
396 __u8 has_data = 0;
Sridhar Samudrala503b55f2006-06-17 22:57:28 -0700397 struct dst_entry *dst = tp->dst;
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700398 unsigned char *auth = NULL; /* pointer to auth in skb data */
399 __u32 cksum_buf_len = sizeof(struct sctphdr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700400
Daniel Borkmannbb333812013-06-28 19:49:40 +0200401 pr_debug("%s: packet:%p\n", __func__, packet);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700402
403 /* Do NOT generate a chunkless packet. */
David S. Miller79af02c2005-07-08 21:47:49 -0700404 if (list_empty(&packet->chunk_list))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700405 return err;
406
407 /* Set up convenience variables... */
David S. Miller79af02c2005-07-08 21:47:49 -0700408 chunk = list_entry(packet->chunk_list.next, struct sctp_chunk, list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700409 sk = chunk->skb->sk;
410
411 /* Allocate the new skb. */
Sridhar Samudrala594ccc12005-04-28 12:00:23 -0700412 nskb = alloc_skb(packet->size + LL_MAX_HEADER, GFP_ATOMIC);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700413 if (!nskb)
414 goto nomem;
415
416 /* Make sure the outbound skb has enough header room reserved. */
Sridhar Samudrala594ccc12005-04-28 12:00:23 -0700417 skb_reserve(nskb, packet->overhead + LL_MAX_HEADER);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700418
419 /* Set the owning socket so that we know where to get the
420 * destination IP address.
421 */
Thomas Graf4c3a5bd2012-09-03 04:27:42 +0000422 sctp_packet_set_owner_w(nskb, sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700423
Nicolas Dichtele0268862012-05-04 05:24:54 +0000424 if (!sctp_transport_dst_check(tp)) {
Sridhar Samudrala503b55f2006-06-17 22:57:28 -0700425 sctp_transport_route(tp, NULL, sctp_sk(sk));
426 if (asoc && (asoc->param_flags & SPP_PMTUD_ENABLE)) {
David S. Miller02f3d4c2012-07-16 03:57:14 -0700427 sctp_assoc_sync_pmtu(sk, asoc);
Sridhar Samudrala503b55f2006-06-17 22:57:28 -0700428 }
429 }
Eric Dumazetadf30902009-06-02 05:19:30 +0000430 dst = dst_clone(tp->dst);
431 skb_dst_set(nskb, dst);
Wei Yongjunff0ac742009-06-28 22:49:37 +0000432 if (!dst)
Sridhar Samudrala503b55f2006-06-17 22:57:28 -0700433 goto no_route;
Sridhar Samudrala503b55f2006-06-17 22:57:28 -0700434
Linus Torvalds1da177e2005-04-16 15:20:36 -0700435 /* Build the SCTP header. */
436 sh = (struct sctphdr *)skb_push(nskb, sizeof(struct sctphdr));
Jesse Brandeburg8dc92f72009-04-27 22:35:52 +0000437 skb_reset_transport_header(nskb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700438 sh->source = htons(packet->source_port);
439 sh->dest = htons(packet->destination_port);
440
441 /* From 6.8 Adler-32 Checksum Calculation:
442 * After the packet is constructed (containing the SCTP common
443 * header and one or more control or DATA chunks), the
444 * transmitter shall:
445 *
446 * 1) Fill in the proper Verification Tag in the SCTP common
447 * header and initialize the checksum field to 0's.
448 */
449 sh->vtag = htonl(packet->vtag);
450 sh->checksum = 0;
451
Linus Torvalds1da177e2005-04-16 15:20:36 -0700452 /**
453 * 6.10 Bundling
454 *
455 * An endpoint bundles chunks by simply including multiple
456 * chunks in one outbound SCTP packet. ...
457 */
458
459 /**
460 * 3.2 Chunk Field Descriptions
461 *
462 * The total length of a chunk (including Type, Length and
463 * Value fields) MUST be a multiple of 4 bytes. If the length
464 * of the chunk is not a multiple of 4 bytes, the sender MUST
465 * pad the chunk with all zero bytes and this padding is not
466 * included in the chunk length field. The sender should
467 * never pad with more than 3 bytes.
468 *
469 * [This whole comment explains WORD_ROUND() below.]
470 */
Daniel Borkmannbb333812013-06-28 19:49:40 +0200471
472 pr_debug("***sctp_transmit_packet***\n");
473
David S. Miller79af02c2005-07-08 21:47:49 -0700474 list_for_each_entry_safe(chunk, tmp, &packet->chunk_list, list) {
475 list_del_init(&chunk->list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700476 if (sctp_chunk_is_data(chunk)) {
Vlad Yasevichae19c542010-04-30 22:41:09 -0400477 /* 6.3.1 C4) When data is in flight and when allowed
478 * by rule C5, a new RTT measurement MUST be made each
479 * round trip. Furthermore, new RTT measurements
480 * SHOULD be made no more than once per round-trip
481 * for a given destination transport address.
482 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700483
Vlad Yasevichae19c542010-04-30 22:41:09 -0400484 if (!tp->rto_pending) {
485 chunk->rtt_in_progress = 1;
486 tp->rto_pending = 1;
Neil Hormand8dd1572009-11-23 15:54:00 -0500487 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700488 has_data = 1;
489 }
490
491 padding = WORD_ROUND(chunk->skb->len) - chunk->skb->len;
492 if (padding)
493 memset(skb_put(chunk->skb, padding), 0, padding);
494
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700495 /* if this is the auth chunk that we are adding,
496 * store pointer where it will be added and put
497 * the auth into the packet.
498 */
499 if (chunk == packet->auth)
500 auth = skb_tail_pointer(nskb);
501
502 cksum_buf_len += chunk->skb->len;
503 memcpy(skb_put(nskb, chunk->skb->len),
Sridhar Samudrala503b55f2006-06-17 22:57:28 -0700504 chunk->skb->data, chunk->skb->len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700505
Daniel Borkmannbb333812013-06-28 19:49:40 +0200506 pr_debug("*** Chunk:%p[%s] %s 0x%x, length:%d, chunk->skb->len:%d, "
507 "rtt_in_progress:%d\n", chunk,
508 sctp_cname(SCTP_ST_CHUNK(chunk->chunk_hdr->type)),
509 chunk->has_tsn ? "TSN" : "No TSN",
510 chunk->has_tsn ? ntohl(chunk->subh.data_hdr->tsn) : 0,
511 ntohs(chunk->chunk_hdr->length), chunk->skb->len,
512 chunk->rtt_in_progress);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700513
514 /*
515 * If this is a control chunk, this is our last
516 * reference. Free data chunks after they've been
517 * acknowledged or have failed.
518 */
519 if (!sctp_chunk_is_data(chunk))
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900520 sctp_chunk_free(chunk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700521 }
522
Vlad Yasevich4cd57c82007-09-16 19:32:45 -0700523 /* SCTP-AUTH, Section 6.2
524 * The sender MUST calculate the MAC as described in RFC2104 [2]
525 * using the hash function H as described by the MAC Identifier and
526 * the shared association key K based on the endpoint pair shared key
527 * described by the shared key identifier. The 'data' used for the
528 * computation of the AUTH-chunk is given by the AUTH chunk with its
529 * HMAC field set to zero (as shown in Figure 6) followed by all
530 * chunks that are placed after the AUTH chunk in the SCTP packet.
531 */
532 if (auth)
533 sctp_auth_calculate_hmac(asoc, nskb,
534 (struct sctp_auth_chunk *)auth,
535 GFP_ATOMIC);
536
537 /* 2) Calculate the Adler-32 checksum of the whole packet,
538 * including the SCTP common header and all the
539 * chunks.
540 *
541 * Note: Adler-32 is no longer applicable, as has been replaced
542 * by CRC32-C as described in <draft-ietf-tsvwg-sctpcsum-02.txt>.
543 */
Michał Mirosławb73c43f2011-07-13 14:10:29 +0000544 if (!sctp_checksum_disable) {
545 if (!(dst->dev->features & NETIF_F_SCTP_CSUM)) {
546 __u32 crc32 = sctp_start_cksum((__u8 *)sh, cksum_buf_len);
Vlad Yasevich4458f042009-02-13 08:33:42 +0000547
Michał Mirosławb73c43f2011-07-13 14:10:29 +0000548 /* 3) Put the resultant value into the checksum field in the
549 * common header, and leave the rest of the bits unchanged.
550 */
551 sh->checksum = sctp_end_cksum(crc32);
552 } else {
Lucas De Marchi25985ed2011-03-30 22:57:33 -0300553 /* no need to seed pseudo checksum for SCTP */
Jesse Brandeburg8dc92f72009-04-27 22:35:52 +0000554 nskb->ip_summed = CHECKSUM_PARTIAL;
555 nskb->csum_start = (skb_transport_header(nskb) -
556 nskb->head);
557 nskb->csum_offset = offsetof(struct sctphdr, checksum);
Jesse Brandeburg8dc92f72009-04-27 22:35:52 +0000558 }
559 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700560
Linus Torvalds1da177e2005-04-16 15:20:36 -0700561 /* IP layer ECN support
562 * From RFC 2481
563 * "The ECN-Capable Transport (ECT) bit would be set by the
564 * data sender to indicate that the end-points of the
565 * transport protocol are ECN-capable."
566 *
567 * Now setting the ECT bit all the time, as it should not cause
568 * any problems protocol-wise even if our peer ignores it.
569 *
570 * Note: The works for IPv6 layer checks this bit too later
571 * in transmission. See IP6_ECN_flow_xmit().
572 */
Vlad Yasevichb9031d92008-06-04 12:40:15 -0700573 (*tp->af_specific->ecn_capable)(nskb->sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700574
575 /* Set up the IP options. */
576 /* BUG: not implemented
577 * For v4 this all lives somewhere in sk->sk_opt...
578 */
579
580 /* Dump that on IP! */
Michele Baldessari196d6752012-12-01 04:49:42 +0000581 if (asoc) {
582 asoc->stats.opackets++;
583 if (asoc->peer.last_sent_to != tp)
584 /* Considering the multiple CPU scenario, this is a
585 * "correcter" place for last_sent_to. --xguo
586 */
587 asoc->peer.last_sent_to = tp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700588 }
589
590 if (has_data) {
591 struct timer_list *timer;
592 unsigned long timeout;
593
Linus Torvalds1da177e2005-04-16 15:20:36 -0700594 /* Restart the AUTOCLOSE timer when sending data. */
595 if (sctp_state(asoc, ESTABLISHED) && asoc->autoclose) {
596 timer = &asoc->timers[SCTP_EVENT_TIMEOUT_AUTOCLOSE];
597 timeout = asoc->timeouts[SCTP_EVENT_TIMEOUT_AUTOCLOSE];
598
599 if (!mod_timer(timer, jiffies + timeout))
600 sctp_association_hold(asoc);
601 }
602 }
603
Daniel Borkmannbb333812013-06-28 19:49:40 +0200604 pr_debug("***sctp_transmit_packet*** skb->len:%d\n", nskb->len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700605
Herbert Xuf8803742008-08-03 21:15:08 -0700606 nskb->local_df = packet->ipfragok;
607 (*tp->af_specific->sctp_xmit)(nskb, tp);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700608
609out:
Wei Yongjund521c082009-09-02 13:05:33 +0800610 sctp_packet_reset(packet);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700611 return err;
612no_route:
613 kfree_skb(nskb);
Eric W. Biedermanb01a2402012-08-06 08:47:55 +0000614 IP_INC_STATS_BH(sock_net(asoc->base.sk), IPSTATS_MIB_OUTNOROUTES);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700615
616 /* FIXME: Returning the 'err' will effect all the associations
617 * associated with a socket, although only one of the paths of the
618 * association is unreachable.
619 * The real failure of a transport or association can be passed on
620 * to the user via notifications. So setting this error may not be
621 * required.
622 */
623 /* err = -EHOSTUNREACH; */
624err:
625 /* Control chunks are unreliable so just drop them. DATA chunks
626 * will get resent or dropped later.
627 */
628
David S. Miller79af02c2005-07-08 21:47:49 -0700629 list_for_each_entry_safe(chunk, tmp, &packet->chunk_list, list) {
630 list_del_init(&chunk->list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700631 if (!sctp_chunk_is_data(chunk))
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900632 sctp_chunk_free(chunk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700633 }
634 goto out;
635nomem:
636 err = -ENOMEM;
637 goto err;
638}
639
640/********************************************************************
641 * 2nd Level Abstractions
642 ********************************************************************/
643
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400644/* This private function check to see if a chunk can be added */
645static sctp_xmit_t sctp_packet_can_append_data(struct sctp_packet *packet,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700646 struct sctp_chunk *chunk)
647{
648 sctp_xmit_t retval = SCTP_XMIT_OK;
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400649 size_t datasize, rwnd, inflight, flight_size;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700650 struct sctp_transport *transport = packet->transport;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700651 struct sctp_association *asoc = transport->asoc;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700652 struct sctp_outq *q = &asoc->outqueue;
653
654 /* RFC 2960 6.1 Transmission of DATA Chunks
655 *
656 * A) At any given time, the data sender MUST NOT transmit new data to
657 * any destination transport address if its peer's rwnd indicates
658 * that the peer has no buffer space (i.e. rwnd is 0, see Section
659 * 6.2.1). However, regardless of the value of rwnd (including if it
660 * is 0), the data sender can always have one DATA chunk in flight to
661 * the receiver if allowed by cwnd (see rule B below). This rule
662 * allows the sender to probe for a change in rwnd that the sender
663 * missed due to the SACK having been lost in transit from the data
664 * receiver to the data sender.
665 */
666
667 rwnd = asoc->peer.rwnd;
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400668 inflight = q->outstanding_bytes;
669 flight_size = transport->flight_size;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700670
671 datasize = sctp_data_size(chunk);
672
673 if (datasize > rwnd) {
674 if (inflight > 0) {
675 /* We have (at least) one data chunk in flight,
676 * so we can't fall back to rule 6.1 B).
677 */
678 retval = SCTP_XMIT_RWND_FULL;
679 goto finish;
680 }
681 }
682
Linus Torvalds1da177e2005-04-16 15:20:36 -0700683 /* RFC 2960 6.1 Transmission of DATA Chunks
684 *
685 * B) At any given time, the sender MUST NOT transmit new data
686 * to a given transport address if it has cwnd or more bytes
687 * of data outstanding to that transport address.
688 */
689 /* RFC 7.2.4 & the Implementers Guide 2.8.
690 *
691 * 3) ...
692 * When a Fast Retransmit is being performed the sender SHOULD
693 * ignore the value of cwnd and SHOULD NOT delay retransmission.
694 */
Neil Hormanc226ef92008-07-25 12:44:09 -0400695 if (chunk->fast_retransmit != SCTP_NEED_FRTX)
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400696 if (flight_size >= transport->cwnd) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700697 retval = SCTP_XMIT_RWND_FULL;
698 goto finish;
699 }
700
701 /* Nagle's algorithm to solve small-packet problem:
702 * Inhibit the sending of new chunks when new outgoing data arrives
703 * if any previously transmitted data on the connection remains
704 * unacknowledged.
705 */
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400706 if (!sctp_sk(asoc->base.sk)->nodelay && sctp_packet_empty(packet) &&
707 inflight && sctp_state(asoc, ESTABLISHED)) {
Eric Dumazet95c96172012-04-15 05:58:06 +0000708 unsigned int max = transport->pathmtu - packet->overhead;
709 unsigned int len = chunk->skb->len + q->out_qlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700710
711 /* Check whether this chunk and all the rest of pending
712 * data will fit or delay in hopes of bundling a full
713 * sized packet.
Vlad Yasevichcb95ea32009-09-04 18:20:59 -0400714 * Don't delay large message writes that may have been
715 * fragmeneted into small peices.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700716 */
Vlad Yasevich0e3aef82010-04-30 22:41:10 -0400717 if ((len < max) && chunk->msg->can_delay) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700718 retval = SCTP_XMIT_NAGLE_DELAY;
719 goto finish;
720 }
721 }
722
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400723finish:
724 return retval;
725}
726
727/* This private function does management things when adding DATA chunk */
728static void sctp_packet_append_data(struct sctp_packet *packet,
729 struct sctp_chunk *chunk)
730{
731 struct sctp_transport *transport = packet->transport;
732 size_t datasize = sctp_data_size(chunk);
733 struct sctp_association *asoc = transport->asoc;
734 u32 rwnd = asoc->peer.rwnd;
735
Linus Torvalds1da177e2005-04-16 15:20:36 -0700736 /* Keep track of how many bytes are in flight over this transport. */
737 transport->flight_size += datasize;
738
739 /* Keep track of how many bytes are in flight to the receiver. */
740 asoc->outqueue.outstanding_bytes += datasize;
741
Thomas Grafa76c0ad2011-12-19 04:11:40 +0000742 /* Update our view of the receiver's rwnd. */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700743 if (datasize < rwnd)
744 rwnd -= datasize;
745 else
746 rwnd = 0;
747
748 asoc->peer.rwnd = rwnd;
749 /* Has been accepted for transmission. */
750 if (!asoc->peer.prsctp_capable)
751 chunk->msg->can_abandon = 0;
Neil Hormand8dd1572009-11-23 15:54:00 -0500752 sctp_chunk_assign_tsn(chunk);
753 sctp_chunk_assign_ssn(chunk);
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400754}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700755
Vlad Yaseviche83963b2009-08-07 10:43:07 -0400756static sctp_xmit_t sctp_packet_will_fit(struct sctp_packet *packet,
757 struct sctp_chunk *chunk,
758 u16 chunk_len)
759{
760 size_t psize;
761 size_t pmtu;
762 int too_big;
763 sctp_xmit_t retval = SCTP_XMIT_OK;
764
765 psize = packet->size;
766 pmtu = ((packet->transport->asoc) ?
767 (packet->transport->asoc->pathmtu) :
768 (packet->transport->pathmtu));
769
770 too_big = (psize + chunk_len > pmtu);
771
772 /* Decide if we need to fragment or resubmit later. */
773 if (too_big) {
774 /* It's OK to fragmet at IP level if any one of the following
775 * is true:
776 * 1. The packet is empty (meaning this chunk is greater
777 * the MTU)
778 * 2. The chunk we are adding is a control chunk
779 * 3. The packet doesn't have any data in it yet and data
780 * requires authentication.
781 */
782 if (sctp_packet_empty(packet) || !sctp_chunk_is_data(chunk) ||
783 (!packet->has_data && chunk->auth)) {
784 /* We no longer do re-fragmentation.
785 * Just fragment at the IP layer, if we
786 * actually hit this condition
787 */
788 packet->ipfragok = 1;
789 } else {
790 retval = SCTP_XMIT_PMTU_FULL;
791 }
792 }
793
Linus Torvalds1da177e2005-04-16 15:20:36 -0700794 return retval;
795}