2 * FreeRTOS Kernel V10.2.0
\r
3 * Copyright (C) 2019 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.
\r
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
\r
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
\r
17 * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
\r
18 * COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
\r
19 * IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
\r
20 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
\r
22 * http://www.FreeRTOS.org
\r
23 * http://aws.amazon.com/freertos
\r
25 * 1 tab == 4 spaces!
\r
29 * Tests the use of queue sets.
\r
31 * A receive task creates a number of queues and adds them to a queue set before
\r
32 * blocking on the queue set receive. A transmit task and (optionally) an
\r
33 * interrupt repeatedly unblocks the receive task by sending messages to the
\r
34 * queues in a pseudo random order. The receive task removes the messages from
\r
35 * the queues and flags an error if the received message does not match that
\r
36 * expected. The task sends values in the range 0 to
\r
37 * queuesetINITIAL_ISR_TX_VALUE, and the ISR sends value in the range
\r
38 * queuesetINITIAL_ISR_TX_VALUE to ULONG_MAX.
\r
42 /* Standard includes. */
\r
46 /* Kernel includes. */
\r
47 #include "FreeRTOS.h"
\r
51 /* Demo includes. */
\r
52 #include "QueueSetPolling.h"
\r
54 /* The length of each created queue. */
\r
55 #define setpollQUEUE_LENGTH 10
\r
57 /* Block times used in this demo. A block time or 0 means "don't block". */
\r
58 #define setpollDONT_BLOCK 0
\r
60 /* The ISR sends to the queue every setpollISR_TX_PERIOD ticks. */
\r
61 #define queuesetISR_TX_PERIOD ( 50UL )
\r
64 * The task that reads from the queue set.
\r
66 static void prvQueueSetReceivingTask( void *pvParameters );
\r
68 /*-----------------------------------------------------------*/
\r
70 /* The queue that is added to the set. */
\r
71 static QueueHandle_t xQueue = NULL;
\r
73 /* The handle of the queue set to which the queue is added. */
\r
74 static QueueSetHandle_t xQueueSet = NULL;
\r
76 /* Set to pdFAIL if an error is detected by any queue set task.
\r
77 ulCycleCounter will only be incremented if xQueueSetTasksSatus equals pdPASS. */
\r
78 static volatile BaseType_t xQueueSetPollStatus = pdPASS;
\r
80 /* Counter used to ensure the task is still running. */
\r
81 static uint32_t ulCycleCounter = 0;
\r
83 /*-----------------------------------------------------------*/
\r
85 void vStartQueueSetPollingTask( void )
\r
87 /* Create the queue that is added to the set, the set, and add the queue to
\r
89 xQueue = xQueueCreate( setpollQUEUE_LENGTH, sizeof( uint32_t ) );
\r
90 xQueueSet = xQueueCreateSet( setpollQUEUE_LENGTH );
\r
92 if( ( xQueue != NULL ) && ( xQueueSet != NULL ) )
\r
94 xQueueAddToSet( xQueue, xQueueSet );
\r
96 /* Create the task. */
\r
97 xTaskCreate( prvQueueSetReceivingTask, "SetPoll", configMINIMAL_STACK_SIZE, NULL, tskIDLE_PRIORITY, NULL );
\r
100 /*-----------------------------------------------------------*/
\r
102 static void prvQueueSetReceivingTask( void *pvParameters )
\r
104 uint32_t ulReceived, ulExpected = 0;
\r
105 QueueHandle_t xActivatedQueue;
\r
107 /* Remove compiler warnings. */
\r
108 ( void ) pvParameters;
\r
112 /* Is a message waiting? A block time is not used to ensure the queue
\r
113 set is polled while it is being written to from an interrupt. */
\r
114 xActivatedQueue = xQueueSelectFromSet( xQueueSet, setpollDONT_BLOCK );
\r
116 if( xActivatedQueue != NULL )
\r
118 /* Reading from the queue should pass with a zero block time as
\r
119 this task will only run when something has been posted to a task
\r
120 in the queue set. */
\r
121 if( xQueueReceive( xActivatedQueue, &ulReceived, setpollDONT_BLOCK ) != pdPASS )
\r
123 xQueueSetPollStatus = pdFAIL;
\r
126 if( ulReceived == ulExpected )
\r
132 xQueueSetPollStatus = pdFAIL;
\r
135 if( xQueueSetPollStatus == pdPASS )
\r
142 /*-----------------------------------------------------------*/
\r
144 void vQueueSetPollingInterruptAccess( void )
\r
146 static uint32_t ulCallCount = 0, ulValueToSend = 0;
\r
148 /* It is intended that this function is called from the tick hook
\r
149 function, so each call is one tick period apart. */
\r
151 if( ulCallCount > queuesetISR_TX_PERIOD )
\r
155 if( xQueueSendFromISR( xQueue, ( void * ) &ulValueToSend, NULL ) == pdPASS )
\r
157 /* Send the next value next time. */
\r
162 /*-----------------------------------------------------------*/
\r
164 BaseType_t xAreQueueSetPollTasksStillRunning( void )
\r
166 static uint32_t ulLastCycleCounter = 0;
\r
168 if( ulLastCycleCounter == ulCycleCounter )
\r
170 xQueueSetPollStatus = pdFAIL;
\r
173 ulLastCycleCounter = ulCycleCounter;
\r
175 return xQueueSetPollStatus;
\r
177 /*-----------------------------------------------------------*/
\r