chunk.c revision 3e62abf92f34d75fe22352d8d102e3cd2755804d
1/* SCTP kernel implementation
2 * (C) Copyright IBM Corp. 2003, 2004
3 *
4 * This file is part of the SCTP kernel implementation
5 *
6 * This file contains the code relating the chunk abstraction.
7 *
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)
12 * any later version.
13 *
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.
19 *
20 * You should have received a copy of the GNU General Public License
21 * along with GNU CC; see the file COPYING.  If not, write to
22 * the Free Software Foundation, 59 Temple Place - Suite 330,
23 * Boston, MA 02111-1307, USA.
24 *
25 * Please send any bug reports or fixes you make to the
26 * email address(es):
27 *    lksctp developers <lksctp-developers@lists.sourceforge.net>
28 *
29 * Or submit a bug report through the following website:
30 *    http://www.sf.net/projects/lksctp
31 *
32 * Written or modified by:
33 *    Jon Grimm             <jgrimm@us.ibm.com>
34 *    Sridhar Samudrala     <sri@us.ibm.com>
35 *
36 * Any bugs reported given to us we will try to fix... any fixes shared will
37 * be incorporated into the next SCTP release.
38 */
39
40#include <linux/types.h>
41#include <linux/kernel.h>
42#include <linux/net.h>
43#include <linux/inet.h>
44#include <linux/skbuff.h>
45#include <net/sock.h>
46#include <net/sctp/sctp.h>
47#include <net/sctp/sm.h>
48
49/* This file is mostly in anticipation of future work, but initially
50 * populate with fragment tracking for an outbound message.
51 */
52
53/* Initialize datamsg from memory. */
54static void sctp_datamsg_init(struct sctp_datamsg *msg)
55{
56	atomic_set(&msg->refcnt, 1);
57	msg->send_failed = 0;
58	msg->send_error = 0;
59	msg->can_abandon = 0;
60	msg->expires_at = 0;
61	INIT_LIST_HEAD(&msg->chunks);
62}
63
64/* Allocate and initialize datamsg. */
65SCTP_STATIC struct sctp_datamsg *sctp_datamsg_new(gfp_t gfp)
66{
67	struct sctp_datamsg *msg;
68	msg = kmalloc(sizeof(struct sctp_datamsg), gfp);
69	if (msg) {
70		sctp_datamsg_init(msg);
71		SCTP_DBG_OBJCNT_INC(datamsg);
72	}
73	return msg;
74}
75
76/* Final destructruction of datamsg memory. */
77static void sctp_datamsg_destroy(struct sctp_datamsg *msg)
78{
79	struct list_head *pos, *temp;
80	struct sctp_chunk *chunk;
81	struct sctp_sock *sp;
82	struct sctp_ulpevent *ev;
83	struct sctp_association *asoc = NULL;
84	int error = 0, notify;
85
86	/* If we failed, we may need to notify. */
87	notify = msg->send_failed ? -1 : 0;
88
89	/* Release all references. */
90	list_for_each_safe(pos, temp, &msg->chunks) {
91		list_del_init(pos);
92		chunk = list_entry(pos, struct sctp_chunk, frag_list);
93		/* Check whether we _really_ need to notify. */
94		if (notify < 0) {
95			asoc = chunk->asoc;
96			if (msg->send_error)
97				error = msg->send_error;
98			else
99				error = asoc->outqueue.error;
100
101			sp = sctp_sk(asoc->base.sk);
102			notify = sctp_ulpevent_type_enabled(SCTP_SEND_FAILED,
103							    &sp->subscribe);
104		}
105
106		/* Generate a SEND FAILED event only if enabled. */
107		if (notify > 0) {
108			int sent;
109			if (chunk->has_tsn)
110				sent = SCTP_DATA_SENT;
111			else
112				sent = SCTP_DATA_UNSENT;
113
114			ev = sctp_ulpevent_make_send_failed(asoc, chunk, sent,
115							    error, GFP_ATOMIC);
116			if (ev)
117				sctp_ulpq_tail_event(&asoc->ulpq, ev);
118		}
119
120		sctp_chunk_put(chunk);
121	}
122
123	SCTP_DBG_OBJCNT_DEC(datamsg);
124	kfree(msg);
125}
126
127/* Hold a reference. */
128static void sctp_datamsg_hold(struct sctp_datamsg *msg)
129{
130	atomic_inc(&msg->refcnt);
131}
132
133/* Release a reference. */
134void sctp_datamsg_put(struct sctp_datamsg *msg)
135{
136	if (atomic_dec_and_test(&msg->refcnt))
137		sctp_datamsg_destroy(msg);
138}
139
140/* Assign a chunk to this datamsg. */
141static void sctp_datamsg_assign(struct sctp_datamsg *msg, struct sctp_chunk *chunk)
142{
143	sctp_datamsg_hold(msg);
144	chunk->msg = msg;
145}
146
147
148/* A data chunk can have a maximum payload of (2^16 - 20).  Break
149 * down any such message into smaller chunks.  Opportunistically, fragment
150 * the chunks down to the current MTU constraints.  We may get refragmented
151 * later if the PMTU changes, but it is _much better_ to fragment immediately
152 * with a reasonable guess than always doing our fragmentation on the
153 * soft-interrupt.
154 */
155struct sctp_datamsg *sctp_datamsg_from_user(struct sctp_association *asoc,
156					    struct sctp_sndrcvinfo *sinfo,
157					    struct msghdr *msgh, int msg_len)
158{
159	int max, whole, i, offset, over, err;
160	int len, first_len;
161	int max_data;
162	struct sctp_chunk *chunk;
163	struct sctp_datamsg *msg;
164	struct list_head *pos, *temp;
165	__u8 frag;
166
167	msg = sctp_datamsg_new(GFP_KERNEL);
168	if (!msg)
169		return NULL;
170
171	/* Note: Calculate this outside of the loop, so that all fragments
172	 * have the same expiration.
173	 */
174	if (sinfo->sinfo_timetolive) {
175		/* sinfo_timetolive is in milliseconds */
176		msg->expires_at = jiffies +
177				    msecs_to_jiffies(sinfo->sinfo_timetolive);
178		msg->can_abandon = 1;
179		SCTP_DEBUG_PRINTK("%s: msg:%p expires_at: %ld jiffies:%ld\n",
180				  __func__, msg, msg->expires_at, jiffies);
181	}
182
183	/* This is the biggest possible DATA chunk that can fit into
184	 * the packet
185	 */
186	max_data = asoc->pathmtu -
187		sctp_sk(asoc->base.sk)->pf->af->net_header_len -
188		sizeof(struct sctphdr) - sizeof(struct sctp_data_chunk);
189
190	max = asoc->frag_point;
191	/* If the the peer requested that we authenticate DATA chunks
192	 * we need to accound for bundling of the AUTH chunks along with
193	 * DATA.
194	 */
195	if (sctp_auth_send_cid(SCTP_CID_DATA, asoc)) {
196		struct sctp_hmac *hmac_desc = sctp_auth_asoc_get_hmac(asoc);
197
198		if (hmac_desc)
199			max_data -= WORD_ROUND(sizeof(sctp_auth_chunk_t) +
200					    hmac_desc->hmac_len);
201	}
202
203	/* Now, check if we need to reduce our max */
204	if (max > max_data)
205		max = max_data;
206
207	whole = 0;
208	first_len = max;
209
210	/* Encourage Cookie-ECHO bundling. */
211	if (asoc->state < SCTP_STATE_COOKIE_ECHOED) {
212		max_data -= SCTP_ARBITRARY_COOKIE_ECHO_LEN;
213
214		/* This is the biggesr first_len we can have */
215		if (first_len > max_data)
216			first_len = max_data;
217	}
218
219	/* Account for a different sized first fragment */
220	if (msg_len >= first_len) {
221		msg_len -= first_len;
222		whole = 1;
223	}
224
225	/* How many full sized?  How many bytes leftover? */
226	whole += msg_len / max;
227	over = msg_len % max;
228	offset = 0;
229
230	if ((whole > 1) || (whole && over))
231		SCTP_INC_STATS_USER(SCTP_MIB_FRAGUSRMSGS);
232
233	/* Create chunks for all the full sized DATA chunks. */
234	for (i=0, len=first_len; i < whole; i++) {
235		frag = SCTP_DATA_MIDDLE_FRAG;
236
237		if (0 == i)
238			frag |= SCTP_DATA_FIRST_FRAG;
239
240		if ((i == (whole - 1)) && !over)
241			frag |= SCTP_DATA_LAST_FRAG;
242
243		chunk = sctp_make_datafrag_empty(asoc, sinfo, len, frag, 0);
244
245		if (!chunk)
246			goto errout;
247		err = sctp_user_addto_chunk(chunk, offset, len, msgh->msg_iov);
248		if (err < 0)
249			goto errout;
250
251		offset += len;
252
253		/* Put the chunk->skb back into the form expected by send.  */
254		__skb_pull(chunk->skb, (__u8 *)chunk->chunk_hdr
255			   - (__u8 *)chunk->skb->data);
256
257		sctp_datamsg_assign(msg, chunk);
258		list_add_tail(&chunk->frag_list, &msg->chunks);
259
260		/* The first chunk, the first chunk was likely short
261		 * to allow bundling, so reset to full size.
262		 */
263		if (0 == i)
264			len = max;
265	}
266
267	/* .. now the leftover bytes. */
268	if (over) {
269		if (!whole)
270			frag = SCTP_DATA_NOT_FRAG;
271		else
272			frag = SCTP_DATA_LAST_FRAG;
273
274		chunk = sctp_make_datafrag_empty(asoc, sinfo, over, frag, 0);
275
276		if (!chunk)
277			goto errout;
278
279		err = sctp_user_addto_chunk(chunk, offset, over,msgh->msg_iov);
280
281		/* Put the chunk->skb back into the form expected by send.  */
282		__skb_pull(chunk->skb, (__u8 *)chunk->chunk_hdr
283			   - (__u8 *)chunk->skb->data);
284		if (err < 0)
285			goto errout;
286
287		sctp_datamsg_assign(msg, chunk);
288		list_add_tail(&chunk->frag_list, &msg->chunks);
289	}
290
291	return msg;
292
293errout:
294	list_for_each_safe(pos, temp, &msg->chunks) {
295		list_del_init(pos);
296		chunk = list_entry(pos, struct sctp_chunk, frag_list);
297		sctp_chunk_free(chunk);
298	}
299	sctp_datamsg_put(msg);
300	return NULL;
301}
302
303/* Check whether this message has expired. */
304int sctp_chunk_abandoned(struct sctp_chunk *chunk)
305{
306	struct sctp_datamsg *msg = chunk->msg;
307
308	if (!msg->can_abandon)
309		return 0;
310
311	if (time_after(jiffies, msg->expires_at))
312		return 1;
313
314	return 0;
315}
316
317/* This chunk (and consequently entire message) has failed in its sending. */
318void sctp_chunk_fail(struct sctp_chunk *chunk, int error)
319{
320	chunk->msg->send_failed = 1;
321	chunk->msg->send_error = error;
322}
323