1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
|
/*
* FreeRTOS Kernel V10.4.0
* Copyright (C) 2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of
* this software and associated documentation files (the "Software"), to deal in
* the Software without restriction, including without limitation the rights to
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
* the Software, and to permit persons to whom the Software is furnished to do so,
* subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
* FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
* COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
* IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
* http://www.FreeRTOS.org
* http://aws.amazon.com/freertos
*
* 1 tab == 4 spaces!
*/
#include "FreeRTOS.h"
#include "task.h"
/*
* Two test tasks that fill the CPU registers with known values before
* continuously looping round checking that each register still contains its
* expected value. Both tasks use a separate set of values, with an incorrect
* value being found at any time being indicative of an error in the context
* switch mechanism. One of the tasks uses a yield instruction to increase the
* test coverage. The nature of these tasks necessitates that they are written
* in assembly code.
*/
static void vRegTest1( void *pvParameters );
static void vRegTest2( void *pvParameters );
/* Counters used to ensure the tasks are still running. */
static volatile unsigned long ulRegTest1Counter = 0UL, ulRegTest2Counter = 0UL;
/*-----------------------------------------------------------*/
void vStartRegTestTasks( void )
{
xTaskCreate( vRegTest1, "RTest1", configMINIMAL_STACK_SIZE, NULL, tskIDLE_PRIORITY, NULL );
xTaskCreate( vRegTest2, "RTest1", configMINIMAL_STACK_SIZE, NULL, tskIDLE_PRIORITY, NULL );
}
/*-----------------------------------------------------------*/
static void vRegTest1( void *pvParameters )
{
__asm volatile
(
" mov r2, #0x02 \n" /* Fill the registers with known values, r0 is always 0 and r1 is the stack pointer. */
" mov r3, #0x03 \n"
" mov r4, #0x04 \n"
" mov r5, #0x05 \n"
" mov r6, #0x06 \n"
" mov r7, #0x07 \n"
" mov r8, #0x08 \n"
" mov r9, #0x09 \n"
" mov r10, #0x0a \n"
" mov r11, #0x0b \n"
" mov r12, #0x0c \n"
" mov r13, #0x0d \n"
" mov r14, #0x0e \n"
" mov r15, #0x0f \n"
" \n"
"reg_check_loop_1: \n"
" trap #31 \n"
" cmp r2, #0x02 \n" /* Check that each register still contains the expected value, jump to an infinite loop if an error is found. */
" bne.s reg_check_error_1 \n"
" cmp r3, #0x03 \n"
" bne.s reg_check_error_1 \n"
" cmp r4, #0x04 \n"
" bne.s reg_check_error_1 \n"
" cmp r5, #0x05 \n"
" bne.s reg_check_error_1 \n"
" cmp r6, #0x06 \n"
" bne.s reg_check_error_1 \n"
" cmp r7, #0x07 \n"
" bne.s reg_check_error_1 \n"
" cmp r8, #0x08 \n"
" bne.s reg_check_error_1 \n"
" cmp r9, #0x09 \n"
" bne.s reg_check_error_1 \n"
" cmp r10, #0x0a \n"
" bne.s reg_check_error_1 \n"
" cmp r11, #0x0b \n"
" bne.s reg_check_error_1 \n"
" cmp r12, #0x0c \n"
" bne.s reg_check_error_1 \n"
" cmp r13, #0x0d \n"
" bne.s reg_check_error_1 \n"
" cmp r14, #0x0e \n"
" bne.s reg_check_error_1 \n"
" cmp r15, #0x0f \n"
" bne.s reg_check_error_1 \n"
" \n"
" ld r2, [r0]+short(ulRegTest1Counter) \n" /* Increment the loop counter to show that this task is still running error free. */
" add r2, #1 \n"
" st r2, [r0]+short(ulRegTest1Counter) \n"
" mov r2, #0x02 \n"
" \n"
" bra.s reg_check_loop_1 \n" /* Do it all again. */
" \n"
"reg_check_error_1: \n"
"bra.s . \n"
);
}
/*-----------------------------------------------------------*/
static void vRegTest2( void *pvParameters )
{
__asm volatile
(
" mov r2, #0x12 \n" /* Fill the registers with known values, r0 is always 0 and r1 is the stack pointer. */
" mov r3, #0x13 \n"
" mov r4, #0x14 \n"
" mov r5, #0x15 \n"
" mov r6, #0x16 \n"
" mov r7, #0x17 \n"
" mov r8, #0x18 \n"
" mov r9, #0x19 \n"
" mov r10, #0x1a \n"
" mov r11, #0x1b \n"
" mov r12, #0x1c \n"
" mov r13, #0x1d \n"
" mov r14, #0x1e \n"
" mov r15, #0x1f \n"
" \n"
"reg_check_loop_2: \n"
" cmp r2, #0x12 \n" /* Check that each register still contains the expected value, jump to an infinite loop if an error is found. */
" bne.s reg_check_error_2 \n"
" cmp r3, #0x13 \n"
" bne.s reg_check_error_2 \n"
" cmp r4, #0x14 \n"
" bne.s reg_check_error_2 \n"
" cmp r5, #0x15 \n"
" bne.s reg_check_error_2 \n"
" cmp r6, #0x16 \n"
" bne.s reg_check_error_2 \n"
" cmp r7, #0x17 \n"
" bne.s reg_check_error_2 \n"
" cmp r8, #0x18 \n"
" bne.s reg_check_error_2 \n"
" cmp r9, #0x19 \n"
" bne.s reg_check_error_2 \n"
" cmp r10, #0x1a \n"
" bne.s reg_check_error_2 \n"
" cmp r11, #0x1b \n"
" bne.s reg_check_error_2 \n"
" cmp r12, #0x1c \n"
" bne.s reg_check_error_2 \n"
" cmp r13, #0x1d \n"
" bne.s reg_check_error_2 \n"
" cmp r14, #0x1e \n"
" bne.s reg_check_error_2 \n"
" cmp r15, #0x1f \n"
" bne.s reg_check_error_2 \n"
" \n"
" ld r2, [r0]+short(ulRegTest2Counter) \n" /* Increment the loop counter to show that this task is still running error free. */
" add r2, #1 \n"
" st r2, [r0]+short(ulRegTest2Counter) \n"
" mov r2, #0x12 \n"
" \n"
" bra.s reg_check_loop_2 \n" /* Do it all again. */
" \n"
"reg_check_error_2: \n"
"bra.s . \n"
);
}
/*-----------------------------------------------------------*/
portBASE_TYPE xAreRegTestTasksStillRunning( void )
{
static unsigned long ulLastCounter1 = 0UL, ulLastCounter2 = 0UL;
long lReturn;
/* Check that both loop counters are still incrementing, indicating that
both reg test tasks are still running error free. */
if( ulLastCounter1 == ulRegTest1Counter )
{
lReturn = pdFAIL;
}
else if( ulLastCounter2 == ulRegTest2Counter )
{
lReturn = pdFAIL;
}
else
{
lReturn = pdPASS;
}
ulLastCounter1 = ulRegTest1Counter;
ulLastCounter2 = ulRegTest2Counter;
return lReturn;
}
|
