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
|
/* SPDX-License-Identifier: BSD-2-Clause */
/* Init
*
* This routine is the initialization task for this test program.
* It is called from init_exec and has the responsibility for creating
* and starting the tasks that make up the test. If the time of day
* clock is required for the test, it should also be set to a known
* value by this function.
*
* Input parameters: NONE
*
* Output parameters: NONE
*
* COPYRIGHT (c) 1989-1997.
* On-Line Applications Research Corporation (OAR).
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include <inttypes.h>
#include <stdio.h>
#include <stdlib.h>
#include "system.h"
#include "tmacros.h"
void test3()
{
rtems_status_code result;
uint32_t remove_task;
uint32_t block;
uint32_t task_count = 0;
char c1 = 'a';
char c2 = 'a';
char c3 = '0';
char c4 = '0';
printf( "\n TEST3 : free more than 3 x allocation size, but not the same block,\n"
" then free a block\n");
/*
* Check the value of the allocation unit
*/
if (TASK_ALLOCATION_SIZE < 4)
{
printf( " FAIL3 : task allocation size must be greater than 4.\n");
exit( 1 );
}
/*
* Allocate as many tasks as possible.
*/
while (task_count < MAX_TASKS)
{
rtems_name name;
printf(" TEST3 : creating task '%c%c%c%c', ", c1, c2, c3, c4);
name = rtems_build_name(c1, c2, c3, c4);
result = rtems_task_create(name,
10,
RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_ATTRIBUTES,
RTEMS_LOCAL,
&task_id[task_count]);
if (status_code_bad(result))
break;
printf("number = %3" PRIi32 ", id = %08" PRIxrtems_id ", starting, ", task_count, task_id[task_count]);
fflush(stdout);
result = rtems_task_start(task_id[task_count],
test_task,
(rtems_task_argument) task_count);
if (status_code_bad(result))
break;
/*
* Update the name.
*/
NEXT_TASK_NAME(c1, c2, c3, c4);
task_count++;
}
/*
* Take out 3 tasks from each block of allocated tasks. Do this for
* allocation size number of blocks.
*/
if (task_count < (TASK_ALLOCATION_SIZE * 11))
{
printf( " FAIL3 : not enough tasks created -\n"
" task created = %" PRIi32 ", required number = %i\n",
task_count, (TASK_ALLOCATION_SIZE * 11));
exit( 1 );
}
for (block = 0; block < TASK_ALLOCATION_SIZE; block++)
{
for (remove_task = ((block * TASK_ALLOCATION_SIZE) - TASK_INDEX_OFFSET);
remove_task < (((block * TASK_ALLOCATION_SIZE) + 3) - TASK_INDEX_OFFSET);
remove_task++)
{
if (!task_id[remove_task])
{
printf( " FAIL3 : remove task has a 0 id -\n"
" task number = %" PRIi32 "\n",
remove_task);
exit( 1 );
}
printf(" TEST3 : remove, signal task %08" PRIxrtems_id ", ", task_id[remove_task]);
rtems_event_send(task_id[remove_task], 1);
task_id[remove_task] = 0;
}
}
/*
* Remove a complete block, not the first, forces a scan of the blocks in the
* allocator's free routine
*/
for (remove_task = (TASK_ALLOCATION_SIZE - TASK_INDEX_OFFSET);
remove_task < ((TASK_ALLOCATION_SIZE * 2) - - TASK_INDEX_OFFSET);
remove_task++)
{
if (task_id[remove_task])
{
printf(" TEST3 : remove, signal task %08" PRIxrtems_id ", ", task_id[remove_task]);
rtems_event_send(task_id[remove_task], 1);
task_id[remove_task] = 0;
}
}
destroy_all_tasks("TEST3");
printf( " TEST3 : completed\n" );
}
|
