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