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.
6 * This file is part of the SCTP kernel implementation
8 * These functions handle output processing.
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)
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.
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.
27 * Please send any bug reports or fixes you make to the
29 * lksctp developers <linux-sctp@vger.kernel.org>
31 * Or submit a bug report through the following website:
32 * http://www.sf.net/projects/lksctp
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>
40 * Any bugs reported given to us we will try to fix... any fixes shared will
41 * be incorporated into the next SCTP release.
44 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
46 #include <linux/types.h>
47 #include <linux/kernel.h>
48 #include <linux/wait.h>
49 #include <linux/time.h>
51 #include <linux/ipv6.h>
52 #include <linux/init.h>
53 #include <linux/slab.h>
54 #include <net/inet_ecn.h>
57 #include <net/net_namespace.h>
59 #include <linux/socket.h> /* for sa_family_t */
62 #include <net/sctp/sctp.h>
63 #include <net/sctp/sm.h>
64 #include <net/sctp/checksum.h>
66 /* Forward declarations for private helpers. */
67 static sctp_xmit_t
__sctp_packet_append_chunk(struct sctp_packet
*packet
,
68 struct sctp_chunk
*chunk
);
69 static sctp_xmit_t
sctp_packet_can_append_data(struct sctp_packet
*packet
,
70 struct sctp_chunk
*chunk
);
71 static void sctp_packet_append_data(struct sctp_packet
*packet
,
72 struct sctp_chunk
*chunk
);
73 static sctp_xmit_t
sctp_packet_will_fit(struct sctp_packet
*packet
,
74 struct sctp_chunk
*chunk
,
77 static void sctp_packet_reset(struct sctp_packet
*packet
)
79 packet
->size
= packet
->overhead
;
80 packet
->has_cookie_echo
= 0;
89 * This appears to be a followup set of initializations.
91 struct sctp_packet
*sctp_packet_config(struct sctp_packet
*packet
,
92 __u32 vtag
, int ecn_capable
)
94 struct sctp_chunk
*chunk
= NULL
;
96 pr_debug("%s: packet:%p vtag:0x%x\n", __func__
, packet
, vtag
);
100 if (ecn_capable
&& sctp_packet_empty(packet
)) {
101 chunk
= sctp_get_ecne_prepend(packet
->transport
->asoc
);
103 /* If there a is a prepend chunk stick it on the list before
104 * any other chunks get appended.
107 sctp_packet_append_chunk(packet
, chunk
);
113 /* Initialize the packet structure. */
114 struct sctp_packet
*sctp_packet_init(struct sctp_packet
*packet
,
115 struct sctp_transport
*transport
,
116 __u16 sport
, __u16 dport
)
118 struct sctp_association
*asoc
= transport
->asoc
;
121 pr_debug("%s: packet:%p transport:%p\n", __func__
, packet
, transport
);
123 packet
->transport
= transport
;
124 packet
->source_port
= sport
;
125 packet
->destination_port
= dport
;
126 INIT_LIST_HEAD(&packet
->chunk_list
);
128 struct sctp_sock
*sp
= sctp_sk(asoc
->base
.sk
);
129 overhead
= sp
->pf
->af
->net_header_len
;
131 overhead
= sizeof(struct ipv6hdr
);
133 overhead
+= sizeof(struct sctphdr
);
134 packet
->overhead
= overhead
;
135 sctp_packet_reset(packet
);
142 void sctp_packet_free(struct sctp_packet
*packet
)
144 struct sctp_chunk
*chunk
, *tmp
;
146 pr_debug("%s: packet:%p\n", __func__
, packet
);
148 list_for_each_entry_safe(chunk
, tmp
, &packet
->chunk_list
, list
) {
149 list_del_init(&chunk
->list
);
150 sctp_chunk_free(chunk
);
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.
161 sctp_xmit_t
sctp_packet_transmit_chunk(struct sctp_packet
*packet
,
162 struct sctp_chunk
*chunk
,
168 pr_debug("%s: packet:%p chunk:%p\n", __func__
, packet
, chunk
);
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
);
175 chunk
->skb
->sk
->sk_err
= -error
;
177 /* If we have an empty packet, then we can NOT ever
181 retval
= sctp_packet_append_chunk(packet
,
186 case SCTP_XMIT_RWND_FULL
:
188 case SCTP_XMIT_NAGLE_DELAY
:
195 /* Try to bundle an auth chunk into the packet. */
196 static sctp_xmit_t
sctp_packet_bundle_auth(struct sctp_packet
*pkt
,
197 struct sctp_chunk
*chunk
)
199 struct sctp_association
*asoc
= pkt
->transport
->asoc
;
200 struct sctp_chunk
*auth
;
201 sctp_xmit_t retval
= SCTP_XMIT_OK
;
203 /* if we don't have an association, we can't do authentication */
207 /* See if this is an auth chunk we are bundling or if
208 * auth is already bundled.
210 if (chunk
->chunk_hdr
->type
== SCTP_CID_AUTH
|| pkt
->has_auth
)
213 /* if the peer did not request this chunk to be authenticated,
219 auth
= sctp_make_auth(asoc
);
223 retval
= __sctp_packet_append_chunk(pkt
, auth
);
225 if (retval
!= SCTP_XMIT_OK
)
226 sctp_chunk_free(auth
);
231 /* Try to bundle a SACK with the packet. */
232 static sctp_xmit_t
sctp_packet_bundle_sack(struct sctp_packet
*pkt
,
233 struct sctp_chunk
*chunk
)
235 sctp_xmit_t retval
= SCTP_XMIT_OK
;
237 /* If sending DATA and haven't aleady bundled a SACK, try to
238 * bundle one in to the packet.
240 if (sctp_chunk_is_data(chunk
) && !pkt
->has_sack
&&
241 !pkt
->has_cookie_echo
) {
242 struct sctp_association
*asoc
;
243 struct timer_list
*timer
;
244 asoc
= pkt
->transport
->asoc
;
245 timer
= &asoc
->timers
[SCTP_EVENT_TIMEOUT_SACK
];
247 /* If the SACK timer is running, we have a pending SACK */
248 if (timer_pending(timer
)) {
249 struct sctp_chunk
*sack
;
251 if (pkt
->transport
->sack_generation
!=
252 pkt
->transport
->asoc
->peer
.sack_generation
)
255 asoc
->a_rwnd
= asoc
->rwnd
;
256 sack
= sctp_make_sack(asoc
);
258 retval
= __sctp_packet_append_chunk(pkt
, sack
);
259 if (retval
!= SCTP_XMIT_OK
) {
260 sctp_chunk_free(sack
);
263 asoc
->peer
.sack_needed
= 0;
264 if (del_timer(timer
))
265 sctp_association_put(asoc
);
274 /* Append a chunk to the offered packet reporting back any inability to do
277 static sctp_xmit_t
__sctp_packet_append_chunk(struct sctp_packet
*packet
,
278 struct sctp_chunk
*chunk
)
280 sctp_xmit_t retval
= SCTP_XMIT_OK
;
281 __u16 chunk_len
= WORD_ROUND(ntohs(chunk
->chunk_hdr
->length
));
283 /* 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
)
288 /* We believe that this chunk is OK to add to the packet */
289 switch (chunk
->chunk_hdr
->type
) {
291 /* Account for the data being in the packet */
292 sctp_packet_append_data(packet
, chunk
);
293 /* Disallow SACK bundling after DATA. */
294 packet
->has_sack
= 1;
295 /* 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;
299 /* timestamp the chunk for rtx purposes */
300 chunk
->sent_at
= jiffies
;
302 case SCTP_CID_COOKIE_ECHO
:
303 packet
->has_cookie_echo
= 1;
307 packet
->has_sack
= 1;
309 chunk
->asoc
->stats
.osacks
++;
313 packet
->has_auth
= 1;
314 packet
->auth
= chunk
;
318 /* It is OK to send this chunk. */
319 list_add_tail(&chunk
->list
, &packet
->chunk_list
);
320 packet
->size
+= chunk_len
;
321 chunk
->transport
= packet
->transport
;
326 /* Append a chunk to the offered packet reporting back any inability to do
329 sctp_xmit_t
sctp_packet_append_chunk(struct sctp_packet
*packet
,
330 struct sctp_chunk
*chunk
)
332 sctp_xmit_t retval
= SCTP_XMIT_OK
;
334 pr_debug("%s: packet:%p chunk:%p\n", __func__
, packet
, chunk
);
336 /* Data chunks are special. Before seeing what else we can
337 * bundle into this packet, check to see if we are allowed to
340 if (sctp_chunk_is_data(chunk
)) {
341 retval
= sctp_packet_can_append_data(packet
, chunk
);
342 if (retval
!= SCTP_XMIT_OK
)
346 /* Try to bundle AUTH chunk */
347 retval
= sctp_packet_bundle_auth(packet
, chunk
);
348 if (retval
!= SCTP_XMIT_OK
)
351 /* Try to bundle SACK chunk */
352 retval
= sctp_packet_bundle_sack(packet
, chunk
);
353 if (retval
!= SCTP_XMIT_OK
)
356 retval
= __sctp_packet_append_chunk(packet
, chunk
);
362 static void sctp_packet_release_owner(struct sk_buff
*skb
)
367 static void sctp_packet_set_owner_w(struct sk_buff
*skb
, struct sock
*sk
)
371 skb
->destructor
= sctp_packet_release_owner
;
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.
378 atomic_inc(&sk
->sk_wmem_alloc
);
381 /* All packets are sent to the network through this function from
384 * The return value is a normal kernel error return value.
386 int sctp_packet_transmit(struct sctp_packet
*packet
)
388 struct sctp_transport
*tp
= packet
->transport
;
389 struct sctp_association
*asoc
= tp
->asoc
;
391 struct sk_buff
*nskb
;
392 struct sctp_chunk
*chunk
, *tmp
;
395 int padding
; /* How much padding do we need? */
397 struct dst_entry
*dst
= tp
->dst
;
399 unsigned char *auth
= NULL
; /* pointer to auth in skb data */
400 __u32 cksum_buf_len
= sizeof(struct sctphdr
);
402 pr_debug("%s: packet:%p\n", __func__
, packet
);
404 /* Do NOT generate a chunkless packet. */
405 if (list_empty(&packet
->chunk_list
))
408 /* Set up convenience variables... */
409 chunk
= list_entry(packet
->chunk_list
.next
, struct sctp_chunk
, list
);
412 /* Allocate the new skb. */
413 nskb
= alloc_skb(packet
->size
+ LL_MAX_HEADER
, GFP_ATOMIC
);
417 /* Make sure the outbound skb has enough header room reserved. */
418 skb_reserve(nskb
, packet
->overhead
+ LL_MAX_HEADER
);
420 /* Set the owning socket so that we know where to get the
421 * destination IP address.
423 sctp_packet_set_owner_w(nskb
, sk
);
425 if (!sctp_transport_dst_check(tp
)) {
426 sctp_transport_route(tp
, NULL
, sctp_sk(sk
));
427 if (asoc
&& (asoc
->param_flags
& SPP_PMTUD_ENABLE
)) {
428 sctp_assoc_sync_pmtu(sk
, asoc
);
431 dst
= dst_clone(tp
->dst
);
432 skb_dst_set(nskb
, dst
);
436 /* Build the SCTP header. */
437 sh
= (struct sctphdr
*)skb_push(nskb
, sizeof(struct sctphdr
));
438 skb_reset_transport_header(nskb
);
439 sh
->source
= htons(packet
->source_port
);
440 sh
->dest
= htons(packet
->destination_port
);
442 /* From 6.8 Adler-32 Checksum Calculation:
443 * After the packet is constructed (containing the SCTP common
444 * header and one or more control or DATA chunks), the
447 * 1) Fill in the proper Verification Tag in the SCTP common
448 * header and initialize the checksum field to 0's.
450 sh
->vtag
= htonl(packet
->vtag
);
456 * An endpoint bundles chunks by simply including multiple
457 * chunks in one outbound SCTP packet. ...
461 * 3.2 Chunk Field Descriptions
463 * The total length of a chunk (including Type, Length and
464 * Value fields) MUST be a multiple of 4 bytes. If the length
465 * of the chunk is not a multiple of 4 bytes, the sender MUST
466 * pad the chunk with all zero bytes and this padding is not
467 * included in the chunk length field. The sender should
468 * never pad with more than 3 bytes.
470 * [This whole comment explains WORD_ROUND() below.]
473 pr_debug("***sctp_transmit_packet***\n");
475 list_for_each_entry_safe(chunk
, tmp
, &packet
->chunk_list
, list
) {
476 list_del_init(&chunk
->list
);
477 if (sctp_chunk_is_data(chunk
)) {
478 /* 6.3.1 C4) When data is in flight and when allowed
479 * by rule C5, a new RTT measurement MUST be made each
480 * round trip. Furthermore, new RTT measurements
481 * SHOULD be made no more than once per round-trip
482 * for a given destination transport address.
485 if (!tp
->rto_pending
) {
486 chunk
->rtt_in_progress
= 1;
492 padding
= WORD_ROUND(chunk
->skb
->len
) - chunk
->skb
->len
;
494 memset(skb_put(chunk
->skb
, padding
), 0, padding
);
496 /* if this is the auth chunk that we are adding,
497 * store pointer where it will be added and put
498 * the auth into the packet.
500 if (chunk
== packet
->auth
)
501 auth
= skb_tail_pointer(nskb
);
503 cksum_buf_len
+= chunk
->skb
->len
;
504 memcpy(skb_put(nskb
, chunk
->skb
->len
),
505 chunk
->skb
->data
, chunk
->skb
->len
);
507 pr_debug("*** Chunk:%p[%s] %s 0x%x, length:%d, chunk->skb->len:%d, "
508 "rtt_in_progress:%d\n", chunk
,
509 sctp_cname(SCTP_ST_CHUNK(chunk
->chunk_hdr
->type
)),
510 chunk
->has_tsn
? "TSN" : "No TSN",
511 chunk
->has_tsn
? ntohl(chunk
->subh
.data_hdr
->tsn
) : 0,
512 ntohs(chunk
->chunk_hdr
->length
), chunk
->skb
->len
,
513 chunk
->rtt_in_progress
);
516 * If this is a control chunk, this is our last
517 * reference. Free data chunks after they've been
518 * acknowledged or have failed.
520 if (!sctp_chunk_is_data(chunk
))
521 sctp_chunk_free(chunk
);
524 /* SCTP-AUTH, Section 6.2
525 * The sender MUST calculate the MAC as described in RFC2104 [2]
526 * using the hash function H as described by the MAC Identifier and
527 * the shared association key K based on the endpoint pair shared key
528 * described by the shared key identifier. The 'data' used for the
529 * computation of the AUTH-chunk is given by the AUTH chunk with its
530 * HMAC field set to zero (as shown in Figure 6) followed by all
531 * chunks that are placed after the AUTH chunk in the SCTP packet.
534 sctp_auth_calculate_hmac(asoc
, nskb
,
535 (struct sctp_auth_chunk
*)auth
,
538 /* 2) Calculate the Adler-32 checksum of the whole packet,
539 * including the SCTP common header and all the
542 * Note: Adler-32 is no longer applicable, as has been replaced
543 * by CRC32-C as described in <draft-ietf-tsvwg-sctpcsum-02.txt>.
545 net
= dev_net(dst
->dev
);
547 if (!net
->sctp
.checksum_disable
) {
548 if (!(dst
->dev
->features
& NETIF_F_SCTP_CSUM
)) {
549 __u32 crc32
= sctp_start_cksum((__u8
*)sh
, cksum_buf_len
);
551 /* 3) Put the resultant value into the checksum field in the
552 * common header, and leave the rest of the bits unchanged.
554 sh
->checksum
= sctp_end_cksum(crc32
);
556 /* no need to seed pseudo checksum for SCTP */
557 nskb
->ip_summed
= CHECKSUM_PARTIAL
;
558 nskb
->csum_start
= (skb_transport_header(nskb
) -
560 nskb
->csum_offset
= offsetof(struct sctphdr
, checksum
);
564 /* IP layer ECN support
566 * "The ECN-Capable Transport (ECT) bit would be set by the
567 * data sender to indicate that the end-points of the
568 * transport protocol are ECN-capable."
570 * Now setting the ECT bit all the time, as it should not cause
571 * any problems protocol-wise even if our peer ignores it.
573 * Note: The works for IPv6 layer checks this bit too later
574 * in transmission. See IP6_ECN_flow_xmit().
576 (*tp
->af_specific
->ecn_capable
)(nskb
->sk
);
578 /* Set up the IP options. */
579 /* BUG: not implemented
580 * For v4 this all lives somewhere in sk->sk_opt...
583 /* Dump that on IP! */
585 asoc
->stats
.opackets
++;
586 if (asoc
->peer
.last_sent_to
!= tp
)
587 /* Considering the multiple CPU scenario, this is a
588 * "correcter" place for last_sent_to. --xguo
590 asoc
->peer
.last_sent_to
= tp
;
594 struct timer_list
*timer
;
595 unsigned long timeout
;
597 /* Restart the AUTOCLOSE timer when sending data. */
598 if (sctp_state(asoc
, ESTABLISHED
) && asoc
->autoclose
) {
599 timer
= &asoc
->timers
[SCTP_EVENT_TIMEOUT_AUTOCLOSE
];
600 timeout
= asoc
->timeouts
[SCTP_EVENT_TIMEOUT_AUTOCLOSE
];
602 if (!mod_timer(timer
, jiffies
+ timeout
))
603 sctp_association_hold(asoc
);
607 pr_debug("***sctp_transmit_packet*** skb->len:%d\n", nskb
->len
);
609 nskb
->local_df
= packet
->ipfragok
;
610 (*tp
->af_specific
->sctp_xmit
)(nskb
, tp
);
613 sctp_packet_reset(packet
);
617 IP_INC_STATS_BH(sock_net(asoc
->base
.sk
), IPSTATS_MIB_OUTNOROUTES
);
619 /* FIXME: Returning the 'err' will effect all the associations
620 * associated with a socket, although only one of the paths of the
621 * association is unreachable.
622 * The real failure of a transport or association can be passed on
623 * to the user via notifications. So setting this error may not be
626 /* err = -EHOSTUNREACH; */
628 /* Control chunks are unreliable so just drop them. DATA chunks
629 * will get resent or dropped later.
632 list_for_each_entry_safe(chunk
, tmp
, &packet
->chunk_list
, list
) {
633 list_del_init(&chunk
->list
);
634 if (!sctp_chunk_is_data(chunk
))
635 sctp_chunk_free(chunk
);
643 /********************************************************************
644 * 2nd Level Abstractions
645 ********************************************************************/
647 /* This private function check to see if a chunk can be added */
648 static sctp_xmit_t
sctp_packet_can_append_data(struct sctp_packet
*packet
,
649 struct sctp_chunk
*chunk
)
651 sctp_xmit_t retval
= SCTP_XMIT_OK
;
652 size_t datasize
, rwnd
, inflight
, flight_size
;
653 struct sctp_transport
*transport
= packet
->transport
;
654 struct sctp_association
*asoc
= transport
->asoc
;
655 struct sctp_outq
*q
= &asoc
->outqueue
;
657 /* RFC 2960 6.1 Transmission of DATA Chunks
659 * A) At any given time, the data sender MUST NOT transmit new data to
660 * any destination transport address if its peer's rwnd indicates
661 * that the peer has no buffer space (i.e. rwnd is 0, see Section
662 * 6.2.1). However, regardless of the value of rwnd (including if it
663 * is 0), the data sender can always have one DATA chunk in flight to
664 * the receiver if allowed by cwnd (see rule B below). This rule
665 * allows the sender to probe for a change in rwnd that the sender
666 * missed due to the SACK having been lost in transit from the data
667 * receiver to the data sender.
670 rwnd
= asoc
->peer
.rwnd
;
671 inflight
= q
->outstanding_bytes
;
672 flight_size
= transport
->flight_size
;
674 datasize
= sctp_data_size(chunk
);
676 if (datasize
> rwnd
) {
678 /* We have (at least) one data chunk in flight,
679 * so we can't fall back to rule 6.1 B).
681 retval
= SCTP_XMIT_RWND_FULL
;
686 /* RFC 2960 6.1 Transmission of DATA Chunks
688 * B) At any given time, the sender MUST NOT transmit new data
689 * to a given transport address if it has cwnd or more bytes
690 * of data outstanding to that transport address.
692 /* RFC 7.2.4 & the Implementers Guide 2.8.
695 * When a Fast Retransmit is being performed the sender SHOULD
696 * ignore the value of cwnd and SHOULD NOT delay retransmission.
698 if (chunk
->fast_retransmit
!= SCTP_NEED_FRTX
)
699 if (flight_size
>= transport
->cwnd
) {
700 retval
= SCTP_XMIT_RWND_FULL
;
704 /* Nagle's algorithm to solve small-packet problem:
705 * Inhibit the sending of new chunks when new outgoing data arrives
706 * if any previously transmitted data on the connection remains
709 if (!sctp_sk(asoc
->base
.sk
)->nodelay
&& sctp_packet_empty(packet
) &&
710 inflight
&& sctp_state(asoc
, ESTABLISHED
)) {
711 unsigned int max
= transport
->pathmtu
- packet
->overhead
;
712 unsigned int len
= chunk
->skb
->len
+ q
->out_qlen
;
714 /* Check whether this chunk and all the rest of pending
715 * data will fit or delay in hopes of bundling a full
717 * Don't delay large message writes that may have been
718 * fragmeneted into small peices.
720 if ((len
< max
) && chunk
->msg
->can_delay
) {
721 retval
= SCTP_XMIT_NAGLE_DELAY
;
730 /* This private function does management things when adding DATA chunk */
731 static void sctp_packet_append_data(struct sctp_packet
*packet
,
732 struct sctp_chunk
*chunk
)
734 struct sctp_transport
*transport
= packet
->transport
;
735 size_t datasize
= sctp_data_size(chunk
);
736 struct sctp_association
*asoc
= transport
->asoc
;
737 u32 rwnd
= asoc
->peer
.rwnd
;
739 /* Keep track of how many bytes are in flight over this transport. */
740 transport
->flight_size
+= datasize
;
742 /* Keep track of how many bytes are in flight to the receiver. */
743 asoc
->outqueue
.outstanding_bytes
+= datasize
;
745 /* Update our view of the receiver's rwnd. */
751 asoc
->peer
.rwnd
= rwnd
;
752 /* Has been accepted for transmission. */
753 if (!asoc
->peer
.prsctp_capable
)
754 chunk
->msg
->can_abandon
= 0;
755 sctp_chunk_assign_tsn(chunk
);
756 sctp_chunk_assign_ssn(chunk
);
759 static sctp_xmit_t
sctp_packet_will_fit(struct sctp_packet
*packet
,
760 struct sctp_chunk
*chunk
,
766 sctp_xmit_t retval
= SCTP_XMIT_OK
;
768 psize
= packet
->size
;
769 pmtu
= ((packet
->transport
->asoc
) ?
770 (packet
->transport
->asoc
->pathmtu
) :
771 (packet
->transport
->pathmtu
));
773 too_big
= (psize
+ chunk_len
> pmtu
);
775 /* Decide if we need to fragment or resubmit later. */
777 /* It's OK to fragmet at IP level if any one of the following
779 * 1. The packet is empty (meaning this chunk is greater
781 * 2. The chunk we are adding is a control chunk
782 * 3. The packet doesn't have any data in it yet and data
783 * requires authentication.
785 if (sctp_packet_empty(packet
) || !sctp_chunk_is_data(chunk
) ||
786 (!packet
->has_data
&& chunk
->auth
)) {
787 /* We no longer do re-fragmentation.
788 * Just fragment at the IP layer, if we
789 * actually hit this condition
791 packet
->ipfragok
= 1;
793 retval
= SCTP_XMIT_PMTU_FULL
;