Nino Der Kinderen / Mbed 2 deprecated InetTest

Embedded C project:18/12/2014

Dependencies:   DS1307 TextLCD mbed

NetServices/lwip/core/mem.c@0:8d87bc453349, 2014-12-18 (annotated)

Committer:
ninoderkinderen
Date:
Thu Dec 18 09:35:49 2014 +0000
Revision:
0:8d87bc453349
Programma embedded C

Who changed what in which revision?

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