1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2007, 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, 51 Franklin Street, Fifth Floor, --
20 -- Boston, MA 02110-1301, 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 file atree.h which is a C header
39 -- file containing equivalent definitions for use by gigi.
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;
56 -- Suppose you find that node 12345 is messed up. You might want to find
57 -- the code that created that node. There are two ways to do this:
59 -- One way is to set a conditional breakpoint on New_Node_Debugging_Output
61 -- break nnd if n = 12345
62 -- and run gnat1 again from the beginning.
64 -- The other way is to set a breakpoint near the beginning (e.g. on
65 -- gnat1drv), and run. Then set Watch_Node (nickname "ww") to 12345 in gdb:
67 -- and set a breakpoint on New_Node_Breakpoint (nickname "nn"). Continue.
69 -- Either way, gnat1 will stop when node 12345 is created
71 -- The second method is faster
73 ww : Node_Id'Base := Node_Id'First - 1;
74 pragma Export (Ada, ww); -- trick the optimizer
75 Watch_Node : Node_Id'Base renames ww;
76 -- Node to "watch"; that is, whenever a node is created, we check if it is
77 -- equal to Watch_Node, and if so, call New_Node_Breakpoint. You have
78 -- presumably set a breakpoint on New_Node_Breakpoint. Note that the
79 -- initial value of Node_Id'First - 1 ensures that by default, no node
80 -- will be equal to Watch_Node.
83 pragma Export (Ada, nn);
84 procedure New_Node_Breakpoint renames nn;
85 -- This doesn't do anything interesting; it's just for setting breakpoint
86 -- on as explained above.
88 procedure nnd (N : Node_Id);
89 pragma Export (Ada, nnd);
90 procedure New_Node_Debugging_Output (N : Node_Id) renames nnd;
91 -- For debugging. If debugging is turned on, New_Node and New_Entity call
92 -- this. If debug flag N is turned on, this prints out the new node.
94 -- If Node = Watch_Node, this prints out the new node and calls
95 -- New_Node_Breakpoint. Otherwise, does nothing.
97 -----------------------------
98 -- Local Objects and Types --
99 -----------------------------
102 -- Count allocated nodes for Num_Nodes function
104 use Unchecked_Access;
105 -- We are allowed to see these from within our own body!
107 use Atree_Private_Part;
108 -- We are also allowed to see our private data structures!
110 function E_To_N is new Unchecked_Conversion (Entity_Kind, Node_Kind);
111 function N_To_E is new Unchecked_Conversion (Node_Kind, Entity_Kind);
112 -- Functions used to store Entity_Kind value in Nkind field
114 -- The following declarations are used to store flags 65-72 in the
115 -- Nkind field of the third component of an extended (entity) node.
117 type Flag_Byte is record
128 pragma Pack (Flag_Byte);
129 for Flag_Byte'Size use 8;
131 type Flag_Byte_Ptr is access all Flag_Byte;
132 type Node_Kind_Ptr is access all Node_Kind;
134 function To_Flag_Byte is new
135 Unchecked_Conversion (Node_Kind, Flag_Byte);
137 function To_Flag_Byte_Ptr is new
138 Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte_Ptr);
140 -- The following declarations are used to store flags 73-96 and the
141 -- Convention field in the Field12 field of the third component of an
142 -- extended (Entity) node.
144 type Flag_Word is record
172 Convention : Convention_Id;
175 pragma Pack (Flag_Word);
176 for Flag_Word'Size use 32;
177 for Flag_Word'Alignment use 4;
179 type Flag_Word_Ptr is access all Flag_Word;
180 type Union_Id_Ptr is access all Union_Id;
182 function To_Flag_Word is new
183 Unchecked_Conversion (Union_Id, Flag_Word);
185 function To_Flag_Word_Ptr is new
186 Unchecked_Conversion (Union_Id_Ptr, Flag_Word_Ptr);
188 -- The following declarations are used to store flags 97-128 in the
189 -- Field12 field of the fourth component of an extended (entity) node.
191 type Flag_Word2 is record
229 pragma Pack (Flag_Word2);
230 for Flag_Word2'Size use 32;
231 for Flag_Word2'Alignment use 4;
233 type Flag_Word2_Ptr is access all Flag_Word2;
235 function To_Flag_Word2 is new
236 Unchecked_Conversion (Union_Id, Flag_Word2);
238 function To_Flag_Word2_Ptr is new
239 Unchecked_Conversion (Union_Id_Ptr, Flag_Word2_Ptr);
241 -- The following declarations are used to store flags 152-183 in the
242 -- Field11 field of the fourth component of an extended (entity) node.
244 type Flag_Word3 is record
282 pragma Pack (Flag_Word3);
283 for Flag_Word3'Size use 32;
284 for Flag_Word3'Alignment use 4;
286 type Flag_Word3_Ptr is access all Flag_Word3;
288 function To_Flag_Word3 is new
289 Unchecked_Conversion (Union_Id, Flag_Word3);
291 function To_Flag_Word3_Ptr is new
292 Unchecked_Conversion (Union_Id_Ptr, Flag_Word3_Ptr);
294 -- The following declarations are used to store flags 184-215 in the
295 -- Field11 field of the fifth component of an extended (entity) node.
297 type Flag_Word4 is record
335 pragma Pack (Flag_Word4);
336 for Flag_Word4'Size use 32;
337 for Flag_Word4'Alignment use 4;
339 type Flag_Word4_Ptr is access all Flag_Word4;
341 function To_Flag_Word4 is new
342 Unchecked_Conversion (Union_Id, Flag_Word4);
344 function To_Flag_Word4_Ptr is new
345 Unchecked_Conversion (Union_Id_Ptr, Flag_Word4_Ptr);
347 -- The following declarations are used to store flags 216-247 in the
348 -- Field12 field of the fifth component of an extended (entity) node.
350 type Flag_Word5 is record
368 -- Note: flags 231-247 not in use yet
391 pragma Pack (Flag_Word5);
392 for Flag_Word5'Size use 32;
393 for Flag_Word5'Alignment use 4;
395 type Flag_Word5_Ptr is access all Flag_Word5;
397 function To_Flag_Word5 is new
398 Unchecked_Conversion (Union_Id, Flag_Word5);
400 function To_Flag_Word5_Ptr is new
401 Unchecked_Conversion (Union_Id_Ptr, Flag_Word5_Ptr);
403 -- Default value used to initialize default nodes. Note that some of the
404 -- fields get overwritten, and in particular, Nkind always gets reset.
406 Default_Node : Node_Record := (
407 Is_Extension => False,
412 Rewrite_Ins => False,
414 Comes_From_Source => False, -- modified by Set_Comes_From_Source_Default
415 Error_Posted => False,
434 Nkind => N_Unused_At_Start,
437 Link => Empty_List_Or_Node,
438 Field1 => Empty_List_Or_Node,
439 Field2 => Empty_List_Or_Node,
440 Field3 => Empty_List_Or_Node,
441 Field4 => Empty_List_Or_Node,
442 Field5 => Empty_List_Or_Node);
444 -- Default value used to initialize node extensions (i.e. the second
445 -- and third and fourth components of an extended node). Note we are
446 -- cheating a bit here when it comes to Node12, which really holds
447 -- flags an (for the third component), the convention. But it works
448 -- because Empty, False, Convention_Ada, all happen to be all zero bits.
450 Default_Node_Extension : constant Node_Record := (
451 Is_Extension => True,
456 Rewrite_Ins => False,
458 Comes_From_Source => False,
459 Error_Posted => False,
478 Nkind => E_To_N (E_Void),
480 Field6 => Empty_List_Or_Node,
481 Field7 => Empty_List_Or_Node,
482 Field8 => Empty_List_Or_Node,
483 Field9 => Empty_List_Or_Node,
484 Field10 => Empty_List_Or_Node,
485 Field11 => Empty_List_Or_Node,
486 Field12 => Empty_List_Or_Node);
488 --------------------------------------------------
489 -- Implementation of Tree Substitution Routines --
490 --------------------------------------------------
492 -- A separate table keeps track of the mapping between rewritten nodes
493 -- and their corresponding original tree nodes. Rewrite makes an entry
494 -- in this table for use by Original_Node. By default, if no call is
495 -- Rewrite, the entry in this table points to the original unwritten node.
497 -- Note: eventually, this should be a field in the Node directly, but
498 -- for now we do not want to disturb the efficiency of a power of 2
501 package Orig_Nodes is new Table.Table (
502 Table_Component_Type => Node_Id,
503 Table_Index_Type => Node_Id'Base,
504 Table_Low_Bound => First_Node_Id,
505 Table_Initial => Alloc.Orig_Nodes_Initial,
506 Table_Increment => Alloc.Orig_Nodes_Increment,
507 Table_Name => "Orig_Nodes");
509 ----------------------------------------
510 -- Global_Variables for New_Copy_Tree --
511 ----------------------------------------
513 -- These global variables are used by New_Copy_Tree. See description
514 -- of the body of this subprogram for details. Global variables can be
515 -- safely used by New_Copy_Tree, since there is no case of a recursive
516 -- call from the processing inside New_Copy_Tree.
518 NCT_Hash_Threshhold : constant := 20;
519 -- If there are more than this number of pairs of entries in the
520 -- map, then Hash_Tables_Used will be set, and the hash tables will
521 -- be initialized and used for the searches.
523 NCT_Hash_Tables_Used : Boolean := False;
524 -- Set to True if hash tables are in use
526 NCT_Table_Entries : Nat;
527 -- Count entries in table to see if threshhold is reached
529 NCT_Hash_Table_Setup : Boolean := False;
530 -- Set to True if hash table contains data. We set this True if we
531 -- setup the hash table with data, and leave it set permanently
532 -- from then on, this is a signal that second and subsequent users
533 -- of the hash table must clear the old entries before reuse.
535 subtype NCT_Header_Num is Int range 0 .. 511;
536 -- Defines range of headers in hash tables (512 headers)
538 --------------------------
539 -- Paren_Count Handling --
540 --------------------------
542 -- As noted in the spec, the paren count in a sub-expression node has
543 -- four possible values 0,1,2, and 3. The value 3 really means 3 or more,
544 -- and we use an auxiliary serially scanned table to record the actual
545 -- count. A serial search is fine, only pathological programs will use
546 -- entries in this table. Normal programs won't use it at all.
548 type Paren_Count_Entry is record
550 -- The node to which this count applies
552 Count : Nat range 3 .. Nat'Last;
553 -- The count of parentheses, which will be in the indicated range
556 package Paren_Counts is new Table.Table (
557 Table_Component_Type => Paren_Count_Entry,
558 Table_Index_Type => Int,
559 Table_Low_Bound => 0,
561 Table_Increment => 200,
562 Table_Name => "Paren_Counts");
564 -----------------------
565 -- Local Subprograms --
566 -----------------------
568 procedure Fix_Parents (Old_Node, New_Node : Node_Id);
569 -- Fixup parent pointers for the syntactic children of New_Node after
570 -- a copy, setting them to New_Node when they pointed to Old_Node.
572 function Allocate_Initialize_Node
574 With_Extension : Boolean) return Node_Id;
575 -- Allocate a new node or node extension. If Src is not empty,
576 -- the information for the newly-allocated node is copied from it.
578 ------------------------------
579 -- Allocate_Initialize_Node --
580 ------------------------------
582 function Allocate_Initialize_Node
584 With_Extension : Boolean) return Node_Id
586 New_Id : Node_Id := Src;
587 Nod : Node_Record := Default_Node;
588 Ext1 : Node_Record := Default_Node_Extension;
589 Ext2 : Node_Record := Default_Node_Extension;
590 Ext3 : Node_Record := Default_Node_Extension;
591 Ext4 : Node_Record := Default_Node_Extension;
594 if Present (Src) then
595 Nod := Nodes.Table (Src);
597 if Has_Extension (Src) then
598 Ext1 := Nodes.Table (Src + 1);
599 Ext2 := Nodes.Table (Src + 2);
600 Ext3 := Nodes.Table (Src + 3);
601 Ext4 := Nodes.Table (Src + 4);
605 if not (Present (Src)
606 and then not Has_Extension (Src)
607 and then With_Extension
608 and then Src = Nodes.Last)
610 -- We are allocating a new node, or extending a node
611 -- other than Nodes.Last.
614 New_Id := Nodes.Last;
615 Orig_Nodes.Append (New_Id);
616 Node_Count := Node_Count + 1;
619 -- Specifically copy Paren_Count to deal with creating new table entry
620 -- if the parentheses count is at the maximum possible value already.
622 if Present (Src) and then Nkind (Src) in N_Subexpr then
623 Set_Paren_Count (New_Id, Paren_Count (Src));
626 -- Set extension nodes if required
628 if With_Extension then
635 Orig_Nodes.Set_Last (Nodes.Last);
636 Allocate_List_Tables (Nodes.Last);
638 end Allocate_Initialize_Node;
644 function Analyzed (N : Node_Id) return Boolean is
646 pragma Assert (N <= Nodes.Last);
647 return Nodes.Table (N).Analyzed;
654 procedure Change_Node (N : Node_Id; New_Node_Kind : Node_Kind) is
655 Save_Sloc : constant Source_Ptr := Sloc (N);
656 Save_In_List : constant Boolean := Nodes.Table (N).In_List;
657 Save_Link : constant Union_Id := Nodes.Table (N).Link;
658 Save_CFS : constant Boolean := Nodes.Table (N).Comes_From_Source;
659 Save_Posted : constant Boolean := Nodes.Table (N).Error_Posted;
660 Par_Count : Nat := 0;
663 if Nkind (N) in N_Subexpr then
664 Par_Count := Paren_Count (N);
667 Nodes.Table (N) := Default_Node;
668 Nodes.Table (N).Sloc := Save_Sloc;
669 Nodes.Table (N).In_List := Save_In_List;
670 Nodes.Table (N).Link := Save_Link;
671 Nodes.Table (N).Comes_From_Source := Save_CFS;
672 Nodes.Table (N).Nkind := New_Node_Kind;
673 Nodes.Table (N).Error_Posted := Save_Posted;
675 if New_Node_Kind in N_Subexpr then
676 Set_Paren_Count (N, Par_Count);
680 -----------------------
681 -- Comes_From_Source --
682 -----------------------
684 function Comes_From_Source (N : Node_Id) return Boolean is
686 pragma Assert (N <= Nodes.Last);
687 return Nodes.Table (N).Comes_From_Source;
688 end Comes_From_Source;
694 function Convention (E : Entity_Id) return Convention_Id is
696 pragma Assert (Nkind (E) in N_Entity);
697 return To_Flag_Word (Nodes.Table (E + 2).Field12).Convention;
704 procedure Copy_Node (Source : Node_Id; Destination : Node_Id) is
705 Save_In_List : constant Boolean := Nodes.Table (Destination).In_List;
706 Save_Link : constant Union_Id := Nodes.Table (Destination).Link;
709 Nodes.Table (Destination) := Nodes.Table (Source);
710 Nodes.Table (Destination).In_List := Save_In_List;
711 Nodes.Table (Destination).Link := Save_Link;
713 -- Specifically set Paren_Count to make sure auxiliary table entry
714 -- gets correctly made if the parentheses count is at the max value.
716 if Nkind (Destination) in N_Subexpr then
717 Set_Paren_Count (Destination, Paren_Count (Source));
720 -- Deal with copying extension nodes if present
722 if Has_Extension (Source) then
723 pragma Assert (Has_Extension (Destination));
724 Nodes.Table (Destination + 1) := Nodes.Table (Source + 1);
725 Nodes.Table (Destination + 2) := Nodes.Table (Source + 2);
726 Nodes.Table (Destination + 3) := Nodes.Table (Source + 3);
727 Nodes.Table (Destination + 4) := Nodes.Table (Source + 4);
730 pragma Assert (not Has_Extension (Source));
735 ------------------------
736 -- Copy_Separate_Tree --
737 ------------------------
739 function Copy_Separate_Tree (Source : Node_Id) return Node_Id is
742 function Copy_Entity (E : Entity_Id) return Entity_Id;
743 -- Copy Entity, copying only the Ekind and Chars fields
745 function Copy_List (List : List_Id) return List_Id;
748 function Possible_Copy (Field : Union_Id) return Union_Id;
749 -- Given a field, returns a copy of the node or list if its parent
750 -- is the current source node, and otherwise returns the input
756 function Copy_Entity (E : Entity_Id) return Entity_Id is
760 case N_Entity (Nkind (E)) is
761 when N_Defining_Identifier =>
762 New_Ent := New_Entity (N_Defining_Identifier, Sloc (E));
764 when N_Defining_Character_Literal =>
765 New_Ent := New_Entity (N_Defining_Character_Literal, Sloc (E));
767 when N_Defining_Operator_Symbol =>
768 New_Ent := New_Entity (N_Defining_Operator_Symbol, Sloc (E));
771 Set_Chars (New_Ent, Chars (E));
779 function Copy_List (List : List_Id) return List_Id is
784 if List = No_List then
791 while Present (E) loop
792 if Has_Extension (E) then
793 Append (Copy_Entity (E), NL);
795 Append (Copy_Separate_Tree (E), NL);
809 function Possible_Copy (Field : Union_Id) return Union_Id is
813 if Field in Node_Range then
814 New_N := Union_Id (Copy_Separate_Tree (Node_Id (Field)));
816 if Parent (Node_Id (Field)) = Source then
817 Set_Parent (Node_Id (New_N), New_Id);
822 elsif Field in List_Range then
823 New_N := Union_Id (Copy_List (List_Id (Field)));
825 if Parent (List_Id (Field)) = Source then
826 Set_Parent (List_Id (New_N), New_Id);
836 -- Start of processing for Copy_Separate_Tree
839 if Source <= Empty_Or_Error then
842 elsif Has_Extension (Source) then
843 return Copy_Entity (Source);
846 New_Id := New_Copy (Source);
848 -- Recursively copy descendents
850 Set_Field1 (New_Id, Possible_Copy (Field1 (New_Id)));
851 Set_Field2 (New_Id, Possible_Copy (Field2 (New_Id)));
852 Set_Field3 (New_Id, Possible_Copy (Field3 (New_Id)));
853 Set_Field4 (New_Id, Possible_Copy (Field4 (New_Id)));
854 Set_Field5 (New_Id, Possible_Copy (Field5 (New_Id)));
856 -- Set Entity field to Empty
857 -- Why is this done??? and why is it always right to do it???
859 if Nkind (New_Id) in N_Has_Entity
860 or else Nkind (New_Id) = N_Freeze_Entity
862 Set_Entity (New_Id, Empty);
865 -- All done, return copied node
869 end Copy_Separate_Tree;
875 procedure Delete_Node (Node : Node_Id) is
877 pragma Assert (not Nodes.Table (Node).In_List);
880 Write_Str ("Delete node ");
881 Write_Int (Int (Node));
885 Nodes.Table (Node) := Default_Node;
886 Nodes.Table (Node).Nkind := N_Unused_At_Start;
887 Node_Count := Node_Count - 1;
889 -- Note: for now, we are not bothering to reuse deleted nodes
897 procedure Delete_Tree (Node : Node_Id) is
899 procedure Delete_Field (F : Union_Id);
900 -- Delete item pointed to by field F if it is a syntactic element
902 procedure Delete_List (L : List_Id);
903 -- Delete all elements on the given list
909 procedure Delete_Field (F : Union_Id) is
911 if F = Union_Id (Empty) then
914 elsif F in Node_Range
915 and then Parent (Node_Id (F)) = Node
917 Delete_Tree (Node_Id (F));
919 elsif F in List_Range
920 and then Parent (List_Id (F)) = Node
922 Delete_List (List_Id (F));
924 -- No need to test Elist case, there are no syntactic Elists
935 procedure Delete_List (L : List_Id) is
937 while Is_Non_Empty_List (L) loop
938 Delete_Tree (Remove_Head (L));
942 -- Start of processing for Delete_Tree
945 -- Delete descendents
947 Delete_Field (Field1 (Node));
948 Delete_Field (Field2 (Node));
949 Delete_Field (Field3 (Node));
950 Delete_Field (Field4 (Node));
951 Delete_Field (Field5 (Node));
958 function Ekind (E : Entity_Id) return Entity_Kind is
960 pragma Assert (Nkind (E) in N_Entity);
961 return N_To_E (Nodes.Table (E + 1).Nkind);
968 function Error_Posted (N : Node_Id) return Boolean is
970 pragma Assert (N <= Nodes.Last);
971 return Nodes.Table (N).Error_Posted;
974 -----------------------
975 -- Exchange_Entities --
976 -----------------------
978 procedure Exchange_Entities (E1 : Entity_Id; E2 : Entity_Id) is
979 Temp_Ent : Node_Record;
982 pragma Assert (Has_Extension (E1)
983 and then Has_Extension (E2)
984 and then not Nodes.Table (E1).In_List
985 and then not Nodes.Table (E2).In_List);
987 -- Exchange the contents of the two entities
989 Temp_Ent := Nodes.Table (E1);
990 Nodes.Table (E1) := Nodes.Table (E2);
991 Nodes.Table (E2) := Temp_Ent;
992 Temp_Ent := Nodes.Table (E1 + 1);
993 Nodes.Table (E1 + 1) := Nodes.Table (E2 + 1);
994 Nodes.Table (E2 + 1) := Temp_Ent;
995 Temp_Ent := Nodes.Table (E1 + 2);
996 Nodes.Table (E1 + 2) := Nodes.Table (E2 + 2);
997 Nodes.Table (E2 + 2) := Temp_Ent;
998 Temp_Ent := Nodes.Table (E1 + 3);
999 Nodes.Table (E1 + 3) := Nodes.Table (E2 + 3);
1000 Nodes.Table (E2 + 3) := Temp_Ent;
1001 Temp_Ent := Nodes.Table (E1 + 4);
1002 Nodes.Table (E1 + 4) := Nodes.Table (E2 + 4);
1003 Nodes.Table (E2 + 4) := Temp_Ent;
1005 -- That exchange exchanged the parent pointers as well, which is what
1006 -- we want, but we need to patch up the defining identifier pointers
1007 -- in the parent nodes (the child pointers) to match this switch
1008 -- unless for Implicit types entities which have no parent, in which
1009 -- case we don't do anything otherwise we won't be able to revert back
1010 -- to the original situation.
1012 -- Shouldn't this use Is_Itype instead of the Parent test
1014 if Present (Parent (E1)) and then Present (Parent (E2)) then
1015 Set_Defining_Identifier (Parent (E1), E1);
1016 Set_Defining_Identifier (Parent (E2), E2);
1018 end Exchange_Entities;
1024 function Extend_Node (Node : Node_Id) return Entity_Id is
1027 procedure Debug_Extend_Node;
1028 pragma Inline (Debug_Extend_Node);
1029 -- Debug routine for debug flag N
1031 -----------------------
1032 -- Debug_Extend_Node --
1033 -----------------------
1035 procedure Debug_Extend_Node is
1037 if Debug_Flag_N then
1038 Write_Str ("Extend node ");
1039 Write_Int (Int (Node));
1041 if Result = Node then
1042 Write_Str (" in place");
1044 Write_Str (" copied to ");
1045 Write_Int (Int (Result));
1050 end Debug_Extend_Node;
1052 -- Start of processing for Extend_Node
1055 pragma Assert (not (Has_Extension (Node)));
1056 Result := Allocate_Initialize_Node (Node, With_Extension => True);
1057 pragma Debug (Debug_Extend_Node);
1065 procedure Fix_Parents (Old_Node, New_Node : Node_Id) is
1067 procedure Fix_Parent (Field : Union_Id; Old_Node, New_Node : Node_Id);
1068 -- Fixup one parent pointer. Field is checked to see if it
1069 -- points to a node, list, or element list that has a parent that
1070 -- points to Old_Node. If so, the parent is reset to point to New_Node.
1076 procedure Fix_Parent (Field : Union_Id; Old_Node, New_Node : Node_Id) is
1078 -- Fix parent of node that is referenced by Field. Note that we must
1079 -- exclude the case where the node is a member of a list, because in
1080 -- this case the parent is the parent of the list.
1082 if Field in Node_Range
1083 and then Present (Node_Id (Field))
1084 and then not Nodes.Table (Node_Id (Field)).In_List
1085 and then Parent (Node_Id (Field)) = Old_Node
1087 Set_Parent (Node_Id (Field), New_Node);
1089 -- Fix parent of list that is referenced by Field
1091 elsif Field in List_Range
1092 and then Present (List_Id (Field))
1093 and then Parent (List_Id (Field)) = Old_Node
1095 Set_Parent (List_Id (Field), New_Node);
1099 -- Start of processing for Fix_Parents
1102 Fix_Parent (Field1 (New_Node), Old_Node, New_Node);
1103 Fix_Parent (Field2 (New_Node), Old_Node, New_Node);
1104 Fix_Parent (Field3 (New_Node), Old_Node, New_Node);
1105 Fix_Parent (Field4 (New_Node), Old_Node, New_Node);
1106 Fix_Parent (Field5 (New_Node), Old_Node, New_Node);
1109 -----------------------------------
1110 -- Get_Comes_From_Source_Default --
1111 -----------------------------------
1113 function Get_Comes_From_Source_Default return Boolean is
1115 return Default_Node.Comes_From_Source;
1116 end Get_Comes_From_Source_Default;
1122 function Has_Extension (N : Node_Id) return Boolean is
1124 return N < Nodes.Last and then Nodes.Table (N + 1).Is_Extension;
1131 procedure Initialize is
1133 pragma Warnings (Off, Dummy);
1137 Atree_Private_Part.Nodes.Init;
1141 -- Allocate Empty node
1143 Dummy := New_Node (N_Empty, No_Location);
1144 Set_Name1 (Empty, No_Name);
1146 -- Allocate Error node, and set Error_Posted, since we certainly
1147 -- only generate an Error node if we do post some kind of error!
1149 Dummy := New_Node (N_Error, No_Location);
1150 Set_Name1 (Error, Error_Name);
1151 Set_Error_Posted (Error, True);
1153 -- Set global variables for New_Copy_Tree
1155 NCT_Hash_Tables_Used := False;
1156 NCT_Table_Entries := 0;
1157 NCT_Hash_Table_Setup := False;
1160 --------------------------
1161 -- Is_Rewrite_Insertion --
1162 --------------------------
1164 function Is_Rewrite_Insertion (Node : Node_Id) return Boolean is
1166 return Nodes.Table (Node).Rewrite_Ins;
1167 end Is_Rewrite_Insertion;
1169 -----------------------------
1170 -- Is_Rewrite_Substitution --
1171 -----------------------------
1173 function Is_Rewrite_Substitution (Node : Node_Id) return Boolean is
1175 return Orig_Nodes.Table (Node) /= Node;
1176 end Is_Rewrite_Substitution;
1182 function Last_Node_Id return Node_Id is
1193 Nodes.Locked := True;
1194 Orig_Nodes.Locked := True;
1199 ----------------------------
1200 -- Mark_Rewrite_Insertion --
1201 ----------------------------
1203 procedure Mark_Rewrite_Insertion (New_Node : Node_Id) is
1205 Nodes.Table (New_Node).Rewrite_Ins := True;
1206 end Mark_Rewrite_Insertion;
1212 function New_Copy (Source : Node_Id) return Node_Id is
1213 New_Id : Node_Id := Source;
1216 if Source > Empty_Or_Error then
1218 New_Id := Allocate_Initialize_Node (Source, Has_Extension (Source));
1220 Nodes.Table (New_Id).Link := Empty_List_Or_Node;
1221 Nodes.Table (New_Id).In_List := False;
1223 -- If the original is marked as a rewrite insertion, then unmark
1224 -- the copy, since we inserted the original, not the copy.
1226 Nodes.Table (New_Id).Rewrite_Ins := False;
1227 pragma Debug (New_Node_Debugging_Output (New_Id));
1237 -- Our approach here requires a two pass traversal of the tree. The
1238 -- first pass visits all nodes that eventually will be copied looking
1239 -- for defining Itypes. If any defining Itypes are found, then they are
1240 -- copied, and an entry is added to the replacement map. In the second
1241 -- phase, the tree is copied, using the replacement map to replace any
1242 -- Itype references within the copied tree.
1244 -- The following hash tables are used if the Map supplied has more
1245 -- than hash threshhold entries to speed up access to the map. If
1246 -- there are fewer entries, then the map is searched sequentially
1247 -- (because setting up a hash table for only a few entries takes
1248 -- more time than it saves.
1250 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num;
1251 -- Hash function used for hash operations
1257 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num is
1259 return Nat (E) mod (NCT_Header_Num'Last + 1);
1266 -- The hash table NCT_Assoc associates old entities in the table
1267 -- with their corresponding new entities (i.e. the pairs of entries
1268 -- presented in the original Map argument are Key-Element pairs).
1270 package NCT_Assoc is new Simple_HTable (
1271 Header_Num => NCT_Header_Num,
1272 Element => Entity_Id,
1273 No_Element => Empty,
1275 Hash => New_Copy_Hash,
1276 Equal => Types."=");
1278 ---------------------
1279 -- NCT_Itype_Assoc --
1280 ---------------------
1282 -- The hash table NCT_Itype_Assoc contains entries only for those
1283 -- old nodes which have a non-empty Associated_Node_For_Itype set.
1284 -- The key is the associated node, and the element is the new node
1285 -- itself (NOT the associated node for the new node).
1287 package NCT_Itype_Assoc is new Simple_HTable (
1288 Header_Num => NCT_Header_Num,
1289 Element => Entity_Id,
1290 No_Element => Empty,
1292 Hash => New_Copy_Hash,
1293 Equal => Types."=");
1295 -- Start of processing for New_Copy_Tree function
1297 function New_Copy_Tree
1299 Map : Elist_Id := No_Elist;
1300 New_Sloc : Source_Ptr := No_Location;
1301 New_Scope : Entity_Id := Empty) return Node_Id
1303 Actual_Map : Elist_Id := Map;
1304 -- This is the actual map for the copy. It is initialized with the
1305 -- given elements, and then enlarged as required for Itypes that are
1306 -- copied during the first phase of the copy operation. The visit
1307 -- procedures add elements to this map as Itypes are encountered.
1308 -- The reason we cannot use Map directly, is that it may well be
1309 -- (and normally is) initialized to No_Elist, and if we have mapped
1310 -- entities, we have to reset it to point to a real Elist.
1312 function Assoc (N : Node_Or_Entity_Id) return Node_Id;
1313 -- Called during second phase to map entities into their corresponding
1314 -- copies using Actual_Map. If the argument is not an entity, or is not
1315 -- in Actual_Map, then it is returned unchanged.
1317 procedure Build_NCT_Hash_Tables;
1318 -- Builds hash tables (number of elements >= threshold value)
1320 function Copy_Elist_With_Replacement
1321 (Old_Elist : Elist_Id) return Elist_Id;
1322 -- Called during second phase to copy element list doing replacements
1324 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id);
1325 -- Called during the second phase to process a copied Itype. The actual
1326 -- copy happened during the first phase (so that we could make the entry
1327 -- in the mapping), but we still have to deal with the descendents of
1328 -- the copied Itype and copy them where necessary.
1330 function Copy_List_With_Replacement (Old_List : List_Id) return List_Id;
1331 -- Called during second phase to copy list doing replacements
1333 function Copy_Node_With_Replacement (Old_Node : Node_Id) return Node_Id;
1334 -- Called during second phase to copy node doing replacements
1336 procedure Visit_Elist (E : Elist_Id);
1337 -- Called during first phase to visit all elements of an Elist
1339 procedure Visit_Field (F : Union_Id; N : Node_Id);
1340 -- Visit a single field, recursing to call Visit_Node or Visit_List
1341 -- if the field is a syntactic descendent of the current node (i.e.
1342 -- its parent is Node N).
1344 procedure Visit_Itype (Old_Itype : Entity_Id);
1345 -- Called during first phase to visit subsidiary fields of a defining
1346 -- Itype, and also create a copy and make an entry in the replacement
1347 -- map for the new copy.
1349 procedure Visit_List (L : List_Id);
1350 -- Called during first phase to visit all elements of a List
1352 procedure Visit_Node (N : Node_Or_Entity_Id);
1353 -- Called during first phase to visit a node and all its subtrees
1359 function Assoc (N : Node_Or_Entity_Id) return Node_Id is
1364 if not Has_Extension (N) or else No (Actual_Map) then
1367 elsif NCT_Hash_Tables_Used then
1368 Ent := NCT_Assoc.Get (Entity_Id (N));
1370 if Present (Ent) then
1376 -- No hash table used, do serial search
1379 E := First_Elmt (Actual_Map);
1380 while Present (E) loop
1381 if Node (E) = N then
1382 return Node (Next_Elmt (E));
1384 E := Next_Elmt (Next_Elmt (E));
1392 ---------------------------
1393 -- Build_NCT_Hash_Tables --
1394 ---------------------------
1396 procedure Build_NCT_Hash_Tables is
1400 if NCT_Hash_Table_Setup then
1402 NCT_Itype_Assoc.Reset;
1405 Elmt := First_Elmt (Actual_Map);
1406 while Present (Elmt) loop
1409 -- Get new entity, and associate old and new
1412 NCT_Assoc.Set (Ent, Node (Elmt));
1414 if Is_Type (Ent) then
1416 Anode : constant Entity_Id :=
1417 Associated_Node_For_Itype (Ent);
1420 if Present (Anode) then
1422 -- Enter a link between the associated node of the
1423 -- old Itype and the new Itype, for updating later
1424 -- when node is copied.
1426 NCT_Itype_Assoc.Set (Anode, Node (Elmt));
1434 NCT_Hash_Tables_Used := True;
1435 NCT_Hash_Table_Setup := True;
1436 end Build_NCT_Hash_Tables;
1438 ---------------------------------
1439 -- Copy_Elist_With_Replacement --
1440 ---------------------------------
1442 function Copy_Elist_With_Replacement
1443 (Old_Elist : Elist_Id) return Elist_Id
1446 New_Elist : Elist_Id;
1449 if No (Old_Elist) then
1453 New_Elist := New_Elmt_List;
1455 M := First_Elmt (Old_Elist);
1456 while Present (M) loop
1457 Append_Elmt (Copy_Node_With_Replacement (Node (M)), New_Elist);
1463 end Copy_Elist_With_Replacement;
1465 ---------------------------------
1466 -- Copy_Itype_With_Replacement --
1467 ---------------------------------
1469 -- This routine exactly parallels its phase one analog Visit_Itype,
1470 -- and like that routine, knows far too many semantic details about
1471 -- the descendents of Itypes and whether they need copying or not.
1473 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id) is
1475 -- Translate Next_Entity, Scope and Etype fields, in case they
1476 -- reference entities that have been mapped into copies.
1478 Set_Next_Entity (New_Itype, Assoc (Next_Entity (New_Itype)));
1479 Set_Etype (New_Itype, Assoc (Etype (New_Itype)));
1481 if Present (New_Scope) then
1482 Set_Scope (New_Itype, New_Scope);
1484 Set_Scope (New_Itype, Assoc (Scope (New_Itype)));
1487 -- Copy referenced fields
1489 if Is_Discrete_Type (New_Itype) then
1490 Set_Scalar_Range (New_Itype,
1491 Copy_Node_With_Replacement (Scalar_Range (New_Itype)));
1493 elsif Has_Discriminants (Base_Type (New_Itype)) then
1494 Set_Discriminant_Constraint (New_Itype,
1495 Copy_Elist_With_Replacement
1496 (Discriminant_Constraint (New_Itype)));
1498 elsif Is_Array_Type (New_Itype) then
1499 if Present (First_Index (New_Itype)) then
1500 Set_First_Index (New_Itype,
1501 First (Copy_List_With_Replacement
1502 (List_Containing (First_Index (New_Itype)))));
1505 if Is_Packed (New_Itype) then
1506 Set_Packed_Array_Type (New_Itype,
1507 Copy_Node_With_Replacement
1508 (Packed_Array_Type (New_Itype)));
1511 end Copy_Itype_With_Replacement;
1513 --------------------------------
1514 -- Copy_List_With_Replacement --
1515 --------------------------------
1517 function Copy_List_With_Replacement
1518 (Old_List : List_Id) return List_Id
1524 if Old_List = No_List then
1528 New_List := Empty_List;
1530 E := First (Old_List);
1531 while Present (E) loop
1532 Append (Copy_Node_With_Replacement (E), New_List);
1538 end Copy_List_With_Replacement;
1540 --------------------------------
1541 -- Copy_Node_With_Replacement --
1542 --------------------------------
1544 function Copy_Node_With_Replacement
1545 (Old_Node : Node_Id) return Node_Id
1549 procedure Adjust_Named_Associations
1550 (Old_Node : Node_Id;
1551 New_Node : Node_Id);
1552 -- If a call node has named associations, these are chained through
1553 -- the First_Named_Actual, Next_Named_Actual links. These must be
1554 -- propagated separately to the new parameter list, because these
1555 -- are not syntactic fields.
1557 function Copy_Field_With_Replacement
1558 (Field : Union_Id) return Union_Id;
1559 -- Given Field, which is a field of Old_Node, return a copy of it
1560 -- if it is a syntactic field (i.e. its parent is Node), setting
1561 -- the parent of the copy to poit to New_Node. Otherwise returns
1562 -- the field (possibly mapped if it is an entity).
1564 -------------------------------
1565 -- Adjust_Named_Associations --
1566 -------------------------------
1568 procedure Adjust_Named_Associations
1569 (Old_Node : Node_Id;
1579 Old_E := First (Parameter_Associations (Old_Node));
1580 New_E := First (Parameter_Associations (New_Node));
1581 while Present (Old_E) loop
1582 if Nkind (Old_E) = N_Parameter_Association
1583 and then Present (Next_Named_Actual (Old_E))
1585 if First_Named_Actual (Old_Node)
1586 = Explicit_Actual_Parameter (Old_E)
1588 Set_First_Named_Actual
1589 (New_Node, Explicit_Actual_Parameter (New_E));
1592 -- Now scan parameter list from the beginning,to locate
1593 -- next named actual, which can be out of order.
1595 Old_Next := First (Parameter_Associations (Old_Node));
1596 New_Next := First (Parameter_Associations (New_Node));
1598 while Nkind (Old_Next) /= N_Parameter_Association
1599 or else Explicit_Actual_Parameter (Old_Next)
1600 /= Next_Named_Actual (Old_E)
1606 Set_Next_Named_Actual
1607 (New_E, Explicit_Actual_Parameter (New_Next));
1613 end Adjust_Named_Associations;
1615 ---------------------------------
1616 -- Copy_Field_With_Replacement --
1617 ---------------------------------
1619 function Copy_Field_With_Replacement
1620 (Field : Union_Id) return Union_Id
1623 if Field = Union_Id (Empty) then
1626 elsif Field in Node_Range then
1628 Old_N : constant Node_Id := Node_Id (Field);
1632 -- If syntactic field, as indicated by the parent pointer
1633 -- being set, then copy the referenced node recursively.
1635 if Parent (Old_N) = Old_Node then
1636 New_N := Copy_Node_With_Replacement (Old_N);
1638 if New_N /= Old_N then
1639 Set_Parent (New_N, New_Node);
1642 -- For semantic fields, update possible entity reference
1643 -- from the replacement map.
1646 New_N := Assoc (Old_N);
1649 return Union_Id (New_N);
1652 elsif Field in List_Range then
1654 Old_L : constant List_Id := List_Id (Field);
1658 -- If syntactic field, as indicated by the parent pointer,
1659 -- then recursively copy the entire referenced list.
1661 if Parent (Old_L) = Old_Node then
1662 New_L := Copy_List_With_Replacement (Old_L);
1663 Set_Parent (New_L, New_Node);
1665 -- For semantic list, just returned unchanged
1671 return Union_Id (New_L);
1674 -- Anything other than a list or a node is returned unchanged
1679 end Copy_Field_With_Replacement;
1681 -- Start of processing for Copy_Node_With_Replacement
1684 if Old_Node <= Empty_Or_Error then
1687 elsif Has_Extension (Old_Node) then
1688 return Assoc (Old_Node);
1691 New_Node := New_Copy (Old_Node);
1693 -- If the node we are copying is the associated node of a
1694 -- previously copied Itype, then adjust the associated node
1695 -- of the copy of that Itype accordingly.
1697 if Present (Actual_Map) then
1703 -- Case of hash table used
1705 if NCT_Hash_Tables_Used then
1706 Ent := NCT_Itype_Assoc.Get (Old_Node);
1708 if Present (Ent) then
1709 Set_Associated_Node_For_Itype (Ent, New_Node);
1712 -- Case of no hash table used
1715 E := First_Elmt (Actual_Map);
1716 while Present (E) loop
1717 if Is_Itype (Node (E))
1719 Old_Node = Associated_Node_For_Itype (Node (E))
1721 Set_Associated_Node_For_Itype
1722 (Node (Next_Elmt (E)), New_Node);
1725 E := Next_Elmt (Next_Elmt (E));
1731 -- Recursively copy descendents
1734 (New_Node, Copy_Field_With_Replacement (Field1 (New_Node)));
1736 (New_Node, Copy_Field_With_Replacement (Field2 (New_Node)));
1738 (New_Node, Copy_Field_With_Replacement (Field3 (New_Node)));
1740 (New_Node, Copy_Field_With_Replacement (Field4 (New_Node)));
1742 (New_Node, Copy_Field_With_Replacement (Field5 (New_Node)));
1744 -- Adjust Sloc of new node if necessary
1746 if New_Sloc /= No_Location then
1747 Set_Sloc (New_Node, New_Sloc);
1749 -- If we adjust the Sloc, then we are essentially making
1750 -- a completely new node, so the Comes_From_Source flag
1751 -- should be reset to the proper default value.
1753 Nodes.Table (New_Node).Comes_From_Source :=
1754 Default_Node.Comes_From_Source;
1757 -- If the node is call and has named associations,
1758 -- set the corresponding links in the copy.
1760 if (Nkind (Old_Node) = N_Function_Call
1761 or else Nkind (Old_Node) = N_Entry_Call_Statement
1763 Nkind (Old_Node) = N_Procedure_Call_Statement)
1764 and then Present (First_Named_Actual (Old_Node))
1766 Adjust_Named_Associations (Old_Node, New_Node);
1769 -- Reset First_Real_Statement for Handled_Sequence_Of_Statements.
1770 -- The replacement mechanism applies to entities, and is not used
1771 -- here. Eventually we may need a more general graph-copying
1772 -- routine. For now, do a sequential search to find desired node.
1774 if Nkind (Old_Node) = N_Handled_Sequence_Of_Statements
1775 and then Present (First_Real_Statement (Old_Node))
1778 Old_F : constant Node_Id := First_Real_Statement (Old_Node);
1782 N1 := First (Statements (Old_Node));
1783 N2 := First (Statements (New_Node));
1785 while N1 /= Old_F loop
1790 Set_First_Real_Statement (New_Node, N2);
1795 -- All done, return copied node
1798 end Copy_Node_With_Replacement;
1804 procedure Visit_Elist (E : Elist_Id) is
1808 Elmt := First_Elmt (E);
1810 while Elmt /= No_Elmt loop
1811 Visit_Node (Node (Elmt));
1821 procedure Visit_Field (F : Union_Id; N : Node_Id) is
1823 if F = Union_Id (Empty) then
1826 elsif F in Node_Range then
1828 -- Copy node if it is syntactic, i.e. its parent pointer is
1829 -- set to point to the field that referenced it (certain
1830 -- Itypes will also meet this criterion, which is fine, since
1831 -- these are clearly Itypes that do need to be copied, since
1832 -- we are copying their parent.)
1834 if Parent (Node_Id (F)) = N then
1835 Visit_Node (Node_Id (F));
1838 -- Another case, if we are pointing to an Itype, then we want
1839 -- to copy it if its associated node is somewhere in the tree
1842 -- Note: the exclusion of self-referential copies is just an
1843 -- optimization, since the search of the already copied list
1844 -- would catch it, but it is a common case (Etype pointing
1845 -- to itself for an Itype that is a base type).
1847 elsif Has_Extension (Node_Id (F))
1848 and then Is_Itype (Entity_Id (F))
1849 and then Node_Id (F) /= N
1855 P := Associated_Node_For_Itype (Node_Id (F));
1856 while Present (P) loop
1858 Visit_Node (Node_Id (F));
1865 -- An Itype whose parent is not being copied definitely
1866 -- should NOT be copied, since it does not belong in any
1867 -- sense to the copied subtree.
1873 elsif F in List_Range
1874 and then Parent (List_Id (F)) = N
1876 Visit_List (List_Id (F));
1885 -- Note: we are relying on far too much semantic knowledge in this
1886 -- routine, it really should just do a blind replacement of all
1887 -- fields, or at least a more blind replacement. For example, we
1888 -- do not deal with corresponding record types, and that works
1889 -- because we have no Itypes of task types, but nowhere is there
1890 -- a guarantee that this will always be the case. ???
1892 procedure Visit_Itype (Old_Itype : Entity_Id) is
1893 New_Itype : Entity_Id;
1898 -- Itypes that describe the designated type of access to subprograms
1899 -- have the structure of subprogram declarations, with signatures,
1900 -- etc. Either we duplicate the signatures completely, or choose to
1901 -- share such itypes, which is fine because their elaboration will
1902 -- have no side effects. In any case, this is additional semantic
1903 -- information that seems awkward to have in atree.
1905 if Ekind (Old_Itype) = E_Subprogram_Type then
1909 New_Itype := New_Copy (Old_Itype);
1911 -- The new Itype has all the attributes of the old one, and
1912 -- we just copy the contents of the entity. However, the back-end
1913 -- needs different names for debugging purposes, so we create a
1914 -- new internal name by appending the letter 'c' (copy) to the
1915 -- name of the original.
1917 Get_Name_String (Chars (Old_Itype));
1918 Add_Char_To_Name_Buffer ('c');
1919 Set_Chars (New_Itype, Name_Enter);
1921 -- If our associated node is an entity that has already been copied,
1922 -- then set the associated node of the copy to point to the right
1923 -- copy. If we have copied an Itype that is itself the associated
1924 -- node of some previously copied Itype, then we set the right
1925 -- pointer in the other direction.
1927 if Present (Actual_Map) then
1929 -- Case of hash tables used
1931 if NCT_Hash_Tables_Used then
1933 Ent := NCT_Assoc.Get (Associated_Node_For_Itype (Old_Itype));
1935 if Present (Ent) then
1936 Set_Associated_Node_For_Itype (New_Itype, Ent);
1939 Ent := NCT_Itype_Assoc.Get (Old_Itype);
1940 if Present (Ent) then
1941 Set_Associated_Node_For_Itype (Ent, New_Itype);
1943 -- If the hash table has no association for this Itype and
1944 -- its associated node, enter one now.
1948 (Associated_Node_For_Itype (Old_Itype), New_Itype);
1951 -- Case of hash tables not used
1954 E := First_Elmt (Actual_Map);
1955 while Present (E) loop
1956 if Associated_Node_For_Itype (Old_Itype) = Node (E) then
1957 Set_Associated_Node_For_Itype
1958 (New_Itype, Node (Next_Elmt (E)));
1961 if Is_Type (Node (E))
1963 Old_Itype = Associated_Node_For_Itype (Node (E))
1965 Set_Associated_Node_For_Itype
1966 (Node (Next_Elmt (E)), New_Itype);
1969 E := Next_Elmt (Next_Elmt (E));
1974 if Present (Freeze_Node (New_Itype)) then
1975 Set_Is_Frozen (New_Itype, False);
1976 Set_Freeze_Node (New_Itype, Empty);
1979 -- Add new association to map
1981 if No (Actual_Map) then
1982 Actual_Map := New_Elmt_List;
1985 Append_Elmt (Old_Itype, Actual_Map);
1986 Append_Elmt (New_Itype, Actual_Map);
1988 if NCT_Hash_Tables_Used then
1989 NCT_Assoc.Set (Old_Itype, New_Itype);
1992 NCT_Table_Entries := NCT_Table_Entries + 1;
1994 if NCT_Table_Entries > NCT_Hash_Threshhold then
1995 Build_NCT_Hash_Tables;
1999 -- If a record subtype is simply copied, the entity list will be
2000 -- shared. Thus cloned_Subtype must be set to indicate the sharing.
2002 if Ekind (Old_Itype) = E_Record_Subtype
2003 or else Ekind (Old_Itype) = E_Class_Wide_Subtype
2005 Set_Cloned_Subtype (New_Itype, Old_Itype);
2008 -- Visit descendents that eventually get copied
2010 Visit_Field (Union_Id (Etype (Old_Itype)), Old_Itype);
2012 if Is_Discrete_Type (Old_Itype) then
2013 Visit_Field (Union_Id (Scalar_Range (Old_Itype)), Old_Itype);
2015 elsif Has_Discriminants (Base_Type (Old_Itype)) then
2016 -- ??? This should involve call to Visit_Field
2017 Visit_Elist (Discriminant_Constraint (Old_Itype));
2019 elsif Is_Array_Type (Old_Itype) then
2020 if Present (First_Index (Old_Itype)) then
2021 Visit_Field (Union_Id (List_Containing
2022 (First_Index (Old_Itype))),
2026 if Is_Packed (Old_Itype) then
2027 Visit_Field (Union_Id (Packed_Array_Type (Old_Itype)),
2037 procedure Visit_List (L : List_Id) is
2040 if L /= No_List then
2043 while Present (N) loop
2054 procedure Visit_Node (N : Node_Or_Entity_Id) is
2056 -- Start of processing for Visit_Node
2059 -- Handle case of an Itype, which must be copied
2061 if Has_Extension (N)
2062 and then Is_Itype (N)
2064 -- Nothing to do if already in the list. This can happen with an
2065 -- Itype entity that appears more than once in the tree.
2066 -- Note that we do not want to visit descendents in this case.
2068 -- Test for already in list when hash table is used
2070 if NCT_Hash_Tables_Used then
2071 if Present (NCT_Assoc.Get (Entity_Id (N))) then
2075 -- Test for already in list when hash table not used
2081 if Present (Actual_Map) then
2082 E := First_Elmt (Actual_Map);
2083 while Present (E) loop
2084 if Node (E) = N then
2087 E := Next_Elmt (Next_Elmt (E));
2097 -- Visit descendents
2099 Visit_Field (Field1 (N), N);
2100 Visit_Field (Field2 (N), N);
2101 Visit_Field (Field3 (N), N);
2102 Visit_Field (Field4 (N), N);
2103 Visit_Field (Field5 (N), N);
2106 -- Start of processing for New_Copy_Tree
2111 -- See if we should use hash table
2113 if No (Actual_Map) then
2114 NCT_Hash_Tables_Used := False;
2121 NCT_Table_Entries := 0;
2123 Elmt := First_Elmt (Actual_Map);
2124 while Present (Elmt) loop
2125 NCT_Table_Entries := NCT_Table_Entries + 1;
2130 if NCT_Table_Entries > NCT_Hash_Threshhold then
2131 Build_NCT_Hash_Tables;
2133 NCT_Hash_Tables_Used := False;
2138 -- Hash table set up if required, now start phase one by visiting
2139 -- top node (we will recursively visit the descendents).
2141 Visit_Node (Source);
2143 -- Now the second phase of the copy can start. First we process
2144 -- all the mapped entities, copying their descendents.
2146 if Present (Actual_Map) then
2149 New_Itype : Entity_Id;
2151 Elmt := First_Elmt (Actual_Map);
2152 while Present (Elmt) loop
2154 New_Itype := Node (Elmt);
2155 Copy_Itype_With_Replacement (New_Itype);
2161 -- Now we can copy the actual tree
2163 return Copy_Node_With_Replacement (Source);
2171 (New_Node_Kind : Node_Kind;
2172 New_Sloc : Source_Ptr) return Entity_Id
2177 pragma Assert (New_Node_Kind in N_Entity);
2179 Ent := Allocate_Initialize_Node (Empty, With_Extension => True);
2181 -- If this is a node with a real location and we are generating
2182 -- source nodes, then reset Current_Error_Node. This is useful
2183 -- if we bomb during parsing to get a error location for the bomb.
2185 if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
2186 Current_Error_Node := Ent;
2189 Nodes.Table (Ent).Nkind := New_Node_Kind;
2190 Nodes.Table (Ent).Sloc := New_Sloc;
2191 pragma Debug (New_Node_Debugging_Output (Ent));
2201 (New_Node_Kind : Node_Kind;
2202 New_Sloc : Source_Ptr) return Node_Id
2207 pragma Assert (New_Node_Kind not in N_Entity);
2208 Nod := Allocate_Initialize_Node (Empty, With_Extension => False);
2209 Nodes.Table (Nod).Nkind := New_Node_Kind;
2210 Nodes.Table (Nod).Sloc := New_Sloc;
2211 pragma Debug (New_Node_Debugging_Output (Nod));
2213 -- If this is a node with a real location and we are generating source
2214 -- nodes, then reset Current_Error_Node. This is useful if we bomb
2215 -- during parsing to get an error location for the bomb.
2217 if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
2218 Current_Error_Node := Nod;
2224 -------------------------
2225 -- New_Node_Breakpoint --
2226 -------------------------
2228 procedure nn is -- New_Node_Breakpoint
2230 Write_Str ("Watched node ");
2231 Write_Int (Int (Watch_Node));
2232 Write_Str (" created");
2236 -------------------------------
2237 -- New_Node_Debugging_Output --
2238 -------------------------------
2240 procedure nnd (N : Node_Id) is -- New_Node_Debugging_Output
2241 Node_Is_Watched : constant Boolean := N = Watch_Node;
2244 if Debug_Flag_N or else Node_Is_Watched then
2245 Write_Str ("Allocate ");
2247 if Nkind (N) in N_Entity then
2248 Write_Str ("entity");
2253 Write_Str (", Id = ");
2254 Write_Int (Int (N));
2256 Write_Location (Sloc (N));
2258 Write_Str (Node_Kind'Image (Nkind (N)));
2261 if Node_Is_Watched then
2262 New_Node_Breakpoint;
2271 function Nkind (N : Node_Id) return Node_Kind is
2273 return Nodes.Table (N).Nkind;
2280 function No (N : Node_Id) return Boolean is
2289 function Nodes_Address return System.Address is
2291 return Nodes.Table (First_Node_Id)'Address;
2298 function Num_Nodes return Nat is
2307 function Original_Node (Node : Node_Id) return Node_Id is
2309 return Orig_Nodes.Table (Node);
2316 function Paren_Count (N : Node_Id) return Nat is
2320 pragma Assert (N <= Nodes.Last);
2322 if Nodes.Table (N).Pflag1 then
2326 if Nodes.Table (N).Pflag2 then
2330 -- Value of 0,1,2 returned as is
2335 -- Value of 3 means we search the table, and we must find an entry
2338 for J in Paren_Counts.First .. Paren_Counts.Last loop
2339 if N = Paren_Counts.Table (J).Nod then
2340 return Paren_Counts.Table (J).Count;
2344 raise Program_Error;
2352 function Parent (N : Node_Id) return Node_Id is
2354 if Is_List_Member (N) then
2355 return Parent (List_Containing (N));
2357 return Node_Id (Nodes.Table (N).Link);
2365 function Present (N : Node_Id) return Boolean is
2370 --------------------------------
2371 -- Preserve_Comes_From_Source --
2372 --------------------------------
2374 procedure Preserve_Comes_From_Source (NewN, OldN : Node_Id) is
2376 Nodes.Table (NewN).Comes_From_Source :=
2377 Nodes.Table (OldN).Comes_From_Source;
2378 end Preserve_Comes_From_Source;
2384 function Relocate_Node (Source : Node_Id) return Node_Id is
2392 New_Node := New_Copy (Source);
2393 Fix_Parents (Source, New_Node);
2395 -- We now set the parent of the new node to be the same as the
2396 -- parent of the source. Almost always this parent will be
2397 -- replaced by a new value when the relocated node is reattached
2398 -- to the tree, but by doing it now, we ensure that this node is
2399 -- not even temporarily disconnected from the tree. Note that this
2400 -- does not happen free, because in the list case, the parent does
2403 Set_Parent (New_Node, Parent (Source));
2405 -- If the node being relocated was a rewriting of some original
2406 -- node, then the relocated node has the same original node.
2408 if Orig_Nodes.Table (Source) /= Source then
2409 Orig_Nodes.Table (New_Node) := Orig_Nodes.Table (Source);
2419 procedure Replace (Old_Node, New_Node : Node_Id) is
2420 Old_Post : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
2421 Old_CFS : constant Boolean := Nodes.Table (Old_Node).Comes_From_Source;
2425 (not Has_Extension (Old_Node)
2426 and not Has_Extension (New_Node)
2427 and not Nodes.Table (New_Node).In_List);
2429 -- Do copy, preserving link and in list status and comes from source
2431 Copy_Node (Source => New_Node, Destination => Old_Node);
2432 Nodes.Table (Old_Node).Comes_From_Source := Old_CFS;
2433 Nodes.Table (Old_Node).Error_Posted := Old_Post;
2435 -- Fix parents of substituted node, since it has changed identity
2437 Fix_Parents (New_Node, Old_Node);
2439 -- Since we are doing a replace, we assume that the original node
2440 -- is intended to become the new replaced node. The call would be
2441 -- to Rewrite if there were an intention to save the original node.
2443 Orig_Nodes.Table (Old_Node) := Old_Node;
2445 -- Finally delete the source, since it is now copied
2447 Delete_Node (New_Node);
2454 procedure Rewrite (Old_Node, New_Node : Node_Id) is
2455 Old_Error_P : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
2456 -- This fields is always preserved in the new node
2458 Old_Paren_Count : Nat;
2459 Old_Must_Not_Freeze : Boolean;
2460 -- These fields are preserved in the new node only if the new node
2461 -- and the old node are both subexpression nodes.
2463 -- Note: it is a violation of abstraction levels for Must_Not_Freeze
2464 -- to be referenced like this. ???
2470 (not Has_Extension (Old_Node)
2471 and not Has_Extension (New_Node)
2472 and not Nodes.Table (New_Node).In_List);
2474 if Nkind (Old_Node) in N_Subexpr then
2475 Old_Paren_Count := Paren_Count (Old_Node);
2476 Old_Must_Not_Freeze := Must_Not_Freeze (Old_Node);
2478 Old_Paren_Count := 0;
2479 Old_Must_Not_Freeze := False;
2482 -- Allocate a new node, to be used to preserve the original contents
2483 -- of the Old_Node, for possible later retrival by Original_Node and
2484 -- make an entry in the Orig_Nodes table. This is only done if we have
2485 -- not already rewritten the node, as indicated by an Orig_Nodes entry
2486 -- that does not reference the Old_Node.
2488 if Orig_Nodes.Table (Old_Node) = Old_Node then
2489 Sav_Node := New_Copy (Old_Node);
2490 Orig_Nodes.Table (Sav_Node) := Sav_Node;
2491 Orig_Nodes.Table (Old_Node) := Sav_Node;
2494 -- Copy substitute node into place, preserving old fields as required
2496 Copy_Node (Source => New_Node, Destination => Old_Node);
2497 Nodes.Table (Old_Node).Error_Posted := Old_Error_P;
2499 if Nkind (New_Node) in N_Subexpr then
2500 Set_Paren_Count (Old_Node, Old_Paren_Count);
2501 Set_Must_Not_Freeze (Old_Node, Old_Must_Not_Freeze);
2504 Fix_Parents (New_Node, Old_Node);
2511 procedure Set_Analyzed (N : Node_Id; Val : Boolean := True) is
2513 Nodes.Table (N).Analyzed := Val;
2516 ---------------------------
2517 -- Set_Comes_From_Source --
2518 ---------------------------
2520 procedure Set_Comes_From_Source (N : Node_Id; Val : Boolean) is
2522 pragma Assert (N <= Nodes.Last);
2523 Nodes.Table (N).Comes_From_Source := Val;
2524 end Set_Comes_From_Source;
2526 -----------------------------------
2527 -- Set_Comes_From_Source_Default --
2528 -----------------------------------
2530 procedure Set_Comes_From_Source_Default (Default : Boolean) is
2532 Default_Node.Comes_From_Source := Default;
2533 end Set_Comes_From_Source_Default;
2535 --------------------
2536 -- Set_Convention --
2537 --------------------
2539 procedure Set_Convention (E : Entity_Id; Val : Convention_Id) is
2541 pragma Assert (Nkind (E) in N_Entity);
2544 (Nodes.Table (E + 2).Field12'Unrestricted_Access)).Convention :=
2552 procedure Set_Ekind (E : Entity_Id; Val : Entity_Kind) is
2554 pragma Assert (Nkind (E) in N_Entity);
2555 Nodes.Table (E + 1).Nkind := E_To_N (Val);
2558 ----------------------
2559 -- Set_Error_Posted --
2560 ----------------------
2562 procedure Set_Error_Posted (N : Node_Id; Val : Boolean := True) is
2564 Nodes.Table (N).Error_Posted := Val;
2565 end Set_Error_Posted;
2567 ---------------------
2568 -- Set_Paren_Count --
2569 ---------------------
2571 procedure Set_Paren_Count (N : Node_Id; Val : Nat) is
2573 pragma Assert (Nkind (N) in N_Subexpr);
2575 -- Value of 0,1,2 stored as is
2578 Nodes.Table (N).Pflag1 := (Val mod 2 /= 0);
2579 Nodes.Table (N).Pflag2 := (Val = 2);
2581 -- Value of 3 or greater stores 3 in node and makes table entry
2584 Nodes.Table (N).Pflag1 := True;
2585 Nodes.Table (N).Pflag2 := True;
2587 for J in Paren_Counts.First .. Paren_Counts.Last loop
2588 if N = Paren_Counts.Table (J).Nod then
2589 Paren_Counts.Table (J).Count := Val;
2594 Paren_Counts.Append ((Nod => N, Count => Val));
2596 end Set_Paren_Count;
2602 procedure Set_Parent (N : Node_Id; Val : Node_Id) is
2604 pragma Assert (not Nodes.Table (N).In_List);
2605 Nodes.Table (N).Link := Union_Id (Val);
2612 procedure Set_Sloc (N : Node_Id; Val : Source_Ptr) is
2614 Nodes.Table (N).Sloc := Val;
2621 function Sloc (N : Node_Id) return Source_Ptr is
2623 return Nodes.Table (N).Sloc;
2630 function Traverse_Func (Node : Node_Id) return Traverse_Result is
2632 function Traverse_Field
2635 FN : Field_Num) return Traverse_Result;
2636 -- Fld is one of the fields of Nod. If the field points to syntactic
2637 -- node or list, then this node or list is traversed, and the result is
2638 -- the result of this traversal. Otherwise a value of True is returned
2639 -- with no processing. FN is the number of the field (1 .. 5).
2641 --------------------
2642 -- Traverse_Field --
2643 --------------------
2645 function Traverse_Field
2648 FN : Field_Num) return Traverse_Result
2651 if Fld = Union_Id (Empty) then
2654 -- Descendent is a node
2656 elsif Fld in Node_Range then
2658 -- Traverse descendent that is syntactic subtree node
2660 if Is_Syntactic_Field (Nkind (Nod), FN) then
2661 return Traverse_Func (Node_Id (Fld));
2663 -- Node that is not a syntactic subtree
2669 -- Descendent is a list
2671 elsif Fld in List_Range then
2673 -- Traverse descendent that is a syntactic subtree list
2675 if Is_Syntactic_Field (Nkind (Nod), FN) then
2677 Elmt : Node_Id := First (List_Id (Fld));
2679 while Present (Elmt) loop
2680 if Traverse_Func (Elmt) = Abandon then
2690 -- List that is not a syntactic subtree
2696 -- Field was not a node or a list
2703 -- Start of processing for Traverse_Func
2706 case Process (Node) is
2714 if Traverse_Field (Node, Union_Id (Field1 (Node)), 1) = Abandon
2716 Traverse_Field (Node, Union_Id (Field2 (Node)), 2) = Abandon
2718 Traverse_Field (Node, Union_Id (Field3 (Node)), 3) = Abandon
2720 Traverse_Field (Node, Union_Id (Field4 (Node)), 4) = Abandon
2722 Traverse_Field (Node, Union_Id (Field5 (Node)), 5) = Abandon
2731 Onod : constant Node_Id := Original_Node (Node);
2733 if Traverse_Field (Onod, Union_Id (Field1 (Onod)), 1) = Abandon
2735 Traverse_Field (Onod, Union_Id (Field2 (Onod)), 2) = Abandon
2737 Traverse_Field (Onod, Union_Id (Field3 (Onod)), 3) = Abandon
2739 Traverse_Field (Onod, Union_Id (Field4 (Onod)), 4) = Abandon
2741 Traverse_Field (Onod, Union_Id (Field5 (Onod)), 5) = Abandon
2755 procedure Traverse_Proc (Node : Node_Id) is
2756 function Traverse is new Traverse_Func (Process);
2757 Discard : Traverse_Result;
2758 pragma Warnings (Off, Discard);
2760 Discard := Traverse (Node);
2767 procedure Tree_Read is
2769 Tree_Read_Int (Node_Count);
2771 Orig_Nodes.Tree_Read;
2772 Paren_Counts.Tree_Read;
2779 procedure Tree_Write is
2781 Tree_Write_Int (Node_Count);
2783 Orig_Nodes.Tree_Write;
2784 Paren_Counts.Tree_Write;
2787 ------------------------------
2788 -- Unchecked Access Package --
2789 ------------------------------
2791 package body Unchecked_Access is
2793 function Field1 (N : Node_Id) return Union_Id is
2795 pragma Assert (N <= Nodes.Last);
2796 return Nodes.Table (N).Field1;
2799 function Field2 (N : Node_Id) return Union_Id is
2801 pragma Assert (N <= Nodes.Last);
2802 return Nodes.Table (N).Field2;
2805 function Field3 (N : Node_Id) return Union_Id is
2807 pragma Assert (N <= Nodes.Last);
2808 return Nodes.Table (N).Field3;
2811 function Field4 (N : Node_Id) return Union_Id is
2813 pragma Assert (N <= Nodes.Last);
2814 return Nodes.Table (N).Field4;
2817 function Field5 (N : Node_Id) return Union_Id is
2819 pragma Assert (N <= Nodes.Last);
2820 return Nodes.Table (N).Field5;
2823 function Field6 (N : Node_Id) return Union_Id is
2825 pragma Assert (Nkind (N) in N_Entity);
2826 return Nodes.Table (N + 1).Field6;
2829 function Field7 (N : Node_Id) return Union_Id is
2831 pragma Assert (Nkind (N) in N_Entity);
2832 return Nodes.Table (N + 1).Field7;
2835 function Field8 (N : Node_Id) return Union_Id is
2837 pragma Assert (Nkind (N) in N_Entity);
2838 return Nodes.Table (N + 1).Field8;
2841 function Field9 (N : Node_Id) return Union_Id is
2843 pragma Assert (Nkind (N) in N_Entity);
2844 return Nodes.Table (N + 1).Field9;
2847 function Field10 (N : Node_Id) return Union_Id is
2849 pragma Assert (Nkind (N) in N_Entity);
2850 return Nodes.Table (N + 1).Field10;
2853 function Field11 (N : Node_Id) return Union_Id is
2855 pragma Assert (Nkind (N) in N_Entity);
2856 return Nodes.Table (N + 1).Field11;
2859 function Field12 (N : Node_Id) return Union_Id is
2861 pragma Assert (Nkind (N) in N_Entity);
2862 return Nodes.Table (N + 1).Field12;
2865 function Field13 (N : Node_Id) return Union_Id is
2867 pragma Assert (Nkind (N) in N_Entity);
2868 return Nodes.Table (N + 2).Field6;
2871 function Field14 (N : Node_Id) return Union_Id is
2873 pragma Assert (Nkind (N) in N_Entity);
2874 return Nodes.Table (N + 2).Field7;
2877 function Field15 (N : Node_Id) return Union_Id is
2879 pragma Assert (Nkind (N) in N_Entity);
2880 return Nodes.Table (N + 2).Field8;
2883 function Field16 (N : Node_Id) return Union_Id is
2885 pragma Assert (Nkind (N) in N_Entity);
2886 return Nodes.Table (N + 2).Field9;
2889 function Field17 (N : Node_Id) return Union_Id is
2891 pragma Assert (Nkind (N) in N_Entity);
2892 return Nodes.Table (N + 2).Field10;
2895 function Field18 (N : Node_Id) return Union_Id is
2897 pragma Assert (Nkind (N) in N_Entity);
2898 return Nodes.Table (N + 2).Field11;
2901 function Field19 (N : Node_Id) return Union_Id is
2903 pragma Assert (Nkind (N) in N_Entity);
2904 return Nodes.Table (N + 3).Field6;
2907 function Field20 (N : Node_Id) return Union_Id is
2909 pragma Assert (Nkind (N) in N_Entity);
2910 return Nodes.Table (N + 3).Field7;
2913 function Field21 (N : Node_Id) return Union_Id is
2915 pragma Assert (Nkind (N) in N_Entity);
2916 return Nodes.Table (N + 3).Field8;
2919 function Field22 (N : Node_Id) return Union_Id is
2921 pragma Assert (Nkind (N) in N_Entity);
2922 return Nodes.Table (N + 3).Field9;
2925 function Field23 (N : Node_Id) return Union_Id is
2927 pragma Assert (Nkind (N) in N_Entity);
2928 return Nodes.Table (N + 3).Field10;
2931 function Field24 (N : Node_Id) return Union_Id is
2933 pragma Assert (Nkind (N) in N_Entity);
2934 return Nodes.Table (N + 4).Field6;
2937 function Field25 (N : Node_Id) return Union_Id is
2939 pragma Assert (Nkind (N) in N_Entity);
2940 return Nodes.Table (N + 4).Field7;
2943 function Field26 (N : Node_Id) return Union_Id is
2945 pragma Assert (Nkind (N) in N_Entity);
2946 return Nodes.Table (N + 4).Field8;
2949 function Field27 (N : Node_Id) return Union_Id is
2951 pragma Assert (Nkind (N) in N_Entity);
2952 return Nodes.Table (N + 4).Field9;
2955 function Field28 (N : Node_Id) return Union_Id is
2957 pragma Assert (Nkind (N) in N_Entity);
2958 return Nodes.Table (N + 4).Field10;
2961 function Node1 (N : Node_Id) return Node_Id is
2963 pragma Assert (N <= Nodes.Last);
2964 return Node_Id (Nodes.Table (N).Field1);
2967 function Node2 (N : Node_Id) return Node_Id is
2969 pragma Assert (N <= Nodes.Last);
2970 return Node_Id (Nodes.Table (N).Field2);
2973 function Node3 (N : Node_Id) return Node_Id is
2975 pragma Assert (N <= Nodes.Last);
2976 return Node_Id (Nodes.Table (N).Field3);
2979 function Node4 (N : Node_Id) return Node_Id is
2981 pragma Assert (N <= Nodes.Last);
2982 return Node_Id (Nodes.Table (N).Field4);
2985 function Node5 (N : Node_Id) return Node_Id is
2987 pragma Assert (N <= Nodes.Last);
2988 return Node_Id (Nodes.Table (N).Field5);
2991 function Node6 (N : Node_Id) return Node_Id is
2993 pragma Assert (Nkind (N) in N_Entity);
2994 return Node_Id (Nodes.Table (N + 1).Field6);
2997 function Node7 (N : Node_Id) return Node_Id is
2999 pragma Assert (Nkind (N) in N_Entity);
3000 return Node_Id (Nodes.Table (N + 1).Field7);
3003 function Node8 (N : Node_Id) return Node_Id is
3005 pragma Assert (Nkind (N) in N_Entity);
3006 return Node_Id (Nodes.Table (N + 1).Field8);
3009 function Node9 (N : Node_Id) return Node_Id is
3011 pragma Assert (Nkind (N) in N_Entity);
3012 return Node_Id (Nodes.Table (N + 1).Field9);
3015 function Node10 (N : Node_Id) return Node_Id is
3017 pragma Assert (Nkind (N) in N_Entity);
3018 return Node_Id (Nodes.Table (N + 1).Field10);
3021 function Node11 (N : Node_Id) return Node_Id is
3023 pragma Assert (Nkind (N) in N_Entity);
3024 return Node_Id (Nodes.Table (N + 1).Field11);
3027 function Node12 (N : Node_Id) return Node_Id is
3029 pragma Assert (Nkind (N) in N_Entity);
3030 return Node_Id (Nodes.Table (N + 1).Field12);
3033 function Node13 (N : Node_Id) return Node_Id is
3035 pragma Assert (Nkind (N) in N_Entity);
3036 return Node_Id (Nodes.Table (N + 2).Field6);
3039 function Node14 (N : Node_Id) return Node_Id is
3041 pragma Assert (Nkind (N) in N_Entity);
3042 return Node_Id (Nodes.Table (N + 2).Field7);
3045 function Node15 (N : Node_Id) return Node_Id is
3047 pragma Assert (Nkind (N) in N_Entity);
3048 return Node_Id (Nodes.Table (N + 2).Field8);
3051 function Node16 (N : Node_Id) return Node_Id is
3053 pragma Assert (Nkind (N) in N_Entity);
3054 return Node_Id (Nodes.Table (N + 2).Field9);
3057 function Node17 (N : Node_Id) return Node_Id is
3059 pragma Assert (Nkind (N) in N_Entity);
3060 return Node_Id (Nodes.Table (N + 2).Field10);
3063 function Node18 (N : Node_Id) return Node_Id is
3065 pragma Assert (Nkind (N) in N_Entity);
3066 return Node_Id (Nodes.Table (N + 2).Field11);
3069 function Node19 (N : Node_Id) return Node_Id is
3071 pragma Assert (Nkind (N) in N_Entity);
3072 return Node_Id (Nodes.Table (N + 3).Field6);
3075 function Node20 (N : Node_Id) return Node_Id is
3077 pragma Assert (Nkind (N) in N_Entity);
3078 return Node_Id (Nodes.Table (N + 3).Field7);
3081 function Node21 (N : Node_Id) return Node_Id is
3083 pragma Assert (Nkind (N) in N_Entity);
3084 return Node_Id (Nodes.Table (N + 3).Field8);
3087 function Node22 (N : Node_Id) return Node_Id is
3089 pragma Assert (Nkind (N) in N_Entity);
3090 return Node_Id (Nodes.Table (N + 3).Field9);
3093 function Node23 (N : Node_Id) return Node_Id is
3095 pragma Assert (Nkind (N) in N_Entity);
3096 return Node_Id (Nodes.Table (N + 3).Field10);
3099 function Node24 (N : Node_Id) return Node_Id is
3101 pragma Assert (Nkind (N) in N_Entity);
3102 return Node_Id (Nodes.Table (N + 4).Field6);
3105 function Node25 (N : Node_Id) return Node_Id is
3107 pragma Assert (Nkind (N) in N_Entity);
3108 return Node_Id (Nodes.Table (N + 4).Field7);
3111 function Node26 (N : Node_Id) return Node_Id is
3113 pragma Assert (Nkind (N) in N_Entity);
3114 return Node_Id (Nodes.Table (N + 4).Field8);
3117 function Node27 (N : Node_Id) return Node_Id is
3119 pragma Assert (Nkind (N) in N_Entity);
3120 return Node_Id (Nodes.Table (N + 4).Field9);
3123 function Node28 (N : Node_Id) return Node_Id is
3125 pragma Assert (Nkind (N) in N_Entity);
3126 return Node_Id (Nodes.Table (N + 4).Field10);
3129 function List1 (N : Node_Id) return List_Id is
3131 pragma Assert (N <= Nodes.Last);
3132 return List_Id (Nodes.Table (N).Field1);
3135 function List2 (N : Node_Id) return List_Id is
3137 pragma Assert (N <= Nodes.Last);
3138 return List_Id (Nodes.Table (N).Field2);
3141 function List3 (N : Node_Id) return List_Id is
3143 pragma Assert (N <= Nodes.Last);
3144 return List_Id (Nodes.Table (N).Field3);
3147 function List4 (N : Node_Id) return List_Id is
3149 pragma Assert (N <= Nodes.Last);
3150 return List_Id (Nodes.Table (N).Field4);
3153 function List5 (N : Node_Id) return List_Id is
3155 pragma Assert (N <= Nodes.Last);
3156 return List_Id (Nodes.Table (N).Field5);
3159 function List10 (N : Node_Id) return List_Id is
3161 pragma Assert (Nkind (N) in N_Entity);
3162 return List_Id (Nodes.Table (N + 1).Field10);
3165 function List14 (N : Node_Id) return List_Id is
3167 pragma Assert (Nkind (N) in N_Entity);
3168 return List_Id (Nodes.Table (N + 2).Field7);
3171 function Elist1 (N : Node_Id) return Elist_Id is
3172 pragma Assert (N <= Nodes.Last);
3173 Value : constant Union_Id := Nodes.Table (N).Field1;
3178 return Elist_Id (Value);
3182 function Elist2 (N : Node_Id) return Elist_Id is
3183 pragma Assert (N <= Nodes.Last);
3184 Value : constant Union_Id := Nodes.Table (N).Field2;
3189 return Elist_Id (Value);
3193 function Elist3 (N : Node_Id) return Elist_Id is
3194 pragma Assert (N <= Nodes.Last);
3195 Value : constant Union_Id := Nodes.Table (N).Field3;
3200 return Elist_Id (Value);
3204 function Elist4 (N : Node_Id) return Elist_Id is
3205 pragma Assert (N <= Nodes.Last);
3206 Value : constant Union_Id := Nodes.Table (N).Field4;
3211 return Elist_Id (Value);
3215 function Elist8 (N : Node_Id) return Elist_Id is
3216 pragma Assert (Nkind (N) in N_Entity);
3217 Value : constant Union_Id := Nodes.Table (N + 1).Field8;
3222 return Elist_Id (Value);
3226 function Elist13 (N : Node_Id) return Elist_Id is
3227 pragma Assert (Nkind (N) in N_Entity);
3228 Value : constant Union_Id := Nodes.Table (N + 2).Field6;
3233 return Elist_Id (Value);
3237 function Elist15 (N : Node_Id) return Elist_Id is
3238 pragma Assert (Nkind (N) in N_Entity);
3239 Value : constant Union_Id := Nodes.Table (N + 2).Field8;
3244 return Elist_Id (Value);
3248 function Elist16 (N : Node_Id) return Elist_Id is
3249 pragma Assert (Nkind (N) in N_Entity);
3250 Value : constant Union_Id := Nodes.Table (N + 2).Field9;
3255 return Elist_Id (Value);
3259 function Elist18 (N : Node_Id) return Elist_Id is
3260 pragma Assert (Nkind (N) in N_Entity);
3261 Value : constant Union_Id := Nodes.Table (N + 2).Field11;
3266 return Elist_Id (Value);
3270 function Elist21 (N : Node_Id) return Elist_Id is
3271 pragma Assert (Nkind (N) in N_Entity);
3272 Value : constant Union_Id := Nodes.Table (N + 3).Field8;
3277 return Elist_Id (Value);
3281 function Elist23 (N : Node_Id) return Elist_Id is
3282 pragma Assert (Nkind (N) in N_Entity);
3283 Value : constant Union_Id := Nodes.Table (N + 3).Field10;
3288 return Elist_Id (Value);
3292 function Elist25 (N : Node_Id) return Elist_Id is
3293 pragma Assert (Nkind (N) in N_Entity);
3294 Value : constant Union_Id := Nodes.Table (N + 4).Field7;
3299 return Elist_Id (Value);
3303 function Name1 (N : Node_Id) return Name_Id is
3305 pragma Assert (N <= Nodes.Last);
3306 return Name_Id (Nodes.Table (N).Field1);
3309 function Name2 (N : Node_Id) return Name_Id is
3311 pragma Assert (N <= Nodes.Last);
3312 return Name_Id (Nodes.Table (N).Field2);
3315 function Str3 (N : Node_Id) return String_Id is
3317 pragma Assert (N <= Nodes.Last);
3318 return String_Id (Nodes.Table (N).Field3);
3321 function Uint2 (N : Node_Id) return Uint is
3322 pragma Assert (N <= Nodes.Last);
3323 U : constant Union_Id := Nodes.Table (N).Field2;
3328 return From_Union (U);
3332 function Uint3 (N : Node_Id) return Uint is
3333 pragma Assert (N <= Nodes.Last);
3334 U : constant Union_Id := Nodes.Table (N).Field3;
3339 return From_Union (U);
3343 function Uint4 (N : Node_Id) return Uint is
3344 pragma Assert (N <= Nodes.Last);
3345 U : constant Union_Id := Nodes.Table (N).Field4;
3350 return From_Union (U);
3354 function Uint5 (N : Node_Id) return Uint is
3355 pragma Assert (N <= Nodes.Last);
3356 U : constant Union_Id := Nodes.Table (N).Field5;
3361 return From_Union (U);
3365 function Uint8 (N : Node_Id) return Uint is
3366 pragma Assert (Nkind (N) in N_Entity);
3367 U : constant Union_Id := Nodes.Table (N + 1).Field8;
3372 return From_Union (U);
3376 function Uint9 (N : Node_Id) return Uint is
3377 pragma Assert (Nkind (N) in N_Entity);
3378 U : constant Union_Id := Nodes.Table (N + 1).Field9;
3383 return From_Union (U);
3387 function Uint10 (N : Node_Id) return Uint is
3388 pragma Assert (Nkind (N) in N_Entity);
3389 U : constant Union_Id := Nodes.Table (N + 1).Field10;
3394 return From_Union (U);
3398 function Uint11 (N : Node_Id) return Uint is
3399 pragma Assert (Nkind (N) in N_Entity);
3400 U : constant Union_Id := Nodes.Table (N + 1).Field11;
3405 return From_Union (U);
3409 function Uint12 (N : Node_Id) return Uint is
3410 pragma Assert (Nkind (N) in N_Entity);
3411 U : constant Union_Id := Nodes.Table (N + 1).Field12;
3416 return From_Union (U);
3420 function Uint13 (N : Node_Id) return Uint is
3421 pragma Assert (Nkind (N) in N_Entity);
3422 U : constant Union_Id := Nodes.Table (N + 2).Field6;
3427 return From_Union (U);
3431 function Uint14 (N : Node_Id) return Uint is
3432 pragma Assert (Nkind (N) in N_Entity);
3433 U : constant Union_Id := Nodes.Table (N + 2).Field7;
3438 return From_Union (U);
3442 function Uint15 (N : Node_Id) return Uint is
3443 pragma Assert (Nkind (N) in N_Entity);
3444 U : constant Union_Id := Nodes.Table (N + 2).Field8;
3449 return From_Union (U);
3453 function Uint16 (N : Node_Id) return Uint is
3454 pragma Assert (Nkind (N) in N_Entity);
3455 U : constant Union_Id := Nodes.Table (N + 2).Field9;
3460 return From_Union (U);
3464 function Uint17 (N : Node_Id) return Uint is
3465 pragma Assert (Nkind (N) in N_Entity);
3466 U : constant Union_Id := Nodes.Table (N + 2).Field10;
3471 return From_Union (U);
3475 function Uint22 (N : Node_Id) return Uint is
3476 pragma Assert (Nkind (N) in N_Entity);
3477 U : constant Union_Id := Nodes.Table (N + 3).Field9;
3482 return From_Union (U);
3486 function Ureal3 (N : Node_Id) return Ureal is
3488 pragma Assert (N <= Nodes.Last);
3489 return From_Union (Nodes.Table (N).Field3);
3492 function Ureal18 (N : Node_Id) return Ureal is
3494 pragma Assert (Nkind (N) in N_Entity);
3495 return From_Union (Nodes.Table (N + 2).Field11);
3498 function Ureal21 (N : Node_Id) return Ureal is
3500 pragma Assert (Nkind (N) in N_Entity);
3501 return From_Union (Nodes.Table (N + 3).Field8);
3504 function Flag4 (N : Node_Id) return Boolean is
3506 pragma Assert (N <= Nodes.Last);
3507 return Nodes.Table (N).Flag4;
3510 function Flag5 (N : Node_Id) return Boolean is
3512 pragma Assert (N <= Nodes.Last);
3513 return Nodes.Table (N).Flag5;
3516 function Flag6 (N : Node_Id) return Boolean is
3518 pragma Assert (N <= Nodes.Last);
3519 return Nodes.Table (N).Flag6;
3522 function Flag7 (N : Node_Id) return Boolean is
3524 pragma Assert (N <= Nodes.Last);
3525 return Nodes.Table (N).Flag7;
3528 function Flag8 (N : Node_Id) return Boolean is
3530 pragma Assert (N <= Nodes.Last);
3531 return Nodes.Table (N).Flag8;
3534 function Flag9 (N : Node_Id) return Boolean is
3536 pragma Assert (N <= Nodes.Last);
3537 return Nodes.Table (N).Flag9;
3540 function Flag10 (N : Node_Id) return Boolean is
3542 pragma Assert (N <= Nodes.Last);
3543 return Nodes.Table (N).Flag10;
3546 function Flag11 (N : Node_Id) return Boolean is
3548 pragma Assert (N <= Nodes.Last);
3549 return Nodes.Table (N).Flag11;
3552 function Flag12 (N : Node_Id) return Boolean is
3554 pragma Assert (N <= Nodes.Last);
3555 return Nodes.Table (N).Flag12;
3558 function Flag13 (N : Node_Id) return Boolean is
3560 pragma Assert (N <= Nodes.Last);
3561 return Nodes.Table (N).Flag13;
3564 function Flag14 (N : Node_Id) return Boolean is
3566 pragma Assert (N <= Nodes.Last);
3567 return Nodes.Table (N).Flag14;
3570 function Flag15 (N : Node_Id) return Boolean is
3572 pragma Assert (N <= Nodes.Last);
3573 return Nodes.Table (N).Flag15;
3576 function Flag16 (N : Node_Id) return Boolean is
3578 pragma Assert (N <= Nodes.Last);
3579 return Nodes.Table (N).Flag16;
3582 function Flag17 (N : Node_Id) return Boolean is
3584 pragma Assert (N <= Nodes.Last);
3585 return Nodes.Table (N).Flag17;
3588 function Flag18 (N : Node_Id) return Boolean is
3590 pragma Assert (N <= Nodes.Last);
3591 return Nodes.Table (N).Flag18;
3594 function Flag19 (N : Node_Id) return Boolean is
3596 pragma Assert (Nkind (N) in N_Entity);
3597 return Nodes.Table (N + 1).In_List;
3600 function Flag20 (N : Node_Id) return Boolean is
3602 pragma Assert (Nkind (N) in N_Entity);
3603 return Nodes.Table (N + 1).Unused_1;
3606 function Flag21 (N : Node_Id) return Boolean is
3608 pragma Assert (Nkind (N) in N_Entity);
3609 return Nodes.Table (N + 1).Rewrite_Ins;
3612 function Flag22 (N : Node_Id) return Boolean is
3614 pragma Assert (Nkind (N) in N_Entity);
3615 return Nodes.Table (N + 1).Analyzed;
3618 function Flag23 (N : Node_Id) return Boolean is
3620 pragma Assert (Nkind (N) in N_Entity);
3621 return Nodes.Table (N + 1).Comes_From_Source;
3624 function Flag24 (N : Node_Id) return Boolean is
3626 pragma Assert (Nkind (N) in N_Entity);
3627 return Nodes.Table (N + 1).Error_Posted;
3630 function Flag25 (N : Node_Id) return Boolean is
3632 pragma Assert (Nkind (N) in N_Entity);
3633 return Nodes.Table (N + 1).Flag4;
3636 function Flag26 (N : Node_Id) return Boolean is
3638 pragma Assert (Nkind (N) in N_Entity);
3639 return Nodes.Table (N + 1).Flag5;
3642 function Flag27 (N : Node_Id) return Boolean is
3644 pragma Assert (Nkind (N) in N_Entity);
3645 return Nodes.Table (N + 1).Flag6;
3648 function Flag28 (N : Node_Id) return Boolean is
3650 pragma Assert (Nkind (N) in N_Entity);
3651 return Nodes.Table (N + 1).Flag7;
3654 function Flag29 (N : Node_Id) return Boolean is
3656 pragma Assert (Nkind (N) in N_Entity);
3657 return Nodes.Table (N + 1).Flag8;
3660 function Flag30 (N : Node_Id) return Boolean is
3662 pragma Assert (Nkind (N) in N_Entity);
3663 return Nodes.Table (N + 1).Flag9;
3666 function Flag31 (N : Node_Id) return Boolean is
3668 pragma Assert (Nkind (N) in N_Entity);
3669 return Nodes.Table (N + 1).Flag10;
3672 function Flag32 (N : Node_Id) return Boolean is
3674 pragma Assert (Nkind (N) in N_Entity);
3675 return Nodes.Table (N + 1).Flag11;
3678 function Flag33 (N : Node_Id) return Boolean is
3680 pragma Assert (Nkind (N) in N_Entity);
3681 return Nodes.Table (N + 1).Flag12;
3684 function Flag34 (N : Node_Id) return Boolean is
3686 pragma Assert (Nkind (N) in N_Entity);
3687 return Nodes.Table (N + 1).Flag13;
3690 function Flag35 (N : Node_Id) return Boolean is
3692 pragma Assert (Nkind (N) in N_Entity);
3693 return Nodes.Table (N + 1).Flag14;
3696 function Flag36 (N : Node_Id) return Boolean is
3698 pragma Assert (Nkind (N) in N_Entity);
3699 return Nodes.Table (N + 1).Flag15;
3702 function Flag37 (N : Node_Id) return Boolean is
3704 pragma Assert (Nkind (N) in N_Entity);
3705 return Nodes.Table (N + 1).Flag16;
3708 function Flag38 (N : Node_Id) return Boolean is
3710 pragma Assert (Nkind (N) in N_Entity);
3711 return Nodes.Table (N + 1).Flag17;
3714 function Flag39 (N : Node_Id) return Boolean is
3716 pragma Assert (Nkind (N) in N_Entity);
3717 return Nodes.Table (N + 1).Flag18;
3720 function Flag40 (N : Node_Id) return Boolean is
3722 pragma Assert (Nkind (N) in N_Entity);
3723 return Nodes.Table (N + 2).In_List;
3726 function Flag41 (N : Node_Id) return Boolean is
3728 pragma Assert (Nkind (N) in N_Entity);
3729 return Nodes.Table (N + 2).Unused_1;
3732 function Flag42 (N : Node_Id) return Boolean is
3734 pragma Assert (Nkind (N) in N_Entity);
3735 return Nodes.Table (N + 2).Rewrite_Ins;
3738 function Flag43 (N : Node_Id) return Boolean is
3740 pragma Assert (Nkind (N) in N_Entity);
3741 return Nodes.Table (N + 2).Analyzed;
3744 function Flag44 (N : Node_Id) return Boolean is
3746 pragma Assert (Nkind (N) in N_Entity);
3747 return Nodes.Table (N + 2).Comes_From_Source;
3750 function Flag45 (N : Node_Id) return Boolean is
3752 pragma Assert (Nkind (N) in N_Entity);
3753 return Nodes.Table (N + 2).Error_Posted;
3756 function Flag46 (N : Node_Id) return Boolean is
3758 pragma Assert (Nkind (N) in N_Entity);
3759 return Nodes.Table (N + 2).Flag4;
3762 function Flag47 (N : Node_Id) return Boolean is
3764 pragma Assert (Nkind (N) in N_Entity);
3765 return Nodes.Table (N + 2).Flag5;
3768 function Flag48 (N : Node_Id) return Boolean is
3770 pragma Assert (Nkind (N) in N_Entity);
3771 return Nodes.Table (N + 2).Flag6;
3774 function Flag49 (N : Node_Id) return Boolean is
3776 pragma Assert (Nkind (N) in N_Entity);
3777 return Nodes.Table (N + 2).Flag7;
3780 function Flag50 (N : Node_Id) return Boolean is
3782 pragma Assert (Nkind (N) in N_Entity);
3783 return Nodes.Table (N + 2).Flag8;
3786 function Flag51 (N : Node_Id) return Boolean is
3788 pragma Assert (Nkind (N) in N_Entity);
3789 return Nodes.Table (N + 2).Flag9;
3792 function Flag52 (N : Node_Id) return Boolean is
3794 pragma Assert (Nkind (N) in N_Entity);
3795 return Nodes.Table (N + 2).Flag10;
3798 function Flag53 (N : Node_Id) return Boolean is
3800 pragma Assert (Nkind (N) in N_Entity);
3801 return Nodes.Table (N + 2).Flag11;
3804 function Flag54 (N : Node_Id) return Boolean is
3806 pragma Assert (Nkind (N) in N_Entity);
3807 return Nodes.Table (N + 2).Flag12;
3810 function Flag55 (N : Node_Id) return Boolean is
3812 pragma Assert (Nkind (N) in N_Entity);
3813 return Nodes.Table (N + 2).Flag13;
3816 function Flag56 (N : Node_Id) return Boolean is
3818 pragma Assert (Nkind (N) in N_Entity);
3819 return Nodes.Table (N + 2).Flag14;
3822 function Flag57 (N : Node_Id) return Boolean is
3824 pragma Assert (Nkind (N) in N_Entity);
3825 return Nodes.Table (N + 2).Flag15;
3828 function Flag58 (N : Node_Id) return Boolean is
3830 pragma Assert (Nkind (N) in N_Entity);
3831 return Nodes.Table (N + 2).Flag16;
3834 function Flag59 (N : Node_Id) return Boolean is
3836 pragma Assert (Nkind (N) in N_Entity);
3837 return Nodes.Table (N + 2).Flag17;
3840 function Flag60 (N : Node_Id) return Boolean is
3842 pragma Assert (Nkind (N) in N_Entity);
3843 return Nodes.Table (N + 2).Flag18;
3846 function Flag61 (N : Node_Id) return Boolean is
3848 pragma Assert (Nkind (N) in N_Entity);
3849 return Nodes.Table (N + 1).Pflag1;
3852 function Flag62 (N : Node_Id) return Boolean is
3854 pragma Assert (Nkind (N) in N_Entity);
3855 return Nodes.Table (N + 1).Pflag2;
3858 function Flag63 (N : Node_Id) return Boolean is
3860 pragma Assert (Nkind (N) in N_Entity);
3861 return Nodes.Table (N + 2).Pflag1;
3864 function Flag64 (N : Node_Id) return Boolean is
3866 pragma Assert (Nkind (N) in N_Entity);
3867 return Nodes.Table (N + 2).Pflag2;
3870 function Flag65 (N : Node_Id) return Boolean is
3872 pragma Assert (Nkind (N) in N_Entity);
3873 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag65;
3876 function Flag66 (N : Node_Id) return Boolean is
3878 pragma Assert (Nkind (N) in N_Entity);
3879 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag66;
3882 function Flag67 (N : Node_Id) return Boolean is
3884 pragma Assert (Nkind (N) in N_Entity);
3885 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag67;
3888 function Flag68 (N : Node_Id) return Boolean is
3890 pragma Assert (Nkind (N) in N_Entity);
3891 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag68;
3894 function Flag69 (N : Node_Id) return Boolean is
3896 pragma Assert (Nkind (N) in N_Entity);
3897 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag69;
3900 function Flag70 (N : Node_Id) return Boolean is
3902 pragma Assert (Nkind (N) in N_Entity);
3903 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag70;
3906 function Flag71 (N : Node_Id) return Boolean is
3908 pragma Assert (Nkind (N) in N_Entity);
3909 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag71;
3912 function Flag72 (N : Node_Id) return Boolean is
3914 pragma Assert (Nkind (N) in N_Entity);
3915 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag72;
3918 function Flag73 (N : Node_Id) return Boolean is
3920 pragma Assert (Nkind (N) in N_Entity);
3921 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag73;
3924 function Flag74 (N : Node_Id) return Boolean is
3926 pragma Assert (Nkind (N) in N_Entity);
3927 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag74;
3930 function Flag75 (N : Node_Id) return Boolean is
3932 pragma Assert (Nkind (N) in N_Entity);
3933 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag75;
3936 function Flag76 (N : Node_Id) return Boolean is
3938 pragma Assert (Nkind (N) in N_Entity);
3939 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag76;
3942 function Flag77 (N : Node_Id) return Boolean is
3944 pragma Assert (Nkind (N) in N_Entity);
3945 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag77;
3948 function Flag78 (N : Node_Id) return Boolean is
3950 pragma Assert (Nkind (N) in N_Entity);
3951 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag78;
3954 function Flag79 (N : Node_Id) return Boolean is
3956 pragma Assert (Nkind (N) in N_Entity);
3957 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag79;
3960 function Flag80 (N : Node_Id) return Boolean is
3962 pragma Assert (Nkind (N) in N_Entity);
3963 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag80;
3966 function Flag81 (N : Node_Id) return Boolean is
3968 pragma Assert (Nkind (N) in N_Entity);
3969 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag81;
3972 function Flag82 (N : Node_Id) return Boolean is
3974 pragma Assert (Nkind (N) in N_Entity);
3975 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag82;
3978 function Flag83 (N : Node_Id) return Boolean is
3980 pragma Assert (Nkind (N) in N_Entity);
3981 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag83;
3984 function Flag84 (N : Node_Id) return Boolean is
3986 pragma Assert (Nkind (N) in N_Entity);
3987 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag84;
3990 function Flag85 (N : Node_Id) return Boolean is
3992 pragma Assert (Nkind (N) in N_Entity);
3993 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag85;
3996 function Flag86 (N : Node_Id) return Boolean is
3998 pragma Assert (Nkind (N) in N_Entity);
3999 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag86;
4002 function Flag87 (N : Node_Id) return Boolean is
4004 pragma Assert (Nkind (N) in N_Entity);
4005 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag87;
4008 function Flag88 (N : Node_Id) return Boolean is
4010 pragma Assert (Nkind (N) in N_Entity);
4011 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag88;
4014 function Flag89 (N : Node_Id) return Boolean is
4016 pragma Assert (Nkind (N) in N_Entity);
4017 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag89;
4020 function Flag90 (N : Node_Id) return Boolean is
4022 pragma Assert (Nkind (N) in N_Entity);
4023 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag90;
4026 function Flag91 (N : Node_Id) return Boolean is
4028 pragma Assert (Nkind (N) in N_Entity);
4029 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag91;
4032 function Flag92 (N : Node_Id) return Boolean is
4034 pragma Assert (Nkind (N) in N_Entity);
4035 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag92;
4038 function Flag93 (N : Node_Id) return Boolean is
4040 pragma Assert (Nkind (N) in N_Entity);
4041 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag93;
4044 function Flag94 (N : Node_Id) return Boolean is
4046 pragma Assert (Nkind (N) in N_Entity);
4047 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag94;
4050 function Flag95 (N : Node_Id) return Boolean is
4052 pragma Assert (Nkind (N) in N_Entity);
4053 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag95;
4056 function Flag96 (N : Node_Id) return Boolean is
4058 pragma Assert (Nkind (N) in N_Entity);
4059 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag96;
4062 function Flag97 (N : Node_Id) return Boolean is
4064 pragma Assert (Nkind (N) in N_Entity);
4065 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag97;
4068 function Flag98 (N : Node_Id) return Boolean is
4070 pragma Assert (Nkind (N) in N_Entity);
4071 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag98;
4074 function Flag99 (N : Node_Id) return Boolean is
4076 pragma Assert (Nkind (N) in N_Entity);
4077 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag99;
4080 function Flag100 (N : Node_Id) return Boolean is
4082 pragma Assert (Nkind (N) in N_Entity);
4083 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag100;
4086 function Flag101 (N : Node_Id) return Boolean is
4088 pragma Assert (Nkind (N) in N_Entity);
4089 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag101;
4092 function Flag102 (N : Node_Id) return Boolean is
4094 pragma Assert (Nkind (N) in N_Entity);
4095 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag102;
4098 function Flag103 (N : Node_Id) return Boolean is
4100 pragma Assert (Nkind (N) in N_Entity);
4101 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag103;
4104 function Flag104 (N : Node_Id) return Boolean is
4106 pragma Assert (Nkind (N) in N_Entity);
4107 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag104;
4110 function Flag105 (N : Node_Id) return Boolean is
4112 pragma Assert (Nkind (N) in N_Entity);
4113 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag105;
4116 function Flag106 (N : Node_Id) return Boolean is
4118 pragma Assert (Nkind (N) in N_Entity);
4119 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag106;
4122 function Flag107 (N : Node_Id) return Boolean is
4124 pragma Assert (Nkind (N) in N_Entity);
4125 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag107;
4128 function Flag108 (N : Node_Id) return Boolean is
4130 pragma Assert (Nkind (N) in N_Entity);
4131 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag108;
4134 function Flag109 (N : Node_Id) return Boolean is
4136 pragma Assert (Nkind (N) in N_Entity);
4137 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag109;
4140 function Flag110 (N : Node_Id) return Boolean is
4142 pragma Assert (Nkind (N) in N_Entity);
4143 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag110;
4146 function Flag111 (N : Node_Id) return Boolean is
4148 pragma Assert (Nkind (N) in N_Entity);
4149 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag111;
4152 function Flag112 (N : Node_Id) return Boolean is
4154 pragma Assert (Nkind (N) in N_Entity);
4155 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag112;
4158 function Flag113 (N : Node_Id) return Boolean is
4160 pragma Assert (Nkind (N) in N_Entity);
4161 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag113;
4164 function Flag114 (N : Node_Id) return Boolean is
4166 pragma Assert (Nkind (N) in N_Entity);
4167 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag114;
4170 function Flag115 (N : Node_Id) return Boolean is
4172 pragma Assert (Nkind (N) in N_Entity);
4173 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag115;
4176 function Flag116 (N : Node_Id) return Boolean is
4178 pragma Assert (Nkind (N) in N_Entity);
4179 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag116;
4182 function Flag117 (N : Node_Id) return Boolean is
4184 pragma Assert (Nkind (N) in N_Entity);
4185 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag117;
4188 function Flag118 (N : Node_Id) return Boolean is
4190 pragma Assert (Nkind (N) in N_Entity);
4191 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag118;
4194 function Flag119 (N : Node_Id) return Boolean is
4196 pragma Assert (Nkind (N) in N_Entity);
4197 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag119;
4200 function Flag120 (N : Node_Id) return Boolean is
4202 pragma Assert (Nkind (N) in N_Entity);
4203 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag120;
4206 function Flag121 (N : Node_Id) return Boolean is
4208 pragma Assert (Nkind (N) in N_Entity);
4209 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag121;
4212 function Flag122 (N : Node_Id) return Boolean is
4214 pragma Assert (Nkind (N) in N_Entity);
4215 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag122;
4218 function Flag123 (N : Node_Id) return Boolean is
4220 pragma Assert (Nkind (N) in N_Entity);
4221 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag123;
4224 function Flag124 (N : Node_Id) return Boolean is
4226 pragma Assert (Nkind (N) in N_Entity);
4227 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag124;
4230 function Flag125 (N : Node_Id) return Boolean is
4232 pragma Assert (Nkind (N) in N_Entity);
4233 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag125;
4236 function Flag126 (N : Node_Id) return Boolean is
4238 pragma Assert (Nkind (N) in N_Entity);
4239 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag126;
4242 function Flag127 (N : Node_Id) return Boolean is
4244 pragma Assert (Nkind (N) in N_Entity);
4245 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag127;
4248 function Flag128 (N : Node_Id) return Boolean is
4250 pragma Assert (Nkind (N) in N_Entity);
4251 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag128;
4254 function Flag129 (N : Node_Id) return Boolean is
4256 pragma Assert (Nkind (N) in N_Entity);
4257 return Nodes.Table (N + 3).In_List;
4260 function Flag130 (N : Node_Id) return Boolean is
4262 pragma Assert (Nkind (N) in N_Entity);
4263 return Nodes.Table (N + 3).Unused_1;
4266 function Flag131 (N : Node_Id) return Boolean is
4268 pragma Assert (Nkind (N) in N_Entity);
4269 return Nodes.Table (N + 3).Rewrite_Ins;
4272 function Flag132 (N : Node_Id) return Boolean is
4274 pragma Assert (Nkind (N) in N_Entity);
4275 return Nodes.Table (N + 3).Analyzed;
4278 function Flag133 (N : Node_Id) return Boolean is
4280 pragma Assert (Nkind (N) in N_Entity);
4281 return Nodes.Table (N + 3).Comes_From_Source;
4284 function Flag134 (N : Node_Id) return Boolean is
4286 pragma Assert (Nkind (N) in N_Entity);
4287 return Nodes.Table (N + 3).Error_Posted;
4290 function Flag135 (N : Node_Id) return Boolean is
4292 pragma Assert (Nkind (N) in N_Entity);
4293 return Nodes.Table (N + 3).Flag4;
4296 function Flag136 (N : Node_Id) return Boolean is
4298 pragma Assert (Nkind (N) in N_Entity);
4299 return Nodes.Table (N + 3).Flag5;
4302 function Flag137 (N : Node_Id) return Boolean is
4304 pragma Assert (Nkind (N) in N_Entity);
4305 return Nodes.Table (N + 3).Flag6;
4308 function Flag138 (N : Node_Id) return Boolean is
4310 pragma Assert (Nkind (N) in N_Entity);
4311 return Nodes.Table (N + 3).Flag7;
4314 function Flag139 (N : Node_Id) return Boolean is
4316 pragma Assert (Nkind (N) in N_Entity);
4317 return Nodes.Table (N + 3).Flag8;
4320 function Flag140 (N : Node_Id) return Boolean is
4322 pragma Assert (Nkind (N) in N_Entity);
4323 return Nodes.Table (N + 3).Flag9;
4326 function Flag141 (N : Node_Id) return Boolean is
4328 pragma Assert (Nkind (N) in N_Entity);
4329 return Nodes.Table (N + 3).Flag10;
4332 function Flag142 (N : Node_Id) return Boolean is
4334 pragma Assert (Nkind (N) in N_Entity);
4335 return Nodes.Table (N + 3).Flag11;
4338 function Flag143 (N : Node_Id) return Boolean is
4340 pragma Assert (Nkind (N) in N_Entity);
4341 return Nodes.Table (N + 3).Flag12;
4344 function Flag144 (N : Node_Id) return Boolean is
4346 pragma Assert (Nkind (N) in N_Entity);
4347 return Nodes.Table (N + 3).Flag13;
4350 function Flag145 (N : Node_Id) return Boolean is
4352 pragma Assert (Nkind (N) in N_Entity);
4353 return Nodes.Table (N + 3).Flag14;
4356 function Flag146 (N : Node_Id) return Boolean is
4358 pragma Assert (Nkind (N) in N_Entity);
4359 return Nodes.Table (N + 3).Flag15;
4362 function Flag147 (N : Node_Id) return Boolean is
4364 pragma Assert (Nkind (N) in N_Entity);
4365 return Nodes.Table (N + 3).Flag16;
4368 function Flag148 (N : Node_Id) return Boolean is
4370 pragma Assert (Nkind (N) in N_Entity);
4371 return Nodes.Table (N + 3).Flag17;
4374 function Flag149 (N : Node_Id) return Boolean is
4376 pragma Assert (Nkind (N) in N_Entity);
4377 return Nodes.Table (N + 3).Flag18;
4380 function Flag150 (N : Node_Id) return Boolean is
4382 pragma Assert (Nkind (N) in N_Entity);
4383 return Nodes.Table (N + 3).Pflag1;
4386 function Flag151 (N : Node_Id) return Boolean is
4388 pragma Assert (Nkind (N) in N_Entity);
4389 return Nodes.Table (N + 3).Pflag2;
4392 function Flag152 (N : Node_Id) return Boolean is
4394 pragma Assert (Nkind (N) in N_Entity);
4395 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag152;
4398 function Flag153 (N : Node_Id) return Boolean is
4400 pragma Assert (Nkind (N) in N_Entity);
4401 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag153;
4404 function Flag154 (N : Node_Id) return Boolean is
4406 pragma Assert (Nkind (N) in N_Entity);
4407 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag154;
4410 function Flag155 (N : Node_Id) return Boolean is
4412 pragma Assert (Nkind (N) in N_Entity);
4413 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag155;
4416 function Flag156 (N : Node_Id) return Boolean is
4418 pragma Assert (Nkind (N) in N_Entity);
4419 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag156;
4422 function Flag157 (N : Node_Id) return Boolean is
4424 pragma Assert (Nkind (N) in N_Entity);
4425 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag157;
4428 function Flag158 (N : Node_Id) return Boolean is
4430 pragma Assert (Nkind (N) in N_Entity);
4431 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag158;
4434 function Flag159 (N : Node_Id) return Boolean is
4436 pragma Assert (Nkind (N) in N_Entity);
4437 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag159;
4440 function Flag160 (N : Node_Id) return Boolean is
4442 pragma Assert (Nkind (N) in N_Entity);
4443 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag160;
4446 function Flag161 (N : Node_Id) return Boolean is
4448 pragma Assert (Nkind (N) in N_Entity);
4449 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag161;
4452 function Flag162 (N : Node_Id) return Boolean is
4454 pragma Assert (Nkind (N) in N_Entity);
4455 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag162;
4458 function Flag163 (N : Node_Id) return Boolean is
4460 pragma Assert (Nkind (N) in N_Entity);
4461 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag163;
4464 function Flag164 (N : Node_Id) return Boolean is
4466 pragma Assert (Nkind (N) in N_Entity);
4467 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag164;
4470 function Flag165 (N : Node_Id) return Boolean is
4472 pragma Assert (Nkind (N) in N_Entity);
4473 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag165;
4476 function Flag166 (N : Node_Id) return Boolean is
4478 pragma Assert (Nkind (N) in N_Entity);
4479 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag166;
4482 function Flag167 (N : Node_Id) return Boolean is
4484 pragma Assert (Nkind (N) in N_Entity);
4485 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag167;
4488 function Flag168 (N : Node_Id) return Boolean is
4490 pragma Assert (Nkind (N) in N_Entity);
4491 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag168;
4494 function Flag169 (N : Node_Id) return Boolean is
4496 pragma Assert (Nkind (N) in N_Entity);
4497 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag169;
4500 function Flag170 (N : Node_Id) return Boolean is
4502 pragma Assert (Nkind (N) in N_Entity);
4503 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag170;
4506 function Flag171 (N : Node_Id) return Boolean is
4508 pragma Assert (Nkind (N) in N_Entity);
4509 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag171;
4512 function Flag172 (N : Node_Id) return Boolean is
4514 pragma Assert (Nkind (N) in N_Entity);
4515 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag172;
4518 function Flag173 (N : Node_Id) return Boolean is
4520 pragma Assert (Nkind (N) in N_Entity);
4521 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag173;
4524 function Flag174 (N : Node_Id) return Boolean is
4526 pragma Assert (Nkind (N) in N_Entity);
4527 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag174;
4530 function Flag175 (N : Node_Id) return Boolean is
4532 pragma Assert (Nkind (N) in N_Entity);
4533 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag175;
4536 function Flag176 (N : Node_Id) return Boolean is
4538 pragma Assert (Nkind (N) in N_Entity);
4539 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag176;
4542 function Flag177 (N : Node_Id) return Boolean is
4544 pragma Assert (Nkind (N) in N_Entity);
4545 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag177;
4548 function Flag178 (N : Node_Id) return Boolean is
4550 pragma Assert (Nkind (N) in N_Entity);
4551 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag178;
4554 function Flag179 (N : Node_Id) return Boolean is
4556 pragma Assert (Nkind (N) in N_Entity);
4557 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag179;
4560 function Flag180 (N : Node_Id) return Boolean is
4562 pragma Assert (Nkind (N) in N_Entity);
4563 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag180;
4566 function Flag181 (N : Node_Id) return Boolean is
4568 pragma Assert (Nkind (N) in N_Entity);
4569 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag181;
4572 function Flag182 (N : Node_Id) return Boolean is
4574 pragma Assert (Nkind (N) in N_Entity);
4575 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag182;
4578 function Flag183 (N : Node_Id) return Boolean is
4580 pragma Assert (Nkind (N) in N_Entity);
4581 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag183;
4584 function Flag184 (N : Node_Id) return Boolean is
4586 pragma Assert (Nkind (N) in N_Entity);
4587 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag184;
4590 function Flag185 (N : Node_Id) return Boolean is
4592 pragma Assert (Nkind (N) in N_Entity);
4593 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag185;
4596 function Flag186 (N : Node_Id) return Boolean is
4598 pragma Assert (Nkind (N) in N_Entity);
4599 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag186;
4602 function Flag187 (N : Node_Id) return Boolean is
4604 pragma Assert (Nkind (N) in N_Entity);
4605 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag187;
4608 function Flag188 (N : Node_Id) return Boolean is
4610 pragma Assert (Nkind (N) in N_Entity);
4611 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag188;
4614 function Flag189 (N : Node_Id) return Boolean is
4616 pragma Assert (Nkind (N) in N_Entity);
4617 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag189;
4620 function Flag190 (N : Node_Id) return Boolean is
4622 pragma Assert (Nkind (N) in N_Entity);
4623 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag190;
4626 function Flag191 (N : Node_Id) return Boolean is
4628 pragma Assert (Nkind (N) in N_Entity);
4629 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag191;
4632 function Flag192 (N : Node_Id) return Boolean is
4634 pragma Assert (Nkind (N) in N_Entity);
4635 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag192;
4638 function Flag193 (N : Node_Id) return Boolean is
4640 pragma Assert (Nkind (N) in N_Entity);
4641 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag193;
4644 function Flag194 (N : Node_Id) return Boolean is
4646 pragma Assert (Nkind (N) in N_Entity);
4647 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag194;
4650 function Flag195 (N : Node_Id) return Boolean is
4652 pragma Assert (Nkind (N) in N_Entity);
4653 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag195;
4656 function Flag196 (N : Node_Id) return Boolean is
4658 pragma Assert (Nkind (N) in N_Entity);
4659 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag196;
4662 function Flag197 (N : Node_Id) return Boolean is
4664 pragma Assert (Nkind (N) in N_Entity);
4665 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag197;
4668 function Flag198 (N : Node_Id) return Boolean is
4670 pragma Assert (Nkind (N) in N_Entity);
4671 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag198;
4674 function Flag199 (N : Node_Id) return Boolean is
4676 pragma Assert (Nkind (N) in N_Entity);
4677 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag199;
4680 function Flag200 (N : Node_Id) return Boolean is
4682 pragma Assert (Nkind (N) in N_Entity);
4683 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag200;
4686 function Flag201 (N : Node_Id) return Boolean is
4688 pragma Assert (Nkind (N) in N_Entity);
4689 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag201;
4692 function Flag202 (N : Node_Id) return Boolean is
4694 pragma Assert (Nkind (N) in N_Entity);
4695 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag202;
4698 function Flag203 (N : Node_Id) return Boolean is
4700 pragma Assert (Nkind (N) in N_Entity);
4701 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag203;
4704 function Flag204 (N : Node_Id) return Boolean is
4706 pragma Assert (Nkind (N) in N_Entity);
4707 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag204;
4710 function Flag205 (N : Node_Id) return Boolean is
4712 pragma Assert (Nkind (N) in N_Entity);
4713 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag205;
4716 function Flag206 (N : Node_Id) return Boolean is
4718 pragma Assert (Nkind (N) in N_Entity);
4719 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag206;
4722 function Flag207 (N : Node_Id) return Boolean is
4724 pragma Assert (Nkind (N) in N_Entity);
4725 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag207;
4728 function Flag208 (N : Node_Id) return Boolean is
4730 pragma Assert (Nkind (N) in N_Entity);
4731 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag208;
4734 function Flag209 (N : Node_Id) return Boolean is
4736 pragma Assert (Nkind (N) in N_Entity);
4737 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag209;
4740 function Flag210 (N : Node_Id) return Boolean is
4742 pragma Assert (Nkind (N) in N_Entity);
4743 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag210;
4746 function Flag211 (N : Node_Id) return Boolean is
4748 pragma Assert (Nkind (N) in N_Entity);
4749 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag211;
4752 function Flag212 (N : Node_Id) return Boolean is
4754 pragma Assert (Nkind (N) in N_Entity);
4755 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag212;
4758 function Flag213 (N : Node_Id) return Boolean is
4760 pragma Assert (Nkind (N) in N_Entity);
4761 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag213;
4764 function Flag214 (N : Node_Id) return Boolean is
4766 pragma Assert (Nkind (N) in N_Entity);
4767 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag214;
4770 function Flag215 (N : Node_Id) return Boolean is
4772 pragma Assert (Nkind (N) in N_Entity);
4773 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag215;
4776 function Flag216 (N : Node_Id) return Boolean is
4778 pragma Assert (Nkind (N) in N_Entity);
4779 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag216;
4782 function Flag217 (N : Node_Id) return Boolean is
4784 pragma Assert (Nkind (N) in N_Entity);
4785 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag217;
4788 function Flag218 (N : Node_Id) return Boolean is
4790 pragma Assert (Nkind (N) in N_Entity);
4791 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag218;
4794 function Flag219 (N : Node_Id) return Boolean is
4796 pragma Assert (Nkind (N) in N_Entity);
4797 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag219;
4800 function Flag220 (N : Node_Id) return Boolean is
4802 pragma Assert (Nkind (N) in N_Entity);
4803 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag220;
4806 function Flag221 (N : Node_Id) return Boolean is
4808 pragma Assert (Nkind (N) in N_Entity);
4809 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag221;
4812 function Flag222 (N : Node_Id) return Boolean is
4814 pragma Assert (Nkind (N) in N_Entity);
4815 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag222;
4818 function Flag223 (N : Node_Id) return Boolean is
4820 pragma Assert (Nkind (N) in N_Entity);
4821 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag223;
4824 function Flag224 (N : Node_Id) return Boolean is
4826 pragma Assert (Nkind (N) in N_Entity);
4827 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag224;
4830 function Flag225 (N : Node_Id) return Boolean is
4832 pragma Assert (Nkind (N) in N_Entity);
4833 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag225;
4836 function Flag226 (N : Node_Id) return Boolean is
4838 pragma Assert (Nkind (N) in N_Entity);
4839 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag226;
4842 function Flag227 (N : Node_Id) return Boolean is
4844 pragma Assert (Nkind (N) in N_Entity);
4845 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag227;
4848 function Flag228 (N : Node_Id) return Boolean is
4850 pragma Assert (Nkind (N) in N_Entity);
4851 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag228;
4854 function Flag229 (N : Node_Id) return Boolean is
4856 pragma Assert (Nkind (N) in N_Entity);
4857 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag229;
4860 function Flag230 (N : Node_Id) return Boolean is
4862 pragma Assert (Nkind (N) in N_Entity);
4863 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag230;
4866 procedure Set_Nkind (N : Node_Id; Val : Node_Kind) is
4868 pragma Assert (N <= Nodes.Last);
4869 Nodes.Table (N).Nkind := Val;
4872 procedure Set_Field1 (N : Node_Id; Val : Union_Id) is
4874 pragma Assert (N <= Nodes.Last);
4875 Nodes.Table (N).Field1 := Val;
4878 procedure Set_Field2 (N : Node_Id; Val : Union_Id) is
4880 pragma Assert (N <= Nodes.Last);
4881 Nodes.Table (N).Field2 := Val;
4884 procedure Set_Field3 (N : Node_Id; Val : Union_Id) is
4886 pragma Assert (N <= Nodes.Last);
4887 Nodes.Table (N).Field3 := Val;
4890 procedure Set_Field4 (N : Node_Id; Val : Union_Id) is
4892 pragma Assert (N <= Nodes.Last);
4893 Nodes.Table (N).Field4 := Val;
4896 procedure Set_Field5 (N : Node_Id; Val : Union_Id) is
4898 pragma Assert (N <= Nodes.Last);
4899 Nodes.Table (N).Field5 := Val;
4902 procedure Set_Field6 (N : Node_Id; Val : Union_Id) is
4904 pragma Assert (Nkind (N) in N_Entity);
4905 Nodes.Table (N + 1).Field6 := Val;
4908 procedure Set_Field7 (N : Node_Id; Val : Union_Id) is
4910 pragma Assert (Nkind (N) in N_Entity);
4911 Nodes.Table (N + 1).Field7 := Val;
4914 procedure Set_Field8 (N : Node_Id; Val : Union_Id) is
4916 pragma Assert (Nkind (N) in N_Entity);
4917 Nodes.Table (N + 1).Field8 := Val;
4920 procedure Set_Field9 (N : Node_Id; Val : Union_Id) is
4922 pragma Assert (Nkind (N) in N_Entity);
4923 Nodes.Table (N + 1).Field9 := Val;
4926 procedure Set_Field10 (N : Node_Id; Val : Union_Id) is
4928 pragma Assert (Nkind (N) in N_Entity);
4929 Nodes.Table (N + 1).Field10 := Val;
4932 procedure Set_Field11 (N : Node_Id; Val : Union_Id) is
4934 pragma Assert (Nkind (N) in N_Entity);
4935 Nodes.Table (N + 1).Field11 := Val;
4938 procedure Set_Field12 (N : Node_Id; Val : Union_Id) is
4940 pragma Assert (Nkind (N) in N_Entity);
4941 Nodes.Table (N + 1).Field12 := Val;
4944 procedure Set_Field13 (N : Node_Id; Val : Union_Id) is
4946 pragma Assert (Nkind (N) in N_Entity);
4947 Nodes.Table (N + 2).Field6 := Val;
4950 procedure Set_Field14 (N : Node_Id; Val : Union_Id) is
4952 pragma Assert (Nkind (N) in N_Entity);
4953 Nodes.Table (N + 2).Field7 := Val;
4956 procedure Set_Field15 (N : Node_Id; Val : Union_Id) is
4958 pragma Assert (Nkind (N) in N_Entity);
4959 Nodes.Table (N + 2).Field8 := Val;
4962 procedure Set_Field16 (N : Node_Id; Val : Union_Id) is
4964 pragma Assert (Nkind (N) in N_Entity);
4965 Nodes.Table (N + 2).Field9 := Val;
4968 procedure Set_Field17 (N : Node_Id; Val : Union_Id) is
4970 pragma Assert (Nkind (N) in N_Entity);
4971 Nodes.Table (N + 2).Field10 := Val;
4974 procedure Set_Field18 (N : Node_Id; Val : Union_Id) is
4976 pragma Assert (Nkind (N) in N_Entity);
4977 Nodes.Table (N + 2).Field11 := Val;
4980 procedure Set_Field19 (N : Node_Id; Val : Union_Id) is
4982 pragma Assert (Nkind (N) in N_Entity);
4983 Nodes.Table (N + 3).Field6 := Val;
4986 procedure Set_Field20 (N : Node_Id; Val : Union_Id) is
4988 pragma Assert (Nkind (N) in N_Entity);
4989 Nodes.Table (N + 3).Field7 := Val;
4992 procedure Set_Field21 (N : Node_Id; Val : Union_Id) is
4994 pragma Assert (Nkind (N) in N_Entity);
4995 Nodes.Table (N + 3).Field8 := Val;
4998 procedure Set_Field22 (N : Node_Id; Val : Union_Id) is
5000 pragma Assert (Nkind (N) in N_Entity);
5001 Nodes.Table (N + 3).Field9 := Val;
5004 procedure Set_Field23 (N : Node_Id; Val : Union_Id) is
5006 pragma Assert (Nkind (N) in N_Entity);
5007 Nodes.Table (N + 3).Field10 := Val;
5010 procedure Set_Field24 (N : Node_Id; Val : Union_Id) is
5012 pragma Assert (Nkind (N) in N_Entity);
5013 Nodes.Table (N + 4).Field6 := Val;
5016 procedure Set_Field25 (N : Node_Id; Val : Union_Id) is
5018 pragma Assert (Nkind (N) in N_Entity);
5019 Nodes.Table (N + 4).Field7 := Val;
5022 procedure Set_Field26 (N : Node_Id; Val : Union_Id) is
5024 pragma Assert (Nkind (N) in N_Entity);
5025 Nodes.Table (N + 4).Field8 := Val;
5028 procedure Set_Field27 (N : Node_Id; Val : Union_Id) is
5030 pragma Assert (Nkind (N) in N_Entity);
5031 Nodes.Table (N + 4).Field9 := Val;
5034 procedure Set_Field28 (N : Node_Id; Val : Union_Id) is
5036 pragma Assert (Nkind (N) in N_Entity);
5037 Nodes.Table (N + 4).Field10 := Val;
5040 procedure Set_Node1 (N : Node_Id; Val : Node_Id) is
5042 pragma Assert (N <= Nodes.Last);
5043 Nodes.Table (N).Field1 := Union_Id (Val);
5046 procedure Set_Node2 (N : Node_Id; Val : Node_Id) is
5048 pragma Assert (N <= Nodes.Last);
5049 Nodes.Table (N).Field2 := Union_Id (Val);
5052 procedure Set_Node3 (N : Node_Id; Val : Node_Id) is
5054 pragma Assert (N <= Nodes.Last);
5055 Nodes.Table (N).Field3 := Union_Id (Val);
5058 procedure Set_Node4 (N : Node_Id; Val : Node_Id) is
5060 pragma Assert (N <= Nodes.Last);
5061 Nodes.Table (N).Field4 := Union_Id (Val);
5064 procedure Set_Node5 (N : Node_Id; Val : Node_Id) is
5066 pragma Assert (N <= Nodes.Last);
5067 Nodes.Table (N).Field5 := Union_Id (Val);
5070 procedure Set_Node6 (N : Node_Id; Val : Node_Id) is
5072 pragma Assert (Nkind (N) in N_Entity);
5073 Nodes.Table (N + 1).Field6 := Union_Id (Val);
5076 procedure Set_Node7 (N : Node_Id; Val : Node_Id) is
5078 pragma Assert (Nkind (N) in N_Entity);
5079 Nodes.Table (N + 1).Field7 := Union_Id (Val);
5082 procedure Set_Node8 (N : Node_Id; Val : Node_Id) is
5084 pragma Assert (Nkind (N) in N_Entity);
5085 Nodes.Table (N + 1).Field8 := Union_Id (Val);
5088 procedure Set_Node9 (N : Node_Id; Val : Node_Id) is
5090 pragma Assert (Nkind (N) in N_Entity);
5091 Nodes.Table (N + 1).Field9 := Union_Id (Val);
5094 procedure Set_Node10 (N : Node_Id; Val : Node_Id) is
5096 pragma Assert (Nkind (N) in N_Entity);
5097 Nodes.Table (N + 1).Field10 := Union_Id (Val);
5100 procedure Set_Node11 (N : Node_Id; Val : Node_Id) is
5102 pragma Assert (Nkind (N) in N_Entity);
5103 Nodes.Table (N + 1).Field11 := Union_Id (Val);
5106 procedure Set_Node12 (N : Node_Id; Val : Node_Id) is
5108 pragma Assert (Nkind (N) in N_Entity);
5109 Nodes.Table (N + 1).Field12 := Union_Id (Val);
5112 procedure Set_Node13 (N : Node_Id; Val : Node_Id) is
5114 pragma Assert (Nkind (N) in N_Entity);
5115 Nodes.Table (N + 2).Field6 := Union_Id (Val);
5118 procedure Set_Node14 (N : Node_Id; Val : Node_Id) is
5120 pragma Assert (Nkind (N) in N_Entity);
5121 Nodes.Table (N + 2).Field7 := Union_Id (Val);
5124 procedure Set_Node15 (N : Node_Id; Val : Node_Id) is
5126 pragma Assert (Nkind (N) in N_Entity);
5127 Nodes.Table (N + 2).Field8 := Union_Id (Val);
5130 procedure Set_Node16 (N : Node_Id; Val : Node_Id) is
5132 pragma Assert (Nkind (N) in N_Entity);
5133 Nodes.Table (N + 2).Field9 := Union_Id (Val);
5136 procedure Set_Node17 (N : Node_Id; Val : Node_Id) is
5138 pragma Assert (Nkind (N) in N_Entity);
5139 Nodes.Table (N + 2).Field10 := Union_Id (Val);
5142 procedure Set_Node18 (N : Node_Id; Val : Node_Id) is
5144 pragma Assert (Nkind (N) in N_Entity);
5145 Nodes.Table (N + 2).Field11 := Union_Id (Val);
5148 procedure Set_Node19 (N : Node_Id; Val : Node_Id) is
5150 pragma Assert (Nkind (N) in N_Entity);
5151 Nodes.Table (N + 3).Field6 := Union_Id (Val);
5154 procedure Set_Node20 (N : Node_Id; Val : Node_Id) is
5156 pragma Assert (Nkind (N) in N_Entity);
5157 Nodes.Table (N + 3).Field7 := Union_Id (Val);
5160 procedure Set_Node21 (N : Node_Id; Val : Node_Id) is
5162 pragma Assert (Nkind (N) in N_Entity);
5163 Nodes.Table (N + 3).Field8 := Union_Id (Val);
5166 procedure Set_Node22 (N : Node_Id; Val : Node_Id) is
5168 pragma Assert (Nkind (N) in N_Entity);
5169 Nodes.Table (N + 3).Field9 := Union_Id (Val);
5172 procedure Set_Node23 (N : Node_Id; Val : Node_Id) is
5174 pragma Assert (Nkind (N) in N_Entity);
5175 Nodes.Table (N + 3).Field10 := Union_Id (Val);
5178 procedure Set_Node24 (N : Node_Id; Val : Node_Id) is
5180 pragma Assert (Nkind (N) in N_Entity);
5181 Nodes.Table (N + 4).Field6 := Union_Id (Val);
5184 procedure Set_Node25 (N : Node_Id; Val : Node_Id) is
5186 pragma Assert (Nkind (N) in N_Entity);
5187 Nodes.Table (N + 4).Field7 := Union_Id (Val);
5190 procedure Set_Node26 (N : Node_Id; Val : Node_Id) is
5192 pragma Assert (Nkind (N) in N_Entity);
5193 Nodes.Table (N + 4).Field8 := Union_Id (Val);
5196 procedure Set_Node27 (N : Node_Id; Val : Node_Id) is
5198 pragma Assert (Nkind (N) in N_Entity);
5199 Nodes.Table (N + 4).Field9 := Union_Id (Val);
5202 procedure Set_Node28 (N : Node_Id; Val : Node_Id) is
5204 pragma Assert (Nkind (N) in N_Entity);
5205 Nodes.Table (N + 4).Field10 := Union_Id (Val);
5208 procedure Set_List1 (N : Node_Id; Val : List_Id) is
5210 pragma Assert (N <= Nodes.Last);
5211 Nodes.Table (N).Field1 := Union_Id (Val);
5214 procedure Set_List2 (N : Node_Id; Val : List_Id) is
5216 pragma Assert (N <= Nodes.Last);
5217 Nodes.Table (N).Field2 := Union_Id (Val);
5220 procedure Set_List3 (N : Node_Id; Val : List_Id) is
5222 pragma Assert (N <= Nodes.Last);
5223 Nodes.Table (N).Field3 := Union_Id (Val);
5226 procedure Set_List4 (N : Node_Id; Val : List_Id) is
5228 pragma Assert (N <= Nodes.Last);
5229 Nodes.Table (N).Field4 := Union_Id (Val);
5232 procedure Set_List5 (N : Node_Id; Val : List_Id) is
5234 pragma Assert (N <= Nodes.Last);
5235 Nodes.Table (N).Field5 := Union_Id (Val);
5238 procedure Set_List10 (N : Node_Id; Val : List_Id) is
5240 pragma Assert (Nkind (N) in N_Entity);
5241 Nodes.Table (N + 1).Field10 := Union_Id (Val);
5244 procedure Set_List14 (N : Node_Id; Val : List_Id) is
5246 pragma Assert (Nkind (N) in N_Entity);
5247 Nodes.Table (N + 2).Field7 := Union_Id (Val);
5250 procedure Set_Elist1 (N : Node_Id; Val : Elist_Id) is
5252 Nodes.Table (N).Field1 := Union_Id (Val);
5255 procedure Set_Elist2 (N : Node_Id; Val : Elist_Id) is
5257 Nodes.Table (N).Field2 := Union_Id (Val);
5260 procedure Set_Elist3 (N : Node_Id; Val : Elist_Id) is
5262 Nodes.Table (N).Field3 := Union_Id (Val);
5265 procedure Set_Elist4 (N : Node_Id; Val : Elist_Id) is
5267 Nodes.Table (N).Field4 := Union_Id (Val);
5270 procedure Set_Elist8 (N : Node_Id; Val : Elist_Id) is
5272 pragma Assert (Nkind (N) in N_Entity);
5273 Nodes.Table (N + 1).Field8 := Union_Id (Val);
5276 procedure Set_Elist13 (N : Node_Id; Val : Elist_Id) is
5278 pragma Assert (Nkind (N) in N_Entity);
5279 Nodes.Table (N + 2).Field6 := Union_Id (Val);
5282 procedure Set_Elist15 (N : Node_Id; Val : Elist_Id) is
5284 pragma Assert (Nkind (N) in N_Entity);
5285 Nodes.Table (N + 2).Field8 := Union_Id (Val);
5288 procedure Set_Elist16 (N : Node_Id; Val : Elist_Id) is
5290 pragma Assert (Nkind (N) in N_Entity);
5291 Nodes.Table (N + 2).Field9 := Union_Id (Val);
5294 procedure Set_Elist18 (N : Node_Id; Val : Elist_Id) is
5296 pragma Assert (Nkind (N) in N_Entity);
5297 Nodes.Table (N + 2).Field11 := Union_Id (Val);
5300 procedure Set_Elist21 (N : Node_Id; Val : Elist_Id) is
5302 pragma Assert (Nkind (N) in N_Entity);
5303 Nodes.Table (N + 3).Field8 := Union_Id (Val);
5306 procedure Set_Elist23 (N : Node_Id; Val : Elist_Id) is
5308 pragma Assert (Nkind (N) in N_Entity);
5309 Nodes.Table (N + 3).Field10 := Union_Id (Val);
5312 procedure Set_Elist25 (N : Node_Id; Val : Elist_Id) is
5314 pragma Assert (Nkind (N) in N_Entity);
5315 Nodes.Table (N + 4).Field7 := Union_Id (Val);
5318 procedure Set_Name1 (N : Node_Id; Val : Name_Id) is
5320 pragma Assert (N <= Nodes.Last);
5321 Nodes.Table (N).Field1 := Union_Id (Val);
5324 procedure Set_Name2 (N : Node_Id; Val : Name_Id) is
5326 pragma Assert (N <= Nodes.Last);
5327 Nodes.Table (N).Field2 := Union_Id (Val);
5330 procedure Set_Str3 (N : Node_Id; Val : String_Id) is
5332 pragma Assert (N <= Nodes.Last);
5333 Nodes.Table (N).Field3 := Union_Id (Val);
5336 procedure Set_Uint2 (N : Node_Id; Val : Uint) is
5338 pragma Assert (N <= Nodes.Last);
5339 Nodes.Table (N).Field2 := To_Union (Val);
5342 procedure Set_Uint3 (N : Node_Id; Val : Uint) is
5344 pragma Assert (N <= Nodes.Last);
5345 Nodes.Table (N).Field3 := To_Union (Val);
5348 procedure Set_Uint4 (N : Node_Id; Val : Uint) is
5350 pragma Assert (N <= Nodes.Last);
5351 Nodes.Table (N).Field4 := To_Union (Val);
5354 procedure Set_Uint5 (N : Node_Id; Val : Uint) is
5356 pragma Assert (N <= Nodes.Last);
5357 Nodes.Table (N).Field5 := To_Union (Val);
5360 procedure Set_Uint8 (N : Node_Id; Val : Uint) is
5362 pragma Assert (Nkind (N) in N_Entity);
5363 Nodes.Table (N + 1).Field8 := To_Union (Val);
5366 procedure Set_Uint9 (N : Node_Id; Val : Uint) is
5368 pragma Assert (Nkind (N) in N_Entity);
5369 Nodes.Table (N + 1).Field9 := To_Union (Val);
5372 procedure Set_Uint10 (N : Node_Id; Val : Uint) is
5374 pragma Assert (Nkind (N) in N_Entity);
5375 Nodes.Table (N + 1).Field10 := To_Union (Val);
5378 procedure Set_Uint11 (N : Node_Id; Val : Uint) is
5380 pragma Assert (Nkind (N) in N_Entity);
5381 Nodes.Table (N + 1).Field11 := To_Union (Val);
5384 procedure Set_Uint12 (N : Node_Id; Val : Uint) is
5386 pragma Assert (Nkind (N) in N_Entity);
5387 Nodes.Table (N + 1).Field12 := To_Union (Val);
5390 procedure Set_Uint13 (N : Node_Id; Val : Uint) is
5392 pragma Assert (Nkind (N) in N_Entity);
5393 Nodes.Table (N + 2).Field6 := To_Union (Val);
5396 procedure Set_Uint14 (N : Node_Id; Val : Uint) is
5398 pragma Assert (Nkind (N) in N_Entity);
5399 Nodes.Table (N + 2).Field7 := To_Union (Val);
5402 procedure Set_Uint15 (N : Node_Id; Val : Uint) is
5404 pragma Assert (Nkind (N) in N_Entity);
5405 Nodes.Table (N + 2).Field8 := To_Union (Val);
5408 procedure Set_Uint16 (N : Node_Id; Val : Uint) is
5410 pragma Assert (Nkind (N) in N_Entity);
5411 Nodes.Table (N + 2).Field9 := To_Union (Val);
5414 procedure Set_Uint17 (N : Node_Id; Val : Uint) is
5416 pragma Assert (Nkind (N) in N_Entity);
5417 Nodes.Table (N + 2).Field10 := To_Union (Val);
5420 procedure Set_Uint22 (N : Node_Id; Val : Uint) is
5422 pragma Assert (Nkind (N) in N_Entity);
5423 Nodes.Table (N + 3).Field9 := To_Union (Val);
5426 procedure Set_Ureal3 (N : Node_Id; Val : Ureal) is
5428 pragma Assert (N <= Nodes.Last);
5429 Nodes.Table (N).Field3 := To_Union (Val);
5432 procedure Set_Ureal18 (N : Node_Id; Val : Ureal) is
5434 pragma Assert (Nkind (N) in N_Entity);
5435 Nodes.Table (N + 2).Field11 := To_Union (Val);
5438 procedure Set_Ureal21 (N : Node_Id; Val : Ureal) is
5440 pragma Assert (Nkind (N) in N_Entity);
5441 Nodes.Table (N + 3).Field8 := To_Union (Val);
5444 procedure Set_Flag4 (N : Node_Id; Val : Boolean) is
5446 pragma Assert (N <= Nodes.Last);
5447 Nodes.Table (N).Flag4 := Val;
5450 procedure Set_Flag5 (N : Node_Id; Val : Boolean) is
5452 pragma Assert (N <= Nodes.Last);
5453 Nodes.Table (N).Flag5 := Val;
5456 procedure Set_Flag6 (N : Node_Id; Val : Boolean) is
5458 pragma Assert (N <= Nodes.Last);
5459 Nodes.Table (N).Flag6 := Val;
5462 procedure Set_Flag7 (N : Node_Id; Val : Boolean) is
5464 pragma Assert (N <= Nodes.Last);
5465 Nodes.Table (N).Flag7 := Val;
5468 procedure Set_Flag8 (N : Node_Id; Val : Boolean) is
5470 pragma Assert (N <= Nodes.Last);
5471 Nodes.Table (N).Flag8 := Val;
5474 procedure Set_Flag9 (N : Node_Id; Val : Boolean) is
5476 pragma Assert (N <= Nodes.Last);
5477 Nodes.Table (N).Flag9 := Val;
5480 procedure Set_Flag10 (N : Node_Id; Val : Boolean) is
5482 pragma Assert (N <= Nodes.Last);
5483 Nodes.Table (N).Flag10 := Val;
5486 procedure Set_Flag11 (N : Node_Id; Val : Boolean) is
5488 pragma Assert (N <= Nodes.Last);
5489 Nodes.Table (N).Flag11 := Val;
5492 procedure Set_Flag12 (N : Node_Id; Val : Boolean) is
5494 pragma Assert (N <= Nodes.Last);
5495 Nodes.Table (N).Flag12 := Val;
5498 procedure Set_Flag13 (N : Node_Id; Val : Boolean) is
5500 pragma Assert (N <= Nodes.Last);
5501 Nodes.Table (N).Flag13 := Val;
5504 procedure Set_Flag14 (N : Node_Id; Val : Boolean) is
5506 pragma Assert (N <= Nodes.Last);
5507 Nodes.Table (N).Flag14 := Val;
5510 procedure Set_Flag15 (N : Node_Id; Val : Boolean) is
5512 pragma Assert (N <= Nodes.Last);
5513 Nodes.Table (N).Flag15 := Val;
5516 procedure Set_Flag16 (N : Node_Id; Val : Boolean) is
5518 pragma Assert (N <= Nodes.Last);
5519 Nodes.Table (N).Flag16 := Val;
5522 procedure Set_Flag17 (N : Node_Id; Val : Boolean) is
5524 pragma Assert (N <= Nodes.Last);
5525 Nodes.Table (N).Flag17 := Val;
5528 procedure Set_Flag18 (N : Node_Id; Val : Boolean) is
5530 pragma Assert (N <= Nodes.Last);
5531 Nodes.Table (N).Flag18 := Val;
5534 procedure Set_Flag19 (N : Node_Id; Val : Boolean) is
5536 pragma Assert (Nkind (N) in N_Entity);
5537 Nodes.Table (N + 1).In_List := Val;
5540 procedure Set_Flag20 (N : Node_Id; Val : Boolean) is
5542 pragma Assert (Nkind (N) in N_Entity);
5543 Nodes.Table (N + 1).Unused_1 := Val;
5546 procedure Set_Flag21 (N : Node_Id; Val : Boolean) is
5548 pragma Assert (Nkind (N) in N_Entity);
5549 Nodes.Table (N + 1).Rewrite_Ins := Val;
5552 procedure Set_Flag22 (N : Node_Id; Val : Boolean) is
5554 pragma Assert (Nkind (N) in N_Entity);
5555 Nodes.Table (N + 1).Analyzed := Val;
5558 procedure Set_Flag23 (N : Node_Id; Val : Boolean) is
5560 pragma Assert (Nkind (N) in N_Entity);
5561 Nodes.Table (N + 1).Comes_From_Source := Val;
5564 procedure Set_Flag24 (N : Node_Id; Val : Boolean) is
5566 pragma Assert (Nkind (N) in N_Entity);
5567 Nodes.Table (N + 1).Error_Posted := Val;
5570 procedure Set_Flag25 (N : Node_Id; Val : Boolean) is
5572 pragma Assert (Nkind (N) in N_Entity);
5573 Nodes.Table (N + 1).Flag4 := Val;
5576 procedure Set_Flag26 (N : Node_Id; Val : Boolean) is
5578 pragma Assert (Nkind (N) in N_Entity);
5579 Nodes.Table (N + 1).Flag5 := Val;
5582 procedure Set_Flag27 (N : Node_Id; Val : Boolean) is
5584 pragma Assert (Nkind (N) in N_Entity);
5585 Nodes.Table (N + 1).Flag6 := Val;
5588 procedure Set_Flag28 (N : Node_Id; Val : Boolean) is
5590 pragma Assert (Nkind (N) in N_Entity);
5591 Nodes.Table (N + 1).Flag7 := Val;
5594 procedure Set_Flag29 (N : Node_Id; Val : Boolean) is
5596 pragma Assert (Nkind (N) in N_Entity);
5597 Nodes.Table (N + 1).Flag8 := Val;
5600 procedure Set_Flag30 (N : Node_Id; Val : Boolean) is
5602 pragma Assert (Nkind (N) in N_Entity);
5603 Nodes.Table (N + 1).Flag9 := Val;
5606 procedure Set_Flag31 (N : Node_Id; Val : Boolean) is
5608 pragma Assert (Nkind (N) in N_Entity);
5609 Nodes.Table (N + 1).Flag10 := Val;
5612 procedure Set_Flag32 (N : Node_Id; Val : Boolean) is
5614 pragma Assert (Nkind (N) in N_Entity);
5615 Nodes.Table (N + 1).Flag11 := Val;
5618 procedure Set_Flag33 (N : Node_Id; Val : Boolean) is
5620 pragma Assert (Nkind (N) in N_Entity);
5621 Nodes.Table (N + 1).Flag12 := Val;
5624 procedure Set_Flag34 (N : Node_Id; Val : Boolean) is
5626 pragma Assert (Nkind (N) in N_Entity);
5627 Nodes.Table (N + 1).Flag13 := Val;
5630 procedure Set_Flag35 (N : Node_Id; Val : Boolean) is
5632 pragma Assert (Nkind (N) in N_Entity);
5633 Nodes.Table (N + 1).Flag14 := Val;
5636 procedure Set_Flag36 (N : Node_Id; Val : Boolean) is
5638 pragma Assert (Nkind (N) in N_Entity);
5639 Nodes.Table (N + 1).Flag15 := Val;
5642 procedure Set_Flag37 (N : Node_Id; Val : Boolean) is
5644 pragma Assert (Nkind (N) in N_Entity);
5645 Nodes.Table (N + 1).Flag16 := Val;
5648 procedure Set_Flag38 (N : Node_Id; Val : Boolean) is
5650 pragma Assert (Nkind (N) in N_Entity);
5651 Nodes.Table (N + 1).Flag17 := Val;
5654 procedure Set_Flag39 (N : Node_Id; Val : Boolean) is
5656 pragma Assert (Nkind (N) in N_Entity);
5657 Nodes.Table (N + 1).Flag18 := Val;
5660 procedure Set_Flag40 (N : Node_Id; Val : Boolean) is
5662 pragma Assert (Nkind (N) in N_Entity);
5663 Nodes.Table (N + 2).In_List := Val;
5666 procedure Set_Flag41 (N : Node_Id; Val : Boolean) is
5668 pragma Assert (Nkind (N) in N_Entity);
5669 Nodes.Table (N + 2).Unused_1 := Val;
5672 procedure Set_Flag42 (N : Node_Id; Val : Boolean) is
5674 pragma Assert (Nkind (N) in N_Entity);
5675 Nodes.Table (N + 2).Rewrite_Ins := Val;
5678 procedure Set_Flag43 (N : Node_Id; Val : Boolean) is
5680 pragma Assert (Nkind (N) in N_Entity);
5681 Nodes.Table (N + 2).Analyzed := Val;
5684 procedure Set_Flag44 (N : Node_Id; Val : Boolean) is
5686 pragma Assert (Nkind (N) in N_Entity);
5687 Nodes.Table (N + 2).Comes_From_Source := Val;
5690 procedure Set_Flag45 (N : Node_Id; Val : Boolean) is
5692 pragma Assert (Nkind (N) in N_Entity);
5693 Nodes.Table (N + 2).Error_Posted := Val;
5696 procedure Set_Flag46 (N : Node_Id; Val : Boolean) is
5698 pragma Assert (Nkind (N) in N_Entity);
5699 Nodes.Table (N + 2).Flag4 := Val;
5702 procedure Set_Flag47 (N : Node_Id; Val : Boolean) is
5704 pragma Assert (Nkind (N) in N_Entity);
5705 Nodes.Table (N + 2).Flag5 := Val;
5708 procedure Set_Flag48 (N : Node_Id; Val : Boolean) is
5710 pragma Assert (Nkind (N) in N_Entity);
5711 Nodes.Table (N + 2).Flag6 := Val;
5714 procedure Set_Flag49 (N : Node_Id; Val : Boolean) is
5716 pragma Assert (Nkind (N) in N_Entity);
5717 Nodes.Table (N + 2).Flag7 := Val;
5720 procedure Set_Flag50 (N : Node_Id; Val : Boolean) is
5722 pragma Assert (Nkind (N) in N_Entity);
5723 Nodes.Table (N + 2).Flag8 := Val;
5726 procedure Set_Flag51 (N : Node_Id; Val : Boolean) is
5728 pragma Assert (Nkind (N) in N_Entity);
5729 Nodes.Table (N + 2).Flag9 := Val;
5732 procedure Set_Flag52 (N : Node_Id; Val : Boolean) is
5734 pragma Assert (Nkind (N) in N_Entity);
5735 Nodes.Table (N + 2).Flag10 := Val;
5738 procedure Set_Flag53 (N : Node_Id; Val : Boolean) is
5740 pragma Assert (Nkind (N) in N_Entity);
5741 Nodes.Table (N + 2).Flag11 := Val;
5744 procedure Set_Flag54 (N : Node_Id; Val : Boolean) is
5746 pragma Assert (Nkind (N) in N_Entity);
5747 Nodes.Table (N + 2).Flag12 := Val;
5750 procedure Set_Flag55 (N : Node_Id; Val : Boolean) is
5752 pragma Assert (Nkind (N) in N_Entity);
5753 Nodes.Table (N + 2).Flag13 := Val;
5756 procedure Set_Flag56 (N : Node_Id; Val : Boolean) is
5758 pragma Assert (Nkind (N) in N_Entity);
5759 Nodes.Table (N + 2).Flag14 := Val;
5762 procedure Set_Flag57 (N : Node_Id; Val : Boolean) is
5764 pragma Assert (Nkind (N) in N_Entity);
5765 Nodes.Table (N + 2).Flag15 := Val;
5768 procedure Set_Flag58 (N : Node_Id; Val : Boolean) is
5770 pragma Assert (Nkind (N) in N_Entity);
5771 Nodes.Table (N + 2).Flag16 := Val;
5774 procedure Set_Flag59 (N : Node_Id; Val : Boolean) is
5776 pragma Assert (Nkind (N) in N_Entity);
5777 Nodes.Table (N + 2).Flag17 := Val;
5780 procedure Set_Flag60 (N : Node_Id; Val : Boolean) is
5782 pragma Assert (Nkind (N) in N_Entity);
5783 Nodes.Table (N + 2).Flag18 := Val;
5786 procedure Set_Flag61 (N : Node_Id; Val : Boolean) is
5788 pragma Assert (Nkind (N) in N_Entity);
5789 Nodes.Table (N + 1).Pflag1 := Val;
5792 procedure Set_Flag62 (N : Node_Id; Val : Boolean) is
5794 pragma Assert (Nkind (N) in N_Entity);
5795 Nodes.Table (N + 1).Pflag2 := Val;
5798 procedure Set_Flag63 (N : Node_Id; Val : Boolean) is
5800 pragma Assert (Nkind (N) in N_Entity);
5801 Nodes.Table (N + 2).Pflag1 := Val;
5804 procedure Set_Flag64 (N : Node_Id; Val : Boolean) is
5806 pragma Assert (Nkind (N) in N_Entity);
5807 Nodes.Table (N + 2).Pflag2 := Val;
5810 procedure Set_Flag65 (N : Node_Id; Val : Boolean) is
5812 pragma Assert (Nkind (N) in N_Entity);
5815 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag65 := Val;
5818 procedure Set_Flag66 (N : Node_Id; Val : Boolean) is
5820 pragma Assert (Nkind (N) in N_Entity);
5823 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag66 := Val;
5826 procedure Set_Flag67 (N : Node_Id; Val : Boolean) is
5828 pragma Assert (Nkind (N) in N_Entity);
5831 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag67 := Val;
5834 procedure Set_Flag68 (N : Node_Id; Val : Boolean) is
5836 pragma Assert (Nkind (N) in N_Entity);
5839 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag68 := Val;
5842 procedure Set_Flag69 (N : Node_Id; Val : Boolean) is
5844 pragma Assert (Nkind (N) in N_Entity);
5847 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag69 := Val;
5850 procedure Set_Flag70 (N : Node_Id; Val : Boolean) is
5852 pragma Assert (Nkind (N) in N_Entity);
5855 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag70 := Val;
5858 procedure Set_Flag71 (N : Node_Id; Val : Boolean) is
5860 pragma Assert (Nkind (N) in N_Entity);
5863 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag71 := Val;
5866 procedure Set_Flag72 (N : Node_Id; Val : Boolean) is
5868 pragma Assert (Nkind (N) in N_Entity);
5871 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag72 := Val;
5874 procedure Set_Flag73 (N : Node_Id; Val : Boolean) is
5876 pragma Assert (Nkind (N) in N_Entity);
5879 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag73 := Val;
5882 procedure Set_Flag74 (N : Node_Id; Val : Boolean) is
5884 pragma Assert (Nkind (N) in N_Entity);
5887 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag74 := Val;
5890 procedure Set_Flag75 (N : Node_Id; Val : Boolean) is
5892 pragma Assert (Nkind (N) in N_Entity);
5895 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag75 := Val;
5898 procedure Set_Flag76 (N : Node_Id; Val : Boolean) is
5900 pragma Assert (Nkind (N) in N_Entity);
5903 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag76 := Val;
5906 procedure Set_Flag77 (N : Node_Id; Val : Boolean) is
5908 pragma Assert (Nkind (N) in N_Entity);
5911 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag77 := Val;
5914 procedure Set_Flag78 (N : Node_Id; Val : Boolean) is
5916 pragma Assert (Nkind (N) in N_Entity);
5919 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag78 := Val;
5922 procedure Set_Flag79 (N : Node_Id; Val : Boolean) is
5924 pragma Assert (Nkind (N) in N_Entity);
5927 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag79 := Val;
5930 procedure Set_Flag80 (N : Node_Id; Val : Boolean) is
5932 pragma Assert (Nkind (N) in N_Entity);
5935 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag80 := Val;
5938 procedure Set_Flag81 (N : Node_Id; Val : Boolean) is
5940 pragma Assert (Nkind (N) in N_Entity);
5943 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag81 := Val;
5946 procedure Set_Flag82 (N : Node_Id; Val : Boolean) is
5948 pragma Assert (Nkind (N) in N_Entity);
5951 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag82 := Val;
5954 procedure Set_Flag83 (N : Node_Id; Val : Boolean) is
5956 pragma Assert (Nkind (N) in N_Entity);
5959 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag83 := Val;
5962 procedure Set_Flag84 (N : Node_Id; Val : Boolean) is
5964 pragma Assert (Nkind (N) in N_Entity);
5967 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag84 := Val;
5970 procedure Set_Flag85 (N : Node_Id; Val : Boolean) is
5972 pragma Assert (Nkind (N) in N_Entity);
5975 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag85 := Val;
5978 procedure Set_Flag86 (N : Node_Id; Val : Boolean) is
5980 pragma Assert (Nkind (N) in N_Entity);
5983 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag86 := Val;
5986 procedure Set_Flag87 (N : Node_Id; Val : Boolean) is
5988 pragma Assert (Nkind (N) in N_Entity);
5991 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag87 := Val;
5994 procedure Set_Flag88 (N : Node_Id; Val : Boolean) is
5996 pragma Assert (Nkind (N) in N_Entity);
5999 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag88 := Val;
6002 procedure Set_Flag89 (N : Node_Id; Val : Boolean) is
6004 pragma Assert (Nkind (N) in N_Entity);
6007 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag89 := Val;
6010 procedure Set_Flag90 (N : Node_Id; Val : Boolean) is
6012 pragma Assert (Nkind (N) in N_Entity);
6015 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag90 := Val;
6018 procedure Set_Flag91 (N : Node_Id; Val : Boolean) is
6020 pragma Assert (Nkind (N) in N_Entity);
6023 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag91 := Val;
6026 procedure Set_Flag92 (N : Node_Id; Val : Boolean) is
6028 pragma Assert (Nkind (N) in N_Entity);
6031 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag92 := Val;
6034 procedure Set_Flag93 (N : Node_Id; Val : Boolean) is
6036 pragma Assert (Nkind (N) in N_Entity);
6039 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag93 := Val;
6042 procedure Set_Flag94 (N : Node_Id; Val : Boolean) is
6044 pragma Assert (Nkind (N) in N_Entity);
6047 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag94 := Val;
6050 procedure Set_Flag95 (N : Node_Id; Val : Boolean) is
6052 pragma Assert (Nkind (N) in N_Entity);
6055 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag95 := Val;
6058 procedure Set_Flag96 (N : Node_Id; Val : Boolean) is
6060 pragma Assert (Nkind (N) in N_Entity);
6063 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag96 := Val;
6066 procedure Set_Flag97 (N : Node_Id; Val : Boolean) is
6068 pragma Assert (Nkind (N) in N_Entity);
6071 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag97 := Val;
6074 procedure Set_Flag98 (N : Node_Id; Val : Boolean) is
6076 pragma Assert (Nkind (N) in N_Entity);
6079 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag98 := Val;
6082 procedure Set_Flag99 (N : Node_Id; Val : Boolean) is
6084 pragma Assert (Nkind (N) in N_Entity);
6087 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag99 := Val;
6090 procedure Set_Flag100 (N : Node_Id; Val : Boolean) is
6092 pragma Assert (Nkind (N) in N_Entity);
6095 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag100 := Val;
6098 procedure Set_Flag101 (N : Node_Id; Val : Boolean) is
6100 pragma Assert (Nkind (N) in N_Entity);
6103 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag101 := Val;
6106 procedure Set_Flag102 (N : Node_Id; Val : Boolean) is
6108 pragma Assert (Nkind (N) in N_Entity);
6111 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag102 := Val;
6114 procedure Set_Flag103 (N : Node_Id; Val : Boolean) is
6116 pragma Assert (Nkind (N) in N_Entity);
6119 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag103 := Val;
6122 procedure Set_Flag104 (N : Node_Id; Val : Boolean) is
6124 pragma Assert (Nkind (N) in N_Entity);
6127 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag104 := Val;
6130 procedure Set_Flag105 (N : Node_Id; Val : Boolean) is
6132 pragma Assert (Nkind (N) in N_Entity);
6135 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag105 := Val;
6138 procedure Set_Flag106 (N : Node_Id; Val : Boolean) is
6140 pragma Assert (Nkind (N) in N_Entity);
6143 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag106 := Val;
6146 procedure Set_Flag107 (N : Node_Id; Val : Boolean) is
6148 pragma Assert (Nkind (N) in N_Entity);
6151 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag107 := Val;
6154 procedure Set_Flag108 (N : Node_Id; Val : Boolean) is
6156 pragma Assert (Nkind (N) in N_Entity);
6159 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag108 := Val;
6162 procedure Set_Flag109 (N : Node_Id; Val : Boolean) is
6164 pragma Assert (Nkind (N) in N_Entity);
6167 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag109 := Val;
6170 procedure Set_Flag110 (N : Node_Id; Val : Boolean) is
6172 pragma Assert (Nkind (N) in N_Entity);
6175 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag110 := Val;
6178 procedure Set_Flag111 (N : Node_Id; Val : Boolean) is
6180 pragma Assert (Nkind (N) in N_Entity);
6183 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag111 := Val;
6186 procedure Set_Flag112 (N : Node_Id; Val : Boolean) is
6188 pragma Assert (Nkind (N) in N_Entity);
6191 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag112 := Val;
6194 procedure Set_Flag113 (N : Node_Id; Val : Boolean) is
6196 pragma Assert (Nkind (N) in N_Entity);
6199 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag113 := Val;
6202 procedure Set_Flag114 (N : Node_Id; Val : Boolean) is
6204 pragma Assert (Nkind (N) in N_Entity);
6207 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag114 := Val;
6210 procedure Set_Flag115 (N : Node_Id; Val : Boolean) is
6212 pragma Assert (Nkind (N) in N_Entity);
6215 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag115 := Val;
6218 procedure Set_Flag116 (N : Node_Id; Val : Boolean) is
6220 pragma Assert (Nkind (N) in N_Entity);
6223 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag116 := Val;
6226 procedure Set_Flag117 (N : Node_Id; Val : Boolean) is
6228 pragma Assert (Nkind (N) in N_Entity);
6231 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag117 := Val;
6234 procedure Set_Flag118 (N : Node_Id; Val : Boolean) is
6236 pragma Assert (Nkind (N) in N_Entity);
6239 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag118 := Val;
6242 procedure Set_Flag119 (N : Node_Id; Val : Boolean) is
6244 pragma Assert (Nkind (N) in N_Entity);
6247 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag119 := Val;
6250 procedure Set_Flag120 (N : Node_Id; Val : Boolean) is
6252 pragma Assert (Nkind (N) in N_Entity);
6255 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag120 := Val;
6258 procedure Set_Flag121 (N : Node_Id; Val : Boolean) is
6260 pragma Assert (Nkind (N) in N_Entity);
6263 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag121 := Val;
6266 procedure Set_Flag122 (N : Node_Id; Val : Boolean) is
6268 pragma Assert (Nkind (N) in N_Entity);
6271 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag122 := Val;
6274 procedure Set_Flag123 (N : Node_Id; Val : Boolean) is
6276 pragma Assert (Nkind (N) in N_Entity);
6279 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag123 := Val;
6282 procedure Set_Flag124 (N : Node_Id; Val : Boolean) is
6284 pragma Assert (Nkind (N) in N_Entity);
6287 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag124 := Val;
6290 procedure Set_Flag125 (N : Node_Id; Val : Boolean) is
6292 pragma Assert (Nkind (N) in N_Entity);
6295 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag125 := Val;
6298 procedure Set_Flag126 (N : Node_Id; Val : Boolean) is
6300 pragma Assert (Nkind (N) in N_Entity);
6303 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag126 := Val;
6306 procedure Set_Flag127 (N : Node_Id; Val : Boolean) is
6308 pragma Assert (Nkind (N) in N_Entity);
6311 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag127 := Val;
6314 procedure Set_Flag128 (N : Node_Id; Val : Boolean) is
6316 pragma Assert (Nkind (N) in N_Entity);
6319 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag128 := Val;
6322 procedure Set_Flag129 (N : Node_Id; Val : Boolean) is
6324 pragma Assert (Nkind (N) in N_Entity);
6325 Nodes.Table (N + 3).In_List := Val;
6328 procedure Set_Flag130 (N : Node_Id; Val : Boolean) is
6330 pragma Assert (Nkind (N) in N_Entity);
6331 Nodes.Table (N + 3).Unused_1 := Val;
6334 procedure Set_Flag131 (N : Node_Id; Val : Boolean) is
6336 pragma Assert (Nkind (N) in N_Entity);
6337 Nodes.Table (N + 3).Rewrite_Ins := Val;
6340 procedure Set_Flag132 (N : Node_Id; Val : Boolean) is
6342 pragma Assert (Nkind (N) in N_Entity);
6343 Nodes.Table (N + 3).Analyzed := Val;
6346 procedure Set_Flag133 (N : Node_Id; Val : Boolean) is
6348 pragma Assert (Nkind (N) in N_Entity);
6349 Nodes.Table (N + 3).Comes_From_Source := Val;
6352 procedure Set_Flag134 (N : Node_Id; Val : Boolean) is
6354 pragma Assert (Nkind (N) in N_Entity);
6355 Nodes.Table (N + 3).Error_Posted := Val;
6358 procedure Set_Flag135 (N : Node_Id; Val : Boolean) is
6360 pragma Assert (Nkind (N) in N_Entity);
6361 Nodes.Table (N + 3).Flag4 := Val;
6364 procedure Set_Flag136 (N : Node_Id; Val : Boolean) is
6366 pragma Assert (Nkind (N) in N_Entity);
6367 Nodes.Table (N + 3).Flag5 := Val;
6370 procedure Set_Flag137 (N : Node_Id; Val : Boolean) is
6372 pragma Assert (Nkind (N) in N_Entity);
6373 Nodes.Table (N + 3).Flag6 := Val;
6376 procedure Set_Flag138 (N : Node_Id; Val : Boolean) is
6378 pragma Assert (Nkind (N) in N_Entity);
6379 Nodes.Table (N + 3).Flag7 := Val;
6382 procedure Set_Flag139 (N : Node_Id; Val : Boolean) is
6384 pragma Assert (Nkind (N) in N_Entity);
6385 Nodes.Table (N + 3).Flag8 := Val;
6388 procedure Set_Flag140 (N : Node_Id; Val : Boolean) is
6390 pragma Assert (Nkind (N) in N_Entity);
6391 Nodes.Table (N + 3).Flag9 := Val;
6394 procedure Set_Flag141 (N : Node_Id; Val : Boolean) is
6396 pragma Assert (Nkind (N) in N_Entity);
6397 Nodes.Table (N + 3).Flag10 := Val;
6400 procedure Set_Flag142 (N : Node_Id; Val : Boolean) is
6402 pragma Assert (Nkind (N) in N_Entity);
6403 Nodes.Table (N + 3).Flag11 := Val;
6406 procedure Set_Flag143 (N : Node_Id; Val : Boolean) is
6408 pragma Assert (Nkind (N) in N_Entity);
6409 Nodes.Table (N + 3).Flag12 := Val;
6412 procedure Set_Flag144 (N : Node_Id; Val : Boolean) is
6414 pragma Assert (Nkind (N) in N_Entity);
6415 Nodes.Table (N + 3).Flag13 := Val;
6418 procedure Set_Flag145 (N : Node_Id; Val : Boolean) is
6420 pragma Assert (Nkind (N) in N_Entity);
6421 Nodes.Table (N + 3).Flag14 := Val;
6424 procedure Set_Flag146 (N : Node_Id; Val : Boolean) is
6426 pragma Assert (Nkind (N) in N_Entity);
6427 Nodes.Table (N + 3).Flag15 := Val;
6430 procedure Set_Flag147 (N : Node_Id; Val : Boolean) is
6432 pragma Assert (Nkind (N) in N_Entity);
6433 Nodes.Table (N + 3).Flag16 := Val;
6436 procedure Set_Flag148 (N : Node_Id; Val : Boolean) is
6438 pragma Assert (Nkind (N) in N_Entity);
6439 Nodes.Table (N + 3).Flag17 := Val;
6442 procedure Set_Flag149 (N : Node_Id; Val : Boolean) is
6444 pragma Assert (Nkind (N) in N_Entity);
6445 Nodes.Table (N + 3).Flag18 := Val;
6448 procedure Set_Flag150 (N : Node_Id; Val : Boolean) is
6450 pragma Assert (Nkind (N) in N_Entity);
6451 Nodes.Table (N + 3).Pflag1 := Val;
6454 procedure Set_Flag151 (N : Node_Id; Val : Boolean) is
6456 pragma Assert (Nkind (N) in N_Entity);
6457 Nodes.Table (N + 3).Pflag2 := Val;
6460 procedure Set_Flag152 (N : Node_Id; Val : Boolean) is
6462 pragma Assert (Nkind (N) in N_Entity);
6465 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag152 := Val;
6468 procedure Set_Flag153 (N : Node_Id; Val : Boolean) is
6470 pragma Assert (Nkind (N) in N_Entity);
6473 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag153 := Val;
6476 procedure Set_Flag154 (N : Node_Id; Val : Boolean) is
6478 pragma Assert (Nkind (N) in N_Entity);
6481 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag154 := Val;
6484 procedure Set_Flag155 (N : Node_Id; Val : Boolean) is
6486 pragma Assert (Nkind (N) in N_Entity);
6489 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag155 := Val;
6492 procedure Set_Flag156 (N : Node_Id; Val : Boolean) is
6494 pragma Assert (Nkind (N) in N_Entity);
6497 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag156 := Val;
6500 procedure Set_Flag157 (N : Node_Id; Val : Boolean) is
6502 pragma Assert (Nkind (N) in N_Entity);
6505 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag157 := Val;
6508 procedure Set_Flag158 (N : Node_Id; Val : Boolean) is
6510 pragma Assert (Nkind (N) in N_Entity);
6513 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag158 := Val;
6516 procedure Set_Flag159 (N : Node_Id; Val : Boolean) is
6518 pragma Assert (Nkind (N) in N_Entity);
6521 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag159 := Val;
6524 procedure Set_Flag160 (N : Node_Id; Val : Boolean) is
6526 pragma Assert (Nkind (N) in N_Entity);
6529 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag160 := Val;
6532 procedure Set_Flag161 (N : Node_Id; Val : Boolean) is
6534 pragma Assert (Nkind (N) in N_Entity);
6537 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag161 := Val;
6540 procedure Set_Flag162 (N : Node_Id; Val : Boolean) is
6542 pragma Assert (Nkind (N) in N_Entity);
6545 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag162 := Val;
6548 procedure Set_Flag163 (N : Node_Id; Val : Boolean) is
6550 pragma Assert (Nkind (N) in N_Entity);
6553 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag163 := Val;
6556 procedure Set_Flag164 (N : Node_Id; Val : Boolean) is
6558 pragma Assert (Nkind (N) in N_Entity);
6561 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag164 := Val;
6564 procedure Set_Flag165 (N : Node_Id; Val : Boolean) is
6566 pragma Assert (Nkind (N) in N_Entity);
6569 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag165 := Val;
6572 procedure Set_Flag166 (N : Node_Id; Val : Boolean) is
6574 pragma Assert (Nkind (N) in N_Entity);
6577 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag166 := Val;
6580 procedure Set_Flag167 (N : Node_Id; Val : Boolean) is
6582 pragma Assert (Nkind (N) in N_Entity);
6585 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag167 := Val;
6588 procedure Set_Flag168 (N : Node_Id; Val : Boolean) is
6590 pragma Assert (Nkind (N) in N_Entity);
6593 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag168 := Val;
6596 procedure Set_Flag169 (N : Node_Id; Val : Boolean) is
6598 pragma Assert (Nkind (N) in N_Entity);
6601 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag169 := Val;
6604 procedure Set_Flag170 (N : Node_Id; Val : Boolean) is
6606 pragma Assert (Nkind (N) in N_Entity);
6609 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag170 := Val;
6612 procedure Set_Flag171 (N : Node_Id; Val : Boolean) is
6614 pragma Assert (Nkind (N) in N_Entity);
6617 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag171 := Val;
6620 procedure Set_Flag172 (N : Node_Id; Val : Boolean) is
6622 pragma Assert (Nkind (N) in N_Entity);
6625 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag172 := Val;
6628 procedure Set_Flag173 (N : Node_Id; Val : Boolean) is
6630 pragma Assert (Nkind (N) in N_Entity);
6633 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag173 := Val;
6636 procedure Set_Flag174 (N : Node_Id; Val : Boolean) is
6638 pragma Assert (Nkind (N) in N_Entity);
6641 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag174 := Val;
6644 procedure Set_Flag175 (N : Node_Id; Val : Boolean) is
6646 pragma Assert (Nkind (N) in N_Entity);
6649 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag175 := Val;
6652 procedure Set_Flag176 (N : Node_Id; Val : Boolean) is
6654 pragma Assert (Nkind (N) in N_Entity);
6657 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag176 := Val;
6660 procedure Set_Flag177 (N : Node_Id; Val : Boolean) is
6662 pragma Assert (Nkind (N) in N_Entity);
6665 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag177 := Val;
6668 procedure Set_Flag178 (N : Node_Id; Val : Boolean) is
6670 pragma Assert (Nkind (N) in N_Entity);
6673 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag178 := Val;
6676 procedure Set_Flag179 (N : Node_Id; Val : Boolean) is
6678 pragma Assert (Nkind (N) in N_Entity);
6681 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag179 := Val;
6684 procedure Set_Flag180 (N : Node_Id; Val : Boolean) is
6686 pragma Assert (Nkind (N) in N_Entity);
6689 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag180 := Val;
6692 procedure Set_Flag181 (N : Node_Id; Val : Boolean) is
6694 pragma Assert (Nkind (N) in N_Entity);
6697 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag181 := Val;
6700 procedure Set_Flag182 (N : Node_Id; Val : Boolean) is
6702 pragma Assert (Nkind (N) in N_Entity);
6705 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag182 := Val;
6708 procedure Set_Flag183 (N : Node_Id; Val : Boolean) is
6710 pragma Assert (Nkind (N) in N_Entity);
6713 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag183 := Val;
6716 procedure Set_Flag184 (N : Node_Id; Val : Boolean) is
6718 pragma Assert (Nkind (N) in N_Entity);
6721 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag184 := Val;
6724 procedure Set_Flag185 (N : Node_Id; Val : Boolean) is
6726 pragma Assert (Nkind (N) in N_Entity);
6729 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag185 := Val;
6732 procedure Set_Flag186 (N : Node_Id; Val : Boolean) is
6734 pragma Assert (Nkind (N) in N_Entity);
6737 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag186 := Val;
6740 procedure Set_Flag187 (N : Node_Id; Val : Boolean) is
6742 pragma Assert (Nkind (N) in N_Entity);
6745 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag187 := Val;
6748 procedure Set_Flag188 (N : Node_Id; Val : Boolean) is
6750 pragma Assert (Nkind (N) in N_Entity);
6753 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag188 := Val;
6756 procedure Set_Flag189 (N : Node_Id; Val : Boolean) is
6758 pragma Assert (Nkind (N) in N_Entity);
6761 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag189 := Val;
6764 procedure Set_Flag190 (N : Node_Id; Val : Boolean) is
6766 pragma Assert (Nkind (N) in N_Entity);
6769 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag190 := Val;
6772 procedure Set_Flag191 (N : Node_Id; Val : Boolean) is
6774 pragma Assert (Nkind (N) in N_Entity);
6777 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag191 := Val;
6780 procedure Set_Flag192 (N : Node_Id; Val : Boolean) is
6782 pragma Assert (Nkind (N) in N_Entity);
6785 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag192 := Val;
6788 procedure Set_Flag193 (N : Node_Id; Val : Boolean) is
6790 pragma Assert (Nkind (N) in N_Entity);
6793 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag193 := Val;
6796 procedure Set_Flag194 (N : Node_Id; Val : Boolean) is
6798 pragma Assert (Nkind (N) in N_Entity);
6801 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag194 := Val;
6804 procedure Set_Flag195 (N : Node_Id; Val : Boolean) is
6806 pragma Assert (Nkind (N) in N_Entity);
6809 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag195 := Val;
6812 procedure Set_Flag196 (N : Node_Id; Val : Boolean) is
6814 pragma Assert (Nkind (N) in N_Entity);
6817 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag196 := Val;
6820 procedure Set_Flag197 (N : Node_Id; Val : Boolean) is
6822 pragma Assert (Nkind (N) in N_Entity);
6825 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag197 := Val;
6828 procedure Set_Flag198 (N : Node_Id; Val : Boolean) is
6830 pragma Assert (Nkind (N) in N_Entity);
6833 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag198 := Val;
6836 procedure Set_Flag199 (N : Node_Id; Val : Boolean) is
6838 pragma Assert (Nkind (N) in N_Entity);
6841 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag199 := Val;
6844 procedure Set_Flag200 (N : Node_Id; Val : Boolean) is
6846 pragma Assert (Nkind (N) in N_Entity);
6849 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag200 := Val;
6852 procedure Set_Flag201 (N : Node_Id; Val : Boolean) is
6854 pragma Assert (Nkind (N) in N_Entity);
6857 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag201 := Val;
6860 procedure Set_Flag202 (N : Node_Id; Val : Boolean) is
6862 pragma Assert (Nkind (N) in N_Entity);
6865 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag202 := Val;
6868 procedure Set_Flag203 (N : Node_Id; Val : Boolean) is
6870 pragma Assert (Nkind (N) in N_Entity);
6873 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag203 := Val;
6876 procedure Set_Flag204 (N : Node_Id; Val : Boolean) is
6878 pragma Assert (Nkind (N) in N_Entity);
6881 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag204 := Val;
6884 procedure Set_Flag205 (N : Node_Id; Val : Boolean) is
6886 pragma Assert (Nkind (N) in N_Entity);
6889 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag205 := Val;
6892 procedure Set_Flag206 (N : Node_Id; Val : Boolean) is
6894 pragma Assert (Nkind (N) in N_Entity);
6897 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag206 := Val;
6900 procedure Set_Flag207 (N : Node_Id; Val : Boolean) is
6902 pragma Assert (Nkind (N) in N_Entity);
6905 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag207 := Val;
6908 procedure Set_Flag208 (N : Node_Id; Val : Boolean) is
6910 pragma Assert (Nkind (N) in N_Entity);
6913 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag208 := Val;
6916 procedure Set_Flag209 (N : Node_Id; Val : Boolean) is
6918 pragma Assert (Nkind (N) in N_Entity);
6921 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag209 := Val;
6924 procedure Set_Flag210 (N : Node_Id; Val : Boolean) is
6926 pragma Assert (Nkind (N) in N_Entity);
6929 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag210 := Val;
6932 procedure Set_Flag211 (N : Node_Id; Val : Boolean) is
6934 pragma Assert (Nkind (N) in N_Entity);
6937 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag211 := Val;
6940 procedure Set_Flag212 (N : Node_Id; Val : Boolean) is
6942 pragma Assert (Nkind (N) in N_Entity);
6945 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag212 := Val;
6948 procedure Set_Flag213 (N : Node_Id; Val : Boolean) is
6950 pragma Assert (Nkind (N) in N_Entity);
6953 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag213 := Val;
6956 procedure Set_Flag214 (N : Node_Id; Val : Boolean) is
6958 pragma Assert (Nkind (N) in N_Entity);
6961 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag214 := Val;
6964 procedure Set_Flag215 (N : Node_Id; Val : Boolean) is
6966 pragma Assert (Nkind (N) in N_Entity);
6969 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag215 := Val;
6972 procedure Set_Flag216 (N : Node_Id; Val : Boolean) is
6974 pragma Assert (Nkind (N) in N_Entity);
6977 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag216 := Val;
6980 procedure Set_Flag217 (N : Node_Id; Val : Boolean) is
6982 pragma Assert (Nkind (N) in N_Entity);
6985 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag217 := Val;
6988 procedure Set_Flag218 (N : Node_Id; Val : Boolean) is
6990 pragma Assert (Nkind (N) in N_Entity);
6993 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag218 := Val;
6996 procedure Set_Flag219 (N : Node_Id; Val : Boolean) is
6998 pragma Assert (Nkind (N) in N_Entity);
7001 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag219 := Val;
7004 procedure Set_Flag220 (N : Node_Id; Val : Boolean) is
7006 pragma Assert (Nkind (N) in N_Entity);
7009 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag220 := Val;
7012 procedure Set_Flag221 (N : Node_Id; Val : Boolean) is
7014 pragma Assert (Nkind (N) in N_Entity);
7017 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag221 := Val;
7020 procedure Set_Flag222 (N : Node_Id; Val : Boolean) is
7022 pragma Assert (Nkind (N) in N_Entity);
7025 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag222 := Val;
7028 procedure Set_Flag223 (N : Node_Id; Val : Boolean) is
7030 pragma Assert (Nkind (N) in N_Entity);
7033 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag223 := Val;
7036 procedure Set_Flag224 (N : Node_Id; Val : Boolean) is
7038 pragma Assert (Nkind (N) in N_Entity);
7041 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag224 := Val;
7044 procedure Set_Flag225 (N : Node_Id; Val : Boolean) is
7046 pragma Assert (Nkind (N) in N_Entity);
7049 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag225 := Val;
7052 procedure Set_Flag226 (N : Node_Id; Val : Boolean) is
7054 pragma Assert (Nkind (N) in N_Entity);
7057 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag226 := Val;
7060 procedure Set_Flag227 (N : Node_Id; Val : Boolean) is
7062 pragma Assert (Nkind (N) in N_Entity);
7065 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag227 := Val;
7068 procedure Set_Flag228 (N : Node_Id; Val : Boolean) is
7070 pragma Assert (Nkind (N) in N_Entity);
7073 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag228 := Val;
7076 procedure Set_Flag229 (N : Node_Id; Val : Boolean) is
7078 pragma Assert (Nkind (N) in N_Entity);
7081 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag229 := Val;
7084 procedure Set_Flag230 (N : Node_Id; Val : Boolean) is
7086 pragma Assert (Nkind (N) in N_Entity);
7089 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag230 := Val;
7092 procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id) is
7094 pragma Assert (N <= Nodes.Last);
7097 Set_Parent (Val, N);
7101 end Set_Node1_With_Parent;
7103 procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id) is
7105 pragma Assert (N <= Nodes.Last);
7108 Set_Parent (Val, N);
7112 end Set_Node2_With_Parent;
7114 procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id) is
7116 pragma Assert (N <= Nodes.Last);
7119 Set_Parent (Val, N);
7123 end Set_Node3_With_Parent;
7125 procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id) is
7127 pragma Assert (N <= Nodes.Last);
7130 Set_Parent (Val, N);
7134 end Set_Node4_With_Parent;
7136 procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id) is
7138 pragma Assert (N <= Nodes.Last);
7141 Set_Parent (Val, N);
7145 end Set_Node5_With_Parent;
7147 procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id) is
7149 pragma Assert (N <= Nodes.Last);
7150 if Val /= No_List and then Val /= Error_List then
7151 Set_Parent (Val, N);
7154 end Set_List1_With_Parent;
7156 procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id) is
7158 pragma Assert (N <= Nodes.Last);
7159 if Val /= No_List and then Val /= Error_List then
7160 Set_Parent (Val, N);
7163 end Set_List2_With_Parent;
7165 procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id) is
7167 pragma Assert (N <= Nodes.Last);
7168 if Val /= No_List and then Val /= Error_List then
7169 Set_Parent (Val, N);
7172 end Set_List3_With_Parent;
7174 procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id) is
7176 pragma Assert (N <= Nodes.Last);
7177 if Val /= No_List and then Val /= Error_List then
7178 Set_Parent (Val, N);
7181 end Set_List4_With_Parent;
7183 procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id) is
7185 pragma Assert (N <= Nodes.Last);
7186 if Val /= No_List and then Val /= Error_List then
7187 Set_Parent (Val, N);
7190 end Set_List5_With_Parent;
7192 end Unchecked_Access;
7200 Nodes.Locked := False;
7201 Orig_Nodes.Locked := False;