Yann Garcia / Mbed 2 deprecated DS130x_I2CApp

This short program illustrates how to use the DS130x_I2C library. My objective is to share the same RTC with Microchip 18F MCU.

Dependencies:   mbed DebugLibrary

NetServices/lwip/core/memp.c@1:995212d326ca, 2011-02-11 (annotated)

Committer:
Yann
Date:
Fri Feb 11 10:17:20 2011 +0000
Revision:
1:995212d326ca
Parent:
0:f30e2135b0db 
V0.0.0.2

Who changed what in which revision?

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