git.sur5r.net Git - freertos/blob - FreeRTOS/Source/portable/MemMang/heap_2.c

   1 /*\r
   2     FreeRTOS V7.3.0 - Copyright (C) 2012 Real Time Engineers Ltd.\r
   3 \r
   4     FEATURES AND PORTS ARE ADDED TO FREERTOS ALL THE TIME.  PLEASE VISIT \r
   5     http://www.FreeRTOS.org TO ENSURE YOU ARE USING THE LATEST VERSION.\r
   6 \r
   7     ***************************************************************************\r
   8      *                                                                       *\r
   9      *    FreeRTOS tutorial books are available in pdf and paperback.        *\r
  10      *    Complete, revised, and edited pdf reference manuals are also       *\r
  11      *    available.                                                         *\r
  12      *                                                                       *\r
  13      *    Purchasing FreeRTOS documentation will not only help you, by       *\r
  14      *    ensuring you get running as quickly as possible and with an        *\r
  15      *    in-depth knowledge of how to use FreeRTOS, it will also help       *\r
  16      *    the FreeRTOS project to continue with its mission of providing     *\r
  17      *    professional grade, cross platform, de facto standard solutions    *\r
  18      *    for microcontrollers - completely free of charge!                  *\r
  19      *                                                                       *\r
  20      *    >>> See http://www.FreeRTOS.org/Documentation for details. <<<     *\r
  21      *                                                                       *\r
  22      *    Thank you for using FreeRTOS, and thank you for your support!      *\r
  23      *                                                                       *\r
  24     ***************************************************************************\r
  25 \r
  26 \r
  27     This file is part of the FreeRTOS distribution.\r
  28 \r
  29     FreeRTOS is free software; you can redistribute it and/or modify it under\r
  30     the terms of the GNU General Public License (version 2) as published by the\r
  31     Free Software Foundation AND MODIFIED BY the FreeRTOS exception.\r
  32     >>>NOTE<<< The modification to the GPL is included to allow you to\r
  33     distribute a combined work that includes FreeRTOS without being obliged to\r
  34     provide the source code for proprietary components outside of the FreeRTOS\r
  35     kernel.  FreeRTOS is distributed in the hope that it will be useful, but\r
  36     WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY\r
  37     or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License for\r
  38     more details. You should have received a copy of the GNU General Public\r
  39     License and the FreeRTOS license exception along with FreeRTOS; if not it\r
  40     can be viewed here: http://www.freertos.org/a00114.html and also obtained\r
  41     by writing to Richard Barry, contact details for whom are available on the\r
  42     FreeRTOS WEB site.\r
  43 \r
  44     1 tab == 4 spaces!\r
  45     \r
  46     ***************************************************************************\r
  47      *                                                                       *\r
  48      *    Having a problem?  Start by reading the FAQ "My application does   *\r
  49      *    not run, what could be wrong?"                                     *\r
  50      *                                                                       *\r
  51      *    http://www.FreeRTOS.org/FAQHelp.html                               *\r
  52      *                                                                       *\r
  53     ***************************************************************************\r
  54 \r
  55     \r
  56     http://www.FreeRTOS.org - Documentation, training, latest versions, license \r
  57     and contact details.  \r
  58     \r
  59     http://www.FreeRTOS.org/plus - A selection of FreeRTOS ecosystem products,\r
  60     including FreeRTOS+Trace - an indispensable productivity tool.\r
  61 \r
  62     Real Time Engineers ltd license FreeRTOS to High Integrity Systems, who sell \r
  63     the code with commercial support, indemnification, and middleware, under \r
  64     the OpenRTOS brand: http://www.OpenRTOS.com.  High Integrity Systems also\r
  65     provide a safety engineered and independently SIL3 certified version under \r
  66     the SafeRTOS brand: http://www.SafeRTOS.com.\r
  67 */\r
  68 \r
  69 /*\r
  70  * A sample implementation of pvPortMalloc() and vPortFree() that permits\r
  71  * allocated blocks to be freed, but does not combine adjacent free blocks\r
  72  * into a single larger block (and so will fragment memory).  See heap_4.c for \r
  73  * an aquivalent that does combine adjacent blocks into single larger blocks.\r
  74  *\r
  75  * See heap_1.c, heap_3.c and heap_4.c for alternative implementations, and the \r
  76  * memory management pages of http://www.FreeRTOS.org for more information.\r
  77  */\r
  78 #include <stdlib.h>\r
  79 \r
  80 /* Defining MPU_WRAPPERS_INCLUDED_FROM_API_FILE prevents task.h from redefining\r
  81 all the API functions to use the MPU wrappers.  That should only be done when\r
  82 task.h is included from an application file. */\r
  83 #define MPU_WRAPPERS_INCLUDED_FROM_API_FILE\r
  84 \r
  85 #include "FreeRTOS.h"\r
  86 #include "task.h"\r
  87 \r
  88 #undef MPU_WRAPPERS_INCLUDED_FROM_API_FILE\r
  89 \r
  90 /* Allocate the memory for the heap.  The struct is used to force byte\r
  91 alignment without using any non-portable code. */\r
  92 static union xRTOS_HEAP\r
  93 {\r
  94         #if portBYTE_ALIGNMENT == 8\r
  95                 volatile portDOUBLE dDummy;\r
  96         #else\r
  97                 volatile unsigned long ulDummy;\r
  98         #endif\r
  99         unsigned char ucHeap[ configTOTAL_HEAP_SIZE ];\r
 100 } xHeap;\r
 101 \r
 102 /* Define the linked list structure.  This is used to link free blocks in order\r
 103 of their size. */\r
 104 typedef struct A_BLOCK_LINK\r
 105 {\r
 106         struct A_BLOCK_LINK *pxNextFreeBlock;   /*<< The next free block in the list. */\r
 107         size_t xBlockSize;                                              /*<< The size of the free block. */\r
 108 } xBlockLink;\r
 109 \r
 110 \r
 111 static const unsigned short  heapSTRUCT_SIZE    = ( sizeof( xBlockLink ) + portBYTE_ALIGNMENT - ( sizeof( xBlockLink ) % portBYTE_ALIGNMENT ) );\r
 112 #define heapMINIMUM_BLOCK_SIZE  ( ( size_t ) ( heapSTRUCT_SIZE * 2 ) )\r
 113 \r
 114 /* Create a couple of list links to mark the start and end of the list. */\r
 115 static xBlockLink xStart, xEnd;\r
 116 \r
 117 /* Keeps track of the number of free bytes remaining, but says nothing about\r
 118 fragmentation. */\r
 119 static size_t xFreeBytesRemaining = configTOTAL_HEAP_SIZE;\r
 120 \r
 121 /* STATIC FUNCTIONS ARE DEFINED AS MACROS TO MINIMIZE THE FUNCTION CALL DEPTH. */\r
 122 \r
 123 /*\r
 124  * Insert a block into the list of free blocks - which is ordered by size of\r
 125  * the block.  Small blocks at the start of the list and large blocks at the end\r
 126  * of the list.\r
 127  */\r
 128 #define prvInsertBlockIntoFreeList( pxBlockToInsert )                                                           \\r
 129 {                                                                                                                                                                       \\r
 130 xBlockLink *pxIterator;                                                                                                                         \\r
 131 size_t xBlockSize;                                                                                                                                      \\r
 132                                                                                                                                                                         \\r
 133         xBlockSize = pxBlockToInsert->xBlockSize;                                                                               \\r
 134                                                                                                                                                                         \\r
 135         /* Iterate through the list until a block is found that has a larger size */    \\r
 136         /* than the block we are inserting. */                                                                                  \\r
 137         for( pxIterator = &xStart; pxIterator->pxNextFreeBlock->xBlockSize < xBlockSize; pxIterator = pxIterator->pxNextFreeBlock )     \\r
 138         {                                                                                                                                                               \\r
 139                 /* There is nothing to do here - just iterate to the correct position. */       \\r
 140         }                                                                                                                                                               \\r
 141                                                                                                                                                                         \\r
 142         /* Update the list to include the block being inserted in the correct */                \\r
 143         /* position. */                                                                                                                                 \\r
 144         pxBlockToInsert->pxNextFreeBlock = pxIterator->pxNextFreeBlock;                                 \\r
 145         pxIterator->pxNextFreeBlock = pxBlockToInsert;                                                                  \\r
 146 }\r
 147 /*-----------------------------------------------------------*/\r
 148 \r
 149 #define prvHeapInit()                                                                                                                           \\r
 150 {                                                                                                                                                                       \\r
 151 xBlockLink *pxFirstFreeBlock;                                                                                                           \\r
 152                                                                                                                                                                         \\r
 153         /* xStart is used to hold a pointer to the first item in the list of free */    \\r
 154         /* blocks.  The void cast is used to prevent compiler warnings. */                              \\r
 155         xStart.pxNextFreeBlock = ( void * ) xHeap.ucHeap;                                                               \\r
 156         xStart.xBlockSize = ( size_t ) 0;                                                                                               \\r
 157                                                                                                                                                                         \\r
 158         /* xEnd is used to mark the end of the list of free blocks. */                                  \\r
 159         xEnd.xBlockSize = configTOTAL_HEAP_SIZE;                                                                                \\r
 160         xEnd.pxNextFreeBlock = NULL;                                                                                                    \\r
 161                                                                                                                                                                         \\r
 162         /* To start with there is a single free block that is sized to take up the              \\r
 163         entire heap space. */                                                                                                                   \\r
 164         pxFirstFreeBlock = ( void * ) xHeap.ucHeap;                                                                             \\r
 165         pxFirstFreeBlock->xBlockSize = configTOTAL_HEAP_SIZE;                                                   \\r
 166         pxFirstFreeBlock->pxNextFreeBlock = &xEnd;                                                                              \\r
 167 }\r
 168 /*-----------------------------------------------------------*/\r
 169 \r
 170 void *pvPortMalloc( size_t xWantedSize )\r
 171 {\r
 172 xBlockLink *pxBlock, *pxPreviousBlock, *pxNewBlockLink;\r
 173 static portBASE_TYPE xHeapHasBeenInitialised = pdFALSE;\r
 174 void *pvReturn = NULL;\r
 175 \r
 176         vTaskSuspendAll();\r
 177         {\r
 178                 /* If this is the first call to malloc then the heap will require\r
 179                 initialisation to setup the list of free blocks. */\r
 180                 if( xHeapHasBeenInitialised == pdFALSE )\r
 181                 {\r
 182                         prvHeapInit();\r
 183                         xHeapHasBeenInitialised = pdTRUE;\r
 184                 }\r
 185 \r
 186                 /* The wanted size is increased so it can contain a xBlockLink\r
 187                 structure in addition to the requested amount of bytes. */\r
 188                 if( xWantedSize > 0 )\r
 189                 {\r
 190                         xWantedSize += heapSTRUCT_SIZE;\r
 191 \r
 192                         /* Ensure that blocks are always aligned to the required number of bytes. */\r
 193                         if( xWantedSize & portBYTE_ALIGNMENT_MASK )\r
 194                         {\r
 195                                 /* Byte alignment required. */\r
 196                                 xWantedSize += ( portBYTE_ALIGNMENT - ( xWantedSize & portBYTE_ALIGNMENT_MASK ) );\r
 197                         }\r
 198                 }\r
 199 \r
 200                 if( ( xWantedSize > 0 ) && ( xWantedSize < configTOTAL_HEAP_SIZE ) )\r
 201                 {\r
 202                         /* Blocks are stored in byte order - traverse the list from the start\r
 203                         (smallest) block until one of adequate size is found. */\r
 204                         pxPreviousBlock = &xStart;\r
 205                         pxBlock = xStart.pxNextFreeBlock;\r
 206                         while( ( pxBlock->xBlockSize < xWantedSize ) && ( pxBlock->pxNextFreeBlock != NULL ) )\r
 207                         {\r
 208                                 pxPreviousBlock = pxBlock;\r
 209                                 pxBlock = pxBlock->pxNextFreeBlock;\r
 210                         }\r
 211 \r
 212                         /* If we found the end marker then a block of adequate size was not found. */\r
 213                         if( pxBlock != &xEnd )\r
 214                         {\r
 215                                 /* Return the memory space - jumping over the xBlockLink structure\r
 216                                 at its start. */\r
 217                                 pvReturn = ( void * ) ( ( ( unsigned char * ) pxPreviousBlock->pxNextFreeBlock ) + heapSTRUCT_SIZE );\r
 218 \r
 219                                 /* This block is being returned for use so must be taken out of the\r
 220                                 list of free blocks. */\r
 221                                 pxPreviousBlock->pxNextFreeBlock = pxBlock->pxNextFreeBlock;\r
 222 \r
 223                                 /* If the block is larger than required it can be split into two. */\r
 224                                 if( ( pxBlock->xBlockSize - xWantedSize ) > heapMINIMUM_BLOCK_SIZE )\r
 225                                 {\r
 226                                         /* This block is to be split into two.  Create a new block\r
 227                                         following the number of bytes requested. The void cast is\r
 228                                         used to prevent byte alignment warnings from the compiler. */\r
 229                                         pxNewBlockLink = ( void * ) ( ( ( unsigned char * ) pxBlock ) + xWantedSize );\r
 230 \r
 231                                         /* Calculate the sizes of two blocks split from the single\r
 232                                         block. */\r
 233                                         pxNewBlockLink->xBlockSize = pxBlock->xBlockSize - xWantedSize;\r
 234                                         pxBlock->xBlockSize = xWantedSize;\r
 235 \r
 236                                         /* Insert the new block into the list of free blocks. */\r
 237                                         prvInsertBlockIntoFreeList( ( pxNewBlockLink ) );\r
 238                                 }\r
 239                                 \r
 240                                 xFreeBytesRemaining -= pxBlock->xBlockSize;\r
 241                         }\r
 242                 }\r
 243         }\r
 244         xTaskResumeAll();\r
 245 \r
 246         #if( configUSE_MALLOC_FAILED_HOOK == 1 )\r
 247         {\r
 248                 if( pvReturn == NULL )\r
 249                 {\r
 250                         extern void vApplicationMallocFailedHook( void );\r
 251                         vApplicationMallocFailedHook();\r
 252                 }\r
 253         }\r
 254         #endif\r
 255 \r
 256         return pvReturn;\r
 257 }\r
 258 /*-----------------------------------------------------------*/\r
 259 \r
 260 void vPortFree( void *pv )\r
 261 {\r
 262 unsigned char *puc = ( unsigned char * ) pv;\r
 263 xBlockLink *pxLink;\r
 264 \r
 265         if( pv != NULL )\r
 266         {\r
 267                 /* The memory being freed will have an xBlockLink structure immediately\r
 268                 before it. */\r
 269                 puc -= heapSTRUCT_SIZE;\r
 270 \r
 271                 /* This casting is to keep the compiler from issuing warnings. */\r
 272                 pxLink = ( void * ) puc;\r
 273 \r
 274                 vTaskSuspendAll();\r
 275                 {\r
 276                         /* Add this block to the list of free blocks. */\r
 277                         prvInsertBlockIntoFreeList( ( ( xBlockLink * ) pxLink ) );\r
 278                         xFreeBytesRemaining += pxLink->xBlockSize;\r
 279                 }\r
 280                 xTaskResumeAll();\r
 281         }\r
 282 }\r
 283 /*-----------------------------------------------------------*/\r
 284 \r
 285 size_t xPortGetFreeHeapSize( void )\r
 286 {\r
 287         return xFreeBytesRemaining;\r
 288 }\r
 289 /*-----------------------------------------------------------*/\r
 290 \r
 291 void vPortInitialiseBlocks( void )\r
 292 {\r
 293         /* This just exists to keep the linker quiet. */\r
 294 }\r