len0rd/FreeRTOS-Kernel
1
0
Fork 0
mirror of https://github.com/FreeRTOS/FreeRTOS-Kernel.git synced 2025-06-07 04:49:04 -04:00
Code Issues Packages Projects Releases Wiki Activity

[kernel & MemMang] use space to replace tab and remove meaningless space in the end of each line (#314)

Browse source 
Signed-off-by: Meco Man <920369182@qq.com>

Co-authored-by: alfred gedeon <28123637+alfred2g@users.noreply.github.com>
This commit is contained in:
Meco Jianting Man 2021-04-20 00:58:55 +08:00 committed by GitHub
parent 46f7feba81
commit d8770748ff
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
7 changed files with 24 additions and 24 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
portable/MemMang/heap_4.c
View file

@ -170,7 +170,7 @@ void * pvPortMalloc( size_t xWantedSize )
if( ( xWantedSize > 0 ) && ( xWantedSize <= xFreeBytesRemaining ) ) if( ( xWantedSize > 0 ) && ( xWantedSize <= xFreeBytesRemaining ) )
{ {
/* Traverse the list from the start (lowest address) block until /* Traverse the list from the start (lowest address) block until
* one of adequate size is found. */ * one of adequate size is found. */
pxPreviousBlock = &xStart; pxPreviousBlock = &xStart;
pxBlock = xStart.pxNextFreeBlock; pxBlock = xStart.pxNextFreeBlock;

6
portable/MemMang/heap_5.c
View file

@ -45,8 +45,8 @@
* *
* typedef struct HeapRegion * typedef struct HeapRegion
* { * {
* uint8_t *pucStartAddress; << Start address of a block of memory that will be part of the heap. * 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. * size_t xSizeInBytes; << Size of the block of memory.
* } HeapRegion_t; * } HeapRegion_t;
* *
* The array is terminated using a NULL zero sized region definition, and the * The array is terminated using a NULL zero sized region definition, and the
@ -180,7 +180,7 @@ void * pvPortMalloc( size_t xWantedSize )
if( ( xWantedSize > 0 ) && ( xWantedSize <= xFreeBytesRemaining ) ) if( ( xWantedSize > 0 ) && ( xWantedSize <= xFreeBytesRemaining ) )
{ {
/* Traverse the list from the start (lowest address) block until /* Traverse the list from the start (lowest address) block until
* one of adequate size is found. */ * one of adequate size is found. */
pxPreviousBlock = &xStart; pxPreviousBlock = &xStart;
pxBlock = xStart.pxNextFreeBlock; pxBlock = xStart.pxNextFreeBlock;