1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2010, 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 3, 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. --
18 -- As a special exception under Section 7 of GPL version 3, you are granted --
19 -- additional permissions described in the GCC Runtime Library Exception, --
20 -- version 3.1, as published by the Free Software Foundation. --
22 -- You should have received a copy of the GNU General Public License and --
23 -- a copy of the GCC Runtime Library Exception along with this program; --
24 -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
25 -- <http://www.gnu.org/licenses/>. --
27 -- GNAT was originally developed by the GNAT team at New York University. --
28 -- Extensive contributions were provided by Ada Core Technologies Inc. --
30 ------------------------------------------------------------------------------
32 pragma Style_Checks (All_Checks);
33 -- Turn off subprogram ordering check for this package
35 -- WARNING: There is a C version of this package. Any changes to this source
36 -- file must be properly reflected in the file atree.h which is a C header
37 -- file containing equivalent definitions for use by gigi.
39 with Aspects; use Aspects;
40 with Debug; use Debug;
41 with Nlists; use Nlists;
42 with Output; use Output;
43 with Sinput; use Sinput;
44 with Tree_IO; use Tree_IO;
48 Reporting_Proc : Report_Proc := null;
49 -- Record argument to last call to Set_Reporting_Proc
55 -- Suppose you find that node 12345 is messed up. You might want to find
56 -- the code that created that node. There are two ways to do this:
58 -- One way is to set a conditional breakpoint on New_Node_Debugging_Output
60 -- break nnd if n = 12345
61 -- and run gnat1 again from the beginning.
63 -- The other way is to set a breakpoint near the beginning (e.g. on
64 -- gnat1drv), and run. Then set Watch_Node (nickname "ww") to 12345 in gdb:
66 -- and set a breakpoint on New_Node_Breakpoint (nickname "nn"). Continue.
68 -- Either way, gnat1 will stop when node 12345 is created
70 -- The second method is much faster
72 -- Similarly, rr and rrd allow breaking on rewriting of a given node
74 ww : Node_Id'Base := Node_Id'First - 1;
75 pragma Export (Ada, ww); -- trick the optimizer
76 Watch_Node : Node_Id'Base renames ww;
77 -- Node to "watch"; that is, whenever a node is created, we check if it
78 -- is equal to Watch_Node, and if so, call New_Node_Breakpoint. You have
79 -- presumably set a breakpoint on New_Node_Breakpoint. Note that the
80 -- initial value of Node_Id'First - 1 ensures that by default, no node
81 -- will be equal to Watch_Node.
84 pragma Export (Ada, nn);
85 procedure New_Node_Breakpoint renames nn;
86 -- This doesn't do anything interesting; it's just for setting breakpoint
87 -- on as explained above.
89 procedure nnd (N : Node_Id);
90 pragma Export (Ada, nnd);
91 procedure New_Node_Debugging_Output (N : Node_Id) renames nnd;
92 -- For debugging. If debugging is turned on, New_Node and New_Entity call
93 -- this. If debug flag N is turned on, this prints out the new node.
95 -- If Node = Watch_Node, this prints out the new node and calls
96 -- New_Node_Breakpoint. Otherwise, does nothing.
99 pragma Export (Ada, rr);
100 procedure Rewrite_Breakpoint renames rr;
101 -- This doesn't do anything interesting; it's just for setting breakpoint
102 -- on as explained above.
104 procedure rrd (Old_Node, New_Node : Node_Id);
105 pragma Export (Ada, rrd);
106 procedure Rewrite_Debugging_Output
107 (Old_Node, New_Node : Node_Id) renames rrd;
108 -- For debugging. If debugging is turned on, Rewrite calls this. If debug
109 -- flag N is turned on, this prints out the new node.
111 -- If Old_Node = Watch_Node, this prints out the old and new nodes and
112 -- calls Rewrite_Breakpoint. Otherwise, does nothing.
114 procedure Node_Debug_Output (Op : String; N : Node_Id);
115 -- Common code for nnd and rrd, writes Op followed by information about N
117 -----------------------------
118 -- Local Objects and Types --
119 -----------------------------
122 -- Count allocated nodes for Num_Nodes function
124 use Unchecked_Access;
125 -- We are allowed to see these from within our own body!
127 use Atree_Private_Part;
128 -- We are also allowed to see our private data structures!
130 -- Functions used to store Entity_Kind value in Nkind field
132 -- The following declarations are used to store flags 65-72 in the
133 -- Nkind field of the third component of an extended (entity) node.
135 type Flag_Byte is record
146 pragma Pack (Flag_Byte);
147 for Flag_Byte'Size use 8;
149 type Flag_Byte_Ptr is access all Flag_Byte;
150 type Node_Kind_Ptr is access all Node_Kind;
152 function To_Flag_Byte is new
153 Unchecked_Conversion (Node_Kind, Flag_Byte);
155 function To_Flag_Byte_Ptr is new
156 Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte_Ptr);
158 -- The following declarations are used to store flags 239-246 in the
159 -- Nkind field of the fourth component of an extended (entity) node.
161 type Flag_Byte2 is record
172 pragma Pack (Flag_Byte2);
173 for Flag_Byte2'Size use 8;
175 type Flag_Byte2_Ptr is access all Flag_Byte2;
177 function To_Flag_Byte2 is new
178 Unchecked_Conversion (Node_Kind, Flag_Byte2);
180 function To_Flag_Byte2_Ptr is new
181 Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte2_Ptr);
183 -- The following declarations are used to store flags 247-254 in the
184 -- Nkind field of the fifth component of an extended (entity) node.
186 type Flag_Byte3 is record
197 pragma Pack (Flag_Byte3);
198 for Flag_Byte3'Size use 8;
200 type Flag_Byte3_Ptr is access all Flag_Byte3;
202 function To_Flag_Byte3 is new
203 Unchecked_Conversion (Node_Kind, Flag_Byte3);
205 function To_Flag_Byte3_Ptr is new
206 Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte3_Ptr);
208 -- The following declarations are used to store flags 73-96 and the
209 -- Convention field in the Field12 field of the third component of an
210 -- extended (Entity) node.
212 type Flag_Word is record
240 Convention : Convention_Id;
243 pragma Pack (Flag_Word);
244 for Flag_Word'Size use 32;
245 for Flag_Word'Alignment use 4;
247 type Flag_Word_Ptr is access all Flag_Word;
248 type Union_Id_Ptr is access all Union_Id;
250 function To_Flag_Word is new
251 Unchecked_Conversion (Union_Id, Flag_Word);
253 function To_Flag_Word_Ptr is new
254 Unchecked_Conversion (Union_Id_Ptr, Flag_Word_Ptr);
256 -- The following declarations are used to store flags 97-128 in the
257 -- Field12 field of the fourth component of an extended (entity) node.
259 type Flag_Word2 is record
297 pragma Pack (Flag_Word2);
298 for Flag_Word2'Size use 32;
299 for Flag_Word2'Alignment use 4;
301 type Flag_Word2_Ptr is access all Flag_Word2;
303 function To_Flag_Word2 is new
304 Unchecked_Conversion (Union_Id, Flag_Word2);
306 function To_Flag_Word2_Ptr is new
307 Unchecked_Conversion (Union_Id_Ptr, Flag_Word2_Ptr);
309 -- The following declarations are used to store flags 152-183 in the
310 -- Field11 field of the fourth component of an extended (entity) node.
312 type Flag_Word3 is record
350 pragma Pack (Flag_Word3);
351 for Flag_Word3'Size use 32;
352 for Flag_Word3'Alignment use 4;
354 type Flag_Word3_Ptr is access all Flag_Word3;
356 function To_Flag_Word3 is new
357 Unchecked_Conversion (Union_Id, Flag_Word3);
359 function To_Flag_Word3_Ptr is new
360 Unchecked_Conversion (Union_Id_Ptr, Flag_Word3_Ptr);
362 -- The following declarations are used to store flags 184-215 in the
363 -- Field12 field of the fifth component of an extended (entity) node.
365 type Flag_Word4 is record
403 pragma Pack (Flag_Word4);
404 for Flag_Word4'Size use 32;
405 for Flag_Word4'Alignment use 4;
407 type Flag_Word4_Ptr is access all Flag_Word4;
409 function To_Flag_Word4 is new
410 Unchecked_Conversion (Union_Id, Flag_Word4);
412 function To_Flag_Word4_Ptr is new
413 Unchecked_Conversion (Union_Id_Ptr, Flag_Word4_Ptr);
415 --------------------------------------------------
416 -- Implementation of Tree Substitution Routines --
417 --------------------------------------------------
419 -- A separate table keeps track of the mapping between rewritten nodes
420 -- and their corresponding original tree nodes. Rewrite makes an entry
421 -- in this table for use by Original_Node. By default, if no call is
422 -- Rewrite, the entry in this table points to the original unwritten node.
424 -- Note: eventually, this should be a field in the Node directly, but
425 -- for now we do not want to disturb the efficiency of a power of 2
428 package Orig_Nodes is new Table.Table (
429 Table_Component_Type => Node_Id,
430 Table_Index_Type => Node_Id'Base,
431 Table_Low_Bound => First_Node_Id,
432 Table_Initial => Alloc.Orig_Nodes_Initial,
433 Table_Increment => Alloc.Orig_Nodes_Increment,
434 Table_Name => "Orig_Nodes");
436 --------------------------
437 -- Paren_Count Handling --
438 --------------------------
440 -- As noted in the spec, the paren count in a sub-expression node has
441 -- four possible values 0,1,2, and 3. The value 3 really means 3 or more,
442 -- and we use an auxiliary serially scanned table to record the actual
443 -- count. A serial search is fine, only pathological programs will use
444 -- entries in this table. Normal programs won't use it at all.
446 type Paren_Count_Entry is record
448 -- The node to which this count applies
450 Count : Nat range 3 .. Nat'Last;
451 -- The count of parentheses, which will be in the indicated range
454 package Paren_Counts is new Table.Table (
455 Table_Component_Type => Paren_Count_Entry,
456 Table_Index_Type => Int,
457 Table_Low_Bound => 0,
459 Table_Increment => 200,
460 Table_Name => "Paren_Counts");
462 -----------------------
463 -- Local Subprograms --
464 -----------------------
466 procedure Fix_Parents (Ref_Node, Fix_Node : Node_Id);
467 -- Fixup parent pointers for the syntactic children of Fix_Node after
468 -- a copy, setting them to Fix_Node when they pointed to Ref_Node.
470 function Allocate_Initialize_Node
472 With_Extension : Boolean) return Node_Id;
473 -- Allocate a new node or node extension. If Src is not empty,
474 -- the information for the newly-allocated node is copied from it.
476 ------------------------------
477 -- Allocate_Initialize_Node --
478 ------------------------------
480 function Allocate_Initialize_Node
482 With_Extension : Boolean) return Node_Id
484 New_Id : Node_Id := Src;
485 Nod : Node_Record := Default_Node;
486 Ext1 : Node_Record := Default_Node_Extension;
487 Ext2 : Node_Record := Default_Node_Extension;
488 Ext3 : Node_Record := Default_Node_Extension;
489 Ext4 : Node_Record := Default_Node_Extension;
492 if Present (Src) then
493 Nod := Nodes.Table (Src);
495 if Has_Extension (Src) then
496 Ext1 := Nodes.Table (Src + 1);
497 Ext2 := Nodes.Table (Src + 2);
498 Ext3 := Nodes.Table (Src + 3);
499 Ext4 := Nodes.Table (Src + 4);
503 if not (Present (Src)
504 and then not Has_Extension (Src)
505 and then With_Extension
506 and then Src = Nodes.Last)
508 -- We are allocating a new node, or extending a node
509 -- other than Nodes.Last.
512 New_Id := Nodes.Last;
513 Orig_Nodes.Append (New_Id);
514 Node_Count := Node_Count + 1;
517 -- Specifically copy Paren_Count to deal with creating new table entry
518 -- if the parentheses count is at the maximum possible value already.
520 if Present (Src) and then Nkind (Src) in N_Subexpr then
521 Set_Paren_Count (New_Id, Paren_Count (Src));
524 -- Set extension nodes if required
526 if With_Extension then
533 Orig_Nodes.Set_Last (Nodes.Last);
534 Allocate_List_Tables (Nodes.Last);
536 -- Invoke the reporting procedure (if available)
538 if Reporting_Proc /= null then
539 Reporting_Proc.all (Target => New_Id, Source => Src);
543 end Allocate_Initialize_Node;
549 function Analyzed (N : Node_Id) return Boolean is
551 pragma Assert (N <= Nodes.Last);
552 return Nodes.Table (N).Analyzed;
555 --------------------------
556 -- Basic_Set_Convention --
557 --------------------------
559 procedure Basic_Set_Convention (E : Entity_Id; Val : Convention_Id) is
561 pragma Assert (Nkind (E) in N_Entity);
564 (Nodes.Table (E + 2).Field12'Unrestricted_Access)).Convention := Val;
565 end Basic_Set_Convention;
571 procedure Change_Node (N : Node_Id; New_Node_Kind : Node_Kind) is
572 Save_Sloc : constant Source_Ptr := Sloc (N);
573 Save_In_List : constant Boolean := Nodes.Table (N).In_List;
574 Save_Link : constant Union_Id := Nodes.Table (N).Link;
575 Save_CFS : constant Boolean := Nodes.Table (N).Comes_From_Source;
576 Save_Posted : constant Boolean := Nodes.Table (N).Error_Posted;
577 Par_Count : Nat := 0;
580 if Nkind (N) in N_Subexpr then
581 Par_Count := Paren_Count (N);
584 Nodes.Table (N) := Default_Node;
585 Nodes.Table (N).Sloc := Save_Sloc;
586 Nodes.Table (N).In_List := Save_In_List;
587 Nodes.Table (N).Link := Save_Link;
588 Nodes.Table (N).Comes_From_Source := Save_CFS;
589 Nodes.Table (N).Nkind := New_Node_Kind;
590 Nodes.Table (N).Error_Posted := Save_Posted;
592 if New_Node_Kind in N_Subexpr then
593 Set_Paren_Count (N, Par_Count);
597 -----------------------
598 -- Comes_From_Source --
599 -----------------------
601 function Comes_From_Source (N : Node_Id) return Boolean is
603 pragma Assert (N <= Nodes.Last);
604 return Nodes.Table (N).Comes_From_Source;
605 end Comes_From_Source;
611 function Convention (E : Entity_Id) return Convention_Id is
613 pragma Assert (Nkind (E) in N_Entity);
614 return To_Flag_Word (Nodes.Table (E + 2).Field12).Convention;
621 procedure Copy_Node (Source : Node_Id; Destination : Node_Id) is
622 Save_In_List : constant Boolean := Nodes.Table (Destination).In_List;
623 Save_Link : constant Union_Id := Nodes.Table (Destination).Link;
626 Nodes.Table (Destination) := Nodes.Table (Source);
627 Nodes.Table (Destination).In_List := Save_In_List;
628 Nodes.Table (Destination).Link := Save_Link;
630 -- Specifically set Paren_Count to make sure auxiliary table entry
631 -- gets correctly made if the parentheses count is at the max value.
633 if Nkind (Destination) in N_Subexpr then
634 Set_Paren_Count (Destination, Paren_Count (Source));
637 -- Deal with copying extension nodes if present
639 if Has_Extension (Source) then
640 pragma Assert (Has_Extension (Destination));
641 Nodes.Table (Destination + 1) := Nodes.Table (Source + 1);
642 Nodes.Table (Destination + 2) := Nodes.Table (Source + 2);
643 Nodes.Table (Destination + 3) := Nodes.Table (Source + 3);
644 Nodes.Table (Destination + 4) := Nodes.Table (Source + 4);
647 pragma Assert (not Has_Extension (Source));
652 ------------------------
653 -- Copy_Separate_Tree --
654 ------------------------
656 function Copy_Separate_Tree (Source : Node_Id) return Node_Id is
659 function Copy_Entity (E : Entity_Id) return Entity_Id;
660 -- Copy Entity, copying only the Ekind and Chars fields
662 function Copy_List (List : List_Id) return List_Id;
665 function Possible_Copy (Field : Union_Id) return Union_Id;
666 -- Given a field, returns a copy of the node or list if its parent
667 -- is the current source node, and otherwise returns the input
673 function Copy_Entity (E : Entity_Id) return Entity_Id is
677 case N_Entity (Nkind (E)) is
678 when N_Defining_Identifier =>
679 New_Ent := New_Entity (N_Defining_Identifier, Sloc (E));
681 when N_Defining_Character_Literal =>
682 New_Ent := New_Entity (N_Defining_Character_Literal, Sloc (E));
684 when N_Defining_Operator_Symbol =>
685 New_Ent := New_Entity (N_Defining_Operator_Symbol, Sloc (E));
688 Set_Chars (New_Ent, Chars (E));
696 function Copy_List (List : List_Id) return List_Id is
701 if List = No_List then
708 while Present (E) loop
709 if Has_Extension (E) then
710 Append (Copy_Entity (E), NL);
712 Append (Copy_Separate_Tree (E), NL);
726 function Possible_Copy (Field : Union_Id) return Union_Id is
730 if Field in Node_Range then
731 New_N := Union_Id (Copy_Separate_Tree (Node_Id (Field)));
733 if Parent (Node_Id (Field)) = Source then
734 Set_Parent (Node_Id (New_N), New_Id);
739 elsif Field in List_Range then
740 New_N := Union_Id (Copy_List (List_Id (Field)));
742 if Parent (List_Id (Field)) = Source then
743 Set_Parent (List_Id (New_N), New_Id);
753 -- Start of processing for Copy_Separate_Tree
756 if Source <= Empty_Or_Error then
759 elsif Has_Extension (Source) then
760 return Copy_Entity (Source);
763 New_Id := New_Copy (Source);
765 -- Recursively copy descendents
767 Set_Field1 (New_Id, Possible_Copy (Field1 (New_Id)));
768 Set_Field2 (New_Id, Possible_Copy (Field2 (New_Id)));
769 Set_Field3 (New_Id, Possible_Copy (Field3 (New_Id)));
770 Set_Field4 (New_Id, Possible_Copy (Field4 (New_Id)));
771 Set_Field5 (New_Id, Possible_Copy (Field5 (New_Id)));
773 -- Set Entity field to Empty
774 -- Why is this done??? and why is it always right to do it???
776 if Nkind (New_Id) in N_Has_Entity
777 or else Nkind (New_Id) = N_Freeze_Entity
779 Set_Entity (New_Id, Empty);
782 -- All done, return copied node
786 end Copy_Separate_Tree;
792 function Ekind (E : Entity_Id) return Entity_Kind is
794 pragma Assert (Nkind (E) in N_Entity);
795 return N_To_E (Nodes.Table (E + 1).Nkind);
805 V2 : Entity_Kind) return Boolean
808 return T = V1 or else
816 V3 : Entity_Kind) return Boolean
819 return T = V1 or else
829 V4 : Entity_Kind) return Boolean
832 return T = V1 or else
844 V5 : Entity_Kind) return Boolean
847 return T = V1 or else
861 V6 : Entity_Kind) return Boolean
864 return T = V1 or else
875 V2 : Entity_Kind) return Boolean
878 return Ekind_In (Ekind (E), V1, V2);
885 V3 : Entity_Kind) return Boolean
888 return Ekind_In (Ekind (E), V1, V2, V3);
896 V4 : Entity_Kind) return Boolean
899 return Ekind_In (Ekind (E), V1, V2, V3, V4);
908 V5 : Entity_Kind) return Boolean
911 return Ekind_In (Ekind (E), V1, V2, V3, V4, V5);
921 V6 : Entity_Kind) return Boolean
924 return Ekind_In (Ekind (E), V1, V2, V3, V4, V5, V6);
927 ------------------------
928 -- Set_Reporting_Proc --
929 ------------------------
931 procedure Set_Reporting_Proc (P : Report_Proc) is
933 pragma Assert (Reporting_Proc = null);
935 end Set_Reporting_Proc;
941 function Error_Posted (N : Node_Id) return Boolean is
943 pragma Assert (N <= Nodes.Last);
944 return Nodes.Table (N).Error_Posted;
947 -----------------------
948 -- Exchange_Entities --
949 -----------------------
951 procedure Exchange_Entities (E1 : Entity_Id; E2 : Entity_Id) is
952 Temp_Ent : Node_Record;
955 pragma Assert (Has_Extension (E1)
956 and then Has_Extension (E2)
957 and then not Nodes.Table (E1).In_List
958 and then not Nodes.Table (E2).In_List);
960 -- Exchange the contents of the two entities
962 Temp_Ent := Nodes.Table (E1);
963 Nodes.Table (E1) := Nodes.Table (E2);
964 Nodes.Table (E2) := Temp_Ent;
965 Temp_Ent := Nodes.Table (E1 + 1);
966 Nodes.Table (E1 + 1) := Nodes.Table (E2 + 1);
967 Nodes.Table (E2 + 1) := Temp_Ent;
968 Temp_Ent := Nodes.Table (E1 + 2);
969 Nodes.Table (E1 + 2) := Nodes.Table (E2 + 2);
970 Nodes.Table (E2 + 2) := Temp_Ent;
971 Temp_Ent := Nodes.Table (E1 + 3);
972 Nodes.Table (E1 + 3) := Nodes.Table (E2 + 3);
973 Nodes.Table (E2 + 3) := Temp_Ent;
974 Temp_Ent := Nodes.Table (E1 + 4);
975 Nodes.Table (E1 + 4) := Nodes.Table (E2 + 4);
976 Nodes.Table (E2 + 4) := Temp_Ent;
978 -- That exchange exchanged the parent pointers as well, which is what
979 -- we want, but we need to patch up the defining identifier pointers
980 -- in the parent nodes (the child pointers) to match this switch
981 -- unless for Implicit types entities which have no parent, in which
982 -- case we don't do anything otherwise we won't be able to revert back
983 -- to the original situation.
985 -- Shouldn't this use Is_Itype instead of the Parent test
987 if Present (Parent (E1)) and then Present (Parent (E2)) then
988 Set_Defining_Identifier (Parent (E1), E1);
989 Set_Defining_Identifier (Parent (E2), E2);
991 end Exchange_Entities;
997 function Extend_Node (Node : Node_Id) return Entity_Id is
1000 procedure Debug_Extend_Node;
1001 pragma Inline (Debug_Extend_Node);
1002 -- Debug routine for debug flag N
1004 -----------------------
1005 -- Debug_Extend_Node --
1006 -----------------------
1008 procedure Debug_Extend_Node is
1010 if Debug_Flag_N then
1011 Write_Str ("Extend node ");
1012 Write_Int (Int (Node));
1014 if Result = Node then
1015 Write_Str (" in place");
1017 Write_Str (" copied to ");
1018 Write_Int (Int (Result));
1023 end Debug_Extend_Node;
1025 -- Start of processing for Extend_Node
1028 pragma Assert (not (Has_Extension (Node)));
1029 Result := Allocate_Initialize_Node (Node, With_Extension => True);
1030 pragma Debug (Debug_Extend_Node);
1038 procedure Fix_Parents (Ref_Node, Fix_Node : Node_Id) is
1040 procedure Fix_Parent (Field : Union_Id);
1041 -- Fixup one parent pointer. Field is checked to see if it points to
1042 -- a node, list, or element list that has a parent that points to
1043 -- Ref_Node. If so, the parent is reset to point to Fix_Node.
1049 procedure Fix_Parent (Field : Union_Id) is
1051 -- Fix parent of node that is referenced by Field. Note that we must
1052 -- exclude the case where the node is a member of a list, because in
1053 -- this case the parent is the parent of the list.
1055 if Field in Node_Range
1056 and then Present (Node_Id (Field))
1057 and then not Nodes.Table (Node_Id (Field)).In_List
1058 and then Parent (Node_Id (Field)) = Ref_Node
1060 Set_Parent (Node_Id (Field), Fix_Node);
1062 -- Fix parent of list that is referenced by Field
1064 elsif Field in List_Range
1065 and then Present (List_Id (Field))
1066 and then Parent (List_Id (Field)) = Ref_Node
1068 Set_Parent (List_Id (Field), Fix_Node);
1072 -- Start of processing for Fix_Parents
1075 Fix_Parent (Field1 (Fix_Node));
1076 Fix_Parent (Field2 (Fix_Node));
1077 Fix_Parent (Field3 (Fix_Node));
1078 Fix_Parent (Field4 (Fix_Node));
1079 Fix_Parent (Field5 (Fix_Node));
1082 -----------------------------------
1083 -- Get_Comes_From_Source_Default --
1084 -----------------------------------
1086 function Get_Comes_From_Source_Default return Boolean is
1088 return Default_Node.Comes_From_Source;
1089 end Get_Comes_From_Source_Default;
1095 function Has_Aspects (N : Node_Id) return Boolean is
1097 pragma Assert (N <= Nodes.Last);
1098 return Nodes.Table (N).Has_Aspects;
1105 function Has_Extension (N : Node_Id) return Boolean is
1107 return N < Nodes.Last and then Nodes.Table (N + 1).Is_Extension;
1114 procedure Initialize is
1116 pragma Warnings (Off, Dummy);
1120 Atree_Private_Part.Nodes.Init;
1124 -- Allocate Empty node
1126 Dummy := New_Node (N_Empty, No_Location);
1127 Set_Name1 (Empty, No_Name);
1129 -- Allocate Error node, and set Error_Posted, since we certainly
1130 -- only generate an Error node if we do post some kind of error!
1132 Dummy := New_Node (N_Error, No_Location);
1133 Set_Name1 (Error, Error_Name);
1134 Set_Error_Posted (Error, True);
1137 --------------------------
1138 -- Is_Rewrite_Insertion --
1139 --------------------------
1141 function Is_Rewrite_Insertion (Node : Node_Id) return Boolean is
1143 return Nodes.Table (Node).Rewrite_Ins;
1144 end Is_Rewrite_Insertion;
1146 -----------------------------
1147 -- Is_Rewrite_Substitution --
1148 -----------------------------
1150 function Is_Rewrite_Substitution (Node : Node_Id) return Boolean is
1152 return Orig_Nodes.Table (Node) /= Node;
1153 end Is_Rewrite_Substitution;
1159 function Last_Node_Id return Node_Id is
1170 Nodes.Locked := True;
1171 Orig_Nodes.Locked := True;
1176 ----------------------------
1177 -- Mark_Rewrite_Insertion --
1178 ----------------------------
1180 procedure Mark_Rewrite_Insertion (New_Node : Node_Id) is
1182 Nodes.Table (New_Node).Rewrite_Ins := True;
1183 end Mark_Rewrite_Insertion;
1189 function New_Copy (Source : Node_Id) return Node_Id is
1190 New_Id : Node_Id := Source;
1193 if Source > Empty_Or_Error then
1194 New_Id := Allocate_Initialize_Node (Source, Has_Extension (Source));
1196 Nodes.Table (New_Id).Link := Empty_List_Or_Node;
1197 Nodes.Table (New_Id).In_List := False;
1199 -- If the original is marked as a rewrite insertion, then unmark
1200 -- the copy, since we inserted the original, not the copy.
1202 Nodes.Table (New_Id).Rewrite_Ins := False;
1203 pragma Debug (New_Node_Debugging_Output (New_Id));
1205 -- Always clear Has_Aspects, the caller must take care of copying
1206 -- aspects if this is required for the particular situation.
1208 Set_Has_Aspects (New_Id, False);
1219 (New_Node_Kind : Node_Kind;
1220 New_Sloc : Source_Ptr) return Entity_Id
1225 pragma Assert (New_Node_Kind in N_Entity);
1227 Ent := Allocate_Initialize_Node (Empty, With_Extension => True);
1229 -- If this is a node with a real location and we are generating
1230 -- source nodes, then reset Current_Error_Node. This is useful
1231 -- if we bomb during parsing to get a error location for the bomb.
1233 if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
1234 Current_Error_Node := Ent;
1237 Nodes.Table (Ent).Nkind := New_Node_Kind;
1238 Nodes.Table (Ent).Sloc := New_Sloc;
1239 pragma Debug (New_Node_Debugging_Output (Ent));
1249 (New_Node_Kind : Node_Kind;
1250 New_Sloc : Source_Ptr) return Node_Id
1255 pragma Assert (New_Node_Kind not in N_Entity);
1256 Nod := Allocate_Initialize_Node (Empty, With_Extension => False);
1257 Nodes.Table (Nod).Nkind := New_Node_Kind;
1258 Nodes.Table (Nod).Sloc := New_Sloc;
1259 pragma Debug (New_Node_Debugging_Output (Nod));
1261 -- If this is a node with a real location and we are generating source
1262 -- nodes, then reset Current_Error_Node. This is useful if we bomb
1263 -- during parsing to get an error location for the bomb.
1265 if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
1266 Current_Error_Node := Nod;
1272 -------------------------
1273 -- New_Node_Breakpoint --
1274 -------------------------
1278 Write_Str ("Watched node ");
1279 Write_Int (Int (Watch_Node));
1280 Write_Str (" created");
1284 -------------------------------
1285 -- New_Node_Debugging_Output --
1286 -------------------------------
1288 procedure nnd (N : Node_Id) is
1289 Node_Is_Watched : constant Boolean := N = Watch_Node;
1292 if Debug_Flag_N or else Node_Is_Watched then
1293 Node_Debug_Output ("Allocate", N);
1295 if Node_Is_Watched then
1296 New_Node_Breakpoint;
1305 function Nkind (N : Node_Id) return Node_Kind is
1307 return Nodes.Table (N).Nkind;
1317 V2 : Node_Kind) return Boolean
1320 return Nkind_In (Nkind (N), V1, V2);
1327 V3 : Node_Kind) return Boolean
1330 return Nkind_In (Nkind (N), V1, V2, V3);
1338 V4 : Node_Kind) return Boolean
1341 return Nkind_In (Nkind (N), V1, V2, V3, V4);
1350 V5 : Node_Kind) return Boolean
1353 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5);
1363 V6 : Node_Kind) return Boolean
1366 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6);
1377 V7 : Node_Kind) return Boolean
1380 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7);
1392 V8 : Node_Kind) return Boolean
1395 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7, V8);
1408 V9 : Node_Kind) return Boolean
1411 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7, V8, V9);
1418 function No (N : Node_Id) return Boolean is
1423 -----------------------
1424 -- Node_Debug_Output --
1425 -----------------------
1427 procedure Node_Debug_Output (Op : String; N : Node_Id) is
1431 if Nkind (N) in N_Entity then
1432 Write_Str (" entity");
1434 Write_Str (" node");
1437 Write_Str (" Id = ");
1438 Write_Int (Int (N));
1440 Write_Location (Sloc (N));
1442 Write_Str (Node_Kind'Image (Nkind (N)));
1444 end Node_Debug_Output;
1450 function Nodes_Address return System.Address is
1452 return Nodes.Table (First_Node_Id)'Address;
1459 function Num_Nodes return Nat is
1468 function Original_Node (Node : Node_Id) return Node_Id is
1470 return Orig_Nodes.Table (Node);
1477 function Paren_Count (N : Node_Id) return Nat is
1481 pragma Assert (N <= Nodes.Last);
1483 if Nodes.Table (N).Pflag1 then
1487 if Nodes.Table (N).Pflag2 then
1491 -- Value of 0,1,2 returned as is
1496 -- Value of 3 means we search the table, and we must find an entry
1499 for J in Paren_Counts.First .. Paren_Counts.Last loop
1500 if N = Paren_Counts.Table (J).Nod then
1501 return Paren_Counts.Table (J).Count;
1505 raise Program_Error;
1513 function Parent (N : Node_Id) return Node_Id is
1515 if Is_List_Member (N) then
1516 return Parent (List_Containing (N));
1518 return Node_Id (Nodes.Table (N).Link);
1526 function Present (N : Node_Id) return Boolean is
1531 --------------------------------
1532 -- Preserve_Comes_From_Source --
1533 --------------------------------
1535 procedure Preserve_Comes_From_Source (NewN, OldN : Node_Id) is
1537 Nodes.Table (NewN).Comes_From_Source :=
1538 Nodes.Table (OldN).Comes_From_Source;
1539 end Preserve_Comes_From_Source;
1545 function Relocate_Node (Source : Node_Id) return Node_Id is
1553 New_Node := New_Copy (Source);
1554 Fix_Parents (Ref_Node => Source, Fix_Node => New_Node);
1556 -- We now set the parent of the new node to be the same as the
1557 -- parent of the source. Almost always this parent will be
1558 -- replaced by a new value when the relocated node is reattached
1559 -- to the tree, but by doing it now, we ensure that this node is
1560 -- not even temporarily disconnected from the tree. Note that this
1561 -- does not happen free, because in the list case, the parent does
1564 Set_Parent (New_Node, Parent (Source));
1566 -- If the node being relocated was a rewriting of some original
1567 -- node, then the relocated node has the same original node.
1569 if Orig_Nodes.Table (Source) /= Source then
1570 Orig_Nodes.Table (New_Node) := Orig_Nodes.Table (Source);
1580 procedure Replace (Old_Node, New_Node : Node_Id) is
1581 Old_Post : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
1582 Old_HasA : constant Boolean := Nodes.Table (Old_Node).Has_Aspects;
1583 Old_CFS : constant Boolean := Nodes.Table (Old_Node).Comes_From_Source;
1587 (not Has_Extension (Old_Node)
1588 and not Has_Extension (New_Node)
1589 and not Nodes.Table (New_Node).In_List);
1591 -- Do copy, preserving link and in list status and required flags
1593 Copy_Node (Source => New_Node, Destination => Old_Node);
1594 Nodes.Table (Old_Node).Comes_From_Source := Old_CFS;
1595 Nodes.Table (Old_Node).Error_Posted := Old_Post;
1596 Nodes.Table (Old_Node).Has_Aspects := Old_HasA;
1598 -- Fix parents of substituted node, since it has changed identity
1600 Fix_Parents (Ref_Node => New_Node, Fix_Node => Old_Node);
1602 -- Since we are doing a replace, we assume that the original node
1603 -- is intended to become the new replaced node. The call would be
1604 -- to Rewrite if there were an intention to save the original node.
1606 Orig_Nodes.Table (Old_Node) := Old_Node;
1608 -- Invoke the reporting procedure (if available)
1610 if Reporting_Proc /= null then
1611 Reporting_Proc.all (Target => Old_Node, Source => New_Node);
1619 procedure Rewrite (Old_Node, New_Node : Node_Id) is
1620 Old_Error_P : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
1621 -- This field is always preserved in the new node
1623 Old_Has_Aspects : constant Boolean := Nodes.Table (Old_Node).Has_Aspects;
1624 -- This field is always preserved in the new node
1626 Old_Paren_Count : Nat;
1627 Old_Must_Not_Freeze : Boolean;
1628 -- These fields are preserved in the new node only if the new node
1629 -- and the old node are both subexpression nodes.
1631 -- Note: it is a violation of abstraction levels for Must_Not_Freeze
1632 -- to be referenced like this. ???
1638 (not Has_Extension (Old_Node)
1639 and not Has_Extension (New_Node)
1640 and not Nodes.Table (New_Node).In_List);
1641 pragma Debug (Rewrite_Debugging_Output (Old_Node, New_Node));
1643 if Nkind (Old_Node) in N_Subexpr then
1644 Old_Paren_Count := Paren_Count (Old_Node);
1645 Old_Must_Not_Freeze := Must_Not_Freeze (Old_Node);
1647 Old_Paren_Count := 0;
1648 Old_Must_Not_Freeze := False;
1651 -- Allocate a new node, to be used to preserve the original contents
1652 -- of the Old_Node, for possible later retrival by Original_Node and
1653 -- make an entry in the Orig_Nodes table. This is only done if we have
1654 -- not already rewritten the node, as indicated by an Orig_Nodes entry
1655 -- that does not reference the Old_Node.
1657 if Orig_Nodes.Table (Old_Node) = Old_Node then
1658 Sav_Node := New_Copy (Old_Node);
1659 Orig_Nodes.Table (Sav_Node) := Sav_Node;
1660 Orig_Nodes.Table (Old_Node) := Sav_Node;
1662 -- Both the old and new copies of the node will share the same list
1663 -- of aspect specifications if aspect specifications are present.
1665 if Has_Aspects (Sav_Node) then
1666 Set_Has_Aspects (Sav_Node, False);
1667 Set_Aspect_Specifications
1668 (Sav_Node, Aspect_Specifications (Old_Node));
1672 -- Copy substitute node into place, preserving old fields as required
1674 Copy_Node (Source => New_Node, Destination => Old_Node);
1675 Nodes.Table (Old_Node).Error_Posted := Old_Error_P;
1676 Nodes.Table (Old_Node).Has_Aspects := Old_Has_Aspects;
1678 if Nkind (New_Node) in N_Subexpr then
1679 Set_Paren_Count (Old_Node, Old_Paren_Count);
1680 Set_Must_Not_Freeze (Old_Node, Old_Must_Not_Freeze);
1683 Fix_Parents (Ref_Node => New_Node, Fix_Node => Old_Node);
1685 -- Invoke the reporting procedure (if available)
1687 if Reporting_Proc /= null then
1688 Reporting_Proc.all (Target => Old_Node, Source => New_Node);
1692 -------------------------
1693 -- Rewrite_Breakpoint --
1694 -------------------------
1698 Write_Str ("Watched node ");
1699 Write_Int (Int (Watch_Node));
1700 Write_Str (" rewritten");
1704 ------------------------------
1705 -- Rewrite_Debugging_Output --
1706 ------------------------------
1708 procedure rrd (Old_Node, New_Node : Node_Id) is
1709 Node_Is_Watched : constant Boolean := Old_Node = Watch_Node;
1712 if Debug_Flag_N or else Node_Is_Watched then
1713 Node_Debug_Output ("Rewrite", Old_Node);
1714 Node_Debug_Output ("into", New_Node);
1716 if Node_Is_Watched then
1726 procedure Set_Analyzed (N : Node_Id; Val : Boolean := True) is
1728 Nodes.Table (N).Analyzed := Val;
1731 ---------------------------
1732 -- Set_Comes_From_Source --
1733 ---------------------------
1735 procedure Set_Comes_From_Source (N : Node_Id; Val : Boolean) is
1737 pragma Assert (N <= Nodes.Last);
1738 Nodes.Table (N).Comes_From_Source := Val;
1739 end Set_Comes_From_Source;
1741 -----------------------------------
1742 -- Set_Comes_From_Source_Default --
1743 -----------------------------------
1745 procedure Set_Comes_From_Source_Default (Default : Boolean) is
1747 Default_Node.Comes_From_Source := Default;
1748 end Set_Comes_From_Source_Default;
1754 procedure Set_Ekind (E : Entity_Id; Val : Entity_Kind) is
1756 pragma Assert (Nkind (E) in N_Entity);
1757 Nodes.Table (E + 1).Nkind := E_To_N (Val);
1760 ----------------------
1761 -- Set_Error_Posted --
1762 ----------------------
1764 procedure Set_Error_Posted (N : Node_Id; Val : Boolean := True) is
1766 Nodes.Table (N).Error_Posted := Val;
1767 end Set_Error_Posted;
1769 ---------------------
1770 -- Set_Has_Aspects --
1771 ---------------------
1773 procedure Set_Has_Aspects (N : Node_Id; Val : Boolean := True) is
1775 pragma Assert (N <= Nodes.Last);
1776 Nodes.Table (N).Has_Aspects := Val;
1777 end Set_Has_Aspects;
1779 ---------------------
1780 -- Set_Paren_Count --
1781 ---------------------
1783 procedure Set_Paren_Count (N : Node_Id; Val : Nat) is
1785 pragma Assert (Nkind (N) in N_Subexpr);
1787 -- Value of 0,1,2 stored as is
1790 Nodes.Table (N).Pflag1 := (Val mod 2 /= 0);
1791 Nodes.Table (N).Pflag2 := (Val = 2);
1793 -- Value of 3 or greater stores 3 in node and makes table entry
1796 Nodes.Table (N).Pflag1 := True;
1797 Nodes.Table (N).Pflag2 := True;
1799 for J in Paren_Counts.First .. Paren_Counts.Last loop
1800 if N = Paren_Counts.Table (J).Nod then
1801 Paren_Counts.Table (J).Count := Val;
1806 Paren_Counts.Append ((Nod => N, Count => Val));
1808 end Set_Paren_Count;
1814 procedure Set_Parent (N : Node_Id; Val : Node_Id) is
1816 pragma Assert (not Nodes.Table (N).In_List);
1817 Nodes.Table (N).Link := Union_Id (Val);
1824 procedure Set_Sloc (N : Node_Id; Val : Source_Ptr) is
1826 Nodes.Table (N).Sloc := Val;
1833 function Sloc (N : Node_Id) return Source_Ptr is
1835 return Nodes.Table (N).Sloc;
1842 function Traverse_Func (Node : Node_Id) return Traverse_Final_Result is
1844 function Traverse_Field
1847 FN : Field_Num) return Traverse_Final_Result;
1848 -- Fld is one of the fields of Nod. If the field points to syntactic
1849 -- node or list, then this node or list is traversed, and the result is
1850 -- the result of this traversal. Otherwise a value of True is returned
1851 -- with no processing. FN is the number of the field (1 .. 5).
1853 --------------------
1854 -- Traverse_Field --
1855 --------------------
1857 function Traverse_Field
1860 FN : Field_Num) return Traverse_Final_Result
1863 if Fld = Union_Id (Empty) then
1866 -- Descendent is a node
1868 elsif Fld in Node_Range then
1870 -- Traverse descendent that is syntactic subtree node
1872 if Is_Syntactic_Field (Nkind (Nod), FN) then
1873 return Traverse_Func (Node_Id (Fld));
1875 -- Node that is not a syntactic subtree
1881 -- Descendent is a list
1883 elsif Fld in List_Range then
1885 -- Traverse descendent that is a syntactic subtree list
1887 if Is_Syntactic_Field (Nkind (Nod), FN) then
1889 Elmt : Node_Id := First (List_Id (Fld));
1891 while Present (Elmt) loop
1892 if Traverse_Func (Elmt) = Abandon then
1902 -- List that is not a syntactic subtree
1908 -- Field was not a node or a list
1915 Cur_Node : Node_Id := Node;
1917 -- Start of processing for Traverse_Func
1920 -- We walk Field2 last, and if it is a node, we eliminate the tail
1921 -- recursion by jumping back to this label. This is because Field2 is
1922 -- where the Left_Opnd field of N_Op_Concat is stored, and in practice
1923 -- concatenations are sometimes deeply nested, as in X1&X2&...&XN. This
1924 -- trick prevents us from running out of memory in that case. We don't
1925 -- bother eliminating the tail recursion if Field2 is a list.
1929 case Process (Cur_Node) is
1940 Cur_Node := Original_Node (Cur_Node);
1943 if Traverse_Field (Cur_Node, Field1 (Cur_Node), 1) = Abandon
1944 or else -- skip Field2 here
1945 Traverse_Field (Cur_Node, Field3 (Cur_Node), 3) = Abandon
1947 Traverse_Field (Cur_Node, Field4 (Cur_Node), 4) = Abandon
1949 Traverse_Field (Cur_Node, Field5 (Cur_Node), 5) = Abandon
1954 if Field2 (Cur_Node) not in Node_Range then
1955 return Traverse_Field (Cur_Node, Field2 (Cur_Node), 2);
1957 elsif Is_Syntactic_Field (Nkind (Cur_Node), 2)
1958 and then Field2 (Cur_Node) /= Empty_List_Or_Node
1960 -- Here is the tail recursion step, we reset Cur_Node and jump back
1961 -- to the start of the procedure, which has the same semantic effect
1964 Cur_Node := Node_Id (Field2 (Cur_Node));
1975 procedure Traverse_Proc (Node : Node_Id) is
1976 function Traverse is new Traverse_Func (Process);
1977 Discard : Traverse_Final_Result;
1978 pragma Warnings (Off, Discard);
1980 Discard := Traverse (Node);
1987 procedure Tree_Read is
1989 Tree_Read_Int (Node_Count);
1991 Orig_Nodes.Tree_Read;
1992 Paren_Counts.Tree_Read;
1999 procedure Tree_Write is
2001 Tree_Write_Int (Node_Count);
2003 Orig_Nodes.Tree_Write;
2004 Paren_Counts.Tree_Write;
2007 ------------------------------
2008 -- Unchecked Access Package --
2009 ------------------------------
2011 package body Unchecked_Access is
2013 function Field1 (N : Node_Id) return Union_Id is
2015 pragma Assert (N <= Nodes.Last);
2016 return Nodes.Table (N).Field1;
2019 function Field2 (N : Node_Id) return Union_Id is
2021 pragma Assert (N <= Nodes.Last);
2022 return Nodes.Table (N).Field2;
2025 function Field3 (N : Node_Id) return Union_Id is
2027 pragma Assert (N <= Nodes.Last);
2028 return Nodes.Table (N).Field3;
2031 function Field4 (N : Node_Id) return Union_Id is
2033 pragma Assert (N <= Nodes.Last);
2034 return Nodes.Table (N).Field4;
2037 function Field5 (N : Node_Id) return Union_Id is
2039 pragma Assert (N <= Nodes.Last);
2040 return Nodes.Table (N).Field5;
2043 function Field6 (N : Node_Id) return Union_Id is
2045 pragma Assert (Nkind (N) in N_Entity);
2046 return Nodes.Table (N + 1).Field6;
2049 function Field7 (N : Node_Id) return Union_Id is
2051 pragma Assert (Nkind (N) in N_Entity);
2052 return Nodes.Table (N + 1).Field7;
2055 function Field8 (N : Node_Id) return Union_Id is
2057 pragma Assert (Nkind (N) in N_Entity);
2058 return Nodes.Table (N + 1).Field8;
2061 function Field9 (N : Node_Id) return Union_Id is
2063 pragma Assert (Nkind (N) in N_Entity);
2064 return Nodes.Table (N + 1).Field9;
2067 function Field10 (N : Node_Id) return Union_Id is
2069 pragma Assert (Nkind (N) in N_Entity);
2070 return Nodes.Table (N + 1).Field10;
2073 function Field11 (N : Node_Id) return Union_Id is
2075 pragma Assert (Nkind (N) in N_Entity);
2076 return Nodes.Table (N + 1).Field11;
2079 function Field12 (N : Node_Id) return Union_Id is
2081 pragma Assert (Nkind (N) in N_Entity);
2082 return Nodes.Table (N + 1).Field12;
2085 function Field13 (N : Node_Id) return Union_Id is
2087 pragma Assert (Nkind (N) in N_Entity);
2088 return Nodes.Table (N + 2).Field6;
2091 function Field14 (N : Node_Id) return Union_Id is
2093 pragma Assert (Nkind (N) in N_Entity);
2094 return Nodes.Table (N + 2).Field7;
2097 function Field15 (N : Node_Id) return Union_Id is
2099 pragma Assert (Nkind (N) in N_Entity);
2100 return Nodes.Table (N + 2).Field8;
2103 function Field16 (N : Node_Id) return Union_Id is
2105 pragma Assert (Nkind (N) in N_Entity);
2106 return Nodes.Table (N + 2).Field9;
2109 function Field17 (N : Node_Id) return Union_Id is
2111 pragma Assert (Nkind (N) in N_Entity);
2112 return Nodes.Table (N + 2).Field10;
2115 function Field18 (N : Node_Id) return Union_Id is
2117 pragma Assert (Nkind (N) in N_Entity);
2118 return Nodes.Table (N + 2).Field11;
2121 function Field19 (N : Node_Id) return Union_Id is
2123 pragma Assert (Nkind (N) in N_Entity);
2124 return Nodes.Table (N + 3).Field6;
2127 function Field20 (N : Node_Id) return Union_Id is
2129 pragma Assert (Nkind (N) in N_Entity);
2130 return Nodes.Table (N + 3).Field7;
2133 function Field21 (N : Node_Id) return Union_Id is
2135 pragma Assert (Nkind (N) in N_Entity);
2136 return Nodes.Table (N + 3).Field8;
2139 function Field22 (N : Node_Id) return Union_Id is
2141 pragma Assert (Nkind (N) in N_Entity);
2142 return Nodes.Table (N + 3).Field9;
2145 function Field23 (N : Node_Id) return Union_Id is
2147 pragma Assert (Nkind (N) in N_Entity);
2148 return Nodes.Table (N + 3).Field10;
2151 function Field24 (N : Node_Id) return Union_Id is
2153 pragma Assert (Nkind (N) in N_Entity);
2154 return Nodes.Table (N + 4).Field6;
2157 function Field25 (N : Node_Id) return Union_Id is
2159 pragma Assert (Nkind (N) in N_Entity);
2160 return Nodes.Table (N + 4).Field7;
2163 function Field26 (N : Node_Id) return Union_Id is
2165 pragma Assert (Nkind (N) in N_Entity);
2166 return Nodes.Table (N + 4).Field8;
2169 function Field27 (N : Node_Id) return Union_Id is
2171 pragma Assert (Nkind (N) in N_Entity);
2172 return Nodes.Table (N + 4).Field9;
2175 function Field28 (N : Node_Id) return Union_Id is
2177 pragma Assert (Nkind (N) in N_Entity);
2178 return Nodes.Table (N + 4).Field10;
2181 function Field29 (N : Node_Id) return Union_Id is
2183 pragma Assert (Nkind (N) in N_Entity);
2184 return Nodes.Table (N + 4).Field11;
2187 function Node1 (N : Node_Id) return Node_Id is
2189 pragma Assert (N <= Nodes.Last);
2190 return Node_Id (Nodes.Table (N).Field1);
2193 function Node2 (N : Node_Id) return Node_Id is
2195 pragma Assert (N <= Nodes.Last);
2196 return Node_Id (Nodes.Table (N).Field2);
2199 function Node3 (N : Node_Id) return Node_Id is
2201 pragma Assert (N <= Nodes.Last);
2202 return Node_Id (Nodes.Table (N).Field3);
2205 function Node4 (N : Node_Id) return Node_Id is
2207 pragma Assert (N <= Nodes.Last);
2208 return Node_Id (Nodes.Table (N).Field4);
2211 function Node5 (N : Node_Id) return Node_Id is
2213 pragma Assert (N <= Nodes.Last);
2214 return Node_Id (Nodes.Table (N).Field5);
2217 function Node6 (N : Node_Id) return Node_Id is
2219 pragma Assert (Nkind (N) in N_Entity);
2220 return Node_Id (Nodes.Table (N + 1).Field6);
2223 function Node7 (N : Node_Id) return Node_Id is
2225 pragma Assert (Nkind (N) in N_Entity);
2226 return Node_Id (Nodes.Table (N + 1).Field7);
2229 function Node8 (N : Node_Id) return Node_Id is
2231 pragma Assert (Nkind (N) in N_Entity);
2232 return Node_Id (Nodes.Table (N + 1).Field8);
2235 function Node9 (N : Node_Id) return Node_Id is
2237 pragma Assert (Nkind (N) in N_Entity);
2238 return Node_Id (Nodes.Table (N + 1).Field9);
2241 function Node10 (N : Node_Id) return Node_Id is
2243 pragma Assert (Nkind (N) in N_Entity);
2244 return Node_Id (Nodes.Table (N + 1).Field10);
2247 function Node11 (N : Node_Id) return Node_Id is
2249 pragma Assert (Nkind (N) in N_Entity);
2250 return Node_Id (Nodes.Table (N + 1).Field11);
2253 function Node12 (N : Node_Id) return Node_Id is
2255 pragma Assert (Nkind (N) in N_Entity);
2256 return Node_Id (Nodes.Table (N + 1).Field12);
2259 function Node13 (N : Node_Id) return Node_Id is
2261 pragma Assert (Nkind (N) in N_Entity);
2262 return Node_Id (Nodes.Table (N + 2).Field6);
2265 function Node14 (N : Node_Id) return Node_Id is
2267 pragma Assert (Nkind (N) in N_Entity);
2268 return Node_Id (Nodes.Table (N + 2).Field7);
2271 function Node15 (N : Node_Id) return Node_Id is
2273 pragma Assert (Nkind (N) in N_Entity);
2274 return Node_Id (Nodes.Table (N + 2).Field8);
2277 function Node16 (N : Node_Id) return Node_Id is
2279 pragma Assert (Nkind (N) in N_Entity);
2280 return Node_Id (Nodes.Table (N + 2).Field9);
2283 function Node17 (N : Node_Id) return Node_Id is
2285 pragma Assert (Nkind (N) in N_Entity);
2286 return Node_Id (Nodes.Table (N + 2).Field10);
2289 function Node18 (N : Node_Id) return Node_Id is
2291 pragma Assert (Nkind (N) in N_Entity);
2292 return Node_Id (Nodes.Table (N + 2).Field11);
2295 function Node19 (N : Node_Id) return Node_Id is
2297 pragma Assert (Nkind (N) in N_Entity);
2298 return Node_Id (Nodes.Table (N + 3).Field6);
2301 function Node20 (N : Node_Id) return Node_Id is
2303 pragma Assert (Nkind (N) in N_Entity);
2304 return Node_Id (Nodes.Table (N + 3).Field7);
2307 function Node21 (N : Node_Id) return Node_Id is
2309 pragma Assert (Nkind (N) in N_Entity);
2310 return Node_Id (Nodes.Table (N + 3).Field8);
2313 function Node22 (N : Node_Id) return Node_Id is
2315 pragma Assert (Nkind (N) in N_Entity);
2316 return Node_Id (Nodes.Table (N + 3).Field9);
2319 function Node23 (N : Node_Id) return Node_Id is
2321 pragma Assert (Nkind (N) in N_Entity);
2322 return Node_Id (Nodes.Table (N + 3).Field10);
2325 function Node24 (N : Node_Id) return Node_Id is
2327 pragma Assert (Nkind (N) in N_Entity);
2328 return Node_Id (Nodes.Table (N + 4).Field6);
2331 function Node25 (N : Node_Id) return Node_Id is
2333 pragma Assert (Nkind (N) in N_Entity);
2334 return Node_Id (Nodes.Table (N + 4).Field7);
2337 function Node26 (N : Node_Id) return Node_Id is
2339 pragma Assert (Nkind (N) in N_Entity);
2340 return Node_Id (Nodes.Table (N + 4).Field8);
2343 function Node27 (N : Node_Id) return Node_Id is
2345 pragma Assert (Nkind (N) in N_Entity);
2346 return Node_Id (Nodes.Table (N + 4).Field9);
2349 function Node28 (N : Node_Id) return Node_Id is
2351 pragma Assert (Nkind (N) in N_Entity);
2352 return Node_Id (Nodes.Table (N + 4).Field10);
2355 function Node29 (N : Node_Id) return Node_Id is
2357 pragma Assert (Nkind (N) in N_Entity);
2358 return Node_Id (Nodes.Table (N + 4).Field11);
2361 function List1 (N : Node_Id) return List_Id is
2363 pragma Assert (N <= Nodes.Last);
2364 return List_Id (Nodes.Table (N).Field1);
2367 function List2 (N : Node_Id) return List_Id is
2369 pragma Assert (N <= Nodes.Last);
2370 return List_Id (Nodes.Table (N).Field2);
2373 function List3 (N : Node_Id) return List_Id is
2375 pragma Assert (N <= Nodes.Last);
2376 return List_Id (Nodes.Table (N).Field3);
2379 function List4 (N : Node_Id) return List_Id is
2381 pragma Assert (N <= Nodes.Last);
2382 return List_Id (Nodes.Table (N).Field4);
2385 function List5 (N : Node_Id) return List_Id is
2387 pragma Assert (N <= Nodes.Last);
2388 return List_Id (Nodes.Table (N).Field5);
2391 function List10 (N : Node_Id) return List_Id is
2393 pragma Assert (Nkind (N) in N_Entity);
2394 return List_Id (Nodes.Table (N + 1).Field10);
2397 function List14 (N : Node_Id) return List_Id is
2399 pragma Assert (Nkind (N) in N_Entity);
2400 return List_Id (Nodes.Table (N + 2).Field7);
2403 function Elist1 (N : Node_Id) return Elist_Id is
2404 pragma Assert (N <= Nodes.Last);
2405 Value : constant Union_Id := Nodes.Table (N).Field1;
2410 return Elist_Id (Value);
2414 function Elist2 (N : Node_Id) return Elist_Id is
2415 pragma Assert (N <= Nodes.Last);
2416 Value : constant Union_Id := Nodes.Table (N).Field2;
2421 return Elist_Id (Value);
2425 function Elist3 (N : Node_Id) return Elist_Id is
2426 pragma Assert (N <= Nodes.Last);
2427 Value : constant Union_Id := Nodes.Table (N).Field3;
2432 return Elist_Id (Value);
2436 function Elist4 (N : Node_Id) return Elist_Id is
2437 pragma Assert (N <= Nodes.Last);
2438 Value : constant Union_Id := Nodes.Table (N).Field4;
2443 return Elist_Id (Value);
2447 function Elist8 (N : Node_Id) return Elist_Id is
2448 pragma Assert (Nkind (N) in N_Entity);
2449 Value : constant Union_Id := Nodes.Table (N + 1).Field8;
2454 return Elist_Id (Value);
2458 function Elist13 (N : Node_Id) return Elist_Id is
2459 pragma Assert (Nkind (N) in N_Entity);
2460 Value : constant Union_Id := Nodes.Table (N + 2).Field6;
2465 return Elist_Id (Value);
2469 function Elist15 (N : Node_Id) return Elist_Id is
2470 pragma Assert (Nkind (N) in N_Entity);
2471 Value : constant Union_Id := Nodes.Table (N + 2).Field8;
2476 return Elist_Id (Value);
2480 function Elist16 (N : Node_Id) return Elist_Id is
2481 pragma Assert (Nkind (N) in N_Entity);
2482 Value : constant Union_Id := Nodes.Table (N + 2).Field9;
2487 return Elist_Id (Value);
2491 function Elist18 (N : Node_Id) return Elist_Id is
2492 pragma Assert (Nkind (N) in N_Entity);
2493 Value : constant Union_Id := Nodes.Table (N + 2).Field11;
2498 return Elist_Id (Value);
2502 function Elist21 (N : Node_Id) return Elist_Id is
2503 pragma Assert (Nkind (N) in N_Entity);
2504 Value : constant Union_Id := Nodes.Table (N + 3).Field8;
2509 return Elist_Id (Value);
2513 function Elist23 (N : Node_Id) return Elist_Id is
2514 pragma Assert (Nkind (N) in N_Entity);
2515 Value : constant Union_Id := Nodes.Table (N + 3).Field10;
2520 return Elist_Id (Value);
2524 function Elist25 (N : Node_Id) return Elist_Id is
2525 pragma Assert (Nkind (N) in N_Entity);
2526 Value : constant Union_Id := Nodes.Table (N + 4).Field7;
2531 return Elist_Id (Value);
2535 function Elist26 (N : Node_Id) return Elist_Id is
2536 pragma Assert (Nkind (N) in N_Entity);
2537 Value : constant Union_Id := Nodes.Table (N + 4).Field8;
2542 return Elist_Id (Value);
2546 function Name1 (N : Node_Id) return Name_Id is
2548 pragma Assert (N <= Nodes.Last);
2549 return Name_Id (Nodes.Table (N).Field1);
2552 function Name2 (N : Node_Id) return Name_Id is
2554 pragma Assert (N <= Nodes.Last);
2555 return Name_Id (Nodes.Table (N).Field2);
2558 function Str3 (N : Node_Id) return String_Id is
2560 pragma Assert (N <= Nodes.Last);
2561 return String_Id (Nodes.Table (N).Field3);
2564 function Uint2 (N : Node_Id) return Uint is
2565 pragma Assert (N <= Nodes.Last);
2566 U : constant Union_Id := Nodes.Table (N).Field2;
2571 return From_Union (U);
2575 function Uint3 (N : Node_Id) return Uint is
2576 pragma Assert (N <= Nodes.Last);
2577 U : constant Union_Id := Nodes.Table (N).Field3;
2582 return From_Union (U);
2586 function Uint4 (N : Node_Id) return Uint is
2587 pragma Assert (N <= Nodes.Last);
2588 U : constant Union_Id := Nodes.Table (N).Field4;
2593 return From_Union (U);
2597 function Uint5 (N : Node_Id) return Uint is
2598 pragma Assert (N <= Nodes.Last);
2599 U : constant Union_Id := Nodes.Table (N).Field5;
2604 return From_Union (U);
2608 function Uint8 (N : Node_Id) return Uint is
2609 pragma Assert (Nkind (N) in N_Entity);
2610 U : constant Union_Id := Nodes.Table (N + 1).Field8;
2615 return From_Union (U);
2619 function Uint9 (N : Node_Id) return Uint is
2620 pragma Assert (Nkind (N) in N_Entity);
2621 U : constant Union_Id := Nodes.Table (N + 1).Field9;
2626 return From_Union (U);
2630 function Uint10 (N : Node_Id) return Uint is
2631 pragma Assert (Nkind (N) in N_Entity);
2632 U : constant Union_Id := Nodes.Table (N + 1).Field10;
2637 return From_Union (U);
2641 function Uint11 (N : Node_Id) return Uint is
2642 pragma Assert (Nkind (N) in N_Entity);
2643 U : constant Union_Id := Nodes.Table (N + 1).Field11;
2648 return From_Union (U);
2652 function Uint12 (N : Node_Id) return Uint is
2653 pragma Assert (Nkind (N) in N_Entity);
2654 U : constant Union_Id := Nodes.Table (N + 1).Field12;
2659 return From_Union (U);
2663 function Uint13 (N : Node_Id) return Uint is
2664 pragma Assert (Nkind (N) in N_Entity);
2665 U : constant Union_Id := Nodes.Table (N + 2).Field6;
2670 return From_Union (U);
2674 function Uint14 (N : Node_Id) return Uint is
2675 pragma Assert (Nkind (N) in N_Entity);
2676 U : constant Union_Id := Nodes.Table (N + 2).Field7;
2681 return From_Union (U);
2685 function Uint15 (N : Node_Id) return Uint is
2686 pragma Assert (Nkind (N) in N_Entity);
2687 U : constant Union_Id := Nodes.Table (N + 2).Field8;
2692 return From_Union (U);
2696 function Uint16 (N : Node_Id) return Uint is
2697 pragma Assert (Nkind (N) in N_Entity);
2698 U : constant Union_Id := Nodes.Table (N + 2).Field9;
2703 return From_Union (U);
2707 function Uint17 (N : Node_Id) return Uint is
2708 pragma Assert (Nkind (N) in N_Entity);
2709 U : constant Union_Id := Nodes.Table (N + 2).Field10;
2714 return From_Union (U);
2718 function Uint22 (N : Node_Id) return Uint is
2719 pragma Assert (Nkind (N) in N_Entity);
2720 U : constant Union_Id := Nodes.Table (N + 3).Field9;
2725 return From_Union (U);
2729 function Ureal3 (N : Node_Id) return Ureal is
2731 pragma Assert (N <= Nodes.Last);
2732 return From_Union (Nodes.Table (N).Field3);
2735 function Ureal18 (N : Node_Id) return Ureal is
2737 pragma Assert (Nkind (N) in N_Entity);
2738 return From_Union (Nodes.Table (N + 2).Field11);
2741 function Ureal21 (N : Node_Id) return Ureal is
2743 pragma Assert (Nkind (N) in N_Entity);
2744 return From_Union (Nodes.Table (N + 3).Field8);
2747 function Flag4 (N : Node_Id) return Boolean is
2749 pragma Assert (N <= Nodes.Last);
2750 return Nodes.Table (N).Flag4;
2753 function Flag5 (N : Node_Id) return Boolean is
2755 pragma Assert (N <= Nodes.Last);
2756 return Nodes.Table (N).Flag5;
2759 function Flag6 (N : Node_Id) return Boolean is
2761 pragma Assert (N <= Nodes.Last);
2762 return Nodes.Table (N).Flag6;
2765 function Flag7 (N : Node_Id) return Boolean is
2767 pragma Assert (N <= Nodes.Last);
2768 return Nodes.Table (N).Flag7;
2771 function Flag8 (N : Node_Id) return Boolean is
2773 pragma Assert (N <= Nodes.Last);
2774 return Nodes.Table (N).Flag8;
2777 function Flag9 (N : Node_Id) return Boolean is
2779 pragma Assert (N <= Nodes.Last);
2780 return Nodes.Table (N).Flag9;
2783 function Flag10 (N : Node_Id) return Boolean is
2785 pragma Assert (N <= Nodes.Last);
2786 return Nodes.Table (N).Flag10;
2789 function Flag11 (N : Node_Id) return Boolean is
2791 pragma Assert (N <= Nodes.Last);
2792 return Nodes.Table (N).Flag11;
2795 function Flag12 (N : Node_Id) return Boolean is
2797 pragma Assert (N <= Nodes.Last);
2798 return Nodes.Table (N).Flag12;
2801 function Flag13 (N : Node_Id) return Boolean is
2803 pragma Assert (N <= Nodes.Last);
2804 return Nodes.Table (N).Flag13;
2807 function Flag14 (N : Node_Id) return Boolean is
2809 pragma Assert (N <= Nodes.Last);
2810 return Nodes.Table (N).Flag14;
2813 function Flag15 (N : Node_Id) return Boolean is
2815 pragma Assert (N <= Nodes.Last);
2816 return Nodes.Table (N).Flag15;
2819 function Flag16 (N : Node_Id) return Boolean is
2821 pragma Assert (N <= Nodes.Last);
2822 return Nodes.Table (N).Flag16;
2825 function Flag17 (N : Node_Id) return Boolean is
2827 pragma Assert (N <= Nodes.Last);
2828 return Nodes.Table (N).Flag17;
2831 function Flag18 (N : Node_Id) return Boolean is
2833 pragma Assert (N <= Nodes.Last);
2834 return Nodes.Table (N).Flag18;
2837 function Flag19 (N : Node_Id) return Boolean is
2839 pragma Assert (Nkind (N) in N_Entity);
2840 return Nodes.Table (N + 1).In_List;
2843 function Flag20 (N : Node_Id) return Boolean is
2845 pragma Assert (Nkind (N) in N_Entity);
2846 return Nodes.Table (N + 1).Has_Aspects;
2849 function Flag21 (N : Node_Id) return Boolean is
2851 pragma Assert (Nkind (N) in N_Entity);
2852 return Nodes.Table (N + 1).Rewrite_Ins;
2855 function Flag22 (N : Node_Id) return Boolean is
2857 pragma Assert (Nkind (N) in N_Entity);
2858 return Nodes.Table (N + 1).Analyzed;
2861 function Flag23 (N : Node_Id) return Boolean is
2863 pragma Assert (Nkind (N) in N_Entity);
2864 return Nodes.Table (N + 1).Comes_From_Source;
2867 function Flag24 (N : Node_Id) return Boolean is
2869 pragma Assert (Nkind (N) in N_Entity);
2870 return Nodes.Table (N + 1).Error_Posted;
2873 function Flag25 (N : Node_Id) return Boolean is
2875 pragma Assert (Nkind (N) in N_Entity);
2876 return Nodes.Table (N + 1).Flag4;
2879 function Flag26 (N : Node_Id) return Boolean is
2881 pragma Assert (Nkind (N) in N_Entity);
2882 return Nodes.Table (N + 1).Flag5;
2885 function Flag27 (N : Node_Id) return Boolean is
2887 pragma Assert (Nkind (N) in N_Entity);
2888 return Nodes.Table (N + 1).Flag6;
2891 function Flag28 (N : Node_Id) return Boolean is
2893 pragma Assert (Nkind (N) in N_Entity);
2894 return Nodes.Table (N + 1).Flag7;
2897 function Flag29 (N : Node_Id) return Boolean is
2899 pragma Assert (Nkind (N) in N_Entity);
2900 return Nodes.Table (N + 1).Flag8;
2903 function Flag30 (N : Node_Id) return Boolean is
2905 pragma Assert (Nkind (N) in N_Entity);
2906 return Nodes.Table (N + 1).Flag9;
2909 function Flag31 (N : Node_Id) return Boolean is
2911 pragma Assert (Nkind (N) in N_Entity);
2912 return Nodes.Table (N + 1).Flag10;
2915 function Flag32 (N : Node_Id) return Boolean is
2917 pragma Assert (Nkind (N) in N_Entity);
2918 return Nodes.Table (N + 1).Flag11;
2921 function Flag33 (N : Node_Id) return Boolean is
2923 pragma Assert (Nkind (N) in N_Entity);
2924 return Nodes.Table (N + 1).Flag12;
2927 function Flag34 (N : Node_Id) return Boolean is
2929 pragma Assert (Nkind (N) in N_Entity);
2930 return Nodes.Table (N + 1).Flag13;
2933 function Flag35 (N : Node_Id) return Boolean is
2935 pragma Assert (Nkind (N) in N_Entity);
2936 return Nodes.Table (N + 1).Flag14;
2939 function Flag36 (N : Node_Id) return Boolean is
2941 pragma Assert (Nkind (N) in N_Entity);
2942 return Nodes.Table (N + 1).Flag15;
2945 function Flag37 (N : Node_Id) return Boolean is
2947 pragma Assert (Nkind (N) in N_Entity);
2948 return Nodes.Table (N + 1).Flag16;
2951 function Flag38 (N : Node_Id) return Boolean is
2953 pragma Assert (Nkind (N) in N_Entity);
2954 return Nodes.Table (N + 1).Flag17;
2957 function Flag39 (N : Node_Id) return Boolean is
2959 pragma Assert (Nkind (N) in N_Entity);
2960 return Nodes.Table (N + 1).Flag18;
2963 function Flag40 (N : Node_Id) return Boolean is
2965 pragma Assert (Nkind (N) in N_Entity);
2966 return Nodes.Table (N + 2).In_List;
2969 function Flag41 (N : Node_Id) return Boolean is
2971 pragma Assert (Nkind (N) in N_Entity);
2972 return Nodes.Table (N + 2).Has_Aspects;
2975 function Flag42 (N : Node_Id) return Boolean is
2977 pragma Assert (Nkind (N) in N_Entity);
2978 return Nodes.Table (N + 2).Rewrite_Ins;
2981 function Flag43 (N : Node_Id) return Boolean is
2983 pragma Assert (Nkind (N) in N_Entity);
2984 return Nodes.Table (N + 2).Analyzed;
2987 function Flag44 (N : Node_Id) return Boolean is
2989 pragma Assert (Nkind (N) in N_Entity);
2990 return Nodes.Table (N + 2).Comes_From_Source;
2993 function Flag45 (N : Node_Id) return Boolean is
2995 pragma Assert (Nkind (N) in N_Entity);
2996 return Nodes.Table (N + 2).Error_Posted;
2999 function Flag46 (N : Node_Id) return Boolean is
3001 pragma Assert (Nkind (N) in N_Entity);
3002 return Nodes.Table (N + 2).Flag4;
3005 function Flag47 (N : Node_Id) return Boolean is
3007 pragma Assert (Nkind (N) in N_Entity);
3008 return Nodes.Table (N + 2).Flag5;
3011 function Flag48 (N : Node_Id) return Boolean is
3013 pragma Assert (Nkind (N) in N_Entity);
3014 return Nodes.Table (N + 2).Flag6;
3017 function Flag49 (N : Node_Id) return Boolean is
3019 pragma Assert (Nkind (N) in N_Entity);
3020 return Nodes.Table (N + 2).Flag7;
3023 function Flag50 (N : Node_Id) return Boolean is
3025 pragma Assert (Nkind (N) in N_Entity);
3026 return Nodes.Table (N + 2).Flag8;
3029 function Flag51 (N : Node_Id) return Boolean is
3031 pragma Assert (Nkind (N) in N_Entity);
3032 return Nodes.Table (N + 2).Flag9;
3035 function Flag52 (N : Node_Id) return Boolean is
3037 pragma Assert (Nkind (N) in N_Entity);
3038 return Nodes.Table (N + 2).Flag10;
3041 function Flag53 (N : Node_Id) return Boolean is
3043 pragma Assert (Nkind (N) in N_Entity);
3044 return Nodes.Table (N + 2).Flag11;
3047 function Flag54 (N : Node_Id) return Boolean is
3049 pragma Assert (Nkind (N) in N_Entity);
3050 return Nodes.Table (N + 2).Flag12;
3053 function Flag55 (N : Node_Id) return Boolean is
3055 pragma Assert (Nkind (N) in N_Entity);
3056 return Nodes.Table (N + 2).Flag13;
3059 function Flag56 (N : Node_Id) return Boolean is
3061 pragma Assert (Nkind (N) in N_Entity);
3062 return Nodes.Table (N + 2).Flag14;
3065 function Flag57 (N : Node_Id) return Boolean is
3067 pragma Assert (Nkind (N) in N_Entity);
3068 return Nodes.Table (N + 2).Flag15;
3071 function Flag58 (N : Node_Id) return Boolean is
3073 pragma Assert (Nkind (N) in N_Entity);
3074 return Nodes.Table (N + 2).Flag16;
3077 function Flag59 (N : Node_Id) return Boolean is
3079 pragma Assert (Nkind (N) in N_Entity);
3080 return Nodes.Table (N + 2).Flag17;
3083 function Flag60 (N : Node_Id) return Boolean is
3085 pragma Assert (Nkind (N) in N_Entity);
3086 return Nodes.Table (N + 2).Flag18;
3089 function Flag61 (N : Node_Id) return Boolean is
3091 pragma Assert (Nkind (N) in N_Entity);
3092 return Nodes.Table (N + 1).Pflag1;
3095 function Flag62 (N : Node_Id) return Boolean is
3097 pragma Assert (Nkind (N) in N_Entity);
3098 return Nodes.Table (N + 1).Pflag2;
3101 function Flag63 (N : Node_Id) return Boolean is
3103 pragma Assert (Nkind (N) in N_Entity);
3104 return Nodes.Table (N + 2).Pflag1;
3107 function Flag64 (N : Node_Id) return Boolean is
3109 pragma Assert (Nkind (N) in N_Entity);
3110 return Nodes.Table (N + 2).Pflag2;
3113 function Flag65 (N : Node_Id) return Boolean is
3115 pragma Assert (Nkind (N) in N_Entity);
3116 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag65;
3119 function Flag66 (N : Node_Id) return Boolean is
3121 pragma Assert (Nkind (N) in N_Entity);
3122 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag66;
3125 function Flag67 (N : Node_Id) return Boolean is
3127 pragma Assert (Nkind (N) in N_Entity);
3128 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag67;
3131 function Flag68 (N : Node_Id) return Boolean is
3133 pragma Assert (Nkind (N) in N_Entity);
3134 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag68;
3137 function Flag69 (N : Node_Id) return Boolean is
3139 pragma Assert (Nkind (N) in N_Entity);
3140 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag69;
3143 function Flag70 (N : Node_Id) return Boolean is
3145 pragma Assert (Nkind (N) in N_Entity);
3146 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag70;
3149 function Flag71 (N : Node_Id) return Boolean is
3151 pragma Assert (Nkind (N) in N_Entity);
3152 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag71;
3155 function Flag72 (N : Node_Id) return Boolean is
3157 pragma Assert (Nkind (N) in N_Entity);
3158 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag72;
3161 function Flag73 (N : Node_Id) return Boolean is
3163 pragma Assert (Nkind (N) in N_Entity);
3164 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag73;
3167 function Flag74 (N : Node_Id) return Boolean is
3169 pragma Assert (Nkind (N) in N_Entity);
3170 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag74;
3173 function Flag75 (N : Node_Id) return Boolean is
3175 pragma Assert (Nkind (N) in N_Entity);
3176 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag75;
3179 function Flag76 (N : Node_Id) return Boolean is
3181 pragma Assert (Nkind (N) in N_Entity);
3182 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag76;
3185 function Flag77 (N : Node_Id) return Boolean is
3187 pragma Assert (Nkind (N) in N_Entity);
3188 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag77;
3191 function Flag78 (N : Node_Id) return Boolean is
3193 pragma Assert (Nkind (N) in N_Entity);
3194 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag78;
3197 function Flag79 (N : Node_Id) return Boolean is
3199 pragma Assert (Nkind (N) in N_Entity);
3200 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag79;
3203 function Flag80 (N : Node_Id) return Boolean is
3205 pragma Assert (Nkind (N) in N_Entity);
3206 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag80;
3209 function Flag81 (N : Node_Id) return Boolean is
3211 pragma Assert (Nkind (N) in N_Entity);
3212 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag81;
3215 function Flag82 (N : Node_Id) return Boolean is
3217 pragma Assert (Nkind (N) in N_Entity);
3218 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag82;
3221 function Flag83 (N : Node_Id) return Boolean is
3223 pragma Assert (Nkind (N) in N_Entity);
3224 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag83;
3227 function Flag84 (N : Node_Id) return Boolean is
3229 pragma Assert (Nkind (N) in N_Entity);
3230 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag84;
3233 function Flag85 (N : Node_Id) return Boolean is
3235 pragma Assert (Nkind (N) in N_Entity);
3236 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag85;
3239 function Flag86 (N : Node_Id) return Boolean is
3241 pragma Assert (Nkind (N) in N_Entity);
3242 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag86;
3245 function Flag87 (N : Node_Id) return Boolean is
3247 pragma Assert (Nkind (N) in N_Entity);
3248 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag87;
3251 function Flag88 (N : Node_Id) return Boolean is
3253 pragma Assert (Nkind (N) in N_Entity);
3254 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag88;
3257 function Flag89 (N : Node_Id) return Boolean is
3259 pragma Assert (Nkind (N) in N_Entity);
3260 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag89;
3263 function Flag90 (N : Node_Id) return Boolean is
3265 pragma Assert (Nkind (N) in N_Entity);
3266 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag90;
3269 function Flag91 (N : Node_Id) return Boolean is
3271 pragma Assert (Nkind (N) in N_Entity);
3272 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag91;
3275 function Flag92 (N : Node_Id) return Boolean is
3277 pragma Assert (Nkind (N) in N_Entity);
3278 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag92;
3281 function Flag93 (N : Node_Id) return Boolean is
3283 pragma Assert (Nkind (N) in N_Entity);
3284 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag93;
3287 function Flag94 (N : Node_Id) return Boolean is
3289 pragma Assert (Nkind (N) in N_Entity);
3290 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag94;
3293 function Flag95 (N : Node_Id) return Boolean is
3295 pragma Assert (Nkind (N) in N_Entity);
3296 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag95;
3299 function Flag96 (N : Node_Id) return Boolean is
3301 pragma Assert (Nkind (N) in N_Entity);
3302 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag96;
3305 function Flag97 (N : Node_Id) return Boolean is
3307 pragma Assert (Nkind (N) in N_Entity);
3308 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag97;
3311 function Flag98 (N : Node_Id) return Boolean is
3313 pragma Assert (Nkind (N) in N_Entity);
3314 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag98;
3317 function Flag99 (N : Node_Id) return Boolean is
3319 pragma Assert (Nkind (N) in N_Entity);
3320 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag99;
3323 function Flag100 (N : Node_Id) return Boolean is
3325 pragma Assert (Nkind (N) in N_Entity);
3326 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag100;
3329 function Flag101 (N : Node_Id) return Boolean is
3331 pragma Assert (Nkind (N) in N_Entity);
3332 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag101;
3335 function Flag102 (N : Node_Id) return Boolean is
3337 pragma Assert (Nkind (N) in N_Entity);
3338 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag102;
3341 function Flag103 (N : Node_Id) return Boolean is
3343 pragma Assert (Nkind (N) in N_Entity);
3344 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag103;
3347 function Flag104 (N : Node_Id) return Boolean is
3349 pragma Assert (Nkind (N) in N_Entity);
3350 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag104;
3353 function Flag105 (N : Node_Id) return Boolean is
3355 pragma Assert (Nkind (N) in N_Entity);
3356 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag105;
3359 function Flag106 (N : Node_Id) return Boolean is
3361 pragma Assert (Nkind (N) in N_Entity);
3362 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag106;
3365 function Flag107 (N : Node_Id) return Boolean is
3367 pragma Assert (Nkind (N) in N_Entity);
3368 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag107;
3371 function Flag108 (N : Node_Id) return Boolean is
3373 pragma Assert (Nkind (N) in N_Entity);
3374 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag108;
3377 function Flag109 (N : Node_Id) return Boolean is
3379 pragma Assert (Nkind (N) in N_Entity);
3380 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag109;
3383 function Flag110 (N : Node_Id) return Boolean is
3385 pragma Assert (Nkind (N) in N_Entity);
3386 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag110;
3389 function Flag111 (N : Node_Id) return Boolean is
3391 pragma Assert (Nkind (N) in N_Entity);
3392 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag111;
3395 function Flag112 (N : Node_Id) return Boolean is
3397 pragma Assert (Nkind (N) in N_Entity);
3398 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag112;
3401 function Flag113 (N : Node_Id) return Boolean is
3403 pragma Assert (Nkind (N) in N_Entity);
3404 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag113;
3407 function Flag114 (N : Node_Id) return Boolean is
3409 pragma Assert (Nkind (N) in N_Entity);
3410 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag114;
3413 function Flag115 (N : Node_Id) return Boolean is
3415 pragma Assert (Nkind (N) in N_Entity);
3416 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag115;
3419 function Flag116 (N : Node_Id) return Boolean is
3421 pragma Assert (Nkind (N) in N_Entity);
3422 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag116;
3425 function Flag117 (N : Node_Id) return Boolean is
3427 pragma Assert (Nkind (N) in N_Entity);
3428 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag117;
3431 function Flag118 (N : Node_Id) return Boolean is
3433 pragma Assert (Nkind (N) in N_Entity);
3434 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag118;
3437 function Flag119 (N : Node_Id) return Boolean is
3439 pragma Assert (Nkind (N) in N_Entity);
3440 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag119;
3443 function Flag120 (N : Node_Id) return Boolean is
3445 pragma Assert (Nkind (N) in N_Entity);
3446 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag120;
3449 function Flag121 (N : Node_Id) return Boolean is
3451 pragma Assert (Nkind (N) in N_Entity);
3452 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag121;
3455 function Flag122 (N : Node_Id) return Boolean is
3457 pragma Assert (Nkind (N) in N_Entity);
3458 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag122;
3461 function Flag123 (N : Node_Id) return Boolean is
3463 pragma Assert (Nkind (N) in N_Entity);
3464 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag123;
3467 function Flag124 (N : Node_Id) return Boolean is
3469 pragma Assert (Nkind (N) in N_Entity);
3470 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag124;
3473 function Flag125 (N : Node_Id) return Boolean is
3475 pragma Assert (Nkind (N) in N_Entity);
3476 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag125;
3479 function Flag126 (N : Node_Id) return Boolean is
3481 pragma Assert (Nkind (N) in N_Entity);
3482 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag126;
3485 function Flag127 (N : Node_Id) return Boolean is
3487 pragma Assert (Nkind (N) in N_Entity);
3488 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag127;
3491 function Flag128 (N : Node_Id) return Boolean is
3493 pragma Assert (Nkind (N) in N_Entity);
3494 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag128;
3497 function Flag129 (N : Node_Id) return Boolean is
3499 pragma Assert (Nkind (N) in N_Entity);
3500 return Nodes.Table (N + 3).In_List;
3503 function Flag130 (N : Node_Id) return Boolean is
3505 pragma Assert (Nkind (N) in N_Entity);
3506 return Nodes.Table (N + 3).Has_Aspects;
3509 function Flag131 (N : Node_Id) return Boolean is
3511 pragma Assert (Nkind (N) in N_Entity);
3512 return Nodes.Table (N + 3).Rewrite_Ins;
3515 function Flag132 (N : Node_Id) return Boolean is
3517 pragma Assert (Nkind (N) in N_Entity);
3518 return Nodes.Table (N + 3).Analyzed;
3521 function Flag133 (N : Node_Id) return Boolean is
3523 pragma Assert (Nkind (N) in N_Entity);
3524 return Nodes.Table (N + 3).Comes_From_Source;
3527 function Flag134 (N : Node_Id) return Boolean is
3529 pragma Assert (Nkind (N) in N_Entity);
3530 return Nodes.Table (N + 3).Error_Posted;
3533 function Flag135 (N : Node_Id) return Boolean is
3535 pragma Assert (Nkind (N) in N_Entity);
3536 return Nodes.Table (N + 3).Flag4;
3539 function Flag136 (N : Node_Id) return Boolean is
3541 pragma Assert (Nkind (N) in N_Entity);
3542 return Nodes.Table (N + 3).Flag5;
3545 function Flag137 (N : Node_Id) return Boolean is
3547 pragma Assert (Nkind (N) in N_Entity);
3548 return Nodes.Table (N + 3).Flag6;
3551 function Flag138 (N : Node_Id) return Boolean is
3553 pragma Assert (Nkind (N) in N_Entity);
3554 return Nodes.Table (N + 3).Flag7;
3557 function Flag139 (N : Node_Id) return Boolean is
3559 pragma Assert (Nkind (N) in N_Entity);
3560 return Nodes.Table (N + 3).Flag8;
3563 function Flag140 (N : Node_Id) return Boolean is
3565 pragma Assert (Nkind (N) in N_Entity);
3566 return Nodes.Table (N + 3).Flag9;
3569 function Flag141 (N : Node_Id) return Boolean is
3571 pragma Assert (Nkind (N) in N_Entity);
3572 return Nodes.Table (N + 3).Flag10;
3575 function Flag142 (N : Node_Id) return Boolean is
3577 pragma Assert (Nkind (N) in N_Entity);
3578 return Nodes.Table (N + 3).Flag11;
3581 function Flag143 (N : Node_Id) return Boolean is
3583 pragma Assert (Nkind (N) in N_Entity);
3584 return Nodes.Table (N + 3).Flag12;
3587 function Flag144 (N : Node_Id) return Boolean is
3589 pragma Assert (Nkind (N) in N_Entity);
3590 return Nodes.Table (N + 3).Flag13;
3593 function Flag145 (N : Node_Id) return Boolean is
3595 pragma Assert (Nkind (N) in N_Entity);
3596 return Nodes.Table (N + 3).Flag14;
3599 function Flag146 (N : Node_Id) return Boolean is
3601 pragma Assert (Nkind (N) in N_Entity);
3602 return Nodes.Table (N + 3).Flag15;
3605 function Flag147 (N : Node_Id) return Boolean is
3607 pragma Assert (Nkind (N) in N_Entity);
3608 return Nodes.Table (N + 3).Flag16;
3611 function Flag148 (N : Node_Id) return Boolean is
3613 pragma Assert (Nkind (N) in N_Entity);
3614 return Nodes.Table (N + 3).Flag17;
3617 function Flag149 (N : Node_Id) return Boolean is
3619 pragma Assert (Nkind (N) in N_Entity);
3620 return Nodes.Table (N + 3).Flag18;
3623 function Flag150 (N : Node_Id) return Boolean is
3625 pragma Assert (Nkind (N) in N_Entity);
3626 return Nodes.Table (N + 3).Pflag1;
3629 function Flag151 (N : Node_Id) return Boolean is
3631 pragma Assert (Nkind (N) in N_Entity);
3632 return Nodes.Table (N + 3).Pflag2;
3635 function Flag152 (N : Node_Id) return Boolean is
3637 pragma Assert (Nkind (N) in N_Entity);
3638 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag152;
3641 function Flag153 (N : Node_Id) return Boolean is
3643 pragma Assert (Nkind (N) in N_Entity);
3644 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag153;
3647 function Flag154 (N : Node_Id) return Boolean is
3649 pragma Assert (Nkind (N) in N_Entity);
3650 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag154;
3653 function Flag155 (N : Node_Id) return Boolean is
3655 pragma Assert (Nkind (N) in N_Entity);
3656 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag155;
3659 function Flag156 (N : Node_Id) return Boolean is
3661 pragma Assert (Nkind (N) in N_Entity);
3662 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag156;
3665 function Flag157 (N : Node_Id) return Boolean is
3667 pragma Assert (Nkind (N) in N_Entity);
3668 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag157;
3671 function Flag158 (N : Node_Id) return Boolean is
3673 pragma Assert (Nkind (N) in N_Entity);
3674 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag158;
3677 function Flag159 (N : Node_Id) return Boolean is
3679 pragma Assert (Nkind (N) in N_Entity);
3680 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag159;
3683 function Flag160 (N : Node_Id) return Boolean is
3685 pragma Assert (Nkind (N) in N_Entity);
3686 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag160;
3689 function Flag161 (N : Node_Id) return Boolean is
3691 pragma Assert (Nkind (N) in N_Entity);
3692 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag161;
3695 function Flag162 (N : Node_Id) return Boolean is
3697 pragma Assert (Nkind (N) in N_Entity);
3698 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag162;
3701 function Flag163 (N : Node_Id) return Boolean is
3703 pragma Assert (Nkind (N) in N_Entity);
3704 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag163;
3707 function Flag164 (N : Node_Id) return Boolean is
3709 pragma Assert (Nkind (N) in N_Entity);
3710 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag164;
3713 function Flag165 (N : Node_Id) return Boolean is
3715 pragma Assert (Nkind (N) in N_Entity);
3716 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag165;
3719 function Flag166 (N : Node_Id) return Boolean is
3721 pragma Assert (Nkind (N) in N_Entity);
3722 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag166;
3725 function Flag167 (N : Node_Id) return Boolean is
3727 pragma Assert (Nkind (N) in N_Entity);
3728 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag167;
3731 function Flag168 (N : Node_Id) return Boolean is
3733 pragma Assert (Nkind (N) in N_Entity);
3734 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag168;
3737 function Flag169 (N : Node_Id) return Boolean is
3739 pragma Assert (Nkind (N) in N_Entity);
3740 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag169;
3743 function Flag170 (N : Node_Id) return Boolean is
3745 pragma Assert (Nkind (N) in N_Entity);
3746 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag170;
3749 function Flag171 (N : Node_Id) return Boolean is
3751 pragma Assert (Nkind (N) in N_Entity);
3752 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag171;
3755 function Flag172 (N : Node_Id) return Boolean is
3757 pragma Assert (Nkind (N) in N_Entity);
3758 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag172;
3761 function Flag173 (N : Node_Id) return Boolean is
3763 pragma Assert (Nkind (N) in N_Entity);
3764 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag173;
3767 function Flag174 (N : Node_Id) return Boolean is
3769 pragma Assert (Nkind (N) in N_Entity);
3770 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag174;
3773 function Flag175 (N : Node_Id) return Boolean is
3775 pragma Assert (Nkind (N) in N_Entity);
3776 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag175;
3779 function Flag176 (N : Node_Id) return Boolean is
3781 pragma Assert (Nkind (N) in N_Entity);
3782 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag176;
3785 function Flag177 (N : Node_Id) return Boolean is
3787 pragma Assert (Nkind (N) in N_Entity);
3788 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag177;
3791 function Flag178 (N : Node_Id) return Boolean is
3793 pragma Assert (Nkind (N) in N_Entity);
3794 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag178;
3797 function Flag179 (N : Node_Id) return Boolean is
3799 pragma Assert (Nkind (N) in N_Entity);
3800 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag179;
3803 function Flag180 (N : Node_Id) return Boolean is
3805 pragma Assert (Nkind (N) in N_Entity);
3806 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag180;
3809 function Flag181 (N : Node_Id) return Boolean is
3811 pragma Assert (Nkind (N) in N_Entity);
3812 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag181;
3815 function Flag182 (N : Node_Id) return Boolean is
3817 pragma Assert (Nkind (N) in N_Entity);
3818 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag182;
3821 function Flag183 (N : Node_Id) return Boolean is
3823 pragma Assert (Nkind (N) in N_Entity);
3824 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag183;
3827 function Flag184 (N : Node_Id) return Boolean is
3829 pragma Assert (Nkind (N) in N_Entity);
3830 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag184;
3833 function Flag185 (N : Node_Id) return Boolean is
3835 pragma Assert (Nkind (N) in N_Entity);
3836 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag185;
3839 function Flag186 (N : Node_Id) return Boolean is
3841 pragma Assert (Nkind (N) in N_Entity);
3842 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag186;
3845 function Flag187 (N : Node_Id) return Boolean is
3847 pragma Assert (Nkind (N) in N_Entity);
3848 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag187;
3851 function Flag188 (N : Node_Id) return Boolean is
3853 pragma Assert (Nkind (N) in N_Entity);
3854 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag188;
3857 function Flag189 (N : Node_Id) return Boolean is
3859 pragma Assert (Nkind (N) in N_Entity);
3860 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag189;
3863 function Flag190 (N : Node_Id) return Boolean is
3865 pragma Assert (Nkind (N) in N_Entity);
3866 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag190;
3869 function Flag191 (N : Node_Id) return Boolean is
3871 pragma Assert (Nkind (N) in N_Entity);
3872 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag191;
3875 function Flag192 (N : Node_Id) return Boolean is
3877 pragma Assert (Nkind (N) in N_Entity);
3878 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag192;
3881 function Flag193 (N : Node_Id) return Boolean is
3883 pragma Assert (Nkind (N) in N_Entity);
3884 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag193;
3887 function Flag194 (N : Node_Id) return Boolean is
3889 pragma Assert (Nkind (N) in N_Entity);
3890 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag194;
3893 function Flag195 (N : Node_Id) return Boolean is
3895 pragma Assert (Nkind (N) in N_Entity);
3896 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag195;
3899 function Flag196 (N : Node_Id) return Boolean is
3901 pragma Assert (Nkind (N) in N_Entity);
3902 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag196;
3905 function Flag197 (N : Node_Id) return Boolean is
3907 pragma Assert (Nkind (N) in N_Entity);
3908 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag197;
3911 function Flag198 (N : Node_Id) return Boolean is
3913 pragma Assert (Nkind (N) in N_Entity);
3914 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag198;
3917 function Flag199 (N : Node_Id) return Boolean is
3919 pragma Assert (Nkind (N) in N_Entity);
3920 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag199;
3923 function Flag200 (N : Node_Id) return Boolean is
3925 pragma Assert (Nkind (N) in N_Entity);
3926 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag200;
3929 function Flag201 (N : Node_Id) return Boolean is
3931 pragma Assert (Nkind (N) in N_Entity);
3932 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag201;
3935 function Flag202 (N : Node_Id) return Boolean is
3937 pragma Assert (Nkind (N) in N_Entity);
3938 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag202;
3941 function Flag203 (N : Node_Id) return Boolean is
3943 pragma Assert (Nkind (N) in N_Entity);
3944 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag203;
3947 function Flag204 (N : Node_Id) return Boolean is
3949 pragma Assert (Nkind (N) in N_Entity);
3950 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag204;
3953 function Flag205 (N : Node_Id) return Boolean is
3955 pragma Assert (Nkind (N) in N_Entity);
3956 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag205;
3959 function Flag206 (N : Node_Id) return Boolean is
3961 pragma Assert (Nkind (N) in N_Entity);
3962 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag206;
3965 function Flag207 (N : Node_Id) return Boolean is
3967 pragma Assert (Nkind (N) in N_Entity);
3968 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag207;
3971 function Flag208 (N : Node_Id) return Boolean is
3973 pragma Assert (Nkind (N) in N_Entity);
3974 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag208;
3977 function Flag209 (N : Node_Id) return Boolean is
3979 pragma Assert (Nkind (N) in N_Entity);
3980 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag209;
3983 function Flag210 (N : Node_Id) return Boolean is
3985 pragma Assert (Nkind (N) in N_Entity);
3986 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag210;
3989 function Flag211 (N : Node_Id) return Boolean is
3991 pragma Assert (Nkind (N) in N_Entity);
3992 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag211;
3995 function Flag212 (N : Node_Id) return Boolean is
3997 pragma Assert (Nkind (N) in N_Entity);
3998 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag212;
4001 function Flag213 (N : Node_Id) return Boolean is
4003 pragma Assert (Nkind (N) in N_Entity);
4004 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag213;
4007 function Flag214 (N : Node_Id) return Boolean is
4009 pragma Assert (Nkind (N) in N_Entity);
4010 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag214;
4013 function Flag215 (N : Node_Id) return Boolean is
4015 pragma Assert (Nkind (N) in N_Entity);
4016 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag215;
4019 function Flag216 (N : Node_Id) return Boolean is
4021 pragma Assert (Nkind (N) in N_Entity);
4022 return Nodes.Table (N + 4).In_List;
4025 function Flag217 (N : Node_Id) return Boolean is
4027 pragma Assert (Nkind (N) in N_Entity);
4028 return Nodes.Table (N + 4).Has_Aspects;
4031 function Flag218 (N : Node_Id) return Boolean is
4033 pragma Assert (Nkind (N) in N_Entity);
4034 return Nodes.Table (N + 4).Rewrite_Ins;
4037 function Flag219 (N : Node_Id) return Boolean is
4039 pragma Assert (Nkind (N) in N_Entity);
4040 return Nodes.Table (N + 4).Analyzed;
4043 function Flag220 (N : Node_Id) return Boolean is
4045 pragma Assert (Nkind (N) in N_Entity);
4046 return Nodes.Table (N + 4).Comes_From_Source;
4049 function Flag221 (N : Node_Id) return Boolean is
4051 pragma Assert (Nkind (N) in N_Entity);
4052 return Nodes.Table (N + 4).Error_Posted;
4055 function Flag222 (N : Node_Id) return Boolean is
4057 pragma Assert (Nkind (N) in N_Entity);
4058 return Nodes.Table (N + 4).Flag4;
4061 function Flag223 (N : Node_Id) return Boolean is
4063 pragma Assert (Nkind (N) in N_Entity);
4064 return Nodes.Table (N + 4).Flag5;
4067 function Flag224 (N : Node_Id) return Boolean is
4069 pragma Assert (Nkind (N) in N_Entity);
4070 return Nodes.Table (N + 4).Flag6;
4073 function Flag225 (N : Node_Id) return Boolean is
4075 pragma Assert (Nkind (N) in N_Entity);
4076 return Nodes.Table (N + 4).Flag7;
4079 function Flag226 (N : Node_Id) return Boolean is
4081 pragma Assert (Nkind (N) in N_Entity);
4082 return Nodes.Table (N + 4).Flag8;
4085 function Flag227 (N : Node_Id) return Boolean is
4087 pragma Assert (Nkind (N) in N_Entity);
4088 return Nodes.Table (N + 4).Flag9;
4091 function Flag228 (N : Node_Id) return Boolean is
4093 pragma Assert (Nkind (N) in N_Entity);
4094 return Nodes.Table (N + 4).Flag10;
4097 function Flag229 (N : Node_Id) return Boolean is
4099 pragma Assert (Nkind (N) in N_Entity);
4100 return Nodes.Table (N + 4).Flag11;
4103 function Flag230 (N : Node_Id) return Boolean is
4105 pragma Assert (Nkind (N) in N_Entity);
4106 return Nodes.Table (N + 4).Flag12;
4109 function Flag231 (N : Node_Id) return Boolean is
4111 pragma Assert (Nkind (N) in N_Entity);
4112 return Nodes.Table (N + 4).Flag13;
4115 function Flag232 (N : Node_Id) return Boolean is
4117 pragma Assert (Nkind (N) in N_Entity);
4118 return Nodes.Table (N + 4).Flag14;
4121 function Flag233 (N : Node_Id) return Boolean is
4123 pragma Assert (Nkind (N) in N_Entity);
4124 return Nodes.Table (N + 4).Flag15;
4127 function Flag234 (N : Node_Id) return Boolean is
4129 pragma Assert (Nkind (N) in N_Entity);
4130 return Nodes.Table (N + 4).Flag16;
4133 function Flag235 (N : Node_Id) return Boolean is
4135 pragma Assert (Nkind (N) in N_Entity);
4136 return Nodes.Table (N + 4).Flag17;
4139 function Flag236 (N : Node_Id) return Boolean is
4141 pragma Assert (Nkind (N) in N_Entity);
4142 return Nodes.Table (N + 4).Flag18;
4145 function Flag237 (N : Node_Id) return Boolean is
4147 pragma Assert (Nkind (N) in N_Entity);
4148 return Nodes.Table (N + 4).Pflag1;
4151 function Flag238 (N : Node_Id) return Boolean is
4153 pragma Assert (Nkind (N) in N_Entity);
4154 return Nodes.Table (N + 4).Pflag2;
4157 function Flag239 (N : Node_Id) return Boolean is
4159 pragma Assert (Nkind (N) in N_Entity);
4160 return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag239;
4163 function Flag240 (N : Node_Id) return Boolean is
4165 pragma Assert (Nkind (N) in N_Entity);
4166 return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag240;
4169 function Flag241 (N : Node_Id) return Boolean is
4171 pragma Assert (Nkind (N) in N_Entity);
4172 return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag241;
4175 function Flag242 (N : Node_Id) return Boolean is
4177 pragma Assert (Nkind (N) in N_Entity);
4178 return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag242;
4181 function Flag243 (N : Node_Id) return Boolean is
4183 pragma Assert (Nkind (N) in N_Entity);
4184 return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag243;
4187 function Flag244 (N : Node_Id) return Boolean is
4189 pragma Assert (Nkind (N) in N_Entity);
4190 return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag244;
4193 function Flag245 (N : Node_Id) return Boolean is
4195 pragma Assert (Nkind (N) in N_Entity);
4196 return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag245;
4199 function Flag246 (N : Node_Id) return Boolean is
4201 pragma Assert (Nkind (N) in N_Entity);
4202 return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag246;
4205 function Flag247 (N : Node_Id) return Boolean is
4207 pragma Assert (Nkind (N) in N_Entity);
4208 return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag247;
4211 function Flag248 (N : Node_Id) return Boolean is
4213 pragma Assert (Nkind (N) in N_Entity);
4214 return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag248;
4217 function Flag249 (N : Node_Id) return Boolean is
4219 pragma Assert (Nkind (N) in N_Entity);
4220 return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag249;
4223 function Flag250 (N : Node_Id) return Boolean is
4225 pragma Assert (Nkind (N) in N_Entity);
4226 return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag250;
4229 function Flag251 (N : Node_Id) return Boolean is
4231 pragma Assert (Nkind (N) in N_Entity);
4232 return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag251;
4235 function Flag252 (N : Node_Id) return Boolean is
4237 pragma Assert (Nkind (N) in N_Entity);
4238 return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag252;
4241 function Flag253 (N : Node_Id) return Boolean is
4243 pragma Assert (Nkind (N) in N_Entity);
4244 return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag253;
4247 function Flag254 (N : Node_Id) return Boolean is
4249 pragma Assert (Nkind (N) in N_Entity);
4250 return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag254;
4253 procedure Set_Nkind (N : Node_Id; Val : Node_Kind) is
4255 pragma Assert (N <= Nodes.Last);
4256 Nodes.Table (N).Nkind := Val;
4259 procedure Set_Field1 (N : Node_Id; Val : Union_Id) is
4261 pragma Assert (N <= Nodes.Last);
4262 Nodes.Table (N).Field1 := Val;
4265 procedure Set_Field2 (N : Node_Id; Val : Union_Id) is
4267 pragma Assert (N <= Nodes.Last);
4268 Nodes.Table (N).Field2 := Val;
4271 procedure Set_Field3 (N : Node_Id; Val : Union_Id) is
4273 pragma Assert (N <= Nodes.Last);
4274 Nodes.Table (N).Field3 := Val;
4277 procedure Set_Field4 (N : Node_Id; Val : Union_Id) is
4279 pragma Assert (N <= Nodes.Last);
4280 Nodes.Table (N).Field4 := Val;
4283 procedure Set_Field5 (N : Node_Id; Val : Union_Id) is
4285 pragma Assert (N <= Nodes.Last);
4286 Nodes.Table (N).Field5 := Val;
4289 procedure Set_Field6 (N : Node_Id; Val : Union_Id) is
4291 pragma Assert (Nkind (N) in N_Entity);
4292 Nodes.Table (N + 1).Field6 := Val;
4295 procedure Set_Field7 (N : Node_Id; Val : Union_Id) is
4297 pragma Assert (Nkind (N) in N_Entity);
4298 Nodes.Table (N + 1).Field7 := Val;
4301 procedure Set_Field8 (N : Node_Id; Val : Union_Id) is
4303 pragma Assert (Nkind (N) in N_Entity);
4304 Nodes.Table (N + 1).Field8 := Val;
4307 procedure Set_Field9 (N : Node_Id; Val : Union_Id) is
4309 pragma Assert (Nkind (N) in N_Entity);
4310 Nodes.Table (N + 1).Field9 := Val;
4313 procedure Set_Field10 (N : Node_Id; Val : Union_Id) is
4315 pragma Assert (Nkind (N) in N_Entity);
4316 Nodes.Table (N + 1).Field10 := Val;
4319 procedure Set_Field11 (N : Node_Id; Val : Union_Id) is
4321 pragma Assert (Nkind (N) in N_Entity);
4322 Nodes.Table (N + 1).Field11 := Val;
4325 procedure Set_Field12 (N : Node_Id; Val : Union_Id) is
4327 pragma Assert (Nkind (N) in N_Entity);
4328 Nodes.Table (N + 1).Field12 := Val;
4331 procedure Set_Field13 (N : Node_Id; Val : Union_Id) is
4333 pragma Assert (Nkind (N) in N_Entity);
4334 Nodes.Table (N + 2).Field6 := Val;
4337 procedure Set_Field14 (N : Node_Id; Val : Union_Id) is
4339 pragma Assert (Nkind (N) in N_Entity);
4340 Nodes.Table (N + 2).Field7 := Val;
4343 procedure Set_Field15 (N : Node_Id; Val : Union_Id) is
4345 pragma Assert (Nkind (N) in N_Entity);
4346 Nodes.Table (N + 2).Field8 := Val;
4349 procedure Set_Field16 (N : Node_Id; Val : Union_Id) is
4351 pragma Assert (Nkind (N) in N_Entity);
4352 Nodes.Table (N + 2).Field9 := Val;
4355 procedure Set_Field17 (N : Node_Id; Val : Union_Id) is
4357 pragma Assert (Nkind (N) in N_Entity);
4358 Nodes.Table (N + 2).Field10 := Val;
4361 procedure Set_Field18 (N : Node_Id; Val : Union_Id) is
4363 pragma Assert (Nkind (N) in N_Entity);
4364 Nodes.Table (N + 2).Field11 := Val;
4367 procedure Set_Field19 (N : Node_Id; Val : Union_Id) is
4369 pragma Assert (Nkind (N) in N_Entity);
4370 Nodes.Table (N + 3).Field6 := Val;
4373 procedure Set_Field20 (N : Node_Id; Val : Union_Id) is
4375 pragma Assert (Nkind (N) in N_Entity);
4376 Nodes.Table (N + 3).Field7 := Val;
4379 procedure Set_Field21 (N : Node_Id; Val : Union_Id) is
4381 pragma Assert (Nkind (N) in N_Entity);
4382 Nodes.Table (N + 3).Field8 := Val;
4385 procedure Set_Field22 (N : Node_Id; Val : Union_Id) is
4387 pragma Assert (Nkind (N) in N_Entity);
4388 Nodes.Table (N + 3).Field9 := Val;
4391 procedure Set_Field23 (N : Node_Id; Val : Union_Id) is
4393 pragma Assert (Nkind (N) in N_Entity);
4394 Nodes.Table (N + 3).Field10 := Val;
4397 procedure Set_Field24 (N : Node_Id; Val : Union_Id) is
4399 pragma Assert (Nkind (N) in N_Entity);
4400 Nodes.Table (N + 4).Field6 := Val;
4403 procedure Set_Field25 (N : Node_Id; Val : Union_Id) is
4405 pragma Assert (Nkind (N) in N_Entity);
4406 Nodes.Table (N + 4).Field7 := Val;
4409 procedure Set_Field26 (N : Node_Id; Val : Union_Id) is
4411 pragma Assert (Nkind (N) in N_Entity);
4412 Nodes.Table (N + 4).Field8 := Val;
4415 procedure Set_Field27 (N : Node_Id; Val : Union_Id) is
4417 pragma Assert (Nkind (N) in N_Entity);
4418 Nodes.Table (N + 4).Field9 := Val;
4421 procedure Set_Field28 (N : Node_Id; Val : Union_Id) is
4423 pragma Assert (Nkind (N) in N_Entity);
4424 Nodes.Table (N + 4).Field10 := Val;
4427 procedure Set_Field29 (N : Node_Id; Val : Union_Id) is
4429 pragma Assert (Nkind (N) in N_Entity);
4430 Nodes.Table (N + 4).Field11 := Val;
4433 procedure Set_Node1 (N : Node_Id; Val : Node_Id) is
4435 pragma Assert (N <= Nodes.Last);
4436 Nodes.Table (N).Field1 := Union_Id (Val);
4439 procedure Set_Node2 (N : Node_Id; Val : Node_Id) is
4441 pragma Assert (N <= Nodes.Last);
4442 Nodes.Table (N).Field2 := Union_Id (Val);
4445 procedure Set_Node3 (N : Node_Id; Val : Node_Id) is
4447 pragma Assert (N <= Nodes.Last);
4448 Nodes.Table (N).Field3 := Union_Id (Val);
4451 procedure Set_Node4 (N : Node_Id; Val : Node_Id) is
4453 pragma Assert (N <= Nodes.Last);
4454 Nodes.Table (N).Field4 := Union_Id (Val);
4457 procedure Set_Node5 (N : Node_Id; Val : Node_Id) is
4459 pragma Assert (N <= Nodes.Last);
4460 Nodes.Table (N).Field5 := Union_Id (Val);
4463 procedure Set_Node6 (N : Node_Id; Val : Node_Id) is
4465 pragma Assert (Nkind (N) in N_Entity);
4466 Nodes.Table (N + 1).Field6 := Union_Id (Val);
4469 procedure Set_Node7 (N : Node_Id; Val : Node_Id) is
4471 pragma Assert (Nkind (N) in N_Entity);
4472 Nodes.Table (N + 1).Field7 := Union_Id (Val);
4475 procedure Set_Node8 (N : Node_Id; Val : Node_Id) is
4477 pragma Assert (Nkind (N) in N_Entity);
4478 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4481 procedure Set_Node9 (N : Node_Id; Val : Node_Id) is
4483 pragma Assert (Nkind (N) in N_Entity);
4484 Nodes.Table (N + 1).Field9 := Union_Id (Val);
4487 procedure Set_Node10 (N : Node_Id; Val : Node_Id) is
4489 pragma Assert (Nkind (N) in N_Entity);
4490 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4493 procedure Set_Node11 (N : Node_Id; Val : Node_Id) is
4495 pragma Assert (Nkind (N) in N_Entity);
4496 Nodes.Table (N + 1).Field11 := Union_Id (Val);
4499 procedure Set_Node12 (N : Node_Id; Val : Node_Id) is
4501 pragma Assert (Nkind (N) in N_Entity);
4502 Nodes.Table (N + 1).Field12 := Union_Id (Val);
4505 procedure Set_Node13 (N : Node_Id; Val : Node_Id) is
4507 pragma Assert (Nkind (N) in N_Entity);
4508 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4511 procedure Set_Node14 (N : Node_Id; Val : Node_Id) is
4513 pragma Assert (Nkind (N) in N_Entity);
4514 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4517 procedure Set_Node15 (N : Node_Id; Val : Node_Id) is
4519 pragma Assert (Nkind (N) in N_Entity);
4520 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4523 procedure Set_Node16 (N : Node_Id; Val : Node_Id) is
4525 pragma Assert (Nkind (N) in N_Entity);
4526 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4529 procedure Set_Node17 (N : Node_Id; Val : Node_Id) is
4531 pragma Assert (Nkind (N) in N_Entity);
4532 Nodes.Table (N + 2).Field10 := Union_Id (Val);
4535 procedure Set_Node18 (N : Node_Id; Val : Node_Id) is
4537 pragma Assert (Nkind (N) in N_Entity);
4538 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4541 procedure Set_Node19 (N : Node_Id; Val : Node_Id) is
4543 pragma Assert (Nkind (N) in N_Entity);
4544 Nodes.Table (N + 3).Field6 := Union_Id (Val);
4547 procedure Set_Node20 (N : Node_Id; Val : Node_Id) is
4549 pragma Assert (Nkind (N) in N_Entity);
4550 Nodes.Table (N + 3).Field7 := Union_Id (Val);
4553 procedure Set_Node21 (N : Node_Id; Val : Node_Id) is
4555 pragma Assert (Nkind (N) in N_Entity);
4556 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4559 procedure Set_Node22 (N : Node_Id; Val : Node_Id) is
4561 pragma Assert (Nkind (N) in N_Entity);
4562 Nodes.Table (N + 3).Field9 := Union_Id (Val);
4565 procedure Set_Node23 (N : Node_Id; Val : Node_Id) is
4567 pragma Assert (Nkind (N) in N_Entity);
4568 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4571 procedure Set_Node24 (N : Node_Id; Val : Node_Id) is
4573 pragma Assert (Nkind (N) in N_Entity);
4574 Nodes.Table (N + 4).Field6 := Union_Id (Val);
4577 procedure Set_Node25 (N : Node_Id; Val : Node_Id) is
4579 pragma Assert (Nkind (N) in N_Entity);
4580 Nodes.Table (N + 4).Field7 := Union_Id (Val);
4583 procedure Set_Node26 (N : Node_Id; Val : Node_Id) is
4585 pragma Assert (Nkind (N) in N_Entity);
4586 Nodes.Table (N + 4).Field8 := Union_Id (Val);
4589 procedure Set_Node27 (N : Node_Id; Val : Node_Id) is
4591 pragma Assert (Nkind (N) in N_Entity);
4592 Nodes.Table (N + 4).Field9 := Union_Id (Val);
4595 procedure Set_Node28 (N : Node_Id; Val : Node_Id) is
4597 pragma Assert (Nkind (N) in N_Entity);
4598 Nodes.Table (N + 4).Field10 := Union_Id (Val);
4601 procedure Set_Node29 (N : Node_Id; Val : Node_Id) is
4603 pragma Assert (Nkind (N) in N_Entity);
4604 Nodes.Table (N + 4).Field11 := Union_Id (Val);
4607 procedure Set_List1 (N : Node_Id; Val : List_Id) is
4609 pragma Assert (N <= Nodes.Last);
4610 Nodes.Table (N).Field1 := Union_Id (Val);
4613 procedure Set_List2 (N : Node_Id; Val : List_Id) is
4615 pragma Assert (N <= Nodes.Last);
4616 Nodes.Table (N).Field2 := Union_Id (Val);
4619 procedure Set_List3 (N : Node_Id; Val : List_Id) is
4621 pragma Assert (N <= Nodes.Last);
4622 Nodes.Table (N).Field3 := Union_Id (Val);
4625 procedure Set_List4 (N : Node_Id; Val : List_Id) is
4627 pragma Assert (N <= Nodes.Last);
4628 Nodes.Table (N).Field4 := Union_Id (Val);
4631 procedure Set_List5 (N : Node_Id; Val : List_Id) is
4633 pragma Assert (N <= Nodes.Last);
4634 Nodes.Table (N).Field5 := Union_Id (Val);
4637 procedure Set_List10 (N : Node_Id; Val : List_Id) is
4639 pragma Assert (Nkind (N) in N_Entity);
4640 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4643 procedure Set_List14 (N : Node_Id; Val : List_Id) is
4645 pragma Assert (Nkind (N) in N_Entity);
4646 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4649 procedure Set_Elist1 (N : Node_Id; Val : Elist_Id) is
4651 Nodes.Table (N).Field1 := Union_Id (Val);
4654 procedure Set_Elist2 (N : Node_Id; Val : Elist_Id) is
4656 Nodes.Table (N).Field2 := Union_Id (Val);
4659 procedure Set_Elist3 (N : Node_Id; Val : Elist_Id) is
4661 Nodes.Table (N).Field3 := Union_Id (Val);
4664 procedure Set_Elist4 (N : Node_Id; Val : Elist_Id) is
4666 Nodes.Table (N).Field4 := Union_Id (Val);
4669 procedure Set_Elist8 (N : Node_Id; Val : Elist_Id) is
4671 pragma Assert (Nkind (N) in N_Entity);
4672 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4675 procedure Set_Elist13 (N : Node_Id; Val : Elist_Id) is
4677 pragma Assert (Nkind (N) in N_Entity);
4678 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4681 procedure Set_Elist15 (N : Node_Id; Val : Elist_Id) is
4683 pragma Assert (Nkind (N) in N_Entity);
4684 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4687 procedure Set_Elist16 (N : Node_Id; Val : Elist_Id) is
4689 pragma Assert (Nkind (N) in N_Entity);
4690 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4693 procedure Set_Elist18 (N : Node_Id; Val : Elist_Id) is
4695 pragma Assert (Nkind (N) in N_Entity);
4696 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4699 procedure Set_Elist21 (N : Node_Id; Val : Elist_Id) is
4701 pragma Assert (Nkind (N) in N_Entity);
4702 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4705 procedure Set_Elist23 (N : Node_Id; Val : Elist_Id) is
4707 pragma Assert (Nkind (N) in N_Entity);
4708 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4711 procedure Set_Elist25 (N : Node_Id; Val : Elist_Id) is
4713 pragma Assert (Nkind (N) in N_Entity);
4714 Nodes.Table (N + 4).Field7 := Union_Id (Val);
4717 procedure Set_Elist26 (N : Node_Id; Val : Elist_Id) is
4719 pragma Assert (Nkind (N) in N_Entity);
4720 Nodes.Table (N + 4).Field8 := Union_Id (Val);
4723 procedure Set_Name1 (N : Node_Id; Val : Name_Id) is
4725 pragma Assert (N <= Nodes.Last);
4726 Nodes.Table (N).Field1 := Union_Id (Val);
4729 procedure Set_Name2 (N : Node_Id; Val : Name_Id) is
4731 pragma Assert (N <= Nodes.Last);
4732 Nodes.Table (N).Field2 := Union_Id (Val);
4735 procedure Set_Str3 (N : Node_Id; Val : String_Id) is
4737 pragma Assert (N <= Nodes.Last);
4738 Nodes.Table (N).Field3 := Union_Id (Val);
4741 procedure Set_Uint2 (N : Node_Id; Val : Uint) is
4743 pragma Assert (N <= Nodes.Last);
4744 Nodes.Table (N).Field2 := To_Union (Val);
4747 procedure Set_Uint3 (N : Node_Id; Val : Uint) is
4749 pragma Assert (N <= Nodes.Last);
4750 Nodes.Table (N).Field3 := To_Union (Val);
4753 procedure Set_Uint4 (N : Node_Id; Val : Uint) is
4755 pragma Assert (N <= Nodes.Last);
4756 Nodes.Table (N).Field4 := To_Union (Val);
4759 procedure Set_Uint5 (N : Node_Id; Val : Uint) is
4761 pragma Assert (N <= Nodes.Last);
4762 Nodes.Table (N).Field5 := To_Union (Val);
4765 procedure Set_Uint8 (N : Node_Id; Val : Uint) is
4767 pragma Assert (Nkind (N) in N_Entity);
4768 Nodes.Table (N + 1).Field8 := To_Union (Val);
4771 procedure Set_Uint9 (N : Node_Id; Val : Uint) is
4773 pragma Assert (Nkind (N) in N_Entity);
4774 Nodes.Table (N + 1).Field9 := To_Union (Val);
4777 procedure Set_Uint10 (N : Node_Id; Val : Uint) is
4779 pragma Assert (Nkind (N) in N_Entity);
4780 Nodes.Table (N + 1).Field10 := To_Union (Val);
4783 procedure Set_Uint11 (N : Node_Id; Val : Uint) is
4785 pragma Assert (Nkind (N) in N_Entity);
4786 Nodes.Table (N + 1).Field11 := To_Union (Val);
4789 procedure Set_Uint12 (N : Node_Id; Val : Uint) is
4791 pragma Assert (Nkind (N) in N_Entity);
4792 Nodes.Table (N + 1).Field12 := To_Union (Val);
4795 procedure Set_Uint13 (N : Node_Id; Val : Uint) is
4797 pragma Assert (Nkind (N) in N_Entity);
4798 Nodes.Table (N + 2).Field6 := To_Union (Val);
4801 procedure Set_Uint14 (N : Node_Id; Val : Uint) is
4803 pragma Assert (Nkind (N) in N_Entity);
4804 Nodes.Table (N + 2).Field7 := To_Union (Val);
4807 procedure Set_Uint15 (N : Node_Id; Val : Uint) is
4809 pragma Assert (Nkind (N) in N_Entity);
4810 Nodes.Table (N + 2).Field8 := To_Union (Val);
4813 procedure Set_Uint16 (N : Node_Id; Val : Uint) is
4815 pragma Assert (Nkind (N) in N_Entity);
4816 Nodes.Table (N + 2).Field9 := To_Union (Val);
4819 procedure Set_Uint17 (N : Node_Id; Val : Uint) is
4821 pragma Assert (Nkind (N) in N_Entity);
4822 Nodes.Table (N + 2).Field10 := To_Union (Val);
4825 procedure Set_Uint22 (N : Node_Id; Val : Uint) is
4827 pragma Assert (Nkind (N) in N_Entity);
4828 Nodes.Table (N + 3).Field9 := To_Union (Val);
4831 procedure Set_Ureal3 (N : Node_Id; Val : Ureal) is
4833 pragma Assert (N <= Nodes.Last);
4834 Nodes.Table (N).Field3 := To_Union (Val);
4837 procedure Set_Ureal18 (N : Node_Id; Val : Ureal) is
4839 pragma Assert (Nkind (N) in N_Entity);
4840 Nodes.Table (N + 2).Field11 := To_Union (Val);
4843 procedure Set_Ureal21 (N : Node_Id; Val : Ureal) is
4845 pragma Assert (Nkind (N) in N_Entity);
4846 Nodes.Table (N + 3).Field8 := To_Union (Val);
4849 procedure Set_Flag4 (N : Node_Id; Val : Boolean) is
4851 pragma Assert (N <= Nodes.Last);
4852 Nodes.Table (N).Flag4 := Val;
4855 procedure Set_Flag5 (N : Node_Id; Val : Boolean) is
4857 pragma Assert (N <= Nodes.Last);
4858 Nodes.Table (N).Flag5 := Val;
4861 procedure Set_Flag6 (N : Node_Id; Val : Boolean) is
4863 pragma Assert (N <= Nodes.Last);
4864 Nodes.Table (N).Flag6 := Val;
4867 procedure Set_Flag7 (N : Node_Id; Val : Boolean) is
4869 pragma Assert (N <= Nodes.Last);
4870 Nodes.Table (N).Flag7 := Val;
4873 procedure Set_Flag8 (N : Node_Id; Val : Boolean) is
4875 pragma Assert (N <= Nodes.Last);
4876 Nodes.Table (N).Flag8 := Val;
4879 procedure Set_Flag9 (N : Node_Id; Val : Boolean) is
4881 pragma Assert (N <= Nodes.Last);
4882 Nodes.Table (N).Flag9 := Val;
4885 procedure Set_Flag10 (N : Node_Id; Val : Boolean) is
4887 pragma Assert (N <= Nodes.Last);
4888 Nodes.Table (N).Flag10 := Val;
4891 procedure Set_Flag11 (N : Node_Id; Val : Boolean) is
4893 pragma Assert (N <= Nodes.Last);
4894 Nodes.Table (N).Flag11 := Val;
4897 procedure Set_Flag12 (N : Node_Id; Val : Boolean) is
4899 pragma Assert (N <= Nodes.Last);
4900 Nodes.Table (N).Flag12 := Val;
4903 procedure Set_Flag13 (N : Node_Id; Val : Boolean) is
4905 pragma Assert (N <= Nodes.Last);
4906 Nodes.Table (N).Flag13 := Val;
4909 procedure Set_Flag14 (N : Node_Id; Val : Boolean) is
4911 pragma Assert (N <= Nodes.Last);
4912 Nodes.Table (N).Flag14 := Val;
4915 procedure Set_Flag15 (N : Node_Id; Val : Boolean) is
4917 pragma Assert (N <= Nodes.Last);
4918 Nodes.Table (N).Flag15 := Val;
4921 procedure Set_Flag16 (N : Node_Id; Val : Boolean) is
4923 pragma Assert (N <= Nodes.Last);
4924 Nodes.Table (N).Flag16 := Val;
4927 procedure Set_Flag17 (N : Node_Id; Val : Boolean) is
4929 pragma Assert (N <= Nodes.Last);
4930 Nodes.Table (N).Flag17 := Val;
4933 procedure Set_Flag18 (N : Node_Id; Val : Boolean) is
4935 pragma Assert (N <= Nodes.Last);
4936 Nodes.Table (N).Flag18 := Val;
4939 procedure Set_Flag19 (N : Node_Id; Val : Boolean) is
4941 pragma Assert (Nkind (N) in N_Entity);
4942 Nodes.Table (N + 1).In_List := Val;
4945 procedure Set_Flag20 (N : Node_Id; Val : Boolean) is
4947 pragma Assert (Nkind (N) in N_Entity);
4948 Nodes.Table (N + 1).Has_Aspects := Val;
4951 procedure Set_Flag21 (N : Node_Id; Val : Boolean) is
4953 pragma Assert (Nkind (N) in N_Entity);
4954 Nodes.Table (N + 1).Rewrite_Ins := Val;
4957 procedure Set_Flag22 (N : Node_Id; Val : Boolean) is
4959 pragma Assert (Nkind (N) in N_Entity);
4960 Nodes.Table (N + 1).Analyzed := Val;
4963 procedure Set_Flag23 (N : Node_Id; Val : Boolean) is
4965 pragma Assert (Nkind (N) in N_Entity);
4966 Nodes.Table (N + 1).Comes_From_Source := Val;
4969 procedure Set_Flag24 (N : Node_Id; Val : Boolean) is
4971 pragma Assert (Nkind (N) in N_Entity);
4972 Nodes.Table (N + 1).Error_Posted := Val;
4975 procedure Set_Flag25 (N : Node_Id; Val : Boolean) is
4977 pragma Assert (Nkind (N) in N_Entity);
4978 Nodes.Table (N + 1).Flag4 := Val;
4981 procedure Set_Flag26 (N : Node_Id; Val : Boolean) is
4983 pragma Assert (Nkind (N) in N_Entity);
4984 Nodes.Table (N + 1).Flag5 := Val;
4987 procedure Set_Flag27 (N : Node_Id; Val : Boolean) is
4989 pragma Assert (Nkind (N) in N_Entity);
4990 Nodes.Table (N + 1).Flag6 := Val;
4993 procedure Set_Flag28 (N : Node_Id; Val : Boolean) is
4995 pragma Assert (Nkind (N) in N_Entity);
4996 Nodes.Table (N + 1).Flag7 := Val;
4999 procedure Set_Flag29 (N : Node_Id; Val : Boolean) is
5001 pragma Assert (Nkind (N) in N_Entity);
5002 Nodes.Table (N + 1).Flag8 := Val;
5005 procedure Set_Flag30 (N : Node_Id; Val : Boolean) is
5007 pragma Assert (Nkind (N) in N_Entity);
5008 Nodes.Table (N + 1).Flag9 := Val;
5011 procedure Set_Flag31 (N : Node_Id; Val : Boolean) is
5013 pragma Assert (Nkind (N) in N_Entity);
5014 Nodes.Table (N + 1).Flag10 := Val;
5017 procedure Set_Flag32 (N : Node_Id; Val : Boolean) is
5019 pragma Assert (Nkind (N) in N_Entity);
5020 Nodes.Table (N + 1).Flag11 := Val;
5023 procedure Set_Flag33 (N : Node_Id; Val : Boolean) is
5025 pragma Assert (Nkind (N) in N_Entity);
5026 Nodes.Table (N + 1).Flag12 := Val;
5029 procedure Set_Flag34 (N : Node_Id; Val : Boolean) is
5031 pragma Assert (Nkind (N) in N_Entity);
5032 Nodes.Table (N + 1).Flag13 := Val;
5035 procedure Set_Flag35 (N : Node_Id; Val : Boolean) is
5037 pragma Assert (Nkind (N) in N_Entity);
5038 Nodes.Table (N + 1).Flag14 := Val;
5041 procedure Set_Flag36 (N : Node_Id; Val : Boolean) is
5043 pragma Assert (Nkind (N) in N_Entity);
5044 Nodes.Table (N + 1).Flag15 := Val;
5047 procedure Set_Flag37 (N : Node_Id; Val : Boolean) is
5049 pragma Assert (Nkind (N) in N_Entity);
5050 Nodes.Table (N + 1).Flag16 := Val;
5053 procedure Set_Flag38 (N : Node_Id; Val : Boolean) is
5055 pragma Assert (Nkind (N) in N_Entity);
5056 Nodes.Table (N + 1).Flag17 := Val;
5059 procedure Set_Flag39 (N : Node_Id; Val : Boolean) is
5061 pragma Assert (Nkind (N) in N_Entity);
5062 Nodes.Table (N + 1).Flag18 := Val;
5065 procedure Set_Flag40 (N : Node_Id; Val : Boolean) is
5067 pragma Assert (Nkind (N) in N_Entity);
5068 Nodes.Table (N + 2).In_List := Val;
5071 procedure Set_Flag41 (N : Node_Id; Val : Boolean) is
5073 pragma Assert (Nkind (N) in N_Entity);
5074 Nodes.Table (N + 2).Has_Aspects := Val;
5077 procedure Set_Flag42 (N : Node_Id; Val : Boolean) is
5079 pragma Assert (Nkind (N) in N_Entity);
5080 Nodes.Table (N + 2).Rewrite_Ins := Val;
5083 procedure Set_Flag43 (N : Node_Id; Val : Boolean) is
5085 pragma Assert (Nkind (N) in N_Entity);
5086 Nodes.Table (N + 2).Analyzed := Val;
5089 procedure Set_Flag44 (N : Node_Id; Val : Boolean) is
5091 pragma Assert (Nkind (N) in N_Entity);
5092 Nodes.Table (N + 2).Comes_From_Source := Val;
5095 procedure Set_Flag45 (N : Node_Id; Val : Boolean) is
5097 pragma Assert (Nkind (N) in N_Entity);
5098 Nodes.Table (N + 2).Error_Posted := Val;
5101 procedure Set_Flag46 (N : Node_Id; Val : Boolean) is
5103 pragma Assert (Nkind (N) in N_Entity);
5104 Nodes.Table (N + 2).Flag4 := Val;
5107 procedure Set_Flag47 (N : Node_Id; Val : Boolean) is
5109 pragma Assert (Nkind (N) in N_Entity);
5110 Nodes.Table (N + 2).Flag5 := Val;
5113 procedure Set_Flag48 (N : Node_Id; Val : Boolean) is
5115 pragma Assert (Nkind (N) in N_Entity);
5116 Nodes.Table (N + 2).Flag6 := Val;
5119 procedure Set_Flag49 (N : Node_Id; Val : Boolean) is
5121 pragma Assert (Nkind (N) in N_Entity);
5122 Nodes.Table (N + 2).Flag7 := Val;
5125 procedure Set_Flag50 (N : Node_Id; Val : Boolean) is
5127 pragma Assert (Nkind (N) in N_Entity);
5128 Nodes.Table (N + 2).Flag8 := Val;
5131 procedure Set_Flag51 (N : Node_Id; Val : Boolean) is
5133 pragma Assert (Nkind (N) in N_Entity);
5134 Nodes.Table (N + 2).Flag9 := Val;
5137 procedure Set_Flag52 (N : Node_Id; Val : Boolean) is
5139 pragma Assert (Nkind (N) in N_Entity);
5140 Nodes.Table (N + 2).Flag10 := Val;
5143 procedure Set_Flag53 (N : Node_Id; Val : Boolean) is
5145 pragma Assert (Nkind (N) in N_Entity);
5146 Nodes.Table (N + 2).Flag11 := Val;
5149 procedure Set_Flag54 (N : Node_Id; Val : Boolean) is
5151 pragma Assert (Nkind (N) in N_Entity);
5152 Nodes.Table (N + 2).Flag12 := Val;
5155 procedure Set_Flag55 (N : Node_Id; Val : Boolean) is
5157 pragma Assert (Nkind (N) in N_Entity);
5158 Nodes.Table (N + 2).Flag13 := Val;
5161 procedure Set_Flag56 (N : Node_Id; Val : Boolean) is
5163 pragma Assert (Nkind (N) in N_Entity);
5164 Nodes.Table (N + 2).Flag14 := Val;
5167 procedure Set_Flag57 (N : Node_Id; Val : Boolean) is
5169 pragma Assert (Nkind (N) in N_Entity);
5170 Nodes.Table (N + 2).Flag15 := Val;
5173 procedure Set_Flag58 (N : Node_Id; Val : Boolean) is
5175 pragma Assert (Nkind (N) in N_Entity);
5176 Nodes.Table (N + 2).Flag16 := Val;
5179 procedure Set_Flag59 (N : Node_Id; Val : Boolean) is
5181 pragma Assert (Nkind (N) in N_Entity);
5182 Nodes.Table (N + 2).Flag17 := Val;
5185 procedure Set_Flag60 (N : Node_Id; Val : Boolean) is
5187 pragma Assert (Nkind (N) in N_Entity);
5188 Nodes.Table (N + 2).Flag18 := Val;
5191 procedure Set_Flag61 (N : Node_Id; Val : Boolean) is
5193 pragma Assert (Nkind (N) in N_Entity);
5194 Nodes.Table (N + 1).Pflag1 := Val;
5197 procedure Set_Flag62 (N : Node_Id; Val : Boolean) is
5199 pragma Assert (Nkind (N) in N_Entity);
5200 Nodes.Table (N + 1).Pflag2 := Val;
5203 procedure Set_Flag63 (N : Node_Id; Val : Boolean) is
5205 pragma Assert (Nkind (N) in N_Entity);
5206 Nodes.Table (N + 2).Pflag1 := Val;
5209 procedure Set_Flag64 (N : Node_Id; Val : Boolean) is
5211 pragma Assert (Nkind (N) in N_Entity);
5212 Nodes.Table (N + 2).Pflag2 := Val;
5215 procedure Set_Flag65 (N : Node_Id; Val : Boolean) is
5217 pragma Assert (Nkind (N) in N_Entity);
5220 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag65 := Val;
5223 procedure Set_Flag66 (N : Node_Id; Val : Boolean) is
5225 pragma Assert (Nkind (N) in N_Entity);
5228 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag66 := Val;
5231 procedure Set_Flag67 (N : Node_Id; Val : Boolean) is
5233 pragma Assert (Nkind (N) in N_Entity);
5236 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag67 := Val;
5239 procedure Set_Flag68 (N : Node_Id; Val : Boolean) is
5241 pragma Assert (Nkind (N) in N_Entity);
5244 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag68 := Val;
5247 procedure Set_Flag69 (N : Node_Id; Val : Boolean) is
5249 pragma Assert (Nkind (N) in N_Entity);
5252 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag69 := Val;
5255 procedure Set_Flag70 (N : Node_Id; Val : Boolean) is
5257 pragma Assert (Nkind (N) in N_Entity);
5260 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag70 := Val;
5263 procedure Set_Flag71 (N : Node_Id; Val : Boolean) is
5265 pragma Assert (Nkind (N) in N_Entity);
5268 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag71 := Val;
5271 procedure Set_Flag72 (N : Node_Id; Val : Boolean) is
5273 pragma Assert (Nkind (N) in N_Entity);
5276 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag72 := Val;
5279 procedure Set_Flag73 (N : Node_Id; Val : Boolean) is
5281 pragma Assert (Nkind (N) in N_Entity);
5284 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag73 := Val;
5287 procedure Set_Flag74 (N : Node_Id; Val : Boolean) is
5289 pragma Assert (Nkind (N) in N_Entity);
5292 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag74 := Val;
5295 procedure Set_Flag75 (N : Node_Id; Val : Boolean) is
5297 pragma Assert (Nkind (N) in N_Entity);
5300 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag75 := Val;
5303 procedure Set_Flag76 (N : Node_Id; Val : Boolean) is
5305 pragma Assert (Nkind (N) in N_Entity);
5308 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag76 := Val;
5311 procedure Set_Flag77 (N : Node_Id; Val : Boolean) is
5313 pragma Assert (Nkind (N) in N_Entity);
5316 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag77 := Val;
5319 procedure Set_Flag78 (N : Node_Id; Val : Boolean) is
5321 pragma Assert (Nkind (N) in N_Entity);
5324 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag78 := Val;
5327 procedure Set_Flag79 (N : Node_Id; Val : Boolean) is
5329 pragma Assert (Nkind (N) in N_Entity);
5332 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag79 := Val;
5335 procedure Set_Flag80 (N : Node_Id; Val : Boolean) is
5337 pragma Assert (Nkind (N) in N_Entity);
5340 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag80 := Val;
5343 procedure Set_Flag81 (N : Node_Id; Val : Boolean) is
5345 pragma Assert (Nkind (N) in N_Entity);
5348 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag81 := Val;
5351 procedure Set_Flag82 (N : Node_Id; Val : Boolean) is
5353 pragma Assert (Nkind (N) in N_Entity);
5356 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag82 := Val;
5359 procedure Set_Flag83 (N : Node_Id; Val : Boolean) is
5361 pragma Assert (Nkind (N) in N_Entity);
5364 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag83 := Val;
5367 procedure Set_Flag84 (N : Node_Id; Val : Boolean) is
5369 pragma Assert (Nkind (N) in N_Entity);
5372 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag84 := Val;
5375 procedure Set_Flag85 (N : Node_Id; Val : Boolean) is
5377 pragma Assert (Nkind (N) in N_Entity);
5380 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag85 := Val;
5383 procedure Set_Flag86 (N : Node_Id; Val : Boolean) is
5385 pragma Assert (Nkind (N) in N_Entity);
5388 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag86 := Val;
5391 procedure Set_Flag87 (N : Node_Id; Val : Boolean) is
5393 pragma Assert (Nkind (N) in N_Entity);
5396 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag87 := Val;
5399 procedure Set_Flag88 (N : Node_Id; Val : Boolean) is
5401 pragma Assert (Nkind (N) in N_Entity);
5404 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag88 := Val;
5407 procedure Set_Flag89 (N : Node_Id; Val : Boolean) is
5409 pragma Assert (Nkind (N) in N_Entity);
5412 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag89 := Val;
5415 procedure Set_Flag90 (N : Node_Id; Val : Boolean) is
5417 pragma Assert (Nkind (N) in N_Entity);
5420 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag90 := Val;
5423 procedure Set_Flag91 (N : Node_Id; Val : Boolean) is
5425 pragma Assert (Nkind (N) in N_Entity);
5428 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag91 := Val;
5431 procedure Set_Flag92 (N : Node_Id; Val : Boolean) is
5433 pragma Assert (Nkind (N) in N_Entity);
5436 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag92 := Val;
5439 procedure Set_Flag93 (N : Node_Id; Val : Boolean) is
5441 pragma Assert (Nkind (N) in N_Entity);
5444 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag93 := Val;
5447 procedure Set_Flag94 (N : Node_Id; Val : Boolean) is
5449 pragma Assert (Nkind (N) in N_Entity);
5452 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag94 := Val;
5455 procedure Set_Flag95 (N : Node_Id; Val : Boolean) is
5457 pragma Assert (Nkind (N) in N_Entity);
5460 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag95 := Val;
5463 procedure Set_Flag96 (N : Node_Id; Val : Boolean) is
5465 pragma Assert (Nkind (N) in N_Entity);
5468 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag96 := Val;
5471 procedure Set_Flag97 (N : Node_Id; Val : Boolean) is
5473 pragma Assert (Nkind (N) in N_Entity);
5476 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag97 := Val;
5479 procedure Set_Flag98 (N : Node_Id; Val : Boolean) is
5481 pragma Assert (Nkind (N) in N_Entity);
5484 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag98 := Val;
5487 procedure Set_Flag99 (N : Node_Id; Val : Boolean) is
5489 pragma Assert (Nkind (N) in N_Entity);
5492 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag99 := Val;
5495 procedure Set_Flag100 (N : Node_Id; Val : Boolean) is
5497 pragma Assert (Nkind (N) in N_Entity);
5500 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag100 := Val;
5503 procedure Set_Flag101 (N : Node_Id; Val : Boolean) is
5505 pragma Assert (Nkind (N) in N_Entity);
5508 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag101 := Val;
5511 procedure Set_Flag102 (N : Node_Id; Val : Boolean) is
5513 pragma Assert (Nkind (N) in N_Entity);
5516 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag102 := Val;
5519 procedure Set_Flag103 (N : Node_Id; Val : Boolean) is
5521 pragma Assert (Nkind (N) in N_Entity);
5524 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag103 := Val;
5527 procedure Set_Flag104 (N : Node_Id; Val : Boolean) is
5529 pragma Assert (Nkind (N) in N_Entity);
5532 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag104 := Val;
5535 procedure Set_Flag105 (N : Node_Id; Val : Boolean) is
5537 pragma Assert (Nkind (N) in N_Entity);
5540 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag105 := Val;
5543 procedure Set_Flag106 (N : Node_Id; Val : Boolean) is
5545 pragma Assert (Nkind (N) in N_Entity);
5548 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag106 := Val;
5551 procedure Set_Flag107 (N : Node_Id; Val : Boolean) is
5553 pragma Assert (Nkind (N) in N_Entity);
5556 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag107 := Val;
5559 procedure Set_Flag108 (N : Node_Id; Val : Boolean) is
5561 pragma Assert (Nkind (N) in N_Entity);
5564 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag108 := Val;
5567 procedure Set_Flag109 (N : Node_Id; Val : Boolean) is
5569 pragma Assert (Nkind (N) in N_Entity);
5572 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag109 := Val;
5575 procedure Set_Flag110 (N : Node_Id; Val : Boolean) is
5577 pragma Assert (Nkind (N) in N_Entity);
5580 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag110 := Val;
5583 procedure Set_Flag111 (N : Node_Id; Val : Boolean) is
5585 pragma Assert (Nkind (N) in N_Entity);
5588 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag111 := Val;
5591 procedure Set_Flag112 (N : Node_Id; Val : Boolean) is
5593 pragma Assert (Nkind (N) in N_Entity);
5596 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag112 := Val;
5599 procedure Set_Flag113 (N : Node_Id; Val : Boolean) is
5601 pragma Assert (Nkind (N) in N_Entity);
5604 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag113 := Val;
5607 procedure Set_Flag114 (N : Node_Id; Val : Boolean) is
5609 pragma Assert (Nkind (N) in N_Entity);
5612 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag114 := Val;
5615 procedure Set_Flag115 (N : Node_Id; Val : Boolean) is
5617 pragma Assert (Nkind (N) in N_Entity);
5620 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag115 := Val;
5623 procedure Set_Flag116 (N : Node_Id; Val : Boolean) is
5625 pragma Assert (Nkind (N) in N_Entity);
5628 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag116 := Val;
5631 procedure Set_Flag117 (N : Node_Id; Val : Boolean) is
5633 pragma Assert (Nkind (N) in N_Entity);
5636 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag117 := Val;
5639 procedure Set_Flag118 (N : Node_Id; Val : Boolean) is
5641 pragma Assert (Nkind (N) in N_Entity);
5644 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag118 := Val;
5647 procedure Set_Flag119 (N : Node_Id; Val : Boolean) is
5649 pragma Assert (Nkind (N) in N_Entity);
5652 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag119 := Val;
5655 procedure Set_Flag120 (N : Node_Id; Val : Boolean) is
5657 pragma Assert (Nkind (N) in N_Entity);
5660 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag120 := Val;
5663 procedure Set_Flag121 (N : Node_Id; Val : Boolean) is
5665 pragma Assert (Nkind (N) in N_Entity);
5668 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag121 := Val;
5671 procedure Set_Flag122 (N : Node_Id; Val : Boolean) is
5673 pragma Assert (Nkind (N) in N_Entity);
5676 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag122 := Val;
5679 procedure Set_Flag123 (N : Node_Id; Val : Boolean) is
5681 pragma Assert (Nkind (N) in N_Entity);
5684 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag123 := Val;
5687 procedure Set_Flag124 (N : Node_Id; Val : Boolean) is
5689 pragma Assert (Nkind (N) in N_Entity);
5692 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag124 := Val;
5695 procedure Set_Flag125 (N : Node_Id; Val : Boolean) is
5697 pragma Assert (Nkind (N) in N_Entity);
5700 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag125 := Val;
5703 procedure Set_Flag126 (N : Node_Id; Val : Boolean) is
5705 pragma Assert (Nkind (N) in N_Entity);
5708 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag126 := Val;
5711 procedure Set_Flag127 (N : Node_Id; Val : Boolean) is
5713 pragma Assert (Nkind (N) in N_Entity);
5716 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag127 := Val;
5719 procedure Set_Flag128 (N : Node_Id; Val : Boolean) is
5721 pragma Assert (Nkind (N) in N_Entity);
5724 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag128 := Val;
5727 procedure Set_Flag129 (N : Node_Id; Val : Boolean) is
5729 pragma Assert (Nkind (N) in N_Entity);
5730 Nodes.Table (N + 3).In_List := Val;
5733 procedure Set_Flag130 (N : Node_Id; Val : Boolean) is
5735 pragma Assert (Nkind (N) in N_Entity);
5736 Nodes.Table (N + 3).Has_Aspects := Val;
5739 procedure Set_Flag131 (N : Node_Id; Val : Boolean) is
5741 pragma Assert (Nkind (N) in N_Entity);
5742 Nodes.Table (N + 3).Rewrite_Ins := Val;
5745 procedure Set_Flag132 (N : Node_Id; Val : Boolean) is
5747 pragma Assert (Nkind (N) in N_Entity);
5748 Nodes.Table (N + 3).Analyzed := Val;
5751 procedure Set_Flag133 (N : Node_Id; Val : Boolean) is
5753 pragma Assert (Nkind (N) in N_Entity);
5754 Nodes.Table (N + 3).Comes_From_Source := Val;
5757 procedure Set_Flag134 (N : Node_Id; Val : Boolean) is
5759 pragma Assert (Nkind (N) in N_Entity);
5760 Nodes.Table (N + 3).Error_Posted := Val;
5763 procedure Set_Flag135 (N : Node_Id; Val : Boolean) is
5765 pragma Assert (Nkind (N) in N_Entity);
5766 Nodes.Table (N + 3).Flag4 := Val;
5769 procedure Set_Flag136 (N : Node_Id; Val : Boolean) is
5771 pragma Assert (Nkind (N) in N_Entity);
5772 Nodes.Table (N + 3).Flag5 := Val;
5775 procedure Set_Flag137 (N : Node_Id; Val : Boolean) is
5777 pragma Assert (Nkind (N) in N_Entity);
5778 Nodes.Table (N + 3).Flag6 := Val;
5781 procedure Set_Flag138 (N : Node_Id; Val : Boolean) is
5783 pragma Assert (Nkind (N) in N_Entity);
5784 Nodes.Table (N + 3).Flag7 := Val;
5787 procedure Set_Flag139 (N : Node_Id; Val : Boolean) is
5789 pragma Assert (Nkind (N) in N_Entity);
5790 Nodes.Table (N + 3).Flag8 := Val;
5793 procedure Set_Flag140 (N : Node_Id; Val : Boolean) is
5795 pragma Assert (Nkind (N) in N_Entity);
5796 Nodes.Table (N + 3).Flag9 := Val;
5799 procedure Set_Flag141 (N : Node_Id; Val : Boolean) is
5801 pragma Assert (Nkind (N) in N_Entity);
5802 Nodes.Table (N + 3).Flag10 := Val;
5805 procedure Set_Flag142 (N : Node_Id; Val : Boolean) is
5807 pragma Assert (Nkind (N) in N_Entity);
5808 Nodes.Table (N + 3).Flag11 := Val;
5811 procedure Set_Flag143 (N : Node_Id; Val : Boolean) is
5813 pragma Assert (Nkind (N) in N_Entity);
5814 Nodes.Table (N + 3).Flag12 := Val;
5817 procedure Set_Flag144 (N : Node_Id; Val : Boolean) is
5819 pragma Assert (Nkind (N) in N_Entity);
5820 Nodes.Table (N + 3).Flag13 := Val;
5823 procedure Set_Flag145 (N : Node_Id; Val : Boolean) is
5825 pragma Assert (Nkind (N) in N_Entity);
5826 Nodes.Table (N + 3).Flag14 := Val;
5829 procedure Set_Flag146 (N : Node_Id; Val : Boolean) is
5831 pragma Assert (Nkind (N) in N_Entity);
5832 Nodes.Table (N + 3).Flag15 := Val;
5835 procedure Set_Flag147 (N : Node_Id; Val : Boolean) is
5837 pragma Assert (Nkind (N) in N_Entity);
5838 Nodes.Table (N + 3).Flag16 := Val;
5841 procedure Set_Flag148 (N : Node_Id; Val : Boolean) is
5843 pragma Assert (Nkind (N) in N_Entity);
5844 Nodes.Table (N + 3).Flag17 := Val;
5847 procedure Set_Flag149 (N : Node_Id; Val : Boolean) is
5849 pragma Assert (Nkind (N) in N_Entity);
5850 Nodes.Table (N + 3).Flag18 := Val;
5853 procedure Set_Flag150 (N : Node_Id; Val : Boolean) is
5855 pragma Assert (Nkind (N) in N_Entity);
5856 Nodes.Table (N + 3).Pflag1 := Val;
5859 procedure Set_Flag151 (N : Node_Id; Val : Boolean) is
5861 pragma Assert (Nkind (N) in N_Entity);
5862 Nodes.Table (N + 3).Pflag2 := Val;
5865 procedure Set_Flag152 (N : Node_Id; Val : Boolean) is
5867 pragma Assert (Nkind (N) in N_Entity);
5870 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag152 := Val;
5873 procedure Set_Flag153 (N : Node_Id; Val : Boolean) is
5875 pragma Assert (Nkind (N) in N_Entity);
5878 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag153 := Val;
5881 procedure Set_Flag154 (N : Node_Id; Val : Boolean) is
5883 pragma Assert (Nkind (N) in N_Entity);
5886 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag154 := Val;
5889 procedure Set_Flag155 (N : Node_Id; Val : Boolean) is
5891 pragma Assert (Nkind (N) in N_Entity);
5894 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag155 := Val;
5897 procedure Set_Flag156 (N : Node_Id; Val : Boolean) is
5899 pragma Assert (Nkind (N) in N_Entity);
5902 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag156 := Val;
5905 procedure Set_Flag157 (N : Node_Id; Val : Boolean) is
5907 pragma Assert (Nkind (N) in N_Entity);
5910 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag157 := Val;
5913 procedure Set_Flag158 (N : Node_Id; Val : Boolean) is
5915 pragma Assert (Nkind (N) in N_Entity);
5918 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag158 := Val;
5921 procedure Set_Flag159 (N : Node_Id; Val : Boolean) is
5923 pragma Assert (Nkind (N) in N_Entity);
5926 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag159 := Val;
5929 procedure Set_Flag160 (N : Node_Id; Val : Boolean) is
5931 pragma Assert (Nkind (N) in N_Entity);
5934 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag160 := Val;
5937 procedure Set_Flag161 (N : Node_Id; Val : Boolean) is
5939 pragma Assert (Nkind (N) in N_Entity);
5942 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag161 := Val;
5945 procedure Set_Flag162 (N : Node_Id; Val : Boolean) is
5947 pragma Assert (Nkind (N) in N_Entity);
5950 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag162 := Val;
5953 procedure Set_Flag163 (N : Node_Id; Val : Boolean) is
5955 pragma Assert (Nkind (N) in N_Entity);
5958 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag163 := Val;
5961 procedure Set_Flag164 (N : Node_Id; Val : Boolean) is
5963 pragma Assert (Nkind (N) in N_Entity);
5966 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag164 := Val;
5969 procedure Set_Flag165 (N : Node_Id; Val : Boolean) is
5971 pragma Assert (Nkind (N) in N_Entity);
5974 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag165 := Val;
5977 procedure Set_Flag166 (N : Node_Id; Val : Boolean) is
5979 pragma Assert (Nkind (N) in N_Entity);
5982 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag166 := Val;
5985 procedure Set_Flag167 (N : Node_Id; Val : Boolean) is
5987 pragma Assert (Nkind (N) in N_Entity);
5990 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag167 := Val;
5993 procedure Set_Flag168 (N : Node_Id; Val : Boolean) is
5995 pragma Assert (Nkind (N) in N_Entity);
5998 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag168 := Val;
6001 procedure Set_Flag169 (N : Node_Id; Val : Boolean) is
6003 pragma Assert (Nkind (N) in N_Entity);
6006 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag169 := Val;
6009 procedure Set_Flag170 (N : Node_Id; Val : Boolean) is
6011 pragma Assert (Nkind (N) in N_Entity);
6014 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag170 := Val;
6017 procedure Set_Flag171 (N : Node_Id; Val : Boolean) is
6019 pragma Assert (Nkind (N) in N_Entity);
6022 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag171 := Val;
6025 procedure Set_Flag172 (N : Node_Id; Val : Boolean) is
6027 pragma Assert (Nkind (N) in N_Entity);
6030 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag172 := Val;
6033 procedure Set_Flag173 (N : Node_Id; Val : Boolean) is
6035 pragma Assert (Nkind (N) in N_Entity);
6038 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag173 := Val;
6041 procedure Set_Flag174 (N : Node_Id; Val : Boolean) is
6043 pragma Assert (Nkind (N) in N_Entity);
6046 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag174 := Val;
6049 procedure Set_Flag175 (N : Node_Id; Val : Boolean) is
6051 pragma Assert (Nkind (N) in N_Entity);
6054 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag175 := Val;
6057 procedure Set_Flag176 (N : Node_Id; Val : Boolean) is
6059 pragma Assert (Nkind (N) in N_Entity);
6062 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag176 := Val;
6065 procedure Set_Flag177 (N : Node_Id; Val : Boolean) is
6067 pragma Assert (Nkind (N) in N_Entity);
6070 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag177 := Val;
6073 procedure Set_Flag178 (N : Node_Id; Val : Boolean) is
6075 pragma Assert (Nkind (N) in N_Entity);
6078 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag178 := Val;
6081 procedure Set_Flag179 (N : Node_Id; Val : Boolean) is
6083 pragma Assert (Nkind (N) in N_Entity);
6086 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag179 := Val;
6089 procedure Set_Flag180 (N : Node_Id; Val : Boolean) is
6091 pragma Assert (Nkind (N) in N_Entity);
6094 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag180 := Val;
6097 procedure Set_Flag181 (N : Node_Id; Val : Boolean) is
6099 pragma Assert (Nkind (N) in N_Entity);
6102 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag181 := Val;
6105 procedure Set_Flag182 (N : Node_Id; Val : Boolean) is
6107 pragma Assert (Nkind (N) in N_Entity);
6110 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag182 := Val;
6113 procedure Set_Flag183 (N : Node_Id; Val : Boolean) is
6115 pragma Assert (Nkind (N) in N_Entity);
6118 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag183 := Val;
6121 procedure Set_Flag184 (N : Node_Id; Val : Boolean) is
6123 pragma Assert (Nkind (N) in N_Entity);
6126 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag184 := Val;
6129 procedure Set_Flag185 (N : Node_Id; Val : Boolean) is
6131 pragma Assert (Nkind (N) in N_Entity);
6134 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag185 := Val;
6137 procedure Set_Flag186 (N : Node_Id; Val : Boolean) is
6139 pragma Assert (Nkind (N) in N_Entity);
6142 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag186 := Val;
6145 procedure Set_Flag187 (N : Node_Id; Val : Boolean) is
6147 pragma Assert (Nkind (N) in N_Entity);
6150 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag187 := Val;
6153 procedure Set_Flag188 (N : Node_Id; Val : Boolean) is
6155 pragma Assert (Nkind (N) in N_Entity);
6158 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag188 := Val;
6161 procedure Set_Flag189 (N : Node_Id; Val : Boolean) is
6163 pragma Assert (Nkind (N) in N_Entity);
6166 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag189 := Val;
6169 procedure Set_Flag190 (N : Node_Id; Val : Boolean) is
6171 pragma Assert (Nkind (N) in N_Entity);
6174 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag190 := Val;
6177 procedure Set_Flag191 (N : Node_Id; Val : Boolean) is
6179 pragma Assert (Nkind (N) in N_Entity);
6182 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag191 := Val;
6185 procedure Set_Flag192 (N : Node_Id; Val : Boolean) is
6187 pragma Assert (Nkind (N) in N_Entity);
6190 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag192 := Val;
6193 procedure Set_Flag193 (N : Node_Id; Val : Boolean) is
6195 pragma Assert (Nkind (N) in N_Entity);
6198 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag193 := Val;
6201 procedure Set_Flag194 (N : Node_Id; Val : Boolean) is
6203 pragma Assert (Nkind (N) in N_Entity);
6206 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag194 := Val;
6209 procedure Set_Flag195 (N : Node_Id; Val : Boolean) is
6211 pragma Assert (Nkind (N) in N_Entity);
6214 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag195 := Val;
6217 procedure Set_Flag196 (N : Node_Id; Val : Boolean) is
6219 pragma Assert (Nkind (N) in N_Entity);
6222 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag196 := Val;
6225 procedure Set_Flag197 (N : Node_Id; Val : Boolean) is
6227 pragma Assert (Nkind (N) in N_Entity);
6230 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag197 := Val;
6233 procedure Set_Flag198 (N : Node_Id; Val : Boolean) is
6235 pragma Assert (Nkind (N) in N_Entity);
6238 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag198 := Val;
6241 procedure Set_Flag199 (N : Node_Id; Val : Boolean) is
6243 pragma Assert (Nkind (N) in N_Entity);
6246 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag199 := Val;
6249 procedure Set_Flag200 (N : Node_Id; Val : Boolean) is
6251 pragma Assert (Nkind (N) in N_Entity);
6254 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag200 := Val;
6257 procedure Set_Flag201 (N : Node_Id; Val : Boolean) is
6259 pragma Assert (Nkind (N) in N_Entity);
6262 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag201 := Val;
6265 procedure Set_Flag202 (N : Node_Id; Val : Boolean) is
6267 pragma Assert (Nkind (N) in N_Entity);
6270 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag202 := Val;
6273 procedure Set_Flag203 (N : Node_Id; Val : Boolean) is
6275 pragma Assert (Nkind (N) in N_Entity);
6278 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag203 := Val;
6281 procedure Set_Flag204 (N : Node_Id; Val : Boolean) is
6283 pragma Assert (Nkind (N) in N_Entity);
6286 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag204 := Val;
6289 procedure Set_Flag205 (N : Node_Id; Val : Boolean) is
6291 pragma Assert (Nkind (N) in N_Entity);
6294 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag205 := Val;
6297 procedure Set_Flag206 (N : Node_Id; Val : Boolean) is
6299 pragma Assert (Nkind (N) in N_Entity);
6302 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag206 := Val;
6305 procedure Set_Flag207 (N : Node_Id; Val : Boolean) is
6307 pragma Assert (Nkind (N) in N_Entity);
6310 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag207 := Val;
6313 procedure Set_Flag208 (N : Node_Id; Val : Boolean) is
6315 pragma Assert (Nkind (N) in N_Entity);
6318 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag208 := Val;
6321 procedure Set_Flag209 (N : Node_Id; Val : Boolean) is
6323 pragma Assert (Nkind (N) in N_Entity);
6326 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag209 := Val;
6329 procedure Set_Flag210 (N : Node_Id; Val : Boolean) is
6331 pragma Assert (Nkind (N) in N_Entity);
6334 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag210 := Val;
6337 procedure Set_Flag211 (N : Node_Id; Val : Boolean) is
6339 pragma Assert (Nkind (N) in N_Entity);
6342 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag211 := Val;
6345 procedure Set_Flag212 (N : Node_Id; Val : Boolean) is
6347 pragma Assert (Nkind (N) in N_Entity);
6350 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag212 := Val;
6353 procedure Set_Flag213 (N : Node_Id; Val : Boolean) is
6355 pragma Assert (Nkind (N) in N_Entity);
6358 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag213 := Val;
6361 procedure Set_Flag214 (N : Node_Id; Val : Boolean) is
6363 pragma Assert (Nkind (N) in N_Entity);
6366 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag214 := Val;
6369 procedure Set_Flag215 (N : Node_Id; Val : Boolean) is
6371 pragma Assert (Nkind (N) in N_Entity);
6374 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag215 := Val;
6377 procedure Set_Flag216 (N : Node_Id; Val : Boolean) is
6379 pragma Assert (Nkind (N) in N_Entity);
6380 Nodes.Table (N + 4).In_List := Val;
6383 procedure Set_Flag217 (N : Node_Id; Val : Boolean) is
6385 pragma Assert (Nkind (N) in N_Entity);
6386 Nodes.Table (N + 4).Has_Aspects := Val;
6389 procedure Set_Flag218 (N : Node_Id; Val : Boolean) is
6391 pragma Assert (Nkind (N) in N_Entity);
6392 Nodes.Table (N + 4).Rewrite_Ins := Val;
6395 procedure Set_Flag219 (N : Node_Id; Val : Boolean) is
6397 pragma Assert (Nkind (N) in N_Entity);
6398 Nodes.Table (N + 4).Analyzed := Val;
6401 procedure Set_Flag220 (N : Node_Id; Val : Boolean) is
6403 pragma Assert (Nkind (N) in N_Entity);
6404 Nodes.Table (N + 4).Comes_From_Source := Val;
6407 procedure Set_Flag221 (N : Node_Id; Val : Boolean) is
6409 pragma Assert (Nkind (N) in N_Entity);
6410 Nodes.Table (N + 4).Error_Posted := Val;
6413 procedure Set_Flag222 (N : Node_Id; Val : Boolean) is
6415 pragma Assert (Nkind (N) in N_Entity);
6416 Nodes.Table (N + 4).Flag4 := Val;
6419 procedure Set_Flag223 (N : Node_Id; Val : Boolean) is
6421 pragma Assert (Nkind (N) in N_Entity);
6422 Nodes.Table (N + 4).Flag5 := Val;
6425 procedure Set_Flag224 (N : Node_Id; Val : Boolean) is
6427 pragma Assert (Nkind (N) in N_Entity);
6428 Nodes.Table (N + 4).Flag6 := Val;
6431 procedure Set_Flag225 (N : Node_Id; Val : Boolean) is
6433 pragma Assert (Nkind (N) in N_Entity);
6434 Nodes.Table (N + 4).Flag7 := Val;
6437 procedure Set_Flag226 (N : Node_Id; Val : Boolean) is
6439 pragma Assert (Nkind (N) in N_Entity);
6440 Nodes.Table (N + 4).Flag8 := Val;
6443 procedure Set_Flag227 (N : Node_Id; Val : Boolean) is
6445 pragma Assert (Nkind (N) in N_Entity);
6446 Nodes.Table (N + 4).Flag9 := Val;
6449 procedure Set_Flag228 (N : Node_Id; Val : Boolean) is
6451 pragma Assert (Nkind (N) in N_Entity);
6452 Nodes.Table (N + 4).Flag10 := Val;
6455 procedure Set_Flag229 (N : Node_Id; Val : Boolean) is
6457 pragma Assert (Nkind (N) in N_Entity);
6458 Nodes.Table (N + 4).Flag11 := Val;
6461 procedure Set_Flag230 (N : Node_Id; Val : Boolean) is
6463 pragma Assert (Nkind (N) in N_Entity);
6464 Nodes.Table (N + 4).Flag12 := Val;
6467 procedure Set_Flag231 (N : Node_Id; Val : Boolean) is
6469 pragma Assert (Nkind (N) in N_Entity);
6470 Nodes.Table (N + 4).Flag13 := Val;
6473 procedure Set_Flag232 (N : Node_Id; Val : Boolean) is
6475 pragma Assert (Nkind (N) in N_Entity);
6476 Nodes.Table (N + 4).Flag14 := Val;
6479 procedure Set_Flag233 (N : Node_Id; Val : Boolean) is
6481 pragma Assert (Nkind (N) in N_Entity);
6482 Nodes.Table (N + 4).Flag15 := Val;
6485 procedure Set_Flag234 (N : Node_Id; Val : Boolean) is
6487 pragma Assert (Nkind (N) in N_Entity);
6488 Nodes.Table (N + 4).Flag16 := Val;
6491 procedure Set_Flag235 (N : Node_Id; Val : Boolean) is
6493 pragma Assert (Nkind (N) in N_Entity);
6494 Nodes.Table (N + 4).Flag17 := Val;
6497 procedure Set_Flag236 (N : Node_Id; Val : Boolean) is
6499 pragma Assert (Nkind (N) in N_Entity);
6500 Nodes.Table (N + 4).Flag18 := Val;
6503 procedure Set_Flag237 (N : Node_Id; Val : Boolean) is
6505 pragma Assert (Nkind (N) in N_Entity);
6506 Nodes.Table (N + 4).Pflag1 := Val;
6509 procedure Set_Flag238 (N : Node_Id; Val : Boolean) is
6511 pragma Assert (Nkind (N) in N_Entity);
6512 Nodes.Table (N + 4).Pflag2 := Val;
6515 procedure Set_Flag239 (N : Node_Id; Val : Boolean) is
6517 pragma Assert (Nkind (N) in N_Entity);
6520 (Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag239 := Val;
6523 procedure Set_Flag240 (N : Node_Id; Val : Boolean) is
6525 pragma Assert (Nkind (N) in N_Entity);
6528 (Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag240 := Val;
6531 procedure Set_Flag241 (N : Node_Id; Val : Boolean) is
6533 pragma Assert (Nkind (N) in N_Entity);
6536 (Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag241 := Val;
6539 procedure Set_Flag242 (N : Node_Id; Val : Boolean) is
6541 pragma Assert (Nkind (N) in N_Entity);
6544 (Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag242 := Val;
6547 procedure Set_Flag243 (N : Node_Id; Val : Boolean) is
6549 pragma Assert (Nkind (N) in N_Entity);
6552 (Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag243 := Val;
6555 procedure Set_Flag244 (N : Node_Id; Val : Boolean) is
6557 pragma Assert (Nkind (N) in N_Entity);
6560 (Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag244 := Val;
6563 procedure Set_Flag245 (N : Node_Id; Val : Boolean) is
6565 pragma Assert (Nkind (N) in N_Entity);
6568 (Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag245 := Val;
6571 procedure Set_Flag246 (N : Node_Id; Val : Boolean) is
6573 pragma Assert (Nkind (N) in N_Entity);
6576 (Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag246 := Val;
6579 procedure Set_Flag247 (N : Node_Id; Val : Boolean) is
6581 pragma Assert (Nkind (N) in N_Entity);
6584 (Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag247 := Val;
6587 procedure Set_Flag248 (N : Node_Id; Val : Boolean) is
6589 pragma Assert (Nkind (N) in N_Entity);
6592 (Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag248 := Val;
6595 procedure Set_Flag249 (N : Node_Id; Val : Boolean) is
6597 pragma Assert (Nkind (N) in N_Entity);
6600 (Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag249 := Val;
6603 procedure Set_Flag250 (N : Node_Id; Val : Boolean) is
6605 pragma Assert (Nkind (N) in N_Entity);
6608 (Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag250 := Val;
6611 procedure Set_Flag251 (N : Node_Id; Val : Boolean) is
6613 pragma Assert (Nkind (N) in N_Entity);
6616 (Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag251 := Val;
6619 procedure Set_Flag252 (N : Node_Id; Val : Boolean) is
6621 pragma Assert (Nkind (N) in N_Entity);
6624 (Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag252 := Val;
6627 procedure Set_Flag253 (N : Node_Id; Val : Boolean) is
6629 pragma Assert (Nkind (N) in N_Entity);
6632 (Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag253 := Val;
6635 procedure Set_Flag254 (N : Node_Id; Val : Boolean) is
6637 pragma Assert (Nkind (N) in N_Entity);
6640 (Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag254 := Val;
6643 procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id) is
6645 pragma Assert (N <= Nodes.Last);
6648 Set_Parent (N => Val, Val => N);
6652 end Set_Node1_With_Parent;
6654 procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id) is
6656 pragma Assert (N <= Nodes.Last);
6659 Set_Parent (N => Val, Val => N);
6663 end Set_Node2_With_Parent;
6665 procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id) is
6667 pragma Assert (N <= Nodes.Last);
6670 Set_Parent (N => Val, Val => N);
6674 end Set_Node3_With_Parent;
6676 procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id) is
6678 pragma Assert (N <= Nodes.Last);
6681 Set_Parent (N => Val, Val => N);
6685 end Set_Node4_With_Parent;
6687 procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id) is
6689 pragma Assert (N <= Nodes.Last);
6692 Set_Parent (N => Val, Val => N);
6696 end Set_Node5_With_Parent;
6698 procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id) is
6700 pragma Assert (N <= Nodes.Last);
6701 if Val /= No_List and then Val /= Error_List then
6702 Set_Parent (Val, N);
6705 end Set_List1_With_Parent;
6707 procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id) is
6709 pragma Assert (N <= Nodes.Last);
6710 if Val /= No_List and then Val /= Error_List then
6711 Set_Parent (Val, N);
6714 end Set_List2_With_Parent;
6716 procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id) is
6718 pragma Assert (N <= Nodes.Last);
6719 if Val /= No_List and then Val /= Error_List then
6720 Set_Parent (Val, N);
6723 end Set_List3_With_Parent;
6725 procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id) is
6727 pragma Assert (N <= Nodes.Last);
6728 if Val /= No_List and then Val /= Error_List then
6729 Set_Parent (Val, N);
6732 end Set_List4_With_Parent;
6734 procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id) is
6736 pragma Assert (N <= Nodes.Last);
6737 if Val /= No_List and then Val /= Error_List then
6738 Set_Parent (Val, N);
6741 end Set_List5_With_Parent;
6743 end Unchecked_Access;
6751 Nodes.Locked := False;
6752 Orig_Nodes.Locked := False;