VXLAN: Allow L2 redirection with L3 switching
[deliverable/linux.git] / net / sctp / output.c
CommitLineData
60c778b2 1/* SCTP kernel implementation
1da177e4
LT
2 * (C) Copyright IBM Corp. 2001, 2004
3 * Copyright (c) 1999-2000 Cisco, Inc.
4 * Copyright (c) 1999-2001 Motorola, Inc.
5 *
60c778b2 6 * This file is part of the SCTP kernel implementation
1da177e4
LT
7 *
8 * These functions handle output processing.
9 *
60c778b2 10 * This SCTP implementation is free software;
1da177e4
LT
11 * 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 *
60c778b2 16 * This SCTP implementation is distributed in the hope that it
1da177e4
LT
17 * 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
145ce502
JP
44#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
45
1da177e4
LT
46#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>
5a0e3ad6 53#include <linux/slab.h>
1da177e4 54#include <net/inet_ecn.h>
8d2f9e81 55#include <net/ip.h>
1da177e4 56#include <net/icmp.h>
7c73a6fa 57#include <net/net_namespace.h>
1da177e4 58
1da177e4
LT
59#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>
9ad0977f 64#include <net/sctp/checksum.h>
1da177e4
LT
65
66/* Forward declarations for private helpers. */
ed106277
NH
67static sctp_xmit_t __sctp_packet_append_chunk(struct sctp_packet *packet,
68 struct sctp_chunk *chunk);
e83963b7 69static sctp_xmit_t sctp_packet_can_append_data(struct sctp_packet *packet,
1da177e4 70 struct sctp_chunk *chunk);
e83963b7
VY
71static 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);
1da177e4 76
be297143
WY
77static 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
1da177e4
LT
88/* 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
0dc47877 96 SCTP_DEBUG_PRINTK("%s: packet:%p vtag:0x%x\n", __func__,
1da177e4
LT
97 packet, vtag);
98
99 packet->vtag = vtag;
1da177e4
LT
100
101 if (ecn_capable && sctp_packet_empty(packet)) {
102 chunk = sctp_get_ecne_prepend(packet->transport->asoc);
103
104 /* If there a is a prepend chunk stick it on the list before
d808ad9a
YH
105 * any other chunks get appended.
106 */
1da177e4
LT
107 if (chunk)
108 sctp_packet_append_chunk(packet, chunk);
109 }
110
111 return packet;
112}
113
114/* Initialize the packet structure. */
115struct sctp_packet *sctp_packet_init(struct sctp_packet *packet,
116 struct sctp_transport *transport,
117 __u16 sport, __u16 dport)
118{
119 struct sctp_association *asoc = transport->asoc;
120 size_t overhead;
121
0dc47877 122 SCTP_DEBUG_PRINTK("%s: packet:%p transport:%p\n", __func__,
1da177e4
LT
123 packet, transport);
124
125 packet->transport = transport;
126 packet->source_port = sport;
127 packet->destination_port = dport;
79af02c2 128 INIT_LIST_HEAD(&packet->chunk_list);
1da177e4 129 if (asoc) {
d808ad9a
YH
130 struct sctp_sock *sp = sctp_sk(asoc->base.sk);
131 overhead = sp->pf->af->net_header_len;
1da177e4
LT
132 } else {
133 overhead = sizeof(struct ipv6hdr);
134 }
135 overhead += sizeof(struct sctphdr);
136 packet->overhead = overhead;
be297143 137 sctp_packet_reset(packet);
1da177e4 138 packet->vtag = 0;
1da177e4
LT
139 packet->malloced = 0;
140 return packet;
141}
142
143/* Free a packet. */
144void sctp_packet_free(struct sctp_packet *packet)
145{
79af02c2 146 struct sctp_chunk *chunk, *tmp;
1da177e4 147
0dc47877 148 SCTP_DEBUG_PRINTK("%s: packet:%p\n", __func__, packet);
1da177e4 149
79af02c2
DM
150 list_for_each_entry_safe(chunk, tmp, &packet->chunk_list, list) {
151 list_del_init(&chunk->list);
1da177e4 152 sctp_chunk_free(chunk);
79af02c2 153 }
1da177e4
LT
154
155 if (packet->malloced)
156 kfree(packet);
157}
158
159/* This routine tries to append the chunk to the offered packet. If adding
160 * the chunk causes the packet to exceed the path MTU and COOKIE_ECHO chunk
161 * is not present in the packet, it transmits the input packet.
162 * Data can be bundled with a packet containing a COOKIE_ECHO chunk as long
163 * as it can fit in the packet, but any more data that does not fit in this
164 * packet can be sent only after receiving the COOKIE_ACK.
165 */
166sctp_xmit_t sctp_packet_transmit_chunk(struct sctp_packet *packet,
2e3216cd
VY
167 struct sctp_chunk *chunk,
168 int one_packet)
1da177e4
LT
169{
170 sctp_xmit_t retval;
171 int error = 0;
172
0dc47877 173 SCTP_DEBUG_PRINTK("%s: packet:%p chunk:%p\n", __func__,
1da177e4
LT
174 packet, chunk);
175
176 switch ((retval = (sctp_packet_append_chunk(packet, chunk)))) {
177 case SCTP_XMIT_PMTU_FULL:
178 if (!packet->has_cookie_echo) {
179 error = sctp_packet_transmit(packet);
180 if (error < 0)
181 chunk->skb->sk->sk_err = -error;
182
183 /* If we have an empty packet, then we can NOT ever
184 * return PMTU_FULL.
185 */
2e3216cd
VY
186 if (!one_packet)
187 retval = sctp_packet_append_chunk(packet,
188 chunk);
1da177e4
LT
189 }
190 break;
191
192 case SCTP_XMIT_RWND_FULL:
193 case SCTP_XMIT_OK:
194 case SCTP_XMIT_NAGLE_DELAY:
195 break;
3ff50b79 196 }
1da177e4
LT
197
198 return retval;
199}
200
4cd57c80
VY
201/* Try to bundle an auth chunk into the packet. */
202static sctp_xmit_t sctp_packet_bundle_auth(struct sctp_packet *pkt,
203 struct sctp_chunk *chunk)
204{
205 struct sctp_association *asoc = pkt->transport->asoc;
206 struct sctp_chunk *auth;
207 sctp_xmit_t retval = SCTP_XMIT_OK;
208
209 /* if we don't have an association, we can't do authentication */
210 if (!asoc)
211 return retval;
212
213 /* See if this is an auth chunk we are bundling or if
214 * auth is already bundled.
215 */
4007cc88 216 if (chunk->chunk_hdr->type == SCTP_CID_AUTH || pkt->has_auth)
4cd57c80
VY
217 return retval;
218
219 /* if the peer did not request this chunk to be authenticated,
220 * don't do it
221 */
222 if (!chunk->auth)
223 return retval;
224
225 auth = sctp_make_auth(asoc);
226 if (!auth)
227 return retval;
228
ed106277
NH
229 retval = __sctp_packet_append_chunk(pkt, auth);
230
231 if (retval != SCTP_XMIT_OK)
232 sctp_chunk_free(auth);
4cd57c80
VY
233
234 return retval;
235}
236
1da177e4
LT
237/* Try to bundle a SACK with the packet. */
238static sctp_xmit_t sctp_packet_bundle_sack(struct sctp_packet *pkt,
239 struct sctp_chunk *chunk)
240{
241 sctp_xmit_t retval = SCTP_XMIT_OK;
242
243 /* If sending DATA and haven't aleady bundled a SACK, try to
244 * bundle one in to the packet.
245 */
246 if (sctp_chunk_is_data(chunk) && !pkt->has_sack &&
247 !pkt->has_cookie_echo) {
248 struct sctp_association *asoc;
af87b823 249 struct timer_list *timer;
1da177e4 250 asoc = pkt->transport->asoc;
af87b823 251 timer = &asoc->timers[SCTP_EVENT_TIMEOUT_SACK];
1da177e4 252
af87b823
DG
253 /* If the SACK timer is running, we have a pending SACK */
254 if (timer_pending(timer)) {
1da177e4 255 struct sctp_chunk *sack;
4244854d
NH
256
257 if (pkt->transport->sack_generation !=
258 pkt->transport->asoc->peer.sack_generation)
259 return retval;
260
1da177e4
LT
261 asoc->a_rwnd = asoc->rwnd;
262 sack = sctp_make_sack(asoc);
263 if (sack) {
ed106277
NH
264 retval = __sctp_packet_append_chunk(pkt, sack);
265 if (retval != SCTP_XMIT_OK) {
266 sctp_chunk_free(sack);
267 goto out;
268 }
1da177e4 269 asoc->peer.sack_needed = 0;
af87b823 270 if (del_timer(timer))
1da177e4
LT
271 sctp_association_put(asoc);
272 }
273 }
274 }
ed106277 275out:
1da177e4
LT
276 return retval;
277}
278
ed106277 279
1da177e4
LT
280/* Append a chunk to the offered packet reporting back any inability to do
281 * so.
282 */
ed106277
NH
283static sctp_xmit_t __sctp_packet_append_chunk(struct sctp_packet *packet,
284 struct sctp_chunk *chunk)
1da177e4
LT
285{
286 sctp_xmit_t retval = SCTP_XMIT_OK;
287 __u16 chunk_len = WORD_ROUND(ntohs(chunk->chunk_hdr->length));
1da177e4 288
e83963b7
VY
289 /* Check to see if this chunk will fit into the packet */
290 retval = sctp_packet_will_fit(packet, chunk, chunk_len);
291 if (retval != SCTP_XMIT_OK)
292 goto finish;
1da177e4 293
e83963b7 294 /* We believe that this chunk is OK to add to the packet */
4cd57c80
VY
295 switch (chunk->chunk_hdr->type) {
296 case SCTP_CID_DATA:
e83963b7
VY
297 /* Account for the data being in the packet */
298 sctp_packet_append_data(packet, chunk);
1da177e4
LT
299 /* Disallow SACK bundling after DATA. */
300 packet->has_sack = 1;
4cd57c80
VY
301 /* Disallow AUTH bundling after DATA */
302 packet->has_auth = 1;
303 /* Let it be knows that packet has DATA in it */
304 packet->has_data = 1;
759af00e
VY
305 /* timestamp the chunk for rtx purposes */
306 chunk->sent_at = jiffies;
4cd57c80
VY
307 break;
308 case SCTP_CID_COOKIE_ECHO:
1da177e4 309 packet->has_cookie_echo = 1;
4cd57c80
VY
310 break;
311
312 case SCTP_CID_SACK:
1da177e4 313 packet->has_sack = 1;
196d6759
MB
314 if (chunk->asoc)
315 chunk->asoc->stats.osacks++;
4cd57c80
VY
316 break;
317
318 case SCTP_CID_AUTH:
319 packet->has_auth = 1;
320 packet->auth = chunk;
321 break;
322 }
1da177e4
LT
323
324 /* It is OK to send this chunk. */
79af02c2 325 list_add_tail(&chunk->list, &packet->chunk_list);
1da177e4
LT
326 packet->size += chunk_len;
327 chunk->transport = packet->transport;
328finish:
329 return retval;
330}
331
ed106277
NH
332/* Append a chunk to the offered packet reporting back any inability to do
333 * so.
334 */
335sctp_xmit_t sctp_packet_append_chunk(struct sctp_packet *packet,
336 struct sctp_chunk *chunk)
337{
338 sctp_xmit_t retval = SCTP_XMIT_OK;
339
340 SCTP_DEBUG_PRINTK("%s: packet:%p chunk:%p\n", __func__, packet,
341 chunk);
342
343 /* Data chunks are special. Before seeing what else we can
344 * bundle into this packet, check to see if we are allowed to
345 * send this DATA.
346 */
347 if (sctp_chunk_is_data(chunk)) {
348 retval = sctp_packet_can_append_data(packet, chunk);
349 if (retval != SCTP_XMIT_OK)
350 goto finish;
351 }
352
353 /* Try to bundle AUTH chunk */
354 retval = sctp_packet_bundle_auth(packet, chunk);
355 if (retval != SCTP_XMIT_OK)
356 goto finish;
357
358 /* Try to bundle SACK chunk */
359 retval = sctp_packet_bundle_sack(packet, chunk);
360 if (retval != SCTP_XMIT_OK)
361 goto finish;
362
363 retval = __sctp_packet_append_chunk(packet, chunk);
364
365finish:
366 return retval;
367}
368
4c3a5bda
TG
369static void sctp_packet_release_owner(struct sk_buff *skb)
370{
371 sk_free(skb->sk);
372}
373
374static void sctp_packet_set_owner_w(struct sk_buff *skb, struct sock *sk)
375{
376 skb_orphan(skb);
377 skb->sk = sk;
378 skb->destructor = sctp_packet_release_owner;
379
380 /*
381 * The data chunks have already been accounted for in sctp_sendmsg(),
382 * therefore only reserve a single byte to keep socket around until
383 * the packet has been transmitted.
384 */
385 atomic_inc(&sk->sk_wmem_alloc);
386}
387
1da177e4
LT
388/* All packets are sent to the network through this function from
389 * sctp_outq_tail().
390 *
391 * The return value is a normal kernel error return value.
392 */
393int sctp_packet_transmit(struct sctp_packet *packet)
394{
395 struct sctp_transport *tp = packet->transport;
396 struct sctp_association *asoc = tp->asoc;
397 struct sctphdr *sh;
1da177e4 398 struct sk_buff *nskb;
79af02c2 399 struct sctp_chunk *chunk, *tmp;
1da177e4
LT
400 struct sock *sk;
401 int err = 0;
402 int padding; /* How much padding do we need? */
403 __u8 has_data = 0;
503b55fd 404 struct dst_entry *dst = tp->dst;
4cd57c80
VY
405 unsigned char *auth = NULL; /* pointer to auth in skb data */
406 __u32 cksum_buf_len = sizeof(struct sctphdr);
1da177e4 407
0dc47877 408 SCTP_DEBUG_PRINTK("%s: packet:%p\n", __func__, packet);
1da177e4
LT
409
410 /* Do NOT generate a chunkless packet. */
79af02c2 411 if (list_empty(&packet->chunk_list))
1da177e4
LT
412 return err;
413
414 /* Set up convenience variables... */
79af02c2 415 chunk = list_entry(packet->chunk_list.next, struct sctp_chunk, list);
1da177e4
LT
416 sk = chunk->skb->sk;
417
418 /* Allocate the new skb. */
594ccc14 419 nskb = alloc_skb(packet->size + LL_MAX_HEADER, GFP_ATOMIC);
1da177e4
LT
420 if (!nskb)
421 goto nomem;
422
423 /* Make sure the outbound skb has enough header room reserved. */
594ccc14 424 skb_reserve(nskb, packet->overhead + LL_MAX_HEADER);
1da177e4
LT
425
426 /* Set the owning socket so that we know where to get the
427 * destination IP address.
428 */
4c3a5bda 429 sctp_packet_set_owner_w(nskb, sk);
1da177e4 430
e0268868 431 if (!sctp_transport_dst_check(tp)) {
503b55fd
SS
432 sctp_transport_route(tp, NULL, sctp_sk(sk));
433 if (asoc && (asoc->param_flags & SPP_PMTUD_ENABLE)) {
02f3d4ce 434 sctp_assoc_sync_pmtu(sk, asoc);
503b55fd
SS
435 }
436 }
adf30907
ED
437 dst = dst_clone(tp->dst);
438 skb_dst_set(nskb, dst);
ff0ac74a 439 if (!dst)
503b55fd 440 goto no_route;
503b55fd 441
1da177e4
LT
442 /* Build the SCTP header. */
443 sh = (struct sctphdr *)skb_push(nskb, sizeof(struct sctphdr));
8dc92f7e 444 skb_reset_transport_header(nskb);
1da177e4
LT
445 sh->source = htons(packet->source_port);
446 sh->dest = htons(packet->destination_port);
447
448 /* From 6.8 Adler-32 Checksum Calculation:
449 * After the packet is constructed (containing the SCTP common
450 * header and one or more control or DATA chunks), the
451 * transmitter shall:
452 *
453 * 1) Fill in the proper Verification Tag in the SCTP common
454 * header and initialize the checksum field to 0's.
455 */
456 sh->vtag = htonl(packet->vtag);
457 sh->checksum = 0;
458
1da177e4
LT
459 /**
460 * 6.10 Bundling
461 *
462 * An endpoint bundles chunks by simply including multiple
463 * chunks in one outbound SCTP packet. ...
464 */
465
466 /**
467 * 3.2 Chunk Field Descriptions
468 *
469 * The total length of a chunk (including Type, Length and
470 * Value fields) MUST be a multiple of 4 bytes. If the length
471 * of the chunk is not a multiple of 4 bytes, the sender MUST
472 * pad the chunk with all zero bytes and this padding is not
473 * included in the chunk length field. The sender should
474 * never pad with more than 3 bytes.
475 *
476 * [This whole comment explains WORD_ROUND() below.]
477 */
478 SCTP_DEBUG_PRINTK("***sctp_transmit_packet***\n");
79af02c2
DM
479 list_for_each_entry_safe(chunk, tmp, &packet->chunk_list, list) {
480 list_del_init(&chunk->list);
1da177e4 481 if (sctp_chunk_is_data(chunk)) {
ae19c548
VY
482 /* 6.3.1 C4) When data is in flight and when allowed
483 * by rule C5, a new RTT measurement MUST be made each
484 * round trip. Furthermore, new RTT measurements
485 * SHOULD be made no more than once per round-trip
486 * for a given destination transport address.
487 */
1da177e4 488
ae19c548
VY
489 if (!tp->rto_pending) {
490 chunk->rtt_in_progress = 1;
491 tp->rto_pending = 1;
d8dd1578 492 }
1da177e4
LT
493 has_data = 1;
494 }
495
496 padding = WORD_ROUND(chunk->skb->len) - chunk->skb->len;
497 if (padding)
498 memset(skb_put(chunk->skb, padding), 0, padding);
499
4cd57c80
VY
500 /* if this is the auth chunk that we are adding,
501 * store pointer where it will be added and put
502 * the auth into the packet.
503 */
504 if (chunk == packet->auth)
505 auth = skb_tail_pointer(nskb);
506
507 cksum_buf_len += chunk->skb->len;
508 memcpy(skb_put(nskb, chunk->skb->len),
503b55fd 509 chunk->skb->data, chunk->skb->len);
1da177e4
LT
510
511 SCTP_DEBUG_PRINTK("%s %p[%s] %s 0x%x, %s %d, %s %d, %s %d\n",
512 "*** Chunk", chunk,
513 sctp_cname(SCTP_ST_CHUNK(
514 chunk->chunk_hdr->type)),
515 chunk->has_tsn ? "TSN" : "No TSN",
516 chunk->has_tsn ?
517 ntohl(chunk->subh.data_hdr->tsn) : 0,
518 "length", ntohs(chunk->chunk_hdr->length),
519 "chunk->skb->len", chunk->skb->len,
520 "rtt_in_progress", chunk->rtt_in_progress);
521
522 /*
523 * If this is a control chunk, this is our last
524 * reference. Free data chunks after they've been
525 * acknowledged or have failed.
526 */
527 if (!sctp_chunk_is_data(chunk))
d808ad9a 528 sctp_chunk_free(chunk);
1da177e4
LT
529 }
530
4cd57c80
VY
531 /* SCTP-AUTH, Section 6.2
532 * The sender MUST calculate the MAC as described in RFC2104 [2]
533 * using the hash function H as described by the MAC Identifier and
534 * the shared association key K based on the endpoint pair shared key
535 * described by the shared key identifier. The 'data' used for the
536 * computation of the AUTH-chunk is given by the AUTH chunk with its
537 * HMAC field set to zero (as shown in Figure 6) followed by all
538 * chunks that are placed after the AUTH chunk in the SCTP packet.
539 */
540 if (auth)
541 sctp_auth_calculate_hmac(asoc, nskb,
542 (struct sctp_auth_chunk *)auth,
543 GFP_ATOMIC);
544
545 /* 2) Calculate the Adler-32 checksum of the whole packet,
546 * including the SCTP common header and all the
547 * chunks.
548 *
549 * Note: Adler-32 is no longer applicable, as has been replaced
550 * by CRC32-C as described in <draft-ietf-tsvwg-sctpcsum-02.txt>.
551 */
b73c43f8
MM
552 if (!sctp_checksum_disable) {
553 if (!(dst->dev->features & NETIF_F_SCTP_CSUM)) {
554 __u32 crc32 = sctp_start_cksum((__u8 *)sh, cksum_buf_len);
4458f04c 555
b73c43f8
MM
556 /* 3) Put the resultant value into the checksum field in the
557 * common header, and leave the rest of the bits unchanged.
558 */
559 sh->checksum = sctp_end_cksum(crc32);
560 } else {
25985edc 561 /* no need to seed pseudo checksum for SCTP */
8dc92f7e
JB
562 nskb->ip_summed = CHECKSUM_PARTIAL;
563 nskb->csum_start = (skb_transport_header(nskb) -
564 nskb->head);
565 nskb->csum_offset = offsetof(struct sctphdr, checksum);
8dc92f7e
JB
566 }
567 }
1da177e4 568
1da177e4
LT
569 /* IP layer ECN support
570 * From RFC 2481
571 * "The ECN-Capable Transport (ECT) bit would be set by the
572 * data sender to indicate that the end-points of the
573 * transport protocol are ECN-capable."
574 *
575 * Now setting the ECT bit all the time, as it should not cause
576 * any problems protocol-wise even if our peer ignores it.
577 *
578 * Note: The works for IPv6 layer checks this bit too later
579 * in transmission. See IP6_ECN_flow_xmit().
580 */
b9031d9d 581 (*tp->af_specific->ecn_capable)(nskb->sk);
1da177e4
LT
582
583 /* Set up the IP options. */
584 /* BUG: not implemented
585 * For v4 this all lives somewhere in sk->sk_opt...
586 */
587
588 /* Dump that on IP! */
196d6759
MB
589 if (asoc) {
590 asoc->stats.opackets++;
591 if (asoc->peer.last_sent_to != tp)
592 /* Considering the multiple CPU scenario, this is a
593 * "correcter" place for last_sent_to. --xguo
594 */
595 asoc->peer.last_sent_to = tp;
1da177e4
LT
596 }
597
598 if (has_data) {
599 struct timer_list *timer;
600 unsigned long timeout;
601
1da177e4
LT
602 /* Restart the AUTOCLOSE timer when sending data. */
603 if (sctp_state(asoc, ESTABLISHED) && asoc->autoclose) {
604 timer = &asoc->timers[SCTP_EVENT_TIMEOUT_AUTOCLOSE];
605 timeout = asoc->timeouts[SCTP_EVENT_TIMEOUT_AUTOCLOSE];
606
607 if (!mod_timer(timer, jiffies + timeout))
608 sctp_association_hold(asoc);
609 }
610 }
611
1da177e4
LT
612 SCTP_DEBUG_PRINTK("***sctp_transmit_packet*** skb len %d\n",
613 nskb->len);
614
f880374c
HX
615 nskb->local_df = packet->ipfragok;
616 (*tp->af_specific->sctp_xmit)(nskb, tp);
1da177e4
LT
617
618out:
d521c08f 619 sctp_packet_reset(packet);
1da177e4
LT
620 return err;
621no_route:
622 kfree_skb(nskb);
b01a2407 623 IP_INC_STATS_BH(sock_net(asoc->base.sk), IPSTATS_MIB_OUTNOROUTES);
1da177e4
LT
624
625 /* FIXME: Returning the 'err' will effect all the associations
626 * associated with a socket, although only one of the paths of the
627 * association is unreachable.
628 * The real failure of a transport or association can be passed on
629 * to the user via notifications. So setting this error may not be
630 * required.
631 */
632 /* err = -EHOSTUNREACH; */
633err:
634 /* Control chunks are unreliable so just drop them. DATA chunks
635 * will get resent or dropped later.
636 */
637
79af02c2
DM
638 list_for_each_entry_safe(chunk, tmp, &packet->chunk_list, list) {
639 list_del_init(&chunk->list);
1da177e4 640 if (!sctp_chunk_is_data(chunk))
d808ad9a 641 sctp_chunk_free(chunk);
1da177e4
LT
642 }
643 goto out;
644nomem:
645 err = -ENOMEM;
646 goto err;
647}
648
649/********************************************************************
650 * 2nd Level Abstractions
651 ********************************************************************/
652
e83963b7
VY
653/* This private function check to see if a chunk can be added */
654static sctp_xmit_t sctp_packet_can_append_data(struct sctp_packet *packet,
1da177e4
LT
655 struct sctp_chunk *chunk)
656{
657 sctp_xmit_t retval = SCTP_XMIT_OK;
e83963b7 658 size_t datasize, rwnd, inflight, flight_size;
1da177e4 659 struct sctp_transport *transport = packet->transport;
1da177e4 660 struct sctp_association *asoc = transport->asoc;
1da177e4
LT
661 struct sctp_outq *q = &asoc->outqueue;
662
663 /* RFC 2960 6.1 Transmission of DATA Chunks
664 *
665 * A) At any given time, the data sender MUST NOT transmit new data to
666 * any destination transport address if its peer's rwnd indicates
667 * that the peer has no buffer space (i.e. rwnd is 0, see Section
668 * 6.2.1). However, regardless of the value of rwnd (including if it
669 * is 0), the data sender can always have one DATA chunk in flight to
670 * the receiver if allowed by cwnd (see rule B below). This rule
671 * allows the sender to probe for a change in rwnd that the sender
672 * missed due to the SACK having been lost in transit from the data
673 * receiver to the data sender.
674 */
675
676 rwnd = asoc->peer.rwnd;
e83963b7
VY
677 inflight = q->outstanding_bytes;
678 flight_size = transport->flight_size;
1da177e4
LT
679
680 datasize = sctp_data_size(chunk);
681
682 if (datasize > rwnd) {
683 if (inflight > 0) {
684 /* We have (at least) one data chunk in flight,
685 * so we can't fall back to rule 6.1 B).
686 */
687 retval = SCTP_XMIT_RWND_FULL;
688 goto finish;
689 }
690 }
691
1da177e4
LT
692 /* RFC 2960 6.1 Transmission of DATA Chunks
693 *
694 * B) At any given time, the sender MUST NOT transmit new data
695 * to a given transport address if it has cwnd or more bytes
696 * of data outstanding to that transport address.
697 */
698 /* RFC 7.2.4 & the Implementers Guide 2.8.
699 *
700 * 3) ...
701 * When a Fast Retransmit is being performed the sender SHOULD
702 * ignore the value of cwnd and SHOULD NOT delay retransmission.
703 */
c226ef9b 704 if (chunk->fast_retransmit != SCTP_NEED_FRTX)
e83963b7 705 if (flight_size >= transport->cwnd) {
1da177e4
LT
706 retval = SCTP_XMIT_RWND_FULL;
707 goto finish;
708 }
709
710 /* Nagle's algorithm to solve small-packet problem:
711 * Inhibit the sending of new chunks when new outgoing data arrives
712 * if any previously transmitted data on the connection remains
713 * unacknowledged.
714 */
e83963b7
VY
715 if (!sctp_sk(asoc->base.sk)->nodelay && sctp_packet_empty(packet) &&
716 inflight && sctp_state(asoc, ESTABLISHED)) {
95c96174
ED
717 unsigned int max = transport->pathmtu - packet->overhead;
718 unsigned int len = chunk->skb->len + q->out_qlen;
1da177e4
LT
719
720 /* Check whether this chunk and all the rest of pending
721 * data will fit or delay in hopes of bundling a full
722 * sized packet.
cb95ea32
VY
723 * Don't delay large message writes that may have been
724 * fragmeneted into small peices.
1da177e4 725 */
0e3aef8d 726 if ((len < max) && chunk->msg->can_delay) {
1da177e4
LT
727 retval = SCTP_XMIT_NAGLE_DELAY;
728 goto finish;
729 }
730 }
731
e83963b7
VY
732finish:
733 return retval;
734}
735
736/* This private function does management things when adding DATA chunk */
737static void sctp_packet_append_data(struct sctp_packet *packet,
738 struct sctp_chunk *chunk)
739{
740 struct sctp_transport *transport = packet->transport;
741 size_t datasize = sctp_data_size(chunk);
742 struct sctp_association *asoc = transport->asoc;
743 u32 rwnd = asoc->peer.rwnd;
744
1da177e4
LT
745 /* Keep track of how many bytes are in flight over this transport. */
746 transport->flight_size += datasize;
747
748 /* Keep track of how many bytes are in flight to the receiver. */
749 asoc->outqueue.outstanding_bytes += datasize;
750
a76c0adf 751 /* Update our view of the receiver's rwnd. */
1da177e4
LT
752 if (datasize < rwnd)
753 rwnd -= datasize;
754 else
755 rwnd = 0;
756
757 asoc->peer.rwnd = rwnd;
758 /* Has been accepted for transmission. */
759 if (!asoc->peer.prsctp_capable)
760 chunk->msg->can_abandon = 0;
d8dd1578
NH
761 sctp_chunk_assign_tsn(chunk);
762 sctp_chunk_assign_ssn(chunk);
e83963b7
VY
763}
764
765static sctp_xmit_t sctp_packet_will_fit(struct sctp_packet *packet,
766 struct sctp_chunk *chunk,
767 u16 chunk_len)
768{
769 size_t psize;
770 size_t pmtu;
771 int too_big;
772 sctp_xmit_t retval = SCTP_XMIT_OK;
773
774 psize = packet->size;
775 pmtu = ((packet->transport->asoc) ?
776 (packet->transport->asoc->pathmtu) :
777 (packet->transport->pathmtu));
778
779 too_big = (psize + chunk_len > pmtu);
780
781 /* Decide if we need to fragment or resubmit later. */
782 if (too_big) {
783 /* It's OK to fragmet at IP level if any one of the following
784 * is true:
785 * 1. The packet is empty (meaning this chunk is greater
786 * the MTU)
787 * 2. The chunk we are adding is a control chunk
788 * 3. The packet doesn't have any data in it yet and data
789 * requires authentication.
790 */
791 if (sctp_packet_empty(packet) || !sctp_chunk_is_data(chunk) ||
792 (!packet->has_data && chunk->auth)) {
793 /* We no longer do re-fragmentation.
794 * Just fragment at the IP layer, if we
795 * actually hit this condition
796 */
797 packet->ipfragok = 1;
798 } else {
799 retval = SCTP_XMIT_PMTU_FULL;
800 }
801 }
1da177e4 802
1da177e4
LT
803 return retval;
804}
This page took 0.700874 seconds and 5 git commands to generate.