1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. --
18 -- As a special exception under Section 7 of GPL version 3, you are granted --
19 -- additional permissions described in the GCC Runtime Library Exception, --
20 -- version 3.1, as published by the Free Software Foundation. --
22 -- You should have received a copy of the GNU General Public License and --
23 -- a copy of the GCC Runtime Library Exception along with this program; --
24 -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
25 -- <http://www.gnu.org/licenses/>. --
27 -- GNAT was originally developed by the GNAT team at New York University. --
28 -- Extensive contributions were provided by Ada Core Technologies Inc. --
30 ------------------------------------------------------------------------------
32 with Debug; use Debug;
34 with Output; use Output;
35 with System; use System;
36 with Tree_IO; use Tree_IO;
38 with System.Memory; use System.Memory;
40 with Unchecked_Conversion;
42 pragma Elaborate_All (Output);
47 Min : constant Int := Int (Table_Low_Bound);
48 -- Subscript of the minimum entry in the currently allocated table
51 -- Number of entries in currently allocated table. The value of zero
52 -- ensures that we initially allocate the table.
54 -----------------------
55 -- Local Subprograms --
56 -----------------------
59 -- Reallocate the existing table according to the current value stored
60 -- in Max. Works correctly to do an initial allocation if the table
63 function Tree_Get_Table_Address return Address;
64 -- Return Null_Address if the table length is zero,
65 -- Table (First)'Address if not.
67 pragma Warnings (Off);
68 -- Turn off warnings. The following unchecked conversions are only used
69 -- internally in this package, and cannot never result in any instances
70 -- of improperly aliased pointers for the client of the package.
72 function To_Address is new Unchecked_Conversion (Table_Ptr, Address);
73 function To_Pointer is new Unchecked_Conversion (Address, Table_Ptr);
81 procedure Append (New_Val : Table_Component_Type) is
83 Set_Item (Table_Index_Type (Last_Val + 1), New_Val);
90 procedure Append_All (New_Vals : Table_Type) is
92 for J in New_Vals'Range loop
93 Append (New_Vals (J));
101 procedure Decrement_Last is
103 Last_Val := Last_Val - 1;
112 Free (To_Address (Table));
121 procedure Increment_Last is
123 Last_Val := Last_Val + 1;
125 if Last_Val > Max then
135 Old_Length : constant Int := Length;
140 Max := Min + (Table_Initial * Table_Factor) - 1;
141 Length := Max - Min + 1;
143 -- If table is same size as before (happens when table is never
144 -- expanded which is a common case), then simply reuse it. Note
145 -- that this also means that an explicit Init call right after
146 -- the implicit one in the package body is harmless.
148 if Old_Length = Length then
151 -- Otherwise we can use Reallocate to get a table of the right size.
152 -- Note that Reallocate works fine to allocate a table of the right
153 -- initial size when it is first allocated.
164 function Last return Table_Index_Type is
166 return Table_Index_Type (Last_Val);
173 procedure Reallocate is
174 New_Size : Memory.size_t;
175 New_Length : Long_Long_Integer;
178 if Max < Last_Val then
179 pragma Assert (not Locked);
181 -- Make sure that we have at least the initial allocation. This
182 -- is needed in cases where a zero length table is written out.
184 Length := Int'Max (Length, Table_Initial);
186 -- Now increment table length until it is sufficiently large. Use
187 -- the increment value or 10, which ever is larger (the reason
188 -- for the use of 10 here is to ensure that the table does really
189 -- increase in size (which would not be the case for a table of
190 -- length 10 increased by 3% for instance). Do the intermediate
191 -- calculation in Long_Long_Integer to avoid overflow.
193 while Max < Last_Val loop
195 Long_Long_Integer (Length) *
196 (100 + Long_Long_Integer (Table_Increment)) / 100;
197 Length := Int'Max (Int (New_Length), Length + 10);
198 Max := Min + Length - 1;
202 Write_Str ("--> Allocating new ");
203 Write_Str (Table_Name);
204 Write_Str (" table, size = ");
205 Write_Int (Max - Min + 1);
211 Memory.size_t ((Max - Min + 1) *
212 (Table_Type'Component_Size / Storage_Unit));
215 Table := To_Pointer (Alloc (New_Size));
217 elsif New_Size > 0 then
219 To_Pointer (Realloc (Ptr => To_Address (Table),
223 if Length /= 0 and then Table = null then
225 Write_Str ("available memory exhausted");
228 raise Unrecoverable_Error;
239 Length := Last_Val - Int (Table_Low_Bound) + 1;
248 procedure Restore (T : Saved_Table) is
250 Free (To_Address (Table));
251 Last_Val := T.Last_Val;
254 Length := Max - Min + 1;
261 function Save return Saved_Table is
265 Res.Last_Val := Last_Val;
280 (Index : Table_Index_Type;
281 Item : Table_Component_Type)
283 -- If Item is a value within the current allocation, and we are going
284 -- to reallocate, then we must preserve an intermediate copy here
285 -- before calling Increment_Last. Otherwise, if Table_Component_Type
286 -- is passed by reference, we are going to end up copying from
287 -- storage that might have been deallocated from Increment_Last
288 -- calling Reallocate.
290 subtype Allocated_Table_T is
291 Table_Type (Table'First .. Table_Index_Type (Max + 1));
292 -- A constrained table subtype one element larger than the currently
295 Allocated_Table_Address : constant System.Address :=
297 -- Used for address clause below (we can't use non-static expression
298 -- Table.all'Address directly in the clause because some older
299 -- versions of the compiler do not allow it).
301 Allocated_Table : Allocated_Table_T;
302 pragma Import (Ada, Allocated_Table);
303 pragma Suppress (Range_Check, On => Allocated_Table);
304 for Allocated_Table'Address use Allocated_Table_Address;
305 -- Allocated_Table represents the currently allocated array, plus one
306 -- element (the supplementary element is used to have a convenient
307 -- way of computing the address just past the end of the current
308 -- allocation). Range checks are suppressed because this unit
309 -- uses direct calls to System.Memory for allocation, and this can
310 -- yield misaligned storage (and we cannot rely on the bootstrap
311 -- compiler supporting specifically disabling alignment checks, so we
312 -- need to suppress all range checks). It is safe to suppress this
313 -- check here because we know that a (possibly misaligned) object
314 -- of that type does actually exist at that address.
315 -- ??? We should really improve the allocation circuitry here to
316 -- guarantee proper alignment.
318 Need_Realloc : constant Boolean := Int (Index) > Max;
319 -- True if this operation requires storage reallocation (which may
320 -- involve moving table contents around).
323 -- If we're going to reallocate, check whether Item references an
324 -- element of the currently allocated table.
327 and then Allocated_Table'Address <= Item'Address
328 and then Item'Address <
329 Allocated_Table (Table_Index_Type (Max + 1))'Address
331 -- If so, save a copy on the stack because Increment_Last will
332 -- reallocate storage and might deallocate the current table.
335 Item_Copy : constant Table_Component_Type := Item;
338 Table (Index) := Item_Copy;
342 -- Here we know that either we won't reallocate (case of Index <
343 -- Max) or that Item is not in the currently allocated table.
345 if Int (Index) > Last_Val then
349 Table (Index) := Item;
357 procedure Set_Last (New_Val : Table_Index_Type) is
359 if Int (New_Val) < Last_Val then
360 Last_Val := Int (New_Val);
363 Last_Val := Int (New_Val);
365 if Last_Val > Max then
371 ----------------------------
372 -- Tree_Get_Table_Address --
373 ----------------------------
375 function Tree_Get_Table_Address return Address is
380 return Table (First)'Address;
382 end Tree_Get_Table_Address;
388 -- Note: we allocate only the space required to accommodate the data
389 -- actually written, which means that a Tree_Write/Tree_Read sequence
390 -- does an implicit Release.
392 procedure Tree_Read is
396 Length := Max - Min + 1;
400 (Tree_Get_Table_Address,
401 (Last_Val - Int (First) + 1) *
403 -- Note the importance of parenthesizing the following division
404 -- to avoid the possibility of intermediate overflow.
406 (Table_Type'Component_Size / Storage_Unit));
413 -- Note: we write out only the currently valid data, not the entire
414 -- contents of the allocated array. See note above on Tree_Read.
416 procedure Tree_Write is
418 Tree_Write_Int (Int (Last));
420 (Tree_Get_Table_Address,
421 (Last_Val - Int (First) + 1) *
422 (Table_Type'Component_Size / Storage_Unit));