diff options
| author | Bob Duff <duff@adacore.com> | 2017-04-27 13:43:49 +0000 |
|---|---|---|
| committer | Arnaud Charlet <charlet@gcc.gnu.org> | 2017-04-27 15:43:49 +0200 |
| commit | a2168462958f03ca5b060ad49e217a3e262750d0 (patch) | |
| tree | 9bc9c64f1c0dab1d83d0e57fd7a8eb3a7fdab89b /gcc/ada/nlists.adb | |
| parent | f8a36447dbdf5baafe85f953c261ec35f149dfb7 (diff) | |
| download | gcc-a2168462958f03ca5b060ad49e217a3e262750d0.zip gcc-a2168462958f03ca5b060ad49e217a3e262750d0.tar.gz gcc-a2168462958f03ca5b060ad49e217a3e262750d0.tar.bz2 | |
sinput.adb: Minor code cleanup.
2017-04-27 Bob Duff <duff@adacore.com>
* sinput.adb: Minor code cleanup.
* namet.adb (Append): Create faster versions of
Append(String) and Append(Name_Id) by using slice assignment
instead of loops.
* sem_util.adb (In_Instance): Speed this up by removing
unnecessary tests; Is_Generic_Instance is defined for all
entities.
* sem_util.ads, sem_util.adb (In_Parameter_Specification):
Remove unused function.
* alloc.ads (Nodes_Initial): Use a much larger value, because
the compiler was spending a lot of time copying the nodes table
when it grows. This number was chosen in 1996, so is rather out
of date with current memory sizes. Anyway, it's virtual memory.
Get rid of Orig_Nodes_...; use Node_... instead.
* atree.adb (Lock): Do not release the Nodes tables; it's a
waste of time.
Orig_Nodes_ ==> Nodes_
* nlists.adb: Orig_Nodes_ ==> Nodes_
* g-table.adb: Remove unused "with" clause.
* g-table.ads, table.ads: Remove Big_Table_Type, which should
not be used by clients.
* g-dyntab.adb (Last_Allocated): New function
to encapsulate T.P.Last_Allocated, which I'm thinking of changing.
From-SVN: r247335
Diffstat (limited to 'gcc/ada/nlists.adb')
| -rw-r--r-- | gcc/ada/nlists.adb | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/ada/nlists.adb b/gcc/ada/nlists.adb index 7050c3e..0f111d8 100644 --- a/gcc/ada/nlists.adb +++ b/gcc/ada/nlists.adb @@ -92,17 +92,17 @@ package body Nlists is Table_Component_Type => Node_Or_Entity_Id, Table_Index_Type => Node_Or_Entity_Id'Base, Table_Low_Bound => First_Node_Id, - Table_Initial => Alloc.Orig_Nodes_Initial, - Table_Increment => Alloc.Orig_Nodes_Increment, - Release_Threshold => Alloc.Orig_Nodes_Release_Threshold, + Table_Initial => Alloc.Nodes_Initial, + Table_Increment => Alloc.Nodes_Increment, + Release_Threshold => Alloc.Nodes_Release_Threshold, Table_Name => "Next_Node"); package Prev_Node is new Table.Table ( Table_Component_Type => Node_Or_Entity_Id, Table_Index_Type => Node_Or_Entity_Id'Base, Table_Low_Bound => First_Node_Id, - Table_Initial => Alloc.Orig_Nodes_Initial, - Table_Increment => Alloc.Orig_Nodes_Increment, + Table_Initial => Alloc.Nodes_Initial, + Table_Increment => Alloc.Nodes_Increment, Table_Name => "Prev_Node"); ----------------------- |