2 FreeRTOS V7.3.0 - Copyright (C) 2012 Real Time Engineers Ltd.
\r
4 FEATURES AND PORTS ARE ADDED TO FREERTOS ALL THE TIME. PLEASE VISIT
\r
5 http://www.FreeRTOS.org TO ENSURE YOU ARE USING THE LATEST VERSION.
\r
7 ***************************************************************************
\r
9 * FreeRTOS tutorial books are available in pdf and paperback. *
\r
10 * Complete, revised, and edited pdf reference manuals are also *
\r
13 * Purchasing FreeRTOS documentation will not only help you, by *
\r
14 * ensuring you get running as quickly as possible and with an *
\r
15 * in-depth knowledge of how to use FreeRTOS, it will also help *
\r
16 * the FreeRTOS project to continue with its mission of providing *
\r
17 * professional grade, cross platform, de facto standard solutions *
\r
18 * for microcontrollers - completely free of charge! *
\r
20 * >>> See http://www.FreeRTOS.org/Documentation for details. <<< *
\r
22 * Thank you for using FreeRTOS, and thank you for your support! *
\r
24 ***************************************************************************
\r
27 This file is part of the FreeRTOS distribution.
\r
29 FreeRTOS is free software; you can redistribute it and/or modify it under
\r
30 the terms of the GNU General Public License (version 2) as published by the
\r
31 Free Software Foundation AND MODIFIED BY the FreeRTOS exception.
\r
32 >>>NOTE<<< The modification to the GPL is included to allow you to
\r
33 distribute a combined work that includes FreeRTOS without being obliged to
\r
34 provide the source code for proprietary components outside of the FreeRTOS
\r
35 kernel. FreeRTOS is distributed in the hope that it will be useful, but
\r
36 WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
\r
37 or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
\r
38 more details. You should have received a copy of the GNU General Public
\r
39 License and the FreeRTOS license exception along with FreeRTOS; if not it
\r
40 can be viewed here: http://www.freertos.org/a00114.html and also obtained
\r
41 by writing to Richard Barry, contact details for whom are available on the
\r
46 ***************************************************************************
\r
48 * Having a problem? Start by reading the FAQ "My application does *
\r
49 * not run, what could be wrong?" *
\r
51 * http://www.FreeRTOS.org/FAQHelp.html *
\r
53 ***************************************************************************
\r
56 http://www.FreeRTOS.org - Documentation, training, latest versions, license
\r
57 and contact details.
\r
59 http://www.FreeRTOS.org/plus - A selection of FreeRTOS ecosystem products,
\r
60 including FreeRTOS+Trace - an indispensable productivity tool.
\r
62 Real Time Engineers ltd license FreeRTOS to High Integrity Systems, who sell
\r
63 the code with commercial support, indemnification, and middleware, under
\r
64 the OpenRTOS brand: http://www.OpenRTOS.com. High Integrity Systems also
\r
65 provide a safety engineered and independently SIL3 certified version under
\r
66 the SafeRTOS brand: http://www.SafeRTOS.com.
\r
70 The tasks defined on this page demonstrate the use of recursive mutexes.
\r
72 For recursive mutex functionality the created mutex should be created using
\r
73 xSemaphoreCreateRecursiveMutex(), then be manipulated
\r
74 using the xSemaphoreTakeRecursive() and xSemaphoreGiveRecursive() API
\r
77 This demo creates three tasks all of which access the same recursive mutex:
\r
79 prvRecursiveMutexControllingTask() has the highest priority so executes
\r
80 first and grabs the mutex. It then performs some recursive accesses -
\r
81 between each of which it sleeps for a short period to let the lower
\r
82 priority tasks execute. When it has completed its demo functionality
\r
83 it gives the mutex back before suspending itself.
\r
85 prvRecursiveMutexBlockingTask() attempts to access the mutex by performing
\r
86 a blocking 'take'. The blocking task has a lower priority than the
\r
87 controlling task so by the time it executes the mutex has already been
\r
88 taken by the controlling task, causing the blocking task to block. It
\r
89 does not unblock until the controlling task has given the mutex back,
\r
90 and it does not actually run until the controlling task has suspended
\r
91 itself (due to the relative priorities). When it eventually does obtain
\r
92 the mutex all it does is give the mutex back prior to also suspending
\r
93 itself. At this point both the controlling task and the blocking task are
\r
96 prvRecursiveMutexPollingTask() runs at the idle priority. It spins round
\r
97 a tight loop attempting to obtain the mutex with a non-blocking call. As
\r
98 the lowest priority task it will not successfully obtain the mutex until
\r
99 both the controlling and blocking tasks are suspended. Once it eventually
\r
100 does obtain the mutex it first unsuspends both the controlling task and
\r
101 blocking task prior to giving the mutex back - resulting in the polling
\r
102 task temporarily inheriting the controlling tasks priority.
\r
105 /* Scheduler include files. */
\r
106 #include "FreeRTOS.h"
\r
108 #include "semphr.h"
\r
110 /* Demo app include files. */
\r
111 #include "recmutex.h"
\r
113 /* Priorities assigned to the three tasks. */
\r
114 #define recmuCONTROLLING_TASK_PRIORITY ( tskIDLE_PRIORITY + 2 )
\r
115 #define recmuBLOCKING_TASK_PRIORITY ( tskIDLE_PRIORITY + 1 )
\r
116 #define recmuPOLLING_TASK_PRIORITY ( tskIDLE_PRIORITY + 0 )
\r
118 /* The recursive call depth. */
\r
119 #define recmuMAX_COUNT ( 10 )
\r
122 #define recmuSHORT_DELAY ( 20 / portTICK_RATE_MS )
\r
123 #define recmuNO_DELAY ( ( portTickType ) 0 )
\r
124 #define recmuTWO_TICK_DELAY ( ( portTickType ) 2 )
\r
126 /* The three tasks as described at the top of this file. */
\r
127 static void prvRecursiveMutexControllingTask( void *pvParameters );
\r
128 static void prvRecursiveMutexBlockingTask( void *pvParameters );
\r
129 static void prvRecursiveMutexPollingTask( void *pvParameters );
\r
131 /* The mutex used by the demo. */
\r
132 static xSemaphoreHandle xMutex;
\r
134 /* Variables used to detect and latch errors. */
\r
135 static volatile portBASE_TYPE xErrorOccurred = pdFALSE, xControllingIsSuspended = pdFALSE, xBlockingIsSuspended = pdFALSE;
\r
136 static volatile unsigned portBASE_TYPE uxControllingCycles = 0, uxBlockingCycles = 0, uxPollingCycles = 0;
\r
138 /* Handles of the two higher priority tasks, required so they can be resumed
\r
140 static xTaskHandle xControllingTaskHandle, xBlockingTaskHandle;
\r
142 /*-----------------------------------------------------------*/
\r
144 void vStartRecursiveMutexTasks( void )
\r
146 /* Just creates the mutex and the three tasks. */
\r
148 xMutex = xSemaphoreCreateRecursiveMutex();
\r
150 /* vQueueAddToRegistry() adds the mutex to the registry, if one is
\r
151 in use. The registry is provided as a means for kernel aware
\r
152 debuggers to locate mutex and has no purpose if a kernel aware debugger
\r
153 is not being used. The call to vQueueAddToRegistry() will be removed
\r
154 by the pre-processor if configQUEUE_REGISTRY_SIZE is not defined or is
\r
155 defined to be less than 1. */
\r
156 vQueueAddToRegistry( ( xQueueHandle ) xMutex, ( signed portCHAR * ) "Recursive_Mutex" );
\r
159 if( xMutex != NULL )
\r
161 xTaskCreate( prvRecursiveMutexControllingTask, ( signed portCHAR * ) "Rec1", configMINIMAL_STACK_SIZE, NULL, recmuCONTROLLING_TASK_PRIORITY, &xControllingTaskHandle );
\r
162 xTaskCreate( prvRecursiveMutexBlockingTask, ( signed portCHAR * ) "Rec2", configMINIMAL_STACK_SIZE, NULL, recmuBLOCKING_TASK_PRIORITY, &xBlockingTaskHandle );
\r
163 xTaskCreate( prvRecursiveMutexPollingTask, ( signed portCHAR * ) "Rec3", configMINIMAL_STACK_SIZE, NULL, recmuPOLLING_TASK_PRIORITY, NULL );
\r
166 /*-----------------------------------------------------------*/
\r
168 static void prvRecursiveMutexControllingTask( void *pvParameters )
\r
170 unsigned portBASE_TYPE ux;
\r
172 /* Just to remove compiler warning. */
\r
173 ( void ) pvParameters;
\r
177 /* Should not be able to 'give' the mutex, as we have not yet 'taken'
\r
178 it. The first time through, the mutex will not have been used yet,
\r
179 subsequent times through, at this point the mutex will be held by the
\r
181 if( xSemaphoreGiveRecursive( xMutex ) == pdPASS )
\r
183 xErrorOccurred = pdTRUE;
\r
186 for( ux = 0; ux < recmuMAX_COUNT; ux++ )
\r
188 /* We should now be able to take the mutex as many times as
\r
191 The first time through the mutex will be immediately available, on
\r
192 subsequent times through the mutex will be held by the polling task
\r
193 at this point and this Take will cause the polling task to inherit
\r
194 the priority of this task. In this case the block time must be
\r
195 long enough to ensure the polling task will execute again before the
\r
196 block time expires. If the block time does expire then the error
\r
197 flag will be set here. */
\r
198 if( xSemaphoreTakeRecursive( xMutex, recmuTWO_TICK_DELAY ) != pdPASS )
\r
200 xErrorOccurred = pdTRUE;
\r
203 /* Ensure the other task attempting to access the mutex (and the
\r
204 other demo tasks) are able to execute to ensure they either block
\r
205 (where a block time is specified) or return an error (where no
\r
206 block time is specified) as the mutex is held by this task. */
\r
207 vTaskDelay( recmuSHORT_DELAY );
\r
210 /* For each time we took the mutex, give it back. */
\r
211 for( ux = 0; ux < recmuMAX_COUNT; ux++ )
\r
213 /* Ensure the other task attempting to access the mutex (and the
\r
214 other demo tasks) are able to execute. */
\r
215 vTaskDelay( recmuSHORT_DELAY );
\r
217 /* We should now be able to give the mutex as many times as we
\r
218 took it. When the mutex is available again the Blocking task
\r
219 should be unblocked but not run because it has a lower priority
\r
220 than this task. The polling task should also not run at this point
\r
221 as it too has a lower priority than this task. */
\r
222 if( xSemaphoreGiveRecursive( xMutex ) != pdPASS )
\r
224 xErrorOccurred = pdTRUE;
\r
228 /* Having given it back the same number of times as it was taken, we
\r
229 should no longer be the mutex owner, so the next give sh ould fail. */
\r
230 if( xSemaphoreGiveRecursive( xMutex ) == pdPASS )
\r
232 xErrorOccurred = pdTRUE;
\r
235 /* Keep count of the number of cycles this task has performed so a
\r
236 stall can be detected. */
\r
237 uxControllingCycles++;
\r
239 /* Suspend ourselves to the blocking task can execute. */
\r
240 xControllingIsSuspended = pdTRUE;
\r
241 vTaskSuspend( NULL );
\r
242 xControllingIsSuspended = pdFALSE;
\r
245 /*-----------------------------------------------------------*/
\r
247 static void prvRecursiveMutexBlockingTask( void *pvParameters )
\r
249 /* Just to remove compiler warning. */
\r
250 ( void ) pvParameters;
\r
254 /* This task will run while the controlling task is blocked, and the
\r
255 controlling task will block only once it has the mutex - therefore
\r
256 this call should block until the controlling task has given up the
\r
257 mutex, and not actually execute past this call until the controlling
\r
258 task is suspended. */
\r
259 if( xSemaphoreTakeRecursive( xMutex, portMAX_DELAY ) == pdPASS )
\r
261 if( xControllingIsSuspended != pdTRUE )
\r
263 /* Did not expect to execute until the controlling task was
\r
265 xErrorOccurred = pdTRUE;
\r
269 /* Give the mutex back before suspending ourselves to allow
\r
270 the polling task to obtain the mutex. */
\r
271 if( xSemaphoreGiveRecursive( xMutex ) != pdPASS )
\r
273 xErrorOccurred = pdTRUE;
\r
276 xBlockingIsSuspended = pdTRUE;
\r
277 vTaskSuspend( NULL );
\r
278 xBlockingIsSuspended = pdFALSE;
\r
283 /* We should not leave the xSemaphoreTakeRecursive() function
\r
284 until the mutex was obtained. */
\r
285 xErrorOccurred = pdTRUE;
\r
288 /* The controlling and blocking tasks should be in lock step. */
\r
289 if( uxControllingCycles != ( uxBlockingCycles + 1 ) )
\r
291 xErrorOccurred = pdTRUE;
\r
294 /* Keep count of the number of cycles this task has performed so a
\r
295 stall can be detected. */
\r
296 uxBlockingCycles++;
\r
299 /*-----------------------------------------------------------*/
\r
301 static void prvRecursiveMutexPollingTask( void *pvParameters )
\r
303 /* Just to remove compiler warning. */
\r
304 ( void ) pvParameters;
\r
308 /* Keep attempting to obtain the mutex. We should only obtain it when
\r
309 the blocking task has suspended itself, which in turn should only
\r
310 happen when the controlling task is also suspended. */
\r
311 if( xSemaphoreTakeRecursive( xMutex, recmuNO_DELAY ) == pdPASS )
\r
313 /* Is the blocking task suspended? */
\r
314 if( ( xBlockingIsSuspended != pdTRUE ) || ( xControllingIsSuspended != pdTRUE ) )
\r
316 xErrorOccurred = pdTRUE;
\r
320 /* Keep count of the number of cycles this task has performed
\r
321 so a stall can be detected. */
\r
324 /* We can resume the other tasks here even though they have a
\r
325 higher priority than the polling task. When they execute they
\r
326 will attempt to obtain the mutex but fail because the polling
\r
327 task is still the mutex holder. The polling task (this task)
\r
328 will then inherit the higher priority. The Blocking task will
\r
329 block indefinitely when it attempts to obtain the mutex, the
\r
330 Controlling task will only block for a fixed period and an
\r
331 error will be latched if the polling task has not returned the
\r
332 mutex by the time this fixed period has expired. */
\r
333 vTaskResume( xBlockingTaskHandle );
\r
334 vTaskResume( xControllingTaskHandle );
\r
336 /* The other two tasks should now have executed and no longer
\r
338 if( ( xBlockingIsSuspended == pdTRUE ) || ( xControllingIsSuspended == pdTRUE ) )
\r
340 xErrorOccurred = pdTRUE;
\r
343 /* Release the mutex, disinheriting the higher priority again. */
\r
344 if( xSemaphoreGiveRecursive( xMutex ) != pdPASS )
\r
346 xErrorOccurred = pdTRUE;
\r
351 #if configUSE_PREEMPTION == 0
\r
358 /*-----------------------------------------------------------*/
\r
360 /* This is called to check that all the created tasks are still running. */
\r
361 portBASE_TYPE xAreRecursiveMutexTasksStillRunning( void )
\r
363 portBASE_TYPE xReturn;
\r
364 static unsigned portBASE_TYPE uxLastControllingCycles = 0, uxLastBlockingCycles = 0, uxLastPollingCycles = 0;
\r
366 /* Is the controlling task still cycling? */
\r
367 if( uxLastControllingCycles == uxControllingCycles )
\r
369 xErrorOccurred = pdTRUE;
\r
373 uxLastControllingCycles = uxControllingCycles;
\r
376 /* Is the blocking task still cycling? */
\r
377 if( uxLastBlockingCycles == uxBlockingCycles )
\r
379 xErrorOccurred = pdTRUE;
\r
383 uxLastBlockingCycles = uxBlockingCycles;
\r
386 /* Is the polling task still cycling? */
\r
387 if( uxLastPollingCycles == uxPollingCycles )
\r
389 xErrorOccurred = pdTRUE;
\r
393 uxLastPollingCycles = uxPollingCycles;
\r
396 if( xErrorOccurred == pdTRUE )
\r