1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2004, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 2, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING. If not, write --
19 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
20 -- MA 02111-1307, USA. --
22 -- As a special exception, if other files instantiate generics from this --
23 -- unit, or you link this unit with other files to produce an executable, --
24 -- this unit does not by itself cause the resulting executable to be --
25 -- covered by the GNU General Public License. This exception does not --
26 -- however invalidate any other reasons why the executable file might be --
27 -- covered by the GNU Public License. --
29 -- GNAT was originally developed by the GNAT team at New York University. --
30 -- Extensive contributions were provided by Ada Core Technologies Inc. --
32 ------------------------------------------------------------------------------
34 pragma Style_Checks (All_Checks);
35 -- Turn off subprogram ordering check for this package
37 -- WARNING: There is a C version of this package. Any changes to this source
38 -- file must be properly reflected in the C header a-atree.h (for inlined
39 -- bodies) and the C file a-atree.c (for remaining non-inlined bodies).
41 with Debug; use Debug;
42 with Nlists; use Nlists;
43 with Elists; use Elists;
44 with Output; use Output;
45 with Sinput; use Sinput;
46 with Tree_IO; use Tree_IO;
48 with GNAT.HTable; use GNAT.HTable;
53 -- Count allocated nodes for Num_Nodes function
56 -- We are allowed to see these from within our own body!
58 use Atree_Private_Part;
59 -- We are also allowed to see our private data structures!
61 function E_To_N is new Unchecked_Conversion (Entity_Kind, Node_Kind);
62 function N_To_E is new Unchecked_Conversion (Node_Kind, Entity_Kind);
63 -- Functions used to store Entity_Kind value in Nkind field
65 -- The following declarations are used to store flags 65-72 in the
66 -- Nkind field of the third component of an extended (entity) node.
68 type Flag_Byte is record
79 pragma Pack (Flag_Byte);
80 for Flag_Byte'Size use 8;
82 type Flag_Byte_Ptr is access all Flag_Byte;
83 type Node_Kind_Ptr is access all Node_Kind;
85 function To_Flag_Byte is new
86 Unchecked_Conversion (Node_Kind, Flag_Byte);
88 function To_Flag_Byte_Ptr is new
89 Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte_Ptr);
91 -- The following declarations are used to store flags 73-96 in the
92 -- Field12 field of the third component of an extended (entity) node.
94 type Flag_Word is record
122 Convention : Convention_Id;
125 pragma Pack (Flag_Word);
126 for Flag_Word'Size use 32;
127 for Flag_Word'Alignment use 4;
129 type Flag_Word_Ptr is access all Flag_Word;
130 type Union_Id_Ptr is access all Union_Id;
132 function To_Flag_Word is new
133 Unchecked_Conversion (Union_Id, Flag_Word);
135 function To_Flag_Word_Ptr is new
136 Unchecked_Conversion (Union_Id_Ptr, Flag_Word_Ptr);
138 -- The following declarations are used to store flags 97-128 in the
139 -- Field12 field of the fourth component of an extended (entity) node.
141 type Flag_Word2 is record
179 pragma Pack (Flag_Word2);
180 for Flag_Word2'Size use 32;
181 for Flag_Word2'Alignment use 4;
183 type Flag_Word2_Ptr is access all Flag_Word2;
185 function To_Flag_Word2 is new
186 Unchecked_Conversion (Union_Id, Flag_Word2);
188 function To_Flag_Word2_Ptr is new
189 Unchecked_Conversion (Union_Id_Ptr, Flag_Word2_Ptr);
191 -- The following declarations are used to store flags 97-120 in the
192 -- Field12 field of the fourth component of an extended (entity) node.
194 type Flag_Word3 is record
232 pragma Pack (Flag_Word3);
233 for Flag_Word3'Size use 32;
234 for Flag_Word3'Alignment use 4;
236 type Flag_Word3_Ptr is access all Flag_Word3;
238 function To_Flag_Word3 is new
239 Unchecked_Conversion (Union_Id, Flag_Word3);
241 function To_Flag_Word3_Ptr is new
242 Unchecked_Conversion (Union_Id_Ptr, Flag_Word3_Ptr);
244 -- Default value used to initialize default nodes. Note that some of the
245 -- fields get overwritten, and in particular, Nkind always gets reset.
247 Default_Node : Node_Record := (
248 Is_Extension => False,
253 Rewrite_Ins => False,
255 Comes_From_Source => False, -- modified by Set_Comes_From_Source_Default
256 Error_Posted => False,
275 Nkind => N_Unused_At_Start,
278 Link => Empty_List_Or_Node,
279 Field1 => Empty_List_Or_Node,
280 Field2 => Empty_List_Or_Node,
281 Field3 => Empty_List_Or_Node,
282 Field4 => Empty_List_Or_Node,
283 Field5 => Empty_List_Or_Node);
285 -- Default value used to initialize node extensions (i.e. the second
286 -- and third and fourth components of an extended node). Note we are
287 -- cheating a bit here when it comes to Node12, which really holds
288 -- flags an (for the third component), the convention. But it works
289 -- because Empty, False, Convention_Ada, all happen to be all zero bits.
291 Default_Node_Extension : constant Node_Record := (
292 Is_Extension => True,
297 Rewrite_Ins => False,
299 Comes_From_Source => False,
300 Error_Posted => False,
319 Nkind => E_To_N (E_Void),
321 Field6 => Empty_List_Or_Node,
322 Field7 => Empty_List_Or_Node,
323 Field8 => Empty_List_Or_Node,
324 Field9 => Empty_List_Or_Node,
325 Field10 => Empty_List_Or_Node,
326 Field11 => Empty_List_Or_Node,
327 Field12 => Empty_List_Or_Node);
329 --------------------------------------------------
330 -- Implementation of Tree Substitution Routines --
331 --------------------------------------------------
333 -- A separate table keeps track of the mapping between rewritten nodes
334 -- and their corresponding original tree nodes. Rewrite makes an entry
335 -- in this table for use by Original_Node. By default, if no call is
336 -- Rewrite, the entry in this table points to the original unwritten node.
338 -- Note: eventually, this should be a field in the Node directly, but
339 -- for now we do not want to disturb the efficiency of a power of 2
342 package Orig_Nodes is new Table.Table (
343 Table_Component_Type => Node_Id,
344 Table_Index_Type => Node_Id,
345 Table_Low_Bound => First_Node_Id,
346 Table_Initial => Alloc.Orig_Nodes_Initial,
347 Table_Increment => Alloc.Orig_Nodes_Increment,
348 Table_Name => "Orig_Nodes");
350 ----------------------------------------
351 -- Global_Variables for New_Copy_Tree --
352 ----------------------------------------
354 -- These global variables are used by New_Copy_Tree. See description
355 -- of the body of this subprogram for details. Global variables can be
356 -- safely used by New_Copy_Tree, since there is no case of a recursive
357 -- call from the processing inside New_Copy_Tree.
359 NCT_Hash_Threshhold : constant := 20;
360 -- If there are more than this number of pairs of entries in the
361 -- map, then Hash_Tables_Used will be set, and the hash tables will
362 -- be initialized and used for the searches.
364 NCT_Hash_Tables_Used : Boolean := False;
365 -- Set to True if hash tables are in use
367 NCT_Table_Entries : Nat;
368 -- Count entries in table to see if threshhold is reached
370 NCT_Hash_Table_Setup : Boolean := False;
371 -- Set to True if hash table contains data. We set this True if we
372 -- setup the hash table with data, and leave it set permanently
373 -- from then on, this is a signal that second and subsequent users
374 -- of the hash table must clear the old entries before reuse.
376 subtype NCT_Header_Num is Int range 0 .. 511;
377 -- Defines range of headers in hash tables (512 headers)
379 -----------------------
380 -- Local Subprograms --
381 -----------------------
383 procedure Fix_Parents (Old_Node, New_Node : Node_Id);
384 -- Fixup parent pointers for the syntactic children of New_Node after
385 -- a copy, setting them to New_Node when they pointed to Old_Node.
387 function Allocate_Initialize_Node
389 With_Extension : Boolean) return Node_Id;
390 -- Allocate a new node or node extension. If Src is not empty,
391 -- the information for the newly-allocated node is copied from it.
393 ------------------------------
394 -- Allocate_Initialize_Node --
395 ------------------------------
397 function Allocate_Initialize_Node
399 With_Extension : Boolean) return Node_Id
401 New_Id : Node_Id := Src;
402 Nod : Node_Record := Default_Node;
403 Ext1 : Node_Record := Default_Node_Extension;
404 Ext2 : Node_Record := Default_Node_Extension;
405 Ext3 : Node_Record := Default_Node_Extension;
407 if Present (Src) then
408 Nod := Nodes.Table (Src);
410 if Has_Extension (Src) then
411 Ext1 := Nodes.Table (Src + 1);
412 Ext2 := Nodes.Table (Src + 2);
413 Ext3 := Nodes.Table (Src + 3);
417 if not (Present (Src)
418 and then not Has_Extension (Src)
419 and then With_Extension
420 and then Src = Nodes.Last)
422 -- We are allocating a new node, or extending a node
423 -- other than Nodes.Last.
426 New_Id := Nodes.Last;
427 Orig_Nodes.Append (New_Id);
428 Node_Count := Node_Count + 1;
431 if With_Extension then
437 Orig_Nodes.Set_Last (Nodes.Last);
438 Allocate_List_Tables (Nodes.Last);
440 end Allocate_Initialize_Node;
446 function Analyzed (N : Node_Id) return Boolean is
448 pragma Assert (N in Nodes.First .. Nodes.Last);
449 return Nodes.Table (N).Analyzed;
456 procedure Change_Node (N : Node_Id; New_Node_Kind : Node_Kind) is
457 Save_Sloc : constant Source_Ptr := Sloc (N);
458 Save_In_List : constant Boolean := Nodes.Table (N).In_List;
459 Save_Link : constant Union_Id := Nodes.Table (N).Link;
460 Save_CFS : constant Boolean := Nodes.Table (N).Comes_From_Source;
461 Save_Posted : constant Boolean := Nodes.Table (N).Error_Posted;
462 Par_Count : Paren_Count_Type := 0;
465 if Nkind (N) in N_Subexpr then
466 Par_Count := Paren_Count (N);
469 Nodes.Table (N) := Default_Node;
470 Nodes.Table (N).Sloc := Save_Sloc;
471 Nodes.Table (N).In_List := Save_In_List;
472 Nodes.Table (N).Link := Save_Link;
473 Nodes.Table (N).Comes_From_Source := Save_CFS;
474 Nodes.Table (N).Nkind := New_Node_Kind;
475 Nodes.Table (N).Error_Posted := Save_Posted;
477 if New_Node_Kind in N_Subexpr then
478 Set_Paren_Count (N, Par_Count);
482 -----------------------
483 -- Comes_From_Source --
484 -----------------------
486 function Comes_From_Source (N : Node_Id) return Boolean is
488 pragma Assert (N in Nodes.First .. Nodes.Last);
489 return Nodes.Table (N).Comes_From_Source;
490 end Comes_From_Source;
496 function Convention (E : Entity_Id) return Convention_Id is
498 pragma Assert (Nkind (E) in N_Entity);
499 return To_Flag_Word (Nodes.Table (E + 2).Field12).Convention;
506 procedure Copy_Node (Source : Node_Id; Destination : Node_Id) is
507 Save_In_List : constant Boolean := Nodes.Table (Destination).In_List;
508 Save_Link : constant Union_Id := Nodes.Table (Destination).Link;
511 Nodes.Table (Destination) := Nodes.Table (Source);
512 Nodes.Table (Destination).In_List := Save_In_List;
513 Nodes.Table (Destination).Link := Save_Link;
515 if Has_Extension (Source) then
516 pragma Assert (Has_Extension (Destination));
517 Nodes.Table (Destination + 1) := Nodes.Table (Source + 1);
518 Nodes.Table (Destination + 2) := Nodes.Table (Source + 2);
519 Nodes.Table (Destination + 3) := Nodes.Table (Source + 3);
522 pragma Assert (not Has_Extension (Source));
527 ------------------------
528 -- Copy_Separate_Tree --
529 ------------------------
531 function Copy_Separate_Tree (Source : Node_Id) return Node_Id is
534 function Copy_Entity (E : Entity_Id) return Entity_Id;
535 -- Copy Entity, copying only the Ekind and Chars fields
537 function Copy_List (List : List_Id) return List_Id;
540 function Possible_Copy (Field : Union_Id) return Union_Id;
541 -- Given a field, returns a copy of the node or list if its parent
542 -- is the current source node, and otherwise returns the input
548 function Copy_Entity (E : Entity_Id) return Entity_Id is
552 case N_Entity (Nkind (E)) is
553 when N_Defining_Identifier =>
554 New_Ent := New_Entity (N_Defining_Identifier, Sloc (E));
556 when N_Defining_Character_Literal =>
557 New_Ent := New_Entity (N_Defining_Character_Literal, Sloc (E));
559 when N_Defining_Operator_Symbol =>
560 New_Ent := New_Entity (N_Defining_Operator_Symbol, Sloc (E));
563 Set_Chars (New_Ent, Chars (E));
571 function Copy_List (List : List_Id) return List_Id is
576 if List = No_List then
583 while Present (E) loop
585 if Has_Extension (E) then
586 Append (Copy_Entity (E), NL);
588 Append (Copy_Separate_Tree (E), NL);
602 function Possible_Copy (Field : Union_Id) return Union_Id is
606 if Field in Node_Range then
608 New_N := Union_Id (Copy_Separate_Tree (Node_Id (Field)));
610 if Parent (Node_Id (Field)) = Source then
611 Set_Parent (Node_Id (New_N), New_Id);
616 elsif Field in List_Range then
617 New_N := Union_Id (Copy_List (List_Id (Field)));
619 if Parent (List_Id (Field)) = Source then
620 Set_Parent (List_Id (New_N), New_Id);
630 -- Start of processing for Copy_Separate_Tree
633 if Source <= Empty_Or_Error then
636 elsif Has_Extension (Source) then
637 return Copy_Entity (Source);
640 New_Id := New_Copy (Source);
642 -- Recursively copy descendents
644 Set_Field1 (New_Id, Possible_Copy (Field1 (New_Id)));
645 Set_Field2 (New_Id, Possible_Copy (Field2 (New_Id)));
646 Set_Field3 (New_Id, Possible_Copy (Field3 (New_Id)));
647 Set_Field4 (New_Id, Possible_Copy (Field4 (New_Id)));
648 Set_Field5 (New_Id, Possible_Copy (Field5 (New_Id)));
650 -- Set Entity field to Empty
651 -- Why is this done??? and why is it always right to do it???
653 if Nkind (New_Id) in N_Has_Entity
654 or else Nkind (New_Id) = N_Freeze_Entity
656 Set_Entity (New_Id, Empty);
659 -- All done, return copied node
663 end Copy_Separate_Tree;
669 procedure Delete_Node (Node : Node_Id) is
671 pragma Assert (not Nodes.Table (Node).In_List);
674 Write_Str ("Delete node ");
675 Write_Int (Int (Node));
679 Nodes.Table (Node) := Default_Node;
680 Nodes.Table (Node).Nkind := N_Unused_At_Start;
681 Node_Count := Node_Count - 1;
683 -- Note: for now, we are not bothering to reuse deleted nodes
691 procedure Delete_Tree (Node : Node_Id) is
693 procedure Delete_Field (F : Union_Id);
694 -- Delete item pointed to by field F if it is a syntactic element
696 procedure Delete_List (L : List_Id);
697 -- Delete all elements on the given list
699 procedure Delete_Field (F : Union_Id) is
701 if F = Union_Id (Empty) then
704 elsif F in Node_Range
705 and then Parent (Node_Id (F)) = Node
707 Delete_Tree (Node_Id (F));
709 elsif F in List_Range
710 and then Parent (List_Id (F)) = Node
712 Delete_List (List_Id (F));
714 -- No need to test Elist case, there are no syntactic Elists
721 procedure Delete_List (L : List_Id) is
723 while Is_Non_Empty_List (L) loop
724 Delete_Tree (Remove_Head (L));
728 -- Start of processing for Delete_Tree
731 -- Delete descendents
733 Delete_Field (Field1 (Node));
734 Delete_Field (Field2 (Node));
735 Delete_Field (Field3 (Node));
736 Delete_Field (Field4 (Node));
737 Delete_Field (Field5 (Node));
744 function Ekind (E : Entity_Id) return Entity_Kind is
746 pragma Assert (Nkind (E) in N_Entity);
747 return N_To_E (Nodes.Table (E + 1).Nkind);
754 function Error_Posted (N : Node_Id) return Boolean is
756 pragma Assert (N in Nodes.First .. Nodes.Last);
757 return Nodes.Table (N).Error_Posted;
760 -----------------------
761 -- Exchange_Entities --
762 -----------------------
764 procedure Exchange_Entities (E1 : Entity_Id; E2 : Entity_Id) is
765 Temp_Ent : Node_Record;
768 pragma Assert (Has_Extension (E1)
769 and then Has_Extension (E2)
770 and then not Nodes.Table (E1).In_List
771 and then not Nodes.Table (E2).In_List);
773 -- Exchange the contents of the two entities
775 Temp_Ent := Nodes.Table (E1);
776 Nodes.Table (E1) := Nodes.Table (E2);
777 Nodes.Table (E2) := Temp_Ent;
778 Temp_Ent := Nodes.Table (E1 + 1);
779 Nodes.Table (E1 + 1) := Nodes.Table (E2 + 1);
780 Nodes.Table (E2 + 1) := Temp_Ent;
781 Temp_Ent := Nodes.Table (E1 + 2);
782 Nodes.Table (E1 + 2) := Nodes.Table (E2 + 2);
783 Nodes.Table (E2 + 2) := Temp_Ent;
784 Temp_Ent := Nodes.Table (E1 + 3);
785 Nodes.Table (E1 + 3) := Nodes.Table (E2 + 3);
786 Nodes.Table (E2 + 3) := Temp_Ent;
788 -- That exchange exchanged the parent pointers as well, which is what
789 -- we want, but we need to patch up the defining identifier pointers
790 -- in the parent nodes (the child pointers) to match this switch
791 -- unless for Implicit types entities which have no parent, in which
792 -- case we don't do anything otherwise we won't be able to revert back
793 -- to the original situation.
795 -- Shouldn't this use Is_Itype instead of the Parent test
797 if Present (Parent (E1)) and then Present (Parent (E2)) then
798 Set_Defining_Identifier (Parent (E1), E1);
799 Set_Defining_Identifier (Parent (E2), E2);
801 end Exchange_Entities;
807 function Extend_Node (Node : Node_Id) return Entity_Id is
810 procedure Debug_Extend_Node;
811 -- Debug routine for debug flag N
813 procedure Debug_Extend_Node is
816 Write_Str ("Extend node ");
817 Write_Int (Int (Node));
819 if Result = Node then
820 Write_Str (" in place");
822 Write_Str (" copied to ");
823 Write_Int (Int (Result));
828 end Debug_Extend_Node;
830 pragma Inline (Debug_Extend_Node);
833 pragma Assert (not (Has_Extension (Node)));
834 Result := Allocate_Initialize_Node (Node, With_Extension => True);
835 pragma Debug (Debug_Extend_Node);
843 procedure Fix_Parents (Old_Node, New_Node : Node_Id) is
845 procedure Fix_Parent (Field : Union_Id; Old_Node, New_Node : Node_Id);
846 -- Fixup one parent pointer. Field is checked to see if it
847 -- points to a node, list, or element list that has a parent that
848 -- points to Old_Node. If so, the parent is reset to point to New_Node.
850 procedure Fix_Parent (Field : Union_Id; Old_Node, New_Node : Node_Id) is
852 -- Fix parent of node that is referenced by Field. Note that we must
853 -- exclude the case where the node is a member of a list, because in
854 -- this case the parent is the parent of the list.
856 if Field in Node_Range
857 and then Present (Node_Id (Field))
858 and then not Nodes.Table (Node_Id (Field)).In_List
859 and then Parent (Node_Id (Field)) = Old_Node
861 Set_Parent (Node_Id (Field), New_Node);
863 -- Fix parent of list that is referenced by Field
865 elsif Field in List_Range
866 and then Present (List_Id (Field))
867 and then Parent (List_Id (Field)) = Old_Node
869 Set_Parent (List_Id (Field), New_Node);
874 Fix_Parent (Field1 (New_Node), Old_Node, New_Node);
875 Fix_Parent (Field2 (New_Node), Old_Node, New_Node);
876 Fix_Parent (Field3 (New_Node), Old_Node, New_Node);
877 Fix_Parent (Field4 (New_Node), Old_Node, New_Node);
878 Fix_Parent (Field5 (New_Node), Old_Node, New_Node);
881 -----------------------------------
882 -- Get_Comes_From_Source_Default --
883 -----------------------------------
885 function Get_Comes_From_Source_Default return Boolean is
887 return Default_Node.Comes_From_Source;
888 end Get_Comes_From_Source_Default;
894 function Has_Extension (N : Node_Id) return Boolean is
896 return N < Nodes.Last and then Nodes.Table (N + 1).Is_Extension;
903 procedure Initialize is
905 pragma Warnings (Off, Dummy);
909 Atree_Private_Part.Nodes.Init;
912 -- Allocate Empty node
914 Dummy := New_Node (N_Empty, No_Location);
915 Set_Name1 (Empty, No_Name);
917 -- Allocate Error node, and set Error_Posted, since we certainly
918 -- only generate an Error node if we do post some kind of error!
920 Dummy := New_Node (N_Error, No_Location);
921 Set_Name1 (Error, Error_Name);
922 Set_Error_Posted (Error, True);
924 -- Set global variables for New_Copy_Tree:
925 NCT_Hash_Tables_Used := False;
926 NCT_Table_Entries := 0;
927 NCT_Hash_Table_Setup := False;
930 --------------------------
931 -- Is_Rewrite_Insertion --
932 --------------------------
934 function Is_Rewrite_Insertion (Node : Node_Id) return Boolean is
936 return Nodes.Table (Node).Rewrite_Ins;
937 end Is_Rewrite_Insertion;
939 -----------------------------
940 -- Is_Rewrite_Substitution --
941 -----------------------------
943 function Is_Rewrite_Substitution (Node : Node_Id) return Boolean is
945 return Orig_Nodes.Table (Node) /= Node;
946 end Is_Rewrite_Substitution;
952 function Last_Node_Id return Node_Id is
963 Nodes.Locked := True;
964 Orig_Nodes.Locked := True;
969 ----------------------------
970 -- Mark_Rewrite_Insertion --
971 ----------------------------
973 procedure Mark_Rewrite_Insertion (New_Node : Node_Id) is
975 Nodes.Table (New_Node).Rewrite_Ins := True;
976 end Mark_Rewrite_Insertion;
982 function New_Copy (Source : Node_Id) return Node_Id is
983 New_Id : Node_Id := Source;
986 if Source > Empty_Or_Error then
988 New_Id := Allocate_Initialize_Node (Source, Has_Extension (Source));
990 Nodes.Table (New_Id).Link := Empty_List_Or_Node;
991 Nodes.Table (New_Id).In_List := False;
993 -- If the original is marked as a rewrite insertion, then unmark
994 -- the copy, since we inserted the original, not the copy.
996 Nodes.Table (New_Id).Rewrite_Ins := False;
1006 -- Our approach here requires a two pass traversal of the tree. The
1007 -- first pass visits all nodes that eventually will be copied looking
1008 -- for defining Itypes. If any defining Itypes are found, then they are
1009 -- copied, and an entry is added to the replacement map. In the second
1010 -- phase, the tree is copied, using the replacement map to replace any
1011 -- Itype references within the copied tree.
1013 -- The following hash tables are used if the Map supplied has more
1014 -- than hash threshhold entries to speed up access to the map. If
1015 -- there are fewer entries, then the map is searched sequentially
1016 -- (because setting up a hash table for only a few entries takes
1017 -- more time than it saves.
1019 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num;
1020 -- Hash function used for hash operations
1022 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num is
1024 return Nat (E) mod (NCT_Header_Num'Last + 1);
1027 -- The hash table NCT_Assoc associates old entities in the table
1028 -- with their corresponding new entities (i.e. the pairs of entries
1029 -- presented in the original Map argument are Key-Element pairs).
1031 package NCT_Assoc is new Simple_HTable (
1032 Header_Num => NCT_Header_Num,
1033 Element => Entity_Id,
1034 No_Element => Empty,
1036 Hash => New_Copy_Hash,
1037 Equal => Types."=");
1039 -- The hash table NCT_Itype_Assoc contains entries only for those
1040 -- old nodes which have a non-empty Associated_Node_For_Itype set.
1041 -- The key is the associated node, and the element is the new node
1042 -- itself (NOT the associated node for the new node).
1044 package NCT_Itype_Assoc is new Simple_HTable (
1045 Header_Num => NCT_Header_Num,
1046 Element => Entity_Id,
1047 No_Element => Empty,
1049 Hash => New_Copy_Hash,
1050 Equal => Types."=");
1052 -- Start of New_Copy_Tree function
1054 function New_Copy_Tree
1056 Map : Elist_Id := No_Elist;
1057 New_Sloc : Source_Ptr := No_Location;
1058 New_Scope : Entity_Id := Empty) return Node_Id
1060 Actual_Map : Elist_Id := Map;
1061 -- This is the actual map for the copy. It is initialized with the
1062 -- given elements, and then enlarged as required for Itypes that are
1063 -- copied during the first phase of the copy operation. The visit
1064 -- procedures add elements to this map as Itypes are encountered.
1065 -- The reason we cannot use Map directly, is that it may well be
1066 -- (and normally is) initialized to No_Elist, and if we have mapped
1067 -- entities, we have to reset it to point to a real Elist.
1069 function Assoc (N : Node_Or_Entity_Id) return Node_Id;
1070 -- Called during second phase to map entities into their corresponding
1071 -- copies using Actual_Map. If the argument is not an entity, or is not
1072 -- in Actual_Map, then it is returned unchanged.
1074 procedure Build_NCT_Hash_Tables;
1075 -- Builds hash tables (number of elements >= threshold value)
1077 function Copy_Elist_With_Replacement
1078 (Old_Elist : Elist_Id) return Elist_Id;
1079 -- Called during second phase to copy element list doing replacements.
1081 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id);
1082 -- Called during the second phase to process a copied Itype. The actual
1083 -- copy happened during the first phase (so that we could make the entry
1084 -- in the mapping), but we still have to deal with the descendents of
1085 -- the copied Itype and copy them where necessary.
1087 function Copy_List_With_Replacement (Old_List : List_Id) return List_Id;
1088 -- Called during second phase to copy list doing replacements.
1090 function Copy_Node_With_Replacement (Old_Node : Node_Id) return Node_Id;
1091 -- Called during second phase to copy node doing replacements
1093 procedure Visit_Elist (E : Elist_Id);
1094 -- Called during first phase to visit all elements of an Elist
1096 procedure Visit_Field (F : Union_Id; N : Node_Id);
1097 -- Visit a single field, recursing to call Visit_Node or Visit_List
1098 -- if the field is a syntactic descendent of the current node (i.e.
1099 -- its parent is Node N).
1101 procedure Visit_Itype (Old_Itype : Entity_Id);
1102 -- Called during first phase to visit subsidiary fields of a defining
1103 -- Itype, and also create a copy and make an entry in the replacement
1104 -- map for the new copy.
1106 procedure Visit_List (L : List_Id);
1107 -- Called during first phase to visit all elements of a List
1109 procedure Visit_Node (N : Node_Or_Entity_Id);
1110 -- Called during first phase to visit a node and all its subtrees
1116 function Assoc (N : Node_Or_Entity_Id) return Node_Id is
1121 if not Has_Extension (N) or else No (Actual_Map) then
1124 elsif NCT_Hash_Tables_Used then
1125 Ent := NCT_Assoc.Get (Entity_Id (N));
1127 if Present (Ent) then
1133 -- No hash table used, do serial search
1136 E := First_Elmt (Actual_Map);
1137 while Present (E) loop
1138 if Node (E) = N then
1139 return Node (Next_Elmt (E));
1141 E := Next_Elmt (Next_Elmt (E));
1149 ---------------------------
1150 -- Build_NCT_Hash_Tables --
1151 ---------------------------
1153 procedure Build_NCT_Hash_Tables is
1157 if NCT_Hash_Table_Setup then
1159 NCT_Itype_Assoc.Reset;
1162 Elmt := First_Elmt (Actual_Map);
1163 while Present (Elmt) loop
1166 NCT_Assoc.Set (Ent, Node (Elmt));
1169 if Is_Type (Ent) then
1171 Anode : constant Entity_Id :=
1172 Associated_Node_For_Itype (Ent);
1175 if Present (Anode) then
1176 NCT_Itype_Assoc.Set (Anode, Node (Elmt));
1182 NCT_Hash_Tables_Used := True;
1183 NCT_Hash_Table_Setup := True;
1184 end Build_NCT_Hash_Tables;
1186 ---------------------------------
1187 -- Copy_Elist_With_Replacement --
1188 ---------------------------------
1190 function Copy_Elist_With_Replacement
1191 (Old_Elist : Elist_Id) return Elist_Id
1194 New_Elist : Elist_Id;
1197 if No (Old_Elist) then
1201 New_Elist := New_Elmt_List;
1202 M := First_Elmt (Old_Elist);
1204 while Present (M) loop
1205 Append_Elmt (Copy_Node_With_Replacement (Node (M)), New_Elist);
1211 end Copy_Elist_With_Replacement;
1213 ---------------------------------
1214 -- Copy_Itype_With_Replacement --
1215 ---------------------------------
1217 -- This routine exactly parallels its phase one analog Visit_Itype,
1218 -- and like that routine, knows far too many semantic details about
1219 -- the descendents of Itypes and whether they need copying or not.
1221 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id) is
1223 -- Translate Next_Entity, Scope and Etype fields, in case they
1224 -- reference entities that have been mapped into copies.
1226 Set_Next_Entity (New_Itype, Assoc (Next_Entity (New_Itype)));
1227 Set_Etype (New_Itype, Assoc (Etype (New_Itype)));
1229 if Present (New_Scope) then
1230 Set_Scope (New_Itype, New_Scope);
1232 Set_Scope (New_Itype, Assoc (Scope (New_Itype)));
1235 -- Copy referenced fields
1237 if Is_Discrete_Type (New_Itype) then
1238 Set_Scalar_Range (New_Itype,
1239 Copy_Node_With_Replacement (Scalar_Range (New_Itype)));
1241 elsif Has_Discriminants (Base_Type (New_Itype)) then
1242 Set_Discriminant_Constraint (New_Itype,
1243 Copy_Elist_With_Replacement
1244 (Discriminant_Constraint (New_Itype)));
1246 elsif Is_Array_Type (New_Itype) then
1247 if Present (First_Index (New_Itype)) then
1248 Set_First_Index (New_Itype,
1249 First (Copy_List_With_Replacement
1250 (List_Containing (First_Index (New_Itype)))));
1253 if Is_Packed (New_Itype) then
1254 Set_Packed_Array_Type (New_Itype,
1255 Copy_Node_With_Replacement
1256 (Packed_Array_Type (New_Itype)));
1259 end Copy_Itype_With_Replacement;
1261 --------------------------------
1262 -- Copy_List_With_Replacement --
1263 --------------------------------
1265 function Copy_List_With_Replacement
1266 (Old_List : List_Id) return List_Id
1272 if Old_List = No_List then
1276 New_List := Empty_List;
1277 E := First (Old_List);
1278 while Present (E) loop
1279 Append (Copy_Node_With_Replacement (E), New_List);
1285 end Copy_List_With_Replacement;
1287 --------------------------------
1288 -- Copy_Node_With_Replacement --
1289 --------------------------------
1291 function Copy_Node_With_Replacement
1292 (Old_Node : Node_Id) return Node_Id
1296 function Copy_Field_With_Replacement
1297 (Field : Union_Id) return Union_Id;
1298 -- Given Field, which is a field of Old_Node, return a copy of it
1299 -- if it is a syntactic field (i.e. its parent is Node), setting
1300 -- the parent of the copy to poit to New_Node. Otherwise returns
1301 -- the field (possibly mapped if it is an entity).
1303 ---------------------------------
1304 -- Copy_Field_With_Replacement --
1305 ---------------------------------
1307 function Copy_Field_With_Replacement
1308 (Field : Union_Id) return Union_Id
1311 if Field = Union_Id (Empty) then
1314 elsif Field in Node_Range then
1316 Old_N : constant Node_Id := Node_Id (Field);
1320 -- If syntactic field, as indicated by the parent pointer
1321 -- being set, then copy the referenced node recursively.
1323 if Parent (Old_N) = Old_Node then
1324 New_N := Copy_Node_With_Replacement (Old_N);
1326 if New_N /= Old_N then
1327 Set_Parent (New_N, New_Node);
1330 -- For semantic fields, update possible entity reference
1331 -- from the replacement map.
1334 New_N := Assoc (Old_N);
1337 return Union_Id (New_N);
1340 elsif Field in List_Range then
1342 Old_L : constant List_Id := List_Id (Field);
1346 -- If syntactic field, as indicated by the parent pointer,
1347 -- then recursively copy the entire referenced list.
1349 if Parent (Old_L) = Old_Node then
1350 New_L := Copy_List_With_Replacement (Old_L);
1351 Set_Parent (New_L, New_Node);
1353 -- For semantic list, just returned unchanged
1359 return Union_Id (New_L);
1362 -- Anything other than a list or a node is returned unchanged
1367 end Copy_Field_With_Replacement;
1369 -- Start of processing for Copy_Node_With_Replacement
1372 if Old_Node <= Empty_Or_Error then
1375 elsif Has_Extension (Old_Node) then
1376 return Assoc (Old_Node);
1379 New_Node := New_Copy (Old_Node);
1381 -- If the node we are copying is the associated node of a
1382 -- previously copied Itype, then adjust the associated node
1383 -- of the copy of that Itype accordingly.
1385 if Present (Actual_Map) then
1391 -- Case of hash table used
1393 if NCT_Hash_Tables_Used then
1394 Ent := NCT_Itype_Assoc.Get (Old_Node);
1396 if Present (Ent) then
1397 Set_Associated_Node_For_Itype (Ent, New_Node);
1400 -- Case of no hash table used
1403 E := First_Elmt (Actual_Map);
1404 while Present (E) loop
1405 if Is_Itype (Node (E))
1407 Old_Node = Associated_Node_For_Itype (Node (E))
1409 Set_Associated_Node_For_Itype
1410 (Node (Next_Elmt (E)), New_Node);
1413 E := Next_Elmt (Next_Elmt (E));
1419 -- Recursively copy descendents
1422 (New_Node, Copy_Field_With_Replacement (Field1 (New_Node)));
1424 (New_Node, Copy_Field_With_Replacement (Field2 (New_Node)));
1426 (New_Node, Copy_Field_With_Replacement (Field3 (New_Node)));
1428 (New_Node, Copy_Field_With_Replacement (Field4 (New_Node)));
1430 (New_Node, Copy_Field_With_Replacement (Field5 (New_Node)));
1433 -- Adjust Sloc of new node if necessary
1435 if New_Sloc /= No_Location then
1436 Set_Sloc (New_Node, New_Sloc);
1438 -- If we adjust the Sloc, then we are essentially making
1439 -- a completely new node, so the Comes_From_Source flag
1440 -- should be reset to the proper default value.
1442 Nodes.Table (New_Node).Comes_From_Source :=
1443 Default_Node.Comes_From_Source;
1446 -- Reset First_Real_Statement for Handled_Sequence_Of_Statements.
1447 -- The replacement mechanism applies to entities, and is not used
1448 -- here. Eventually we may need a more general graph-copying
1449 -- routine. For now, do a sequential search to find desired node.
1451 if Nkind (Old_Node) = N_Handled_Sequence_Of_Statements
1452 and then Present (First_Real_Statement (Old_Node))
1455 Old_F : constant Node_Id := First_Real_Statement (Old_Node);
1459 N1 := First (Statements (Old_Node));
1460 N2 := First (Statements (New_Node));
1462 while N1 /= Old_F loop
1467 Set_First_Real_Statement (New_Node, N2);
1472 -- All done, return copied node
1475 end Copy_Node_With_Replacement;
1481 procedure Visit_Elist (E : Elist_Id) is
1486 Elmt := First_Elmt (E);
1488 while Elmt /= No_Elmt loop
1489 Visit_Node (Node (Elmt));
1499 procedure Visit_Field (F : Union_Id; N : Node_Id) is
1501 if F = Union_Id (Empty) then
1504 elsif F in Node_Range then
1506 -- Copy node if it is syntactic, i.e. its parent pointer is
1507 -- set to point to the field that referenced it (certain
1508 -- Itypes will also meet this criterion, which is fine, since
1509 -- these are clearly Itypes that do need to be copied, since
1510 -- we are copying their parent.)
1512 if Parent (Node_Id (F)) = N then
1513 Visit_Node (Node_Id (F));
1516 -- Another case, if we are pointing to an Itype, then we want
1517 -- to copy it if its associated node is somewhere in the tree
1520 -- Note: the exclusion of self-referential copies is just an
1521 -- optimization, since the search of the already copied list
1522 -- would catch it, but it is a common case (Etype pointing
1523 -- to itself for an Itype that is a base type).
1525 elsif Has_Extension (Node_Id (F))
1526 and then Is_Itype (Entity_Id (F))
1527 and then Node_Id (F) /= N
1533 P := Associated_Node_For_Itype (Node_Id (F));
1534 while Present (P) loop
1536 Visit_Node (Node_Id (F));
1543 -- An Itype whose parent is not being copied definitely
1544 -- should NOT be copied, since it does not belong in any
1545 -- sense to the copied subtree.
1551 elsif F in List_Range
1552 and then Parent (List_Id (F)) = N
1554 Visit_List (List_Id (F));
1563 -- Note: we are relying on far too much semantic knowledge in this
1564 -- routine, it really should just do a blind replacement of all
1565 -- fields, or at least a more blind replacement. For example, we
1566 -- do not deal with corresponding record types, and that works
1567 -- because we have no Itypes of task types, but nowhere is there
1568 -- a guarantee that this will always be the case. ???
1570 procedure Visit_Itype (Old_Itype : Entity_Id) is
1571 New_Itype : Entity_Id;
1576 -- Itypes that describe the designated type of access to subprograms
1577 -- have the structure of subprogram declarations, with signatures,
1578 -- etc. Either we duplicate the signatures completely, or choose to
1579 -- share such itypes, which is fine because their elaboration will
1580 -- have no side effects. In any case, this is additional semantic
1581 -- information that seems awkward to have in atree.
1583 if Ekind (Old_Itype) = E_Subprogram_Type then
1587 New_Itype := New_Copy (Old_Itype);
1589 -- If our associated node is an entity that has already been copied,
1590 -- then set the associated node of the copy to point to the right
1591 -- copy. If we have copied an Itype that is itself the associated
1592 -- node of some previously copied Itype, then we set the right
1593 -- pointer in the other direction.
1595 if Present (Actual_Map) then
1597 -- Case of hash tables used
1599 if NCT_Hash_Tables_Used then
1601 Ent := NCT_Assoc.Get (Associated_Node_For_Itype (Old_Itype));
1602 if Present (Ent) then
1603 Set_Associated_Node_For_Itype (New_Itype, Ent);
1606 Ent := NCT_Itype_Assoc.Get (Old_Itype);
1607 if Present (Ent) then
1608 Set_Associated_Node_For_Itype (Ent, New_Itype);
1611 -- Case of hash tables not used
1614 E := First_Elmt (Actual_Map);
1615 while Present (E) loop
1616 if Associated_Node_For_Itype (Old_Itype) = Node (E) then
1617 Set_Associated_Node_For_Itype
1618 (New_Itype, Node (Next_Elmt (E)));
1621 if Is_Type (Node (E))
1623 Old_Itype = Associated_Node_For_Itype (Node (E))
1625 Set_Associated_Node_For_Itype
1626 (Node (Next_Elmt (E)), New_Itype);
1629 E := Next_Elmt (Next_Elmt (E));
1634 if Present (Freeze_Node (New_Itype)) then
1635 Set_Is_Frozen (New_Itype, False);
1636 Set_Freeze_Node (New_Itype, Empty);
1639 -- Add new association to map
1641 if No (Actual_Map) then
1642 Actual_Map := New_Elmt_List;
1645 Append_Elmt (Old_Itype, Actual_Map);
1646 Append_Elmt (New_Itype, Actual_Map);
1648 if NCT_Hash_Tables_Used then
1649 NCT_Assoc.Set (Old_Itype, New_Itype);
1652 NCT_Table_Entries := NCT_Table_Entries + 1;
1654 if NCT_Table_Entries > NCT_Hash_Threshhold then
1655 Build_NCT_Hash_Tables;
1659 -- If a record subtype is simply copied, the entity list will be
1660 -- shared. Thus cloned_Subtype must be set to indicate the sharing.
1662 if Ekind (Old_Itype) = E_Record_Subtype
1663 or else Ekind (Old_Itype) = E_Class_Wide_Subtype
1665 Set_Cloned_Subtype (New_Itype, Old_Itype);
1668 -- Visit descendents that eventually get copied
1670 Visit_Field (Union_Id (Etype (Old_Itype)), Old_Itype);
1672 if Is_Discrete_Type (Old_Itype) then
1673 Visit_Field (Union_Id (Scalar_Range (Old_Itype)), Old_Itype);
1675 elsif Has_Discriminants (Base_Type (Old_Itype)) then
1676 -- ??? This should involve call to Visit_Field.
1677 Visit_Elist (Discriminant_Constraint (Old_Itype));
1679 elsif Is_Array_Type (Old_Itype) then
1680 if Present (First_Index (Old_Itype)) then
1681 Visit_Field (Union_Id (List_Containing
1682 (First_Index (Old_Itype))),
1686 if Is_Packed (Old_Itype) then
1687 Visit_Field (Union_Id (Packed_Array_Type (Old_Itype)),
1697 procedure Visit_List (L : List_Id) is
1701 if L /= No_List then
1704 while Present (N) loop
1715 procedure Visit_Node (N : Node_Or_Entity_Id) is
1717 -- Start of processing for Visit_Node
1720 -- Handle case of an Itype, which must be copied
1722 if Has_Extension (N)
1723 and then Is_Itype (N)
1725 -- Nothing to do if already in the list. This can happen with an
1726 -- Itype entity that appears more than once in the tree.
1727 -- Note that we do not want to visit descendents in this case.
1729 -- Test for already in list when hash table is used
1731 if NCT_Hash_Tables_Used then
1732 if Present (NCT_Assoc.Get (Entity_Id (N))) then
1736 -- Test for already in list when hash table not used
1743 if Present (Actual_Map) then
1744 E := First_Elmt (Actual_Map);
1745 while Present (E) loop
1746 if Node (E) = N then
1749 E := Next_Elmt (Next_Elmt (E));
1759 -- Visit descendents
1761 Visit_Field (Field1 (N), N);
1762 Visit_Field (Field2 (N), N);
1763 Visit_Field (Field3 (N), N);
1764 Visit_Field (Field4 (N), N);
1765 Visit_Field (Field5 (N), N);
1768 -- Start of processing for New_Copy_Tree
1773 -- See if we should use hash table
1775 if No (Actual_Map) then
1776 NCT_Hash_Tables_Used := False;
1783 NCT_Table_Entries := 0;
1784 Elmt := First_Elmt (Actual_Map);
1785 while Present (Elmt) loop
1786 NCT_Table_Entries := NCT_Table_Entries + 1;
1791 if NCT_Table_Entries > NCT_Hash_Threshhold then
1792 Build_NCT_Hash_Tables;
1794 NCT_Hash_Tables_Used := False;
1799 -- Hash table set up if required, now start phase one by visiting
1800 -- top node (we will recursively visit the descendents).
1802 Visit_Node (Source);
1804 -- Now the second phase of the copy can start. First we process
1805 -- all the mapped entities, copying their descendents.
1807 if Present (Actual_Map) then
1810 New_Itype : Entity_Id;
1813 Elmt := First_Elmt (Actual_Map);
1814 while Present (Elmt) loop
1816 New_Itype := Node (Elmt);
1817 Copy_Itype_With_Replacement (New_Itype);
1823 -- Now we can copy the actual tree
1825 return Copy_Node_With_Replacement (Source);
1833 (New_Node_Kind : Node_Kind;
1834 New_Sloc : Source_Ptr) return Entity_Id
1838 procedure New_Entity_Debugging_Output;
1839 -- Debugging routine for debug flag N
1840 pragma Inline (New_Entity_Debugging_Output);
1842 ---------------------------------
1843 -- New_Entity_Debugging_Output --
1844 ---------------------------------
1846 procedure New_Entity_Debugging_Output is
1848 if Debug_Flag_N then
1849 Write_Str ("Allocate entity, Id = ");
1850 Write_Int (Int (Ent));
1852 Write_Location (New_Sloc);
1854 Write_Str (Node_Kind'Image (New_Node_Kind));
1857 end New_Entity_Debugging_Output;
1859 -- Start of processing for New_Entity
1862 pragma Assert (New_Node_Kind in N_Entity);
1864 Ent := Allocate_Initialize_Node (Empty, With_Extension => True);
1866 -- If this is a node with a real location and we are generating
1867 -- source nodes, then reset Current_Error_Node. This is useful
1868 -- if we bomb during parsing to get a error location for the bomb.
1870 if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
1871 Current_Error_Node := Ent;
1874 Nodes.Table (Ent).Nkind := New_Node_Kind;
1875 Nodes.Table (Ent).Sloc := New_Sloc;
1876 pragma Debug (New_Entity_Debugging_Output);
1886 (New_Node_Kind : Node_Kind;
1887 New_Sloc : Source_Ptr) return Node_Id
1891 procedure New_Node_Debugging_Output;
1892 -- Debugging routine for debug flag N
1893 pragma Inline (New_Node_Debugging_Output);
1895 --------------------------
1896 -- New_Debugging_Output --
1897 --------------------------
1899 procedure New_Node_Debugging_Output is
1901 if Debug_Flag_N then
1902 Write_Str ("Allocate node, Id = ");
1903 Write_Int (Int (Nod));
1905 Write_Location (New_Sloc);
1907 Write_Str (Node_Kind'Image (New_Node_Kind));
1910 end New_Node_Debugging_Output;
1912 -- Start of processing for New_Node
1915 pragma Assert (New_Node_Kind not in N_Entity);
1916 Nod := Allocate_Initialize_Node (Empty, With_Extension => False);
1917 Nodes.Table (Nod).Nkind := New_Node_Kind;
1918 Nodes.Table (Nod).Sloc := New_Sloc;
1919 pragma Debug (New_Node_Debugging_Output);
1921 -- If this is a node with a real location and we are generating
1922 -- source nodes, then reset Current_Error_Node. This is useful
1923 -- if we bomb during parsing to get a error location for the bomb.
1925 if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
1926 Current_Error_Node := Nod;
1936 function Nkind (N : Node_Id) return Node_Kind is
1938 return Nodes.Table (N).Nkind;
1945 function No (N : Node_Id) return Boolean is
1954 function Nodes_Address return System.Address is
1956 return Nodes.Table (First_Node_Id)'Address;
1963 function Num_Nodes return Nat is
1972 function Original_Node (Node : Node_Id) return Node_Id is
1974 return Orig_Nodes.Table (Node);
1981 function Paren_Count (N : Node_Id) return Paren_Count_Type is
1982 C : Paren_Count_Type := 0;
1985 pragma Assert (N in Nodes.First .. Nodes.Last);
1987 if Nodes.Table (N).Pflag1 then
1991 if Nodes.Table (N).Pflag2 then
2002 function Parent (N : Node_Id) return Node_Id is
2004 if Is_List_Member (N) then
2005 return Parent (List_Containing (N));
2007 return Node_Id (Nodes.Table (N).Link);
2015 function Present (N : Node_Id) return Boolean is
2020 --------------------------------
2021 -- Preserve_Comes_From_Source --
2022 --------------------------------
2024 procedure Preserve_Comes_From_Source (NewN, OldN : Node_Id) is
2026 Nodes.Table (NewN).Comes_From_Source :=
2027 Nodes.Table (OldN).Comes_From_Source;
2028 end Preserve_Comes_From_Source;
2034 function Relocate_Node (Source : Node_Id) return Node_Id is
2042 New_Node := New_Copy (Source);
2043 Fix_Parents (Source, New_Node);
2045 -- We now set the parent of the new node to be the same as the
2046 -- parent of the source. Almost always this parent will be
2047 -- replaced by a new value when the relocated node is reattached
2048 -- to the tree, but by doing it now, we ensure that this node is
2049 -- not even temporarily disconnected from the tree. Note that this
2050 -- does not happen free, because in the list case, the parent does
2053 Set_Parent (New_Node, Parent (Source));
2055 -- If the node being relocated was a rewriting of some original
2056 -- node, then the relocated node has the same original node.
2058 if Orig_Nodes.Table (Source) /= Source then
2059 Orig_Nodes.Table (New_Node) := Orig_Nodes.Table (Source);
2069 procedure Replace (Old_Node, New_Node : Node_Id) is
2070 Old_Post : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
2071 Old_CFS : constant Boolean := Nodes.Table (Old_Node).Comes_From_Source;
2075 (not Has_Extension (Old_Node)
2076 and not Has_Extension (New_Node)
2077 and not Nodes.Table (New_Node).In_List);
2079 -- Do copy, preserving link and in list status and comes from source
2081 Copy_Node (Source => New_Node, Destination => Old_Node);
2082 Nodes.Table (Old_Node).Comes_From_Source := Old_CFS;
2083 Nodes.Table (Old_Node).Error_Posted := Old_Post;
2085 -- Fix parents of substituted node, since it has changed identity
2087 Fix_Parents (New_Node, Old_Node);
2089 -- Since we are doing a replace, we assume that the original node
2090 -- is intended to become the new replaced node. The call would be
2091 -- to Rewrite if there were an intention to save the original node.
2093 Orig_Nodes.Table (Old_Node) := Old_Node;
2095 -- Finally delete the source, since it is now copied
2097 Delete_Node (New_Node);
2104 procedure Rewrite (Old_Node, New_Node : Node_Id) is
2106 Old_Error_P : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
2107 -- This fields is always preserved in the new node
2109 Old_Paren_Count : Paren_Count_Type;
2110 Old_Must_Not_Freeze : Boolean;
2111 -- These fields are preserved in the new node only if the new node
2112 -- and the old node are both subexpression nodes.
2114 -- Note: it is a violation of abstraction levels for Must_Not_Freeze
2115 -- to be referenced like this. ???
2121 (not Has_Extension (Old_Node)
2122 and not Has_Extension (New_Node)
2123 and not Nodes.Table (New_Node).In_List);
2125 if Nkind (Old_Node) in N_Subexpr then
2126 Old_Paren_Count := Paren_Count (Old_Node);
2127 Old_Must_Not_Freeze := Must_Not_Freeze (Old_Node);
2129 Old_Paren_Count := 0;
2130 Old_Must_Not_Freeze := False;
2133 -- Allocate a new node, to be used to preserve the original contents
2134 -- of the Old_Node, for possible later retrival by Original_Node and
2135 -- make an entry in the Orig_Nodes table. This is only done if we have
2136 -- not already rewritten the node, as indicated by an Orig_Nodes entry
2137 -- that does not reference the Old_Node.
2139 if Orig_Nodes.Table (Old_Node) = Old_Node then
2140 Sav_Node := New_Copy (Old_Node);
2141 Orig_Nodes.Table (Sav_Node) := Sav_Node;
2142 Orig_Nodes.Table (Old_Node) := Sav_Node;
2145 -- Copy substitute node into place, preserving old fields as required
2147 Copy_Node (Source => New_Node, Destination => Old_Node);
2148 Nodes.Table (Old_Node).Error_Posted := Old_Error_P;
2150 if Nkind (New_Node) in N_Subexpr then
2151 Set_Paren_Count (Old_Node, Old_Paren_Count);
2152 Set_Must_Not_Freeze (Old_Node, Old_Must_Not_Freeze);
2155 Fix_Parents (New_Node, Old_Node);
2162 procedure Set_Analyzed (N : Node_Id; Val : Boolean := True) is
2164 Nodes.Table (N).Analyzed := Val;
2167 ---------------------------
2168 -- Set_Comes_From_Source --
2169 ---------------------------
2171 procedure Set_Comes_From_Source (N : Node_Id; Val : Boolean) is
2173 pragma Assert (N in Nodes.First .. Nodes.Last);
2174 Nodes.Table (N).Comes_From_Source := Val;
2175 end Set_Comes_From_Source;
2177 -----------------------------------
2178 -- Set_Comes_From_Source_Default --
2179 -----------------------------------
2181 procedure Set_Comes_From_Source_Default (Default : Boolean) is
2183 Default_Node.Comes_From_Source := Default;
2184 end Set_Comes_From_Source_Default;
2186 --------------------
2187 -- Set_Convention --
2188 --------------------
2190 procedure Set_Convention (E : Entity_Id; Val : Convention_Id) is
2192 pragma Assert (Nkind (E) in N_Entity);
2195 (Nodes.Table (E + 2).Field12'Unrestricted_Access)).Convention :=
2203 procedure Set_Ekind (E : Entity_Id; Val : Entity_Kind) is
2205 pragma Assert (Nkind (E) in N_Entity);
2206 Nodes.Table (E + 1).Nkind := E_To_N (Val);
2209 ----------------------
2210 -- Set_Error_Posted --
2211 ----------------------
2213 procedure Set_Error_Posted (N : Node_Id; Val : Boolean := True) is
2215 Nodes.Table (N).Error_Posted := Val;
2216 end Set_Error_Posted;
2218 ---------------------
2219 -- Set_Paren_Count --
2220 ---------------------
2222 procedure Set_Paren_Count (N : Node_Id; Val : Paren_Count_Type) is
2224 pragma Assert (Nkind (N) in N_Subexpr);
2225 Nodes.Table (N).Pflag1 := (Val mod 2 /= 0);
2226 Nodes.Table (N).Pflag2 := (Val >= 2);
2227 end Set_Paren_Count;
2233 procedure Set_Parent (N : Node_Id; Val : Node_Id) is
2235 pragma Assert (not Nodes.Table (N).In_List);
2236 Nodes.Table (N).Link := Union_Id (Val);
2243 procedure Set_Sloc (N : Node_Id; Val : Source_Ptr) is
2245 Nodes.Table (N).Sloc := Val;
2252 function Sloc (N : Node_Id) return Source_Ptr is
2254 return Nodes.Table (N).Sloc;
2261 function Traverse_Func (Node : Node_Id) return Traverse_Result is
2263 function Traverse_Field (Fld : Union_Id) return Traverse_Result;
2264 -- Fld is one of the fields of Node. If the field points to a
2265 -- syntactic node or list, then this node or list is traversed,
2266 -- and the result is the result of this traversal. Otherwise
2267 -- a value of True is returned with no processing.
2269 --------------------
2270 -- Traverse_Field --
2271 --------------------
2273 function Traverse_Field (Fld : Union_Id) return Traverse_Result is
2275 if Fld = Union_Id (Empty) then
2278 -- Descendent is a node
2280 elsif Fld in Node_Range then
2282 -- Traverse descendent that is syntactic subtree node
2284 if Parent (Node_Id (Fld)) = Node
2285 or else Original_Node (Parent (Node_Id (Fld))) = Node
2287 return Traverse_Func (Node_Id (Fld));
2289 -- Node that is not a syntactic subtree
2295 -- Descendent is a list
2297 elsif Fld in List_Range then
2299 -- Traverse descendent that is a syntactic subtree list
2301 if Parent (List_Id (Fld)) = Node
2302 or else Original_Node (Parent (List_Id (Fld))) = Node
2305 Elmt : Node_Id := First (List_Id (Fld));
2307 while Present (Elmt) loop
2308 if Traverse_Func (Elmt) = Abandon then
2318 -- List that is not a syntactic subtree
2324 -- Field was not a node or a list
2331 -- Start of processing for Traverse_Func
2334 case Process (Node) is
2342 if Traverse_Field (Union_Id (Field1 (Node))) = Abandon
2344 Traverse_Field (Union_Id (Field2 (Node))) = Abandon
2346 Traverse_Field (Union_Id (Field3 (Node))) = Abandon
2348 Traverse_Field (Union_Id (Field4 (Node))) = Abandon
2350 Traverse_Field (Union_Id (Field5 (Node))) = Abandon
2360 Onode : constant Node_Id := Original_Node (Node);
2363 if Traverse_Field (Union_Id (Field1 (Onode))) = Abandon
2365 Traverse_Field (Union_Id (Field2 (Onode))) = Abandon
2367 Traverse_Field (Union_Id (Field3 (Onode))) = Abandon
2369 Traverse_Field (Union_Id (Field4 (Onode))) = Abandon
2371 Traverse_Field (Union_Id (Field5 (Onode))) = Abandon
2386 procedure Traverse_Proc (Node : Node_Id) is
2387 function Traverse is new Traverse_Func (Process);
2388 Discard : Traverse_Result;
2389 pragma Warnings (Off, Discard);
2392 Discard := Traverse (Node);
2399 procedure Tree_Read is
2401 Tree_Read_Int (Node_Count);
2403 Orig_Nodes.Tree_Read;
2410 procedure Tree_Write is
2412 Tree_Write_Int (Node_Count);
2414 Orig_Nodes.Tree_Write;
2417 ------------------------------
2418 -- Unchecked Access Package --
2419 ------------------------------
2421 package body Unchecked_Access is
2423 function Field1 (N : Node_Id) return Union_Id is
2425 pragma Assert (N in Nodes.First .. Nodes.Last);
2426 return Nodes.Table (N).Field1;
2429 function Field2 (N : Node_Id) return Union_Id is
2431 pragma Assert (N in Nodes.First .. Nodes.Last);
2432 return Nodes.Table (N).Field2;
2435 function Field3 (N : Node_Id) return Union_Id is
2437 pragma Assert (N in Nodes.First .. Nodes.Last);
2438 return Nodes.Table (N).Field3;
2441 function Field4 (N : Node_Id) return Union_Id is
2443 pragma Assert (N in Nodes.First .. Nodes.Last);
2444 return Nodes.Table (N).Field4;
2447 function Field5 (N : Node_Id) return Union_Id is
2449 pragma Assert (N in Nodes.First .. Nodes.Last);
2450 return Nodes.Table (N).Field5;
2453 function Field6 (N : Node_Id) return Union_Id is
2455 pragma Assert (Nkind (N) in N_Entity);
2456 return Nodes.Table (N + 1).Field6;
2459 function Field7 (N : Node_Id) return Union_Id is
2461 pragma Assert (Nkind (N) in N_Entity);
2462 return Nodes.Table (N + 1).Field7;
2465 function Field8 (N : Node_Id) return Union_Id is
2467 pragma Assert (Nkind (N) in N_Entity);
2468 return Nodes.Table (N + 1).Field8;
2471 function Field9 (N : Node_Id) return Union_Id is
2473 pragma Assert (Nkind (N) in N_Entity);
2474 return Nodes.Table (N + 1).Field9;
2477 function Field10 (N : Node_Id) return Union_Id is
2479 pragma Assert (Nkind (N) in N_Entity);
2480 return Nodes.Table (N + 1).Field10;
2483 function Field11 (N : Node_Id) return Union_Id is
2485 pragma Assert (Nkind (N) in N_Entity);
2486 return Nodes.Table (N + 1).Field11;
2489 function Field12 (N : Node_Id) return Union_Id is
2491 pragma Assert (Nkind (N) in N_Entity);
2492 return Nodes.Table (N + 1).Field12;
2495 function Field13 (N : Node_Id) return Union_Id is
2497 pragma Assert (Nkind (N) in N_Entity);
2498 return Nodes.Table (N + 2).Field6;
2501 function Field14 (N : Node_Id) return Union_Id is
2503 pragma Assert (Nkind (N) in N_Entity);
2504 return Nodes.Table (N + 2).Field7;
2507 function Field15 (N : Node_Id) return Union_Id is
2509 pragma Assert (Nkind (N) in N_Entity);
2510 return Nodes.Table (N + 2).Field8;
2513 function Field16 (N : Node_Id) return Union_Id is
2515 pragma Assert (Nkind (N) in N_Entity);
2516 return Nodes.Table (N + 2).Field9;
2519 function Field17 (N : Node_Id) return Union_Id is
2521 pragma Assert (Nkind (N) in N_Entity);
2522 return Nodes.Table (N + 2).Field10;
2525 function Field18 (N : Node_Id) return Union_Id is
2527 pragma Assert (Nkind (N) in N_Entity);
2528 return Nodes.Table (N + 2).Field11;
2531 function Field19 (N : Node_Id) return Union_Id is
2533 pragma Assert (Nkind (N) in N_Entity);
2534 return Nodes.Table (N + 3).Field6;
2537 function Field20 (N : Node_Id) return Union_Id is
2539 pragma Assert (Nkind (N) in N_Entity);
2540 return Nodes.Table (N + 3).Field7;
2543 function Field21 (N : Node_Id) return Union_Id is
2545 pragma Assert (Nkind (N) in N_Entity);
2546 return Nodes.Table (N + 3).Field8;
2549 function Field22 (N : Node_Id) return Union_Id is
2551 pragma Assert (Nkind (N) in N_Entity);
2552 return Nodes.Table (N + 3).Field9;
2555 function Field23 (N : Node_Id) return Union_Id is
2557 pragma Assert (Nkind (N) in N_Entity);
2558 return Nodes.Table (N + 3).Field10;
2561 function Node1 (N : Node_Id) return Node_Id is
2563 pragma Assert (N in Nodes.First .. Nodes.Last);
2564 return Node_Id (Nodes.Table (N).Field1);
2567 function Node2 (N : Node_Id) return Node_Id is
2569 pragma Assert (N in Nodes.First .. Nodes.Last);
2570 return Node_Id (Nodes.Table (N).Field2);
2573 function Node3 (N : Node_Id) return Node_Id is
2575 pragma Assert (N in Nodes.First .. Nodes.Last);
2576 return Node_Id (Nodes.Table (N).Field3);
2579 function Node4 (N : Node_Id) return Node_Id is
2581 pragma Assert (N in Nodes.First .. Nodes.Last);
2582 return Node_Id (Nodes.Table (N).Field4);
2585 function Node5 (N : Node_Id) return Node_Id is
2587 pragma Assert (N in Nodes.First .. Nodes.Last);
2588 return Node_Id (Nodes.Table (N).Field5);
2591 function Node6 (N : Node_Id) return Node_Id is
2593 pragma Assert (Nkind (N) in N_Entity);
2594 return Node_Id (Nodes.Table (N + 1).Field6);
2597 function Node7 (N : Node_Id) return Node_Id is
2599 pragma Assert (Nkind (N) in N_Entity);
2600 return Node_Id (Nodes.Table (N + 1).Field7);
2603 function Node8 (N : Node_Id) return Node_Id is
2605 pragma Assert (Nkind (N) in N_Entity);
2606 return Node_Id (Nodes.Table (N + 1).Field8);
2609 function Node9 (N : Node_Id) return Node_Id is
2611 pragma Assert (Nkind (N) in N_Entity);
2612 return Node_Id (Nodes.Table (N + 1).Field9);
2615 function Node10 (N : Node_Id) return Node_Id is
2617 pragma Assert (Nkind (N) in N_Entity);
2618 return Node_Id (Nodes.Table (N + 1).Field10);
2621 function Node11 (N : Node_Id) return Node_Id is
2623 pragma Assert (Nkind (N) in N_Entity);
2624 return Node_Id (Nodes.Table (N + 1).Field11);
2627 function Node12 (N : Node_Id) return Node_Id is
2629 pragma Assert (Nkind (N) in N_Entity);
2630 return Node_Id (Nodes.Table (N + 1).Field12);
2633 function Node13 (N : Node_Id) return Node_Id is
2635 pragma Assert (Nkind (N) in N_Entity);
2636 return Node_Id (Nodes.Table (N + 2).Field6);
2639 function Node14 (N : Node_Id) return Node_Id is
2641 pragma Assert (Nkind (N) in N_Entity);
2642 return Node_Id (Nodes.Table (N + 2).Field7);
2645 function Node15 (N : Node_Id) return Node_Id is
2647 pragma Assert (Nkind (N) in N_Entity);
2648 return Node_Id (Nodes.Table (N + 2).Field8);
2651 function Node16 (N : Node_Id) return Node_Id is
2653 pragma Assert (Nkind (N) in N_Entity);
2654 return Node_Id (Nodes.Table (N + 2).Field9);
2657 function Node17 (N : Node_Id) return Node_Id is
2659 pragma Assert (Nkind (N) in N_Entity);
2660 return Node_Id (Nodes.Table (N + 2).Field10);
2663 function Node18 (N : Node_Id) return Node_Id is
2665 pragma Assert (Nkind (N) in N_Entity);
2666 return Node_Id (Nodes.Table (N + 2).Field11);
2669 function Node19 (N : Node_Id) return Node_Id is
2671 pragma Assert (Nkind (N) in N_Entity);
2672 return Node_Id (Nodes.Table (N + 3).Field6);
2675 function Node20 (N : Node_Id) return Node_Id is
2677 pragma Assert (Nkind (N) in N_Entity);
2678 return Node_Id (Nodes.Table (N + 3).Field7);
2681 function Node21 (N : Node_Id) return Node_Id is
2683 pragma Assert (Nkind (N) in N_Entity);
2684 return Node_Id (Nodes.Table (N + 3).Field8);
2687 function Node22 (N : Node_Id) return Node_Id is
2689 pragma Assert (Nkind (N) in N_Entity);
2690 return Node_Id (Nodes.Table (N + 3).Field9);
2693 function Node23 (N : Node_Id) return Node_Id is
2695 pragma Assert (Nkind (N) in N_Entity);
2696 return Node_Id (Nodes.Table (N + 3).Field10);
2699 function List1 (N : Node_Id) return List_Id is
2701 pragma Assert (N in Nodes.First .. Nodes.Last);
2702 return List_Id (Nodes.Table (N).Field1);
2705 function List2 (N : Node_Id) return List_Id is
2707 pragma Assert (N in Nodes.First .. Nodes.Last);
2708 return List_Id (Nodes.Table (N).Field2);
2711 function List3 (N : Node_Id) return List_Id is
2713 pragma Assert (N in Nodes.First .. Nodes.Last);
2714 return List_Id (Nodes.Table (N).Field3);
2717 function List4 (N : Node_Id) return List_Id is
2719 pragma Assert (N in Nodes.First .. Nodes.Last);
2720 return List_Id (Nodes.Table (N).Field4);
2723 function List5 (N : Node_Id) return List_Id is
2725 pragma Assert (N in Nodes.First .. Nodes.Last);
2726 return List_Id (Nodes.Table (N).Field5);
2729 function List10 (N : Node_Id) return List_Id is
2731 pragma Assert (Nkind (N) in N_Entity);
2732 return List_Id (Nodes.Table (N + 1).Field10);
2735 function List14 (N : Node_Id) return List_Id is
2737 pragma Assert (Nkind (N) in N_Entity);
2738 return List_Id (Nodes.Table (N + 2).Field7);
2741 function Elist2 (N : Node_Id) return Elist_Id is
2743 return Elist_Id (Nodes.Table (N).Field2);
2746 function Elist3 (N : Node_Id) return Elist_Id is
2748 return Elist_Id (Nodes.Table (N).Field3);
2751 function Elist4 (N : Node_Id) return Elist_Id is
2753 return Elist_Id (Nodes.Table (N).Field4);
2756 function Elist8 (N : Node_Id) return Elist_Id is
2758 pragma Assert (Nkind (N) in N_Entity);
2759 return Elist_Id (Nodes.Table (N + 1).Field8);
2762 function Elist13 (N : Node_Id) return Elist_Id is
2764 pragma Assert (Nkind (N) in N_Entity);
2765 return Elist_Id (Nodes.Table (N + 2).Field6);
2768 function Elist15 (N : Node_Id) return Elist_Id is
2770 pragma Assert (Nkind (N) in N_Entity);
2771 return Elist_Id (Nodes.Table (N + 2).Field8);
2774 function Elist16 (N : Node_Id) return Elist_Id is
2776 pragma Assert (Nkind (N) in N_Entity);
2777 return Elist_Id (Nodes.Table (N + 2).Field9);
2780 function Elist18 (N : Node_Id) return Elist_Id is
2782 pragma Assert (Nkind (N) in N_Entity);
2783 return Elist_Id (Nodes.Table (N + 2).Field11);
2786 function Elist21 (N : Node_Id) return Elist_Id is
2788 pragma Assert (Nkind (N) in N_Entity);
2789 return Elist_Id (Nodes.Table (N + 3).Field8);
2792 function Elist23 (N : Node_Id) return Elist_Id is
2794 pragma Assert (Nkind (N) in N_Entity);
2795 return Elist_Id (Nodes.Table (N + 3).Field10);
2798 function Name1 (N : Node_Id) return Name_Id is
2800 pragma Assert (N in Nodes.First .. Nodes.Last);
2801 return Name_Id (Nodes.Table (N).Field1);
2804 function Name2 (N : Node_Id) return Name_Id is
2806 pragma Assert (N in Nodes.First .. Nodes.Last);
2807 return Name_Id (Nodes.Table (N).Field2);
2810 function Str3 (N : Node_Id) return String_Id is
2812 pragma Assert (N in Nodes.First .. Nodes.Last);
2813 return String_Id (Nodes.Table (N).Field3);
2816 function Char_Code2 (N : Node_Id) return Char_Code is
2818 pragma Assert (N in Nodes.First .. Nodes.Last);
2819 return Char_Code (Nodes.Table (N).Field2 - Char_Code_Bias);
2822 function Uint3 (N : Node_Id) return Uint is
2823 pragma Assert (N in Nodes.First .. Nodes.Last);
2824 U : constant Union_Id := Nodes.Table (N).Field3;
2830 return From_Union (U);
2834 function Uint4 (N : Node_Id) return Uint is
2835 pragma Assert (N in Nodes.First .. Nodes.Last);
2836 U : constant Union_Id := Nodes.Table (N).Field4;
2842 return From_Union (U);
2846 function Uint5 (N : Node_Id) return Uint is
2847 pragma Assert (N in Nodes.First .. Nodes.Last);
2848 U : constant Union_Id := Nodes.Table (N).Field5;
2854 return From_Union (U);
2858 function Uint8 (N : Node_Id) return Uint is
2859 pragma Assert (Nkind (N) in N_Entity);
2860 U : constant Union_Id := Nodes.Table (N + 1).Field8;
2866 return From_Union (U);
2870 function Uint9 (N : Node_Id) return Uint is
2871 pragma Assert (Nkind (N) in N_Entity);
2872 U : constant Union_Id := Nodes.Table (N + 1).Field9;
2878 return From_Union (U);
2882 function Uint11 (N : Node_Id) return Uint is
2883 pragma Assert (Nkind (N) in N_Entity);
2884 U : constant Union_Id := Nodes.Table (N + 1).Field11;
2890 return From_Union (U);
2894 function Uint10 (N : Node_Id) return Uint is
2895 pragma Assert (Nkind (N) in N_Entity);
2896 U : constant Union_Id := Nodes.Table (N + 1).Field10;
2902 return From_Union (U);
2906 function Uint12 (N : Node_Id) return Uint is
2907 pragma Assert (Nkind (N) in N_Entity);
2908 U : constant Union_Id := Nodes.Table (N + 1).Field12;
2914 return From_Union (U);
2918 function Uint13 (N : Node_Id) return Uint is
2919 pragma Assert (Nkind (N) in N_Entity);
2920 U : constant Union_Id := Nodes.Table (N + 2).Field6;
2926 return From_Union (U);
2930 function Uint14 (N : Node_Id) return Uint is
2931 pragma Assert (Nkind (N) in N_Entity);
2932 U : constant Union_Id := Nodes.Table (N + 2).Field7;
2938 return From_Union (U);
2942 function Uint15 (N : Node_Id) return Uint is
2943 pragma Assert (Nkind (N) in N_Entity);
2944 U : constant Union_Id := Nodes.Table (N + 2).Field8;
2950 return From_Union (U);
2954 function Uint16 (N : Node_Id) return Uint is
2955 pragma Assert (Nkind (N) in N_Entity);
2956 U : constant Union_Id := Nodes.Table (N + 2).Field9;
2962 return From_Union (U);
2966 function Uint17 (N : Node_Id) return Uint is
2967 pragma Assert (Nkind (N) in N_Entity);
2968 U : constant Union_Id := Nodes.Table (N + 2).Field10;
2974 return From_Union (U);
2978 function Uint22 (N : Node_Id) return Uint is
2979 pragma Assert (Nkind (N) in N_Entity);
2980 U : constant Union_Id := Nodes.Table (N + 3).Field9;
2986 return From_Union (U);
2990 function Ureal3 (N : Node_Id) return Ureal is
2992 pragma Assert (N in Nodes.First .. Nodes.Last);
2993 return From_Union (Nodes.Table (N).Field3);
2996 function Ureal18 (N : Node_Id) return Ureal is
2998 pragma Assert (Nkind (N) in N_Entity);
2999 return From_Union (Nodes.Table (N + 2).Field11);
3002 function Ureal21 (N : Node_Id) return Ureal is
3004 pragma Assert (Nkind (N) in N_Entity);
3005 return From_Union (Nodes.Table (N + 3).Field8);
3008 function Flag4 (N : Node_Id) return Boolean is
3010 pragma Assert (N in Nodes.First .. Nodes.Last);
3011 return Nodes.Table (N).Flag4;
3014 function Flag5 (N : Node_Id) return Boolean is
3016 pragma Assert (N in Nodes.First .. Nodes.Last);
3017 return Nodes.Table (N).Flag5;
3020 function Flag6 (N : Node_Id) return Boolean is
3022 pragma Assert (N in Nodes.First .. Nodes.Last);
3023 return Nodes.Table (N).Flag6;
3026 function Flag7 (N : Node_Id) return Boolean is
3028 pragma Assert (N in Nodes.First .. Nodes.Last);
3029 return Nodes.Table (N).Flag7;
3032 function Flag8 (N : Node_Id) return Boolean is
3034 pragma Assert (N in Nodes.First .. Nodes.Last);
3035 return Nodes.Table (N).Flag8;
3038 function Flag9 (N : Node_Id) return Boolean is
3040 pragma Assert (N in Nodes.First .. Nodes.Last);
3041 return Nodes.Table (N).Flag9;
3044 function Flag10 (N : Node_Id) return Boolean is
3046 pragma Assert (N in Nodes.First .. Nodes.Last);
3047 return Nodes.Table (N).Flag10;
3050 function Flag11 (N : Node_Id) return Boolean is
3052 pragma Assert (N in Nodes.First .. Nodes.Last);
3053 return Nodes.Table (N).Flag11;
3056 function Flag12 (N : Node_Id) return Boolean is
3058 pragma Assert (N in Nodes.First .. Nodes.Last);
3059 return Nodes.Table (N).Flag12;
3062 function Flag13 (N : Node_Id) return Boolean is
3064 pragma Assert (N in Nodes.First .. Nodes.Last);
3065 return Nodes.Table (N).Flag13;
3068 function Flag14 (N : Node_Id) return Boolean is
3070 pragma Assert (N in Nodes.First .. Nodes.Last);
3071 return Nodes.Table (N).Flag14;
3074 function Flag15 (N : Node_Id) return Boolean is
3076 pragma Assert (N in Nodes.First .. Nodes.Last);
3077 return Nodes.Table (N).Flag15;
3080 function Flag16 (N : Node_Id) return Boolean is
3082 pragma Assert (N in Nodes.First .. Nodes.Last);
3083 return Nodes.Table (N).Flag16;
3086 function Flag17 (N : Node_Id) return Boolean is
3088 pragma Assert (N in Nodes.First .. Nodes.Last);
3089 return Nodes.Table (N).Flag17;
3092 function Flag18 (N : Node_Id) return Boolean is
3094 pragma Assert (N in Nodes.First .. Nodes.Last);
3095 return Nodes.Table (N).Flag18;
3098 function Flag19 (N : Node_Id) return Boolean is
3100 pragma Assert (Nkind (N) in N_Entity);
3101 return Nodes.Table (N + 1).In_List;
3104 function Flag20 (N : Node_Id) return Boolean is
3106 pragma Assert (Nkind (N) in N_Entity);
3107 return Nodes.Table (N + 1).Unused_1;
3110 function Flag21 (N : Node_Id) return Boolean is
3112 pragma Assert (Nkind (N) in N_Entity);
3113 return Nodes.Table (N + 1).Rewrite_Ins;
3116 function Flag22 (N : Node_Id) return Boolean is
3118 pragma Assert (Nkind (N) in N_Entity);
3119 return Nodes.Table (N + 1).Analyzed;
3122 function Flag23 (N : Node_Id) return Boolean is
3124 pragma Assert (Nkind (N) in N_Entity);
3125 return Nodes.Table (N + 1).Comes_From_Source;
3128 function Flag24 (N : Node_Id) return Boolean is
3130 pragma Assert (Nkind (N) in N_Entity);
3131 return Nodes.Table (N + 1).Error_Posted;
3134 function Flag25 (N : Node_Id) return Boolean is
3136 pragma Assert (Nkind (N) in N_Entity);
3137 return Nodes.Table (N + 1).Flag4;
3140 function Flag26 (N : Node_Id) return Boolean is
3142 pragma Assert (Nkind (N) in N_Entity);
3143 return Nodes.Table (N + 1).Flag5;
3146 function Flag27 (N : Node_Id) return Boolean is
3148 pragma Assert (Nkind (N) in N_Entity);
3149 return Nodes.Table (N + 1).Flag6;
3152 function Flag28 (N : Node_Id) return Boolean is
3154 pragma Assert (Nkind (N) in N_Entity);
3155 return Nodes.Table (N + 1).Flag7;
3158 function Flag29 (N : Node_Id) return Boolean is
3160 pragma Assert (Nkind (N) in N_Entity);
3161 return Nodes.Table (N + 1).Flag8;
3164 function Flag30 (N : Node_Id) return Boolean is
3166 pragma Assert (Nkind (N) in N_Entity);
3167 return Nodes.Table (N + 1).Flag9;
3170 function Flag31 (N : Node_Id) return Boolean is
3172 pragma Assert (Nkind (N) in N_Entity);
3173 return Nodes.Table (N + 1).Flag10;
3176 function Flag32 (N : Node_Id) return Boolean is
3178 pragma Assert (Nkind (N) in N_Entity);
3179 return Nodes.Table (N + 1).Flag11;
3182 function Flag33 (N : Node_Id) return Boolean is
3184 pragma Assert (Nkind (N) in N_Entity);
3185 return Nodes.Table (N + 1).Flag12;
3188 function Flag34 (N : Node_Id) return Boolean is
3190 pragma Assert (Nkind (N) in N_Entity);
3191 return Nodes.Table (N + 1).Flag13;
3194 function Flag35 (N : Node_Id) return Boolean is
3196 pragma Assert (Nkind (N) in N_Entity);
3197 return Nodes.Table (N + 1).Flag14;
3200 function Flag36 (N : Node_Id) return Boolean is
3202 pragma Assert (Nkind (N) in N_Entity);
3203 return Nodes.Table (N + 1).Flag15;
3206 function Flag37 (N : Node_Id) return Boolean is
3208 pragma Assert (Nkind (N) in N_Entity);
3209 return Nodes.Table (N + 1).Flag16;
3212 function Flag38 (N : Node_Id) return Boolean is
3214 pragma Assert (Nkind (N) in N_Entity);
3215 return Nodes.Table (N + 1).Flag17;
3218 function Flag39 (N : Node_Id) return Boolean is
3220 pragma Assert (Nkind (N) in N_Entity);
3221 return Nodes.Table (N + 1).Flag18;
3224 function Flag40 (N : Node_Id) return Boolean is
3226 pragma Assert (Nkind (N) in N_Entity);
3227 return Nodes.Table (N + 2).In_List;
3230 function Flag41 (N : Node_Id) return Boolean is
3232 pragma Assert (Nkind (N) in N_Entity);
3233 return Nodes.Table (N + 2).Unused_1;
3236 function Flag42 (N : Node_Id) return Boolean is
3238 pragma Assert (Nkind (N) in N_Entity);
3239 return Nodes.Table (N + 2).Rewrite_Ins;
3242 function Flag43 (N : Node_Id) return Boolean is
3244 pragma Assert (Nkind (N) in N_Entity);
3245 return Nodes.Table (N + 2).Analyzed;
3248 function Flag44 (N : Node_Id) return Boolean is
3250 pragma Assert (Nkind (N) in N_Entity);
3251 return Nodes.Table (N + 2).Comes_From_Source;
3254 function Flag45 (N : Node_Id) return Boolean is
3256 pragma Assert (Nkind (N) in N_Entity);
3257 return Nodes.Table (N + 2).Error_Posted;
3260 function Flag46 (N : Node_Id) return Boolean is
3262 pragma Assert (Nkind (N) in N_Entity);
3263 return Nodes.Table (N + 2).Flag4;
3266 function Flag47 (N : Node_Id) return Boolean is
3268 pragma Assert (Nkind (N) in N_Entity);
3269 return Nodes.Table (N + 2).Flag5;
3272 function Flag48 (N : Node_Id) return Boolean is
3274 pragma Assert (Nkind (N) in N_Entity);
3275 return Nodes.Table (N + 2).Flag6;
3278 function Flag49 (N : Node_Id) return Boolean is
3280 pragma Assert (Nkind (N) in N_Entity);
3281 return Nodes.Table (N + 2).Flag7;
3284 function Flag50 (N : Node_Id) return Boolean is
3286 pragma Assert (Nkind (N) in N_Entity);
3287 return Nodes.Table (N + 2).Flag8;
3290 function Flag51 (N : Node_Id) return Boolean is
3292 pragma Assert (Nkind (N) in N_Entity);
3293 return Nodes.Table (N + 2).Flag9;
3296 function Flag52 (N : Node_Id) return Boolean is
3298 pragma Assert (Nkind (N) in N_Entity);
3299 return Nodes.Table (N + 2).Flag10;
3302 function Flag53 (N : Node_Id) return Boolean is
3304 pragma Assert (Nkind (N) in N_Entity);
3305 return Nodes.Table (N + 2).Flag11;
3308 function Flag54 (N : Node_Id) return Boolean is
3310 pragma Assert (Nkind (N) in N_Entity);
3311 return Nodes.Table (N + 2).Flag12;
3314 function Flag55 (N : Node_Id) return Boolean is
3316 pragma Assert (Nkind (N) in N_Entity);
3317 return Nodes.Table (N + 2).Flag13;
3320 function Flag56 (N : Node_Id) return Boolean is
3322 pragma Assert (Nkind (N) in N_Entity);
3323 return Nodes.Table (N + 2).Flag14;
3326 function Flag57 (N : Node_Id) return Boolean is
3328 pragma Assert (Nkind (N) in N_Entity);
3329 return Nodes.Table (N + 2).Flag15;
3332 function Flag58 (N : Node_Id) return Boolean is
3334 pragma Assert (Nkind (N) in N_Entity);
3335 return Nodes.Table (N + 2).Flag16;
3338 function Flag59 (N : Node_Id) return Boolean is
3340 pragma Assert (Nkind (N) in N_Entity);
3341 return Nodes.Table (N + 2).Flag17;
3344 function Flag60 (N : Node_Id) return Boolean is
3346 pragma Assert (Nkind (N) in N_Entity);
3347 return Nodes.Table (N + 2).Flag18;
3350 function Flag61 (N : Node_Id) return Boolean is
3352 pragma Assert (Nkind (N) in N_Entity);
3353 return Nodes.Table (N + 1).Pflag1;
3356 function Flag62 (N : Node_Id) return Boolean is
3358 pragma Assert (Nkind (N) in N_Entity);
3359 return Nodes.Table (N + 1).Pflag2;
3362 function Flag63 (N : Node_Id) return Boolean is
3364 pragma Assert (Nkind (N) in N_Entity);
3365 return Nodes.Table (N + 2).Pflag1;
3368 function Flag64 (N : Node_Id) return Boolean is
3370 pragma Assert (Nkind (N) in N_Entity);
3371 return Nodes.Table (N + 2).Pflag2;
3374 function Flag65 (N : Node_Id) return Boolean is
3376 pragma Assert (Nkind (N) in N_Entity);
3377 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag65;
3380 function Flag66 (N : Node_Id) return Boolean is
3382 pragma Assert (Nkind (N) in N_Entity);
3383 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag66;
3386 function Flag67 (N : Node_Id) return Boolean is
3388 pragma Assert (Nkind (N) in N_Entity);
3389 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag67;
3392 function Flag68 (N : Node_Id) return Boolean is
3394 pragma Assert (Nkind (N) in N_Entity);
3395 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag68;
3398 function Flag69 (N : Node_Id) return Boolean is
3400 pragma Assert (Nkind (N) in N_Entity);
3401 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag69;
3404 function Flag70 (N : Node_Id) return Boolean is
3406 pragma Assert (Nkind (N) in N_Entity);
3407 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag70;
3410 function Flag71 (N : Node_Id) return Boolean is
3412 pragma Assert (Nkind (N) in N_Entity);
3413 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag71;
3416 function Flag72 (N : Node_Id) return Boolean is
3418 pragma Assert (Nkind (N) in N_Entity);
3419 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag72;
3422 function Flag73 (N : Node_Id) return Boolean is
3424 pragma Assert (Nkind (N) in N_Entity);
3425 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag73;
3428 function Flag74 (N : Node_Id) return Boolean is
3430 pragma Assert (Nkind (N) in N_Entity);
3431 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag74;
3434 function Flag75 (N : Node_Id) return Boolean is
3436 pragma Assert (Nkind (N) in N_Entity);
3437 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag75;
3440 function Flag76 (N : Node_Id) return Boolean is
3442 pragma Assert (Nkind (N) in N_Entity);
3443 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag76;
3446 function Flag77 (N : Node_Id) return Boolean is
3448 pragma Assert (Nkind (N) in N_Entity);
3449 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag77;
3452 function Flag78 (N : Node_Id) return Boolean is
3454 pragma Assert (Nkind (N) in N_Entity);
3455 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag78;
3458 function Flag79 (N : Node_Id) return Boolean is
3460 pragma Assert (Nkind (N) in N_Entity);
3461 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag79;
3464 function Flag80 (N : Node_Id) return Boolean is
3466 pragma Assert (Nkind (N) in N_Entity);
3467 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag80;
3470 function Flag81 (N : Node_Id) return Boolean is
3472 pragma Assert (Nkind (N) in N_Entity);
3473 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag81;
3476 function Flag82 (N : Node_Id) return Boolean is
3478 pragma Assert (Nkind (N) in N_Entity);
3479 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag82;
3482 function Flag83 (N : Node_Id) return Boolean is
3484 pragma Assert (Nkind (N) in N_Entity);
3485 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag83;
3488 function Flag84 (N : Node_Id) return Boolean is
3490 pragma Assert (Nkind (N) in N_Entity);
3491 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag84;
3494 function Flag85 (N : Node_Id) return Boolean is
3496 pragma Assert (Nkind (N) in N_Entity);
3497 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag85;
3500 function Flag86 (N : Node_Id) return Boolean is
3502 pragma Assert (Nkind (N) in N_Entity);
3503 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag86;
3506 function Flag87 (N : Node_Id) return Boolean is
3508 pragma Assert (Nkind (N) in N_Entity);
3509 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag87;
3512 function Flag88 (N : Node_Id) return Boolean is
3514 pragma Assert (Nkind (N) in N_Entity);
3515 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag88;
3518 function Flag89 (N : Node_Id) return Boolean is
3520 pragma Assert (Nkind (N) in N_Entity);
3521 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag89;
3524 function Flag90 (N : Node_Id) return Boolean is
3526 pragma Assert (Nkind (N) in N_Entity);
3527 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag90;
3530 function Flag91 (N : Node_Id) return Boolean is
3532 pragma Assert (Nkind (N) in N_Entity);
3533 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag91;
3536 function Flag92 (N : Node_Id) return Boolean is
3538 pragma Assert (Nkind (N) in N_Entity);
3539 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag92;
3542 function Flag93 (N : Node_Id) return Boolean is
3544 pragma Assert (Nkind (N) in N_Entity);
3545 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag93;
3548 function Flag94 (N : Node_Id) return Boolean is
3550 pragma Assert (Nkind (N) in N_Entity);
3551 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag94;
3554 function Flag95 (N : Node_Id) return Boolean is
3556 pragma Assert (Nkind (N) in N_Entity);
3557 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag95;
3560 function Flag96 (N : Node_Id) return Boolean is
3562 pragma Assert (Nkind (N) in N_Entity);
3563 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag96;
3566 function Flag97 (N : Node_Id) return Boolean is
3568 pragma Assert (Nkind (N) in N_Entity);
3569 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag97;
3572 function Flag98 (N : Node_Id) return Boolean is
3574 pragma Assert (Nkind (N) in N_Entity);
3575 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag98;
3578 function Flag99 (N : Node_Id) return Boolean is
3580 pragma Assert (Nkind (N) in N_Entity);
3581 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag99;
3584 function Flag100 (N : Node_Id) return Boolean is
3586 pragma Assert (Nkind (N) in N_Entity);
3587 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag100;
3590 function Flag101 (N : Node_Id) return Boolean is
3592 pragma Assert (Nkind (N) in N_Entity);
3593 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag101;
3596 function Flag102 (N : Node_Id) return Boolean is
3598 pragma Assert (Nkind (N) in N_Entity);
3599 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag102;
3602 function Flag103 (N : Node_Id) return Boolean is
3604 pragma Assert (Nkind (N) in N_Entity);
3605 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag103;
3608 function Flag104 (N : Node_Id) return Boolean is
3610 pragma Assert (Nkind (N) in N_Entity);
3611 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag104;
3614 function Flag105 (N : Node_Id) return Boolean is
3616 pragma Assert (Nkind (N) in N_Entity);
3617 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag105;
3620 function Flag106 (N : Node_Id) return Boolean is
3622 pragma Assert (Nkind (N) in N_Entity);
3623 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag106;
3626 function Flag107 (N : Node_Id) return Boolean is
3628 pragma Assert (Nkind (N) in N_Entity);
3629 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag107;
3632 function Flag108 (N : Node_Id) return Boolean is
3634 pragma Assert (Nkind (N) in N_Entity);
3635 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag108;
3638 function Flag109 (N : Node_Id) return Boolean is
3640 pragma Assert (Nkind (N) in N_Entity);
3641 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag109;
3644 function Flag110 (N : Node_Id) return Boolean is
3646 pragma Assert (Nkind (N) in N_Entity);
3647 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag110;
3650 function Flag111 (N : Node_Id) return Boolean is
3652 pragma Assert (Nkind (N) in N_Entity);
3653 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag111;
3656 function Flag112 (N : Node_Id) return Boolean is
3658 pragma Assert (Nkind (N) in N_Entity);
3659 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag112;
3662 function Flag113 (N : Node_Id) return Boolean is
3664 pragma Assert (Nkind (N) in N_Entity);
3665 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag113;
3668 function Flag114 (N : Node_Id) return Boolean is
3670 pragma Assert (Nkind (N) in N_Entity);
3671 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag114;
3674 function Flag115 (N : Node_Id) return Boolean is
3676 pragma Assert (Nkind (N) in N_Entity);
3677 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag115;
3680 function Flag116 (N : Node_Id) return Boolean is
3682 pragma Assert (Nkind (N) in N_Entity);
3683 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag116;
3686 function Flag117 (N : Node_Id) return Boolean is
3688 pragma Assert (Nkind (N) in N_Entity);
3689 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag117;
3692 function Flag118 (N : Node_Id) return Boolean is
3694 pragma Assert (Nkind (N) in N_Entity);
3695 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag118;
3698 function Flag119 (N : Node_Id) return Boolean is
3700 pragma Assert (Nkind (N) in N_Entity);
3701 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag119;
3704 function Flag120 (N : Node_Id) return Boolean is
3706 pragma Assert (Nkind (N) in N_Entity);
3707 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag120;
3710 function Flag121 (N : Node_Id) return Boolean is
3712 pragma Assert (Nkind (N) in N_Entity);
3713 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag121;
3716 function Flag122 (N : Node_Id) return Boolean is
3718 pragma Assert (Nkind (N) in N_Entity);
3719 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag122;
3722 function Flag123 (N : Node_Id) return Boolean is
3724 pragma Assert (Nkind (N) in N_Entity);
3725 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag123;
3728 function Flag124 (N : Node_Id) return Boolean is
3730 pragma Assert (Nkind (N) in N_Entity);
3731 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag124;
3734 function Flag125 (N : Node_Id) return Boolean is
3736 pragma Assert (Nkind (N) in N_Entity);
3737 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag125;
3740 function Flag126 (N : Node_Id) return Boolean is
3742 pragma Assert (Nkind (N) in N_Entity);
3743 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag126;
3746 function Flag127 (N : Node_Id) return Boolean is
3748 pragma Assert (Nkind (N) in N_Entity);
3749 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag127;
3752 function Flag128 (N : Node_Id) return Boolean is
3754 pragma Assert (Nkind (N) in N_Entity);
3755 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag128;
3758 function Flag129 (N : Node_Id) return Boolean is
3760 pragma Assert (Nkind (N) in N_Entity);
3761 return Nodes.Table (N + 3).In_List;
3764 function Flag130 (N : Node_Id) return Boolean is
3766 pragma Assert (Nkind (N) in N_Entity);
3767 return Nodes.Table (N + 3).Unused_1;
3770 function Flag131 (N : Node_Id) return Boolean is
3772 pragma Assert (Nkind (N) in N_Entity);
3773 return Nodes.Table (N + 3).Rewrite_Ins;
3776 function Flag132 (N : Node_Id) return Boolean is
3778 pragma Assert (Nkind (N) in N_Entity);
3779 return Nodes.Table (N + 3).Analyzed;
3782 function Flag133 (N : Node_Id) return Boolean is
3784 pragma Assert (Nkind (N) in N_Entity);
3785 return Nodes.Table (N + 3).Comes_From_Source;
3788 function Flag134 (N : Node_Id) return Boolean is
3790 pragma Assert (Nkind (N) in N_Entity);
3791 return Nodes.Table (N + 3).Error_Posted;
3794 function Flag135 (N : Node_Id) return Boolean is
3796 pragma Assert (Nkind (N) in N_Entity);
3797 return Nodes.Table (N + 3).Flag4;
3800 function Flag136 (N : Node_Id) return Boolean is
3802 pragma Assert (Nkind (N) in N_Entity);
3803 return Nodes.Table (N + 3).Flag5;
3806 function Flag137 (N : Node_Id) return Boolean is
3808 pragma Assert (Nkind (N) in N_Entity);
3809 return Nodes.Table (N + 3).Flag6;
3812 function Flag138 (N : Node_Id) return Boolean is
3814 pragma Assert (Nkind (N) in N_Entity);
3815 return Nodes.Table (N + 3).Flag7;
3818 function Flag139 (N : Node_Id) return Boolean is
3820 pragma Assert (Nkind (N) in N_Entity);
3821 return Nodes.Table (N + 3).Flag8;
3824 function Flag140 (N : Node_Id) return Boolean is
3826 pragma Assert (Nkind (N) in N_Entity);
3827 return Nodes.Table (N + 3).Flag9;
3830 function Flag141 (N : Node_Id) return Boolean is
3832 pragma Assert (Nkind (N) in N_Entity);
3833 return Nodes.Table (N + 3).Flag10;
3836 function Flag142 (N : Node_Id) return Boolean is
3838 pragma Assert (Nkind (N) in N_Entity);
3839 return Nodes.Table (N + 3).Flag11;
3842 function Flag143 (N : Node_Id) return Boolean is
3844 pragma Assert (Nkind (N) in N_Entity);
3845 return Nodes.Table (N + 3).Flag12;
3848 function Flag144 (N : Node_Id) return Boolean is
3850 pragma Assert (Nkind (N) in N_Entity);
3851 return Nodes.Table (N + 3).Flag13;
3854 function Flag145 (N : Node_Id) return Boolean is
3856 pragma Assert (Nkind (N) in N_Entity);
3857 return Nodes.Table (N + 3).Flag14;
3860 function Flag146 (N : Node_Id) return Boolean is
3862 pragma Assert (Nkind (N) in N_Entity);
3863 return Nodes.Table (N + 3).Flag15;
3866 function Flag147 (N : Node_Id) return Boolean is
3868 pragma Assert (Nkind (N) in N_Entity);
3869 return Nodes.Table (N + 3).Flag16;
3872 function Flag148 (N : Node_Id) return Boolean is
3874 pragma Assert (Nkind (N) in N_Entity);
3875 return Nodes.Table (N + 3).Flag17;
3878 function Flag149 (N : Node_Id) return Boolean is
3880 pragma Assert (Nkind (N) in N_Entity);
3881 return Nodes.Table (N + 3).Flag18;
3884 function Flag150 (N : Node_Id) return Boolean is
3886 pragma Assert (Nkind (N) in N_Entity);
3887 return Nodes.Table (N + 3).Pflag1;
3890 function Flag151 (N : Node_Id) return Boolean is
3892 pragma Assert (Nkind (N) in N_Entity);
3893 return Nodes.Table (N + 3).Pflag2;
3896 function Flag152 (N : Node_Id) return Boolean is
3898 pragma Assert (Nkind (N) in N_Entity);
3899 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag152;
3902 function Flag153 (N : Node_Id) return Boolean is
3904 pragma Assert (Nkind (N) in N_Entity);
3905 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag153;
3908 function Flag154 (N : Node_Id) return Boolean is
3910 pragma Assert (Nkind (N) in N_Entity);
3911 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag154;
3914 function Flag155 (N : Node_Id) return Boolean is
3916 pragma Assert (Nkind (N) in N_Entity);
3917 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag155;
3920 function Flag156 (N : Node_Id) return Boolean is
3922 pragma Assert (Nkind (N) in N_Entity);
3923 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag156;
3926 function Flag157 (N : Node_Id) return Boolean is
3928 pragma Assert (Nkind (N) in N_Entity);
3929 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag157;
3932 function Flag158 (N : Node_Id) return Boolean is
3934 pragma Assert (Nkind (N) in N_Entity);
3935 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag158;
3938 function Flag159 (N : Node_Id) return Boolean is
3940 pragma Assert (Nkind (N) in N_Entity);
3941 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag159;
3944 function Flag160 (N : Node_Id) return Boolean is
3946 pragma Assert (Nkind (N) in N_Entity);
3947 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag160;
3950 function Flag161 (N : Node_Id) return Boolean is
3952 pragma Assert (Nkind (N) in N_Entity);
3953 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag161;
3956 function Flag162 (N : Node_Id) return Boolean is
3958 pragma Assert (Nkind (N) in N_Entity);
3959 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag162;
3962 function Flag163 (N : Node_Id) return Boolean is
3964 pragma Assert (Nkind (N) in N_Entity);
3965 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag163;
3968 function Flag164 (N : Node_Id) return Boolean is
3970 pragma Assert (Nkind (N) in N_Entity);
3971 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag164;
3974 function Flag165 (N : Node_Id) return Boolean is
3976 pragma Assert (Nkind (N) in N_Entity);
3977 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag165;
3980 function Flag166 (N : Node_Id) return Boolean is
3982 pragma Assert (Nkind (N) in N_Entity);
3983 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag166;
3986 function Flag167 (N : Node_Id) return Boolean is
3988 pragma Assert (Nkind (N) in N_Entity);
3989 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag167;
3992 function Flag168 (N : Node_Id) return Boolean is
3994 pragma Assert (Nkind (N) in N_Entity);
3995 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag168;
3998 function Flag169 (N : Node_Id) return Boolean is
4000 pragma Assert (Nkind (N) in N_Entity);
4001 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag169;
4004 function Flag170 (N : Node_Id) return Boolean is
4006 pragma Assert (Nkind (N) in N_Entity);
4007 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag170;
4010 function Flag171 (N : Node_Id) return Boolean is
4012 pragma Assert (Nkind (N) in N_Entity);
4013 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag171;
4016 function Flag172 (N : Node_Id) return Boolean is
4018 pragma Assert (Nkind (N) in N_Entity);
4019 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag172;
4022 function Flag173 (N : Node_Id) return Boolean is
4024 pragma Assert (Nkind (N) in N_Entity);
4025 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag173;
4028 function Flag174 (N : Node_Id) return Boolean is
4030 pragma Assert (Nkind (N) in N_Entity);
4031 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag174;
4034 function Flag175 (N : Node_Id) return Boolean is
4036 pragma Assert (Nkind (N) in N_Entity);
4037 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag175;
4040 function Flag176 (N : Node_Id) return Boolean is
4042 pragma Assert (Nkind (N) in N_Entity);
4043 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag176;
4046 function Flag177 (N : Node_Id) return Boolean is
4048 pragma Assert (Nkind (N) in N_Entity);
4049 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag177;
4052 function Flag178 (N : Node_Id) return Boolean is
4054 pragma Assert (Nkind (N) in N_Entity);
4055 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag178;
4058 function Flag179 (N : Node_Id) return Boolean is
4060 pragma Assert (Nkind (N) in N_Entity);
4061 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag179;
4064 function Flag180 (N : Node_Id) return Boolean is
4066 pragma Assert (Nkind (N) in N_Entity);
4067 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag180;
4070 function Flag181 (N : Node_Id) return Boolean is
4072 pragma Assert (Nkind (N) in N_Entity);
4073 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag181;
4076 function Flag182 (N : Node_Id) return Boolean is
4078 pragma Assert (Nkind (N) in N_Entity);
4079 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag182;
4082 function Flag183 (N : Node_Id) return Boolean is
4084 pragma Assert (Nkind (N) in N_Entity);
4085 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag183;
4088 procedure Set_Nkind (N : Node_Id; Val : Node_Kind) is
4090 pragma Assert (N in Nodes.First .. Nodes.Last);
4091 Nodes.Table (N).Nkind := Val;
4094 procedure Set_Field1 (N : Node_Id; Val : Union_Id) is
4096 pragma Assert (N in Nodes.First .. Nodes.Last);
4097 Nodes.Table (N).Field1 := Val;
4100 procedure Set_Field2 (N : Node_Id; Val : Union_Id) is
4102 pragma Assert (N in Nodes.First .. Nodes.Last);
4103 Nodes.Table (N).Field2 := Val;
4106 procedure Set_Field3 (N : Node_Id; Val : Union_Id) is
4108 pragma Assert (N in Nodes.First .. Nodes.Last);
4109 Nodes.Table (N).Field3 := Val;
4112 procedure Set_Field4 (N : Node_Id; Val : Union_Id) is
4114 pragma Assert (N in Nodes.First .. Nodes.Last);
4115 Nodes.Table (N).Field4 := Val;
4118 procedure Set_Field5 (N : Node_Id; Val : Union_Id) is
4120 pragma Assert (N in Nodes.First .. Nodes.Last);
4121 Nodes.Table (N).Field5 := Val;
4124 procedure Set_Field6 (N : Node_Id; Val : Union_Id) is
4126 pragma Assert (Nkind (N) in N_Entity);
4127 Nodes.Table (N + 1).Field6 := Val;
4130 procedure Set_Field7 (N : Node_Id; Val : Union_Id) is
4132 pragma Assert (Nkind (N) in N_Entity);
4133 Nodes.Table (N + 1).Field7 := Val;
4136 procedure Set_Field8 (N : Node_Id; Val : Union_Id) is
4138 pragma Assert (Nkind (N) in N_Entity);
4139 Nodes.Table (N + 1).Field8 := Val;
4142 procedure Set_Field9 (N : Node_Id; Val : Union_Id) is
4144 pragma Assert (Nkind (N) in N_Entity);
4145 Nodes.Table (N + 1).Field9 := Val;
4148 procedure Set_Field10 (N : Node_Id; Val : Union_Id) is
4150 pragma Assert (Nkind (N) in N_Entity);
4151 Nodes.Table (N + 1).Field10 := Val;
4154 procedure Set_Field11 (N : Node_Id; Val : Union_Id) is
4156 pragma Assert (Nkind (N) in N_Entity);
4157 Nodes.Table (N + 1).Field11 := Val;
4160 procedure Set_Field12 (N : Node_Id; Val : Union_Id) is
4162 pragma Assert (Nkind (N) in N_Entity);
4163 Nodes.Table (N + 1).Field12 := Val;
4166 procedure Set_Field13 (N : Node_Id; Val : Union_Id) is
4168 pragma Assert (Nkind (N) in N_Entity);
4169 Nodes.Table (N + 2).Field6 := Val;
4172 procedure Set_Field14 (N : Node_Id; Val : Union_Id) is
4174 pragma Assert (Nkind (N) in N_Entity);
4175 Nodes.Table (N + 2).Field7 := Val;
4178 procedure Set_Field15 (N : Node_Id; Val : Union_Id) is
4180 pragma Assert (Nkind (N) in N_Entity);
4181 Nodes.Table (N + 2).Field8 := Val;
4184 procedure Set_Field16 (N : Node_Id; Val : Union_Id) is
4186 pragma Assert (Nkind (N) in N_Entity);
4187 Nodes.Table (N + 2).Field9 := Val;
4190 procedure Set_Field17 (N : Node_Id; Val : Union_Id) is
4192 pragma Assert (Nkind (N) in N_Entity);
4193 Nodes.Table (N + 2).Field10 := Val;
4196 procedure Set_Field18 (N : Node_Id; Val : Union_Id) is
4198 pragma Assert (Nkind (N) in N_Entity);
4199 Nodes.Table (N + 2).Field11 := Val;
4202 procedure Set_Field19 (N : Node_Id; Val : Union_Id) is
4204 pragma Assert (Nkind (N) in N_Entity);
4205 Nodes.Table (N + 3).Field6 := Val;
4208 procedure Set_Field20 (N : Node_Id; Val : Union_Id) is
4210 pragma Assert (Nkind (N) in N_Entity);
4211 Nodes.Table (N + 3).Field7 := Val;
4214 procedure Set_Field21 (N : Node_Id; Val : Union_Id) is
4216 pragma Assert (Nkind (N) in N_Entity);
4217 Nodes.Table (N + 3).Field8 := Val;
4220 procedure Set_Field22 (N : Node_Id; Val : Union_Id) is
4222 pragma Assert (Nkind (N) in N_Entity);
4223 Nodes.Table (N + 3).Field9 := Val;
4226 procedure Set_Field23 (N : Node_Id; Val : Union_Id) is
4228 pragma Assert (Nkind (N) in N_Entity);
4229 Nodes.Table (N + 3).Field10 := Val;
4232 procedure Set_Node1 (N : Node_Id; Val : Node_Id) is
4234 pragma Assert (N in Nodes.First .. Nodes.Last);
4235 Nodes.Table (N).Field1 := Union_Id (Val);
4238 procedure Set_Node2 (N : Node_Id; Val : Node_Id) is
4240 pragma Assert (N in Nodes.First .. Nodes.Last);
4241 Nodes.Table (N).Field2 := Union_Id (Val);
4244 procedure Set_Node3 (N : Node_Id; Val : Node_Id) is
4246 pragma Assert (N in Nodes.First .. Nodes.Last);
4247 Nodes.Table (N).Field3 := Union_Id (Val);
4250 procedure Set_Node4 (N : Node_Id; Val : Node_Id) is
4252 pragma Assert (N in Nodes.First .. Nodes.Last);
4253 Nodes.Table (N).Field4 := Union_Id (Val);
4256 procedure Set_Node5 (N : Node_Id; Val : Node_Id) is
4258 pragma Assert (N in Nodes.First .. Nodes.Last);
4259 Nodes.Table (N).Field5 := Union_Id (Val);
4262 procedure Set_Node6 (N : Node_Id; Val : Node_Id) is
4264 pragma Assert (Nkind (N) in N_Entity);
4265 Nodes.Table (N + 1).Field6 := Union_Id (Val);
4268 procedure Set_Node7 (N : Node_Id; Val : Node_Id) is
4270 pragma Assert (Nkind (N) in N_Entity);
4271 Nodes.Table (N + 1).Field7 := Union_Id (Val);
4274 procedure Set_Node8 (N : Node_Id; Val : Node_Id) is
4276 pragma Assert (Nkind (N) in N_Entity);
4277 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4280 procedure Set_Node9 (N : Node_Id; Val : Node_Id) is
4282 pragma Assert (Nkind (N) in N_Entity);
4283 Nodes.Table (N + 1).Field9 := Union_Id (Val);
4286 procedure Set_Node10 (N : Node_Id; Val : Node_Id) is
4288 pragma Assert (Nkind (N) in N_Entity);
4289 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4292 procedure Set_Node11 (N : Node_Id; Val : Node_Id) is
4294 pragma Assert (Nkind (N) in N_Entity);
4295 Nodes.Table (N + 1).Field11 := Union_Id (Val);
4298 procedure Set_Node12 (N : Node_Id; Val : Node_Id) is
4300 pragma Assert (Nkind (N) in N_Entity);
4301 Nodes.Table (N + 1).Field12 := Union_Id (Val);
4304 procedure Set_Node13 (N : Node_Id; Val : Node_Id) is
4306 pragma Assert (Nkind (N) in N_Entity);
4307 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4310 procedure Set_Node14 (N : Node_Id; Val : Node_Id) is
4312 pragma Assert (Nkind (N) in N_Entity);
4313 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4316 procedure Set_Node15 (N : Node_Id; Val : Node_Id) is
4318 pragma Assert (Nkind (N) in N_Entity);
4319 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4322 procedure Set_Node16 (N : Node_Id; Val : Node_Id) is
4324 pragma Assert (Nkind (N) in N_Entity);
4325 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4328 procedure Set_Node17 (N : Node_Id; Val : Node_Id) is
4330 pragma Assert (Nkind (N) in N_Entity);
4331 Nodes.Table (N + 2).Field10 := Union_Id (Val);
4334 procedure Set_Node18 (N : Node_Id; Val : Node_Id) is
4336 pragma Assert (Nkind (N) in N_Entity);
4337 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4340 procedure Set_Node19 (N : Node_Id; Val : Node_Id) is
4342 pragma Assert (Nkind (N) in N_Entity);
4343 Nodes.Table (N + 3).Field6 := Union_Id (Val);
4346 procedure Set_Node20 (N : Node_Id; Val : Node_Id) is
4348 pragma Assert (Nkind (N) in N_Entity);
4349 Nodes.Table (N + 3).Field7 := Union_Id (Val);
4352 procedure Set_Node21 (N : Node_Id; Val : Node_Id) is
4354 pragma Assert (Nkind (N) in N_Entity);
4355 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4358 procedure Set_Node22 (N : Node_Id; Val : Node_Id) is
4360 pragma Assert (Nkind (N) in N_Entity);
4361 Nodes.Table (N + 3).Field9 := Union_Id (Val);
4364 procedure Set_Node23 (N : Node_Id; Val : Node_Id) is
4366 pragma Assert (Nkind (N) in N_Entity);
4367 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4370 procedure Set_List1 (N : Node_Id; Val : List_Id) is
4372 pragma Assert (N in Nodes.First .. Nodes.Last);
4373 Nodes.Table (N).Field1 := Union_Id (Val);
4376 procedure Set_List2 (N : Node_Id; Val : List_Id) is
4378 pragma Assert (N in Nodes.First .. Nodes.Last);
4379 Nodes.Table (N).Field2 := Union_Id (Val);
4382 procedure Set_List3 (N : Node_Id; Val : List_Id) is
4384 pragma Assert (N in Nodes.First .. Nodes.Last);
4385 Nodes.Table (N).Field3 := Union_Id (Val);
4388 procedure Set_List4 (N : Node_Id; Val : List_Id) is
4390 pragma Assert (N in Nodes.First .. Nodes.Last);
4391 Nodes.Table (N).Field4 := Union_Id (Val);
4394 procedure Set_List5 (N : Node_Id; Val : List_Id) is
4396 pragma Assert (N in Nodes.First .. Nodes.Last);
4397 Nodes.Table (N).Field5 := Union_Id (Val);
4400 procedure Set_List10 (N : Node_Id; Val : List_Id) is
4402 pragma Assert (Nkind (N) in N_Entity);
4403 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4406 procedure Set_List14 (N : Node_Id; Val : List_Id) is
4408 pragma Assert (Nkind (N) in N_Entity);
4409 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4412 procedure Set_Elist2 (N : Node_Id; Val : Elist_Id) is
4414 Nodes.Table (N).Field2 := Union_Id (Val);
4417 procedure Set_Elist3 (N : Node_Id; Val : Elist_Id) is
4419 Nodes.Table (N).Field3 := Union_Id (Val);
4422 procedure Set_Elist4 (N : Node_Id; Val : Elist_Id) is
4424 Nodes.Table (N).Field4 := Union_Id (Val);
4427 procedure Set_Elist8 (N : Node_Id; Val : Elist_Id) is
4429 pragma Assert (Nkind (N) in N_Entity);
4430 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4433 procedure Set_Elist13 (N : Node_Id; Val : Elist_Id) is
4435 pragma Assert (Nkind (N) in N_Entity);
4436 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4439 procedure Set_Elist15 (N : Node_Id; Val : Elist_Id) is
4441 pragma Assert (Nkind (N) in N_Entity);
4442 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4445 procedure Set_Elist16 (N : Node_Id; Val : Elist_Id) is
4447 pragma Assert (Nkind (N) in N_Entity);
4448 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4451 procedure Set_Elist18 (N : Node_Id; Val : Elist_Id) is
4453 pragma Assert (Nkind (N) in N_Entity);
4454 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4457 procedure Set_Elist21 (N : Node_Id; Val : Elist_Id) is
4459 pragma Assert (Nkind (N) in N_Entity);
4460 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4463 procedure Set_Elist23 (N : Node_Id; Val : Elist_Id) is
4465 pragma Assert (Nkind (N) in N_Entity);
4466 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4469 procedure Set_Name1 (N : Node_Id; Val : Name_Id) is
4471 pragma Assert (N in Nodes.First .. Nodes.Last);
4472 Nodes.Table (N).Field1 := Union_Id (Val);
4475 procedure Set_Name2 (N : Node_Id; Val : Name_Id) is
4477 pragma Assert (N in Nodes.First .. Nodes.Last);
4478 Nodes.Table (N).Field2 := Union_Id (Val);
4481 procedure Set_Str3 (N : Node_Id; Val : String_Id) is
4483 pragma Assert (N in Nodes.First .. Nodes.Last);
4484 Nodes.Table (N).Field3 := Union_Id (Val);
4487 procedure Set_Uint3 (N : Node_Id; Val : Uint) is
4489 pragma Assert (N in Nodes.First .. Nodes.Last);
4490 Nodes.Table (N).Field3 := To_Union (Val);
4493 procedure Set_Uint4 (N : Node_Id; Val : Uint) is
4495 pragma Assert (N in Nodes.First .. Nodes.Last);
4496 Nodes.Table (N).Field4 := To_Union (Val);
4499 procedure Set_Uint5 (N : Node_Id; Val : Uint) is
4501 pragma Assert (N in Nodes.First .. Nodes.Last);
4502 Nodes.Table (N).Field5 := To_Union (Val);
4505 procedure Set_Uint8 (N : Node_Id; Val : Uint) is
4507 pragma Assert (Nkind (N) in N_Entity);
4508 Nodes.Table (N + 1).Field8 := To_Union (Val);
4511 procedure Set_Uint9 (N : Node_Id; Val : Uint) is
4513 pragma Assert (Nkind (N) in N_Entity);
4514 Nodes.Table (N + 1).Field9 := To_Union (Val);
4517 procedure Set_Uint10 (N : Node_Id; Val : Uint) is
4519 pragma Assert (Nkind (N) in N_Entity);
4520 Nodes.Table (N + 1).Field10 := To_Union (Val);
4523 procedure Set_Uint11 (N : Node_Id; Val : Uint) is
4525 pragma Assert (Nkind (N) in N_Entity);
4526 Nodes.Table (N + 1).Field11 := To_Union (Val);
4529 procedure Set_Uint12 (N : Node_Id; Val : Uint) is
4531 pragma Assert (Nkind (N) in N_Entity);
4532 Nodes.Table (N + 1).Field12 := To_Union (Val);
4535 procedure Set_Uint13 (N : Node_Id; Val : Uint) is
4537 pragma Assert (Nkind (N) in N_Entity);
4538 Nodes.Table (N + 2).Field6 := To_Union (Val);
4541 procedure Set_Uint14 (N : Node_Id; Val : Uint) is
4543 pragma Assert (Nkind (N) in N_Entity);
4544 Nodes.Table (N + 2).Field7 := To_Union (Val);
4547 procedure Set_Uint15 (N : Node_Id; Val : Uint) is
4549 pragma Assert (Nkind (N) in N_Entity);
4550 Nodes.Table (N + 2).Field8 := To_Union (Val);
4553 procedure Set_Uint16 (N : Node_Id; Val : Uint) is
4555 pragma Assert (Nkind (N) in N_Entity);
4556 Nodes.Table (N + 2).Field9 := To_Union (Val);
4559 procedure Set_Uint17 (N : Node_Id; Val : Uint) is
4561 pragma Assert (Nkind (N) in N_Entity);
4562 Nodes.Table (N + 2).Field10 := To_Union (Val);
4565 procedure Set_Uint22 (N : Node_Id; Val : Uint) is
4567 pragma Assert (Nkind (N) in N_Entity);
4568 Nodes.Table (N + 3).Field9 := To_Union (Val);
4571 procedure Set_Ureal3 (N : Node_Id; Val : Ureal) is
4573 pragma Assert (N in Nodes.First .. Nodes.Last);
4574 Nodes.Table (N).Field3 := To_Union (Val);
4577 procedure Set_Ureal18 (N : Node_Id; Val : Ureal) is
4579 pragma Assert (Nkind (N) in N_Entity);
4580 Nodes.Table (N + 2).Field11 := To_Union (Val);
4583 procedure Set_Ureal21 (N : Node_Id; Val : Ureal) is
4585 pragma Assert (Nkind (N) in N_Entity);
4586 Nodes.Table (N + 3).Field8 := To_Union (Val);
4589 procedure Set_Char_Code2 (N : Node_Id; Val : Char_Code) is
4591 pragma Assert (N in Nodes.First .. Nodes.Last);
4592 Nodes.Table (N).Field2 := Union_Id (Val) + Char_Code_Bias;
4595 procedure Set_Flag4 (N : Node_Id; Val : Boolean) is
4597 pragma Assert (N in Nodes.First .. Nodes.Last);
4598 Nodes.Table (N).Flag4 := Val;
4601 procedure Set_Flag5 (N : Node_Id; Val : Boolean) is
4603 pragma Assert (N in Nodes.First .. Nodes.Last);
4604 Nodes.Table (N).Flag5 := Val;
4607 procedure Set_Flag6 (N : Node_Id; Val : Boolean) is
4609 pragma Assert (N in Nodes.First .. Nodes.Last);
4610 Nodes.Table (N).Flag6 := Val;
4613 procedure Set_Flag7 (N : Node_Id; Val : Boolean) is
4615 pragma Assert (N in Nodes.First .. Nodes.Last);
4616 Nodes.Table (N).Flag7 := Val;
4619 procedure Set_Flag8 (N : Node_Id; Val : Boolean) is
4621 pragma Assert (N in Nodes.First .. Nodes.Last);
4622 Nodes.Table (N).Flag8 := Val;
4625 procedure Set_Flag9 (N : Node_Id; Val : Boolean) is
4627 pragma Assert (N in Nodes.First .. Nodes.Last);
4628 Nodes.Table (N).Flag9 := Val;
4631 procedure Set_Flag10 (N : Node_Id; Val : Boolean) is
4633 pragma Assert (N in Nodes.First .. Nodes.Last);
4634 Nodes.Table (N).Flag10 := Val;
4637 procedure Set_Flag11 (N : Node_Id; Val : Boolean) is
4639 pragma Assert (N in Nodes.First .. Nodes.Last);
4640 Nodes.Table (N).Flag11 := Val;
4643 procedure Set_Flag12 (N : Node_Id; Val : Boolean) is
4645 pragma Assert (N in Nodes.First .. Nodes.Last);
4646 Nodes.Table (N).Flag12 := Val;
4649 procedure Set_Flag13 (N : Node_Id; Val : Boolean) is
4651 pragma Assert (N in Nodes.First .. Nodes.Last);
4652 Nodes.Table (N).Flag13 := Val;
4655 procedure Set_Flag14 (N : Node_Id; Val : Boolean) is
4657 pragma Assert (N in Nodes.First .. Nodes.Last);
4658 Nodes.Table (N).Flag14 := Val;
4661 procedure Set_Flag15 (N : Node_Id; Val : Boolean) is
4663 pragma Assert (N in Nodes.First .. Nodes.Last);
4664 Nodes.Table (N).Flag15 := Val;
4667 procedure Set_Flag16 (N : Node_Id; Val : Boolean) is
4669 pragma Assert (N in Nodes.First .. Nodes.Last);
4670 Nodes.Table (N).Flag16 := Val;
4673 procedure Set_Flag17 (N : Node_Id; Val : Boolean) is
4675 pragma Assert (N in Nodes.First .. Nodes.Last);
4676 Nodes.Table (N).Flag17 := Val;
4679 procedure Set_Flag18 (N : Node_Id; Val : Boolean) is
4681 pragma Assert (N in Nodes.First .. Nodes.Last);
4682 Nodes.Table (N).Flag18 := Val;
4685 procedure Set_Flag19 (N : Node_Id; Val : Boolean) is
4687 pragma Assert (Nkind (N) in N_Entity);
4688 Nodes.Table (N + 1).In_List := Val;
4691 procedure Set_Flag20 (N : Node_Id; Val : Boolean) is
4693 pragma Assert (Nkind (N) in N_Entity);
4694 Nodes.Table (N + 1).Unused_1 := Val;
4697 procedure Set_Flag21 (N : Node_Id; Val : Boolean) is
4699 pragma Assert (Nkind (N) in N_Entity);
4700 Nodes.Table (N + 1).Rewrite_Ins := Val;
4703 procedure Set_Flag22 (N : Node_Id; Val : Boolean) is
4705 pragma Assert (Nkind (N) in N_Entity);
4706 Nodes.Table (N + 1).Analyzed := Val;
4709 procedure Set_Flag23 (N : Node_Id; Val : Boolean) is
4711 pragma Assert (Nkind (N) in N_Entity);
4712 Nodes.Table (N + 1).Comes_From_Source := Val;
4715 procedure Set_Flag24 (N : Node_Id; Val : Boolean) is
4717 pragma Assert (Nkind (N) in N_Entity);
4718 Nodes.Table (N + 1).Error_Posted := Val;
4721 procedure Set_Flag25 (N : Node_Id; Val : Boolean) is
4723 pragma Assert (Nkind (N) in N_Entity);
4724 Nodes.Table (N + 1).Flag4 := Val;
4727 procedure Set_Flag26 (N : Node_Id; Val : Boolean) is
4729 pragma Assert (Nkind (N) in N_Entity);
4730 Nodes.Table (N + 1).Flag5 := Val;
4733 procedure Set_Flag27 (N : Node_Id; Val : Boolean) is
4735 pragma Assert (Nkind (N) in N_Entity);
4736 Nodes.Table (N + 1).Flag6 := Val;
4739 procedure Set_Flag28 (N : Node_Id; Val : Boolean) is
4741 pragma Assert (Nkind (N) in N_Entity);
4742 Nodes.Table (N + 1).Flag7 := Val;
4745 procedure Set_Flag29 (N : Node_Id; Val : Boolean) is
4747 pragma Assert (Nkind (N) in N_Entity);
4748 Nodes.Table (N + 1).Flag8 := Val;
4751 procedure Set_Flag30 (N : Node_Id; Val : Boolean) is
4753 pragma Assert (Nkind (N) in N_Entity);
4754 Nodes.Table (N + 1).Flag9 := Val;
4757 procedure Set_Flag31 (N : Node_Id; Val : Boolean) is
4759 pragma Assert (Nkind (N) in N_Entity);
4760 Nodes.Table (N + 1).Flag10 := Val;
4763 procedure Set_Flag32 (N : Node_Id; Val : Boolean) is
4765 pragma Assert (Nkind (N) in N_Entity);
4766 Nodes.Table (N + 1).Flag11 := Val;
4769 procedure Set_Flag33 (N : Node_Id; Val : Boolean) is
4771 pragma Assert (Nkind (N) in N_Entity);
4772 Nodes.Table (N + 1).Flag12 := Val;
4775 procedure Set_Flag34 (N : Node_Id; Val : Boolean) is
4777 pragma Assert (Nkind (N) in N_Entity);
4778 Nodes.Table (N + 1).Flag13 := Val;
4781 procedure Set_Flag35 (N : Node_Id; Val : Boolean) is
4783 pragma Assert (Nkind (N) in N_Entity);
4784 Nodes.Table (N + 1).Flag14 := Val;
4787 procedure Set_Flag36 (N : Node_Id; Val : Boolean) is
4789 pragma Assert (Nkind (N) in N_Entity);
4790 Nodes.Table (N + 1).Flag15 := Val;
4793 procedure Set_Flag37 (N : Node_Id; Val : Boolean) is
4795 pragma Assert (Nkind (N) in N_Entity);
4796 Nodes.Table (N + 1).Flag16 := Val;
4799 procedure Set_Flag38 (N : Node_Id; Val : Boolean) is
4801 pragma Assert (Nkind (N) in N_Entity);
4802 Nodes.Table (N + 1).Flag17 := Val;
4805 procedure Set_Flag39 (N : Node_Id; Val : Boolean) is
4807 pragma Assert (Nkind (N) in N_Entity);
4808 Nodes.Table (N + 1).Flag18 := Val;
4811 procedure Set_Flag40 (N : Node_Id; Val : Boolean) is
4813 pragma Assert (Nkind (N) in N_Entity);
4814 Nodes.Table (N + 2).In_List := Val;
4817 procedure Set_Flag41 (N : Node_Id; Val : Boolean) is
4819 pragma Assert (Nkind (N) in N_Entity);
4820 Nodes.Table (N + 2).Unused_1 := Val;
4823 procedure Set_Flag42 (N : Node_Id; Val : Boolean) is
4825 pragma Assert (Nkind (N) in N_Entity);
4826 Nodes.Table (N + 2).Rewrite_Ins := Val;
4829 procedure Set_Flag43 (N : Node_Id; Val : Boolean) is
4831 pragma Assert (Nkind (N) in N_Entity);
4832 Nodes.Table (N + 2).Analyzed := Val;
4835 procedure Set_Flag44 (N : Node_Id; Val : Boolean) is
4837 pragma Assert (Nkind (N) in N_Entity);
4838 Nodes.Table (N + 2).Comes_From_Source := Val;
4841 procedure Set_Flag45 (N : Node_Id; Val : Boolean) is
4843 pragma Assert (Nkind (N) in N_Entity);
4844 Nodes.Table (N + 2).Error_Posted := Val;
4847 procedure Set_Flag46 (N : Node_Id; Val : Boolean) is
4849 pragma Assert (Nkind (N) in N_Entity);
4850 Nodes.Table (N + 2).Flag4 := Val;
4853 procedure Set_Flag47 (N : Node_Id; Val : Boolean) is
4855 pragma Assert (Nkind (N) in N_Entity);
4856 Nodes.Table (N + 2).Flag5 := Val;
4859 procedure Set_Flag48 (N : Node_Id; Val : Boolean) is
4861 pragma Assert (Nkind (N) in N_Entity);
4862 Nodes.Table (N + 2).Flag6 := Val;
4865 procedure Set_Flag49 (N : Node_Id; Val : Boolean) is
4867 pragma Assert (Nkind (N) in N_Entity);
4868 Nodes.Table (N + 2).Flag7 := Val;
4871 procedure Set_Flag50 (N : Node_Id; Val : Boolean) is
4873 pragma Assert (Nkind (N) in N_Entity);
4874 Nodes.Table (N + 2).Flag8 := Val;
4877 procedure Set_Flag51 (N : Node_Id; Val : Boolean) is
4879 pragma Assert (Nkind (N) in N_Entity);
4880 Nodes.Table (N + 2).Flag9 := Val;
4883 procedure Set_Flag52 (N : Node_Id; Val : Boolean) is
4885 pragma Assert (Nkind (N) in N_Entity);
4886 Nodes.Table (N + 2).Flag10 := Val;
4889 procedure Set_Flag53 (N : Node_Id; Val : Boolean) is
4891 pragma Assert (Nkind (N) in N_Entity);
4892 Nodes.Table (N + 2).Flag11 := Val;
4895 procedure Set_Flag54 (N : Node_Id; Val : Boolean) is
4897 pragma Assert (Nkind (N) in N_Entity);
4898 Nodes.Table (N + 2).Flag12 := Val;
4901 procedure Set_Flag55 (N : Node_Id; Val : Boolean) is
4903 pragma Assert (Nkind (N) in N_Entity);
4904 Nodes.Table (N + 2).Flag13 := Val;
4907 procedure Set_Flag56 (N : Node_Id; Val : Boolean) is
4909 pragma Assert (Nkind (N) in N_Entity);
4910 Nodes.Table (N + 2).Flag14 := Val;
4913 procedure Set_Flag57 (N : Node_Id; Val : Boolean) is
4915 pragma Assert (Nkind (N) in N_Entity);
4916 Nodes.Table (N + 2).Flag15 := Val;
4919 procedure Set_Flag58 (N : Node_Id; Val : Boolean) is
4921 pragma Assert (Nkind (N) in N_Entity);
4922 Nodes.Table (N + 2).Flag16 := Val;
4925 procedure Set_Flag59 (N : Node_Id; Val : Boolean) is
4927 pragma Assert (Nkind (N) in N_Entity);
4928 Nodes.Table (N + 2).Flag17 := Val;
4931 procedure Set_Flag60 (N : Node_Id; Val : Boolean) is
4933 pragma Assert (Nkind (N) in N_Entity);
4934 Nodes.Table (N + 2).Flag18 := Val;
4937 procedure Set_Flag61 (N : Node_Id; Val : Boolean) is
4939 pragma Assert (Nkind (N) in N_Entity);
4940 Nodes.Table (N + 1).Pflag1 := Val;
4943 procedure Set_Flag62 (N : Node_Id; Val : Boolean) is
4945 pragma Assert (Nkind (N) in N_Entity);
4946 Nodes.Table (N + 1).Pflag2 := Val;
4949 procedure Set_Flag63 (N : Node_Id; Val : Boolean) is
4951 pragma Assert (Nkind (N) in N_Entity);
4952 Nodes.Table (N + 2).Pflag1 := Val;
4955 procedure Set_Flag64 (N : Node_Id; Val : Boolean) is
4957 pragma Assert (Nkind (N) in N_Entity);
4958 Nodes.Table (N + 2).Pflag2 := Val;
4961 procedure Set_Flag65 (N : Node_Id; Val : Boolean) is
4963 pragma Assert (Nkind (N) in N_Entity);
4966 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag65 := Val;
4969 procedure Set_Flag66 (N : Node_Id; Val : Boolean) is
4971 pragma Assert (Nkind (N) in N_Entity);
4974 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag66 := Val;
4977 procedure Set_Flag67 (N : Node_Id; Val : Boolean) is
4979 pragma Assert (Nkind (N) in N_Entity);
4982 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag67 := Val;
4985 procedure Set_Flag68 (N : Node_Id; Val : Boolean) is
4987 pragma Assert (Nkind (N) in N_Entity);
4990 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag68 := Val;
4993 procedure Set_Flag69 (N : Node_Id; Val : Boolean) is
4995 pragma Assert (Nkind (N) in N_Entity);
4998 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag69 := Val;
5001 procedure Set_Flag70 (N : Node_Id; Val : Boolean) is
5003 pragma Assert (Nkind (N) in N_Entity);
5006 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag70 := Val;
5009 procedure Set_Flag71 (N : Node_Id; Val : Boolean) is
5011 pragma Assert (Nkind (N) in N_Entity);
5014 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag71 := Val;
5017 procedure Set_Flag72 (N : Node_Id; Val : Boolean) is
5019 pragma Assert (Nkind (N) in N_Entity);
5022 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag72 := Val;
5025 procedure Set_Flag73 (N : Node_Id; Val : Boolean) is
5027 pragma Assert (Nkind (N) in N_Entity);
5030 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag73 := Val;
5033 procedure Set_Flag74 (N : Node_Id; Val : Boolean) is
5035 pragma Assert (Nkind (N) in N_Entity);
5038 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag74 := Val;
5041 procedure Set_Flag75 (N : Node_Id; Val : Boolean) is
5043 pragma Assert (Nkind (N) in N_Entity);
5046 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag75 := Val;
5049 procedure Set_Flag76 (N : Node_Id; Val : Boolean) is
5051 pragma Assert (Nkind (N) in N_Entity);
5054 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag76 := Val;
5057 procedure Set_Flag77 (N : Node_Id; Val : Boolean) is
5059 pragma Assert (Nkind (N) in N_Entity);
5062 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag77 := Val;
5065 procedure Set_Flag78 (N : Node_Id; Val : Boolean) is
5067 pragma Assert (Nkind (N) in N_Entity);
5070 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag78 := Val;
5073 procedure Set_Flag79 (N : Node_Id; Val : Boolean) is
5075 pragma Assert (Nkind (N) in N_Entity);
5078 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag79 := Val;
5081 procedure Set_Flag80 (N : Node_Id; Val : Boolean) is
5083 pragma Assert (Nkind (N) in N_Entity);
5086 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag80 := Val;
5089 procedure Set_Flag81 (N : Node_Id; Val : Boolean) is
5091 pragma Assert (Nkind (N) in N_Entity);
5094 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag81 := Val;
5097 procedure Set_Flag82 (N : Node_Id; Val : Boolean) is
5099 pragma Assert (Nkind (N) in N_Entity);
5102 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag82 := Val;
5105 procedure Set_Flag83 (N : Node_Id; Val : Boolean) is
5107 pragma Assert (Nkind (N) in N_Entity);
5110 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag83 := Val;
5113 procedure Set_Flag84 (N : Node_Id; Val : Boolean) is
5115 pragma Assert (Nkind (N) in N_Entity);
5118 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag84 := Val;
5121 procedure Set_Flag85 (N : Node_Id; Val : Boolean) is
5123 pragma Assert (Nkind (N) in N_Entity);
5126 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag85 := Val;
5129 procedure Set_Flag86 (N : Node_Id; Val : Boolean) is
5131 pragma Assert (Nkind (N) in N_Entity);
5134 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag86 := Val;
5137 procedure Set_Flag87 (N : Node_Id; Val : Boolean) is
5139 pragma Assert (Nkind (N) in N_Entity);
5142 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag87 := Val;
5145 procedure Set_Flag88 (N : Node_Id; Val : Boolean) is
5147 pragma Assert (Nkind (N) in N_Entity);
5150 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag88 := Val;
5153 procedure Set_Flag89 (N : Node_Id; Val : Boolean) is
5155 pragma Assert (Nkind (N) in N_Entity);
5158 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag89 := Val;
5161 procedure Set_Flag90 (N : Node_Id; Val : Boolean) is
5163 pragma Assert (Nkind (N) in N_Entity);
5166 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag90 := Val;
5169 procedure Set_Flag91 (N : Node_Id; Val : Boolean) is
5171 pragma Assert (Nkind (N) in N_Entity);
5174 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag91 := Val;
5177 procedure Set_Flag92 (N : Node_Id; Val : Boolean) is
5179 pragma Assert (Nkind (N) in N_Entity);
5182 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag92 := Val;
5185 procedure Set_Flag93 (N : Node_Id; Val : Boolean) is
5187 pragma Assert (Nkind (N) in N_Entity);
5190 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag93 := Val;
5193 procedure Set_Flag94 (N : Node_Id; Val : Boolean) is
5195 pragma Assert (Nkind (N) in N_Entity);
5198 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag94 := Val;
5201 procedure Set_Flag95 (N : Node_Id; Val : Boolean) is
5203 pragma Assert (Nkind (N) in N_Entity);
5206 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag95 := Val;
5209 procedure Set_Flag96 (N : Node_Id; Val : Boolean) is
5211 pragma Assert (Nkind (N) in N_Entity);
5214 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag96 := Val;
5217 procedure Set_Flag97 (N : Node_Id; Val : Boolean) is
5219 pragma Assert (Nkind (N) in N_Entity);
5222 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag97 := Val;
5225 procedure Set_Flag98 (N : Node_Id; Val : Boolean) is
5227 pragma Assert (Nkind (N) in N_Entity);
5230 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag98 := Val;
5233 procedure Set_Flag99 (N : Node_Id; Val : Boolean) is
5235 pragma Assert (Nkind (N) in N_Entity);
5238 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag99 := Val;
5241 procedure Set_Flag100 (N : Node_Id; Val : Boolean) is
5243 pragma Assert (Nkind (N) in N_Entity);
5246 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag100 := Val;
5249 procedure Set_Flag101 (N : Node_Id; Val : Boolean) is
5251 pragma Assert (Nkind (N) in N_Entity);
5254 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag101 := Val;
5257 procedure Set_Flag102 (N : Node_Id; Val : Boolean) is
5259 pragma Assert (Nkind (N) in N_Entity);
5262 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag102 := Val;
5265 procedure Set_Flag103 (N : Node_Id; Val : Boolean) is
5267 pragma Assert (Nkind (N) in N_Entity);
5270 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag103 := Val;
5273 procedure Set_Flag104 (N : Node_Id; Val : Boolean) is
5275 pragma Assert (Nkind (N) in N_Entity);
5278 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag104 := Val;
5281 procedure Set_Flag105 (N : Node_Id; Val : Boolean) is
5283 pragma Assert (Nkind (N) in N_Entity);
5286 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag105 := Val;
5289 procedure Set_Flag106 (N : Node_Id; Val : Boolean) is
5291 pragma Assert (Nkind (N) in N_Entity);
5294 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag106 := Val;
5297 procedure Set_Flag107 (N : Node_Id; Val : Boolean) is
5299 pragma Assert (Nkind (N) in N_Entity);
5302 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag107 := Val;
5305 procedure Set_Flag108 (N : Node_Id; Val : Boolean) is
5307 pragma Assert (Nkind (N) in N_Entity);
5310 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag108 := Val;
5313 procedure Set_Flag109 (N : Node_Id; Val : Boolean) is
5315 pragma Assert (Nkind (N) in N_Entity);
5318 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag109 := Val;
5321 procedure Set_Flag110 (N : Node_Id; Val : Boolean) is
5323 pragma Assert (Nkind (N) in N_Entity);
5326 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag110 := Val;
5329 procedure Set_Flag111 (N : Node_Id; Val : Boolean) is
5331 pragma Assert (Nkind (N) in N_Entity);
5334 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag111 := Val;
5337 procedure Set_Flag112 (N : Node_Id; Val : Boolean) is
5339 pragma Assert (Nkind (N) in N_Entity);
5342 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag112 := Val;
5345 procedure Set_Flag113 (N : Node_Id; Val : Boolean) is
5347 pragma Assert (Nkind (N) in N_Entity);
5350 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag113 := Val;
5353 procedure Set_Flag114 (N : Node_Id; Val : Boolean) is
5355 pragma Assert (Nkind (N) in N_Entity);
5358 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag114 := Val;
5361 procedure Set_Flag115 (N : Node_Id; Val : Boolean) is
5363 pragma Assert (Nkind (N) in N_Entity);
5366 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag115 := Val;
5369 procedure Set_Flag116 (N : Node_Id; Val : Boolean) is
5371 pragma Assert (Nkind (N) in N_Entity);
5374 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag116 := Val;
5377 procedure Set_Flag117 (N : Node_Id; Val : Boolean) is
5379 pragma Assert (Nkind (N) in N_Entity);
5382 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag117 := Val;
5385 procedure Set_Flag118 (N : Node_Id; Val : Boolean) is
5387 pragma Assert (Nkind (N) in N_Entity);
5390 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag118 := Val;
5393 procedure Set_Flag119 (N : Node_Id; Val : Boolean) is
5395 pragma Assert (Nkind (N) in N_Entity);
5398 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag119 := Val;
5401 procedure Set_Flag120 (N : Node_Id; Val : Boolean) is
5403 pragma Assert (Nkind (N) in N_Entity);
5406 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag120 := Val;
5409 procedure Set_Flag121 (N : Node_Id; Val : Boolean) is
5411 pragma Assert (Nkind (N) in N_Entity);
5414 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag121 := Val;
5417 procedure Set_Flag122 (N : Node_Id; Val : Boolean) is
5419 pragma Assert (Nkind (N) in N_Entity);
5422 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag122 := Val;
5425 procedure Set_Flag123 (N : Node_Id; Val : Boolean) is
5427 pragma Assert (Nkind (N) in N_Entity);
5430 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag123 := Val;
5433 procedure Set_Flag124 (N : Node_Id; Val : Boolean) is
5435 pragma Assert (Nkind (N) in N_Entity);
5438 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag124 := Val;
5441 procedure Set_Flag125 (N : Node_Id; Val : Boolean) is
5443 pragma Assert (Nkind (N) in N_Entity);
5446 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag125 := Val;
5449 procedure Set_Flag126 (N : Node_Id; Val : Boolean) is
5451 pragma Assert (Nkind (N) in N_Entity);
5454 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag126 := Val;
5457 procedure Set_Flag127 (N : Node_Id; Val : Boolean) is
5459 pragma Assert (Nkind (N) in N_Entity);
5462 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag127 := Val;
5465 procedure Set_Flag128 (N : Node_Id; Val : Boolean) is
5467 pragma Assert (Nkind (N) in N_Entity);
5470 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag128 := Val;
5473 procedure Set_Flag129 (N : Node_Id; Val : Boolean) is
5475 pragma Assert (Nkind (N) in N_Entity);
5476 Nodes.Table (N + 3).In_List := Val;
5479 procedure Set_Flag130 (N : Node_Id; Val : Boolean) is
5481 pragma Assert (Nkind (N) in N_Entity);
5482 Nodes.Table (N + 3).Unused_1 := Val;
5485 procedure Set_Flag131 (N : Node_Id; Val : Boolean) is
5487 pragma Assert (Nkind (N) in N_Entity);
5488 Nodes.Table (N + 3).Rewrite_Ins := Val;
5491 procedure Set_Flag132 (N : Node_Id; Val : Boolean) is
5493 pragma Assert (Nkind (N) in N_Entity);
5494 Nodes.Table (N + 3).Analyzed := Val;
5497 procedure Set_Flag133 (N : Node_Id; Val : Boolean) is
5499 pragma Assert (Nkind (N) in N_Entity);
5500 Nodes.Table (N + 3).Comes_From_Source := Val;
5503 procedure Set_Flag134 (N : Node_Id; Val : Boolean) is
5505 pragma Assert (Nkind (N) in N_Entity);
5506 Nodes.Table (N + 3).Error_Posted := Val;
5509 procedure Set_Flag135 (N : Node_Id; Val : Boolean) is
5511 pragma Assert (Nkind (N) in N_Entity);
5512 Nodes.Table (N + 3).Flag4 := Val;
5515 procedure Set_Flag136 (N : Node_Id; Val : Boolean) is
5517 pragma Assert (Nkind (N) in N_Entity);
5518 Nodes.Table (N + 3).Flag5 := Val;
5521 procedure Set_Flag137 (N : Node_Id; Val : Boolean) is
5523 pragma Assert (Nkind (N) in N_Entity);
5524 Nodes.Table (N + 3).Flag6 := Val;
5527 procedure Set_Flag138 (N : Node_Id; Val : Boolean) is
5529 pragma Assert (Nkind (N) in N_Entity);
5530 Nodes.Table (N + 3).Flag7 := Val;
5533 procedure Set_Flag139 (N : Node_Id; Val : Boolean) is
5535 pragma Assert (Nkind (N) in N_Entity);
5536 Nodes.Table (N + 3).Flag8 := Val;
5539 procedure Set_Flag140 (N : Node_Id; Val : Boolean) is
5541 pragma Assert (Nkind (N) in N_Entity);
5542 Nodes.Table (N + 3).Flag9 := Val;
5545 procedure Set_Flag141 (N : Node_Id; Val : Boolean) is
5547 pragma Assert (Nkind (N) in N_Entity);
5548 Nodes.Table (N + 3).Flag10 := Val;
5551 procedure Set_Flag142 (N : Node_Id; Val : Boolean) is
5553 pragma Assert (Nkind (N) in N_Entity);
5554 Nodes.Table (N + 3).Flag11 := Val;
5557 procedure Set_Flag143 (N : Node_Id; Val : Boolean) is
5559 pragma Assert (Nkind (N) in N_Entity);
5560 Nodes.Table (N + 3).Flag12 := Val;
5563 procedure Set_Flag144 (N : Node_Id; Val : Boolean) is
5565 pragma Assert (Nkind (N) in N_Entity);
5566 Nodes.Table (N + 3).Flag13 := Val;
5569 procedure Set_Flag145 (N : Node_Id; Val : Boolean) is
5571 pragma Assert (Nkind (N) in N_Entity);
5572 Nodes.Table (N + 3).Flag14 := Val;
5575 procedure Set_Flag146 (N : Node_Id; Val : Boolean) is
5577 pragma Assert (Nkind (N) in N_Entity);
5578 Nodes.Table (N + 3).Flag15 := Val;
5581 procedure Set_Flag147 (N : Node_Id; Val : Boolean) is
5583 pragma Assert (Nkind (N) in N_Entity);
5584 Nodes.Table (N + 3).Flag16 := Val;
5587 procedure Set_Flag148 (N : Node_Id; Val : Boolean) is
5589 pragma Assert (Nkind (N) in N_Entity);
5590 Nodes.Table (N + 3).Flag17 := Val;
5593 procedure Set_Flag149 (N : Node_Id; Val : Boolean) is
5595 pragma Assert (Nkind (N) in N_Entity);
5596 Nodes.Table (N + 3).Flag18 := Val;
5599 procedure Set_Flag150 (N : Node_Id; Val : Boolean) is
5601 pragma Assert (Nkind (N) in N_Entity);
5602 Nodes.Table (N + 3).Pflag1 := Val;
5605 procedure Set_Flag151 (N : Node_Id; Val : Boolean) is
5607 pragma Assert (Nkind (N) in N_Entity);
5608 Nodes.Table (N + 3).Pflag2 := Val;
5611 procedure Set_Flag152 (N : Node_Id; Val : Boolean) is
5613 pragma Assert (Nkind (N) in N_Entity);
5616 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag152 := Val;
5619 procedure Set_Flag153 (N : Node_Id; Val : Boolean) is
5621 pragma Assert (Nkind (N) in N_Entity);
5624 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag153 := Val;
5627 procedure Set_Flag154 (N : Node_Id; Val : Boolean) is
5629 pragma Assert (Nkind (N) in N_Entity);
5632 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag154 := Val;
5635 procedure Set_Flag155 (N : Node_Id; Val : Boolean) is
5637 pragma Assert (Nkind (N) in N_Entity);
5640 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag155 := Val;
5643 procedure Set_Flag156 (N : Node_Id; Val : Boolean) is
5645 pragma Assert (Nkind (N) in N_Entity);
5648 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag156 := Val;
5651 procedure Set_Flag157 (N : Node_Id; Val : Boolean) is
5653 pragma Assert (Nkind (N) in N_Entity);
5656 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag157 := Val;
5659 procedure Set_Flag158 (N : Node_Id; Val : Boolean) is
5661 pragma Assert (Nkind (N) in N_Entity);
5664 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag158 := Val;
5667 procedure Set_Flag159 (N : Node_Id; Val : Boolean) is
5669 pragma Assert (Nkind (N) in N_Entity);
5672 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag159 := Val;
5675 procedure Set_Flag160 (N : Node_Id; Val : Boolean) is
5677 pragma Assert (Nkind (N) in N_Entity);
5680 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag160 := Val;
5683 procedure Set_Flag161 (N : Node_Id; Val : Boolean) is
5685 pragma Assert (Nkind (N) in N_Entity);
5688 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag161 := Val;
5691 procedure Set_Flag162 (N : Node_Id; Val : Boolean) is
5693 pragma Assert (Nkind (N) in N_Entity);
5696 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag162 := Val;
5699 procedure Set_Flag163 (N : Node_Id; Val : Boolean) is
5701 pragma Assert (Nkind (N) in N_Entity);
5704 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag163 := Val;
5707 procedure Set_Flag164 (N : Node_Id; Val : Boolean) is
5709 pragma Assert (Nkind (N) in N_Entity);
5712 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag164 := Val;
5715 procedure Set_Flag165 (N : Node_Id; Val : Boolean) is
5717 pragma Assert (Nkind (N) in N_Entity);
5720 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag165 := Val;
5723 procedure Set_Flag166 (N : Node_Id; Val : Boolean) is
5725 pragma Assert (Nkind (N) in N_Entity);
5728 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag166 := Val;
5731 procedure Set_Flag167 (N : Node_Id; Val : Boolean) is
5733 pragma Assert (Nkind (N) in N_Entity);
5736 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag167 := Val;
5739 procedure Set_Flag168 (N : Node_Id; Val : Boolean) is
5741 pragma Assert (Nkind (N) in N_Entity);
5744 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag168 := Val;
5747 procedure Set_Flag169 (N : Node_Id; Val : Boolean) is
5749 pragma Assert (Nkind (N) in N_Entity);
5752 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag169 := Val;
5755 procedure Set_Flag170 (N : Node_Id; Val : Boolean) is
5757 pragma Assert (Nkind (N) in N_Entity);
5760 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag170 := Val;
5763 procedure Set_Flag171 (N : Node_Id; Val : Boolean) is
5765 pragma Assert (Nkind (N) in N_Entity);
5768 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag171 := Val;
5771 procedure Set_Flag172 (N : Node_Id; Val : Boolean) is
5773 pragma Assert (Nkind (N) in N_Entity);
5776 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag172 := Val;
5779 procedure Set_Flag173 (N : Node_Id; Val : Boolean) is
5781 pragma Assert (Nkind (N) in N_Entity);
5784 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag173 := Val;
5787 procedure Set_Flag174 (N : Node_Id; Val : Boolean) is
5789 pragma Assert (Nkind (N) in N_Entity);
5792 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag174 := Val;
5795 procedure Set_Flag175 (N : Node_Id; Val : Boolean) is
5797 pragma Assert (Nkind (N) in N_Entity);
5800 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag175 := Val;
5803 procedure Set_Flag176 (N : Node_Id; Val : Boolean) is
5805 pragma Assert (Nkind (N) in N_Entity);
5808 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag176 := Val;
5811 procedure Set_Flag177 (N : Node_Id; Val : Boolean) is
5813 pragma Assert (Nkind (N) in N_Entity);
5816 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag177 := Val;
5819 procedure Set_Flag178 (N : Node_Id; Val : Boolean) is
5821 pragma Assert (Nkind (N) in N_Entity);
5824 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag178 := Val;
5827 procedure Set_Flag179 (N : Node_Id; Val : Boolean) is
5829 pragma Assert (Nkind (N) in N_Entity);
5832 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag179 := Val;
5835 procedure Set_Flag180 (N : Node_Id; Val : Boolean) is
5837 pragma Assert (Nkind (N) in N_Entity);
5840 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag180 := Val;
5843 procedure Set_Flag181 (N : Node_Id; Val : Boolean) is
5845 pragma Assert (Nkind (N) in N_Entity);
5848 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag181 := Val;
5851 procedure Set_Flag182 (N : Node_Id; Val : Boolean) is
5853 pragma Assert (Nkind (N) in N_Entity);
5856 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag182 := Val;
5859 procedure Set_Flag183 (N : Node_Id; Val : Boolean) is
5861 pragma Assert (Nkind (N) in N_Entity);
5864 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag183 := Val;
5867 procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id) is
5869 pragma Assert (N in Nodes.First .. Nodes.Last);
5870 if Val > Error then Set_Parent (Val, N); end if;
5872 end Set_Node1_With_Parent;
5874 procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id) is
5876 pragma Assert (N in Nodes.First .. Nodes.Last);
5877 if Val > Error then Set_Parent (Val, N); end if;
5879 end Set_Node2_With_Parent;
5881 procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id) is
5883 pragma Assert (N in Nodes.First .. Nodes.Last);
5884 if Val > Error then Set_Parent (Val, N); end if;
5886 end Set_Node3_With_Parent;
5888 procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id) is
5890 pragma Assert (N in Nodes.First .. Nodes.Last);
5891 if Val > Error then Set_Parent (Val, N); end if;
5893 end Set_Node4_With_Parent;
5895 procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id) is
5897 pragma Assert (N in Nodes.First .. Nodes.Last);
5898 if Val > Error then Set_Parent (Val, N); end if;
5900 end Set_Node5_With_Parent;
5902 procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id) is
5904 pragma Assert (N in Nodes.First .. Nodes.Last);
5905 if Val /= No_List and then Val /= Error_List then
5906 Set_Parent (Val, N);
5909 end Set_List1_With_Parent;
5911 procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id) is
5913 pragma Assert (N in Nodes.First .. Nodes.Last);
5914 if Val /= No_List and then Val /= Error_List then
5915 Set_Parent (Val, N);
5918 end Set_List2_With_Parent;
5920 procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id) is
5922 pragma Assert (N in Nodes.First .. Nodes.Last);
5923 if Val /= No_List and then Val /= Error_List then
5924 Set_Parent (Val, N);
5927 end Set_List3_With_Parent;
5929 procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id) is
5931 pragma Assert (N in Nodes.First .. Nodes.Last);
5932 if Val /= No_List and then Val /= Error_List then
5933 Set_Parent (Val, N);
5936 end Set_List4_With_Parent;
5938 procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id) is
5940 pragma Assert (N in Nodes.First .. Nodes.Last);
5941 if Val /= No_List and then Val /= Error_List then
5942 Set_Parent (Val, N);
5945 end Set_List5_With_Parent;
5947 end Unchecked_Access;