output.c 22 KB

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