| /Kernel-v11.1.0/include/ |
| D | list.h | 30 * This is the list implementation used by the scheduler. While it is tailored
38 * Lists are created already containing one list item. The value of this
40 * the end of the list and acts as a marker. The list member pxHead always
41 * points to this marker - even though it is at the tail of the list. This
43 * the list.
45 * In addition to it's value, each list item contains a pointer to the next
46 * item in the list (pxNext), a pointer to the list it is in (pxContainer)
48 * pointers are included for efficiency of list manipulation. There is
49 * effectively a two way link between the object containing the list item and
50 * the list item itself.
[all …]
|
| D | croutine.h | 36 #include "list.h"
56 … ListItem_t xGenericListItem; /**< List item used to place the CRCB in ready and blocked queues. */
57 ListItem_t xEventListItem; /**< List item used to place the CRCB in event lists. */
73 * Create a new co-routine and add it to the list of co-routines that are
88 * list, otherwise an error code defined with ProjDefs.h.
734 * Removes the current co-routine from its ready list and places it in the
735 * appropriate delayed list.
744 * Removes the highest priority co-routine from the event list and places it in
745 * the pending ready list.
|
| /Kernel-v11.1.0/ |
| D | list.c | 38 #include "list.h"
46 * PUBLIC LIST API documented in list.h
53 /* The list structure contains a list item which is used to mark the in vListInitialise()
54 * end of the list. To initialise the list the list end is inserted in vListInitialise()
55 * as the only list entry. */ in vListInitialise()
60 /* The list end value is the highest possible value in the list to in vListInitialise()
61 * ensure it remains at the end of the list. */ in vListInitialise()
64 /* The list end next and previous pointers point to itself so we know in vListInitialise()
65 * when the list is empty. */ in vListInitialise()
80 /* Write known values into the list if in vListInitialise()
[all …]
|
| D | croutine.c | 49 …st = NULL; /**< Points to the delayed co-routine list currently being use…
50 …outineList = NULL; /**< Points to the delayed co-routine list currently being use…
65 * for the priority. It is inserted at the end of the list.
88 * in the pending ready list in order that they can later be moved to the ready
89 * list by the co-routine scheduler.
94 * Macro that looks at the list of co-routines that are currently delayed to
99 * we need not look any further down the list.
148 * in a list. */ in xCoRoutineCreate()
156 * list at the correct priority. */ in xCoRoutineCreate()
183 /* We must remove ourselves from the ready list before adding in vCoRoutineAddToDelayedList()
[all …]
|
| D | tasks.c | 189 /* listGET_OWNER_OF_NEXT_ENTRY indexes through the list, so the tasks of \
223 /* Find the highest priority list that contains ready tasks. */ \
232 * is being referenced from a ready list. If it is referenced from a delayed
233 * or suspended list then it won't be in a ready list. */
252 /* The delayed tasks list should be empty when the lists are switched. */ \
265 * Place the task represented by pxTCB into the appropriate ready list for
266 * the task. It is inserted at the end of the list.
285 /* The item value of the event list item is normally used to hold the priority
370 …ListItem_t xStateListItem; /**< The list that the state list item of a task is re…
371 ListItem_t xEventListItem; /**< Used to reference a task from an event list. */
[all …]
|
| D | timers.c | 86 …tItem; /**< Standard linked list item as used by all…
137 /* The list in which active timers are stored. Timers are referenced in expire
138 * time order, with the nearest expiry time at the front of the list. Only the
200 * current timer list does not still reference some timers.
211 * If the timer list contains any active timers then return the expire time of
213 * timer list does not contain any timers then return 0 and set *pxListWasEmpty
703 /* Insert the timer into the appropriate list for the next expiry time. in prvReloadTimer()
726 /* Remove the timer from the list of active timers. A check has already in prvProcessExpiredTimer()
727 * been performed to ensure the list is not empty. */ in prvProcessExpiredTimer()
732 * expiry time and re-insert the timer in the list of active timers. */ in prvProcessExpiredTimer()
[all …]
|
| D | event_groups.c | 57 List_t xTasksWaitingForBits; /**< List of tasks waiting for a bit to be set. */
229 * task's event list item so the kernel knows when a match is in xEventGroupSync()
264 * event list item, and they should now be retrieved then cleared. */ in xEventGroupSync()
392 * task's event list item so the kernel knows when a match is in xEventGroupWaitBits()
420 * event list item, and they should now be retrieved then cleared. */ in xEventGroupWaitBits()
621 /* Store the actual event flag value in the task's event list in xEventGroupSetBits()
622 * item before removing the task from the event list. The in xEventGroupSetBits()
629 /* Move onto the next list item. Note pxListItem->pxNext is not in xEventGroupSetBits()
630 * used here as the list item may have been removed from the event list in xEventGroupSetBits()
631 * and inserted into the ready/pending reading list. */ in xEventGroupSetBits()
[all …]
|
| /Kernel-v11.1.0/portable/MemMang/ |
| D | heap_2.c | 97 /* Define the linked list structure. This is used to link free blocks in order
101 struct A_BLOCK_LINK * pxNextFreeBlock; /*<< The next free block in the list. */
109 /* Create a couple of list links to mark the start and end of the list. */
131 * Insert a block into the list of free blocks - which is ordered by size of
132 * the block. Small blocks at the start of the list and large blocks at the end
133 * of the list.
142 …/* Iterate through the list until a block is found that has a larger size */ …
149 …/* Update the list to include the block being inserted in the correct */ …
206 * initialisation to setup the list of free blocks. */ in pvPortMalloc()
221 /* Blocks are stored in byte order - traverse the list from the start in pvPortMalloc()
[all …]
|
| D | heap_4.c | 98 /* Define the linked list structure. This is used to link free blocks in order
102 struct A_BLOCK_LINK * pxNextFreeBlock; /**< The next free block in the list. */
142 * the list of free memory blocks. The block being freed will be merged with
160 /* Create a couple of list links to mark the start and end of the list. */
223 * initialisation to setup the list of free blocks. */ in pvPortMalloc()
241 /* Traverse the list from the start (lowest address) block until in pvPortMalloc()
264 * of the list of free blocks. */ in pvPortMalloc()
285 /* Insert the new block into the list of free blocks. */ in pvPortMalloc()
386 /* Add this block to the list of free blocks. */ in vPortFree()
466 /* xStart is used to hold a pointer to the first item in the list of free in prvHeapInit()
[all …]
|
| D | heap_5.c | 149 /* Define the linked list structure. This is used to link free blocks in order
153 struct A_BLOCK_LINK * pxNextFreeBlock; /**< The next free block in the list. */
161 * the list of free memory blocks. The block being freed will be merged with
184 /* Create a couple of list links to mark the start and end of the list. */
269 /* Traverse the list from the start (lowest address) block until in pvPortMalloc()
292 * of the list of free blocks. */ in pvPortMalloc()
313 /* Insert the new block into the list of free blocks. */ in pvPortMalloc()
414 /* Add this block to the list of free blocks. */ in vPortFree()
471 /* Iterate through the list until a block is found that has a higher address in prvInsertBlockIntoFreeList()
576 /* xStart is used to hold a pointer to the first item in the list of in vPortDefineHeapRegions()
[all …]
|
| /Kernel-v11.1.0/portable/WizC/PIC18/ |
| D | Install.bat | 76 attrib -R "%FEDLIBSUSER%\libFreeRTOS\Modules\List.c" >nul
83 attrib -R "%FEDLIBSUSER%\libFreeRTOS\Include\List.h" >nul
110 copy /V /Y "..\..\..\List.c" "%FEDLIBSUSER%\libFreeRTOS\Modules\List.c" >nul
123 copy /V /Y "..\..\..\include\List.h" "%FEDLIBSUSER%\libFreeRTOS\Include\List.h" >nul
140 attrib +R "%FEDLIBSUSER%\libFreeRTOS\Modules\List.c" >nul
147 attrib +R "%FEDLIBSUSER%\libFreeRTOS\Include\List.h" >nul
|
| /Kernel-v11.1.0/portable/IAR/ARM_CM33/secure/ |
| D | secure_heap.c | 94 * @brief The linked list structure.
100 struct A_BLOCK_LINK * pxNextFreeBlock; /**< The next free block in the list. */
113 * position in the list of free memory blocks.
130 * @brief Create a couple of list links to mark the start and end of the list.
163 /* xStart is used to hold a pointer to the first item in the list of free in prvHeapInit()
168 /* pxEnd is used to mark the end of the list of free blocks and is inserted in prvHeapInit()
194 /* Iterate through the list until a block is found that has a higher address in prvInsertBlockIntoFreeList()
261 * initialisation to setup the list of free blocks. */ in pvPortMalloc()
318 /* Traverse the list from the start (lowest address) block until in pvPortMalloc()
338 * of the list of free blocks. */ in pvPortMalloc()
[all …]
|
| /Kernel-v11.1.0/portable/IAR/ARM_CM23/secure/ |
| D | secure_heap.c | 94 * @brief The linked list structure.
100 struct A_BLOCK_LINK * pxNextFreeBlock; /**< The next free block in the list. */
113 * position in the list of free memory blocks.
130 * @brief Create a couple of list links to mark the start and end of the list.
163 /* xStart is used to hold a pointer to the first item in the list of free in prvHeapInit()
168 /* pxEnd is used to mark the end of the list of free blocks and is inserted in prvHeapInit()
194 /* Iterate through the list until a block is found that has a higher address in prvInsertBlockIntoFreeList()
261 * initialisation to setup the list of free blocks. */ in pvPortMalloc()
318 /* Traverse the list from the start (lowest address) block until in pvPortMalloc()
338 * of the list of free blocks. */ in pvPortMalloc()
[all …]
|
| /Kernel-v11.1.0/portable/IAR/ARM_CM55/secure/ |
| D | secure_heap.c | 94 * @brief The linked list structure.
100 struct A_BLOCK_LINK * pxNextFreeBlock; /**< The next free block in the list. */
113 * position in the list of free memory blocks.
130 * @brief Create a couple of list links to mark the start and end of the list.
163 /* xStart is used to hold a pointer to the first item in the list of free in prvHeapInit()
168 /* pxEnd is used to mark the end of the list of free blocks and is inserted in prvHeapInit()
194 /* Iterate through the list until a block is found that has a higher address in prvInsertBlockIntoFreeList()
261 * initialisation to setup the list of free blocks. */ in pvPortMalloc()
318 /* Traverse the list from the start (lowest address) block until in pvPortMalloc()
338 * of the list of free blocks. */ in pvPortMalloc()
[all …]
|
| /Kernel-v11.1.0/portable/IAR/ARM_CM85/secure/ |
| D | secure_heap.c | 94 * @brief The linked list structure.
100 struct A_BLOCK_LINK * pxNextFreeBlock; /**< The next free block in the list. */
113 * position in the list of free memory blocks.
130 * @brief Create a couple of list links to mark the start and end of the list.
163 /* xStart is used to hold a pointer to the first item in the list of free in prvHeapInit()
168 /* pxEnd is used to mark the end of the list of free blocks and is inserted in prvHeapInit()
194 /* Iterate through the list until a block is found that has a higher address in prvInsertBlockIntoFreeList()
261 * initialisation to setup the list of free blocks. */ in pvPortMalloc()
318 /* Traverse the list from the start (lowest address) block until in pvPortMalloc()
338 * of the list of free blocks. */ in pvPortMalloc()
[all …]
|
| /Kernel-v11.1.0/portable/ARMv8M/secure/heap/ |
| D | secure_heap.c | 94 * @brief The linked list structure.
100 struct A_BLOCK_LINK * pxNextFreeBlock; /**< The next free block in the list. */
113 * position in the list of free memory blocks.
130 * @brief Create a couple of list links to mark the start and end of the list.
163 /* xStart is used to hold a pointer to the first item in the list of free in prvHeapInit()
168 /* pxEnd is used to mark the end of the list of free blocks and is inserted in prvHeapInit()
194 /* Iterate through the list until a block is found that has a higher address in prvInsertBlockIntoFreeList()
261 * initialisation to setup the list of free blocks. */ in pvPortMalloc()
318 /* Traverse the list from the start (lowest address) block until in pvPortMalloc()
338 * of the list of free blocks. */ in pvPortMalloc()
[all …]
|
| /Kernel-v11.1.0/portable/GCC/ARM_CM85/secure/ |
| D | secure_heap.c | 94 * @brief The linked list structure.
100 struct A_BLOCK_LINK * pxNextFreeBlock; /**< The next free block in the list. */
113 * position in the list of free memory blocks.
130 * @brief Create a couple of list links to mark the start and end of the list.
163 /* xStart is used to hold a pointer to the first item in the list of free in prvHeapInit()
168 /* pxEnd is used to mark the end of the list of free blocks and is inserted in prvHeapInit()
194 /* Iterate through the list until a block is found that has a higher address in prvInsertBlockIntoFreeList()
261 * initialisation to setup the list of free blocks. */ in pvPortMalloc()
318 /* Traverse the list from the start (lowest address) block until in pvPortMalloc()
338 * of the list of free blocks. */ in pvPortMalloc()
[all …]
|
| /Kernel-v11.1.0/portable/GCC/ARM_CM23/secure/ |
| D | secure_heap.c | 94 * @brief The linked list structure.
100 struct A_BLOCK_LINK * pxNextFreeBlock; /**< The next free block in the list. */
113 * position in the list of free memory blocks.
130 * @brief Create a couple of list links to mark the start and end of the list.
163 /* xStart is used to hold a pointer to the first item in the list of free in prvHeapInit()
168 /* pxEnd is used to mark the end of the list of free blocks and is inserted in prvHeapInit()
194 /* Iterate through the list until a block is found that has a higher address in prvInsertBlockIntoFreeList()
261 * initialisation to setup the list of free blocks. */ in pvPortMalloc()
318 /* Traverse the list from the start (lowest address) block until in pvPortMalloc()
338 * of the list of free blocks. */ in pvPortMalloc()
[all …]
|
| /Kernel-v11.1.0/portable/GCC/ARM_CM33/secure/ |
| D | secure_heap.c | 94 * @brief The linked list structure.
100 struct A_BLOCK_LINK * pxNextFreeBlock; /**< The next free block in the list. */
113 * position in the list of free memory blocks.
130 * @brief Create a couple of list links to mark the start and end of the list.
163 /* xStart is used to hold a pointer to the first item in the list of free in prvHeapInit()
168 /* pxEnd is used to mark the end of the list of free blocks and is inserted in prvHeapInit()
194 /* Iterate through the list until a block is found that has a higher address in prvInsertBlockIntoFreeList()
261 * initialisation to setup the list of free blocks. */ in pvPortMalloc()
318 /* Traverse the list from the start (lowest address) block until in pvPortMalloc()
338 * of the list of free blocks. */ in pvPortMalloc()
[all …]
|
| /Kernel-v11.1.0/portable/IAR/ARM_CM35P/secure/ |
| D | secure_heap.c | 94 * @brief The linked list structure.
100 struct A_BLOCK_LINK * pxNextFreeBlock; /**< The next free block in the list. */
113 * position in the list of free memory blocks.
130 * @brief Create a couple of list links to mark the start and end of the list.
163 /* xStart is used to hold a pointer to the first item in the list of free in prvHeapInit()
168 /* pxEnd is used to mark the end of the list of free blocks and is inserted in prvHeapInit()
194 /* Iterate through the list until a block is found that has a higher address in prvInsertBlockIntoFreeList()
261 * initialisation to setup the list of free blocks. */ in pvPortMalloc()
318 /* Traverse the list from the start (lowest address) block until in pvPortMalloc()
338 * of the list of free blocks. */ in pvPortMalloc()
[all …]
|
| /Kernel-v11.1.0/portable/GCC/ARM_CM55/secure/ |
| D | secure_heap.c | 94 * @brief The linked list structure.
100 struct A_BLOCK_LINK * pxNextFreeBlock; /**< The next free block in the list. */
113 * position in the list of free memory blocks.
130 * @brief Create a couple of list links to mark the start and end of the list.
163 /* xStart is used to hold a pointer to the first item in the list of free in prvHeapInit()
168 /* pxEnd is used to mark the end of the list of free blocks and is inserted in prvHeapInit()
194 /* Iterate through the list until a block is found that has a higher address in prvInsertBlockIntoFreeList()
261 * initialisation to setup the list of free blocks. */ in pvPortMalloc()
318 /* Traverse the list from the start (lowest address) block until in pvPortMalloc()
338 * of the list of free blocks. */ in pvPortMalloc()
[all …]
|
| /Kernel-v11.1.0/portable/GCC/ARM_CM35P/secure/ |
| D | secure_heap.c | 94 * @brief The linked list structure.
100 struct A_BLOCK_LINK * pxNextFreeBlock; /**< The next free block in the list. */
113 * position in the list of free memory blocks.
130 * @brief Create a couple of list links to mark the start and end of the list.
163 /* xStart is used to hold a pointer to the first item in the list of free in prvHeapInit()
168 /* pxEnd is used to mark the end of the list of free blocks and is inserted in prvHeapInit()
194 /* Iterate through the list until a block is found that has a higher address in prvInsertBlockIntoFreeList()
261 * initialisation to setup the list of free blocks. */ in pvPortMalloc()
318 /* Traverse the list from the start (lowest address) block until in pvPortMalloc()
338 * of the list of free blocks. */ in pvPortMalloc()
[all …]
|
| /Kernel-v11.1.0/portable/GCC/TriCore_1782/ |
| D | port.c | 42 #include "list.h"
142 /* Remove the two consumed CSAs from the free CSA list. */ in pxPortInitialiseStack()
151 /* Simply trigger a context list depletion trap. */ in pxPortInitialiseStack()
375 * This function uses the head of the linked list of CSAs (from when the
377 * the call stack) and inserts this list at the head of the Free list,
378 * attaching the existing Free List to the tail of the reclaimed call stack.
390 /* A pointer to the first CSA in the list of CSAs consumed by the task is in vPortReclaimCSA()
415 /* Move the pointer to point to the next CSA in the list. */ in vPortReclaimCSA()
|
| /Kernel-v11.1.0/portable/ThirdParty/GCC/RP2040/ |
| D | LICENSE.md | 8 1. Redistributions of source code must retain the above copyright notice, this list of conditions a…
11 2. Redistributions in binary form must reproduce the above copyright notice, this list of condition…
|
| D | CMakeLists.txt | 34 list(APPEND PICO_SDK_POST_LIST_FILES ${CMAKE_CURRENT_LIST_DIR}/library.cmake)
37 … list(APPEND PICO_CONFIG_HEADER_FILES ${CMAKE_CURRENT_LIST_DIR}/include/freertos_sdk_config.h)
|
