ZG2100 Network interface source

Committer:
donatien
Date:
Fri Aug 06 10:46:03 2010 +0000
Revision:
4:e00281c7453d
Parent:
1:3a7c15057192

        

Who changed what in which revision?

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