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
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
|
/* stack.c */
/*
* Copyright (c) 1997-2010, 2013-2014 Wind River Systems, Inc.
*
* SPDX-License-Identifier: Apache-2.0
*/
#include "syskernel.h"
struct k_stack stack_1;
struct k_stack stack_2;
uint32_t stack1[2];
uint32_t stack2[2];
/**
*
* @brief Initialize stacks for the test
*
* @return N/A
*
*/
void stack_test_init(void)
{
k_stack_init(&stack_1, stack1, 2);
k_stack_init(&stack_2, stack2, 2);
}
/**
*
* @brief Stack test thread
*
* @param par1 Ignored parameter.
* @param par2 Number of test loops.
*
* @return N/A
*
*/
void stack_thread1(void *par1, void *par2, void *par3)
{
int num_loops = ((int) par2 / 2);
int i;
uint32_t data;
ARG_UNUSED(par1);
ARG_UNUSED(par3);
for (i = 0; i < num_loops; i++) {
k_stack_pop(&stack_1, &data, K_FOREVER);
if (data != 2 * i) {
break;
}
data = 2 * i;
k_stack_push(&stack_2, data);
k_stack_pop(&stack_1, &data, K_FOREVER);
if (data != 2 * i + 1) {
break;
}
data = 2 * i + 1;
k_stack_push(&stack_2, data);
}
}
/**
*
* @brief Stack test thread
*
* @param par1 Address of the counter.
* @param par2 Number of test cycles.
*
* @return N/A
*
*/
void stack_thread2(void *par1, void *par2, void *par3)
{
int i;
uint32_t data;
int *pcounter = (int *)par1;
int num_loops = (int) par2;
ARG_UNUSED(par3);
for (i = 0; i < num_loops; i++) {
data = i;
k_stack_push(&stack_1, data);
k_stack_pop(&stack_2, &data, K_FOREVER);
if (data != i) {
break;
}
(*pcounter)++;
}
}
/**
*
* @brief Stack test thread
*
* @param par1 Address of the counter.
* @param par2 Number of test cycles.
*
* @return N/A
*
*/
void stack_thread3(void *par1, void *par2, void *par3)
{
int i;
uint32_t data;
int *pcounter = (int *)par1;
int num_loops = (int) par2;
ARG_UNUSED(par3);
for (i = 0; i < num_loops; i++) {
data = i;
k_stack_push(&stack_1, data);
data = 0xffffffff;
while (k_stack_pop(&stack_2, &data,
K_NO_WAIT) != 0) {
k_yield();
}
if (data != i) {
break;
}
(*pcounter)++;
}
}
/**
*
* @brief The main test entry
*
* @return 1 if success and 0 on failure
*
*/
int stack_test(void)
{
uint32_t t;
int i = 0;
int return_value = 0;
/* test get wait & put stack functions between co-op threads */
fprintf(output_file, sz_test_case_fmt,
"Stack #1");
fprintf(output_file, sz_description,
"\n\tk_stack_init"
"\n\tk_stack_pop(TICKS_UNLIMITED)"
"\n\tk_stack_push");
printf(sz_test_start_fmt);
stack_test_init();
t = BENCH_START();
k_thread_spawn(thread_stack1, STACK_SIZE, stack_thread1,
0, (void *) NUMBER_OF_LOOPS, NULL,
K_PRIO_COOP(3), 0, K_NO_WAIT);
k_thread_spawn(thread_stack2, STACK_SIZE, stack_thread2,
(void *) &i, (void *) NUMBER_OF_LOOPS, NULL,
K_PRIO_COOP(3), 0, K_NO_WAIT);
t = TIME_STAMP_DELTA_GET(t);
return_value += check_result(i, t);
/* test get/yield & put stack functions between co-op threads */
fprintf(output_file, sz_test_case_fmt,
"Stack #2");
fprintf(output_file, sz_description,
"\n\tk_stack_init"
"\n\tk_stack_pop(TICKS_UNLIMITED)"
"\n\tk_stack_pop"
"\n\tk_stack_push"
"\n\tk_yield");
printf(sz_test_start_fmt);
stack_test_init();
t = BENCH_START();
i = 0;
k_thread_spawn(thread_stack1, STACK_SIZE, stack_thread1,
0, (void *) NUMBER_OF_LOOPS, NULL,
K_PRIO_COOP(3), 0, K_NO_WAIT);
k_thread_spawn(thread_stack2, STACK_SIZE, stack_thread3,
(void *) &i, (void *) NUMBER_OF_LOOPS, NULL,
K_PRIO_COOP(3), 0, K_NO_WAIT);
t = TIME_STAMP_DELTA_GET(t);
return_value += check_result(i, t);
/* test get wait & put stack functions across co-op and premptive
* threads
*/
fprintf(output_file, sz_test_case_fmt,
"Stack #3");
fprintf(output_file, sz_description,
"\n\tk_stack_init"
"\n\tk_stack_pop(TICKS_UNLIMITED)"
"\n\tk_stack_push"
"\n\tk_stack_pop(TICKS_UNLIMITED)"
"\n\tk_stack_push");
printf(sz_test_start_fmt);
stack_test_init();
t = BENCH_START();
k_thread_spawn(thread_stack1, STACK_SIZE, stack_thread1,
0, (void *) NUMBER_OF_LOOPS, NULL,
K_PRIO_COOP(3), 0, K_NO_WAIT);
for (i = 0; i < NUMBER_OF_LOOPS / 2; i++) {
uint32_t data;
data = 2 * i;
k_stack_push(&stack_1, data);
data = 2 * i + 1;
k_stack_push(&stack_1, data);
k_stack_pop(&stack_2, &data, K_FOREVER);
if (data != 2 * i + 1) {
break;
}
k_stack_pop(&stack_2, &data, K_FOREVER);
if (data != 2 * i) {
break;
}
}
t = TIME_STAMP_DELTA_GET(t);
return_value += check_result(i * 2, t);
return return_value;
}
|
