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