1------------------------------------------------------------------------------ 2-- -- 3-- GNAT COMPILER COMPONENTS -- 4-- -- 5-- A L L O C -- 6-- -- 7-- S p e c -- 8-- -- 9-- Copyright (C) 1992-2003 Free Software Foundation, Inc. -- 10-- -- 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 2, 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. See the GNU General Public License -- 17-- for more details. You should have received a copy of the GNU General -- 18-- Public License distributed with GNAT; see file COPYING. If not, write -- 19-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- 20-- MA 02111-1307, USA. -- 21-- -- 22-- As a special exception, if other files instantiate generics from this -- 23-- unit, or you link this unit with other files to produce an executable, -- 24-- this unit does not by itself cause the resulting executable to be -- 25-- covered by the GNU General Public License. This exception does not -- 26-- however invalidate any other reasons why the executable file might be -- 27-- covered by the GNU Public License. -- 28-- -- 29-- GNAT was originally developed by the GNAT team at New York University. -- 30-- Extensive contributions were provided by Ada Core Technologies Inc. -- 31-- -- 32------------------------------------------------------------------------------ 33 34-- This package contains definitions for initial sizes and growth increments 35-- for the various dynamic arrays used for principle compiler data strcutures. 36-- The indicated initial size is allocated for the start of each file, and 37-- the increment factor is a percentage used to increase the table size when 38-- it needs expanding (e.g. a value of 100 = 100% increase = double) 39 40-- Note: the initial values here are multiplied by Table_Factor, as set 41-- by the -gnatTnn switch. This variable is defined in Opt, as is the 42-- default value for the table factor. 43 44package Alloc is 45 46 -- The comment shows the unit in which the table is defined 47 48 All_Interp_Initial : constant := 1_000; -- Sem_Type 49 All_Interp_Increment : constant := 100; 50 51 Branches_Initial : constant := 1_000; -- Sem_Warn 52 Branches_Increment : constant := 100; 53 54 Conditionals_Initial : constant := 1_000; -- Sem_Warn 55 Conditionals_Increment : constant := 100; 56 57 Conditional_Stack_Initial : constant := 50; -- Sem_Warn 58 Conditional_Stack_Increment : constant := 100; 59 60 Elists_Initial : constant := 200; -- Elists 61 Elists_Increment : constant := 100; 62 63 Elmts_Initial : constant := 1_200; -- Elists 64 Elmts_Increment : constant := 100; 65 66 Entity_Suppress_Initial : constant := 100; -- Sem 67 Entity_Suppress_Increment : constant := 200; 68 69 Inlined_Bodies_Initial : constant := 50; -- Inline 70 Inlined_Bodies_Increment : constant := 200; 71 72 Inlined_Initial : constant := 100; -- Inline 73 Inlined_Increment : constant := 100; 74 75 Interp_Map_Initial : constant := 200; -- Sem_Type 76 Interp_Map_Increment : constant := 100; 77 78 Lines_Initial : constant := 500; -- Sinput 79 Lines_Increment : constant := 150; 80 81 Linker_Option_Lines_Initial : constant := 5; -- Lib 82 Linker_Option_Lines_Increment : constant := 200; 83 84 Lists_Initial : constant := 4_000; -- Nlists 85 Lists_Increment : constant := 200; 86 87 Load_Stack_Initial : constant := 10; -- Lib 88 Load_Stack_Increment : constant := 100; 89 90 Name_Chars_Initial : constant := 50_000; -- Namet 91 Name_Chars_Increment : constant := 100; 92 93 Name_Qualify_Units_Initial : constant := 200; -- Exp_Dbug 94 Name_Qualify_Units_Increment : constant := 300; 95 96 Names_Initial : constant := 6_000; -- Namet 97 Names_Increment : constant := 100; 98 99 Nodes_Initial : constant := 50_000; -- Atree 100 Nodes_Increment : constant := 100; 101 102 Orig_Nodes_Initial : constant := 50_000; -- Atree 103 Orig_Nodes_Increment : constant := 100; 104 105 Pending_Instantiations_Initial : constant := 10; -- Inline 106 Pending_Instantiations_Increment : constant := 100; 107 108 Rep_Table_Initial : constant := 1000; -- Repinfo 109 Rep_Table_Increment : constant := 200; 110 111 Scope_Stack_Initial : constant := 10; -- Sem 112 Scope_Stack_Increment : constant := 200; 113 114 SFN_Table_Initial : constant := 10; -- Fname 115 SFN_Table_Increment : constant := 200; 116 117 Source_File_Initial : constant := 10; -- Sinput 118 Source_File_Increment : constant := 200; 119 120 String_Chars_Initial : constant := 2_500; -- Stringt 121 String_Chars_Increment : constant := 150; 122 123 Strings_Initial : constant := 5_00; -- Stringt 124 Strings_Increment : constant := 150; 125 126 Successors_Initial : constant := 2_00; -- Inline 127 Successors_Increment : constant := 100; 128 129 Udigits_Initial : constant := 10_000; -- Uintp 130 Udigits_Increment : constant := 100; 131 132 Uints_Initial : constant := 5_000; -- Uintp 133 Uints_Increment : constant := 100; 134 135 Units_Initial : constant := 30; -- Lib 136 Units_Increment : constant := 100; 137 138 Ureals_Initial : constant := 200; -- Urealp 139 Ureals_Increment : constant := 100; 140 141 Unreferenced_Entities_Initial : constant := 1_000; -- Sem_Warn 142 Unreferenced_Entities_Increment : constant := 100; 143 144 With_List_Initial : constant := 10; -- Features 145 With_List_Increment : constant := 300; 146 147 Xrefs_Initial : constant := 5_000; -- Cross-refs 148 Xrefs_Increment : constant := 300; 149 150end Alloc; 151