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
292
293
294
295
296
297
298
299
300
301
302
303
304
305
|
-- CDB0A01.A
--
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- 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 GOVERNMENT 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.
--*
--
-- OBJECTIVE:
-- Check that a storage pool may be user_determined, and that storage
-- is allocated by calling Allocate.
--
-- Check that a storage.pool may be specified using 'Storage_Pool
-- and that S'Storage_Pool denotes the storage pool of the type S.
--
-- TEST DESCRIPTION:
-- The package System.Storage_Pools is exercised by two very similar
-- packages which define a tree type and exercise it in a simple manner.
-- One package uses a user defined pool. The other package uses a
-- storage pool assigned by the implementation; Storage_Size is
-- specified for this pool.
-- The dispatching procedures Allocate and Deallocate are tested as an
-- intentional side effect of the tree packages.
--
-- For completeness, the actions of the tree packages are checked for
-- correct operation.
--
-- TEST FILES:
-- The following files comprise this test:
--
-- FDB0A00.A (foundation code)
-- CDB0A01.A
--
--
-- CHANGE HISTORY:
-- 02 JUN 95 SAIC Initial version
-- 07 MAY 96 SAIC Removed ambiguity with CDB0A02
-- 13 FEB 97 PWB.CTA Corrected lexically ordered string literal
--!
---------------------------------------------------------------- CDB0A01_1
---------------------------------------------------------- FDB0A00.Pool1
package FDB0A00.Pool1 is
User_Pool : Stack_Heap( 5_000 );
end FDB0A00.Pool1;
---------------------------------------------------------- FDB0A00.Comparator
with System.Storage_Pools;
package FDB0A00.Comparator is
function "="( A,B : System.Storage_Pools.Root_Storage_Pool'Class )
return Boolean;
end FDB0A00.Comparator;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
with TCTouch;
package body FDB0A00.Comparator is
function "="( A,B : System.Storage_Pools.Root_Storage_Pool'Class )
return Boolean is
use type System.Address;
begin
return A'Address = B'Address;
end "=";
end FDB0A00.Comparator;
---------------------------------------------------------------- CDB0A01_2
with FDB0A00.Pool1;
package CDB0A01_2 is
type Cell;
type User_Pool_Tree is access Cell;
for User_Pool_Tree'Storage_Pool use FDB0A00.Pool1.User_Pool;
type Cell is record
Data : Character;
Left,Right : User_Pool_Tree;
end record;
procedure Insert( Item: Character; On_Tree : in out User_Pool_Tree );
procedure Traverse( The_Tree : User_Pool_Tree );
procedure Defoliate( The_Tree : in out User_Pool_Tree );
end CDB0A01_2;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
with TCTouch;
with Unchecked_Deallocation;
package body CDB0A01_2 is
procedure Deallocate is new Unchecked_Deallocation(Cell,User_Pool_Tree);
-- Sort: zeros on the left, ones on the right...
procedure Insert( Item: Character; On_Tree : in out User_Pool_Tree ) is
begin
if On_Tree = null then
On_Tree := new Cell'(Item,null,null);
elsif Item > On_Tree.Data then
Insert(Item,On_Tree.Right);
else
Insert(Item,On_Tree.Left);
end if;
end Insert;
procedure Traverse( The_Tree : User_Pool_Tree ) is
begin
if The_Tree = null then
null; -- how very symmetrical
else
Traverse(The_Tree.Left);
TCTouch.Touch(The_Tree.Data);
Traverse(The_Tree.Right);
end if;
end Traverse;
procedure Defoliate( The_Tree : in out User_Pool_Tree ) is
begin
if The_Tree.Left /= null then
Defoliate(The_Tree.Left);
end if;
if The_Tree.Right /= null then
Defoliate(The_Tree.Right);
end if;
Deallocate(The_Tree);
end Defoliate;
end CDB0A01_2;
---------------------------------------------------------------- CDB0A01_3
with FDB0A00.Pool1;
package CDB0A01_3 is
type Cell;
type System_Pool_Tree is access Cell;
for System_Pool_Tree'Storage_Size use 2000;
-- assumptions: Cell is <= 20 storage_units
-- Tree building exercise requires O(15) cells
-- 2000 > 20 * 15 by a generous margin
type Cell is record
Data: Character;
Left,Right : System_Pool_Tree;
end record;
procedure Insert( Item: Character; On_Tree : in out System_Pool_Tree );
procedure Traverse( The_Tree : System_Pool_Tree );
procedure Defoliate( The_Tree : in out System_Pool_Tree );
end CDB0A01_3;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
with TCTouch;
with Unchecked_Deallocation;
package body CDB0A01_3 is
procedure Deallocate is new Unchecked_Deallocation(Cell,System_Pool_Tree);
-- Sort: zeros on the left, ones on the right...
procedure Insert( Item: Character; On_Tree : in out System_Pool_Tree ) is
begin
if On_Tree = null then
On_Tree := new Cell'(Item,null,null);
elsif Item > On_Tree.Data then
Insert(Item,On_Tree.Right);
else
Insert(Item,On_Tree.Left);
end if;
end Insert;
procedure Traverse( The_Tree : System_Pool_Tree ) is
begin
if The_Tree = null then
null; -- how very symmetrical
else
Traverse(The_Tree.Left);
TCTouch.Touch(The_Tree.Data);
Traverse(The_Tree.Right);
end if;
end Traverse;
procedure Defoliate( The_Tree : in out System_Pool_Tree ) is
begin
if The_Tree.Left /= null then
Defoliate(The_Tree.Left);
end if;
if The_Tree.Right /= null then
Defoliate(The_Tree.Right);
end if;
Deallocate(The_Tree);
end Defoliate;
end CDB0A01_3;
------------------------------------------------------------------ CDB0A01
with Report;
with TCTouch;
with FDB0A00.Comparator;
with FDB0A00.Pool1;
with CDB0A01_2;
with CDB0A01_3;
procedure CDB0A01 is
Banyan : CDB0A01_2.User_Pool_Tree;
Torrey : CDB0A01_3.System_Pool_Tree;
use type CDB0A01_2.User_Pool_Tree;
use type CDB0A01_3.System_Pool_Tree;
Countess : constant String := "Ada Augusta Lovelace";
Cenosstu : constant String := " AALaaacdeeglostuuv";
Insertion : constant String := "AAAAAAAAAAAAAAAAAAAA";
Deallocation : constant String := "DDDDDDDDDDDDDDDDDDDD";
begin -- Main test procedure.
Report.Test ("CDB0A01", "Check that a storage pool may be " &
"user_determined, and that storage is " &
"allocated by calling Allocate. Check that " &
"a storage.pool may be specified using " &
"'Storage_Pool and that S'Storage_Pool denotes " &
"the storage pool of the type S" );
-- Check that S'Storage_Pool denotes the storage pool for the type S.
TCTouch.Assert(
FDB0A00.Comparator."="(FDB0A00.Pool1.User_Pool,
CDB0A01_2.User_Pool_Tree'Storage_Pool ),
"'Storage_Pool not correct for CDB0A01_2.User_Pool_Tree");
TCTouch.Assert_Not(
FDB0A00.Comparator."="(FDB0A00.Pool1.User_Pool,
CDB0A01_3.System_Pool_Tree'Storage_Pool ),
"'Storage_Pool not correct for CDB0A01_3.System_Pool_Tree");
-- Check that storage is allocated by calling Allocate.
for Count in Countess'Range loop
CDB0A01_2.Insert( Countess(Count), Banyan );
end loop;
TCTouch.Validate(Insertion, "Allocate calls via CDB0A01_2" );
for Count in Countess'Range loop
CDB0A01_3.Insert( Countess(Count), Torrey );
end loop;
TCTouch.Validate("", "Allocate calls via CDB0A01_3" );
CDB0A01_2.Traverse(Banyan);
TCTouch.Validate(Cenosstu, "Traversal of Banyan" );
CDB0A01_3.Traverse(Torrey);
TCTouch.Validate(Cenosstu, "Traversal of Torrey" );
CDB0A01_2.Defoliate(Banyan);
TCTouch.Validate(Deallocation, "Deforestation of Banyan" );
TCTouch.Assert(Banyan = null, "Banyan Deallocation result not null");
CDB0A01_3.Defoliate(Torrey);
TCTouch.Validate("", "Deforestation of Torrey" );
TCTouch.Assert(Torrey = null, "Torrey Deallocation result not null");
Report.Result;
end CDB0A01;
|