/*\r
- FreeRTOS V7.4.2 - Copyright (C) 2013 Real Time Engineers Ltd.\r
-\r
- FEATURES AND PORTS ARE ADDED TO FREERTOS ALL THE TIME. PLEASE VISIT\r
- http://www.FreeRTOS.org TO ENSURE YOU ARE USING THE LATEST VERSION.\r
-\r
- ***************************************************************************\r
- * *\r
- * FreeRTOS tutorial books are available in pdf and paperback. *\r
- * Complete, revised, and edited pdf reference manuals are also *\r
- * available. *\r
- * *\r
- * Purchasing FreeRTOS documentation will not only help you, by *\r
- * ensuring you get running as quickly as possible and with an *\r
- * in-depth knowledge of how to use FreeRTOS, it will also help *\r
- * the FreeRTOS project to continue with its mission of providing *\r
- * professional grade, cross platform, de facto standard solutions *\r
- * for microcontrollers - completely free of charge! *\r
- * *\r
- * >>> See http://www.FreeRTOS.org/Documentation for details. <<< *\r
- * *\r
- * Thank you for using FreeRTOS, and thank you for your support! *\r
- * *\r
- ***************************************************************************\r
-\r
-\r
- This file is part of the FreeRTOS distribution.\r
-\r
- FreeRTOS is free software; you can redistribute it and/or modify it under\r
- the terms of the GNU General Public License (version 2) as published by the\r
- Free Software Foundation AND MODIFIED BY the FreeRTOS exception.\r
-\r
- >>>>>>NOTE<<<<<< The modification to the GPL is included to allow you to\r
- distribute a combined work that includes FreeRTOS without being obliged to\r
- provide the source code for proprietary components outside of the FreeRTOS\r
- kernel.\r
-\r
- FreeRTOS is distributed in the hope that it will be useful, but WITHOUT ANY\r
- WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\r
- FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\r
- details. You should have received a copy of the GNU General Public License\r
- and the FreeRTOS license exception along with FreeRTOS; if not it can be\r
- viewed here: http://www.freertos.org/a00114.html and also obtained by\r
- writing to Real Time Engineers Ltd., contact details for whom are available\r
- on the FreeRTOS WEB site.\r
-\r
- 1 tab == 4 spaces!\r
-\r
- ***************************************************************************\r
- * *\r
- * Having a problem? Start by reading the FAQ "My application does *\r
- * not run, what could be wrong?" *\r
- * *\r
- * http://www.FreeRTOS.org/FAQHelp.html *\r
- * *\r
- ***************************************************************************\r
-\r
-\r
- http://www.FreeRTOS.org - Documentation, books, training, latest versions, \r
- license and Real Time Engineers Ltd. contact details.\r
-\r
- http://www.FreeRTOS.org/plus - A selection of FreeRTOS ecosystem products,\r
- including FreeRTOS+Trace - an indispensable productivity tool, and our new\r
- fully thread aware and reentrant UDP/IP stack.\r
-\r
- http://www.OpenRTOS.com - Real Time Engineers ltd license FreeRTOS to High \r
- Integrity Systems, who sell the code with commercial support, \r
- indemnification and middleware, under the OpenRTOS brand.\r
- \r
- http://www.SafeRTOS.com - High Integrity Systems also provide a safety \r
- engineered and independently SIL3 certified version for use in safety and \r
- mission critical applications that require provable dependability.\r
-*/\r
+ * FreeRTOS Kernel V10.3.0\r
+ * Copyright (C) 2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.\r
+ *\r
+ * Permission is hereby granted, free of charge, to any person obtaining a copy of\r
+ * this software and associated documentation files (the "Software"), to deal in\r
+ * the Software without restriction, including without limitation the rights to\r
+ * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of\r
+ * the Software, and to permit persons to whom the Software is furnished to do so,\r
+ * subject to the following conditions:\r
+ *\r
+ * The above copyright notice and this permission notice shall be included in all\r
+ * copies or substantial portions of the Software.\r
+ *\r
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\r
+ * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\r
+ * COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\r
+ * IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\r
+ * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r
+ *\r
+ * http://www.FreeRTOS.org\r
+ * http://aws.amazon.com/freertos\r
+ *\r
+ * 1 tab == 4 spaces!\r
+ */\r
\r
/*\r
- * Creates eight tasks, each of which loops continuously performing an (emulated) \r
+ * Creates eight tasks, each of which loops continuously performing an (emulated)\r
* floating point calculation.\r
*\r
- * All the tasks run at the idle priority and never block or yield. This causes \r
- * all eight tasks to time slice with the idle task. Running at the idle priority \r
+ * All the tasks run at the idle priority and never block or yield. This causes\r
+ * all eight tasks to time slice with the idle task. Running at the idle priority\r
* means that these tasks will get pre-empted any time another task is ready to run\r
- * or a time slice occurs. More often than not the pre-emption will occur mid \r
- * calculation, creating a good test of the schedulers context switch mechanism - a \r
- * calculation producing an unexpected result could be a symptom of a corruption in \r
+ * or a time slice occurs. More often than not the pre-emption will occur mid\r
+ * calculation, creating a good test of the schedulers context switch mechanism - a\r
+ * calculation producing an unexpected result could be a symptom of a corruption in\r
* the context of a task.\r
*/\r
\r
#define mathSTACK_SIZE configMINIMAL_STACK_SIZE\r
#define mathNUMBER_OF_TASKS ( 8 )\r
\r
-/* Four tasks, each of which performs a different floating point calculation. \r
+/* Four tasks, each of which performs a different floating point calculation.\r
Each of the four is created twice. */\r
static portTASK_FUNCTION_PROTO( vCompetingMathTask1, pvParameters );\r
static portTASK_FUNCTION_PROTO( vCompetingMathTask2, pvParameters );\r
static portTASK_FUNCTION_PROTO( vCompetingMathTask3, pvParameters );\r
static portTASK_FUNCTION_PROTO( vCompetingMathTask4, pvParameters );\r
\r
-/* These variables are used to check that all the tasks are still running. If a \r
+/* These variables are used to check that all the tasks are still running. If a\r
task gets a calculation wrong it will\r
stop incrementing its check variable. */\r
static volatile unsigned long ulTaskCheck[ mathNUMBER_OF_TASKS ] = { 0 };\r
\r
void vStartMathTasks( unsigned portBASE_TYPE uxPriority )\r
{\r
- xTaskCreate( vCompetingMathTask1, ( signed char * ) "Math1", mathSTACK_SIZE, ( void * ) &( ulTaskCheck[ 0 ] ), uxPriority, NULL );\r
- xTaskCreate( vCompetingMathTask2, ( signed char * ) "Math2", mathSTACK_SIZE, ( void * ) &( ulTaskCheck[ 1 ] ), uxPriority, NULL );\r
- xTaskCreate( vCompetingMathTask3, ( signed char * ) "Math3", mathSTACK_SIZE, ( void * ) &( ulTaskCheck[ 2 ] ), uxPriority, NULL );\r
- xTaskCreate( vCompetingMathTask4, ( signed char * ) "Math4", mathSTACK_SIZE, ( void * ) &( ulTaskCheck[ 3 ] ), uxPriority, NULL );\r
- xTaskCreate( vCompetingMathTask1, ( signed char * ) "Math5", mathSTACK_SIZE, ( void * ) &( ulTaskCheck[ 4 ] ), uxPriority, NULL );\r
- xTaskCreate( vCompetingMathTask2, ( signed char * ) "Math6", mathSTACK_SIZE, ( void * ) &( ulTaskCheck[ 5 ] ), uxPriority, NULL );\r
- xTaskCreate( vCompetingMathTask3, ( signed char * ) "Math7", mathSTACK_SIZE, ( void * ) &( ulTaskCheck[ 6 ] ), uxPriority, NULL );\r
- xTaskCreate( vCompetingMathTask4, ( signed char * ) "Math8", mathSTACK_SIZE, ( void * ) &( ulTaskCheck[ 7 ] ), uxPriority, NULL );\r
+ xTaskCreate( vCompetingMathTask1, "Math1", mathSTACK_SIZE, ( void * ) &( ulTaskCheck[ 0 ] ), uxPriority, NULL );\r
+ xTaskCreate( vCompetingMathTask2, "Math2", mathSTACK_SIZE, ( void * ) &( ulTaskCheck[ 1 ] ), uxPriority, NULL );\r
+ xTaskCreate( vCompetingMathTask3, "Math3", mathSTACK_SIZE, ( void * ) &( ulTaskCheck[ 2 ] ), uxPriority, NULL );\r
+ xTaskCreate( vCompetingMathTask4, "Math4", mathSTACK_SIZE, ( void * ) &( ulTaskCheck[ 3 ] ), uxPriority, NULL );\r
+ xTaskCreate( vCompetingMathTask1, "Math5", mathSTACK_SIZE, ( void * ) &( ulTaskCheck[ 4 ] ), uxPriority, NULL );\r
+ xTaskCreate( vCompetingMathTask2, "Math6", mathSTACK_SIZE, ( void * ) &( ulTaskCheck[ 5 ] ), uxPriority, NULL );\r
+ xTaskCreate( vCompetingMathTask3, "Math7", mathSTACK_SIZE, ( void * ) &( ulTaskCheck[ 6 ] ), uxPriority, NULL );\r
+ xTaskCreate( vCompetingMathTask4, "Math8", mathSTACK_SIZE, ( void * ) &( ulTaskCheck[ 7 ] ), uxPriority, NULL );\r
}\r
/*-----------------------------------------------------------*/\r
\r
\r
dAnswer = ( d1 + d2 ) * d3;\r
\r
- /* The variable this task increments to show it is still running is passed in \r
+ /* The variable this task increments to show it is still running is passed in\r
as the parameter. */\r
pulTaskCheckVariable = ( unsigned long * ) pvParameters;\r
\r
taskYIELD();\r
#endif\r
\r
- /* If the calculation does not match the expected constant, stop the \r
+ /* If the calculation does not match the expected constant, stop the\r
increment of the check variable. */\r
if( fabs( d4 - dAnswer ) > 0.001 )\r
{\r
\r
if( sError == pdFALSE )\r
{\r
- /* If the calculation has always been correct, increment the check \r
+ /* If the calculation has always been correct, increment the check\r
variable so we know this task is still running okay. */\r
( *pulTaskCheckVariable )++;\r
}\r
dAnswer = ( d1 / d2 ) * d3;\r
\r
\r
- /* The variable this task increments to show it is still running is passed in \r
+ /* The variable this task increments to show it is still running is passed in\r
as the parameter. */\r
pulTaskCheckVariable = ( unsigned long * ) pvParameters;\r
\r
#if configUSE_PREEMPTION == 0\r
taskYIELD();\r
#endif\r
- \r
- /* If the calculation does not match the expected constant, stop the \r
+\r
+ /* If the calculation does not match the expected constant, stop the\r
increment of the check variable. */\r
if( fabs( d4 - dAnswer ) > 0.001 )\r
{\r
\r
if( sError == pdFALSE )\r
{\r
- /* If the calculation has always been correct, increment the check \r
+ /* If the calculation has always been correct, increment the check\r
variable so we know\r
this task is still running okay. */\r
( *pulTaskCheckVariable )++;\r
vPortTaskUsesFPU();\r
#endif\r
\r
- /* The variable this task increments to show it is still running is passed in \r
+ /* The variable this task increments to show it is still running is passed in\r
as the parameter. */\r
pulTaskCheckVariable = ( unsigned long * ) pvParameters;\r
\r
pdArray = ( portDOUBLE * ) pvPortMalloc( xArraySize * sizeof( portDOUBLE ) );\r
\r
- /* Keep filling an array, keeping a running total of the values placed in the \r
- array. Then run through the array adding up all the values. If the two totals \r
+ /* Keep filling an array, keeping a running total of the values placed in the\r
+ array. Then run through the array adding up all the values. If the two totals\r
do not match, stop the check variable from incrementing. */\r
for( ;; )\r
{\r
for( xPosition = 0; xPosition < xArraySize; xPosition++ )\r
{\r
pdArray[ xPosition ] = ( portDOUBLE ) xPosition + 5.5;\r
- dTotal1 += ( portDOUBLE ) xPosition + 5.5; \r
+ dTotal1 += ( portDOUBLE ) xPosition + 5.5;\r
}\r
\r
#if configUSE_PREEMPTION == 0\r
\r
if( sError == pdFALSE )\r
{\r
- /* If the calculation has always been correct, increment the check \r
+ /* If the calculation has always been correct, increment the check\r
variable so we know this task is still running okay. */\r
( *pulTaskCheckVariable )++;\r
}\r
vPortTaskUsesFPU();\r
#endif\r
\r
- /* The variable this task increments to show it is still running is passed in \r
+ /* The variable this task increments to show it is still running is passed in\r
as the parameter. */\r
pulTaskCheckVariable = ( unsigned long * ) pvParameters;\r
\r
pdArray = ( portDOUBLE * ) pvPortMalloc( xArraySize * sizeof( portDOUBLE ) );\r
\r
- /* Keep filling an array, keeping a running total of the values placed in the \r
- array. Then run through the array adding up all the values. If the two totals \r
+ /* Keep filling an array, keeping a running total of the values placed in the\r
+ array. Then run through the array adding up all the values. If the two totals\r
do not match, stop the check variable from incrementing. */\r
for( ;; )\r
{\r
for( xPosition = 0; xPosition < xArraySize; xPosition++ )\r
{\r
pdArray[ xPosition ] = ( portDOUBLE ) xPosition * 12.123;\r
- dTotal1 += ( portDOUBLE ) xPosition * 12.123; \r
+ dTotal1 += ( portDOUBLE ) xPosition * 12.123;\r
}\r
\r
#if configUSE_PREEMPTION == 0\r
\r
if( sError == pdFALSE )\r
{\r
- /* If the calculation has always been correct, increment the check \r
+ /* If the calculation has always been correct, increment the check\r
variable so we know this task is still running okay. */\r
( *pulTaskCheckVariable )++;\r
}\r
}\r
-} \r
+}\r
/*-----------------------------------------------------------*/\r
\r
/* This is called to check that all the created tasks are still running. */\r
portBASE_TYPE xAreMathsTaskStillRunning( void )\r
{\r
-/* Keep a history of the check variables so we know if they have been incremented \r
+/* Keep a history of the check variables so we know if they have been incremented\r
since the last call. */\r
static unsigned long ulLastTaskCheck[ mathNUMBER_OF_TASKS ] = { ( unsigned short ) 0 };\r
portBASE_TYPE xReturn = pdTRUE, xTask;\r
\r
- /* Check the maths tasks are still running by ensuring their check variables \r
+ /* Check the maths tasks are still running by ensuring their check variables\r
are still incrementing. */\r
for( xTask = 0; xTask < mathNUMBER_OF_TASKS; xTask++ )\r
{\r
projects / freertos / blobdiff