1 /* SCTP kernel implementation
2 * (C) Copyright IBM Corp. 2003, 2004
4 * This file is part of the SCTP kernel implementation
6 * This file contains the code relating the chunk abstraction.
8 * This SCTP implementation is free software;
9 * you can redistribute it and/or modify it under the terms of
10 * the GNU General Public License as published by
11 * the Free Software Foundation; either version 2, or (at your option)
14 * This SCTP implementation is distributed in the hope that it
15 * will be useful, but WITHOUT ANY WARRANTY; without even the implied
16 * ************************
17 * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
18 * See the GNU General Public License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with GNU CC; see the file COPYING. If not, see
22 * <http://www.gnu.org/licenses/>.
24 * Please send any bug reports or fixes you make to the
26 * lksctp developers <linux-sctp@vger.kernel.org>
28 * Written or modified by:
29 * Jon Grimm <jgrimm@us.ibm.com>
30 * Sridhar Samudrala <sri@us.ibm.com>
33 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
35 #include <linux/types.h>
36 #include <linux/kernel.h>
37 #include <linux/net.h>
38 #include <linux/inet.h>
39 #include <linux/skbuff.h>
40 #include <linux/slab.h>
42 #include <net/sctp/sctp.h>
43 #include <net/sctp/sm.h>
45 /* This file is mostly in anticipation of future work, but initially
46 * populate with fragment tracking for an outbound message.
49 /* Initialize datamsg from memory. */
50 static void sctp_datamsg_init(struct sctp_datamsg
*msg
)
52 refcount_set(&msg
->refcnt
, 1);
58 INIT_LIST_HEAD(&msg
->chunks
);
61 /* Allocate and initialize datamsg. */
62 static struct sctp_datamsg
*sctp_datamsg_new(gfp_t gfp
)
64 struct sctp_datamsg
*msg
;
65 msg
= kmalloc(sizeof(struct sctp_datamsg
), gfp
);
67 sctp_datamsg_init(msg
);
68 SCTP_DBG_OBJCNT_INC(datamsg
);
73 void sctp_datamsg_free(struct sctp_datamsg
*msg
)
75 struct sctp_chunk
*chunk
;
77 /* This doesn't have to be a _safe vairant because
78 * sctp_chunk_free() only drops the refs.
80 list_for_each_entry(chunk
, &msg
->chunks
, frag_list
)
81 sctp_chunk_free(chunk
);
83 sctp_datamsg_put(msg
);
86 /* Final destructruction of datamsg memory. */
87 static void sctp_datamsg_destroy(struct sctp_datamsg
*msg
)
89 struct list_head
*pos
, *temp
;
90 struct sctp_chunk
*chunk
;
92 struct sctp_ulpevent
*ev
;
93 struct sctp_association
*asoc
= NULL
;
94 int error
= 0, notify
;
96 /* If we failed, we may need to notify. */
97 notify
= msg
->send_failed
? -1 : 0;
99 /* Release all references. */
100 list_for_each_safe(pos
, temp
, &msg
->chunks
) {
102 chunk
= list_entry(pos
, struct sctp_chunk
, frag_list
);
103 /* Check whether we _really_ need to notify. */
107 error
= msg
->send_error
;
109 error
= asoc
->outqueue
.error
;
111 sp
= sctp_sk(asoc
->base
.sk
);
112 notify
= sctp_ulpevent_type_enabled(SCTP_SEND_FAILED
,
116 /* Generate a SEND FAILED event only if enabled. */
120 sent
= SCTP_DATA_SENT
;
122 sent
= SCTP_DATA_UNSENT
;
124 ev
= sctp_ulpevent_make_send_failed(asoc
, chunk
, sent
,
127 asoc
->stream
.si
->enqueue_event(&asoc
->ulpq
, ev
);
130 sctp_chunk_put(chunk
);
133 SCTP_DBG_OBJCNT_DEC(datamsg
);
137 /* Hold a reference. */
138 static void sctp_datamsg_hold(struct sctp_datamsg
*msg
)
140 refcount_inc(&msg
->refcnt
);
143 /* Release a reference. */
144 void sctp_datamsg_put(struct sctp_datamsg
*msg
)
146 if (refcount_dec_and_test(&msg
->refcnt
))
147 sctp_datamsg_destroy(msg
);
150 /* Assign a chunk to this datamsg. */
151 static void sctp_datamsg_assign(struct sctp_datamsg
*msg
, struct sctp_chunk
*chunk
)
153 sctp_datamsg_hold(msg
);
158 /* A data chunk can have a maximum payload of (2^16 - 20). Break
159 * down any such message into smaller chunks. Opportunistically, fragment
160 * the chunks down to the current MTU constraints. We may get refragmented
161 * later if the PMTU changes, but it is _much better_ to fragment immediately
162 * with a reasonable guess than always doing our fragmentation on the
165 struct sctp_datamsg
*sctp_datamsg_from_user(struct sctp_association
*asoc
,
166 struct sctp_sndrcvinfo
*sinfo
,
167 struct iov_iter
*from
)
169 size_t len
, first_len
, max_data
, remaining
;
170 size_t msg_len
= iov_iter_count(from
);
171 struct sctp_shared_key
*shkey
= NULL
;
172 struct list_head
*pos
, *temp
;
173 struct sctp_chunk
*chunk
;
174 struct sctp_datamsg
*msg
;
177 msg
= sctp_datamsg_new(GFP_KERNEL
);
179 return ERR_PTR(-ENOMEM
);
181 /* Note: Calculate this outside of the loop, so that all fragments
182 * have the same expiration.
184 if (asoc
->peer
.prsctp_capable
&& sinfo
->sinfo_timetolive
&&
185 (SCTP_PR_TTL_ENABLED(sinfo
->sinfo_flags
) ||
186 !SCTP_PR_POLICY(sinfo
->sinfo_flags
)))
187 msg
->expires_at
= jiffies
+
188 msecs_to_jiffies(sinfo
->sinfo_timetolive
);
190 /* This is the biggest possible DATA chunk that can fit into
193 max_data
= asoc
->frag_point
;
194 if (unlikely(!max_data
)) {
195 max_data
= sctp_min_frag_point(sctp_sk(asoc
->base
.sk
),
196 sctp_datachk_len(&asoc
->stream
));
197 pr_warn_ratelimited("%s: asoc:%p frag_point is zero, forcing max_data to default minimum (%Zu)",
198 __func__
, asoc
, max_data
);
201 /* If the the peer requested that we authenticate DATA chunks
202 * we need to account for bundling of the AUTH chunks along with
205 if (sctp_auth_send_cid(SCTP_CID_DATA
, asoc
)) {
206 struct sctp_hmac
*hmac_desc
= sctp_auth_asoc_get_hmac(asoc
);
209 max_data
-= SCTP_PAD4(sizeof(struct sctp_auth_chunk
) +
210 hmac_desc
->hmac_len
);
212 if (sinfo
->sinfo_tsn
&&
213 sinfo
->sinfo_ssn
!= asoc
->active_key_id
) {
214 shkey
= sctp_auth_get_shkey(asoc
, sinfo
->sinfo_ssn
);
224 /* Set first_len and then account for possible bundles on first frag */
225 first_len
= max_data
;
227 /* Check to see if we have a pending SACK and try to let it be bundled
228 * with this message. Do this if we don't have any data queued already.
229 * To check that, look at out_qlen and retransmit list.
230 * NOTE: we will not reduce to account for SACK, if the message would
231 * not have been fragmented.
233 if (timer_pending(&asoc
->timers
[SCTP_EVENT_TIMEOUT_SACK
]) &&
234 asoc
->outqueue
.out_qlen
== 0 &&
235 list_empty(&asoc
->outqueue
.retransmit
) &&
237 first_len
-= SCTP_PAD4(sizeof(struct sctp_sack_chunk
));
239 /* Encourage Cookie-ECHO bundling. */
240 if (asoc
->state
< SCTP_STATE_COOKIE_ECHOED
)
241 first_len
-= SCTP_ARBITRARY_COOKIE_ECHO_LEN
;
243 /* Account for a different sized first fragment */
244 if (msg_len
>= first_len
) {
246 if (msg_len
> first_len
)
247 SCTP_INC_STATS(sock_net(asoc
->base
.sk
),
248 SCTP_MIB_FRAGUSRMSGS
);
250 /* Which may be the only one... */
254 /* Create chunks for all DATA chunks. */
255 for (remaining
= msg_len
; remaining
; remaining
-= len
) {
256 u8 frag
= SCTP_DATA_MIDDLE_FRAG
;
258 if (remaining
== msg_len
) {
259 /* First frag, which may also be the last */
260 frag
|= SCTP_DATA_FIRST_FRAG
;
267 if (len
>= remaining
) {
268 /* Last frag, which may also be the first */
270 frag
|= SCTP_DATA_LAST_FRAG
;
272 /* The application requests to set the I-bit of the
273 * last DATA chunk of a user message when providing
274 * the user message to the SCTP implementation.
276 if ((sinfo
->sinfo_flags
& SCTP_EOF
) ||
277 (sinfo
->sinfo_flags
& SCTP_SACK_IMMEDIATELY
))
278 frag
|= SCTP_DATA_SACK_IMM
;
281 chunk
= asoc
->stream
.si
->make_datafrag(asoc
, sinfo
, len
, frag
,
288 err
= sctp_user_addto_chunk(chunk
, len
, from
);
290 goto errout_chunk_free
;
292 chunk
->shkey
= shkey
;
294 /* Put the chunk->skb back into the form expected by send. */
295 __skb_pull(chunk
->skb
, (__u8
*)chunk
->chunk_hdr
-
298 sctp_datamsg_assign(msg
, chunk
);
299 list_add_tail(&chunk
->frag_list
, &msg
->chunks
);
305 sctp_chunk_free(chunk
);
308 list_for_each_safe(pos
, temp
, &msg
->chunks
) {
310 chunk
= list_entry(pos
, struct sctp_chunk
, frag_list
);
311 sctp_chunk_free(chunk
);
313 sctp_datamsg_put(msg
);
318 /* Check whether this message has expired. */
319 int sctp_chunk_abandoned(struct sctp_chunk
*chunk
)
321 if (!chunk
->asoc
->peer
.prsctp_capable
)
324 if (chunk
->msg
->abandoned
)
327 if (!chunk
->has_tsn
&&
328 !(chunk
->chunk_hdr
->flags
& SCTP_DATA_FIRST_FRAG
))
331 if (SCTP_PR_TTL_ENABLED(chunk
->sinfo
.sinfo_flags
) &&
332 time_after(jiffies
, chunk
->msg
->expires_at
)) {
333 struct sctp_stream_out
*streamout
=
334 SCTP_SO(&chunk
->asoc
->stream
,
335 chunk
->sinfo
.sinfo_stream
);
337 if (chunk
->sent_count
) {
338 chunk
->asoc
->abandoned_sent
[SCTP_PR_INDEX(TTL
)]++;
339 streamout
->ext
->abandoned_sent
[SCTP_PR_INDEX(TTL
)]++;
341 chunk
->asoc
->abandoned_unsent
[SCTP_PR_INDEX(TTL
)]++;
342 streamout
->ext
->abandoned_unsent
[SCTP_PR_INDEX(TTL
)]++;
344 chunk
->msg
->abandoned
= 1;
346 } else if (SCTP_PR_RTX_ENABLED(chunk
->sinfo
.sinfo_flags
) &&
347 chunk
->sent_count
> chunk
->sinfo
.sinfo_timetolive
) {
348 struct sctp_stream_out
*streamout
=
349 SCTP_SO(&chunk
->asoc
->stream
,
350 chunk
->sinfo
.sinfo_stream
);
352 chunk
->asoc
->abandoned_sent
[SCTP_PR_INDEX(RTX
)]++;
353 streamout
->ext
->abandoned_sent
[SCTP_PR_INDEX(RTX
)]++;
354 chunk
->msg
->abandoned
= 1;
356 } else if (!SCTP_PR_POLICY(chunk
->sinfo
.sinfo_flags
) &&
357 chunk
->msg
->expires_at
&&
358 time_after(jiffies
, chunk
->msg
->expires_at
)) {
359 chunk
->msg
->abandoned
= 1;
362 /* PRIO policy is processed by sendmsg, not here */
367 /* This chunk (and consequently entire message) has failed in its sending. */
368 void sctp_chunk_fail(struct sctp_chunk
*chunk
, int error
)
370 chunk
->msg
->send_failed
= 1;
371 chunk
->msg
->send_error
= error
;