]>
Commit | Line | Data |
---|---|---|
60c778b2 | 1 | /* SCTP kernel implementation |
1da177e4 LT |
2 | * (C) Copyright IBM Corp. 2001, 2004 |
3 | * Copyright (c) 1999-2000 Cisco, Inc. | |
4 | * Copyright (c) 1999-2001 Motorola, Inc. | |
5 | * | |
60c778b2 | 6 | * This file is part of the SCTP kernel implementation |
1da177e4 LT |
7 | * |
8 | * These functions handle output processing. | |
9 | * | |
60c778b2 | 10 | * This SCTP implementation is free software; |
1da177e4 LT |
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) | |
14 | * any later version. | |
15 | * | |
60c778b2 | 16 | * This SCTP implementation is distributed in the hope that it |
1da177e4 LT |
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. | |
21 | * | |
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. | |
26 | * | |
27 | * Please send any bug reports or fixes you make to the | |
28 | * email address(es): | |
91705c61 | 29 | * lksctp developers <linux-sctp@vger.kernel.org> |
1da177e4 | 30 | * |
1da177e4 LT |
31 | * Written or modified by: |
32 | * La Monte H.P. Yarroll <piggy@acm.org> | |
33 | * Karl Knutson <karl@athena.chicago.il.us> | |
34 | * Jon Grimm <jgrimm@austin.ibm.com> | |
35 | * Sridhar Samudrala <sri@us.ibm.com> | |
1da177e4 LT |
36 | */ |
37 | ||
145ce502 JP |
38 | #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt |
39 | ||
1da177e4 LT |
40 | #include <linux/types.h> |
41 | #include <linux/kernel.h> | |
42 | #include <linux/wait.h> | |
43 | #include <linux/time.h> | |
44 | #include <linux/ip.h> | |
45 | #include <linux/ipv6.h> | |
46 | #include <linux/init.h> | |
5a0e3ad6 | 47 | #include <linux/slab.h> |
1da177e4 | 48 | #include <net/inet_ecn.h> |
8d2f9e81 | 49 | #include <net/ip.h> |
1da177e4 | 50 | #include <net/icmp.h> |
7c73a6fa | 51 | #include <net/net_namespace.h> |
1da177e4 | 52 | |
1da177e4 LT |
53 | #include <linux/socket.h> /* for sa_family_t */ |
54 | #include <net/sock.h> | |
55 | ||
56 | #include <net/sctp/sctp.h> | |
57 | #include <net/sctp/sm.h> | |
9ad0977f | 58 | #include <net/sctp/checksum.h> |
1da177e4 LT |
59 | |
60 | /* Forward declarations for private helpers. */ | |
ed106277 NH |
61 | static sctp_xmit_t __sctp_packet_append_chunk(struct sctp_packet *packet, |
62 | struct sctp_chunk *chunk); | |
e83963b7 | 63 | static sctp_xmit_t sctp_packet_can_append_data(struct sctp_packet *packet, |
1da177e4 | 64 | struct sctp_chunk *chunk); |
e83963b7 VY |
65 | static void sctp_packet_append_data(struct sctp_packet *packet, |
66 | struct sctp_chunk *chunk); | |
67 | static sctp_xmit_t sctp_packet_will_fit(struct sctp_packet *packet, | |
68 | struct sctp_chunk *chunk, | |
69 | u16 chunk_len); | |
1da177e4 | 70 | |
be297143 WY |
71 | static void sctp_packet_reset(struct sctp_packet *packet) |
72 | { | |
73 | packet->size = packet->overhead; | |
74 | packet->has_cookie_echo = 0; | |
75 | packet->has_sack = 0; | |
76 | packet->has_data = 0; | |
77 | packet->has_auth = 0; | |
78 | packet->ipfragok = 0; | |
79 | packet->auth = NULL; | |
80 | } | |
81 | ||
1da177e4 LT |
82 | /* Config a packet. |
83 | * This appears to be a followup set of initializations. | |
84 | */ | |
85 | struct sctp_packet *sctp_packet_config(struct sctp_packet *packet, | |
86 | __u32 vtag, int ecn_capable) | |
87 | { | |
88 | struct sctp_chunk *chunk = NULL; | |
89 | ||
bb33381d | 90 | pr_debug("%s: packet:%p vtag:0x%x\n", __func__, packet, vtag); |
1da177e4 LT |
91 | |
92 | packet->vtag = vtag; | |
1da177e4 LT |
93 | |
94 | if (ecn_capable && sctp_packet_empty(packet)) { | |
95 | chunk = sctp_get_ecne_prepend(packet->transport->asoc); | |
96 | ||
97 | /* If there a is a prepend chunk stick it on the list before | |
d808ad9a YH |
98 | * any other chunks get appended. |
99 | */ | |
1da177e4 LT |
100 | if (chunk) |
101 | sctp_packet_append_chunk(packet, chunk); | |
102 | } | |
103 | ||
104 | return packet; | |
105 | } | |
106 | ||
107 | /* Initialize the packet structure. */ | |
108 | struct sctp_packet *sctp_packet_init(struct sctp_packet *packet, | |
109 | struct sctp_transport *transport, | |
110 | __u16 sport, __u16 dport) | |
111 | { | |
112 | struct sctp_association *asoc = transport->asoc; | |
113 | size_t overhead; | |
114 | ||
bb33381d | 115 | pr_debug("%s: packet:%p transport:%p\n", __func__, packet, transport); |
1da177e4 LT |
116 | |
117 | packet->transport = transport; | |
118 | packet->source_port = sport; | |
119 | packet->destination_port = dport; | |
79af02c2 | 120 | INIT_LIST_HEAD(&packet->chunk_list); |
1da177e4 | 121 | if (asoc) { |
d808ad9a YH |
122 | struct sctp_sock *sp = sctp_sk(asoc->base.sk); |
123 | overhead = sp->pf->af->net_header_len; | |
1da177e4 LT |
124 | } else { |
125 | overhead = sizeof(struct ipv6hdr); | |
126 | } | |
127 | overhead += sizeof(struct sctphdr); | |
128 | packet->overhead = overhead; | |
be297143 | 129 | sctp_packet_reset(packet); |
1da177e4 | 130 | packet->vtag = 0; |
3e3251b3 | 131 | |
1da177e4 LT |
132 | return packet; |
133 | } | |
134 | ||
135 | /* Free a packet. */ | |
136 | void sctp_packet_free(struct sctp_packet *packet) | |
137 | { | |
79af02c2 | 138 | struct sctp_chunk *chunk, *tmp; |
1da177e4 | 139 | |
bb33381d | 140 | pr_debug("%s: packet:%p\n", __func__, packet); |
1da177e4 | 141 | |
79af02c2 DM |
142 | list_for_each_entry_safe(chunk, tmp, &packet->chunk_list, list) { |
143 | list_del_init(&chunk->list); | |
1da177e4 | 144 | sctp_chunk_free(chunk); |
79af02c2 | 145 | } |
1da177e4 LT |
146 | } |
147 | ||
148 | /* This routine tries to append the chunk to the offered packet. If adding | |
149 | * the chunk causes the packet to exceed the path MTU and COOKIE_ECHO chunk | |
150 | * is not present in the packet, it transmits the input packet. | |
151 | * Data can be bundled with a packet containing a COOKIE_ECHO chunk as long | |
152 | * as it can fit in the packet, but any more data that does not fit in this | |
153 | * packet can be sent only after receiving the COOKIE_ACK. | |
154 | */ | |
155 | sctp_xmit_t sctp_packet_transmit_chunk(struct sctp_packet *packet, | |
2e3216cd VY |
156 | struct sctp_chunk *chunk, |
157 | int one_packet) | |
1da177e4 LT |
158 | { |
159 | sctp_xmit_t retval; | |
160 | int error = 0; | |
161 | ||
bb33381d | 162 | pr_debug("%s: packet:%p chunk:%p\n", __func__, packet, chunk); |
1da177e4 LT |
163 | |
164 | switch ((retval = (sctp_packet_append_chunk(packet, chunk)))) { | |
165 | case SCTP_XMIT_PMTU_FULL: | |
166 | if (!packet->has_cookie_echo) { | |
167 | error = sctp_packet_transmit(packet); | |
168 | if (error < 0) | |
169 | chunk->skb->sk->sk_err = -error; | |
170 | ||
171 | /* If we have an empty packet, then we can NOT ever | |
172 | * return PMTU_FULL. | |
173 | */ | |
2e3216cd VY |
174 | if (!one_packet) |
175 | retval = sctp_packet_append_chunk(packet, | |
176 | chunk); | |
1da177e4 LT |
177 | } |
178 | break; | |
179 | ||
180 | case SCTP_XMIT_RWND_FULL: | |
181 | case SCTP_XMIT_OK: | |
182 | case SCTP_XMIT_NAGLE_DELAY: | |
183 | break; | |
3ff50b79 | 184 | } |
1da177e4 LT |
185 | |
186 | return retval; | |
187 | } | |
188 | ||
4cd57c80 VY |
189 | /* Try to bundle an auth chunk into the packet. */ |
190 | static sctp_xmit_t sctp_packet_bundle_auth(struct sctp_packet *pkt, | |
191 | struct sctp_chunk *chunk) | |
192 | { | |
193 | struct sctp_association *asoc = pkt->transport->asoc; | |
194 | struct sctp_chunk *auth; | |
195 | sctp_xmit_t retval = SCTP_XMIT_OK; | |
196 | ||
197 | /* if we don't have an association, we can't do authentication */ | |
198 | if (!asoc) | |
199 | return retval; | |
200 | ||
201 | /* See if this is an auth chunk we are bundling or if | |
202 | * auth is already bundled. | |
203 | */ | |
4007cc88 | 204 | if (chunk->chunk_hdr->type == SCTP_CID_AUTH || pkt->has_auth) |
4cd57c80 VY |
205 | return retval; |
206 | ||
207 | /* if the peer did not request this chunk to be authenticated, | |
208 | * don't do it | |
209 | */ | |
210 | if (!chunk->auth) | |
211 | return retval; | |
212 | ||
213 | auth = sctp_make_auth(asoc); | |
214 | if (!auth) | |
215 | return retval; | |
216 | ||
ed106277 NH |
217 | retval = __sctp_packet_append_chunk(pkt, auth); |
218 | ||
219 | if (retval != SCTP_XMIT_OK) | |
220 | sctp_chunk_free(auth); | |
4cd57c80 VY |
221 | |
222 | return retval; | |
223 | } | |
224 | ||
1da177e4 LT |
225 | /* Try to bundle a SACK with the packet. */ |
226 | static sctp_xmit_t sctp_packet_bundle_sack(struct sctp_packet *pkt, | |
227 | struct sctp_chunk *chunk) | |
228 | { | |
229 | sctp_xmit_t retval = SCTP_XMIT_OK; | |
230 | ||
231 | /* If sending DATA and haven't aleady bundled a SACK, try to | |
232 | * bundle one in to the packet. | |
233 | */ | |
234 | if (sctp_chunk_is_data(chunk) && !pkt->has_sack && | |
235 | !pkt->has_cookie_echo) { | |
236 | struct sctp_association *asoc; | |
af87b823 | 237 | struct timer_list *timer; |
1da177e4 | 238 | asoc = pkt->transport->asoc; |
af87b823 | 239 | timer = &asoc->timers[SCTP_EVENT_TIMEOUT_SACK]; |
1da177e4 | 240 | |
af87b823 DG |
241 | /* If the SACK timer is running, we have a pending SACK */ |
242 | if (timer_pending(timer)) { | |
1da177e4 | 243 | struct sctp_chunk *sack; |
4244854d NH |
244 | |
245 | if (pkt->transport->sack_generation != | |
246 | pkt->transport->asoc->peer.sack_generation) | |
247 | return retval; | |
248 | ||
1da177e4 LT |
249 | asoc->a_rwnd = asoc->rwnd; |
250 | sack = sctp_make_sack(asoc); | |
251 | if (sack) { | |
ed106277 NH |
252 | retval = __sctp_packet_append_chunk(pkt, sack); |
253 | if (retval != SCTP_XMIT_OK) { | |
254 | sctp_chunk_free(sack); | |
255 | goto out; | |
256 | } | |
1da177e4 | 257 | asoc->peer.sack_needed = 0; |
af87b823 | 258 | if (del_timer(timer)) |
1da177e4 LT |
259 | sctp_association_put(asoc); |
260 | } | |
261 | } | |
262 | } | |
ed106277 | 263 | out: |
1da177e4 LT |
264 | return retval; |
265 | } | |
266 | ||
ed106277 | 267 | |
1da177e4 LT |
268 | /* Append a chunk to the offered packet reporting back any inability to do |
269 | * so. | |
270 | */ | |
ed106277 NH |
271 | static sctp_xmit_t __sctp_packet_append_chunk(struct sctp_packet *packet, |
272 | struct sctp_chunk *chunk) | |
1da177e4 LT |
273 | { |
274 | sctp_xmit_t retval = SCTP_XMIT_OK; | |
275 | __u16 chunk_len = WORD_ROUND(ntohs(chunk->chunk_hdr->length)); | |
1da177e4 | 276 | |
e83963b7 VY |
277 | /* Check to see if this chunk will fit into the packet */ |
278 | retval = sctp_packet_will_fit(packet, chunk, chunk_len); | |
279 | if (retval != SCTP_XMIT_OK) | |
280 | goto finish; | |
1da177e4 | 281 | |
e83963b7 | 282 | /* We believe that this chunk is OK to add to the packet */ |
4cd57c80 VY |
283 | switch (chunk->chunk_hdr->type) { |
284 | case SCTP_CID_DATA: | |
e83963b7 VY |
285 | /* Account for the data being in the packet */ |
286 | sctp_packet_append_data(packet, chunk); | |
1da177e4 LT |
287 | /* Disallow SACK bundling after DATA. */ |
288 | packet->has_sack = 1; | |
4cd57c80 VY |
289 | /* Disallow AUTH bundling after DATA */ |
290 | packet->has_auth = 1; | |
291 | /* Let it be knows that packet has DATA in it */ | |
292 | packet->has_data = 1; | |
759af00e VY |
293 | /* timestamp the chunk for rtx purposes */ |
294 | chunk->sent_at = jiffies; | |
4cd57c80 VY |
295 | break; |
296 | case SCTP_CID_COOKIE_ECHO: | |
1da177e4 | 297 | packet->has_cookie_echo = 1; |
4cd57c80 VY |
298 | break; |
299 | ||
300 | case SCTP_CID_SACK: | |
1da177e4 | 301 | packet->has_sack = 1; |
196d6759 MB |
302 | if (chunk->asoc) |
303 | chunk->asoc->stats.osacks++; | |
4cd57c80 VY |
304 | break; |
305 | ||
306 | case SCTP_CID_AUTH: | |
307 | packet->has_auth = 1; | |
308 | packet->auth = chunk; | |
309 | break; | |
310 | } | |
1da177e4 LT |
311 | |
312 | /* It is OK to send this chunk. */ | |
79af02c2 | 313 | list_add_tail(&chunk->list, &packet->chunk_list); |
1da177e4 LT |
314 | packet->size += chunk_len; |
315 | chunk->transport = packet->transport; | |
316 | finish: | |
317 | return retval; | |
318 | } | |
319 | ||
ed106277 NH |
320 | /* Append a chunk to the offered packet reporting back any inability to do |
321 | * so. | |
322 | */ | |
323 | sctp_xmit_t sctp_packet_append_chunk(struct sctp_packet *packet, | |
324 | struct sctp_chunk *chunk) | |
325 | { | |
326 | sctp_xmit_t retval = SCTP_XMIT_OK; | |
327 | ||
bb33381d | 328 | pr_debug("%s: packet:%p chunk:%p\n", __func__, packet, chunk); |
ed106277 NH |
329 | |
330 | /* Data chunks are special. Before seeing what else we can | |
331 | * bundle into this packet, check to see if we are allowed to | |
332 | * send this DATA. | |
333 | */ | |
334 | if (sctp_chunk_is_data(chunk)) { | |
335 | retval = sctp_packet_can_append_data(packet, chunk); | |
336 | if (retval != SCTP_XMIT_OK) | |
337 | goto finish; | |
338 | } | |
339 | ||
340 | /* Try to bundle AUTH chunk */ | |
341 | retval = sctp_packet_bundle_auth(packet, chunk); | |
342 | if (retval != SCTP_XMIT_OK) | |
343 | goto finish; | |
344 | ||
345 | /* Try to bundle SACK chunk */ | |
346 | retval = sctp_packet_bundle_sack(packet, chunk); | |
347 | if (retval != SCTP_XMIT_OK) | |
348 | goto finish; | |
349 | ||
350 | retval = __sctp_packet_append_chunk(packet, chunk); | |
351 | ||
352 | finish: | |
353 | return retval; | |
354 | } | |
355 | ||
4c3a5bda TG |
356 | static void sctp_packet_release_owner(struct sk_buff *skb) |
357 | { | |
358 | sk_free(skb->sk); | |
359 | } | |
360 | ||
361 | static void sctp_packet_set_owner_w(struct sk_buff *skb, struct sock *sk) | |
362 | { | |
363 | skb_orphan(skb); | |
364 | skb->sk = sk; | |
365 | skb->destructor = sctp_packet_release_owner; | |
366 | ||
367 | /* | |
368 | * The data chunks have already been accounted for in sctp_sendmsg(), | |
369 | * therefore only reserve a single byte to keep socket around until | |
370 | * the packet has been transmitted. | |
371 | */ | |
372 | atomic_inc(&sk->sk_wmem_alloc); | |
373 | } | |
374 | ||
1da177e4 LT |
375 | /* All packets are sent to the network through this function from |
376 | * sctp_outq_tail(). | |
377 | * | |
378 | * The return value is a normal kernel error return value. | |
379 | */ | |
380 | int sctp_packet_transmit(struct sctp_packet *packet) | |
381 | { | |
382 | struct sctp_transport *tp = packet->transport; | |
383 | struct sctp_association *asoc = tp->asoc; | |
384 | struct sctphdr *sh; | |
1da177e4 | 385 | struct sk_buff *nskb; |
79af02c2 | 386 | struct sctp_chunk *chunk, *tmp; |
1da177e4 LT |
387 | struct sock *sk; |
388 | int err = 0; | |
389 | int padding; /* How much padding do we need? */ | |
390 | __u8 has_data = 0; | |
503b55fd | 391 | struct dst_entry *dst = tp->dst; |
4cd57c80 VY |
392 | unsigned char *auth = NULL; /* pointer to auth in skb data */ |
393 | __u32 cksum_buf_len = sizeof(struct sctphdr); | |
1da177e4 | 394 | |
bb33381d | 395 | pr_debug("%s: packet:%p\n", __func__, packet); |
1da177e4 LT |
396 | |
397 | /* Do NOT generate a chunkless packet. */ | |
79af02c2 | 398 | if (list_empty(&packet->chunk_list)) |
1da177e4 LT |
399 | return err; |
400 | ||
401 | /* Set up convenience variables... */ | |
79af02c2 | 402 | chunk = list_entry(packet->chunk_list.next, struct sctp_chunk, list); |
1da177e4 LT |
403 | sk = chunk->skb->sk; |
404 | ||
405 | /* Allocate the new skb. */ | |
594ccc14 | 406 | nskb = alloc_skb(packet->size + LL_MAX_HEADER, GFP_ATOMIC); |
1da177e4 LT |
407 | if (!nskb) |
408 | goto nomem; | |
409 | ||
410 | /* Make sure the outbound skb has enough header room reserved. */ | |
594ccc14 | 411 | skb_reserve(nskb, packet->overhead + LL_MAX_HEADER); |
1da177e4 LT |
412 | |
413 | /* Set the owning socket so that we know where to get the | |
414 | * destination IP address. | |
415 | */ | |
4c3a5bda | 416 | sctp_packet_set_owner_w(nskb, sk); |
1da177e4 | 417 | |
e0268868 | 418 | if (!sctp_transport_dst_check(tp)) { |
503b55fd SS |
419 | sctp_transport_route(tp, NULL, sctp_sk(sk)); |
420 | if (asoc && (asoc->param_flags & SPP_PMTUD_ENABLE)) { | |
02f3d4ce | 421 | sctp_assoc_sync_pmtu(sk, asoc); |
503b55fd SS |
422 | } |
423 | } | |
adf30907 ED |
424 | dst = dst_clone(tp->dst); |
425 | skb_dst_set(nskb, dst); | |
ff0ac74a | 426 | if (!dst) |
503b55fd | 427 | goto no_route; |
503b55fd | 428 | |
1da177e4 LT |
429 | /* Build the SCTP header. */ |
430 | sh = (struct sctphdr *)skb_push(nskb, sizeof(struct sctphdr)); | |
8dc92f7e | 431 | skb_reset_transport_header(nskb); |
1da177e4 LT |
432 | sh->source = htons(packet->source_port); |
433 | sh->dest = htons(packet->destination_port); | |
434 | ||
435 | /* From 6.8 Adler-32 Checksum Calculation: | |
436 | * After the packet is constructed (containing the SCTP common | |
437 | * header and one or more control or DATA chunks), the | |
438 | * transmitter shall: | |
439 | * | |
440 | * 1) Fill in the proper Verification Tag in the SCTP common | |
441 | * header and initialize the checksum field to 0's. | |
442 | */ | |
443 | sh->vtag = htonl(packet->vtag); | |
444 | sh->checksum = 0; | |
445 | ||
1da177e4 LT |
446 | /** |
447 | * 6.10 Bundling | |
448 | * | |
449 | * An endpoint bundles chunks by simply including multiple | |
450 | * chunks in one outbound SCTP packet. ... | |
451 | */ | |
452 | ||
453 | /** | |
454 | * 3.2 Chunk Field Descriptions | |
455 | * | |
456 | * The total length of a chunk (including Type, Length and | |
457 | * Value fields) MUST be a multiple of 4 bytes. If the length | |
458 | * of the chunk is not a multiple of 4 bytes, the sender MUST | |
459 | * pad the chunk with all zero bytes and this padding is not | |
460 | * included in the chunk length field. The sender should | |
461 | * never pad with more than 3 bytes. | |
462 | * | |
463 | * [This whole comment explains WORD_ROUND() below.] | |
464 | */ | |
bb33381d DB |
465 | |
466 | pr_debug("***sctp_transmit_packet***\n"); | |
467 | ||
79af02c2 DM |
468 | list_for_each_entry_safe(chunk, tmp, &packet->chunk_list, list) { |
469 | list_del_init(&chunk->list); | |
1da177e4 | 470 | if (sctp_chunk_is_data(chunk)) { |
ae19c548 VY |
471 | /* 6.3.1 C4) When data is in flight and when allowed |
472 | * by rule C5, a new RTT measurement MUST be made each | |
473 | * round trip. Furthermore, new RTT measurements | |
474 | * SHOULD be made no more than once per round-trip | |
475 | * for a given destination transport address. | |
476 | */ | |
1da177e4 | 477 | |
ae19c548 VY |
478 | if (!tp->rto_pending) { |
479 | chunk->rtt_in_progress = 1; | |
480 | tp->rto_pending = 1; | |
d8dd1578 | 481 | } |
1da177e4 LT |
482 | has_data = 1; |
483 | } | |
484 | ||
485 | padding = WORD_ROUND(chunk->skb->len) - chunk->skb->len; | |
486 | if (padding) | |
487 | memset(skb_put(chunk->skb, padding), 0, padding); | |
488 | ||
4cd57c80 VY |
489 | /* if this is the auth chunk that we are adding, |
490 | * store pointer where it will be added and put | |
491 | * the auth into the packet. | |
492 | */ | |
493 | if (chunk == packet->auth) | |
494 | auth = skb_tail_pointer(nskb); | |
495 | ||
496 | cksum_buf_len += chunk->skb->len; | |
497 | memcpy(skb_put(nskb, chunk->skb->len), | |
503b55fd | 498 | chunk->skb->data, chunk->skb->len); |
1da177e4 | 499 | |
bb33381d DB |
500 | pr_debug("*** Chunk:%p[%s] %s 0x%x, length:%d, chunk->skb->len:%d, " |
501 | "rtt_in_progress:%d\n", chunk, | |
502 | sctp_cname(SCTP_ST_CHUNK(chunk->chunk_hdr->type)), | |
503 | chunk->has_tsn ? "TSN" : "No TSN", | |
504 | chunk->has_tsn ? ntohl(chunk->subh.data_hdr->tsn) : 0, | |
505 | ntohs(chunk->chunk_hdr->length), chunk->skb->len, | |
506 | chunk->rtt_in_progress); | |
1da177e4 LT |
507 | |
508 | /* | |
509 | * If this is a control chunk, this is our last | |
510 | * reference. Free data chunks after they've been | |
511 | * acknowledged or have failed. | |
512 | */ | |
513 | if (!sctp_chunk_is_data(chunk)) | |
d808ad9a | 514 | sctp_chunk_free(chunk); |
1da177e4 LT |
515 | } |
516 | ||
4cd57c80 VY |
517 | /* SCTP-AUTH, Section 6.2 |
518 | * The sender MUST calculate the MAC as described in RFC2104 [2] | |
519 | * using the hash function H as described by the MAC Identifier and | |
520 | * the shared association key K based on the endpoint pair shared key | |
521 | * described by the shared key identifier. The 'data' used for the | |
522 | * computation of the AUTH-chunk is given by the AUTH chunk with its | |
523 | * HMAC field set to zero (as shown in Figure 6) followed by all | |
524 | * chunks that are placed after the AUTH chunk in the SCTP packet. | |
525 | */ | |
526 | if (auth) | |
527 | sctp_auth_calculate_hmac(asoc, nskb, | |
528 | (struct sctp_auth_chunk *)auth, | |
529 | GFP_ATOMIC); | |
530 | ||
531 | /* 2) Calculate the Adler-32 checksum of the whole packet, | |
532 | * including the SCTP common header and all the | |
533 | * chunks. | |
534 | * | |
535 | * Note: Adler-32 is no longer applicable, as has been replaced | |
536 | * by CRC32-C as described in <draft-ietf-tsvwg-sctpcsum-02.txt>. | |
537 | */ | |
71acc0dd | 538 | if (!sctp_checksum_disable) { |
b73c43f8 MM |
539 | if (!(dst->dev->features & NETIF_F_SCTP_CSUM)) { |
540 | __u32 crc32 = sctp_start_cksum((__u8 *)sh, cksum_buf_len); | |
4458f04c | 541 | |
b73c43f8 MM |
542 | /* 3) Put the resultant value into the checksum field in the |
543 | * common header, and leave the rest of the bits unchanged. | |
544 | */ | |
545 | sh->checksum = sctp_end_cksum(crc32); | |
546 | } else { | |
25985edc | 547 | /* no need to seed pseudo checksum for SCTP */ |
8dc92f7e JB |
548 | nskb->ip_summed = CHECKSUM_PARTIAL; |
549 | nskb->csum_start = (skb_transport_header(nskb) - | |
550 | nskb->head); | |
551 | nskb->csum_offset = offsetof(struct sctphdr, checksum); | |
8dc92f7e JB |
552 | } |
553 | } | |
1da177e4 | 554 | |
1da177e4 LT |
555 | /* IP layer ECN support |
556 | * From RFC 2481 | |
557 | * "The ECN-Capable Transport (ECT) bit would be set by the | |
558 | * data sender to indicate that the end-points of the | |
559 | * transport protocol are ECN-capable." | |
560 | * | |
561 | * Now setting the ECT bit all the time, as it should not cause | |
562 | * any problems protocol-wise even if our peer ignores it. | |
563 | * | |
564 | * Note: The works for IPv6 layer checks this bit too later | |
565 | * in transmission. See IP6_ECN_flow_xmit(). | |
566 | */ | |
b9031d9d | 567 | (*tp->af_specific->ecn_capable)(nskb->sk); |
1da177e4 LT |
568 | |
569 | /* Set up the IP options. */ | |
570 | /* BUG: not implemented | |
571 | * For v4 this all lives somewhere in sk->sk_opt... | |
572 | */ | |
573 | ||
574 | /* Dump that on IP! */ | |
196d6759 MB |
575 | if (asoc) { |
576 | asoc->stats.opackets++; | |
577 | if (asoc->peer.last_sent_to != tp) | |
578 | /* Considering the multiple CPU scenario, this is a | |
579 | * "correcter" place for last_sent_to. --xguo | |
580 | */ | |
581 | asoc->peer.last_sent_to = tp; | |
1da177e4 LT |
582 | } |
583 | ||
584 | if (has_data) { | |
585 | struct timer_list *timer; | |
586 | unsigned long timeout; | |
587 | ||
1da177e4 LT |
588 | /* Restart the AUTOCLOSE timer when sending data. */ |
589 | if (sctp_state(asoc, ESTABLISHED) && asoc->autoclose) { | |
590 | timer = &asoc->timers[SCTP_EVENT_TIMEOUT_AUTOCLOSE]; | |
591 | timeout = asoc->timeouts[SCTP_EVENT_TIMEOUT_AUTOCLOSE]; | |
592 | ||
593 | if (!mod_timer(timer, jiffies + timeout)) | |
594 | sctp_association_hold(asoc); | |
595 | } | |
596 | } | |
597 | ||
bb33381d | 598 | pr_debug("***sctp_transmit_packet*** skb->len:%d\n", nskb->len); |
1da177e4 | 599 | |
f880374c HX |
600 | nskb->local_df = packet->ipfragok; |
601 | (*tp->af_specific->sctp_xmit)(nskb, tp); | |
1da177e4 LT |
602 | |
603 | out: | |
d521c08f | 604 | sctp_packet_reset(packet); |
1da177e4 LT |
605 | return err; |
606 | no_route: | |
607 | kfree_skb(nskb); | |
b01a2407 | 608 | IP_INC_STATS_BH(sock_net(asoc->base.sk), IPSTATS_MIB_OUTNOROUTES); |
1da177e4 LT |
609 | |
610 | /* FIXME: Returning the 'err' will effect all the associations | |
611 | * associated with a socket, although only one of the paths of the | |
612 | * association is unreachable. | |
613 | * The real failure of a transport or association can be passed on | |
614 | * to the user via notifications. So setting this error may not be | |
615 | * required. | |
616 | */ | |
617 | /* err = -EHOSTUNREACH; */ | |
618 | err: | |
619 | /* Control chunks are unreliable so just drop them. DATA chunks | |
620 | * will get resent or dropped later. | |
621 | */ | |
622 | ||
79af02c2 DM |
623 | list_for_each_entry_safe(chunk, tmp, &packet->chunk_list, list) { |
624 | list_del_init(&chunk->list); | |
1da177e4 | 625 | if (!sctp_chunk_is_data(chunk)) |
d808ad9a | 626 | sctp_chunk_free(chunk); |
1da177e4 LT |
627 | } |
628 | goto out; | |
629 | nomem: | |
630 | err = -ENOMEM; | |
631 | goto err; | |
632 | } | |
633 | ||
634 | /******************************************************************** | |
635 | * 2nd Level Abstractions | |
636 | ********************************************************************/ | |
637 | ||
e83963b7 VY |
638 | /* This private function check to see if a chunk can be added */ |
639 | static sctp_xmit_t sctp_packet_can_append_data(struct sctp_packet *packet, | |
1da177e4 LT |
640 | struct sctp_chunk *chunk) |
641 | { | |
642 | sctp_xmit_t retval = SCTP_XMIT_OK; | |
e83963b7 | 643 | size_t datasize, rwnd, inflight, flight_size; |
1da177e4 | 644 | struct sctp_transport *transport = packet->transport; |
1da177e4 | 645 | struct sctp_association *asoc = transport->asoc; |
1da177e4 LT |
646 | struct sctp_outq *q = &asoc->outqueue; |
647 | ||
648 | /* RFC 2960 6.1 Transmission of DATA Chunks | |
649 | * | |
650 | * A) At any given time, the data sender MUST NOT transmit new data to | |
651 | * any destination transport address if its peer's rwnd indicates | |
652 | * that the peer has no buffer space (i.e. rwnd is 0, see Section | |
653 | * 6.2.1). However, regardless of the value of rwnd (including if it | |
654 | * is 0), the data sender can always have one DATA chunk in flight to | |
655 | * the receiver if allowed by cwnd (see rule B below). This rule | |
656 | * allows the sender to probe for a change in rwnd that the sender | |
657 | * missed due to the SACK having been lost in transit from the data | |
658 | * receiver to the data sender. | |
659 | */ | |
660 | ||
661 | rwnd = asoc->peer.rwnd; | |
e83963b7 VY |
662 | inflight = q->outstanding_bytes; |
663 | flight_size = transport->flight_size; | |
1da177e4 LT |
664 | |
665 | datasize = sctp_data_size(chunk); | |
666 | ||
667 | if (datasize > rwnd) { | |
668 | if (inflight > 0) { | |
669 | /* We have (at least) one data chunk in flight, | |
670 | * so we can't fall back to rule 6.1 B). | |
671 | */ | |
672 | retval = SCTP_XMIT_RWND_FULL; | |
673 | goto finish; | |
674 | } | |
675 | } | |
676 | ||
1da177e4 LT |
677 | /* RFC 2960 6.1 Transmission of DATA Chunks |
678 | * | |
679 | * B) At any given time, the sender MUST NOT transmit new data | |
680 | * to a given transport address if it has cwnd or more bytes | |
681 | * of data outstanding to that transport address. | |
682 | */ | |
683 | /* RFC 7.2.4 & the Implementers Guide 2.8. | |
684 | * | |
685 | * 3) ... | |
686 | * When a Fast Retransmit is being performed the sender SHOULD | |
687 | * ignore the value of cwnd and SHOULD NOT delay retransmission. | |
688 | */ | |
c226ef9b | 689 | if (chunk->fast_retransmit != SCTP_NEED_FRTX) |
e83963b7 | 690 | if (flight_size >= transport->cwnd) { |
1da177e4 LT |
691 | retval = SCTP_XMIT_RWND_FULL; |
692 | goto finish; | |
693 | } | |
694 | ||
695 | /* Nagle's algorithm to solve small-packet problem: | |
696 | * Inhibit the sending of new chunks when new outgoing data arrives | |
697 | * if any previously transmitted data on the connection remains | |
698 | * unacknowledged. | |
699 | */ | |
e83963b7 VY |
700 | if (!sctp_sk(asoc->base.sk)->nodelay && sctp_packet_empty(packet) && |
701 | inflight && sctp_state(asoc, ESTABLISHED)) { | |
95c96174 ED |
702 | unsigned int max = transport->pathmtu - packet->overhead; |
703 | unsigned int len = chunk->skb->len + q->out_qlen; | |
1da177e4 LT |
704 | |
705 | /* Check whether this chunk and all the rest of pending | |
706 | * data will fit or delay in hopes of bundling a full | |
707 | * sized packet. | |
cb95ea32 VY |
708 | * Don't delay large message writes that may have been |
709 | * fragmeneted into small peices. | |
1da177e4 | 710 | */ |
0e3aef8d | 711 | if ((len < max) && chunk->msg->can_delay) { |
1da177e4 LT |
712 | retval = SCTP_XMIT_NAGLE_DELAY; |
713 | goto finish; | |
714 | } | |
715 | } | |
716 | ||
e83963b7 VY |
717 | finish: |
718 | return retval; | |
719 | } | |
720 | ||
721 | /* This private function does management things when adding DATA chunk */ | |
722 | static void sctp_packet_append_data(struct sctp_packet *packet, | |
723 | struct sctp_chunk *chunk) | |
724 | { | |
725 | struct sctp_transport *transport = packet->transport; | |
726 | size_t datasize = sctp_data_size(chunk); | |
727 | struct sctp_association *asoc = transport->asoc; | |
728 | u32 rwnd = asoc->peer.rwnd; | |
729 | ||
1da177e4 LT |
730 | /* Keep track of how many bytes are in flight over this transport. */ |
731 | transport->flight_size += datasize; | |
732 | ||
733 | /* Keep track of how many bytes are in flight to the receiver. */ | |
734 | asoc->outqueue.outstanding_bytes += datasize; | |
735 | ||
a76c0adf | 736 | /* Update our view of the receiver's rwnd. */ |
1da177e4 LT |
737 | if (datasize < rwnd) |
738 | rwnd -= datasize; | |
739 | else | |
740 | rwnd = 0; | |
741 | ||
742 | asoc->peer.rwnd = rwnd; | |
743 | /* Has been accepted for transmission. */ | |
744 | if (!asoc->peer.prsctp_capable) | |
745 | chunk->msg->can_abandon = 0; | |
d8dd1578 NH |
746 | sctp_chunk_assign_tsn(chunk); |
747 | sctp_chunk_assign_ssn(chunk); | |
e83963b7 VY |
748 | } |
749 | ||
750 | static sctp_xmit_t sctp_packet_will_fit(struct sctp_packet *packet, | |
751 | struct sctp_chunk *chunk, | |
752 | u16 chunk_len) | |
753 | { | |
754 | size_t psize; | |
755 | size_t pmtu; | |
756 | int too_big; | |
757 | sctp_xmit_t retval = SCTP_XMIT_OK; | |
758 | ||
759 | psize = packet->size; | |
760 | pmtu = ((packet->transport->asoc) ? | |
761 | (packet->transport->asoc->pathmtu) : | |
762 | (packet->transport->pathmtu)); | |
763 | ||
764 | too_big = (psize + chunk_len > pmtu); | |
765 | ||
766 | /* Decide if we need to fragment or resubmit later. */ | |
767 | if (too_big) { | |
768 | /* It's OK to fragmet at IP level if any one of the following | |
769 | * is true: | |
770 | * 1. The packet is empty (meaning this chunk is greater | |
771 | * the MTU) | |
772 | * 2. The chunk we are adding is a control chunk | |
773 | * 3. The packet doesn't have any data in it yet and data | |
774 | * requires authentication. | |
775 | */ | |
776 | if (sctp_packet_empty(packet) || !sctp_chunk_is_data(chunk) || | |
777 | (!packet->has_data && chunk->auth)) { | |
778 | /* We no longer do re-fragmentation. | |
779 | * Just fragment at the IP layer, if we | |
780 | * actually hit this condition | |
781 | */ | |
782 | packet->ipfragok = 1; | |
783 | } else { | |
784 | retval = SCTP_XMIT_PMTU_FULL; | |
785 | } | |
786 | } | |
1da177e4 | 787 | |
1da177e4 LT |
788 | return retval; |
789 | } |