Adam Green
Web server based weather station using Sparkfun Weather Meters.
Dependencies: FatFileSystem mbed WeatherMeters SDFileSystem
NetStack/lwip/core/ipv4/inet_chksum.c@0:616601bde9fb, 2012-02-23 (annotated)
- Committer:
- AdamGreen
- Date:
- Thu Feb 23 21:38:39 2012 +0000
- Revision:
- 0:616601bde9fb
Who changed what in which revision?
| User | Revision | Line number | New contents of line |
|---|---|---|---|
| AdamGreen | 0:616601bde9fb | 1 | /** |
| AdamGreen | 0:616601bde9fb | 2 | * @file |
| AdamGreen | 0:616601bde9fb | 3 | * Incluse internet checksum functions. |
| AdamGreen | 0:616601bde9fb | 4 | * |
| AdamGreen | 0:616601bde9fb | 5 | */ |
| AdamGreen | 0:616601bde9fb | 6 | |
| AdamGreen | 0:616601bde9fb | 7 | /* |
| AdamGreen | 0:616601bde9fb | 8 | * Copyright (c) 2001-2004 Swedish Institute of Computer Science. |
| AdamGreen | 0:616601bde9fb | 9 | * All rights reserved. |
| AdamGreen | 0:616601bde9fb | 10 | * |
| AdamGreen | 0:616601bde9fb | 11 | * Redistribution and use in source and binary forms, with or without modification, |
| AdamGreen | 0:616601bde9fb | 12 | * are permitted provided that the following conditions are met: |
| AdamGreen | 0:616601bde9fb | 13 | * |
| AdamGreen | 0:616601bde9fb | 14 | * 1. Redistributions of source code must retain the above copyright notice, |
| AdamGreen | 0:616601bde9fb | 15 | * this list of conditions and the following disclaimer. |
| AdamGreen | 0:616601bde9fb | 16 | * 2. Redistributions in binary form must reproduce the above copyright notice, |
| AdamGreen | 0:616601bde9fb | 17 | * this list of conditions and the following disclaimer in the documentation |
| AdamGreen | 0:616601bde9fb | 18 | * and/or other materials provided with the distribution. |
| AdamGreen | 0:616601bde9fb | 19 | * 3. The name of the author may not be used to endorse or promote products |
| AdamGreen | 0:616601bde9fb | 20 | * derived from this software without specific prior written permission. |
| AdamGreen | 0:616601bde9fb | 21 | * |
| AdamGreen | 0:616601bde9fb | 22 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
| AdamGreen | 0:616601bde9fb | 23 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF |
| AdamGreen | 0:616601bde9fb | 24 | * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT |
| AdamGreen | 0:616601bde9fb | 25 | * SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
| AdamGreen | 0:616601bde9fb | 26 | * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT |
| AdamGreen | 0:616601bde9fb | 27 | * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| AdamGreen | 0:616601bde9fb | 28 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| AdamGreen | 0:616601bde9fb | 29 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
| AdamGreen | 0:616601bde9fb | 30 | * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY |
| AdamGreen | 0:616601bde9fb | 31 | * OF SUCH DAMAGE. |
| AdamGreen | 0:616601bde9fb | 32 | * |
| AdamGreen | 0:616601bde9fb | 33 | * This file is part of the lwIP TCP/IP stack. |
| AdamGreen | 0:616601bde9fb | 34 | * |
| AdamGreen | 0:616601bde9fb | 35 | * Author: Adam Dunkels <adam@sics.se> |
| AdamGreen | 0:616601bde9fb | 36 | * |
| AdamGreen | 0:616601bde9fb | 37 | */ |
| AdamGreen | 0:616601bde9fb | 38 | |
| AdamGreen | 0:616601bde9fb | 39 | #include "lwip/opt.h" |
| AdamGreen | 0:616601bde9fb | 40 | |
| AdamGreen | 0:616601bde9fb | 41 | #include "lwip/inet_chksum.h" |
| AdamGreen | 0:616601bde9fb | 42 | #include "lwip/def.h" |
| AdamGreen | 0:616601bde9fb | 43 | |
| AdamGreen | 0:616601bde9fb | 44 | #include <stddef.h> |
| AdamGreen | 0:616601bde9fb | 45 | #include <string.h> |
| AdamGreen | 0:616601bde9fb | 46 | |
| AdamGreen | 0:616601bde9fb | 47 | /* These are some reference implementations of the checksum algorithm, with the |
| AdamGreen | 0:616601bde9fb | 48 | * aim of being simple, correct and fully portable. Checksumming is the |
| AdamGreen | 0:616601bde9fb | 49 | * first thing you would want to optimize for your platform. If you create |
| AdamGreen | 0:616601bde9fb | 50 | * your own version, link it in and in your cc.h put: |
| AdamGreen | 0:616601bde9fb | 51 | * |
| AdamGreen | 0:616601bde9fb | 52 | * #define LWIP_CHKSUM <your_checksum_routine> |
| AdamGreen | 0:616601bde9fb | 53 | * |
| AdamGreen | 0:616601bde9fb | 54 | * Or you can select from the implementations below by defining |
| AdamGreen | 0:616601bde9fb | 55 | * LWIP_CHKSUM_ALGORITHM to 1, 2 or 3. |
| AdamGreen | 0:616601bde9fb | 56 | */ |
| AdamGreen | 0:616601bde9fb | 57 | |
| AdamGreen | 0:616601bde9fb | 58 | #ifndef LWIP_CHKSUM |
| AdamGreen | 0:616601bde9fb | 59 | # define LWIP_CHKSUM lwip_standard_chksum |
| AdamGreen | 0:616601bde9fb | 60 | # ifndef LWIP_CHKSUM_ALGORITHM |
| AdamGreen | 0:616601bde9fb | 61 | # define LWIP_CHKSUM_ALGORITHM 2 |
| AdamGreen | 0:616601bde9fb | 62 | # endif |
| AdamGreen | 0:616601bde9fb | 63 | #endif |
| AdamGreen | 0:616601bde9fb | 64 | /* If none set: */ |
| AdamGreen | 0:616601bde9fb | 65 | #ifndef LWIP_CHKSUM_ALGORITHM |
| AdamGreen | 0:616601bde9fb | 66 | # define LWIP_CHKSUM_ALGORITHM 0 |
| AdamGreen | 0:616601bde9fb | 67 | #endif |
| AdamGreen | 0:616601bde9fb | 68 | |
| AdamGreen | 0:616601bde9fb | 69 | #if (LWIP_CHKSUM_ALGORITHM == 1) /* Version #1 */ |
| AdamGreen | 0:616601bde9fb | 70 | /** |
| AdamGreen | 0:616601bde9fb | 71 | * lwip checksum |
| AdamGreen | 0:616601bde9fb | 72 | * |
| AdamGreen | 0:616601bde9fb | 73 | * @param dataptr points to start of data to be summed at any boundary |
| AdamGreen | 0:616601bde9fb | 74 | * @param len length of data to be summed |
| AdamGreen | 0:616601bde9fb | 75 | * @return host order (!) lwip checksum (non-inverted Internet sum) |
| AdamGreen | 0:616601bde9fb | 76 | * |
| AdamGreen | 0:616601bde9fb | 77 | * @note accumulator size limits summable length to 64k |
| AdamGreen | 0:616601bde9fb | 78 | * @note host endianess is irrelevant (p3 RFC1071) |
| AdamGreen | 0:616601bde9fb | 79 | */ |
| AdamGreen | 0:616601bde9fb | 80 | static u16_t |
| AdamGreen | 0:616601bde9fb | 81 | lwip_standard_chksum(void *dataptr, u16_t len) |
| AdamGreen | 0:616601bde9fb | 82 | { |
| AdamGreen | 0:616601bde9fb | 83 | u32_t acc; |
| AdamGreen | 0:616601bde9fb | 84 | u16_t src; |
| AdamGreen | 0:616601bde9fb | 85 | u8_t *octetptr; |
| AdamGreen | 0:616601bde9fb | 86 | |
| AdamGreen | 0:616601bde9fb | 87 | acc = 0; |
| AdamGreen | 0:616601bde9fb | 88 | /* dataptr may be at odd or even addresses */ |
| AdamGreen | 0:616601bde9fb | 89 | octetptr = (u8_t*)dataptr; |
| AdamGreen | 0:616601bde9fb | 90 | while (len > 1) { |
| AdamGreen | 0:616601bde9fb | 91 | /* declare first octet as most significant |
| AdamGreen | 0:616601bde9fb | 92 | thus assume network order, ignoring host order */ |
| AdamGreen | 0:616601bde9fb | 93 | src = (*octetptr) << 8; |
| AdamGreen | 0:616601bde9fb | 94 | octetptr++; |
| AdamGreen | 0:616601bde9fb | 95 | /* declare second octet as least significant */ |
| AdamGreen | 0:616601bde9fb | 96 | src |= (*octetptr); |
| AdamGreen | 0:616601bde9fb | 97 | octetptr++; |
| AdamGreen | 0:616601bde9fb | 98 | acc += src; |
| AdamGreen | 0:616601bde9fb | 99 | len -= 2; |
| AdamGreen | 0:616601bde9fb | 100 | } |
| AdamGreen | 0:616601bde9fb | 101 | if (len > 0) { |
| AdamGreen | 0:616601bde9fb | 102 | /* accumulate remaining octet */ |
| AdamGreen | 0:616601bde9fb | 103 | src = (*octetptr) << 8; |
| AdamGreen | 0:616601bde9fb | 104 | acc += src; |
| AdamGreen | 0:616601bde9fb | 105 | } |
| AdamGreen | 0:616601bde9fb | 106 | /* add deferred carry bits */ |
| AdamGreen | 0:616601bde9fb | 107 | acc = (acc >> 16) + (acc & 0x0000ffffUL); |
| AdamGreen | 0:616601bde9fb | 108 | if ((acc & 0xffff0000UL) != 0) { |
| AdamGreen | 0:616601bde9fb | 109 | acc = (acc >> 16) + (acc & 0x0000ffffUL); |
| AdamGreen | 0:616601bde9fb | 110 | } |
| AdamGreen | 0:616601bde9fb | 111 | /* This maybe a little confusing: reorder sum using htons() |
| AdamGreen | 0:616601bde9fb | 112 | instead of ntohs() since it has a little less call overhead. |
| AdamGreen | 0:616601bde9fb | 113 | The caller must invert bits for Internet sum ! */ |
| AdamGreen | 0:616601bde9fb | 114 | return htons((u16_t)acc); |
| AdamGreen | 0:616601bde9fb | 115 | } |
| AdamGreen | 0:616601bde9fb | 116 | #endif |
| AdamGreen | 0:616601bde9fb | 117 | |
| AdamGreen | 0:616601bde9fb | 118 | #if (LWIP_CHKSUM_ALGORITHM == 2) /* Alternative version #2 */ |
| AdamGreen | 0:616601bde9fb | 119 | /* |
| AdamGreen | 0:616601bde9fb | 120 | * Curt McDowell |
| AdamGreen | 0:616601bde9fb | 121 | * Broadcom Corp. |
| AdamGreen | 0:616601bde9fb | 122 | * csm@broadcom.com |
| AdamGreen | 0:616601bde9fb | 123 | * |
| AdamGreen | 0:616601bde9fb | 124 | * IP checksum two bytes at a time with support for |
| AdamGreen | 0:616601bde9fb | 125 | * unaligned buffer. |
| AdamGreen | 0:616601bde9fb | 126 | * Works for len up to and including 0x20000. |
| AdamGreen | 0:616601bde9fb | 127 | * by Curt McDowell, Broadcom Corp. 12/08/2005 |
| AdamGreen | 0:616601bde9fb | 128 | * |
| AdamGreen | 0:616601bde9fb | 129 | * @param dataptr points to start of data to be summed at any boundary |
| AdamGreen | 0:616601bde9fb | 130 | * @param len length of data to be summed |
| AdamGreen | 0:616601bde9fb | 131 | * @return host order (!) lwip checksum (non-inverted Internet sum) |
| AdamGreen | 0:616601bde9fb | 132 | */ |
| AdamGreen | 0:616601bde9fb | 133 | |
| AdamGreen | 0:616601bde9fb | 134 | static u16_t |
| AdamGreen | 0:616601bde9fb | 135 | lwip_standard_chksum(void *dataptr, int len) |
| AdamGreen | 0:616601bde9fb | 136 | { |
| AdamGreen | 0:616601bde9fb | 137 | u8_t *pb = (u8_t *)dataptr; |
| AdamGreen | 0:616601bde9fb | 138 | u16_t *ps, t = 0; |
| AdamGreen | 0:616601bde9fb | 139 | u32_t sum = 0; |
| AdamGreen | 0:616601bde9fb | 140 | int odd = ((mem_ptr_t)pb & 1); |
| AdamGreen | 0:616601bde9fb | 141 | |
| AdamGreen | 0:616601bde9fb | 142 | /* Get aligned to u16_t */ |
| AdamGreen | 0:616601bde9fb | 143 | if (odd && len > 0) { |
| AdamGreen | 0:616601bde9fb | 144 | ((u8_t *)&t)[1] = *pb++; |
| AdamGreen | 0:616601bde9fb | 145 | len--; |
| AdamGreen | 0:616601bde9fb | 146 | } |
| AdamGreen | 0:616601bde9fb | 147 | |
| AdamGreen | 0:616601bde9fb | 148 | /* Add the bulk of the data */ |
| AdamGreen | 0:616601bde9fb | 149 | ps = (u16_t *)(void *)pb; |
| AdamGreen | 0:616601bde9fb | 150 | while (len > 1) { |
| AdamGreen | 0:616601bde9fb | 151 | sum += *ps++; |
| AdamGreen | 0:616601bde9fb | 152 | len -= 2; |
| AdamGreen | 0:616601bde9fb | 153 | } |
| AdamGreen | 0:616601bde9fb | 154 | |
| AdamGreen | 0:616601bde9fb | 155 | /* Consume left-over byte, if any */ |
| AdamGreen | 0:616601bde9fb | 156 | if (len > 0) { |
| AdamGreen | 0:616601bde9fb | 157 | ((u8_t *)&t)[0] = *(u8_t *)ps; |
| AdamGreen | 0:616601bde9fb | 158 | } |
| AdamGreen | 0:616601bde9fb | 159 | |
| AdamGreen | 0:616601bde9fb | 160 | /* Add end bytes */ |
| AdamGreen | 0:616601bde9fb | 161 | sum += t; |
| AdamGreen | 0:616601bde9fb | 162 | |
| AdamGreen | 0:616601bde9fb | 163 | /* Fold 32-bit sum to 16 bits |
| AdamGreen | 0:616601bde9fb | 164 | calling this twice is propably faster than if statements... */ |
| AdamGreen | 0:616601bde9fb | 165 | sum = FOLD_U32T(sum); |
| AdamGreen | 0:616601bde9fb | 166 | sum = FOLD_U32T(sum); |
| AdamGreen | 0:616601bde9fb | 167 | |
| AdamGreen | 0:616601bde9fb | 168 | /* Swap if alignment was odd */ |
| AdamGreen | 0:616601bde9fb | 169 | if (odd) { |
| AdamGreen | 0:616601bde9fb | 170 | sum = SWAP_BYTES_IN_WORD(sum); |
| AdamGreen | 0:616601bde9fb | 171 | } |
| AdamGreen | 0:616601bde9fb | 172 | |
| AdamGreen | 0:616601bde9fb | 173 | return (u16_t)sum; |
| AdamGreen | 0:616601bde9fb | 174 | } |
| AdamGreen | 0:616601bde9fb | 175 | #endif |
| AdamGreen | 0:616601bde9fb | 176 | |
| AdamGreen | 0:616601bde9fb | 177 | #if (LWIP_CHKSUM_ALGORITHM == 3) /* Alternative version #3 */ |
| AdamGreen | 0:616601bde9fb | 178 | /** |
| AdamGreen | 0:616601bde9fb | 179 | * An optimized checksum routine. Basically, it uses loop-unrolling on |
| AdamGreen | 0:616601bde9fb | 180 | * the checksum loop, treating the head and tail bytes specially, whereas |
| AdamGreen | 0:616601bde9fb | 181 | * the inner loop acts on 8 bytes at a time. |
| AdamGreen | 0:616601bde9fb | 182 | * |
| AdamGreen | 0:616601bde9fb | 183 | * @arg start of buffer to be checksummed. May be an odd byte address. |
| AdamGreen | 0:616601bde9fb | 184 | * @len number of bytes in the buffer to be checksummed. |
| AdamGreen | 0:616601bde9fb | 185 | * @return host order (!) lwip checksum (non-inverted Internet sum) |
| AdamGreen | 0:616601bde9fb | 186 | * |
| AdamGreen | 0:616601bde9fb | 187 | * by Curt McDowell, Broadcom Corp. December 8th, 2005 |
| AdamGreen | 0:616601bde9fb | 188 | */ |
| AdamGreen | 0:616601bde9fb | 189 | |
| AdamGreen | 0:616601bde9fb | 190 | static u16_t |
| AdamGreen | 0:616601bde9fb | 191 | lwip_standard_chksum(void *dataptr, int len) |
| AdamGreen | 0:616601bde9fb | 192 | { |
| AdamGreen | 0:616601bde9fb | 193 | u8_t *pb = (u8_t *)dataptr; |
| AdamGreen | 0:616601bde9fb | 194 | u16_t *ps, t = 0; |
| AdamGreen | 0:616601bde9fb | 195 | u32_t *pl; |
| AdamGreen | 0:616601bde9fb | 196 | u32_t sum = 0, tmp; |
| AdamGreen | 0:616601bde9fb | 197 | /* starts at odd byte address? */ |
| AdamGreen | 0:616601bde9fb | 198 | int odd = ((mem_ptr_t)pb & 1); |
| AdamGreen | 0:616601bde9fb | 199 | |
| AdamGreen | 0:616601bde9fb | 200 | if (odd && len > 0) { |
| AdamGreen | 0:616601bde9fb | 201 | ((u8_t *)&t)[1] = *pb++; |
| AdamGreen | 0:616601bde9fb | 202 | len--; |
| AdamGreen | 0:616601bde9fb | 203 | } |
| AdamGreen | 0:616601bde9fb | 204 | |
| AdamGreen | 0:616601bde9fb | 205 | ps = (u16_t *)pb; |
| AdamGreen | 0:616601bde9fb | 206 | |
| AdamGreen | 0:616601bde9fb | 207 | if (((mem_ptr_t)ps & 3) && len > 1) { |
| AdamGreen | 0:616601bde9fb | 208 | sum += *ps++; |
| AdamGreen | 0:616601bde9fb | 209 | len -= 2; |
| AdamGreen | 0:616601bde9fb | 210 | } |
| AdamGreen | 0:616601bde9fb | 211 | |
| AdamGreen | 0:616601bde9fb | 212 | pl = (u32_t *)ps; |
| AdamGreen | 0:616601bde9fb | 213 | |
| AdamGreen | 0:616601bde9fb | 214 | while (len > 7) { |
| AdamGreen | 0:616601bde9fb | 215 | tmp = sum + *pl++; /* ping */ |
| AdamGreen | 0:616601bde9fb | 216 | if (tmp < sum) { |
| AdamGreen | 0:616601bde9fb | 217 | tmp++; /* add back carry */ |
| AdamGreen | 0:616601bde9fb | 218 | } |
| AdamGreen | 0:616601bde9fb | 219 | |
| AdamGreen | 0:616601bde9fb | 220 | sum = tmp + *pl++; /* pong */ |
| AdamGreen | 0:616601bde9fb | 221 | if (sum < tmp) { |
| AdamGreen | 0:616601bde9fb | 222 | sum++; /* add back carry */ |
| AdamGreen | 0:616601bde9fb | 223 | } |
| AdamGreen | 0:616601bde9fb | 224 | |
| AdamGreen | 0:616601bde9fb | 225 | len -= 8; |
| AdamGreen | 0:616601bde9fb | 226 | } |
| AdamGreen | 0:616601bde9fb | 227 | |
| AdamGreen | 0:616601bde9fb | 228 | /* make room in upper bits */ |
| AdamGreen | 0:616601bde9fb | 229 | sum = FOLD_U32T(sum); |
| AdamGreen | 0:616601bde9fb | 230 | |
| AdamGreen | 0:616601bde9fb | 231 | ps = (u16_t *)pl; |
| AdamGreen | 0:616601bde9fb | 232 | |
| AdamGreen | 0:616601bde9fb | 233 | /* 16-bit aligned word remaining? */ |
| AdamGreen | 0:616601bde9fb | 234 | while (len > 1) { |
| AdamGreen | 0:616601bde9fb | 235 | sum += *ps++; |
| AdamGreen | 0:616601bde9fb | 236 | len -= 2; |
| AdamGreen | 0:616601bde9fb | 237 | } |
| AdamGreen | 0:616601bde9fb | 238 | |
| AdamGreen | 0:616601bde9fb | 239 | /* dangling tail byte remaining? */ |
| AdamGreen | 0:616601bde9fb | 240 | if (len > 0) { /* include odd byte */ |
| AdamGreen | 0:616601bde9fb | 241 | ((u8_t *)&t)[0] = *(u8_t *)ps; |
| AdamGreen | 0:616601bde9fb | 242 | } |
| AdamGreen | 0:616601bde9fb | 243 | |
| AdamGreen | 0:616601bde9fb | 244 | sum += t; /* add end bytes */ |
| AdamGreen | 0:616601bde9fb | 245 | |
| AdamGreen | 0:616601bde9fb | 246 | /* Fold 32-bit sum to 16 bits |
| AdamGreen | 0:616601bde9fb | 247 | calling this twice is propably faster than if statements... */ |
| AdamGreen | 0:616601bde9fb | 248 | sum = FOLD_U32T(sum); |
| AdamGreen | 0:616601bde9fb | 249 | sum = FOLD_U32T(sum); |
| AdamGreen | 0:616601bde9fb | 250 | |
| AdamGreen | 0:616601bde9fb | 251 | if (odd) { |
| AdamGreen | 0:616601bde9fb | 252 | sum = SWAP_BYTES_IN_WORD(sum); |
| AdamGreen | 0:616601bde9fb | 253 | } |
| AdamGreen | 0:616601bde9fb | 254 | |
| AdamGreen | 0:616601bde9fb | 255 | return (u16_t)sum; |
| AdamGreen | 0:616601bde9fb | 256 | } |
| AdamGreen | 0:616601bde9fb | 257 | #endif |
| AdamGreen | 0:616601bde9fb | 258 | |
| AdamGreen | 0:616601bde9fb | 259 | /* inet_chksum_pseudo: |
| AdamGreen | 0:616601bde9fb | 260 | * |
| AdamGreen | 0:616601bde9fb | 261 | * Calculates the pseudo Internet checksum used by TCP and UDP for a pbuf chain. |
| AdamGreen | 0:616601bde9fb | 262 | * IP addresses are expected to be in network byte order. |
| AdamGreen | 0:616601bde9fb | 263 | * |
| AdamGreen | 0:616601bde9fb | 264 | * @param p chain of pbufs over that a checksum should be calculated (ip data part) |
| AdamGreen | 0:616601bde9fb | 265 | * @param src source ip address (used for checksum of pseudo header) |
| AdamGreen | 0:616601bde9fb | 266 | * @param dst destination ip address (used for checksum of pseudo header) |
| AdamGreen | 0:616601bde9fb | 267 | * @param proto ip protocol (used for checksum of pseudo header) |
| AdamGreen | 0:616601bde9fb | 268 | * @param proto_len length of the ip data part (used for checksum of pseudo header) |
| AdamGreen | 0:616601bde9fb | 269 | * @return checksum (as u16_t) to be saved directly in the protocol header |
| AdamGreen | 0:616601bde9fb | 270 | */ |
| AdamGreen | 0:616601bde9fb | 271 | u16_t |
| AdamGreen | 0:616601bde9fb | 272 | inet_chksum_pseudo(struct pbuf *p, |
| AdamGreen | 0:616601bde9fb | 273 | ip_addr_t *src, ip_addr_t *dest, |
| AdamGreen | 0:616601bde9fb | 274 | u8_t proto, u16_t proto_len) |
| AdamGreen | 0:616601bde9fb | 275 | { |
| AdamGreen | 0:616601bde9fb | 276 | u32_t acc; |
| AdamGreen | 0:616601bde9fb | 277 | u32_t addr; |
| AdamGreen | 0:616601bde9fb | 278 | struct pbuf *q; |
| AdamGreen | 0:616601bde9fb | 279 | u8_t swapped; |
| AdamGreen | 0:616601bde9fb | 280 | |
| AdamGreen | 0:616601bde9fb | 281 | acc = 0; |
| AdamGreen | 0:616601bde9fb | 282 | swapped = 0; |
| AdamGreen | 0:616601bde9fb | 283 | /* iterate through all pbuf in chain */ |
| AdamGreen | 0:616601bde9fb | 284 | for(q = p; q != NULL; q = q->next) { |
| AdamGreen | 0:616601bde9fb | 285 | LWIP_DEBUGF(INET_DEBUG, ("inet_chksum_pseudo(): checksumming pbuf %p (has next %p) \n", |
| AdamGreen | 0:616601bde9fb | 286 | (void *)q, (void *)q->next)); |
| AdamGreen | 0:616601bde9fb | 287 | acc += LWIP_CHKSUM(q->payload, q->len); |
| AdamGreen | 0:616601bde9fb | 288 | /*LWIP_DEBUGF(INET_DEBUG, ("inet_chksum_pseudo(): unwrapped lwip_chksum()=%"X32_F" \n", acc));*/ |
| AdamGreen | 0:616601bde9fb | 289 | /* just executing this next line is probably faster that the if statement needed |
| AdamGreen | 0:616601bde9fb | 290 | to check whether we really need to execute it, and does no harm */ |
| AdamGreen | 0:616601bde9fb | 291 | acc = FOLD_U32T(acc); |
| AdamGreen | 0:616601bde9fb | 292 | if (q->len % 2 != 0) { |
| AdamGreen | 0:616601bde9fb | 293 | swapped = 1 - swapped; |
| AdamGreen | 0:616601bde9fb | 294 | acc = SWAP_BYTES_IN_WORD(acc); |
| AdamGreen | 0:616601bde9fb | 295 | } |
| AdamGreen | 0:616601bde9fb | 296 | /*LWIP_DEBUGF(INET_DEBUG, ("inet_chksum_pseudo(): wrapped lwip_chksum()=%"X32_F" \n", acc));*/ |
| AdamGreen | 0:616601bde9fb | 297 | } |
| AdamGreen | 0:616601bde9fb | 298 | |
| AdamGreen | 0:616601bde9fb | 299 | if (swapped) { |
| AdamGreen | 0:616601bde9fb | 300 | acc = SWAP_BYTES_IN_WORD(acc); |
| AdamGreen | 0:616601bde9fb | 301 | } |
| AdamGreen | 0:616601bde9fb | 302 | addr = ip4_addr_get_u32(src); |
| AdamGreen | 0:616601bde9fb | 303 | acc += (addr & 0xffffUL); |
| AdamGreen | 0:616601bde9fb | 304 | acc += ((addr >> 16) & 0xffffUL); |
| AdamGreen | 0:616601bde9fb | 305 | addr = ip4_addr_get_u32(dest); |
| AdamGreen | 0:616601bde9fb | 306 | acc += (addr & 0xffffUL); |
| AdamGreen | 0:616601bde9fb | 307 | acc += ((addr >> 16) & 0xffffUL); |
| AdamGreen | 0:616601bde9fb | 308 | acc += (u32_t)htons((u16_t)proto); |
| AdamGreen | 0:616601bde9fb | 309 | acc += (u32_t)htons(proto_len); |
| AdamGreen | 0:616601bde9fb | 310 | |
| AdamGreen | 0:616601bde9fb | 311 | /* Fold 32-bit sum to 16 bits |
| AdamGreen | 0:616601bde9fb | 312 | calling this twice is propably faster than if statements... */ |
| AdamGreen | 0:616601bde9fb | 313 | acc = FOLD_U32T(acc); |
| AdamGreen | 0:616601bde9fb | 314 | acc = FOLD_U32T(acc); |
| AdamGreen | 0:616601bde9fb | 315 | LWIP_DEBUGF(INET_DEBUG, ("inet_chksum_pseudo(): pbuf chain lwip_chksum()=%"X32_F"\n", acc)); |
| AdamGreen | 0:616601bde9fb | 316 | return (u16_t)~(acc & 0xffffUL); |
| AdamGreen | 0:616601bde9fb | 317 | } |
| AdamGreen | 0:616601bde9fb | 318 | |
| AdamGreen | 0:616601bde9fb | 319 | /* inet_chksum_pseudo: |
| AdamGreen | 0:616601bde9fb | 320 | * |
| AdamGreen | 0:616601bde9fb | 321 | * Calculates the pseudo Internet checksum used by TCP and UDP for a pbuf chain. |
| AdamGreen | 0:616601bde9fb | 322 | * IP addresses are expected to be in network byte order. |
| AdamGreen | 0:616601bde9fb | 323 | * |
| AdamGreen | 0:616601bde9fb | 324 | * @param p chain of pbufs over that a checksum should be calculated (ip data part) |
| AdamGreen | 0:616601bde9fb | 325 | * @param src source ip address (used for checksum of pseudo header) |
| AdamGreen | 0:616601bde9fb | 326 | * @param dst destination ip address (used for checksum of pseudo header) |
| AdamGreen | 0:616601bde9fb | 327 | * @param proto ip protocol (used for checksum of pseudo header) |
| AdamGreen | 0:616601bde9fb | 328 | * @param proto_len length of the ip data part (used for checksum of pseudo header) |
| AdamGreen | 0:616601bde9fb | 329 | * @return checksum (as u16_t) to be saved directly in the protocol header |
| AdamGreen | 0:616601bde9fb | 330 | */ |
| AdamGreen | 0:616601bde9fb | 331 | u16_t |
| AdamGreen | 0:616601bde9fb | 332 | inet_chksum_pseudo_partial(struct pbuf *p, |
| AdamGreen | 0:616601bde9fb | 333 | ip_addr_t *src, ip_addr_t *dest, |
| AdamGreen | 0:616601bde9fb | 334 | u8_t proto, u16_t proto_len, u16_t chksum_len) |
| AdamGreen | 0:616601bde9fb | 335 | { |
| AdamGreen | 0:616601bde9fb | 336 | u32_t acc; |
| AdamGreen | 0:616601bde9fb | 337 | u32_t addr; |
| AdamGreen | 0:616601bde9fb | 338 | struct pbuf *q; |
| AdamGreen | 0:616601bde9fb | 339 | u8_t swapped; |
| AdamGreen | 0:616601bde9fb | 340 | u16_t chklen; |
| AdamGreen | 0:616601bde9fb | 341 | |
| AdamGreen | 0:616601bde9fb | 342 | acc = 0; |
| AdamGreen | 0:616601bde9fb | 343 | swapped = 0; |
| AdamGreen | 0:616601bde9fb | 344 | /* iterate through all pbuf in chain */ |
| AdamGreen | 0:616601bde9fb | 345 | for(q = p; (q != NULL) && (chksum_len > 0); q = q->next) { |
| AdamGreen | 0:616601bde9fb | 346 | LWIP_DEBUGF(INET_DEBUG, ("inet_chksum_pseudo(): checksumming pbuf %p (has next %p) \n", |
| AdamGreen | 0:616601bde9fb | 347 | (void *)q, (void *)q->next)); |
| AdamGreen | 0:616601bde9fb | 348 | chklen = q->len; |
| AdamGreen | 0:616601bde9fb | 349 | if (chklen > chksum_len) { |
| AdamGreen | 0:616601bde9fb | 350 | chklen = chksum_len; |
| AdamGreen | 0:616601bde9fb | 351 | } |
| AdamGreen | 0:616601bde9fb | 352 | acc += LWIP_CHKSUM(q->payload, chklen); |
| AdamGreen | 0:616601bde9fb | 353 | chksum_len -= chklen; |
| AdamGreen | 0:616601bde9fb | 354 | LWIP_ASSERT("delete me", chksum_len < 0x7fff); |
| AdamGreen | 0:616601bde9fb | 355 | /*LWIP_DEBUGF(INET_DEBUG, ("inet_chksum_pseudo(): unwrapped lwip_chksum()=%"X32_F" \n", acc));*/ |
| AdamGreen | 0:616601bde9fb | 356 | /* fold the upper bit down */ |
| AdamGreen | 0:616601bde9fb | 357 | acc = FOLD_U32T(acc); |
| AdamGreen | 0:616601bde9fb | 358 | if (q->len % 2 != 0) { |
| AdamGreen | 0:616601bde9fb | 359 | swapped = 1 - swapped; |
| AdamGreen | 0:616601bde9fb | 360 | acc = SWAP_BYTES_IN_WORD(acc); |
| AdamGreen | 0:616601bde9fb | 361 | } |
| AdamGreen | 0:616601bde9fb | 362 | /*LWIP_DEBUGF(INET_DEBUG, ("inet_chksum_pseudo(): wrapped lwip_chksum()=%"X32_F" \n", acc));*/ |
| AdamGreen | 0:616601bde9fb | 363 | } |
| AdamGreen | 0:616601bde9fb | 364 | |
| AdamGreen | 0:616601bde9fb | 365 | if (swapped) { |
| AdamGreen | 0:616601bde9fb | 366 | acc = SWAP_BYTES_IN_WORD(acc); |
| AdamGreen | 0:616601bde9fb | 367 | } |
| AdamGreen | 0:616601bde9fb | 368 | addr = ip4_addr_get_u32(src); |
| AdamGreen | 0:616601bde9fb | 369 | acc += (addr & 0xffffUL); |
| AdamGreen | 0:616601bde9fb | 370 | acc += ((addr >> 16) & 0xffffUL); |
| AdamGreen | 0:616601bde9fb | 371 | addr = ip4_addr_get_u32(dest); |
| AdamGreen | 0:616601bde9fb | 372 | acc += (addr & 0xffffUL); |
| AdamGreen | 0:616601bde9fb | 373 | acc += ((addr >> 16) & 0xffffUL); |
| AdamGreen | 0:616601bde9fb | 374 | acc += (u32_t)htons((u16_t)proto); |
| AdamGreen | 0:616601bde9fb | 375 | acc += (u32_t)htons(proto_len); |
| AdamGreen | 0:616601bde9fb | 376 | |
| AdamGreen | 0:616601bde9fb | 377 | /* Fold 32-bit sum to 16 bits |
| AdamGreen | 0:616601bde9fb | 378 | calling this twice is propably faster than if statements... */ |
| AdamGreen | 0:616601bde9fb | 379 | acc = FOLD_U32T(acc); |
| AdamGreen | 0:616601bde9fb | 380 | acc = FOLD_U32T(acc); |
| AdamGreen | 0:616601bde9fb | 381 | LWIP_DEBUGF(INET_DEBUG, ("inet_chksum_pseudo(): pbuf chain lwip_chksum()=%"X32_F"\n", acc)); |
| AdamGreen | 0:616601bde9fb | 382 | return (u16_t)~(acc & 0xffffUL); |
| AdamGreen | 0:616601bde9fb | 383 | } |
| AdamGreen | 0:616601bde9fb | 384 | |
| AdamGreen | 0:616601bde9fb | 385 | /* inet_chksum: |
| AdamGreen | 0:616601bde9fb | 386 | * |
| AdamGreen | 0:616601bde9fb | 387 | * Calculates the Internet checksum over a portion of memory. Used primarily for IP |
| AdamGreen | 0:616601bde9fb | 388 | * and ICMP. |
| AdamGreen | 0:616601bde9fb | 389 | * |
| AdamGreen | 0:616601bde9fb | 390 | * @param dataptr start of the buffer to calculate the checksum (no alignment needed) |
| AdamGreen | 0:616601bde9fb | 391 | * @param len length of the buffer to calculate the checksum |
| AdamGreen | 0:616601bde9fb | 392 | * @return checksum (as u16_t) to be saved directly in the protocol header |
| AdamGreen | 0:616601bde9fb | 393 | */ |
| AdamGreen | 0:616601bde9fb | 394 | |
| AdamGreen | 0:616601bde9fb | 395 | u16_t |
| AdamGreen | 0:616601bde9fb | 396 | inet_chksum(void *dataptr, u16_t len) |
| AdamGreen | 0:616601bde9fb | 397 | { |
| AdamGreen | 0:616601bde9fb | 398 | return ~LWIP_CHKSUM(dataptr, len); |
| AdamGreen | 0:616601bde9fb | 399 | } |
| AdamGreen | 0:616601bde9fb | 400 | |
| AdamGreen | 0:616601bde9fb | 401 | /** |
| AdamGreen | 0:616601bde9fb | 402 | * Calculate a checksum over a chain of pbufs (without pseudo-header, much like |
| AdamGreen | 0:616601bde9fb | 403 | * inet_chksum only pbufs are used). |
| AdamGreen | 0:616601bde9fb | 404 | * |
| AdamGreen | 0:616601bde9fb | 405 | * @param p pbuf chain over that the checksum should be calculated |
| AdamGreen | 0:616601bde9fb | 406 | * @return checksum (as u16_t) to be saved directly in the protocol header |
| AdamGreen | 0:616601bde9fb | 407 | */ |
| AdamGreen | 0:616601bde9fb | 408 | u16_t |
| AdamGreen | 0:616601bde9fb | 409 | inet_chksum_pbuf(struct pbuf *p) |
| AdamGreen | 0:616601bde9fb | 410 | { |
| AdamGreen | 0:616601bde9fb | 411 | u32_t acc; |
| AdamGreen | 0:616601bde9fb | 412 | struct pbuf *q; |
| AdamGreen | 0:616601bde9fb | 413 | u8_t swapped; |
| AdamGreen | 0:616601bde9fb | 414 | |
| AdamGreen | 0:616601bde9fb | 415 | acc = 0; |
| AdamGreen | 0:616601bde9fb | 416 | swapped = 0; |
| AdamGreen | 0:616601bde9fb | 417 | for(q = p; q != NULL; q = q->next) { |
| AdamGreen | 0:616601bde9fb | 418 | acc += LWIP_CHKSUM(q->payload, q->len); |
| AdamGreen | 0:616601bde9fb | 419 | acc = FOLD_U32T(acc); |
| AdamGreen | 0:616601bde9fb | 420 | if (q->len % 2 != 0) { |
| AdamGreen | 0:616601bde9fb | 421 | swapped = 1 - swapped; |
| AdamGreen | 0:616601bde9fb | 422 | acc = SWAP_BYTES_IN_WORD(acc); |
| AdamGreen | 0:616601bde9fb | 423 | } |
| AdamGreen | 0:616601bde9fb | 424 | } |
| AdamGreen | 0:616601bde9fb | 425 | |
| AdamGreen | 0:616601bde9fb | 426 | if (swapped) { |
| AdamGreen | 0:616601bde9fb | 427 | acc = SWAP_BYTES_IN_WORD(acc); |
| AdamGreen | 0:616601bde9fb | 428 | } |
| AdamGreen | 0:616601bde9fb | 429 | return (u16_t)~(acc & 0xffffUL); |
| AdamGreen | 0:616601bde9fb | 430 | } |
| AdamGreen | 0:616601bde9fb | 431 | |
| AdamGreen | 0:616601bde9fb | 432 | /* These are some implementations for LWIP_CHKSUM_COPY, which copies data |
| AdamGreen | 0:616601bde9fb | 433 | * like MEMCPY but generates a checksum at the same time. Since this is a |
| AdamGreen | 0:616601bde9fb | 434 | * performance-sensitive function, you might want to create your own version |
| AdamGreen | 0:616601bde9fb | 435 | * in assembly targeted at your hardware by defining it in lwipopts.h: |
| AdamGreen | 0:616601bde9fb | 436 | * #define LWIP_CHKSUM_COPY(dst, src, len) your_chksum_copy(dst, src, len) |
| AdamGreen | 0:616601bde9fb | 437 | */ |
| AdamGreen | 0:616601bde9fb | 438 | |
| AdamGreen | 0:616601bde9fb | 439 | #if (LWIP_CHKSUM_COPY_ALGORITHM == 1) /* Version #1 */ |
| AdamGreen | 0:616601bde9fb | 440 | /** Safe but slow: first call MEMCPY, then call LWIP_CHKSUM. |
| AdamGreen | 0:616601bde9fb | 441 | * For architectures with big caches, data might still be in cache when |
| AdamGreen | 0:616601bde9fb | 442 | * generating the checksum after copying. |
| AdamGreen | 0:616601bde9fb | 443 | */ |
| AdamGreen | 0:616601bde9fb | 444 | u16_t |
| AdamGreen | 0:616601bde9fb | 445 | lwip_chksum_copy(void *dst, const void *src, u16_t len) |
| AdamGreen | 0:616601bde9fb | 446 | { |
| AdamGreen | 0:616601bde9fb | 447 | MEMCPY(dst, src, len); |
| AdamGreen | 0:616601bde9fb | 448 | return LWIP_CHKSUM(dst, len); |
| AdamGreen | 0:616601bde9fb | 449 | } |
| AdamGreen | 0:616601bde9fb | 450 | #endif /* (LWIP_CHKSUM_COPY_ALGORITHM == 1) */ |