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 atomic_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 sctp_ulpq_tail_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 atomic_inc(&msg
->refcnt
);
143 /* Release a reference. */
144 void sctp_datamsg_put(struct sctp_datamsg
*msg
)
146 if (atomic_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 int max
, whole
, i
, offset
, over
, err
;
172 struct sctp_chunk
*chunk
;
173 struct sctp_datamsg
*msg
;
174 struct list_head
*pos
, *temp
;
175 size_t msg_len
= iov_iter_count(from
);
178 msg
= sctp_datamsg_new(GFP_KERNEL
);
180 return ERR_PTR(-ENOMEM
);
182 /* Note: Calculate this outside of the loop, so that all fragments
183 * have the same expiration.
185 if (sinfo
->sinfo_timetolive
) {
186 /* sinfo_timetolive is in milliseconds */
187 msg
->expires_at
= jiffies
+
188 msecs_to_jiffies(sinfo
->sinfo_timetolive
);
189 msg
->can_abandon
= 1;
191 pr_debug("%s: msg:%p expires_at:%ld jiffies:%ld\n", __func__
,
192 msg
, msg
->expires_at
, jiffies
);
195 if (asoc
->peer
.prsctp_capable
&&
196 SCTP_PR_TTL_ENABLED(sinfo
->sinfo_flags
))
198 jiffies
+ msecs_to_jiffies(sinfo
->sinfo_timetolive
);
200 /* This is the biggest possible DATA chunk that can fit into
203 max_data
= asoc
->pathmtu
-
204 sctp_sk(asoc
->base
.sk
)->pf
->af
->net_header_len
-
205 sizeof(struct sctphdr
) - sizeof(struct sctp_data_chunk
);
206 max_data
= SCTP_TRUNC4(max_data
);
208 max
= asoc
->frag_point
;
209 /* If the the peer requested that we authenticate DATA chunks
210 * we need to account for bundling of the AUTH chunks along with
213 if (sctp_auth_send_cid(SCTP_CID_DATA
, asoc
)) {
214 struct sctp_hmac
*hmac_desc
= sctp_auth_asoc_get_hmac(asoc
);
217 max_data
-= SCTP_PAD4(sizeof(sctp_auth_chunk_t
) +
218 hmac_desc
->hmac_len
);
221 /* Now, check if we need to reduce our max */
228 /* Check to see if we have a pending SACK and try to let it be bundled
229 * with this message. Do this if we don't have any data queued already.
230 * To check that, look at out_qlen and retransmit list.
231 * NOTE: we will not reduce to account for SACK, if the message would
232 * not have been fragmented.
234 if (timer_pending(&asoc
->timers
[SCTP_EVENT_TIMEOUT_SACK
]) &&
235 asoc
->outqueue
.out_qlen
== 0 &&
236 list_empty(&asoc
->outqueue
.retransmit
) &&
238 max_data
-= SCTP_PAD4(sizeof(sctp_sack_chunk_t
));
240 /* Encourage Cookie-ECHO bundling. */
241 if (asoc
->state
< SCTP_STATE_COOKIE_ECHOED
)
242 max_data
-= SCTP_ARBITRARY_COOKIE_ECHO_LEN
;
244 /* Now that we adjusted completely, reset first_len */
245 if (first_len
> max_data
)
246 first_len
= max_data
;
248 /* Account for a different sized first fragment */
249 if (msg_len
>= first_len
) {
250 msg_len
-= first_len
;
255 /* How many full sized? How many bytes leftover? */
256 whole
+= msg_len
/ max
;
257 over
= msg_len
% max
;
260 if ((whole
> 1) || (whole
&& over
))
261 SCTP_INC_STATS(sock_net(asoc
->base
.sk
), SCTP_MIB_FRAGUSRMSGS
);
263 /* Create chunks for all the full sized DATA chunks. */
264 for (i
= 0, len
= first_len
; i
< whole
; i
++) {
265 frag
= SCTP_DATA_MIDDLE_FRAG
;
268 frag
|= SCTP_DATA_FIRST_FRAG
;
270 if ((i
== (whole
- 1)) && !over
) {
271 frag
|= SCTP_DATA_LAST_FRAG
;
273 /* The application requests to set the I-bit of the
274 * last DATA chunk of a user message when providing
275 * the user message to the SCTP implementation.
277 if ((sinfo
->sinfo_flags
& SCTP_EOF
) ||
278 (sinfo
->sinfo_flags
& SCTP_SACK_IMMEDIATELY
))
279 frag
|= SCTP_DATA_SACK_IMM
;
282 chunk
= sctp_make_datafrag_empty(asoc
, sinfo
, len
, frag
,
290 err
= sctp_user_addto_chunk(chunk
, len
, from
);
292 goto errout_chunk_free
;
294 /* Put the chunk->skb back into the form expected by send. */
295 __skb_pull(chunk
->skb
, (__u8
*)chunk
->chunk_hdr
296 - (__u8
*)chunk
->skb
->data
);
298 sctp_datamsg_assign(msg
, chunk
);
299 list_add_tail(&chunk
->frag_list
, &msg
->chunks
);
301 /* The first chunk, the first chunk was likely short
302 * to allow bundling, so reset to full size.
308 /* .. now the leftover bytes. */
311 frag
= SCTP_DATA_NOT_FRAG
;
313 frag
= SCTP_DATA_LAST_FRAG
;
315 if ((sinfo
->sinfo_flags
& SCTP_EOF
) ||
316 (sinfo
->sinfo_flags
& SCTP_SACK_IMMEDIATELY
))
317 frag
|= SCTP_DATA_SACK_IMM
;
319 chunk
= sctp_make_datafrag_empty(asoc
, sinfo
, over
, frag
,
327 err
= sctp_user_addto_chunk(chunk
, over
, from
);
329 /* Put the chunk->skb back into the form expected by send. */
330 __skb_pull(chunk
->skb
, (__u8
*)chunk
->chunk_hdr
331 - (__u8
*)chunk
->skb
->data
);
333 goto errout_chunk_free
;
335 sctp_datamsg_assign(msg
, chunk
);
336 list_add_tail(&chunk
->frag_list
, &msg
->chunks
);
342 sctp_chunk_free(chunk
);
345 list_for_each_safe(pos
, temp
, &msg
->chunks
) {
347 chunk
= list_entry(pos
, struct sctp_chunk
, frag_list
);
348 sctp_chunk_free(chunk
);
350 sctp_datamsg_put(msg
);
354 /* Check whether this message has expired. */
355 int sctp_chunk_abandoned(struct sctp_chunk
*chunk
)
357 if (!chunk
->asoc
->peer
.prsctp_capable
||
358 !SCTP_PR_POLICY(chunk
->sinfo
.sinfo_flags
)) {
359 struct sctp_datamsg
*msg
= chunk
->msg
;
361 if (!msg
->can_abandon
)
364 if (time_after(jiffies
, msg
->expires_at
))
370 if (SCTP_PR_TTL_ENABLED(chunk
->sinfo
.sinfo_flags
) &&
371 time_after(jiffies
, chunk
->msg
->expires_at
)) {
372 if (chunk
->sent_count
)
373 chunk
->asoc
->abandoned_sent
[SCTP_PR_INDEX(TTL
)]++;
375 chunk
->asoc
->abandoned_unsent
[SCTP_PR_INDEX(TTL
)]++;
377 } else if (SCTP_PR_RTX_ENABLED(chunk
->sinfo
.sinfo_flags
) &&
378 chunk
->sent_count
> chunk
->sinfo
.sinfo_timetolive
) {
379 chunk
->asoc
->abandoned_sent
[SCTP_PR_INDEX(RTX
)]++;
382 /* PRIO policy is processed by sendmsg, not here */
387 /* This chunk (and consequently entire message) has failed in its sending. */
388 void sctp_chunk_fail(struct sctp_chunk
*chunk
, int error
)
390 chunk
->msg
->send_failed
= 1;
391 chunk
->msg
->send_error
= error
;