2 FreeRTOS V7.5.3 - 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
67 * Creates two sets of two tasks. The tasks within a set share a variable, access
\r
68 * to which is guarded by a semaphore.
\r
70 * Each task starts by attempting to obtain the semaphore. On obtaining a
\r
71 * semaphore a task checks to ensure that the guarded variable has an expected
\r
72 * value. It then clears the variable to zero before counting it back up to the
\r
73 * expected value in increments of 1. After each increment the variable is checked
\r
74 * to ensure it contains the value to which it was just set. When the starting
\r
75 * value is again reached the task releases the semaphore giving the other task in
\r
76 * the set a chance to do exactly the same thing. The starting value is high
\r
77 * enough to ensure that a tick is likely to occur during the incrementing loop.
\r
79 * An error is flagged if at any time during the process a shared variable is
\r
80 * found to have a value other than that expected. Such an occurrence would
\r
81 * suggest an error in the mutual exclusion mechanism by which access to the
\r
82 * variable is restricted.
\r
84 * The first set of two tasks poll their semaphore. The second set use blocking
\r
92 /* Scheduler include files. */
\r
93 #include "FreeRTOS.h"
\r
97 /* Demo app include files. */
\r
98 #include "semtest.h"
\r
100 /* The value to which the shared variables are counted. */
\r
101 #define semtstBLOCKING_EXPECTED_VALUE ( ( unsigned long ) 0xfff )
\r
102 #define semtstNON_BLOCKING_EXPECTED_VALUE ( ( unsigned long ) 0xff )
\r
104 #define semtstSTACK_SIZE configMINIMAL_STACK_SIZE
\r
106 #define semtstNUM_TASKS ( 4 )
\r
108 #define semtstDELAY_FACTOR ( ( portTickType ) 10 )
\r
110 /* The task function as described at the top of the file. */
\r
111 static portTASK_FUNCTION_PROTO( prvSemaphoreTest, pvParameters );
\r
113 /* Structure used to pass parameters to each task. */
\r
114 typedef struct SEMAPHORE_PARAMETERS
\r
116 xSemaphoreHandle xSemaphore;
\r
117 volatile unsigned long *pulSharedVariable;
\r
118 portTickType xBlockTime;
\r
119 } xSemaphoreParameters;
\r
121 /* Variables used to check that all the tasks are still running without errors. */
\r
122 static volatile short sCheckVariables[ semtstNUM_TASKS ] = { 0 };
\r
123 static volatile short sNextCheckVariable = 0;
\r
125 /*-----------------------------------------------------------*/
\r
127 void vStartSemaphoreTasks( unsigned portBASE_TYPE uxPriority )
\r
129 xSemaphoreParameters *pxFirstSemaphoreParameters, *pxSecondSemaphoreParameters;
\r
130 const portTickType xBlockTime = ( portTickType ) 100;
\r
132 /* Create the structure used to pass parameters to the first two tasks. */
\r
133 pxFirstSemaphoreParameters = ( xSemaphoreParameters * ) pvPortMalloc( sizeof( xSemaphoreParameters ) );
\r
135 if( pxFirstSemaphoreParameters != NULL )
\r
137 /* Create the semaphore used by the first two tasks. */
\r
138 vSemaphoreCreateBinary( pxFirstSemaphoreParameters->xSemaphore );
\r
140 if( pxFirstSemaphoreParameters->xSemaphore != NULL )
\r
142 /* Create the variable which is to be shared by the first two tasks. */
\r
143 pxFirstSemaphoreParameters->pulSharedVariable = ( unsigned long * ) pvPortMalloc( sizeof( unsigned long ) );
\r
145 /* Initialise the share variable to the value the tasks expect. */
\r
146 *( pxFirstSemaphoreParameters->pulSharedVariable ) = semtstNON_BLOCKING_EXPECTED_VALUE;
\r
148 /* The first two tasks do not block on semaphore calls. */
\r
149 pxFirstSemaphoreParameters->xBlockTime = ( portTickType ) 0;
\r
151 /* Spawn the first two tasks. As they poll they operate at the idle priority. */
\r
152 xTaskCreate( prvSemaphoreTest, ( signed char * ) "PolSEM1", semtstSTACK_SIZE, ( void * ) pxFirstSemaphoreParameters, tskIDLE_PRIORITY, ( xTaskHandle * ) NULL );
\r
153 xTaskCreate( prvSemaphoreTest, ( signed char * ) "PolSEM2", semtstSTACK_SIZE, ( void * ) pxFirstSemaphoreParameters, tskIDLE_PRIORITY, ( xTaskHandle * ) NULL );
\r
157 /* Do exactly the same to create the second set of tasks, only this time
\r
158 provide a block time for the semaphore calls. */
\r
159 pxSecondSemaphoreParameters = ( xSemaphoreParameters * ) pvPortMalloc( sizeof( xSemaphoreParameters ) );
\r
160 if( pxSecondSemaphoreParameters != NULL )
\r
162 vSemaphoreCreateBinary( pxSecondSemaphoreParameters->xSemaphore );
\r
164 if( pxSecondSemaphoreParameters->xSemaphore != NULL )
\r
166 pxSecondSemaphoreParameters->pulSharedVariable = ( unsigned long * ) pvPortMalloc( sizeof( unsigned long ) );
\r
167 *( pxSecondSemaphoreParameters->pulSharedVariable ) = semtstBLOCKING_EXPECTED_VALUE;
\r
168 pxSecondSemaphoreParameters->xBlockTime = xBlockTime / portTICK_RATE_MS;
\r
170 xTaskCreate( prvSemaphoreTest, ( signed char * ) "BlkSEM1", semtstSTACK_SIZE, ( void * ) pxSecondSemaphoreParameters, uxPriority, ( xTaskHandle * ) NULL );
\r
171 xTaskCreate( prvSemaphoreTest, ( signed char * ) "BlkSEM2", semtstSTACK_SIZE, ( void * ) pxSecondSemaphoreParameters, uxPriority, ( xTaskHandle * ) NULL );
\r
175 /* vQueueAddToRegistry() adds the semaphore to the registry, if one is
\r
176 in use. The registry is provided as a means for kernel aware
\r
177 debuggers to locate semaphores and has no purpose if a kernel aware debugger
\r
178 is not being used. The call to vQueueAddToRegistry() will be removed
\r
179 by the pre-processor if configQUEUE_REGISTRY_SIZE is not defined or is
\r
180 defined to be less than 1. */
\r
181 vQueueAddToRegistry( ( xQueueHandle ) pxFirstSemaphoreParameters->xSemaphore, ( signed char * ) "Counting_Sem_1" );
\r
182 vQueueAddToRegistry( ( xQueueHandle ) pxSecondSemaphoreParameters->xSemaphore, ( signed char * ) "Counting_Sem_2" );
\r
184 /*-----------------------------------------------------------*/
\r
186 static portTASK_FUNCTION( prvSemaphoreTest, pvParameters )
\r
188 xSemaphoreParameters *pxParameters;
\r
189 volatile unsigned long *pulSharedVariable, ulExpectedValue;
\r
190 unsigned long ulCounter;
\r
191 short sError = pdFALSE, sCheckVariableToUse;
\r
193 /* See which check variable to use. sNextCheckVariable is not semaphore
\r
195 portENTER_CRITICAL();
\r
196 sCheckVariableToUse = sNextCheckVariable;
\r
197 sNextCheckVariable++;
\r
198 portEXIT_CRITICAL();
\r
200 /* A structure is passed in as the parameter. This contains the shared
\r
201 variable being guarded. */
\r
202 pxParameters = ( xSemaphoreParameters * ) pvParameters;
\r
203 pulSharedVariable = pxParameters->pulSharedVariable;
\r
205 /* If we are blocking we use a much higher count to ensure loads of context
\r
206 switches occur during the count. */
\r
207 if( pxParameters->xBlockTime > ( portTickType ) 0 )
\r
209 ulExpectedValue = semtstBLOCKING_EXPECTED_VALUE;
\r
213 ulExpectedValue = semtstNON_BLOCKING_EXPECTED_VALUE;
\r
218 /* Try to obtain the semaphore. */
\r
219 if( xSemaphoreTake( pxParameters->xSemaphore, pxParameters->xBlockTime ) == pdPASS )
\r
221 /* We have the semaphore and so expect any other tasks using the
\r
222 shared variable to have left it in the state we expect to find
\r
224 if( *pulSharedVariable != ulExpectedValue )
\r
229 /* Clear the variable, then count it back up to the expected value
\r
230 before releasing the semaphore. Would expect a context switch or
\r
231 two during this time. */
\r
232 for( ulCounter = ( unsigned long ) 0; ulCounter <= ulExpectedValue; ulCounter++ )
\r
234 *pulSharedVariable = ulCounter;
\r
235 if( *pulSharedVariable != ulCounter )
\r
241 /* Release the semaphore, and if no errors have occurred increment the check
\r
243 if( xSemaphoreGive( pxParameters->xSemaphore ) == pdFALSE )
\r
248 if( sError == pdFALSE )
\r
250 if( sCheckVariableToUse < semtstNUM_TASKS )
\r
252 ( sCheckVariables[ sCheckVariableToUse ] )++;
\r
256 /* If we have a block time then we are running at a priority higher
\r
257 than the idle priority. This task takes a long time to complete
\r
258 a cycle (deliberately so to test the guarding) so will be starving
\r
259 out lower priority tasks. Block for some time to allow give lower
\r
260 priority tasks some processor time. */
\r
261 vTaskDelay( pxParameters->xBlockTime * semtstDELAY_FACTOR );
\r
265 if( pxParameters->xBlockTime == ( portTickType ) 0 )
\r
267 /* We have not got the semaphore yet, so no point using the
\r
268 processor. We are not blocking when attempting to obtain the
\r
275 /*-----------------------------------------------------------*/
\r
277 /* This is called to check that all the created tasks are still running. */
\r
278 portBASE_TYPE xAreSemaphoreTasksStillRunning( void )
\r
280 static short sLastCheckVariables[ semtstNUM_TASKS ] = { 0 };
\r
281 portBASE_TYPE xTask, xReturn = pdTRUE;
\r
283 for( xTask = 0; xTask < semtstNUM_TASKS; xTask++ )
\r
285 if( sLastCheckVariables[ xTask ] == sCheckVariables[ xTask ] )
\r
290 sLastCheckVariables[ xTask ] = sCheckVariables[ xTask ];
\r