net: bridge: use __ethtool_get_ksettings
[linux-2.6/btrfs-unstable.git] / net / sctp / chunk.c
blob3aa43073e0b96717bc5e63dbac468a894be98186
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)
12 * any later version.
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
25 * email address(es):
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>
41 #include <net/sock.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);
53 msg->send_failed = 0;
54 msg->send_error = 0;
55 msg->can_abandon = 0;
56 msg->can_delay = 1;
57 msg->expires_at = 0;
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);
66 if (msg) {
67 sctp_datamsg_init(msg);
68 SCTP_DBG_OBJCNT_INC(datamsg);
70 return msg;
73 /* Final destructruction of datamsg memory. */
74 static void sctp_datamsg_destroy(struct sctp_datamsg *msg)
76 struct list_head *pos, *temp;
77 struct sctp_chunk *chunk;
78 struct sctp_sock *sp;
79 struct sctp_ulpevent *ev;
80 struct sctp_association *asoc = NULL;
81 int error = 0, notify;
83 /* If we failed, we may need to notify. */
84 notify = msg->send_failed ? -1 : 0;
86 /* Release all references. */
87 list_for_each_safe(pos, temp, &msg->chunks) {
88 list_del_init(pos);
89 chunk = list_entry(pos, struct sctp_chunk, frag_list);
90 /* Check whether we _really_ need to notify. */
91 if (notify < 0) {
92 asoc = chunk->asoc;
93 if (msg->send_error)
94 error = msg->send_error;
95 else
96 error = asoc->outqueue.error;
98 sp = sctp_sk(asoc->base.sk);
99 notify = sctp_ulpevent_type_enabled(SCTP_SEND_FAILED,
100 &sp->subscribe);
103 /* Generate a SEND FAILED event only if enabled. */
104 if (notify > 0) {
105 int sent;
106 if (chunk->has_tsn)
107 sent = SCTP_DATA_SENT;
108 else
109 sent = SCTP_DATA_UNSENT;
111 ev = sctp_ulpevent_make_send_failed(asoc, chunk, sent,
112 error, GFP_ATOMIC);
113 if (ev)
114 sctp_ulpq_tail_event(&asoc->ulpq, ev);
117 sctp_chunk_put(chunk);
120 SCTP_DBG_OBJCNT_DEC(datamsg);
121 kfree(msg);
124 /* Hold a reference. */
125 static void sctp_datamsg_hold(struct sctp_datamsg *msg)
127 atomic_inc(&msg->refcnt);
130 /* Release a reference. */
131 void sctp_datamsg_put(struct sctp_datamsg *msg)
133 if (atomic_dec_and_test(&msg->refcnt))
134 sctp_datamsg_destroy(msg);
137 /* Assign a chunk to this datamsg. */
138 static void sctp_datamsg_assign(struct sctp_datamsg *msg, struct sctp_chunk *chunk)
140 sctp_datamsg_hold(msg);
141 chunk->msg = msg;
145 /* A data chunk can have a maximum payload of (2^16 - 20). Break
146 * down any such message into smaller chunks. Opportunistically, fragment
147 * the chunks down to the current MTU constraints. We may get refragmented
148 * later if the PMTU changes, but it is _much better_ to fragment immediately
149 * with a reasonable guess than always doing our fragmentation on the
150 * soft-interrupt.
152 struct sctp_datamsg *sctp_datamsg_from_user(struct sctp_association *asoc,
153 struct sctp_sndrcvinfo *sinfo,
154 struct iov_iter *from)
156 int max, whole, i, offset, over, err;
157 int len, first_len;
158 int max_data;
159 struct sctp_chunk *chunk;
160 struct sctp_datamsg *msg;
161 struct list_head *pos, *temp;
162 size_t msg_len = iov_iter_count(from);
163 __u8 frag;
165 msg = sctp_datamsg_new(GFP_KERNEL);
166 if (!msg)
167 return ERR_PTR(-ENOMEM);
169 /* Note: Calculate this outside of the loop, so that all fragments
170 * have the same expiration.
172 if (sinfo->sinfo_timetolive) {
173 /* sinfo_timetolive is in milliseconds */
174 msg->expires_at = jiffies +
175 msecs_to_jiffies(sinfo->sinfo_timetolive);
176 msg->can_abandon = 1;
178 pr_debug("%s: msg:%p expires_at:%ld jiffies:%ld\n", __func__,
179 msg, msg->expires_at, jiffies);
182 /* This is the biggest possible DATA chunk that can fit into
183 * the packet
185 max_data = (asoc->pathmtu -
186 sctp_sk(asoc->base.sk)->pf->af->net_header_len -
187 sizeof(struct sctphdr) - sizeof(struct sctp_data_chunk)) & ~3;
189 max = asoc->frag_point;
190 /* If the the peer requested that we authenticate DATA chunks
191 * we need to account for bundling of the AUTH chunks along with
192 * DATA.
194 if (sctp_auth_send_cid(SCTP_CID_DATA, asoc)) {
195 struct sctp_hmac *hmac_desc = sctp_auth_asoc_get_hmac(asoc);
197 if (hmac_desc)
198 max_data -= WORD_ROUND(sizeof(sctp_auth_chunk_t) +
199 hmac_desc->hmac_len);
202 /* Now, check if we need to reduce our max */
203 if (max > max_data)
204 max = max_data;
206 whole = 0;
207 first_len = max;
209 /* Check to see if we have a pending SACK and try to let it be bundled
210 * with this message. Do this if we don't have any data queued already.
211 * To check that, look at out_qlen and retransmit list.
212 * NOTE: we will not reduce to account for SACK, if the message would
213 * not have been fragmented.
215 if (timer_pending(&asoc->timers[SCTP_EVENT_TIMEOUT_SACK]) &&
216 asoc->outqueue.out_qlen == 0 &&
217 list_empty(&asoc->outqueue.retransmit) &&
218 msg_len > max)
219 max_data -= WORD_ROUND(sizeof(sctp_sack_chunk_t));
221 /* Encourage Cookie-ECHO bundling. */
222 if (asoc->state < SCTP_STATE_COOKIE_ECHOED)
223 max_data -= SCTP_ARBITRARY_COOKIE_ECHO_LEN;
225 /* Now that we adjusted completely, reset first_len */
226 if (first_len > max_data)
227 first_len = max_data;
229 /* Account for a different sized first fragment */
230 if (msg_len >= first_len) {
231 msg_len -= first_len;
232 whole = 1;
233 msg->can_delay = 0;
236 /* How many full sized? How many bytes leftover? */
237 whole += msg_len / max;
238 over = msg_len % max;
239 offset = 0;
241 if ((whole > 1) || (whole && over))
242 SCTP_INC_STATS_USER(sock_net(asoc->base.sk), SCTP_MIB_FRAGUSRMSGS);
244 /* Create chunks for all the full sized DATA chunks. */
245 for (i = 0, len = first_len; i < whole; i++) {
246 frag = SCTP_DATA_MIDDLE_FRAG;
248 if (0 == i)
249 frag |= SCTP_DATA_FIRST_FRAG;
251 if ((i == (whole - 1)) && !over) {
252 frag |= SCTP_DATA_LAST_FRAG;
254 /* The application requests to set the I-bit of the
255 * last DATA chunk of a user message when providing
256 * the user message to the SCTP implementation.
258 if ((sinfo->sinfo_flags & SCTP_EOF) ||
259 (sinfo->sinfo_flags & SCTP_SACK_IMMEDIATELY))
260 frag |= SCTP_DATA_SACK_IMM;
263 chunk = sctp_make_datafrag_empty(asoc, sinfo, len, frag, 0);
265 if (!chunk) {
266 err = -ENOMEM;
267 goto errout;
270 err = sctp_user_addto_chunk(chunk, len, from);
271 if (err < 0)
272 goto errout_chunk_free;
274 /* Put the chunk->skb back into the form expected by send. */
275 __skb_pull(chunk->skb, (__u8 *)chunk->chunk_hdr
276 - (__u8 *)chunk->skb->data);
278 sctp_datamsg_assign(msg, chunk);
279 list_add_tail(&chunk->frag_list, &msg->chunks);
281 /* The first chunk, the first chunk was likely short
282 * to allow bundling, so reset to full size.
284 if (0 == i)
285 len = max;
288 /* .. now the leftover bytes. */
289 if (over) {
290 if (!whole)
291 frag = SCTP_DATA_NOT_FRAG;
292 else
293 frag = SCTP_DATA_LAST_FRAG;
295 if ((sinfo->sinfo_flags & SCTP_EOF) ||
296 (sinfo->sinfo_flags & SCTP_SACK_IMMEDIATELY))
297 frag |= SCTP_DATA_SACK_IMM;
299 chunk = sctp_make_datafrag_empty(asoc, sinfo, over, frag, 0);
301 if (!chunk) {
302 err = -ENOMEM;
303 goto errout;
306 err = sctp_user_addto_chunk(chunk, over, from);
308 /* Put the chunk->skb back into the form expected by send. */
309 __skb_pull(chunk->skb, (__u8 *)chunk->chunk_hdr
310 - (__u8 *)chunk->skb->data);
311 if (err < 0)
312 goto errout_chunk_free;
314 sctp_datamsg_assign(msg, chunk);
315 list_add_tail(&chunk->frag_list, &msg->chunks);
318 return msg;
320 errout_chunk_free:
321 sctp_chunk_free(chunk);
323 errout:
324 list_for_each_safe(pos, temp, &msg->chunks) {
325 list_del_init(pos);
326 chunk = list_entry(pos, struct sctp_chunk, frag_list);
327 sctp_chunk_free(chunk);
329 sctp_datamsg_put(msg);
330 return ERR_PTR(err);
333 /* Check whether this message has expired. */
334 int sctp_chunk_abandoned(struct sctp_chunk *chunk)
336 struct sctp_datamsg *msg = chunk->msg;
338 if (!msg->can_abandon)
339 return 0;
341 if (time_after(jiffies, msg->expires_at))
342 return 1;
344 return 0;
347 /* This chunk (and consequently entire message) has failed in its sending. */
348 void sctp_chunk_fail(struct sctp_chunk *chunk, int error)
350 chunk->msg->send_failed = 1;
351 chunk->msg->send_error = error;