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