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
243
244
245
246
247
248
249
250
|
/***************************************************************************
* Copyright (c) 2026 Eclipse ThreadX contributors
*
* This program and the accompanying materials are made available under the
* terms of the MIT License which is available at
* https://opensource.org/licenses/MIT.
*
* AI Disclosure: This file was largely AI-generated by Claude Code (Opus 5).
* The AI-generated portions may be considered public domain (CC0-1.0)
* and not subject to the project's licence. The human contributor has
* reviewed and verified that the code is correct.
*
* SPDX-License-Identifier: MIT and CC0-1.0
**************************************************************************/
/* Define the ThreadX SMP relinquish rebalance test. This test fills every core with
threads of one priority that relinquish in a loop, and places two more threads of the
same priority behind them in the ready list: one that no core may run, and one that any
core may run. Walking the ready list, a relinquish reaches the unrunnable thread first
and cannot schedule it, so the execute list has to be rebalanced for the runnable thread
to reach a core. The runnable thread never running is the failure this test detects. */
#include <stdio.h>
#include "tx_api.h"
/* Fill the four cores, so a thread behind these in the ready list only reaches a core
through the execute list being rebalanced. */
#define SPIN_THREADS 4
/* The spinning threads keep their cores whatever else happens, so they carry the deadline.
One second is three orders of magnitude more than the handful of relinquishes a healthy
system needs, and the tick advances independently of which threads are scheduled. */
#define DEADLINE_TICKS 100
static TX_THREAD thread_control;
static TX_THREAD thread_spin[SPIN_THREADS];
static TX_THREAD thread_blocked;
static TX_THREAD thread_starved;
static ULONG spin_counter[SPIN_THREADS];
static ULONG starved_counter;
static ULONG blocked_counter;
static ULONG reported;
/* Define thread prototypes. */
static void thread_control_entry(ULONG thread_input);
static void thread_spin_entry(ULONG thread_input);
static void thread_blocked_entry(ULONG thread_input);
static void thread_starved_entry(ULONG thread_input);
/* Prototype for test control return. */
void test_control_return(UINT status);
/* Define what the initial system looks like. */
#ifdef CTEST
void test_application_define(void *first_unused_memory)
#else
void threadx_smp_relinquish_rebalance_test(void *first_unused_memory)
#endif
{
UINT status;
CHAR *pointer;
UINT i;
/* Put first available memory address into a character pointer. */
pointer = (CHAR *) first_unused_memory;
/* Create the control thread, which only resumes the others and then completes. */
status = tx_thread_create(&thread_control, "control thread", thread_control_entry, 0,
pointer, TEST_STACK_SIZE_PRINTF,
0, 0, TX_NO_TIME_SLICE, TX_AUTO_START);
pointer = pointer + TEST_STACK_SIZE_PRINTF;
status += tx_thread_smp_core_exclude(&thread_control, 0xE); /* Core 0 only! */
/* Check status. */
if (status != TX_SUCCESS)
{
printf("Running SMP Relinquish Rebalance Test............................... ERROR #1\n");
test_control_return(1);
}
/* Create one spinning thread per core. */
for (i = 0; i < SPIN_THREADS; i++)
{
status = tx_thread_create(&thread_spin[i], "spin thread", thread_spin_entry, i,
pointer, TEST_STACK_SIZE_PRINTF,
20, 20, TX_NO_TIME_SLICE, TX_DONT_START);
pointer = pointer + TEST_STACK_SIZE_PRINTF;
/* Check status. */
if (status != TX_SUCCESS)
{
printf("Running SMP Relinquish Rebalance Test............................... ERROR #2\n");
test_control_return(1);
}
}
/* Create the thread no core may run. Excluding every core leaves it ready and
permanently unmapped, which is what makes it a stable obstacle in the ready list
rather than a thread that eventually gets a turn. */
status = tx_thread_create(&thread_blocked, "blocked thread", thread_blocked_entry, 0,
pointer, TEST_STACK_SIZE_PRINTF,
20, 20, TX_NO_TIME_SLICE, TX_DONT_START);
pointer = pointer + TEST_STACK_SIZE_PRINTF;
status += tx_thread_smp_core_exclude(&thread_blocked, 0xF); /* No core at all! */
/* Check status. */
if (status != TX_SUCCESS)
{
printf("Running SMP Relinquish Rebalance Test............................... ERROR #3\n");
test_control_return(1);
}
/* Create the thread that any core may run. It is resumed last so that it sits behind
the blocked thread in the ready list at this priority. */
status = tx_thread_create(&thread_starved, "starved thread", thread_starved_entry, 0,
pointer, TEST_STACK_SIZE_PRINTF,
20, 20, TX_NO_TIME_SLICE, TX_DONT_START);
pointer = pointer + TEST_STACK_SIZE_PRINTF;
/* Check status. */
if (status != TX_SUCCESS)
{
printf("Running SMP Relinquish Rebalance Test............................... ERROR #4\n");
test_control_return(1);
}
}
/* Resume the others in ready list order and complete, so core 0 is released. */
static void thread_control_entry(ULONG thread_input)
{
UINT status;
UINT i;
status = TX_SUCCESS;
/* Fill the cores first. */
for (i = 0; i < SPIN_THREADS; i++)
{
status += tx_thread_resume(&thread_spin[i]);
}
/* Then the obstacle, then the thread behind it. */
status += tx_thread_resume(&thread_blocked);
status += tx_thread_resume(&thread_starved);
/* Check status. */
if (status != TX_SUCCESS)
{
printf("Running SMP Relinquish Rebalance Test............................... ERROR #5\n");
test_control_return(1);
}
}
/* Hold a core and relinquish. These threads keep running whatever the scheduler does with
the rest, so they are the ones that can enforce a deadline on the starved thread. */
static void thread_spin_entry(ULONG thread_input)
{
ULONG start;
start = tx_time_get();
while (starved_counter == 0)
{
spin_counter[thread_input]++;
/* The tick advances whether or not any thread is being scheduled, so this bounds
the test even when nothing is. */
if ((tx_time_get() - start) > DEADLINE_TICKS)
{
if (reported == 0)
{
reported = 1;
printf("Running SMP Relinquish Rebalance Test............................... ERROR #6\n");
test_control_return(1);
}
return;
}
tx_thread_relinquish();
}
}
/* Never runs: every core is excluded for this thread. */
static void thread_blocked_entry(ULONG thread_input)
{
blocked_counter++;
}
/* Reaching a core at all is the pass condition. */
static void thread_starved_entry(ULONG thread_input)
{
starved_counter++;
if (reported == 0)
{
reported = 1;
/* The blocked thread must not have run, or the obstacle was not an obstacle and
the test proved nothing. */
if (blocked_counter != 0)
{
printf("Running SMP Relinquish Rebalance Test............................... ERROR #7\n");
test_control_return(1);
}
printf("Running SMP Relinquish Rebalance Test............................... SUCCESS!\n");
test_control_return(0);
}
}
|
