URL
https://opencores.org/ocsvn/scarts/scarts/trunk
Subversion Repositories scarts
[/] [scarts/] [trunk/] [toolchain/] [scarts-gcc/] [gcc-4.1.1/] [gcc/] [ada/] [atree.adb] - Rev 12
Compare with Previous | Blame | View Log
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- A T R E E -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2005, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ pragma Style_Checks (All_Checks); -- Turn off subprogram ordering check for this package -- WARNING: There is a C version of this package. Any changes to this source -- file must be properly reflected in the C header a-atree.h (for inlined -- bodies) and the C file a-atree.c (for remaining non-inlined bodies). with Debug; use Debug; with Namet; use Namet; with Nlists; use Nlists; with Elists; use Elists; with Output; use Output; with Sinput; use Sinput; with Tree_IO; use Tree_IO; with GNAT.HTable; use GNAT.HTable; package body Atree is Node_Count : Nat; -- Count allocated nodes for Num_Nodes function use Unchecked_Access; -- We are allowed to see these from within our own body! use Atree_Private_Part; -- We are also allowed to see our private data structures! function E_To_N is new Unchecked_Conversion (Entity_Kind, Node_Kind); function N_To_E is new Unchecked_Conversion (Node_Kind, Entity_Kind); -- Functions used to store Entity_Kind value in Nkind field -- The following declarations are used to store flags 65-72 in the -- Nkind field of the third component of an extended (entity) node. type Flag_Byte is record Flag65 : Boolean; Flag66 : Boolean; Flag67 : Boolean; Flag68 : Boolean; Flag69 : Boolean; Flag70 : Boolean; Flag71 : Boolean; Flag72 : Boolean; end record; pragma Pack (Flag_Byte); for Flag_Byte'Size use 8; type Flag_Byte_Ptr is access all Flag_Byte; type Node_Kind_Ptr is access all Node_Kind; function To_Flag_Byte is new Unchecked_Conversion (Node_Kind, Flag_Byte); function To_Flag_Byte_Ptr is new Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte_Ptr); -- The following declarations are used to store flags 73-96 and the -- Convention field in the Field12 field of the third component of an -- extended (Entity) node. type Flag_Word is record Flag73 : Boolean; Flag74 : Boolean; Flag75 : Boolean; Flag76 : Boolean; Flag77 : Boolean; Flag78 : Boolean; Flag79 : Boolean; Flag80 : Boolean; Flag81 : Boolean; Flag82 : Boolean; Flag83 : Boolean; Flag84 : Boolean; Flag85 : Boolean; Flag86 : Boolean; Flag87 : Boolean; Flag88 : Boolean; Flag89 : Boolean; Flag90 : Boolean; Flag91 : Boolean; Flag92 : Boolean; Flag93 : Boolean; Flag94 : Boolean; Flag95 : Boolean; Flag96 : Boolean; Convention : Convention_Id; end record; pragma Pack (Flag_Word); for Flag_Word'Size use 32; for Flag_Word'Alignment use 4; type Flag_Word_Ptr is access all Flag_Word; type Union_Id_Ptr is access all Union_Id; function To_Flag_Word is new Unchecked_Conversion (Union_Id, Flag_Word); function To_Flag_Word_Ptr is new Unchecked_Conversion (Union_Id_Ptr, Flag_Word_Ptr); -- The following declarations are used to store flags 97-128 in the -- Field12 field of the fourth component of an extended (entity) node. type Flag_Word2 is record Flag97 : Boolean; Flag98 : Boolean; Flag99 : Boolean; Flag100 : Boolean; Flag101 : Boolean; Flag102 : Boolean; Flag103 : Boolean; Flag104 : Boolean; Flag105 : Boolean; Flag106 : Boolean; Flag107 : Boolean; Flag108 : Boolean; Flag109 : Boolean; Flag110 : Boolean; Flag111 : Boolean; Flag112 : Boolean; Flag113 : Boolean; Flag114 : Boolean; Flag115 : Boolean; Flag116 : Boolean; Flag117 : Boolean; Flag118 : Boolean; Flag119 : Boolean; Flag120 : Boolean; Flag121 : Boolean; Flag122 : Boolean; Flag123 : Boolean; Flag124 : Boolean; Flag125 : Boolean; Flag126 : Boolean; Flag127 : Boolean; Flag128 : Boolean; end record; pragma Pack (Flag_Word2); for Flag_Word2'Size use 32; for Flag_Word2'Alignment use 4; type Flag_Word2_Ptr is access all Flag_Word2; function To_Flag_Word2 is new Unchecked_Conversion (Union_Id, Flag_Word2); function To_Flag_Word2_Ptr is new Unchecked_Conversion (Union_Id_Ptr, Flag_Word2_Ptr); -- The following declarations are used to store flags 152-183 in the -- Field11 field of the fourth component of an extended (entity) node. type Flag_Word3 is record Flag152 : Boolean; Flag153 : Boolean; Flag154 : Boolean; Flag155 : Boolean; Flag156 : Boolean; Flag157 : Boolean; Flag158 : Boolean; Flag159 : Boolean; Flag160 : Boolean; Flag161 : Boolean; Flag162 : Boolean; Flag163 : Boolean; Flag164 : Boolean; Flag165 : Boolean; Flag166 : Boolean; Flag167 : Boolean; Flag168 : Boolean; Flag169 : Boolean; Flag170 : Boolean; Flag171 : Boolean; Flag172 : Boolean; Flag173 : Boolean; Flag174 : Boolean; Flag175 : Boolean; Flag176 : Boolean; Flag177 : Boolean; Flag178 : Boolean; Flag179 : Boolean; Flag180 : Boolean; Flag181 : Boolean; Flag182 : Boolean; Flag183 : Boolean; end record; pragma Pack (Flag_Word3); for Flag_Word3'Size use 32; for Flag_Word3'Alignment use 4; type Flag_Word3_Ptr is access all Flag_Word3; function To_Flag_Word3 is new Unchecked_Conversion (Union_Id, Flag_Word3); function To_Flag_Word3_Ptr is new Unchecked_Conversion (Union_Id_Ptr, Flag_Word3_Ptr); -- The following declarations are used to store flags 184-215 in the -- Field11 field of the fifth component of an extended (entity) node. type Flag_Word4 is record Flag184 : Boolean; Flag185 : Boolean; Flag186 : Boolean; Flag187 : Boolean; Flag188 : Boolean; Flag189 : Boolean; Flag190 : Boolean; Flag191 : Boolean; Flag192 : Boolean; Flag193 : Boolean; Flag194 : Boolean; Flag195 : Boolean; Flag196 : Boolean; Flag197 : Boolean; Flag198 : Boolean; Flag199 : Boolean; Flag200 : Boolean; Flag201 : Boolean; Flag202 : Boolean; Flag203 : Boolean; Flag204 : Boolean; Flag205 : Boolean; Flag206 : Boolean; Flag207 : Boolean; Flag208 : Boolean; Flag209 : Boolean; Flag210 : Boolean; Flag211 : Boolean; Flag212 : Boolean; Flag213 : Boolean; Flag214 : Boolean; Flag215 : Boolean; end record; pragma Pack (Flag_Word4); for Flag_Word4'Size use 32; for Flag_Word4'Alignment use 4; type Flag_Word4_Ptr is access all Flag_Word4; function To_Flag_Word4 is new Unchecked_Conversion (Union_Id, Flag_Word4); function To_Flag_Word4_Ptr is new Unchecked_Conversion (Union_Id_Ptr, Flag_Word4_Ptr); -- Default value used to initialize default nodes. Note that some of the -- fields get overwritten, and in particular, Nkind always gets reset. Default_Node : Node_Record := ( Is_Extension => False, Pflag1 => False, Pflag2 => False, In_List => False, Unused_1 => False, Rewrite_Ins => False, Analyzed => False, Comes_From_Source => False, -- modified by Set_Comes_From_Source_Default Error_Posted => False, Flag4 => False, Flag5 => False, Flag6 => False, Flag7 => False, Flag8 => False, Flag9 => False, Flag10 => False, Flag11 => False, Flag12 => False, Flag13 => False, Flag14 => False, Flag15 => False, Flag16 => False, Flag17 => False, Flag18 => False, Nkind => N_Unused_At_Start, Sloc => No_Location, Link => Empty_List_Or_Node, Field1 => Empty_List_Or_Node, Field2 => Empty_List_Or_Node, Field3 => Empty_List_Or_Node, Field4 => Empty_List_Or_Node, Field5 => Empty_List_Or_Node); -- Default value used to initialize node extensions (i.e. the second -- and third and fourth components of an extended node). Note we are -- cheating a bit here when it comes to Node12, which really holds -- flags an (for the third component), the convention. But it works -- because Empty, False, Convention_Ada, all happen to be all zero bits. Default_Node_Extension : constant Node_Record := ( Is_Extension => True, Pflag1 => False, Pflag2 => False, In_List => False, Unused_1 => False, Rewrite_Ins => False, Analyzed => False, Comes_From_Source => False, Error_Posted => False, Flag4 => False, Flag5 => False, Flag6 => False, Flag7 => False, Flag8 => False, Flag9 => False, Flag10 => False, Flag11 => False, Flag12 => False, Flag13 => False, Flag14 => False, Flag15 => False, Flag16 => False, Flag17 => False, Flag18 => False, Nkind => E_To_N (E_Void), Field6 => Empty_List_Or_Node, Field7 => Empty_List_Or_Node, Field8 => Empty_List_Or_Node, Field9 => Empty_List_Or_Node, Field10 => Empty_List_Or_Node, Field11 => Empty_List_Or_Node, Field12 => Empty_List_Or_Node); -------------------------------------------------- -- Implementation of Tree Substitution Routines -- -------------------------------------------------- -- A separate table keeps track of the mapping between rewritten nodes -- and their corresponding original tree nodes. Rewrite makes an entry -- in this table for use by Original_Node. By default, if no call is -- Rewrite, the entry in this table points to the original unwritten node. -- Note: eventually, this should be a field in the Node directly, but -- for now we do not want to disturb the efficiency of a power of 2 -- for the node size package Orig_Nodes is new Table.Table ( Table_Component_Type => Node_Id, Table_Index_Type => Node_Id, Table_Low_Bound => First_Node_Id, Table_Initial => Alloc.Orig_Nodes_Initial, Table_Increment => Alloc.Orig_Nodes_Increment, Table_Name => "Orig_Nodes"); ---------------------------------------- -- Global_Variables for New_Copy_Tree -- ---------------------------------------- -- These global variables are used by New_Copy_Tree. See description -- of the body of this subprogram for details. Global variables can be -- safely used by New_Copy_Tree, since there is no case of a recursive -- call from the processing inside New_Copy_Tree. NCT_Hash_Threshhold : constant := 20; -- If there are more than this number of pairs of entries in the -- map, then Hash_Tables_Used will be set, and the hash tables will -- be initialized and used for the searches. NCT_Hash_Tables_Used : Boolean := False; -- Set to True if hash tables are in use NCT_Table_Entries : Nat; -- Count entries in table to see if threshhold is reached NCT_Hash_Table_Setup : Boolean := False; -- Set to True if hash table contains data. We set this True if we -- setup the hash table with data, and leave it set permanently -- from then on, this is a signal that second and subsequent users -- of the hash table must clear the old entries before reuse. subtype NCT_Header_Num is Int range 0 .. 511; -- Defines range of headers in hash tables (512 headers) ----------------------- -- Local Subprograms -- ----------------------- procedure Fix_Parents (Old_Node, New_Node : Node_Id); -- Fixup parent pointers for the syntactic children of New_Node after -- a copy, setting them to New_Node when they pointed to Old_Node. function Allocate_Initialize_Node (Src : Node_Id; With_Extension : Boolean) return Node_Id; -- Allocate a new node or node extension. If Src is not empty, -- the information for the newly-allocated node is copied from it. ------------------------------ -- Allocate_Initialize_Node -- ------------------------------ function Allocate_Initialize_Node (Src : Node_Id; With_Extension : Boolean) return Node_Id is New_Id : Node_Id := Src; Nod : Node_Record := Default_Node; Ext1 : Node_Record := Default_Node_Extension; Ext2 : Node_Record := Default_Node_Extension; Ext3 : Node_Record := Default_Node_Extension; Ext4 : Node_Record := Default_Node_Extension; begin if Present (Src) then Nod := Nodes.Table (Src); if Has_Extension (Src) then Ext1 := Nodes.Table (Src + 1); Ext2 := Nodes.Table (Src + 2); Ext3 := Nodes.Table (Src + 3); Ext4 := Nodes.Table (Src + 4); end if; end if; if not (Present (Src) and then not Has_Extension (Src) and then With_Extension and then Src = Nodes.Last) then -- We are allocating a new node, or extending a node -- other than Nodes.Last. Nodes.Append (Nod); New_Id := Nodes.Last; Orig_Nodes.Append (New_Id); Node_Count := Node_Count + 1; end if; if With_Extension then Nodes.Append (Ext1); Nodes.Append (Ext2); Nodes.Append (Ext3); Nodes.Append (Ext4); end if; Orig_Nodes.Set_Last (Nodes.Last); Allocate_List_Tables (Nodes.Last); return New_Id; end Allocate_Initialize_Node; -------------- -- Analyzed -- -------------- function Analyzed (N : Node_Id) return Boolean is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Analyzed; end Analyzed; ----------------- -- Change_Node -- ----------------- procedure Change_Node (N : Node_Id; New_Node_Kind : Node_Kind) is Save_Sloc : constant Source_Ptr := Sloc (N); Save_In_List : constant Boolean := Nodes.Table (N).In_List; Save_Link : constant Union_Id := Nodes.Table (N).Link; Save_CFS : constant Boolean := Nodes.Table (N).Comes_From_Source; Save_Posted : constant Boolean := Nodes.Table (N).Error_Posted; Par_Count : Paren_Count_Type := 0; begin if Nkind (N) in N_Subexpr then Par_Count := Paren_Count (N); end if; Nodes.Table (N) := Default_Node; Nodes.Table (N).Sloc := Save_Sloc; Nodes.Table (N).In_List := Save_In_List; Nodes.Table (N).Link := Save_Link; Nodes.Table (N).Comes_From_Source := Save_CFS; Nodes.Table (N).Nkind := New_Node_Kind; Nodes.Table (N).Error_Posted := Save_Posted; if New_Node_Kind in N_Subexpr then Set_Paren_Count (N, Par_Count); end if; end Change_Node; ----------------------- -- Comes_From_Source -- ----------------------- function Comes_From_Source (N : Node_Id) return Boolean is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Comes_From_Source; end Comes_From_Source; ---------------- -- Convention -- ---------------- function Convention (E : Entity_Id) return Convention_Id is begin pragma Assert (Nkind (E) in N_Entity); return To_Flag_Word (Nodes.Table (E + 2).Field12).Convention; end Convention; --------------- -- Copy_Node -- --------------- procedure Copy_Node (Source : Node_Id; Destination : Node_Id) is Save_In_List : constant Boolean := Nodes.Table (Destination).In_List; Save_Link : constant Union_Id := Nodes.Table (Destination).Link; begin Nodes.Table (Destination) := Nodes.Table (Source); Nodes.Table (Destination).In_List := Save_In_List; Nodes.Table (Destination).Link := Save_Link; if Has_Extension (Source) then pragma Assert (Has_Extension (Destination)); Nodes.Table (Destination + 1) := Nodes.Table (Source + 1); Nodes.Table (Destination + 2) := Nodes.Table (Source + 2); Nodes.Table (Destination + 3) := Nodes.Table (Source + 3); Nodes.Table (Destination + 4) := Nodes.Table (Source + 4); else pragma Assert (not Has_Extension (Source)); null; end if; end Copy_Node; ------------------------ -- Copy_Separate_Tree -- ------------------------ function Copy_Separate_Tree (Source : Node_Id) return Node_Id is New_Id : Node_Id; function Copy_Entity (E : Entity_Id) return Entity_Id; -- Copy Entity, copying only the Ekind and Chars fields function Copy_List (List : List_Id) return List_Id; -- Copy list function Possible_Copy (Field : Union_Id) return Union_Id; -- Given a field, returns a copy of the node or list if its parent -- is the current source node, and otherwise returns the input ----------------- -- Copy_Entity -- ----------------- function Copy_Entity (E : Entity_Id) return Entity_Id is New_Ent : Entity_Id; begin case N_Entity (Nkind (E)) is when N_Defining_Identifier => New_Ent := New_Entity (N_Defining_Identifier, Sloc (E)); when N_Defining_Character_Literal => New_Ent := New_Entity (N_Defining_Character_Literal, Sloc (E)); when N_Defining_Operator_Symbol => New_Ent := New_Entity (N_Defining_Operator_Symbol, Sloc (E)); end case; Set_Chars (New_Ent, Chars (E)); return New_Ent; end Copy_Entity; --------------- -- Copy_List -- --------------- function Copy_List (List : List_Id) return List_Id is NL : List_Id; E : Node_Id; begin if List = No_List then return No_List; else NL := New_List; E := First (List); while Present (E) loop if Has_Extension (E) then Append (Copy_Entity (E), NL); else Append (Copy_Separate_Tree (E), NL); end if; Next (E); end loop; return NL; end if; end Copy_List; ------------------- -- Possible_Copy -- ------------------- function Possible_Copy (Field : Union_Id) return Union_Id is New_N : Union_Id; begin if Field in Node_Range then New_N := Union_Id (Copy_Separate_Tree (Node_Id (Field))); if Parent (Node_Id (Field)) = Source then Set_Parent (Node_Id (New_N), New_Id); end if; return New_N; elsif Field in List_Range then New_N := Union_Id (Copy_List (List_Id (Field))); if Parent (List_Id (Field)) = Source then Set_Parent (List_Id (New_N), New_Id); end if; return New_N; else return Field; end if; end Possible_Copy; -- Start of processing for Copy_Separate_Tree begin if Source <= Empty_Or_Error then return Source; elsif Has_Extension (Source) then return Copy_Entity (Source); else New_Id := New_Copy (Source); -- Recursively copy descendents Set_Field1 (New_Id, Possible_Copy (Field1 (New_Id))); Set_Field2 (New_Id, Possible_Copy (Field2 (New_Id))); Set_Field3 (New_Id, Possible_Copy (Field3 (New_Id))); Set_Field4 (New_Id, Possible_Copy (Field4 (New_Id))); Set_Field5 (New_Id, Possible_Copy (Field5 (New_Id))); -- Set Entity field to Empty -- Why is this done??? and why is it always right to do it??? if Nkind (New_Id) in N_Has_Entity or else Nkind (New_Id) = N_Freeze_Entity then Set_Entity (New_Id, Empty); end if; -- All done, return copied node return New_Id; end if; end Copy_Separate_Tree; ----------------- -- Delete_Node -- ----------------- procedure Delete_Node (Node : Node_Id) is begin pragma Assert (not Nodes.Table (Node).In_List); if Debug_Flag_N then Write_Str ("Delete node "); Write_Int (Int (Node)); Write_Eol; end if; Nodes.Table (Node) := Default_Node; Nodes.Table (Node).Nkind := N_Unused_At_Start; Node_Count := Node_Count - 1; -- Note: for now, we are not bothering to reuse deleted nodes end Delete_Node; ----------------- -- Delete_Tree -- ----------------- procedure Delete_Tree (Node : Node_Id) is procedure Delete_Field (F : Union_Id); -- Delete item pointed to by field F if it is a syntactic element procedure Delete_List (L : List_Id); -- Delete all elements on the given list ------------------ -- Delete_Field -- ------------------ procedure Delete_Field (F : Union_Id) is begin if F = Union_Id (Empty) then return; elsif F in Node_Range and then Parent (Node_Id (F)) = Node then Delete_Tree (Node_Id (F)); elsif F in List_Range and then Parent (List_Id (F)) = Node then Delete_List (List_Id (F)); -- No need to test Elist case, there are no syntactic Elists else return; end if; end Delete_Field; ----------------- -- Delete_List -- ----------------- procedure Delete_List (L : List_Id) is begin while Is_Non_Empty_List (L) loop Delete_Tree (Remove_Head (L)); end loop; end Delete_List; -- Start of processing for Delete_Tree begin -- Delete descendents Delete_Field (Field1 (Node)); Delete_Field (Field2 (Node)); Delete_Field (Field3 (Node)); Delete_Field (Field4 (Node)); Delete_Field (Field5 (Node)); end Delete_Tree; ----------- -- Ekind -- ----------- function Ekind (E : Entity_Id) return Entity_Kind is begin pragma Assert (Nkind (E) in N_Entity); return N_To_E (Nodes.Table (E + 1).Nkind); end Ekind; ------------------ -- Error_Posted -- ------------------ function Error_Posted (N : Node_Id) return Boolean is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Error_Posted; end Error_Posted; ----------------------- -- Exchange_Entities -- ----------------------- procedure Exchange_Entities (E1 : Entity_Id; E2 : Entity_Id) is Temp_Ent : Node_Record; begin pragma Assert (Has_Extension (E1) and then Has_Extension (E2) and then not Nodes.Table (E1).In_List and then not Nodes.Table (E2).In_List); -- Exchange the contents of the two entities Temp_Ent := Nodes.Table (E1); Nodes.Table (E1) := Nodes.Table (E2); Nodes.Table (E2) := Temp_Ent; Temp_Ent := Nodes.Table (E1 + 1); Nodes.Table (E1 + 1) := Nodes.Table (E2 + 1); Nodes.Table (E2 + 1) := Temp_Ent; Temp_Ent := Nodes.Table (E1 + 2); Nodes.Table (E1 + 2) := Nodes.Table (E2 + 2); Nodes.Table (E2 + 2) := Temp_Ent; Temp_Ent := Nodes.Table (E1 + 3); Nodes.Table (E1 + 3) := Nodes.Table (E2 + 3); Nodes.Table (E2 + 3) := Temp_Ent; Temp_Ent := Nodes.Table (E1 + 4); Nodes.Table (E1 + 4) := Nodes.Table (E2 + 4); Nodes.Table (E2 + 4) := Temp_Ent; -- That exchange exchanged the parent pointers as well, which is what -- we want, but we need to patch up the defining identifier pointers -- in the parent nodes (the child pointers) to match this switch -- unless for Implicit types entities which have no parent, in which -- case we don't do anything otherwise we won't be able to revert back -- to the original situation. -- Shouldn't this use Is_Itype instead of the Parent test if Present (Parent (E1)) and then Present (Parent (E2)) then Set_Defining_Identifier (Parent (E1), E1); Set_Defining_Identifier (Parent (E2), E2); end if; end Exchange_Entities; ----------------- -- Extend_Node -- ----------------- function Extend_Node (Node : Node_Id) return Entity_Id is Result : Entity_Id; procedure Debug_Extend_Node; pragma Inline (Debug_Extend_Node); -- Debug routine for debug flag N ----------------------- -- Debug_Extend_Node -- ----------------------- procedure Debug_Extend_Node is begin if Debug_Flag_N then Write_Str ("Extend node "); Write_Int (Int (Node)); if Result = Node then Write_Str (" in place"); else Write_Str (" copied to "); Write_Int (Int (Result)); end if; -- Write_Eol; end if; end Debug_Extend_Node; -- Start of processing for Extend_Node begin pragma Assert (not (Has_Extension (Node))); Result := Allocate_Initialize_Node (Node, With_Extension => True); pragma Debug (Debug_Extend_Node); return Result; end Extend_Node; ----------------- -- Fix_Parents -- ----------------- procedure Fix_Parents (Old_Node, New_Node : Node_Id) is procedure Fix_Parent (Field : Union_Id; Old_Node, New_Node : Node_Id); -- Fixup one parent pointer. Field is checked to see if it -- points to a node, list, or element list that has a parent that -- points to Old_Node. If so, the parent is reset to point to New_Node. ---------------- -- Fix_Parent -- ---------------- procedure Fix_Parent (Field : Union_Id; Old_Node, New_Node : Node_Id) is begin -- Fix parent of node that is referenced by Field. Note that we must -- exclude the case where the node is a member of a list, because in -- this case the parent is the parent of the list. if Field in Node_Range and then Present (Node_Id (Field)) and then not Nodes.Table (Node_Id (Field)).In_List and then Parent (Node_Id (Field)) = Old_Node then Set_Parent (Node_Id (Field), New_Node); -- Fix parent of list that is referenced by Field elsif Field in List_Range and then Present (List_Id (Field)) and then Parent (List_Id (Field)) = Old_Node then Set_Parent (List_Id (Field), New_Node); end if; end Fix_Parent; -- Start of processing for Fix_Parents begin Fix_Parent (Field1 (New_Node), Old_Node, New_Node); Fix_Parent (Field2 (New_Node), Old_Node, New_Node); Fix_Parent (Field3 (New_Node), Old_Node, New_Node); Fix_Parent (Field4 (New_Node), Old_Node, New_Node); Fix_Parent (Field5 (New_Node), Old_Node, New_Node); end Fix_Parents; ----------------------------------- -- Get_Comes_From_Source_Default -- ----------------------------------- function Get_Comes_From_Source_Default return Boolean is begin return Default_Node.Comes_From_Source; end Get_Comes_From_Source_Default; ------------------- -- Has_Extension -- ------------------- function Has_Extension (N : Node_Id) return Boolean is begin return N < Nodes.Last and then Nodes.Table (N + 1).Is_Extension; end Has_Extension; ---------------- -- Initialize -- ---------------- procedure Initialize is Dummy : Node_Id; pragma Warnings (Off, Dummy); begin Node_Count := 0; Atree_Private_Part.Nodes.Init; Orig_Nodes.Init; -- Allocate Empty node Dummy := New_Node (N_Empty, No_Location); Set_Name1 (Empty, No_Name); -- Allocate Error node, and set Error_Posted, since we certainly -- only generate an Error node if we do post some kind of error! Dummy := New_Node (N_Error, No_Location); Set_Name1 (Error, Error_Name); Set_Error_Posted (Error, True); -- Set global variables for New_Copy_Tree NCT_Hash_Tables_Used := False; NCT_Table_Entries := 0; NCT_Hash_Table_Setup := False; end Initialize; -------------------------- -- Is_Rewrite_Insertion -- -------------------------- function Is_Rewrite_Insertion (Node : Node_Id) return Boolean is begin return Nodes.Table (Node).Rewrite_Ins; end Is_Rewrite_Insertion; ----------------------------- -- Is_Rewrite_Substitution -- ----------------------------- function Is_Rewrite_Substitution (Node : Node_Id) return Boolean is begin return Orig_Nodes.Table (Node) /= Node; end Is_Rewrite_Substitution; ------------------ -- Last_Node_Id -- ------------------ function Last_Node_Id return Node_Id is begin return Nodes.Last; end Last_Node_Id; ---------- -- Lock -- ---------- procedure Lock is begin Nodes.Locked := True; Orig_Nodes.Locked := True; Nodes.Release; Orig_Nodes.Release; end Lock; ---------------------------- -- Mark_Rewrite_Insertion -- ---------------------------- procedure Mark_Rewrite_Insertion (New_Node : Node_Id) is begin Nodes.Table (New_Node).Rewrite_Ins := True; end Mark_Rewrite_Insertion; -------------- -- New_Copy -- -------------- function New_Copy (Source : Node_Id) return Node_Id is New_Id : Node_Id := Source; begin if Source > Empty_Or_Error then New_Id := Allocate_Initialize_Node (Source, Has_Extension (Source)); Nodes.Table (New_Id).Link := Empty_List_Or_Node; Nodes.Table (New_Id).In_List := False; -- If the original is marked as a rewrite insertion, then unmark -- the copy, since we inserted the original, not the copy. Nodes.Table (New_Id).Rewrite_Ins := False; end if; return New_Id; end New_Copy; ------------------- -- New_Copy_Tree -- ------------------- -- Our approach here requires a two pass traversal of the tree. The -- first pass visits all nodes that eventually will be copied looking -- for defining Itypes. If any defining Itypes are found, then they are -- copied, and an entry is added to the replacement map. In the second -- phase, the tree is copied, using the replacement map to replace any -- Itype references within the copied tree. -- The following hash tables are used if the Map supplied has more -- than hash threshhold entries to speed up access to the map. If -- there are fewer entries, then the map is searched sequentially -- (because setting up a hash table for only a few entries takes -- more time than it saves. function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num; -- Hash function used for hash operations ------------------- -- New_Copy_Hash -- ------------------- function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num is begin return Nat (E) mod (NCT_Header_Num'Last + 1); end New_Copy_Hash; --------------- -- NCT_Assoc -- --------------- -- The hash table NCT_Assoc associates old entities in the table -- with their corresponding new entities (i.e. the pairs of entries -- presented in the original Map argument are Key-Element pairs). package NCT_Assoc is new Simple_HTable ( Header_Num => NCT_Header_Num, Element => Entity_Id, No_Element => Empty, Key => Entity_Id, Hash => New_Copy_Hash, Equal => Types."="); --------------------- -- NCT_Itype_Assoc -- --------------------- -- The hash table NCT_Itype_Assoc contains entries only for those -- old nodes which have a non-empty Associated_Node_For_Itype set. -- The key is the associated node, and the element is the new node -- itself (NOT the associated node for the new node). package NCT_Itype_Assoc is new Simple_HTable ( Header_Num => NCT_Header_Num, Element => Entity_Id, No_Element => Empty, Key => Entity_Id, Hash => New_Copy_Hash, Equal => Types."="); -- Start of processing for New_Copy_Tree function function New_Copy_Tree (Source : Node_Id; Map : Elist_Id := No_Elist; New_Sloc : Source_Ptr := No_Location; New_Scope : Entity_Id := Empty) return Node_Id is Actual_Map : Elist_Id := Map; -- This is the actual map for the copy. It is initialized with the -- given elements, and then enlarged as required for Itypes that are -- copied during the first phase of the copy operation. The visit -- procedures add elements to this map as Itypes are encountered. -- The reason we cannot use Map directly, is that it may well be -- (and normally is) initialized to No_Elist, and if we have mapped -- entities, we have to reset it to point to a real Elist. function Assoc (N : Node_Or_Entity_Id) return Node_Id; -- Called during second phase to map entities into their corresponding -- copies using Actual_Map. If the argument is not an entity, or is not -- in Actual_Map, then it is returned unchanged. procedure Build_NCT_Hash_Tables; -- Builds hash tables (number of elements >= threshold value) function Copy_Elist_With_Replacement (Old_Elist : Elist_Id) return Elist_Id; -- Called during second phase to copy element list doing replacements procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id); -- Called during the second phase to process a copied Itype. The actual -- copy happened during the first phase (so that we could make the entry -- in the mapping), but we still have to deal with the descendents of -- the copied Itype and copy them where necessary. function Copy_List_With_Replacement (Old_List : List_Id) return List_Id; -- Called during second phase to copy list doing replacements function Copy_Node_With_Replacement (Old_Node : Node_Id) return Node_Id; -- Called during second phase to copy node doing replacements procedure Visit_Elist (E : Elist_Id); -- Called during first phase to visit all elements of an Elist procedure Visit_Field (F : Union_Id; N : Node_Id); -- Visit a single field, recursing to call Visit_Node or Visit_List -- if the field is a syntactic descendent of the current node (i.e. -- its parent is Node N). procedure Visit_Itype (Old_Itype : Entity_Id); -- Called during first phase to visit subsidiary fields of a defining -- Itype, and also create a copy and make an entry in the replacement -- map for the new copy. procedure Visit_List (L : List_Id); -- Called during first phase to visit all elements of a List procedure Visit_Node (N : Node_Or_Entity_Id); -- Called during first phase to visit a node and all its subtrees ----------- -- Assoc -- ----------- function Assoc (N : Node_Or_Entity_Id) return Node_Id is E : Elmt_Id; Ent : Entity_Id; begin if not Has_Extension (N) or else No (Actual_Map) then return N; elsif NCT_Hash_Tables_Used then Ent := NCT_Assoc.Get (Entity_Id (N)); if Present (Ent) then return Ent; else return N; end if; -- No hash table used, do serial search else E := First_Elmt (Actual_Map); while Present (E) loop if Node (E) = N then return Node (Next_Elmt (E)); else E := Next_Elmt (Next_Elmt (E)); end if; end loop; end if; return N; end Assoc; --------------------------- -- Build_NCT_Hash_Tables -- --------------------------- procedure Build_NCT_Hash_Tables is Elmt : Elmt_Id; Ent : Entity_Id; begin if NCT_Hash_Table_Setup then NCT_Assoc.Reset; NCT_Itype_Assoc.Reset; end if; Elmt := First_Elmt (Actual_Map); while Present (Elmt) loop Ent := Node (Elmt); Next_Elmt (Elmt); NCT_Assoc.Set (Ent, Node (Elmt)); Next_Elmt (Elmt); if Is_Type (Ent) then declare Anode : constant Entity_Id := Associated_Node_For_Itype (Ent); begin if Present (Anode) then NCT_Itype_Assoc.Set (Anode, Node (Elmt)); end if; end; end if; end loop; NCT_Hash_Tables_Used := True; NCT_Hash_Table_Setup := True; end Build_NCT_Hash_Tables; --------------------------------- -- Copy_Elist_With_Replacement -- --------------------------------- function Copy_Elist_With_Replacement (Old_Elist : Elist_Id) return Elist_Id is M : Elmt_Id; New_Elist : Elist_Id; begin if No (Old_Elist) then return No_Elist; else New_Elist := New_Elmt_List; M := First_Elmt (Old_Elist); while Present (M) loop Append_Elmt (Copy_Node_With_Replacement (Node (M)), New_Elist); Next_Elmt (M); end loop; end if; return New_Elist; end Copy_Elist_With_Replacement; --------------------------------- -- Copy_Itype_With_Replacement -- --------------------------------- -- This routine exactly parallels its phase one analog Visit_Itype, -- and like that routine, knows far too many semantic details about -- the descendents of Itypes and whether they need copying or not. procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id) is begin -- Translate Next_Entity, Scope and Etype fields, in case they -- reference entities that have been mapped into copies. Set_Next_Entity (New_Itype, Assoc (Next_Entity (New_Itype))); Set_Etype (New_Itype, Assoc (Etype (New_Itype))); if Present (New_Scope) then Set_Scope (New_Itype, New_Scope); else Set_Scope (New_Itype, Assoc (Scope (New_Itype))); end if; -- Copy referenced fields if Is_Discrete_Type (New_Itype) then Set_Scalar_Range (New_Itype, Copy_Node_With_Replacement (Scalar_Range (New_Itype))); elsif Has_Discriminants (Base_Type (New_Itype)) then Set_Discriminant_Constraint (New_Itype, Copy_Elist_With_Replacement (Discriminant_Constraint (New_Itype))); elsif Is_Array_Type (New_Itype) then if Present (First_Index (New_Itype)) then Set_First_Index (New_Itype, First (Copy_List_With_Replacement (List_Containing (First_Index (New_Itype))))); end if; if Is_Packed (New_Itype) then Set_Packed_Array_Type (New_Itype, Copy_Node_With_Replacement (Packed_Array_Type (New_Itype))); end if; end if; end Copy_Itype_With_Replacement; -------------------------------- -- Copy_List_With_Replacement -- -------------------------------- function Copy_List_With_Replacement (Old_List : List_Id) return List_Id is New_List : List_Id; E : Node_Id; begin if Old_List = No_List then return No_List; else New_List := Empty_List; E := First (Old_List); while Present (E) loop Append (Copy_Node_With_Replacement (E), New_List); Next (E); end loop; return New_List; end if; end Copy_List_With_Replacement; -------------------------------- -- Copy_Node_With_Replacement -- -------------------------------- function Copy_Node_With_Replacement (Old_Node : Node_Id) return Node_Id is New_Node : Node_Id; function Copy_Field_With_Replacement (Field : Union_Id) return Union_Id; -- Given Field, which is a field of Old_Node, return a copy of it -- if it is a syntactic field (i.e. its parent is Node), setting -- the parent of the copy to poit to New_Node. Otherwise returns -- the field (possibly mapped if it is an entity). --------------------------------- -- Copy_Field_With_Replacement -- --------------------------------- function Copy_Field_With_Replacement (Field : Union_Id) return Union_Id is begin if Field = Union_Id (Empty) then return Field; elsif Field in Node_Range then declare Old_N : constant Node_Id := Node_Id (Field); New_N : Node_Id; begin -- If syntactic field, as indicated by the parent pointer -- being set, then copy the referenced node recursively. if Parent (Old_N) = Old_Node then New_N := Copy_Node_With_Replacement (Old_N); if New_N /= Old_N then Set_Parent (New_N, New_Node); end if; -- For semantic fields, update possible entity reference -- from the replacement map. else New_N := Assoc (Old_N); end if; return Union_Id (New_N); end; elsif Field in List_Range then declare Old_L : constant List_Id := List_Id (Field); New_L : List_Id; begin -- If syntactic field, as indicated by the parent pointer, -- then recursively copy the entire referenced list. if Parent (Old_L) = Old_Node then New_L := Copy_List_With_Replacement (Old_L); Set_Parent (New_L, New_Node); -- For semantic list, just returned unchanged else New_L := Old_L; end if; return Union_Id (New_L); end; -- Anything other than a list or a node is returned unchanged else return Field; end if; end Copy_Field_With_Replacement; -- Start of processing for Copy_Node_With_Replacement begin if Old_Node <= Empty_Or_Error then return Old_Node; elsif Has_Extension (Old_Node) then return Assoc (Old_Node); else New_Node := New_Copy (Old_Node); -- If the node we are copying is the associated node of a -- previously copied Itype, then adjust the associated node -- of the copy of that Itype accordingly. if Present (Actual_Map) then declare E : Elmt_Id; Ent : Entity_Id; begin -- Case of hash table used if NCT_Hash_Tables_Used then Ent := NCT_Itype_Assoc.Get (Old_Node); if Present (Ent) then Set_Associated_Node_For_Itype (Ent, New_Node); end if; -- Case of no hash table used else E := First_Elmt (Actual_Map); while Present (E) loop if Is_Itype (Node (E)) and then Old_Node = Associated_Node_For_Itype (Node (E)) then Set_Associated_Node_For_Itype (Node (Next_Elmt (E)), New_Node); end if; E := Next_Elmt (Next_Elmt (E)); end loop; end if; end; end if; -- Recursively copy descendents Set_Field1 (New_Node, Copy_Field_With_Replacement (Field1 (New_Node))); Set_Field2 (New_Node, Copy_Field_With_Replacement (Field2 (New_Node))); Set_Field3 (New_Node, Copy_Field_With_Replacement (Field3 (New_Node))); Set_Field4 (New_Node, Copy_Field_With_Replacement (Field4 (New_Node))); Set_Field5 (New_Node, Copy_Field_With_Replacement (Field5 (New_Node))); -- Adjust Sloc of new node if necessary if New_Sloc /= No_Location then Set_Sloc (New_Node, New_Sloc); -- If we adjust the Sloc, then we are essentially making -- a completely new node, so the Comes_From_Source flag -- should be reset to the proper default value. Nodes.Table (New_Node).Comes_From_Source := Default_Node.Comes_From_Source; end if; -- Reset First_Real_Statement for Handled_Sequence_Of_Statements. -- The replacement mechanism applies to entities, and is not used -- here. Eventually we may need a more general graph-copying -- routine. For now, do a sequential search to find desired node. if Nkind (Old_Node) = N_Handled_Sequence_Of_Statements and then Present (First_Real_Statement (Old_Node)) then declare Old_F : constant Node_Id := First_Real_Statement (Old_Node); N1, N2 : Node_Id; begin N1 := First (Statements (Old_Node)); N2 := First (Statements (New_Node)); while N1 /= Old_F loop Next (N1); Next (N2); end loop; Set_First_Real_Statement (New_Node, N2); end; end if; end if; -- All done, return copied node return New_Node; end Copy_Node_With_Replacement; ----------------- -- Visit_Elist -- ----------------- procedure Visit_Elist (E : Elist_Id) is Elmt : Elmt_Id; begin if Present (E) then Elmt := First_Elmt (E); while Elmt /= No_Elmt loop Visit_Node (Node (Elmt)); Next_Elmt (Elmt); end loop; end if; end Visit_Elist; ----------------- -- Visit_Field -- ----------------- procedure Visit_Field (F : Union_Id; N : Node_Id) is begin if F = Union_Id (Empty) then return; elsif F in Node_Range then -- Copy node if it is syntactic, i.e. its parent pointer is -- set to point to the field that referenced it (certain -- Itypes will also meet this criterion, which is fine, since -- these are clearly Itypes that do need to be copied, since -- we are copying their parent.) if Parent (Node_Id (F)) = N then Visit_Node (Node_Id (F)); return; -- Another case, if we are pointing to an Itype, then we want -- to copy it if its associated node is somewhere in the tree -- being copied. -- Note: the exclusion of self-referential copies is just an -- optimization, since the search of the already copied list -- would catch it, but it is a common case (Etype pointing -- to itself for an Itype that is a base type). elsif Has_Extension (Node_Id (F)) and then Is_Itype (Entity_Id (F)) and then Node_Id (F) /= N then declare P : Node_Id; begin P := Associated_Node_For_Itype (Node_Id (F)); while Present (P) loop if P = Source then Visit_Node (Node_Id (F)); return; else P := Parent (P); end if; end loop; -- An Itype whose parent is not being copied definitely -- should NOT be copied, since it does not belong in any -- sense to the copied subtree. return; end; end if; elsif F in List_Range and then Parent (List_Id (F)) = N then Visit_List (List_Id (F)); return; end if; end Visit_Field; ----------------- -- Visit_Itype -- ----------------- -- Note: we are relying on far too much semantic knowledge in this -- routine, it really should just do a blind replacement of all -- fields, or at least a more blind replacement. For example, we -- do not deal with corresponding record types, and that works -- because we have no Itypes of task types, but nowhere is there -- a guarantee that this will always be the case. ??? procedure Visit_Itype (Old_Itype : Entity_Id) is New_Itype : Entity_Id; E : Elmt_Id; Ent : Entity_Id; begin -- Itypes that describe the designated type of access to subprograms -- have the structure of subprogram declarations, with signatures, -- etc. Either we duplicate the signatures completely, or choose to -- share such itypes, which is fine because their elaboration will -- have no side effects. In any case, this is additional semantic -- information that seems awkward to have in atree. if Ekind (Old_Itype) = E_Subprogram_Type then return; end if; New_Itype := New_Copy (Old_Itype); -- The new Itype has all the attributes of the old one, and -- we just copy the contents of the entity. However, the back-end -- needs different names for debugging purposes, so we create a -- new internal name by appending the letter 'c' (copy) to the -- name of the original. Get_Name_String (Chars (Old_Itype)); Add_Char_To_Name_Buffer ('c'); Set_Chars (New_Itype, Name_Enter); -- If our associated node is an entity that has already been copied, -- then set the associated node of the copy to point to the right -- copy. If we have copied an Itype that is itself the associated -- node of some previously copied Itype, then we set the right -- pointer in the other direction. if Present (Actual_Map) then -- Case of hash tables used if NCT_Hash_Tables_Used then Ent := NCT_Assoc.Get (Associated_Node_For_Itype (Old_Itype)); if Present (Ent) then Set_Associated_Node_For_Itype (New_Itype, Ent); end if; Ent := NCT_Itype_Assoc.Get (Old_Itype); if Present (Ent) then Set_Associated_Node_For_Itype (Ent, New_Itype); end if; -- Case of hash tables not used else E := First_Elmt (Actual_Map); while Present (E) loop if Associated_Node_For_Itype (Old_Itype) = Node (E) then Set_Associated_Node_For_Itype (New_Itype, Node (Next_Elmt (E))); end if; if Is_Type (Node (E)) and then Old_Itype = Associated_Node_For_Itype (Node (E)) then Set_Associated_Node_For_Itype (Node (Next_Elmt (E)), New_Itype); end if; E := Next_Elmt (Next_Elmt (E)); end loop; end if; end if; if Present (Freeze_Node (New_Itype)) then Set_Is_Frozen (New_Itype, False); Set_Freeze_Node (New_Itype, Empty); end if; -- Add new association to map if No (Actual_Map) then Actual_Map := New_Elmt_List; end if; Append_Elmt (Old_Itype, Actual_Map); Append_Elmt (New_Itype, Actual_Map); if NCT_Hash_Tables_Used then NCT_Assoc.Set (Old_Itype, New_Itype); else NCT_Table_Entries := NCT_Table_Entries + 1; if NCT_Table_Entries > NCT_Hash_Threshhold then Build_NCT_Hash_Tables; end if; end if; -- If a record subtype is simply copied, the entity list will be -- shared. Thus cloned_Subtype must be set to indicate the sharing. if Ekind (Old_Itype) = E_Record_Subtype or else Ekind (Old_Itype) = E_Class_Wide_Subtype then Set_Cloned_Subtype (New_Itype, Old_Itype); end if; -- Visit descendents that eventually get copied Visit_Field (Union_Id (Etype (Old_Itype)), Old_Itype); if Is_Discrete_Type (Old_Itype) then Visit_Field (Union_Id (Scalar_Range (Old_Itype)), Old_Itype); elsif Has_Discriminants (Base_Type (Old_Itype)) then -- ??? This should involve call to Visit_Field Visit_Elist (Discriminant_Constraint (Old_Itype)); elsif Is_Array_Type (Old_Itype) then if Present (First_Index (Old_Itype)) then Visit_Field (Union_Id (List_Containing (First_Index (Old_Itype))), Old_Itype); end if; if Is_Packed (Old_Itype) then Visit_Field (Union_Id (Packed_Array_Type (Old_Itype)), Old_Itype); end if; end if; end Visit_Itype; ---------------- -- Visit_List -- ---------------- procedure Visit_List (L : List_Id) is N : Node_Id; begin if L /= No_List then N := First (L); while Present (N) loop Visit_Node (N); Next (N); end loop; end if; end Visit_List; ---------------- -- Visit_Node -- ---------------- procedure Visit_Node (N : Node_Or_Entity_Id) is -- Start of processing for Visit_Node begin -- Handle case of an Itype, which must be copied if Has_Extension (N) and then Is_Itype (N) then -- Nothing to do if already in the list. This can happen with an -- Itype entity that appears more than once in the tree. -- Note that we do not want to visit descendents in this case. -- Test for already in list when hash table is used if NCT_Hash_Tables_Used then if Present (NCT_Assoc.Get (Entity_Id (N))) then return; end if; -- Test for already in list when hash table not used else declare E : Elmt_Id; begin if Present (Actual_Map) then E := First_Elmt (Actual_Map); while Present (E) loop if Node (E) = N then return; else E := Next_Elmt (Next_Elmt (E)); end if; end loop; end if; end; end if; Visit_Itype (N); end if; -- Visit descendents Visit_Field (Field1 (N), N); Visit_Field (Field2 (N), N); Visit_Field (Field3 (N), N); Visit_Field (Field4 (N), N); Visit_Field (Field5 (N), N); end Visit_Node; -- Start of processing for New_Copy_Tree begin Actual_Map := Map; -- See if we should use hash table if No (Actual_Map) then NCT_Hash_Tables_Used := False; else declare Elmt : Elmt_Id; begin NCT_Table_Entries := 0; Elmt := First_Elmt (Actual_Map); while Present (Elmt) loop NCT_Table_Entries := NCT_Table_Entries + 1; Next_Elmt (Elmt); Next_Elmt (Elmt); end loop; if NCT_Table_Entries > NCT_Hash_Threshhold then Build_NCT_Hash_Tables; else NCT_Hash_Tables_Used := False; end if; end; end if; -- Hash table set up if required, now start phase one by visiting -- top node (we will recursively visit the descendents). Visit_Node (Source); -- Now the second phase of the copy can start. First we process -- all the mapped entities, copying their descendents. if Present (Actual_Map) then declare Elmt : Elmt_Id; New_Itype : Entity_Id; begin Elmt := First_Elmt (Actual_Map); while Present (Elmt) loop Next_Elmt (Elmt); New_Itype := Node (Elmt); Copy_Itype_With_Replacement (New_Itype); Next_Elmt (Elmt); end loop; end; end if; -- Now we can copy the actual tree return Copy_Node_With_Replacement (Source); end New_Copy_Tree; ---------------- -- New_Entity -- ---------------- function New_Entity (New_Node_Kind : Node_Kind; New_Sloc : Source_Ptr) return Entity_Id is Ent : Entity_Id; procedure New_Entity_Debugging_Output; pragma Inline (New_Entity_Debugging_Output); -- Debugging routine for debug flag N --------------------------------- -- New_Entity_Debugging_Output -- --------------------------------- procedure New_Entity_Debugging_Output is begin if Debug_Flag_N then Write_Str ("Allocate entity, Id = "); Write_Int (Int (Ent)); Write_Str (" "); Write_Location (New_Sloc); Write_Str (" "); Write_Str (Node_Kind'Image (New_Node_Kind)); Write_Eol; end if; end New_Entity_Debugging_Output; -- Start of processing for New_Entity begin pragma Assert (New_Node_Kind in N_Entity); Ent := Allocate_Initialize_Node (Empty, With_Extension => True); -- If this is a node with a real location and we are generating -- source nodes, then reset Current_Error_Node. This is useful -- if we bomb during parsing to get a error location for the bomb. if Default_Node.Comes_From_Source and then New_Sloc > No_Location then Current_Error_Node := Ent; end if; Nodes.Table (Ent).Nkind := New_Node_Kind; Nodes.Table (Ent).Sloc := New_Sloc; pragma Debug (New_Entity_Debugging_Output); return Ent; end New_Entity; -------------- -- New_Node -- -------------- function New_Node (New_Node_Kind : Node_Kind; New_Sloc : Source_Ptr) return Node_Id is Nod : Node_Id; procedure New_Node_Debugging_Output; pragma Inline (New_Node_Debugging_Output); -- Debugging routine for debug flag N -------------------------- -- New_Debugging_Output -- -------------------------- procedure New_Node_Debugging_Output is begin if Debug_Flag_N then Write_Str ("Allocate node, Id = "); Write_Int (Int (Nod)); Write_Str (" "); Write_Location (New_Sloc); Write_Str (" "); Write_Str (Node_Kind'Image (New_Node_Kind)); Write_Eol; end if; end New_Node_Debugging_Output; -- Start of processing for New_Node begin pragma Assert (New_Node_Kind not in N_Entity); Nod := Allocate_Initialize_Node (Empty, With_Extension => False); Nodes.Table (Nod).Nkind := New_Node_Kind; Nodes.Table (Nod).Sloc := New_Sloc; pragma Debug (New_Node_Debugging_Output); -- If this is a node with a real location and we are generating -- source nodes, then reset Current_Error_Node. This is useful -- if we bomb during parsing to get a error location for the bomb. if Default_Node.Comes_From_Source and then New_Sloc > No_Location then Current_Error_Node := Nod; end if; return Nod; end New_Node; ----------- -- Nkind -- ----------- function Nkind (N : Node_Id) return Node_Kind is begin return Nodes.Table (N).Nkind; end Nkind; -------- -- No -- -------- function No (N : Node_Id) return Boolean is begin return N = Empty; end No; ------------------- -- Nodes_Address -- ------------------- function Nodes_Address return System.Address is begin return Nodes.Table (First_Node_Id)'Address; end Nodes_Address; --------------- -- Num_Nodes -- --------------- function Num_Nodes return Nat is begin return Node_Count; end Num_Nodes; ------------------- -- Original_Node -- ------------------- function Original_Node (Node : Node_Id) return Node_Id is begin return Orig_Nodes.Table (Node); end Original_Node; ----------------- -- Paren_Count -- ----------------- function Paren_Count (N : Node_Id) return Paren_Count_Type is C : Paren_Count_Type := 0; begin pragma Assert (N in Nodes.First .. Nodes.Last); if Nodes.Table (N).Pflag1 then C := C + 1; end if; if Nodes.Table (N).Pflag2 then C := C + 2; end if; return C; end Paren_Count; ------------ -- Parent -- ------------ function Parent (N : Node_Id) return Node_Id is begin if Is_List_Member (N) then return Parent (List_Containing (N)); else return Node_Id (Nodes.Table (N).Link); end if; end Parent; ------------- -- Present -- ------------- function Present (N : Node_Id) return Boolean is begin return N /= Empty; end Present; -------------------------------- -- Preserve_Comes_From_Source -- -------------------------------- procedure Preserve_Comes_From_Source (NewN, OldN : Node_Id) is begin Nodes.Table (NewN).Comes_From_Source := Nodes.Table (OldN).Comes_From_Source; end Preserve_Comes_From_Source; ------------------- -- Relocate_Node -- ------------------- function Relocate_Node (Source : Node_Id) return Node_Id is New_Node : Node_Id; begin if No (Source) then return Empty; end if; New_Node := New_Copy (Source); Fix_Parents (Source, New_Node); -- We now set the parent of the new node to be the same as the -- parent of the source. Almost always this parent will be -- replaced by a new value when the relocated node is reattached -- to the tree, but by doing it now, we ensure that this node is -- not even temporarily disconnected from the tree. Note that this -- does not happen free, because in the list case, the parent does -- not get set. Set_Parent (New_Node, Parent (Source)); -- If the node being relocated was a rewriting of some original -- node, then the relocated node has the same original node. if Orig_Nodes.Table (Source) /= Source then Orig_Nodes.Table (New_Node) := Orig_Nodes.Table (Source); end if; return New_Node; end Relocate_Node; ------------- -- Replace -- ------------- procedure Replace (Old_Node, New_Node : Node_Id) is Old_Post : constant Boolean := Nodes.Table (Old_Node).Error_Posted; Old_CFS : constant Boolean := Nodes.Table (Old_Node).Comes_From_Source; begin pragma Assert (not Has_Extension (Old_Node) and not Has_Extension (New_Node) and not Nodes.Table (New_Node).In_List); -- Do copy, preserving link and in list status and comes from source Copy_Node (Source => New_Node, Destination => Old_Node); Nodes.Table (Old_Node).Comes_From_Source := Old_CFS; Nodes.Table (Old_Node).Error_Posted := Old_Post; -- Fix parents of substituted node, since it has changed identity Fix_Parents (New_Node, Old_Node); -- Since we are doing a replace, we assume that the original node -- is intended to become the new replaced node. The call would be -- to Rewrite if there were an intention to save the original node. Orig_Nodes.Table (Old_Node) := Old_Node; -- Finally delete the source, since it is now copied Delete_Node (New_Node); end Replace; ------------- -- Rewrite -- ------------- procedure Rewrite (Old_Node, New_Node : Node_Id) is Old_Error_P : constant Boolean := Nodes.Table (Old_Node).Error_Posted; -- This fields is always preserved in the new node Old_Paren_Count : Paren_Count_Type; Old_Must_Not_Freeze : Boolean; -- These fields are preserved in the new node only if the new node -- and the old node are both subexpression nodes. -- Note: it is a violation of abstraction levels for Must_Not_Freeze -- to be referenced like this. ??? Sav_Node : Node_Id; begin pragma Assert (not Has_Extension (Old_Node) and not Has_Extension (New_Node) and not Nodes.Table (New_Node).In_List); if Nkind (Old_Node) in N_Subexpr then Old_Paren_Count := Paren_Count (Old_Node); Old_Must_Not_Freeze := Must_Not_Freeze (Old_Node); else Old_Paren_Count := 0; Old_Must_Not_Freeze := False; end if; -- Allocate a new node, to be used to preserve the original contents -- of the Old_Node, for possible later retrival by Original_Node and -- make an entry in the Orig_Nodes table. This is only done if we have -- not already rewritten the node, as indicated by an Orig_Nodes entry -- that does not reference the Old_Node. if Orig_Nodes.Table (Old_Node) = Old_Node then Sav_Node := New_Copy (Old_Node); Orig_Nodes.Table (Sav_Node) := Sav_Node; Orig_Nodes.Table (Old_Node) := Sav_Node; end if; -- Copy substitute node into place, preserving old fields as required Copy_Node (Source => New_Node, Destination => Old_Node); Nodes.Table (Old_Node).Error_Posted := Old_Error_P; if Nkind (New_Node) in N_Subexpr then Set_Paren_Count (Old_Node, Old_Paren_Count); Set_Must_Not_Freeze (Old_Node, Old_Must_Not_Freeze); end if; Fix_Parents (New_Node, Old_Node); end Rewrite; ------------------ -- Set_Analyzed -- ------------------ procedure Set_Analyzed (N : Node_Id; Val : Boolean := True) is begin Nodes.Table (N).Analyzed := Val; end Set_Analyzed; --------------------------- -- Set_Comes_From_Source -- --------------------------- procedure Set_Comes_From_Source (N : Node_Id; Val : Boolean) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Comes_From_Source := Val; end Set_Comes_From_Source; ----------------------------------- -- Set_Comes_From_Source_Default -- ----------------------------------- procedure Set_Comes_From_Source_Default (Default : Boolean) is begin Default_Node.Comes_From_Source := Default; end Set_Comes_From_Source_Default; -------------------- -- Set_Convention -- -------------------- procedure Set_Convention (E : Entity_Id; Val : Convention_Id) is begin pragma Assert (Nkind (E) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (E + 2).Field12'Unrestricted_Access)).Convention := Val; end Set_Convention; --------------- -- Set_Ekind -- --------------- procedure Set_Ekind (E : Entity_Id; Val : Entity_Kind) is begin pragma Assert (Nkind (E) in N_Entity); Nodes.Table (E + 1).Nkind := E_To_N (Val); end Set_Ekind; ---------------------- -- Set_Error_Posted -- ---------------------- procedure Set_Error_Posted (N : Node_Id; Val : Boolean := True) is begin Nodes.Table (N).Error_Posted := Val; end Set_Error_Posted; --------------------- -- Set_Paren_Count -- --------------------- procedure Set_Paren_Count (N : Node_Id; Val : Paren_Count_Type) is begin pragma Assert (Nkind (N) in N_Subexpr); Nodes.Table (N).Pflag1 := (Val mod 2 /= 0); Nodes.Table (N).Pflag2 := (Val >= 2); end Set_Paren_Count; ---------------- -- Set_Parent -- ---------------- procedure Set_Parent (N : Node_Id; Val : Node_Id) is begin pragma Assert (not Nodes.Table (N).In_List); Nodes.Table (N).Link := Union_Id (Val); end Set_Parent; -------------- -- Set_Sloc -- -------------- procedure Set_Sloc (N : Node_Id; Val : Source_Ptr) is begin Nodes.Table (N).Sloc := Val; end Set_Sloc; ---------- -- Sloc -- ---------- function Sloc (N : Node_Id) return Source_Ptr is begin return Nodes.Table (N).Sloc; end Sloc; ------------------- -- Traverse_Func -- ------------------- function Traverse_Func (Node : Node_Id) return Traverse_Result is function Traverse_Field (Fld : Union_Id) return Traverse_Result; -- Fld is one of the fields of Node. If the field points to a -- syntactic node or list, then this node or list is traversed, -- and the result is the result of this traversal. Otherwise -- a value of True is returned with no processing. -------------------- -- Traverse_Field -- -------------------- function Traverse_Field (Fld : Union_Id) return Traverse_Result is begin if Fld = Union_Id (Empty) then return OK; -- Descendent is a node elsif Fld in Node_Range then -- Traverse descendent that is syntactic subtree node if Parent (Node_Id (Fld)) = Node or else Original_Node (Parent (Node_Id (Fld))) = Node then return Traverse_Func (Node_Id (Fld)); -- Node that is not a syntactic subtree else return OK; end if; -- Descendent is a list elsif Fld in List_Range then -- Traverse descendent that is a syntactic subtree list if Parent (List_Id (Fld)) = Node or else Original_Node (Parent (List_Id (Fld))) = Node then declare Elmt : Node_Id := First (List_Id (Fld)); begin while Present (Elmt) loop if Traverse_Func (Elmt) = Abandon then return Abandon; else Next (Elmt); end if; end loop; return OK; end; -- List that is not a syntactic subtree else return OK; end if; -- Field was not a node or a list else return OK; end if; end Traverse_Field; -- Start of processing for Traverse_Func begin case Process (Node) is when Abandon => return Abandon; when Skip => return OK; when OK => if Traverse_Field (Union_Id (Field1 (Node))) = Abandon or else Traverse_Field (Union_Id (Field2 (Node))) = Abandon or else Traverse_Field (Union_Id (Field3 (Node))) = Abandon or else Traverse_Field (Union_Id (Field4 (Node))) = Abandon or else Traverse_Field (Union_Id (Field5 (Node))) = Abandon then return Abandon; else return OK; end if; when OK_Orig => declare Onode : constant Node_Id := Original_Node (Node); begin if Traverse_Field (Union_Id (Field1 (Onode))) = Abandon or else Traverse_Field (Union_Id (Field2 (Onode))) = Abandon or else Traverse_Field (Union_Id (Field3 (Onode))) = Abandon or else Traverse_Field (Union_Id (Field4 (Onode))) = Abandon or else Traverse_Field (Union_Id (Field5 (Onode))) = Abandon then return Abandon; else return OK_Orig; end if; end; end case; end Traverse_Func; ------------------- -- Traverse_Proc -- ------------------- procedure Traverse_Proc (Node : Node_Id) is function Traverse is new Traverse_Func (Process); Discard : Traverse_Result; pragma Warnings (Off, Discard); begin Discard := Traverse (Node); end Traverse_Proc; --------------- -- Tree_Read -- --------------- procedure Tree_Read is begin Tree_Read_Int (Node_Count); Nodes.Tree_Read; Orig_Nodes.Tree_Read; end Tree_Read; ---------------- -- Tree_Write -- ---------------- procedure Tree_Write is begin Tree_Write_Int (Node_Count); Nodes.Tree_Write; Orig_Nodes.Tree_Write; end Tree_Write; ------------------------------ -- Unchecked Access Package -- ------------------------------ package body Unchecked_Access is function Field1 (N : Node_Id) return Union_Id is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Field1; end Field1; function Field2 (N : Node_Id) return Union_Id is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Field2; end Field2; function Field3 (N : Node_Id) return Union_Id is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Field3; end Field3; function Field4 (N : Node_Id) return Union_Id is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Field4; end Field4; function Field5 (N : Node_Id) return Union_Id is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Field5; end Field5; function Field6 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Field6; end Field6; function Field7 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Field7; end Field7; function Field8 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Field8; end Field8; function Field9 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Field9; end Field9; function Field10 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Field10; end Field10; function Field11 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Field11; end Field11; function Field12 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Field12; end Field12; function Field13 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Field6; end Field13; function Field14 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Field7; end Field14; function Field15 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Field8; end Field15; function Field16 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Field9; end Field16; function Field17 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Field10; end Field17; function Field18 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Field11; end Field18; function Field19 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Field6; end Field19; function Field20 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Field7; end Field20; function Field21 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Field8; end Field21; function Field22 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Field9; end Field22; function Field23 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Field10; end Field23; function Field24 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 4).Field6; end Field24; function Field25 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 4).Field7; end Field25; function Field26 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 4).Field8; end Field26; function Field27 (N : Node_Id) return Union_Id is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 4).Field9; end Field27; function Node1 (N : Node_Id) return Node_Id is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Node_Id (Nodes.Table (N).Field1); end Node1; function Node2 (N : Node_Id) return Node_Id is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Node_Id (Nodes.Table (N).Field2); end Node2; function Node3 (N : Node_Id) return Node_Id is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Node_Id (Nodes.Table (N).Field3); end Node3; function Node4 (N : Node_Id) return Node_Id is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Node_Id (Nodes.Table (N).Field4); end Node4; function Node5 (N : Node_Id) return Node_Id is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Node_Id (Nodes.Table (N).Field5); end Node5; function Node6 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 1).Field6); end Node6; function Node7 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 1).Field7); end Node7; function Node8 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 1).Field8); end Node8; function Node9 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 1).Field9); end Node9; function Node10 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 1).Field10); end Node10; function Node11 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 1).Field11); end Node11; function Node12 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 1).Field12); end Node12; function Node13 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 2).Field6); end Node13; function Node14 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 2).Field7); end Node14; function Node15 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 2).Field8); end Node15; function Node16 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 2).Field9); end Node16; function Node17 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 2).Field10); end Node17; function Node18 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 2).Field11); end Node18; function Node19 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 3).Field6); end Node19; function Node20 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 3).Field7); end Node20; function Node21 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 3).Field8); end Node21; function Node22 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 3).Field9); end Node22; function Node23 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 3).Field10); end Node23; function Node24 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 4).Field6); end Node24; function Node25 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 4).Field7); end Node25; function Node26 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 4).Field8); end Node26; function Node27 (N : Node_Id) return Node_Id is begin pragma Assert (Nkind (N) in N_Entity); return Node_Id (Nodes.Table (N + 4).Field9); end Node27; function List1 (N : Node_Id) return List_Id is begin pragma Assert (N in Nodes.First .. Nodes.Last); return List_Id (Nodes.Table (N).Field1); end List1; function List2 (N : Node_Id) return List_Id is begin pragma Assert (N in Nodes.First .. Nodes.Last); return List_Id (Nodes.Table (N).Field2); end List2; function List3 (N : Node_Id) return List_Id is begin pragma Assert (N in Nodes.First .. Nodes.Last); return List_Id (Nodes.Table (N).Field3); end List3; function List4 (N : Node_Id) return List_Id is begin pragma Assert (N in Nodes.First .. Nodes.Last); return List_Id (Nodes.Table (N).Field4); end List4; function List5 (N : Node_Id) return List_Id is begin pragma Assert (N in Nodes.First .. Nodes.Last); return List_Id (Nodes.Table (N).Field5); end List5; function List10 (N : Node_Id) return List_Id is begin pragma Assert (Nkind (N) in N_Entity); return List_Id (Nodes.Table (N + 1).Field10); end List10; function List14 (N : Node_Id) return List_Id is begin pragma Assert (Nkind (N) in N_Entity); return List_Id (Nodes.Table (N + 2).Field7); end List14; function Elist2 (N : Node_Id) return Elist_Id is pragma Assert (N in Nodes.First .. Nodes.Last); Value : constant Union_Id := Nodes.Table (N).Field2; begin if Value = 0 then return No_Elist; else return Elist_Id (Value); end if; end Elist2; function Elist3 (N : Node_Id) return Elist_Id is pragma Assert (N in Nodes.First .. Nodes.Last); Value : constant Union_Id := Nodes.Table (N).Field3; begin if Value = 0 then return No_Elist; else return Elist_Id (Value); end if; end Elist3; function Elist4 (N : Node_Id) return Elist_Id is pragma Assert (N in Nodes.First .. Nodes.Last); Value : constant Union_Id := Nodes.Table (N).Field4; begin if Value = 0 then return No_Elist; else return Elist_Id (Value); end if; end Elist4; function Elist8 (N : Node_Id) return Elist_Id is pragma Assert (Nkind (N) in N_Entity); Value : constant Union_Id := Nodes.Table (N + 1).Field8; begin if Value = 0 then return No_Elist; else return Elist_Id (Value); end if; end Elist8; function Elist13 (N : Node_Id) return Elist_Id is pragma Assert (Nkind (N) in N_Entity); Value : constant Union_Id := Nodes.Table (N + 2).Field6; begin if Value = 0 then return No_Elist; else return Elist_Id (Value); end if; end Elist13; function Elist15 (N : Node_Id) return Elist_Id is pragma Assert (Nkind (N) in N_Entity); Value : constant Union_Id := Nodes.Table (N + 2).Field8; begin if Value = 0 then return No_Elist; else return Elist_Id (Value); end if; end Elist15; function Elist16 (N : Node_Id) return Elist_Id is pragma Assert (Nkind (N) in N_Entity); Value : constant Union_Id := Nodes.Table (N + 2).Field9; begin if Value = 0 then return No_Elist; else return Elist_Id (Value); end if; end Elist16; function Elist18 (N : Node_Id) return Elist_Id is pragma Assert (Nkind (N) in N_Entity); Value : constant Union_Id := Nodes.Table (N + 2).Field11; begin if Value = 0 then return No_Elist; else return Elist_Id (Value); end if; end Elist18; function Elist21 (N : Node_Id) return Elist_Id is pragma Assert (Nkind (N) in N_Entity); Value : constant Union_Id := Nodes.Table (N + 3).Field8; begin if Value = 0 then return No_Elist; else return Elist_Id (Value); end if; end Elist21; function Elist23 (N : Node_Id) return Elist_Id is pragma Assert (Nkind (N) in N_Entity); Value : constant Union_Id := Nodes.Table (N + 3).Field10; begin if Value = 0 then return No_Elist; else return Elist_Id (Value); end if; end Elist23; function Elist24 (N : Node_Id) return Elist_Id is pragma Assert (Nkind (N) in N_Entity); Value : constant Union_Id := Nodes.Table (N + 4).Field6; begin if Value = 0 then return No_Elist; else return Elist_Id (Value); end if; end Elist24; function Name1 (N : Node_Id) return Name_Id is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Name_Id (Nodes.Table (N).Field1); end Name1; function Name2 (N : Node_Id) return Name_Id is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Name_Id (Nodes.Table (N).Field2); end Name2; function Str3 (N : Node_Id) return String_Id is begin pragma Assert (N in Nodes.First .. Nodes.Last); return String_Id (Nodes.Table (N).Field3); end Str3; function Uint2 (N : Node_Id) return Uint is pragma Assert (N in Nodes.First .. Nodes.Last); U : constant Union_Id := Nodes.Table (N).Field2; begin if U = 0 then return Uint_0; else return From_Union (U); end if; end Uint2; function Uint3 (N : Node_Id) return Uint is pragma Assert (N in Nodes.First .. Nodes.Last); U : constant Union_Id := Nodes.Table (N).Field3; begin if U = 0 then return Uint_0; else return From_Union (U); end if; end Uint3; function Uint4 (N : Node_Id) return Uint is pragma Assert (N in Nodes.First .. Nodes.Last); U : constant Union_Id := Nodes.Table (N).Field4; begin if U = 0 then return Uint_0; else return From_Union (U); end if; end Uint4; function Uint5 (N : Node_Id) return Uint is pragma Assert (N in Nodes.First .. Nodes.Last); U : constant Union_Id := Nodes.Table (N).Field5; begin if U = 0 then return Uint_0; else return From_Union (U); end if; end Uint5; function Uint8 (N : Node_Id) return Uint is pragma Assert (Nkind (N) in N_Entity); U : constant Union_Id := Nodes.Table (N + 1).Field8; begin if U = 0 then return Uint_0; else return From_Union (U); end if; end Uint8; function Uint9 (N : Node_Id) return Uint is pragma Assert (Nkind (N) in N_Entity); U : constant Union_Id := Nodes.Table (N + 1).Field9; begin if U = 0 then return Uint_0; else return From_Union (U); end if; end Uint9; function Uint10 (N : Node_Id) return Uint is pragma Assert (Nkind (N) in N_Entity); U : constant Union_Id := Nodes.Table (N + 1).Field10; begin if U = 0 then return Uint_0; else return From_Union (U); end if; end Uint10; function Uint11 (N : Node_Id) return Uint is pragma Assert (Nkind (N) in N_Entity); U : constant Union_Id := Nodes.Table (N + 1).Field11; begin if U = 0 then return Uint_0; else return From_Union (U); end if; end Uint11; function Uint12 (N : Node_Id) return Uint is pragma Assert (Nkind (N) in N_Entity); U : constant Union_Id := Nodes.Table (N + 1).Field12; begin if U = 0 then return Uint_0; else return From_Union (U); end if; end Uint12; function Uint13 (N : Node_Id) return Uint is pragma Assert (Nkind (N) in N_Entity); U : constant Union_Id := Nodes.Table (N + 2).Field6; begin if U = 0 then return Uint_0; else return From_Union (U); end if; end Uint13; function Uint14 (N : Node_Id) return Uint is pragma Assert (Nkind (N) in N_Entity); U : constant Union_Id := Nodes.Table (N + 2).Field7; begin if U = 0 then return Uint_0; else return From_Union (U); end if; end Uint14; function Uint15 (N : Node_Id) return Uint is pragma Assert (Nkind (N) in N_Entity); U : constant Union_Id := Nodes.Table (N + 2).Field8; begin if U = 0 then return Uint_0; else return From_Union (U); end if; end Uint15; function Uint16 (N : Node_Id) return Uint is pragma Assert (Nkind (N) in N_Entity); U : constant Union_Id := Nodes.Table (N + 2).Field9; begin if U = 0 then return Uint_0; else return From_Union (U); end if; end Uint16; function Uint17 (N : Node_Id) return Uint is pragma Assert (Nkind (N) in N_Entity); U : constant Union_Id := Nodes.Table (N + 2).Field10; begin if U = 0 then return Uint_0; else return From_Union (U); end if; end Uint17; function Uint22 (N : Node_Id) return Uint is pragma Assert (Nkind (N) in N_Entity); U : constant Union_Id := Nodes.Table (N + 3).Field9; begin if U = 0 then return Uint_0; else return From_Union (U); end if; end Uint22; function Ureal3 (N : Node_Id) return Ureal is begin pragma Assert (N in Nodes.First .. Nodes.Last); return From_Union (Nodes.Table (N).Field3); end Ureal3; function Ureal18 (N : Node_Id) return Ureal is begin pragma Assert (Nkind (N) in N_Entity); return From_Union (Nodes.Table (N + 2).Field11); end Ureal18; function Ureal21 (N : Node_Id) return Ureal is begin pragma Assert (Nkind (N) in N_Entity); return From_Union (Nodes.Table (N + 3).Field8); end Ureal21; function Flag4 (N : Node_Id) return Boolean is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Flag4; end Flag4; function Flag5 (N : Node_Id) return Boolean is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Flag5; end Flag5; function Flag6 (N : Node_Id) return Boolean is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Flag6; end Flag6; function Flag7 (N : Node_Id) return Boolean is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Flag7; end Flag7; function Flag8 (N : Node_Id) return Boolean is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Flag8; end Flag8; function Flag9 (N : Node_Id) return Boolean is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Flag9; end Flag9; function Flag10 (N : Node_Id) return Boolean is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Flag10; end Flag10; function Flag11 (N : Node_Id) return Boolean is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Flag11; end Flag11; function Flag12 (N : Node_Id) return Boolean is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Flag12; end Flag12; function Flag13 (N : Node_Id) return Boolean is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Flag13; end Flag13; function Flag14 (N : Node_Id) return Boolean is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Flag14; end Flag14; function Flag15 (N : Node_Id) return Boolean is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Flag15; end Flag15; function Flag16 (N : Node_Id) return Boolean is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Flag16; end Flag16; function Flag17 (N : Node_Id) return Boolean is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Flag17; end Flag17; function Flag18 (N : Node_Id) return Boolean is begin pragma Assert (N in Nodes.First .. Nodes.Last); return Nodes.Table (N).Flag18; end Flag18; function Flag19 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).In_List; end Flag19; function Flag20 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Unused_1; end Flag20; function Flag21 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Rewrite_Ins; end Flag21; function Flag22 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Analyzed; end Flag22; function Flag23 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Comes_From_Source; end Flag23; function Flag24 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Error_Posted; end Flag24; function Flag25 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Flag4; end Flag25; function Flag26 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Flag5; end Flag26; function Flag27 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Flag6; end Flag27; function Flag28 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Flag7; end Flag28; function Flag29 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Flag8; end Flag29; function Flag30 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Flag9; end Flag30; function Flag31 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Flag10; end Flag31; function Flag32 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Flag11; end Flag32; function Flag33 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Flag12; end Flag33; function Flag34 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Flag13; end Flag34; function Flag35 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Flag14; end Flag35; function Flag36 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Flag15; end Flag36; function Flag37 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Flag16; end Flag37; function Flag38 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Flag17; end Flag38; function Flag39 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Flag18; end Flag39; function Flag40 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).In_List; end Flag40; function Flag41 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Unused_1; end Flag41; function Flag42 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Rewrite_Ins; end Flag42; function Flag43 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Analyzed; end Flag43; function Flag44 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Comes_From_Source; end Flag44; function Flag45 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Error_Posted; end Flag45; function Flag46 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Flag4; end Flag46; function Flag47 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Flag5; end Flag47; function Flag48 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Flag6; end Flag48; function Flag49 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Flag7; end Flag49; function Flag50 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Flag8; end Flag50; function Flag51 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Flag9; end Flag51; function Flag52 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Flag10; end Flag52; function Flag53 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Flag11; end Flag53; function Flag54 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Flag12; end Flag54; function Flag55 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Flag13; end Flag55; function Flag56 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Flag14; end Flag56; function Flag57 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Flag15; end Flag57; function Flag58 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Flag16; end Flag58; function Flag59 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Flag17; end Flag59; function Flag60 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Flag18; end Flag60; function Flag61 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Pflag1; end Flag61; function Flag62 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 1).Pflag2; end Flag62; function Flag63 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Pflag1; end Flag63; function Flag64 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 2).Pflag2; end Flag64; function Flag65 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag65; end Flag65; function Flag66 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag66; end Flag66; function Flag67 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag67; end Flag67; function Flag68 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag68; end Flag68; function Flag69 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag69; end Flag69; function Flag70 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag70; end Flag70; function Flag71 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag71; end Flag71; function Flag72 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag72; end Flag72; function Flag73 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag73; end Flag73; function Flag74 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag74; end Flag74; function Flag75 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag75; end Flag75; function Flag76 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag76; end Flag76; function Flag77 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag77; end Flag77; function Flag78 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag78; end Flag78; function Flag79 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag79; end Flag79; function Flag80 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag80; end Flag80; function Flag81 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag81; end Flag81; function Flag82 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag82; end Flag82; function Flag83 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag83; end Flag83; function Flag84 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag84; end Flag84; function Flag85 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag85; end Flag85; function Flag86 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag86; end Flag86; function Flag87 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag87; end Flag87; function Flag88 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag88; end Flag88; function Flag89 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag89; end Flag89; function Flag90 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag90; end Flag90; function Flag91 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag91; end Flag91; function Flag92 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag92; end Flag92; function Flag93 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag93; end Flag93; function Flag94 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag94; end Flag94; function Flag95 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag95; end Flag95; function Flag96 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag96; end Flag96; function Flag97 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag97; end Flag97; function Flag98 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag98; end Flag98; function Flag99 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag99; end Flag99; function Flag100 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag100; end Flag100; function Flag101 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag101; end Flag101; function Flag102 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag102; end Flag102; function Flag103 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag103; end Flag103; function Flag104 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag104; end Flag104; function Flag105 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag105; end Flag105; function Flag106 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag106; end Flag106; function Flag107 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag107; end Flag107; function Flag108 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag108; end Flag108; function Flag109 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag109; end Flag109; function Flag110 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag110; end Flag110; function Flag111 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag111; end Flag111; function Flag112 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag112; end Flag112; function Flag113 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag113; end Flag113; function Flag114 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag114; end Flag114; function Flag115 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag115; end Flag115; function Flag116 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag116; end Flag116; function Flag117 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag117; end Flag117; function Flag118 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag118; end Flag118; function Flag119 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag119; end Flag119; function Flag120 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag120; end Flag120; function Flag121 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag121; end Flag121; function Flag122 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag122; end Flag122; function Flag123 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag123; end Flag123; function Flag124 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag124; end Flag124; function Flag125 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag125; end Flag125; function Flag126 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag126; end Flag126; function Flag127 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag127; end Flag127; function Flag128 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag128; end Flag128; function Flag129 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).In_List; end Flag129; function Flag130 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Unused_1; end Flag130; function Flag131 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Rewrite_Ins; end Flag131; function Flag132 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Analyzed; end Flag132; function Flag133 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Comes_From_Source; end Flag133; function Flag134 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Error_Posted; end Flag134; function Flag135 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Flag4; end Flag135; function Flag136 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Flag5; end Flag136; function Flag137 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Flag6; end Flag137; function Flag138 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Flag7; end Flag138; function Flag139 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Flag8; end Flag139; function Flag140 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Flag9; end Flag140; function Flag141 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Flag10; end Flag141; function Flag142 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Flag11; end Flag142; function Flag143 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Flag12; end Flag143; function Flag144 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Flag13; end Flag144; function Flag145 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Flag14; end Flag145; function Flag146 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Flag15; end Flag146; function Flag147 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Flag16; end Flag147; function Flag148 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Flag17; end Flag148; function Flag149 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Flag18; end Flag149; function Flag150 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Pflag1; end Flag150; function Flag151 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return Nodes.Table (N + 3).Pflag2; end Flag151; function Flag152 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag152; end Flag152; function Flag153 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag153; end Flag153; function Flag154 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag154; end Flag154; function Flag155 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag155; end Flag155; function Flag156 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag156; end Flag156; function Flag157 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag157; end Flag157; function Flag158 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag158; end Flag158; function Flag159 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag159; end Flag159; function Flag160 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag160; end Flag160; function Flag161 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag161; end Flag161; function Flag162 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag162; end Flag162; function Flag163 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag163; end Flag163; function Flag164 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag164; end Flag164; function Flag165 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag165; end Flag165; function Flag166 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag166; end Flag166; function Flag167 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag167; end Flag167; function Flag168 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag168; end Flag168; function Flag169 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag169; end Flag169; function Flag170 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag170; end Flag170; function Flag171 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag171; end Flag171; function Flag172 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag172; end Flag172; function Flag173 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag173; end Flag173; function Flag174 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag174; end Flag174; function Flag175 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag175; end Flag175; function Flag176 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag176; end Flag176; function Flag177 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag177; end Flag177; function Flag178 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag178; end Flag178; function Flag179 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag179; end Flag179; function Flag180 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag180; end Flag180; function Flag181 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag181; end Flag181; function Flag182 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag182; end Flag182; function Flag183 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag183; end Flag183; function Flag184 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag184; end Flag184; function Flag185 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag185; end Flag185; function Flag186 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag186; end Flag186; function Flag187 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag187; end Flag187; function Flag188 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag188; end Flag188; function Flag189 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag189; end Flag189; function Flag190 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag190; end Flag190; function Flag191 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag191; end Flag191; function Flag192 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag192; end Flag192; function Flag193 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag193; end Flag193; function Flag194 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag194; end Flag194; function Flag195 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag195; end Flag195; function Flag196 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag196; end Flag196; function Flag197 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag197; end Flag197; function Flag198 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag198; end Flag198; function Flag199 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag199; end Flag199; function Flag200 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag200; end Flag200; function Flag201 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag201; end Flag201; function Flag202 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag202; end Flag202; function Flag203 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag203; end Flag203; function Flag204 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag204; end Flag204; function Flag205 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag205; end Flag205; function Flag206 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag206; end Flag206; function Flag207 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag207; end Flag207; function Flag208 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag208; end Flag208; function Flag209 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag209; end Flag209; function Flag210 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag210; end Flag210; function Flag211 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag211; end Flag211; function Flag212 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag212; end Flag212; function Flag213 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag213; end Flag213; function Flag214 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag214; end Flag214; function Flag215 (N : Node_Id) return Boolean is begin pragma Assert (Nkind (N) in N_Entity); return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag215; end Flag215; procedure Set_Nkind (N : Node_Id; Val : Node_Kind) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Nkind := Val; end Set_Nkind; procedure Set_Field1 (N : Node_Id; Val : Union_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field1 := Val; end Set_Field1; procedure Set_Field2 (N : Node_Id; Val : Union_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field2 := Val; end Set_Field2; procedure Set_Field3 (N : Node_Id; Val : Union_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field3 := Val; end Set_Field3; procedure Set_Field4 (N : Node_Id; Val : Union_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field4 := Val; end Set_Field4; procedure Set_Field5 (N : Node_Id; Val : Union_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field5 := Val; end Set_Field5; procedure Set_Field6 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field6 := Val; end Set_Field6; procedure Set_Field7 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field7 := Val; end Set_Field7; procedure Set_Field8 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field8 := Val; end Set_Field8; procedure Set_Field9 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field9 := Val; end Set_Field9; procedure Set_Field10 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field10 := Val; end Set_Field10; procedure Set_Field11 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field11 := Val; end Set_Field11; procedure Set_Field12 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field12 := Val; end Set_Field12; procedure Set_Field13 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field6 := Val; end Set_Field13; procedure Set_Field14 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field7 := Val; end Set_Field14; procedure Set_Field15 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field8 := Val; end Set_Field15; procedure Set_Field16 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field9 := Val; end Set_Field16; procedure Set_Field17 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field10 := Val; end Set_Field17; procedure Set_Field18 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field11 := Val; end Set_Field18; procedure Set_Field19 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Field6 := Val; end Set_Field19; procedure Set_Field20 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Field7 := Val; end Set_Field20; procedure Set_Field21 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Field8 := Val; end Set_Field21; procedure Set_Field22 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Field9 := Val; end Set_Field22; procedure Set_Field23 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Field10 := Val; end Set_Field23; procedure Set_Field24 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 4).Field6 := Val; end Set_Field24; procedure Set_Field25 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 4).Field7 := Val; end Set_Field25; procedure Set_Field26 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 4).Field8 := Val; end Set_Field26; procedure Set_Field27 (N : Node_Id; Val : Union_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 4).Field9 := Val; end Set_Field27; procedure Set_Node1 (N : Node_Id; Val : Node_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field1 := Union_Id (Val); end Set_Node1; procedure Set_Node2 (N : Node_Id; Val : Node_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field2 := Union_Id (Val); end Set_Node2; procedure Set_Node3 (N : Node_Id; Val : Node_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field3 := Union_Id (Val); end Set_Node3; procedure Set_Node4 (N : Node_Id; Val : Node_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field4 := Union_Id (Val); end Set_Node4; procedure Set_Node5 (N : Node_Id; Val : Node_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field5 := Union_Id (Val); end Set_Node5; procedure Set_Node6 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field6 := Union_Id (Val); end Set_Node6; procedure Set_Node7 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field7 := Union_Id (Val); end Set_Node7; procedure Set_Node8 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field8 := Union_Id (Val); end Set_Node8; procedure Set_Node9 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field9 := Union_Id (Val); end Set_Node9; procedure Set_Node10 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field10 := Union_Id (Val); end Set_Node10; procedure Set_Node11 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field11 := Union_Id (Val); end Set_Node11; procedure Set_Node12 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field12 := Union_Id (Val); end Set_Node12; procedure Set_Node13 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field6 := Union_Id (Val); end Set_Node13; procedure Set_Node14 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field7 := Union_Id (Val); end Set_Node14; procedure Set_Node15 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field8 := Union_Id (Val); end Set_Node15; procedure Set_Node16 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field9 := Union_Id (Val); end Set_Node16; procedure Set_Node17 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field10 := Union_Id (Val); end Set_Node17; procedure Set_Node18 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field11 := Union_Id (Val); end Set_Node18; procedure Set_Node19 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Field6 := Union_Id (Val); end Set_Node19; procedure Set_Node20 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Field7 := Union_Id (Val); end Set_Node20; procedure Set_Node21 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Field8 := Union_Id (Val); end Set_Node21; procedure Set_Node22 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Field9 := Union_Id (Val); end Set_Node22; procedure Set_Node23 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Field10 := Union_Id (Val); end Set_Node23; procedure Set_Node24 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 4).Field6 := Union_Id (Val); end Set_Node24; procedure Set_Node25 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 4).Field7 := Union_Id (Val); end Set_Node25; procedure Set_Node26 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 4).Field8 := Union_Id (Val); end Set_Node26; procedure Set_Node27 (N : Node_Id; Val : Node_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 4).Field9 := Union_Id (Val); end Set_Node27; procedure Set_List1 (N : Node_Id; Val : List_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field1 := Union_Id (Val); end Set_List1; procedure Set_List2 (N : Node_Id; Val : List_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field2 := Union_Id (Val); end Set_List2; procedure Set_List3 (N : Node_Id; Val : List_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field3 := Union_Id (Val); end Set_List3; procedure Set_List4 (N : Node_Id; Val : List_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field4 := Union_Id (Val); end Set_List4; procedure Set_List5 (N : Node_Id; Val : List_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field5 := Union_Id (Val); end Set_List5; procedure Set_List10 (N : Node_Id; Val : List_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field10 := Union_Id (Val); end Set_List10; procedure Set_List14 (N : Node_Id; Val : List_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field7 := Union_Id (Val); end Set_List14; procedure Set_Elist2 (N : Node_Id; Val : Elist_Id) is begin Nodes.Table (N).Field2 := Union_Id (Val); end Set_Elist2; procedure Set_Elist3 (N : Node_Id; Val : Elist_Id) is begin Nodes.Table (N).Field3 := Union_Id (Val); end Set_Elist3; procedure Set_Elist4 (N : Node_Id; Val : Elist_Id) is begin Nodes.Table (N).Field4 := Union_Id (Val); end Set_Elist4; procedure Set_Elist8 (N : Node_Id; Val : Elist_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field8 := Union_Id (Val); end Set_Elist8; procedure Set_Elist13 (N : Node_Id; Val : Elist_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field6 := Union_Id (Val); end Set_Elist13; procedure Set_Elist15 (N : Node_Id; Val : Elist_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field8 := Union_Id (Val); end Set_Elist15; procedure Set_Elist16 (N : Node_Id; Val : Elist_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field9 := Union_Id (Val); end Set_Elist16; procedure Set_Elist18 (N : Node_Id; Val : Elist_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field11 := Union_Id (Val); end Set_Elist18; procedure Set_Elist21 (N : Node_Id; Val : Elist_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Field8 := Union_Id (Val); end Set_Elist21; procedure Set_Elist23 (N : Node_Id; Val : Elist_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Field10 := Union_Id (Val); end Set_Elist23; procedure Set_Elist24 (N : Node_Id; Val : Elist_Id) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 4).Field6 := Union_Id (Val); end Set_Elist24; procedure Set_Name1 (N : Node_Id; Val : Name_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field1 := Union_Id (Val); end Set_Name1; procedure Set_Name2 (N : Node_Id; Val : Name_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field2 := Union_Id (Val); end Set_Name2; procedure Set_Str3 (N : Node_Id; Val : String_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field3 := Union_Id (Val); end Set_Str3; procedure Set_Uint2 (N : Node_Id; Val : Uint) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field2 := To_Union (Val); end Set_Uint2; procedure Set_Uint3 (N : Node_Id; Val : Uint) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field3 := To_Union (Val); end Set_Uint3; procedure Set_Uint4 (N : Node_Id; Val : Uint) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field4 := To_Union (Val); end Set_Uint4; procedure Set_Uint5 (N : Node_Id; Val : Uint) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field5 := To_Union (Val); end Set_Uint5; procedure Set_Uint8 (N : Node_Id; Val : Uint) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field8 := To_Union (Val); end Set_Uint8; procedure Set_Uint9 (N : Node_Id; Val : Uint) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field9 := To_Union (Val); end Set_Uint9; procedure Set_Uint10 (N : Node_Id; Val : Uint) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field10 := To_Union (Val); end Set_Uint10; procedure Set_Uint11 (N : Node_Id; Val : Uint) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field11 := To_Union (Val); end Set_Uint11; procedure Set_Uint12 (N : Node_Id; Val : Uint) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Field12 := To_Union (Val); end Set_Uint12; procedure Set_Uint13 (N : Node_Id; Val : Uint) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field6 := To_Union (Val); end Set_Uint13; procedure Set_Uint14 (N : Node_Id; Val : Uint) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field7 := To_Union (Val); end Set_Uint14; procedure Set_Uint15 (N : Node_Id; Val : Uint) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field8 := To_Union (Val); end Set_Uint15; procedure Set_Uint16 (N : Node_Id; Val : Uint) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field9 := To_Union (Val); end Set_Uint16; procedure Set_Uint17 (N : Node_Id; Val : Uint) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field10 := To_Union (Val); end Set_Uint17; procedure Set_Uint22 (N : Node_Id; Val : Uint) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Field9 := To_Union (Val); end Set_Uint22; procedure Set_Ureal3 (N : Node_Id; Val : Ureal) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Field3 := To_Union (Val); end Set_Ureal3; procedure Set_Ureal18 (N : Node_Id; Val : Ureal) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Field11 := To_Union (Val); end Set_Ureal18; procedure Set_Ureal21 (N : Node_Id; Val : Ureal) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Field8 := To_Union (Val); end Set_Ureal21; procedure Set_Flag4 (N : Node_Id; Val : Boolean) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Flag4 := Val; end Set_Flag4; procedure Set_Flag5 (N : Node_Id; Val : Boolean) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Flag5 := Val; end Set_Flag5; procedure Set_Flag6 (N : Node_Id; Val : Boolean) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Flag6 := Val; end Set_Flag6; procedure Set_Flag7 (N : Node_Id; Val : Boolean) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Flag7 := Val; end Set_Flag7; procedure Set_Flag8 (N : Node_Id; Val : Boolean) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Flag8 := Val; end Set_Flag8; procedure Set_Flag9 (N : Node_Id; Val : Boolean) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Flag9 := Val; end Set_Flag9; procedure Set_Flag10 (N : Node_Id; Val : Boolean) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Flag10 := Val; end Set_Flag10; procedure Set_Flag11 (N : Node_Id; Val : Boolean) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Flag11 := Val; end Set_Flag11; procedure Set_Flag12 (N : Node_Id; Val : Boolean) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Flag12 := Val; end Set_Flag12; procedure Set_Flag13 (N : Node_Id; Val : Boolean) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Flag13 := Val; end Set_Flag13; procedure Set_Flag14 (N : Node_Id; Val : Boolean) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Flag14 := Val; end Set_Flag14; procedure Set_Flag15 (N : Node_Id; Val : Boolean) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Flag15 := Val; end Set_Flag15; procedure Set_Flag16 (N : Node_Id; Val : Boolean) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Flag16 := Val; end Set_Flag16; procedure Set_Flag17 (N : Node_Id; Val : Boolean) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Flag17 := Val; end Set_Flag17; procedure Set_Flag18 (N : Node_Id; Val : Boolean) is begin pragma Assert (N in Nodes.First .. Nodes.Last); Nodes.Table (N).Flag18 := Val; end Set_Flag18; procedure Set_Flag19 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).In_List := Val; end Set_Flag19; procedure Set_Flag20 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Unused_1 := Val; end Set_Flag20; procedure Set_Flag21 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Rewrite_Ins := Val; end Set_Flag21; procedure Set_Flag22 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Analyzed := Val; end Set_Flag22; procedure Set_Flag23 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Comes_From_Source := Val; end Set_Flag23; procedure Set_Flag24 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Error_Posted := Val; end Set_Flag24; procedure Set_Flag25 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Flag4 := Val; end Set_Flag25; procedure Set_Flag26 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Flag5 := Val; end Set_Flag26; procedure Set_Flag27 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Flag6 := Val; end Set_Flag27; procedure Set_Flag28 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Flag7 := Val; end Set_Flag28; procedure Set_Flag29 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Flag8 := Val; end Set_Flag29; procedure Set_Flag30 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Flag9 := Val; end Set_Flag30; procedure Set_Flag31 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Flag10 := Val; end Set_Flag31; procedure Set_Flag32 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Flag11 := Val; end Set_Flag32; procedure Set_Flag33 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Flag12 := Val; end Set_Flag33; procedure Set_Flag34 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Flag13 := Val; end Set_Flag34; procedure Set_Flag35 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Flag14 := Val; end Set_Flag35; procedure Set_Flag36 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Flag15 := Val; end Set_Flag36; procedure Set_Flag37 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Flag16 := Val; end Set_Flag37; procedure Set_Flag38 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Flag17 := Val; end Set_Flag38; procedure Set_Flag39 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Flag18 := Val; end Set_Flag39; procedure Set_Flag40 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).In_List := Val; end Set_Flag40; procedure Set_Flag41 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Unused_1 := Val; end Set_Flag41; procedure Set_Flag42 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Rewrite_Ins := Val; end Set_Flag42; procedure Set_Flag43 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Analyzed := Val; end Set_Flag43; procedure Set_Flag44 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Comes_From_Source := Val; end Set_Flag44; procedure Set_Flag45 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Error_Posted := Val; end Set_Flag45; procedure Set_Flag46 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Flag4 := Val; end Set_Flag46; procedure Set_Flag47 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Flag5 := Val; end Set_Flag47; procedure Set_Flag48 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Flag6 := Val; end Set_Flag48; procedure Set_Flag49 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Flag7 := Val; end Set_Flag49; procedure Set_Flag50 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Flag8 := Val; end Set_Flag50; procedure Set_Flag51 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Flag9 := Val; end Set_Flag51; procedure Set_Flag52 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Flag10 := Val; end Set_Flag52; procedure Set_Flag53 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Flag11 := Val; end Set_Flag53; procedure Set_Flag54 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Flag12 := Val; end Set_Flag54; procedure Set_Flag55 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Flag13 := Val; end Set_Flag55; procedure Set_Flag56 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Flag14 := Val; end Set_Flag56; procedure Set_Flag57 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Flag15 := Val; end Set_Flag57; procedure Set_Flag58 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Flag16 := Val; end Set_Flag58; procedure Set_Flag59 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Flag17 := Val; end Set_Flag59; procedure Set_Flag60 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Flag18 := Val; end Set_Flag60; procedure Set_Flag61 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Pflag1 := Val; end Set_Flag61; procedure Set_Flag62 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 1).Pflag2 := Val; end Set_Flag62; procedure Set_Flag63 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Pflag1 := Val; end Set_Flag63; procedure Set_Flag64 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 2).Pflag2 := Val; end Set_Flag64; procedure Set_Flag65 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Byte_Ptr (Node_Kind_Ptr' (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag65 := Val; end Set_Flag65; procedure Set_Flag66 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Byte_Ptr (Node_Kind_Ptr' (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag66 := Val; end Set_Flag66; procedure Set_Flag67 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Byte_Ptr (Node_Kind_Ptr' (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag67 := Val; end Set_Flag67; procedure Set_Flag68 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Byte_Ptr (Node_Kind_Ptr' (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag68 := Val; end Set_Flag68; procedure Set_Flag69 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Byte_Ptr (Node_Kind_Ptr' (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag69 := Val; end Set_Flag69; procedure Set_Flag70 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Byte_Ptr (Node_Kind_Ptr' (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag70 := Val; end Set_Flag70; procedure Set_Flag71 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Byte_Ptr (Node_Kind_Ptr' (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag71 := Val; end Set_Flag71; procedure Set_Flag72 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Byte_Ptr (Node_Kind_Ptr' (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag72 := Val; end Set_Flag72; procedure Set_Flag73 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag73 := Val; end Set_Flag73; procedure Set_Flag74 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag74 := Val; end Set_Flag74; procedure Set_Flag75 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag75 := Val; end Set_Flag75; procedure Set_Flag76 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag76 := Val; end Set_Flag76; procedure Set_Flag77 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag77 := Val; end Set_Flag77; procedure Set_Flag78 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag78 := Val; end Set_Flag78; procedure Set_Flag79 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag79 := Val; end Set_Flag79; procedure Set_Flag80 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag80 := Val; end Set_Flag80; procedure Set_Flag81 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag81 := Val; end Set_Flag81; procedure Set_Flag82 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag82 := Val; end Set_Flag82; procedure Set_Flag83 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag83 := Val; end Set_Flag83; procedure Set_Flag84 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag84 := Val; end Set_Flag84; procedure Set_Flag85 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag85 := Val; end Set_Flag85; procedure Set_Flag86 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag86 := Val; end Set_Flag86; procedure Set_Flag87 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag87 := Val; end Set_Flag87; procedure Set_Flag88 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag88 := Val; end Set_Flag88; procedure Set_Flag89 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag89 := Val; end Set_Flag89; procedure Set_Flag90 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag90 := Val; end Set_Flag90; procedure Set_Flag91 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag91 := Val; end Set_Flag91; procedure Set_Flag92 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag92 := Val; end Set_Flag92; procedure Set_Flag93 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag93 := Val; end Set_Flag93; procedure Set_Flag94 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag94 := Val; end Set_Flag94; procedure Set_Flag95 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag95 := Val; end Set_Flag95; procedure Set_Flag96 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word_Ptr (Union_Id_Ptr' (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag96 := Val; end Set_Flag96; procedure Set_Flag97 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag97 := Val; end Set_Flag97; procedure Set_Flag98 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag98 := Val; end Set_Flag98; procedure Set_Flag99 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag99 := Val; end Set_Flag99; procedure Set_Flag100 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag100 := Val; end Set_Flag100; procedure Set_Flag101 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag101 := Val; end Set_Flag101; procedure Set_Flag102 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag102 := Val; end Set_Flag102; procedure Set_Flag103 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag103 := Val; end Set_Flag103; procedure Set_Flag104 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag104 := Val; end Set_Flag104; procedure Set_Flag105 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag105 := Val; end Set_Flag105; procedure Set_Flag106 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag106 := Val; end Set_Flag106; procedure Set_Flag107 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag107 := Val; end Set_Flag107; procedure Set_Flag108 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag108 := Val; end Set_Flag108; procedure Set_Flag109 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag109 := Val; end Set_Flag109; procedure Set_Flag110 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag110 := Val; end Set_Flag110; procedure Set_Flag111 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag111 := Val; end Set_Flag111; procedure Set_Flag112 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag112 := Val; end Set_Flag112; procedure Set_Flag113 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag113 := Val; end Set_Flag113; procedure Set_Flag114 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag114 := Val; end Set_Flag114; procedure Set_Flag115 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag115 := Val; end Set_Flag115; procedure Set_Flag116 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag116 := Val; end Set_Flag116; procedure Set_Flag117 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag117 := Val; end Set_Flag117; procedure Set_Flag118 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag118 := Val; end Set_Flag118; procedure Set_Flag119 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag119 := Val; end Set_Flag119; procedure Set_Flag120 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag120 := Val; end Set_Flag120; procedure Set_Flag121 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag121 := Val; end Set_Flag121; procedure Set_Flag122 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag122 := Val; end Set_Flag122; procedure Set_Flag123 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag123 := Val; end Set_Flag123; procedure Set_Flag124 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag124 := Val; end Set_Flag124; procedure Set_Flag125 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag125 := Val; end Set_Flag125; procedure Set_Flag126 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag126 := Val; end Set_Flag126; procedure Set_Flag127 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag127 := Val; end Set_Flag127; procedure Set_Flag128 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word2_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag128 := Val; end Set_Flag128; procedure Set_Flag129 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).In_List := Val; end Set_Flag129; procedure Set_Flag130 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Unused_1 := Val; end Set_Flag130; procedure Set_Flag131 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Rewrite_Ins := Val; end Set_Flag131; procedure Set_Flag132 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Analyzed := Val; end Set_Flag132; procedure Set_Flag133 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Comes_From_Source := Val; end Set_Flag133; procedure Set_Flag134 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Error_Posted := Val; end Set_Flag134; procedure Set_Flag135 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Flag4 := Val; end Set_Flag135; procedure Set_Flag136 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Flag5 := Val; end Set_Flag136; procedure Set_Flag137 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Flag6 := Val; end Set_Flag137; procedure Set_Flag138 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Flag7 := Val; end Set_Flag138; procedure Set_Flag139 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Flag8 := Val; end Set_Flag139; procedure Set_Flag140 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Flag9 := Val; end Set_Flag140; procedure Set_Flag141 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Flag10 := Val; end Set_Flag141; procedure Set_Flag142 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Flag11 := Val; end Set_Flag142; procedure Set_Flag143 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Flag12 := Val; end Set_Flag143; procedure Set_Flag144 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Flag13 := Val; end Set_Flag144; procedure Set_Flag145 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Flag14 := Val; end Set_Flag145; procedure Set_Flag146 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Flag15 := Val; end Set_Flag146; procedure Set_Flag147 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Flag16 := Val; end Set_Flag147; procedure Set_Flag148 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Flag17 := Val; end Set_Flag148; procedure Set_Flag149 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Flag18 := Val; end Set_Flag149; procedure Set_Flag150 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Pflag1 := Val; end Set_Flag150; procedure Set_Flag151 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); Nodes.Table (N + 3).Pflag2 := Val; end Set_Flag151; procedure Set_Flag152 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag152 := Val; end Set_Flag152; procedure Set_Flag153 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag153 := Val; end Set_Flag153; procedure Set_Flag154 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag154 := Val; end Set_Flag154; procedure Set_Flag155 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag155 := Val; end Set_Flag155; procedure Set_Flag156 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag156 := Val; end Set_Flag156; procedure Set_Flag157 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag157 := Val; end Set_Flag157; procedure Set_Flag158 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag158 := Val; end Set_Flag158; procedure Set_Flag159 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag159 := Val; end Set_Flag159; procedure Set_Flag160 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag160 := Val; end Set_Flag160; procedure Set_Flag161 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag161 := Val; end Set_Flag161; procedure Set_Flag162 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag162 := Val; end Set_Flag162; procedure Set_Flag163 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag163 := Val; end Set_Flag163; procedure Set_Flag164 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag164 := Val; end Set_Flag164; procedure Set_Flag165 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag165 := Val; end Set_Flag165; procedure Set_Flag166 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag166 := Val; end Set_Flag166; procedure Set_Flag167 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag167 := Val; end Set_Flag167; procedure Set_Flag168 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag168 := Val; end Set_Flag168; procedure Set_Flag169 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag169 := Val; end Set_Flag169; procedure Set_Flag170 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag170 := Val; end Set_Flag170; procedure Set_Flag171 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag171 := Val; end Set_Flag171; procedure Set_Flag172 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag172 := Val; end Set_Flag172; procedure Set_Flag173 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag173 := Val; end Set_Flag173; procedure Set_Flag174 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag174 := Val; end Set_Flag174; procedure Set_Flag175 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag175 := Val; end Set_Flag175; procedure Set_Flag176 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag176 := Val; end Set_Flag176; procedure Set_Flag177 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag177 := Val; end Set_Flag177; procedure Set_Flag178 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag178 := Val; end Set_Flag178; procedure Set_Flag179 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag179 := Val; end Set_Flag179; procedure Set_Flag180 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag180 := Val; end Set_Flag180; procedure Set_Flag181 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag181 := Val; end Set_Flag181; procedure Set_Flag182 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag182 := Val; end Set_Flag182; procedure Set_Flag183 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word3_Ptr (Union_Id_Ptr' (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag183 := Val; end Set_Flag183; procedure Set_Flag184 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag184 := Val; end Set_Flag184; procedure Set_Flag185 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag185 := Val; end Set_Flag185; procedure Set_Flag186 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag186 := Val; end Set_Flag186; procedure Set_Flag187 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag187 := Val; end Set_Flag187; procedure Set_Flag188 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag188 := Val; end Set_Flag188; procedure Set_Flag189 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag189 := Val; end Set_Flag189; procedure Set_Flag190 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag190 := Val; end Set_Flag190; procedure Set_Flag191 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag191 := Val; end Set_Flag191; procedure Set_Flag192 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag192 := Val; end Set_Flag192; procedure Set_Flag193 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag193 := Val; end Set_Flag193; procedure Set_Flag194 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag194 := Val; end Set_Flag194; procedure Set_Flag195 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag195 := Val; end Set_Flag195; procedure Set_Flag196 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag196 := Val; end Set_Flag196; procedure Set_Flag197 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag197 := Val; end Set_Flag197; procedure Set_Flag198 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag198 := Val; end Set_Flag198; procedure Set_Flag199 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag199 := Val; end Set_Flag199; procedure Set_Flag200 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag200 := Val; end Set_Flag200; procedure Set_Flag201 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag201 := Val; end Set_Flag201; procedure Set_Flag202 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag202 := Val; end Set_Flag202; procedure Set_Flag203 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag203 := Val; end Set_Flag203; procedure Set_Flag204 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag204 := Val; end Set_Flag204; procedure Set_Flag205 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag205 := Val; end Set_Flag205; procedure Set_Flag206 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag206 := Val; end Set_Flag206; procedure Set_Flag207 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag207 := Val; end Set_Flag207; procedure Set_Flag208 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag208 := Val; end Set_Flag208; procedure Set_Flag209 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag209 := Val; end Set_Flag209; procedure Set_Flag210 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag210 := Val; end Set_Flag210; procedure Set_Flag211 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag211 := Val; end Set_Flag211; procedure Set_Flag212 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag212 := Val; end Set_Flag212; procedure Set_Flag213 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag213 := Val; end Set_Flag213; procedure Set_Flag214 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag214 := Val; end Set_Flag214; procedure Set_Flag215 (N : Node_Id; Val : Boolean) is begin pragma Assert (Nkind (N) in N_Entity); To_Flag_Word4_Ptr (Union_Id_Ptr' (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag215 := Val; end Set_Flag215; procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); if Val > Error then Set_Parent (Val, N); end if; Set_Node1 (N, Val); end Set_Node1_With_Parent; procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); if Val > Error then Set_Parent (Val, N); end if; Set_Node2 (N, Val); end Set_Node2_With_Parent; procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); if Val > Error then Set_Parent (Val, N); end if; Set_Node3 (N, Val); end Set_Node3_With_Parent; procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); if Val > Error then Set_Parent (Val, N); end if; Set_Node4 (N, Val); end Set_Node4_With_Parent; procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); if Val > Error then Set_Parent (Val, N); end if; Set_Node5 (N, Val); end Set_Node5_With_Parent; procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); if Val /= No_List and then Val /= Error_List then Set_Parent (Val, N); end if; Set_List1 (N, Val); end Set_List1_With_Parent; procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); if Val /= No_List and then Val /= Error_List then Set_Parent (Val, N); end if; Set_List2 (N, Val); end Set_List2_With_Parent; procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); if Val /= No_List and then Val /= Error_List then Set_Parent (Val, N); end if; Set_List3 (N, Val); end Set_List3_With_Parent; procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); if Val /= No_List and then Val /= Error_List then Set_Parent (Val, N); end if; Set_List4 (N, Val); end Set_List4_With_Parent; procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id) is begin pragma Assert (N in Nodes.First .. Nodes.Last); if Val /= No_List and then Val /= Error_List then Set_Parent (Val, N); end if; Set_List5 (N, Val); end Set_List5_With_Parent; end Unchecked_Access; end Atree;