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
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
|
-- CXAI034.A
--
-- Grant of Unlimited Rights
--
-- The Ada Conformity Assessment Authority (ACAA) holds unlimited
-- rights in the software and documentation contained herein. Unlimited
-- rights are the same as those granted by the U.S. Government for older
-- parts of the Ada Conformity Assessment Test Suite, and are defined
-- in DFAR 252.227-7013(a)(19). By making this public release, the ACAA
-- intends to confer upon all recipients unlimited rights equal to those
-- held by the ACAA. These rights include rights to use, duplicate,
-- release or disclose the released technical data and computer software
-- in whole or in part, in any manner and for any purpose whatsoever, and
-- to have or permit others to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE ACAA MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--
-- Notice
--
-- The ACAA has created and maintains the Ada Conformity Assessment Test
-- Suite for the purpose of conformity assessments conducted in accordance
-- with the International Standard ISO/IEC 18009 - Ada: Conformity
-- assessment of a language processor. This test suite should not be used
-- to make claims of conformance unless used in accordance with
-- ISO/IEC 18009 and any applicable ACAA procedures.
--*
-- OBJECTIVE:
-- Check that an implementation supports the functionality defined
-- in package Ada.Containers.Bounded_Synchronized_Queues.
--
-- TEST DESCRIPTION:
-- This test verifies that an implementation supports the subprograms
-- contained in package Ada.Containers.Bounded_Synchronized_Queues.
-- Each of the subprograms is exercised in a general sense, to ensure that
-- it is available, and that it provides the expected results in a known
-- test environment.
-- Firstly functions Current_Use and Peak_Use are called to check the
-- initial conditions.
-- Procedure Enqueue is called a number of times, each time followed by a
-- call of function Current_Use to check that the number of items queued
-- has grown as expected.
-- Procedure Dequeue is then called a number of times, each time followed
-- by a check that the item dequeued matched the item enqueued and a
-- call of function Current_Use to check that the number of items queued
-- has shrunk as expected.
-- Lastly functions Current_Use and Peak_Use are called again to check the
-- closing conditions.
--
-- CHANGE HISTORY:
-- 8 May 13 JAC Initial pre-release version.
-- 10 Jul 13 JAC Second pre-release version.
-- 4 Apr 14 RLB Renamed test to create ACATS 4.0 version.
--!
with Ada.Containers.Bounded_Synchronized_Queues;
with Ada.Containers.Synchronized_Queue_Interfaces;
with Impdef;
with Report;
procedure CXAI034 is
package My_Synchronized_Queue_Interfaces is new
Ada.Containers.Synchronized_Queue_Interfaces (Element_Type => Float);
No_Tests : constant := 10;
package My_Bounded_Synchronized_Queues is new
Ada.Containers.Bounded_Synchronized_Queues
(Queue_Interfaces => My_Synchronized_Queue_Interfaces,
Default_Capacity => No_Tests);
My_Queue_1 : My_Bounded_Synchronized_Queues.Queue;
My_Queue_2 : My_Bounded_Synchronized_Queues.Queue;
My_Queue_3 : My_Bounded_Synchronized_Queues.Queue;
subtype Array_Bounds_Type is Ada.Containers.Count_Type range 1 .. No_Tests;
Value_In_Array : constant array (Array_Bounds_Type) of Float :=
(1.2, 2.3, 3.4, 4.5, 5.6, 6.7, 7.8, 8.9, 9.0, 0.1);
Value_Out_Array : array (Array_Bounds_Type) of Float := (others => 0.0);
use type Ada.Containers.Count_Type;
Reader_1_Blocked : Boolean := False;
task Reader_1;
task body Reader_1 is
Value_Out : Float := 0.0;
begin
Reader_1_Blocked := True;
My_Queue_1.Dequeue (Element => Value_Out);
Reader_1_Blocked := False;
end Reader_1;
Writer_3_Blocked : Boolean := False;
task Writer_3;
task body Writer_3 is
Value_In : constant Float := 1.2;
begin
for I in Array_Bounds_Type loop
My_Queue_3.Enqueue (New_Item => Value_In);
end loop;
Writer_3_Blocked := True;
My_Queue_3.Enqueue (New_Item => Value_In);
Writer_3_Blocked := False;
end Writer_3;
begin
Report.Test
("CXAI034",
"Check that an implementation supports the functionality defined in " &
"package Ada.Containers.Bounded_Synchronized_Queues");
-- Check blocking of reader.
-- Give time for Reader_1 to activate.
delay Impdef.Switch_To_New_Task;
if not Reader_1_Blocked then
Report.Failed ("Dequeue of empty queue didn't block");
end if;
-- Check unblocking of reader by writer.
declare
task Writer_1;
task body Writer_1 is
Value_In : constant Float := 1.2;
begin
My_Queue_1.Enqueue (New_Item => Value_In);
end Writer_1;
begin
-- Give time for Writer_1 to activate;
delay Impdef.Switch_To_New_Task;
if Reader_1_Blocked then
Report.Failed ("Enqueue to empty queue didn't unblock reader");
end if;
end;
-- Check blocking of writer.
-- Give time for Writer_3 to activate.
delay Impdef.Switch_To_New_Task;
if not Writer_3_Blocked then
Report.Failed ("Enqueue to full queue didn't block");
end if;
-- Check unblocking of writer by reader.
declare
task Reader_3;
task body Reader_3 is
Value_Out : Float := 0.0;
begin
My_Queue_3.Dequeue (Element => Value_Out);
end Reader_3;
begin
-- Give time for Reader_3 to activate;
delay Impdef.Switch_To_New_Task;
if Writer_3_Blocked then
Report.Failed ("Dequeue of full queue didn't unblock writer");
end if;
end;
-- Check that the same values come out as went in, and in the same order.
if My_Queue_2.Current_Use /= 0 then
Report.Failed ("Wrong initial Current_Use");
end if;
if My_Queue_2.Peak_Use /= 0 then
Report.Failed ("Wrong initial Peak_Use");
end if;
for I in Array_Bounds_Type loop
My_Queue_2.Enqueue
(New_Item => Value_In_Array (I));
if My_Queue_2.Current_Use /= I then
Report.Failed ("Wrong Current_Use when enqueuing");
end if;
end loop;
for I in Array_Bounds_Type loop
My_Queue_2.Dequeue
(Element => Value_Out_Array (I));
if Value_Out_Array (I) /= Value_In_Array (I) then
Report.Failed ("Mismatch between dequeued and what was enqueued");
end if;
if My_Queue_2.Current_Use /= No_Tests - I then
Report.Failed ("Wrong Current_Use when dequeuing");
end if;
end loop;
if My_Queue_2.Current_Use /= 0 then
Report.Failed ("Wrong final Current_Use");
end if;
if My_Queue_2.Peak_Use /= No_Tests then
Report.Failed ("Wrong final Peak_Use");
end if;
Report.Result;
end CXAI034;
|
