2 FreeRTOS.org V4.7.2 - Copyright (C) 2003-2008 Richard Barry.
\r
4 This file is part of the FreeRTOS.org distribution.
\r
6 FreeRTOS.org is free software; you can redistribute it and/or modify
\r
7 it under the terms of the GNU General Public License as published by
\r
8 the Free Software Foundation; either version 2 of the License, or
\r
9 (at your option) any later version.
\r
11 FreeRTOS.org is distributed in the hope that it will be useful,
\r
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
\r
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
\r
14 GNU General Public License for more details.
\r
16 You should have received a copy of the GNU General Public License
\r
17 along with FreeRTOS.org; if not, write to the Free Software
\r
18 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
\r
20 A special exception to the GPL can be applied should you wish to distribute
\r
21 a combined work that includes FreeRTOS.org, without being obliged to provide
\r
22 the source code for any proprietary components. See the licensing section
\r
23 of http://www.FreeRTOS.org for full details of how and when the exception
\r
26 ***************************************************************************
\r
28 Please ensure to read the configuration and relevant port sections of the
\r
29 online documentation.
\r
31 +++ http://www.FreeRTOS.org +++
\r
32 Documentation, latest information, license and contact details.
\r
34 +++ http://www.SafeRTOS.com +++
\r
35 A version that is certified for use in safety critical systems.
\r
37 +++ http://www.OpenRTOS.com +++
\r
38 Commercial support, development, porting, licensing and training services.
\r
40 ***************************************************************************
\r
44 * This is the list implementation used by the scheduler. While it is tailored
\r
45 * heavily for the schedulers needs, it is also available for use by
\r
48 * xLists can only store pointers to xListItems. Each xListItem contains a
\r
49 * numeric value (xItemValue). Most of the time the lists are sorted in
\r
50 * descending item value order.
\r
52 * Lists are created already containing one list item. The value of this
\r
53 * item is the maximum possible that can be stored, it is therefore always at
\r
54 * the end of the list and acts as a marker. The list member pxHead always
\r
55 * points to this marker - even though it is at the tail of the list. This
\r
56 * is because the tail contains a wrap back pointer to the true head of
\r
59 * In addition to it's value, each list item contains a pointer to the next
\r
60 * item in the list (pxNext), a pointer to the list it is in (pxContainer)
\r
61 * and a pointer to back to the object that contains it. These later two
\r
62 * pointers are included for efficiency of list manipulation. There is
\r
63 * effectively a two way link between the object containing the list item and
\r
64 * the list item itself.
\r
67 * \page ListIntroduction List Implementation
\r
68 * \ingroup FreeRTOSIntro
\r
74 + Included local const within listGET_OWNER_OF_NEXT_ENTRY() to assist
\r
75 compiler with optimisation. Thanks B.R.
\r
85 * Definition of the only type of object that a list can contain.
\r
89 portTickType xItemValue; /*< The value being listed. In most cases this is used to sort the list in descending order. */
\r
90 volatile struct xLIST_ITEM * pxNext; /*< Pointer to the next xListItem in the list. */
\r
91 volatile struct xLIST_ITEM * pxPrevious;/*< Pointer to the previous xListItem in the list. */
\r
92 void * pvOwner; /*< Pointer to the object (normally a TCB) that contains the list item. There is therefore a two way link between the object containing the list item and the list item itself. */
\r
93 void * pvContainer; /*< Pointer to the list in which this list item is placed (if any). */
\r
95 typedef struct xLIST_ITEM xListItem; /* For some reason lint wants this as two separate definitions. */
\r
97 struct xMINI_LIST_ITEM
\r
99 portTickType xItemValue;
\r
100 volatile struct xLIST_ITEM *pxNext;
\r
101 volatile struct xLIST_ITEM *pxPrevious;
\r
103 typedef struct xMINI_LIST_ITEM xMiniListItem;
\r
106 * Definition of the type of queue used by the scheduler.
\r
108 typedef struct xLIST
\r
110 volatile unsigned portBASE_TYPE uxNumberOfItems;
\r
111 volatile xListItem * pxIndex; /*< Used to walk through the list. Points to the last item returned by a call to pvListGetOwnerOfNextEntry (). */
\r
112 volatile xMiniListItem xListEnd; /*< List item that contains the maximum possible item value meaning it is always at the end of the list and is therefore used as a marker. */
\r
116 * Access macro to set the owner of a list item. The owner of a list item
\r
117 * is the object (usually a TCB) that contains the list item.
\r
119 * \page listSET_LIST_ITEM_OWNER listSET_LIST_ITEM_OWNER
\r
120 * \ingroup LinkedList
\r
122 #define listSET_LIST_ITEM_OWNER( pxListItem, pxOwner ) ( pxListItem )->pvOwner = ( void * ) pxOwner
\r
125 * Access macro to set the value of the list item. In most cases the value is
\r
126 * used to sort the list in descending order.
\r
128 * \page listSET_LIST_ITEM_VALUE listSET_LIST_ITEM_VALUE
\r
129 * \ingroup LinkedList
\r
131 #define listSET_LIST_ITEM_VALUE( pxListItem, xValue ) ( pxListItem )->xItemValue = xValue
\r
134 * Access macro the retrieve the value of the list item. The value can
\r
135 * represent anything - for example a the priority of a task, or the time at
\r
136 * which a task should be unblocked.
\r
138 * \page listGET_LIST_ITEM_VALUE listGET_LIST_ITEM_VALUE
\r
139 * \ingroup LinkedList
\r
141 #define listGET_LIST_ITEM_VALUE( pxListItem ) ( ( pxListItem )->xItemValue )
\r
144 * Access macro to determine if a list contains any items. The macro will
\r
145 * only have the value true if the list is empty.
\r
147 * \page listLIST_IS_EMPTY listLIST_IS_EMPTY
\r
148 * \ingroup LinkedList
\r
150 #define listLIST_IS_EMPTY( pxList ) ( ( pxList )->uxNumberOfItems == ( unsigned portBASE_TYPE ) 0 )
\r
153 * Access macro to return the number of items in the list.
\r
155 #define listCURRENT_LIST_LENGTH( pxList ) ( ( pxList )->uxNumberOfItems )
\r
158 * Access function to obtain the owner of the next entry in a list.
\r
160 * The list member pxIndex is used to walk through a list. Calling
\r
161 * listGET_OWNER_OF_NEXT_ENTRY increments pxIndex to the next item in the list
\r
162 * and returns that entries pxOwner parameter. Using multiple calls to this
\r
163 * function it is therefore possible to move through every item contained in
\r
166 * The pxOwner parameter of a list item is a pointer to the object that owns
\r
167 * the list item. In the scheduler this is normally a task control block.
\r
168 * The pxOwner parameter effectively creates a two way link between the list
\r
169 * item and its owner.
\r
171 * @param pxList The list from which the next item owner is to be returned.
\r
173 * \page listGET_OWNER_OF_NEXT_ENTRY listGET_OWNER_OF_NEXT_ENTRY
\r
174 * \ingroup LinkedList
\r
176 #define listGET_OWNER_OF_NEXT_ENTRY( pxTCB, pxList ) \
\r
178 xList * const pxConstList = pxList; \
\r
179 /* Increment the index to the next item and return the item, ensuring */ \
\r
180 /* we don't return the marker used at the end of the list. */ \
\r
181 ( pxConstList )->pxIndex = ( pxConstList )->pxIndex->pxNext; \
\r
182 if( ( pxConstList )->pxIndex == ( xListItem * ) &( ( pxConstList )->xListEnd ) ) \
\r
184 ( pxConstList )->pxIndex = ( pxConstList )->pxIndex->pxNext; \
\r
186 pxTCB = ( pxConstList )->pxIndex->pvOwner; \
\r
191 * Access function to obtain the owner of the first entry in a list. Lists
\r
192 * are normally sorted in ascending item value order.
\r
194 * This function returns the pxOwner member of the first item in the list.
\r
195 * The pxOwner parameter of a list item is a pointer to the object that owns
\r
196 * the list item. In the scheduler this is normally a task control block.
\r
197 * The pxOwner parameter effectively creates a two way link between the list
\r
198 * item and its owner.
\r
200 * @param pxList The list from which the owner of the head item is to be
\r
203 * \page listGET_OWNER_OF_HEAD_ENTRY listGET_OWNER_OF_HEAD_ENTRY
\r
204 * \ingroup LinkedList
\r
206 #define listGET_OWNER_OF_HEAD_ENTRY( pxList ) ( ( pxList->uxNumberOfItems != ( unsigned portBASE_TYPE ) 0 ) ? ( (&( pxList->xListEnd ))->pxNext->pvOwner ) : ( NULL ) )
\r
209 * Check to see if a list item is within a list. The list item maintains a
\r
210 * "container" pointer that points to the list it is in. All this macro does
\r
211 * is check to see if the container and the list match.
\r
213 * @param pxList The list we want to know if the list item is within.
\r
214 * @param pxListItem The list item we want to know if is in the list.
\r
215 * @return pdTRUE is the list item is in the list, otherwise pdFALSE.
\r
218 #define listIS_CONTAINED_WITHIN( pxList, pxListItem ) ( ( pxListItem )->pvContainer == ( void * ) pxList )
\r
221 * Must be called before a list is used! This initialises all the members
\r
222 * of the list structure and inserts the xListEnd item into the list as a
\r
223 * marker to the back of the list.
\r
225 * @param pxList Pointer to the list being initialised.
\r
227 * \page vListInitialise vListInitialise
\r
228 * \ingroup LinkedList
\r
230 void vListInitialise( xList *pxList );
\r
233 * Must be called before a list item is used. This sets the list container to
\r
234 * null so the item does not think that it is already contained in a list.
\r
236 * @param pxItem Pointer to the list item being initialised.
\r
238 * \page vListInitialiseItem vListInitialiseItem
\r
239 * \ingroup LinkedList
\r
241 void vListInitialiseItem( xListItem *pxItem );
\r
244 * Insert a list item into a list. The item will be inserted into the list in
\r
245 * a position determined by its item value (descending item value order).
\r
247 * @param pxList The list into which the item is to be inserted.
\r
249 * @param pxNewListItem The item to that is to be placed in the list.
\r
251 * \page vListInsert vListInsert
\r
252 * \ingroup LinkedList
\r
254 void vListInsert( xList *pxList, xListItem *pxNewListItem );
\r
257 * Insert a list item into a list. The item will be inserted in a position
\r
258 * such that it will be the last item within the list returned by multiple
\r
259 * calls to listGET_OWNER_OF_NEXT_ENTRY.
\r
261 * The list member pvIndex is used to walk through a list. Calling
\r
262 * listGET_OWNER_OF_NEXT_ENTRY increments pvIndex to the next item in the list.
\r
263 * Placing an item in a list using vListInsertEnd effectively places the item
\r
264 * in the list position pointed to by pvIndex. This means that every other
\r
265 * item within the list will be returned by listGET_OWNER_OF_NEXT_ENTRY before
\r
266 * the pvIndex parameter again points to the item being inserted.
\r
268 * @param pxList The list into which the item is to be inserted.
\r
270 * @param pxNewListItem The list item to be inserted into the list.
\r
272 * \page vListInsertEnd vListInsertEnd
\r
273 * \ingroup LinkedList
\r
275 void vListInsertEnd( xList *pxList, xListItem *pxNewListItem );
\r
278 * Remove an item from a list. The list item has a pointer to the list that
\r
279 * it is in, so only the list item need be passed into the function.
\r
281 * @param vListRemove The item to be removed. The item will remove itself from
\r
282 * the list pointed to by it's pxContainer parameter.
\r
284 * \page vListRemove vListRemove
\r
285 * \ingroup LinkedList
\r
287 void vListRemove( xListItem *pxItemToRemove );
\r