uip-split.c 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136
  1. /*
  2. * Copyright (c) 2004, Swedish Institute of Computer Science.
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions
  7. * are met:
  8. * 1. Redistributions of source code must retain the above copyright
  9. * notice, this list of conditions and the following disclaimer.
  10. * 2. Redistributions in binary form must reproduce the above copyright
  11. * notice, this list of conditions and the following disclaimer in the
  12. * documentation and/or other materials provided with the distribution.
  13. * 3. Neither the name of the Institute nor the names of its contributors
  14. * may be used to endorse or promote products derived from this software
  15. * without specific prior written permission.
  16. *
  17. * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
  18. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  19. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  20. * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
  21. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  22. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  23. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  24. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  25. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  26. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  27. * SUCH DAMAGE.
  28. *
  29. * This file is part of the uIP TCP/IP stack
  30. *
  31. * Author: Adam Dunkels <adam@sics.se>
  32. *
  33. * $Id: uip-split.c,v 1.2 2006/06/12 08:00:30 adam Exp $
  34. */
  35. #include <string.h>
  36. #include "uip-split.h"
  37. #include "uip.h"
  38. #include "uip-fw.h"
  39. #include "uip_arch.h"
  40. #define BUF ((struct uip_tcpip_hdr *)&uip_buf[UIP_LLH_LEN])
  41. /*-----------------------------------------------------------------------------*/
  42. void
  43. uip_split_output(void)
  44. {
  45. u16_t tcplen, len1, len2;
  46. /* We only try to split maximum sized TCP segments. */
  47. if(BUF->proto == UIP_PROTO_TCP &&
  48. uip_len == UIP_BUFSIZE - UIP_LLH_LEN) {
  49. tcplen = uip_len - UIP_TCPIP_HLEN;
  50. /* Split the segment in two. If the original packet length was
  51. odd, we make the second packet one byte larger. */
  52. len1 = len2 = tcplen / 2;
  53. if(len1 + len2 < tcplen) {
  54. ++len2;
  55. }
  56. /* Create the first packet. This is done by altering the length
  57. field of the IP header and updating the checksums. */
  58. uip_len = len1 + UIP_TCPIP_HLEN;
  59. #if UIP_CONF_IPV6
  60. /* For IPv6, the IP length field does not include the IPv6 IP header
  61. length. */
  62. BUF->len[0] = ((uip_len - UIP_IPH_LEN) >> 8);
  63. BUF->len[1] = ((uip_len - UIP_IPH_LEN) & 0xff);
  64. #else /* UIP_CONF_IPV6 */
  65. BUF->len[0] = uip_len >> 8;
  66. BUF->len[1] = uip_len & 0xff;
  67. #endif /* UIP_CONF_IPV6 */
  68. /* Recalculate the TCP checksum. */
  69. BUF->tcpchksum = 0;
  70. BUF->tcpchksum = ~(uip_tcpchksum());
  71. #if !UIP_CONF_IPV6
  72. /* Recalculate the IP checksum. */
  73. BUF->ipchksum = 0;
  74. BUF->ipchksum = ~(uip_ipchksum());
  75. #endif /* UIP_CONF_IPV6 */
  76. /* Transmit the first packet. */
  77. /* uip_fw_output();*/
  78. tcpip_output();
  79. /* Now, create the second packet. To do this, it is not enough to
  80. just alter the length field, but we must also update the TCP
  81. sequence number and point the uip_appdata to a new place in
  82. memory. This place is detemined by the length of the first
  83. packet (len1). */
  84. uip_len = len2 + UIP_TCPIP_HLEN;
  85. #if UIP_CONF_IPV6
  86. /* For IPv6, the IP length field does not include the IPv6 IP header
  87. length. */
  88. BUF->len[0] = ((uip_len - UIP_IPH_LEN) >> 8);
  89. BUF->len[1] = ((uip_len - UIP_IPH_LEN) & 0xff);
  90. #else /* UIP_CONF_IPV6 */
  91. BUF->len[0] = uip_len >> 8;
  92. BUF->len[1] = uip_len & 0xff;
  93. #endif /* UIP_CONF_IPV6 */
  94. /* uip_appdata += len1;*/
  95. memcpy(uip_appdata, (u8_t *)uip_appdata + len1, len2);
  96. uip_add32(BUF->seqno, len1);
  97. BUF->seqno[0] = uip_acc32[0];
  98. BUF->seqno[1] = uip_acc32[1];
  99. BUF->seqno[2] = uip_acc32[2];
  100. BUF->seqno[3] = uip_acc32[3];
  101. /* Recalculate the TCP checksum. */
  102. BUF->tcpchksum = 0;
  103. BUF->tcpchksum = ~(uip_tcpchksum());
  104. #if !UIP_CONF_IPV6
  105. /* Recalculate the IP checksum. */
  106. BUF->ipchksum = 0;
  107. BUF->ipchksum = ~(uip_ipchksum());
  108. #endif /* UIP_CONF_IPV6 */
  109. /* Transmit the second packet. */
  110. /* uip_fw_output();*/
  111. tcpip_output();
  112. } else {
  113. /* uip_fw_output();*/
  114. tcpip_output();
  115. }
  116. }
  117. /*-----------------------------------------------------------------------------*/