Please see my note book http://mbed.org/users/kenjiArai/notebook/freertos-on-mbed-board-with-mbed-cloud-ide--never-/

This is too old.
Below is another FreeRTOS on mbed.
http://developer.mbed.org/users/rgrover1/code/FreeRTOS/
I don't know it works well or not.
I have not evaluated it.

Committer:
kenjiArai
Date:
Sat Jan 01 11:17:45 2011 +0000
Revision:
0:d4960fcea8ff

        

Who changed what in which revision?

UserRevisionLine numberNew contents of line
kenjiArai 0:d4960fcea8ff 1 /*
kenjiArai 0:d4960fcea8ff 2 FreeRTOS V6.0.3 - Copyright (C) 2010 Real Time Engineers Ltd.
kenjiArai 0:d4960fcea8ff 3
kenjiArai 0:d4960fcea8ff 4 ***************************************************************************
kenjiArai 0:d4960fcea8ff 5 * *
kenjiArai 0:d4960fcea8ff 6 * If you are: *
kenjiArai 0:d4960fcea8ff 7 * *
kenjiArai 0:d4960fcea8ff 8 * + New to FreeRTOS, *
kenjiArai 0:d4960fcea8ff 9 * + Wanting to learn FreeRTOS or multitasking in general quickly *
kenjiArai 0:d4960fcea8ff 10 * + Looking for basic training, *
kenjiArai 0:d4960fcea8ff 11 * + Wanting to improve your FreeRTOS skills and productivity *
kenjiArai 0:d4960fcea8ff 12 * *
kenjiArai 0:d4960fcea8ff 13 * then take a look at the FreeRTOS eBook *
kenjiArai 0:d4960fcea8ff 14 * *
kenjiArai 0:d4960fcea8ff 15 * "Using the FreeRTOS Real Time Kernel - a Practical Guide" *
kenjiArai 0:d4960fcea8ff 16 * http://www.FreeRTOS.org/Documentation *
kenjiArai 0:d4960fcea8ff 17 * *
kenjiArai 0:d4960fcea8ff 18 * A pdf reference manual is also available. Both are usually delivered *
kenjiArai 0:d4960fcea8ff 19 * to your inbox within 20 minutes to two hours when purchased between 8am *
kenjiArai 0:d4960fcea8ff 20 * and 8pm GMT (although please allow up to 24 hours in case of *
kenjiArai 0:d4960fcea8ff 21 * exceptional circumstances). Thank you for your support! *
kenjiArai 0:d4960fcea8ff 22 * *
kenjiArai 0:d4960fcea8ff 23 ***************************************************************************
kenjiArai 0:d4960fcea8ff 24
kenjiArai 0:d4960fcea8ff 25 This file is part of the FreeRTOS distribution.
kenjiArai 0:d4960fcea8ff 26
kenjiArai 0:d4960fcea8ff 27 FreeRTOS is free software; you can redistribute it and/or modify it under
kenjiArai 0:d4960fcea8ff 28 the terms of the GNU General Public License (version 2) as published by the
kenjiArai 0:d4960fcea8ff 29 Free Software Foundation AND MODIFIED BY the FreeRTOS exception.
kenjiArai 0:d4960fcea8ff 30 ***NOTE*** The exception to the GPL is included to allow you to distribute
kenjiArai 0:d4960fcea8ff 31 a combined work that includes FreeRTOS without being obliged to provide the
kenjiArai 0:d4960fcea8ff 32 source code for proprietary components outside of the FreeRTOS kernel.
kenjiArai 0:d4960fcea8ff 33 FreeRTOS is distributed in the hope that it will be useful, but WITHOUT
kenjiArai 0:d4960fcea8ff 34 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
kenjiArai 0:d4960fcea8ff 35 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
kenjiArai 0:d4960fcea8ff 36 more details. You should have received a copy of the GNU General Public
kenjiArai 0:d4960fcea8ff 37 License and the FreeRTOS license exception along with FreeRTOS; if not it
kenjiArai 0:d4960fcea8ff 38 can be viewed here: http://www.freertos.org/a00114.html and also obtained
kenjiArai 0:d4960fcea8ff 39 by writing to Richard Barry, contact details for whom are available on the
kenjiArai 0:d4960fcea8ff 40 FreeRTOS WEB site.
kenjiArai 0:d4960fcea8ff 41
kenjiArai 0:d4960fcea8ff 42 1 tab == 4 spaces!
kenjiArai 0:d4960fcea8ff 43
kenjiArai 0:d4960fcea8ff 44 http://www.FreeRTOS.org - Documentation, latest information, license and
kenjiArai 0:d4960fcea8ff 45 contact details.
kenjiArai 0:d4960fcea8ff 46
kenjiArai 0:d4960fcea8ff 47 http://www.SafeRTOS.com - A version that is certified for use in safety
kenjiArai 0:d4960fcea8ff 48 critical systems.
kenjiArai 0:d4960fcea8ff 49
kenjiArai 0:d4960fcea8ff 50 http://www.OpenRTOS.com - Commercial support, development, porting,
kenjiArai 0:d4960fcea8ff 51 licensing and training services.
kenjiArai 0:d4960fcea8ff 52 */
kenjiArai 0:d4960fcea8ff 53
kenjiArai 0:d4960fcea8ff 54 /*
kenjiArai 0:d4960fcea8ff 55 * Creates two sets of two tasks. The tasks within a set share a variable, access
kenjiArai 0:d4960fcea8ff 56 * to which is guarded by a semaphore.
kenjiArai 0:d4960fcea8ff 57 *
kenjiArai 0:d4960fcea8ff 58 * Each task starts by attempting to obtain the semaphore. On obtaining a
kenjiArai 0:d4960fcea8ff 59 * semaphore a task checks to ensure that the guarded variable has an expected
kenjiArai 0:d4960fcea8ff 60 * value. It then clears the variable to zero before counting it back up to the
kenjiArai 0:d4960fcea8ff 61 * expected value in increments of 1. After each increment the variable is checked
kenjiArai 0:d4960fcea8ff 62 * to ensure it contains the value to which it was just set. When the starting
kenjiArai 0:d4960fcea8ff 63 * value is again reached the task releases the semaphore giving the other task in
kenjiArai 0:d4960fcea8ff 64 * the set a chance to do exactly the same thing. The starting value is high
kenjiArai 0:d4960fcea8ff 65 * enough to ensure that a tick is likely to occur during the incrementing loop.
kenjiArai 0:d4960fcea8ff 66 *
kenjiArai 0:d4960fcea8ff 67 * An error is flagged if at any time during the process a shared variable is
kenjiArai 0:d4960fcea8ff 68 * found to have a value other than that expected. Such an occurrence would
kenjiArai 0:d4960fcea8ff 69 * suggest an error in the mutual exclusion mechanism by which access to the
kenjiArai 0:d4960fcea8ff 70 * variable is restricted.
kenjiArai 0:d4960fcea8ff 71 *
kenjiArai 0:d4960fcea8ff 72 * The first set of two tasks poll their semaphore. The second set use blocking
kenjiArai 0:d4960fcea8ff 73 * calls.
kenjiArai 0:d4960fcea8ff 74 *
kenjiArai 0:d4960fcea8ff 75 */
kenjiArai 0:d4960fcea8ff 76
kenjiArai 0:d4960fcea8ff 77
kenjiArai 0:d4960fcea8ff 78 #include <stdlib.h>
kenjiArai 0:d4960fcea8ff 79
kenjiArai 0:d4960fcea8ff 80 /* Scheduler include files. */
kenjiArai 0:d4960fcea8ff 81 #include "FreeRTOS.h"
kenjiArai 0:d4960fcea8ff 82 #include "task.h"
kenjiArai 0:d4960fcea8ff 83 #include "semphr.h"
kenjiArai 0:d4960fcea8ff 84
kenjiArai 0:d4960fcea8ff 85
kenjiArai 0:d4960fcea8ff 86 /* Demo app include files. */
kenjiArai 0:d4960fcea8ff 87 #include "semtest.h"
kenjiArai 0:d4960fcea8ff 88
kenjiArai 0:d4960fcea8ff 89 /* The value to which the shared variables are counted. */
kenjiArai 0:d4960fcea8ff 90 #define semtstBLOCKING_EXPECTED_VALUE ( ( unsigned long ) 0xfff )
kenjiArai 0:d4960fcea8ff 91 #define semtstNON_BLOCKING_EXPECTED_VALUE ( ( unsigned long ) 0xff )
kenjiArai 0:d4960fcea8ff 92
kenjiArai 0:d4960fcea8ff 93 #define semtstSTACK_SIZE configMINIMAL_STACK_SIZE
kenjiArai 0:d4960fcea8ff 94
kenjiArai 0:d4960fcea8ff 95 #define semtstNUM_TASKS ( 4 )
kenjiArai 0:d4960fcea8ff 96
kenjiArai 0:d4960fcea8ff 97 #define semtstDELAY_FACTOR ( ( portTickType ) 10 )
kenjiArai 0:d4960fcea8ff 98
kenjiArai 0:d4960fcea8ff 99 /* The task function as described at the top of the file. */
kenjiArai 0:d4960fcea8ff 100 static portTASK_FUNCTION_PROTO( prvSemaphoreTest, pvParameters );
kenjiArai 0:d4960fcea8ff 101
kenjiArai 0:d4960fcea8ff 102 /* Structure used to pass parameters to each task. */
kenjiArai 0:d4960fcea8ff 103 typedef struct SEMAPHORE_PARAMETERS
kenjiArai 0:d4960fcea8ff 104 {
kenjiArai 0:d4960fcea8ff 105 xSemaphoreHandle xSemaphore;
kenjiArai 0:d4960fcea8ff 106 volatile unsigned long *pulSharedVariable;
kenjiArai 0:d4960fcea8ff 107 portTickType xBlockTime;
kenjiArai 0:d4960fcea8ff 108 } xSemaphoreParameters;
kenjiArai 0:d4960fcea8ff 109
kenjiArai 0:d4960fcea8ff 110 /* Variables used to check that all the tasks are still running without errors. */
kenjiArai 0:d4960fcea8ff 111 static volatile short sCheckVariables[ semtstNUM_TASKS ] = { 0 };
kenjiArai 0:d4960fcea8ff 112 static volatile short sNextCheckVariable = 0;
kenjiArai 0:d4960fcea8ff 113
kenjiArai 0:d4960fcea8ff 114 /*-----------------------------------------------------------*/
kenjiArai 0:d4960fcea8ff 115
kenjiArai 0:d4960fcea8ff 116 void vStartSemaphoreTasks( unsigned portBASE_TYPE uxPriority )
kenjiArai 0:d4960fcea8ff 117 {
kenjiArai 0:d4960fcea8ff 118 xSemaphoreParameters *pxFirstSemaphoreParameters, *pxSecondSemaphoreParameters;
kenjiArai 0:d4960fcea8ff 119 const portTickType xBlockTime = ( portTickType ) 100;
kenjiArai 0:d4960fcea8ff 120
kenjiArai 0:d4960fcea8ff 121 /* Create the structure used to pass parameters to the first two tasks. */
kenjiArai 0:d4960fcea8ff 122 pxFirstSemaphoreParameters = ( xSemaphoreParameters * ) pvPortMalloc( sizeof( xSemaphoreParameters ) );
kenjiArai 0:d4960fcea8ff 123
kenjiArai 0:d4960fcea8ff 124 if( pxFirstSemaphoreParameters != NULL )
kenjiArai 0:d4960fcea8ff 125 {
kenjiArai 0:d4960fcea8ff 126 /* Create the semaphore used by the first two tasks. */
kenjiArai 0:d4960fcea8ff 127 vSemaphoreCreateBinary( pxFirstSemaphoreParameters->xSemaphore );
kenjiArai 0:d4960fcea8ff 128
kenjiArai 0:d4960fcea8ff 129 if( pxFirstSemaphoreParameters->xSemaphore != NULL )
kenjiArai 0:d4960fcea8ff 130 {
kenjiArai 0:d4960fcea8ff 131 /* Create the variable which is to be shared by the first two tasks. */
kenjiArai 0:d4960fcea8ff 132 pxFirstSemaphoreParameters->pulSharedVariable = ( unsigned long * ) pvPortMalloc( sizeof( unsigned long ) );
kenjiArai 0:d4960fcea8ff 133
kenjiArai 0:d4960fcea8ff 134 /* Initialise the share variable to the value the tasks expect. */
kenjiArai 0:d4960fcea8ff 135 *( pxFirstSemaphoreParameters->pulSharedVariable ) = semtstNON_BLOCKING_EXPECTED_VALUE;
kenjiArai 0:d4960fcea8ff 136
kenjiArai 0:d4960fcea8ff 137 /* The first two tasks do not block on semaphore calls. */
kenjiArai 0:d4960fcea8ff 138 pxFirstSemaphoreParameters->xBlockTime = ( portTickType ) 0;
kenjiArai 0:d4960fcea8ff 139
kenjiArai 0:d4960fcea8ff 140 /* Spawn the first two tasks. As they poll they operate at the idle priority. */
kenjiArai 0:d4960fcea8ff 141 xTaskCreate( prvSemaphoreTest, ( signed char * ) "PolSEM1", semtstSTACK_SIZE, ( void * ) pxFirstSemaphoreParameters, tskIDLE_PRIORITY, ( xTaskHandle * ) NULL );
kenjiArai 0:d4960fcea8ff 142 xTaskCreate( prvSemaphoreTest, ( signed char * ) "PolSEM2", semtstSTACK_SIZE, ( void * ) pxFirstSemaphoreParameters, tskIDLE_PRIORITY, ( xTaskHandle * ) NULL );
kenjiArai 0:d4960fcea8ff 143 }
kenjiArai 0:d4960fcea8ff 144 }
kenjiArai 0:d4960fcea8ff 145
kenjiArai 0:d4960fcea8ff 146 /* Do exactly the same to create the second set of tasks, only this time
kenjiArai 0:d4960fcea8ff 147 provide a block time for the semaphore calls. */
kenjiArai 0:d4960fcea8ff 148 pxSecondSemaphoreParameters = ( xSemaphoreParameters * ) pvPortMalloc( sizeof( xSemaphoreParameters ) );
kenjiArai 0:d4960fcea8ff 149 if( pxSecondSemaphoreParameters != NULL )
kenjiArai 0:d4960fcea8ff 150 {
kenjiArai 0:d4960fcea8ff 151 vSemaphoreCreateBinary( pxSecondSemaphoreParameters->xSemaphore );
kenjiArai 0:d4960fcea8ff 152
kenjiArai 0:d4960fcea8ff 153 if( pxSecondSemaphoreParameters->xSemaphore != NULL )
kenjiArai 0:d4960fcea8ff 154 {
kenjiArai 0:d4960fcea8ff 155 pxSecondSemaphoreParameters->pulSharedVariable = ( unsigned long * ) pvPortMalloc( sizeof( unsigned long ) );
kenjiArai 0:d4960fcea8ff 156 *( pxSecondSemaphoreParameters->pulSharedVariable ) = semtstBLOCKING_EXPECTED_VALUE;
kenjiArai 0:d4960fcea8ff 157 pxSecondSemaphoreParameters->xBlockTime = xBlockTime / portTICK_RATE_MS;
kenjiArai 0:d4960fcea8ff 158
kenjiArai 0:d4960fcea8ff 159 xTaskCreate( prvSemaphoreTest, ( signed char * ) "BlkSEM1", semtstSTACK_SIZE, ( void * ) pxSecondSemaphoreParameters, uxPriority, ( xTaskHandle * ) NULL );
kenjiArai 0:d4960fcea8ff 160 xTaskCreate( prvSemaphoreTest, ( signed char * ) "BlkSEM2", semtstSTACK_SIZE, ( void * ) pxSecondSemaphoreParameters, uxPriority, ( xTaskHandle * ) NULL );
kenjiArai 0:d4960fcea8ff 161 }
kenjiArai 0:d4960fcea8ff 162 }
kenjiArai 0:d4960fcea8ff 163
kenjiArai 0:d4960fcea8ff 164 /* vQueueAddToRegistry() adds the semaphore to the registry, if one is
kenjiArai 0:d4960fcea8ff 165 in use. The registry is provided as a means for kernel aware
kenjiArai 0:d4960fcea8ff 166 debuggers to locate semaphores and has no purpose if a kernel aware debugger
kenjiArai 0:d4960fcea8ff 167 is not being used. The call to vQueueAddToRegistry() will be removed
kenjiArai 0:d4960fcea8ff 168 by the pre-processor if configQUEUE_REGISTRY_SIZE is not defined or is
kenjiArai 0:d4960fcea8ff 169 defined to be less than 1. */
kenjiArai 0:d4960fcea8ff 170 vQueueAddToRegistry( ( xQueueHandle ) pxFirstSemaphoreParameters->xSemaphore, ( signed char * ) "Counting_Sem_1" );
kenjiArai 0:d4960fcea8ff 171 vQueueAddToRegistry( ( xQueueHandle ) pxSecondSemaphoreParameters->xSemaphore, ( signed char * ) "Counting_Sem_2" );
kenjiArai 0:d4960fcea8ff 172 }
kenjiArai 0:d4960fcea8ff 173 /*-----------------------------------------------------------*/
kenjiArai 0:d4960fcea8ff 174
kenjiArai 0:d4960fcea8ff 175 static portTASK_FUNCTION( prvSemaphoreTest, pvParameters )
kenjiArai 0:d4960fcea8ff 176 {
kenjiArai 0:d4960fcea8ff 177 xSemaphoreParameters *pxParameters;
kenjiArai 0:d4960fcea8ff 178 volatile unsigned long *pulSharedVariable, ulExpectedValue;
kenjiArai 0:d4960fcea8ff 179 unsigned long ulCounter;
kenjiArai 0:d4960fcea8ff 180 short sError = pdFALSE, sCheckVariableToUse;
kenjiArai 0:d4960fcea8ff 181
kenjiArai 0:d4960fcea8ff 182 /* See which check variable to use. sNextCheckVariable is not semaphore
kenjiArai 0:d4960fcea8ff 183 protected! */
kenjiArai 0:d4960fcea8ff 184 portENTER_CRITICAL();
kenjiArai 0:d4960fcea8ff 185 sCheckVariableToUse = sNextCheckVariable;
kenjiArai 0:d4960fcea8ff 186 sNextCheckVariable++;
kenjiArai 0:d4960fcea8ff 187 portEXIT_CRITICAL();
kenjiArai 0:d4960fcea8ff 188
kenjiArai 0:d4960fcea8ff 189 /* A structure is passed in as the parameter. This contains the shared
kenjiArai 0:d4960fcea8ff 190 variable being guarded. */
kenjiArai 0:d4960fcea8ff 191 pxParameters = ( xSemaphoreParameters * ) pvParameters;
kenjiArai 0:d4960fcea8ff 192 pulSharedVariable = pxParameters->pulSharedVariable;
kenjiArai 0:d4960fcea8ff 193
kenjiArai 0:d4960fcea8ff 194 /* If we are blocking we use a much higher count to ensure loads of context
kenjiArai 0:d4960fcea8ff 195 switches occur during the count. */
kenjiArai 0:d4960fcea8ff 196 if( pxParameters->xBlockTime > ( portTickType ) 0 )
kenjiArai 0:d4960fcea8ff 197 {
kenjiArai 0:d4960fcea8ff 198 ulExpectedValue = semtstBLOCKING_EXPECTED_VALUE;
kenjiArai 0:d4960fcea8ff 199 }
kenjiArai 0:d4960fcea8ff 200 else
kenjiArai 0:d4960fcea8ff 201 {
kenjiArai 0:d4960fcea8ff 202 ulExpectedValue = semtstNON_BLOCKING_EXPECTED_VALUE;
kenjiArai 0:d4960fcea8ff 203 }
kenjiArai 0:d4960fcea8ff 204
kenjiArai 0:d4960fcea8ff 205 for( ;; )
kenjiArai 0:d4960fcea8ff 206 {
kenjiArai 0:d4960fcea8ff 207 /* Try to obtain the semaphore. */
kenjiArai 0:d4960fcea8ff 208 if( xSemaphoreTake( pxParameters->xSemaphore, pxParameters->xBlockTime ) == pdPASS )
kenjiArai 0:d4960fcea8ff 209 {
kenjiArai 0:d4960fcea8ff 210 /* We have the semaphore and so expect any other tasks using the
kenjiArai 0:d4960fcea8ff 211 shared variable to have left it in the state we expect to find
kenjiArai 0:d4960fcea8ff 212 it. */
kenjiArai 0:d4960fcea8ff 213 if( *pulSharedVariable != ulExpectedValue )
kenjiArai 0:d4960fcea8ff 214 {
kenjiArai 0:d4960fcea8ff 215 sError = pdTRUE;
kenjiArai 0:d4960fcea8ff 216 }
kenjiArai 0:d4960fcea8ff 217
kenjiArai 0:d4960fcea8ff 218 /* Clear the variable, then count it back up to the expected value
kenjiArai 0:d4960fcea8ff 219 before releasing the semaphore. Would expect a context switch or
kenjiArai 0:d4960fcea8ff 220 two during this time. */
kenjiArai 0:d4960fcea8ff 221 for( ulCounter = ( unsigned long ) 0; ulCounter <= ulExpectedValue; ulCounter++ )
kenjiArai 0:d4960fcea8ff 222 {
kenjiArai 0:d4960fcea8ff 223 *pulSharedVariable = ulCounter;
kenjiArai 0:d4960fcea8ff 224 if( *pulSharedVariable != ulCounter )
kenjiArai 0:d4960fcea8ff 225 {
kenjiArai 0:d4960fcea8ff 226 sError = pdTRUE;
kenjiArai 0:d4960fcea8ff 227 }
kenjiArai 0:d4960fcea8ff 228 }
kenjiArai 0:d4960fcea8ff 229
kenjiArai 0:d4960fcea8ff 230 /* Release the semaphore, and if no errors have occurred increment the check
kenjiArai 0:d4960fcea8ff 231 variable. */
kenjiArai 0:d4960fcea8ff 232 if( xSemaphoreGive( pxParameters->xSemaphore ) == pdFALSE )
kenjiArai 0:d4960fcea8ff 233 {
kenjiArai 0:d4960fcea8ff 234 sError = pdTRUE;
kenjiArai 0:d4960fcea8ff 235 }
kenjiArai 0:d4960fcea8ff 236
kenjiArai 0:d4960fcea8ff 237 if( sError == pdFALSE )
kenjiArai 0:d4960fcea8ff 238 {
kenjiArai 0:d4960fcea8ff 239 if( sCheckVariableToUse < semtstNUM_TASKS )
kenjiArai 0:d4960fcea8ff 240 {
kenjiArai 0:d4960fcea8ff 241 ( sCheckVariables[ sCheckVariableToUse ] )++;
kenjiArai 0:d4960fcea8ff 242 }
kenjiArai 0:d4960fcea8ff 243 }
kenjiArai 0:d4960fcea8ff 244
kenjiArai 0:d4960fcea8ff 245 /* If we have a block time then we are running at a priority higher
kenjiArai 0:d4960fcea8ff 246 than the idle priority. This task takes a long time to complete
kenjiArai 0:d4960fcea8ff 247 a cycle (deliberately so to test the guarding) so will be starving
kenjiArai 0:d4960fcea8ff 248 out lower priority tasks. Block for some time to allow give lower
kenjiArai 0:d4960fcea8ff 249 priority tasks some processor time. */
kenjiArai 0:d4960fcea8ff 250 vTaskDelay( pxParameters->xBlockTime * semtstDELAY_FACTOR );
kenjiArai 0:d4960fcea8ff 251 }
kenjiArai 0:d4960fcea8ff 252 else
kenjiArai 0:d4960fcea8ff 253 {
kenjiArai 0:d4960fcea8ff 254 if( pxParameters->xBlockTime == ( portTickType ) 0 )
kenjiArai 0:d4960fcea8ff 255 {
kenjiArai 0:d4960fcea8ff 256 /* We have not got the semaphore yet, so no point using the
kenjiArai 0:d4960fcea8ff 257 processor. We are not blocking when attempting to obtain the
kenjiArai 0:d4960fcea8ff 258 semaphore. */
kenjiArai 0:d4960fcea8ff 259 taskYIELD();
kenjiArai 0:d4960fcea8ff 260 }
kenjiArai 0:d4960fcea8ff 261 }
kenjiArai 0:d4960fcea8ff 262 }
kenjiArai 0:d4960fcea8ff 263 }
kenjiArai 0:d4960fcea8ff 264 /*-----------------------------------------------------------*/
kenjiArai 0:d4960fcea8ff 265
kenjiArai 0:d4960fcea8ff 266 /* This is called to check that all the created tasks are still running. */
kenjiArai 0:d4960fcea8ff 267 portBASE_TYPE xAreSemaphoreTasksStillRunning( void )
kenjiArai 0:d4960fcea8ff 268 {
kenjiArai 0:d4960fcea8ff 269 static short sLastCheckVariables[ semtstNUM_TASKS ] = { 0 };
kenjiArai 0:d4960fcea8ff 270 portBASE_TYPE xTask, xReturn = pdTRUE;
kenjiArai 0:d4960fcea8ff 271
kenjiArai 0:d4960fcea8ff 272 for( xTask = 0; xTask < semtstNUM_TASKS; xTask++ )
kenjiArai 0:d4960fcea8ff 273 {
kenjiArai 0:d4960fcea8ff 274 if( sLastCheckVariables[ xTask ] == sCheckVariables[ xTask ] )
kenjiArai 0:d4960fcea8ff 275 {
kenjiArai 0:d4960fcea8ff 276 xReturn = pdFALSE;
kenjiArai 0:d4960fcea8ff 277 }
kenjiArai 0:d4960fcea8ff 278
kenjiArai 0:d4960fcea8ff 279 sLastCheckVariables[ xTask ] = sCheckVariables[ xTask ];
kenjiArai 0:d4960fcea8ff 280 }
kenjiArai 0:d4960fcea8ff 281
kenjiArai 0:d4960fcea8ff 282 return xReturn;
kenjiArai 0:d4960fcea8ff 283 }
kenjiArai 0:d4960fcea8ff 284
kenjiArai 0:d4960fcea8ff 285