output.c 22 KB

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