SiSK / EthernetInterface

fdsf

Dependents:   sisk_proj_stat MQTT Hello_FXOS8700Q WireFSHandControl ... more

lwip/core/mem.c@0:d7bd7384a37c, 2016-12-07 (annotated)

Committer:
grzemich
Date:
Wed Dec 07 23:47:50 2016 +0000
Revision:
0:d7bd7384a37c
dgd

Who changed what in which revision?

UserRevisionLine numberNew contents of line
grzemich 0:d7bd7384a37c 1 /**
grzemich 0:d7bd7384a37c 2 * @file
grzemich 0:d7bd7384a37c 3 * Dynamic memory manager
grzemich 0:d7bd7384a37c 4 *
grzemich 0:d7bd7384a37c 5 * This is a lightweight replacement for the standard C library malloc().
grzemich 0:d7bd7384a37c 6 *
grzemich 0:d7bd7384a37c 7 * If you want to use the standard C library malloc() instead, define
grzemich 0:d7bd7384a37c 8 * MEM_LIBC_MALLOC to 1 in your lwipopts.h
grzemich 0:d7bd7384a37c 9 *
grzemich 0:d7bd7384a37c 10 * To let mem_malloc() use pools (prevents fragmentation and is much faster than
grzemich 0:d7bd7384a37c 11 * a heap but might waste some memory), define MEM_USE_POOLS to 1, define
grzemich 0:d7bd7384a37c 12 * MEM_USE_CUSTOM_POOLS to 1 and create a file "lwippools.h" that includes a list
grzemich 0:d7bd7384a37c 13 * of pools like this (more pools can be added between _START and _END):
grzemich 0:d7bd7384a37c 14 *
grzemich 0:d7bd7384a37c 15 * Define three pools with sizes 256, 512, and 1512 bytes
grzemich 0:d7bd7384a37c 16 * LWIP_MALLOC_MEMPOOL_START
grzemich 0:d7bd7384a37c 17 * LWIP_MALLOC_MEMPOOL(20, 256)
grzemich 0:d7bd7384a37c 18 * LWIP_MALLOC_MEMPOOL(10, 512)
grzemich 0:d7bd7384a37c 19 * LWIP_MALLOC_MEMPOOL(5, 1512)
grzemich 0:d7bd7384a37c 20 * LWIP_MALLOC_MEMPOOL_END
grzemich 0:d7bd7384a37c 21 */
grzemich 0:d7bd7384a37c 22
grzemich 0:d7bd7384a37c 23 /*
grzemich 0:d7bd7384a37c 24 * Copyright (c) 2001-2004 Swedish Institute of Computer Science.
grzemich 0:d7bd7384a37c 25 * All rights reserved.
grzemich 0:d7bd7384a37c 26 *
grzemich 0:d7bd7384a37c 27 * Redistribution and use in source and binary forms, with or without modification,
grzemich 0:d7bd7384a37c 28 * are permitted provided that the following conditions are met:
grzemich 0:d7bd7384a37c 29 *
grzemich 0:d7bd7384a37c 30 * 1. Redistributions of source code must retain the above copyright notice,
grzemich 0:d7bd7384a37c 31 * this list of conditions and the following disclaimer.
grzemich 0:d7bd7384a37c 32 * 2. Redistributions in binary form must reproduce the above copyright notice,
grzemich 0:d7bd7384a37c 33 * this list of conditions and the following disclaimer in the documentation
grzemich 0:d7bd7384a37c 34 * and/or other materials provided with the distribution.
grzemich 0:d7bd7384a37c 35 * 3. The name of the author may not be used to endorse or promote products
grzemich 0:d7bd7384a37c 36 * derived from this software without specific prior written permission.
grzemich 0:d7bd7384a37c 37 *
grzemich 0:d7bd7384a37c 38 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
grzemich 0:d7bd7384a37c 39 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
grzemich 0:d7bd7384a37c 40 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
grzemich 0:d7bd7384a37c 41 * SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
grzemich 0:d7bd7384a37c 42 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
grzemich 0:d7bd7384a37c 43 * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
grzemich 0:d7bd7384a37c 44 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
grzemich 0:d7bd7384a37c 45 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
grzemich 0:d7bd7384a37c 46 * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
grzemich 0:d7bd7384a37c 47 * OF SUCH DAMAGE.
grzemich 0:d7bd7384a37c 48 *
grzemich 0:d7bd7384a37c 49 * This file is part of the lwIP TCP/IP stack.
grzemich 0:d7bd7384a37c 50 *
grzemich 0:d7bd7384a37c 51 * Author: Adam Dunkels <adam@sics.se>
grzemich 0:d7bd7384a37c 52 * Simon Goldschmidt
grzemich 0:d7bd7384a37c 53 *
grzemich 0:d7bd7384a37c 54 */
grzemich 0:d7bd7384a37c 55
grzemich 0:d7bd7384a37c 56 #include "lwip/opt.h"
grzemich 0:d7bd7384a37c 57
grzemich 0:d7bd7384a37c 58 #if !MEM_LIBC_MALLOC /* don't build if not configured for use in lwipopts.h */
grzemich 0:d7bd7384a37c 59
grzemich 0:d7bd7384a37c 60 #include "lwip/def.h"
grzemich 0:d7bd7384a37c 61 #include "lwip/mem.h"
grzemich 0:d7bd7384a37c 62 #include "lwip/sys.h"
grzemich 0:d7bd7384a37c 63 #include "lwip/stats.h"
grzemich 0:d7bd7384a37c 64 #include "lwip/err.h"
grzemich 0:d7bd7384a37c 65
grzemich 0:d7bd7384a37c 66 #include <string.h>
grzemich 0:d7bd7384a37c 67
grzemich 0:d7bd7384a37c 68 #if MEM_USE_POOLS
grzemich 0:d7bd7384a37c 69 /* lwIP head implemented with different sized pools */
grzemich 0:d7bd7384a37c 70
grzemich 0:d7bd7384a37c 71 /**
grzemich 0:d7bd7384a37c 72 * Allocate memory: determine the smallest pool that is big enough
grzemich 0:d7bd7384a37c 73 * to contain an element of 'size' and get an element from that pool.
grzemich 0:d7bd7384a37c 74 *
grzemich 0:d7bd7384a37c 75 * @param size the size in bytes of the memory needed
grzemich 0:d7bd7384a37c 76 * @return a pointer to the allocated memory or NULL if the pool is empty
grzemich 0:d7bd7384a37c 77 */
grzemich 0:d7bd7384a37c 78 void *
grzemich 0:d7bd7384a37c 79 mem_malloc(mem_size_t size)
grzemich 0:d7bd7384a37c 80 {
grzemich 0:d7bd7384a37c 81 struct memp_malloc_helper *element;
grzemich 0:d7bd7384a37c 82 memp_t poolnr;
grzemich 0:d7bd7384a37c 83 mem_size_t required_size = size + sizeof(struct memp_malloc_helper);
grzemich 0:d7bd7384a37c 84
grzemich 0:d7bd7384a37c 85 for (poolnr = MEMP_POOL_FIRST; poolnr <= MEMP_POOL_LAST; poolnr = (memp_t)(poolnr + 1)) {
grzemich 0:d7bd7384a37c 86 #if MEM_USE_POOLS_TRY_BIGGER_POOL
grzemich 0:d7bd7384a37c 87 again:
grzemich 0:d7bd7384a37c 88 #endif /* MEM_USE_POOLS_TRY_BIGGER_POOL */
grzemich 0:d7bd7384a37c 89 /* is this pool big enough to hold an element of the required size
grzemich 0:d7bd7384a37c 90 plus a struct memp_malloc_helper that saves the pool this element came from? */
grzemich 0:d7bd7384a37c 91 if (required_size <= memp_sizes[poolnr]) {
grzemich 0:d7bd7384a37c 92 break;
grzemich 0:d7bd7384a37c 93 }
grzemich 0:d7bd7384a37c 94 }
grzemich 0:d7bd7384a37c 95 if (poolnr > MEMP_POOL_LAST) {
grzemich 0:d7bd7384a37c 96 LWIP_ASSERT("mem_malloc(): no pool is that big!", 0);
grzemich 0:d7bd7384a37c 97 return NULL;
grzemich 0:d7bd7384a37c 98 }
grzemich 0:d7bd7384a37c 99 element = (struct memp_malloc_helper*)memp_malloc(poolnr);
grzemich 0:d7bd7384a37c 100 if (element == NULL) {
grzemich 0:d7bd7384a37c 101 /* No need to DEBUGF or ASSERT: This error is already
grzemich 0:d7bd7384a37c 102 taken care of in memp.c */
grzemich 0:d7bd7384a37c 103 #if MEM_USE_POOLS_TRY_BIGGER_POOL
grzemich 0:d7bd7384a37c 104 /** Try a bigger pool if this one is empty! */
grzemich 0:d7bd7384a37c 105 if (poolnr < MEMP_POOL_LAST) {
grzemich 0:d7bd7384a37c 106 poolnr++;
grzemich 0:d7bd7384a37c 107 goto again;
grzemich 0:d7bd7384a37c 108 }
grzemich 0:d7bd7384a37c 109 #endif /* MEM_USE_POOLS_TRY_BIGGER_POOL */
grzemich 0:d7bd7384a37c 110 return NULL;
grzemich 0:d7bd7384a37c 111 }
grzemich 0:d7bd7384a37c 112
grzemich 0:d7bd7384a37c 113 /* save the pool number this element came from */
grzemich 0:d7bd7384a37c 114 element->poolnr = poolnr;
grzemich 0:d7bd7384a37c 115 /* and return a pointer to the memory directly after the struct memp_malloc_helper */
grzemich 0:d7bd7384a37c 116 element++;
grzemich 0:d7bd7384a37c 117
grzemich 0:d7bd7384a37c 118 return element;
grzemich 0:d7bd7384a37c 119 }
grzemich 0:d7bd7384a37c 120
grzemich 0:d7bd7384a37c 121 /**
grzemich 0:d7bd7384a37c 122 * Free memory previously allocated by mem_malloc. Loads the pool number
grzemich 0:d7bd7384a37c 123 * and calls memp_free with that pool number to put the element back into
grzemich 0:d7bd7384a37c 124 * its pool
grzemich 0:d7bd7384a37c 125 *
grzemich 0:d7bd7384a37c 126 * @param rmem the memory element to free
grzemich 0:d7bd7384a37c 127 */
grzemich 0:d7bd7384a37c 128 void
grzemich 0:d7bd7384a37c 129 mem_free(void *rmem)
grzemich 0:d7bd7384a37c 130 {
grzemich 0:d7bd7384a37c 131 struct memp_malloc_helper *hmem = (struct memp_malloc_helper*)rmem;
grzemich 0:d7bd7384a37c 132
grzemich 0:d7bd7384a37c 133 LWIP_ASSERT("rmem != NULL", (rmem != NULL));
grzemich 0:d7bd7384a37c 134 LWIP_ASSERT("rmem == MEM_ALIGN(rmem)", (rmem == LWIP_MEM_ALIGN(rmem)));
grzemich 0:d7bd7384a37c 135
grzemich 0:d7bd7384a37c 136 /* get the original struct memp_malloc_helper */
grzemich 0:d7bd7384a37c 137 hmem--;
grzemich 0:d7bd7384a37c 138
grzemich 0:d7bd7384a37c 139 LWIP_ASSERT("hmem != NULL", (hmem != NULL));
grzemich 0:d7bd7384a37c 140 LWIP_ASSERT("hmem == MEM_ALIGN(hmem)", (hmem == LWIP_MEM_ALIGN(hmem)));
grzemich 0:d7bd7384a37c 141 LWIP_ASSERT("hmem->poolnr < MEMP_MAX", (hmem->poolnr < MEMP_MAX));
grzemich 0:d7bd7384a37c 142
grzemich 0:d7bd7384a37c 143 /* and put it in the pool we saved earlier */
grzemich 0:d7bd7384a37c 144 memp_free(hmem->poolnr, hmem);
grzemich 0:d7bd7384a37c 145 }
grzemich 0:d7bd7384a37c 146
grzemich 0:d7bd7384a37c 147 #else /* MEM_USE_POOLS */
grzemich 0:d7bd7384a37c 148 /* lwIP replacement for your libc malloc() */
grzemich 0:d7bd7384a37c 149
grzemich 0:d7bd7384a37c 150 /**
grzemich 0:d7bd7384a37c 151 * The heap is made up as a list of structs of this type.
grzemich 0:d7bd7384a37c 152 * This does not have to be aligned since for getting its size,
grzemich 0:d7bd7384a37c 153 * we only use the macro SIZEOF_STRUCT_MEM, which automatically alignes.
grzemich 0:d7bd7384a37c 154 */
grzemich 0:d7bd7384a37c 155 struct mem {
grzemich 0:d7bd7384a37c 156 /** index (-> ram[next]) of the next struct */
grzemich 0:d7bd7384a37c 157 mem_size_t next;
grzemich 0:d7bd7384a37c 158 /** index (-> ram[prev]) of the previous struct */
grzemich 0:d7bd7384a37c 159 mem_size_t prev;
grzemich 0:d7bd7384a37c 160 /** 1: this area is used; 0: this area is unused */
grzemich 0:d7bd7384a37c 161 u8_t used;
grzemich 0:d7bd7384a37c 162 };
grzemich 0:d7bd7384a37c 163
grzemich 0:d7bd7384a37c 164 /** All allocated blocks will be MIN_SIZE bytes big, at least!
grzemich 0:d7bd7384a37c 165 * MIN_SIZE can be overridden to suit your needs. Smaller values save space,
grzemich 0:d7bd7384a37c 166 * larger values could prevent too small blocks to fragment the RAM too much. */
grzemich 0:d7bd7384a37c 167 #ifndef MIN_SIZE
grzemich 0:d7bd7384a37c 168 #define MIN_SIZE 12
grzemich 0:d7bd7384a37c 169 #endif /* MIN_SIZE */
grzemich 0:d7bd7384a37c 170 /* some alignment macros: we define them here for better source code layout */
grzemich 0:d7bd7384a37c 171 #define MIN_SIZE_ALIGNED LWIP_MEM_ALIGN_SIZE(MIN_SIZE)
grzemich 0:d7bd7384a37c 172 #define SIZEOF_STRUCT_MEM LWIP_MEM_ALIGN_SIZE(sizeof(struct mem))
grzemich 0:d7bd7384a37c 173 #define MEM_SIZE_ALIGNED LWIP_MEM_ALIGN_SIZE(MEM_SIZE)
grzemich 0:d7bd7384a37c 174
grzemich 0:d7bd7384a37c 175 /** If you want to relocate the heap to external memory, simply define
grzemich 0:d7bd7384a37c 176 * LWIP_RAM_HEAP_POINTER as a void-pointer to that location.
grzemich 0:d7bd7384a37c 177 * If so, make sure the memory at that location is big enough (see below on
grzemich 0:d7bd7384a37c 178 * how that space is calculated). */
grzemich 0:d7bd7384a37c 179 #ifndef LWIP_RAM_HEAP_POINTER
grzemich 0:d7bd7384a37c 180
grzemich 0:d7bd7384a37c 181 #if defined(TARGET_LPC4088) || defined(TARGET_LPC4088_DM)
grzemich 0:d7bd7384a37c 182 # if defined (__ICCARM__)
grzemich 0:d7bd7384a37c 183 # define ETHMEM_SECTION
grzemich 0:d7bd7384a37c 184 # elif defined(TOOLCHAIN_GCC_CR)
grzemich 0:d7bd7384a37c 185 # define ETHMEM_SECTION __attribute__((section(".data.$RamPeriph32")))
grzemich 0:d7bd7384a37c 186 # else
grzemich 0:d7bd7384a37c 187 # define ETHMEM_SECTION __attribute__((section("AHBSRAM1"),aligned))
grzemich 0:d7bd7384a37c 188 # endif
grzemich 0:d7bd7384a37c 189 #elif defined(TARGET_LPC1768)
grzemich 0:d7bd7384a37c 190 # define ETHMEM_SECTION __attribute((section("AHBSRAM0")))
grzemich 0:d7bd7384a37c 191 #else
grzemich 0:d7bd7384a37c 192 # define ETHMEM_SECTION
grzemich 0:d7bd7384a37c 193 #endif
grzemich 0:d7bd7384a37c 194
grzemich 0:d7bd7384a37c 195 /** the heap. we need one struct mem at the end and some room for alignment */
grzemich 0:d7bd7384a37c 196 u8_t ram_heap[MEM_SIZE_ALIGNED + (2*SIZEOF_STRUCT_MEM) + MEM_ALIGNMENT] ETHMEM_SECTION;
grzemich 0:d7bd7384a37c 197 #define LWIP_RAM_HEAP_POINTER ram_heap
grzemich 0:d7bd7384a37c 198 #endif /* LWIP_RAM_HEAP_POINTER */
grzemich 0:d7bd7384a37c 199
grzemich 0:d7bd7384a37c 200 /** pointer to the heap (ram_heap): for alignment, ram is now a pointer instead of an array */
grzemich 0:d7bd7384a37c 201 static u8_t *ram;
grzemich 0:d7bd7384a37c 202 /** the last entry, always unused! */
grzemich 0:d7bd7384a37c 203 static struct mem *ram_end;
grzemich 0:d7bd7384a37c 204 /** pointer to the lowest free block, this is used for faster search */
grzemich 0:d7bd7384a37c 205 static struct mem *lfree;
grzemich 0:d7bd7384a37c 206
grzemich 0:d7bd7384a37c 207 /** concurrent access protection */
grzemich 0:d7bd7384a37c 208 static sys_mutex_t mem_mutex;
grzemich 0:d7bd7384a37c 209
grzemich 0:d7bd7384a37c 210 #if LWIP_ALLOW_MEM_FREE_FROM_OTHER_CONTEXT
grzemich 0:d7bd7384a37c 211
grzemich 0:d7bd7384a37c 212 static volatile u8_t mem_free_count;
grzemich 0:d7bd7384a37c 213
grzemich 0:d7bd7384a37c 214 /* Allow mem_free from other (e.g. interrupt) context */
grzemich 0:d7bd7384a37c 215 #define LWIP_MEM_FREE_DECL_PROTECT() SYS_ARCH_DECL_PROTECT(lev_free)
grzemich 0:d7bd7384a37c 216 #define LWIP_MEM_FREE_PROTECT() SYS_ARCH_PROTECT(lev_free)
grzemich 0:d7bd7384a37c 217 #define LWIP_MEM_FREE_UNPROTECT() SYS_ARCH_UNPROTECT(lev_free)
grzemich 0:d7bd7384a37c 218 #define LWIP_MEM_ALLOC_DECL_PROTECT() SYS_ARCH_DECL_PROTECT(lev_alloc)
grzemich 0:d7bd7384a37c 219 #define LWIP_MEM_ALLOC_PROTECT() SYS_ARCH_PROTECT(lev_alloc)
grzemich 0:d7bd7384a37c 220 #define LWIP_MEM_ALLOC_UNPROTECT() SYS_ARCH_UNPROTECT(lev_alloc)
grzemich 0:d7bd7384a37c 221
grzemich 0:d7bd7384a37c 222 #else /* LWIP_ALLOW_MEM_FREE_FROM_OTHER_CONTEXT */
grzemich 0:d7bd7384a37c 223
grzemich 0:d7bd7384a37c 224 /* Protect the heap only by using a semaphore */
grzemich 0:d7bd7384a37c 225 #define LWIP_MEM_FREE_DECL_PROTECT()
grzemich 0:d7bd7384a37c 226 #define LWIP_MEM_FREE_PROTECT() sys_mutex_lock(&mem_mutex)
grzemich 0:d7bd7384a37c 227 #define LWIP_MEM_FREE_UNPROTECT() sys_mutex_unlock(&mem_mutex)
grzemich 0:d7bd7384a37c 228 /* mem_malloc is protected using semaphore AND LWIP_MEM_ALLOC_PROTECT */
grzemich 0:d7bd7384a37c 229 #define LWIP_MEM_ALLOC_DECL_PROTECT()
grzemich 0:d7bd7384a37c 230 #define LWIP_MEM_ALLOC_PROTECT()
grzemich 0:d7bd7384a37c 231 #define LWIP_MEM_ALLOC_UNPROTECT()
grzemich 0:d7bd7384a37c 232
grzemich 0:d7bd7384a37c 233 #endif /* LWIP_ALLOW_MEM_FREE_FROM_OTHER_CONTEXT */
grzemich 0:d7bd7384a37c 234
grzemich 0:d7bd7384a37c 235
grzemich 0:d7bd7384a37c 236 /**
grzemich 0:d7bd7384a37c 237 * "Plug holes" by combining adjacent empty struct mems.
grzemich 0:d7bd7384a37c 238 * After this function is through, there should not exist
grzemich 0:d7bd7384a37c 239 * one empty struct mem pointing to another empty struct mem.
grzemich 0:d7bd7384a37c 240 *
grzemich 0:d7bd7384a37c 241 * @param mem this points to a struct mem which just has been freed
grzemich 0:d7bd7384a37c 242 * @internal this function is only called by mem_free() and mem_trim()
grzemich 0:d7bd7384a37c 243 *
grzemich 0:d7bd7384a37c 244 * This assumes access to the heap is protected by the calling function
grzemich 0:d7bd7384a37c 245 * already.
grzemich 0:d7bd7384a37c 246 */
grzemich 0:d7bd7384a37c 247 static void
grzemich 0:d7bd7384a37c 248 plug_holes(struct mem *mem)
grzemich 0:d7bd7384a37c 249 {
grzemich 0:d7bd7384a37c 250 struct mem *nmem;
grzemich 0:d7bd7384a37c 251 struct mem *pmem;
grzemich 0:d7bd7384a37c 252
grzemich 0:d7bd7384a37c 253 LWIP_ASSERT("plug_holes: mem >= ram", (u8_t *)mem >= ram);
grzemich 0:d7bd7384a37c 254 LWIP_ASSERT("plug_holes: mem < ram_end", (u8_t *)mem < (u8_t *)ram_end);
grzemich 0:d7bd7384a37c 255 LWIP_ASSERT("plug_holes: mem->used == 0", mem->used == 0);
grzemich 0:d7bd7384a37c 256
grzemich 0:d7bd7384a37c 257 /* plug hole forward */
grzemich 0:d7bd7384a37c 258 LWIP_ASSERT("plug_holes: mem->next <= MEM_SIZE_ALIGNED", mem->next <= MEM_SIZE_ALIGNED);
grzemich 0:d7bd7384a37c 259
grzemich 0:d7bd7384a37c 260 nmem = (struct mem *)(void *)&ram[mem->next];
grzemich 0:d7bd7384a37c 261 if (mem != nmem && nmem->used == 0 && (u8_t *)nmem != (u8_t *)ram_end) {
grzemich 0:d7bd7384a37c 262 /* if mem->next is unused and not end of ram, combine mem and mem->next */
grzemich 0:d7bd7384a37c 263 if (lfree == nmem) {
grzemich 0:d7bd7384a37c 264 lfree = mem;
grzemich 0:d7bd7384a37c 265 }
grzemich 0:d7bd7384a37c 266 mem->next = nmem->next;
grzemich 0:d7bd7384a37c 267 ((struct mem *)(void *)&ram[nmem->next])->prev = (mem_size_t)((u8_t *)mem - ram);
grzemich 0:d7bd7384a37c 268 }
grzemich 0:d7bd7384a37c 269
grzemich 0:d7bd7384a37c 270 /* plug hole backward */
grzemich 0:d7bd7384a37c 271 pmem = (struct mem *)(void *)&ram[mem->prev];
grzemich 0:d7bd7384a37c 272 if (pmem != mem && pmem->used == 0) {
grzemich 0:d7bd7384a37c 273 /* if mem->prev is unused, combine mem and mem->prev */
grzemich 0:d7bd7384a37c 274 if (lfree == mem) {
grzemich 0:d7bd7384a37c 275 lfree = pmem;
grzemich 0:d7bd7384a37c 276 }
grzemich 0:d7bd7384a37c 277 pmem->next = mem->next;
grzemich 0:d7bd7384a37c 278 ((struct mem *)(void *)&ram[mem->next])->prev = (mem_size_t)((u8_t *)pmem - ram);
grzemich 0:d7bd7384a37c 279 }
grzemich 0:d7bd7384a37c 280 }
grzemich 0:d7bd7384a37c 281
grzemich 0:d7bd7384a37c 282 /**
grzemich 0:d7bd7384a37c 283 * Zero the heap and initialize start, end and lowest-free
grzemich 0:d7bd7384a37c 284 */
grzemich 0:d7bd7384a37c 285 void
grzemich 0:d7bd7384a37c 286 mem_init(void)
grzemich 0:d7bd7384a37c 287 {
grzemich 0:d7bd7384a37c 288 struct mem *mem;
grzemich 0:d7bd7384a37c 289
grzemich 0:d7bd7384a37c 290 LWIP_ASSERT("Sanity check alignment",
grzemich 0:d7bd7384a37c 291 (SIZEOF_STRUCT_MEM & (MEM_ALIGNMENT-1)) == 0);
grzemich 0:d7bd7384a37c 292
grzemich 0:d7bd7384a37c 293 /* align the heap */
grzemich 0:d7bd7384a37c 294 ram = (u8_t *)LWIP_MEM_ALIGN(LWIP_RAM_HEAP_POINTER);
grzemich 0:d7bd7384a37c 295 /* initialize the start of the heap */
grzemich 0:d7bd7384a37c 296 mem = (struct mem *)(void *)ram;
grzemich 0:d7bd7384a37c 297 mem->next = MEM_SIZE_ALIGNED;
grzemich 0:d7bd7384a37c 298 mem->prev = 0;
grzemich 0:d7bd7384a37c 299 mem->used = 0;
grzemich 0:d7bd7384a37c 300 /* initialize the end of the heap */
grzemich 0:d7bd7384a37c 301 ram_end = (struct mem *)(void *)&ram[MEM_SIZE_ALIGNED];
grzemich 0:d7bd7384a37c 302 ram_end->used = 1;
grzemich 0:d7bd7384a37c 303 ram_end->next = MEM_SIZE_ALIGNED;
grzemich 0:d7bd7384a37c 304 ram_end->prev = MEM_SIZE_ALIGNED;
grzemich 0:d7bd7384a37c 305
grzemich 0:d7bd7384a37c 306 /* initialize the lowest-free pointer to the start of the heap */
grzemich 0:d7bd7384a37c 307 lfree = (struct mem *)(void *)ram;
grzemich 0:d7bd7384a37c 308
grzemich 0:d7bd7384a37c 309 MEM_STATS_AVAIL(avail, MEM_SIZE_ALIGNED);
grzemich 0:d7bd7384a37c 310
grzemich 0:d7bd7384a37c 311 if(sys_mutex_new(&mem_mutex) != ERR_OK) {
grzemich 0:d7bd7384a37c 312 LWIP_ASSERT("failed to create mem_mutex", 0);
grzemich 0:d7bd7384a37c 313 }
grzemich 0:d7bd7384a37c 314 }
grzemich 0:d7bd7384a37c 315
grzemich 0:d7bd7384a37c 316 /**
grzemich 0:d7bd7384a37c 317 * Put a struct mem back on the heap
grzemich 0:d7bd7384a37c 318 *
grzemich 0:d7bd7384a37c 319 * @param rmem is the data portion of a struct mem as returned by a previous
grzemich 0:d7bd7384a37c 320 * call to mem_malloc()
grzemich 0:d7bd7384a37c 321 */
grzemich 0:d7bd7384a37c 322 void
grzemich 0:d7bd7384a37c 323 mem_free(void *rmem)
grzemich 0:d7bd7384a37c 324 {
grzemich 0:d7bd7384a37c 325 struct mem *mem;
grzemich 0:d7bd7384a37c 326 LWIP_MEM_FREE_DECL_PROTECT();
grzemich 0:d7bd7384a37c 327
grzemich 0:d7bd7384a37c 328 if (rmem == NULL) {
grzemich 0:d7bd7384a37c 329 LWIP_DEBUGF(MEM_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_LEVEL_SERIOUS, ("mem_free(p == NULL) was called.\n"));
grzemich 0:d7bd7384a37c 330 return;
grzemich 0:d7bd7384a37c 331 }
grzemich 0:d7bd7384a37c 332 LWIP_ASSERT("mem_free: sanity check alignment", (((mem_ptr_t)rmem) & (MEM_ALIGNMENT-1)) == 0);
grzemich 0:d7bd7384a37c 333
grzemich 0:d7bd7384a37c 334 LWIP_ASSERT("mem_free: legal memory", (u8_t *)rmem >= (u8_t *)ram &&
grzemich 0:d7bd7384a37c 335 (u8_t *)rmem < (u8_t *)ram_end);
grzemich 0:d7bd7384a37c 336
grzemich 0:d7bd7384a37c 337 if ((u8_t *)rmem < (u8_t *)ram || (u8_t *)rmem >= (u8_t *)ram_end) {
grzemich 0:d7bd7384a37c 338 SYS_ARCH_DECL_PROTECT(lev);
grzemich 0:d7bd7384a37c 339 LWIP_DEBUGF(MEM_DEBUG | LWIP_DBG_LEVEL_SEVERE, ("mem_free: illegal memory\n"));
grzemich 0:d7bd7384a37c 340 /* protect mem stats from concurrent access */
grzemich 0:d7bd7384a37c 341 SYS_ARCH_PROTECT(lev);
grzemich 0:d7bd7384a37c 342 MEM_STATS_INC(illegal);
grzemich 0:d7bd7384a37c 343 SYS_ARCH_UNPROTECT(lev);
grzemich 0:d7bd7384a37c 344 return;
grzemich 0:d7bd7384a37c 345 }
grzemich 0:d7bd7384a37c 346 /* protect the heap from concurrent access */
grzemich 0:d7bd7384a37c 347 LWIP_MEM_FREE_PROTECT();
grzemich 0:d7bd7384a37c 348 /* Get the corresponding struct mem ... */
grzemich 0:d7bd7384a37c 349 mem = (struct mem *)(void *)((u8_t *)rmem - SIZEOF_STRUCT_MEM);
grzemich 0:d7bd7384a37c 350 /* ... which has to be in a used state ... */
grzemich 0:d7bd7384a37c 351 LWIP_ASSERT("mem_free: mem->used", mem->used);
grzemich 0:d7bd7384a37c 352 /* ... and is now unused. */
grzemich 0:d7bd7384a37c 353 mem->used = 0;
grzemich 0:d7bd7384a37c 354
grzemich 0:d7bd7384a37c 355 if (mem < lfree) {
grzemich 0:d7bd7384a37c 356 /* the newly freed struct is now the lowest */
grzemich 0:d7bd7384a37c 357 lfree = mem;
grzemich 0:d7bd7384a37c 358 }
grzemich 0:d7bd7384a37c 359
grzemich 0:d7bd7384a37c 360 MEM_STATS_DEC_USED(used, mem->next - (mem_size_t)(((u8_t *)mem - ram)));
grzemich 0:d7bd7384a37c 361
grzemich 0:d7bd7384a37c 362 /* finally, see if prev or next are free also */
grzemich 0:d7bd7384a37c 363 plug_holes(mem);
grzemich 0:d7bd7384a37c 364 #if LWIP_ALLOW_MEM_FREE_FROM_OTHER_CONTEXT
grzemich 0:d7bd7384a37c 365 mem_free_count = 1;
grzemich 0:d7bd7384a37c 366 #endif /* LWIP_ALLOW_MEM_FREE_FROM_OTHER_CONTEXT */
grzemich 0:d7bd7384a37c 367 LWIP_MEM_FREE_UNPROTECT();
grzemich 0:d7bd7384a37c 368 }
grzemich 0:d7bd7384a37c 369
grzemich 0:d7bd7384a37c 370 /**
grzemich 0:d7bd7384a37c 371 * Shrink memory returned by mem_malloc().
grzemich 0:d7bd7384a37c 372 *
grzemich 0:d7bd7384a37c 373 * @param rmem pointer to memory allocated by mem_malloc the is to be shrinked
grzemich 0:d7bd7384a37c 374 * @param newsize required size after shrinking (needs to be smaller than or
grzemich 0:d7bd7384a37c 375 * equal to the previous size)
grzemich 0:d7bd7384a37c 376 * @return for compatibility reasons: is always == rmem, at the moment
grzemich 0:d7bd7384a37c 377 * or NULL if newsize is > old size, in which case rmem is NOT touched
grzemich 0:d7bd7384a37c 378 * or freed!
grzemich 0:d7bd7384a37c 379 */
grzemich 0:d7bd7384a37c 380 void *
grzemich 0:d7bd7384a37c 381 mem_trim(void *rmem, mem_size_t newsize)
grzemich 0:d7bd7384a37c 382 {
grzemich 0:d7bd7384a37c 383 mem_size_t size;
grzemich 0:d7bd7384a37c 384 mem_size_t ptr, ptr2;
grzemich 0:d7bd7384a37c 385 struct mem *mem, *mem2;
grzemich 0:d7bd7384a37c 386 /* use the FREE_PROTECT here: it protects with sem OR SYS_ARCH_PROTECT */
grzemich 0:d7bd7384a37c 387 LWIP_MEM_FREE_DECL_PROTECT();
grzemich 0:d7bd7384a37c 388
grzemich 0:d7bd7384a37c 389 /* Expand the size of the allocated memory region so that we can
grzemich 0:d7bd7384a37c 390 adjust for alignment. */
grzemich 0:d7bd7384a37c 391 newsize = LWIP_MEM_ALIGN_SIZE(newsize);
grzemich 0:d7bd7384a37c 392
grzemich 0:d7bd7384a37c 393 if(newsize < MIN_SIZE_ALIGNED) {
grzemich 0:d7bd7384a37c 394 /* every data block must be at least MIN_SIZE_ALIGNED long */
grzemich 0:d7bd7384a37c 395 newsize = MIN_SIZE_ALIGNED;
grzemich 0:d7bd7384a37c 396 }
grzemich 0:d7bd7384a37c 397
grzemich 0:d7bd7384a37c 398 if (newsize > MEM_SIZE_ALIGNED) {
grzemich 0:d7bd7384a37c 399 return NULL;
grzemich 0:d7bd7384a37c 400 }
grzemich 0:d7bd7384a37c 401
grzemich 0:d7bd7384a37c 402 LWIP_ASSERT("mem_trim: legal memory", (u8_t *)rmem >= (u8_t *)ram &&
grzemich 0:d7bd7384a37c 403 (u8_t *)rmem < (u8_t *)ram_end);
grzemich 0:d7bd7384a37c 404
grzemich 0:d7bd7384a37c 405 if ((u8_t *)rmem < (u8_t *)ram || (u8_t *)rmem >= (u8_t *)ram_end) {
grzemich 0:d7bd7384a37c 406 SYS_ARCH_DECL_PROTECT(lev);
grzemich 0:d7bd7384a37c 407 LWIP_DEBUGF(MEM_DEBUG | LWIP_DBG_LEVEL_SEVERE, ("mem_trim: illegal memory\n"));
grzemich 0:d7bd7384a37c 408 /* protect mem stats from concurrent access */
grzemich 0:d7bd7384a37c 409 SYS_ARCH_PROTECT(lev);
grzemich 0:d7bd7384a37c 410 MEM_STATS_INC(illegal);
grzemich 0:d7bd7384a37c 411 SYS_ARCH_UNPROTECT(lev);
grzemich 0:d7bd7384a37c 412 return rmem;
grzemich 0:d7bd7384a37c 413 }
grzemich 0:d7bd7384a37c 414 /* Get the corresponding struct mem ... */
grzemich 0:d7bd7384a37c 415 mem = (struct mem *)(void *)((u8_t *)rmem - SIZEOF_STRUCT_MEM);
grzemich 0:d7bd7384a37c 416 /* ... and its offset pointer */
grzemich 0:d7bd7384a37c 417 ptr = (mem_size_t)((u8_t *)mem - ram);
grzemich 0:d7bd7384a37c 418
grzemich 0:d7bd7384a37c 419 size = mem->next - ptr - SIZEOF_STRUCT_MEM;
grzemich 0:d7bd7384a37c 420 LWIP_ASSERT("mem_trim can only shrink memory", newsize <= size);
grzemich 0:d7bd7384a37c 421 if (newsize > size) {
grzemich 0:d7bd7384a37c 422 /* not supported */
grzemich 0:d7bd7384a37c 423 return NULL;
grzemich 0:d7bd7384a37c 424 }
grzemich 0:d7bd7384a37c 425 if (newsize == size) {
grzemich 0:d7bd7384a37c 426 /* No change in size, simply return */
grzemich 0:d7bd7384a37c 427 return rmem;
grzemich 0:d7bd7384a37c 428 }
grzemich 0:d7bd7384a37c 429
grzemich 0:d7bd7384a37c 430 /* protect the heap from concurrent access */
grzemich 0:d7bd7384a37c 431 LWIP_MEM_FREE_PROTECT();
grzemich 0:d7bd7384a37c 432
grzemich 0:d7bd7384a37c 433 mem2 = (struct mem *)(void *)&ram[mem->next];
grzemich 0:d7bd7384a37c 434 if(mem2->used == 0) {
grzemich 0:d7bd7384a37c 435 /* The next struct is unused, we can simply move it at little */
grzemich 0:d7bd7384a37c 436 mem_size_t next;
grzemich 0:d7bd7384a37c 437 /* remember the old next pointer */
grzemich 0:d7bd7384a37c 438 next = mem2->next;
grzemich 0:d7bd7384a37c 439 /* create new struct mem which is moved directly after the shrinked mem */
grzemich 0:d7bd7384a37c 440 ptr2 = ptr + SIZEOF_STRUCT_MEM + newsize;
grzemich 0:d7bd7384a37c 441 if (lfree == mem2) {
grzemich 0:d7bd7384a37c 442 lfree = (struct mem *)(void *)&ram[ptr2];
grzemich 0:d7bd7384a37c 443 }
grzemich 0:d7bd7384a37c 444 mem2 = (struct mem *)(void *)&ram[ptr2];
grzemich 0:d7bd7384a37c 445 mem2->used = 0;
grzemich 0:d7bd7384a37c 446 /* restore the next pointer */
grzemich 0:d7bd7384a37c 447 mem2->next = next;
grzemich 0:d7bd7384a37c 448 /* link it back to mem */
grzemich 0:d7bd7384a37c 449 mem2->prev = ptr;
grzemich 0:d7bd7384a37c 450 /* link mem to it */
grzemich 0:d7bd7384a37c 451 mem->next = ptr2;
grzemich 0:d7bd7384a37c 452 /* last thing to restore linked list: as we have moved mem2,
grzemich 0:d7bd7384a37c 453 * let 'mem2->next->prev' point to mem2 again. but only if mem2->next is not
grzemich 0:d7bd7384a37c 454 * the end of the heap */
grzemich 0:d7bd7384a37c 455 if (mem2->next != MEM_SIZE_ALIGNED) {
grzemich 0:d7bd7384a37c 456 ((struct mem *)(void *)&ram[mem2->next])->prev = ptr2;
grzemich 0:d7bd7384a37c 457 }
grzemich 0:d7bd7384a37c 458 MEM_STATS_DEC_USED(used, (size - newsize));
grzemich 0:d7bd7384a37c 459 /* no need to plug holes, we've already done that */
grzemich 0:d7bd7384a37c 460 } else if (newsize + SIZEOF_STRUCT_MEM + MIN_SIZE_ALIGNED <= size) {
grzemich 0:d7bd7384a37c 461 /* Next struct is used but there's room for another struct mem with
grzemich 0:d7bd7384a37c 462 * at least MIN_SIZE_ALIGNED of data.
grzemich 0:d7bd7384a37c 463 * Old size ('size') must be big enough to contain at least 'newsize' plus a struct mem
grzemich 0:d7bd7384a37c 464 * ('SIZEOF_STRUCT_MEM') with some data ('MIN_SIZE_ALIGNED').
grzemich 0:d7bd7384a37c 465 * @todo we could leave out MIN_SIZE_ALIGNED. We would create an empty
grzemich 0:d7bd7384a37c 466 * region that couldn't hold data, but when mem->next gets freed,
grzemich 0:d7bd7384a37c 467 * the 2 regions would be combined, resulting in more free memory */
grzemich 0:d7bd7384a37c 468 ptr2 = ptr + SIZEOF_STRUCT_MEM + newsize;
grzemich 0:d7bd7384a37c 469 mem2 = (struct mem *)(void *)&ram[ptr2];
grzemich 0:d7bd7384a37c 470 if (mem2 < lfree) {
grzemich 0:d7bd7384a37c 471 lfree = mem2;
grzemich 0:d7bd7384a37c 472 }
grzemich 0:d7bd7384a37c 473 mem2->used = 0;
grzemich 0:d7bd7384a37c 474 mem2->next = mem->next;
grzemich 0:d7bd7384a37c 475 mem2->prev = ptr;
grzemich 0:d7bd7384a37c 476 mem->next = ptr2;
grzemich 0:d7bd7384a37c 477 if (mem2->next != MEM_SIZE_ALIGNED) {
grzemich 0:d7bd7384a37c 478 ((struct mem *)(void *)&ram[mem2->next])->prev = ptr2;
grzemich 0:d7bd7384a37c 479 }
grzemich 0:d7bd7384a37c 480 MEM_STATS_DEC_USED(used, (size - newsize));
grzemich 0:d7bd7384a37c 481 /* the original mem->next is used, so no need to plug holes! */
grzemich 0:d7bd7384a37c 482 }
grzemich 0:d7bd7384a37c 483 /* else {
grzemich 0:d7bd7384a37c 484 next struct mem is used but size between mem and mem2 is not big enough
grzemich 0:d7bd7384a37c 485 to create another struct mem
grzemich 0:d7bd7384a37c 486 -> don't do anyhting.
grzemich 0:d7bd7384a37c 487 -> the remaining space stays unused since it is too small
grzemich 0:d7bd7384a37c 488 } */
grzemich 0:d7bd7384a37c 489 #if LWIP_ALLOW_MEM_FREE_FROM_OTHER_CONTEXT
grzemich 0:d7bd7384a37c 490 mem_free_count = 1;
grzemich 0:d7bd7384a37c 491 #endif /* LWIP_ALLOW_MEM_FREE_FROM_OTHER_CONTEXT */
grzemich 0:d7bd7384a37c 492 LWIP_MEM_FREE_UNPROTECT();
grzemich 0:d7bd7384a37c 493 return rmem;
grzemich 0:d7bd7384a37c 494 }
grzemich 0:d7bd7384a37c 495
grzemich 0:d7bd7384a37c 496 /**
grzemich 0:d7bd7384a37c 497 * Adam's mem_malloc() plus solution for bug #17922
grzemich 0:d7bd7384a37c 498 * Allocate a block of memory with a minimum of 'size' bytes.
grzemich 0:d7bd7384a37c 499 *
grzemich 0:d7bd7384a37c 500 * @param size is the minimum size of the requested block in bytes.
grzemich 0:d7bd7384a37c 501 * @return pointer to allocated memory or NULL if no free memory was found.
grzemich 0:d7bd7384a37c 502 *
grzemich 0:d7bd7384a37c 503 * Note that the returned value will always be aligned (as defined by MEM_ALIGNMENT).
grzemich 0:d7bd7384a37c 504 */
grzemich 0:d7bd7384a37c 505 void *
grzemich 0:d7bd7384a37c 506 mem_malloc(mem_size_t size)
grzemich 0:d7bd7384a37c 507 {
grzemich 0:d7bd7384a37c 508 mem_size_t ptr, ptr2;
grzemich 0:d7bd7384a37c 509 struct mem *mem, *mem2;
grzemich 0:d7bd7384a37c 510 #if LWIP_ALLOW_MEM_FREE_FROM_OTHER_CONTEXT
grzemich 0:d7bd7384a37c 511 u8_t local_mem_free_count = 0;
grzemich 0:d7bd7384a37c 512 #endif /* LWIP_ALLOW_MEM_FREE_FROM_OTHER_CONTEXT */
grzemich 0:d7bd7384a37c 513 LWIP_MEM_ALLOC_DECL_PROTECT();
grzemich 0:d7bd7384a37c 514
grzemich 0:d7bd7384a37c 515 if (size == 0) {
grzemich 0:d7bd7384a37c 516 return NULL;
grzemich 0:d7bd7384a37c 517 }
grzemich 0:d7bd7384a37c 518
grzemich 0:d7bd7384a37c 519 /* Expand the size of the allocated memory region so that we can
grzemich 0:d7bd7384a37c 520 adjust for alignment. */
grzemich 0:d7bd7384a37c 521 size = LWIP_MEM_ALIGN_SIZE(size);
grzemich 0:d7bd7384a37c 522
grzemich 0:d7bd7384a37c 523 if(size < MIN_SIZE_ALIGNED) {
grzemich 0:d7bd7384a37c 524 /* every data block must be at least MIN_SIZE_ALIGNED long */
grzemich 0:d7bd7384a37c 525 size = MIN_SIZE_ALIGNED;
grzemich 0:d7bd7384a37c 526 }
grzemich 0:d7bd7384a37c 527
grzemich 0:d7bd7384a37c 528 if (size > MEM_SIZE_ALIGNED) {
grzemich 0:d7bd7384a37c 529 return NULL;
grzemich 0:d7bd7384a37c 530 }
grzemich 0:d7bd7384a37c 531
grzemich 0:d7bd7384a37c 532 /* protect the heap from concurrent access */
grzemich 0:d7bd7384a37c 533 sys_mutex_lock(&mem_mutex);
grzemich 0:d7bd7384a37c 534 LWIP_MEM_ALLOC_PROTECT();
grzemich 0:d7bd7384a37c 535 #if LWIP_ALLOW_MEM_FREE_FROM_OTHER_CONTEXT
grzemich 0:d7bd7384a37c 536 /* run as long as a mem_free disturbed mem_malloc */
grzemich 0:d7bd7384a37c 537 do {
grzemich 0:d7bd7384a37c 538 local_mem_free_count = 0;
grzemich 0:d7bd7384a37c 539 #endif /* LWIP_ALLOW_MEM_FREE_FROM_OTHER_CONTEXT */
grzemich 0:d7bd7384a37c 540
grzemich 0:d7bd7384a37c 541 /* Scan through the heap searching for a free block that is big enough,
grzemich 0:d7bd7384a37c 542 * beginning with the lowest free block.
grzemich 0:d7bd7384a37c 543 */
grzemich 0:d7bd7384a37c 544 for (ptr = (mem_size_t)((u8_t *)lfree - ram); ptr < MEM_SIZE_ALIGNED - size;
grzemich 0:d7bd7384a37c 545 ptr = ((struct mem *)(void *)&ram[ptr])->next) {
grzemich 0:d7bd7384a37c 546 mem = (struct mem *)(void *)&ram[ptr];
grzemich 0:d7bd7384a37c 547 #if LWIP_ALLOW_MEM_FREE_FROM_OTHER_CONTEXT
grzemich 0:d7bd7384a37c 548 mem_free_count = 0;
grzemich 0:d7bd7384a37c 549 LWIP_MEM_ALLOC_UNPROTECT();
grzemich 0:d7bd7384a37c 550 /* allow mem_free to run */
grzemich 0:d7bd7384a37c 551 LWIP_MEM_ALLOC_PROTECT();
grzemich 0:d7bd7384a37c 552 if (mem_free_count != 0) {
grzemich 0:d7bd7384a37c 553 local_mem_free_count = mem_free_count;
grzemich 0:d7bd7384a37c 554 }
grzemich 0:d7bd7384a37c 555 mem_free_count = 0;
grzemich 0:d7bd7384a37c 556 #endif /* LWIP_ALLOW_MEM_FREE_FROM_OTHER_CONTEXT */
grzemich 0:d7bd7384a37c 557
grzemich 0:d7bd7384a37c 558 if ((!mem->used) &&
grzemich 0:d7bd7384a37c 559 (mem->next - (ptr + SIZEOF_STRUCT_MEM)) >= size) {
grzemich 0:d7bd7384a37c 560 /* mem is not used and at least perfect fit is possible:
grzemich 0:d7bd7384a37c 561 * mem->next - (ptr + SIZEOF_STRUCT_MEM) gives us the 'user data size' of mem */
grzemich 0:d7bd7384a37c 562
grzemich 0:d7bd7384a37c 563 if (mem->next - (ptr + SIZEOF_STRUCT_MEM) >= (size + SIZEOF_STRUCT_MEM + MIN_SIZE_ALIGNED)) {
grzemich 0:d7bd7384a37c 564 /* (in addition to the above, we test if another struct mem (SIZEOF_STRUCT_MEM) containing
grzemich 0:d7bd7384a37c 565 * at least MIN_SIZE_ALIGNED of data also fits in the 'user data space' of 'mem')
grzemich 0:d7bd7384a37c 566 * -> split large block, create empty remainder,
grzemich 0:d7bd7384a37c 567 * remainder must be large enough to contain MIN_SIZE_ALIGNED data: if
grzemich 0:d7bd7384a37c 568 * mem->next - (ptr + (2*SIZEOF_STRUCT_MEM)) == size,
grzemich 0:d7bd7384a37c 569 * struct mem would fit in but no data between mem2 and mem2->next
grzemich 0:d7bd7384a37c 570 * @todo we could leave out MIN_SIZE_ALIGNED. We would create an empty
grzemich 0:d7bd7384a37c 571 * region that couldn't hold data, but when mem->next gets freed,
grzemich 0:d7bd7384a37c 572 * the 2 regions would be combined, resulting in more free memory
grzemich 0:d7bd7384a37c 573 */
grzemich 0:d7bd7384a37c 574 ptr2 = ptr + SIZEOF_STRUCT_MEM + size;
grzemich 0:d7bd7384a37c 575 /* create mem2 struct */
grzemich 0:d7bd7384a37c 576 mem2 = (struct mem *)(void *)&ram[ptr2];
grzemich 0:d7bd7384a37c 577 mem2->used = 0;
grzemich 0:d7bd7384a37c 578 mem2->next = mem->next;
grzemich 0:d7bd7384a37c 579 mem2->prev = ptr;
grzemich 0:d7bd7384a37c 580 /* and insert it between mem and mem->next */
grzemich 0:d7bd7384a37c 581 mem->next = ptr2;
grzemich 0:d7bd7384a37c 582 mem->used = 1;
grzemich 0:d7bd7384a37c 583
grzemich 0:d7bd7384a37c 584 if (mem2->next != MEM_SIZE_ALIGNED) {
grzemich 0:d7bd7384a37c 585 ((struct mem *)(void *)&ram[mem2->next])->prev = ptr2;
grzemich 0:d7bd7384a37c 586 }
grzemich 0:d7bd7384a37c 587 MEM_STATS_INC_USED(used, (size + SIZEOF_STRUCT_MEM));
grzemich 0:d7bd7384a37c 588 } else {
grzemich 0:d7bd7384a37c 589 /* (a mem2 struct does no fit into the user data space of mem and mem->next will always
grzemich 0:d7bd7384a37c 590 * be used at this point: if not we have 2 unused structs in a row, plug_holes should have
grzemich 0:d7bd7384a37c 591 * take care of this).
grzemich 0:d7bd7384a37c 592 * -> near fit or excact fit: do not split, no mem2 creation
grzemich 0:d7bd7384a37c 593 * also can't move mem->next directly behind mem, since mem->next
grzemich 0:d7bd7384a37c 594 * will always be used at this point!
grzemich 0:d7bd7384a37c 595 */
grzemich 0:d7bd7384a37c 596 mem->used = 1;
grzemich 0:d7bd7384a37c 597 MEM_STATS_INC_USED(used, mem->next - (mem_size_t)((u8_t *)mem - ram));
grzemich 0:d7bd7384a37c 598 }
grzemich 0:d7bd7384a37c 599
grzemich 0:d7bd7384a37c 600 if (mem == lfree) {
grzemich 0:d7bd7384a37c 601 /* Find next free block after mem and update lowest free pointer */
grzemich 0:d7bd7384a37c 602 while (lfree->used && lfree != ram_end) {
grzemich 0:d7bd7384a37c 603 LWIP_MEM_ALLOC_UNPROTECT();
grzemich 0:d7bd7384a37c 604 /* prevent high interrupt latency... */
grzemich 0:d7bd7384a37c 605 LWIP_MEM_ALLOC_PROTECT();
grzemich 0:d7bd7384a37c 606 lfree = (struct mem *)(void *)&ram[lfree->next];
grzemich 0:d7bd7384a37c 607 }
grzemich 0:d7bd7384a37c 608 LWIP_ASSERT("mem_malloc: !lfree->used", ((lfree == ram_end) || (!lfree->used)));
grzemich 0:d7bd7384a37c 609 }
grzemich 0:d7bd7384a37c 610 LWIP_MEM_ALLOC_UNPROTECT();
grzemich 0:d7bd7384a37c 611 sys_mutex_unlock(&mem_mutex);
grzemich 0:d7bd7384a37c 612 LWIP_ASSERT("mem_malloc: allocated memory not above ram_end.",
grzemich 0:d7bd7384a37c 613 (mem_ptr_t)mem + SIZEOF_STRUCT_MEM + size <= (mem_ptr_t)ram_end);
grzemich 0:d7bd7384a37c 614 LWIP_ASSERT("mem_malloc: allocated memory properly aligned.",
grzemich 0:d7bd7384a37c 615 ((mem_ptr_t)mem + SIZEOF_STRUCT_MEM) % MEM_ALIGNMENT == 0);
grzemich 0:d7bd7384a37c 616 LWIP_ASSERT("mem_malloc: sanity check alignment",
grzemich 0:d7bd7384a37c 617 (((mem_ptr_t)mem) & (MEM_ALIGNMENT-1)) == 0);
grzemich 0:d7bd7384a37c 618
grzemich 0:d7bd7384a37c 619 return (u8_t *)mem + SIZEOF_STRUCT_MEM;
grzemich 0:d7bd7384a37c 620 }
grzemich 0:d7bd7384a37c 621 }
grzemich 0:d7bd7384a37c 622 #if LWIP_ALLOW_MEM_FREE_FROM_OTHER_CONTEXT
grzemich 0:d7bd7384a37c 623 /* if we got interrupted by a mem_free, try again */
grzemich 0:d7bd7384a37c 624 } while(local_mem_free_count != 0);
grzemich 0:d7bd7384a37c 625 #endif /* LWIP_ALLOW_MEM_FREE_FROM_OTHER_CONTEXT */
grzemich 0:d7bd7384a37c 626 LWIP_DEBUGF(MEM_DEBUG | LWIP_DBG_LEVEL_SERIOUS, ("mem_malloc: could not allocate %"S16_F" bytes\n", (s16_t)size));
grzemich 0:d7bd7384a37c 627 MEM_STATS_INC(err);
grzemich 0:d7bd7384a37c 628 LWIP_MEM_ALLOC_UNPROTECT();
grzemich 0:d7bd7384a37c 629 sys_mutex_unlock(&mem_mutex);
grzemich 0:d7bd7384a37c 630 return NULL;
grzemich 0:d7bd7384a37c 631 }
grzemich 0:d7bd7384a37c 632
grzemich 0:d7bd7384a37c 633 #endif /* MEM_USE_POOLS */
grzemich 0:d7bd7384a37c 634 /**
grzemich 0:d7bd7384a37c 635 * Contiguously allocates enough space for count objects that are size bytes
grzemich 0:d7bd7384a37c 636 * of memory each and returns a pointer to the allocated memory.
grzemich 0:d7bd7384a37c 637 *
grzemich 0:d7bd7384a37c 638 * The allocated memory is filled with bytes of value zero.
grzemich 0:d7bd7384a37c 639 *
grzemich 0:d7bd7384a37c 640 * @param count number of objects to allocate
grzemich 0:d7bd7384a37c 641 * @param size size of the objects to allocate
grzemich 0:d7bd7384a37c 642 * @return pointer to allocated memory / NULL pointer if there is an error
grzemich 0:d7bd7384a37c 643 */
grzemich 0:d7bd7384a37c 644 void *mem_calloc(mem_size_t count, mem_size_t size)
grzemich 0:d7bd7384a37c 645 {
grzemich 0:d7bd7384a37c 646 void *p;
grzemich 0:d7bd7384a37c 647
grzemich 0:d7bd7384a37c 648 /* allocate 'count' objects of size 'size' */
grzemich 0:d7bd7384a37c 649 p = mem_malloc(count * size);
grzemich 0:d7bd7384a37c 650 if (p) {
grzemich 0:d7bd7384a37c 651 /* zero the memory */
grzemich 0:d7bd7384a37c 652 memset(p, 0, count * size);
grzemich 0:d7bd7384a37c 653 }
grzemich 0:d7bd7384a37c 654 return p;
grzemich 0:d7bd7384a37c 655 }
grzemich 0:d7bd7384a37c 656
grzemich 0:d7bd7384a37c 657 #endif /* !MEM_LIBC_MALLOC */