sys/lib/libsa/ip_cksum.c

http://www.minix3.org/ · C · 106 lines · 52 code · 8 blank · 46 comment · 12 complexity · 2150bdcc53285bdfb45521f9ac289990 MD5 · raw file

  1. /* $NetBSD: ip_cksum.c,v 1.2 2006/01/25 13:46:09 christos Exp $ */
  2. /*
  3. * Copyright (c) 1992 Regents of the University of California.
  4. * All rights reserved.
  5. *
  6. * This software was developed by the Computer Systems Engineering group
  7. * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
  8. * contributed to Berkeley.
  9. *
  10. * Redistribution and use in source and binary forms, with or without
  11. * modification, are permitted provided that the following conditions
  12. * are met:
  13. * 1. Redistributions of source code must retain the above copyright
  14. * notice, this list of conditions and the following disclaimer.
  15. * 2. Redistributions in binary form must reproduce the above copyright
  16. * notice, this list of conditions and the following disclaimer in the
  17. * documentation and/or other materials provided with the distribution.
  18. * 3. All advertising materials mentioning features or use of this software
  19. * must display the following acknowledgement:
  20. * This product includes software developed by the University of
  21. * California, Lawrence Berkeley Laboratory and its contributors.
  22. * 4. Neither the name of the University nor the names of its contributors
  23. * may be used to endorse or promote products derived from this software
  24. * without specific prior written permission.
  25. *
  26. * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  27. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  28. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  29. * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  30. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  31. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  32. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  33. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  34. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  35. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  36. * SUCH DAMAGE.
  37. *
  38. * @(#) Header: in_cksum.c,v 1.1 92/09/11 01:15:55 leres Exp (LBL)
  39. */
  40. #include <sys/types.h>
  41. #include <sys/socket.h>
  42. #include <net/if.h>
  43. #include <net/if_ether.h>
  44. #include <netinet/in.h>
  45. #include <netinet/in_systm.h>
  46. #include <netinet/ip.h>
  47. #include <netinet/ip_var.h>
  48. #include <netinet/udp.h>
  49. #include <netinet/udp_var.h>
  50. #include <machine/endian.h>
  51. #include "stand.h"
  52. #include "net.h"
  53. /*
  54. * Checksum routine for Internet Protocol family headers.
  55. * This routine is very heavily used in the network
  56. * code and should be modified for each CPU to be as fast as possible.
  57. * In particular, it should not be this one.
  58. */
  59. int
  60. ip_cksum(const void *p, size_t llen)
  61. {
  62. int sum = 0, oddbyte = 0, v = 0, len = (int)llen;
  63. const u_char *cp = p;
  64. /* we assume < 2^16 bytes being summed */
  65. while (len > 0) {
  66. if (oddbyte) {
  67. sum += v + *cp++;
  68. len--;
  69. }
  70. if (((long)cp & 1) == 0) {
  71. while ((len -= 2) >= 0) {
  72. sum += *(const u_short *)cp;
  73. cp += 2;
  74. }
  75. } else {
  76. while ((len -= 2) >= 0) {
  77. #if BYTE_ORDER == BIG_ENDIAN
  78. sum += *cp++ << 8;
  79. sum += *cp++;
  80. #else
  81. sum += *cp++;
  82. sum += *cp++ << 8;
  83. #endif
  84. }
  85. }
  86. if ((oddbyte = len & 1) != 0)
  87. #if BYTE_ORDER == BIG_ENDIAN
  88. v = *cp << 8;
  89. #else
  90. v = *cp;
  91. #endif
  92. }
  93. if (oddbyte)
  94. sum += v;
  95. sum = (sum >> 16) + (sum & 0xffff); /* add in accumulated carries */
  96. sum += sum >> 16; /* add potential last carry */
  97. return (0xffff & ~sum);
  98. }