1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2010, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. --
18 -- As a special exception under Section 7 of GPL version 3, you are granted --
19 -- additional permissions described in the GCC Runtime Library Exception, --
20 -- version 3.1, as published by the Free Software Foundation. --
22 -- You should have received a copy of the GNU General Public License and --
23 -- a copy of the GCC Runtime Library Exception along with this program; --
24 -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
25 -- <http://www.gnu.org/licenses/>. --
27 -- GNAT was originally developed by the GNAT team at New York University. --
28 -- Extensive contributions were provided by Ada Core Technologies Inc. --
30 ------------------------------------------------------------------------------
32 pragma Style_Checks (All_Checks);
33 -- Turn off subprogram ordering check for this package
35 -- WARNING: There is a C version of this package. Any changes to this source
36 -- file must be properly reflected in the file atree.h which is a C header
37 -- file containing equivalent definitions for use by gigi.
39 with 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 -- Similarly, rr and rrd allow breaking on rewriting of a given node.
70 ww : Node_Id'Base := Node_Id'First - 1;
71 pragma Export (Ada, ww); -- trick the optimizer
72 Watch_Node : Node_Id'Base renames ww;
73 -- Node to "watch"; that is, whenever a node is created, we check if it is
74 -- equal to Watch_Node, and if so, call New_Node_Breakpoint. You have
75 -- presumably set a breakpoint on New_Node_Breakpoint. Note that the
76 -- initial value of Node_Id'First - 1 ensures that by default, no node
77 -- will be equal to Watch_Node.
80 pragma Export (Ada, nn);
81 procedure New_Node_Breakpoint renames nn;
82 -- This doesn't do anything interesting; it's just for setting breakpoint
83 -- on as explained above.
85 procedure nnd (N : Node_Id);
86 pragma Export (Ada, nnd);
87 procedure New_Node_Debugging_Output (N : Node_Id) renames nnd;
88 -- For debugging. If debugging is turned on, New_Node and New_Entity call
89 -- this. If debug flag N is turned on, this prints out the new node.
91 -- If Node = Watch_Node, this prints out the new node and calls
92 -- New_Node_Breakpoint. Otherwise, does nothing.
95 pragma Export (Ada, rr);
96 procedure Rewrite_Breakpoint renames rr;
97 -- This doesn't do anything interesting; it's just for setting breakpoint
98 -- on as explained above.
100 procedure rrd (Old_Node, New_Node : Node_Id);
101 pragma Export (Ada, rrd);
102 procedure Rewrite_Debugging_Output
103 (Old_Node, New_Node : Node_Id) renames rrd;
104 -- For debugging. If debugging is turned on, Rewrite calls this. If debug
105 -- flag N is turned on, this prints out the new node.
107 -- If Old_Node = Watch_Node, this prints out the old and new nodes and
108 -- calls Rewrite_Breakpoint. Otherwise, does nothing.
110 procedure Node_Debug_Output (Op : String; N : Node_Id);
111 -- Common code for nnr and rrd. Write Op followed by information about N
113 -----------------------------
114 -- Local Objects and Types --
115 -----------------------------
118 -- Count allocated nodes for Num_Nodes function
120 use Unchecked_Access;
121 -- We are allowed to see these from within our own body!
123 use Atree_Private_Part;
124 -- We are also allowed to see our private data structures!
126 -- Functions used to store Entity_Kind value in Nkind field
128 -- The following declarations are used to store flags 65-72 in the
129 -- Nkind field of the third component of an extended (entity) node.
131 type Flag_Byte is record
142 pragma Pack (Flag_Byte);
143 for Flag_Byte'Size use 8;
145 type Flag_Byte_Ptr is access all Flag_Byte;
146 type Node_Kind_Ptr is access all Node_Kind;
148 function To_Flag_Byte is new
149 Unchecked_Conversion (Node_Kind, Flag_Byte);
151 function To_Flag_Byte_Ptr is new
152 Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte_Ptr);
154 -- The following declarations are used to store flags 73-96 and the
155 -- Convention field in the Field12 field of the third component of an
156 -- extended (Entity) node.
158 type Flag_Word is record
186 Convention : Convention_Id;
189 pragma Pack (Flag_Word);
190 for Flag_Word'Size use 32;
191 for Flag_Word'Alignment use 4;
193 type Flag_Word_Ptr is access all Flag_Word;
194 type Union_Id_Ptr is access all Union_Id;
196 function To_Flag_Word is new
197 Unchecked_Conversion (Union_Id, Flag_Word);
199 function To_Flag_Word_Ptr is new
200 Unchecked_Conversion (Union_Id_Ptr, Flag_Word_Ptr);
202 -- The following declarations are used to store flags 97-128 in the
203 -- Field12 field of the fourth component of an extended (entity) node.
205 type Flag_Word2 is record
243 pragma Pack (Flag_Word2);
244 for Flag_Word2'Size use 32;
245 for Flag_Word2'Alignment use 4;
247 type Flag_Word2_Ptr is access all Flag_Word2;
249 function To_Flag_Word2 is new
250 Unchecked_Conversion (Union_Id, Flag_Word2);
252 function To_Flag_Word2_Ptr is new
253 Unchecked_Conversion (Union_Id_Ptr, Flag_Word2_Ptr);
255 -- The following declarations are used to store flags 152-183 in the
256 -- Field11 field of the fourth component of an extended (entity) node.
258 type Flag_Word3 is record
296 pragma Pack (Flag_Word3);
297 for Flag_Word3'Size use 32;
298 for Flag_Word3'Alignment use 4;
300 type Flag_Word3_Ptr is access all Flag_Word3;
302 function To_Flag_Word3 is new
303 Unchecked_Conversion (Union_Id, Flag_Word3);
305 function To_Flag_Word3_Ptr is new
306 Unchecked_Conversion (Union_Id_Ptr, Flag_Word3_Ptr);
308 -- The following declarations are used to store flags 184-215 in the
309 -- Field11 field of the fifth component of an extended (entity) node.
311 type Flag_Word4 is record
349 pragma Pack (Flag_Word4);
350 for Flag_Word4'Size use 32;
351 for Flag_Word4'Alignment use 4;
353 type Flag_Word4_Ptr is access all Flag_Word4;
355 function To_Flag_Word4 is new
356 Unchecked_Conversion (Union_Id, Flag_Word4);
358 function To_Flag_Word4_Ptr is new
359 Unchecked_Conversion (Union_Id_Ptr, Flag_Word4_Ptr);
361 -- The following declarations are used to store flags 216-247 in the
362 -- Field12 field of the fifth component of an extended (entity) node.
364 type Flag_Word5 is record
402 pragma Pack (Flag_Word5);
403 for Flag_Word5'Size use 32;
404 for Flag_Word5'Alignment use 4;
406 type Flag_Word5_Ptr is access all Flag_Word5;
408 function To_Flag_Word5 is new
409 Unchecked_Conversion (Union_Id, Flag_Word5);
411 function To_Flag_Word5_Ptr is new
412 Unchecked_Conversion (Union_Id_Ptr, Flag_Word5_Ptr);
414 --------------------------------------------------
415 -- Implementation of Tree Substitution Routines --
416 --------------------------------------------------
418 -- A separate table keeps track of the mapping between rewritten nodes
419 -- and their corresponding original tree nodes. Rewrite makes an entry
420 -- in this table for use by Original_Node. By default, if no call is
421 -- Rewrite, the entry in this table points to the original unwritten node.
423 -- Note: eventually, this should be a field in the Node directly, but
424 -- for now we do not want to disturb the efficiency of a power of 2
427 package Orig_Nodes is new Table.Table (
428 Table_Component_Type => Node_Id,
429 Table_Index_Type => Node_Id'Base,
430 Table_Low_Bound => First_Node_Id,
431 Table_Initial => Alloc.Orig_Nodes_Initial,
432 Table_Increment => Alloc.Orig_Nodes_Increment,
433 Table_Name => "Orig_Nodes");
435 --------------------------
436 -- Paren_Count Handling --
437 --------------------------
439 -- As noted in the spec, the paren count in a sub-expression node has
440 -- four possible values 0,1,2, and 3. The value 3 really means 3 or more,
441 -- and we use an auxiliary serially scanned table to record the actual
442 -- count. A serial search is fine, only pathological programs will use
443 -- entries in this table. Normal programs won't use it at all.
445 type Paren_Count_Entry is record
447 -- The node to which this count applies
449 Count : Nat range 3 .. Nat'Last;
450 -- The count of parentheses, which will be in the indicated range
453 package Paren_Counts is new Table.Table (
454 Table_Component_Type => Paren_Count_Entry,
455 Table_Index_Type => Int,
456 Table_Low_Bound => 0,
458 Table_Increment => 200,
459 Table_Name => "Paren_Counts");
461 -----------------------
462 -- Local Subprograms --
463 -----------------------
465 procedure Fix_Parents (Ref_Node, Fix_Node : Node_Id);
466 -- Fixup parent pointers for the syntactic children of Fix_Node after
467 -- a copy, setting them to Fix_Node when they pointed to Ref_Node.
469 function Allocate_Initialize_Node
471 With_Extension : Boolean) return Node_Id;
472 -- Allocate a new node or node extension. If Src is not empty,
473 -- the information for the newly-allocated node is copied from it.
475 ------------------------------
476 -- Allocate_Initialize_Node --
477 ------------------------------
479 function Allocate_Initialize_Node
481 With_Extension : Boolean) return Node_Id
483 New_Id : Node_Id := Src;
484 Nod : Node_Record := Default_Node;
485 Ext1 : Node_Record := Default_Node_Extension;
486 Ext2 : Node_Record := Default_Node_Extension;
487 Ext3 : Node_Record := Default_Node_Extension;
488 Ext4 : Node_Record := Default_Node_Extension;
491 if Present (Src) then
492 Nod := Nodes.Table (Src);
494 if Has_Extension (Src) then
495 Ext1 := Nodes.Table (Src + 1);
496 Ext2 := Nodes.Table (Src + 2);
497 Ext3 := Nodes.Table (Src + 3);
498 Ext4 := Nodes.Table (Src + 4);
502 if not (Present (Src)
503 and then not Has_Extension (Src)
504 and then With_Extension
505 and then Src = Nodes.Last)
507 -- We are allocating a new node, or extending a node
508 -- other than Nodes.Last.
511 New_Id := Nodes.Last;
512 Orig_Nodes.Append (New_Id);
513 Node_Count := Node_Count + 1;
516 -- Specifically copy Paren_Count to deal with creating new table entry
517 -- if the parentheses count is at the maximum possible value already.
519 if Present (Src) and then Nkind (Src) in N_Subexpr then
520 Set_Paren_Count (New_Id, Paren_Count (Src));
523 -- Set extension nodes if required
525 if With_Extension then
532 Orig_Nodes.Set_Last (Nodes.Last);
533 Allocate_List_Tables (Nodes.Last);
535 end Allocate_Initialize_Node;
541 function Analyzed (N : Node_Id) return Boolean is
543 pragma Assert (N <= Nodes.Last);
544 return Nodes.Table (N).Analyzed;
547 --------------------------
548 -- Basic_Set_Convention --
549 --------------------------
551 procedure Basic_Set_Convention (E : Entity_Id; Val : Convention_Id) is
553 pragma Assert (Nkind (E) in N_Entity);
556 (Nodes.Table (E + 2).Field12'Unrestricted_Access)).Convention := Val;
557 end Basic_Set_Convention;
563 procedure Change_Node (N : Node_Id; New_Node_Kind : Node_Kind) is
564 Save_Sloc : constant Source_Ptr := Sloc (N);
565 Save_In_List : constant Boolean := Nodes.Table (N).In_List;
566 Save_Link : constant Union_Id := Nodes.Table (N).Link;
567 Save_CFS : constant Boolean := Nodes.Table (N).Comes_From_Source;
568 Save_Posted : constant Boolean := Nodes.Table (N).Error_Posted;
569 Par_Count : Nat := 0;
572 if Nkind (N) in N_Subexpr then
573 Par_Count := Paren_Count (N);
576 Nodes.Table (N) := Default_Node;
577 Nodes.Table (N).Sloc := Save_Sloc;
578 Nodes.Table (N).In_List := Save_In_List;
579 Nodes.Table (N).Link := Save_Link;
580 Nodes.Table (N).Comes_From_Source := Save_CFS;
581 Nodes.Table (N).Nkind := New_Node_Kind;
582 Nodes.Table (N).Error_Posted := Save_Posted;
584 if New_Node_Kind in N_Subexpr then
585 Set_Paren_Count (N, Par_Count);
589 -----------------------
590 -- Comes_From_Source --
591 -----------------------
593 function Comes_From_Source (N : Node_Id) return Boolean is
595 pragma Assert (N <= Nodes.Last);
596 return Nodes.Table (N).Comes_From_Source;
597 end Comes_From_Source;
603 function Convention (E : Entity_Id) return Convention_Id is
605 pragma Assert (Nkind (E) in N_Entity);
606 return To_Flag_Word (Nodes.Table (E + 2).Field12).Convention;
613 procedure Copy_Node (Source : Node_Id; Destination : Node_Id) is
614 Save_In_List : constant Boolean := Nodes.Table (Destination).In_List;
615 Save_Link : constant Union_Id := Nodes.Table (Destination).Link;
618 Nodes.Table (Destination) := Nodes.Table (Source);
619 Nodes.Table (Destination).In_List := Save_In_List;
620 Nodes.Table (Destination).Link := Save_Link;
622 -- Specifically set Paren_Count to make sure auxiliary table entry
623 -- gets correctly made if the parentheses count is at the max value.
625 if Nkind (Destination) in N_Subexpr then
626 Set_Paren_Count (Destination, Paren_Count (Source));
629 -- Deal with copying extension nodes if present
631 if Has_Extension (Source) then
632 pragma Assert (Has_Extension (Destination));
633 Nodes.Table (Destination + 1) := Nodes.Table (Source + 1);
634 Nodes.Table (Destination + 2) := Nodes.Table (Source + 2);
635 Nodes.Table (Destination + 3) := Nodes.Table (Source + 3);
636 Nodes.Table (Destination + 4) := Nodes.Table (Source + 4);
639 pragma Assert (not Has_Extension (Source));
644 ------------------------
645 -- Copy_Separate_Tree --
646 ------------------------
648 function Copy_Separate_Tree (Source : Node_Id) return Node_Id is
651 function Copy_Entity (E : Entity_Id) return Entity_Id;
652 -- Copy Entity, copying only the Ekind and Chars fields
654 function Copy_List (List : List_Id) return List_Id;
657 function Possible_Copy (Field : Union_Id) return Union_Id;
658 -- Given a field, returns a copy of the node or list if its parent
659 -- is the current source node, and otherwise returns the input
665 function Copy_Entity (E : Entity_Id) return Entity_Id is
669 case N_Entity (Nkind (E)) is
670 when N_Defining_Identifier =>
671 New_Ent := New_Entity (N_Defining_Identifier, Sloc (E));
673 when N_Defining_Character_Literal =>
674 New_Ent := New_Entity (N_Defining_Character_Literal, Sloc (E));
676 when N_Defining_Operator_Symbol =>
677 New_Ent := New_Entity (N_Defining_Operator_Symbol, Sloc (E));
680 Set_Chars (New_Ent, Chars (E));
688 function Copy_List (List : List_Id) return List_Id is
693 if List = No_List then
700 while Present (E) loop
701 if Has_Extension (E) then
702 Append (Copy_Entity (E), NL);
704 Append (Copy_Separate_Tree (E), NL);
718 function Possible_Copy (Field : Union_Id) return Union_Id is
722 if Field in Node_Range then
723 New_N := Union_Id (Copy_Separate_Tree (Node_Id (Field)));
725 if Parent (Node_Id (Field)) = Source then
726 Set_Parent (Node_Id (New_N), New_Id);
731 elsif Field in List_Range then
732 New_N := Union_Id (Copy_List (List_Id (Field)));
734 if Parent (List_Id (Field)) = Source then
735 Set_Parent (List_Id (New_N), New_Id);
745 -- Start of processing for Copy_Separate_Tree
748 if Source <= Empty_Or_Error then
751 elsif Has_Extension (Source) then
752 return Copy_Entity (Source);
755 New_Id := New_Copy (Source);
757 -- Recursively copy descendents
759 Set_Field1 (New_Id, Possible_Copy (Field1 (New_Id)));
760 Set_Field2 (New_Id, Possible_Copy (Field2 (New_Id)));
761 Set_Field3 (New_Id, Possible_Copy (Field3 (New_Id)));
762 Set_Field4 (New_Id, Possible_Copy (Field4 (New_Id)));
763 Set_Field5 (New_Id, Possible_Copy (Field5 (New_Id)));
765 -- Set Entity field to Empty
766 -- Why is this done??? and why is it always right to do it???
768 if Nkind (New_Id) in N_Has_Entity
769 or else Nkind (New_Id) = N_Freeze_Entity
771 Set_Entity (New_Id, Empty);
774 -- All done, return copied node
778 end Copy_Separate_Tree;
784 function Ekind (E : Entity_Id) return Entity_Kind is
786 pragma Assert (Nkind (E) in N_Entity);
787 return N_To_E (Nodes.Table (E + 1).Nkind);
797 V2 : Entity_Kind) return Boolean
800 return T = V1 or else
808 V3 : Entity_Kind) return Boolean
811 return T = V1 or else
821 V4 : Entity_Kind) return Boolean
824 return T = V1 or else
836 V5 : Entity_Kind) return Boolean
839 return T = V1 or else
853 V6 : Entity_Kind) return Boolean
856 return T = V1 or else
867 V2 : Entity_Kind) return Boolean
870 return Ekind_In (Ekind (E), V1, V2);
877 V3 : Entity_Kind) return Boolean
880 return Ekind_In (Ekind (E), V1, V2, V3);
888 V4 : Entity_Kind) return Boolean
891 return Ekind_In (Ekind (E), V1, V2, V3, V4);
900 V5 : Entity_Kind) return Boolean
903 return Ekind_In (Ekind (E), V1, V2, V3, V4, V5);
913 V6 : Entity_Kind) return Boolean
916 return Ekind_In (Ekind (E), V1, V2, V3, V4, V5, V6);
923 function Error_Posted (N : Node_Id) return Boolean is
925 pragma Assert (N <= Nodes.Last);
926 return Nodes.Table (N).Error_Posted;
929 -----------------------
930 -- Exchange_Entities --
931 -----------------------
933 procedure Exchange_Entities (E1 : Entity_Id; E2 : Entity_Id) is
934 Temp_Ent : Node_Record;
937 pragma Assert (Has_Extension (E1)
938 and then Has_Extension (E2)
939 and then not Nodes.Table (E1).In_List
940 and then not Nodes.Table (E2).In_List);
942 -- Exchange the contents of the two entities
944 Temp_Ent := Nodes.Table (E1);
945 Nodes.Table (E1) := Nodes.Table (E2);
946 Nodes.Table (E2) := Temp_Ent;
947 Temp_Ent := Nodes.Table (E1 + 1);
948 Nodes.Table (E1 + 1) := Nodes.Table (E2 + 1);
949 Nodes.Table (E2 + 1) := Temp_Ent;
950 Temp_Ent := Nodes.Table (E1 + 2);
951 Nodes.Table (E1 + 2) := Nodes.Table (E2 + 2);
952 Nodes.Table (E2 + 2) := Temp_Ent;
953 Temp_Ent := Nodes.Table (E1 + 3);
954 Nodes.Table (E1 + 3) := Nodes.Table (E2 + 3);
955 Nodes.Table (E2 + 3) := Temp_Ent;
956 Temp_Ent := Nodes.Table (E1 + 4);
957 Nodes.Table (E1 + 4) := Nodes.Table (E2 + 4);
958 Nodes.Table (E2 + 4) := Temp_Ent;
960 -- That exchange exchanged the parent pointers as well, which is what
961 -- we want, but we need to patch up the defining identifier pointers
962 -- in the parent nodes (the child pointers) to match this switch
963 -- unless for Implicit types entities which have no parent, in which
964 -- case we don't do anything otherwise we won't be able to revert back
965 -- to the original situation.
967 -- Shouldn't this use Is_Itype instead of the Parent test
969 if Present (Parent (E1)) and then Present (Parent (E2)) then
970 Set_Defining_Identifier (Parent (E1), E1);
971 Set_Defining_Identifier (Parent (E2), E2);
973 end Exchange_Entities;
979 function Extend_Node (Node : Node_Id) return Entity_Id is
982 procedure Debug_Extend_Node;
983 pragma Inline (Debug_Extend_Node);
984 -- Debug routine for debug flag N
986 -----------------------
987 -- Debug_Extend_Node --
988 -----------------------
990 procedure Debug_Extend_Node is
993 Write_Str ("Extend node ");
994 Write_Int (Int (Node));
996 if Result = Node then
997 Write_Str (" in place");
999 Write_Str (" copied to ");
1000 Write_Int (Int (Result));
1005 end Debug_Extend_Node;
1007 -- Start of processing for Extend_Node
1010 pragma Assert (not (Has_Extension (Node)));
1011 Result := Allocate_Initialize_Node (Node, With_Extension => True);
1012 pragma Debug (Debug_Extend_Node);
1020 procedure Fix_Parents (Ref_Node, Fix_Node : Node_Id) is
1022 procedure Fix_Parent (Field : Union_Id);
1023 -- Fixup one parent pointer. Field is checked to see if it points to
1024 -- a node, list, or element list that has a parent that points to
1025 -- Ref_Node. If so, the parent is reset to point to Fix_Node.
1031 procedure Fix_Parent (Field : Union_Id) is
1033 -- Fix parent of node that is referenced by Field. Note that we must
1034 -- exclude the case where the node is a member of a list, because in
1035 -- this case the parent is the parent of the list.
1037 if Field in Node_Range
1038 and then Present (Node_Id (Field))
1039 and then not Nodes.Table (Node_Id (Field)).In_List
1040 and then Parent (Node_Id (Field)) = Ref_Node
1042 Set_Parent (Node_Id (Field), Fix_Node);
1044 -- Fix parent of list that is referenced by Field
1046 elsif Field in List_Range
1047 and then Present (List_Id (Field))
1048 and then Parent (List_Id (Field)) = Ref_Node
1050 Set_Parent (List_Id (Field), Fix_Node);
1054 -- Start of processing for Fix_Parents
1057 Fix_Parent (Field1 (Fix_Node));
1058 Fix_Parent (Field2 (Fix_Node));
1059 Fix_Parent (Field3 (Fix_Node));
1060 Fix_Parent (Field4 (Fix_Node));
1061 Fix_Parent (Field5 (Fix_Node));
1064 -----------------------------------
1065 -- Get_Comes_From_Source_Default --
1066 -----------------------------------
1068 function Get_Comes_From_Source_Default return Boolean is
1070 return Default_Node.Comes_From_Source;
1071 end Get_Comes_From_Source_Default;
1077 function Has_Extension (N : Node_Id) return Boolean is
1079 return N < Nodes.Last and then Nodes.Table (N + 1).Is_Extension;
1086 procedure Initialize is
1088 pragma Warnings (Off, Dummy);
1092 Atree_Private_Part.Nodes.Init;
1096 -- Allocate Empty node
1098 Dummy := New_Node (N_Empty, No_Location);
1099 Set_Name1 (Empty, No_Name);
1101 -- Allocate Error node, and set Error_Posted, since we certainly
1102 -- only generate an Error node if we do post some kind of error!
1104 Dummy := New_Node (N_Error, No_Location);
1105 Set_Name1 (Error, Error_Name);
1106 Set_Error_Posted (Error, True);
1109 --------------------------
1110 -- Is_Rewrite_Insertion --
1111 --------------------------
1113 function Is_Rewrite_Insertion (Node : Node_Id) return Boolean is
1115 return Nodes.Table (Node).Rewrite_Ins;
1116 end Is_Rewrite_Insertion;
1118 -----------------------------
1119 -- Is_Rewrite_Substitution --
1120 -----------------------------
1122 function Is_Rewrite_Substitution (Node : Node_Id) return Boolean is
1124 return Orig_Nodes.Table (Node) /= Node;
1125 end Is_Rewrite_Substitution;
1131 function Last_Node_Id return Node_Id is
1142 Nodes.Locked := True;
1143 Orig_Nodes.Locked := True;
1148 ----------------------------
1149 -- Mark_Rewrite_Insertion --
1150 ----------------------------
1152 procedure Mark_Rewrite_Insertion (New_Node : Node_Id) is
1154 Nodes.Table (New_Node).Rewrite_Ins := True;
1155 end Mark_Rewrite_Insertion;
1161 function New_Copy (Source : Node_Id) return Node_Id is
1162 New_Id : Node_Id := Source;
1165 if Source > Empty_Or_Error then
1167 New_Id := Allocate_Initialize_Node (Source, Has_Extension (Source));
1169 Nodes.Table (New_Id).Link := Empty_List_Or_Node;
1170 Nodes.Table (New_Id).In_List := False;
1172 -- If the original is marked as a rewrite insertion, then unmark
1173 -- the copy, since we inserted the original, not the copy.
1175 Nodes.Table (New_Id).Rewrite_Ins := False;
1176 pragma Debug (New_Node_Debugging_Output (New_Id));
1187 (New_Node_Kind : Node_Kind;
1188 New_Sloc : Source_Ptr) return Entity_Id
1193 pragma Assert (New_Node_Kind in N_Entity);
1195 Ent := Allocate_Initialize_Node (Empty, With_Extension => True);
1197 -- If this is a node with a real location and we are generating
1198 -- source nodes, then reset Current_Error_Node. This is useful
1199 -- if we bomb during parsing to get a error location for the bomb.
1201 if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
1202 Current_Error_Node := Ent;
1205 Nodes.Table (Ent).Nkind := New_Node_Kind;
1206 Nodes.Table (Ent).Sloc := New_Sloc;
1207 pragma Debug (New_Node_Debugging_Output (Ent));
1217 (New_Node_Kind : Node_Kind;
1218 New_Sloc : Source_Ptr) return Node_Id
1223 pragma Assert (New_Node_Kind not in N_Entity);
1224 Nod := Allocate_Initialize_Node (Empty, With_Extension => False);
1225 Nodes.Table (Nod).Nkind := New_Node_Kind;
1226 Nodes.Table (Nod).Sloc := New_Sloc;
1227 pragma Debug (New_Node_Debugging_Output (Nod));
1229 -- If this is a node with a real location and we are generating source
1230 -- nodes, then reset Current_Error_Node. This is useful if we bomb
1231 -- during parsing to get an error location for the bomb.
1233 if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
1234 Current_Error_Node := Nod;
1240 -------------------------
1241 -- New_Node_Breakpoint --
1242 -------------------------
1244 procedure nn is -- New_Node_Breakpoint
1246 Write_Str ("Watched node ");
1247 Write_Int (Int (Watch_Node));
1248 Write_Str (" created");
1252 -------------------------------
1253 -- New_Node_Debugging_Output --
1254 -------------------------------
1256 procedure nnd (N : Node_Id) is -- New_Node_Debugging_Output
1257 Node_Is_Watched : constant Boolean := N = Watch_Node;
1260 if Debug_Flag_N or else Node_Is_Watched then
1261 Node_Debug_Output ("Allocate", N);
1263 if Node_Is_Watched then
1264 New_Node_Breakpoint;
1273 function Nkind (N : Node_Id) return Node_Kind is
1275 return Nodes.Table (N).Nkind;
1285 V2 : Node_Kind) return Boolean
1288 return Nkind_In (Nkind (N), V1, V2);
1295 V3 : Node_Kind) return Boolean
1298 return Nkind_In (Nkind (N), V1, V2, V3);
1306 V4 : Node_Kind) return Boolean
1309 return Nkind_In (Nkind (N), V1, V2, V3, V4);
1318 V5 : Node_Kind) return Boolean
1321 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5);
1331 V6 : Node_Kind) return Boolean
1334 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6);
1345 V7 : Node_Kind) return Boolean
1348 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7);
1360 V8 : Node_Kind) return Boolean
1363 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7, V8);
1376 V9 : Node_Kind) return Boolean
1379 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7, V8, V9);
1386 function No (N : Node_Id) return Boolean is
1391 -----------------------
1392 -- Node_Debug_Output --
1393 -----------------------
1395 procedure Node_Debug_Output (Op : String; N : Node_Id) is
1399 if Nkind (N) in N_Entity then
1400 Write_Str (" entity");
1402 Write_Str (" node");
1405 Write_Str (" Id = ");
1406 Write_Int (Int (N));
1408 Write_Location (Sloc (N));
1410 Write_Str (Node_Kind'Image (Nkind (N)));
1412 end Node_Debug_Output;
1418 function Nodes_Address return System.Address is
1420 return Nodes.Table (First_Node_Id)'Address;
1427 function Num_Nodes return Nat is
1436 function Original_Node (Node : Node_Id) return Node_Id is
1438 return Orig_Nodes.Table (Node);
1445 function Paren_Count (N : Node_Id) return Nat is
1449 pragma Assert (N <= Nodes.Last);
1451 if Nodes.Table (N).Pflag1 then
1455 if Nodes.Table (N).Pflag2 then
1459 -- Value of 0,1,2 returned as is
1464 -- Value of 3 means we search the table, and we must find an entry
1467 for J in Paren_Counts.First .. Paren_Counts.Last loop
1468 if N = Paren_Counts.Table (J).Nod then
1469 return Paren_Counts.Table (J).Count;
1473 raise Program_Error;
1481 function Parent (N : Node_Id) return Node_Id is
1483 if Is_List_Member (N) then
1484 return Parent (List_Containing (N));
1486 return Node_Id (Nodes.Table (N).Link);
1494 function Present (N : Node_Id) return Boolean is
1499 --------------------------------
1500 -- Preserve_Comes_From_Source --
1501 --------------------------------
1503 procedure Preserve_Comes_From_Source (NewN, OldN : Node_Id) is
1505 Nodes.Table (NewN).Comes_From_Source :=
1506 Nodes.Table (OldN).Comes_From_Source;
1507 end Preserve_Comes_From_Source;
1513 function Relocate_Node (Source : Node_Id) return Node_Id is
1521 New_Node := New_Copy (Source);
1522 Fix_Parents (Ref_Node => Source, Fix_Node => New_Node);
1524 -- We now set the parent of the new node to be the same as the
1525 -- parent of the source. Almost always this parent will be
1526 -- replaced by a new value when the relocated node is reattached
1527 -- to the tree, but by doing it now, we ensure that this node is
1528 -- not even temporarily disconnected from the tree. Note that this
1529 -- does not happen free, because in the list case, the parent does
1532 Set_Parent (New_Node, Parent (Source));
1534 -- If the node being relocated was a rewriting of some original
1535 -- node, then the relocated node has the same original node.
1537 if Orig_Nodes.Table (Source) /= Source then
1538 Orig_Nodes.Table (New_Node) := Orig_Nodes.Table (Source);
1548 procedure Replace (Old_Node, New_Node : Node_Id) is
1549 Old_Post : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
1550 Old_CFS : constant Boolean := Nodes.Table (Old_Node).Comes_From_Source;
1554 (not Has_Extension (Old_Node)
1555 and not Has_Extension (New_Node)
1556 and not Nodes.Table (New_Node).In_List);
1558 -- Do copy, preserving link and in list status and comes from source
1560 Copy_Node (Source => New_Node, Destination => Old_Node);
1561 Nodes.Table (Old_Node).Comes_From_Source := Old_CFS;
1562 Nodes.Table (Old_Node).Error_Posted := Old_Post;
1564 -- Fix parents of substituted node, since it has changed identity
1566 Fix_Parents (Ref_Node => New_Node, Fix_Node => Old_Node);
1568 -- Since we are doing a replace, we assume that the original node
1569 -- is intended to become the new replaced node. The call would be
1570 -- to Rewrite if there were an intention to save the original node.
1572 Orig_Nodes.Table (Old_Node) := Old_Node;
1579 procedure Rewrite (Old_Node, New_Node : Node_Id) is
1580 Old_Error_P : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
1581 -- This fields is always preserved in the new node
1583 Old_Paren_Count : Nat;
1584 Old_Must_Not_Freeze : Boolean;
1585 -- These fields are preserved in the new node only if the new node
1586 -- and the old node are both subexpression nodes.
1588 -- Note: it is a violation of abstraction levels for Must_Not_Freeze
1589 -- to be referenced like this. ???
1595 (not Has_Extension (Old_Node)
1596 and not Has_Extension (New_Node)
1597 and not Nodes.Table (New_Node).In_List);
1598 pragma Debug (Rewrite_Debugging_Output (Old_Node, New_Node));
1600 if Nkind (Old_Node) in N_Subexpr then
1601 Old_Paren_Count := Paren_Count (Old_Node);
1602 Old_Must_Not_Freeze := Must_Not_Freeze (Old_Node);
1604 Old_Paren_Count := 0;
1605 Old_Must_Not_Freeze := False;
1608 -- Allocate a new node, to be used to preserve the original contents
1609 -- of the Old_Node, for possible later retrival by Original_Node and
1610 -- make an entry in the Orig_Nodes table. This is only done if we have
1611 -- not already rewritten the node, as indicated by an Orig_Nodes entry
1612 -- that does not reference the Old_Node.
1614 if Orig_Nodes.Table (Old_Node) = Old_Node then
1615 Sav_Node := New_Copy (Old_Node);
1616 Orig_Nodes.Table (Sav_Node) := Sav_Node;
1617 Orig_Nodes.Table (Old_Node) := Sav_Node;
1620 -- Copy substitute node into place, preserving old fields as required
1622 Copy_Node (Source => New_Node, Destination => Old_Node);
1623 Nodes.Table (Old_Node).Error_Posted := Old_Error_P;
1625 if Nkind (New_Node) in N_Subexpr then
1626 Set_Paren_Count (Old_Node, Old_Paren_Count);
1627 Set_Must_Not_Freeze (Old_Node, Old_Must_Not_Freeze);
1630 Fix_Parents (Ref_Node => New_Node, Fix_Node => Old_Node);
1633 -------------------------
1634 -- Rewrite_Breakpoint --
1635 -------------------------
1637 procedure rr is -- Rewrite_Breakpoint
1639 Write_Str ("Watched node ");
1640 Write_Int (Int (Watch_Node));
1641 Write_Str (" rewritten");
1645 ------------------------------
1646 -- Rewrite_Debugging_Output --
1647 ------------------------------
1649 procedure rrd (Old_Node, New_Node : Node_Id) is -- Rewrite_Debugging_Output
1650 Node_Is_Watched : constant Boolean := Old_Node = Watch_Node;
1653 if Debug_Flag_N or else Node_Is_Watched then
1654 Node_Debug_Output ("Rewrite", Old_Node);
1655 Node_Debug_Output ("into", New_Node);
1657 if Node_Is_Watched then
1667 procedure Set_Analyzed (N : Node_Id; Val : Boolean := True) is
1669 Nodes.Table (N).Analyzed := Val;
1672 ---------------------------
1673 -- Set_Comes_From_Source --
1674 ---------------------------
1676 procedure Set_Comes_From_Source (N : Node_Id; Val : Boolean) is
1678 pragma Assert (N <= Nodes.Last);
1679 Nodes.Table (N).Comes_From_Source := Val;
1680 end Set_Comes_From_Source;
1682 -----------------------------------
1683 -- Set_Comes_From_Source_Default --
1684 -----------------------------------
1686 procedure Set_Comes_From_Source_Default (Default : Boolean) is
1688 Default_Node.Comes_From_Source := Default;
1689 end Set_Comes_From_Source_Default;
1695 procedure Set_Ekind (E : Entity_Id; Val : Entity_Kind) is
1697 pragma Assert (Nkind (E) in N_Entity);
1698 Nodes.Table (E + 1).Nkind := E_To_N (Val);
1701 ----------------------
1702 -- Set_Error_Posted --
1703 ----------------------
1705 procedure Set_Error_Posted (N : Node_Id; Val : Boolean := True) is
1707 Nodes.Table (N).Error_Posted := Val;
1708 end Set_Error_Posted;
1710 ---------------------
1711 -- Set_Paren_Count --
1712 ---------------------
1714 procedure Set_Paren_Count (N : Node_Id; Val : Nat) is
1716 pragma Assert (Nkind (N) in N_Subexpr);
1718 -- Value of 0,1,2 stored as is
1721 Nodes.Table (N).Pflag1 := (Val mod 2 /= 0);
1722 Nodes.Table (N).Pflag2 := (Val = 2);
1724 -- Value of 3 or greater stores 3 in node and makes table entry
1727 Nodes.Table (N).Pflag1 := True;
1728 Nodes.Table (N).Pflag2 := True;
1730 for J in Paren_Counts.First .. Paren_Counts.Last loop
1731 if N = Paren_Counts.Table (J).Nod then
1732 Paren_Counts.Table (J).Count := Val;
1737 Paren_Counts.Append ((Nod => N, Count => Val));
1739 end Set_Paren_Count;
1745 procedure Set_Parent (N : Node_Id; Val : Node_Id) is
1747 pragma Assert (not Nodes.Table (N).In_List);
1748 Nodes.Table (N).Link := Union_Id (Val);
1755 procedure Set_Sloc (N : Node_Id; Val : Source_Ptr) is
1757 Nodes.Table (N).Sloc := Val;
1764 function Sloc (N : Node_Id) return Source_Ptr is
1766 return Nodes.Table (N).Sloc;
1773 function Traverse_Func (Node : Node_Id) return Traverse_Final_Result is
1775 function Traverse_Field
1778 FN : Field_Num) return Traverse_Final_Result;
1779 -- Fld is one of the fields of Nod. If the field points to syntactic
1780 -- node or list, then this node or list is traversed, and the result is
1781 -- the result of this traversal. Otherwise a value of True is returned
1782 -- with no processing. FN is the number of the field (1 .. 5).
1784 --------------------
1785 -- Traverse_Field --
1786 --------------------
1788 function Traverse_Field
1791 FN : Field_Num) return Traverse_Final_Result
1794 if Fld = Union_Id (Empty) then
1797 -- Descendent is a node
1799 elsif Fld in Node_Range then
1801 -- Traverse descendent that is syntactic subtree node
1803 if Is_Syntactic_Field (Nkind (Nod), FN) then
1804 return Traverse_Func (Node_Id (Fld));
1806 -- Node that is not a syntactic subtree
1812 -- Descendent is a list
1814 elsif Fld in List_Range then
1816 -- Traverse descendent that is a syntactic subtree list
1818 if Is_Syntactic_Field (Nkind (Nod), FN) then
1820 Elmt : Node_Id := First (List_Id (Fld));
1822 while Present (Elmt) loop
1823 if Traverse_Func (Elmt) = Abandon then
1833 -- List that is not a syntactic subtree
1839 -- Field was not a node or a list
1846 Cur_Node : Node_Id := Node;
1848 -- Start of processing for Traverse_Func
1851 -- We walk Field2 last, and if it is a node, we eliminate the tail
1852 -- recursion by jumping back to this label. This is because Field2 is
1853 -- where the Left_Opnd field of N_Op_Concat is stored, and in practice
1854 -- concatenations are sometimes deeply nested, as in X1&X2&...&XN. This
1855 -- trick prevents us from running out of memory in that case. We don't
1856 -- bother eliminating the tail recursion if Field2 is a list.
1860 case Process (Cur_Node) is
1871 Cur_Node := Original_Node (Cur_Node);
1874 if Traverse_Field (Cur_Node, Field1 (Cur_Node), 1) = Abandon
1875 or else -- skip Field2 here
1876 Traverse_Field (Cur_Node, Field3 (Cur_Node), 3) = Abandon
1878 Traverse_Field (Cur_Node, Field4 (Cur_Node), 4) = Abandon
1880 Traverse_Field (Cur_Node, Field5 (Cur_Node), 5) = Abandon
1885 if Field2 (Cur_Node) not in Node_Range then
1886 return Traverse_Field (Cur_Node, Field2 (Cur_Node), 2);
1888 elsif Is_Syntactic_Field (Nkind (Cur_Node), 2)
1889 and then Field2 (Cur_Node) /= Empty_List_Or_Node
1891 -- Here is the tail recursion step, we reset Cur_Node and jump back
1892 -- to the start of the procedure, which has the same semantic effect
1895 Cur_Node := Node_Id (Field2 (Cur_Node));
1906 procedure Traverse_Proc (Node : Node_Id) is
1907 function Traverse is new Traverse_Func (Process);
1908 Discard : Traverse_Final_Result;
1909 pragma Warnings (Off, Discard);
1911 Discard := Traverse (Node);
1918 procedure Tree_Read is
1920 Tree_Read_Int (Node_Count);
1922 Orig_Nodes.Tree_Read;
1923 Paren_Counts.Tree_Read;
1930 procedure Tree_Write is
1932 Tree_Write_Int (Node_Count);
1934 Orig_Nodes.Tree_Write;
1935 Paren_Counts.Tree_Write;
1938 ------------------------------
1939 -- Unchecked Access Package --
1940 ------------------------------
1942 package body Unchecked_Access is
1944 function Field1 (N : Node_Id) return Union_Id is
1946 pragma Assert (N <= Nodes.Last);
1947 return Nodes.Table (N).Field1;
1950 function Field2 (N : Node_Id) return Union_Id is
1952 pragma Assert (N <= Nodes.Last);
1953 return Nodes.Table (N).Field2;
1956 function Field3 (N : Node_Id) return Union_Id is
1958 pragma Assert (N <= Nodes.Last);
1959 return Nodes.Table (N).Field3;
1962 function Field4 (N : Node_Id) return Union_Id is
1964 pragma Assert (N <= Nodes.Last);
1965 return Nodes.Table (N).Field4;
1968 function Field5 (N : Node_Id) return Union_Id is
1970 pragma Assert (N <= Nodes.Last);
1971 return Nodes.Table (N).Field5;
1974 function Field6 (N : Node_Id) return Union_Id is
1976 pragma Assert (Nkind (N) in N_Entity);
1977 return Nodes.Table (N + 1).Field6;
1980 function Field7 (N : Node_Id) return Union_Id is
1982 pragma Assert (Nkind (N) in N_Entity);
1983 return Nodes.Table (N + 1).Field7;
1986 function Field8 (N : Node_Id) return Union_Id is
1988 pragma Assert (Nkind (N) in N_Entity);
1989 return Nodes.Table (N + 1).Field8;
1992 function Field9 (N : Node_Id) return Union_Id is
1994 pragma Assert (Nkind (N) in N_Entity);
1995 return Nodes.Table (N + 1).Field9;
1998 function Field10 (N : Node_Id) return Union_Id is
2000 pragma Assert (Nkind (N) in N_Entity);
2001 return Nodes.Table (N + 1).Field10;
2004 function Field11 (N : Node_Id) return Union_Id is
2006 pragma Assert (Nkind (N) in N_Entity);
2007 return Nodes.Table (N + 1).Field11;
2010 function Field12 (N : Node_Id) return Union_Id is
2012 pragma Assert (Nkind (N) in N_Entity);
2013 return Nodes.Table (N + 1).Field12;
2016 function Field13 (N : Node_Id) return Union_Id is
2018 pragma Assert (Nkind (N) in N_Entity);
2019 return Nodes.Table (N + 2).Field6;
2022 function Field14 (N : Node_Id) return Union_Id is
2024 pragma Assert (Nkind (N) in N_Entity);
2025 return Nodes.Table (N + 2).Field7;
2028 function Field15 (N : Node_Id) return Union_Id is
2030 pragma Assert (Nkind (N) in N_Entity);
2031 return Nodes.Table (N + 2).Field8;
2034 function Field16 (N : Node_Id) return Union_Id is
2036 pragma Assert (Nkind (N) in N_Entity);
2037 return Nodes.Table (N + 2).Field9;
2040 function Field17 (N : Node_Id) return Union_Id is
2042 pragma Assert (Nkind (N) in N_Entity);
2043 return Nodes.Table (N + 2).Field10;
2046 function Field18 (N : Node_Id) return Union_Id is
2048 pragma Assert (Nkind (N) in N_Entity);
2049 return Nodes.Table (N + 2).Field11;
2052 function Field19 (N : Node_Id) return Union_Id is
2054 pragma Assert (Nkind (N) in N_Entity);
2055 return Nodes.Table (N + 3).Field6;
2058 function Field20 (N : Node_Id) return Union_Id is
2060 pragma Assert (Nkind (N) in N_Entity);
2061 return Nodes.Table (N + 3).Field7;
2064 function Field21 (N : Node_Id) return Union_Id is
2066 pragma Assert (Nkind (N) in N_Entity);
2067 return Nodes.Table (N + 3).Field8;
2070 function Field22 (N : Node_Id) return Union_Id is
2072 pragma Assert (Nkind (N) in N_Entity);
2073 return Nodes.Table (N + 3).Field9;
2076 function Field23 (N : Node_Id) return Union_Id is
2078 pragma Assert (Nkind (N) in N_Entity);
2079 return Nodes.Table (N + 3).Field10;
2082 function Field24 (N : Node_Id) return Union_Id is
2084 pragma Assert (Nkind (N) in N_Entity);
2085 return Nodes.Table (N + 4).Field6;
2088 function Field25 (N : Node_Id) return Union_Id is
2090 pragma Assert (Nkind (N) in N_Entity);
2091 return Nodes.Table (N + 4).Field7;
2094 function Field26 (N : Node_Id) return Union_Id is
2096 pragma Assert (Nkind (N) in N_Entity);
2097 return Nodes.Table (N + 4).Field8;
2100 function Field27 (N : Node_Id) return Union_Id is
2102 pragma Assert (Nkind (N) in N_Entity);
2103 return Nodes.Table (N + 4).Field9;
2106 function Field28 (N : Node_Id) return Union_Id is
2108 pragma Assert (Nkind (N) in N_Entity);
2109 return Nodes.Table (N + 4).Field10;
2112 function Node1 (N : Node_Id) return Node_Id is
2114 pragma Assert (N <= Nodes.Last);
2115 return Node_Id (Nodes.Table (N).Field1);
2118 function Node2 (N : Node_Id) return Node_Id is
2120 pragma Assert (N <= Nodes.Last);
2121 return Node_Id (Nodes.Table (N).Field2);
2124 function Node3 (N : Node_Id) return Node_Id is
2126 pragma Assert (N <= Nodes.Last);
2127 return Node_Id (Nodes.Table (N).Field3);
2130 function Node4 (N : Node_Id) return Node_Id is
2132 pragma Assert (N <= Nodes.Last);
2133 return Node_Id (Nodes.Table (N).Field4);
2136 function Node5 (N : Node_Id) return Node_Id is
2138 pragma Assert (N <= Nodes.Last);
2139 return Node_Id (Nodes.Table (N).Field5);
2142 function Node6 (N : Node_Id) return Node_Id is
2144 pragma Assert (Nkind (N) in N_Entity);
2145 return Node_Id (Nodes.Table (N + 1).Field6);
2148 function Node7 (N : Node_Id) return Node_Id is
2150 pragma Assert (Nkind (N) in N_Entity);
2151 return Node_Id (Nodes.Table (N + 1).Field7);
2154 function Node8 (N : Node_Id) return Node_Id is
2156 pragma Assert (Nkind (N) in N_Entity);
2157 return Node_Id (Nodes.Table (N + 1).Field8);
2160 function Node9 (N : Node_Id) return Node_Id is
2162 pragma Assert (Nkind (N) in N_Entity);
2163 return Node_Id (Nodes.Table (N + 1).Field9);
2166 function Node10 (N : Node_Id) return Node_Id is
2168 pragma Assert (Nkind (N) in N_Entity);
2169 return Node_Id (Nodes.Table (N + 1).Field10);
2172 function Node11 (N : Node_Id) return Node_Id is
2174 pragma Assert (Nkind (N) in N_Entity);
2175 return Node_Id (Nodes.Table (N + 1).Field11);
2178 function Node12 (N : Node_Id) return Node_Id is
2180 pragma Assert (Nkind (N) in N_Entity);
2181 return Node_Id (Nodes.Table (N + 1).Field12);
2184 function Node13 (N : Node_Id) return Node_Id is
2186 pragma Assert (Nkind (N) in N_Entity);
2187 return Node_Id (Nodes.Table (N + 2).Field6);
2190 function Node14 (N : Node_Id) return Node_Id is
2192 pragma Assert (Nkind (N) in N_Entity);
2193 return Node_Id (Nodes.Table (N + 2).Field7);
2196 function Node15 (N : Node_Id) return Node_Id is
2198 pragma Assert (Nkind (N) in N_Entity);
2199 return Node_Id (Nodes.Table (N + 2).Field8);
2202 function Node16 (N : Node_Id) return Node_Id is
2204 pragma Assert (Nkind (N) in N_Entity);
2205 return Node_Id (Nodes.Table (N + 2).Field9);
2208 function Node17 (N : Node_Id) return Node_Id is
2210 pragma Assert (Nkind (N) in N_Entity);
2211 return Node_Id (Nodes.Table (N + 2).Field10);
2214 function Node18 (N : Node_Id) return Node_Id is
2216 pragma Assert (Nkind (N) in N_Entity);
2217 return Node_Id (Nodes.Table (N + 2).Field11);
2220 function Node19 (N : Node_Id) return Node_Id is
2222 pragma Assert (Nkind (N) in N_Entity);
2223 return Node_Id (Nodes.Table (N + 3).Field6);
2226 function Node20 (N : Node_Id) return Node_Id is
2228 pragma Assert (Nkind (N) in N_Entity);
2229 return Node_Id (Nodes.Table (N + 3).Field7);
2232 function Node21 (N : Node_Id) return Node_Id is
2234 pragma Assert (Nkind (N) in N_Entity);
2235 return Node_Id (Nodes.Table (N + 3).Field8);
2238 function Node22 (N : Node_Id) return Node_Id is
2240 pragma Assert (Nkind (N) in N_Entity);
2241 return Node_Id (Nodes.Table (N + 3).Field9);
2244 function Node23 (N : Node_Id) return Node_Id is
2246 pragma Assert (Nkind (N) in N_Entity);
2247 return Node_Id (Nodes.Table (N + 3).Field10);
2250 function Node24 (N : Node_Id) return Node_Id is
2252 pragma Assert (Nkind (N) in N_Entity);
2253 return Node_Id (Nodes.Table (N + 4).Field6);
2256 function Node25 (N : Node_Id) return Node_Id is
2258 pragma Assert (Nkind (N) in N_Entity);
2259 return Node_Id (Nodes.Table (N + 4).Field7);
2262 function Node26 (N : Node_Id) return Node_Id is
2264 pragma Assert (Nkind (N) in N_Entity);
2265 return Node_Id (Nodes.Table (N + 4).Field8);
2268 function Node27 (N : Node_Id) return Node_Id is
2270 pragma Assert (Nkind (N) in N_Entity);
2271 return Node_Id (Nodes.Table (N + 4).Field9);
2274 function Node28 (N : Node_Id) return Node_Id is
2276 pragma Assert (Nkind (N) in N_Entity);
2277 return Node_Id (Nodes.Table (N + 4).Field10);
2280 function List1 (N : Node_Id) return List_Id is
2282 pragma Assert (N <= Nodes.Last);
2283 return List_Id (Nodes.Table (N).Field1);
2286 function List2 (N : Node_Id) return List_Id is
2288 pragma Assert (N <= Nodes.Last);
2289 return List_Id (Nodes.Table (N).Field2);
2292 function List3 (N : Node_Id) return List_Id is
2294 pragma Assert (N <= Nodes.Last);
2295 return List_Id (Nodes.Table (N).Field3);
2298 function List4 (N : Node_Id) return List_Id is
2300 pragma Assert (N <= Nodes.Last);
2301 return List_Id (Nodes.Table (N).Field4);
2304 function List5 (N : Node_Id) return List_Id is
2306 pragma Assert (N <= Nodes.Last);
2307 return List_Id (Nodes.Table (N).Field5);
2310 function List10 (N : Node_Id) return List_Id is
2312 pragma Assert (Nkind (N) in N_Entity);
2313 return List_Id (Nodes.Table (N + 1).Field10);
2316 function List14 (N : Node_Id) return List_Id is
2318 pragma Assert (Nkind (N) in N_Entity);
2319 return List_Id (Nodes.Table (N + 2).Field7);
2322 function Elist1 (N : Node_Id) return Elist_Id is
2323 pragma Assert (N <= Nodes.Last);
2324 Value : constant Union_Id := Nodes.Table (N).Field1;
2329 return Elist_Id (Value);
2333 function Elist2 (N : Node_Id) return Elist_Id is
2334 pragma Assert (N <= Nodes.Last);
2335 Value : constant Union_Id := Nodes.Table (N).Field2;
2340 return Elist_Id (Value);
2344 function Elist3 (N : Node_Id) return Elist_Id is
2345 pragma Assert (N <= Nodes.Last);
2346 Value : constant Union_Id := Nodes.Table (N).Field3;
2351 return Elist_Id (Value);
2355 function Elist4 (N : Node_Id) return Elist_Id is
2356 pragma Assert (N <= Nodes.Last);
2357 Value : constant Union_Id := Nodes.Table (N).Field4;
2362 return Elist_Id (Value);
2366 function Elist8 (N : Node_Id) return Elist_Id is
2367 pragma Assert (Nkind (N) in N_Entity);
2368 Value : constant Union_Id := Nodes.Table (N + 1).Field8;
2373 return Elist_Id (Value);
2377 function Elist13 (N : Node_Id) return Elist_Id is
2378 pragma Assert (Nkind (N) in N_Entity);
2379 Value : constant Union_Id := Nodes.Table (N + 2).Field6;
2384 return Elist_Id (Value);
2388 function Elist15 (N : Node_Id) return Elist_Id is
2389 pragma Assert (Nkind (N) in N_Entity);
2390 Value : constant Union_Id := Nodes.Table (N + 2).Field8;
2395 return Elist_Id (Value);
2399 function Elist16 (N : Node_Id) return Elist_Id is
2400 pragma Assert (Nkind (N) in N_Entity);
2401 Value : constant Union_Id := Nodes.Table (N + 2).Field9;
2406 return Elist_Id (Value);
2410 function Elist18 (N : Node_Id) return Elist_Id is
2411 pragma Assert (Nkind (N) in N_Entity);
2412 Value : constant Union_Id := Nodes.Table (N + 2).Field11;
2417 return Elist_Id (Value);
2421 function Elist21 (N : Node_Id) return Elist_Id is
2422 pragma Assert (Nkind (N) in N_Entity);
2423 Value : constant Union_Id := Nodes.Table (N + 3).Field8;
2428 return Elist_Id (Value);
2432 function Elist23 (N : Node_Id) return Elist_Id is
2433 pragma Assert (Nkind (N) in N_Entity);
2434 Value : constant Union_Id := Nodes.Table (N + 3).Field10;
2439 return Elist_Id (Value);
2443 function Elist25 (N : Node_Id) return Elist_Id is
2444 pragma Assert (Nkind (N) in N_Entity);
2445 Value : constant Union_Id := Nodes.Table (N + 4).Field7;
2450 return Elist_Id (Value);
2454 function Elist26 (N : Node_Id) return Elist_Id is
2455 pragma Assert (Nkind (N) in N_Entity);
2456 Value : constant Union_Id := Nodes.Table (N + 4).Field8;
2461 return Elist_Id (Value);
2465 function Name1 (N : Node_Id) return Name_Id is
2467 pragma Assert (N <= Nodes.Last);
2468 return Name_Id (Nodes.Table (N).Field1);
2471 function Name2 (N : Node_Id) return Name_Id is
2473 pragma Assert (N <= Nodes.Last);
2474 return Name_Id (Nodes.Table (N).Field2);
2477 function Str3 (N : Node_Id) return String_Id is
2479 pragma Assert (N <= Nodes.Last);
2480 return String_Id (Nodes.Table (N).Field3);
2483 function Uint2 (N : Node_Id) return Uint is
2484 pragma Assert (N <= Nodes.Last);
2485 U : constant Union_Id := Nodes.Table (N).Field2;
2490 return From_Union (U);
2494 function Uint3 (N : Node_Id) return Uint is
2495 pragma Assert (N <= Nodes.Last);
2496 U : constant Union_Id := Nodes.Table (N).Field3;
2501 return From_Union (U);
2505 function Uint4 (N : Node_Id) return Uint is
2506 pragma Assert (N <= Nodes.Last);
2507 U : constant Union_Id := Nodes.Table (N).Field4;
2512 return From_Union (U);
2516 function Uint5 (N : Node_Id) return Uint is
2517 pragma Assert (N <= Nodes.Last);
2518 U : constant Union_Id := Nodes.Table (N).Field5;
2523 return From_Union (U);
2527 function Uint8 (N : Node_Id) return Uint is
2528 pragma Assert (Nkind (N) in N_Entity);
2529 U : constant Union_Id := Nodes.Table (N + 1).Field8;
2534 return From_Union (U);
2538 function Uint9 (N : Node_Id) return Uint is
2539 pragma Assert (Nkind (N) in N_Entity);
2540 U : constant Union_Id := Nodes.Table (N + 1).Field9;
2545 return From_Union (U);
2549 function Uint10 (N : Node_Id) return Uint is
2550 pragma Assert (Nkind (N) in N_Entity);
2551 U : constant Union_Id := Nodes.Table (N + 1).Field10;
2556 return From_Union (U);
2560 function Uint11 (N : Node_Id) return Uint is
2561 pragma Assert (Nkind (N) in N_Entity);
2562 U : constant Union_Id := Nodes.Table (N + 1).Field11;
2567 return From_Union (U);
2571 function Uint12 (N : Node_Id) return Uint is
2572 pragma Assert (Nkind (N) in N_Entity);
2573 U : constant Union_Id := Nodes.Table (N + 1).Field12;
2578 return From_Union (U);
2582 function Uint13 (N : Node_Id) return Uint is
2583 pragma Assert (Nkind (N) in N_Entity);
2584 U : constant Union_Id := Nodes.Table (N + 2).Field6;
2589 return From_Union (U);
2593 function Uint14 (N : Node_Id) return Uint is
2594 pragma Assert (Nkind (N) in N_Entity);
2595 U : constant Union_Id := Nodes.Table (N + 2).Field7;
2600 return From_Union (U);
2604 function Uint15 (N : Node_Id) return Uint is
2605 pragma Assert (Nkind (N) in N_Entity);
2606 U : constant Union_Id := Nodes.Table (N + 2).Field8;
2611 return From_Union (U);
2615 function Uint16 (N : Node_Id) return Uint is
2616 pragma Assert (Nkind (N) in N_Entity);
2617 U : constant Union_Id := Nodes.Table (N + 2).Field9;
2622 return From_Union (U);
2626 function Uint17 (N : Node_Id) return Uint is
2627 pragma Assert (Nkind (N) in N_Entity);
2628 U : constant Union_Id := Nodes.Table (N + 2).Field10;
2633 return From_Union (U);
2637 function Uint22 (N : Node_Id) return Uint is
2638 pragma Assert (Nkind (N) in N_Entity);
2639 U : constant Union_Id := Nodes.Table (N + 3).Field9;
2644 return From_Union (U);
2648 function Ureal3 (N : Node_Id) return Ureal is
2650 pragma Assert (N <= Nodes.Last);
2651 return From_Union (Nodes.Table (N).Field3);
2654 function Ureal18 (N : Node_Id) return Ureal is
2656 pragma Assert (Nkind (N) in N_Entity);
2657 return From_Union (Nodes.Table (N + 2).Field11);
2660 function Ureal21 (N : Node_Id) return Ureal is
2662 pragma Assert (Nkind (N) in N_Entity);
2663 return From_Union (Nodes.Table (N + 3).Field8);
2666 function Flag4 (N : Node_Id) return Boolean is
2668 pragma Assert (N <= Nodes.Last);
2669 return Nodes.Table (N).Flag4;
2672 function Flag5 (N : Node_Id) return Boolean is
2674 pragma Assert (N <= Nodes.Last);
2675 return Nodes.Table (N).Flag5;
2678 function Flag6 (N : Node_Id) return Boolean is
2680 pragma Assert (N <= Nodes.Last);
2681 return Nodes.Table (N).Flag6;
2684 function Flag7 (N : Node_Id) return Boolean is
2686 pragma Assert (N <= Nodes.Last);
2687 return Nodes.Table (N).Flag7;
2690 function Flag8 (N : Node_Id) return Boolean is
2692 pragma Assert (N <= Nodes.Last);
2693 return Nodes.Table (N).Flag8;
2696 function Flag9 (N : Node_Id) return Boolean is
2698 pragma Assert (N <= Nodes.Last);
2699 return Nodes.Table (N).Flag9;
2702 function Flag10 (N : Node_Id) return Boolean is
2704 pragma Assert (N <= Nodes.Last);
2705 return Nodes.Table (N).Flag10;
2708 function Flag11 (N : Node_Id) return Boolean is
2710 pragma Assert (N <= Nodes.Last);
2711 return Nodes.Table (N).Flag11;
2714 function Flag12 (N : Node_Id) return Boolean is
2716 pragma Assert (N <= Nodes.Last);
2717 return Nodes.Table (N).Flag12;
2720 function Flag13 (N : Node_Id) return Boolean is
2722 pragma Assert (N <= Nodes.Last);
2723 return Nodes.Table (N).Flag13;
2726 function Flag14 (N : Node_Id) return Boolean is
2728 pragma Assert (N <= Nodes.Last);
2729 return Nodes.Table (N).Flag14;
2732 function Flag15 (N : Node_Id) return Boolean is
2734 pragma Assert (N <= Nodes.Last);
2735 return Nodes.Table (N).Flag15;
2738 function Flag16 (N : Node_Id) return Boolean is
2740 pragma Assert (N <= Nodes.Last);
2741 return Nodes.Table (N).Flag16;
2744 function Flag17 (N : Node_Id) return Boolean is
2746 pragma Assert (N <= Nodes.Last);
2747 return Nodes.Table (N).Flag17;
2750 function Flag18 (N : Node_Id) return Boolean is
2752 pragma Assert (N <= Nodes.Last);
2753 return Nodes.Table (N).Flag18;
2756 function Flag19 (N : Node_Id) return Boolean is
2758 pragma Assert (Nkind (N) in N_Entity);
2759 return Nodes.Table (N + 1).In_List;
2762 function Flag20 (N : Node_Id) return Boolean is
2764 pragma Assert (Nkind (N) in N_Entity);
2765 return Nodes.Table (N + 1).Unused_1;
2768 function Flag21 (N : Node_Id) return Boolean is
2770 pragma Assert (Nkind (N) in N_Entity);
2771 return Nodes.Table (N + 1).Rewrite_Ins;
2774 function Flag22 (N : Node_Id) return Boolean is
2776 pragma Assert (Nkind (N) in N_Entity);
2777 return Nodes.Table (N + 1).Analyzed;
2780 function Flag23 (N : Node_Id) return Boolean is
2782 pragma Assert (Nkind (N) in N_Entity);
2783 return Nodes.Table (N + 1).Comes_From_Source;
2786 function Flag24 (N : Node_Id) return Boolean is
2788 pragma Assert (Nkind (N) in N_Entity);
2789 return Nodes.Table (N + 1).Error_Posted;
2792 function Flag25 (N : Node_Id) return Boolean is
2794 pragma Assert (Nkind (N) in N_Entity);
2795 return Nodes.Table (N + 1).Flag4;
2798 function Flag26 (N : Node_Id) return Boolean is
2800 pragma Assert (Nkind (N) in N_Entity);
2801 return Nodes.Table (N + 1).Flag5;
2804 function Flag27 (N : Node_Id) return Boolean is
2806 pragma Assert (Nkind (N) in N_Entity);
2807 return Nodes.Table (N + 1).Flag6;
2810 function Flag28 (N : Node_Id) return Boolean is
2812 pragma Assert (Nkind (N) in N_Entity);
2813 return Nodes.Table (N + 1).Flag7;
2816 function Flag29 (N : Node_Id) return Boolean is
2818 pragma Assert (Nkind (N) in N_Entity);
2819 return Nodes.Table (N + 1).Flag8;
2822 function Flag30 (N : Node_Id) return Boolean is
2824 pragma Assert (Nkind (N) in N_Entity);
2825 return Nodes.Table (N + 1).Flag9;
2828 function Flag31 (N : Node_Id) return Boolean is
2830 pragma Assert (Nkind (N) in N_Entity);
2831 return Nodes.Table (N + 1).Flag10;
2834 function Flag32 (N : Node_Id) return Boolean is
2836 pragma Assert (Nkind (N) in N_Entity);
2837 return Nodes.Table (N + 1).Flag11;
2840 function Flag33 (N : Node_Id) return Boolean is
2842 pragma Assert (Nkind (N) in N_Entity);
2843 return Nodes.Table (N + 1).Flag12;
2846 function Flag34 (N : Node_Id) return Boolean is
2848 pragma Assert (Nkind (N) in N_Entity);
2849 return Nodes.Table (N + 1).Flag13;
2852 function Flag35 (N : Node_Id) return Boolean is
2854 pragma Assert (Nkind (N) in N_Entity);
2855 return Nodes.Table (N + 1).Flag14;
2858 function Flag36 (N : Node_Id) return Boolean is
2860 pragma Assert (Nkind (N) in N_Entity);
2861 return Nodes.Table (N + 1).Flag15;
2864 function Flag37 (N : Node_Id) return Boolean is
2866 pragma Assert (Nkind (N) in N_Entity);
2867 return Nodes.Table (N + 1).Flag16;
2870 function Flag38 (N : Node_Id) return Boolean is
2872 pragma Assert (Nkind (N) in N_Entity);
2873 return Nodes.Table (N + 1).Flag17;
2876 function Flag39 (N : Node_Id) return Boolean is
2878 pragma Assert (Nkind (N) in N_Entity);
2879 return Nodes.Table (N + 1).Flag18;
2882 function Flag40 (N : Node_Id) return Boolean is
2884 pragma Assert (Nkind (N) in N_Entity);
2885 return Nodes.Table (N + 2).In_List;
2888 function Flag41 (N : Node_Id) return Boolean is
2890 pragma Assert (Nkind (N) in N_Entity);
2891 return Nodes.Table (N + 2).Unused_1;
2894 function Flag42 (N : Node_Id) return Boolean is
2896 pragma Assert (Nkind (N) in N_Entity);
2897 return Nodes.Table (N + 2).Rewrite_Ins;
2900 function Flag43 (N : Node_Id) return Boolean is
2902 pragma Assert (Nkind (N) in N_Entity);
2903 return Nodes.Table (N + 2).Analyzed;
2906 function Flag44 (N : Node_Id) return Boolean is
2908 pragma Assert (Nkind (N) in N_Entity);
2909 return Nodes.Table (N + 2).Comes_From_Source;
2912 function Flag45 (N : Node_Id) return Boolean is
2914 pragma Assert (Nkind (N) in N_Entity);
2915 return Nodes.Table (N + 2).Error_Posted;
2918 function Flag46 (N : Node_Id) return Boolean is
2920 pragma Assert (Nkind (N) in N_Entity);
2921 return Nodes.Table (N + 2).Flag4;
2924 function Flag47 (N : Node_Id) return Boolean is
2926 pragma Assert (Nkind (N) in N_Entity);
2927 return Nodes.Table (N + 2).Flag5;
2930 function Flag48 (N : Node_Id) return Boolean is
2932 pragma Assert (Nkind (N) in N_Entity);
2933 return Nodes.Table (N + 2).Flag6;
2936 function Flag49 (N : Node_Id) return Boolean is
2938 pragma Assert (Nkind (N) in N_Entity);
2939 return Nodes.Table (N + 2).Flag7;
2942 function Flag50 (N : Node_Id) return Boolean is
2944 pragma Assert (Nkind (N) in N_Entity);
2945 return Nodes.Table (N + 2).Flag8;
2948 function Flag51 (N : Node_Id) return Boolean is
2950 pragma Assert (Nkind (N) in N_Entity);
2951 return Nodes.Table (N + 2).Flag9;
2954 function Flag52 (N : Node_Id) return Boolean is
2956 pragma Assert (Nkind (N) in N_Entity);
2957 return Nodes.Table (N + 2).Flag10;
2960 function Flag53 (N : Node_Id) return Boolean is
2962 pragma Assert (Nkind (N) in N_Entity);
2963 return Nodes.Table (N + 2).Flag11;
2966 function Flag54 (N : Node_Id) return Boolean is
2968 pragma Assert (Nkind (N) in N_Entity);
2969 return Nodes.Table (N + 2).Flag12;
2972 function Flag55 (N : Node_Id) return Boolean is
2974 pragma Assert (Nkind (N) in N_Entity);
2975 return Nodes.Table (N + 2).Flag13;
2978 function Flag56 (N : Node_Id) return Boolean is
2980 pragma Assert (Nkind (N) in N_Entity);
2981 return Nodes.Table (N + 2).Flag14;
2984 function Flag57 (N : Node_Id) return Boolean is
2986 pragma Assert (Nkind (N) in N_Entity);
2987 return Nodes.Table (N + 2).Flag15;
2990 function Flag58 (N : Node_Id) return Boolean is
2992 pragma Assert (Nkind (N) in N_Entity);
2993 return Nodes.Table (N + 2).Flag16;
2996 function Flag59 (N : Node_Id) return Boolean is
2998 pragma Assert (Nkind (N) in N_Entity);
2999 return Nodes.Table (N + 2).Flag17;
3002 function Flag60 (N : Node_Id) return Boolean is
3004 pragma Assert (Nkind (N) in N_Entity);
3005 return Nodes.Table (N + 2).Flag18;
3008 function Flag61 (N : Node_Id) return Boolean is
3010 pragma Assert (Nkind (N) in N_Entity);
3011 return Nodes.Table (N + 1).Pflag1;
3014 function Flag62 (N : Node_Id) return Boolean is
3016 pragma Assert (Nkind (N) in N_Entity);
3017 return Nodes.Table (N + 1).Pflag2;
3020 function Flag63 (N : Node_Id) return Boolean is
3022 pragma Assert (Nkind (N) in N_Entity);
3023 return Nodes.Table (N + 2).Pflag1;
3026 function Flag64 (N : Node_Id) return Boolean is
3028 pragma Assert (Nkind (N) in N_Entity);
3029 return Nodes.Table (N + 2).Pflag2;
3032 function Flag65 (N : Node_Id) return Boolean is
3034 pragma Assert (Nkind (N) in N_Entity);
3035 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag65;
3038 function Flag66 (N : Node_Id) return Boolean is
3040 pragma Assert (Nkind (N) in N_Entity);
3041 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag66;
3044 function Flag67 (N : Node_Id) return Boolean is
3046 pragma Assert (Nkind (N) in N_Entity);
3047 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag67;
3050 function Flag68 (N : Node_Id) return Boolean is
3052 pragma Assert (Nkind (N) in N_Entity);
3053 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag68;
3056 function Flag69 (N : Node_Id) return Boolean is
3058 pragma Assert (Nkind (N) in N_Entity);
3059 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag69;
3062 function Flag70 (N : Node_Id) return Boolean is
3064 pragma Assert (Nkind (N) in N_Entity);
3065 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag70;
3068 function Flag71 (N : Node_Id) return Boolean is
3070 pragma Assert (Nkind (N) in N_Entity);
3071 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag71;
3074 function Flag72 (N : Node_Id) return Boolean is
3076 pragma Assert (Nkind (N) in N_Entity);
3077 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag72;
3080 function Flag73 (N : Node_Id) return Boolean is
3082 pragma Assert (Nkind (N) in N_Entity);
3083 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag73;
3086 function Flag74 (N : Node_Id) return Boolean is
3088 pragma Assert (Nkind (N) in N_Entity);
3089 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag74;
3092 function Flag75 (N : Node_Id) return Boolean is
3094 pragma Assert (Nkind (N) in N_Entity);
3095 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag75;
3098 function Flag76 (N : Node_Id) return Boolean is
3100 pragma Assert (Nkind (N) in N_Entity);
3101 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag76;
3104 function Flag77 (N : Node_Id) return Boolean is
3106 pragma Assert (Nkind (N) in N_Entity);
3107 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag77;
3110 function Flag78 (N : Node_Id) return Boolean is
3112 pragma Assert (Nkind (N) in N_Entity);
3113 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag78;
3116 function Flag79 (N : Node_Id) return Boolean is
3118 pragma Assert (Nkind (N) in N_Entity);
3119 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag79;
3122 function Flag80 (N : Node_Id) return Boolean is
3124 pragma Assert (Nkind (N) in N_Entity);
3125 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag80;
3128 function Flag81 (N : Node_Id) return Boolean is
3130 pragma Assert (Nkind (N) in N_Entity);
3131 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag81;
3134 function Flag82 (N : Node_Id) return Boolean is
3136 pragma Assert (Nkind (N) in N_Entity);
3137 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag82;
3140 function Flag83 (N : Node_Id) return Boolean is
3142 pragma Assert (Nkind (N) in N_Entity);
3143 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag83;
3146 function Flag84 (N : Node_Id) return Boolean is
3148 pragma Assert (Nkind (N) in N_Entity);
3149 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag84;
3152 function Flag85 (N : Node_Id) return Boolean is
3154 pragma Assert (Nkind (N) in N_Entity);
3155 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag85;
3158 function Flag86 (N : Node_Id) return Boolean is
3160 pragma Assert (Nkind (N) in N_Entity);
3161 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag86;
3164 function Flag87 (N : Node_Id) return Boolean is
3166 pragma Assert (Nkind (N) in N_Entity);
3167 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag87;
3170 function Flag88 (N : Node_Id) return Boolean is
3172 pragma Assert (Nkind (N) in N_Entity);
3173 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag88;
3176 function Flag89 (N : Node_Id) return Boolean is
3178 pragma Assert (Nkind (N) in N_Entity);
3179 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag89;
3182 function Flag90 (N : Node_Id) return Boolean is
3184 pragma Assert (Nkind (N) in N_Entity);
3185 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag90;
3188 function Flag91 (N : Node_Id) return Boolean is
3190 pragma Assert (Nkind (N) in N_Entity);
3191 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag91;
3194 function Flag92 (N : Node_Id) return Boolean is
3196 pragma Assert (Nkind (N) in N_Entity);
3197 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag92;
3200 function Flag93 (N : Node_Id) return Boolean is
3202 pragma Assert (Nkind (N) in N_Entity);
3203 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag93;
3206 function Flag94 (N : Node_Id) return Boolean is
3208 pragma Assert (Nkind (N) in N_Entity);
3209 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag94;
3212 function Flag95 (N : Node_Id) return Boolean is
3214 pragma Assert (Nkind (N) in N_Entity);
3215 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag95;
3218 function Flag96 (N : Node_Id) return Boolean is
3220 pragma Assert (Nkind (N) in N_Entity);
3221 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag96;
3224 function Flag97 (N : Node_Id) return Boolean is
3226 pragma Assert (Nkind (N) in N_Entity);
3227 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag97;
3230 function Flag98 (N : Node_Id) return Boolean is
3232 pragma Assert (Nkind (N) in N_Entity);
3233 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag98;
3236 function Flag99 (N : Node_Id) return Boolean is
3238 pragma Assert (Nkind (N) in N_Entity);
3239 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag99;
3242 function Flag100 (N : Node_Id) return Boolean is
3244 pragma Assert (Nkind (N) in N_Entity);
3245 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag100;
3248 function Flag101 (N : Node_Id) return Boolean is
3250 pragma Assert (Nkind (N) in N_Entity);
3251 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag101;
3254 function Flag102 (N : Node_Id) return Boolean is
3256 pragma Assert (Nkind (N) in N_Entity);
3257 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag102;
3260 function Flag103 (N : Node_Id) return Boolean is
3262 pragma Assert (Nkind (N) in N_Entity);
3263 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag103;
3266 function Flag104 (N : Node_Id) return Boolean is
3268 pragma Assert (Nkind (N) in N_Entity);
3269 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag104;
3272 function Flag105 (N : Node_Id) return Boolean is
3274 pragma Assert (Nkind (N) in N_Entity);
3275 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag105;
3278 function Flag106 (N : Node_Id) return Boolean is
3280 pragma Assert (Nkind (N) in N_Entity);
3281 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag106;
3284 function Flag107 (N : Node_Id) return Boolean is
3286 pragma Assert (Nkind (N) in N_Entity);
3287 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag107;
3290 function Flag108 (N : Node_Id) return Boolean is
3292 pragma Assert (Nkind (N) in N_Entity);
3293 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag108;
3296 function Flag109 (N : Node_Id) return Boolean is
3298 pragma Assert (Nkind (N) in N_Entity);
3299 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag109;
3302 function Flag110 (N : Node_Id) return Boolean is
3304 pragma Assert (Nkind (N) in N_Entity);
3305 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag110;
3308 function Flag111 (N : Node_Id) return Boolean is
3310 pragma Assert (Nkind (N) in N_Entity);
3311 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag111;
3314 function Flag112 (N : Node_Id) return Boolean is
3316 pragma Assert (Nkind (N) in N_Entity);
3317 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag112;
3320 function Flag113 (N : Node_Id) return Boolean is
3322 pragma Assert (Nkind (N) in N_Entity);
3323 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag113;
3326 function Flag114 (N : Node_Id) return Boolean is
3328 pragma Assert (Nkind (N) in N_Entity);
3329 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag114;
3332 function Flag115 (N : Node_Id) return Boolean is
3334 pragma Assert (Nkind (N) in N_Entity);
3335 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag115;
3338 function Flag116 (N : Node_Id) return Boolean is
3340 pragma Assert (Nkind (N) in N_Entity);
3341 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag116;
3344 function Flag117 (N : Node_Id) return Boolean is
3346 pragma Assert (Nkind (N) in N_Entity);
3347 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag117;
3350 function Flag118 (N : Node_Id) return Boolean is
3352 pragma Assert (Nkind (N) in N_Entity);
3353 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag118;
3356 function Flag119 (N : Node_Id) return Boolean is
3358 pragma Assert (Nkind (N) in N_Entity);
3359 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag119;
3362 function Flag120 (N : Node_Id) return Boolean is
3364 pragma Assert (Nkind (N) in N_Entity);
3365 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag120;
3368 function Flag121 (N : Node_Id) return Boolean is
3370 pragma Assert (Nkind (N) in N_Entity);
3371 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag121;
3374 function Flag122 (N : Node_Id) return Boolean is
3376 pragma Assert (Nkind (N) in N_Entity);
3377 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag122;
3380 function Flag123 (N : Node_Id) return Boolean is
3382 pragma Assert (Nkind (N) in N_Entity);
3383 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag123;
3386 function Flag124 (N : Node_Id) return Boolean is
3388 pragma Assert (Nkind (N) in N_Entity);
3389 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag124;
3392 function Flag125 (N : Node_Id) return Boolean is
3394 pragma Assert (Nkind (N) in N_Entity);
3395 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag125;
3398 function Flag126 (N : Node_Id) return Boolean is
3400 pragma Assert (Nkind (N) in N_Entity);
3401 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag126;
3404 function Flag127 (N : Node_Id) return Boolean is
3406 pragma Assert (Nkind (N) in N_Entity);
3407 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag127;
3410 function Flag128 (N : Node_Id) return Boolean is
3412 pragma Assert (Nkind (N) in N_Entity);
3413 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag128;
3416 function Flag129 (N : Node_Id) return Boolean is
3418 pragma Assert (Nkind (N) in N_Entity);
3419 return Nodes.Table (N + 3).In_List;
3422 function Flag130 (N : Node_Id) return Boolean is
3424 pragma Assert (Nkind (N) in N_Entity);
3425 return Nodes.Table (N + 3).Unused_1;
3428 function Flag131 (N : Node_Id) return Boolean is
3430 pragma Assert (Nkind (N) in N_Entity);
3431 return Nodes.Table (N + 3).Rewrite_Ins;
3434 function Flag132 (N : Node_Id) return Boolean is
3436 pragma Assert (Nkind (N) in N_Entity);
3437 return Nodes.Table (N + 3).Analyzed;
3440 function Flag133 (N : Node_Id) return Boolean is
3442 pragma Assert (Nkind (N) in N_Entity);
3443 return Nodes.Table (N + 3).Comes_From_Source;
3446 function Flag134 (N : Node_Id) return Boolean is
3448 pragma Assert (Nkind (N) in N_Entity);
3449 return Nodes.Table (N + 3).Error_Posted;
3452 function Flag135 (N : Node_Id) return Boolean is
3454 pragma Assert (Nkind (N) in N_Entity);
3455 return Nodes.Table (N + 3).Flag4;
3458 function Flag136 (N : Node_Id) return Boolean is
3460 pragma Assert (Nkind (N) in N_Entity);
3461 return Nodes.Table (N + 3).Flag5;
3464 function Flag137 (N : Node_Id) return Boolean is
3466 pragma Assert (Nkind (N) in N_Entity);
3467 return Nodes.Table (N + 3).Flag6;
3470 function Flag138 (N : Node_Id) return Boolean is
3472 pragma Assert (Nkind (N) in N_Entity);
3473 return Nodes.Table (N + 3).Flag7;
3476 function Flag139 (N : Node_Id) return Boolean is
3478 pragma Assert (Nkind (N) in N_Entity);
3479 return Nodes.Table (N + 3).Flag8;
3482 function Flag140 (N : Node_Id) return Boolean is
3484 pragma Assert (Nkind (N) in N_Entity);
3485 return Nodes.Table (N + 3).Flag9;
3488 function Flag141 (N : Node_Id) return Boolean is
3490 pragma Assert (Nkind (N) in N_Entity);
3491 return Nodes.Table (N + 3).Flag10;
3494 function Flag142 (N : Node_Id) return Boolean is
3496 pragma Assert (Nkind (N) in N_Entity);
3497 return Nodes.Table (N + 3).Flag11;
3500 function Flag143 (N : Node_Id) return Boolean is
3502 pragma Assert (Nkind (N) in N_Entity);
3503 return Nodes.Table (N + 3).Flag12;
3506 function Flag144 (N : Node_Id) return Boolean is
3508 pragma Assert (Nkind (N) in N_Entity);
3509 return Nodes.Table (N + 3).Flag13;
3512 function Flag145 (N : Node_Id) return Boolean is
3514 pragma Assert (Nkind (N) in N_Entity);
3515 return Nodes.Table (N + 3).Flag14;
3518 function Flag146 (N : Node_Id) return Boolean is
3520 pragma Assert (Nkind (N) in N_Entity);
3521 return Nodes.Table (N + 3).Flag15;
3524 function Flag147 (N : Node_Id) return Boolean is
3526 pragma Assert (Nkind (N) in N_Entity);
3527 return Nodes.Table (N + 3).Flag16;
3530 function Flag148 (N : Node_Id) return Boolean is
3532 pragma Assert (Nkind (N) in N_Entity);
3533 return Nodes.Table (N + 3).Flag17;
3536 function Flag149 (N : Node_Id) return Boolean is
3538 pragma Assert (Nkind (N) in N_Entity);
3539 return Nodes.Table (N + 3).Flag18;
3542 function Flag150 (N : Node_Id) return Boolean is
3544 pragma Assert (Nkind (N) in N_Entity);
3545 return Nodes.Table (N + 3).Pflag1;
3548 function Flag151 (N : Node_Id) return Boolean is
3550 pragma Assert (Nkind (N) in N_Entity);
3551 return Nodes.Table (N + 3).Pflag2;
3554 function Flag152 (N : Node_Id) return Boolean is
3556 pragma Assert (Nkind (N) in N_Entity);
3557 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag152;
3560 function Flag153 (N : Node_Id) return Boolean is
3562 pragma Assert (Nkind (N) in N_Entity);
3563 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag153;
3566 function Flag154 (N : Node_Id) return Boolean is
3568 pragma Assert (Nkind (N) in N_Entity);
3569 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag154;
3572 function Flag155 (N : Node_Id) return Boolean is
3574 pragma Assert (Nkind (N) in N_Entity);
3575 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag155;
3578 function Flag156 (N : Node_Id) return Boolean is
3580 pragma Assert (Nkind (N) in N_Entity);
3581 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag156;
3584 function Flag157 (N : Node_Id) return Boolean is
3586 pragma Assert (Nkind (N) in N_Entity);
3587 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag157;
3590 function Flag158 (N : Node_Id) return Boolean is
3592 pragma Assert (Nkind (N) in N_Entity);
3593 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag158;
3596 function Flag159 (N : Node_Id) return Boolean is
3598 pragma Assert (Nkind (N) in N_Entity);
3599 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag159;
3602 function Flag160 (N : Node_Id) return Boolean is
3604 pragma Assert (Nkind (N) in N_Entity);
3605 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag160;
3608 function Flag161 (N : Node_Id) return Boolean is
3610 pragma Assert (Nkind (N) in N_Entity);
3611 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag161;
3614 function Flag162 (N : Node_Id) return Boolean is
3616 pragma Assert (Nkind (N) in N_Entity);
3617 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag162;
3620 function Flag163 (N : Node_Id) return Boolean is
3622 pragma Assert (Nkind (N) in N_Entity);
3623 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag163;
3626 function Flag164 (N : Node_Id) return Boolean is
3628 pragma Assert (Nkind (N) in N_Entity);
3629 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag164;
3632 function Flag165 (N : Node_Id) return Boolean is
3634 pragma Assert (Nkind (N) in N_Entity);
3635 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag165;
3638 function Flag166 (N : Node_Id) return Boolean is
3640 pragma Assert (Nkind (N) in N_Entity);
3641 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag166;
3644 function Flag167 (N : Node_Id) return Boolean is
3646 pragma Assert (Nkind (N) in N_Entity);
3647 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag167;
3650 function Flag168 (N : Node_Id) return Boolean is
3652 pragma Assert (Nkind (N) in N_Entity);
3653 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag168;
3656 function Flag169 (N : Node_Id) return Boolean is
3658 pragma Assert (Nkind (N) in N_Entity);
3659 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag169;
3662 function Flag170 (N : Node_Id) return Boolean is
3664 pragma Assert (Nkind (N) in N_Entity);
3665 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag170;
3668 function Flag171 (N : Node_Id) return Boolean is
3670 pragma Assert (Nkind (N) in N_Entity);
3671 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag171;
3674 function Flag172 (N : Node_Id) return Boolean is
3676 pragma Assert (Nkind (N) in N_Entity);
3677 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag172;
3680 function Flag173 (N : Node_Id) return Boolean is
3682 pragma Assert (Nkind (N) in N_Entity);
3683 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag173;
3686 function Flag174 (N : Node_Id) return Boolean is
3688 pragma Assert (Nkind (N) in N_Entity);
3689 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag174;
3692 function Flag175 (N : Node_Id) return Boolean is
3694 pragma Assert (Nkind (N) in N_Entity);
3695 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag175;
3698 function Flag176 (N : Node_Id) return Boolean is
3700 pragma Assert (Nkind (N) in N_Entity);
3701 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag176;
3704 function Flag177 (N : Node_Id) return Boolean is
3706 pragma Assert (Nkind (N) in N_Entity);
3707 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag177;
3710 function Flag178 (N : Node_Id) return Boolean is
3712 pragma Assert (Nkind (N) in N_Entity);
3713 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag178;
3716 function Flag179 (N : Node_Id) return Boolean is
3718 pragma Assert (Nkind (N) in N_Entity);
3719 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag179;
3722 function Flag180 (N : Node_Id) return Boolean is
3724 pragma Assert (Nkind (N) in N_Entity);
3725 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag180;
3728 function Flag181 (N : Node_Id) return Boolean is
3730 pragma Assert (Nkind (N) in N_Entity);
3731 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag181;
3734 function Flag182 (N : Node_Id) return Boolean is
3736 pragma Assert (Nkind (N) in N_Entity);
3737 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag182;
3740 function Flag183 (N : Node_Id) return Boolean is
3742 pragma Assert (Nkind (N) in N_Entity);
3743 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag183;
3746 function Flag184 (N : Node_Id) return Boolean is
3748 pragma Assert (Nkind (N) in N_Entity);
3749 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag184;
3752 function Flag185 (N : Node_Id) return Boolean is
3754 pragma Assert (Nkind (N) in N_Entity);
3755 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag185;
3758 function Flag186 (N : Node_Id) return Boolean is
3760 pragma Assert (Nkind (N) in N_Entity);
3761 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag186;
3764 function Flag187 (N : Node_Id) return Boolean is
3766 pragma Assert (Nkind (N) in N_Entity);
3767 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag187;
3770 function Flag188 (N : Node_Id) return Boolean is
3772 pragma Assert (Nkind (N) in N_Entity);
3773 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag188;
3776 function Flag189 (N : Node_Id) return Boolean is
3778 pragma Assert (Nkind (N) in N_Entity);
3779 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag189;
3782 function Flag190 (N : Node_Id) return Boolean is
3784 pragma Assert (Nkind (N) in N_Entity);
3785 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag190;
3788 function Flag191 (N : Node_Id) return Boolean is
3790 pragma Assert (Nkind (N) in N_Entity);
3791 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag191;
3794 function Flag192 (N : Node_Id) return Boolean is
3796 pragma Assert (Nkind (N) in N_Entity);
3797 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag192;
3800 function Flag193 (N : Node_Id) return Boolean is
3802 pragma Assert (Nkind (N) in N_Entity);
3803 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag193;
3806 function Flag194 (N : Node_Id) return Boolean is
3808 pragma Assert (Nkind (N) in N_Entity);
3809 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag194;
3812 function Flag195 (N : Node_Id) return Boolean is
3814 pragma Assert (Nkind (N) in N_Entity);
3815 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag195;
3818 function Flag196 (N : Node_Id) return Boolean is
3820 pragma Assert (Nkind (N) in N_Entity);
3821 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag196;
3824 function Flag197 (N : Node_Id) return Boolean is
3826 pragma Assert (Nkind (N) in N_Entity);
3827 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag197;
3830 function Flag198 (N : Node_Id) return Boolean is
3832 pragma Assert (Nkind (N) in N_Entity);
3833 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag198;
3836 function Flag199 (N : Node_Id) return Boolean is
3838 pragma Assert (Nkind (N) in N_Entity);
3839 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag199;
3842 function Flag200 (N : Node_Id) return Boolean is
3844 pragma Assert (Nkind (N) in N_Entity);
3845 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag200;
3848 function Flag201 (N : Node_Id) return Boolean is
3850 pragma Assert (Nkind (N) in N_Entity);
3851 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag201;
3854 function Flag202 (N : Node_Id) return Boolean is
3856 pragma Assert (Nkind (N) in N_Entity);
3857 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag202;
3860 function Flag203 (N : Node_Id) return Boolean is
3862 pragma Assert (Nkind (N) in N_Entity);
3863 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag203;
3866 function Flag204 (N : Node_Id) return Boolean is
3868 pragma Assert (Nkind (N) in N_Entity);
3869 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag204;
3872 function Flag205 (N : Node_Id) return Boolean is
3874 pragma Assert (Nkind (N) in N_Entity);
3875 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag205;
3878 function Flag206 (N : Node_Id) return Boolean is
3880 pragma Assert (Nkind (N) in N_Entity);
3881 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag206;
3884 function Flag207 (N : Node_Id) return Boolean is
3886 pragma Assert (Nkind (N) in N_Entity);
3887 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag207;
3890 function Flag208 (N : Node_Id) return Boolean is
3892 pragma Assert (Nkind (N) in N_Entity);
3893 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag208;
3896 function Flag209 (N : Node_Id) return Boolean is
3898 pragma Assert (Nkind (N) in N_Entity);
3899 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag209;
3902 function Flag210 (N : Node_Id) return Boolean is
3904 pragma Assert (Nkind (N) in N_Entity);
3905 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag210;
3908 function Flag211 (N : Node_Id) return Boolean is
3910 pragma Assert (Nkind (N) in N_Entity);
3911 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag211;
3914 function Flag212 (N : Node_Id) return Boolean is
3916 pragma Assert (Nkind (N) in N_Entity);
3917 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag212;
3920 function Flag213 (N : Node_Id) return Boolean is
3922 pragma Assert (Nkind (N) in N_Entity);
3923 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag213;
3926 function Flag214 (N : Node_Id) return Boolean is
3928 pragma Assert (Nkind (N) in N_Entity);
3929 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag214;
3932 function Flag215 (N : Node_Id) return Boolean is
3934 pragma Assert (Nkind (N) in N_Entity);
3935 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag215;
3938 function Flag216 (N : Node_Id) return Boolean is
3940 pragma Assert (Nkind (N) in N_Entity);
3941 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag216;
3944 function Flag217 (N : Node_Id) return Boolean is
3946 pragma Assert (Nkind (N) in N_Entity);
3947 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag217;
3950 function Flag218 (N : Node_Id) return Boolean is
3952 pragma Assert (Nkind (N) in N_Entity);
3953 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag218;
3956 function Flag219 (N : Node_Id) return Boolean is
3958 pragma Assert (Nkind (N) in N_Entity);
3959 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag219;
3962 function Flag220 (N : Node_Id) return Boolean is
3964 pragma Assert (Nkind (N) in N_Entity);
3965 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag220;
3968 function Flag221 (N : Node_Id) return Boolean is
3970 pragma Assert (Nkind (N) in N_Entity);
3971 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag221;
3974 function Flag222 (N : Node_Id) return Boolean is
3976 pragma Assert (Nkind (N) in N_Entity);
3977 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag222;
3980 function Flag223 (N : Node_Id) return Boolean is
3982 pragma Assert (Nkind (N) in N_Entity);
3983 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag223;
3986 function Flag224 (N : Node_Id) return Boolean is
3988 pragma Assert (Nkind (N) in N_Entity);
3989 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag224;
3992 function Flag225 (N : Node_Id) return Boolean is
3994 pragma Assert (Nkind (N) in N_Entity);
3995 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag225;
3998 function Flag226 (N : Node_Id) return Boolean is
4000 pragma Assert (Nkind (N) in N_Entity);
4001 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag226;
4004 function Flag227 (N : Node_Id) return Boolean is
4006 pragma Assert (Nkind (N) in N_Entity);
4007 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag227;
4010 function Flag228 (N : Node_Id) return Boolean is
4012 pragma Assert (Nkind (N) in N_Entity);
4013 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag228;
4016 function Flag229 (N : Node_Id) return Boolean is
4018 pragma Assert (Nkind (N) in N_Entity);
4019 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag229;
4022 function Flag230 (N : Node_Id) return Boolean is
4024 pragma Assert (Nkind (N) in N_Entity);
4025 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag230;
4028 function Flag231 (N : Node_Id) return Boolean is
4030 pragma Assert (Nkind (N) in N_Entity);
4031 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag231;
4034 function Flag232 (N : Node_Id) return Boolean is
4036 pragma Assert (Nkind (N) in N_Entity);
4037 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag232;
4040 function Flag233 (N : Node_Id) return Boolean is
4042 pragma Assert (Nkind (N) in N_Entity);
4043 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag233;
4046 function Flag234 (N : Node_Id) return Boolean is
4048 pragma Assert (Nkind (N) in N_Entity);
4049 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag234;
4052 function Flag235 (N : Node_Id) return Boolean is
4054 pragma Assert (Nkind (N) in N_Entity);
4055 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag235;
4058 function Flag236 (N : Node_Id) return Boolean is
4060 pragma Assert (Nkind (N) in N_Entity);
4061 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag236;
4064 function Flag237 (N : Node_Id) return Boolean is
4066 pragma Assert (Nkind (N) in N_Entity);
4067 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag237;
4070 function Flag238 (N : Node_Id) return Boolean is
4072 pragma Assert (Nkind (N) in N_Entity);
4073 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag238;
4076 function Flag239 (N : Node_Id) return Boolean is
4078 pragma Assert (Nkind (N) in N_Entity);
4079 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag239;
4082 function Flag240 (N : Node_Id) return Boolean is
4084 pragma Assert (Nkind (N) in N_Entity);
4085 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag240;
4088 function Flag241 (N : Node_Id) return Boolean is
4090 pragma Assert (Nkind (N) in N_Entity);
4091 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag241;
4094 function Flag242 (N : Node_Id) return Boolean is
4096 pragma Assert (Nkind (N) in N_Entity);
4097 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag242;
4100 function Flag243 (N : Node_Id) return Boolean is
4102 pragma Assert (Nkind (N) in N_Entity);
4103 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag243;
4106 function Flag244 (N : Node_Id) return Boolean is
4108 pragma Assert (Nkind (N) in N_Entity);
4109 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag244;
4112 function Flag245 (N : Node_Id) return Boolean is
4114 pragma Assert (Nkind (N) in N_Entity);
4115 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag245;
4118 function Flag246 (N : Node_Id) return Boolean is
4120 pragma Assert (Nkind (N) in N_Entity);
4121 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag246;
4124 function Flag247 (N : Node_Id) return Boolean is
4126 pragma Assert (Nkind (N) in N_Entity);
4127 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag247;
4130 procedure Set_Nkind (N : Node_Id; Val : Node_Kind) is
4132 pragma Assert (N <= Nodes.Last);
4133 Nodes.Table (N).Nkind := Val;
4136 procedure Set_Field1 (N : Node_Id; Val : Union_Id) is
4138 pragma Assert (N <= Nodes.Last);
4139 Nodes.Table (N).Field1 := Val;
4142 procedure Set_Field2 (N : Node_Id; Val : Union_Id) is
4144 pragma Assert (N <= Nodes.Last);
4145 Nodes.Table (N).Field2 := Val;
4148 procedure Set_Field3 (N : Node_Id; Val : Union_Id) is
4150 pragma Assert (N <= Nodes.Last);
4151 Nodes.Table (N).Field3 := Val;
4154 procedure Set_Field4 (N : Node_Id; Val : Union_Id) is
4156 pragma Assert (N <= Nodes.Last);
4157 Nodes.Table (N).Field4 := Val;
4160 procedure Set_Field5 (N : Node_Id; Val : Union_Id) is
4162 pragma Assert (N <= Nodes.Last);
4163 Nodes.Table (N).Field5 := Val;
4166 procedure Set_Field6 (N : Node_Id; Val : Union_Id) is
4168 pragma Assert (Nkind (N) in N_Entity);
4169 Nodes.Table (N + 1).Field6 := Val;
4172 procedure Set_Field7 (N : Node_Id; Val : Union_Id) is
4174 pragma Assert (Nkind (N) in N_Entity);
4175 Nodes.Table (N + 1).Field7 := Val;
4178 procedure Set_Field8 (N : Node_Id; Val : Union_Id) is
4180 pragma Assert (Nkind (N) in N_Entity);
4181 Nodes.Table (N + 1).Field8 := Val;
4184 procedure Set_Field9 (N : Node_Id; Val : Union_Id) is
4186 pragma Assert (Nkind (N) in N_Entity);
4187 Nodes.Table (N + 1).Field9 := Val;
4190 procedure Set_Field10 (N : Node_Id; Val : Union_Id) is
4192 pragma Assert (Nkind (N) in N_Entity);
4193 Nodes.Table (N + 1).Field10 := Val;
4196 procedure Set_Field11 (N : Node_Id; Val : Union_Id) is
4198 pragma Assert (Nkind (N) in N_Entity);
4199 Nodes.Table (N + 1).Field11 := Val;
4202 procedure Set_Field12 (N : Node_Id; Val : Union_Id) is
4204 pragma Assert (Nkind (N) in N_Entity);
4205 Nodes.Table (N + 1).Field12 := Val;
4208 procedure Set_Field13 (N : Node_Id; Val : Union_Id) is
4210 pragma Assert (Nkind (N) in N_Entity);
4211 Nodes.Table (N + 2).Field6 := Val;
4214 procedure Set_Field14 (N : Node_Id; Val : Union_Id) is
4216 pragma Assert (Nkind (N) in N_Entity);
4217 Nodes.Table (N + 2).Field7 := Val;
4220 procedure Set_Field15 (N : Node_Id; Val : Union_Id) is
4222 pragma Assert (Nkind (N) in N_Entity);
4223 Nodes.Table (N + 2).Field8 := Val;
4226 procedure Set_Field16 (N : Node_Id; Val : Union_Id) is
4228 pragma Assert (Nkind (N) in N_Entity);
4229 Nodes.Table (N + 2).Field9 := Val;
4232 procedure Set_Field17 (N : Node_Id; Val : Union_Id) is
4234 pragma Assert (Nkind (N) in N_Entity);
4235 Nodes.Table (N + 2).Field10 := Val;
4238 procedure Set_Field18 (N : Node_Id; Val : Union_Id) is
4240 pragma Assert (Nkind (N) in N_Entity);
4241 Nodes.Table (N + 2).Field11 := Val;
4244 procedure Set_Field19 (N : Node_Id; Val : Union_Id) is
4246 pragma Assert (Nkind (N) in N_Entity);
4247 Nodes.Table (N + 3).Field6 := Val;
4250 procedure Set_Field20 (N : Node_Id; Val : Union_Id) is
4252 pragma Assert (Nkind (N) in N_Entity);
4253 Nodes.Table (N + 3).Field7 := Val;
4256 procedure Set_Field21 (N : Node_Id; Val : Union_Id) is
4258 pragma Assert (Nkind (N) in N_Entity);
4259 Nodes.Table (N + 3).Field8 := Val;
4262 procedure Set_Field22 (N : Node_Id; Val : Union_Id) is
4264 pragma Assert (Nkind (N) in N_Entity);
4265 Nodes.Table (N + 3).Field9 := Val;
4268 procedure Set_Field23 (N : Node_Id; Val : Union_Id) is
4270 pragma Assert (Nkind (N) in N_Entity);
4271 Nodes.Table (N + 3).Field10 := Val;
4274 procedure Set_Field24 (N : Node_Id; Val : Union_Id) is
4276 pragma Assert (Nkind (N) in N_Entity);
4277 Nodes.Table (N + 4).Field6 := Val;
4280 procedure Set_Field25 (N : Node_Id; Val : Union_Id) is
4282 pragma Assert (Nkind (N) in N_Entity);
4283 Nodes.Table (N + 4).Field7 := Val;
4286 procedure Set_Field26 (N : Node_Id; Val : Union_Id) is
4288 pragma Assert (Nkind (N) in N_Entity);
4289 Nodes.Table (N + 4).Field8 := Val;
4292 procedure Set_Field27 (N : Node_Id; Val : Union_Id) is
4294 pragma Assert (Nkind (N) in N_Entity);
4295 Nodes.Table (N + 4).Field9 := Val;
4298 procedure Set_Field28 (N : Node_Id; Val : Union_Id) is
4300 pragma Assert (Nkind (N) in N_Entity);
4301 Nodes.Table (N + 4).Field10 := Val;
4304 procedure Set_Node1 (N : Node_Id; Val : Node_Id) is
4306 pragma Assert (N <= Nodes.Last);
4307 Nodes.Table (N).Field1 := Union_Id (Val);
4310 procedure Set_Node2 (N : Node_Id; Val : Node_Id) is
4312 pragma Assert (N <= Nodes.Last);
4313 Nodes.Table (N).Field2 := Union_Id (Val);
4316 procedure Set_Node3 (N : Node_Id; Val : Node_Id) is
4318 pragma Assert (N <= Nodes.Last);
4319 Nodes.Table (N).Field3 := Union_Id (Val);
4322 procedure Set_Node4 (N : Node_Id; Val : Node_Id) is
4324 pragma Assert (N <= Nodes.Last);
4325 Nodes.Table (N).Field4 := Union_Id (Val);
4328 procedure Set_Node5 (N : Node_Id; Val : Node_Id) is
4330 pragma Assert (N <= Nodes.Last);
4331 Nodes.Table (N).Field5 := Union_Id (Val);
4334 procedure Set_Node6 (N : Node_Id; Val : Node_Id) is
4336 pragma Assert (Nkind (N) in N_Entity);
4337 Nodes.Table (N + 1).Field6 := Union_Id (Val);
4340 procedure Set_Node7 (N : Node_Id; Val : Node_Id) is
4342 pragma Assert (Nkind (N) in N_Entity);
4343 Nodes.Table (N + 1).Field7 := Union_Id (Val);
4346 procedure Set_Node8 (N : Node_Id; Val : Node_Id) is
4348 pragma Assert (Nkind (N) in N_Entity);
4349 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4352 procedure Set_Node9 (N : Node_Id; Val : Node_Id) is
4354 pragma Assert (Nkind (N) in N_Entity);
4355 Nodes.Table (N + 1).Field9 := Union_Id (Val);
4358 procedure Set_Node10 (N : Node_Id; Val : Node_Id) is
4360 pragma Assert (Nkind (N) in N_Entity);
4361 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4364 procedure Set_Node11 (N : Node_Id; Val : Node_Id) is
4366 pragma Assert (Nkind (N) in N_Entity);
4367 Nodes.Table (N + 1).Field11 := Union_Id (Val);
4370 procedure Set_Node12 (N : Node_Id; Val : Node_Id) is
4372 pragma Assert (Nkind (N) in N_Entity);
4373 Nodes.Table (N + 1).Field12 := Union_Id (Val);
4376 procedure Set_Node13 (N : Node_Id; Val : Node_Id) is
4378 pragma Assert (Nkind (N) in N_Entity);
4379 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4382 procedure Set_Node14 (N : Node_Id; Val : Node_Id) is
4384 pragma Assert (Nkind (N) in N_Entity);
4385 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4388 procedure Set_Node15 (N : Node_Id; Val : Node_Id) is
4390 pragma Assert (Nkind (N) in N_Entity);
4391 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4394 procedure Set_Node16 (N : Node_Id; Val : Node_Id) is
4396 pragma Assert (Nkind (N) in N_Entity);
4397 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4400 procedure Set_Node17 (N : Node_Id; Val : Node_Id) is
4402 pragma Assert (Nkind (N) in N_Entity);
4403 Nodes.Table (N + 2).Field10 := Union_Id (Val);
4406 procedure Set_Node18 (N : Node_Id; Val : Node_Id) is
4408 pragma Assert (Nkind (N) in N_Entity);
4409 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4412 procedure Set_Node19 (N : Node_Id; Val : Node_Id) is
4414 pragma Assert (Nkind (N) in N_Entity);
4415 Nodes.Table (N + 3).Field6 := Union_Id (Val);
4418 procedure Set_Node20 (N : Node_Id; Val : Node_Id) is
4420 pragma Assert (Nkind (N) in N_Entity);
4421 Nodes.Table (N + 3).Field7 := Union_Id (Val);
4424 procedure Set_Node21 (N : Node_Id; Val : Node_Id) is
4426 pragma Assert (Nkind (N) in N_Entity);
4427 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4430 procedure Set_Node22 (N : Node_Id; Val : Node_Id) is
4432 pragma Assert (Nkind (N) in N_Entity);
4433 Nodes.Table (N + 3).Field9 := Union_Id (Val);
4436 procedure Set_Node23 (N : Node_Id; Val : Node_Id) is
4438 pragma Assert (Nkind (N) in N_Entity);
4439 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4442 procedure Set_Node24 (N : Node_Id; Val : Node_Id) is
4444 pragma Assert (Nkind (N) in N_Entity);
4445 Nodes.Table (N + 4).Field6 := Union_Id (Val);
4448 procedure Set_Node25 (N : Node_Id; Val : Node_Id) is
4450 pragma Assert (Nkind (N) in N_Entity);
4451 Nodes.Table (N + 4).Field7 := Union_Id (Val);
4454 procedure Set_Node26 (N : Node_Id; Val : Node_Id) is
4456 pragma Assert (Nkind (N) in N_Entity);
4457 Nodes.Table (N + 4).Field8 := Union_Id (Val);
4460 procedure Set_Node27 (N : Node_Id; Val : Node_Id) is
4462 pragma Assert (Nkind (N) in N_Entity);
4463 Nodes.Table (N + 4).Field9 := Union_Id (Val);
4466 procedure Set_Node28 (N : Node_Id; Val : Node_Id) is
4468 pragma Assert (Nkind (N) in N_Entity);
4469 Nodes.Table (N + 4).Field10 := Union_Id (Val);
4472 procedure Set_List1 (N : Node_Id; Val : List_Id) is
4474 pragma Assert (N <= Nodes.Last);
4475 Nodes.Table (N).Field1 := Union_Id (Val);
4478 procedure Set_List2 (N : Node_Id; Val : List_Id) is
4480 pragma Assert (N <= Nodes.Last);
4481 Nodes.Table (N).Field2 := Union_Id (Val);
4484 procedure Set_List3 (N : Node_Id; Val : List_Id) is
4486 pragma Assert (N <= Nodes.Last);
4487 Nodes.Table (N).Field3 := Union_Id (Val);
4490 procedure Set_List4 (N : Node_Id; Val : List_Id) is
4492 pragma Assert (N <= Nodes.Last);
4493 Nodes.Table (N).Field4 := Union_Id (Val);
4496 procedure Set_List5 (N : Node_Id; Val : List_Id) is
4498 pragma Assert (N <= Nodes.Last);
4499 Nodes.Table (N).Field5 := Union_Id (Val);
4502 procedure Set_List10 (N : Node_Id; Val : List_Id) is
4504 pragma Assert (Nkind (N) in N_Entity);
4505 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4508 procedure Set_List14 (N : Node_Id; Val : List_Id) is
4510 pragma Assert (Nkind (N) in N_Entity);
4511 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4514 procedure Set_Elist1 (N : Node_Id; Val : Elist_Id) is
4516 Nodes.Table (N).Field1 := Union_Id (Val);
4519 procedure Set_Elist2 (N : Node_Id; Val : Elist_Id) is
4521 Nodes.Table (N).Field2 := Union_Id (Val);
4524 procedure Set_Elist3 (N : Node_Id; Val : Elist_Id) is
4526 Nodes.Table (N).Field3 := Union_Id (Val);
4529 procedure Set_Elist4 (N : Node_Id; Val : Elist_Id) is
4531 Nodes.Table (N).Field4 := Union_Id (Val);
4534 procedure Set_Elist8 (N : Node_Id; Val : Elist_Id) is
4536 pragma Assert (Nkind (N) in N_Entity);
4537 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4540 procedure Set_Elist13 (N : Node_Id; Val : Elist_Id) is
4542 pragma Assert (Nkind (N) in N_Entity);
4543 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4546 procedure Set_Elist15 (N : Node_Id; Val : Elist_Id) is
4548 pragma Assert (Nkind (N) in N_Entity);
4549 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4552 procedure Set_Elist16 (N : Node_Id; Val : Elist_Id) is
4554 pragma Assert (Nkind (N) in N_Entity);
4555 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4558 procedure Set_Elist18 (N : Node_Id; Val : Elist_Id) is
4560 pragma Assert (Nkind (N) in N_Entity);
4561 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4564 procedure Set_Elist21 (N : Node_Id; Val : Elist_Id) is
4566 pragma Assert (Nkind (N) in N_Entity);
4567 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4570 procedure Set_Elist23 (N : Node_Id; Val : Elist_Id) is
4572 pragma Assert (Nkind (N) in N_Entity);
4573 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4576 procedure Set_Elist25 (N : Node_Id; Val : Elist_Id) is
4578 pragma Assert (Nkind (N) in N_Entity);
4579 Nodes.Table (N + 4).Field7 := Union_Id (Val);
4582 procedure Set_Elist26 (N : Node_Id; Val : Elist_Id) is
4584 pragma Assert (Nkind (N) in N_Entity);
4585 Nodes.Table (N + 4).Field8 := Union_Id (Val);
4588 procedure Set_Name1 (N : Node_Id; Val : Name_Id) is
4590 pragma Assert (N <= Nodes.Last);
4591 Nodes.Table (N).Field1 := Union_Id (Val);
4594 procedure Set_Name2 (N : Node_Id; Val : Name_Id) is
4596 pragma Assert (N <= Nodes.Last);
4597 Nodes.Table (N).Field2 := Union_Id (Val);
4600 procedure Set_Str3 (N : Node_Id; Val : String_Id) is
4602 pragma Assert (N <= Nodes.Last);
4603 Nodes.Table (N).Field3 := Union_Id (Val);
4606 procedure Set_Uint2 (N : Node_Id; Val : Uint) is
4608 pragma Assert (N <= Nodes.Last);
4609 Nodes.Table (N).Field2 := To_Union (Val);
4612 procedure Set_Uint3 (N : Node_Id; Val : Uint) is
4614 pragma Assert (N <= Nodes.Last);
4615 Nodes.Table (N).Field3 := To_Union (Val);
4618 procedure Set_Uint4 (N : Node_Id; Val : Uint) is
4620 pragma Assert (N <= Nodes.Last);
4621 Nodes.Table (N).Field4 := To_Union (Val);
4624 procedure Set_Uint5 (N : Node_Id; Val : Uint) is
4626 pragma Assert (N <= Nodes.Last);
4627 Nodes.Table (N).Field5 := To_Union (Val);
4630 procedure Set_Uint8 (N : Node_Id; Val : Uint) is
4632 pragma Assert (Nkind (N) in N_Entity);
4633 Nodes.Table (N + 1).Field8 := To_Union (Val);
4636 procedure Set_Uint9 (N : Node_Id; Val : Uint) is
4638 pragma Assert (Nkind (N) in N_Entity);
4639 Nodes.Table (N + 1).Field9 := To_Union (Val);
4642 procedure Set_Uint10 (N : Node_Id; Val : Uint) is
4644 pragma Assert (Nkind (N) in N_Entity);
4645 Nodes.Table (N + 1).Field10 := To_Union (Val);
4648 procedure Set_Uint11 (N : Node_Id; Val : Uint) is
4650 pragma Assert (Nkind (N) in N_Entity);
4651 Nodes.Table (N + 1).Field11 := To_Union (Val);
4654 procedure Set_Uint12 (N : Node_Id; Val : Uint) is
4656 pragma Assert (Nkind (N) in N_Entity);
4657 Nodes.Table (N + 1).Field12 := To_Union (Val);
4660 procedure Set_Uint13 (N : Node_Id; Val : Uint) is
4662 pragma Assert (Nkind (N) in N_Entity);
4663 Nodes.Table (N + 2).Field6 := To_Union (Val);
4666 procedure Set_Uint14 (N : Node_Id; Val : Uint) is
4668 pragma Assert (Nkind (N) in N_Entity);
4669 Nodes.Table (N + 2).Field7 := To_Union (Val);
4672 procedure Set_Uint15 (N : Node_Id; Val : Uint) is
4674 pragma Assert (Nkind (N) in N_Entity);
4675 Nodes.Table (N + 2).Field8 := To_Union (Val);
4678 procedure Set_Uint16 (N : Node_Id; Val : Uint) is
4680 pragma Assert (Nkind (N) in N_Entity);
4681 Nodes.Table (N + 2).Field9 := To_Union (Val);
4684 procedure Set_Uint17 (N : Node_Id; Val : Uint) is
4686 pragma Assert (Nkind (N) in N_Entity);
4687 Nodes.Table (N + 2).Field10 := To_Union (Val);
4690 procedure Set_Uint22 (N : Node_Id; Val : Uint) is
4692 pragma Assert (Nkind (N) in N_Entity);
4693 Nodes.Table (N + 3).Field9 := To_Union (Val);
4696 procedure Set_Ureal3 (N : Node_Id; Val : Ureal) is
4698 pragma Assert (N <= Nodes.Last);
4699 Nodes.Table (N).Field3 := To_Union (Val);
4702 procedure Set_Ureal18 (N : Node_Id; Val : Ureal) is
4704 pragma Assert (Nkind (N) in N_Entity);
4705 Nodes.Table (N + 2).Field11 := To_Union (Val);
4708 procedure Set_Ureal21 (N : Node_Id; Val : Ureal) is
4710 pragma Assert (Nkind (N) in N_Entity);
4711 Nodes.Table (N + 3).Field8 := To_Union (Val);
4714 procedure Set_Flag4 (N : Node_Id; Val : Boolean) is
4716 pragma Assert (N <= Nodes.Last);
4717 Nodes.Table (N).Flag4 := Val;
4720 procedure Set_Flag5 (N : Node_Id; Val : Boolean) is
4722 pragma Assert (N <= Nodes.Last);
4723 Nodes.Table (N).Flag5 := Val;
4726 procedure Set_Flag6 (N : Node_Id; Val : Boolean) is
4728 pragma Assert (N <= Nodes.Last);
4729 Nodes.Table (N).Flag6 := Val;
4732 procedure Set_Flag7 (N : Node_Id; Val : Boolean) is
4734 pragma Assert (N <= Nodes.Last);
4735 Nodes.Table (N).Flag7 := Val;
4738 procedure Set_Flag8 (N : Node_Id; Val : Boolean) is
4740 pragma Assert (N <= Nodes.Last);
4741 Nodes.Table (N).Flag8 := Val;
4744 procedure Set_Flag9 (N : Node_Id; Val : Boolean) is
4746 pragma Assert (N <= Nodes.Last);
4747 Nodes.Table (N).Flag9 := Val;
4750 procedure Set_Flag10 (N : Node_Id; Val : Boolean) is
4752 pragma Assert (N <= Nodes.Last);
4753 Nodes.Table (N).Flag10 := Val;
4756 procedure Set_Flag11 (N : Node_Id; Val : Boolean) is
4758 pragma Assert (N <= Nodes.Last);
4759 Nodes.Table (N).Flag11 := Val;
4762 procedure Set_Flag12 (N : Node_Id; Val : Boolean) is
4764 pragma Assert (N <= Nodes.Last);
4765 Nodes.Table (N).Flag12 := Val;
4768 procedure Set_Flag13 (N : Node_Id; Val : Boolean) is
4770 pragma Assert (N <= Nodes.Last);
4771 Nodes.Table (N).Flag13 := Val;
4774 procedure Set_Flag14 (N : Node_Id; Val : Boolean) is
4776 pragma Assert (N <= Nodes.Last);
4777 Nodes.Table (N).Flag14 := Val;
4780 procedure Set_Flag15 (N : Node_Id; Val : Boolean) is
4782 pragma Assert (N <= Nodes.Last);
4783 Nodes.Table (N).Flag15 := Val;
4786 procedure Set_Flag16 (N : Node_Id; Val : Boolean) is
4788 pragma Assert (N <= Nodes.Last);
4789 Nodes.Table (N).Flag16 := Val;
4792 procedure Set_Flag17 (N : Node_Id; Val : Boolean) is
4794 pragma Assert (N <= Nodes.Last);
4795 Nodes.Table (N).Flag17 := Val;
4798 procedure Set_Flag18 (N : Node_Id; Val : Boolean) is
4800 pragma Assert (N <= Nodes.Last);
4801 Nodes.Table (N).Flag18 := Val;
4804 procedure Set_Flag19 (N : Node_Id; Val : Boolean) is
4806 pragma Assert (Nkind (N) in N_Entity);
4807 Nodes.Table (N + 1).In_List := Val;
4810 procedure Set_Flag20 (N : Node_Id; Val : Boolean) is
4812 pragma Assert (Nkind (N) in N_Entity);
4813 Nodes.Table (N + 1).Unused_1 := Val;
4816 procedure Set_Flag21 (N : Node_Id; Val : Boolean) is
4818 pragma Assert (Nkind (N) in N_Entity);
4819 Nodes.Table (N + 1).Rewrite_Ins := Val;
4822 procedure Set_Flag22 (N : Node_Id; Val : Boolean) is
4824 pragma Assert (Nkind (N) in N_Entity);
4825 Nodes.Table (N + 1).Analyzed := Val;
4828 procedure Set_Flag23 (N : Node_Id; Val : Boolean) is
4830 pragma Assert (Nkind (N) in N_Entity);
4831 Nodes.Table (N + 1).Comes_From_Source := Val;
4834 procedure Set_Flag24 (N : Node_Id; Val : Boolean) is
4836 pragma Assert (Nkind (N) in N_Entity);
4837 Nodes.Table (N + 1).Error_Posted := Val;
4840 procedure Set_Flag25 (N : Node_Id; Val : Boolean) is
4842 pragma Assert (Nkind (N) in N_Entity);
4843 Nodes.Table (N + 1).Flag4 := Val;
4846 procedure Set_Flag26 (N : Node_Id; Val : Boolean) is
4848 pragma Assert (Nkind (N) in N_Entity);
4849 Nodes.Table (N + 1).Flag5 := Val;
4852 procedure Set_Flag27 (N : Node_Id; Val : Boolean) is
4854 pragma Assert (Nkind (N) in N_Entity);
4855 Nodes.Table (N + 1).Flag6 := Val;
4858 procedure Set_Flag28 (N : Node_Id; Val : Boolean) is
4860 pragma Assert (Nkind (N) in N_Entity);
4861 Nodes.Table (N + 1).Flag7 := Val;
4864 procedure Set_Flag29 (N : Node_Id; Val : Boolean) is
4866 pragma Assert (Nkind (N) in N_Entity);
4867 Nodes.Table (N + 1).Flag8 := Val;
4870 procedure Set_Flag30 (N : Node_Id; Val : Boolean) is
4872 pragma Assert (Nkind (N) in N_Entity);
4873 Nodes.Table (N + 1).Flag9 := Val;
4876 procedure Set_Flag31 (N : Node_Id; Val : Boolean) is
4878 pragma Assert (Nkind (N) in N_Entity);
4879 Nodes.Table (N + 1).Flag10 := Val;
4882 procedure Set_Flag32 (N : Node_Id; Val : Boolean) is
4884 pragma Assert (Nkind (N) in N_Entity);
4885 Nodes.Table (N + 1).Flag11 := Val;
4888 procedure Set_Flag33 (N : Node_Id; Val : Boolean) is
4890 pragma Assert (Nkind (N) in N_Entity);
4891 Nodes.Table (N + 1).Flag12 := Val;
4894 procedure Set_Flag34 (N : Node_Id; Val : Boolean) is
4896 pragma Assert (Nkind (N) in N_Entity);
4897 Nodes.Table (N + 1).Flag13 := Val;
4900 procedure Set_Flag35 (N : Node_Id; Val : Boolean) is
4902 pragma Assert (Nkind (N) in N_Entity);
4903 Nodes.Table (N + 1).Flag14 := Val;
4906 procedure Set_Flag36 (N : Node_Id; Val : Boolean) is
4908 pragma Assert (Nkind (N) in N_Entity);
4909 Nodes.Table (N + 1).Flag15 := Val;
4912 procedure Set_Flag37 (N : Node_Id; Val : Boolean) is
4914 pragma Assert (Nkind (N) in N_Entity);
4915 Nodes.Table (N + 1).Flag16 := Val;
4918 procedure Set_Flag38 (N : Node_Id; Val : Boolean) is
4920 pragma Assert (Nkind (N) in N_Entity);
4921 Nodes.Table (N + 1).Flag17 := Val;
4924 procedure Set_Flag39 (N : Node_Id; Val : Boolean) is
4926 pragma Assert (Nkind (N) in N_Entity);
4927 Nodes.Table (N + 1).Flag18 := Val;
4930 procedure Set_Flag40 (N : Node_Id; Val : Boolean) is
4932 pragma Assert (Nkind (N) in N_Entity);
4933 Nodes.Table (N + 2).In_List := Val;
4936 procedure Set_Flag41 (N : Node_Id; Val : Boolean) is
4938 pragma Assert (Nkind (N) in N_Entity);
4939 Nodes.Table (N + 2).Unused_1 := Val;
4942 procedure Set_Flag42 (N : Node_Id; Val : Boolean) is
4944 pragma Assert (Nkind (N) in N_Entity);
4945 Nodes.Table (N + 2).Rewrite_Ins := Val;
4948 procedure Set_Flag43 (N : Node_Id; Val : Boolean) is
4950 pragma Assert (Nkind (N) in N_Entity);
4951 Nodes.Table (N + 2).Analyzed := Val;
4954 procedure Set_Flag44 (N : Node_Id; Val : Boolean) is
4956 pragma Assert (Nkind (N) in N_Entity);
4957 Nodes.Table (N + 2).Comes_From_Source := Val;
4960 procedure Set_Flag45 (N : Node_Id; Val : Boolean) is
4962 pragma Assert (Nkind (N) in N_Entity);
4963 Nodes.Table (N + 2).Error_Posted := Val;
4966 procedure Set_Flag46 (N : Node_Id; Val : Boolean) is
4968 pragma Assert (Nkind (N) in N_Entity);
4969 Nodes.Table (N + 2).Flag4 := Val;
4972 procedure Set_Flag47 (N : Node_Id; Val : Boolean) is
4974 pragma Assert (Nkind (N) in N_Entity);
4975 Nodes.Table (N + 2).Flag5 := Val;
4978 procedure Set_Flag48 (N : Node_Id; Val : Boolean) is
4980 pragma Assert (Nkind (N) in N_Entity);
4981 Nodes.Table (N + 2).Flag6 := Val;
4984 procedure Set_Flag49 (N : Node_Id; Val : Boolean) is
4986 pragma Assert (Nkind (N) in N_Entity);
4987 Nodes.Table (N + 2).Flag7 := Val;
4990 procedure Set_Flag50 (N : Node_Id; Val : Boolean) is
4992 pragma Assert (Nkind (N) in N_Entity);
4993 Nodes.Table (N + 2).Flag8 := Val;
4996 procedure Set_Flag51 (N : Node_Id; Val : Boolean) is
4998 pragma Assert (Nkind (N) in N_Entity);
4999 Nodes.Table (N + 2).Flag9 := Val;
5002 procedure Set_Flag52 (N : Node_Id; Val : Boolean) is
5004 pragma Assert (Nkind (N) in N_Entity);
5005 Nodes.Table (N + 2).Flag10 := Val;
5008 procedure Set_Flag53 (N : Node_Id; Val : Boolean) is
5010 pragma Assert (Nkind (N) in N_Entity);
5011 Nodes.Table (N + 2).Flag11 := Val;
5014 procedure Set_Flag54 (N : Node_Id; Val : Boolean) is
5016 pragma Assert (Nkind (N) in N_Entity);
5017 Nodes.Table (N + 2).Flag12 := Val;
5020 procedure Set_Flag55 (N : Node_Id; Val : Boolean) is
5022 pragma Assert (Nkind (N) in N_Entity);
5023 Nodes.Table (N + 2).Flag13 := Val;
5026 procedure Set_Flag56 (N : Node_Id; Val : Boolean) is
5028 pragma Assert (Nkind (N) in N_Entity);
5029 Nodes.Table (N + 2).Flag14 := Val;
5032 procedure Set_Flag57 (N : Node_Id; Val : Boolean) is
5034 pragma Assert (Nkind (N) in N_Entity);
5035 Nodes.Table (N + 2).Flag15 := Val;
5038 procedure Set_Flag58 (N : Node_Id; Val : Boolean) is
5040 pragma Assert (Nkind (N) in N_Entity);
5041 Nodes.Table (N + 2).Flag16 := Val;
5044 procedure Set_Flag59 (N : Node_Id; Val : Boolean) is
5046 pragma Assert (Nkind (N) in N_Entity);
5047 Nodes.Table (N + 2).Flag17 := Val;
5050 procedure Set_Flag60 (N : Node_Id; Val : Boolean) is
5052 pragma Assert (Nkind (N) in N_Entity);
5053 Nodes.Table (N + 2).Flag18 := Val;
5056 procedure Set_Flag61 (N : Node_Id; Val : Boolean) is
5058 pragma Assert (Nkind (N) in N_Entity);
5059 Nodes.Table (N + 1).Pflag1 := Val;
5062 procedure Set_Flag62 (N : Node_Id; Val : Boolean) is
5064 pragma Assert (Nkind (N) in N_Entity);
5065 Nodes.Table (N + 1).Pflag2 := Val;
5068 procedure Set_Flag63 (N : Node_Id; Val : Boolean) is
5070 pragma Assert (Nkind (N) in N_Entity);
5071 Nodes.Table (N + 2).Pflag1 := Val;
5074 procedure Set_Flag64 (N : Node_Id; Val : Boolean) is
5076 pragma Assert (Nkind (N) in N_Entity);
5077 Nodes.Table (N + 2).Pflag2 := Val;
5080 procedure Set_Flag65 (N : Node_Id; Val : Boolean) is
5082 pragma Assert (Nkind (N) in N_Entity);
5085 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag65 := Val;
5088 procedure Set_Flag66 (N : Node_Id; Val : Boolean) is
5090 pragma Assert (Nkind (N) in N_Entity);
5093 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag66 := Val;
5096 procedure Set_Flag67 (N : Node_Id; Val : Boolean) is
5098 pragma Assert (Nkind (N) in N_Entity);
5101 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag67 := Val;
5104 procedure Set_Flag68 (N : Node_Id; Val : Boolean) is
5106 pragma Assert (Nkind (N) in N_Entity);
5109 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag68 := Val;
5112 procedure Set_Flag69 (N : Node_Id; Val : Boolean) is
5114 pragma Assert (Nkind (N) in N_Entity);
5117 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag69 := Val;
5120 procedure Set_Flag70 (N : Node_Id; Val : Boolean) is
5122 pragma Assert (Nkind (N) in N_Entity);
5125 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag70 := Val;
5128 procedure Set_Flag71 (N : Node_Id; Val : Boolean) is
5130 pragma Assert (Nkind (N) in N_Entity);
5133 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag71 := Val;
5136 procedure Set_Flag72 (N : Node_Id; Val : Boolean) is
5138 pragma Assert (Nkind (N) in N_Entity);
5141 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag72 := Val;
5144 procedure Set_Flag73 (N : Node_Id; Val : Boolean) is
5146 pragma Assert (Nkind (N) in N_Entity);
5149 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag73 := Val;
5152 procedure Set_Flag74 (N : Node_Id; Val : Boolean) is
5154 pragma Assert (Nkind (N) in N_Entity);
5157 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag74 := Val;
5160 procedure Set_Flag75 (N : Node_Id; Val : Boolean) is
5162 pragma Assert (Nkind (N) in N_Entity);
5165 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag75 := Val;
5168 procedure Set_Flag76 (N : Node_Id; Val : Boolean) is
5170 pragma Assert (Nkind (N) in N_Entity);
5173 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag76 := Val;
5176 procedure Set_Flag77 (N : Node_Id; Val : Boolean) is
5178 pragma Assert (Nkind (N) in N_Entity);
5181 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag77 := Val;
5184 procedure Set_Flag78 (N : Node_Id; Val : Boolean) is
5186 pragma Assert (Nkind (N) in N_Entity);
5189 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag78 := Val;
5192 procedure Set_Flag79 (N : Node_Id; Val : Boolean) is
5194 pragma Assert (Nkind (N) in N_Entity);
5197 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag79 := Val;
5200 procedure Set_Flag80 (N : Node_Id; Val : Boolean) is
5202 pragma Assert (Nkind (N) in N_Entity);
5205 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag80 := Val;
5208 procedure Set_Flag81 (N : Node_Id; Val : Boolean) is
5210 pragma Assert (Nkind (N) in N_Entity);
5213 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag81 := Val;
5216 procedure Set_Flag82 (N : Node_Id; Val : Boolean) is
5218 pragma Assert (Nkind (N) in N_Entity);
5221 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag82 := Val;
5224 procedure Set_Flag83 (N : Node_Id; Val : Boolean) is
5226 pragma Assert (Nkind (N) in N_Entity);
5229 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag83 := Val;
5232 procedure Set_Flag84 (N : Node_Id; Val : Boolean) is
5234 pragma Assert (Nkind (N) in N_Entity);
5237 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag84 := Val;
5240 procedure Set_Flag85 (N : Node_Id; Val : Boolean) is
5242 pragma Assert (Nkind (N) in N_Entity);
5245 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag85 := Val;
5248 procedure Set_Flag86 (N : Node_Id; Val : Boolean) is
5250 pragma Assert (Nkind (N) in N_Entity);
5253 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag86 := Val;
5256 procedure Set_Flag87 (N : Node_Id; Val : Boolean) is
5258 pragma Assert (Nkind (N) in N_Entity);
5261 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag87 := Val;
5264 procedure Set_Flag88 (N : Node_Id; Val : Boolean) is
5266 pragma Assert (Nkind (N) in N_Entity);
5269 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag88 := Val;
5272 procedure Set_Flag89 (N : Node_Id; Val : Boolean) is
5274 pragma Assert (Nkind (N) in N_Entity);
5277 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag89 := Val;
5280 procedure Set_Flag90 (N : Node_Id; Val : Boolean) is
5282 pragma Assert (Nkind (N) in N_Entity);
5285 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag90 := Val;
5288 procedure Set_Flag91 (N : Node_Id; Val : Boolean) is
5290 pragma Assert (Nkind (N) in N_Entity);
5293 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag91 := Val;
5296 procedure Set_Flag92 (N : Node_Id; Val : Boolean) is
5298 pragma Assert (Nkind (N) in N_Entity);
5301 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag92 := Val;
5304 procedure Set_Flag93 (N : Node_Id; Val : Boolean) is
5306 pragma Assert (Nkind (N) in N_Entity);
5309 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag93 := Val;
5312 procedure Set_Flag94 (N : Node_Id; Val : Boolean) is
5314 pragma Assert (Nkind (N) in N_Entity);
5317 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag94 := Val;
5320 procedure Set_Flag95 (N : Node_Id; Val : Boolean) is
5322 pragma Assert (Nkind (N) in N_Entity);
5325 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag95 := Val;
5328 procedure Set_Flag96 (N : Node_Id; Val : Boolean) is
5330 pragma Assert (Nkind (N) in N_Entity);
5333 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag96 := Val;
5336 procedure Set_Flag97 (N : Node_Id; Val : Boolean) is
5338 pragma Assert (Nkind (N) in N_Entity);
5341 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag97 := Val;
5344 procedure Set_Flag98 (N : Node_Id; Val : Boolean) is
5346 pragma Assert (Nkind (N) in N_Entity);
5349 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag98 := Val;
5352 procedure Set_Flag99 (N : Node_Id; Val : Boolean) is
5354 pragma Assert (Nkind (N) in N_Entity);
5357 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag99 := Val;
5360 procedure Set_Flag100 (N : Node_Id; Val : Boolean) is
5362 pragma Assert (Nkind (N) in N_Entity);
5365 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag100 := Val;
5368 procedure Set_Flag101 (N : Node_Id; Val : Boolean) is
5370 pragma Assert (Nkind (N) in N_Entity);
5373 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag101 := Val;
5376 procedure Set_Flag102 (N : Node_Id; Val : Boolean) is
5378 pragma Assert (Nkind (N) in N_Entity);
5381 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag102 := Val;
5384 procedure Set_Flag103 (N : Node_Id; Val : Boolean) is
5386 pragma Assert (Nkind (N) in N_Entity);
5389 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag103 := Val;
5392 procedure Set_Flag104 (N : Node_Id; Val : Boolean) is
5394 pragma Assert (Nkind (N) in N_Entity);
5397 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag104 := Val;
5400 procedure Set_Flag105 (N : Node_Id; Val : Boolean) is
5402 pragma Assert (Nkind (N) in N_Entity);
5405 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag105 := Val;
5408 procedure Set_Flag106 (N : Node_Id; Val : Boolean) is
5410 pragma Assert (Nkind (N) in N_Entity);
5413 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag106 := Val;
5416 procedure Set_Flag107 (N : Node_Id; Val : Boolean) is
5418 pragma Assert (Nkind (N) in N_Entity);
5421 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag107 := Val;
5424 procedure Set_Flag108 (N : Node_Id; Val : Boolean) is
5426 pragma Assert (Nkind (N) in N_Entity);
5429 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag108 := Val;
5432 procedure Set_Flag109 (N : Node_Id; Val : Boolean) is
5434 pragma Assert (Nkind (N) in N_Entity);
5437 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag109 := Val;
5440 procedure Set_Flag110 (N : Node_Id; Val : Boolean) is
5442 pragma Assert (Nkind (N) in N_Entity);
5445 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag110 := Val;
5448 procedure Set_Flag111 (N : Node_Id; Val : Boolean) is
5450 pragma Assert (Nkind (N) in N_Entity);
5453 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag111 := Val;
5456 procedure Set_Flag112 (N : Node_Id; Val : Boolean) is
5458 pragma Assert (Nkind (N) in N_Entity);
5461 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag112 := Val;
5464 procedure Set_Flag113 (N : Node_Id; Val : Boolean) is
5466 pragma Assert (Nkind (N) in N_Entity);
5469 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag113 := Val;
5472 procedure Set_Flag114 (N : Node_Id; Val : Boolean) is
5474 pragma Assert (Nkind (N) in N_Entity);
5477 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag114 := Val;
5480 procedure Set_Flag115 (N : Node_Id; Val : Boolean) is
5482 pragma Assert (Nkind (N) in N_Entity);
5485 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag115 := Val;
5488 procedure Set_Flag116 (N : Node_Id; Val : Boolean) is
5490 pragma Assert (Nkind (N) in N_Entity);
5493 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag116 := Val;
5496 procedure Set_Flag117 (N : Node_Id; Val : Boolean) is
5498 pragma Assert (Nkind (N) in N_Entity);
5501 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag117 := Val;
5504 procedure Set_Flag118 (N : Node_Id; Val : Boolean) is
5506 pragma Assert (Nkind (N) in N_Entity);
5509 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag118 := Val;
5512 procedure Set_Flag119 (N : Node_Id; Val : Boolean) is
5514 pragma Assert (Nkind (N) in N_Entity);
5517 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag119 := Val;
5520 procedure Set_Flag120 (N : Node_Id; Val : Boolean) is
5522 pragma Assert (Nkind (N) in N_Entity);
5525 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag120 := Val;
5528 procedure Set_Flag121 (N : Node_Id; Val : Boolean) is
5530 pragma Assert (Nkind (N) in N_Entity);
5533 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag121 := Val;
5536 procedure Set_Flag122 (N : Node_Id; Val : Boolean) is
5538 pragma Assert (Nkind (N) in N_Entity);
5541 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag122 := Val;
5544 procedure Set_Flag123 (N : Node_Id; Val : Boolean) is
5546 pragma Assert (Nkind (N) in N_Entity);
5549 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag123 := Val;
5552 procedure Set_Flag124 (N : Node_Id; Val : Boolean) is
5554 pragma Assert (Nkind (N) in N_Entity);
5557 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag124 := Val;
5560 procedure Set_Flag125 (N : Node_Id; Val : Boolean) is
5562 pragma Assert (Nkind (N) in N_Entity);
5565 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag125 := Val;
5568 procedure Set_Flag126 (N : Node_Id; Val : Boolean) is
5570 pragma Assert (Nkind (N) in N_Entity);
5573 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag126 := Val;
5576 procedure Set_Flag127 (N : Node_Id; Val : Boolean) is
5578 pragma Assert (Nkind (N) in N_Entity);
5581 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag127 := Val;
5584 procedure Set_Flag128 (N : Node_Id; Val : Boolean) is
5586 pragma Assert (Nkind (N) in N_Entity);
5589 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag128 := Val;
5592 procedure Set_Flag129 (N : Node_Id; Val : Boolean) is
5594 pragma Assert (Nkind (N) in N_Entity);
5595 Nodes.Table (N + 3).In_List := Val;
5598 procedure Set_Flag130 (N : Node_Id; Val : Boolean) is
5600 pragma Assert (Nkind (N) in N_Entity);
5601 Nodes.Table (N + 3).Unused_1 := Val;
5604 procedure Set_Flag131 (N : Node_Id; Val : Boolean) is
5606 pragma Assert (Nkind (N) in N_Entity);
5607 Nodes.Table (N + 3).Rewrite_Ins := Val;
5610 procedure Set_Flag132 (N : Node_Id; Val : Boolean) is
5612 pragma Assert (Nkind (N) in N_Entity);
5613 Nodes.Table (N + 3).Analyzed := Val;
5616 procedure Set_Flag133 (N : Node_Id; Val : Boolean) is
5618 pragma Assert (Nkind (N) in N_Entity);
5619 Nodes.Table (N + 3).Comes_From_Source := Val;
5622 procedure Set_Flag134 (N : Node_Id; Val : Boolean) is
5624 pragma Assert (Nkind (N) in N_Entity);
5625 Nodes.Table (N + 3).Error_Posted := Val;
5628 procedure Set_Flag135 (N : Node_Id; Val : Boolean) is
5630 pragma Assert (Nkind (N) in N_Entity);
5631 Nodes.Table (N + 3).Flag4 := Val;
5634 procedure Set_Flag136 (N : Node_Id; Val : Boolean) is
5636 pragma Assert (Nkind (N) in N_Entity);
5637 Nodes.Table (N + 3).Flag5 := Val;
5640 procedure Set_Flag137 (N : Node_Id; Val : Boolean) is
5642 pragma Assert (Nkind (N) in N_Entity);
5643 Nodes.Table (N + 3).Flag6 := Val;
5646 procedure Set_Flag138 (N : Node_Id; Val : Boolean) is
5648 pragma Assert (Nkind (N) in N_Entity);
5649 Nodes.Table (N + 3).Flag7 := Val;
5652 procedure Set_Flag139 (N : Node_Id; Val : Boolean) is
5654 pragma Assert (Nkind (N) in N_Entity);
5655 Nodes.Table (N + 3).Flag8 := Val;
5658 procedure Set_Flag140 (N : Node_Id; Val : Boolean) is
5660 pragma Assert (Nkind (N) in N_Entity);
5661 Nodes.Table (N + 3).Flag9 := Val;
5664 procedure Set_Flag141 (N : Node_Id; Val : Boolean) is
5666 pragma Assert (Nkind (N) in N_Entity);
5667 Nodes.Table (N + 3).Flag10 := Val;
5670 procedure Set_Flag142 (N : Node_Id; Val : Boolean) is
5672 pragma Assert (Nkind (N) in N_Entity);
5673 Nodes.Table (N + 3).Flag11 := Val;
5676 procedure Set_Flag143 (N : Node_Id; Val : Boolean) is
5678 pragma Assert (Nkind (N) in N_Entity);
5679 Nodes.Table (N + 3).Flag12 := Val;
5682 procedure Set_Flag144 (N : Node_Id; Val : Boolean) is
5684 pragma Assert (Nkind (N) in N_Entity);
5685 Nodes.Table (N + 3).Flag13 := Val;
5688 procedure Set_Flag145 (N : Node_Id; Val : Boolean) is
5690 pragma Assert (Nkind (N) in N_Entity);
5691 Nodes.Table (N + 3).Flag14 := Val;
5694 procedure Set_Flag146 (N : Node_Id; Val : Boolean) is
5696 pragma Assert (Nkind (N) in N_Entity);
5697 Nodes.Table (N + 3).Flag15 := Val;
5700 procedure Set_Flag147 (N : Node_Id; Val : Boolean) is
5702 pragma Assert (Nkind (N) in N_Entity);
5703 Nodes.Table (N + 3).Flag16 := Val;
5706 procedure Set_Flag148 (N : Node_Id; Val : Boolean) is
5708 pragma Assert (Nkind (N) in N_Entity);
5709 Nodes.Table (N + 3).Flag17 := Val;
5712 procedure Set_Flag149 (N : Node_Id; Val : Boolean) is
5714 pragma Assert (Nkind (N) in N_Entity);
5715 Nodes.Table (N + 3).Flag18 := Val;
5718 procedure Set_Flag150 (N : Node_Id; Val : Boolean) is
5720 pragma Assert (Nkind (N) in N_Entity);
5721 Nodes.Table (N + 3).Pflag1 := Val;
5724 procedure Set_Flag151 (N : Node_Id; Val : Boolean) is
5726 pragma Assert (Nkind (N) in N_Entity);
5727 Nodes.Table (N + 3).Pflag2 := Val;
5730 procedure Set_Flag152 (N : Node_Id; Val : Boolean) is
5732 pragma Assert (Nkind (N) in N_Entity);
5735 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag152 := Val;
5738 procedure Set_Flag153 (N : Node_Id; Val : Boolean) is
5740 pragma Assert (Nkind (N) in N_Entity);
5743 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag153 := Val;
5746 procedure Set_Flag154 (N : Node_Id; Val : Boolean) is
5748 pragma Assert (Nkind (N) in N_Entity);
5751 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag154 := Val;
5754 procedure Set_Flag155 (N : Node_Id; Val : Boolean) is
5756 pragma Assert (Nkind (N) in N_Entity);
5759 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag155 := Val;
5762 procedure Set_Flag156 (N : Node_Id; Val : Boolean) is
5764 pragma Assert (Nkind (N) in N_Entity);
5767 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag156 := Val;
5770 procedure Set_Flag157 (N : Node_Id; Val : Boolean) is
5772 pragma Assert (Nkind (N) in N_Entity);
5775 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag157 := Val;
5778 procedure Set_Flag158 (N : Node_Id; Val : Boolean) is
5780 pragma Assert (Nkind (N) in N_Entity);
5783 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag158 := Val;
5786 procedure Set_Flag159 (N : Node_Id; Val : Boolean) is
5788 pragma Assert (Nkind (N) in N_Entity);
5791 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag159 := Val;
5794 procedure Set_Flag160 (N : Node_Id; Val : Boolean) is
5796 pragma Assert (Nkind (N) in N_Entity);
5799 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag160 := Val;
5802 procedure Set_Flag161 (N : Node_Id; Val : Boolean) is
5804 pragma Assert (Nkind (N) in N_Entity);
5807 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag161 := Val;
5810 procedure Set_Flag162 (N : Node_Id; Val : Boolean) is
5812 pragma Assert (Nkind (N) in N_Entity);
5815 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag162 := Val;
5818 procedure Set_Flag163 (N : Node_Id; Val : Boolean) is
5820 pragma Assert (Nkind (N) in N_Entity);
5823 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag163 := Val;
5826 procedure Set_Flag164 (N : Node_Id; Val : Boolean) is
5828 pragma Assert (Nkind (N) in N_Entity);
5831 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag164 := Val;
5834 procedure Set_Flag165 (N : Node_Id; Val : Boolean) is
5836 pragma Assert (Nkind (N) in N_Entity);
5839 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag165 := Val;
5842 procedure Set_Flag166 (N : Node_Id; Val : Boolean) is
5844 pragma Assert (Nkind (N) in N_Entity);
5847 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag166 := Val;
5850 procedure Set_Flag167 (N : Node_Id; Val : Boolean) is
5852 pragma Assert (Nkind (N) in N_Entity);
5855 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag167 := Val;
5858 procedure Set_Flag168 (N : Node_Id; Val : Boolean) is
5860 pragma Assert (Nkind (N) in N_Entity);
5863 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag168 := Val;
5866 procedure Set_Flag169 (N : Node_Id; Val : Boolean) is
5868 pragma Assert (Nkind (N) in N_Entity);
5871 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag169 := Val;
5874 procedure Set_Flag170 (N : Node_Id; Val : Boolean) is
5876 pragma Assert (Nkind (N) in N_Entity);
5879 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag170 := Val;
5882 procedure Set_Flag171 (N : Node_Id; Val : Boolean) is
5884 pragma Assert (Nkind (N) in N_Entity);
5887 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag171 := Val;
5890 procedure Set_Flag172 (N : Node_Id; Val : Boolean) is
5892 pragma Assert (Nkind (N) in N_Entity);
5895 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag172 := Val;
5898 procedure Set_Flag173 (N : Node_Id; Val : Boolean) is
5900 pragma Assert (Nkind (N) in N_Entity);
5903 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag173 := Val;
5906 procedure Set_Flag174 (N : Node_Id; Val : Boolean) is
5908 pragma Assert (Nkind (N) in N_Entity);
5911 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag174 := Val;
5914 procedure Set_Flag175 (N : Node_Id; Val : Boolean) is
5916 pragma Assert (Nkind (N) in N_Entity);
5919 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag175 := Val;
5922 procedure Set_Flag176 (N : Node_Id; Val : Boolean) is
5924 pragma Assert (Nkind (N) in N_Entity);
5927 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag176 := Val;
5930 procedure Set_Flag177 (N : Node_Id; Val : Boolean) is
5932 pragma Assert (Nkind (N) in N_Entity);
5935 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag177 := Val;
5938 procedure Set_Flag178 (N : Node_Id; Val : Boolean) is
5940 pragma Assert (Nkind (N) in N_Entity);
5943 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag178 := Val;
5946 procedure Set_Flag179 (N : Node_Id; Val : Boolean) is
5948 pragma Assert (Nkind (N) in N_Entity);
5951 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag179 := Val;
5954 procedure Set_Flag180 (N : Node_Id; Val : Boolean) is
5956 pragma Assert (Nkind (N) in N_Entity);
5959 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag180 := Val;
5962 procedure Set_Flag181 (N : Node_Id; Val : Boolean) is
5964 pragma Assert (Nkind (N) in N_Entity);
5967 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag181 := Val;
5970 procedure Set_Flag182 (N : Node_Id; Val : Boolean) is
5972 pragma Assert (Nkind (N) in N_Entity);
5975 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag182 := Val;
5978 procedure Set_Flag183 (N : Node_Id; Val : Boolean) is
5980 pragma Assert (Nkind (N) in N_Entity);
5983 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag183 := Val;
5986 procedure Set_Flag184 (N : Node_Id; Val : Boolean) is
5988 pragma Assert (Nkind (N) in N_Entity);
5991 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag184 := Val;
5994 procedure Set_Flag185 (N : Node_Id; Val : Boolean) is
5996 pragma Assert (Nkind (N) in N_Entity);
5999 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag185 := Val;
6002 procedure Set_Flag186 (N : Node_Id; Val : Boolean) is
6004 pragma Assert (Nkind (N) in N_Entity);
6007 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag186 := Val;
6010 procedure Set_Flag187 (N : Node_Id; Val : Boolean) is
6012 pragma Assert (Nkind (N) in N_Entity);
6015 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag187 := Val;
6018 procedure Set_Flag188 (N : Node_Id; Val : Boolean) is
6020 pragma Assert (Nkind (N) in N_Entity);
6023 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag188 := Val;
6026 procedure Set_Flag189 (N : Node_Id; Val : Boolean) is
6028 pragma Assert (Nkind (N) in N_Entity);
6031 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag189 := Val;
6034 procedure Set_Flag190 (N : Node_Id; Val : Boolean) is
6036 pragma Assert (Nkind (N) in N_Entity);
6039 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag190 := Val;
6042 procedure Set_Flag191 (N : Node_Id; Val : Boolean) is
6044 pragma Assert (Nkind (N) in N_Entity);
6047 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag191 := Val;
6050 procedure Set_Flag192 (N : Node_Id; Val : Boolean) is
6052 pragma Assert (Nkind (N) in N_Entity);
6055 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag192 := Val;
6058 procedure Set_Flag193 (N : Node_Id; Val : Boolean) is
6060 pragma Assert (Nkind (N) in N_Entity);
6063 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag193 := Val;
6066 procedure Set_Flag194 (N : Node_Id; Val : Boolean) is
6068 pragma Assert (Nkind (N) in N_Entity);
6071 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag194 := Val;
6074 procedure Set_Flag195 (N : Node_Id; Val : Boolean) is
6076 pragma Assert (Nkind (N) in N_Entity);
6079 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag195 := Val;
6082 procedure Set_Flag196 (N : Node_Id; Val : Boolean) is
6084 pragma Assert (Nkind (N) in N_Entity);
6087 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag196 := Val;
6090 procedure Set_Flag197 (N : Node_Id; Val : Boolean) is
6092 pragma Assert (Nkind (N) in N_Entity);
6095 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag197 := Val;
6098 procedure Set_Flag198 (N : Node_Id; Val : Boolean) is
6100 pragma Assert (Nkind (N) in N_Entity);
6103 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag198 := Val;
6106 procedure Set_Flag199 (N : Node_Id; Val : Boolean) is
6108 pragma Assert (Nkind (N) in N_Entity);
6111 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag199 := Val;
6114 procedure Set_Flag200 (N : Node_Id; Val : Boolean) is
6116 pragma Assert (Nkind (N) in N_Entity);
6119 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag200 := Val;
6122 procedure Set_Flag201 (N : Node_Id; Val : Boolean) is
6124 pragma Assert (Nkind (N) in N_Entity);
6127 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag201 := Val;
6130 procedure Set_Flag202 (N : Node_Id; Val : Boolean) is
6132 pragma Assert (Nkind (N) in N_Entity);
6135 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag202 := Val;
6138 procedure Set_Flag203 (N : Node_Id; Val : Boolean) is
6140 pragma Assert (Nkind (N) in N_Entity);
6143 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag203 := Val;
6146 procedure Set_Flag204 (N : Node_Id; Val : Boolean) is
6148 pragma Assert (Nkind (N) in N_Entity);
6151 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag204 := Val;
6154 procedure Set_Flag205 (N : Node_Id; Val : Boolean) is
6156 pragma Assert (Nkind (N) in N_Entity);
6159 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag205 := Val;
6162 procedure Set_Flag206 (N : Node_Id; Val : Boolean) is
6164 pragma Assert (Nkind (N) in N_Entity);
6167 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag206 := Val;
6170 procedure Set_Flag207 (N : Node_Id; Val : Boolean) is
6172 pragma Assert (Nkind (N) in N_Entity);
6175 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag207 := Val;
6178 procedure Set_Flag208 (N : Node_Id; Val : Boolean) is
6180 pragma Assert (Nkind (N) in N_Entity);
6183 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag208 := Val;
6186 procedure Set_Flag209 (N : Node_Id; Val : Boolean) is
6188 pragma Assert (Nkind (N) in N_Entity);
6191 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag209 := Val;
6194 procedure Set_Flag210 (N : Node_Id; Val : Boolean) is
6196 pragma Assert (Nkind (N) in N_Entity);
6199 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag210 := Val;
6202 procedure Set_Flag211 (N : Node_Id; Val : Boolean) is
6204 pragma Assert (Nkind (N) in N_Entity);
6207 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag211 := Val;
6210 procedure Set_Flag212 (N : Node_Id; Val : Boolean) is
6212 pragma Assert (Nkind (N) in N_Entity);
6215 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag212 := Val;
6218 procedure Set_Flag213 (N : Node_Id; Val : Boolean) is
6220 pragma Assert (Nkind (N) in N_Entity);
6223 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag213 := Val;
6226 procedure Set_Flag214 (N : Node_Id; Val : Boolean) is
6228 pragma Assert (Nkind (N) in N_Entity);
6231 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag214 := Val;
6234 procedure Set_Flag215 (N : Node_Id; Val : Boolean) is
6236 pragma Assert (Nkind (N) in N_Entity);
6239 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag215 := Val;
6242 procedure Set_Flag216 (N : Node_Id; Val : Boolean) is
6244 pragma Assert (Nkind (N) in N_Entity);
6247 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag216 := Val;
6250 procedure Set_Flag217 (N : Node_Id; Val : Boolean) is
6252 pragma Assert (Nkind (N) in N_Entity);
6255 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag217 := Val;
6258 procedure Set_Flag218 (N : Node_Id; Val : Boolean) is
6260 pragma Assert (Nkind (N) in N_Entity);
6263 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag218 := Val;
6266 procedure Set_Flag219 (N : Node_Id; Val : Boolean) is
6268 pragma Assert (Nkind (N) in N_Entity);
6271 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag219 := Val;
6274 procedure Set_Flag220 (N : Node_Id; Val : Boolean) is
6276 pragma Assert (Nkind (N) in N_Entity);
6279 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag220 := Val;
6282 procedure Set_Flag221 (N : Node_Id; Val : Boolean) is
6284 pragma Assert (Nkind (N) in N_Entity);
6287 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag221 := Val;
6290 procedure Set_Flag222 (N : Node_Id; Val : Boolean) is
6292 pragma Assert (Nkind (N) in N_Entity);
6295 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag222 := Val;
6298 procedure Set_Flag223 (N : Node_Id; Val : Boolean) is
6300 pragma Assert (Nkind (N) in N_Entity);
6303 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag223 := Val;
6306 procedure Set_Flag224 (N : Node_Id; Val : Boolean) is
6308 pragma Assert (Nkind (N) in N_Entity);
6311 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag224 := Val;
6314 procedure Set_Flag225 (N : Node_Id; Val : Boolean) is
6316 pragma Assert (Nkind (N) in N_Entity);
6319 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag225 := Val;
6322 procedure Set_Flag226 (N : Node_Id; Val : Boolean) is
6324 pragma Assert (Nkind (N) in N_Entity);
6327 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag226 := Val;
6330 procedure Set_Flag227 (N : Node_Id; Val : Boolean) is
6332 pragma Assert (Nkind (N) in N_Entity);
6335 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag227 := Val;
6338 procedure Set_Flag228 (N : Node_Id; Val : Boolean) is
6340 pragma Assert (Nkind (N) in N_Entity);
6343 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag228 := Val;
6346 procedure Set_Flag229 (N : Node_Id; Val : Boolean) is
6348 pragma Assert (Nkind (N) in N_Entity);
6351 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag229 := Val;
6354 procedure Set_Flag230 (N : Node_Id; Val : Boolean) is
6356 pragma Assert (Nkind (N) in N_Entity);
6359 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag230 := Val;
6362 procedure Set_Flag231 (N : Node_Id; Val : Boolean) is
6364 pragma Assert (Nkind (N) in N_Entity);
6367 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag231 := Val;
6370 procedure Set_Flag232 (N : Node_Id; Val : Boolean) is
6372 pragma Assert (Nkind (N) in N_Entity);
6375 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag232 := Val;
6378 procedure Set_Flag233 (N : Node_Id; Val : Boolean) is
6380 pragma Assert (Nkind (N) in N_Entity);
6383 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag233 := Val;
6386 procedure Set_Flag234 (N : Node_Id; Val : Boolean) is
6388 pragma Assert (Nkind (N) in N_Entity);
6391 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag234 := Val;
6394 procedure Set_Flag235 (N : Node_Id; Val : Boolean) is
6396 pragma Assert (Nkind (N) in N_Entity);
6399 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag235 := Val;
6402 procedure Set_Flag236 (N : Node_Id; Val : Boolean) is
6404 pragma Assert (Nkind (N) in N_Entity);
6407 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag236 := Val;
6410 procedure Set_Flag237 (N : Node_Id; Val : Boolean) is
6412 pragma Assert (Nkind (N) in N_Entity);
6415 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag237 := Val;
6418 procedure Set_Flag238 (N : Node_Id; Val : Boolean) is
6420 pragma Assert (Nkind (N) in N_Entity);
6423 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag238 := Val;
6426 procedure Set_Flag239 (N : Node_Id; Val : Boolean) is
6428 pragma Assert (Nkind (N) in N_Entity);
6431 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag239 := Val;
6434 procedure Set_Flag240 (N : Node_Id; Val : Boolean) is
6436 pragma Assert (Nkind (N) in N_Entity);
6439 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag240 := Val;
6442 procedure Set_Flag241 (N : Node_Id; Val : Boolean) is
6444 pragma Assert (Nkind (N) in N_Entity);
6447 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag241 := Val;
6450 procedure Set_Flag242 (N : Node_Id; Val : Boolean) is
6452 pragma Assert (Nkind (N) in N_Entity);
6455 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag242 := Val;
6458 procedure Set_Flag243 (N : Node_Id; Val : Boolean) is
6460 pragma Assert (Nkind (N) in N_Entity);
6463 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag243 := Val;
6466 procedure Set_Flag244 (N : Node_Id; Val : Boolean) is
6468 pragma Assert (Nkind (N) in N_Entity);
6471 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag244 := Val;
6474 procedure Set_Flag245 (N : Node_Id; Val : Boolean) is
6476 pragma Assert (Nkind (N) in N_Entity);
6479 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag245 := Val;
6482 procedure Set_Flag246 (N : Node_Id; Val : Boolean) is
6484 pragma Assert (Nkind (N) in N_Entity);
6487 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag246 := Val;
6490 procedure Set_Flag247 (N : Node_Id; Val : Boolean) is
6492 pragma Assert (Nkind (N) in N_Entity);
6495 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag247 := Val;
6498 procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id) is
6500 pragma Assert (N <= Nodes.Last);
6503 Set_Parent (N => Val, Val => N);
6507 end Set_Node1_With_Parent;
6509 procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id) is
6511 pragma Assert (N <= Nodes.Last);
6514 Set_Parent (N => Val, Val => N);
6518 end Set_Node2_With_Parent;
6520 procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id) is
6522 pragma Assert (N <= Nodes.Last);
6525 Set_Parent (N => Val, Val => N);
6529 end Set_Node3_With_Parent;
6531 procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id) is
6533 pragma Assert (N <= Nodes.Last);
6536 Set_Parent (N => Val, Val => N);
6540 end Set_Node4_With_Parent;
6542 procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id) is
6544 pragma Assert (N <= Nodes.Last);
6547 Set_Parent (N => Val, Val => N);
6551 end Set_Node5_With_Parent;
6553 procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id) is
6555 pragma Assert (N <= Nodes.Last);
6556 if Val /= No_List and then Val /= Error_List then
6557 Set_Parent (Val, N);
6560 end Set_List1_With_Parent;
6562 procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id) is
6564 pragma Assert (N <= Nodes.Last);
6565 if Val /= No_List and then Val /= Error_List then
6566 Set_Parent (Val, N);
6569 end Set_List2_With_Parent;
6571 procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id) is
6573 pragma Assert (N <= Nodes.Last);
6574 if Val /= No_List and then Val /= Error_List then
6575 Set_Parent (Val, N);
6578 end Set_List3_With_Parent;
6580 procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id) is
6582 pragma Assert (N <= Nodes.Last);
6583 if Val /= No_List and then Val /= Error_List then
6584 Set_Parent (Val, N);
6587 end Set_List4_With_Parent;
6589 procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id) is
6591 pragma Assert (N <= Nodes.Last);
6592 if Val /= No_List and then Val /= Error_List then
6593 Set_Parent (Val, N);
6596 end Set_List5_With_Parent;
6598 end Unchecked_Access;
6606 Nodes.Locked := False;
6607 Orig_Nodes.Locked := False;