SiSK / EthernetInterface

fdsf

Dependents:   sisk_proj_stat MQTT Hello_FXOS8700Q WireFSHandControl ... more

lwip/core/memp.c@0:d7bd7384a37c, 2016-12-07 (annotated)

Committer:
grzemich
Date:
Wed Dec 07 23:47:50 2016 +0000
Revision:
0:d7bd7384a37c
dgd

Who changed what in which revision?

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