|
|
@@ -10,12 +10,12 @@
|
|
|
the terms of the GNU General Public License (version 2) as published by the
|
|
|
Free Software Foundation >>!AND MODIFIED BY!<< the FreeRTOS exception.
|
|
|
|
|
|
- ***************************************************************************
|
|
|
+ ***************************************************************************
|
|
|
>>! NOTE: The modification to the GPL is included to allow you to !<<
|
|
|
>>! distribute a combined work that includes FreeRTOS without being !<<
|
|
|
>>! obliged to provide the source code for proprietary components !<<
|
|
|
>>! outside of the FreeRTOS kernel. !<<
|
|
|
- ***************************************************************************
|
|
|
+ ***************************************************************************
|
|
|
|
|
|
FreeRTOS is distributed in the hope that it will be useful, but WITHOUT ANY
|
|
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
|
|
|
@@ -37,17 +37,17 @@
|
|
|
***************************************************************************
|
|
|
|
|
|
http://www.FreeRTOS.org/FAQHelp.html - Having a problem? Start by reading
|
|
|
- the FAQ page "My application does not run, what could be wrong?". Have you
|
|
|
- defined configASSERT()?
|
|
|
+ the FAQ page "My application does not run, what could be wrong?". Have you
|
|
|
+ defined configASSERT()?
|
|
|
|
|
|
- http://www.FreeRTOS.org/support - In return for receiving this top quality
|
|
|
- embedded software for free we request you assist our global community by
|
|
|
- participating in the support forum.
|
|
|
+ http://www.FreeRTOS.org/support - In return for receiving this top quality
|
|
|
+ embedded software for free we request you assist our global community by
|
|
|
+ participating in the support forum.
|
|
|
|
|
|
- http://www.FreeRTOS.org/training - Investing in training allows your team to
|
|
|
- be as productive as possible as early as possible. Now you can receive
|
|
|
- FreeRTOS training directly from Richard Barry, CEO of Real Time Engineers
|
|
|
- Ltd, and the world's leading authority on the world's leading RTOS.
|
|
|
+ http://www.FreeRTOS.org/training - Investing in training allows your team to
|
|
|
+ be as productive as possible as early as possible. Now you can receive
|
|
|
+ FreeRTOS training directly from Richard Barry, CEO of Real Time Engineers
|
|
|
+ Ltd, and the world's leading authority on the world's leading RTOS.
|
|
|
|
|
|
http://www.FreeRTOS.org/plus - A selection of FreeRTOS ecosystem products,
|
|
|
including FreeRTOS+Trace - an indispensable productivity tool, a DOS
|
|
|
@@ -85,9 +85,9 @@
|
|
|
*
|
|
|
* typedef struct HeapRegion
|
|
|
* {
|
|
|
- * uint8_t *pucStartAddress; << Start address of a block of memory that will be part of the heap.
|
|
|
- * size_t xSizeInBytes; << Size of the block of memory.
|
|
|
- * BaseType_t xTag; << Tag
|
|
|
+ * uint8_t *pucStartAddress; << Start address of a block of memory that will be part of the heap.
|
|
|
+ * size_t xSizeInBytes; << Size of the block of memory.
|
|
|
+ * BaseType_t xTag; << Tag
|
|
|
* } HeapRegionTagged_t;
|
|
|
*
|
|
|
* 'Tag' allows you to allocate memory of a certain type. Tag -1 is special;
|
|
|
@@ -101,9 +101,9 @@
|
|
|
*
|
|
|
* HeapRegionTagged_t xHeapRegions[] =
|
|
|
* {
|
|
|
- * { ( uint8_t * ) 0x80000000UL, 0x10000, 1 }, << Defines a block of 0x10000 bytes starting at address 0x80000000, tag 1
|
|
|
- * { ( uint8_t * ) 0x90000000UL, 0xa0000, 2 }, << Defines a block of 0xa0000 bytes starting at address of 0x90000000, tag 2
|
|
|
- * { NULL, 0, 0 } << Terminates the array.
|
|
|
+ * { ( uint8_t * ) 0x80000000UL, 0x10000, 1 }, << Defines a block of 0x10000 bytes starting at address 0x80000000, tag 1
|
|
|
+ * { ( uint8_t * ) 0x90000000UL, 0xa0000, 2 }, << Defines a block of 0xa0000 bytes starting at address of 0x90000000, tag 2
|
|
|
+ * { NULL, 0, 0 } << Terminates the array.
|
|
|
* };
|
|
|
*
|
|
|
* vPortDefineHeapRegions( xHeapRegions ); << Pass the array into vPortDefineHeapRegions().
|
|
|
@@ -141,18 +141,18 @@ task.h is included from an application file. */
|
|
|
#include "rom/ets_sys.h"
|
|
|
|
|
|
/* Block sizes must not get too small. */
|
|
|
-#define heapMINIMUM_BLOCK_SIZE ( ( size_t ) ( uxHeapStructSize << 1 ) )
|
|
|
+#define heapMINIMUM_BLOCK_SIZE ( ( size_t ) ( uxHeapStructSize << 1 ) )
|
|
|
|
|
|
/* Assumes 8bit bytes! */
|
|
|
-#define heapBITS_PER_BYTE ( ( size_t ) 8 )
|
|
|
+#define heapBITS_PER_BYTE ( ( size_t ) 8 )
|
|
|
|
|
|
/* Define the linked list structure. This is used to link free blocks in order
|
|
|
of their memory address. */
|
|
|
typedef struct A_BLOCK_LINK
|
|
|
{
|
|
|
- struct A_BLOCK_LINK *pxNextFreeBlock; /*<< The next free block in the list. */
|
|
|
- size_t xBlockSize; /*<< The size of the free block. */
|
|
|
- BaseType_t xTag; /*<< Tag of this region */
|
|
|
+ struct A_BLOCK_LINK *pxNextFreeBlock; /*<< The next free block in the list. */
|
|
|
+ size_t xBlockSize; /*<< The size of the free block. */
|
|
|
+ BaseType_t xTag; /*<< Tag of this region */
|
|
|
} BlockLink_t;
|
|
|
|
|
|
//Mux to protect the memory status data
|
|
|
@@ -172,7 +172,7 @@ static void prvInsertBlockIntoFreeList( BlockLink_t *pxBlockToInsert );
|
|
|
|
|
|
/* The size of the structure placed at the beginning of each allocated memory
|
|
|
block must by correctly byte aligned. */
|
|
|
-static const uint32_t uxHeapStructSize = ( ( sizeof ( BlockLink_t ) + BLOCK_HEAD_LEN + BLOCK_TAIL_LEN + ( portBYTE_ALIGNMENT - 1 ) ) & ~portBYTE_ALIGNMENT_MASK );
|
|
|
+static const uint32_t uxHeapStructSize = ( ( sizeof ( BlockLink_t ) + BLOCK_HEAD_LEN + BLOCK_TAIL_LEN + ( portBYTE_ALIGNMENT - 1 ) ) & ~portBYTE_ALIGNMENT_MASK );
|
|
|
|
|
|
/* Create a couple of list links to mark the start and end of the list. */
|
|
|
static BlockLink_t xStart, *pxEnd = NULL;
|
|
|
@@ -195,50 +195,50 @@ void *pvPortMallocTagged( size_t xWantedSize, BaseType_t tag )
|
|
|
BlockLink_t *pxBlock, *pxPreviousBlock, *pxNewBlockLink;
|
|
|
void *pvReturn = NULL;
|
|
|
|
|
|
- /* The heap must be initialised before the first call to
|
|
|
- prvPortMalloc(). */
|
|
|
- configASSERT( pxEnd );
|
|
|
-
|
|
|
- taskENTER_CRITICAL(&xMallocMutex);
|
|
|
- {
|
|
|
- /* Check the requested block size is not so large that the top bit is
|
|
|
- set. The top bit of the block size member of the BlockLink_t structure
|
|
|
- is used to determine who owns the block - the application or the
|
|
|
- kernel, so it must be free. */
|
|
|
- if( ( xWantedSize & xBlockAllocatedBit ) == 0 )
|
|
|
- {
|
|
|
- /* The wanted size is increased so it can contain a BlockLink_t
|
|
|
- structure in addition to the requested amount of bytes. */
|
|
|
- if( xWantedSize > 0 )
|
|
|
- {
|
|
|
- xWantedSize += uxHeapStructSize;
|
|
|
-
|
|
|
- /* Ensure that blocks are always aligned to the required number
|
|
|
- of bytes. */
|
|
|
- if( ( xWantedSize & portBYTE_ALIGNMENT_MASK ) != 0x00 )
|
|
|
- {
|
|
|
- /* Byte alignment required. */
|
|
|
- xWantedSize += ( portBYTE_ALIGNMENT - ( xWantedSize & portBYTE_ALIGNMENT_MASK ) );
|
|
|
- }
|
|
|
- else
|
|
|
- {
|
|
|
- mtCOVERAGE_TEST_MARKER();
|
|
|
- }
|
|
|
- }
|
|
|
- else
|
|
|
- {
|
|
|
- mtCOVERAGE_TEST_MARKER();
|
|
|
- }
|
|
|
-
|
|
|
- if( ( xWantedSize > 0 ) && ( xWantedSize <= xFreeBytesRemaining ) )
|
|
|
- {
|
|
|
- /* Traverse the list from the start (lowest address) block until
|
|
|
- one of adequate size is found. */
|
|
|
- pxPreviousBlock = &xStart;
|
|
|
- pxBlock = xStart.pxNextFreeBlock;
|
|
|
- while( ( ( pxBlock->xTag != tag ) || ( pxBlock->xBlockSize < xWantedSize ) ) && ( pxBlock->pxNextFreeBlock != NULL ) )
|
|
|
- {
|
|
|
-// ets_printf("Block %x -> %x\n", (uint32_t)pxBlock, (uint32_t)pxBlock->pxNextFreeBlock);
|
|
|
+ /* The heap must be initialised before the first call to
|
|
|
+ prvPortMalloc(). */
|
|
|
+ configASSERT( pxEnd );
|
|
|
+
|
|
|
+ taskENTER_CRITICAL(&xMallocMutex);
|
|
|
+ {
|
|
|
+ /* Check the requested block size is not so large that the top bit is
|
|
|
+ set. The top bit of the block size member of the BlockLink_t structure
|
|
|
+ is used to determine who owns the block - the application or the
|
|
|
+ kernel, so it must be free. */
|
|
|
+ if( ( xWantedSize & xBlockAllocatedBit ) == 0 )
|
|
|
+ {
|
|
|
+ /* The wanted size is increased so it can contain a BlockLink_t
|
|
|
+ structure in addition to the requested amount of bytes. */
|
|
|
+ if( xWantedSize > 0 )
|
|
|
+ {
|
|
|
+ xWantedSize += uxHeapStructSize;
|
|
|
+
|
|
|
+ /* Ensure that blocks are always aligned to the required number
|
|
|
+ of bytes. */
|
|
|
+ if( ( xWantedSize & portBYTE_ALIGNMENT_MASK ) != 0x00 )
|
|
|
+ {
|
|
|
+ /* Byte alignment required. */
|
|
|
+ xWantedSize += ( portBYTE_ALIGNMENT - ( xWantedSize & portBYTE_ALIGNMENT_MASK ) );
|
|
|
+ }
|
|
|
+ else
|
|
|
+ {
|
|
|
+ mtCOVERAGE_TEST_MARKER();
|
|
|
+ }
|
|
|
+ }
|
|
|
+ else
|
|
|
+ {
|
|
|
+ mtCOVERAGE_TEST_MARKER();
|
|
|
+ }
|
|
|
+
|
|
|
+ if( ( xWantedSize > 0 ) && ( xWantedSize <= xFreeBytesRemaining ) )
|
|
|
+ {
|
|
|
+ /* Traverse the list from the start (lowest address) block until
|
|
|
+ one of adequate size is found. */
|
|
|
+ pxPreviousBlock = &xStart;
|
|
|
+ pxBlock = xStart.pxNextFreeBlock;
|
|
|
+ while( ( ( pxBlock->xTag != tag ) || ( pxBlock->xBlockSize < xWantedSize ) ) && ( pxBlock->pxNextFreeBlock != NULL ) )
|
|
|
+ {
|
|
|
+// ets_printf("Block %x -> %x\n", (uint32_t)pxBlock, (uint32_t)pxBlock->pxNextFreeBlock);
|
|
|
|
|
|
#if (configENABLE_MEMORY_DEBUG == 1)
|
|
|
{
|
|
|
@@ -246,38 +246,38 @@ void *pvReturn = NULL;
|
|
|
}
|
|
|
#endif
|
|
|
|
|
|
- pxPreviousBlock = pxBlock;
|
|
|
- pxBlock = pxBlock->pxNextFreeBlock;
|
|
|
- }
|
|
|
-
|
|
|
- /* If the end marker was not reached then a block of adequate size
|
|
|
- was found. */
|
|
|
- if( pxBlock != pxEnd )
|
|
|
- {
|
|
|
- /* Return the memory space pointed to - jumping over the
|
|
|
- BlockLink_t structure at its start. */
|
|
|
- pvReturn = ( void * ) ( ( ( uint8_t * ) pxPreviousBlock->pxNextFreeBlock ) + uxHeapStructSize - BLOCK_TAIL_LEN - BLOCK_HEAD_LEN);
|
|
|
-
|
|
|
- /* This block is being returned for use so must be taken out
|
|
|
- of the list of free blocks. */
|
|
|
- pxPreviousBlock->pxNextFreeBlock = pxBlock->pxNextFreeBlock;
|
|
|
-
|
|
|
- /* If the block is larger than required it can be split into
|
|
|
- two. */
|
|
|
-
|
|
|
- if( ( pxBlock->xBlockSize - xWantedSize ) > heapMINIMUM_BLOCK_SIZE )
|
|
|
- {
|
|
|
- /* This block is to be split into two. Create a new
|
|
|
- block following the number of bytes requested. The void
|
|
|
- cast is used to prevent byte alignment warnings from the
|
|
|
- compiler. */
|
|
|
- pxNewBlockLink = ( void * ) ( ( ( uint8_t * ) pxBlock ) + xWantedSize);
|
|
|
-
|
|
|
- /* Calculate the sizes of two blocks split from the
|
|
|
- single block. */
|
|
|
- pxNewBlockLink->xBlockSize = pxBlock->xBlockSize - xWantedSize;
|
|
|
- pxNewBlockLink->xTag = tag;
|
|
|
- pxBlock->xBlockSize = xWantedSize;
|
|
|
+ pxPreviousBlock = pxBlock;
|
|
|
+ pxBlock = pxBlock->pxNextFreeBlock;
|
|
|
+ }
|
|
|
+
|
|
|
+ /* If the end marker was not reached then a block of adequate size
|
|
|
+ was found. */
|
|
|
+ if( pxBlock != pxEnd )
|
|
|
+ {
|
|
|
+ /* Return the memory space pointed to - jumping over the
|
|
|
+ BlockLink_t structure at its start. */
|
|
|
+ pvReturn = ( void * ) ( ( ( uint8_t * ) pxPreviousBlock->pxNextFreeBlock ) + uxHeapStructSize - BLOCK_TAIL_LEN - BLOCK_HEAD_LEN);
|
|
|
+
|
|
|
+ /* This block is being returned for use so must be taken out
|
|
|
+ of the list of free blocks. */
|
|
|
+ pxPreviousBlock->pxNextFreeBlock = pxBlock->pxNextFreeBlock;
|
|
|
+
|
|
|
+ /* If the block is larger than required it can be split into
|
|
|
+ two. */
|
|
|
+
|
|
|
+ if( ( pxBlock->xBlockSize - xWantedSize ) > heapMINIMUM_BLOCK_SIZE )
|
|
|
+ {
|
|
|
+ /* This block is to be split into two. Create a new
|
|
|
+ block following the number of bytes requested. The void
|
|
|
+ cast is used to prevent byte alignment warnings from the
|
|
|
+ compiler. */
|
|
|
+ pxNewBlockLink = ( void * ) ( ( ( uint8_t * ) pxBlock ) + xWantedSize);
|
|
|
+
|
|
|
+ /* Calculate the sizes of two blocks split from the
|
|
|
+ single block. */
|
|
|
+ pxNewBlockLink->xBlockSize = pxBlock->xBlockSize - xWantedSize;
|
|
|
+ pxNewBlockLink->xTag = tag;
|
|
|
+ pxBlock->xBlockSize = xWantedSize;
|
|
|
|
|
|
#if (configENABLE_MEMORY_DEBUG == 1)
|
|
|
{
|
|
|
@@ -286,29 +286,29 @@ void *pvReturn = NULL;
|
|
|
#endif
|
|
|
|
|
|
|
|
|
- /* Insert the new block into the list of free blocks. */
|
|
|
- prvInsertBlockIntoFreeList( ( pxNewBlockLink ) );
|
|
|
- }
|
|
|
- else
|
|
|
- {
|
|
|
- mtCOVERAGE_TEST_MARKER();
|
|
|
- }
|
|
|
+ /* Insert the new block into the list of free blocks. */
|
|
|
+ prvInsertBlockIntoFreeList( ( pxNewBlockLink ) );
|
|
|
+ }
|
|
|
+ else
|
|
|
+ {
|
|
|
+ mtCOVERAGE_TEST_MARKER();
|
|
|
+ }
|
|
|
|
|
|
- xFreeBytesRemaining -= pxBlock->xBlockSize;
|
|
|
+ xFreeBytesRemaining -= pxBlock->xBlockSize;
|
|
|
|
|
|
- if( xFreeBytesRemaining < xMinimumEverFreeBytesRemaining )
|
|
|
- {
|
|
|
- xMinimumEverFreeBytesRemaining = xFreeBytesRemaining;
|
|
|
- }
|
|
|
- else
|
|
|
- {
|
|
|
- mtCOVERAGE_TEST_MARKER();
|
|
|
- }
|
|
|
+ if( xFreeBytesRemaining < xMinimumEverFreeBytesRemaining )
|
|
|
+ {
|
|
|
+ xMinimumEverFreeBytesRemaining = xFreeBytesRemaining;
|
|
|
+ }
|
|
|
+ else
|
|
|
+ {
|
|
|
+ mtCOVERAGE_TEST_MARKER();
|
|
|
+ }
|
|
|
|
|
|
- /* The block is being returned - it is allocated and owned
|
|
|
- by the application and has no "next" block. */
|
|
|
- pxBlock->xBlockSize |= xBlockAllocatedBit;
|
|
|
- pxBlock->pxNextFreeBlock = NULL;
|
|
|
+ /* The block is being returned - it is allocated and owned
|
|
|
+ by the application and has no "next" block. */
|
|
|
+ pxBlock->xBlockSize |= xBlockAllocatedBit;
|
|
|
+ pxBlock->pxNextFreeBlock = NULL;
|
|
|
|
|
|
#if (configENABLE_MEMORY_DEBUG == 1)
|
|
|
{
|
|
|
@@ -316,41 +316,41 @@ void *pvReturn = NULL;
|
|
|
mem_malloc_block(pxBlock);
|
|
|
}
|
|
|
#endif
|
|
|
- }
|
|
|
- else
|
|
|
- {
|
|
|
- mtCOVERAGE_TEST_MARKER();
|
|
|
- }
|
|
|
- }
|
|
|
- else
|
|
|
- {
|
|
|
- mtCOVERAGE_TEST_MARKER();
|
|
|
- }
|
|
|
- }
|
|
|
- else
|
|
|
- {
|
|
|
- mtCOVERAGE_TEST_MARKER();
|
|
|
- }
|
|
|
-
|
|
|
- traceMALLOC( pvReturn, xWantedSize );
|
|
|
- }
|
|
|
- taskEXIT_CRITICAL(&xMallocMutex);
|
|
|
-
|
|
|
- #if( configUSE_MALLOC_FAILED_HOOK == 1 )
|
|
|
- {
|
|
|
- if( pvReturn == NULL )
|
|
|
- {
|
|
|
- extern void vApplicationMallocFailedHook( void );
|
|
|
- vApplicationMallocFailedHook();
|
|
|
- }
|
|
|
- else
|
|
|
- {
|
|
|
- mtCOVERAGE_TEST_MARKER();
|
|
|
- }
|
|
|
- }
|
|
|
- #endif
|
|
|
-
|
|
|
- return pvReturn;
|
|
|
+ }
|
|
|
+ else
|
|
|
+ {
|
|
|
+ mtCOVERAGE_TEST_MARKER();
|
|
|
+ }
|
|
|
+ }
|
|
|
+ else
|
|
|
+ {
|
|
|
+ mtCOVERAGE_TEST_MARKER();
|
|
|
+ }
|
|
|
+ }
|
|
|
+ else
|
|
|
+ {
|
|
|
+ mtCOVERAGE_TEST_MARKER();
|
|
|
+ }
|
|
|
+
|
|
|
+ traceMALLOC( pvReturn, xWantedSize );
|
|
|
+ }
|
|
|
+ taskEXIT_CRITICAL(&xMallocMutex);
|
|
|
+
|
|
|
+ #if( configUSE_MALLOC_FAILED_HOOK == 1 )
|
|
|
+ {
|
|
|
+ if( pvReturn == NULL )
|
|
|
+ {
|
|
|
+ extern void vApplicationMallocFailedHook( void );
|
|
|
+ vApplicationMallocFailedHook();
|
|
|
+ }
|
|
|
+ else
|
|
|
+ {
|
|
|
+ mtCOVERAGE_TEST_MARKER();
|
|
|
+ }
|
|
|
+ }
|
|
|
+ #endif
|
|
|
+
|
|
|
+ return pvReturn;
|
|
|
}
|
|
|
/*-----------------------------------------------------------*/
|
|
|
|
|
|
@@ -359,14 +359,14 @@ void vPortFree( void *pv )
|
|
|
uint8_t *puc = ( uint8_t * ) pv;
|
|
|
BlockLink_t *pxLink;
|
|
|
|
|
|
- if( pv != NULL )
|
|
|
- {
|
|
|
- /* The memory being freed will have an BlockLink_t structure immediately
|
|
|
- before it. */
|
|
|
- puc -= (uxHeapStructSize - BLOCK_TAIL_LEN - BLOCK_HEAD_LEN) ;
|
|
|
+ if( pv != NULL )
|
|
|
+ {
|
|
|
+ /* The memory being freed will have an BlockLink_t structure immediately
|
|
|
+ before it. */
|
|
|
+ puc -= (uxHeapStructSize - BLOCK_TAIL_LEN - BLOCK_HEAD_LEN) ;
|
|
|
|
|
|
- /* This casting is to keep the compiler from issuing warnings. */
|
|
|
- pxLink = ( void * ) puc;
|
|
|
+ /* This casting is to keep the compiler from issuing warnings. */
|
|
|
+ pxLink = ( void * ) puc;
|
|
|
|
|
|
#if (configENABLE_MEMORY_DEBUG == 1)
|
|
|
{
|
|
|
@@ -377,49 +377,49 @@ BlockLink_t *pxLink;
|
|
|
}
|
|
|
#endif
|
|
|
|
|
|
- /* Check the block is actually allocated. */
|
|
|
- configASSERT( ( pxLink->xBlockSize & xBlockAllocatedBit ) != 0 );
|
|
|
- configASSERT( pxLink->pxNextFreeBlock == NULL );
|
|
|
-
|
|
|
- if( ( pxLink->xBlockSize & xBlockAllocatedBit ) != 0 )
|
|
|
- {
|
|
|
- if( pxLink->pxNextFreeBlock == NULL )
|
|
|
- {
|
|
|
- /* The block is being returned to the heap - it is no longer
|
|
|
- allocated. */
|
|
|
- pxLink->xBlockSize &= ~xBlockAllocatedBit;
|
|
|
-
|
|
|
- taskENTER_CRITICAL(&xMallocMutex);
|
|
|
- {
|
|
|
- /* Add this block to the list of free blocks. */
|
|
|
- xFreeBytesRemaining += pxLink->xBlockSize;
|
|
|
- traceFREE( pv, pxLink->xBlockSize );
|
|
|
- prvInsertBlockIntoFreeList( ( ( BlockLink_t * ) pxLink ) );
|
|
|
- }
|
|
|
- taskEXIT_CRITICAL(&xMallocMutex);
|
|
|
- }
|
|
|
- else
|
|
|
- {
|
|
|
- mtCOVERAGE_TEST_MARKER();
|
|
|
- }
|
|
|
- }
|
|
|
- else
|
|
|
- {
|
|
|
- mtCOVERAGE_TEST_MARKER();
|
|
|
- }
|
|
|
- }
|
|
|
+ /* Check the block is actually allocated. */
|
|
|
+ configASSERT( ( pxLink->xBlockSize & xBlockAllocatedBit ) != 0 );
|
|
|
+ configASSERT( pxLink->pxNextFreeBlock == NULL );
|
|
|
+
|
|
|
+ if( ( pxLink->xBlockSize & xBlockAllocatedBit ) != 0 )
|
|
|
+ {
|
|
|
+ if( pxLink->pxNextFreeBlock == NULL )
|
|
|
+ {
|
|
|
+ /* The block is being returned to the heap - it is no longer
|
|
|
+ allocated. */
|
|
|
+ pxLink->xBlockSize &= ~xBlockAllocatedBit;
|
|
|
+
|
|
|
+ taskENTER_CRITICAL(&xMallocMutex);
|
|
|
+ {
|
|
|
+ /* Add this block to the list of free blocks. */
|
|
|
+ xFreeBytesRemaining += pxLink->xBlockSize;
|
|
|
+ traceFREE( pv, pxLink->xBlockSize );
|
|
|
+ prvInsertBlockIntoFreeList( ( ( BlockLink_t * ) pxLink ) );
|
|
|
+ }
|
|
|
+ taskEXIT_CRITICAL(&xMallocMutex);
|
|
|
+ }
|
|
|
+ else
|
|
|
+ {
|
|
|
+ mtCOVERAGE_TEST_MARKER();
|
|
|
+ }
|
|
|
+ }
|
|
|
+ else
|
|
|
+ {
|
|
|
+ mtCOVERAGE_TEST_MARKER();
|
|
|
+ }
|
|
|
+ }
|
|
|
}
|
|
|
/*-----------------------------------------------------------*/
|
|
|
|
|
|
size_t xPortGetFreeHeapSize( void )
|
|
|
{
|
|
|
- return xFreeBytesRemaining;
|
|
|
+ return xFreeBytesRemaining;
|
|
|
}
|
|
|
/*-----------------------------------------------------------*/
|
|
|
|
|
|
size_t xPortGetMinimumEverFreeHeapSize( void )
|
|
|
{
|
|
|
- return xMinimumEverFreeBytesRemaining;
|
|
|
+ return xMinimumEverFreeBytesRemaining;
|
|
|
}
|
|
|
/*-----------------------------------------------------------*/
|
|
|
|
|
|
@@ -428,59 +428,59 @@ static void prvInsertBlockIntoFreeList( BlockLink_t *pxBlockToInsert )
|
|
|
BlockLink_t *pxIterator;
|
|
|
uint8_t *puc;
|
|
|
|
|
|
- /* Iterate through the list until a block is found that has a higher address
|
|
|
- than the block being inserted. */
|
|
|
- for( pxIterator = &xStart; pxIterator->pxNextFreeBlock < pxBlockToInsert; pxIterator = pxIterator->pxNextFreeBlock )
|
|
|
- {
|
|
|
- /* Nothing to do here, just iterate to the right position. */
|
|
|
- }
|
|
|
-
|
|
|
- /* Do the block being inserted, and the block it is being inserted after
|
|
|
- make a contiguous block of memory, and are the tags the same? */
|
|
|
- puc = ( uint8_t * ) pxIterator;
|
|
|
- if( ( puc + pxIterator->xBlockSize ) == ( uint8_t * ) pxBlockToInsert && pxBlockToInsert->xTag==pxIterator->xTag)
|
|
|
- {
|
|
|
- pxIterator->xBlockSize += pxBlockToInsert->xBlockSize;
|
|
|
- pxBlockToInsert = pxIterator;
|
|
|
- }
|
|
|
- else
|
|
|
- {
|
|
|
- mtCOVERAGE_TEST_MARKER();
|
|
|
- }
|
|
|
-
|
|
|
- /* Do the block being inserted, and the block it is being inserted before
|
|
|
- make a contiguous block of memory, and are the tags the same */
|
|
|
- puc = ( uint8_t * ) pxBlockToInsert;
|
|
|
- if( ( puc + pxBlockToInsert->xBlockSize ) == ( uint8_t * ) pxIterator->pxNextFreeBlock && pxBlockToInsert->xTag==pxIterator->pxNextFreeBlock->xTag )
|
|
|
- {
|
|
|
- if( pxIterator->pxNextFreeBlock != pxEnd )
|
|
|
- {
|
|
|
- /* Form one big block from the two blocks. */
|
|
|
- pxBlockToInsert->xBlockSize += pxIterator->pxNextFreeBlock->xBlockSize;
|
|
|
- pxBlockToInsert->pxNextFreeBlock = pxIterator->pxNextFreeBlock->pxNextFreeBlock;
|
|
|
- }
|
|
|
- else
|
|
|
- {
|
|
|
- pxBlockToInsert->pxNextFreeBlock = pxEnd;
|
|
|
- }
|
|
|
- }
|
|
|
- else
|
|
|
- {
|
|
|
- pxBlockToInsert->pxNextFreeBlock = pxIterator->pxNextFreeBlock;
|
|
|
- }
|
|
|
-
|
|
|
- /* If the block being inserted plugged a gap, so was merged with the block
|
|
|
- before and the block after, then it's pxNextFreeBlock pointer will have
|
|
|
- already been set, and should not be set here as that would make it point
|
|
|
- to itself. */
|
|
|
- if( pxIterator != pxBlockToInsert )
|
|
|
- {
|
|
|
- pxIterator->pxNextFreeBlock = pxBlockToInsert;
|
|
|
- }
|
|
|
- else
|
|
|
- {
|
|
|
- mtCOVERAGE_TEST_MARKER();
|
|
|
- }
|
|
|
+ /* Iterate through the list until a block is found that has a higher address
|
|
|
+ than the block being inserted. */
|
|
|
+ for( pxIterator = &xStart; pxIterator->pxNextFreeBlock < pxBlockToInsert; pxIterator = pxIterator->pxNextFreeBlock )
|
|
|
+ {
|
|
|
+ /* Nothing to do here, just iterate to the right position. */
|
|
|
+ }
|
|
|
+
|
|
|
+ /* Do the block being inserted, and the block it is being inserted after
|
|
|
+ make a contiguous block of memory, and are the tags the same? */
|
|
|
+ puc = ( uint8_t * ) pxIterator;
|
|
|
+ if( ( puc + pxIterator->xBlockSize ) == ( uint8_t * ) pxBlockToInsert && pxBlockToInsert->xTag==pxIterator->xTag)
|
|
|
+ {
|
|
|
+ pxIterator->xBlockSize += pxBlockToInsert->xBlockSize;
|
|
|
+ pxBlockToInsert = pxIterator;
|
|
|
+ }
|
|
|
+ else
|
|
|
+ {
|
|
|
+ mtCOVERAGE_TEST_MARKER();
|
|
|
+ }
|
|
|
+
|
|
|
+ /* Do the block being inserted, and the block it is being inserted before
|
|
|
+ make a contiguous block of memory, and are the tags the same */
|
|
|
+ puc = ( uint8_t * ) pxBlockToInsert;
|
|
|
+ if( ( puc + pxBlockToInsert->xBlockSize ) == ( uint8_t * ) pxIterator->pxNextFreeBlock && pxBlockToInsert->xTag==pxIterator->pxNextFreeBlock->xTag )
|
|
|
+ {
|
|
|
+ if( pxIterator->pxNextFreeBlock != pxEnd )
|
|
|
+ {
|
|
|
+ /* Form one big block from the two blocks. */
|
|
|
+ pxBlockToInsert->xBlockSize += pxIterator->pxNextFreeBlock->xBlockSize;
|
|
|
+ pxBlockToInsert->pxNextFreeBlock = pxIterator->pxNextFreeBlock->pxNextFreeBlock;
|
|
|
+ }
|
|
|
+ else
|
|
|
+ {
|
|
|
+ pxBlockToInsert->pxNextFreeBlock = pxEnd;
|
|
|
+ }
|
|
|
+ }
|
|
|
+ else
|
|
|
+ {
|
|
|
+ pxBlockToInsert->pxNextFreeBlock = pxIterator->pxNextFreeBlock;
|
|
|
+ }
|
|
|
+
|
|
|
+ /* If the block being inserted plugged a gap, so was merged with the block
|
|
|
+ before and the block after, then it's pxNextFreeBlock pointer will have
|
|
|
+ already been set, and should not be set here as that would make it point
|
|
|
+ to itself. */
|
|
|
+ if( pxIterator != pxBlockToInsert )
|
|
|
+ {
|
|
|
+ pxIterator->pxNextFreeBlock = pxBlockToInsert;
|
|
|
+ }
|
|
|
+ else
|
|
|
+ {
|
|
|
+ mtCOVERAGE_TEST_MARKER();
|
|
|
+ }
|
|
|
}
|
|
|
/*-----------------------------------------------------------*/
|
|
|
|
|
|
@@ -493,90 +493,90 @@ BaseType_t xDefinedRegions = 0, xRegIdx = 0;
|
|
|
uint32_t ulAddress;
|
|
|
const HeapRegionTagged_t *pxHeapRegion;
|
|
|
|
|
|
- /* Can only call once! */
|
|
|
- configASSERT( pxEnd == NULL );
|
|
|
-
|
|
|
- vPortCPUInitializeMutex(&xMallocMutex);
|
|
|
-
|
|
|
- pxHeapRegion = &( pxHeapRegions[ xRegIdx ] );
|
|
|
-
|
|
|
- while( pxHeapRegion->xSizeInBytes > 0 )
|
|
|
- {
|
|
|
- if ( pxHeapRegion->xTag == -1 ) {
|
|
|
- /* Move onto the next HeapRegionTagged_t structure. */
|
|
|
- xRegIdx++;
|
|
|
- pxHeapRegion = &( pxHeapRegions[ xRegIdx ] );
|
|
|
- continue;
|
|
|
- }
|
|
|
-
|
|
|
- xTotalRegionSize = pxHeapRegion->xSizeInBytes;
|
|
|
-
|
|
|
- /* Ensure the heap region starts on a correctly aligned boundary. */
|
|
|
- ulAddress = ( uint32_t ) pxHeapRegion->pucStartAddress;
|
|
|
- if( ( ulAddress & portBYTE_ALIGNMENT_MASK ) != 0 )
|
|
|
- {
|
|
|
- ulAddress += ( portBYTE_ALIGNMENT - 1 );
|
|
|
- ulAddress &= ~portBYTE_ALIGNMENT_MASK;
|
|
|
-
|
|
|
- /* Adjust the size for the bytes lost to alignment. */
|
|
|
- xTotalRegionSize -= ulAddress - ( uint32_t ) pxHeapRegion->pucStartAddress;
|
|
|
- }
|
|
|
-
|
|
|
- pucAlignedHeap = ( uint8_t * ) ulAddress;
|
|
|
-
|
|
|
- /* Set xStart if it has not already been set. */
|
|
|
- if( xDefinedRegions == 0 )
|
|
|
- {
|
|
|
- /* xStart is used to hold a pointer to the first item in the list of
|
|
|
- free blocks. The void cast is used to prevent compiler warnings. */
|
|
|
- xStart.pxNextFreeBlock = ( BlockLink_t * ) (pucAlignedHeap + BLOCK_HEAD_LEN);
|
|
|
- xStart.xBlockSize = ( size_t ) 0;
|
|
|
- }
|
|
|
- else
|
|
|
- {
|
|
|
- /* Should only get here if one region has already been added to the
|
|
|
- heap. */
|
|
|
- configASSERT( pxEnd != NULL );
|
|
|
-
|
|
|
- /* Check blocks are passed in with increasing start addresses. */
|
|
|
- configASSERT( ulAddress > ( uint32_t ) pxEnd );
|
|
|
- }
|
|
|
-
|
|
|
- /* Remember the location of the end marker in the previous region, if
|
|
|
- any. */
|
|
|
- pxPreviousFreeBlock = pxEnd;
|
|
|
-
|
|
|
- /* pxEnd is used to mark the end of the list of free blocks and is
|
|
|
- inserted at the end of the region space. */
|
|
|
- ulAddress = ( ( uint32_t ) pucAlignedHeap ) + xTotalRegionSize;
|
|
|
- ulAddress -= uxHeapStructSize;
|
|
|
- ulAddress &= ~portBYTE_ALIGNMENT_MASK;
|
|
|
- pxEnd = ( BlockLink_t * ) (ulAddress + BLOCK_HEAD_LEN);
|
|
|
- pxEnd->xBlockSize = 0;
|
|
|
- pxEnd->pxNextFreeBlock = NULL;
|
|
|
- pxEnd->xTag = -1;
|
|
|
-
|
|
|
- /* To start with there is a single free block in this region that is
|
|
|
- sized to take up the entire heap region minus the space taken by the
|
|
|
- free block structure. */
|
|
|
- pxFirstFreeBlockInRegion = ( BlockLink_t * ) (pucAlignedHeap + BLOCK_HEAD_LEN);
|
|
|
- pxFirstFreeBlockInRegion->xBlockSize = ulAddress - ( uint32_t ) pxFirstFreeBlockInRegion + BLOCK_HEAD_LEN;
|
|
|
- pxFirstFreeBlockInRegion->pxNextFreeBlock = pxEnd;
|
|
|
- pxFirstFreeBlockInRegion->xTag=pxHeapRegion->xTag;
|
|
|
-
|
|
|
- /* If this is not the first region that makes up the entire heap space
|
|
|
- then link the previous region to this region. */
|
|
|
- if( pxPreviousFreeBlock != NULL )
|
|
|
- {
|
|
|
- pxPreviousFreeBlock->pxNextFreeBlock = pxFirstFreeBlockInRegion;
|
|
|
- }
|
|
|
-
|
|
|
- xTotalHeapSize += pxFirstFreeBlockInRegion->xBlockSize;
|
|
|
-
|
|
|
- /* Move onto the next HeapRegionTagged_t structure. */
|
|
|
- xDefinedRegions++;
|
|
|
- xRegIdx++;
|
|
|
- pxHeapRegion = &( pxHeapRegions[ xRegIdx ] );
|
|
|
+ /* Can only call once! */
|
|
|
+ configASSERT( pxEnd == NULL );
|
|
|
+
|
|
|
+ vPortCPUInitializeMutex(&xMallocMutex);
|
|
|
+
|
|
|
+ pxHeapRegion = &( pxHeapRegions[ xRegIdx ] );
|
|
|
+
|
|
|
+ while( pxHeapRegion->xSizeInBytes > 0 )
|
|
|
+ {
|
|
|
+ if ( pxHeapRegion->xTag == -1 ) {
|
|
|
+ /* Move onto the next HeapRegionTagged_t structure. */
|
|
|
+ xRegIdx++;
|
|
|
+ pxHeapRegion = &( pxHeapRegions[ xRegIdx ] );
|
|
|
+ continue;
|
|
|
+ }
|
|
|
+
|
|
|
+ xTotalRegionSize = pxHeapRegion->xSizeInBytes;
|
|
|
+
|
|
|
+ /* Ensure the heap region starts on a correctly aligned boundary. */
|
|
|
+ ulAddress = ( uint32_t ) pxHeapRegion->pucStartAddress;
|
|
|
+ if( ( ulAddress & portBYTE_ALIGNMENT_MASK ) != 0 )
|
|
|
+ {
|
|
|
+ ulAddress += ( portBYTE_ALIGNMENT - 1 );
|
|
|
+ ulAddress &= ~portBYTE_ALIGNMENT_MASK;
|
|
|
+
|
|
|
+ /* Adjust the size for the bytes lost to alignment. */
|
|
|
+ xTotalRegionSize -= ulAddress - ( uint32_t ) pxHeapRegion->pucStartAddress;
|
|
|
+ }
|
|
|
+
|
|
|
+ pucAlignedHeap = ( uint8_t * ) ulAddress;
|
|
|
+
|
|
|
+ /* Set xStart if it has not already been set. */
|
|
|
+ if( xDefinedRegions == 0 )
|
|
|
+ {
|
|
|
+ /* xStart is used to hold a pointer to the first item in the list of
|
|
|
+ free blocks. The void cast is used to prevent compiler warnings. */
|
|
|
+ xStart.pxNextFreeBlock = ( BlockLink_t * ) (pucAlignedHeap + BLOCK_HEAD_LEN);
|
|
|
+ xStart.xBlockSize = ( size_t ) 0;
|
|
|
+ }
|
|
|
+ else
|
|
|
+ {
|
|
|
+ /* Should only get here if one region has already been added to the
|
|
|
+ heap. */
|
|
|
+ configASSERT( pxEnd != NULL );
|
|
|
+
|
|
|
+ /* Check blocks are passed in with increasing start addresses. */
|
|
|
+ configASSERT( ulAddress > ( uint32_t ) pxEnd );
|
|
|
+ }
|
|
|
+
|
|
|
+ /* Remember the location of the end marker in the previous region, if
|
|
|
+ any. */
|
|
|
+ pxPreviousFreeBlock = pxEnd;
|
|
|
+
|
|
|
+ /* pxEnd is used to mark the end of the list of free blocks and is
|
|
|
+ inserted at the end of the region space. */
|
|
|
+ ulAddress = ( ( uint32_t ) pucAlignedHeap ) + xTotalRegionSize;
|
|
|
+ ulAddress -= uxHeapStructSize;
|
|
|
+ ulAddress &= ~portBYTE_ALIGNMENT_MASK;
|
|
|
+ pxEnd = ( BlockLink_t * ) (ulAddress + BLOCK_HEAD_LEN);
|
|
|
+ pxEnd->xBlockSize = 0;
|
|
|
+ pxEnd->pxNextFreeBlock = NULL;
|
|
|
+ pxEnd->xTag = -1;
|
|
|
+
|
|
|
+ /* To start with there is a single free block in this region that is
|
|
|
+ sized to take up the entire heap region minus the space taken by the
|
|
|
+ free block structure. */
|
|
|
+ pxFirstFreeBlockInRegion = ( BlockLink_t * ) (pucAlignedHeap + BLOCK_HEAD_LEN);
|
|
|
+ pxFirstFreeBlockInRegion->xBlockSize = ulAddress - ( uint32_t ) pxFirstFreeBlockInRegion + BLOCK_HEAD_LEN;
|
|
|
+ pxFirstFreeBlockInRegion->pxNextFreeBlock = pxEnd;
|
|
|
+ pxFirstFreeBlockInRegion->xTag=pxHeapRegion->xTag;
|
|
|
+
|
|
|
+ /* If this is not the first region that makes up the entire heap space
|
|
|
+ then link the previous region to this region. */
|
|
|
+ if( pxPreviousFreeBlock != NULL )
|
|
|
+ {
|
|
|
+ pxPreviousFreeBlock->pxNextFreeBlock = pxFirstFreeBlockInRegion;
|
|
|
+ }
|
|
|
+
|
|
|
+ xTotalHeapSize += pxFirstFreeBlockInRegion->xBlockSize;
|
|
|
+
|
|
|
+ /* Move onto the next HeapRegionTagged_t structure. */
|
|
|
+ xDefinedRegions++;
|
|
|
+ xRegIdx++;
|
|
|
+ pxHeapRegion = &( pxHeapRegions[ xRegIdx ] );
|
|
|
|
|
|
#if (configENABLE_MEMORY_DEBUG == 1)
|
|
|
{
|
|
|
@@ -584,16 +584,16 @@ const HeapRegionTagged_t *pxHeapRegion;
|
|
|
mem_init_dog(pxEnd);
|
|
|
}
|
|
|
#endif
|
|
|
- }
|
|
|
+ }
|
|
|
|
|
|
- xMinimumEverFreeBytesRemaining = xTotalHeapSize;
|
|
|
- xFreeBytesRemaining = xTotalHeapSize;
|
|
|
+ xMinimumEverFreeBytesRemaining = xTotalHeapSize;
|
|
|
+ xFreeBytesRemaining = xTotalHeapSize;
|
|
|
|
|
|
- /* Check something was actually defined before it is accessed. */
|
|
|
- configASSERT( xTotalHeapSize );
|
|
|
+ /* Check something was actually defined before it is accessed. */
|
|
|
+ configASSERT( xTotalHeapSize );
|
|
|
|
|
|
- /* Work out the position of the top bit in a size_t variable. */
|
|
|
- xBlockAllocatedBit = ( ( size_t ) 1 ) << ( ( sizeof( size_t ) * heapBITS_PER_BYTE ) - 1 );
|
|
|
+ /* Work out the position of the top bit in a size_t variable. */
|
|
|
+ xBlockAllocatedBit = ( ( size_t ) 1 ) << ( ( sizeof( size_t ) * heapBITS_PER_BYTE ) - 1 );
|
|
|
|
|
|
#if (configENABLE_MEMORY_DEBUG == 1)
|
|
|
{
|