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
|
/*
* Exercise thread queue enqueue and dequeue priority
*
* COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR).
*
* The license and distribution terms for this file may be
* found in the file LICENSE in this distribution or at
* http://www.rtems.org/license/LICENSE.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include <stdio.h>
#include <stdlib.h>
#include <bsp.h>
#include "tmacros.h"
const char rtems_test_name[] = "SP 42";
#define MAX_TASKS 20
rtems_task Init(rtems_task_argument argument);
rtems_task Locker_task(rtems_task_argument unused);
void do_test(
rtems_attribute attr,
bool extract /* TRUE if extract, not release */
);
/*
* Carefully chosen to exercise threadq enqueue/dequeue priority logic.
* Somewhat randomly sorted to ensure than if discipline is FIFO, run-time
* behavior won't be the same when released.
*/
rtems_task_priority Priorities_High[MAX_TASKS] = {
37, 37, 37, 37, /* backward - more 2-n */
2, 2, 2, 2, /* forward - multiple are on 2-n chain */
4, 3, /* forward - search forward arbitrary */
3, 3, 3, 3, /* forward - more 2-n */
38, 37, /* backward - search backward arbitrary */
34, 34, 34, 34, /* backward - multple on 2-n chain */
};
rtems_task_priority Priorities_Low[MAX_TASKS] = {
13, 13, 13, 13, /* backward - more 2-n */
2, 2, 2, 2, /* forward - multiple are on 2-n chain */
4, 3, /* forward - search forward arbitrary */
3, 3, 3, 3, /* forward - more 2-n */
14, 13, /* backward - search backward arbitrary */
12, 12, 12, 12, /* backward - multple on 2-n chain */
};
rtems_task_priority *Priorities;
rtems_id Semaphore;
rtems_id Task_id[ MAX_TASKS ];
rtems_name Task_name[ MAX_TASKS ];
rtems_task Locker_task(
rtems_task_argument unused
)
{
rtems_id tid;
uint32_t task_index;
rtems_status_code status;
status = rtems_task_ident( RTEMS_SELF, RTEMS_SEARCH_ALL_NODES, &tid );
directive_failed( status, "rtems_task_ident" );
task_index = task_number( tid ) - 1;
status = rtems_semaphore_obtain( Semaphore, RTEMS_DEFAULT_OPTIONS, 0 );
directive_failed( status, "rtems_semaphore_obtain" );
put_name( Task_name[ task_index ], FALSE );
puts( " - unblocked - OK" );
(void) rtems_task_delete( RTEMS_SELF );
}
void do_test(
rtems_attribute attr,
bool extract /* TRUE if extract, not release */
)
{
rtems_status_code status;
int i;
status = rtems_semaphore_create(
rtems_build_name( 'S', 'E', 'M', '0' ), /* name = SEM0 */
0, /* unlocked */
RTEMS_BINARY_SEMAPHORE | attr, /* mutex w/desired discipline */
0, /* IGNORED */
&Semaphore
);
directive_failed( status, "rtems_semaphore_create" );
for (i=0 ; i< MAX_TASKS ; i++ ) {
Task_name[ i ] = rtems_build_name(
'T',
'A',
'0' + (char)(i/10),
'0' + (char)(i%10)
);
status = rtems_task_create(
Task_name[ i ],
Priorities[ i ],
RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES,
&Task_id[ i ]
);
directive_failed( status, "rtems_task_create" );
status = rtems_task_start(
Task_id[ i ], Locker_task, (rtems_task_argument)i );
directive_failed( status, "rtems_task_start" );
status = rtems_task_wake_after( 10 );
directive_failed( status, "rtems_task_wake_after" );
}
for (i=0 ; i< MAX_TASKS ; i++ ) {
if ( extract == FALSE ) {
status = rtems_semaphore_release( Semaphore );
directive_failed( status, "rtems_semaphore_release" );
status = rtems_task_wake_after( 100 );
directive_failed( status, "rtems_task_wake_after" );
} else {
status = rtems_task_delete( Task_id[ i ] );
directive_failed( status, "rtems_task_delete" );
}
}
/* one extra release for the initial state */
status = rtems_semaphore_release( Semaphore );
directive_failed( status, "rtems_semaphore_release" );
/* now delete the semaphore since no one is waiting and it is unlocked */
status = rtems_semaphore_delete( Semaphore );
directive_failed( status, "rtems_semaphore_delete" );
}
rtems_task Init(
rtems_task_argument argument
)
{
TEST_BEGIN();
if (RTEMS_MAXIMUM_PRIORITY == 255)
Priorities = Priorities_High;
else if (RTEMS_MAXIMUM_PRIORITY == 15)
Priorities = Priorities_Low;
else {
puts( "Test only supports 256 or 16 configured priority levels" );
rtems_test_exit( 0 );
}
if ( sizeof(Priorities_Low) / sizeof(rtems_task_priority) != MAX_TASKS ) {
puts( "Priorities_Low table does not have right number of entries" );
rtems_test_exit( 0 );
}
if ( sizeof(Priorities_High) / sizeof(rtems_task_priority) != MAX_TASKS ) {
puts( "Priorities_High table does not have right number of entries" );
rtems_test_exit( 0 );
}
puts( "Exercising blocking discipline w/extract in FIFO order " );
do_test( RTEMS_FIFO, TRUE );
puts( "Exercising blocking discipline w/unblock in FIFO order" );
do_test( RTEMS_FIFO, FALSE );
rtems_test_pause_and_screen_number( 2 );
puts( "Exercising blocking discipline w/extract in priority order " );
do_test( RTEMS_PRIORITY, TRUE );
puts( "Exercising blocking discipline w/unblock in priority order" );
do_test( RTEMS_PRIORITY, FALSE );
TEST_END();
rtems_test_exit(0);
}
/**************** START OF CONFIGURATION INFORMATION ****************/
#define CONFIGURE_INIT
#define CONFIGURE_APPLICATION_NEEDS_CONSOLE_DRIVER
#define CONFIGURE_APPLICATION_NEEDS_CLOCK_DRIVER
#define CONFIGURE_MAXIMUM_TASKS MAX_TASKS+1
#define CONFIGURE_MAXIMUM_SEMAPHORES 1
#define CONFIGURE_INITIAL_EXTENSIONS RTEMS_TEST_INITIAL_EXTENSION
#define CONFIGURE_RTEMS_INIT_TASKS_TABLE
#include <rtems/confdefs.h>
/**************** END OF CONFIGURATION INFORMATION ****************/
|
