1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2009, 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 Debug; use Debug;
40 with Nlists; use Nlists;
41 with Output; use Output;
42 with Sinput; use Sinput;
43 with Tree_IO; use Tree_IO;
51 -- Suppose you find that node 12345 is messed up. You might want to find
52 -- the code that created that node. There are two ways to do this:
54 -- One way is to set a conditional breakpoint on New_Node_Debugging_Output
56 -- break nnd if n = 12345
57 -- and run gnat1 again from the beginning.
59 -- The other way is to set a breakpoint near the beginning (e.g. on
60 -- gnat1drv), and run. Then set Watch_Node (nickname "ww") to 12345 in gdb:
62 -- and set a breakpoint on New_Node_Breakpoint (nickname "nn"). Continue.
64 -- Either way, gnat1 will stop when node 12345 is created
66 -- The second method is faster
68 ww : Node_Id'Base := Node_Id'First - 1;
69 pragma Export (Ada, ww); -- trick the optimizer
70 Watch_Node : Node_Id'Base renames ww;
71 -- Node to "watch"; that is, whenever a node is created, we check if it is
72 -- equal to Watch_Node, and if so, call New_Node_Breakpoint. You have
73 -- presumably set a breakpoint on New_Node_Breakpoint. Note that the
74 -- initial value of Node_Id'First - 1 ensures that by default, no node
75 -- will be equal to Watch_Node.
78 pragma Export (Ada, nn);
79 procedure New_Node_Breakpoint renames nn;
80 -- This doesn't do anything interesting; it's just for setting breakpoint
81 -- on as explained above.
83 procedure nnd (N : Node_Id);
84 pragma Export (Ada, nnd);
85 procedure New_Node_Debugging_Output (N : Node_Id) renames nnd;
86 -- For debugging. If debugging is turned on, New_Node and New_Entity call
87 -- this. If debug flag N is turned on, this prints out the new node.
89 -- If Node = Watch_Node, this prints out the new node and calls
90 -- New_Node_Breakpoint. Otherwise, does nothing.
92 -----------------------------
93 -- Local Objects and Types --
94 -----------------------------
97 -- Count allocated nodes for Num_Nodes function
100 -- We are allowed to see these from within our own body!
102 use Atree_Private_Part;
103 -- We are also allowed to see our private data structures!
105 -- Functions used to store Entity_Kind value in Nkind field
107 -- The following declarations are used to store flags 65-72 in the
108 -- Nkind field of the third component of an extended (entity) node.
110 type Flag_Byte is record
121 pragma Pack (Flag_Byte);
122 for Flag_Byte'Size use 8;
124 type Flag_Byte_Ptr is access all Flag_Byte;
125 type Node_Kind_Ptr is access all Node_Kind;
127 function To_Flag_Byte is new
128 Unchecked_Conversion (Node_Kind, Flag_Byte);
130 function To_Flag_Byte_Ptr is new
131 Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte_Ptr);
133 -- The following declarations are used to store flags 73-96 and the
134 -- Convention field in the Field12 field of the third component of an
135 -- extended (Entity) node.
137 type Flag_Word is record
165 Convention : Convention_Id;
168 pragma Pack (Flag_Word);
169 for Flag_Word'Size use 32;
170 for Flag_Word'Alignment use 4;
172 type Flag_Word_Ptr is access all Flag_Word;
173 type Union_Id_Ptr is access all Union_Id;
175 function To_Flag_Word is new
176 Unchecked_Conversion (Union_Id, Flag_Word);
178 function To_Flag_Word_Ptr is new
179 Unchecked_Conversion (Union_Id_Ptr, Flag_Word_Ptr);
181 -- The following declarations are used to store flags 97-128 in the
182 -- Field12 field of the fourth component of an extended (entity) node.
184 type Flag_Word2 is record
222 pragma Pack (Flag_Word2);
223 for Flag_Word2'Size use 32;
224 for Flag_Word2'Alignment use 4;
226 type Flag_Word2_Ptr is access all Flag_Word2;
228 function To_Flag_Word2 is new
229 Unchecked_Conversion (Union_Id, Flag_Word2);
231 function To_Flag_Word2_Ptr is new
232 Unchecked_Conversion (Union_Id_Ptr, Flag_Word2_Ptr);
234 -- The following declarations are used to store flags 152-183 in the
235 -- Field11 field of the fourth component of an extended (entity) node.
237 type Flag_Word3 is record
275 pragma Pack (Flag_Word3);
276 for Flag_Word3'Size use 32;
277 for Flag_Word3'Alignment use 4;
279 type Flag_Word3_Ptr is access all Flag_Word3;
281 function To_Flag_Word3 is new
282 Unchecked_Conversion (Union_Id, Flag_Word3);
284 function To_Flag_Word3_Ptr is new
285 Unchecked_Conversion (Union_Id_Ptr, Flag_Word3_Ptr);
287 -- The following declarations are used to store flags 184-215 in the
288 -- Field11 field of the fifth component of an extended (entity) node.
290 type Flag_Word4 is record
328 pragma Pack (Flag_Word4);
329 for Flag_Word4'Size use 32;
330 for Flag_Word4'Alignment use 4;
332 type Flag_Word4_Ptr is access all Flag_Word4;
334 function To_Flag_Word4 is new
335 Unchecked_Conversion (Union_Id, Flag_Word4);
337 function To_Flag_Word4_Ptr is new
338 Unchecked_Conversion (Union_Id_Ptr, Flag_Word4_Ptr);
340 -- The following declarations are used to store flags 216-247 in the
341 -- Field12 field of the fifth component of an extended (entity) node.
343 type Flag_Word5 is record
381 pragma Pack (Flag_Word5);
382 for Flag_Word5'Size use 32;
383 for Flag_Word5'Alignment use 4;
385 type Flag_Word5_Ptr is access all Flag_Word5;
387 function To_Flag_Word5 is new
388 Unchecked_Conversion (Union_Id, Flag_Word5);
390 function To_Flag_Word5_Ptr is new
391 Unchecked_Conversion (Union_Id_Ptr, Flag_Word5_Ptr);
393 --------------------------------------------------
394 -- Implementation of Tree Substitution Routines --
395 --------------------------------------------------
397 -- A separate table keeps track of the mapping between rewritten nodes
398 -- and their corresponding original tree nodes. Rewrite makes an entry
399 -- in this table for use by Original_Node. By default, if no call is
400 -- Rewrite, the entry in this table points to the original unwritten node.
402 -- Note: eventually, this should be a field in the Node directly, but
403 -- for now we do not want to disturb the efficiency of a power of 2
406 package Orig_Nodes is new Table.Table (
407 Table_Component_Type => Node_Id,
408 Table_Index_Type => Node_Id'Base,
409 Table_Low_Bound => First_Node_Id,
410 Table_Initial => Alloc.Orig_Nodes_Initial,
411 Table_Increment => Alloc.Orig_Nodes_Increment,
412 Table_Name => "Orig_Nodes");
414 --------------------------
415 -- Paren_Count Handling --
416 --------------------------
418 -- As noted in the spec, the paren count in a sub-expression node has
419 -- four possible values 0,1,2, and 3. The value 3 really means 3 or more,
420 -- and we use an auxiliary serially scanned table to record the actual
421 -- count. A serial search is fine, only pathological programs will use
422 -- entries in this table. Normal programs won't use it at all.
424 type Paren_Count_Entry is record
426 -- The node to which this count applies
428 Count : Nat range 3 .. Nat'Last;
429 -- The count of parentheses, which will be in the indicated range
432 package Paren_Counts is new Table.Table (
433 Table_Component_Type => Paren_Count_Entry,
434 Table_Index_Type => Int,
435 Table_Low_Bound => 0,
437 Table_Increment => 200,
438 Table_Name => "Paren_Counts");
440 -----------------------
441 -- Local Subprograms --
442 -----------------------
444 procedure Fix_Parents (Ref_Node, Fix_Node : Node_Id);
445 -- Fixup parent pointers for the syntactic children of Fix_Node after
446 -- a copy, setting them to Fix_Node when they pointed to Ref_Node.
448 function Allocate_Initialize_Node
450 With_Extension : Boolean) return Node_Id;
451 -- Allocate a new node or node extension. If Src is not empty,
452 -- the information for the newly-allocated node is copied from it.
454 ------------------------------
455 -- Allocate_Initialize_Node --
456 ------------------------------
458 function Allocate_Initialize_Node
460 With_Extension : Boolean) return Node_Id
462 New_Id : Node_Id := Src;
463 Nod : Node_Record := Default_Node;
464 Ext1 : Node_Record := Default_Node_Extension;
465 Ext2 : Node_Record := Default_Node_Extension;
466 Ext3 : Node_Record := Default_Node_Extension;
467 Ext4 : Node_Record := Default_Node_Extension;
470 if Present (Src) then
471 Nod := Nodes.Table (Src);
473 if Has_Extension (Src) then
474 Ext1 := Nodes.Table (Src + 1);
475 Ext2 := Nodes.Table (Src + 2);
476 Ext3 := Nodes.Table (Src + 3);
477 Ext4 := Nodes.Table (Src + 4);
481 if not (Present (Src)
482 and then not Has_Extension (Src)
483 and then With_Extension
484 and then Src = Nodes.Last)
486 -- We are allocating a new node, or extending a node
487 -- other than Nodes.Last.
490 New_Id := Nodes.Last;
491 Orig_Nodes.Append (New_Id);
492 Node_Count := Node_Count + 1;
495 -- Specifically copy Paren_Count to deal with creating new table entry
496 -- if the parentheses count is at the maximum possible value already.
498 if Present (Src) and then Nkind (Src) in N_Subexpr then
499 Set_Paren_Count (New_Id, Paren_Count (Src));
502 -- Set extension nodes if required
504 if With_Extension then
511 Orig_Nodes.Set_Last (Nodes.Last);
512 Allocate_List_Tables (Nodes.Last);
514 end Allocate_Initialize_Node;
520 function Analyzed (N : Node_Id) return Boolean is
522 pragma Assert (N <= Nodes.Last);
523 return Nodes.Table (N).Analyzed;
526 --------------------------
527 -- Basic_Set_Convention --
528 --------------------------
530 procedure Basic_Set_Convention (E : Entity_Id; Val : Convention_Id) is
532 pragma Assert (Nkind (E) in N_Entity);
535 (Nodes.Table (E + 2).Field12'Unrestricted_Access)).Convention := Val;
536 end Basic_Set_Convention;
542 procedure Change_Node (N : Node_Id; New_Node_Kind : Node_Kind) is
543 Save_Sloc : constant Source_Ptr := Sloc (N);
544 Save_In_List : constant Boolean := Nodes.Table (N).In_List;
545 Save_Link : constant Union_Id := Nodes.Table (N).Link;
546 Save_CFS : constant Boolean := Nodes.Table (N).Comes_From_Source;
547 Save_Posted : constant Boolean := Nodes.Table (N).Error_Posted;
548 Par_Count : Nat := 0;
551 if Nkind (N) in N_Subexpr then
552 Par_Count := Paren_Count (N);
555 Nodes.Table (N) := Default_Node;
556 Nodes.Table (N).Sloc := Save_Sloc;
557 Nodes.Table (N).In_List := Save_In_List;
558 Nodes.Table (N).Link := Save_Link;
559 Nodes.Table (N).Comes_From_Source := Save_CFS;
560 Nodes.Table (N).Nkind := New_Node_Kind;
561 Nodes.Table (N).Error_Posted := Save_Posted;
563 if New_Node_Kind in N_Subexpr then
564 Set_Paren_Count (N, Par_Count);
568 -----------------------
569 -- Comes_From_Source --
570 -----------------------
572 function Comes_From_Source (N : Node_Id) return Boolean is
574 pragma Assert (N <= Nodes.Last);
575 return Nodes.Table (N).Comes_From_Source;
576 end Comes_From_Source;
582 function Convention (E : Entity_Id) return Convention_Id is
584 pragma Assert (Nkind (E) in N_Entity);
585 return To_Flag_Word (Nodes.Table (E + 2).Field12).Convention;
592 procedure Copy_Node (Source : Node_Id; Destination : Node_Id) is
593 Save_In_List : constant Boolean := Nodes.Table (Destination).In_List;
594 Save_Link : constant Union_Id := Nodes.Table (Destination).Link;
597 Nodes.Table (Destination) := Nodes.Table (Source);
598 Nodes.Table (Destination).In_List := Save_In_List;
599 Nodes.Table (Destination).Link := Save_Link;
601 -- Specifically set Paren_Count to make sure auxiliary table entry
602 -- gets correctly made if the parentheses count is at the max value.
604 if Nkind (Destination) in N_Subexpr then
605 Set_Paren_Count (Destination, Paren_Count (Source));
608 -- Deal with copying extension nodes if present
610 if Has_Extension (Source) then
611 pragma Assert (Has_Extension (Destination));
612 Nodes.Table (Destination + 1) := Nodes.Table (Source + 1);
613 Nodes.Table (Destination + 2) := Nodes.Table (Source + 2);
614 Nodes.Table (Destination + 3) := Nodes.Table (Source + 3);
615 Nodes.Table (Destination + 4) := Nodes.Table (Source + 4);
618 pragma Assert (not Has_Extension (Source));
623 ------------------------
624 -- Copy_Separate_Tree --
625 ------------------------
627 function Copy_Separate_Tree (Source : Node_Id) return Node_Id is
630 function Copy_Entity (E : Entity_Id) return Entity_Id;
631 -- Copy Entity, copying only the Ekind and Chars fields
633 function Copy_List (List : List_Id) return List_Id;
636 function Possible_Copy (Field : Union_Id) return Union_Id;
637 -- Given a field, returns a copy of the node or list if its parent
638 -- is the current source node, and otherwise returns the input
644 function Copy_Entity (E : Entity_Id) return Entity_Id is
648 case N_Entity (Nkind (E)) is
649 when N_Defining_Identifier =>
650 New_Ent := New_Entity (N_Defining_Identifier, Sloc (E));
652 when N_Defining_Character_Literal =>
653 New_Ent := New_Entity (N_Defining_Character_Literal, Sloc (E));
655 when N_Defining_Operator_Symbol =>
656 New_Ent := New_Entity (N_Defining_Operator_Symbol, Sloc (E));
659 Set_Chars (New_Ent, Chars (E));
667 function Copy_List (List : List_Id) return List_Id is
672 if List = No_List then
679 while Present (E) loop
680 if Has_Extension (E) then
681 Append (Copy_Entity (E), NL);
683 Append (Copy_Separate_Tree (E), NL);
697 function Possible_Copy (Field : Union_Id) return Union_Id is
701 if Field in Node_Range then
702 New_N := Union_Id (Copy_Separate_Tree (Node_Id (Field)));
704 if Parent (Node_Id (Field)) = Source then
705 Set_Parent (Node_Id (New_N), New_Id);
710 elsif Field in List_Range then
711 New_N := Union_Id (Copy_List (List_Id (Field)));
713 if Parent (List_Id (Field)) = Source then
714 Set_Parent (List_Id (New_N), New_Id);
724 -- Start of processing for Copy_Separate_Tree
727 if Source <= Empty_Or_Error then
730 elsif Has_Extension (Source) then
731 return Copy_Entity (Source);
734 New_Id := New_Copy (Source);
736 -- Recursively copy descendents
738 Set_Field1 (New_Id, Possible_Copy (Field1 (New_Id)));
739 Set_Field2 (New_Id, Possible_Copy (Field2 (New_Id)));
740 Set_Field3 (New_Id, Possible_Copy (Field3 (New_Id)));
741 Set_Field4 (New_Id, Possible_Copy (Field4 (New_Id)));
742 Set_Field5 (New_Id, Possible_Copy (Field5 (New_Id)));
744 -- Set Entity field to Empty
745 -- Why is this done??? and why is it always right to do it???
747 if Nkind (New_Id) in N_Has_Entity
748 or else Nkind (New_Id) = N_Freeze_Entity
750 Set_Entity (New_Id, Empty);
753 -- All done, return copied node
757 end Copy_Separate_Tree;
763 function Ekind (E : Entity_Id) return Entity_Kind is
765 pragma Assert (Nkind (E) in N_Entity);
766 return N_To_E (Nodes.Table (E + 1).Nkind);
776 V2 : Entity_Kind) return Boolean
779 return T = V1 or else
787 V3 : Entity_Kind) return Boolean
790 return T = V1 or else
800 V4 : Entity_Kind) return Boolean
803 return T = V1 or else
815 V5 : Entity_Kind) return Boolean
818 return T = V1 or else
828 V2 : Entity_Kind) return Boolean
831 return Ekind_In (Ekind (E), V1, V2);
838 V3 : Entity_Kind) return Boolean
841 return Ekind_In (Ekind (E), V1, V2, V3);
849 V4 : Entity_Kind) return Boolean
852 return Ekind_In (Ekind (E), V1, V2, V3, V4);
861 V5 : Entity_Kind) return Boolean
864 return Ekind_In (Ekind (E), V1, V2, V3, V4, V5);
871 function Error_Posted (N : Node_Id) return Boolean is
873 pragma Assert (N <= Nodes.Last);
874 return Nodes.Table (N).Error_Posted;
877 -----------------------
878 -- Exchange_Entities --
879 -----------------------
881 procedure Exchange_Entities (E1 : Entity_Id; E2 : Entity_Id) is
882 Temp_Ent : Node_Record;
885 pragma Assert (Has_Extension (E1)
886 and then Has_Extension (E2)
887 and then not Nodes.Table (E1).In_List
888 and then not Nodes.Table (E2).In_List);
890 -- Exchange the contents of the two entities
892 Temp_Ent := Nodes.Table (E1);
893 Nodes.Table (E1) := Nodes.Table (E2);
894 Nodes.Table (E2) := Temp_Ent;
895 Temp_Ent := Nodes.Table (E1 + 1);
896 Nodes.Table (E1 + 1) := Nodes.Table (E2 + 1);
897 Nodes.Table (E2 + 1) := Temp_Ent;
898 Temp_Ent := Nodes.Table (E1 + 2);
899 Nodes.Table (E1 + 2) := Nodes.Table (E2 + 2);
900 Nodes.Table (E2 + 2) := Temp_Ent;
901 Temp_Ent := Nodes.Table (E1 + 3);
902 Nodes.Table (E1 + 3) := Nodes.Table (E2 + 3);
903 Nodes.Table (E2 + 3) := Temp_Ent;
904 Temp_Ent := Nodes.Table (E1 + 4);
905 Nodes.Table (E1 + 4) := Nodes.Table (E2 + 4);
906 Nodes.Table (E2 + 4) := Temp_Ent;
908 -- That exchange exchanged the parent pointers as well, which is what
909 -- we want, but we need to patch up the defining identifier pointers
910 -- in the parent nodes (the child pointers) to match this switch
911 -- unless for Implicit types entities which have no parent, in which
912 -- case we don't do anything otherwise we won't be able to revert back
913 -- to the original situation.
915 -- Shouldn't this use Is_Itype instead of the Parent test
917 if Present (Parent (E1)) and then Present (Parent (E2)) then
918 Set_Defining_Identifier (Parent (E1), E1);
919 Set_Defining_Identifier (Parent (E2), E2);
921 end Exchange_Entities;
927 function Extend_Node (Node : Node_Id) return Entity_Id is
930 procedure Debug_Extend_Node;
931 pragma Inline (Debug_Extend_Node);
932 -- Debug routine for debug flag N
934 -----------------------
935 -- Debug_Extend_Node --
936 -----------------------
938 procedure Debug_Extend_Node is
941 Write_Str ("Extend node ");
942 Write_Int (Int (Node));
944 if Result = Node then
945 Write_Str (" in place");
947 Write_Str (" copied to ");
948 Write_Int (Int (Result));
953 end Debug_Extend_Node;
955 -- Start of processing for Extend_Node
958 pragma Assert (not (Has_Extension (Node)));
959 Result := Allocate_Initialize_Node (Node, With_Extension => True);
960 pragma Debug (Debug_Extend_Node);
968 procedure Fix_Parents (Ref_Node, Fix_Node : Node_Id) is
970 procedure Fix_Parent (Field : Union_Id);
971 -- Fixup one parent pointer. Field is checked to see if it points to
972 -- a node, list, or element list that has a parent that points to
973 -- Ref_Node. If so, the parent is reset to point to Fix_Node.
979 procedure Fix_Parent (Field : Union_Id) is
981 -- Fix parent of node that is referenced by Field. Note that we must
982 -- exclude the case where the node is a member of a list, because in
983 -- this case the parent is the parent of the list.
985 if Field in Node_Range
986 and then Present (Node_Id (Field))
987 and then not Nodes.Table (Node_Id (Field)).In_List
988 and then Parent (Node_Id (Field)) = Ref_Node
990 Set_Parent (Node_Id (Field), Fix_Node);
992 -- Fix parent of list that is referenced by Field
994 elsif Field in List_Range
995 and then Present (List_Id (Field))
996 and then Parent (List_Id (Field)) = Ref_Node
998 Set_Parent (List_Id (Field), Fix_Node);
1002 -- Start of processing for Fix_Parents
1005 Fix_Parent (Field1 (Fix_Node));
1006 Fix_Parent (Field2 (Fix_Node));
1007 Fix_Parent (Field3 (Fix_Node));
1008 Fix_Parent (Field4 (Fix_Node));
1009 Fix_Parent (Field5 (Fix_Node));
1012 -----------------------------------
1013 -- Get_Comes_From_Source_Default --
1014 -----------------------------------
1016 function Get_Comes_From_Source_Default return Boolean is
1018 return Default_Node.Comes_From_Source;
1019 end Get_Comes_From_Source_Default;
1025 function Has_Extension (N : Node_Id) return Boolean is
1027 return N < Nodes.Last and then Nodes.Table (N + 1).Is_Extension;
1034 procedure Initialize is
1036 pragma Warnings (Off, Dummy);
1040 Atree_Private_Part.Nodes.Init;
1044 -- Allocate Empty node
1046 Dummy := New_Node (N_Empty, No_Location);
1047 Set_Name1 (Empty, No_Name);
1049 -- Allocate Error node, and set Error_Posted, since we certainly
1050 -- only generate an Error node if we do post some kind of error!
1052 Dummy := New_Node (N_Error, No_Location);
1053 Set_Name1 (Error, Error_Name);
1054 Set_Error_Posted (Error, True);
1057 --------------------------
1058 -- Is_Rewrite_Insertion --
1059 --------------------------
1061 function Is_Rewrite_Insertion (Node : Node_Id) return Boolean is
1063 return Nodes.Table (Node).Rewrite_Ins;
1064 end Is_Rewrite_Insertion;
1066 -----------------------------
1067 -- Is_Rewrite_Substitution --
1068 -----------------------------
1070 function Is_Rewrite_Substitution (Node : Node_Id) return Boolean is
1072 return Orig_Nodes.Table (Node) /= Node;
1073 end Is_Rewrite_Substitution;
1079 function Last_Node_Id return Node_Id is
1090 Nodes.Locked := True;
1091 Orig_Nodes.Locked := True;
1096 ----------------------------
1097 -- Mark_Rewrite_Insertion --
1098 ----------------------------
1100 procedure Mark_Rewrite_Insertion (New_Node : Node_Id) is
1102 Nodes.Table (New_Node).Rewrite_Ins := True;
1103 end Mark_Rewrite_Insertion;
1109 function New_Copy (Source : Node_Id) return Node_Id is
1110 New_Id : Node_Id := Source;
1113 if Source > Empty_Or_Error then
1115 New_Id := Allocate_Initialize_Node (Source, Has_Extension (Source));
1117 Nodes.Table (New_Id).Link := Empty_List_Or_Node;
1118 Nodes.Table (New_Id).In_List := False;
1120 -- If the original is marked as a rewrite insertion, then unmark
1121 -- the copy, since we inserted the original, not the copy.
1123 Nodes.Table (New_Id).Rewrite_Ins := False;
1124 pragma Debug (New_Node_Debugging_Output (New_Id));
1135 (New_Node_Kind : Node_Kind;
1136 New_Sloc : Source_Ptr) return Entity_Id
1141 pragma Assert (New_Node_Kind in N_Entity);
1143 Ent := Allocate_Initialize_Node (Empty, With_Extension => True);
1145 -- If this is a node with a real location and we are generating
1146 -- source nodes, then reset Current_Error_Node. This is useful
1147 -- if we bomb during parsing to get a error location for the bomb.
1149 if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
1150 Current_Error_Node := Ent;
1153 Nodes.Table (Ent).Nkind := New_Node_Kind;
1154 Nodes.Table (Ent).Sloc := New_Sloc;
1155 pragma Debug (New_Node_Debugging_Output (Ent));
1165 (New_Node_Kind : Node_Kind;
1166 New_Sloc : Source_Ptr) return Node_Id
1171 pragma Assert (New_Node_Kind not in N_Entity);
1172 Nod := Allocate_Initialize_Node (Empty, With_Extension => False);
1173 Nodes.Table (Nod).Nkind := New_Node_Kind;
1174 Nodes.Table (Nod).Sloc := New_Sloc;
1175 pragma Debug (New_Node_Debugging_Output (Nod));
1177 -- If this is a node with a real location and we are generating source
1178 -- nodes, then reset Current_Error_Node. This is useful if we bomb
1179 -- during parsing to get an error location for the bomb.
1181 if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
1182 Current_Error_Node := Nod;
1188 -------------------------
1189 -- New_Node_Breakpoint --
1190 -------------------------
1192 procedure nn is -- New_Node_Breakpoint
1194 Write_Str ("Watched node ");
1195 Write_Int (Int (Watch_Node));
1196 Write_Str (" created");
1200 -------------------------------
1201 -- New_Node_Debugging_Output --
1202 -------------------------------
1204 procedure nnd (N : Node_Id) is -- New_Node_Debugging_Output
1205 Node_Is_Watched : constant Boolean := N = Watch_Node;
1208 if Debug_Flag_N or else Node_Is_Watched then
1209 Write_Str ("Allocate ");
1211 if Nkind (N) in N_Entity then
1212 Write_Str ("entity");
1217 Write_Str (", Id = ");
1218 Write_Int (Int (N));
1220 Write_Location (Sloc (N));
1222 Write_Str (Node_Kind'Image (Nkind (N)));
1225 if Node_Is_Watched then
1226 New_Node_Breakpoint;
1235 function Nkind (N : Node_Id) return Node_Kind is
1237 return Nodes.Table (N).Nkind;
1247 V2 : Node_Kind) return Boolean
1250 return Nkind_In (Nkind (N), V1, V2);
1257 V3 : Node_Kind) return Boolean
1260 return Nkind_In (Nkind (N), V1, V2, V3);
1268 V4 : Node_Kind) return Boolean
1271 return Nkind_In (Nkind (N), V1, V2, V3, V4);
1280 V5 : Node_Kind) return Boolean
1283 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5);
1293 V6 : Node_Kind) return Boolean
1296 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6);
1307 V7 : Node_Kind) return Boolean
1310 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7);
1322 V8 : Node_Kind) return Boolean
1325 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7, V8);
1338 V9 : Node_Kind) return Boolean
1341 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7, V8, V9);
1347 function No (N : Node_Id) return Boolean is
1356 function Nodes_Address return System.Address is
1358 return Nodes.Table (First_Node_Id)'Address;
1365 function Num_Nodes return Nat is
1374 function Original_Node (Node : Node_Id) return Node_Id is
1376 return Orig_Nodes.Table (Node);
1383 function Paren_Count (N : Node_Id) return Nat is
1387 pragma Assert (N <= Nodes.Last);
1389 if Nodes.Table (N).Pflag1 then
1393 if Nodes.Table (N).Pflag2 then
1397 -- Value of 0,1,2 returned as is
1402 -- Value of 3 means we search the table, and we must find an entry
1405 for J in Paren_Counts.First .. Paren_Counts.Last loop
1406 if N = Paren_Counts.Table (J).Nod then
1407 return Paren_Counts.Table (J).Count;
1411 raise Program_Error;
1419 function Parent (N : Node_Id) return Node_Id is
1421 if Is_List_Member (N) then
1422 return Parent (List_Containing (N));
1424 return Node_Id (Nodes.Table (N).Link);
1432 function Present (N : Node_Id) return Boolean is
1437 --------------------------------
1438 -- Preserve_Comes_From_Source --
1439 --------------------------------
1441 procedure Preserve_Comes_From_Source (NewN, OldN : Node_Id) is
1443 Nodes.Table (NewN).Comes_From_Source :=
1444 Nodes.Table (OldN).Comes_From_Source;
1445 end Preserve_Comes_From_Source;
1451 function Relocate_Node (Source : Node_Id) return Node_Id is
1459 New_Node := New_Copy (Source);
1460 Fix_Parents (Ref_Node => Source, Fix_Node => New_Node);
1462 -- We now set the parent of the new node to be the same as the
1463 -- parent of the source. Almost always this parent will be
1464 -- replaced by a new value when the relocated node is reattached
1465 -- to the tree, but by doing it now, we ensure that this node is
1466 -- not even temporarily disconnected from the tree. Note that this
1467 -- does not happen free, because in the list case, the parent does
1470 Set_Parent (New_Node, Parent (Source));
1472 -- If the node being relocated was a rewriting of some original
1473 -- node, then the relocated node has the same original node.
1475 if Orig_Nodes.Table (Source) /= Source then
1476 Orig_Nodes.Table (New_Node) := Orig_Nodes.Table (Source);
1486 procedure Replace (Old_Node, New_Node : Node_Id) is
1487 Old_Post : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
1488 Old_CFS : constant Boolean := Nodes.Table (Old_Node).Comes_From_Source;
1492 (not Has_Extension (Old_Node)
1493 and not Has_Extension (New_Node)
1494 and not Nodes.Table (New_Node).In_List);
1496 -- Do copy, preserving link and in list status and comes from source
1498 Copy_Node (Source => New_Node, Destination => Old_Node);
1499 Nodes.Table (Old_Node).Comes_From_Source := Old_CFS;
1500 Nodes.Table (Old_Node).Error_Posted := Old_Post;
1502 -- Fix parents of substituted node, since it has changed identity
1504 Fix_Parents (Ref_Node => New_Node, Fix_Node => Old_Node);
1506 -- Since we are doing a replace, we assume that the original node
1507 -- is intended to become the new replaced node. The call would be
1508 -- to Rewrite if there were an intention to save the original node.
1510 Orig_Nodes.Table (Old_Node) := Old_Node;
1517 procedure Rewrite (Old_Node, New_Node : Node_Id) is
1518 Old_Error_P : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
1519 -- This fields is always preserved in the new node
1521 Old_Paren_Count : Nat;
1522 Old_Must_Not_Freeze : Boolean;
1523 -- These fields are preserved in the new node only if the new node
1524 -- and the old node are both subexpression nodes.
1526 -- Note: it is a violation of abstraction levels for Must_Not_Freeze
1527 -- to be referenced like this. ???
1533 (not Has_Extension (Old_Node)
1534 and not Has_Extension (New_Node)
1535 and not Nodes.Table (New_Node).In_List);
1537 if Nkind (Old_Node) in N_Subexpr then
1538 Old_Paren_Count := Paren_Count (Old_Node);
1539 Old_Must_Not_Freeze := Must_Not_Freeze (Old_Node);
1541 Old_Paren_Count := 0;
1542 Old_Must_Not_Freeze := False;
1545 -- Allocate a new node, to be used to preserve the original contents
1546 -- of the Old_Node, for possible later retrival by Original_Node and
1547 -- make an entry in the Orig_Nodes table. This is only done if we have
1548 -- not already rewritten the node, as indicated by an Orig_Nodes entry
1549 -- that does not reference the Old_Node.
1551 if Orig_Nodes.Table (Old_Node) = Old_Node then
1552 Sav_Node := New_Copy (Old_Node);
1553 Orig_Nodes.Table (Sav_Node) := Sav_Node;
1554 Orig_Nodes.Table (Old_Node) := Sav_Node;
1557 -- Copy substitute node into place, preserving old fields as required
1559 Copy_Node (Source => New_Node, Destination => Old_Node);
1560 Nodes.Table (Old_Node).Error_Posted := Old_Error_P;
1562 if Nkind (New_Node) in N_Subexpr then
1563 Set_Paren_Count (Old_Node, Old_Paren_Count);
1564 Set_Must_Not_Freeze (Old_Node, Old_Must_Not_Freeze);
1567 Fix_Parents (Ref_Node => New_Node, Fix_Node => Old_Node);
1574 procedure Set_Analyzed (N : Node_Id; Val : Boolean := True) is
1576 Nodes.Table (N).Analyzed := Val;
1579 ---------------------------
1580 -- Set_Comes_From_Source --
1581 ---------------------------
1583 procedure Set_Comes_From_Source (N : Node_Id; Val : Boolean) is
1585 pragma Assert (N <= Nodes.Last);
1586 Nodes.Table (N).Comes_From_Source := Val;
1587 end Set_Comes_From_Source;
1589 -----------------------------------
1590 -- Set_Comes_From_Source_Default --
1591 -----------------------------------
1593 procedure Set_Comes_From_Source_Default (Default : Boolean) is
1595 Default_Node.Comes_From_Source := Default;
1596 end Set_Comes_From_Source_Default;
1602 procedure Set_Ekind (E : Entity_Id; Val : Entity_Kind) is
1604 pragma Assert (Nkind (E) in N_Entity);
1605 Nodes.Table (E + 1).Nkind := E_To_N (Val);
1608 ----------------------
1609 -- Set_Error_Posted --
1610 ----------------------
1612 procedure Set_Error_Posted (N : Node_Id; Val : Boolean := True) is
1614 Nodes.Table (N).Error_Posted := Val;
1615 end Set_Error_Posted;
1617 ---------------------
1618 -- Set_Paren_Count --
1619 ---------------------
1621 procedure Set_Paren_Count (N : Node_Id; Val : Nat) is
1623 pragma Assert (Nkind (N) in N_Subexpr);
1625 -- Value of 0,1,2 stored as is
1628 Nodes.Table (N).Pflag1 := (Val mod 2 /= 0);
1629 Nodes.Table (N).Pflag2 := (Val = 2);
1631 -- Value of 3 or greater stores 3 in node and makes table entry
1634 Nodes.Table (N).Pflag1 := True;
1635 Nodes.Table (N).Pflag2 := True;
1637 for J in Paren_Counts.First .. Paren_Counts.Last loop
1638 if N = Paren_Counts.Table (J).Nod then
1639 Paren_Counts.Table (J).Count := Val;
1644 Paren_Counts.Append ((Nod => N, Count => Val));
1646 end Set_Paren_Count;
1652 procedure Set_Parent (N : Node_Id; Val : Node_Id) is
1654 pragma Assert (not Nodes.Table (N).In_List);
1655 Nodes.Table (N).Link := Union_Id (Val);
1662 procedure Set_Sloc (N : Node_Id; Val : Source_Ptr) is
1664 Nodes.Table (N).Sloc := Val;
1671 function Sloc (N : Node_Id) return Source_Ptr is
1673 return Nodes.Table (N).Sloc;
1680 function Traverse_Func (Node : Node_Id) return Traverse_Final_Result is
1682 function Traverse_Field
1685 FN : Field_Num) return Traverse_Final_Result;
1686 -- Fld is one of the fields of Nod. If the field points to syntactic
1687 -- node or list, then this node or list is traversed, and the result is
1688 -- the result of this traversal. Otherwise a value of True is returned
1689 -- with no processing. FN is the number of the field (1 .. 5).
1691 --------------------
1692 -- Traverse_Field --
1693 --------------------
1695 function Traverse_Field
1698 FN : Field_Num) return Traverse_Final_Result
1701 if Fld = Union_Id (Empty) then
1704 -- Descendent is a node
1706 elsif Fld in Node_Range then
1708 -- Traverse descendent that is syntactic subtree node
1710 if Is_Syntactic_Field (Nkind (Nod), FN) then
1711 return Traverse_Func (Node_Id (Fld));
1713 -- Node that is not a syntactic subtree
1719 -- Descendent is a list
1721 elsif Fld in List_Range then
1723 -- Traverse descendent that is a syntactic subtree list
1725 if Is_Syntactic_Field (Nkind (Nod), FN) then
1727 Elmt : Node_Id := First (List_Id (Fld));
1729 while Present (Elmt) loop
1730 if Traverse_Func (Elmt) = Abandon then
1740 -- List that is not a syntactic subtree
1746 -- Field was not a node or a list
1753 Cur_Node : Node_Id := Node;
1755 -- Start of processing for Traverse_Func
1758 -- We walk Field2 last, and if it is a node, we eliminate the tail
1759 -- recursion by jumping back to this label. This is because Field2 is
1760 -- where the Left_Opnd field of N_Op_Concat is stored, and in practice
1761 -- concatenations are sometimes deeply nested, as in X1&X2&...&XN. This
1762 -- trick prevents us from running out of memory in that case. We don't
1763 -- bother eliminating the tail recursion if Field2 is a list.
1767 case Process (Cur_Node) is
1778 Cur_Node := Original_Node (Cur_Node);
1781 if Traverse_Field (Cur_Node, Field1 (Cur_Node), 1) = Abandon
1782 or else -- skip Field2 here
1783 Traverse_Field (Cur_Node, Field3 (Cur_Node), 3) = Abandon
1785 Traverse_Field (Cur_Node, Field4 (Cur_Node), 4) = Abandon
1787 Traverse_Field (Cur_Node, Field5 (Cur_Node), 5) = Abandon
1792 if Field2 (Cur_Node) not in Node_Range then
1793 return Traverse_Field (Cur_Node, Field2 (Cur_Node), 2);
1795 elsif Is_Syntactic_Field (Nkind (Cur_Node), 2)
1796 and then Field2 (Cur_Node) /= Empty_List_Or_Node
1798 -- Here is the tail recursion step, we reset Cur_Node and jump back
1799 -- to the start of the procedure, which has the same semantic effect
1802 Cur_Node := Node_Id (Field2 (Cur_Node));
1813 procedure Traverse_Proc (Node : Node_Id) is
1814 function Traverse is new Traverse_Func (Process);
1815 Discard : Traverse_Final_Result;
1816 pragma Warnings (Off, Discard);
1818 Discard := Traverse (Node);
1825 procedure Tree_Read is
1827 Tree_Read_Int (Node_Count);
1829 Orig_Nodes.Tree_Read;
1830 Paren_Counts.Tree_Read;
1837 procedure Tree_Write is
1839 Tree_Write_Int (Node_Count);
1841 Orig_Nodes.Tree_Write;
1842 Paren_Counts.Tree_Write;
1845 ------------------------------
1846 -- Unchecked Access Package --
1847 ------------------------------
1849 package body Unchecked_Access is
1851 function Field1 (N : Node_Id) return Union_Id is
1853 pragma Assert (N <= Nodes.Last);
1854 return Nodes.Table (N).Field1;
1857 function Field2 (N : Node_Id) return Union_Id is
1859 pragma Assert (N <= Nodes.Last);
1860 return Nodes.Table (N).Field2;
1863 function Field3 (N : Node_Id) return Union_Id is
1865 pragma Assert (N <= Nodes.Last);
1866 return Nodes.Table (N).Field3;
1869 function Field4 (N : Node_Id) return Union_Id is
1871 pragma Assert (N <= Nodes.Last);
1872 return Nodes.Table (N).Field4;
1875 function Field5 (N : Node_Id) return Union_Id is
1877 pragma Assert (N <= Nodes.Last);
1878 return Nodes.Table (N).Field5;
1881 function Field6 (N : Node_Id) return Union_Id is
1883 pragma Assert (Nkind (N) in N_Entity);
1884 return Nodes.Table (N + 1).Field6;
1887 function Field7 (N : Node_Id) return Union_Id is
1889 pragma Assert (Nkind (N) in N_Entity);
1890 return Nodes.Table (N + 1).Field7;
1893 function Field8 (N : Node_Id) return Union_Id is
1895 pragma Assert (Nkind (N) in N_Entity);
1896 return Nodes.Table (N + 1).Field8;
1899 function Field9 (N : Node_Id) return Union_Id is
1901 pragma Assert (Nkind (N) in N_Entity);
1902 return Nodes.Table (N + 1).Field9;
1905 function Field10 (N : Node_Id) return Union_Id is
1907 pragma Assert (Nkind (N) in N_Entity);
1908 return Nodes.Table (N + 1).Field10;
1911 function Field11 (N : Node_Id) return Union_Id is
1913 pragma Assert (Nkind (N) in N_Entity);
1914 return Nodes.Table (N + 1).Field11;
1917 function Field12 (N : Node_Id) return Union_Id is
1919 pragma Assert (Nkind (N) in N_Entity);
1920 return Nodes.Table (N + 1).Field12;
1923 function Field13 (N : Node_Id) return Union_Id is
1925 pragma Assert (Nkind (N) in N_Entity);
1926 return Nodes.Table (N + 2).Field6;
1929 function Field14 (N : Node_Id) return Union_Id is
1931 pragma Assert (Nkind (N) in N_Entity);
1932 return Nodes.Table (N + 2).Field7;
1935 function Field15 (N : Node_Id) return Union_Id is
1937 pragma Assert (Nkind (N) in N_Entity);
1938 return Nodes.Table (N + 2).Field8;
1941 function Field16 (N : Node_Id) return Union_Id is
1943 pragma Assert (Nkind (N) in N_Entity);
1944 return Nodes.Table (N + 2).Field9;
1947 function Field17 (N : Node_Id) return Union_Id is
1949 pragma Assert (Nkind (N) in N_Entity);
1950 return Nodes.Table (N + 2).Field10;
1953 function Field18 (N : Node_Id) return Union_Id is
1955 pragma Assert (Nkind (N) in N_Entity);
1956 return Nodes.Table (N + 2).Field11;
1959 function Field19 (N : Node_Id) return Union_Id is
1961 pragma Assert (Nkind (N) in N_Entity);
1962 return Nodes.Table (N + 3).Field6;
1965 function Field20 (N : Node_Id) return Union_Id is
1967 pragma Assert (Nkind (N) in N_Entity);
1968 return Nodes.Table (N + 3).Field7;
1971 function Field21 (N : Node_Id) return Union_Id is
1973 pragma Assert (Nkind (N) in N_Entity);
1974 return Nodes.Table (N + 3).Field8;
1977 function Field22 (N : Node_Id) return Union_Id is
1979 pragma Assert (Nkind (N) in N_Entity);
1980 return Nodes.Table (N + 3).Field9;
1983 function Field23 (N : Node_Id) return Union_Id is
1985 pragma Assert (Nkind (N) in N_Entity);
1986 return Nodes.Table (N + 3).Field10;
1989 function Field24 (N : Node_Id) return Union_Id is
1991 pragma Assert (Nkind (N) in N_Entity);
1992 return Nodes.Table (N + 4).Field6;
1995 function Field25 (N : Node_Id) return Union_Id is
1997 pragma Assert (Nkind (N) in N_Entity);
1998 return Nodes.Table (N + 4).Field7;
2001 function Field26 (N : Node_Id) return Union_Id is
2003 pragma Assert (Nkind (N) in N_Entity);
2004 return Nodes.Table (N + 4).Field8;
2007 function Field27 (N : Node_Id) return Union_Id is
2009 pragma Assert (Nkind (N) in N_Entity);
2010 return Nodes.Table (N + 4).Field9;
2013 function Field28 (N : Node_Id) return Union_Id is
2015 pragma Assert (Nkind (N) in N_Entity);
2016 return Nodes.Table (N + 4).Field10;
2019 function Node1 (N : Node_Id) return Node_Id is
2021 pragma Assert (N <= Nodes.Last);
2022 return Node_Id (Nodes.Table (N).Field1);
2025 function Node2 (N : Node_Id) return Node_Id is
2027 pragma Assert (N <= Nodes.Last);
2028 return Node_Id (Nodes.Table (N).Field2);
2031 function Node3 (N : Node_Id) return Node_Id is
2033 pragma Assert (N <= Nodes.Last);
2034 return Node_Id (Nodes.Table (N).Field3);
2037 function Node4 (N : Node_Id) return Node_Id is
2039 pragma Assert (N <= Nodes.Last);
2040 return Node_Id (Nodes.Table (N).Field4);
2043 function Node5 (N : Node_Id) return Node_Id is
2045 pragma Assert (N <= Nodes.Last);
2046 return Node_Id (Nodes.Table (N).Field5);
2049 function Node6 (N : Node_Id) return Node_Id is
2051 pragma Assert (Nkind (N) in N_Entity);
2052 return Node_Id (Nodes.Table (N + 1).Field6);
2055 function Node7 (N : Node_Id) return Node_Id is
2057 pragma Assert (Nkind (N) in N_Entity);
2058 return Node_Id (Nodes.Table (N + 1).Field7);
2061 function Node8 (N : Node_Id) return Node_Id is
2063 pragma Assert (Nkind (N) in N_Entity);
2064 return Node_Id (Nodes.Table (N + 1).Field8);
2067 function Node9 (N : Node_Id) return Node_Id is
2069 pragma Assert (Nkind (N) in N_Entity);
2070 return Node_Id (Nodes.Table (N + 1).Field9);
2073 function Node10 (N : Node_Id) return Node_Id is
2075 pragma Assert (Nkind (N) in N_Entity);
2076 return Node_Id (Nodes.Table (N + 1).Field10);
2079 function Node11 (N : Node_Id) return Node_Id is
2081 pragma Assert (Nkind (N) in N_Entity);
2082 return Node_Id (Nodes.Table (N + 1).Field11);
2085 function Node12 (N : Node_Id) return Node_Id is
2087 pragma Assert (Nkind (N) in N_Entity);
2088 return Node_Id (Nodes.Table (N + 1).Field12);
2091 function Node13 (N : Node_Id) return Node_Id is
2093 pragma Assert (Nkind (N) in N_Entity);
2094 return Node_Id (Nodes.Table (N + 2).Field6);
2097 function Node14 (N : Node_Id) return Node_Id is
2099 pragma Assert (Nkind (N) in N_Entity);
2100 return Node_Id (Nodes.Table (N + 2).Field7);
2103 function Node15 (N : Node_Id) return Node_Id is
2105 pragma Assert (Nkind (N) in N_Entity);
2106 return Node_Id (Nodes.Table (N + 2).Field8);
2109 function Node16 (N : Node_Id) return Node_Id is
2111 pragma Assert (Nkind (N) in N_Entity);
2112 return Node_Id (Nodes.Table (N + 2).Field9);
2115 function Node17 (N : Node_Id) return Node_Id is
2117 pragma Assert (Nkind (N) in N_Entity);
2118 return Node_Id (Nodes.Table (N + 2).Field10);
2121 function Node18 (N : Node_Id) return Node_Id is
2123 pragma Assert (Nkind (N) in N_Entity);
2124 return Node_Id (Nodes.Table (N + 2).Field11);
2127 function Node19 (N : Node_Id) return Node_Id is
2129 pragma Assert (Nkind (N) in N_Entity);
2130 return Node_Id (Nodes.Table (N + 3).Field6);
2133 function Node20 (N : Node_Id) return Node_Id is
2135 pragma Assert (Nkind (N) in N_Entity);
2136 return Node_Id (Nodes.Table (N + 3).Field7);
2139 function Node21 (N : Node_Id) return Node_Id is
2141 pragma Assert (Nkind (N) in N_Entity);
2142 return Node_Id (Nodes.Table (N + 3).Field8);
2145 function Node22 (N : Node_Id) return Node_Id is
2147 pragma Assert (Nkind (N) in N_Entity);
2148 return Node_Id (Nodes.Table (N + 3).Field9);
2151 function Node23 (N : Node_Id) return Node_Id is
2153 pragma Assert (Nkind (N) in N_Entity);
2154 return Node_Id (Nodes.Table (N + 3).Field10);
2157 function Node24 (N : Node_Id) return Node_Id is
2159 pragma Assert (Nkind (N) in N_Entity);
2160 return Node_Id (Nodes.Table (N + 4).Field6);
2163 function Node25 (N : Node_Id) return Node_Id is
2165 pragma Assert (Nkind (N) in N_Entity);
2166 return Node_Id (Nodes.Table (N + 4).Field7);
2169 function Node26 (N : Node_Id) return Node_Id is
2171 pragma Assert (Nkind (N) in N_Entity);
2172 return Node_Id (Nodes.Table (N + 4).Field8);
2175 function Node27 (N : Node_Id) return Node_Id is
2177 pragma Assert (Nkind (N) in N_Entity);
2178 return Node_Id (Nodes.Table (N + 4).Field9);
2181 function Node28 (N : Node_Id) return Node_Id is
2183 pragma Assert (Nkind (N) in N_Entity);
2184 return Node_Id (Nodes.Table (N + 4).Field10);
2187 function List1 (N : Node_Id) return List_Id is
2189 pragma Assert (N <= Nodes.Last);
2190 return List_Id (Nodes.Table (N).Field1);
2193 function List2 (N : Node_Id) return List_Id is
2195 pragma Assert (N <= Nodes.Last);
2196 return List_Id (Nodes.Table (N).Field2);
2199 function List3 (N : Node_Id) return List_Id is
2201 pragma Assert (N <= Nodes.Last);
2202 return List_Id (Nodes.Table (N).Field3);
2205 function List4 (N : Node_Id) return List_Id is
2207 pragma Assert (N <= Nodes.Last);
2208 return List_Id (Nodes.Table (N).Field4);
2211 function List5 (N : Node_Id) return List_Id is
2213 pragma Assert (N <= Nodes.Last);
2214 return List_Id (Nodes.Table (N).Field5);
2217 function List10 (N : Node_Id) return List_Id is
2219 pragma Assert (Nkind (N) in N_Entity);
2220 return List_Id (Nodes.Table (N + 1).Field10);
2223 function List14 (N : Node_Id) return List_Id is
2225 pragma Assert (Nkind (N) in N_Entity);
2226 return List_Id (Nodes.Table (N + 2).Field7);
2229 function Elist1 (N : Node_Id) return Elist_Id is
2230 pragma Assert (N <= Nodes.Last);
2231 Value : constant Union_Id := Nodes.Table (N).Field1;
2236 return Elist_Id (Value);
2240 function Elist2 (N : Node_Id) return Elist_Id is
2241 pragma Assert (N <= Nodes.Last);
2242 Value : constant Union_Id := Nodes.Table (N).Field2;
2247 return Elist_Id (Value);
2251 function Elist3 (N : Node_Id) return Elist_Id is
2252 pragma Assert (N <= Nodes.Last);
2253 Value : constant Union_Id := Nodes.Table (N).Field3;
2258 return Elist_Id (Value);
2262 function Elist4 (N : Node_Id) return Elist_Id is
2263 pragma Assert (N <= Nodes.Last);
2264 Value : constant Union_Id := Nodes.Table (N).Field4;
2269 return Elist_Id (Value);
2273 function Elist8 (N : Node_Id) return Elist_Id is
2274 pragma Assert (Nkind (N) in N_Entity);
2275 Value : constant Union_Id := Nodes.Table (N + 1).Field8;
2280 return Elist_Id (Value);
2284 function Elist13 (N : Node_Id) return Elist_Id is
2285 pragma Assert (Nkind (N) in N_Entity);
2286 Value : constant Union_Id := Nodes.Table (N + 2).Field6;
2291 return Elist_Id (Value);
2295 function Elist15 (N : Node_Id) return Elist_Id is
2296 pragma Assert (Nkind (N) in N_Entity);
2297 Value : constant Union_Id := Nodes.Table (N + 2).Field8;
2302 return Elist_Id (Value);
2306 function Elist16 (N : Node_Id) return Elist_Id is
2307 pragma Assert (Nkind (N) in N_Entity);
2308 Value : constant Union_Id := Nodes.Table (N + 2).Field9;
2313 return Elist_Id (Value);
2317 function Elist18 (N : Node_Id) return Elist_Id is
2318 pragma Assert (Nkind (N) in N_Entity);
2319 Value : constant Union_Id := Nodes.Table (N + 2).Field11;
2324 return Elist_Id (Value);
2328 function Elist21 (N : Node_Id) return Elist_Id is
2329 pragma Assert (Nkind (N) in N_Entity);
2330 Value : constant Union_Id := Nodes.Table (N + 3).Field8;
2335 return Elist_Id (Value);
2339 function Elist23 (N : Node_Id) return Elist_Id is
2340 pragma Assert (Nkind (N) in N_Entity);
2341 Value : constant Union_Id := Nodes.Table (N + 3).Field10;
2346 return Elist_Id (Value);
2350 function Elist25 (N : Node_Id) return Elist_Id is
2351 pragma Assert (Nkind (N) in N_Entity);
2352 Value : constant Union_Id := Nodes.Table (N + 4).Field7;
2357 return Elist_Id (Value);
2361 function Elist26 (N : Node_Id) return Elist_Id is
2362 pragma Assert (Nkind (N) in N_Entity);
2363 Value : constant Union_Id := Nodes.Table (N + 4).Field8;
2368 return Elist_Id (Value);
2372 function Name1 (N : Node_Id) return Name_Id is
2374 pragma Assert (N <= Nodes.Last);
2375 return Name_Id (Nodes.Table (N).Field1);
2378 function Name2 (N : Node_Id) return Name_Id is
2380 pragma Assert (N <= Nodes.Last);
2381 return Name_Id (Nodes.Table (N).Field2);
2384 function Str3 (N : Node_Id) return String_Id is
2386 pragma Assert (N <= Nodes.Last);
2387 return String_Id (Nodes.Table (N).Field3);
2390 function Uint2 (N : Node_Id) return Uint is
2391 pragma Assert (N <= Nodes.Last);
2392 U : constant Union_Id := Nodes.Table (N).Field2;
2397 return From_Union (U);
2401 function Uint3 (N : Node_Id) return Uint is
2402 pragma Assert (N <= Nodes.Last);
2403 U : constant Union_Id := Nodes.Table (N).Field3;
2408 return From_Union (U);
2412 function Uint4 (N : Node_Id) return Uint is
2413 pragma Assert (N <= Nodes.Last);
2414 U : constant Union_Id := Nodes.Table (N).Field4;
2419 return From_Union (U);
2423 function Uint5 (N : Node_Id) return Uint is
2424 pragma Assert (N <= Nodes.Last);
2425 U : constant Union_Id := Nodes.Table (N).Field5;
2430 return From_Union (U);
2434 function Uint8 (N : Node_Id) return Uint is
2435 pragma Assert (Nkind (N) in N_Entity);
2436 U : constant Union_Id := Nodes.Table (N + 1).Field8;
2441 return From_Union (U);
2445 function Uint9 (N : Node_Id) return Uint is
2446 pragma Assert (Nkind (N) in N_Entity);
2447 U : constant Union_Id := Nodes.Table (N + 1).Field9;
2452 return From_Union (U);
2456 function Uint10 (N : Node_Id) return Uint is
2457 pragma Assert (Nkind (N) in N_Entity);
2458 U : constant Union_Id := Nodes.Table (N + 1).Field10;
2463 return From_Union (U);
2467 function Uint11 (N : Node_Id) return Uint is
2468 pragma Assert (Nkind (N) in N_Entity);
2469 U : constant Union_Id := Nodes.Table (N + 1).Field11;
2474 return From_Union (U);
2478 function Uint12 (N : Node_Id) return Uint is
2479 pragma Assert (Nkind (N) in N_Entity);
2480 U : constant Union_Id := Nodes.Table (N + 1).Field12;
2485 return From_Union (U);
2489 function Uint13 (N : Node_Id) return Uint is
2490 pragma Assert (Nkind (N) in N_Entity);
2491 U : constant Union_Id := Nodes.Table (N + 2).Field6;
2496 return From_Union (U);
2500 function Uint14 (N : Node_Id) return Uint is
2501 pragma Assert (Nkind (N) in N_Entity);
2502 U : constant Union_Id := Nodes.Table (N + 2).Field7;
2507 return From_Union (U);
2511 function Uint15 (N : Node_Id) return Uint is
2512 pragma Assert (Nkind (N) in N_Entity);
2513 U : constant Union_Id := Nodes.Table (N + 2).Field8;
2518 return From_Union (U);
2522 function Uint16 (N : Node_Id) return Uint is
2523 pragma Assert (Nkind (N) in N_Entity);
2524 U : constant Union_Id := Nodes.Table (N + 2).Field9;
2529 return From_Union (U);
2533 function Uint17 (N : Node_Id) return Uint is
2534 pragma Assert (Nkind (N) in N_Entity);
2535 U : constant Union_Id := Nodes.Table (N + 2).Field10;
2540 return From_Union (U);
2544 function Uint22 (N : Node_Id) return Uint is
2545 pragma Assert (Nkind (N) in N_Entity);
2546 U : constant Union_Id := Nodes.Table (N + 3).Field9;
2551 return From_Union (U);
2555 function Ureal3 (N : Node_Id) return Ureal is
2557 pragma Assert (N <= Nodes.Last);
2558 return From_Union (Nodes.Table (N).Field3);
2561 function Ureal18 (N : Node_Id) return Ureal is
2563 pragma Assert (Nkind (N) in N_Entity);
2564 return From_Union (Nodes.Table (N + 2).Field11);
2567 function Ureal21 (N : Node_Id) return Ureal is
2569 pragma Assert (Nkind (N) in N_Entity);
2570 return From_Union (Nodes.Table (N + 3).Field8);
2573 function Flag4 (N : Node_Id) return Boolean is
2575 pragma Assert (N <= Nodes.Last);
2576 return Nodes.Table (N).Flag4;
2579 function Flag5 (N : Node_Id) return Boolean is
2581 pragma Assert (N <= Nodes.Last);
2582 return Nodes.Table (N).Flag5;
2585 function Flag6 (N : Node_Id) return Boolean is
2587 pragma Assert (N <= Nodes.Last);
2588 return Nodes.Table (N).Flag6;
2591 function Flag7 (N : Node_Id) return Boolean is
2593 pragma Assert (N <= Nodes.Last);
2594 return Nodes.Table (N).Flag7;
2597 function Flag8 (N : Node_Id) return Boolean is
2599 pragma Assert (N <= Nodes.Last);
2600 return Nodes.Table (N).Flag8;
2603 function Flag9 (N : Node_Id) return Boolean is
2605 pragma Assert (N <= Nodes.Last);
2606 return Nodes.Table (N).Flag9;
2609 function Flag10 (N : Node_Id) return Boolean is
2611 pragma Assert (N <= Nodes.Last);
2612 return Nodes.Table (N).Flag10;
2615 function Flag11 (N : Node_Id) return Boolean is
2617 pragma Assert (N <= Nodes.Last);
2618 return Nodes.Table (N).Flag11;
2621 function Flag12 (N : Node_Id) return Boolean is
2623 pragma Assert (N <= Nodes.Last);
2624 return Nodes.Table (N).Flag12;
2627 function Flag13 (N : Node_Id) return Boolean is
2629 pragma Assert (N <= Nodes.Last);
2630 return Nodes.Table (N).Flag13;
2633 function Flag14 (N : Node_Id) return Boolean is
2635 pragma Assert (N <= Nodes.Last);
2636 return Nodes.Table (N).Flag14;
2639 function Flag15 (N : Node_Id) return Boolean is
2641 pragma Assert (N <= Nodes.Last);
2642 return Nodes.Table (N).Flag15;
2645 function Flag16 (N : Node_Id) return Boolean is
2647 pragma Assert (N <= Nodes.Last);
2648 return Nodes.Table (N).Flag16;
2651 function Flag17 (N : Node_Id) return Boolean is
2653 pragma Assert (N <= Nodes.Last);
2654 return Nodes.Table (N).Flag17;
2657 function Flag18 (N : Node_Id) return Boolean is
2659 pragma Assert (N <= Nodes.Last);
2660 return Nodes.Table (N).Flag18;
2663 function Flag19 (N : Node_Id) return Boolean is
2665 pragma Assert (Nkind (N) in N_Entity);
2666 return Nodes.Table (N + 1).In_List;
2669 function Flag20 (N : Node_Id) return Boolean is
2671 pragma Assert (Nkind (N) in N_Entity);
2672 return Nodes.Table (N + 1).Unused_1;
2675 function Flag21 (N : Node_Id) return Boolean is
2677 pragma Assert (Nkind (N) in N_Entity);
2678 return Nodes.Table (N + 1).Rewrite_Ins;
2681 function Flag22 (N : Node_Id) return Boolean is
2683 pragma Assert (Nkind (N) in N_Entity);
2684 return Nodes.Table (N + 1).Analyzed;
2687 function Flag23 (N : Node_Id) return Boolean is
2689 pragma Assert (Nkind (N) in N_Entity);
2690 return Nodes.Table (N + 1).Comes_From_Source;
2693 function Flag24 (N : Node_Id) return Boolean is
2695 pragma Assert (Nkind (N) in N_Entity);
2696 return Nodes.Table (N + 1).Error_Posted;
2699 function Flag25 (N : Node_Id) return Boolean is
2701 pragma Assert (Nkind (N) in N_Entity);
2702 return Nodes.Table (N + 1).Flag4;
2705 function Flag26 (N : Node_Id) return Boolean is
2707 pragma Assert (Nkind (N) in N_Entity);
2708 return Nodes.Table (N + 1).Flag5;
2711 function Flag27 (N : Node_Id) return Boolean is
2713 pragma Assert (Nkind (N) in N_Entity);
2714 return Nodes.Table (N + 1).Flag6;
2717 function Flag28 (N : Node_Id) return Boolean is
2719 pragma Assert (Nkind (N) in N_Entity);
2720 return Nodes.Table (N + 1).Flag7;
2723 function Flag29 (N : Node_Id) return Boolean is
2725 pragma Assert (Nkind (N) in N_Entity);
2726 return Nodes.Table (N + 1).Flag8;
2729 function Flag30 (N : Node_Id) return Boolean is
2731 pragma Assert (Nkind (N) in N_Entity);
2732 return Nodes.Table (N + 1).Flag9;
2735 function Flag31 (N : Node_Id) return Boolean is
2737 pragma Assert (Nkind (N) in N_Entity);
2738 return Nodes.Table (N + 1).Flag10;
2741 function Flag32 (N : Node_Id) return Boolean is
2743 pragma Assert (Nkind (N) in N_Entity);
2744 return Nodes.Table (N + 1).Flag11;
2747 function Flag33 (N : Node_Id) return Boolean is
2749 pragma Assert (Nkind (N) in N_Entity);
2750 return Nodes.Table (N + 1).Flag12;
2753 function Flag34 (N : Node_Id) return Boolean is
2755 pragma Assert (Nkind (N) in N_Entity);
2756 return Nodes.Table (N + 1).Flag13;
2759 function Flag35 (N : Node_Id) return Boolean is
2761 pragma Assert (Nkind (N) in N_Entity);
2762 return Nodes.Table (N + 1).Flag14;
2765 function Flag36 (N : Node_Id) return Boolean is
2767 pragma Assert (Nkind (N) in N_Entity);
2768 return Nodes.Table (N + 1).Flag15;
2771 function Flag37 (N : Node_Id) return Boolean is
2773 pragma Assert (Nkind (N) in N_Entity);
2774 return Nodes.Table (N + 1).Flag16;
2777 function Flag38 (N : Node_Id) return Boolean is
2779 pragma Assert (Nkind (N) in N_Entity);
2780 return Nodes.Table (N + 1).Flag17;
2783 function Flag39 (N : Node_Id) return Boolean is
2785 pragma Assert (Nkind (N) in N_Entity);
2786 return Nodes.Table (N + 1).Flag18;
2789 function Flag40 (N : Node_Id) return Boolean is
2791 pragma Assert (Nkind (N) in N_Entity);
2792 return Nodes.Table (N + 2).In_List;
2795 function Flag41 (N : Node_Id) return Boolean is
2797 pragma Assert (Nkind (N) in N_Entity);
2798 return Nodes.Table (N + 2).Unused_1;
2801 function Flag42 (N : Node_Id) return Boolean is
2803 pragma Assert (Nkind (N) in N_Entity);
2804 return Nodes.Table (N + 2).Rewrite_Ins;
2807 function Flag43 (N : Node_Id) return Boolean is
2809 pragma Assert (Nkind (N) in N_Entity);
2810 return Nodes.Table (N + 2).Analyzed;
2813 function Flag44 (N : Node_Id) return Boolean is
2815 pragma Assert (Nkind (N) in N_Entity);
2816 return Nodes.Table (N + 2).Comes_From_Source;
2819 function Flag45 (N : Node_Id) return Boolean is
2821 pragma Assert (Nkind (N) in N_Entity);
2822 return Nodes.Table (N + 2).Error_Posted;
2825 function Flag46 (N : Node_Id) return Boolean is
2827 pragma Assert (Nkind (N) in N_Entity);
2828 return Nodes.Table (N + 2).Flag4;
2831 function Flag47 (N : Node_Id) return Boolean is
2833 pragma Assert (Nkind (N) in N_Entity);
2834 return Nodes.Table (N + 2).Flag5;
2837 function Flag48 (N : Node_Id) return Boolean is
2839 pragma Assert (Nkind (N) in N_Entity);
2840 return Nodes.Table (N + 2).Flag6;
2843 function Flag49 (N : Node_Id) return Boolean is
2845 pragma Assert (Nkind (N) in N_Entity);
2846 return Nodes.Table (N + 2).Flag7;
2849 function Flag50 (N : Node_Id) return Boolean is
2851 pragma Assert (Nkind (N) in N_Entity);
2852 return Nodes.Table (N + 2).Flag8;
2855 function Flag51 (N : Node_Id) return Boolean is
2857 pragma Assert (Nkind (N) in N_Entity);
2858 return Nodes.Table (N + 2).Flag9;
2861 function Flag52 (N : Node_Id) return Boolean is
2863 pragma Assert (Nkind (N) in N_Entity);
2864 return Nodes.Table (N + 2).Flag10;
2867 function Flag53 (N : Node_Id) return Boolean is
2869 pragma Assert (Nkind (N) in N_Entity);
2870 return Nodes.Table (N + 2).Flag11;
2873 function Flag54 (N : Node_Id) return Boolean is
2875 pragma Assert (Nkind (N) in N_Entity);
2876 return Nodes.Table (N + 2).Flag12;
2879 function Flag55 (N : Node_Id) return Boolean is
2881 pragma Assert (Nkind (N) in N_Entity);
2882 return Nodes.Table (N + 2).Flag13;
2885 function Flag56 (N : Node_Id) return Boolean is
2887 pragma Assert (Nkind (N) in N_Entity);
2888 return Nodes.Table (N + 2).Flag14;
2891 function Flag57 (N : Node_Id) return Boolean is
2893 pragma Assert (Nkind (N) in N_Entity);
2894 return Nodes.Table (N + 2).Flag15;
2897 function Flag58 (N : Node_Id) return Boolean is
2899 pragma Assert (Nkind (N) in N_Entity);
2900 return Nodes.Table (N + 2).Flag16;
2903 function Flag59 (N : Node_Id) return Boolean is
2905 pragma Assert (Nkind (N) in N_Entity);
2906 return Nodes.Table (N + 2).Flag17;
2909 function Flag60 (N : Node_Id) return Boolean is
2911 pragma Assert (Nkind (N) in N_Entity);
2912 return Nodes.Table (N + 2).Flag18;
2915 function Flag61 (N : Node_Id) return Boolean is
2917 pragma Assert (Nkind (N) in N_Entity);
2918 return Nodes.Table (N + 1).Pflag1;
2921 function Flag62 (N : Node_Id) return Boolean is
2923 pragma Assert (Nkind (N) in N_Entity);
2924 return Nodes.Table (N + 1).Pflag2;
2927 function Flag63 (N : Node_Id) return Boolean is
2929 pragma Assert (Nkind (N) in N_Entity);
2930 return Nodes.Table (N + 2).Pflag1;
2933 function Flag64 (N : Node_Id) return Boolean is
2935 pragma Assert (Nkind (N) in N_Entity);
2936 return Nodes.Table (N + 2).Pflag2;
2939 function Flag65 (N : Node_Id) return Boolean is
2941 pragma Assert (Nkind (N) in N_Entity);
2942 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag65;
2945 function Flag66 (N : Node_Id) return Boolean is
2947 pragma Assert (Nkind (N) in N_Entity);
2948 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag66;
2951 function Flag67 (N : Node_Id) return Boolean is
2953 pragma Assert (Nkind (N) in N_Entity);
2954 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag67;
2957 function Flag68 (N : Node_Id) return Boolean is
2959 pragma Assert (Nkind (N) in N_Entity);
2960 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag68;
2963 function Flag69 (N : Node_Id) return Boolean is
2965 pragma Assert (Nkind (N) in N_Entity);
2966 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag69;
2969 function Flag70 (N : Node_Id) return Boolean is
2971 pragma Assert (Nkind (N) in N_Entity);
2972 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag70;
2975 function Flag71 (N : Node_Id) return Boolean is
2977 pragma Assert (Nkind (N) in N_Entity);
2978 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag71;
2981 function Flag72 (N : Node_Id) return Boolean is
2983 pragma Assert (Nkind (N) in N_Entity);
2984 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag72;
2987 function Flag73 (N : Node_Id) return Boolean is
2989 pragma Assert (Nkind (N) in N_Entity);
2990 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag73;
2993 function Flag74 (N : Node_Id) return Boolean is
2995 pragma Assert (Nkind (N) in N_Entity);
2996 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag74;
2999 function Flag75 (N : Node_Id) return Boolean is
3001 pragma Assert (Nkind (N) in N_Entity);
3002 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag75;
3005 function Flag76 (N : Node_Id) return Boolean is
3007 pragma Assert (Nkind (N) in N_Entity);
3008 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag76;
3011 function Flag77 (N : Node_Id) return Boolean is
3013 pragma Assert (Nkind (N) in N_Entity);
3014 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag77;
3017 function Flag78 (N : Node_Id) return Boolean is
3019 pragma Assert (Nkind (N) in N_Entity);
3020 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag78;
3023 function Flag79 (N : Node_Id) return Boolean is
3025 pragma Assert (Nkind (N) in N_Entity);
3026 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag79;
3029 function Flag80 (N : Node_Id) return Boolean is
3031 pragma Assert (Nkind (N) in N_Entity);
3032 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag80;
3035 function Flag81 (N : Node_Id) return Boolean is
3037 pragma Assert (Nkind (N) in N_Entity);
3038 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag81;
3041 function Flag82 (N : Node_Id) return Boolean is
3043 pragma Assert (Nkind (N) in N_Entity);
3044 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag82;
3047 function Flag83 (N : Node_Id) return Boolean is
3049 pragma Assert (Nkind (N) in N_Entity);
3050 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag83;
3053 function Flag84 (N : Node_Id) return Boolean is
3055 pragma Assert (Nkind (N) in N_Entity);
3056 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag84;
3059 function Flag85 (N : Node_Id) return Boolean is
3061 pragma Assert (Nkind (N) in N_Entity);
3062 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag85;
3065 function Flag86 (N : Node_Id) return Boolean is
3067 pragma Assert (Nkind (N) in N_Entity);
3068 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag86;
3071 function Flag87 (N : Node_Id) return Boolean is
3073 pragma Assert (Nkind (N) in N_Entity);
3074 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag87;
3077 function Flag88 (N : Node_Id) return Boolean is
3079 pragma Assert (Nkind (N) in N_Entity);
3080 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag88;
3083 function Flag89 (N : Node_Id) return Boolean is
3085 pragma Assert (Nkind (N) in N_Entity);
3086 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag89;
3089 function Flag90 (N : Node_Id) return Boolean is
3091 pragma Assert (Nkind (N) in N_Entity);
3092 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag90;
3095 function Flag91 (N : Node_Id) return Boolean is
3097 pragma Assert (Nkind (N) in N_Entity);
3098 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag91;
3101 function Flag92 (N : Node_Id) return Boolean is
3103 pragma Assert (Nkind (N) in N_Entity);
3104 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag92;
3107 function Flag93 (N : Node_Id) return Boolean is
3109 pragma Assert (Nkind (N) in N_Entity);
3110 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag93;
3113 function Flag94 (N : Node_Id) return Boolean is
3115 pragma Assert (Nkind (N) in N_Entity);
3116 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag94;
3119 function Flag95 (N : Node_Id) return Boolean is
3121 pragma Assert (Nkind (N) in N_Entity);
3122 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag95;
3125 function Flag96 (N : Node_Id) return Boolean is
3127 pragma Assert (Nkind (N) in N_Entity);
3128 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag96;
3131 function Flag97 (N : Node_Id) return Boolean is
3133 pragma Assert (Nkind (N) in N_Entity);
3134 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag97;
3137 function Flag98 (N : Node_Id) return Boolean is
3139 pragma Assert (Nkind (N) in N_Entity);
3140 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag98;
3143 function Flag99 (N : Node_Id) return Boolean is
3145 pragma Assert (Nkind (N) in N_Entity);
3146 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag99;
3149 function Flag100 (N : Node_Id) return Boolean is
3151 pragma Assert (Nkind (N) in N_Entity);
3152 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag100;
3155 function Flag101 (N : Node_Id) return Boolean is
3157 pragma Assert (Nkind (N) in N_Entity);
3158 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag101;
3161 function Flag102 (N : Node_Id) return Boolean is
3163 pragma Assert (Nkind (N) in N_Entity);
3164 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag102;
3167 function Flag103 (N : Node_Id) return Boolean is
3169 pragma Assert (Nkind (N) in N_Entity);
3170 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag103;
3173 function Flag104 (N : Node_Id) return Boolean is
3175 pragma Assert (Nkind (N) in N_Entity);
3176 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag104;
3179 function Flag105 (N : Node_Id) return Boolean is
3181 pragma Assert (Nkind (N) in N_Entity);
3182 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag105;
3185 function Flag106 (N : Node_Id) return Boolean is
3187 pragma Assert (Nkind (N) in N_Entity);
3188 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag106;
3191 function Flag107 (N : Node_Id) return Boolean is
3193 pragma Assert (Nkind (N) in N_Entity);
3194 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag107;
3197 function Flag108 (N : Node_Id) return Boolean is
3199 pragma Assert (Nkind (N) in N_Entity);
3200 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag108;
3203 function Flag109 (N : Node_Id) return Boolean is
3205 pragma Assert (Nkind (N) in N_Entity);
3206 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag109;
3209 function Flag110 (N : Node_Id) return Boolean is
3211 pragma Assert (Nkind (N) in N_Entity);
3212 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag110;
3215 function Flag111 (N : Node_Id) return Boolean is
3217 pragma Assert (Nkind (N) in N_Entity);
3218 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag111;
3221 function Flag112 (N : Node_Id) return Boolean is
3223 pragma Assert (Nkind (N) in N_Entity);
3224 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag112;
3227 function Flag113 (N : Node_Id) return Boolean is
3229 pragma Assert (Nkind (N) in N_Entity);
3230 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag113;
3233 function Flag114 (N : Node_Id) return Boolean is
3235 pragma Assert (Nkind (N) in N_Entity);
3236 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag114;
3239 function Flag115 (N : Node_Id) return Boolean is
3241 pragma Assert (Nkind (N) in N_Entity);
3242 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag115;
3245 function Flag116 (N : Node_Id) return Boolean is
3247 pragma Assert (Nkind (N) in N_Entity);
3248 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag116;
3251 function Flag117 (N : Node_Id) return Boolean is
3253 pragma Assert (Nkind (N) in N_Entity);
3254 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag117;
3257 function Flag118 (N : Node_Id) return Boolean is
3259 pragma Assert (Nkind (N) in N_Entity);
3260 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag118;
3263 function Flag119 (N : Node_Id) return Boolean is
3265 pragma Assert (Nkind (N) in N_Entity);
3266 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag119;
3269 function Flag120 (N : Node_Id) return Boolean is
3271 pragma Assert (Nkind (N) in N_Entity);
3272 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag120;
3275 function Flag121 (N : Node_Id) return Boolean is
3277 pragma Assert (Nkind (N) in N_Entity);
3278 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag121;
3281 function Flag122 (N : Node_Id) return Boolean is
3283 pragma Assert (Nkind (N) in N_Entity);
3284 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag122;
3287 function Flag123 (N : Node_Id) return Boolean is
3289 pragma Assert (Nkind (N) in N_Entity);
3290 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag123;
3293 function Flag124 (N : Node_Id) return Boolean is
3295 pragma Assert (Nkind (N) in N_Entity);
3296 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag124;
3299 function Flag125 (N : Node_Id) return Boolean is
3301 pragma Assert (Nkind (N) in N_Entity);
3302 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag125;
3305 function Flag126 (N : Node_Id) return Boolean is
3307 pragma Assert (Nkind (N) in N_Entity);
3308 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag126;
3311 function Flag127 (N : Node_Id) return Boolean is
3313 pragma Assert (Nkind (N) in N_Entity);
3314 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag127;
3317 function Flag128 (N : Node_Id) return Boolean is
3319 pragma Assert (Nkind (N) in N_Entity);
3320 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag128;
3323 function Flag129 (N : Node_Id) return Boolean is
3325 pragma Assert (Nkind (N) in N_Entity);
3326 return Nodes.Table (N + 3).In_List;
3329 function Flag130 (N : Node_Id) return Boolean is
3331 pragma Assert (Nkind (N) in N_Entity);
3332 return Nodes.Table (N + 3).Unused_1;
3335 function Flag131 (N : Node_Id) return Boolean is
3337 pragma Assert (Nkind (N) in N_Entity);
3338 return Nodes.Table (N + 3).Rewrite_Ins;
3341 function Flag132 (N : Node_Id) return Boolean is
3343 pragma Assert (Nkind (N) in N_Entity);
3344 return Nodes.Table (N + 3).Analyzed;
3347 function Flag133 (N : Node_Id) return Boolean is
3349 pragma Assert (Nkind (N) in N_Entity);
3350 return Nodes.Table (N + 3).Comes_From_Source;
3353 function Flag134 (N : Node_Id) return Boolean is
3355 pragma Assert (Nkind (N) in N_Entity);
3356 return Nodes.Table (N + 3).Error_Posted;
3359 function Flag135 (N : Node_Id) return Boolean is
3361 pragma Assert (Nkind (N) in N_Entity);
3362 return Nodes.Table (N + 3).Flag4;
3365 function Flag136 (N : Node_Id) return Boolean is
3367 pragma Assert (Nkind (N) in N_Entity);
3368 return Nodes.Table (N + 3).Flag5;
3371 function Flag137 (N : Node_Id) return Boolean is
3373 pragma Assert (Nkind (N) in N_Entity);
3374 return Nodes.Table (N + 3).Flag6;
3377 function Flag138 (N : Node_Id) return Boolean is
3379 pragma Assert (Nkind (N) in N_Entity);
3380 return Nodes.Table (N + 3).Flag7;
3383 function Flag139 (N : Node_Id) return Boolean is
3385 pragma Assert (Nkind (N) in N_Entity);
3386 return Nodes.Table (N + 3).Flag8;
3389 function Flag140 (N : Node_Id) return Boolean is
3391 pragma Assert (Nkind (N) in N_Entity);
3392 return Nodes.Table (N + 3).Flag9;
3395 function Flag141 (N : Node_Id) return Boolean is
3397 pragma Assert (Nkind (N) in N_Entity);
3398 return Nodes.Table (N + 3).Flag10;
3401 function Flag142 (N : Node_Id) return Boolean is
3403 pragma Assert (Nkind (N) in N_Entity);
3404 return Nodes.Table (N + 3).Flag11;
3407 function Flag143 (N : Node_Id) return Boolean is
3409 pragma Assert (Nkind (N) in N_Entity);
3410 return Nodes.Table (N + 3).Flag12;
3413 function Flag144 (N : Node_Id) return Boolean is
3415 pragma Assert (Nkind (N) in N_Entity);
3416 return Nodes.Table (N + 3).Flag13;
3419 function Flag145 (N : Node_Id) return Boolean is
3421 pragma Assert (Nkind (N) in N_Entity);
3422 return Nodes.Table (N + 3).Flag14;
3425 function Flag146 (N : Node_Id) return Boolean is
3427 pragma Assert (Nkind (N) in N_Entity);
3428 return Nodes.Table (N + 3).Flag15;
3431 function Flag147 (N : Node_Id) return Boolean is
3433 pragma Assert (Nkind (N) in N_Entity);
3434 return Nodes.Table (N + 3).Flag16;
3437 function Flag148 (N : Node_Id) return Boolean is
3439 pragma Assert (Nkind (N) in N_Entity);
3440 return Nodes.Table (N + 3).Flag17;
3443 function Flag149 (N : Node_Id) return Boolean is
3445 pragma Assert (Nkind (N) in N_Entity);
3446 return Nodes.Table (N + 3).Flag18;
3449 function Flag150 (N : Node_Id) return Boolean is
3451 pragma Assert (Nkind (N) in N_Entity);
3452 return Nodes.Table (N + 3).Pflag1;
3455 function Flag151 (N : Node_Id) return Boolean is
3457 pragma Assert (Nkind (N) in N_Entity);
3458 return Nodes.Table (N + 3).Pflag2;
3461 function Flag152 (N : Node_Id) return Boolean is
3463 pragma Assert (Nkind (N) in N_Entity);
3464 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag152;
3467 function Flag153 (N : Node_Id) return Boolean is
3469 pragma Assert (Nkind (N) in N_Entity);
3470 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag153;
3473 function Flag154 (N : Node_Id) return Boolean is
3475 pragma Assert (Nkind (N) in N_Entity);
3476 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag154;
3479 function Flag155 (N : Node_Id) return Boolean is
3481 pragma Assert (Nkind (N) in N_Entity);
3482 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag155;
3485 function Flag156 (N : Node_Id) return Boolean is
3487 pragma Assert (Nkind (N) in N_Entity);
3488 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag156;
3491 function Flag157 (N : Node_Id) return Boolean is
3493 pragma Assert (Nkind (N) in N_Entity);
3494 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag157;
3497 function Flag158 (N : Node_Id) return Boolean is
3499 pragma Assert (Nkind (N) in N_Entity);
3500 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag158;
3503 function Flag159 (N : Node_Id) return Boolean is
3505 pragma Assert (Nkind (N) in N_Entity);
3506 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag159;
3509 function Flag160 (N : Node_Id) return Boolean is
3511 pragma Assert (Nkind (N) in N_Entity);
3512 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag160;
3515 function Flag161 (N : Node_Id) return Boolean is
3517 pragma Assert (Nkind (N) in N_Entity);
3518 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag161;
3521 function Flag162 (N : Node_Id) return Boolean is
3523 pragma Assert (Nkind (N) in N_Entity);
3524 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag162;
3527 function Flag163 (N : Node_Id) return Boolean is
3529 pragma Assert (Nkind (N) in N_Entity);
3530 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag163;
3533 function Flag164 (N : Node_Id) return Boolean is
3535 pragma Assert (Nkind (N) in N_Entity);
3536 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag164;
3539 function Flag165 (N : Node_Id) return Boolean is
3541 pragma Assert (Nkind (N) in N_Entity);
3542 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag165;
3545 function Flag166 (N : Node_Id) return Boolean is
3547 pragma Assert (Nkind (N) in N_Entity);
3548 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag166;
3551 function Flag167 (N : Node_Id) return Boolean is
3553 pragma Assert (Nkind (N) in N_Entity);
3554 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag167;
3557 function Flag168 (N : Node_Id) return Boolean is
3559 pragma Assert (Nkind (N) in N_Entity);
3560 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag168;
3563 function Flag169 (N : Node_Id) return Boolean is
3565 pragma Assert (Nkind (N) in N_Entity);
3566 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag169;
3569 function Flag170 (N : Node_Id) return Boolean is
3571 pragma Assert (Nkind (N) in N_Entity);
3572 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag170;
3575 function Flag171 (N : Node_Id) return Boolean is
3577 pragma Assert (Nkind (N) in N_Entity);
3578 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag171;
3581 function Flag172 (N : Node_Id) return Boolean is
3583 pragma Assert (Nkind (N) in N_Entity);
3584 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag172;
3587 function Flag173 (N : Node_Id) return Boolean is
3589 pragma Assert (Nkind (N) in N_Entity);
3590 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag173;
3593 function Flag174 (N : Node_Id) return Boolean is
3595 pragma Assert (Nkind (N) in N_Entity);
3596 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag174;
3599 function Flag175 (N : Node_Id) return Boolean is
3601 pragma Assert (Nkind (N) in N_Entity);
3602 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag175;
3605 function Flag176 (N : Node_Id) return Boolean is
3607 pragma Assert (Nkind (N) in N_Entity);
3608 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag176;
3611 function Flag177 (N : Node_Id) return Boolean is
3613 pragma Assert (Nkind (N) in N_Entity);
3614 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag177;
3617 function Flag178 (N : Node_Id) return Boolean is
3619 pragma Assert (Nkind (N) in N_Entity);
3620 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag178;
3623 function Flag179 (N : Node_Id) return Boolean is
3625 pragma Assert (Nkind (N) in N_Entity);
3626 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag179;
3629 function Flag180 (N : Node_Id) return Boolean is
3631 pragma Assert (Nkind (N) in N_Entity);
3632 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag180;
3635 function Flag181 (N : Node_Id) return Boolean is
3637 pragma Assert (Nkind (N) in N_Entity);
3638 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag181;
3641 function Flag182 (N : Node_Id) return Boolean is
3643 pragma Assert (Nkind (N) in N_Entity);
3644 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag182;
3647 function Flag183 (N : Node_Id) return Boolean is
3649 pragma Assert (Nkind (N) in N_Entity);
3650 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag183;
3653 function Flag184 (N : Node_Id) return Boolean is
3655 pragma Assert (Nkind (N) in N_Entity);
3656 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag184;
3659 function Flag185 (N : Node_Id) return Boolean is
3661 pragma Assert (Nkind (N) in N_Entity);
3662 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag185;
3665 function Flag186 (N : Node_Id) return Boolean is
3667 pragma Assert (Nkind (N) in N_Entity);
3668 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag186;
3671 function Flag187 (N : Node_Id) return Boolean is
3673 pragma Assert (Nkind (N) in N_Entity);
3674 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag187;
3677 function Flag188 (N : Node_Id) return Boolean is
3679 pragma Assert (Nkind (N) in N_Entity);
3680 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag188;
3683 function Flag189 (N : Node_Id) return Boolean is
3685 pragma Assert (Nkind (N) in N_Entity);
3686 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag189;
3689 function Flag190 (N : Node_Id) return Boolean is
3691 pragma Assert (Nkind (N) in N_Entity);
3692 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag190;
3695 function Flag191 (N : Node_Id) return Boolean is
3697 pragma Assert (Nkind (N) in N_Entity);
3698 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag191;
3701 function Flag192 (N : Node_Id) return Boolean is
3703 pragma Assert (Nkind (N) in N_Entity);
3704 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag192;
3707 function Flag193 (N : Node_Id) return Boolean is
3709 pragma Assert (Nkind (N) in N_Entity);
3710 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag193;
3713 function Flag194 (N : Node_Id) return Boolean is
3715 pragma Assert (Nkind (N) in N_Entity);
3716 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag194;
3719 function Flag195 (N : Node_Id) return Boolean is
3721 pragma Assert (Nkind (N) in N_Entity);
3722 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag195;
3725 function Flag196 (N : Node_Id) return Boolean is
3727 pragma Assert (Nkind (N) in N_Entity);
3728 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag196;
3731 function Flag197 (N : Node_Id) return Boolean is
3733 pragma Assert (Nkind (N) in N_Entity);
3734 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag197;
3737 function Flag198 (N : Node_Id) return Boolean is
3739 pragma Assert (Nkind (N) in N_Entity);
3740 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag198;
3743 function Flag199 (N : Node_Id) return Boolean is
3745 pragma Assert (Nkind (N) in N_Entity);
3746 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag199;
3749 function Flag200 (N : Node_Id) return Boolean is
3751 pragma Assert (Nkind (N) in N_Entity);
3752 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag200;
3755 function Flag201 (N : Node_Id) return Boolean is
3757 pragma Assert (Nkind (N) in N_Entity);
3758 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag201;
3761 function Flag202 (N : Node_Id) return Boolean is
3763 pragma Assert (Nkind (N) in N_Entity);
3764 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag202;
3767 function Flag203 (N : Node_Id) return Boolean is
3769 pragma Assert (Nkind (N) in N_Entity);
3770 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag203;
3773 function Flag204 (N : Node_Id) return Boolean is
3775 pragma Assert (Nkind (N) in N_Entity);
3776 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag204;
3779 function Flag205 (N : Node_Id) return Boolean is
3781 pragma Assert (Nkind (N) in N_Entity);
3782 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag205;
3785 function Flag206 (N : Node_Id) return Boolean is
3787 pragma Assert (Nkind (N) in N_Entity);
3788 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag206;
3791 function Flag207 (N : Node_Id) return Boolean is
3793 pragma Assert (Nkind (N) in N_Entity);
3794 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag207;
3797 function Flag208 (N : Node_Id) return Boolean is
3799 pragma Assert (Nkind (N) in N_Entity);
3800 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag208;
3803 function Flag209 (N : Node_Id) return Boolean is
3805 pragma Assert (Nkind (N) in N_Entity);
3806 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag209;
3809 function Flag210 (N : Node_Id) return Boolean is
3811 pragma Assert (Nkind (N) in N_Entity);
3812 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag210;
3815 function Flag211 (N : Node_Id) return Boolean is
3817 pragma Assert (Nkind (N) in N_Entity);
3818 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag211;
3821 function Flag212 (N : Node_Id) return Boolean is
3823 pragma Assert (Nkind (N) in N_Entity);
3824 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag212;
3827 function Flag213 (N : Node_Id) return Boolean is
3829 pragma Assert (Nkind (N) in N_Entity);
3830 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag213;
3833 function Flag214 (N : Node_Id) return Boolean is
3835 pragma Assert (Nkind (N) in N_Entity);
3836 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag214;
3839 function Flag215 (N : Node_Id) return Boolean is
3841 pragma Assert (Nkind (N) in N_Entity);
3842 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag215;
3845 function Flag216 (N : Node_Id) return Boolean is
3847 pragma Assert (Nkind (N) in N_Entity);
3848 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag216;
3851 function Flag217 (N : Node_Id) return Boolean is
3853 pragma Assert (Nkind (N) in N_Entity);
3854 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag217;
3857 function Flag218 (N : Node_Id) return Boolean is
3859 pragma Assert (Nkind (N) in N_Entity);
3860 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag218;
3863 function Flag219 (N : Node_Id) return Boolean is
3865 pragma Assert (Nkind (N) in N_Entity);
3866 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag219;
3869 function Flag220 (N : Node_Id) return Boolean is
3871 pragma Assert (Nkind (N) in N_Entity);
3872 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag220;
3875 function Flag221 (N : Node_Id) return Boolean is
3877 pragma Assert (Nkind (N) in N_Entity);
3878 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag221;
3881 function Flag222 (N : Node_Id) return Boolean is
3883 pragma Assert (Nkind (N) in N_Entity);
3884 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag222;
3887 function Flag223 (N : Node_Id) return Boolean is
3889 pragma Assert (Nkind (N) in N_Entity);
3890 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag223;
3893 function Flag224 (N : Node_Id) return Boolean is
3895 pragma Assert (Nkind (N) in N_Entity);
3896 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag224;
3899 function Flag225 (N : Node_Id) return Boolean is
3901 pragma Assert (Nkind (N) in N_Entity);
3902 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag225;
3905 function Flag226 (N : Node_Id) return Boolean is
3907 pragma Assert (Nkind (N) in N_Entity);
3908 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag226;
3911 function Flag227 (N : Node_Id) return Boolean is
3913 pragma Assert (Nkind (N) in N_Entity);
3914 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag227;
3917 function Flag228 (N : Node_Id) return Boolean is
3919 pragma Assert (Nkind (N) in N_Entity);
3920 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag228;
3923 function Flag229 (N : Node_Id) return Boolean is
3925 pragma Assert (Nkind (N) in N_Entity);
3926 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag229;
3929 function Flag230 (N : Node_Id) return Boolean is
3931 pragma Assert (Nkind (N) in N_Entity);
3932 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag230;
3935 function Flag231 (N : Node_Id) return Boolean is
3937 pragma Assert (Nkind (N) in N_Entity);
3938 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag231;
3941 function Flag232 (N : Node_Id) return Boolean is
3943 pragma Assert (Nkind (N) in N_Entity);
3944 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag232;
3947 function Flag233 (N : Node_Id) return Boolean is
3949 pragma Assert (Nkind (N) in N_Entity);
3950 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag233;
3953 function Flag234 (N : Node_Id) return Boolean is
3955 pragma Assert (Nkind (N) in N_Entity);
3956 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag234;
3959 function Flag235 (N : Node_Id) return Boolean is
3961 pragma Assert (Nkind (N) in N_Entity);
3962 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag235;
3965 function Flag236 (N : Node_Id) return Boolean is
3967 pragma Assert (Nkind (N) in N_Entity);
3968 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag236;
3971 function Flag237 (N : Node_Id) return Boolean is
3973 pragma Assert (Nkind (N) in N_Entity);
3974 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag237;
3977 function Flag238 (N : Node_Id) return Boolean is
3979 pragma Assert (Nkind (N) in N_Entity);
3980 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag238;
3983 function Flag239 (N : Node_Id) return Boolean is
3985 pragma Assert (Nkind (N) in N_Entity);
3986 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag239;
3989 function Flag240 (N : Node_Id) return Boolean is
3991 pragma Assert (Nkind (N) in N_Entity);
3992 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag240;
3995 function Flag241 (N : Node_Id) return Boolean is
3997 pragma Assert (Nkind (N) in N_Entity);
3998 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag241;
4001 function Flag242 (N : Node_Id) return Boolean is
4003 pragma Assert (Nkind (N) in N_Entity);
4004 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag242;
4007 function Flag243 (N : Node_Id) return Boolean is
4009 pragma Assert (Nkind (N) in N_Entity);
4010 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag243;
4013 function Flag244 (N : Node_Id) return Boolean is
4015 pragma Assert (Nkind (N) in N_Entity);
4016 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag244;
4019 function Flag245 (N : Node_Id) return Boolean is
4021 pragma Assert (Nkind (N) in N_Entity);
4022 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag245;
4025 function Flag246 (N : Node_Id) return Boolean is
4027 pragma Assert (Nkind (N) in N_Entity);
4028 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag246;
4031 function Flag247 (N : Node_Id) return Boolean is
4033 pragma Assert (Nkind (N) in N_Entity);
4034 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag247;
4037 procedure Set_Nkind (N : Node_Id; Val : Node_Kind) is
4039 pragma Assert (N <= Nodes.Last);
4040 Nodes.Table (N).Nkind := Val;
4043 procedure Set_Field1 (N : Node_Id; Val : Union_Id) is
4045 pragma Assert (N <= Nodes.Last);
4046 Nodes.Table (N).Field1 := Val;
4049 procedure Set_Field2 (N : Node_Id; Val : Union_Id) is
4051 pragma Assert (N <= Nodes.Last);
4052 Nodes.Table (N).Field2 := Val;
4055 procedure Set_Field3 (N : Node_Id; Val : Union_Id) is
4057 pragma Assert (N <= Nodes.Last);
4058 Nodes.Table (N).Field3 := Val;
4061 procedure Set_Field4 (N : Node_Id; Val : Union_Id) is
4063 pragma Assert (N <= Nodes.Last);
4064 Nodes.Table (N).Field4 := Val;
4067 procedure Set_Field5 (N : Node_Id; Val : Union_Id) is
4069 pragma Assert (N <= Nodes.Last);
4070 Nodes.Table (N).Field5 := Val;
4073 procedure Set_Field6 (N : Node_Id; Val : Union_Id) is
4075 pragma Assert (Nkind (N) in N_Entity);
4076 Nodes.Table (N + 1).Field6 := Val;
4079 procedure Set_Field7 (N : Node_Id; Val : Union_Id) is
4081 pragma Assert (Nkind (N) in N_Entity);
4082 Nodes.Table (N + 1).Field7 := Val;
4085 procedure Set_Field8 (N : Node_Id; Val : Union_Id) is
4087 pragma Assert (Nkind (N) in N_Entity);
4088 Nodes.Table (N + 1).Field8 := Val;
4091 procedure Set_Field9 (N : Node_Id; Val : Union_Id) is
4093 pragma Assert (Nkind (N) in N_Entity);
4094 Nodes.Table (N + 1).Field9 := Val;
4097 procedure Set_Field10 (N : Node_Id; Val : Union_Id) is
4099 pragma Assert (Nkind (N) in N_Entity);
4100 Nodes.Table (N + 1).Field10 := Val;
4103 procedure Set_Field11 (N : Node_Id; Val : Union_Id) is
4105 pragma Assert (Nkind (N) in N_Entity);
4106 Nodes.Table (N + 1).Field11 := Val;
4109 procedure Set_Field12 (N : Node_Id; Val : Union_Id) is
4111 pragma Assert (Nkind (N) in N_Entity);
4112 Nodes.Table (N + 1).Field12 := Val;
4115 procedure Set_Field13 (N : Node_Id; Val : Union_Id) is
4117 pragma Assert (Nkind (N) in N_Entity);
4118 Nodes.Table (N + 2).Field6 := Val;
4121 procedure Set_Field14 (N : Node_Id; Val : Union_Id) is
4123 pragma Assert (Nkind (N) in N_Entity);
4124 Nodes.Table (N + 2).Field7 := Val;
4127 procedure Set_Field15 (N : Node_Id; Val : Union_Id) is
4129 pragma Assert (Nkind (N) in N_Entity);
4130 Nodes.Table (N + 2).Field8 := Val;
4133 procedure Set_Field16 (N : Node_Id; Val : Union_Id) is
4135 pragma Assert (Nkind (N) in N_Entity);
4136 Nodes.Table (N + 2).Field9 := Val;
4139 procedure Set_Field17 (N : Node_Id; Val : Union_Id) is
4141 pragma Assert (Nkind (N) in N_Entity);
4142 Nodes.Table (N + 2).Field10 := Val;
4145 procedure Set_Field18 (N : Node_Id; Val : Union_Id) is
4147 pragma Assert (Nkind (N) in N_Entity);
4148 Nodes.Table (N + 2).Field11 := Val;
4151 procedure Set_Field19 (N : Node_Id; Val : Union_Id) is
4153 pragma Assert (Nkind (N) in N_Entity);
4154 Nodes.Table (N + 3).Field6 := Val;
4157 procedure Set_Field20 (N : Node_Id; Val : Union_Id) is
4159 pragma Assert (Nkind (N) in N_Entity);
4160 Nodes.Table (N + 3).Field7 := Val;
4163 procedure Set_Field21 (N : Node_Id; Val : Union_Id) is
4165 pragma Assert (Nkind (N) in N_Entity);
4166 Nodes.Table (N + 3).Field8 := Val;
4169 procedure Set_Field22 (N : Node_Id; Val : Union_Id) is
4171 pragma Assert (Nkind (N) in N_Entity);
4172 Nodes.Table (N + 3).Field9 := Val;
4175 procedure Set_Field23 (N : Node_Id; Val : Union_Id) is
4177 pragma Assert (Nkind (N) in N_Entity);
4178 Nodes.Table (N + 3).Field10 := Val;
4181 procedure Set_Field24 (N : Node_Id; Val : Union_Id) is
4183 pragma Assert (Nkind (N) in N_Entity);
4184 Nodes.Table (N + 4).Field6 := Val;
4187 procedure Set_Field25 (N : Node_Id; Val : Union_Id) is
4189 pragma Assert (Nkind (N) in N_Entity);
4190 Nodes.Table (N + 4).Field7 := Val;
4193 procedure Set_Field26 (N : Node_Id; Val : Union_Id) is
4195 pragma Assert (Nkind (N) in N_Entity);
4196 Nodes.Table (N + 4).Field8 := Val;
4199 procedure Set_Field27 (N : Node_Id; Val : Union_Id) is
4201 pragma Assert (Nkind (N) in N_Entity);
4202 Nodes.Table (N + 4).Field9 := Val;
4205 procedure Set_Field28 (N : Node_Id; Val : Union_Id) is
4207 pragma Assert (Nkind (N) in N_Entity);
4208 Nodes.Table (N + 4).Field10 := Val;
4211 procedure Set_Node1 (N : Node_Id; Val : Node_Id) is
4213 pragma Assert (N <= Nodes.Last);
4214 Nodes.Table (N).Field1 := Union_Id (Val);
4217 procedure Set_Node2 (N : Node_Id; Val : Node_Id) is
4219 pragma Assert (N <= Nodes.Last);
4220 Nodes.Table (N).Field2 := Union_Id (Val);
4223 procedure Set_Node3 (N : Node_Id; Val : Node_Id) is
4225 pragma Assert (N <= Nodes.Last);
4226 Nodes.Table (N).Field3 := Union_Id (Val);
4229 procedure Set_Node4 (N : Node_Id; Val : Node_Id) is
4231 pragma Assert (N <= Nodes.Last);
4232 Nodes.Table (N).Field4 := Union_Id (Val);
4235 procedure Set_Node5 (N : Node_Id; Val : Node_Id) is
4237 pragma Assert (N <= Nodes.Last);
4238 Nodes.Table (N).Field5 := Union_Id (Val);
4241 procedure Set_Node6 (N : Node_Id; Val : Node_Id) is
4243 pragma Assert (Nkind (N) in N_Entity);
4244 Nodes.Table (N + 1).Field6 := Union_Id (Val);
4247 procedure Set_Node7 (N : Node_Id; Val : Node_Id) is
4249 pragma Assert (Nkind (N) in N_Entity);
4250 Nodes.Table (N + 1).Field7 := Union_Id (Val);
4253 procedure Set_Node8 (N : Node_Id; Val : Node_Id) is
4255 pragma Assert (Nkind (N) in N_Entity);
4256 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4259 procedure Set_Node9 (N : Node_Id; Val : Node_Id) is
4261 pragma Assert (Nkind (N) in N_Entity);
4262 Nodes.Table (N + 1).Field9 := Union_Id (Val);
4265 procedure Set_Node10 (N : Node_Id; Val : Node_Id) is
4267 pragma Assert (Nkind (N) in N_Entity);
4268 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4271 procedure Set_Node11 (N : Node_Id; Val : Node_Id) is
4273 pragma Assert (Nkind (N) in N_Entity);
4274 Nodes.Table (N + 1).Field11 := Union_Id (Val);
4277 procedure Set_Node12 (N : Node_Id; Val : Node_Id) is
4279 pragma Assert (Nkind (N) in N_Entity);
4280 Nodes.Table (N + 1).Field12 := Union_Id (Val);
4283 procedure Set_Node13 (N : Node_Id; Val : Node_Id) is
4285 pragma Assert (Nkind (N) in N_Entity);
4286 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4289 procedure Set_Node14 (N : Node_Id; Val : Node_Id) is
4291 pragma Assert (Nkind (N) in N_Entity);
4292 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4295 procedure Set_Node15 (N : Node_Id; Val : Node_Id) is
4297 pragma Assert (Nkind (N) in N_Entity);
4298 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4301 procedure Set_Node16 (N : Node_Id; Val : Node_Id) is
4303 pragma Assert (Nkind (N) in N_Entity);
4304 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4307 procedure Set_Node17 (N : Node_Id; Val : Node_Id) is
4309 pragma Assert (Nkind (N) in N_Entity);
4310 Nodes.Table (N + 2).Field10 := Union_Id (Val);
4313 procedure Set_Node18 (N : Node_Id; Val : Node_Id) is
4315 pragma Assert (Nkind (N) in N_Entity);
4316 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4319 procedure Set_Node19 (N : Node_Id; Val : Node_Id) is
4321 pragma Assert (Nkind (N) in N_Entity);
4322 Nodes.Table (N + 3).Field6 := Union_Id (Val);
4325 procedure Set_Node20 (N : Node_Id; Val : Node_Id) is
4327 pragma Assert (Nkind (N) in N_Entity);
4328 Nodes.Table (N + 3).Field7 := Union_Id (Val);
4331 procedure Set_Node21 (N : Node_Id; Val : Node_Id) is
4333 pragma Assert (Nkind (N) in N_Entity);
4334 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4337 procedure Set_Node22 (N : Node_Id; Val : Node_Id) is
4339 pragma Assert (Nkind (N) in N_Entity);
4340 Nodes.Table (N + 3).Field9 := Union_Id (Val);
4343 procedure Set_Node23 (N : Node_Id; Val : Node_Id) is
4345 pragma Assert (Nkind (N) in N_Entity);
4346 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4349 procedure Set_Node24 (N : Node_Id; Val : Node_Id) is
4351 pragma Assert (Nkind (N) in N_Entity);
4352 Nodes.Table (N + 4).Field6 := Union_Id (Val);
4355 procedure Set_Node25 (N : Node_Id; Val : Node_Id) is
4357 pragma Assert (Nkind (N) in N_Entity);
4358 Nodes.Table (N + 4).Field7 := Union_Id (Val);
4361 procedure Set_Node26 (N : Node_Id; Val : Node_Id) is
4363 pragma Assert (Nkind (N) in N_Entity);
4364 Nodes.Table (N + 4).Field8 := Union_Id (Val);
4367 procedure Set_Node27 (N : Node_Id; Val : Node_Id) is
4369 pragma Assert (Nkind (N) in N_Entity);
4370 Nodes.Table (N + 4).Field9 := Union_Id (Val);
4373 procedure Set_Node28 (N : Node_Id; Val : Node_Id) is
4375 pragma Assert (Nkind (N) in N_Entity);
4376 Nodes.Table (N + 4).Field10 := Union_Id (Val);
4379 procedure Set_List1 (N : Node_Id; Val : List_Id) is
4381 pragma Assert (N <= Nodes.Last);
4382 Nodes.Table (N).Field1 := Union_Id (Val);
4385 procedure Set_List2 (N : Node_Id; Val : List_Id) is
4387 pragma Assert (N <= Nodes.Last);
4388 Nodes.Table (N).Field2 := Union_Id (Val);
4391 procedure Set_List3 (N : Node_Id; Val : List_Id) is
4393 pragma Assert (N <= Nodes.Last);
4394 Nodes.Table (N).Field3 := Union_Id (Val);
4397 procedure Set_List4 (N : Node_Id; Val : List_Id) is
4399 pragma Assert (N <= Nodes.Last);
4400 Nodes.Table (N).Field4 := Union_Id (Val);
4403 procedure Set_List5 (N : Node_Id; Val : List_Id) is
4405 pragma Assert (N <= Nodes.Last);
4406 Nodes.Table (N).Field5 := Union_Id (Val);
4409 procedure Set_List10 (N : Node_Id; Val : List_Id) is
4411 pragma Assert (Nkind (N) in N_Entity);
4412 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4415 procedure Set_List14 (N : Node_Id; Val : List_Id) is
4417 pragma Assert (Nkind (N) in N_Entity);
4418 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4421 procedure Set_Elist1 (N : Node_Id; Val : Elist_Id) is
4423 Nodes.Table (N).Field1 := Union_Id (Val);
4426 procedure Set_Elist2 (N : Node_Id; Val : Elist_Id) is
4428 Nodes.Table (N).Field2 := Union_Id (Val);
4431 procedure Set_Elist3 (N : Node_Id; Val : Elist_Id) is
4433 Nodes.Table (N).Field3 := Union_Id (Val);
4436 procedure Set_Elist4 (N : Node_Id; Val : Elist_Id) is
4438 Nodes.Table (N).Field4 := Union_Id (Val);
4441 procedure Set_Elist8 (N : Node_Id; Val : Elist_Id) is
4443 pragma Assert (Nkind (N) in N_Entity);
4444 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4447 procedure Set_Elist13 (N : Node_Id; Val : Elist_Id) is
4449 pragma Assert (Nkind (N) in N_Entity);
4450 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4453 procedure Set_Elist15 (N : Node_Id; Val : Elist_Id) is
4455 pragma Assert (Nkind (N) in N_Entity);
4456 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4459 procedure Set_Elist16 (N : Node_Id; Val : Elist_Id) is
4461 pragma Assert (Nkind (N) in N_Entity);
4462 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4465 procedure Set_Elist18 (N : Node_Id; Val : Elist_Id) is
4467 pragma Assert (Nkind (N) in N_Entity);
4468 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4471 procedure Set_Elist21 (N : Node_Id; Val : Elist_Id) is
4473 pragma Assert (Nkind (N) in N_Entity);
4474 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4477 procedure Set_Elist23 (N : Node_Id; Val : Elist_Id) is
4479 pragma Assert (Nkind (N) in N_Entity);
4480 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4483 procedure Set_Elist25 (N : Node_Id; Val : Elist_Id) is
4485 pragma Assert (Nkind (N) in N_Entity);
4486 Nodes.Table (N + 4).Field7 := Union_Id (Val);
4489 procedure Set_Elist26 (N : Node_Id; Val : Elist_Id) is
4491 pragma Assert (Nkind (N) in N_Entity);
4492 Nodes.Table (N + 4).Field8 := Union_Id (Val);
4495 procedure Set_Name1 (N : Node_Id; Val : Name_Id) is
4497 pragma Assert (N <= Nodes.Last);
4498 Nodes.Table (N).Field1 := Union_Id (Val);
4501 procedure Set_Name2 (N : Node_Id; Val : Name_Id) is
4503 pragma Assert (N <= Nodes.Last);
4504 Nodes.Table (N).Field2 := Union_Id (Val);
4507 procedure Set_Str3 (N : Node_Id; Val : String_Id) is
4509 pragma Assert (N <= Nodes.Last);
4510 Nodes.Table (N).Field3 := Union_Id (Val);
4513 procedure Set_Uint2 (N : Node_Id; Val : Uint) is
4515 pragma Assert (N <= Nodes.Last);
4516 Nodes.Table (N).Field2 := To_Union (Val);
4519 procedure Set_Uint3 (N : Node_Id; Val : Uint) is
4521 pragma Assert (N <= Nodes.Last);
4522 Nodes.Table (N).Field3 := To_Union (Val);
4525 procedure Set_Uint4 (N : Node_Id; Val : Uint) is
4527 pragma Assert (N <= Nodes.Last);
4528 Nodes.Table (N).Field4 := To_Union (Val);
4531 procedure Set_Uint5 (N : Node_Id; Val : Uint) is
4533 pragma Assert (N <= Nodes.Last);
4534 Nodes.Table (N).Field5 := To_Union (Val);
4537 procedure Set_Uint8 (N : Node_Id; Val : Uint) is
4539 pragma Assert (Nkind (N) in N_Entity);
4540 Nodes.Table (N + 1).Field8 := To_Union (Val);
4543 procedure Set_Uint9 (N : Node_Id; Val : Uint) is
4545 pragma Assert (Nkind (N) in N_Entity);
4546 Nodes.Table (N + 1).Field9 := To_Union (Val);
4549 procedure Set_Uint10 (N : Node_Id; Val : Uint) is
4551 pragma Assert (Nkind (N) in N_Entity);
4552 Nodes.Table (N + 1).Field10 := To_Union (Val);
4555 procedure Set_Uint11 (N : Node_Id; Val : Uint) is
4557 pragma Assert (Nkind (N) in N_Entity);
4558 Nodes.Table (N + 1).Field11 := To_Union (Val);
4561 procedure Set_Uint12 (N : Node_Id; Val : Uint) is
4563 pragma Assert (Nkind (N) in N_Entity);
4564 Nodes.Table (N + 1).Field12 := To_Union (Val);
4567 procedure Set_Uint13 (N : Node_Id; Val : Uint) is
4569 pragma Assert (Nkind (N) in N_Entity);
4570 Nodes.Table (N + 2).Field6 := To_Union (Val);
4573 procedure Set_Uint14 (N : Node_Id; Val : Uint) is
4575 pragma Assert (Nkind (N) in N_Entity);
4576 Nodes.Table (N + 2).Field7 := To_Union (Val);
4579 procedure Set_Uint15 (N : Node_Id; Val : Uint) is
4581 pragma Assert (Nkind (N) in N_Entity);
4582 Nodes.Table (N + 2).Field8 := To_Union (Val);
4585 procedure Set_Uint16 (N : Node_Id; Val : Uint) is
4587 pragma Assert (Nkind (N) in N_Entity);
4588 Nodes.Table (N + 2).Field9 := To_Union (Val);
4591 procedure Set_Uint17 (N : Node_Id; Val : Uint) is
4593 pragma Assert (Nkind (N) in N_Entity);
4594 Nodes.Table (N + 2).Field10 := To_Union (Val);
4597 procedure Set_Uint22 (N : Node_Id; Val : Uint) is
4599 pragma Assert (Nkind (N) in N_Entity);
4600 Nodes.Table (N + 3).Field9 := To_Union (Val);
4603 procedure Set_Ureal3 (N : Node_Id; Val : Ureal) is
4605 pragma Assert (N <= Nodes.Last);
4606 Nodes.Table (N).Field3 := To_Union (Val);
4609 procedure Set_Ureal18 (N : Node_Id; Val : Ureal) is
4611 pragma Assert (Nkind (N) in N_Entity);
4612 Nodes.Table (N + 2).Field11 := To_Union (Val);
4615 procedure Set_Ureal21 (N : Node_Id; Val : Ureal) is
4617 pragma Assert (Nkind (N) in N_Entity);
4618 Nodes.Table (N + 3).Field8 := To_Union (Val);
4621 procedure Set_Flag4 (N : Node_Id; Val : Boolean) is
4623 pragma Assert (N <= Nodes.Last);
4624 Nodes.Table (N).Flag4 := Val;
4627 procedure Set_Flag5 (N : Node_Id; Val : Boolean) is
4629 pragma Assert (N <= Nodes.Last);
4630 Nodes.Table (N).Flag5 := Val;
4633 procedure Set_Flag6 (N : Node_Id; Val : Boolean) is
4635 pragma Assert (N <= Nodes.Last);
4636 Nodes.Table (N).Flag6 := Val;
4639 procedure Set_Flag7 (N : Node_Id; Val : Boolean) is
4641 pragma Assert (N <= Nodes.Last);
4642 Nodes.Table (N).Flag7 := Val;
4645 procedure Set_Flag8 (N : Node_Id; Val : Boolean) is
4647 pragma Assert (N <= Nodes.Last);
4648 Nodes.Table (N).Flag8 := Val;
4651 procedure Set_Flag9 (N : Node_Id; Val : Boolean) is
4653 pragma Assert (N <= Nodes.Last);
4654 Nodes.Table (N).Flag9 := Val;
4657 procedure Set_Flag10 (N : Node_Id; Val : Boolean) is
4659 pragma Assert (N <= Nodes.Last);
4660 Nodes.Table (N).Flag10 := Val;
4663 procedure Set_Flag11 (N : Node_Id; Val : Boolean) is
4665 pragma Assert (N <= Nodes.Last);
4666 Nodes.Table (N).Flag11 := Val;
4669 procedure Set_Flag12 (N : Node_Id; Val : Boolean) is
4671 pragma Assert (N <= Nodes.Last);
4672 Nodes.Table (N).Flag12 := Val;
4675 procedure Set_Flag13 (N : Node_Id; Val : Boolean) is
4677 pragma Assert (N <= Nodes.Last);
4678 Nodes.Table (N).Flag13 := Val;
4681 procedure Set_Flag14 (N : Node_Id; Val : Boolean) is
4683 pragma Assert (N <= Nodes.Last);
4684 Nodes.Table (N).Flag14 := Val;
4687 procedure Set_Flag15 (N : Node_Id; Val : Boolean) is
4689 pragma Assert (N <= Nodes.Last);
4690 Nodes.Table (N).Flag15 := Val;
4693 procedure Set_Flag16 (N : Node_Id; Val : Boolean) is
4695 pragma Assert (N <= Nodes.Last);
4696 Nodes.Table (N).Flag16 := Val;
4699 procedure Set_Flag17 (N : Node_Id; Val : Boolean) is
4701 pragma Assert (N <= Nodes.Last);
4702 Nodes.Table (N).Flag17 := Val;
4705 procedure Set_Flag18 (N : Node_Id; Val : Boolean) is
4707 pragma Assert (N <= Nodes.Last);
4708 Nodes.Table (N).Flag18 := Val;
4711 procedure Set_Flag19 (N : Node_Id; Val : Boolean) is
4713 pragma Assert (Nkind (N) in N_Entity);
4714 Nodes.Table (N + 1).In_List := Val;
4717 procedure Set_Flag20 (N : Node_Id; Val : Boolean) is
4719 pragma Assert (Nkind (N) in N_Entity);
4720 Nodes.Table (N + 1).Unused_1 := Val;
4723 procedure Set_Flag21 (N : Node_Id; Val : Boolean) is
4725 pragma Assert (Nkind (N) in N_Entity);
4726 Nodes.Table (N + 1).Rewrite_Ins := Val;
4729 procedure Set_Flag22 (N : Node_Id; Val : Boolean) is
4731 pragma Assert (Nkind (N) in N_Entity);
4732 Nodes.Table (N + 1).Analyzed := Val;
4735 procedure Set_Flag23 (N : Node_Id; Val : Boolean) is
4737 pragma Assert (Nkind (N) in N_Entity);
4738 Nodes.Table (N + 1).Comes_From_Source := Val;
4741 procedure Set_Flag24 (N : Node_Id; Val : Boolean) is
4743 pragma Assert (Nkind (N) in N_Entity);
4744 Nodes.Table (N + 1).Error_Posted := Val;
4747 procedure Set_Flag25 (N : Node_Id; Val : Boolean) is
4749 pragma Assert (Nkind (N) in N_Entity);
4750 Nodes.Table (N + 1).Flag4 := Val;
4753 procedure Set_Flag26 (N : Node_Id; Val : Boolean) is
4755 pragma Assert (Nkind (N) in N_Entity);
4756 Nodes.Table (N + 1).Flag5 := Val;
4759 procedure Set_Flag27 (N : Node_Id; Val : Boolean) is
4761 pragma Assert (Nkind (N) in N_Entity);
4762 Nodes.Table (N + 1).Flag6 := Val;
4765 procedure Set_Flag28 (N : Node_Id; Val : Boolean) is
4767 pragma Assert (Nkind (N) in N_Entity);
4768 Nodes.Table (N + 1).Flag7 := Val;
4771 procedure Set_Flag29 (N : Node_Id; Val : Boolean) is
4773 pragma Assert (Nkind (N) in N_Entity);
4774 Nodes.Table (N + 1).Flag8 := Val;
4777 procedure Set_Flag30 (N : Node_Id; Val : Boolean) is
4779 pragma Assert (Nkind (N) in N_Entity);
4780 Nodes.Table (N + 1).Flag9 := Val;
4783 procedure Set_Flag31 (N : Node_Id; Val : Boolean) is
4785 pragma Assert (Nkind (N) in N_Entity);
4786 Nodes.Table (N + 1).Flag10 := Val;
4789 procedure Set_Flag32 (N : Node_Id; Val : Boolean) is
4791 pragma Assert (Nkind (N) in N_Entity);
4792 Nodes.Table (N + 1).Flag11 := Val;
4795 procedure Set_Flag33 (N : Node_Id; Val : Boolean) is
4797 pragma Assert (Nkind (N) in N_Entity);
4798 Nodes.Table (N + 1).Flag12 := Val;
4801 procedure Set_Flag34 (N : Node_Id; Val : Boolean) is
4803 pragma Assert (Nkind (N) in N_Entity);
4804 Nodes.Table (N + 1).Flag13 := Val;
4807 procedure Set_Flag35 (N : Node_Id; Val : Boolean) is
4809 pragma Assert (Nkind (N) in N_Entity);
4810 Nodes.Table (N + 1).Flag14 := Val;
4813 procedure Set_Flag36 (N : Node_Id; Val : Boolean) is
4815 pragma Assert (Nkind (N) in N_Entity);
4816 Nodes.Table (N + 1).Flag15 := Val;
4819 procedure Set_Flag37 (N : Node_Id; Val : Boolean) is
4821 pragma Assert (Nkind (N) in N_Entity);
4822 Nodes.Table (N + 1).Flag16 := Val;
4825 procedure Set_Flag38 (N : Node_Id; Val : Boolean) is
4827 pragma Assert (Nkind (N) in N_Entity);
4828 Nodes.Table (N + 1).Flag17 := Val;
4831 procedure Set_Flag39 (N : Node_Id; Val : Boolean) is
4833 pragma Assert (Nkind (N) in N_Entity);
4834 Nodes.Table (N + 1).Flag18 := Val;
4837 procedure Set_Flag40 (N : Node_Id; Val : Boolean) is
4839 pragma Assert (Nkind (N) in N_Entity);
4840 Nodes.Table (N + 2).In_List := Val;
4843 procedure Set_Flag41 (N : Node_Id; Val : Boolean) is
4845 pragma Assert (Nkind (N) in N_Entity);
4846 Nodes.Table (N + 2).Unused_1 := Val;
4849 procedure Set_Flag42 (N : Node_Id; Val : Boolean) is
4851 pragma Assert (Nkind (N) in N_Entity);
4852 Nodes.Table (N + 2).Rewrite_Ins := Val;
4855 procedure Set_Flag43 (N : Node_Id; Val : Boolean) is
4857 pragma Assert (Nkind (N) in N_Entity);
4858 Nodes.Table (N + 2).Analyzed := Val;
4861 procedure Set_Flag44 (N : Node_Id; Val : Boolean) is
4863 pragma Assert (Nkind (N) in N_Entity);
4864 Nodes.Table (N + 2).Comes_From_Source := Val;
4867 procedure Set_Flag45 (N : Node_Id; Val : Boolean) is
4869 pragma Assert (Nkind (N) in N_Entity);
4870 Nodes.Table (N + 2).Error_Posted := Val;
4873 procedure Set_Flag46 (N : Node_Id; Val : Boolean) is
4875 pragma Assert (Nkind (N) in N_Entity);
4876 Nodes.Table (N + 2).Flag4 := Val;
4879 procedure Set_Flag47 (N : Node_Id; Val : Boolean) is
4881 pragma Assert (Nkind (N) in N_Entity);
4882 Nodes.Table (N + 2).Flag5 := Val;
4885 procedure Set_Flag48 (N : Node_Id; Val : Boolean) is
4887 pragma Assert (Nkind (N) in N_Entity);
4888 Nodes.Table (N + 2).Flag6 := Val;
4891 procedure Set_Flag49 (N : Node_Id; Val : Boolean) is
4893 pragma Assert (Nkind (N) in N_Entity);
4894 Nodes.Table (N + 2).Flag7 := Val;
4897 procedure Set_Flag50 (N : Node_Id; Val : Boolean) is
4899 pragma Assert (Nkind (N) in N_Entity);
4900 Nodes.Table (N + 2).Flag8 := Val;
4903 procedure Set_Flag51 (N : Node_Id; Val : Boolean) is
4905 pragma Assert (Nkind (N) in N_Entity);
4906 Nodes.Table (N + 2).Flag9 := Val;
4909 procedure Set_Flag52 (N : Node_Id; Val : Boolean) is
4911 pragma Assert (Nkind (N) in N_Entity);
4912 Nodes.Table (N + 2).Flag10 := Val;
4915 procedure Set_Flag53 (N : Node_Id; Val : Boolean) is
4917 pragma Assert (Nkind (N) in N_Entity);
4918 Nodes.Table (N + 2).Flag11 := Val;
4921 procedure Set_Flag54 (N : Node_Id; Val : Boolean) is
4923 pragma Assert (Nkind (N) in N_Entity);
4924 Nodes.Table (N + 2).Flag12 := Val;
4927 procedure Set_Flag55 (N : Node_Id; Val : Boolean) is
4929 pragma Assert (Nkind (N) in N_Entity);
4930 Nodes.Table (N + 2).Flag13 := Val;
4933 procedure Set_Flag56 (N : Node_Id; Val : Boolean) is
4935 pragma Assert (Nkind (N) in N_Entity);
4936 Nodes.Table (N + 2).Flag14 := Val;
4939 procedure Set_Flag57 (N : Node_Id; Val : Boolean) is
4941 pragma Assert (Nkind (N) in N_Entity);
4942 Nodes.Table (N + 2).Flag15 := Val;
4945 procedure Set_Flag58 (N : Node_Id; Val : Boolean) is
4947 pragma Assert (Nkind (N) in N_Entity);
4948 Nodes.Table (N + 2).Flag16 := Val;
4951 procedure Set_Flag59 (N : Node_Id; Val : Boolean) is
4953 pragma Assert (Nkind (N) in N_Entity);
4954 Nodes.Table (N + 2).Flag17 := Val;
4957 procedure Set_Flag60 (N : Node_Id; Val : Boolean) is
4959 pragma Assert (Nkind (N) in N_Entity);
4960 Nodes.Table (N + 2).Flag18 := Val;
4963 procedure Set_Flag61 (N : Node_Id; Val : Boolean) is
4965 pragma Assert (Nkind (N) in N_Entity);
4966 Nodes.Table (N + 1).Pflag1 := Val;
4969 procedure Set_Flag62 (N : Node_Id; Val : Boolean) is
4971 pragma Assert (Nkind (N) in N_Entity);
4972 Nodes.Table (N + 1).Pflag2 := Val;
4975 procedure Set_Flag63 (N : Node_Id; Val : Boolean) is
4977 pragma Assert (Nkind (N) in N_Entity);
4978 Nodes.Table (N + 2).Pflag1 := Val;
4981 procedure Set_Flag64 (N : Node_Id; Val : Boolean) is
4983 pragma Assert (Nkind (N) in N_Entity);
4984 Nodes.Table (N + 2).Pflag2 := Val;
4987 procedure Set_Flag65 (N : Node_Id; Val : Boolean) is
4989 pragma Assert (Nkind (N) in N_Entity);
4992 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag65 := Val;
4995 procedure Set_Flag66 (N : Node_Id; Val : Boolean) is
4997 pragma Assert (Nkind (N) in N_Entity);
5000 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag66 := Val;
5003 procedure Set_Flag67 (N : Node_Id; Val : Boolean) is
5005 pragma Assert (Nkind (N) in N_Entity);
5008 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag67 := Val;
5011 procedure Set_Flag68 (N : Node_Id; Val : Boolean) is
5013 pragma Assert (Nkind (N) in N_Entity);
5016 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag68 := Val;
5019 procedure Set_Flag69 (N : Node_Id; Val : Boolean) is
5021 pragma Assert (Nkind (N) in N_Entity);
5024 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag69 := Val;
5027 procedure Set_Flag70 (N : Node_Id; Val : Boolean) is
5029 pragma Assert (Nkind (N) in N_Entity);
5032 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag70 := Val;
5035 procedure Set_Flag71 (N : Node_Id; Val : Boolean) is
5037 pragma Assert (Nkind (N) in N_Entity);
5040 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag71 := Val;
5043 procedure Set_Flag72 (N : Node_Id; Val : Boolean) is
5045 pragma Assert (Nkind (N) in N_Entity);
5048 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag72 := Val;
5051 procedure Set_Flag73 (N : Node_Id; Val : Boolean) is
5053 pragma Assert (Nkind (N) in N_Entity);
5056 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag73 := Val;
5059 procedure Set_Flag74 (N : Node_Id; Val : Boolean) is
5061 pragma Assert (Nkind (N) in N_Entity);
5064 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag74 := Val;
5067 procedure Set_Flag75 (N : Node_Id; Val : Boolean) is
5069 pragma Assert (Nkind (N) in N_Entity);
5072 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag75 := Val;
5075 procedure Set_Flag76 (N : Node_Id; Val : Boolean) is
5077 pragma Assert (Nkind (N) in N_Entity);
5080 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag76 := Val;
5083 procedure Set_Flag77 (N : Node_Id; Val : Boolean) is
5085 pragma Assert (Nkind (N) in N_Entity);
5088 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag77 := Val;
5091 procedure Set_Flag78 (N : Node_Id; Val : Boolean) is
5093 pragma Assert (Nkind (N) in N_Entity);
5096 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag78 := Val;
5099 procedure Set_Flag79 (N : Node_Id; Val : Boolean) is
5101 pragma Assert (Nkind (N) in N_Entity);
5104 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag79 := Val;
5107 procedure Set_Flag80 (N : Node_Id; Val : Boolean) is
5109 pragma Assert (Nkind (N) in N_Entity);
5112 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag80 := Val;
5115 procedure Set_Flag81 (N : Node_Id; Val : Boolean) is
5117 pragma Assert (Nkind (N) in N_Entity);
5120 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag81 := Val;
5123 procedure Set_Flag82 (N : Node_Id; Val : Boolean) is
5125 pragma Assert (Nkind (N) in N_Entity);
5128 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag82 := Val;
5131 procedure Set_Flag83 (N : Node_Id; Val : Boolean) is
5133 pragma Assert (Nkind (N) in N_Entity);
5136 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag83 := Val;
5139 procedure Set_Flag84 (N : Node_Id; Val : Boolean) is
5141 pragma Assert (Nkind (N) in N_Entity);
5144 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag84 := Val;
5147 procedure Set_Flag85 (N : Node_Id; Val : Boolean) is
5149 pragma Assert (Nkind (N) in N_Entity);
5152 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag85 := Val;
5155 procedure Set_Flag86 (N : Node_Id; Val : Boolean) is
5157 pragma Assert (Nkind (N) in N_Entity);
5160 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag86 := Val;
5163 procedure Set_Flag87 (N : Node_Id; Val : Boolean) is
5165 pragma Assert (Nkind (N) in N_Entity);
5168 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag87 := Val;
5171 procedure Set_Flag88 (N : Node_Id; Val : Boolean) is
5173 pragma Assert (Nkind (N) in N_Entity);
5176 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag88 := Val;
5179 procedure Set_Flag89 (N : Node_Id; Val : Boolean) is
5181 pragma Assert (Nkind (N) in N_Entity);
5184 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag89 := Val;
5187 procedure Set_Flag90 (N : Node_Id; Val : Boolean) is
5189 pragma Assert (Nkind (N) in N_Entity);
5192 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag90 := Val;
5195 procedure Set_Flag91 (N : Node_Id; Val : Boolean) is
5197 pragma Assert (Nkind (N) in N_Entity);
5200 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag91 := Val;
5203 procedure Set_Flag92 (N : Node_Id; Val : Boolean) is
5205 pragma Assert (Nkind (N) in N_Entity);
5208 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag92 := Val;
5211 procedure Set_Flag93 (N : Node_Id; Val : Boolean) is
5213 pragma Assert (Nkind (N) in N_Entity);
5216 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag93 := Val;
5219 procedure Set_Flag94 (N : Node_Id; Val : Boolean) is
5221 pragma Assert (Nkind (N) in N_Entity);
5224 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag94 := Val;
5227 procedure Set_Flag95 (N : Node_Id; Val : Boolean) is
5229 pragma Assert (Nkind (N) in N_Entity);
5232 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag95 := Val;
5235 procedure Set_Flag96 (N : Node_Id; Val : Boolean) is
5237 pragma Assert (Nkind (N) in N_Entity);
5240 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag96 := Val;
5243 procedure Set_Flag97 (N : Node_Id; Val : Boolean) is
5245 pragma Assert (Nkind (N) in N_Entity);
5248 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag97 := Val;
5251 procedure Set_Flag98 (N : Node_Id; Val : Boolean) is
5253 pragma Assert (Nkind (N) in N_Entity);
5256 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag98 := Val;
5259 procedure Set_Flag99 (N : Node_Id; Val : Boolean) is
5261 pragma Assert (Nkind (N) in N_Entity);
5264 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag99 := Val;
5267 procedure Set_Flag100 (N : Node_Id; Val : Boolean) is
5269 pragma Assert (Nkind (N) in N_Entity);
5272 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag100 := Val;
5275 procedure Set_Flag101 (N : Node_Id; Val : Boolean) is
5277 pragma Assert (Nkind (N) in N_Entity);
5280 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag101 := Val;
5283 procedure Set_Flag102 (N : Node_Id; Val : Boolean) is
5285 pragma Assert (Nkind (N) in N_Entity);
5288 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag102 := Val;
5291 procedure Set_Flag103 (N : Node_Id; Val : Boolean) is
5293 pragma Assert (Nkind (N) in N_Entity);
5296 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag103 := Val;
5299 procedure Set_Flag104 (N : Node_Id; Val : Boolean) is
5301 pragma Assert (Nkind (N) in N_Entity);
5304 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag104 := Val;
5307 procedure Set_Flag105 (N : Node_Id; Val : Boolean) is
5309 pragma Assert (Nkind (N) in N_Entity);
5312 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag105 := Val;
5315 procedure Set_Flag106 (N : Node_Id; Val : Boolean) is
5317 pragma Assert (Nkind (N) in N_Entity);
5320 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag106 := Val;
5323 procedure Set_Flag107 (N : Node_Id; Val : Boolean) is
5325 pragma Assert (Nkind (N) in N_Entity);
5328 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag107 := Val;
5331 procedure Set_Flag108 (N : Node_Id; Val : Boolean) is
5333 pragma Assert (Nkind (N) in N_Entity);
5336 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag108 := Val;
5339 procedure Set_Flag109 (N : Node_Id; Val : Boolean) is
5341 pragma Assert (Nkind (N) in N_Entity);
5344 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag109 := Val;
5347 procedure Set_Flag110 (N : Node_Id; Val : Boolean) is
5349 pragma Assert (Nkind (N) in N_Entity);
5352 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag110 := Val;
5355 procedure Set_Flag111 (N : Node_Id; Val : Boolean) is
5357 pragma Assert (Nkind (N) in N_Entity);
5360 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag111 := Val;
5363 procedure Set_Flag112 (N : Node_Id; Val : Boolean) is
5365 pragma Assert (Nkind (N) in N_Entity);
5368 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag112 := Val;
5371 procedure Set_Flag113 (N : Node_Id; Val : Boolean) is
5373 pragma Assert (Nkind (N) in N_Entity);
5376 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag113 := Val;
5379 procedure Set_Flag114 (N : Node_Id; Val : Boolean) is
5381 pragma Assert (Nkind (N) in N_Entity);
5384 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag114 := Val;
5387 procedure Set_Flag115 (N : Node_Id; Val : Boolean) is
5389 pragma Assert (Nkind (N) in N_Entity);
5392 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag115 := Val;
5395 procedure Set_Flag116 (N : Node_Id; Val : Boolean) is
5397 pragma Assert (Nkind (N) in N_Entity);
5400 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag116 := Val;
5403 procedure Set_Flag117 (N : Node_Id; Val : Boolean) is
5405 pragma Assert (Nkind (N) in N_Entity);
5408 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag117 := Val;
5411 procedure Set_Flag118 (N : Node_Id; Val : Boolean) is
5413 pragma Assert (Nkind (N) in N_Entity);
5416 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag118 := Val;
5419 procedure Set_Flag119 (N : Node_Id; Val : Boolean) is
5421 pragma Assert (Nkind (N) in N_Entity);
5424 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag119 := Val;
5427 procedure Set_Flag120 (N : Node_Id; Val : Boolean) is
5429 pragma Assert (Nkind (N) in N_Entity);
5432 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag120 := Val;
5435 procedure Set_Flag121 (N : Node_Id; Val : Boolean) is
5437 pragma Assert (Nkind (N) in N_Entity);
5440 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag121 := Val;
5443 procedure Set_Flag122 (N : Node_Id; Val : Boolean) is
5445 pragma Assert (Nkind (N) in N_Entity);
5448 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag122 := Val;
5451 procedure Set_Flag123 (N : Node_Id; Val : Boolean) is
5453 pragma Assert (Nkind (N) in N_Entity);
5456 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag123 := Val;
5459 procedure Set_Flag124 (N : Node_Id; Val : Boolean) is
5461 pragma Assert (Nkind (N) in N_Entity);
5464 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag124 := Val;
5467 procedure Set_Flag125 (N : Node_Id; Val : Boolean) is
5469 pragma Assert (Nkind (N) in N_Entity);
5472 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag125 := Val;
5475 procedure Set_Flag126 (N : Node_Id; Val : Boolean) is
5477 pragma Assert (Nkind (N) in N_Entity);
5480 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag126 := Val;
5483 procedure Set_Flag127 (N : Node_Id; Val : Boolean) is
5485 pragma Assert (Nkind (N) in N_Entity);
5488 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag127 := Val;
5491 procedure Set_Flag128 (N : Node_Id; Val : Boolean) is
5493 pragma Assert (Nkind (N) in N_Entity);
5496 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag128 := Val;
5499 procedure Set_Flag129 (N : Node_Id; Val : Boolean) is
5501 pragma Assert (Nkind (N) in N_Entity);
5502 Nodes.Table (N + 3).In_List := Val;
5505 procedure Set_Flag130 (N : Node_Id; Val : Boolean) is
5507 pragma Assert (Nkind (N) in N_Entity);
5508 Nodes.Table (N + 3).Unused_1 := Val;
5511 procedure Set_Flag131 (N : Node_Id; Val : Boolean) is
5513 pragma Assert (Nkind (N) in N_Entity);
5514 Nodes.Table (N + 3).Rewrite_Ins := Val;
5517 procedure Set_Flag132 (N : Node_Id; Val : Boolean) is
5519 pragma Assert (Nkind (N) in N_Entity);
5520 Nodes.Table (N + 3).Analyzed := Val;
5523 procedure Set_Flag133 (N : Node_Id; Val : Boolean) is
5525 pragma Assert (Nkind (N) in N_Entity);
5526 Nodes.Table (N + 3).Comes_From_Source := Val;
5529 procedure Set_Flag134 (N : Node_Id; Val : Boolean) is
5531 pragma Assert (Nkind (N) in N_Entity);
5532 Nodes.Table (N + 3).Error_Posted := Val;
5535 procedure Set_Flag135 (N : Node_Id; Val : Boolean) is
5537 pragma Assert (Nkind (N) in N_Entity);
5538 Nodes.Table (N + 3).Flag4 := Val;
5541 procedure Set_Flag136 (N : Node_Id; Val : Boolean) is
5543 pragma Assert (Nkind (N) in N_Entity);
5544 Nodes.Table (N + 3).Flag5 := Val;
5547 procedure Set_Flag137 (N : Node_Id; Val : Boolean) is
5549 pragma Assert (Nkind (N) in N_Entity);
5550 Nodes.Table (N + 3).Flag6 := Val;
5553 procedure Set_Flag138 (N : Node_Id; Val : Boolean) is
5555 pragma Assert (Nkind (N) in N_Entity);
5556 Nodes.Table (N + 3).Flag7 := Val;
5559 procedure Set_Flag139 (N : Node_Id; Val : Boolean) is
5561 pragma Assert (Nkind (N) in N_Entity);
5562 Nodes.Table (N + 3).Flag8 := Val;
5565 procedure Set_Flag140 (N : Node_Id; Val : Boolean) is
5567 pragma Assert (Nkind (N) in N_Entity);
5568 Nodes.Table (N + 3).Flag9 := Val;
5571 procedure Set_Flag141 (N : Node_Id; Val : Boolean) is
5573 pragma Assert (Nkind (N) in N_Entity);
5574 Nodes.Table (N + 3).Flag10 := Val;
5577 procedure Set_Flag142 (N : Node_Id; Val : Boolean) is
5579 pragma Assert (Nkind (N) in N_Entity);
5580 Nodes.Table (N + 3).Flag11 := Val;
5583 procedure Set_Flag143 (N : Node_Id; Val : Boolean) is
5585 pragma Assert (Nkind (N) in N_Entity);
5586 Nodes.Table (N + 3).Flag12 := Val;
5589 procedure Set_Flag144 (N : Node_Id; Val : Boolean) is
5591 pragma Assert (Nkind (N) in N_Entity);
5592 Nodes.Table (N + 3).Flag13 := Val;
5595 procedure Set_Flag145 (N : Node_Id; Val : Boolean) is
5597 pragma Assert (Nkind (N) in N_Entity);
5598 Nodes.Table (N + 3).Flag14 := Val;
5601 procedure Set_Flag146 (N : Node_Id; Val : Boolean) is
5603 pragma Assert (Nkind (N) in N_Entity);
5604 Nodes.Table (N + 3).Flag15 := Val;
5607 procedure Set_Flag147 (N : Node_Id; Val : Boolean) is
5609 pragma Assert (Nkind (N) in N_Entity);
5610 Nodes.Table (N + 3).Flag16 := Val;
5613 procedure Set_Flag148 (N : Node_Id; Val : Boolean) is
5615 pragma Assert (Nkind (N) in N_Entity);
5616 Nodes.Table (N + 3).Flag17 := Val;
5619 procedure Set_Flag149 (N : Node_Id; Val : Boolean) is
5621 pragma Assert (Nkind (N) in N_Entity);
5622 Nodes.Table (N + 3).Flag18 := Val;
5625 procedure Set_Flag150 (N : Node_Id; Val : Boolean) is
5627 pragma Assert (Nkind (N) in N_Entity);
5628 Nodes.Table (N + 3).Pflag1 := Val;
5631 procedure Set_Flag151 (N : Node_Id; Val : Boolean) is
5633 pragma Assert (Nkind (N) in N_Entity);
5634 Nodes.Table (N + 3).Pflag2 := Val;
5637 procedure Set_Flag152 (N : Node_Id; Val : Boolean) is
5639 pragma Assert (Nkind (N) in N_Entity);
5642 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag152 := Val;
5645 procedure Set_Flag153 (N : Node_Id; Val : Boolean) is
5647 pragma Assert (Nkind (N) in N_Entity);
5650 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag153 := Val;
5653 procedure Set_Flag154 (N : Node_Id; Val : Boolean) is
5655 pragma Assert (Nkind (N) in N_Entity);
5658 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag154 := Val;
5661 procedure Set_Flag155 (N : Node_Id; Val : Boolean) is
5663 pragma Assert (Nkind (N) in N_Entity);
5666 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag155 := Val;
5669 procedure Set_Flag156 (N : Node_Id; Val : Boolean) is
5671 pragma Assert (Nkind (N) in N_Entity);
5674 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag156 := Val;
5677 procedure Set_Flag157 (N : Node_Id; Val : Boolean) is
5679 pragma Assert (Nkind (N) in N_Entity);
5682 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag157 := Val;
5685 procedure Set_Flag158 (N : Node_Id; Val : Boolean) is
5687 pragma Assert (Nkind (N) in N_Entity);
5690 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag158 := Val;
5693 procedure Set_Flag159 (N : Node_Id; Val : Boolean) is
5695 pragma Assert (Nkind (N) in N_Entity);
5698 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag159 := Val;
5701 procedure Set_Flag160 (N : Node_Id; Val : Boolean) is
5703 pragma Assert (Nkind (N) in N_Entity);
5706 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag160 := Val;
5709 procedure Set_Flag161 (N : Node_Id; Val : Boolean) is
5711 pragma Assert (Nkind (N) in N_Entity);
5714 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag161 := Val;
5717 procedure Set_Flag162 (N : Node_Id; Val : Boolean) is
5719 pragma Assert (Nkind (N) in N_Entity);
5722 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag162 := Val;
5725 procedure Set_Flag163 (N : Node_Id; Val : Boolean) is
5727 pragma Assert (Nkind (N) in N_Entity);
5730 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag163 := Val;
5733 procedure Set_Flag164 (N : Node_Id; Val : Boolean) is
5735 pragma Assert (Nkind (N) in N_Entity);
5738 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag164 := Val;
5741 procedure Set_Flag165 (N : Node_Id; Val : Boolean) is
5743 pragma Assert (Nkind (N) in N_Entity);
5746 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag165 := Val;
5749 procedure Set_Flag166 (N : Node_Id; Val : Boolean) is
5751 pragma Assert (Nkind (N) in N_Entity);
5754 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag166 := Val;
5757 procedure Set_Flag167 (N : Node_Id; Val : Boolean) is
5759 pragma Assert (Nkind (N) in N_Entity);
5762 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag167 := Val;
5765 procedure Set_Flag168 (N : Node_Id; Val : Boolean) is
5767 pragma Assert (Nkind (N) in N_Entity);
5770 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag168 := Val;
5773 procedure Set_Flag169 (N : Node_Id; Val : Boolean) is
5775 pragma Assert (Nkind (N) in N_Entity);
5778 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag169 := Val;
5781 procedure Set_Flag170 (N : Node_Id; Val : Boolean) is
5783 pragma Assert (Nkind (N) in N_Entity);
5786 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag170 := Val;
5789 procedure Set_Flag171 (N : Node_Id; Val : Boolean) is
5791 pragma Assert (Nkind (N) in N_Entity);
5794 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag171 := Val;
5797 procedure Set_Flag172 (N : Node_Id; Val : Boolean) is
5799 pragma Assert (Nkind (N) in N_Entity);
5802 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag172 := Val;
5805 procedure Set_Flag173 (N : Node_Id; Val : Boolean) is
5807 pragma Assert (Nkind (N) in N_Entity);
5810 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag173 := Val;
5813 procedure Set_Flag174 (N : Node_Id; Val : Boolean) is
5815 pragma Assert (Nkind (N) in N_Entity);
5818 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag174 := Val;
5821 procedure Set_Flag175 (N : Node_Id; Val : Boolean) is
5823 pragma Assert (Nkind (N) in N_Entity);
5826 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag175 := Val;
5829 procedure Set_Flag176 (N : Node_Id; Val : Boolean) is
5831 pragma Assert (Nkind (N) in N_Entity);
5834 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag176 := Val;
5837 procedure Set_Flag177 (N : Node_Id; Val : Boolean) is
5839 pragma Assert (Nkind (N) in N_Entity);
5842 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag177 := Val;
5845 procedure Set_Flag178 (N : Node_Id; Val : Boolean) is
5847 pragma Assert (Nkind (N) in N_Entity);
5850 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag178 := Val;
5853 procedure Set_Flag179 (N : Node_Id; Val : Boolean) is
5855 pragma Assert (Nkind (N) in N_Entity);
5858 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag179 := Val;
5861 procedure Set_Flag180 (N : Node_Id; Val : Boolean) is
5863 pragma Assert (Nkind (N) in N_Entity);
5866 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag180 := Val;
5869 procedure Set_Flag181 (N : Node_Id; Val : Boolean) is
5871 pragma Assert (Nkind (N) in N_Entity);
5874 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag181 := Val;
5877 procedure Set_Flag182 (N : Node_Id; Val : Boolean) is
5879 pragma Assert (Nkind (N) in N_Entity);
5882 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag182 := Val;
5885 procedure Set_Flag183 (N : Node_Id; Val : Boolean) is
5887 pragma Assert (Nkind (N) in N_Entity);
5890 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag183 := Val;
5893 procedure Set_Flag184 (N : Node_Id; Val : Boolean) is
5895 pragma Assert (Nkind (N) in N_Entity);
5898 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag184 := Val;
5901 procedure Set_Flag185 (N : Node_Id; Val : Boolean) is
5903 pragma Assert (Nkind (N) in N_Entity);
5906 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag185 := Val;
5909 procedure Set_Flag186 (N : Node_Id; Val : Boolean) is
5911 pragma Assert (Nkind (N) in N_Entity);
5914 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag186 := Val;
5917 procedure Set_Flag187 (N : Node_Id; Val : Boolean) is
5919 pragma Assert (Nkind (N) in N_Entity);
5922 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag187 := Val;
5925 procedure Set_Flag188 (N : Node_Id; Val : Boolean) is
5927 pragma Assert (Nkind (N) in N_Entity);
5930 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag188 := Val;
5933 procedure Set_Flag189 (N : Node_Id; Val : Boolean) is
5935 pragma Assert (Nkind (N) in N_Entity);
5938 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag189 := Val;
5941 procedure Set_Flag190 (N : Node_Id; Val : Boolean) is
5943 pragma Assert (Nkind (N) in N_Entity);
5946 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag190 := Val;
5949 procedure Set_Flag191 (N : Node_Id; Val : Boolean) is
5951 pragma Assert (Nkind (N) in N_Entity);
5954 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag191 := Val;
5957 procedure Set_Flag192 (N : Node_Id; Val : Boolean) is
5959 pragma Assert (Nkind (N) in N_Entity);
5962 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag192 := Val;
5965 procedure Set_Flag193 (N : Node_Id; Val : Boolean) is
5967 pragma Assert (Nkind (N) in N_Entity);
5970 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag193 := Val;
5973 procedure Set_Flag194 (N : Node_Id; Val : Boolean) is
5975 pragma Assert (Nkind (N) in N_Entity);
5978 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag194 := Val;
5981 procedure Set_Flag195 (N : Node_Id; Val : Boolean) is
5983 pragma Assert (Nkind (N) in N_Entity);
5986 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag195 := Val;
5989 procedure Set_Flag196 (N : Node_Id; Val : Boolean) is
5991 pragma Assert (Nkind (N) in N_Entity);
5994 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag196 := Val;
5997 procedure Set_Flag197 (N : Node_Id; Val : Boolean) is
5999 pragma Assert (Nkind (N) in N_Entity);
6002 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag197 := Val;
6005 procedure Set_Flag198 (N : Node_Id; Val : Boolean) is
6007 pragma Assert (Nkind (N) in N_Entity);
6010 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag198 := Val;
6013 procedure Set_Flag199 (N : Node_Id; Val : Boolean) is
6015 pragma Assert (Nkind (N) in N_Entity);
6018 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag199 := Val;
6021 procedure Set_Flag200 (N : Node_Id; Val : Boolean) is
6023 pragma Assert (Nkind (N) in N_Entity);
6026 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag200 := Val;
6029 procedure Set_Flag201 (N : Node_Id; Val : Boolean) is
6031 pragma Assert (Nkind (N) in N_Entity);
6034 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag201 := Val;
6037 procedure Set_Flag202 (N : Node_Id; Val : Boolean) is
6039 pragma Assert (Nkind (N) in N_Entity);
6042 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag202 := Val;
6045 procedure Set_Flag203 (N : Node_Id; Val : Boolean) is
6047 pragma Assert (Nkind (N) in N_Entity);
6050 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag203 := Val;
6053 procedure Set_Flag204 (N : Node_Id; Val : Boolean) is
6055 pragma Assert (Nkind (N) in N_Entity);
6058 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag204 := Val;
6061 procedure Set_Flag205 (N : Node_Id; Val : Boolean) is
6063 pragma Assert (Nkind (N) in N_Entity);
6066 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag205 := Val;
6069 procedure Set_Flag206 (N : Node_Id; Val : Boolean) is
6071 pragma Assert (Nkind (N) in N_Entity);
6074 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag206 := Val;
6077 procedure Set_Flag207 (N : Node_Id; Val : Boolean) is
6079 pragma Assert (Nkind (N) in N_Entity);
6082 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag207 := Val;
6085 procedure Set_Flag208 (N : Node_Id; Val : Boolean) is
6087 pragma Assert (Nkind (N) in N_Entity);
6090 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag208 := Val;
6093 procedure Set_Flag209 (N : Node_Id; Val : Boolean) is
6095 pragma Assert (Nkind (N) in N_Entity);
6098 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag209 := Val;
6101 procedure Set_Flag210 (N : Node_Id; Val : Boolean) is
6103 pragma Assert (Nkind (N) in N_Entity);
6106 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag210 := Val;
6109 procedure Set_Flag211 (N : Node_Id; Val : Boolean) is
6111 pragma Assert (Nkind (N) in N_Entity);
6114 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag211 := Val;
6117 procedure Set_Flag212 (N : Node_Id; Val : Boolean) is
6119 pragma Assert (Nkind (N) in N_Entity);
6122 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag212 := Val;
6125 procedure Set_Flag213 (N : Node_Id; Val : Boolean) is
6127 pragma Assert (Nkind (N) in N_Entity);
6130 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag213 := Val;
6133 procedure Set_Flag214 (N : Node_Id; Val : Boolean) is
6135 pragma Assert (Nkind (N) in N_Entity);
6138 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag214 := Val;
6141 procedure Set_Flag215 (N : Node_Id; Val : Boolean) is
6143 pragma Assert (Nkind (N) in N_Entity);
6146 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag215 := Val;
6149 procedure Set_Flag216 (N : Node_Id; Val : Boolean) is
6151 pragma Assert (Nkind (N) in N_Entity);
6154 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag216 := Val;
6157 procedure Set_Flag217 (N : Node_Id; Val : Boolean) is
6159 pragma Assert (Nkind (N) in N_Entity);
6162 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag217 := Val;
6165 procedure Set_Flag218 (N : Node_Id; Val : Boolean) is
6167 pragma Assert (Nkind (N) in N_Entity);
6170 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag218 := Val;
6173 procedure Set_Flag219 (N : Node_Id; Val : Boolean) is
6175 pragma Assert (Nkind (N) in N_Entity);
6178 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag219 := Val;
6181 procedure Set_Flag220 (N : Node_Id; Val : Boolean) is
6183 pragma Assert (Nkind (N) in N_Entity);
6186 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag220 := Val;
6189 procedure Set_Flag221 (N : Node_Id; Val : Boolean) is
6191 pragma Assert (Nkind (N) in N_Entity);
6194 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag221 := Val;
6197 procedure Set_Flag222 (N : Node_Id; Val : Boolean) is
6199 pragma Assert (Nkind (N) in N_Entity);
6202 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag222 := Val;
6205 procedure Set_Flag223 (N : Node_Id; Val : Boolean) is
6207 pragma Assert (Nkind (N) in N_Entity);
6210 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag223 := Val;
6213 procedure Set_Flag224 (N : Node_Id; Val : Boolean) is
6215 pragma Assert (Nkind (N) in N_Entity);
6218 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag224 := Val;
6221 procedure Set_Flag225 (N : Node_Id; Val : Boolean) is
6223 pragma Assert (Nkind (N) in N_Entity);
6226 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag225 := Val;
6229 procedure Set_Flag226 (N : Node_Id; Val : Boolean) is
6231 pragma Assert (Nkind (N) in N_Entity);
6234 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag226 := Val;
6237 procedure Set_Flag227 (N : Node_Id; Val : Boolean) is
6239 pragma Assert (Nkind (N) in N_Entity);
6242 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag227 := Val;
6245 procedure Set_Flag228 (N : Node_Id; Val : Boolean) is
6247 pragma Assert (Nkind (N) in N_Entity);
6250 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag228 := Val;
6253 procedure Set_Flag229 (N : Node_Id; Val : Boolean) is
6255 pragma Assert (Nkind (N) in N_Entity);
6258 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag229 := Val;
6261 procedure Set_Flag230 (N : Node_Id; Val : Boolean) is
6263 pragma Assert (Nkind (N) in N_Entity);
6266 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag230 := Val;
6269 procedure Set_Flag231 (N : Node_Id; Val : Boolean) is
6271 pragma Assert (Nkind (N) in N_Entity);
6274 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag231 := Val;
6277 procedure Set_Flag232 (N : Node_Id; Val : Boolean) is
6279 pragma Assert (Nkind (N) in N_Entity);
6282 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag232 := Val;
6285 procedure Set_Flag233 (N : Node_Id; Val : Boolean) is
6287 pragma Assert (Nkind (N) in N_Entity);
6290 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag233 := Val;
6293 procedure Set_Flag234 (N : Node_Id; Val : Boolean) is
6295 pragma Assert (Nkind (N) in N_Entity);
6298 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag234 := Val;
6301 procedure Set_Flag235 (N : Node_Id; Val : Boolean) is
6303 pragma Assert (Nkind (N) in N_Entity);
6306 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag235 := Val;
6309 procedure Set_Flag236 (N : Node_Id; Val : Boolean) is
6311 pragma Assert (Nkind (N) in N_Entity);
6314 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag236 := Val;
6317 procedure Set_Flag237 (N : Node_Id; Val : Boolean) is
6319 pragma Assert (Nkind (N) in N_Entity);
6322 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag237 := Val;
6325 procedure Set_Flag238 (N : Node_Id; Val : Boolean) is
6327 pragma Assert (Nkind (N) in N_Entity);
6330 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag238 := Val;
6333 procedure Set_Flag239 (N : Node_Id; Val : Boolean) is
6335 pragma Assert (Nkind (N) in N_Entity);
6338 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag239 := Val;
6341 procedure Set_Flag240 (N : Node_Id; Val : Boolean) is
6343 pragma Assert (Nkind (N) in N_Entity);
6346 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag240 := Val;
6349 procedure Set_Flag241 (N : Node_Id; Val : Boolean) is
6351 pragma Assert (Nkind (N) in N_Entity);
6354 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag241 := Val;
6357 procedure Set_Flag242 (N : Node_Id; Val : Boolean) is
6359 pragma Assert (Nkind (N) in N_Entity);
6362 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag242 := Val;
6365 procedure Set_Flag243 (N : Node_Id; Val : Boolean) is
6367 pragma Assert (Nkind (N) in N_Entity);
6370 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag243 := Val;
6373 procedure Set_Flag244 (N : Node_Id; Val : Boolean) is
6375 pragma Assert (Nkind (N) in N_Entity);
6378 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag244 := Val;
6381 procedure Set_Flag245 (N : Node_Id; Val : Boolean) is
6383 pragma Assert (Nkind (N) in N_Entity);
6386 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag245 := Val;
6389 procedure Set_Flag246 (N : Node_Id; Val : Boolean) is
6391 pragma Assert (Nkind (N) in N_Entity);
6394 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag246 := Val;
6397 procedure Set_Flag247 (N : Node_Id; Val : Boolean) is
6399 pragma Assert (Nkind (N) in N_Entity);
6402 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag247 := Val;
6405 procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id) is
6407 pragma Assert (N <= Nodes.Last);
6410 Set_Parent (N => Val, Val => N);
6414 end Set_Node1_With_Parent;
6416 procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id) is
6418 pragma Assert (N <= Nodes.Last);
6421 Set_Parent (N => Val, Val => N);
6425 end Set_Node2_With_Parent;
6427 procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id) is
6429 pragma Assert (N <= Nodes.Last);
6432 Set_Parent (N => Val, Val => N);
6436 end Set_Node3_With_Parent;
6438 procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id) is
6440 pragma Assert (N <= Nodes.Last);
6443 Set_Parent (N => Val, Val => N);
6447 end Set_Node4_With_Parent;
6449 procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id) is
6451 pragma Assert (N <= Nodes.Last);
6454 Set_Parent (N => Val, Val => N);
6458 end Set_Node5_With_Parent;
6460 procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id) is
6462 pragma Assert (N <= Nodes.Last);
6463 if Val /= No_List and then Val /= Error_List then
6464 Set_Parent (Val, N);
6467 end Set_List1_With_Parent;
6469 procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id) is
6471 pragma Assert (N <= Nodes.Last);
6472 if Val /= No_List and then Val /= Error_List then
6473 Set_Parent (Val, N);
6476 end Set_List2_With_Parent;
6478 procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id) is
6480 pragma Assert (N <= Nodes.Last);
6481 if Val /= No_List and then Val /= Error_List then
6482 Set_Parent (Val, N);
6485 end Set_List3_With_Parent;
6487 procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id) is
6489 pragma Assert (N <= Nodes.Last);
6490 if Val /= No_List and then Val /= Error_List then
6491 Set_Parent (Val, N);
6494 end Set_List4_With_Parent;
6496 procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id) is
6498 pragma Assert (N <= Nodes.Last);
6499 if Val /= No_List and then Val /= Error_List then
6500 Set_Parent (Val, N);
6503 end Set_List5_With_Parent;
6505 end Unchecked_Access;
6513 Nodes.Locked := False;
6514 Orig_Nodes.Locked := False;