First step: AutoIP compiled in and working

Dependencies:   mbed

Committer:
darran
Date:
Fri Jun 18 15:54:21 2010 +0000
Revision:
1:4218cacaf696
Parent:
0:55a05330f8cc

        

Who changed what in which revision?

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