Simuator - Work in progress

1 files changed, 262 insertions, 0 deletions

diff --git a/src/FreeRTOS-Sim-master/Demo/Common/Full/PollQ.c b/src/FreeRTOS-Sim-master/Demo/Common/Full/PollQ.c
new file mode 100644
index 0000000..99b05ce
--- /dev/null
+++ b/src/FreeRTOS-Sim-master/Demo/Common/Full/PollQ.c
@@ -0,0 +1,262 @@
+/*

+    FreeRTOS V8.2.2 - Copyright (C) 2015 Real Time Engineers Ltd.

+    All rights reserved

+

+    VISIT http://www.FreeRTOS.org TO ENSURE YOU ARE USING THE LATEST VERSION.

+

+    This file is part of the FreeRTOS distribution.

+

+    FreeRTOS is free software; you can redistribute it and/or modify it under

+    the terms of the GNU General Public License (version 2) as published by the

+    Free Software Foundation >>!AND MODIFIED BY!<< the FreeRTOS exception.

+

+    ***************************************************************************

+    >>!   NOTE: The modification to the GPL is included to allow you to     !<<

+    >>!   distribute a combined work that includes FreeRTOS without being   !<<

+    >>!   obliged to provide the source code for proprietary components     !<<

+    >>!   outside of the FreeRTOS kernel.                                   !<<

+    ***************************************************************************

+

+    FreeRTOS is distributed in the hope that it will be useful, but WITHOUT ANY

+    WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS

+    FOR A PARTICULAR PURPOSE.  Full license text is available on the following

+    link: http://www.freertos.org/a00114.html

+

+    ***************************************************************************

+     *                                                                       *

+     *    FreeRTOS provides completely free yet professionally developed,    *

+     *    robust, strictly quality controlled, supported, and cross          *

+     *    platform software that is more than just the market leader, it     *

+     *    is the industry's de facto standard.                               *

+     *                                                                       *

+     *    Help yourself get started quickly while simultaneously helping     *

+     *    to support the FreeRTOS project by purchasing a FreeRTOS           *

+     *    tutorial book, reference manual, or both:                          *

+     *    http://www.FreeRTOS.org/Documentation                              *

+     *                                                                       *

+    ***************************************************************************

+

+    http://www.FreeRTOS.org/FAQHelp.html - Having a problem?  Start by reading

+    the FAQ page "My application does not run, what could be wrong?".  Have you

+    defined configASSERT()?

+

+    http://www.FreeRTOS.org/support - In return for receiving this top quality

+    embedded software for free we request you assist our global community by

+    participating in the support forum.

+

+    http://www.FreeRTOS.org/training - Investing in training allows your team to

+    be as productive as possible as early as possible.  Now you can receive

+    FreeRTOS training directly from Richard Barry, CEO of Real Time Engineers

+    Ltd, and the world's leading authority on the world's leading RTOS.

+

+    http://www.FreeRTOS.org/plus - A selection of FreeRTOS ecosystem products,

+    including FreeRTOS+Trace - an indispensable productivity tool, a DOS

+    compatible FAT file system, and our tiny thread aware UDP/IP stack.

+

+    http://www.FreeRTOS.org/labs - Where new FreeRTOS products go to incubate.

+    Come and try FreeRTOS+TCP, our new open source TCP/IP stack for FreeRTOS.

+

+    http://www.OpenRTOS.com - Real Time Engineers ltd. license FreeRTOS to High

+    Integrity Systems ltd. to sell under the OpenRTOS brand.  Low cost OpenRTOS

+    licenses offer ticketed support, indemnification and commercial middleware.

+

+    http://www.SafeRTOS.com - High Integrity Systems also provide a safety

+    engineered and independently SIL3 certified version for use in safety and

+    mission critical applications that require provable dependability.

+

+    1 tab == 4 spaces!

+*/

+

+

+/**

+ * This is a very simple queue test.  See the BlockQ. c documentation for a more 

+ * comprehensive version.

+ *

+ * Creates two tasks that communicate over a single queue.  One task acts as a 

+ * producer, the other a consumer.  

+ *

+ * The producer loops for three iteration, posting an incrementing number onto the 

+ * queue each cycle.  It then delays for a fixed period before doing exactly the 

+ * same again.

+ *

+ * The consumer loops emptying the queue.  Each item removed from the queue is 

+ * checked to ensure it contains the expected value.  When the queue is empty it 

+ * blocks for a fixed period, then does the same again.

+ *

+ * All queue access is performed without blocking.  The consumer completely empties 

+ * the queue each time it runs so the producer should never find the queue full.  

+ *

+ * An error is flagged if the consumer obtains an unexpected value or the producer 

+ * find the queue is full.

+ *

+ * \page PollQC pollQ.c

+ * \ingroup DemoFiles

+ * <HR>

+ */

+

+/*

+Changes from V2.0.0

+

+	+ Delay periods are now specified using variables and constants of

+	  TickType_t rather than unsigned long.

+*/

+

+#include <stdlib.h>

+

+/* Scheduler include files. */

+#include "FreeRTOS.h"

+#include "task.h"

+#include "queue.h"

+#include "print.h"

+

+/* Demo program include files. */

+#include "PollQ.h"

+

+#define pollqSTACK_SIZE		( ( unsigned short ) configMINIMAL_STACK_SIZE )

+

+/* The task that posts the incrementing number onto the queue. */

+static void vPolledQueueProducer( void *pvParameters );

+

+/* The task that empties the queue. */

+static void vPolledQueueConsumer( void *pvParameters );

+

+/* Variables that are used to check that the tasks are still running with no errors. */

+static volatile short sPollingConsumerCount = 0, sPollingProducerCount = 0;

+/*-----------------------------------------------------------*/

+

+void vStartPolledQueueTasks( unsigned portBASE_TYPE uxPriority )

+{

+static QueueHandle_t xPolledQueue;

+const unsigned portBASE_TYPE uxQueueSize = 10;

+

+	/* Create the queue used by the producer and consumer. */

+	xPolledQueue = xQueueCreate( uxQueueSize, ( unsigned portBASE_TYPE ) sizeof( unsigned short ) );

+

+	/* Spawn the producer and consumer. */

+	xTaskCreate( vPolledQueueConsumer, "QConsNB", pollqSTACK_SIZE, ( void * ) &xPolledQueue, uxPriority, NULL );

+	xTaskCreate( vPolledQueueProducer, "QProdNB", pollqSTACK_SIZE, ( void * ) &xPolledQueue, uxPriority, NULL );

+}

+/*-----------------------------------------------------------*/

+

+static void vPolledQueueProducer( void *pvParameters )

+{

+unsigned short usValue = 0, usLoop;

+QueueHandle_t *pxQueue;

+const TickType_t xDelay = ( TickType_t ) 200 / portTICK_PERIOD_MS;

+const unsigned short usNumToProduce = 3;

+const char * const pcTaskStartMsg = "Polled queue producer started.\r\n";

+const char * const pcTaskErrorMsg = "Could not post on polled queue.\r\n";

+short sError = pdFALSE;

+

+	/* Queue a message for printing to say the task has started. */

+	vPrintDisplayMessage( &pcTaskStartMsg );

+

+	/* The queue being used is passed in as the parameter. */

+	pxQueue = ( QueueHandle_t * ) pvParameters;

+

+	for( ;; )

+	{		

+		for( usLoop = 0; usLoop < usNumToProduce; ++usLoop )

+		{

+			/* Send an incrementing number on the queue without blocking. */

+			if( xQueueSendToBack( *pxQueue, ( void * ) &usValue, ( TickType_t ) 0 ) != pdPASS )

+			{

+				/* We should never find the queue full - this is an error. */

+				vPrintDisplayMessage( &pcTaskErrorMsg );

+				sError = pdTRUE;

+			}

+			else

+			{

+				if( sError == pdFALSE )

+				{

+					/* If an error has ever been recorded we stop incrementing the 

+					check variable. */

+					++sPollingProducerCount;

+				}

+

+				/* Update the value we are going to post next time around. */

+				++usValue;

+			}

+		}

+

+		/* Wait before we start posting again to ensure the consumer runs and 

+		empties the queue. */

+		vTaskDelay( xDelay );

+	}

+}

+/*-----------------------------------------------------------*/

+

+static void vPolledQueueConsumer( void *pvParameters )

+{

+unsigned short usData, usExpectedValue = 0;

+QueueHandle_t *pxQueue;

+const TickType_t xDelay = ( TickType_t ) 200 / portTICK_PERIOD_MS;

+const char * const pcTaskStartMsg = "Polled queue consumer started.\r\n";

+const char * const pcTaskErrorMsg = "Incorrect value received on polled queue.\r\n";

+short sError = pdFALSE;

+

+	/* Queue a message for printing to say the task has started. */

+	vPrintDisplayMessage( &pcTaskStartMsg );

+

+	/* The queue being used is passed in as the parameter. */

+	pxQueue = ( QueueHandle_t * ) pvParameters;

+

+	for( ;; )

+	{		

+		/* Loop until the queue is empty. */

+		while( uxQueueMessagesWaiting( *pxQueue ) )

+		{

+			if( xQueueReceive( *pxQueue, &usData, ( TickType_t ) 0 ) == pdPASS )

+			{

+				if( usData != usExpectedValue )

+				{

+					/* This is not what we expected to receive so an error has 

+					occurred. */

+					vPrintDisplayMessage( &pcTaskErrorMsg );

+					sError = pdTRUE;

+					/* Catch-up to the value we received so our next expected value 

+					should again be correct. */

+					usExpectedValue = usData;

+				}

+				else

+				{

+					if( sError == pdFALSE )

+					{

+						/* Only increment the check variable if no errors have 

+						occurred. */

+						++sPollingConsumerCount;

+					}

+				}

+				++usExpectedValue;

+			}

+		}

+

+		/* Now the queue is empty we block, allowing the producer to place more 

+		items in the queue. */

+		vTaskDelay( xDelay );

+	}

+}

+/*-----------------------------------------------------------*/

+

+/* This is called to check that all the created tasks are still running with no errors. */

+portBASE_TYPE xArePollingQueuesStillRunning( void )

+{

+static short sLastPollingConsumerCount = 0, sLastPollingProducerCount = 0;

+portBASE_TYPE xReturn;

+

+	if( ( sLastPollingConsumerCount == sPollingConsumerCount ) ||

+		( sLastPollingProducerCount == sPollingProducerCount ) 

+	  )

+	{

+		xReturn = pdFALSE;

+	}

+	else

+	{

+		xReturn = pdTRUE;

+	}

+

+	sLastPollingConsumerCount = sPollingConsumerCount;

+	sLastPollingProducerCount = sPollingProducerCount;

+

+	return xReturn;

+}