2 FreeRTOS V7.6.0 - Copyright (C) 2013 Real Time Engineers Ltd.
\r
5 VISIT http://www.FreeRTOS.org TO ENSURE YOU ARE USING THE LATEST VERSION.
\r
7 ***************************************************************************
\r
9 * FreeRTOS provides completely free yet professionally developed, *
\r
10 * robust, strictly quality controlled, supported, and cross *
\r
11 * platform software that has become a de facto standard. *
\r
13 * Help yourself get started quickly and support the FreeRTOS *
\r
14 * project by purchasing a FreeRTOS tutorial book, reference *
\r
15 * manual, or both from: http://www.FreeRTOS.org/Documentation *
\r
19 ***************************************************************************
\r
21 This file is part of the FreeRTOS distribution.
\r
23 FreeRTOS is free software; you can redistribute it and/or modify it under
\r
24 the terms of the GNU General Public License (version 2) as published by the
\r
25 Free Software Foundation >>!AND MODIFIED BY!<< the FreeRTOS exception.
\r
27 >>! NOTE: The modification to the GPL is included to allow you to distribute
\r
28 >>! a combined work that includes FreeRTOS without being obliged to provide
\r
29 >>! the source code for proprietary components outside of the FreeRTOS
\r
32 FreeRTOS is distributed in the hope that it will be useful, but WITHOUT ANY
\r
33 WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
\r
34 FOR A PARTICULAR PURPOSE. Full license text is available from the following
\r
35 link: http://www.freertos.org/a00114.html
\r
39 ***************************************************************************
\r
41 * Having a problem? Start by reading the FAQ "My application does *
\r
42 * not run, what could be wrong?" *
\r
44 * http://www.FreeRTOS.org/FAQHelp.html *
\r
46 ***************************************************************************
\r
48 http://www.FreeRTOS.org - Documentation, books, training, latest versions,
\r
49 license and Real Time Engineers Ltd. contact details.
\r
51 http://www.FreeRTOS.org/plus - A selection of FreeRTOS ecosystem products,
\r
52 including FreeRTOS+Trace - an indispensable productivity tool, a DOS
\r
53 compatible FAT file system, and our tiny thread aware UDP/IP stack.
\r
55 http://www.OpenRTOS.com - Real Time Engineers ltd license FreeRTOS to High
\r
56 Integrity Systems to sell under the OpenRTOS brand. Low cost OpenRTOS
\r
57 licenses offer ticketed support, indemnification and middleware.
\r
59 http://www.SafeRTOS.com - High Integrity Systems also provide a safety
\r
60 engineered and independently SIL3 certified version for use in safety and
\r
61 mission critical applications that require provable dependability.
\r
68 #include "FreeRTOS.h"
\r
71 /*-----------------------------------------------------------
\r
72 * PUBLIC LIST API documented in list.h
\r
73 *----------------------------------------------------------*/
\r
75 void vListInitialise( List_t * const pxList )
\r
77 /* The list structure contains a list item which is used to mark the
\r
78 end of the list. To initialise the list the list end is inserted
\r
79 as the only list entry. */
\r
80 pxList->pxIndex = ( ListItem_t * ) &( pxList->xListEnd ); /*lint !e826 !e740 The mini list structure is used as the list end to save RAM. This is checked and valid. */
\r
82 /* The list end value is the highest possible value in the list to
\r
83 ensure it remains at the end of the list. */
\r
84 pxList->xListEnd.xItemValue = portMAX_DELAY;
\r
86 /* The list end next and previous pointers point to itself so we know
\r
87 when the list is empty. */
\r
88 pxList->xListEnd.pxNext = ( ListItem_t * ) &( pxList->xListEnd ); /*lint !e826 !e740 The mini list structure is used as the list end to save RAM. This is checked and valid. */
\r
89 pxList->xListEnd.pxPrevious = ( ListItem_t * ) &( pxList->xListEnd );/*lint !e826 !e740 The mini list structure is used as the list end to save RAM. This is checked and valid. */
\r
91 pxList->uxNumberOfItems = ( UBaseType_t ) 0U;
\r
93 /*-----------------------------------------------------------*/
\r
95 void vListInitialiseItem( ListItem_t * const pxItem )
\r
97 /* Make sure the list item is not recorded as being on a list. */
\r
98 pxItem->pvContainer = NULL;
\r
100 /*-----------------------------------------------------------*/
\r
102 void vListInsertEnd( List_t * const pxList, ListItem_t * const pxNewListItem )
\r
104 ListItem_t * const pxIndex = pxList->pxIndex;
\r
106 /* Insert a new list item into pxList, but rather than sort the list,
\r
107 makes the new list item the last item to be removed by a call to
\r
108 listGET_OWNER_OF_NEXT_ENTRY(). */
\r
109 pxNewListItem->pxNext = pxIndex;
\r
110 pxNewListItem->pxPrevious = pxIndex->pxPrevious;
\r
111 pxIndex->pxPrevious->pxNext = pxNewListItem;
\r
112 pxIndex->pxPrevious = pxNewListItem;
\r
114 /* Remember which list the item is in. */
\r
115 pxNewListItem->pvContainer = ( void * ) pxList;
\r
117 ( pxList->uxNumberOfItems )++;
\r
119 /*-----------------------------------------------------------*/
\r
121 void vListInsert( List_t * const pxList, ListItem_t * const pxNewListItem )
\r
123 ListItem_t *pxIterator;
\r
124 const TickType_t xValueOfInsertion = pxNewListItem->xItemValue;
\r
126 /* Insert the new list item into the list, sorted in xItemValue order.
\r
128 If the list already contains a list item with the same item value then
\r
129 the new list item should be placed after it. This ensures that TCB's which
\r
130 are stored in ready lists (all of which have the same xItemValue value)
\r
131 get an equal share of the CPU. However, if the xItemValue is the same as
\r
132 the back marker the iteration loop below will not end. This means we need
\r
133 to guard against this by checking the value first and modifying the
\r
134 algorithm slightly if necessary. */
\r
135 if( xValueOfInsertion == portMAX_DELAY )
\r
137 pxIterator = pxList->xListEnd.pxPrevious;
\r
141 /* *** NOTE ***********************************************************
\r
142 If you find your application is crashing here then likely causes are:
\r
143 1) Stack overflow -
\r
144 see http://www.freertos.org/Stacks-and-stack-overflow-checking.html
\r
145 2) Incorrect interrupt priority assignment, especially on Cortex-M3
\r
146 parts where numerically high priority values denote low actual
\r
147 interrupt priories, which can seem counter intuitive. See
\r
148 configMAX_SYSCALL_INTERRUPT_PRIORITY on http://www.freertos.org/a00110.html
\r
149 3) Calling an API function from within a critical section or when
\r
150 the scheduler is suspended, or calling an API function that does
\r
151 not end in "FromISR" from an interrupt.
\r
152 4) Using a queue or semaphore before it has been initialised or
\r
153 before the scheduler has been started (are interrupts firing
\r
154 before vTaskStartScheduler() has been called?).
\r
155 See http://www.freertos.org/FAQHelp.html for more tips, and ensure
\r
156 configASSERT() is defined! http://www.freertos.org/a00110.html#configASSERT
\r
157 **********************************************************************/
\r
159 for( pxIterator = ( ListItem_t * ) &( pxList->xListEnd ); pxIterator->pxNext->xItemValue <= xValueOfInsertion; pxIterator = pxIterator->pxNext ) /*lint !e826 !e740 The mini list structure is used as the list end to save RAM. This is checked and valid. */
\r
161 /* There is nothing to do here, we are just iterating to the
\r
162 wanted insertion position. */
\r
166 pxNewListItem->pxNext = pxIterator->pxNext;
\r
167 pxNewListItem->pxNext->pxPrevious = pxNewListItem;
\r
168 pxNewListItem->pxPrevious = pxIterator;
\r
169 pxIterator->pxNext = pxNewListItem;
\r
171 /* Remember which list the item is in. This allows fast removal of the
\r
173 pxNewListItem->pvContainer = ( void * ) pxList;
\r
175 ( pxList->uxNumberOfItems )++;
\r
177 /*-----------------------------------------------------------*/
\r
179 UBaseType_t uxListRemove( ListItem_t * const pxItemToRemove )
\r
181 /* The list item knows which list it is in. Obtain the list from the list
\r
183 List_t * const pxList = ( List_t * ) pxItemToRemove->pvContainer;
\r
185 pxItemToRemove->pxNext->pxPrevious = pxItemToRemove->pxPrevious;
\r
186 pxItemToRemove->pxPrevious->pxNext = pxItemToRemove->pxNext;
\r
188 /* Make sure the index is left pointing to a valid item. */
\r
189 if( pxList->pxIndex == pxItemToRemove )
\r
191 pxList->pxIndex = pxItemToRemove->pxPrevious;
\r
195 mtCOVERAGE_TEST_MARKER();
\r
198 pxItemToRemove->pvContainer = NULL;
\r
199 ( pxList->uxNumberOfItems )--;
\r
201 return pxList->uxNumberOfItems;
\r
203 /*-----------------------------------------------------------*/
\r