output.c 22 KB

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