Adam Green / EthernetInterface

Deprecated fork of old network stack source from github. Please use official library instead: https://mbed.org/users/mbed_official/code/EthernetInterface/

lwip/core/memp.c@1:eadc868c2acf, 2013-10-26 (annotated)

Committer:
AdamGreen
Date:
Sat Oct 26 08:51:36 2013 +0000
Revision:
1:eadc868c2acf
Parent:
0:3b00827bb0b7 
Fix TCP checksum bug and stranded large TCP segments.

Who changed what in which revision?

UserRevisionLine numberNew contents of line
AdamGreen 0:3b00827bb0b7 1 /**
AdamGreen 0:3b00827bb0b7 2 * @file
AdamGreen 0:3b00827bb0b7 3 * Dynamic pool memory manager
AdamGreen 0:3b00827bb0b7 4 *
AdamGreen 0:3b00827bb0b7 5 * lwIP has dedicated pools for many structures (netconn, protocol control blocks,
AdamGreen 0:3b00827bb0b7 6 * packet buffers, ...). All these pools are managed here.
AdamGreen 0:3b00827bb0b7 7 */
AdamGreen 0:3b00827bb0b7 8
AdamGreen 0:3b00827bb0b7 9 /*
AdamGreen 0:3b00827bb0b7 10 * Copyright (c) 2001-2004 Swedish Institute of Computer Science.
AdamGreen 0:3b00827bb0b7 11 * All rights reserved.
AdamGreen 0:3b00827bb0b7 12 *
AdamGreen 0:3b00827bb0b7 13 * Redistribution and use in source and binary forms, with or without modification,
AdamGreen 0:3b00827bb0b7 14 * are permitted provided that the following conditions are met:
AdamGreen 0:3b00827bb0b7 15 *
AdamGreen 0:3b00827bb0b7 16 * 1. Redistributions of source code must retain the above copyright notice,
AdamGreen 0:3b00827bb0b7 17 * this list of conditions and the following disclaimer.
AdamGreen 0:3b00827bb0b7 18 * 2. Redistributions in binary form must reproduce the above copyright notice,
AdamGreen 0:3b00827bb0b7 19 * this list of conditions and the following disclaimer in the documentation
AdamGreen 0:3b00827bb0b7 20 * and/or other materials provided with the distribution.
AdamGreen 0:3b00827bb0b7 21 * 3. The name of the author may not be used to endorse or promote products
AdamGreen 0:3b00827bb0b7 22 * derived from this software without specific prior written permission.
AdamGreen 0:3b00827bb0b7 23 *
AdamGreen 0:3b00827bb0b7 24 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
AdamGreen 0:3b00827bb0b7 25 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
AdamGreen 0:3b00827bb0b7 26 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
AdamGreen 0:3b00827bb0b7 27 * SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
AdamGreen 0:3b00827bb0b7 28 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
AdamGreen 0:3b00827bb0b7 29 * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
AdamGreen 0:3b00827bb0b7 30 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
AdamGreen 0:3b00827bb0b7 31 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
AdamGreen 0:3b00827bb0b7 32 * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
AdamGreen 0:3b00827bb0b7 33 * OF SUCH DAMAGE.
AdamGreen 0:3b00827bb0b7 34 *
AdamGreen 0:3b00827bb0b7 35 * This file is part of the lwIP TCP/IP stack.
AdamGreen 0:3b00827bb0b7 36 *
AdamGreen 0:3b00827bb0b7 37 * Author: Adam Dunkels <adam@sics.se>
AdamGreen 0:3b00827bb0b7 38 *
AdamGreen 0:3b00827bb0b7 39 */
AdamGreen 0:3b00827bb0b7 40
AdamGreen 0:3b00827bb0b7 41 #include "lwip/opt.h"
AdamGreen 0:3b00827bb0b7 42
AdamGreen 0:3b00827bb0b7 43 #include "lwip/memp.h"
AdamGreen 0:3b00827bb0b7 44 #include "lwip/pbuf.h"
AdamGreen 0:3b00827bb0b7 45 #include "lwip/udp.h"
AdamGreen 0:3b00827bb0b7 46 #include "lwip/raw.h"
AdamGreen 0:3b00827bb0b7 47 #include "lwip/tcp_impl.h"
AdamGreen 0:3b00827bb0b7 48 #include "lwip/igmp.h"
AdamGreen 0:3b00827bb0b7 49 #include "lwip/api.h"
AdamGreen 0:3b00827bb0b7 50 #include "lwip/api_msg.h"
AdamGreen 0:3b00827bb0b7 51 #include "lwip/tcpip.h"
AdamGreen 0:3b00827bb0b7 52 #include "lwip/sys.h"
AdamGreen 0:3b00827bb0b7 53 #include "lwip/timers.h"
AdamGreen 0:3b00827bb0b7 54 #include "lwip/stats.h"
AdamGreen 0:3b00827bb0b7 55 #include "netif/etharp.h"
AdamGreen 0:3b00827bb0b7 56 #include "lwip/ip_frag.h"
AdamGreen 0:3b00827bb0b7 57 #include "lwip/snmp_structs.h"
AdamGreen 0:3b00827bb0b7 58 #include "lwip/snmp_msg.h"
AdamGreen 0:3b00827bb0b7 59 #include "lwip/dns.h"
AdamGreen 0:3b00827bb0b7 60 #include "netif/ppp_oe.h"
AdamGreen 0:3b00827bb0b7 61
AdamGreen 0:3b00827bb0b7 62 #include <string.h>
AdamGreen 0:3b00827bb0b7 63
AdamGreen 0:3b00827bb0b7 64 #if !MEMP_MEM_MALLOC /* don't build if not configured for use in lwipopts.h */
AdamGreen 0:3b00827bb0b7 65
AdamGreen 0:3b00827bb0b7 66 struct memp {
AdamGreen 0:3b00827bb0b7 67 struct memp *next;
AdamGreen 0:3b00827bb0b7 68 #if MEMP_OVERFLOW_CHECK
AdamGreen 0:3b00827bb0b7 69 const char *file;
AdamGreen 0:3b00827bb0b7 70 int line;
AdamGreen 0:3b00827bb0b7 71 #endif /* MEMP_OVERFLOW_CHECK */
AdamGreen 0:3b00827bb0b7 72 };
AdamGreen 0:3b00827bb0b7 73
AdamGreen 0:3b00827bb0b7 74 #if MEMP_OVERFLOW_CHECK
AdamGreen 0:3b00827bb0b7 75 /* if MEMP_OVERFLOW_CHECK is turned on, we reserve some bytes at the beginning
AdamGreen 0:3b00827bb0b7 76 * and at the end of each element, initialize them as 0xcd and check
AdamGreen 0:3b00827bb0b7 77 * them later. */
AdamGreen 0:3b00827bb0b7 78 /* If MEMP_OVERFLOW_CHECK is >= 2, on every call to memp_malloc or memp_free,
AdamGreen 0:3b00827bb0b7 79 * every single element in each pool is checked!
AdamGreen 0:3b00827bb0b7 80 * This is VERY SLOW but also very helpful. */
AdamGreen 0:3b00827bb0b7 81 /* MEMP_SANITY_REGION_BEFORE and MEMP_SANITY_REGION_AFTER can be overridden in
AdamGreen 0:3b00827bb0b7 82 * lwipopts.h to change the amount reserved for checking. */
AdamGreen 0:3b00827bb0b7 83 #ifndef MEMP_SANITY_REGION_BEFORE
AdamGreen 0:3b00827bb0b7 84 #define MEMP_SANITY_REGION_BEFORE 16
AdamGreen 0:3b00827bb0b7 85 #endif /* MEMP_SANITY_REGION_BEFORE*/
AdamGreen 0:3b00827bb0b7 86 #if MEMP_SANITY_REGION_BEFORE > 0
AdamGreen 0:3b00827bb0b7 87 #define MEMP_SANITY_REGION_BEFORE_ALIGNED LWIP_MEM_ALIGN_SIZE(MEMP_SANITY_REGION_BEFORE)
AdamGreen 0:3b00827bb0b7 88 #else
AdamGreen 0:3b00827bb0b7 89 #define MEMP_SANITY_REGION_BEFORE_ALIGNED 0
AdamGreen 0:3b00827bb0b7 90 #endif /* MEMP_SANITY_REGION_BEFORE*/
AdamGreen 0:3b00827bb0b7 91 #ifndef MEMP_SANITY_REGION_AFTER
AdamGreen 0:3b00827bb0b7 92 #define MEMP_SANITY_REGION_AFTER 16
AdamGreen 0:3b00827bb0b7 93 #endif /* MEMP_SANITY_REGION_AFTER*/
AdamGreen 0:3b00827bb0b7 94 #if MEMP_SANITY_REGION_AFTER > 0
AdamGreen 0:3b00827bb0b7 95 #define MEMP_SANITY_REGION_AFTER_ALIGNED LWIP_MEM_ALIGN_SIZE(MEMP_SANITY_REGION_AFTER)
AdamGreen 0:3b00827bb0b7 96 #else
AdamGreen 0:3b00827bb0b7 97 #define MEMP_SANITY_REGION_AFTER_ALIGNED 0
AdamGreen 0:3b00827bb0b7 98 #endif /* MEMP_SANITY_REGION_AFTER*/
AdamGreen 0:3b00827bb0b7 99
AdamGreen 0:3b00827bb0b7 100 /* MEMP_SIZE: save space for struct memp and for sanity check */
AdamGreen 0:3b00827bb0b7 101 #define MEMP_SIZE (LWIP_MEM_ALIGN_SIZE(sizeof(struct memp)) + MEMP_SANITY_REGION_BEFORE_ALIGNED)
AdamGreen 0:3b00827bb0b7 102 #define MEMP_ALIGN_SIZE(x) (LWIP_MEM_ALIGN_SIZE(x) + MEMP_SANITY_REGION_AFTER_ALIGNED)
AdamGreen 0:3b00827bb0b7 103
AdamGreen 0:3b00827bb0b7 104 #else /* MEMP_OVERFLOW_CHECK */
AdamGreen 0:3b00827bb0b7 105
AdamGreen 0:3b00827bb0b7 106 /* No sanity checks
AdamGreen 0:3b00827bb0b7 107 * We don't need to preserve the struct memp while not allocated, so we
AdamGreen 0:3b00827bb0b7 108 * can save a little space and set MEMP_SIZE to 0.
AdamGreen 0:3b00827bb0b7 109 */
AdamGreen 0:3b00827bb0b7 110 #define MEMP_SIZE 0
AdamGreen 0:3b00827bb0b7 111 #define MEMP_ALIGN_SIZE(x) (LWIP_MEM_ALIGN_SIZE(x))
AdamGreen 0:3b00827bb0b7 112
AdamGreen 0:3b00827bb0b7 113 #endif /* MEMP_OVERFLOW_CHECK */
AdamGreen 0:3b00827bb0b7 114
AdamGreen 0:3b00827bb0b7 115 /** This array holds the first free element of each pool.
AdamGreen 0:3b00827bb0b7 116 * Elements form a linked list. */
AdamGreen 0:3b00827bb0b7 117 static struct memp *memp_tab[MEMP_MAX];
AdamGreen 0:3b00827bb0b7 118
AdamGreen 0:3b00827bb0b7 119 #else /* MEMP_MEM_MALLOC */
AdamGreen 0:3b00827bb0b7 120
AdamGreen 0:3b00827bb0b7 121 #define MEMP_ALIGN_SIZE(x) (LWIP_MEM_ALIGN_SIZE(x))
AdamGreen 0:3b00827bb0b7 122
AdamGreen 0:3b00827bb0b7 123 #endif /* MEMP_MEM_MALLOC */
AdamGreen 0:3b00827bb0b7 124
AdamGreen 0:3b00827bb0b7 125 /** This array holds the element sizes of each pool. */
AdamGreen 0:3b00827bb0b7 126 #if !MEM_USE_POOLS && !MEMP_MEM_MALLOC
AdamGreen 0:3b00827bb0b7 127 static
AdamGreen 0:3b00827bb0b7 128 #endif
AdamGreen 0:3b00827bb0b7 129 const u16_t memp_sizes[MEMP_MAX] = {
AdamGreen 0:3b00827bb0b7 130 #define LWIP_MEMPOOL(name,num,size,desc) LWIP_MEM_ALIGN_SIZE(size),
AdamGreen 0:3b00827bb0b7 131 #include "lwip/memp_std.h"
AdamGreen 0:3b00827bb0b7 132 };
AdamGreen 0:3b00827bb0b7 133
AdamGreen 0:3b00827bb0b7 134 #if !MEMP_MEM_MALLOC /* don't build if not configured for use in lwipopts.h */
AdamGreen 0:3b00827bb0b7 135
AdamGreen 0:3b00827bb0b7 136 /** This array holds the number of elements in each pool. */
AdamGreen 0:3b00827bb0b7 137 static const u16_t memp_num[MEMP_MAX] = {
AdamGreen 0:3b00827bb0b7 138 #define LWIP_MEMPOOL(name,num,size,desc) (num),
AdamGreen 0:3b00827bb0b7 139 #include "lwip/memp_std.h"
AdamGreen 0:3b00827bb0b7 140 };
AdamGreen 0:3b00827bb0b7 141
AdamGreen 0:3b00827bb0b7 142 /** This array holds a textual description of each pool. */
AdamGreen 0:3b00827bb0b7 143 #ifdef LWIP_DEBUG
AdamGreen 0:3b00827bb0b7 144 static const char *memp_desc[MEMP_MAX] = {
AdamGreen 0:3b00827bb0b7 145 #define LWIP_MEMPOOL(name,num,size,desc) (desc),
AdamGreen 0:3b00827bb0b7 146 #include "lwip/memp_std.h"
AdamGreen 0:3b00827bb0b7 147 };
AdamGreen 0:3b00827bb0b7 148 #endif /* LWIP_DEBUG */
AdamGreen 0:3b00827bb0b7 149
AdamGreen 0:3b00827bb0b7 150 #if MEMP_SEPARATE_POOLS
AdamGreen 0:3b00827bb0b7 151
AdamGreen 0:3b00827bb0b7 152 /** This creates each memory pool. These are named memp_memory_XXX_base (where
AdamGreen 0:3b00827bb0b7 153 * XXX is the name of the pool defined in memp_std.h).
AdamGreen 0:3b00827bb0b7 154 * To relocate a pool, declare it as extern in cc.h. Example for GCC:
AdamGreen 0:3b00827bb0b7 155 * extern u8_t __attribute__((section(".onchip_mem"))) memp_memory_UDP_PCB_base[];
AdamGreen 0:3b00827bb0b7 156 */
AdamGreen 0:3b00827bb0b7 157 #define LWIP_MEMPOOL(name,num,size,desc) u8_t memp_memory_ ## name ## _base \
AdamGreen 0:3b00827bb0b7 158 [((num) * (MEMP_SIZE + MEMP_ALIGN_SIZE(size)))];
AdamGreen 0:3b00827bb0b7 159 #include "lwip/memp_std.h"
AdamGreen 0:3b00827bb0b7 160
AdamGreen 0:3b00827bb0b7 161 /** This array holds the base of each memory pool. */
AdamGreen 0:3b00827bb0b7 162 static u8_t *const memp_bases[] = {
AdamGreen 0:3b00827bb0b7 163 #define LWIP_MEMPOOL(name,num,size,desc) memp_memory_ ## name ## _base,
AdamGreen 0:3b00827bb0b7 164 #include "lwip/memp_std.h"
AdamGreen 0:3b00827bb0b7 165 };
AdamGreen 0:3b00827bb0b7 166
AdamGreen 0:3b00827bb0b7 167 #else /* MEMP_SEPARATE_POOLS */
AdamGreen 0:3b00827bb0b7 168
AdamGreen 0:3b00827bb0b7 169 #if defined(TARGET_LPC1768)
AdamGreen 0:3b00827bb0b7 170 # define ETHMEM_SECTION __attribute((section("AHBSRAM1")))
AdamGreen 0:3b00827bb0b7 171 #elif defined(TARGET_LPC4088)
AdamGreen 0:3b00827bb0b7 172 # define ETHMEM_SECTION
AdamGreen 0:3b00827bb0b7 173 #endif
AdamGreen 0:3b00827bb0b7 174
AdamGreen 0:3b00827bb0b7 175 /** This is the actual memory used by the pools (all pools in one big block). */
AdamGreen 0:3b00827bb0b7 176 static u8_t memp_memory[MEM_ALIGNMENT - 1
AdamGreen 0:3b00827bb0b7 177 #define LWIP_MEMPOOL(name,num,size,desc) + ( (num) * (MEMP_SIZE + MEMP_ALIGN_SIZE(size) ) )
AdamGreen 0:3b00827bb0b7 178 #include "lwip/memp_std.h"
AdamGreen 0:3b00827bb0b7 179 ] ETHMEM_SECTION;
AdamGreen 0:3b00827bb0b7 180
AdamGreen 0:3b00827bb0b7 181 #endif /* MEMP_SEPARATE_POOLS */
AdamGreen 0:3b00827bb0b7 182
AdamGreen 0:3b00827bb0b7 183 #if MEMP_SANITY_CHECK
AdamGreen 0:3b00827bb0b7 184 /**
AdamGreen 0:3b00827bb0b7 185 * Check that memp-lists don't form a circle
AdamGreen 0:3b00827bb0b7 186 */
AdamGreen 0:3b00827bb0b7 187 static int
AdamGreen 0:3b00827bb0b7 188 memp_sanity(void)
AdamGreen 0:3b00827bb0b7 189 {
AdamGreen 0:3b00827bb0b7 190 s16_t i, c;
AdamGreen 0:3b00827bb0b7 191 struct memp *m, *n;
AdamGreen 0:3b00827bb0b7 192
AdamGreen 0:3b00827bb0b7 193 for (i = 0; i < MEMP_MAX; i++) {
AdamGreen 0:3b00827bb0b7 194 for (m = memp_tab[i]; m != NULL; m = m->next) {
AdamGreen 0:3b00827bb0b7 195 c = 1;
AdamGreen 0:3b00827bb0b7 196 for (n = memp_tab[i]; n != NULL; n = n->next) {
AdamGreen 0:3b00827bb0b7 197 if (n == m && --c < 0) {
AdamGreen 0:3b00827bb0b7 198 return 0;
AdamGreen 0:3b00827bb0b7 199 }
AdamGreen 0:3b00827bb0b7 200 }
AdamGreen 0:3b00827bb0b7 201 }
AdamGreen 0:3b00827bb0b7 202 }
AdamGreen 0:3b00827bb0b7 203 return 1;
AdamGreen 0:3b00827bb0b7 204 }
AdamGreen 0:3b00827bb0b7 205 #endif /* MEMP_SANITY_CHECK*/
AdamGreen 0:3b00827bb0b7 206 #if MEMP_OVERFLOW_CHECK
AdamGreen 0:3b00827bb0b7 207 #if defined(LWIP_DEBUG) && MEMP_STATS
AdamGreen 0:3b00827bb0b7 208 static const char * memp_overflow_names[] = {
AdamGreen 0:3b00827bb0b7 209 #define LWIP_MEMPOOL(name,num,size,desc) "/"desc,
AdamGreen 0:3b00827bb0b7 210 #include "lwip/memp_std.h"
AdamGreen 0:3b00827bb0b7 211 };
AdamGreen 0:3b00827bb0b7 212 #endif
AdamGreen 0:3b00827bb0b7 213
AdamGreen 0:3b00827bb0b7 214 /**
AdamGreen 0:3b00827bb0b7 215 * Check if a memp element was victim of an overflow
AdamGreen 0:3b00827bb0b7 216 * (e.g. the restricted area after it has been altered)
AdamGreen 0:3b00827bb0b7 217 *
AdamGreen 0:3b00827bb0b7 218 * @param p the memp element to check
AdamGreen 0:3b00827bb0b7 219 * @param memp_type the pool p comes from
AdamGreen 0:3b00827bb0b7 220 */
AdamGreen 0:3b00827bb0b7 221 static void
AdamGreen 0:3b00827bb0b7 222 memp_overflow_check_element_overflow(struct memp *p, u16_t memp_type)
AdamGreen 0:3b00827bb0b7 223 {
AdamGreen 0:3b00827bb0b7 224 u16_t k;
AdamGreen 0:3b00827bb0b7 225 u8_t *m;
AdamGreen 0:3b00827bb0b7 226 #if MEMP_SANITY_REGION_AFTER_ALIGNED > 0
AdamGreen 0:3b00827bb0b7 227 m = (u8_t*)p + MEMP_SIZE + memp_sizes[memp_type];
AdamGreen 0:3b00827bb0b7 228 for (k = 0; k < MEMP_SANITY_REGION_AFTER_ALIGNED; k++) {
AdamGreen 0:3b00827bb0b7 229 if (m[k] != 0xcd) {
AdamGreen 0:3b00827bb0b7 230 char errstr[128] = "detected memp overflow in pool ";
AdamGreen 0:3b00827bb0b7 231 char digit[] = "0";
AdamGreen 0:3b00827bb0b7 232 if(memp_type >= 10) {
AdamGreen 0:3b00827bb0b7 233 digit[0] = '0' + (memp_type/10);
AdamGreen 0:3b00827bb0b7 234 strcat(errstr, digit);
AdamGreen 0:3b00827bb0b7 235 }
AdamGreen 0:3b00827bb0b7 236 digit[0] = '0' + (memp_type%10);
AdamGreen 0:3b00827bb0b7 237 strcat(errstr, digit);
AdamGreen 0:3b00827bb0b7 238 #if defined(LWIP_DEBUG) && MEMP_STATS
AdamGreen 0:3b00827bb0b7 239 strcat(errstr, memp_overflow_names[memp_type]);
AdamGreen 0:3b00827bb0b7 240 #endif
AdamGreen 0:3b00827bb0b7 241 LWIP_ASSERT(errstr, 0);
AdamGreen 0:3b00827bb0b7 242 }
AdamGreen 0:3b00827bb0b7 243 }
AdamGreen 0:3b00827bb0b7 244 #endif
AdamGreen 0:3b00827bb0b7 245 }
AdamGreen 0:3b00827bb0b7 246
AdamGreen 0:3b00827bb0b7 247 /**
AdamGreen 0:3b00827bb0b7 248 * Check if a memp element was victim of an underflow
AdamGreen 0:3b00827bb0b7 249 * (e.g. the restricted area before it has been altered)
AdamGreen 0:3b00827bb0b7 250 *
AdamGreen 0:3b00827bb0b7 251 * @param p the memp element to check
AdamGreen 0:3b00827bb0b7 252 * @param memp_type the pool p comes from
AdamGreen 0:3b00827bb0b7 253 */
AdamGreen 0:3b00827bb0b7 254 static void
AdamGreen 0:3b00827bb0b7 255 memp_overflow_check_element_underflow(struct memp *p, u16_t memp_type)
AdamGreen 0:3b00827bb0b7 256 {
AdamGreen 0:3b00827bb0b7 257 u16_t k;
AdamGreen 0:3b00827bb0b7 258 u8_t *m;
AdamGreen 0:3b00827bb0b7 259 #if MEMP_SANITY_REGION_BEFORE_ALIGNED > 0
AdamGreen 0:3b00827bb0b7 260 m = (u8_t*)p + MEMP_SIZE - MEMP_SANITY_REGION_BEFORE_ALIGNED;
AdamGreen 0:3b00827bb0b7 261 for (k = 0; k < MEMP_SANITY_REGION_BEFORE_ALIGNED; k++) {
AdamGreen 0:3b00827bb0b7 262 if (m[k] != 0xcd) {
AdamGreen 0:3b00827bb0b7 263 char errstr[128] = "detected memp underflow in pool ";
AdamGreen 0:3b00827bb0b7 264 char digit[] = "0";
AdamGreen 0:3b00827bb0b7 265 if(memp_type >= 10) {
AdamGreen 0:3b00827bb0b7 266 digit[0] = '0' + (memp_type/10);
AdamGreen 0:3b00827bb0b7 267 strcat(errstr, digit);
AdamGreen 0:3b00827bb0b7 268 }
AdamGreen 0:3b00827bb0b7 269 digit[0] = '0' + (memp_type%10);
AdamGreen 0:3b00827bb0b7 270 strcat(errstr, digit);
AdamGreen 0:3b00827bb0b7 271 #if defined(LWIP_DEBUG) && MEMP_STATS
AdamGreen 0:3b00827bb0b7 272 strcat(errstr, memp_overflow_names[memp_type]);
AdamGreen 0:3b00827bb0b7 273 #endif
AdamGreen 0:3b00827bb0b7 274 LWIP_ASSERT(errstr, 0);
AdamGreen 0:3b00827bb0b7 275 }
AdamGreen 0:3b00827bb0b7 276 }
AdamGreen 0:3b00827bb0b7 277 #endif
AdamGreen 0:3b00827bb0b7 278 }
AdamGreen 0:3b00827bb0b7 279
AdamGreen 0:3b00827bb0b7 280 /**
AdamGreen 0:3b00827bb0b7 281 * Do an overflow check for all elements in every pool.
AdamGreen 0:3b00827bb0b7 282 *
AdamGreen 0:3b00827bb0b7 283 * @see memp_overflow_check_element for a description of the check
AdamGreen 0:3b00827bb0b7 284 */
AdamGreen 0:3b00827bb0b7 285 static void
AdamGreen 0:3b00827bb0b7 286 memp_overflow_check_all(void)
AdamGreen 0:3b00827bb0b7 287 {
AdamGreen 0:3b00827bb0b7 288 u16_t i, j;
AdamGreen 0:3b00827bb0b7 289 struct memp *p;
AdamGreen 0:3b00827bb0b7 290
AdamGreen 0:3b00827bb0b7 291 p = (struct memp *)LWIP_MEM_ALIGN(memp_memory);
AdamGreen 0:3b00827bb0b7 292 for (i = 0; i < MEMP_MAX; ++i) {
AdamGreen 0:3b00827bb0b7 293 p = p;
AdamGreen 0:3b00827bb0b7 294 for (j = 0; j < memp_num[i]; ++j) {
AdamGreen 0:3b00827bb0b7 295 memp_overflow_check_element_overflow(p, i);
AdamGreen 0:3b00827bb0b7 296 p = (struct memp*)((u8_t*)p + MEMP_SIZE + memp_sizes[i] + MEMP_SANITY_REGION_AFTER_ALIGNED);
AdamGreen 0:3b00827bb0b7 297 }
AdamGreen 0:3b00827bb0b7 298 }
AdamGreen 0:3b00827bb0b7 299 p = (struct memp *)LWIP_MEM_ALIGN(memp_memory);
AdamGreen 0:3b00827bb0b7 300 for (i = 0; i < MEMP_MAX; ++i) {
AdamGreen 0:3b00827bb0b7 301 p = p;
AdamGreen 0:3b00827bb0b7 302 for (j = 0; j < memp_num[i]; ++j) {
AdamGreen 0:3b00827bb0b7 303 memp_overflow_check_element_underflow(p, i);
AdamGreen 0:3b00827bb0b7 304 p = (struct memp*)((u8_t*)p + MEMP_SIZE + memp_sizes[i] + MEMP_SANITY_REGION_AFTER_ALIGNED);
AdamGreen 0:3b00827bb0b7 305 }
AdamGreen 0:3b00827bb0b7 306 }
AdamGreen 0:3b00827bb0b7 307 }
AdamGreen 0:3b00827bb0b7 308
AdamGreen 0:3b00827bb0b7 309 /**
AdamGreen 0:3b00827bb0b7 310 * Initialize the restricted areas of all memp elements in every pool.
AdamGreen 0:3b00827bb0b7 311 */
AdamGreen 0:3b00827bb0b7 312 static void
AdamGreen 0:3b00827bb0b7 313 memp_overflow_init(void)
AdamGreen 0:3b00827bb0b7 314 {
AdamGreen 0:3b00827bb0b7 315 u16_t i, j;
AdamGreen 0:3b00827bb0b7 316 struct memp *p;
AdamGreen 0:3b00827bb0b7 317 u8_t *m;
AdamGreen 0:3b00827bb0b7 318
AdamGreen 0:3b00827bb0b7 319 p = (struct memp *)LWIP_MEM_ALIGN(memp_memory);
AdamGreen 0:3b00827bb0b7 320 for (i = 0; i < MEMP_MAX; ++i) {
AdamGreen 0:3b00827bb0b7 321 p = p;
AdamGreen 0:3b00827bb0b7 322 for (j = 0; j < memp_num[i]; ++j) {
AdamGreen 0:3b00827bb0b7 323 #if MEMP_SANITY_REGION_BEFORE_ALIGNED > 0
AdamGreen 0:3b00827bb0b7 324 m = (u8_t*)p + MEMP_SIZE - MEMP_SANITY_REGION_BEFORE_ALIGNED;
AdamGreen 0:3b00827bb0b7 325 memset(m, 0xcd, MEMP_SANITY_REGION_BEFORE_ALIGNED);
AdamGreen 0:3b00827bb0b7 326 #endif
AdamGreen 0:3b00827bb0b7 327 #if MEMP_SANITY_REGION_AFTER_ALIGNED > 0
AdamGreen 0:3b00827bb0b7 328 m = (u8_t*)p + MEMP_SIZE + memp_sizes[i];
AdamGreen 0:3b00827bb0b7 329 memset(m, 0xcd, MEMP_SANITY_REGION_AFTER_ALIGNED);
AdamGreen 0:3b00827bb0b7 330 #endif
AdamGreen 0:3b00827bb0b7 331 p = (struct memp*)((u8_t*)p + MEMP_SIZE + memp_sizes[i] + MEMP_SANITY_REGION_AFTER_ALIGNED);
AdamGreen 0:3b00827bb0b7 332 }
AdamGreen 0:3b00827bb0b7 333 }
AdamGreen 0:3b00827bb0b7 334 }
AdamGreen 0:3b00827bb0b7 335 #endif /* MEMP_OVERFLOW_CHECK */
AdamGreen 0:3b00827bb0b7 336
AdamGreen 0:3b00827bb0b7 337 /**
AdamGreen 0:3b00827bb0b7 338 * Initialize this module.
AdamGreen 0:3b00827bb0b7 339 *
AdamGreen 0:3b00827bb0b7 340 * Carves out memp_memory into linked lists for each pool-type.
AdamGreen 0:3b00827bb0b7 341 */
AdamGreen 0:3b00827bb0b7 342 void
AdamGreen 0:3b00827bb0b7 343 memp_init(void)
AdamGreen 0:3b00827bb0b7 344 {
AdamGreen 0:3b00827bb0b7 345 struct memp *memp;
AdamGreen 0:3b00827bb0b7 346 u16_t i, j;
AdamGreen 0:3b00827bb0b7 347
AdamGreen 0:3b00827bb0b7 348 for (i = 0; i < MEMP_MAX; ++i) {
AdamGreen 0:3b00827bb0b7 349 MEMP_STATS_AVAIL(used, i, 0);
AdamGreen 0:3b00827bb0b7 350 MEMP_STATS_AVAIL(max, i, 0);
AdamGreen 0:3b00827bb0b7 351 MEMP_STATS_AVAIL(err, i, 0);
AdamGreen 0:3b00827bb0b7 352 MEMP_STATS_AVAIL(avail, i, memp_num[i]);
AdamGreen 0:3b00827bb0b7 353 }
AdamGreen 0:3b00827bb0b7 354
AdamGreen 0:3b00827bb0b7 355 #if !MEMP_SEPARATE_POOLS
AdamGreen 0:3b00827bb0b7 356 memp = (struct memp *)LWIP_MEM_ALIGN(memp_memory);
AdamGreen 0:3b00827bb0b7 357 #endif /* !MEMP_SEPARATE_POOLS */
AdamGreen 0:3b00827bb0b7 358 /* for every pool: */
AdamGreen 0:3b00827bb0b7 359 for (i = 0; i < MEMP_MAX; ++i) {
AdamGreen 0:3b00827bb0b7 360 memp_tab[i] = NULL;
AdamGreen 0:3b00827bb0b7 361 #if MEMP_SEPARATE_POOLS
AdamGreen 0:3b00827bb0b7 362 memp = (struct memp*)memp_bases[i];
AdamGreen 0:3b00827bb0b7 363 #endif /* MEMP_SEPARATE_POOLS */
AdamGreen 0:3b00827bb0b7 364 /* create a linked list of memp elements */
AdamGreen 0:3b00827bb0b7 365 for (j = 0; j < memp_num[i]; ++j) {
AdamGreen 0:3b00827bb0b7 366 memp->next = memp_tab[i];
AdamGreen 0:3b00827bb0b7 367 memp_tab[i] = memp;
AdamGreen 0:3b00827bb0b7 368 memp = (struct memp *)(void *)((u8_t *)memp + MEMP_SIZE + memp_sizes[i]
AdamGreen 0:3b00827bb0b7 369 #if MEMP_OVERFLOW_CHECK
AdamGreen 0:3b00827bb0b7 370 + MEMP_SANITY_REGION_AFTER_ALIGNED
AdamGreen 0:3b00827bb0b7 371 #endif
AdamGreen 0:3b00827bb0b7 372 );
AdamGreen 0:3b00827bb0b7 373 }
AdamGreen 0:3b00827bb0b7 374 }
AdamGreen 0:3b00827bb0b7 375 #if MEMP_OVERFLOW_CHECK
AdamGreen 0:3b00827bb0b7 376 memp_overflow_init();
AdamGreen 0:3b00827bb0b7 377 /* check everything a first time to see if it worked */
AdamGreen 0:3b00827bb0b7 378 memp_overflow_check_all();
AdamGreen 0:3b00827bb0b7 379 #endif /* MEMP_OVERFLOW_CHECK */
AdamGreen 0:3b00827bb0b7 380 }
AdamGreen 0:3b00827bb0b7 381
AdamGreen 0:3b00827bb0b7 382 /**
AdamGreen 0:3b00827bb0b7 383 * Get an element from a specific pool.
AdamGreen 0:3b00827bb0b7 384 *
AdamGreen 0:3b00827bb0b7 385 * @param type the pool to get an element from
AdamGreen 0:3b00827bb0b7 386 *
AdamGreen 0:3b00827bb0b7 387 * the debug version has two more parameters:
AdamGreen 0:3b00827bb0b7 388 * @param file file name calling this function
AdamGreen 0:3b00827bb0b7 389 * @param line number of line where this function is called
AdamGreen 0:3b00827bb0b7 390 *
AdamGreen 0:3b00827bb0b7 391 * @return a pointer to the allocated memory or a NULL pointer on error
AdamGreen 0:3b00827bb0b7 392 */
AdamGreen 0:3b00827bb0b7 393 void *
AdamGreen 0:3b00827bb0b7 394 #if !MEMP_OVERFLOW_CHECK
AdamGreen 0:3b00827bb0b7 395 memp_malloc(memp_t type)
AdamGreen 0:3b00827bb0b7 396 #else
AdamGreen 0:3b00827bb0b7 397 memp_malloc_fn(memp_t type, const char* file, const int line)
AdamGreen 0:3b00827bb0b7 398 #endif
AdamGreen 0:3b00827bb0b7 399 {
AdamGreen 0:3b00827bb0b7 400 struct memp *memp;
AdamGreen 0:3b00827bb0b7 401 SYS_ARCH_DECL_PROTECT(old_level);
AdamGreen 0:3b00827bb0b7 402
AdamGreen 0:3b00827bb0b7 403 LWIP_ERROR("memp_malloc: type < MEMP_MAX", (type < MEMP_MAX), return NULL;);
AdamGreen 0:3b00827bb0b7 404
AdamGreen 0:3b00827bb0b7 405 SYS_ARCH_PROTECT(old_level);
AdamGreen 0:3b00827bb0b7 406 #if MEMP_OVERFLOW_CHECK >= 2
AdamGreen 0:3b00827bb0b7 407 memp_overflow_check_all();
AdamGreen 0:3b00827bb0b7 408 #endif /* MEMP_OVERFLOW_CHECK >= 2 */
AdamGreen 0:3b00827bb0b7 409
AdamGreen 0:3b00827bb0b7 410 memp = memp_tab[type];
AdamGreen 0:3b00827bb0b7 411
AdamGreen 0:3b00827bb0b7 412 if (memp != NULL) {
AdamGreen 0:3b00827bb0b7 413 memp_tab[type] = memp->next;
AdamGreen 0:3b00827bb0b7 414 #if MEMP_OVERFLOW_CHECK
AdamGreen 0:3b00827bb0b7 415 memp->next = NULL;
AdamGreen 0:3b00827bb0b7 416 memp->file = file;
AdamGreen 0:3b00827bb0b7 417 memp->line = line;
AdamGreen 0:3b00827bb0b7 418 #endif /* MEMP_OVERFLOW_CHECK */
AdamGreen 0:3b00827bb0b7 419 MEMP_STATS_INC_USED(used, type);
AdamGreen 0:3b00827bb0b7 420 LWIP_ASSERT("memp_malloc: memp properly aligned",
AdamGreen 0:3b00827bb0b7 421 ((mem_ptr_t)memp % MEM_ALIGNMENT) == 0);
AdamGreen 0:3b00827bb0b7 422 memp = (struct memp*)(void *)((u8_t*)memp + MEMP_SIZE);
AdamGreen 0:3b00827bb0b7 423 } else {
AdamGreen 0:3b00827bb0b7 424 LWIP_DEBUGF(MEMP_DEBUG | LWIP_DBG_LEVEL_SERIOUS, ("memp_malloc: out of memory in pool %s\n", memp_desc[type]));
AdamGreen 0:3b00827bb0b7 425 MEMP_STATS_INC(err, type);
AdamGreen 0:3b00827bb0b7 426 }
AdamGreen 0:3b00827bb0b7 427
AdamGreen 0:3b00827bb0b7 428 SYS_ARCH_UNPROTECT(old_level);
AdamGreen 0:3b00827bb0b7 429
AdamGreen 0:3b00827bb0b7 430 return memp;
AdamGreen 0:3b00827bb0b7 431 }
AdamGreen 0:3b00827bb0b7 432
AdamGreen 0:3b00827bb0b7 433 /**
AdamGreen 0:3b00827bb0b7 434 * Put an element back into its pool.
AdamGreen 0:3b00827bb0b7 435 *
AdamGreen 0:3b00827bb0b7 436 * @param type the pool where to put mem
AdamGreen 0:3b00827bb0b7 437 * @param mem the memp element to free
AdamGreen 0:3b00827bb0b7 438 */
AdamGreen 0:3b00827bb0b7 439 void
AdamGreen 0:3b00827bb0b7 440 memp_free(memp_t type, void *mem)
AdamGreen 0:3b00827bb0b7 441 {
AdamGreen 0:3b00827bb0b7 442 struct memp *memp;
AdamGreen 0:3b00827bb0b7 443 SYS_ARCH_DECL_PROTECT(old_level);
AdamGreen 0:3b00827bb0b7 444
AdamGreen 0:3b00827bb0b7 445 if (mem == NULL) {
AdamGreen 0:3b00827bb0b7 446 return;
AdamGreen 0:3b00827bb0b7 447 }
AdamGreen 0:3b00827bb0b7 448 LWIP_ASSERT("memp_free: mem properly aligned",
AdamGreen 0:3b00827bb0b7 449 ((mem_ptr_t)mem % MEM_ALIGNMENT) == 0);
AdamGreen 0:3b00827bb0b7 450
AdamGreen 0:3b00827bb0b7 451 memp = (struct memp *)(void *)((u8_t*)mem - MEMP_SIZE);
AdamGreen 0:3b00827bb0b7 452
AdamGreen 0:3b00827bb0b7 453 SYS_ARCH_PROTECT(old_level);
AdamGreen 0:3b00827bb0b7 454 #if MEMP_OVERFLOW_CHECK
AdamGreen 0:3b00827bb0b7 455 #if MEMP_OVERFLOW_CHECK >= 2
AdamGreen 0:3b00827bb0b7 456 memp_overflow_check_all();
AdamGreen 0:3b00827bb0b7 457 #else
AdamGreen 0:3b00827bb0b7 458 memp_overflow_check_element_overflow(memp, type);
AdamGreen 0:3b00827bb0b7 459 memp_overflow_check_element_underflow(memp, type);
AdamGreen 0:3b00827bb0b7 460 #endif /* MEMP_OVERFLOW_CHECK >= 2 */
AdamGreen 0:3b00827bb0b7 461 #endif /* MEMP_OVERFLOW_CHECK */
AdamGreen 0:3b00827bb0b7 462
AdamGreen 0:3b00827bb0b7 463 MEMP_STATS_DEC(used, type);
AdamGreen 0:3b00827bb0b7 464
AdamGreen 0:3b00827bb0b7 465 memp->next = memp_tab[type];
AdamGreen 0:3b00827bb0b7 466 memp_tab[type] = memp;
AdamGreen 0:3b00827bb0b7 467
AdamGreen 0:3b00827bb0b7 468 #if MEMP_SANITY_CHECK
AdamGreen 0:3b00827bb0b7 469 LWIP_ASSERT("memp sanity", memp_sanity());
AdamGreen 0:3b00827bb0b7 470 #endif /* MEMP_SANITY_CHECK */
AdamGreen 0:3b00827bb0b7 471
AdamGreen 0:3b00827bb0b7 472 SYS_ARCH_UNPROTECT(old_level);
AdamGreen 0:3b00827bb0b7 473 }
AdamGreen 0:3b00827bb0b7 474
AdamGreen 0:3b00827bb0b7 475 #endif /* MEMP_MEM_MALLOC */