CK Sin / Mbed 2 deprecated Ethernetwebsocket

Ethernetwebsoc

Dependencies:   C12832_lcd LM75B WebSocketClient mbed-rtos mbed Socket lwip-eth lwip-sys lwip

EthernetInterface/lwip/core/ipv4/inet_chksum.c@0:0ed2a7c7190c, 2013-05-31 (annotated)

Committer:
GordonSin
Date:
Fri May 31 04:09:54 2013 +0000
Revision:
0:0ed2a7c7190c
31/5/2013;

Who changed what in which revision?

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