CK Sin / Mbed 2 deprecated Ethernetwebsocket

Ethernetwebsoc

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

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

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

Who changed what in which revision?

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