2 * FreeRTOS Kernel V10.0.0
\r
3 * Copyright (C) 2017 Amazon.com, Inc. or its affiliates. All Rights Reserved.
\r
5 * Permission is hereby granted, free of charge, to any person obtaining a copy of
\r
6 * this software and associated documentation files (the "Software"), to deal in
\r
7 * the Software without restriction, including without limitation the rights to
\r
8 * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
\r
9 * the Software, and to permit persons to whom the Software is furnished to do so,
\r
10 * subject to the following conditions:
\r
12 * The above copyright notice and this permission notice shall be included in all
\r
13 * copies or substantial portions of the Software. If you wish to use our Amazon
\r
14 * FreeRTOS name, please do so in a fair use way that does not cause confusion.
\r
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
\r
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
\r
18 * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
\r
19 * COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
\r
20 * IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
\r
21 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
\r
23 * http://www.FreeRTOS.org
\r
24 * http://aws.amazon.com/freertos
\r
26 * 1 tab == 4 spaces!
\r
30 * Creates six tasks that operate on three queues as follows:
\r
32 * The first two tasks send and receive an incrementing number to/from a queue.
\r
33 * One task acts as a producer and the other as the consumer. The consumer is a
\r
34 * higher priority than the producer and is set to block on queue reads. The queue
\r
35 * only has space for one item - as soon as the producer posts a message on the
\r
36 * queue the consumer will unblock, pre-empt the producer, and remove the item.
\r
38 * The second two tasks work the other way around. Again the queue used only has
\r
39 * enough space for one item. This time the consumer has a lower priority than the
\r
40 * producer. The producer will try to post on the queue blocking when the queue is
\r
41 * full. When the consumer wakes it will remove the item from the queue, causing
\r
42 * the producer to unblock, pre-empt the consumer, and immediately re-fill the
\r
45 * The last two tasks use the same queue producer and consumer functions. This time the queue has
\r
46 * enough space for lots of items and the tasks operate at the same priority. The
\r
47 * producer will execute, placing items into the queue. The consumer will start
\r
48 * executing when either the queue becomes full (causing the producer to block) or
\r
49 * a context switch occurs (tasks of the same priority will time slice).
\r
51 * \page BlockQC blockQ.c
\r
52 * \ingroup DemoFiles
\r
59 + Reversed the priority and block times of the second two demo tasks so
\r
60 they operate as per the description above.
\r
64 + Delay periods are now specified using variables and constants of
\r
65 TickType_t rather than unsigned long.
\r
69 + The second set of tasks were created the wrong way around. This has been
\r
76 /* Scheduler include files. */
\r
77 #include "FreeRTOS.h"
\r
81 /* Demo program include files. */
\r
85 #define blckqSTACK_SIZE ( ( unsigned short ) configMINIMAL_STACK_SIZE )
\r
86 #define blckqNUM_TASK_SETS ( 3 )
\r
88 /* Structure used to pass parameters to the blocking queue tasks. */
\r
89 typedef struct BLOCKING_QUEUE_PARAMETERS
\r
91 QueueHandle_t xQueue; /*< The queue to be used by the task. */
\r
92 TickType_t xBlockTime; /*< The block time to use on queue reads/writes. */
\r
93 volatile short *psCheckVariable; /*< Incremented on each successful cycle to check the task is still running. */
\r
94 } xBlockingQueueParameters;
\r
96 /* Task function that creates an incrementing number and posts it on a queue. */
\r
97 static void vBlockingQueueProducer( void *pvParameters );
\r
99 /* Task function that removes the incrementing number from a queue and checks that
\r
100 it is the expected number. */
\r
101 static void vBlockingQueueConsumer( void *pvParameters );
\r
103 /* Variables which are incremented each time an item is removed from a queue, and
\r
104 found to be the expected value.
\r
105 These are used to check that the tasks are still running. */
\r
106 static volatile short sBlockingConsumerCount[ blckqNUM_TASK_SETS ] = { ( short ) 0, ( short ) 0, ( short ) 0 };
\r
108 /* Variable which are incremented each time an item is posted on a queue. These
\r
109 are used to check that the tasks are still running. */
\r
110 static volatile short sBlockingProducerCount[ blckqNUM_TASK_SETS ] = { ( short ) 0, ( short ) 0, ( short ) 0 };
\r
112 /*-----------------------------------------------------------*/
\r
114 void vStartBlockingQueueTasks( unsigned portBASE_TYPE uxPriority )
\r
116 xBlockingQueueParameters *pxQueueParameters1, *pxQueueParameters2;
\r
117 xBlockingQueueParameters *pxQueueParameters3, *pxQueueParameters4;
\r
118 xBlockingQueueParameters *pxQueueParameters5, *pxQueueParameters6;
\r
119 const unsigned portBASE_TYPE uxQueueSize1 = 1, uxQueueSize5 = 5;
\r
120 const TickType_t xBlockTime = ( TickType_t ) 1000 / portTICK_PERIOD_MS;
\r
121 const TickType_t xDontBlock = ( TickType_t ) 0;
\r
123 /* Create the first two tasks as described at the top of the file. */
\r
125 /* First create the structure used to pass parameters to the consumer tasks. */
\r
126 pxQueueParameters1 = ( xBlockingQueueParameters * ) pvPortMalloc( sizeof( xBlockingQueueParameters ) );
\r
128 /* Create the queue used by the first two tasks to pass the incrementing number.
\r
129 Pass a pointer to the queue in the parameter structure. */
\r
130 pxQueueParameters1->xQueue = xQueueCreate( uxQueueSize1, ( unsigned portBASE_TYPE ) sizeof( unsigned short ) );
\r
132 /* The consumer is created first so gets a block time as described above. */
\r
133 pxQueueParameters1->xBlockTime = xBlockTime;
\r
135 /* Pass in the variable that this task is going to increment so we can check it
\r
136 is still running. */
\r
137 pxQueueParameters1->psCheckVariable = &( sBlockingConsumerCount[ 0 ] );
\r
139 /* Create the structure used to pass parameters to the producer task. */
\r
140 pxQueueParameters2 = ( xBlockingQueueParameters * ) pvPortMalloc( sizeof( xBlockingQueueParameters ) );
\r
142 /* Pass the queue to this task also, using the parameter structure. */
\r
143 pxQueueParameters2->xQueue = pxQueueParameters1->xQueue;
\r
145 /* The producer is not going to block - as soon as it posts the consumer will
\r
146 wake and remove the item so the producer should always have room to post. */
\r
147 pxQueueParameters2->xBlockTime = xDontBlock;
\r
149 /* Pass in the variable that this task is going to increment so we can check
\r
150 it is still running. */
\r
151 pxQueueParameters2->psCheckVariable = &( sBlockingProducerCount[ 0 ] );
\r
154 /* Note the producer has a lower priority than the consumer when the tasks are
\r
156 xTaskCreate( vBlockingQueueConsumer, "QConsB1", blckqSTACK_SIZE, ( void * ) pxQueueParameters1, uxPriority, NULL );
\r
157 xTaskCreate( vBlockingQueueProducer, "QProdB2", blckqSTACK_SIZE, ( void * ) pxQueueParameters2, tskIDLE_PRIORITY, NULL );
\r
161 /* Create the second two tasks as described at the top of the file. This uses
\r
162 the same mechanism but reverses the task priorities. */
\r
164 pxQueueParameters3 = ( xBlockingQueueParameters * ) pvPortMalloc( sizeof( xBlockingQueueParameters ) );
\r
165 pxQueueParameters3->xQueue = xQueueCreate( uxQueueSize1, ( unsigned portBASE_TYPE ) sizeof( unsigned short ) );
\r
166 pxQueueParameters3->xBlockTime = xDontBlock;
\r
167 pxQueueParameters3->psCheckVariable = &( sBlockingProducerCount[ 1 ] );
\r
169 pxQueueParameters4 = ( xBlockingQueueParameters * ) pvPortMalloc( sizeof( xBlockingQueueParameters ) );
\r
170 pxQueueParameters4->xQueue = pxQueueParameters3->xQueue;
\r
171 pxQueueParameters4->xBlockTime = xBlockTime;
\r
172 pxQueueParameters4->psCheckVariable = &( sBlockingConsumerCount[ 1 ] );
\r
174 xTaskCreate( vBlockingQueueProducer, "QProdB3", blckqSTACK_SIZE, ( void * ) pxQueueParameters3, tskIDLE_PRIORITY, NULL );
\r
175 xTaskCreate( vBlockingQueueConsumer, "QConsB4", blckqSTACK_SIZE, ( void * ) pxQueueParameters4, uxPriority, NULL );
\r
179 /* Create the last two tasks as described above. The mechanism is again just
\r
180 the same. This time both parameter structures are given a block time. */
\r
181 pxQueueParameters5 = ( xBlockingQueueParameters * ) pvPortMalloc( sizeof( xBlockingQueueParameters ) );
\r
182 pxQueueParameters5->xQueue = xQueueCreate( uxQueueSize5, ( unsigned portBASE_TYPE ) sizeof( unsigned short ) );
\r
183 pxQueueParameters5->xBlockTime = xBlockTime;
\r
184 pxQueueParameters5->psCheckVariable = &( sBlockingProducerCount[ 2 ] );
\r
186 pxQueueParameters6 = ( xBlockingQueueParameters * ) pvPortMalloc( sizeof( xBlockingQueueParameters ) );
\r
187 pxQueueParameters6->xQueue = pxQueueParameters5->xQueue;
\r
188 pxQueueParameters6->xBlockTime = xBlockTime;
\r
189 pxQueueParameters6->psCheckVariable = &( sBlockingConsumerCount[ 2 ] );
\r
191 xTaskCreate( vBlockingQueueProducer, "QProdB5", blckqSTACK_SIZE, ( void * ) pxQueueParameters5, tskIDLE_PRIORITY, NULL );
\r
192 xTaskCreate( vBlockingQueueConsumer, "QConsB6", blckqSTACK_SIZE, ( void * ) pxQueueParameters6, tskIDLE_PRIORITY, NULL );
\r
194 /*-----------------------------------------------------------*/
\r
196 static void vBlockingQueueProducer( void *pvParameters )
\r
198 unsigned short usValue = 0;
\r
199 xBlockingQueueParameters *pxQueueParameters;
\r
200 const char * const pcTaskStartMsg = "Blocking queue producer started.\r\n";
\r
201 const char * const pcTaskErrorMsg = "Could not post on blocking queue\r\n";
\r
202 short sErrorEverOccurred = pdFALSE;
\r
204 pxQueueParameters = ( xBlockingQueueParameters * ) pvParameters;
\r
206 /* Queue a message for printing to say the task has started. */
\r
207 vPrintDisplayMessage( &pcTaskStartMsg );
\r
211 if( xQueueSendToBack( pxQueueParameters->xQueue, ( void * ) &usValue, pxQueueParameters->xBlockTime ) != pdPASS )
\r
213 vPrintDisplayMessage( &pcTaskErrorMsg );
\r
214 sErrorEverOccurred = pdTRUE;
\r
218 /* We have successfully posted a message, so increment the variable
\r
219 used to check we are still running. */
\r
220 if( sErrorEverOccurred == pdFALSE )
\r
222 ( *pxQueueParameters->psCheckVariable )++;
\r
225 /* Increment the variable we are going to post next time round. The
\r
226 consumer will expect the numbers to follow in numerical order. */
\r
231 /*-----------------------------------------------------------*/
\r
233 static void vBlockingQueueConsumer( void *pvParameters )
\r
235 unsigned short usData, usExpectedValue = 0;
\r
236 xBlockingQueueParameters *pxQueueParameters;
\r
237 const char * const pcTaskStartMsg = "Blocking queue consumer started.\r\n";
\r
238 const char * const pcTaskErrorMsg = "Incorrect value received on blocking queue.\r\n";
\r
239 short sErrorEverOccurred = pdFALSE;
\r
241 /* Queue a message for printing to say the task has started. */
\r
242 vPrintDisplayMessage( &pcTaskStartMsg );
\r
244 pxQueueParameters = ( xBlockingQueueParameters * ) pvParameters;
\r
248 if( xQueueReceive( pxQueueParameters->xQueue, &usData, pxQueueParameters->xBlockTime ) == pdPASS )
\r
250 if( usData != usExpectedValue )
\r
252 vPrintDisplayMessage( &pcTaskErrorMsg );
\r
255 usExpectedValue = usData;
\r
257 sErrorEverOccurred = pdTRUE;
\r
261 /* We have successfully received a message, so increment the
\r
262 variable used to check we are still running. */
\r
263 if( sErrorEverOccurred == pdFALSE )
\r
265 ( *pxQueueParameters->psCheckVariable )++;
\r
268 /* Increment the value we expect to remove from the queue next time
\r
275 /*-----------------------------------------------------------*/
\r
277 /* This is called to check that all the created tasks are still running. */
\r
278 portBASE_TYPE xAreBlockingQueuesStillRunning( void )
\r
280 static short sLastBlockingConsumerCount[ blckqNUM_TASK_SETS ] = { ( short ) 0, ( short ) 0, ( short ) 0 };
\r
281 static short sLastBlockingProducerCount[ blckqNUM_TASK_SETS ] = { ( short ) 0, ( short ) 0, ( short ) 0 };
\r
282 portBASE_TYPE xReturn = pdPASS, xTasks;
\r
284 /* Not too worried about mutual exclusion on these variables as they are 16
\r
285 bits and we are only reading them. We also only care to see if they have
\r
288 Loop through each check variable and return pdFALSE if any are found not
\r
289 to have changed since the last call. */
\r
291 for( xTasks = 0; xTasks < blckqNUM_TASK_SETS; xTasks++ )
\r
293 if( sBlockingConsumerCount[ xTasks ] == sLastBlockingConsumerCount[ xTasks ] )
\r
297 sLastBlockingConsumerCount[ xTasks ] = sBlockingConsumerCount[ xTasks ];
\r
300 if( sBlockingProducerCount[ xTasks ] == sLastBlockingProducerCount[ xTasks ] )
\r
304 sLastBlockingProducerCount[ xTasks ] = sBlockingProducerCount[ xTasks ];
\r