output.c 22 KB

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