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 List25 (N : Node_Id) return List_Id is
2405 pragma Assert (Nkind (N) in N_Entity);
2406 return List_Id (Nodes.Table (N + 4).Field7);
2409 function Elist1 (N : Node_Id) return Elist_Id is
2410 pragma Assert (N <= Nodes.Last);
2411 Value : constant Union_Id := Nodes.Table (N).Field1;
2416 return Elist_Id (Value);
2420 function Elist2 (N : Node_Id) return Elist_Id is
2421 pragma Assert (N <= Nodes.Last);
2422 Value : constant Union_Id := Nodes.Table (N).Field2;
2427 return Elist_Id (Value);
2431 function Elist3 (N : Node_Id) return Elist_Id is
2432 pragma Assert (N <= Nodes.Last);
2433 Value : constant Union_Id := Nodes.Table (N).Field3;
2438 return Elist_Id (Value);
2442 function Elist4 (N : Node_Id) return Elist_Id is
2443 pragma Assert (N <= Nodes.Last);
2444 Value : constant Union_Id := Nodes.Table (N).Field4;
2449 return Elist_Id (Value);
2453 function Elist8 (N : Node_Id) return Elist_Id is
2454 pragma Assert (Nkind (N) in N_Entity);
2455 Value : constant Union_Id := Nodes.Table (N + 1).Field8;
2460 return Elist_Id (Value);
2464 function Elist10 (N : Node_Id) return Elist_Id is
2465 pragma Assert (Nkind (N) in N_Entity);
2466 Value : constant Union_Id := Nodes.Table (N + 1).Field10;
2471 return Elist_Id (Value);
2475 function Elist13 (N : Node_Id) return Elist_Id is
2476 pragma Assert (Nkind (N) in N_Entity);
2477 Value : constant Union_Id := Nodes.Table (N + 2).Field6;
2482 return Elist_Id (Value);
2486 function Elist15 (N : Node_Id) return Elist_Id is
2487 pragma Assert (Nkind (N) in N_Entity);
2488 Value : constant Union_Id := Nodes.Table (N + 2).Field8;
2493 return Elist_Id (Value);
2497 function Elist16 (N : Node_Id) return Elist_Id is
2498 pragma Assert (Nkind (N) in N_Entity);
2499 Value : constant Union_Id := Nodes.Table (N + 2).Field9;
2504 return Elist_Id (Value);
2508 function Elist18 (N : Node_Id) return Elist_Id is
2509 pragma Assert (Nkind (N) in N_Entity);
2510 Value : constant Union_Id := Nodes.Table (N + 2).Field11;
2515 return Elist_Id (Value);
2519 function Elist21 (N : Node_Id) return Elist_Id is
2520 pragma Assert (Nkind (N) in N_Entity);
2521 Value : constant Union_Id := Nodes.Table (N + 3).Field8;
2526 return Elist_Id (Value);
2530 function Elist23 (N : Node_Id) return Elist_Id is
2531 pragma Assert (Nkind (N) in N_Entity);
2532 Value : constant Union_Id := Nodes.Table (N + 3).Field10;
2537 return Elist_Id (Value);
2541 function Elist25 (N : Node_Id) return Elist_Id is
2542 pragma Assert (Nkind (N) in N_Entity);
2543 Value : constant Union_Id := Nodes.Table (N + 4).Field7;
2548 return Elist_Id (Value);
2552 function Elist26 (N : Node_Id) return Elist_Id is
2553 pragma Assert (Nkind (N) in N_Entity);
2554 Value : constant Union_Id := Nodes.Table (N + 4).Field8;
2559 return Elist_Id (Value);
2563 function Name1 (N : Node_Id) return Name_Id is
2565 pragma Assert (N <= Nodes.Last);
2566 return Name_Id (Nodes.Table (N).Field1);
2569 function Name2 (N : Node_Id) return Name_Id is
2571 pragma Assert (N <= Nodes.Last);
2572 return Name_Id (Nodes.Table (N).Field2);
2575 function Str3 (N : Node_Id) return String_Id is
2577 pragma Assert (N <= Nodes.Last);
2578 return String_Id (Nodes.Table (N).Field3);
2581 function Uint2 (N : Node_Id) return Uint is
2582 pragma Assert (N <= Nodes.Last);
2583 U : constant Union_Id := Nodes.Table (N).Field2;
2588 return From_Union (U);
2592 function Uint3 (N : Node_Id) return Uint is
2593 pragma Assert (N <= Nodes.Last);
2594 U : constant Union_Id := Nodes.Table (N).Field3;
2599 return From_Union (U);
2603 function Uint4 (N : Node_Id) return Uint is
2604 pragma Assert (N <= Nodes.Last);
2605 U : constant Union_Id := Nodes.Table (N).Field4;
2610 return From_Union (U);
2614 function Uint5 (N : Node_Id) return Uint is
2615 pragma Assert (N <= Nodes.Last);
2616 U : constant Union_Id := Nodes.Table (N).Field5;
2621 return From_Union (U);
2625 function Uint8 (N : Node_Id) return Uint is
2626 pragma Assert (Nkind (N) in N_Entity);
2627 U : constant Union_Id := Nodes.Table (N + 1).Field8;
2632 return From_Union (U);
2636 function Uint9 (N : Node_Id) return Uint is
2637 pragma Assert (Nkind (N) in N_Entity);
2638 U : constant Union_Id := Nodes.Table (N + 1).Field9;
2643 return From_Union (U);
2647 function Uint10 (N : Node_Id) return Uint is
2648 pragma Assert (Nkind (N) in N_Entity);
2649 U : constant Union_Id := Nodes.Table (N + 1).Field10;
2654 return From_Union (U);
2658 function Uint11 (N : Node_Id) return Uint is
2659 pragma Assert (Nkind (N) in N_Entity);
2660 U : constant Union_Id := Nodes.Table (N + 1).Field11;
2665 return From_Union (U);
2669 function Uint12 (N : Node_Id) return Uint is
2670 pragma Assert (Nkind (N) in N_Entity);
2671 U : constant Union_Id := Nodes.Table (N + 1).Field12;
2676 return From_Union (U);
2680 function Uint13 (N : Node_Id) return Uint is
2681 pragma Assert (Nkind (N) in N_Entity);
2682 U : constant Union_Id := Nodes.Table (N + 2).Field6;
2687 return From_Union (U);
2691 function Uint14 (N : Node_Id) return Uint is
2692 pragma Assert (Nkind (N) in N_Entity);
2693 U : constant Union_Id := Nodes.Table (N + 2).Field7;
2698 return From_Union (U);
2702 function Uint15 (N : Node_Id) return Uint is
2703 pragma Assert (Nkind (N) in N_Entity);
2704 U : constant Union_Id := Nodes.Table (N + 2).Field8;
2709 return From_Union (U);
2713 function Uint16 (N : Node_Id) return Uint is
2714 pragma Assert (Nkind (N) in N_Entity);
2715 U : constant Union_Id := Nodes.Table (N + 2).Field9;
2720 return From_Union (U);
2724 function Uint17 (N : Node_Id) return Uint is
2725 pragma Assert (Nkind (N) in N_Entity);
2726 U : constant Union_Id := Nodes.Table (N + 2).Field10;
2731 return From_Union (U);
2735 function Uint22 (N : Node_Id) return Uint is
2736 pragma Assert (Nkind (N) in N_Entity);
2737 U : constant Union_Id := Nodes.Table (N + 3).Field9;
2742 return From_Union (U);
2746 function Ureal3 (N : Node_Id) return Ureal is
2748 pragma Assert (N <= Nodes.Last);
2749 return From_Union (Nodes.Table (N).Field3);
2752 function Ureal18 (N : Node_Id) return Ureal is
2754 pragma Assert (Nkind (N) in N_Entity);
2755 return From_Union (Nodes.Table (N + 2).Field11);
2758 function Ureal21 (N : Node_Id) return Ureal is
2760 pragma Assert (Nkind (N) in N_Entity);
2761 return From_Union (Nodes.Table (N + 3).Field8);
2764 function Flag4 (N : Node_Id) return Boolean is
2766 pragma Assert (N <= Nodes.Last);
2767 return Nodes.Table (N).Flag4;
2770 function Flag5 (N : Node_Id) return Boolean is
2772 pragma Assert (N <= Nodes.Last);
2773 return Nodes.Table (N).Flag5;
2776 function Flag6 (N : Node_Id) return Boolean is
2778 pragma Assert (N <= Nodes.Last);
2779 return Nodes.Table (N).Flag6;
2782 function Flag7 (N : Node_Id) return Boolean is
2784 pragma Assert (N <= Nodes.Last);
2785 return Nodes.Table (N).Flag7;
2788 function Flag8 (N : Node_Id) return Boolean is
2790 pragma Assert (N <= Nodes.Last);
2791 return Nodes.Table (N).Flag8;
2794 function Flag9 (N : Node_Id) return Boolean is
2796 pragma Assert (N <= Nodes.Last);
2797 return Nodes.Table (N).Flag9;
2800 function Flag10 (N : Node_Id) return Boolean is
2802 pragma Assert (N <= Nodes.Last);
2803 return Nodes.Table (N).Flag10;
2806 function Flag11 (N : Node_Id) return Boolean is
2808 pragma Assert (N <= Nodes.Last);
2809 return Nodes.Table (N).Flag11;
2812 function Flag12 (N : Node_Id) return Boolean is
2814 pragma Assert (N <= Nodes.Last);
2815 return Nodes.Table (N).Flag12;
2818 function Flag13 (N : Node_Id) return Boolean is
2820 pragma Assert (N <= Nodes.Last);
2821 return Nodes.Table (N).Flag13;
2824 function Flag14 (N : Node_Id) return Boolean is
2826 pragma Assert (N <= Nodes.Last);
2827 return Nodes.Table (N).Flag14;
2830 function Flag15 (N : Node_Id) return Boolean is
2832 pragma Assert (N <= Nodes.Last);
2833 return Nodes.Table (N).Flag15;
2836 function Flag16 (N : Node_Id) return Boolean is
2838 pragma Assert (N <= Nodes.Last);
2839 return Nodes.Table (N).Flag16;
2842 function Flag17 (N : Node_Id) return Boolean is
2844 pragma Assert (N <= Nodes.Last);
2845 return Nodes.Table (N).Flag17;
2848 function Flag18 (N : Node_Id) return Boolean is
2850 pragma Assert (N <= Nodes.Last);
2851 return Nodes.Table (N).Flag18;
2854 function Flag19 (N : Node_Id) return Boolean is
2856 pragma Assert (Nkind (N) in N_Entity);
2857 return Nodes.Table (N + 1).In_List;
2860 function Flag20 (N : Node_Id) return Boolean is
2862 pragma Assert (Nkind (N) in N_Entity);
2863 return Nodes.Table (N + 1).Has_Aspects;
2866 function Flag21 (N : Node_Id) return Boolean is
2868 pragma Assert (Nkind (N) in N_Entity);
2869 return Nodes.Table (N + 1).Rewrite_Ins;
2872 function Flag22 (N : Node_Id) return Boolean is
2874 pragma Assert (Nkind (N) in N_Entity);
2875 return Nodes.Table (N + 1).Analyzed;
2878 function Flag23 (N : Node_Id) return Boolean is
2880 pragma Assert (Nkind (N) in N_Entity);
2881 return Nodes.Table (N + 1).Comes_From_Source;
2884 function Flag24 (N : Node_Id) return Boolean is
2886 pragma Assert (Nkind (N) in N_Entity);
2887 return Nodes.Table (N + 1).Error_Posted;
2890 function Flag25 (N : Node_Id) return Boolean is
2892 pragma Assert (Nkind (N) in N_Entity);
2893 return Nodes.Table (N + 1).Flag4;
2896 function Flag26 (N : Node_Id) return Boolean is
2898 pragma Assert (Nkind (N) in N_Entity);
2899 return Nodes.Table (N + 1).Flag5;
2902 function Flag27 (N : Node_Id) return Boolean is
2904 pragma Assert (Nkind (N) in N_Entity);
2905 return Nodes.Table (N + 1).Flag6;
2908 function Flag28 (N : Node_Id) return Boolean is
2910 pragma Assert (Nkind (N) in N_Entity);
2911 return Nodes.Table (N + 1).Flag7;
2914 function Flag29 (N : Node_Id) return Boolean is
2916 pragma Assert (Nkind (N) in N_Entity);
2917 return Nodes.Table (N + 1).Flag8;
2920 function Flag30 (N : Node_Id) return Boolean is
2922 pragma Assert (Nkind (N) in N_Entity);
2923 return Nodes.Table (N + 1).Flag9;
2926 function Flag31 (N : Node_Id) return Boolean is
2928 pragma Assert (Nkind (N) in N_Entity);
2929 return Nodes.Table (N + 1).Flag10;
2932 function Flag32 (N : Node_Id) return Boolean is
2934 pragma Assert (Nkind (N) in N_Entity);
2935 return Nodes.Table (N + 1).Flag11;
2938 function Flag33 (N : Node_Id) return Boolean is
2940 pragma Assert (Nkind (N) in N_Entity);
2941 return Nodes.Table (N + 1).Flag12;
2944 function Flag34 (N : Node_Id) return Boolean is
2946 pragma Assert (Nkind (N) in N_Entity);
2947 return Nodes.Table (N + 1).Flag13;
2950 function Flag35 (N : Node_Id) return Boolean is
2952 pragma Assert (Nkind (N) in N_Entity);
2953 return Nodes.Table (N + 1).Flag14;
2956 function Flag36 (N : Node_Id) return Boolean is
2958 pragma Assert (Nkind (N) in N_Entity);
2959 return Nodes.Table (N + 1).Flag15;
2962 function Flag37 (N : Node_Id) return Boolean is
2964 pragma Assert (Nkind (N) in N_Entity);
2965 return Nodes.Table (N + 1).Flag16;
2968 function Flag38 (N : Node_Id) return Boolean is
2970 pragma Assert (Nkind (N) in N_Entity);
2971 return Nodes.Table (N + 1).Flag17;
2974 function Flag39 (N : Node_Id) return Boolean is
2976 pragma Assert (Nkind (N) in N_Entity);
2977 return Nodes.Table (N + 1).Flag18;
2980 function Flag40 (N : Node_Id) return Boolean is
2982 pragma Assert (Nkind (N) in N_Entity);
2983 return Nodes.Table (N + 2).In_List;
2986 function Flag41 (N : Node_Id) return Boolean is
2988 pragma Assert (Nkind (N) in N_Entity);
2989 return Nodes.Table (N + 2).Has_Aspects;
2992 function Flag42 (N : Node_Id) return Boolean is
2994 pragma Assert (Nkind (N) in N_Entity);
2995 return Nodes.Table (N + 2).Rewrite_Ins;
2998 function Flag43 (N : Node_Id) return Boolean is
3000 pragma Assert (Nkind (N) in N_Entity);
3001 return Nodes.Table (N + 2).Analyzed;
3004 function Flag44 (N : Node_Id) return Boolean is
3006 pragma Assert (Nkind (N) in N_Entity);
3007 return Nodes.Table (N + 2).Comes_From_Source;
3010 function Flag45 (N : Node_Id) return Boolean is
3012 pragma Assert (Nkind (N) in N_Entity);
3013 return Nodes.Table (N + 2).Error_Posted;
3016 function Flag46 (N : Node_Id) return Boolean is
3018 pragma Assert (Nkind (N) in N_Entity);
3019 return Nodes.Table (N + 2).Flag4;
3022 function Flag47 (N : Node_Id) return Boolean is
3024 pragma Assert (Nkind (N) in N_Entity);
3025 return Nodes.Table (N + 2).Flag5;
3028 function Flag48 (N : Node_Id) return Boolean is
3030 pragma Assert (Nkind (N) in N_Entity);
3031 return Nodes.Table (N + 2).Flag6;
3034 function Flag49 (N : Node_Id) return Boolean is
3036 pragma Assert (Nkind (N) in N_Entity);
3037 return Nodes.Table (N + 2).Flag7;
3040 function Flag50 (N : Node_Id) return Boolean is
3042 pragma Assert (Nkind (N) in N_Entity);
3043 return Nodes.Table (N + 2).Flag8;
3046 function Flag51 (N : Node_Id) return Boolean is
3048 pragma Assert (Nkind (N) in N_Entity);
3049 return Nodes.Table (N + 2).Flag9;
3052 function Flag52 (N : Node_Id) return Boolean is
3054 pragma Assert (Nkind (N) in N_Entity);
3055 return Nodes.Table (N + 2).Flag10;
3058 function Flag53 (N : Node_Id) return Boolean is
3060 pragma Assert (Nkind (N) in N_Entity);
3061 return Nodes.Table (N + 2).Flag11;
3064 function Flag54 (N : Node_Id) return Boolean is
3066 pragma Assert (Nkind (N) in N_Entity);
3067 return Nodes.Table (N + 2).Flag12;
3070 function Flag55 (N : Node_Id) return Boolean is
3072 pragma Assert (Nkind (N) in N_Entity);
3073 return Nodes.Table (N + 2).Flag13;
3076 function Flag56 (N : Node_Id) return Boolean is
3078 pragma Assert (Nkind (N) in N_Entity);
3079 return Nodes.Table (N + 2).Flag14;
3082 function Flag57 (N : Node_Id) return Boolean is
3084 pragma Assert (Nkind (N) in N_Entity);
3085 return Nodes.Table (N + 2).Flag15;
3088 function Flag58 (N : Node_Id) return Boolean is
3090 pragma Assert (Nkind (N) in N_Entity);
3091 return Nodes.Table (N + 2).Flag16;
3094 function Flag59 (N : Node_Id) return Boolean is
3096 pragma Assert (Nkind (N) in N_Entity);
3097 return Nodes.Table (N + 2).Flag17;
3100 function Flag60 (N : Node_Id) return Boolean is
3102 pragma Assert (Nkind (N) in N_Entity);
3103 return Nodes.Table (N + 2).Flag18;
3106 function Flag61 (N : Node_Id) return Boolean is
3108 pragma Assert (Nkind (N) in N_Entity);
3109 return Nodes.Table (N + 1).Pflag1;
3112 function Flag62 (N : Node_Id) return Boolean is
3114 pragma Assert (Nkind (N) in N_Entity);
3115 return Nodes.Table (N + 1).Pflag2;
3118 function Flag63 (N : Node_Id) return Boolean is
3120 pragma Assert (Nkind (N) in N_Entity);
3121 return Nodes.Table (N + 2).Pflag1;
3124 function Flag64 (N : Node_Id) return Boolean is
3126 pragma Assert (Nkind (N) in N_Entity);
3127 return Nodes.Table (N + 2).Pflag2;
3130 function Flag65 (N : Node_Id) return Boolean is
3132 pragma Assert (Nkind (N) in N_Entity);
3133 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag65;
3136 function Flag66 (N : Node_Id) return Boolean is
3138 pragma Assert (Nkind (N) in N_Entity);
3139 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag66;
3142 function Flag67 (N : Node_Id) return Boolean is
3144 pragma Assert (Nkind (N) in N_Entity);
3145 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag67;
3148 function Flag68 (N : Node_Id) return Boolean is
3150 pragma Assert (Nkind (N) in N_Entity);
3151 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag68;
3154 function Flag69 (N : Node_Id) return Boolean is
3156 pragma Assert (Nkind (N) in N_Entity);
3157 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag69;
3160 function Flag70 (N : Node_Id) return Boolean is
3162 pragma Assert (Nkind (N) in N_Entity);
3163 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag70;
3166 function Flag71 (N : Node_Id) return Boolean is
3168 pragma Assert (Nkind (N) in N_Entity);
3169 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag71;
3172 function Flag72 (N : Node_Id) return Boolean is
3174 pragma Assert (Nkind (N) in N_Entity);
3175 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag72;
3178 function Flag73 (N : Node_Id) return Boolean is
3180 pragma Assert (Nkind (N) in N_Entity);
3181 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag73;
3184 function Flag74 (N : Node_Id) return Boolean is
3186 pragma Assert (Nkind (N) in N_Entity);
3187 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag74;
3190 function Flag75 (N : Node_Id) return Boolean is
3192 pragma Assert (Nkind (N) in N_Entity);
3193 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag75;
3196 function Flag76 (N : Node_Id) return Boolean is
3198 pragma Assert (Nkind (N) in N_Entity);
3199 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag76;
3202 function Flag77 (N : Node_Id) return Boolean is
3204 pragma Assert (Nkind (N) in N_Entity);
3205 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag77;
3208 function Flag78 (N : Node_Id) return Boolean is
3210 pragma Assert (Nkind (N) in N_Entity);
3211 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag78;
3214 function Flag79 (N : Node_Id) return Boolean is
3216 pragma Assert (Nkind (N) in N_Entity);
3217 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag79;
3220 function Flag80 (N : Node_Id) return Boolean is
3222 pragma Assert (Nkind (N) in N_Entity);
3223 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag80;
3226 function Flag81 (N : Node_Id) return Boolean is
3228 pragma Assert (Nkind (N) in N_Entity);
3229 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag81;
3232 function Flag82 (N : Node_Id) return Boolean is
3234 pragma Assert (Nkind (N) in N_Entity);
3235 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag82;
3238 function Flag83 (N : Node_Id) return Boolean is
3240 pragma Assert (Nkind (N) in N_Entity);
3241 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag83;
3244 function Flag84 (N : Node_Id) return Boolean is
3246 pragma Assert (Nkind (N) in N_Entity);
3247 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag84;
3250 function Flag85 (N : Node_Id) return Boolean is
3252 pragma Assert (Nkind (N) in N_Entity);
3253 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag85;
3256 function Flag86 (N : Node_Id) return Boolean is
3258 pragma Assert (Nkind (N) in N_Entity);
3259 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag86;
3262 function Flag87 (N : Node_Id) return Boolean is
3264 pragma Assert (Nkind (N) in N_Entity);
3265 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag87;
3268 function Flag88 (N : Node_Id) return Boolean is
3270 pragma Assert (Nkind (N) in N_Entity);
3271 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag88;
3274 function Flag89 (N : Node_Id) return Boolean is
3276 pragma Assert (Nkind (N) in N_Entity);
3277 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag89;
3280 function Flag90 (N : Node_Id) return Boolean is
3282 pragma Assert (Nkind (N) in N_Entity);
3283 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag90;
3286 function Flag91 (N : Node_Id) return Boolean is
3288 pragma Assert (Nkind (N) in N_Entity);
3289 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag91;
3292 function Flag92 (N : Node_Id) return Boolean is
3294 pragma Assert (Nkind (N) in N_Entity);
3295 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag92;
3298 function Flag93 (N : Node_Id) return Boolean is
3300 pragma Assert (Nkind (N) in N_Entity);
3301 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag93;
3304 function Flag94 (N : Node_Id) return Boolean is
3306 pragma Assert (Nkind (N) in N_Entity);
3307 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag94;
3310 function Flag95 (N : Node_Id) return Boolean is
3312 pragma Assert (Nkind (N) in N_Entity);
3313 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag95;
3316 function Flag96 (N : Node_Id) return Boolean is
3318 pragma Assert (Nkind (N) in N_Entity);
3319 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag96;
3322 function Flag97 (N : Node_Id) return Boolean is
3324 pragma Assert (Nkind (N) in N_Entity);
3325 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag97;
3328 function Flag98 (N : Node_Id) return Boolean is
3330 pragma Assert (Nkind (N) in N_Entity);
3331 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag98;
3334 function Flag99 (N : Node_Id) return Boolean is
3336 pragma Assert (Nkind (N) in N_Entity);
3337 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag99;
3340 function Flag100 (N : Node_Id) return Boolean is
3342 pragma Assert (Nkind (N) in N_Entity);
3343 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag100;
3346 function Flag101 (N : Node_Id) return Boolean is
3348 pragma Assert (Nkind (N) in N_Entity);
3349 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag101;
3352 function Flag102 (N : Node_Id) return Boolean is
3354 pragma Assert (Nkind (N) in N_Entity);
3355 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag102;
3358 function Flag103 (N : Node_Id) return Boolean is
3360 pragma Assert (Nkind (N) in N_Entity);
3361 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag103;
3364 function Flag104 (N : Node_Id) return Boolean is
3366 pragma Assert (Nkind (N) in N_Entity);
3367 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag104;
3370 function Flag105 (N : Node_Id) return Boolean is
3372 pragma Assert (Nkind (N) in N_Entity);
3373 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag105;
3376 function Flag106 (N : Node_Id) return Boolean is
3378 pragma Assert (Nkind (N) in N_Entity);
3379 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag106;
3382 function Flag107 (N : Node_Id) return Boolean is
3384 pragma Assert (Nkind (N) in N_Entity);
3385 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag107;
3388 function Flag108 (N : Node_Id) return Boolean is
3390 pragma Assert (Nkind (N) in N_Entity);
3391 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag108;
3394 function Flag109 (N : Node_Id) return Boolean is
3396 pragma Assert (Nkind (N) in N_Entity);
3397 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag109;
3400 function Flag110 (N : Node_Id) return Boolean is
3402 pragma Assert (Nkind (N) in N_Entity);
3403 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag110;
3406 function Flag111 (N : Node_Id) return Boolean is
3408 pragma Assert (Nkind (N) in N_Entity);
3409 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag111;
3412 function Flag112 (N : Node_Id) return Boolean is
3414 pragma Assert (Nkind (N) in N_Entity);
3415 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag112;
3418 function Flag113 (N : Node_Id) return Boolean is
3420 pragma Assert (Nkind (N) in N_Entity);
3421 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag113;
3424 function Flag114 (N : Node_Id) return Boolean is
3426 pragma Assert (Nkind (N) in N_Entity);
3427 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag114;
3430 function Flag115 (N : Node_Id) return Boolean is
3432 pragma Assert (Nkind (N) in N_Entity);
3433 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag115;
3436 function Flag116 (N : Node_Id) return Boolean is
3438 pragma Assert (Nkind (N) in N_Entity);
3439 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag116;
3442 function Flag117 (N : Node_Id) return Boolean is
3444 pragma Assert (Nkind (N) in N_Entity);
3445 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag117;
3448 function Flag118 (N : Node_Id) return Boolean is
3450 pragma Assert (Nkind (N) in N_Entity);
3451 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag118;
3454 function Flag119 (N : Node_Id) return Boolean is
3456 pragma Assert (Nkind (N) in N_Entity);
3457 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag119;
3460 function Flag120 (N : Node_Id) return Boolean is
3462 pragma Assert (Nkind (N) in N_Entity);
3463 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag120;
3466 function Flag121 (N : Node_Id) return Boolean is
3468 pragma Assert (Nkind (N) in N_Entity);
3469 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag121;
3472 function Flag122 (N : Node_Id) return Boolean is
3474 pragma Assert (Nkind (N) in N_Entity);
3475 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag122;
3478 function Flag123 (N : Node_Id) return Boolean is
3480 pragma Assert (Nkind (N) in N_Entity);
3481 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag123;
3484 function Flag124 (N : Node_Id) return Boolean is
3486 pragma Assert (Nkind (N) in N_Entity);
3487 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag124;
3490 function Flag125 (N : Node_Id) return Boolean is
3492 pragma Assert (Nkind (N) in N_Entity);
3493 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag125;
3496 function Flag126 (N : Node_Id) return Boolean is
3498 pragma Assert (Nkind (N) in N_Entity);
3499 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag126;
3502 function Flag127 (N : Node_Id) return Boolean is
3504 pragma Assert (Nkind (N) in N_Entity);
3505 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag127;
3508 function Flag128 (N : Node_Id) return Boolean is
3510 pragma Assert (Nkind (N) in N_Entity);
3511 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag128;
3514 function Flag129 (N : Node_Id) return Boolean is
3516 pragma Assert (Nkind (N) in N_Entity);
3517 return Nodes.Table (N + 3).In_List;
3520 function Flag130 (N : Node_Id) return Boolean is
3522 pragma Assert (Nkind (N) in N_Entity);
3523 return Nodes.Table (N + 3).Has_Aspects;
3526 function Flag131 (N : Node_Id) return Boolean is
3528 pragma Assert (Nkind (N) in N_Entity);
3529 return Nodes.Table (N + 3).Rewrite_Ins;
3532 function Flag132 (N : Node_Id) return Boolean is
3534 pragma Assert (Nkind (N) in N_Entity);
3535 return Nodes.Table (N + 3).Analyzed;
3538 function Flag133 (N : Node_Id) return Boolean is
3540 pragma Assert (Nkind (N) in N_Entity);
3541 return Nodes.Table (N + 3).Comes_From_Source;
3544 function Flag134 (N : Node_Id) return Boolean is
3546 pragma Assert (Nkind (N) in N_Entity);
3547 return Nodes.Table (N + 3).Error_Posted;
3550 function Flag135 (N : Node_Id) return Boolean is
3552 pragma Assert (Nkind (N) in N_Entity);
3553 return Nodes.Table (N + 3).Flag4;
3556 function Flag136 (N : Node_Id) return Boolean is
3558 pragma Assert (Nkind (N) in N_Entity);
3559 return Nodes.Table (N + 3).Flag5;
3562 function Flag137 (N : Node_Id) return Boolean is
3564 pragma Assert (Nkind (N) in N_Entity);
3565 return Nodes.Table (N + 3).Flag6;
3568 function Flag138 (N : Node_Id) return Boolean is
3570 pragma Assert (Nkind (N) in N_Entity);
3571 return Nodes.Table (N + 3).Flag7;
3574 function Flag139 (N : Node_Id) return Boolean is
3576 pragma Assert (Nkind (N) in N_Entity);
3577 return Nodes.Table (N + 3).Flag8;
3580 function Flag140 (N : Node_Id) return Boolean is
3582 pragma Assert (Nkind (N) in N_Entity);
3583 return Nodes.Table (N + 3).Flag9;
3586 function Flag141 (N : Node_Id) return Boolean is
3588 pragma Assert (Nkind (N) in N_Entity);
3589 return Nodes.Table (N + 3).Flag10;
3592 function Flag142 (N : Node_Id) return Boolean is
3594 pragma Assert (Nkind (N) in N_Entity);
3595 return Nodes.Table (N + 3).Flag11;
3598 function Flag143 (N : Node_Id) return Boolean is
3600 pragma Assert (Nkind (N) in N_Entity);
3601 return Nodes.Table (N + 3).Flag12;
3604 function Flag144 (N : Node_Id) return Boolean is
3606 pragma Assert (Nkind (N) in N_Entity);
3607 return Nodes.Table (N + 3).Flag13;
3610 function Flag145 (N : Node_Id) return Boolean is
3612 pragma Assert (Nkind (N) in N_Entity);
3613 return Nodes.Table (N + 3).Flag14;
3616 function Flag146 (N : Node_Id) return Boolean is
3618 pragma Assert (Nkind (N) in N_Entity);
3619 return Nodes.Table (N + 3).Flag15;
3622 function Flag147 (N : Node_Id) return Boolean is
3624 pragma Assert (Nkind (N) in N_Entity);
3625 return Nodes.Table (N + 3).Flag16;
3628 function Flag148 (N : Node_Id) return Boolean is
3630 pragma Assert (Nkind (N) in N_Entity);
3631 return Nodes.Table (N + 3).Flag17;
3634 function Flag149 (N : Node_Id) return Boolean is
3636 pragma Assert (Nkind (N) in N_Entity);
3637 return Nodes.Table (N + 3).Flag18;
3640 function Flag150 (N : Node_Id) return Boolean is
3642 pragma Assert (Nkind (N) in N_Entity);
3643 return Nodes.Table (N + 3).Pflag1;
3646 function Flag151 (N : Node_Id) return Boolean is
3648 pragma Assert (Nkind (N) in N_Entity);
3649 return Nodes.Table (N + 3).Pflag2;
3652 function Flag152 (N : Node_Id) return Boolean is
3654 pragma Assert (Nkind (N) in N_Entity);
3655 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag152;
3658 function Flag153 (N : Node_Id) return Boolean is
3660 pragma Assert (Nkind (N) in N_Entity);
3661 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag153;
3664 function Flag154 (N : Node_Id) return Boolean is
3666 pragma Assert (Nkind (N) in N_Entity);
3667 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag154;
3670 function Flag155 (N : Node_Id) return Boolean is
3672 pragma Assert (Nkind (N) in N_Entity);
3673 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag155;
3676 function Flag156 (N : Node_Id) return Boolean is
3678 pragma Assert (Nkind (N) in N_Entity);
3679 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag156;
3682 function Flag157 (N : Node_Id) return Boolean is
3684 pragma Assert (Nkind (N) in N_Entity);
3685 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag157;
3688 function Flag158 (N : Node_Id) return Boolean is
3690 pragma Assert (Nkind (N) in N_Entity);
3691 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag158;
3694 function Flag159 (N : Node_Id) return Boolean is
3696 pragma Assert (Nkind (N) in N_Entity);
3697 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag159;
3700 function Flag160 (N : Node_Id) return Boolean is
3702 pragma Assert (Nkind (N) in N_Entity);
3703 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag160;
3706 function Flag161 (N : Node_Id) return Boolean is
3708 pragma Assert (Nkind (N) in N_Entity);
3709 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag161;
3712 function Flag162 (N : Node_Id) return Boolean is
3714 pragma Assert (Nkind (N) in N_Entity);
3715 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag162;
3718 function Flag163 (N : Node_Id) return Boolean is
3720 pragma Assert (Nkind (N) in N_Entity);
3721 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag163;
3724 function Flag164 (N : Node_Id) return Boolean is
3726 pragma Assert (Nkind (N) in N_Entity);
3727 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag164;
3730 function Flag165 (N : Node_Id) return Boolean is
3732 pragma Assert (Nkind (N) in N_Entity);
3733 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag165;
3736 function Flag166 (N : Node_Id) return Boolean is
3738 pragma Assert (Nkind (N) in N_Entity);
3739 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag166;
3742 function Flag167 (N : Node_Id) return Boolean is
3744 pragma Assert (Nkind (N) in N_Entity);
3745 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag167;
3748 function Flag168 (N : Node_Id) return Boolean is
3750 pragma Assert (Nkind (N) in N_Entity);
3751 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag168;
3754 function Flag169 (N : Node_Id) return Boolean is
3756 pragma Assert (Nkind (N) in N_Entity);
3757 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag169;
3760 function Flag170 (N : Node_Id) return Boolean is
3762 pragma Assert (Nkind (N) in N_Entity);
3763 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag170;
3766 function Flag171 (N : Node_Id) return Boolean is
3768 pragma Assert (Nkind (N) in N_Entity);
3769 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag171;
3772 function Flag172 (N : Node_Id) return Boolean is
3774 pragma Assert (Nkind (N) in N_Entity);
3775 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag172;
3778 function Flag173 (N : Node_Id) return Boolean is
3780 pragma Assert (Nkind (N) in N_Entity);
3781 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag173;
3784 function Flag174 (N : Node_Id) return Boolean is
3786 pragma Assert (Nkind (N) in N_Entity);
3787 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag174;
3790 function Flag175 (N : Node_Id) return Boolean is
3792 pragma Assert (Nkind (N) in N_Entity);
3793 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag175;
3796 function Flag176 (N : Node_Id) return Boolean is
3798 pragma Assert (Nkind (N) in N_Entity);
3799 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag176;
3802 function Flag177 (N : Node_Id) return Boolean is
3804 pragma Assert (Nkind (N) in N_Entity);
3805 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag177;
3808 function Flag178 (N : Node_Id) return Boolean is
3810 pragma Assert (Nkind (N) in N_Entity);
3811 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag178;
3814 function Flag179 (N : Node_Id) return Boolean is
3816 pragma Assert (Nkind (N) in N_Entity);
3817 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag179;
3820 function Flag180 (N : Node_Id) return Boolean is
3822 pragma Assert (Nkind (N) in N_Entity);
3823 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag180;
3826 function Flag181 (N : Node_Id) return Boolean is
3828 pragma Assert (Nkind (N) in N_Entity);
3829 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag181;
3832 function Flag182 (N : Node_Id) return Boolean is
3834 pragma Assert (Nkind (N) in N_Entity);
3835 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag182;
3838 function Flag183 (N : Node_Id) return Boolean is
3840 pragma Assert (Nkind (N) in N_Entity);
3841 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag183;
3844 function Flag184 (N : Node_Id) return Boolean is
3846 pragma Assert (Nkind (N) in N_Entity);
3847 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag184;
3850 function Flag185 (N : Node_Id) return Boolean is
3852 pragma Assert (Nkind (N) in N_Entity);
3853 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag185;
3856 function Flag186 (N : Node_Id) return Boolean is
3858 pragma Assert (Nkind (N) in N_Entity);
3859 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag186;
3862 function Flag187 (N : Node_Id) return Boolean is
3864 pragma Assert (Nkind (N) in N_Entity);
3865 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag187;
3868 function Flag188 (N : Node_Id) return Boolean is
3870 pragma Assert (Nkind (N) in N_Entity);
3871 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag188;
3874 function Flag189 (N : Node_Id) return Boolean is
3876 pragma Assert (Nkind (N) in N_Entity);
3877 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag189;
3880 function Flag190 (N : Node_Id) return Boolean is
3882 pragma Assert (Nkind (N) in N_Entity);
3883 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag190;
3886 function Flag191 (N : Node_Id) return Boolean is
3888 pragma Assert (Nkind (N) in N_Entity);
3889 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag191;
3892 function Flag192 (N : Node_Id) return Boolean is
3894 pragma Assert (Nkind (N) in N_Entity);
3895 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag192;
3898 function Flag193 (N : Node_Id) return Boolean is
3900 pragma Assert (Nkind (N) in N_Entity);
3901 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag193;
3904 function Flag194 (N : Node_Id) return Boolean is
3906 pragma Assert (Nkind (N) in N_Entity);
3907 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag194;
3910 function Flag195 (N : Node_Id) return Boolean is
3912 pragma Assert (Nkind (N) in N_Entity);
3913 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag195;
3916 function Flag196 (N : Node_Id) return Boolean is
3918 pragma Assert (Nkind (N) in N_Entity);
3919 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag196;
3922 function Flag197 (N : Node_Id) return Boolean is
3924 pragma Assert (Nkind (N) in N_Entity);
3925 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag197;
3928 function Flag198 (N : Node_Id) return Boolean is
3930 pragma Assert (Nkind (N) in N_Entity);
3931 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag198;
3934 function Flag199 (N : Node_Id) return Boolean is
3936 pragma Assert (Nkind (N) in N_Entity);
3937 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag199;
3940 function Flag200 (N : Node_Id) return Boolean is
3942 pragma Assert (Nkind (N) in N_Entity);
3943 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag200;
3946 function Flag201 (N : Node_Id) return Boolean is
3948 pragma Assert (Nkind (N) in N_Entity);
3949 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag201;
3952 function Flag202 (N : Node_Id) return Boolean is
3954 pragma Assert (Nkind (N) in N_Entity);
3955 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag202;
3958 function Flag203 (N : Node_Id) return Boolean is
3960 pragma Assert (Nkind (N) in N_Entity);
3961 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag203;
3964 function Flag204 (N : Node_Id) return Boolean is
3966 pragma Assert (Nkind (N) in N_Entity);
3967 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag204;
3970 function Flag205 (N : Node_Id) return Boolean is
3972 pragma Assert (Nkind (N) in N_Entity);
3973 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag205;
3976 function Flag206 (N : Node_Id) return Boolean is
3978 pragma Assert (Nkind (N) in N_Entity);
3979 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag206;
3982 function Flag207 (N : Node_Id) return Boolean is
3984 pragma Assert (Nkind (N) in N_Entity);
3985 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag207;
3988 function Flag208 (N : Node_Id) return Boolean is
3990 pragma Assert (Nkind (N) in N_Entity);
3991 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag208;
3994 function Flag209 (N : Node_Id) return Boolean is
3996 pragma Assert (Nkind (N) in N_Entity);
3997 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag209;
4000 function Flag210 (N : Node_Id) return Boolean is
4002 pragma Assert (Nkind (N) in N_Entity);
4003 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag210;
4006 function Flag211 (N : Node_Id) return Boolean is
4008 pragma Assert (Nkind (N) in N_Entity);
4009 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag211;
4012 function Flag212 (N : Node_Id) return Boolean is
4014 pragma Assert (Nkind (N) in N_Entity);
4015 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag212;
4018 function Flag213 (N : Node_Id) return Boolean is
4020 pragma Assert (Nkind (N) in N_Entity);
4021 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag213;
4024 function Flag214 (N : Node_Id) return Boolean is
4026 pragma Assert (Nkind (N) in N_Entity);
4027 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag214;
4030 function Flag215 (N : Node_Id) return Boolean is
4032 pragma Assert (Nkind (N) in N_Entity);
4033 return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag215;
4036 function Flag216 (N : Node_Id) return Boolean is
4038 pragma Assert (Nkind (N) in N_Entity);
4039 return Nodes.Table (N + 4).In_List;
4042 function Flag217 (N : Node_Id) return Boolean is
4044 pragma Assert (Nkind (N) in N_Entity);
4045 return Nodes.Table (N + 4).Has_Aspects;
4048 function Flag218 (N : Node_Id) return Boolean is
4050 pragma Assert (Nkind (N) in N_Entity);
4051 return Nodes.Table (N + 4).Rewrite_Ins;
4054 function Flag219 (N : Node_Id) return Boolean is
4056 pragma Assert (Nkind (N) in N_Entity);
4057 return Nodes.Table (N + 4).Analyzed;
4060 function Flag220 (N : Node_Id) return Boolean is
4062 pragma Assert (Nkind (N) in N_Entity);
4063 return Nodes.Table (N + 4).Comes_From_Source;
4066 function Flag221 (N : Node_Id) return Boolean is
4068 pragma Assert (Nkind (N) in N_Entity);
4069 return Nodes.Table (N + 4).Error_Posted;
4072 function Flag222 (N : Node_Id) return Boolean is
4074 pragma Assert (Nkind (N) in N_Entity);
4075 return Nodes.Table (N + 4).Flag4;
4078 function Flag223 (N : Node_Id) return Boolean is
4080 pragma Assert (Nkind (N) in N_Entity);
4081 return Nodes.Table (N + 4).Flag5;
4084 function Flag224 (N : Node_Id) return Boolean is
4086 pragma Assert (Nkind (N) in N_Entity);
4087 return Nodes.Table (N + 4).Flag6;
4090 function Flag225 (N : Node_Id) return Boolean is
4092 pragma Assert (Nkind (N) in N_Entity);
4093 return Nodes.Table (N + 4).Flag7;
4096 function Flag226 (N : Node_Id) return Boolean is
4098 pragma Assert (Nkind (N) in N_Entity);
4099 return Nodes.Table (N + 4).Flag8;
4102 function Flag227 (N : Node_Id) return Boolean is
4104 pragma Assert (Nkind (N) in N_Entity);
4105 return Nodes.Table (N + 4).Flag9;
4108 function Flag228 (N : Node_Id) return Boolean is
4110 pragma Assert (Nkind (N) in N_Entity);
4111 return Nodes.Table (N + 4).Flag10;
4114 function Flag229 (N : Node_Id) return Boolean is
4116 pragma Assert (Nkind (N) in N_Entity);
4117 return Nodes.Table (N + 4).Flag11;
4120 function Flag230 (N : Node_Id) return Boolean is
4122 pragma Assert (Nkind (N) in N_Entity);
4123 return Nodes.Table (N + 4).Flag12;
4126 function Flag231 (N : Node_Id) return Boolean is
4128 pragma Assert (Nkind (N) in N_Entity);
4129 return Nodes.Table (N + 4).Flag13;
4132 function Flag232 (N : Node_Id) return Boolean is
4134 pragma Assert (Nkind (N) in N_Entity);
4135 return Nodes.Table (N + 4).Flag14;
4138 function Flag233 (N : Node_Id) return Boolean is
4140 pragma Assert (Nkind (N) in N_Entity);
4141 return Nodes.Table (N + 4).Flag15;
4144 function Flag234 (N : Node_Id) return Boolean is
4146 pragma Assert (Nkind (N) in N_Entity);
4147 return Nodes.Table (N + 4).Flag16;
4150 function Flag235 (N : Node_Id) return Boolean is
4152 pragma Assert (Nkind (N) in N_Entity);
4153 return Nodes.Table (N + 4).Flag17;
4156 function Flag236 (N : Node_Id) return Boolean is
4158 pragma Assert (Nkind (N) in N_Entity);
4159 return Nodes.Table (N + 4).Flag18;
4162 function Flag237 (N : Node_Id) return Boolean is
4164 pragma Assert (Nkind (N) in N_Entity);
4165 return Nodes.Table (N + 4).Pflag1;
4168 function Flag238 (N : Node_Id) return Boolean is
4170 pragma Assert (Nkind (N) in N_Entity);
4171 return Nodes.Table (N + 4).Pflag2;
4174 function Flag239 (N : Node_Id) return Boolean is
4176 pragma Assert (Nkind (N) in N_Entity);
4177 return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag239;
4180 function Flag240 (N : Node_Id) return Boolean is
4182 pragma Assert (Nkind (N) in N_Entity);
4183 return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag240;
4186 function Flag241 (N : Node_Id) return Boolean is
4188 pragma Assert (Nkind (N) in N_Entity);
4189 return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag241;
4192 function Flag242 (N : Node_Id) return Boolean is
4194 pragma Assert (Nkind (N) in N_Entity);
4195 return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag242;
4198 function Flag243 (N : Node_Id) return Boolean is
4200 pragma Assert (Nkind (N) in N_Entity);
4201 return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag243;
4204 function Flag244 (N : Node_Id) return Boolean is
4206 pragma Assert (Nkind (N) in N_Entity);
4207 return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag244;
4210 function Flag245 (N : Node_Id) return Boolean is
4212 pragma Assert (Nkind (N) in N_Entity);
4213 return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag245;
4216 function Flag246 (N : Node_Id) return Boolean is
4218 pragma Assert (Nkind (N) in N_Entity);
4219 return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag246;
4222 function Flag247 (N : Node_Id) return Boolean is
4224 pragma Assert (Nkind (N) in N_Entity);
4225 return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag247;
4228 function Flag248 (N : Node_Id) return Boolean is
4230 pragma Assert (Nkind (N) in N_Entity);
4231 return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag248;
4234 function Flag249 (N : Node_Id) return Boolean is
4236 pragma Assert (Nkind (N) in N_Entity);
4237 return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag249;
4240 function Flag250 (N : Node_Id) return Boolean is
4242 pragma Assert (Nkind (N) in N_Entity);
4243 return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag250;
4246 function Flag251 (N : Node_Id) return Boolean is
4248 pragma Assert (Nkind (N) in N_Entity);
4249 return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag251;
4252 function Flag252 (N : Node_Id) return Boolean is
4254 pragma Assert (Nkind (N) in N_Entity);
4255 return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag252;
4258 function Flag253 (N : Node_Id) return Boolean is
4260 pragma Assert (Nkind (N) in N_Entity);
4261 return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag253;
4264 function Flag254 (N : Node_Id) return Boolean is
4266 pragma Assert (Nkind (N) in N_Entity);
4267 return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag254;
4270 procedure Set_Nkind (N : Node_Id; Val : Node_Kind) is
4272 pragma Assert (N <= Nodes.Last);
4273 Nodes.Table (N).Nkind := Val;
4276 procedure Set_Field1 (N : Node_Id; Val : Union_Id) is
4278 pragma Assert (N <= Nodes.Last);
4279 Nodes.Table (N).Field1 := Val;
4282 procedure Set_Field2 (N : Node_Id; Val : Union_Id) is
4284 pragma Assert (N <= Nodes.Last);
4285 Nodes.Table (N).Field2 := Val;
4288 procedure Set_Field3 (N : Node_Id; Val : Union_Id) is
4290 pragma Assert (N <= Nodes.Last);
4291 Nodes.Table (N).Field3 := Val;
4294 procedure Set_Field4 (N : Node_Id; Val : Union_Id) is
4296 pragma Assert (N <= Nodes.Last);
4297 Nodes.Table (N).Field4 := Val;
4300 procedure Set_Field5 (N : Node_Id; Val : Union_Id) is
4302 pragma Assert (N <= Nodes.Last);
4303 Nodes.Table (N).Field5 := Val;
4306 procedure Set_Field6 (N : Node_Id; Val : Union_Id) is
4308 pragma Assert (Nkind (N) in N_Entity);
4309 Nodes.Table (N + 1).Field6 := Val;
4312 procedure Set_Field7 (N : Node_Id; Val : Union_Id) is
4314 pragma Assert (Nkind (N) in N_Entity);
4315 Nodes.Table (N + 1).Field7 := Val;
4318 procedure Set_Field8 (N : Node_Id; Val : Union_Id) is
4320 pragma Assert (Nkind (N) in N_Entity);
4321 Nodes.Table (N + 1).Field8 := Val;
4324 procedure Set_Field9 (N : Node_Id; Val : Union_Id) is
4326 pragma Assert (Nkind (N) in N_Entity);
4327 Nodes.Table (N + 1).Field9 := Val;
4330 procedure Set_Field10 (N : Node_Id; Val : Union_Id) is
4332 pragma Assert (Nkind (N) in N_Entity);
4333 Nodes.Table (N + 1).Field10 := Val;
4336 procedure Set_Field11 (N : Node_Id; Val : Union_Id) is
4338 pragma Assert (Nkind (N) in N_Entity);
4339 Nodes.Table (N + 1).Field11 := Val;
4342 procedure Set_Field12 (N : Node_Id; Val : Union_Id) is
4344 pragma Assert (Nkind (N) in N_Entity);
4345 Nodes.Table (N + 1).Field12 := Val;
4348 procedure Set_Field13 (N : Node_Id; Val : Union_Id) is
4350 pragma Assert (Nkind (N) in N_Entity);
4351 Nodes.Table (N + 2).Field6 := Val;
4354 procedure Set_Field14 (N : Node_Id; Val : Union_Id) is
4356 pragma Assert (Nkind (N) in N_Entity);
4357 Nodes.Table (N + 2).Field7 := Val;
4360 procedure Set_Field15 (N : Node_Id; Val : Union_Id) is
4362 pragma Assert (Nkind (N) in N_Entity);
4363 Nodes.Table (N + 2).Field8 := Val;
4366 procedure Set_Field16 (N : Node_Id; Val : Union_Id) is
4368 pragma Assert (Nkind (N) in N_Entity);
4369 Nodes.Table (N + 2).Field9 := Val;
4372 procedure Set_Field17 (N : Node_Id; Val : Union_Id) is
4374 pragma Assert (Nkind (N) in N_Entity);
4375 Nodes.Table (N + 2).Field10 := Val;
4378 procedure Set_Field18 (N : Node_Id; Val : Union_Id) is
4380 pragma Assert (Nkind (N) in N_Entity);
4381 Nodes.Table (N + 2).Field11 := Val;
4384 procedure Set_Field19 (N : Node_Id; Val : Union_Id) is
4386 pragma Assert (Nkind (N) in N_Entity);
4387 Nodes.Table (N + 3).Field6 := Val;
4390 procedure Set_Field20 (N : Node_Id; Val : Union_Id) is
4392 pragma Assert (Nkind (N) in N_Entity);
4393 Nodes.Table (N + 3).Field7 := Val;
4396 procedure Set_Field21 (N : Node_Id; Val : Union_Id) is
4398 pragma Assert (Nkind (N) in N_Entity);
4399 Nodes.Table (N + 3).Field8 := Val;
4402 procedure Set_Field22 (N : Node_Id; Val : Union_Id) is
4404 pragma Assert (Nkind (N) in N_Entity);
4405 Nodes.Table (N + 3).Field9 := Val;
4408 procedure Set_Field23 (N : Node_Id; Val : Union_Id) is
4410 pragma Assert (Nkind (N) in N_Entity);
4411 Nodes.Table (N + 3).Field10 := Val;
4414 procedure Set_Field24 (N : Node_Id; Val : Union_Id) is
4416 pragma Assert (Nkind (N) in N_Entity);
4417 Nodes.Table (N + 4).Field6 := Val;
4420 procedure Set_Field25 (N : Node_Id; Val : Union_Id) is
4422 pragma Assert (Nkind (N) in N_Entity);
4423 Nodes.Table (N + 4).Field7 := Val;
4426 procedure Set_Field26 (N : Node_Id; Val : Union_Id) is
4428 pragma Assert (Nkind (N) in N_Entity);
4429 Nodes.Table (N + 4).Field8 := Val;
4432 procedure Set_Field27 (N : Node_Id; Val : Union_Id) is
4434 pragma Assert (Nkind (N) in N_Entity);
4435 Nodes.Table (N + 4).Field9 := Val;
4438 procedure Set_Field28 (N : Node_Id; Val : Union_Id) is
4440 pragma Assert (Nkind (N) in N_Entity);
4441 Nodes.Table (N + 4).Field10 := Val;
4444 procedure Set_Field29 (N : Node_Id; Val : Union_Id) is
4446 pragma Assert (Nkind (N) in N_Entity);
4447 Nodes.Table (N + 4).Field11 := Val;
4450 procedure Set_Node1 (N : Node_Id; Val : Node_Id) is
4452 pragma Assert (N <= Nodes.Last);
4453 Nodes.Table (N).Field1 := Union_Id (Val);
4456 procedure Set_Node2 (N : Node_Id; Val : Node_Id) is
4458 pragma Assert (N <= Nodes.Last);
4459 Nodes.Table (N).Field2 := Union_Id (Val);
4462 procedure Set_Node3 (N : Node_Id; Val : Node_Id) is
4464 pragma Assert (N <= Nodes.Last);
4465 Nodes.Table (N).Field3 := Union_Id (Val);
4468 procedure Set_Node4 (N : Node_Id; Val : Node_Id) is
4470 pragma Assert (N <= Nodes.Last);
4471 Nodes.Table (N).Field4 := Union_Id (Val);
4474 procedure Set_Node5 (N : Node_Id; Val : Node_Id) is
4476 pragma Assert (N <= Nodes.Last);
4477 Nodes.Table (N).Field5 := Union_Id (Val);
4480 procedure Set_Node6 (N : Node_Id; Val : Node_Id) is
4482 pragma Assert (Nkind (N) in N_Entity);
4483 Nodes.Table (N + 1).Field6 := Union_Id (Val);
4486 procedure Set_Node7 (N : Node_Id; Val : Node_Id) is
4488 pragma Assert (Nkind (N) in N_Entity);
4489 Nodes.Table (N + 1).Field7 := Union_Id (Val);
4492 procedure Set_Node8 (N : Node_Id; Val : Node_Id) is
4494 pragma Assert (Nkind (N) in N_Entity);
4495 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4498 procedure Set_Node9 (N : Node_Id; Val : Node_Id) is
4500 pragma Assert (Nkind (N) in N_Entity);
4501 Nodes.Table (N + 1).Field9 := Union_Id (Val);
4504 procedure Set_Node10 (N : Node_Id; Val : Node_Id) is
4506 pragma Assert (Nkind (N) in N_Entity);
4507 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4510 procedure Set_Node11 (N : Node_Id; Val : Node_Id) is
4512 pragma Assert (Nkind (N) in N_Entity);
4513 Nodes.Table (N + 1).Field11 := Union_Id (Val);
4516 procedure Set_Node12 (N : Node_Id; Val : Node_Id) is
4518 pragma Assert (Nkind (N) in N_Entity);
4519 Nodes.Table (N + 1).Field12 := Union_Id (Val);
4522 procedure Set_Node13 (N : Node_Id; Val : Node_Id) is
4524 pragma Assert (Nkind (N) in N_Entity);
4525 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4528 procedure Set_Node14 (N : Node_Id; Val : Node_Id) is
4530 pragma Assert (Nkind (N) in N_Entity);
4531 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4534 procedure Set_Node15 (N : Node_Id; Val : Node_Id) is
4536 pragma Assert (Nkind (N) in N_Entity);
4537 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4540 procedure Set_Node16 (N : Node_Id; Val : Node_Id) is
4542 pragma Assert (Nkind (N) in N_Entity);
4543 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4546 procedure Set_Node17 (N : Node_Id; Val : Node_Id) is
4548 pragma Assert (Nkind (N) in N_Entity);
4549 Nodes.Table (N + 2).Field10 := Union_Id (Val);
4552 procedure Set_Node18 (N : Node_Id; Val : Node_Id) is
4554 pragma Assert (Nkind (N) in N_Entity);
4555 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4558 procedure Set_Node19 (N : Node_Id; Val : Node_Id) is
4560 pragma Assert (Nkind (N) in N_Entity);
4561 Nodes.Table (N + 3).Field6 := Union_Id (Val);
4564 procedure Set_Node20 (N : Node_Id; Val : Node_Id) is
4566 pragma Assert (Nkind (N) in N_Entity);
4567 Nodes.Table (N + 3).Field7 := Union_Id (Val);
4570 procedure Set_Node21 (N : Node_Id; Val : Node_Id) is
4572 pragma Assert (Nkind (N) in N_Entity);
4573 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4576 procedure Set_Node22 (N : Node_Id; Val : Node_Id) is
4578 pragma Assert (Nkind (N) in N_Entity);
4579 Nodes.Table (N + 3).Field9 := Union_Id (Val);
4582 procedure Set_Node23 (N : Node_Id; Val : Node_Id) is
4584 pragma Assert (Nkind (N) in N_Entity);
4585 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4588 procedure Set_Node24 (N : Node_Id; Val : Node_Id) is
4590 pragma Assert (Nkind (N) in N_Entity);
4591 Nodes.Table (N + 4).Field6 := Union_Id (Val);
4594 procedure Set_Node25 (N : Node_Id; Val : Node_Id) is
4596 pragma Assert (Nkind (N) in N_Entity);
4597 Nodes.Table (N + 4).Field7 := Union_Id (Val);
4600 procedure Set_Node26 (N : Node_Id; Val : Node_Id) is
4602 pragma Assert (Nkind (N) in N_Entity);
4603 Nodes.Table (N + 4).Field8 := Union_Id (Val);
4606 procedure Set_Node27 (N : Node_Id; Val : Node_Id) is
4608 pragma Assert (Nkind (N) in N_Entity);
4609 Nodes.Table (N + 4).Field9 := Union_Id (Val);
4612 procedure Set_Node28 (N : Node_Id; Val : Node_Id) is
4614 pragma Assert (Nkind (N) in N_Entity);
4615 Nodes.Table (N + 4).Field10 := Union_Id (Val);
4618 procedure Set_Node29 (N : Node_Id; Val : Node_Id) is
4620 pragma Assert (Nkind (N) in N_Entity);
4621 Nodes.Table (N + 4).Field11 := Union_Id (Val);
4624 procedure Set_List1 (N : Node_Id; Val : List_Id) is
4626 pragma Assert (N <= Nodes.Last);
4627 Nodes.Table (N).Field1 := Union_Id (Val);
4630 procedure Set_List2 (N : Node_Id; Val : List_Id) is
4632 pragma Assert (N <= Nodes.Last);
4633 Nodes.Table (N).Field2 := Union_Id (Val);
4636 procedure Set_List3 (N : Node_Id; Val : List_Id) is
4638 pragma Assert (N <= Nodes.Last);
4639 Nodes.Table (N).Field3 := Union_Id (Val);
4642 procedure Set_List4 (N : Node_Id; Val : List_Id) is
4644 pragma Assert (N <= Nodes.Last);
4645 Nodes.Table (N).Field4 := Union_Id (Val);
4648 procedure Set_List5 (N : Node_Id; Val : List_Id) is
4650 pragma Assert (N <= Nodes.Last);
4651 Nodes.Table (N).Field5 := Union_Id (Val);
4654 procedure Set_List10 (N : Node_Id; Val : List_Id) is
4656 pragma Assert (Nkind (N) in N_Entity);
4657 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4660 procedure Set_List14 (N : Node_Id; Val : List_Id) is
4662 pragma Assert (Nkind (N) in N_Entity);
4663 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4666 procedure Set_List25 (N : Node_Id; Val : List_Id) is
4668 pragma Assert (Nkind (N) in N_Entity);
4669 Nodes.Table (N + 4).Field7 := Union_Id (Val);
4672 procedure Set_Elist1 (N : Node_Id; Val : Elist_Id) is
4674 Nodes.Table (N).Field1 := Union_Id (Val);
4677 procedure Set_Elist2 (N : Node_Id; Val : Elist_Id) is
4679 Nodes.Table (N).Field2 := Union_Id (Val);
4682 procedure Set_Elist3 (N : Node_Id; Val : Elist_Id) is
4684 Nodes.Table (N).Field3 := Union_Id (Val);
4687 procedure Set_Elist4 (N : Node_Id; Val : Elist_Id) is
4689 Nodes.Table (N).Field4 := Union_Id (Val);
4692 procedure Set_Elist8 (N : Node_Id; Val : Elist_Id) is
4694 pragma Assert (Nkind (N) in N_Entity);
4695 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4698 procedure Set_Elist10 (N : Node_Id; Val : Elist_Id) is
4700 pragma Assert (Nkind (N) in N_Entity);
4701 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4704 procedure Set_Elist13 (N : Node_Id; Val : Elist_Id) is
4706 pragma Assert (Nkind (N) in N_Entity);
4707 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4710 procedure Set_Elist15 (N : Node_Id; Val : Elist_Id) is
4712 pragma Assert (Nkind (N) in N_Entity);
4713 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4716 procedure Set_Elist16 (N : Node_Id; Val : Elist_Id) is
4718 pragma Assert (Nkind (N) in N_Entity);
4719 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4722 procedure Set_Elist18 (N : Node_Id; Val : Elist_Id) is
4724 pragma Assert (Nkind (N) in N_Entity);
4725 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4728 procedure Set_Elist21 (N : Node_Id; Val : Elist_Id) is
4730 pragma Assert (Nkind (N) in N_Entity);
4731 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4734 procedure Set_Elist23 (N : Node_Id; Val : Elist_Id) is
4736 pragma Assert (Nkind (N) in N_Entity);
4737 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4740 procedure Set_Elist25 (N : Node_Id; Val : Elist_Id) is
4742 pragma Assert (Nkind (N) in N_Entity);
4743 Nodes.Table (N + 4).Field7 := Union_Id (Val);
4746 procedure Set_Elist26 (N : Node_Id; Val : Elist_Id) is
4748 pragma Assert (Nkind (N) in N_Entity);
4749 Nodes.Table (N + 4).Field8 := Union_Id (Val);
4752 procedure Set_Name1 (N : Node_Id; Val : Name_Id) is
4754 pragma Assert (N <= Nodes.Last);
4755 Nodes.Table (N).Field1 := Union_Id (Val);
4758 procedure Set_Name2 (N : Node_Id; Val : Name_Id) is
4760 pragma Assert (N <= Nodes.Last);
4761 Nodes.Table (N).Field2 := Union_Id (Val);
4764 procedure Set_Str3 (N : Node_Id; Val : String_Id) is
4766 pragma Assert (N <= Nodes.Last);
4767 Nodes.Table (N).Field3 := Union_Id (Val);
4770 procedure Set_Uint2 (N : Node_Id; Val : Uint) is
4772 pragma Assert (N <= Nodes.Last);
4773 Nodes.Table (N).Field2 := To_Union (Val);
4776 procedure Set_Uint3 (N : Node_Id; Val : Uint) is
4778 pragma Assert (N <= Nodes.Last);
4779 Nodes.Table (N).Field3 := To_Union (Val);
4782 procedure Set_Uint4 (N : Node_Id; Val : Uint) is
4784 pragma Assert (N <= Nodes.Last);
4785 Nodes.Table (N).Field4 := To_Union (Val);
4788 procedure Set_Uint5 (N : Node_Id; Val : Uint) is
4790 pragma Assert (N <= Nodes.Last);
4791 Nodes.Table (N).Field5 := To_Union (Val);
4794 procedure Set_Uint8 (N : Node_Id; Val : Uint) is
4796 pragma Assert (Nkind (N) in N_Entity);
4797 Nodes.Table (N + 1).Field8 := To_Union (Val);
4800 procedure Set_Uint9 (N : Node_Id; Val : Uint) is
4802 pragma Assert (Nkind (N) in N_Entity);
4803 Nodes.Table (N + 1).Field9 := To_Union (Val);
4806 procedure Set_Uint10 (N : Node_Id; Val : Uint) is
4808 pragma Assert (Nkind (N) in N_Entity);
4809 Nodes.Table (N + 1).Field10 := To_Union (Val);
4812 procedure Set_Uint11 (N : Node_Id; Val : Uint) is
4814 pragma Assert (Nkind (N) in N_Entity);
4815 Nodes.Table (N + 1).Field11 := To_Union (Val);
4818 procedure Set_Uint12 (N : Node_Id; Val : Uint) is
4820 pragma Assert (Nkind (N) in N_Entity);
4821 Nodes.Table (N + 1).Field12 := To_Union (Val);
4824 procedure Set_Uint13 (N : Node_Id; Val : Uint) is
4826 pragma Assert (Nkind (N) in N_Entity);
4827 Nodes.Table (N + 2).Field6 := To_Union (Val);
4830 procedure Set_Uint14 (N : Node_Id; Val : Uint) is
4832 pragma Assert (Nkind (N) in N_Entity);
4833 Nodes.Table (N + 2).Field7 := To_Union (Val);
4836 procedure Set_Uint15 (N : Node_Id; Val : Uint) is
4838 pragma Assert (Nkind (N) in N_Entity);
4839 Nodes.Table (N + 2).Field8 := To_Union (Val);
4842 procedure Set_Uint16 (N : Node_Id; Val : Uint) is
4844 pragma Assert (Nkind (N) in N_Entity);
4845 Nodes.Table (N + 2).Field9 := To_Union (Val);
4848 procedure Set_Uint17 (N : Node_Id; Val : Uint) is
4850 pragma Assert (Nkind (N) in N_Entity);
4851 Nodes.Table (N + 2).Field10 := To_Union (Val);
4854 procedure Set_Uint22 (N : Node_Id; Val : Uint) is
4856 pragma Assert (Nkind (N) in N_Entity);
4857 Nodes.Table (N + 3).Field9 := To_Union (Val);
4860 procedure Set_Ureal3 (N : Node_Id; Val : Ureal) is
4862 pragma Assert (N <= Nodes.Last);
4863 Nodes.Table (N).Field3 := To_Union (Val);
4866 procedure Set_Ureal18 (N : Node_Id; Val : Ureal) is
4868 pragma Assert (Nkind (N) in N_Entity);
4869 Nodes.Table (N + 2).Field11 := To_Union (Val);
4872 procedure Set_Ureal21 (N : Node_Id; Val : Ureal) is
4874 pragma Assert (Nkind (N) in N_Entity);
4875 Nodes.Table (N + 3).Field8 := To_Union (Val);
4878 procedure Set_Flag4 (N : Node_Id; Val : Boolean) is
4880 pragma Assert (N <= Nodes.Last);
4881 Nodes.Table (N).Flag4 := Val;
4884 procedure Set_Flag5 (N : Node_Id; Val : Boolean) is
4886 pragma Assert (N <= Nodes.Last);
4887 Nodes.Table (N).Flag5 := Val;
4890 procedure Set_Flag6 (N : Node_Id; Val : Boolean) is
4892 pragma Assert (N <= Nodes.Last);
4893 Nodes.Table (N).Flag6 := Val;
4896 procedure Set_Flag7 (N : Node_Id; Val : Boolean) is
4898 pragma Assert (N <= Nodes.Last);
4899 Nodes.Table (N).Flag7 := Val;
4902 procedure Set_Flag8 (N : Node_Id; Val : Boolean) is
4904 pragma Assert (N <= Nodes.Last);
4905 Nodes.Table (N).Flag8 := Val;
4908 procedure Set_Flag9 (N : Node_Id; Val : Boolean) is
4910 pragma Assert (N <= Nodes.Last);
4911 Nodes.Table (N).Flag9 := Val;
4914 procedure Set_Flag10 (N : Node_Id; Val : Boolean) is
4916 pragma Assert (N <= Nodes.Last);
4917 Nodes.Table (N).Flag10 := Val;
4920 procedure Set_Flag11 (N : Node_Id; Val : Boolean) is
4922 pragma Assert (N <= Nodes.Last);
4923 Nodes.Table (N).Flag11 := Val;
4926 procedure Set_Flag12 (N : Node_Id; Val : Boolean) is
4928 pragma Assert (N <= Nodes.Last);
4929 Nodes.Table (N).Flag12 := Val;
4932 procedure Set_Flag13 (N : Node_Id; Val : Boolean) is
4934 pragma Assert (N <= Nodes.Last);
4935 Nodes.Table (N).Flag13 := Val;
4938 procedure Set_Flag14 (N : Node_Id; Val : Boolean) is
4940 pragma Assert (N <= Nodes.Last);
4941 Nodes.Table (N).Flag14 := Val;
4944 procedure Set_Flag15 (N : Node_Id; Val : Boolean) is
4946 pragma Assert (N <= Nodes.Last);
4947 Nodes.Table (N).Flag15 := Val;
4950 procedure Set_Flag16 (N : Node_Id; Val : Boolean) is
4952 pragma Assert (N <= Nodes.Last);
4953 Nodes.Table (N).Flag16 := Val;
4956 procedure Set_Flag17 (N : Node_Id; Val : Boolean) is
4958 pragma Assert (N <= Nodes.Last);
4959 Nodes.Table (N).Flag17 := Val;
4962 procedure Set_Flag18 (N : Node_Id; Val : Boolean) is
4964 pragma Assert (N <= Nodes.Last);
4965 Nodes.Table (N).Flag18 := Val;
4968 procedure Set_Flag19 (N : Node_Id; Val : Boolean) is
4970 pragma Assert (Nkind (N) in N_Entity);
4971 Nodes.Table (N + 1).In_List := Val;
4974 procedure Set_Flag20 (N : Node_Id; Val : Boolean) is
4976 pragma Assert (Nkind (N) in N_Entity);
4977 Nodes.Table (N + 1).Has_Aspects := Val;
4980 procedure Set_Flag21 (N : Node_Id; Val : Boolean) is
4982 pragma Assert (Nkind (N) in N_Entity);
4983 Nodes.Table (N + 1).Rewrite_Ins := Val;
4986 procedure Set_Flag22 (N : Node_Id; Val : Boolean) is
4988 pragma Assert (Nkind (N) in N_Entity);
4989 Nodes.Table (N + 1).Analyzed := Val;
4992 procedure Set_Flag23 (N : Node_Id; Val : Boolean) is
4994 pragma Assert (Nkind (N) in N_Entity);
4995 Nodes.Table (N + 1).Comes_From_Source := Val;
4998 procedure Set_Flag24 (N : Node_Id; Val : Boolean) is
5000 pragma Assert (Nkind (N) in N_Entity);
5001 Nodes.Table (N + 1).Error_Posted := Val;
5004 procedure Set_Flag25 (N : Node_Id; Val : Boolean) is
5006 pragma Assert (Nkind (N) in N_Entity);
5007 Nodes.Table (N + 1).Flag4 := Val;
5010 procedure Set_Flag26 (N : Node_Id; Val : Boolean) is
5012 pragma Assert (Nkind (N) in N_Entity);
5013 Nodes.Table (N + 1).Flag5 := Val;
5016 procedure Set_Flag27 (N : Node_Id; Val : Boolean) is
5018 pragma Assert (Nkind (N) in N_Entity);
5019 Nodes.Table (N + 1).Flag6 := Val;
5022 procedure Set_Flag28 (N : Node_Id; Val : Boolean) is
5024 pragma Assert (Nkind (N) in N_Entity);
5025 Nodes.Table (N + 1).Flag7 := Val;
5028 procedure Set_Flag29 (N : Node_Id; Val : Boolean) is
5030 pragma Assert (Nkind (N) in N_Entity);
5031 Nodes.Table (N + 1).Flag8 := Val;
5034 procedure Set_Flag30 (N : Node_Id; Val : Boolean) is
5036 pragma Assert (Nkind (N) in N_Entity);
5037 Nodes.Table (N + 1).Flag9 := Val;
5040 procedure Set_Flag31 (N : Node_Id; Val : Boolean) is
5042 pragma Assert (Nkind (N) in N_Entity);
5043 Nodes.Table (N + 1).Flag10 := Val;
5046 procedure Set_Flag32 (N : Node_Id; Val : Boolean) is
5048 pragma Assert (Nkind (N) in N_Entity);
5049 Nodes.Table (N + 1).Flag11 := Val;
5052 procedure Set_Flag33 (N : Node_Id; Val : Boolean) is
5054 pragma Assert (Nkind (N) in N_Entity);
5055 Nodes.Table (N + 1).Flag12 := Val;
5058 procedure Set_Flag34 (N : Node_Id; Val : Boolean) is
5060 pragma Assert (Nkind (N) in N_Entity);
5061 Nodes.Table (N + 1).Flag13 := Val;
5064 procedure Set_Flag35 (N : Node_Id; Val : Boolean) is
5066 pragma Assert (Nkind (N) in N_Entity);
5067 Nodes.Table (N + 1).Flag14 := Val;
5070 procedure Set_Flag36 (N : Node_Id; Val : Boolean) is
5072 pragma Assert (Nkind (N) in N_Entity);
5073 Nodes.Table (N + 1).Flag15 := Val;
5076 procedure Set_Flag37 (N : Node_Id; Val : Boolean) is
5078 pragma Assert (Nkind (N) in N_Entity);
5079 Nodes.Table (N + 1).Flag16 := Val;
5082 procedure Set_Flag38 (N : Node_Id; Val : Boolean) is
5084 pragma Assert (Nkind (N) in N_Entity);
5085 Nodes.Table (N + 1).Flag17 := Val;
5088 procedure Set_Flag39 (N : Node_Id; Val : Boolean) is
5090 pragma Assert (Nkind (N) in N_Entity);
5091 Nodes.Table (N + 1).Flag18 := Val;
5094 procedure Set_Flag40 (N : Node_Id; Val : Boolean) is
5096 pragma Assert (Nkind (N) in N_Entity);
5097 Nodes.Table (N + 2).In_List := Val;
5100 procedure Set_Flag41 (N : Node_Id; Val : Boolean) is
5102 pragma Assert (Nkind (N) in N_Entity);
5103 Nodes.Table (N + 2).Has_Aspects := Val;
5106 procedure Set_Flag42 (N : Node_Id; Val : Boolean) is
5108 pragma Assert (Nkind (N) in N_Entity);
5109 Nodes.Table (N + 2).Rewrite_Ins := Val;
5112 procedure Set_Flag43 (N : Node_Id; Val : Boolean) is
5114 pragma Assert (Nkind (N) in N_Entity);
5115 Nodes.Table (N + 2).Analyzed := Val;
5118 procedure Set_Flag44 (N : Node_Id; Val : Boolean) is
5120 pragma Assert (Nkind (N) in N_Entity);
5121 Nodes.Table (N + 2).Comes_From_Source := Val;
5124 procedure Set_Flag45 (N : Node_Id; Val : Boolean) is
5126 pragma Assert (Nkind (N) in N_Entity);
5127 Nodes.Table (N + 2).Error_Posted := Val;
5130 procedure Set_Flag46 (N : Node_Id; Val : Boolean) is
5132 pragma Assert (Nkind (N) in N_Entity);
5133 Nodes.Table (N + 2).Flag4 := Val;
5136 procedure Set_Flag47 (N : Node_Id; Val : Boolean) is
5138 pragma Assert (Nkind (N) in N_Entity);
5139 Nodes.Table (N + 2).Flag5 := Val;
5142 procedure Set_Flag48 (N : Node_Id; Val : Boolean) is
5144 pragma Assert (Nkind (N) in N_Entity);
5145 Nodes.Table (N + 2).Flag6 := Val;
5148 procedure Set_Flag49 (N : Node_Id; Val : Boolean) is
5150 pragma Assert (Nkind (N) in N_Entity);
5151 Nodes.Table (N + 2).Flag7 := Val;
5154 procedure Set_Flag50 (N : Node_Id; Val : Boolean) is
5156 pragma Assert (Nkind (N) in N_Entity);
5157 Nodes.Table (N + 2).Flag8 := Val;
5160 procedure Set_Flag51 (N : Node_Id; Val : Boolean) is
5162 pragma Assert (Nkind (N) in N_Entity);
5163 Nodes.Table (N + 2).Flag9 := Val;
5166 procedure Set_Flag52 (N : Node_Id; Val : Boolean) is
5168 pragma Assert (Nkind (N) in N_Entity);
5169 Nodes.Table (N + 2).Flag10 := Val;
5172 procedure Set_Flag53 (N : Node_Id; Val : Boolean) is
5174 pragma Assert (Nkind (N) in N_Entity);
5175 Nodes.Table (N + 2).Flag11 := Val;
5178 procedure Set_Flag54 (N : Node_Id; Val : Boolean) is
5180 pragma Assert (Nkind (N) in N_Entity);
5181 Nodes.Table (N + 2).Flag12 := Val;
5184 procedure Set_Flag55 (N : Node_Id; Val : Boolean) is
5186 pragma Assert (Nkind (N) in N_Entity);
5187 Nodes.Table (N + 2).Flag13 := Val;
5190 procedure Set_Flag56 (N : Node_Id; Val : Boolean) is
5192 pragma Assert (Nkind (N) in N_Entity);
5193 Nodes.Table (N + 2).Flag14 := Val;
5196 procedure Set_Flag57 (N : Node_Id; Val : Boolean) is
5198 pragma Assert (Nkind (N) in N_Entity);
5199 Nodes.Table (N + 2).Flag15 := Val;
5202 procedure Set_Flag58 (N : Node_Id; Val : Boolean) is
5204 pragma Assert (Nkind (N) in N_Entity);
5205 Nodes.Table (N + 2).Flag16 := Val;
5208 procedure Set_Flag59 (N : Node_Id; Val : Boolean) is
5210 pragma Assert (Nkind (N) in N_Entity);
5211 Nodes.Table (N + 2).Flag17 := Val;
5214 procedure Set_Flag60 (N : Node_Id; Val : Boolean) is
5216 pragma Assert (Nkind (N) in N_Entity);
5217 Nodes.Table (N + 2).Flag18 := Val;
5220 procedure Set_Flag61 (N : Node_Id; Val : Boolean) is
5222 pragma Assert (Nkind (N) in N_Entity);
5223 Nodes.Table (N + 1).Pflag1 := Val;
5226 procedure Set_Flag62 (N : Node_Id; Val : Boolean) is
5228 pragma Assert (Nkind (N) in N_Entity);
5229 Nodes.Table (N + 1).Pflag2 := Val;
5232 procedure Set_Flag63 (N : Node_Id; Val : Boolean) is
5234 pragma Assert (Nkind (N) in N_Entity);
5235 Nodes.Table (N + 2).Pflag1 := Val;
5238 procedure Set_Flag64 (N : Node_Id; Val : Boolean) is
5240 pragma Assert (Nkind (N) in N_Entity);
5241 Nodes.Table (N + 2).Pflag2 := Val;
5244 procedure Set_Flag65 (N : Node_Id; Val : Boolean) is
5246 pragma Assert (Nkind (N) in N_Entity);
5249 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag65 := Val;
5252 procedure Set_Flag66 (N : Node_Id; Val : Boolean) is
5254 pragma Assert (Nkind (N) in N_Entity);
5257 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag66 := Val;
5260 procedure Set_Flag67 (N : Node_Id; Val : Boolean) is
5262 pragma Assert (Nkind (N) in N_Entity);
5265 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag67 := Val;
5268 procedure Set_Flag68 (N : Node_Id; Val : Boolean) is
5270 pragma Assert (Nkind (N) in N_Entity);
5273 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag68 := Val;
5276 procedure Set_Flag69 (N : Node_Id; Val : Boolean) is
5278 pragma Assert (Nkind (N) in N_Entity);
5281 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag69 := Val;
5284 procedure Set_Flag70 (N : Node_Id; Val : Boolean) is
5286 pragma Assert (Nkind (N) in N_Entity);
5289 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag70 := Val;
5292 procedure Set_Flag71 (N : Node_Id; Val : Boolean) is
5294 pragma Assert (Nkind (N) in N_Entity);
5297 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag71 := Val;
5300 procedure Set_Flag72 (N : Node_Id; Val : Boolean) is
5302 pragma Assert (Nkind (N) in N_Entity);
5305 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag72 := Val;
5308 procedure Set_Flag73 (N : Node_Id; Val : Boolean) is
5310 pragma Assert (Nkind (N) in N_Entity);
5313 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag73 := Val;
5316 procedure Set_Flag74 (N : Node_Id; Val : Boolean) is
5318 pragma Assert (Nkind (N) in N_Entity);
5321 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag74 := Val;
5324 procedure Set_Flag75 (N : Node_Id; Val : Boolean) is
5326 pragma Assert (Nkind (N) in N_Entity);
5329 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag75 := Val;
5332 procedure Set_Flag76 (N : Node_Id; Val : Boolean) is
5334 pragma Assert (Nkind (N) in N_Entity);
5337 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag76 := Val;
5340 procedure Set_Flag77 (N : Node_Id; Val : Boolean) is
5342 pragma Assert (Nkind (N) in N_Entity);
5345 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag77 := Val;
5348 procedure Set_Flag78 (N : Node_Id; Val : Boolean) is
5350 pragma Assert (Nkind (N) in N_Entity);
5353 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag78 := Val;
5356 procedure Set_Flag79 (N : Node_Id; Val : Boolean) is
5358 pragma Assert (Nkind (N) in N_Entity);
5361 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag79 := Val;
5364 procedure Set_Flag80 (N : Node_Id; Val : Boolean) is
5366 pragma Assert (Nkind (N) in N_Entity);
5369 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag80 := Val;
5372 procedure Set_Flag81 (N : Node_Id; Val : Boolean) is
5374 pragma Assert (Nkind (N) in N_Entity);
5377 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag81 := Val;
5380 procedure Set_Flag82 (N : Node_Id; Val : Boolean) is
5382 pragma Assert (Nkind (N) in N_Entity);
5385 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag82 := Val;
5388 procedure Set_Flag83 (N : Node_Id; Val : Boolean) is
5390 pragma Assert (Nkind (N) in N_Entity);
5393 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag83 := Val;
5396 procedure Set_Flag84 (N : Node_Id; Val : Boolean) is
5398 pragma Assert (Nkind (N) in N_Entity);
5401 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag84 := Val;
5404 procedure Set_Flag85 (N : Node_Id; Val : Boolean) is
5406 pragma Assert (Nkind (N) in N_Entity);
5409 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag85 := Val;
5412 procedure Set_Flag86 (N : Node_Id; Val : Boolean) is
5414 pragma Assert (Nkind (N) in N_Entity);
5417 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag86 := Val;
5420 procedure Set_Flag87 (N : Node_Id; Val : Boolean) is
5422 pragma Assert (Nkind (N) in N_Entity);
5425 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag87 := Val;
5428 procedure Set_Flag88 (N : Node_Id; Val : Boolean) is
5430 pragma Assert (Nkind (N) in N_Entity);
5433 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag88 := Val;
5436 procedure Set_Flag89 (N : Node_Id; Val : Boolean) is
5438 pragma Assert (Nkind (N) in N_Entity);
5441 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag89 := Val;
5444 procedure Set_Flag90 (N : Node_Id; Val : Boolean) is
5446 pragma Assert (Nkind (N) in N_Entity);
5449 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag90 := Val;
5452 procedure Set_Flag91 (N : Node_Id; Val : Boolean) is
5454 pragma Assert (Nkind (N) in N_Entity);
5457 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag91 := Val;
5460 procedure Set_Flag92 (N : Node_Id; Val : Boolean) is
5462 pragma Assert (Nkind (N) in N_Entity);
5465 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag92 := Val;
5468 procedure Set_Flag93 (N : Node_Id; Val : Boolean) is
5470 pragma Assert (Nkind (N) in N_Entity);
5473 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag93 := Val;
5476 procedure Set_Flag94 (N : Node_Id; Val : Boolean) is
5478 pragma Assert (Nkind (N) in N_Entity);
5481 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag94 := Val;
5484 procedure Set_Flag95 (N : Node_Id; Val : Boolean) is
5486 pragma Assert (Nkind (N) in N_Entity);
5489 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag95 := Val;
5492 procedure Set_Flag96 (N : Node_Id; Val : Boolean) is
5494 pragma Assert (Nkind (N) in N_Entity);
5497 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag96 := Val;
5500 procedure Set_Flag97 (N : Node_Id; Val : Boolean) is
5502 pragma Assert (Nkind (N) in N_Entity);
5505 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag97 := Val;
5508 procedure Set_Flag98 (N : Node_Id; Val : Boolean) is
5510 pragma Assert (Nkind (N) in N_Entity);
5513 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag98 := Val;
5516 procedure Set_Flag99 (N : Node_Id; Val : Boolean) is
5518 pragma Assert (Nkind (N) in N_Entity);
5521 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag99 := Val;
5524 procedure Set_Flag100 (N : Node_Id; Val : Boolean) is
5526 pragma Assert (Nkind (N) in N_Entity);
5529 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag100 := Val;
5532 procedure Set_Flag101 (N : Node_Id; Val : Boolean) is
5534 pragma Assert (Nkind (N) in N_Entity);
5537 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag101 := Val;
5540 procedure Set_Flag102 (N : Node_Id; Val : Boolean) is
5542 pragma Assert (Nkind (N) in N_Entity);
5545 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag102 := Val;
5548 procedure Set_Flag103 (N : Node_Id; Val : Boolean) is
5550 pragma Assert (Nkind (N) in N_Entity);
5553 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag103 := Val;
5556 procedure Set_Flag104 (N : Node_Id; Val : Boolean) is
5558 pragma Assert (Nkind (N) in N_Entity);
5561 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag104 := Val;
5564 procedure Set_Flag105 (N : Node_Id; Val : Boolean) is
5566 pragma Assert (Nkind (N) in N_Entity);
5569 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag105 := Val;
5572 procedure Set_Flag106 (N : Node_Id; Val : Boolean) is
5574 pragma Assert (Nkind (N) in N_Entity);
5577 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag106 := Val;
5580 procedure Set_Flag107 (N : Node_Id; Val : Boolean) is
5582 pragma Assert (Nkind (N) in N_Entity);
5585 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag107 := Val;
5588 procedure Set_Flag108 (N : Node_Id; Val : Boolean) is
5590 pragma Assert (Nkind (N) in N_Entity);
5593 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag108 := Val;
5596 procedure Set_Flag109 (N : Node_Id; Val : Boolean) is
5598 pragma Assert (Nkind (N) in N_Entity);
5601 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag109 := Val;
5604 procedure Set_Flag110 (N : Node_Id; Val : Boolean) is
5606 pragma Assert (Nkind (N) in N_Entity);
5609 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag110 := Val;
5612 procedure Set_Flag111 (N : Node_Id; Val : Boolean) is
5614 pragma Assert (Nkind (N) in N_Entity);
5617 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag111 := Val;
5620 procedure Set_Flag112 (N : Node_Id; Val : Boolean) is
5622 pragma Assert (Nkind (N) in N_Entity);
5625 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag112 := Val;
5628 procedure Set_Flag113 (N : Node_Id; Val : Boolean) is
5630 pragma Assert (Nkind (N) in N_Entity);
5633 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag113 := Val;
5636 procedure Set_Flag114 (N : Node_Id; Val : Boolean) is
5638 pragma Assert (Nkind (N) in N_Entity);
5641 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag114 := Val;
5644 procedure Set_Flag115 (N : Node_Id; Val : Boolean) is
5646 pragma Assert (Nkind (N) in N_Entity);
5649 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag115 := Val;
5652 procedure Set_Flag116 (N : Node_Id; Val : Boolean) is
5654 pragma Assert (Nkind (N) in N_Entity);
5657 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag116 := Val;
5660 procedure Set_Flag117 (N : Node_Id; Val : Boolean) is
5662 pragma Assert (Nkind (N) in N_Entity);
5665 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag117 := Val;
5668 procedure Set_Flag118 (N : Node_Id; Val : Boolean) is
5670 pragma Assert (Nkind (N) in N_Entity);
5673 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag118 := Val;
5676 procedure Set_Flag119 (N : Node_Id; Val : Boolean) is
5678 pragma Assert (Nkind (N) in N_Entity);
5681 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag119 := Val;
5684 procedure Set_Flag120 (N : Node_Id; Val : Boolean) is
5686 pragma Assert (Nkind (N) in N_Entity);
5689 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag120 := Val;
5692 procedure Set_Flag121 (N : Node_Id; Val : Boolean) is
5694 pragma Assert (Nkind (N) in N_Entity);
5697 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag121 := Val;
5700 procedure Set_Flag122 (N : Node_Id; Val : Boolean) is
5702 pragma Assert (Nkind (N) in N_Entity);
5705 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag122 := Val;
5708 procedure Set_Flag123 (N : Node_Id; Val : Boolean) is
5710 pragma Assert (Nkind (N) in N_Entity);
5713 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag123 := Val;
5716 procedure Set_Flag124 (N : Node_Id; Val : Boolean) is
5718 pragma Assert (Nkind (N) in N_Entity);
5721 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag124 := Val;
5724 procedure Set_Flag125 (N : Node_Id; Val : Boolean) is
5726 pragma Assert (Nkind (N) in N_Entity);
5729 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag125 := Val;
5732 procedure Set_Flag126 (N : Node_Id; Val : Boolean) is
5734 pragma Assert (Nkind (N) in N_Entity);
5737 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag126 := Val;
5740 procedure Set_Flag127 (N : Node_Id; Val : Boolean) is
5742 pragma Assert (Nkind (N) in N_Entity);
5745 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag127 := Val;
5748 procedure Set_Flag128 (N : Node_Id; Val : Boolean) is
5750 pragma Assert (Nkind (N) in N_Entity);
5753 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag128 := Val;
5756 procedure Set_Flag129 (N : Node_Id; Val : Boolean) is
5758 pragma Assert (Nkind (N) in N_Entity);
5759 Nodes.Table (N + 3).In_List := Val;
5762 procedure Set_Flag130 (N : Node_Id; Val : Boolean) is
5764 pragma Assert (Nkind (N) in N_Entity);
5765 Nodes.Table (N + 3).Has_Aspects := Val;
5768 procedure Set_Flag131 (N : Node_Id; Val : Boolean) is
5770 pragma Assert (Nkind (N) in N_Entity);
5771 Nodes.Table (N + 3).Rewrite_Ins := Val;
5774 procedure Set_Flag132 (N : Node_Id; Val : Boolean) is
5776 pragma Assert (Nkind (N) in N_Entity);
5777 Nodes.Table (N + 3).Analyzed := Val;
5780 procedure Set_Flag133 (N : Node_Id; Val : Boolean) is
5782 pragma Assert (Nkind (N) in N_Entity);
5783 Nodes.Table (N + 3).Comes_From_Source := Val;
5786 procedure Set_Flag134 (N : Node_Id; Val : Boolean) is
5788 pragma Assert (Nkind (N) in N_Entity);
5789 Nodes.Table (N + 3).Error_Posted := Val;
5792 procedure Set_Flag135 (N : Node_Id; Val : Boolean) is
5794 pragma Assert (Nkind (N) in N_Entity);
5795 Nodes.Table (N + 3).Flag4 := Val;
5798 procedure Set_Flag136 (N : Node_Id; Val : Boolean) is
5800 pragma Assert (Nkind (N) in N_Entity);
5801 Nodes.Table (N + 3).Flag5 := Val;
5804 procedure Set_Flag137 (N : Node_Id; Val : Boolean) is
5806 pragma Assert (Nkind (N) in N_Entity);
5807 Nodes.Table (N + 3).Flag6 := Val;
5810 procedure Set_Flag138 (N : Node_Id; Val : Boolean) is
5812 pragma Assert (Nkind (N) in N_Entity);
5813 Nodes.Table (N + 3).Flag7 := Val;
5816 procedure Set_Flag139 (N : Node_Id; Val : Boolean) is
5818 pragma Assert (Nkind (N) in N_Entity);
5819 Nodes.Table (N + 3).Flag8 := Val;
5822 procedure Set_Flag140 (N : Node_Id; Val : Boolean) is
5824 pragma Assert (Nkind (N) in N_Entity);
5825 Nodes.Table (N + 3).Flag9 := Val;
5828 procedure Set_Flag141 (N : Node_Id; Val : Boolean) is
5830 pragma Assert (Nkind (N) in N_Entity);
5831 Nodes.Table (N + 3).Flag10 := Val;
5834 procedure Set_Flag142 (N : Node_Id; Val : Boolean) is
5836 pragma Assert (Nkind (N) in N_Entity);
5837 Nodes.Table (N + 3).Flag11 := Val;
5840 procedure Set_Flag143 (N : Node_Id; Val : Boolean) is
5842 pragma Assert (Nkind (N) in N_Entity);
5843 Nodes.Table (N + 3).Flag12 := Val;
5846 procedure Set_Flag144 (N : Node_Id; Val : Boolean) is
5848 pragma Assert (Nkind (N) in N_Entity);
5849 Nodes.Table (N + 3).Flag13 := Val;
5852 procedure Set_Flag145 (N : Node_Id; Val : Boolean) is
5854 pragma Assert (Nkind (N) in N_Entity);
5855 Nodes.Table (N + 3).Flag14 := Val;
5858 procedure Set_Flag146 (N : Node_Id; Val : Boolean) is
5860 pragma Assert (Nkind (N) in N_Entity);
5861 Nodes.Table (N + 3).Flag15 := Val;
5864 procedure Set_Flag147 (N : Node_Id; Val : Boolean) is
5866 pragma Assert (Nkind (N) in N_Entity);
5867 Nodes.Table (N + 3).Flag16 := Val;
5870 procedure Set_Flag148 (N : Node_Id; Val : Boolean) is
5872 pragma Assert (Nkind (N) in N_Entity);
5873 Nodes.Table (N + 3).Flag17 := Val;
5876 procedure Set_Flag149 (N : Node_Id; Val : Boolean) is
5878 pragma Assert (Nkind (N) in N_Entity);
5879 Nodes.Table (N + 3).Flag18 := Val;
5882 procedure Set_Flag150 (N : Node_Id; Val : Boolean) is
5884 pragma Assert (Nkind (N) in N_Entity);
5885 Nodes.Table (N + 3).Pflag1 := Val;
5888 procedure Set_Flag151 (N : Node_Id; Val : Boolean) is
5890 pragma Assert (Nkind (N) in N_Entity);
5891 Nodes.Table (N + 3).Pflag2 := Val;
5894 procedure Set_Flag152 (N : Node_Id; Val : Boolean) is
5896 pragma Assert (Nkind (N) in N_Entity);
5899 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag152 := Val;
5902 procedure Set_Flag153 (N : Node_Id; Val : Boolean) is
5904 pragma Assert (Nkind (N) in N_Entity);
5907 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag153 := Val;
5910 procedure Set_Flag154 (N : Node_Id; Val : Boolean) is
5912 pragma Assert (Nkind (N) in N_Entity);
5915 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag154 := Val;
5918 procedure Set_Flag155 (N : Node_Id; Val : Boolean) is
5920 pragma Assert (Nkind (N) in N_Entity);
5923 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag155 := Val;
5926 procedure Set_Flag156 (N : Node_Id; Val : Boolean) is
5928 pragma Assert (Nkind (N) in N_Entity);
5931 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag156 := Val;
5934 procedure Set_Flag157 (N : Node_Id; Val : Boolean) is
5936 pragma Assert (Nkind (N) in N_Entity);
5939 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag157 := Val;
5942 procedure Set_Flag158 (N : Node_Id; Val : Boolean) is
5944 pragma Assert (Nkind (N) in N_Entity);
5947 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag158 := Val;
5950 procedure Set_Flag159 (N : Node_Id; Val : Boolean) is
5952 pragma Assert (Nkind (N) in N_Entity);
5955 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag159 := Val;
5958 procedure Set_Flag160 (N : Node_Id; Val : Boolean) is
5960 pragma Assert (Nkind (N) in N_Entity);
5963 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag160 := Val;
5966 procedure Set_Flag161 (N : Node_Id; Val : Boolean) is
5968 pragma Assert (Nkind (N) in N_Entity);
5971 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag161 := Val;
5974 procedure Set_Flag162 (N : Node_Id; Val : Boolean) is
5976 pragma Assert (Nkind (N) in N_Entity);
5979 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag162 := Val;
5982 procedure Set_Flag163 (N : Node_Id; Val : Boolean) is
5984 pragma Assert (Nkind (N) in N_Entity);
5987 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag163 := Val;
5990 procedure Set_Flag164 (N : Node_Id; Val : Boolean) is
5992 pragma Assert (Nkind (N) in N_Entity);
5995 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag164 := Val;
5998 procedure Set_Flag165 (N : Node_Id; Val : Boolean) is
6000 pragma Assert (Nkind (N) in N_Entity);
6003 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag165 := Val;
6006 procedure Set_Flag166 (N : Node_Id; Val : Boolean) is
6008 pragma Assert (Nkind (N) in N_Entity);
6011 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag166 := Val;
6014 procedure Set_Flag167 (N : Node_Id; Val : Boolean) is
6016 pragma Assert (Nkind (N) in N_Entity);
6019 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag167 := Val;
6022 procedure Set_Flag168 (N : Node_Id; Val : Boolean) is
6024 pragma Assert (Nkind (N) in N_Entity);
6027 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag168 := Val;
6030 procedure Set_Flag169 (N : Node_Id; Val : Boolean) is
6032 pragma Assert (Nkind (N) in N_Entity);
6035 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag169 := Val;
6038 procedure Set_Flag170 (N : Node_Id; Val : Boolean) is
6040 pragma Assert (Nkind (N) in N_Entity);
6043 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag170 := Val;
6046 procedure Set_Flag171 (N : Node_Id; Val : Boolean) is
6048 pragma Assert (Nkind (N) in N_Entity);
6051 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag171 := Val;
6054 procedure Set_Flag172 (N : Node_Id; Val : Boolean) is
6056 pragma Assert (Nkind (N) in N_Entity);
6059 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag172 := Val;
6062 procedure Set_Flag173 (N : Node_Id; Val : Boolean) is
6064 pragma Assert (Nkind (N) in N_Entity);
6067 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag173 := Val;
6070 procedure Set_Flag174 (N : Node_Id; Val : Boolean) is
6072 pragma Assert (Nkind (N) in N_Entity);
6075 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag174 := Val;
6078 procedure Set_Flag175 (N : Node_Id; Val : Boolean) is
6080 pragma Assert (Nkind (N) in N_Entity);
6083 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag175 := Val;
6086 procedure Set_Flag176 (N : Node_Id; Val : Boolean) is
6088 pragma Assert (Nkind (N) in N_Entity);
6091 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag176 := Val;
6094 procedure Set_Flag177 (N : Node_Id; Val : Boolean) is
6096 pragma Assert (Nkind (N) in N_Entity);
6099 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag177 := Val;
6102 procedure Set_Flag178 (N : Node_Id; Val : Boolean) is
6104 pragma Assert (Nkind (N) in N_Entity);
6107 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag178 := Val;
6110 procedure Set_Flag179 (N : Node_Id; Val : Boolean) is
6112 pragma Assert (Nkind (N) in N_Entity);
6115 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag179 := Val;
6118 procedure Set_Flag180 (N : Node_Id; Val : Boolean) is
6120 pragma Assert (Nkind (N) in N_Entity);
6123 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag180 := Val;
6126 procedure Set_Flag181 (N : Node_Id; Val : Boolean) is
6128 pragma Assert (Nkind (N) in N_Entity);
6131 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag181 := Val;
6134 procedure Set_Flag182 (N : Node_Id; Val : Boolean) is
6136 pragma Assert (Nkind (N) in N_Entity);
6139 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag182 := Val;
6142 procedure Set_Flag183 (N : Node_Id; Val : Boolean) is
6144 pragma Assert (Nkind (N) in N_Entity);
6147 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag183 := Val;
6150 procedure Set_Flag184 (N : Node_Id; Val : Boolean) is
6152 pragma Assert (Nkind (N) in N_Entity);
6155 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag184 := Val;
6158 procedure Set_Flag185 (N : Node_Id; Val : Boolean) is
6160 pragma Assert (Nkind (N) in N_Entity);
6163 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag185 := Val;
6166 procedure Set_Flag186 (N : Node_Id; Val : Boolean) is
6168 pragma Assert (Nkind (N) in N_Entity);
6171 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag186 := Val;
6174 procedure Set_Flag187 (N : Node_Id; Val : Boolean) is
6176 pragma Assert (Nkind (N) in N_Entity);
6179 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag187 := Val;
6182 procedure Set_Flag188 (N : Node_Id; Val : Boolean) is
6184 pragma Assert (Nkind (N) in N_Entity);
6187 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag188 := Val;
6190 procedure Set_Flag189 (N : Node_Id; Val : Boolean) is
6192 pragma Assert (Nkind (N) in N_Entity);
6195 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag189 := Val;
6198 procedure Set_Flag190 (N : Node_Id; Val : Boolean) is
6200 pragma Assert (Nkind (N) in N_Entity);
6203 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag190 := Val;
6206 procedure Set_Flag191 (N : Node_Id; Val : Boolean) is
6208 pragma Assert (Nkind (N) in N_Entity);
6211 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag191 := Val;
6214 procedure Set_Flag192 (N : Node_Id; Val : Boolean) is
6216 pragma Assert (Nkind (N) in N_Entity);
6219 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag192 := Val;
6222 procedure Set_Flag193 (N : Node_Id; Val : Boolean) is
6224 pragma Assert (Nkind (N) in N_Entity);
6227 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag193 := Val;
6230 procedure Set_Flag194 (N : Node_Id; Val : Boolean) is
6232 pragma Assert (Nkind (N) in N_Entity);
6235 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag194 := Val;
6238 procedure Set_Flag195 (N : Node_Id; Val : Boolean) is
6240 pragma Assert (Nkind (N) in N_Entity);
6243 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag195 := Val;
6246 procedure Set_Flag196 (N : Node_Id; Val : Boolean) is
6248 pragma Assert (Nkind (N) in N_Entity);
6251 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag196 := Val;
6254 procedure Set_Flag197 (N : Node_Id; Val : Boolean) is
6256 pragma Assert (Nkind (N) in N_Entity);
6259 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag197 := Val;
6262 procedure Set_Flag198 (N : Node_Id; Val : Boolean) is
6264 pragma Assert (Nkind (N) in N_Entity);
6267 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag198 := Val;
6270 procedure Set_Flag199 (N : Node_Id; Val : Boolean) is
6272 pragma Assert (Nkind (N) in N_Entity);
6275 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag199 := Val;
6278 procedure Set_Flag200 (N : Node_Id; Val : Boolean) is
6280 pragma Assert (Nkind (N) in N_Entity);
6283 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag200 := Val;
6286 procedure Set_Flag201 (N : Node_Id; Val : Boolean) is
6288 pragma Assert (Nkind (N) in N_Entity);
6291 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag201 := Val;
6294 procedure Set_Flag202 (N : Node_Id; Val : Boolean) is
6296 pragma Assert (Nkind (N) in N_Entity);
6299 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag202 := Val;
6302 procedure Set_Flag203 (N : Node_Id; Val : Boolean) is
6304 pragma Assert (Nkind (N) in N_Entity);
6307 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag203 := Val;
6310 procedure Set_Flag204 (N : Node_Id; Val : Boolean) is
6312 pragma Assert (Nkind (N) in N_Entity);
6315 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag204 := Val;
6318 procedure Set_Flag205 (N : Node_Id; Val : Boolean) is
6320 pragma Assert (Nkind (N) in N_Entity);
6323 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag205 := Val;
6326 procedure Set_Flag206 (N : Node_Id; Val : Boolean) is
6328 pragma Assert (Nkind (N) in N_Entity);
6331 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag206 := Val;
6334 procedure Set_Flag207 (N : Node_Id; Val : Boolean) is
6336 pragma Assert (Nkind (N) in N_Entity);
6339 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag207 := Val;
6342 procedure Set_Flag208 (N : Node_Id; Val : Boolean) is
6344 pragma Assert (Nkind (N) in N_Entity);
6347 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag208 := Val;
6350 procedure Set_Flag209 (N : Node_Id; Val : Boolean) is
6352 pragma Assert (Nkind (N) in N_Entity);
6355 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag209 := Val;
6358 procedure Set_Flag210 (N : Node_Id; Val : Boolean) is
6360 pragma Assert (Nkind (N) in N_Entity);
6363 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag210 := Val;
6366 procedure Set_Flag211 (N : Node_Id; Val : Boolean) is
6368 pragma Assert (Nkind (N) in N_Entity);
6371 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag211 := Val;
6374 procedure Set_Flag212 (N : Node_Id; Val : Boolean) is
6376 pragma Assert (Nkind (N) in N_Entity);
6379 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag212 := Val;
6382 procedure Set_Flag213 (N : Node_Id; Val : Boolean) is
6384 pragma Assert (Nkind (N) in N_Entity);
6387 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag213 := Val;
6390 procedure Set_Flag214 (N : Node_Id; Val : Boolean) is
6392 pragma Assert (Nkind (N) in N_Entity);
6395 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag214 := Val;
6398 procedure Set_Flag215 (N : Node_Id; Val : Boolean) is
6400 pragma Assert (Nkind (N) in N_Entity);
6403 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag215 := Val;
6406 procedure Set_Flag216 (N : Node_Id; Val : Boolean) is
6408 pragma Assert (Nkind (N) in N_Entity);
6409 Nodes.Table (N + 4).In_List := Val;
6412 procedure Set_Flag217 (N : Node_Id; Val : Boolean) is
6414 pragma Assert (Nkind (N) in N_Entity);
6415 Nodes.Table (N + 4).Has_Aspects := Val;
6418 procedure Set_Flag218 (N : Node_Id; Val : Boolean) is
6420 pragma Assert (Nkind (N) in N_Entity);
6421 Nodes.Table (N + 4).Rewrite_Ins := Val;
6424 procedure Set_Flag219 (N : Node_Id; Val : Boolean) is
6426 pragma Assert (Nkind (N) in N_Entity);
6427 Nodes.Table (N + 4).Analyzed := Val;
6430 procedure Set_Flag220 (N : Node_Id; Val : Boolean) is
6432 pragma Assert (Nkind (N) in N_Entity);
6433 Nodes.Table (N + 4).Comes_From_Source := Val;
6436 procedure Set_Flag221 (N : Node_Id; Val : Boolean) is
6438 pragma Assert (Nkind (N) in N_Entity);
6439 Nodes.Table (N + 4).Error_Posted := Val;
6442 procedure Set_Flag222 (N : Node_Id; Val : Boolean) is
6444 pragma Assert (Nkind (N) in N_Entity);
6445 Nodes.Table (N + 4).Flag4 := Val;
6448 procedure Set_Flag223 (N : Node_Id; Val : Boolean) is
6450 pragma Assert (Nkind (N) in N_Entity);
6451 Nodes.Table (N + 4).Flag5 := Val;
6454 procedure Set_Flag224 (N : Node_Id; Val : Boolean) is
6456 pragma Assert (Nkind (N) in N_Entity);
6457 Nodes.Table (N + 4).Flag6 := Val;
6460 procedure Set_Flag225 (N : Node_Id; Val : Boolean) is
6462 pragma Assert (Nkind (N) in N_Entity);
6463 Nodes.Table (N + 4).Flag7 := Val;
6466 procedure Set_Flag226 (N : Node_Id; Val : Boolean) is
6468 pragma Assert (Nkind (N) in N_Entity);
6469 Nodes.Table (N + 4).Flag8 := Val;
6472 procedure Set_Flag227 (N : Node_Id; Val : Boolean) is
6474 pragma Assert (Nkind (N) in N_Entity);
6475 Nodes.Table (N + 4).Flag9 := Val;
6478 procedure Set_Flag228 (N : Node_Id; Val : Boolean) is
6480 pragma Assert (Nkind (N) in N_Entity);
6481 Nodes.Table (N + 4).Flag10 := Val;
6484 procedure Set_Flag229 (N : Node_Id; Val : Boolean) is
6486 pragma Assert (Nkind (N) in N_Entity);
6487 Nodes.Table (N + 4).Flag11 := Val;
6490 procedure Set_Flag230 (N : Node_Id; Val : Boolean) is
6492 pragma Assert (Nkind (N) in N_Entity);
6493 Nodes.Table (N + 4).Flag12 := Val;
6496 procedure Set_Flag231 (N : Node_Id; Val : Boolean) is
6498 pragma Assert (Nkind (N) in N_Entity);
6499 Nodes.Table (N + 4).Flag13 := Val;
6502 procedure Set_Flag232 (N : Node_Id; Val : Boolean) is
6504 pragma Assert (Nkind (N) in N_Entity);
6505 Nodes.Table (N + 4).Flag14 := Val;
6508 procedure Set_Flag233 (N : Node_Id; Val : Boolean) is
6510 pragma Assert (Nkind (N) in N_Entity);
6511 Nodes.Table (N + 4).Flag15 := Val;
6514 procedure Set_Flag234 (N : Node_Id; Val : Boolean) is
6516 pragma Assert (Nkind (N) in N_Entity);
6517 Nodes.Table (N + 4).Flag16 := Val;
6520 procedure Set_Flag235 (N : Node_Id; Val : Boolean) is
6522 pragma Assert (Nkind (N) in N_Entity);
6523 Nodes.Table (N + 4).Flag17 := Val;
6526 procedure Set_Flag236 (N : Node_Id; Val : Boolean) is
6528 pragma Assert (Nkind (N) in N_Entity);
6529 Nodes.Table (N + 4).Flag18 := Val;
6532 procedure Set_Flag237 (N : Node_Id; Val : Boolean) is
6534 pragma Assert (Nkind (N) in N_Entity);
6535 Nodes.Table (N + 4).Pflag1 := Val;
6538 procedure Set_Flag238 (N : Node_Id; Val : Boolean) is
6540 pragma Assert (Nkind (N) in N_Entity);
6541 Nodes.Table (N + 4).Pflag2 := Val;
6544 procedure Set_Flag239 (N : Node_Id; Val : Boolean) is
6546 pragma Assert (Nkind (N) in N_Entity);
6549 (Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag239 := Val;
6552 procedure Set_Flag240 (N : Node_Id; Val : Boolean) is
6554 pragma Assert (Nkind (N) in N_Entity);
6557 (Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag240 := Val;
6560 procedure Set_Flag241 (N : Node_Id; Val : Boolean) is
6562 pragma Assert (Nkind (N) in N_Entity);
6565 (Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag241 := Val;
6568 procedure Set_Flag242 (N : Node_Id; Val : Boolean) is
6570 pragma Assert (Nkind (N) in N_Entity);
6573 (Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag242 := Val;
6576 procedure Set_Flag243 (N : Node_Id; Val : Boolean) is
6578 pragma Assert (Nkind (N) in N_Entity);
6581 (Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag243 := Val;
6584 procedure Set_Flag244 (N : Node_Id; Val : Boolean) is
6586 pragma Assert (Nkind (N) in N_Entity);
6589 (Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag244 := Val;
6592 procedure Set_Flag245 (N : Node_Id; Val : Boolean) is
6594 pragma Assert (Nkind (N) in N_Entity);
6597 (Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag245 := Val;
6600 procedure Set_Flag246 (N : Node_Id; Val : Boolean) is
6602 pragma Assert (Nkind (N) in N_Entity);
6605 (Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag246 := Val;
6608 procedure Set_Flag247 (N : Node_Id; Val : Boolean) is
6610 pragma Assert (Nkind (N) in N_Entity);
6613 (Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag247 := Val;
6616 procedure Set_Flag248 (N : Node_Id; Val : Boolean) is
6618 pragma Assert (Nkind (N) in N_Entity);
6621 (Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag248 := Val;
6624 procedure Set_Flag249 (N : Node_Id; Val : Boolean) is
6626 pragma Assert (Nkind (N) in N_Entity);
6629 (Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag249 := Val;
6632 procedure Set_Flag250 (N : Node_Id; Val : Boolean) is
6634 pragma Assert (Nkind (N) in N_Entity);
6637 (Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag250 := Val;
6640 procedure Set_Flag251 (N : Node_Id; Val : Boolean) is
6642 pragma Assert (Nkind (N) in N_Entity);
6645 (Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag251 := Val;
6648 procedure Set_Flag252 (N : Node_Id; Val : Boolean) is
6650 pragma Assert (Nkind (N) in N_Entity);
6653 (Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag252 := Val;
6656 procedure Set_Flag253 (N : Node_Id; Val : Boolean) is
6658 pragma Assert (Nkind (N) in N_Entity);
6661 (Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag253 := Val;
6664 procedure Set_Flag254 (N : Node_Id; Val : Boolean) is
6666 pragma Assert (Nkind (N) in N_Entity);
6669 (Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag254 := Val;
6672 procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id) is
6674 pragma Assert (N <= Nodes.Last);
6677 Set_Parent (N => Val, Val => N);
6681 end Set_Node1_With_Parent;
6683 procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id) is
6685 pragma Assert (N <= Nodes.Last);
6688 Set_Parent (N => Val, Val => N);
6692 end Set_Node2_With_Parent;
6694 procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id) is
6696 pragma Assert (N <= Nodes.Last);
6699 Set_Parent (N => Val, Val => N);
6703 end Set_Node3_With_Parent;
6705 procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id) is
6707 pragma Assert (N <= Nodes.Last);
6710 Set_Parent (N => Val, Val => N);
6714 end Set_Node4_With_Parent;
6716 procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id) is
6718 pragma Assert (N <= Nodes.Last);
6721 Set_Parent (N => Val, Val => N);
6725 end Set_Node5_With_Parent;
6727 procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id) is
6729 pragma Assert (N <= Nodes.Last);
6730 if Val /= No_List and then Val /= Error_List then
6731 Set_Parent (Val, N);
6734 end Set_List1_With_Parent;
6736 procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id) is
6738 pragma Assert (N <= Nodes.Last);
6739 if Val /= No_List and then Val /= Error_List then
6740 Set_Parent (Val, N);
6743 end Set_List2_With_Parent;
6745 procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id) is
6747 pragma Assert (N <= Nodes.Last);
6748 if Val /= No_List and then Val /= Error_List then
6749 Set_Parent (Val, N);
6752 end Set_List3_With_Parent;
6754 procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id) is
6756 pragma Assert (N <= Nodes.Last);
6757 if Val /= No_List and then Val /= Error_List then
6758 Set_Parent (Val, N);
6761 end Set_List4_With_Parent;
6763 procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id) is
6765 pragma Assert (N <= Nodes.Last);
6766 if Val /= No_List and then Val /= Error_List then
6767 Set_Parent (Val, N);
6770 end Set_List5_With_Parent;
6772 end Unchecked_Access;
6780 Nodes.Locked := False;
6781 Orig_Nodes.Locked := False;