1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. --
18 -- As a special exception under Section 7 of GPL version 3, you are granted --
19 -- additional permissions described in the GCC Runtime Library Exception, --
20 -- version 3.1, as published by the Free Software Foundation. --
22 -- You should have received a copy of the GNU General Public License and --
23 -- a copy of the GCC Runtime Library Exception along with this program; --
24 -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
25 -- <http://www.gnu.org/licenses/>. --
27 -- GNAT was originally developed by the GNAT team at New York University. --
28 -- Extensive contributions were provided by Ada Core Technologies Inc. --
30 ------------------------------------------------------------------------------
32 pragma Style_Checks
(All_Checks
);
33 -- Turn off subprogram ordering check for this package
35 -- WARNING: There is a C version of this package. Any changes to this source
36 -- file must be properly reflected in the file atree.h which is a C header
37 -- file containing equivalent definitions for use by gigi.
39 with Debug
; use Debug
;
40 with Nlists
; use Nlists
;
41 with Output
; use Output
;
42 with Sinput
; use Sinput
;
43 with Tree_IO
; use Tree_IO
;
51 -- Suppose you find that node 12345 is messed up. You might want to find
52 -- the code that created that node. There are two ways to do this:
54 -- One way is to set a conditional breakpoint on New_Node_Debugging_Output
56 -- break nnd if n = 12345
57 -- and run gnat1 again from the beginning.
59 -- The other way is to set a breakpoint near the beginning (e.g. on
60 -- gnat1drv), and run. Then set Watch_Node (nickname "ww") to 12345 in gdb:
62 -- and set a breakpoint on New_Node_Breakpoint (nickname "nn"). Continue.
64 -- Either way, gnat1 will stop when node 12345 is created
66 -- The second method is faster
68 ww
: Node_Id
'Base := Node_Id
'First - 1;
69 pragma Export
(Ada
, ww
); -- trick the optimizer
70 Watch_Node
: Node_Id
'Base renames ww
;
71 -- Node to "watch"; that is, whenever a node is created, we check if it is
72 -- equal to Watch_Node, and if so, call New_Node_Breakpoint. You have
73 -- presumably set a breakpoint on New_Node_Breakpoint. Note that the
74 -- initial value of Node_Id'First - 1 ensures that by default, no node
75 -- will be equal to Watch_Node.
78 pragma Export
(Ada
, nn
);
79 procedure New_Node_Breakpoint
renames nn
;
80 -- This doesn't do anything interesting; it's just for setting breakpoint
81 -- on as explained above.
83 procedure nnd
(N
: Node_Id
);
84 pragma Export
(Ada
, nnd
);
85 procedure New_Node_Debugging_Output
(N
: Node_Id
) renames nnd
;
86 -- For debugging. If debugging is turned on, New_Node and New_Entity call
87 -- this. If debug flag N is turned on, this prints out the new node.
89 -- If Node = Watch_Node, this prints out the new node and calls
90 -- New_Node_Breakpoint. Otherwise, does nothing.
92 -----------------------------
93 -- Local Objects and Types --
94 -----------------------------
97 -- Count allocated nodes for Num_Nodes function
100 -- We are allowed to see these from within our own body!
102 use Atree_Private_Part
;
103 -- We are also allowed to see our private data structures!
105 -- Functions used to store Entity_Kind value in Nkind field
107 -- The following declarations are used to store flags 65-72 in the
108 -- Nkind field of the third component of an extended (entity) node.
110 type Flag_Byte
is record
121 pragma Pack
(Flag_Byte
);
122 for Flag_Byte
'Size use 8;
124 type Flag_Byte_Ptr
is access all Flag_Byte
;
125 type Node_Kind_Ptr
is access all Node_Kind
;
127 function To_Flag_Byte
is new
128 Unchecked_Conversion
(Node_Kind
, Flag_Byte
);
130 function To_Flag_Byte_Ptr
is new
131 Unchecked_Conversion
(Node_Kind_Ptr
, Flag_Byte_Ptr
);
133 -- The following declarations are used to store flags 73-96 and the
134 -- Convention field in the Field12 field of the third component of an
135 -- extended (Entity) node.
137 type Flag_Word
is record
165 Convention
: Convention_Id
;
168 pragma Pack
(Flag_Word
);
169 for Flag_Word
'Size use 32;
170 for Flag_Word
'Alignment use 4;
172 type Flag_Word_Ptr
is access all Flag_Word
;
173 type Union_Id_Ptr
is access all Union_Id
;
175 function To_Flag_Word
is new
176 Unchecked_Conversion
(Union_Id
, Flag_Word
);
178 function To_Flag_Word_Ptr
is new
179 Unchecked_Conversion
(Union_Id_Ptr
, Flag_Word_Ptr
);
181 -- The following declarations are used to store flags 97-128 in the
182 -- Field12 field of the fourth component of an extended (entity) node.
184 type Flag_Word2
is record
222 pragma Pack
(Flag_Word2
);
223 for Flag_Word2
'Size use 32;
224 for Flag_Word2
'Alignment use 4;
226 type Flag_Word2_Ptr
is access all Flag_Word2
;
228 function To_Flag_Word2
is new
229 Unchecked_Conversion
(Union_Id
, Flag_Word2
);
231 function To_Flag_Word2_Ptr
is new
232 Unchecked_Conversion
(Union_Id_Ptr
, Flag_Word2_Ptr
);
234 -- The following declarations are used to store flags 152-183 in the
235 -- Field11 field of the fourth component of an extended (entity) node.
237 type Flag_Word3
is record
275 pragma Pack
(Flag_Word3
);
276 for Flag_Word3
'Size use 32;
277 for Flag_Word3
'Alignment use 4;
279 type Flag_Word3_Ptr
is access all Flag_Word3
;
281 function To_Flag_Word3
is new
282 Unchecked_Conversion
(Union_Id
, Flag_Word3
);
284 function To_Flag_Word3_Ptr
is new
285 Unchecked_Conversion
(Union_Id_Ptr
, Flag_Word3_Ptr
);
287 -- The following declarations are used to store flags 184-215 in the
288 -- Field11 field of the fifth component of an extended (entity) node.
290 type Flag_Word4
is record
328 pragma Pack
(Flag_Word4
);
329 for Flag_Word4
'Size use 32;
330 for Flag_Word4
'Alignment use 4;
332 type Flag_Word4_Ptr
is access all Flag_Word4
;
334 function To_Flag_Word4
is new
335 Unchecked_Conversion
(Union_Id
, Flag_Word4
);
337 function To_Flag_Word4_Ptr
is new
338 Unchecked_Conversion
(Union_Id_Ptr
, Flag_Word4_Ptr
);
340 -- The following declarations are used to store flags 216-247 in the
341 -- Field12 field of the fifth component of an extended (entity) node.
343 type Flag_Word5
is record
381 pragma Pack
(Flag_Word5
);
382 for Flag_Word5
'Size use 32;
383 for Flag_Word5
'Alignment use 4;
385 type Flag_Word5_Ptr
is access all Flag_Word5
;
387 function To_Flag_Word5
is new
388 Unchecked_Conversion
(Union_Id
, Flag_Word5
);
390 function To_Flag_Word5_Ptr
is new
391 Unchecked_Conversion
(Union_Id_Ptr
, Flag_Word5_Ptr
);
393 --------------------------------------------------
394 -- Implementation of Tree Substitution Routines --
395 --------------------------------------------------
397 -- A separate table keeps track of the mapping between rewritten nodes
398 -- and their corresponding original tree nodes. Rewrite makes an entry
399 -- in this table for use by Original_Node. By default, if no call is
400 -- Rewrite, the entry in this table points to the original unwritten node.
402 -- Note: eventually, this should be a field in the Node directly, but
403 -- for now we do not want to disturb the efficiency of a power of 2
406 package Orig_Nodes
is new Table
.Table
(
407 Table_Component_Type
=> Node_Id
,
408 Table_Index_Type
=> Node_Id
'Base,
409 Table_Low_Bound
=> First_Node_Id
,
410 Table_Initial
=> Alloc
.Orig_Nodes_Initial
,
411 Table_Increment
=> Alloc
.Orig_Nodes_Increment
,
412 Table_Name
=> "Orig_Nodes");
414 --------------------------
415 -- Paren_Count Handling --
416 --------------------------
418 -- As noted in the spec, the paren count in a sub-expression node has
419 -- four possible values 0,1,2, and 3. The value 3 really means 3 or more,
420 -- and we use an auxiliary serially scanned table to record the actual
421 -- count. A serial search is fine, only pathological programs will use
422 -- entries in this table. Normal programs won't use it at all.
424 type Paren_Count_Entry
is record
426 -- The node to which this count applies
428 Count
: Nat
range 3 .. Nat
'Last;
429 -- The count of parentheses, which will be in the indicated range
432 package Paren_Counts
is new Table
.Table
(
433 Table_Component_Type
=> Paren_Count_Entry
,
434 Table_Index_Type
=> Int
,
435 Table_Low_Bound
=> 0,
437 Table_Increment
=> 200,
438 Table_Name
=> "Paren_Counts");
440 -----------------------
441 -- Local Subprograms --
442 -----------------------
444 procedure Fix_Parents
(Ref_Node
, Fix_Node
: Node_Id
);
445 -- Fixup parent pointers for the syntactic children of Fix_Node after
446 -- a copy, setting them to Fix_Node when they pointed to Ref_Node.
448 function Allocate_Initialize_Node
450 With_Extension
: Boolean) return Node_Id
;
451 -- Allocate a new node or node extension. If Src is not empty,
452 -- the information for the newly-allocated node is copied from it.
454 ------------------------------
455 -- Allocate_Initialize_Node --
456 ------------------------------
458 function Allocate_Initialize_Node
460 With_Extension
: Boolean) return Node_Id
462 New_Id
: Node_Id
:= Src
;
463 Nod
: Node_Record
:= Default_Node
;
464 Ext1
: Node_Record
:= Default_Node_Extension
;
465 Ext2
: Node_Record
:= Default_Node_Extension
;
466 Ext3
: Node_Record
:= Default_Node_Extension
;
467 Ext4
: Node_Record
:= Default_Node_Extension
;
470 if Present
(Src
) then
471 Nod
:= Nodes
.Table
(Src
);
473 if Has_Extension
(Src
) then
474 Ext1
:= Nodes
.Table
(Src
+ 1);
475 Ext2
:= Nodes
.Table
(Src
+ 2);
476 Ext3
:= Nodes
.Table
(Src
+ 3);
477 Ext4
:= Nodes
.Table
(Src
+ 4);
481 if not (Present
(Src
)
482 and then not Has_Extension
(Src
)
483 and then With_Extension
484 and then Src
= Nodes
.Last
)
486 -- We are allocating a new node, or extending a node
487 -- other than Nodes.Last.
490 New_Id
:= Nodes
.Last
;
491 Orig_Nodes
.Append
(New_Id
);
492 Node_Count
:= Node_Count
+ 1;
495 -- Specifically copy Paren_Count to deal with creating new table entry
496 -- if the parentheses count is at the maximum possible value already.
498 if Present
(Src
) and then Nkind
(Src
) in N_Subexpr
then
499 Set_Paren_Count
(New_Id
, Paren_Count
(Src
));
502 -- Set extension nodes if required
504 if With_Extension
then
511 Orig_Nodes
.Set_Last
(Nodes
.Last
);
512 Allocate_List_Tables
(Nodes
.Last
);
514 end Allocate_Initialize_Node
;
520 function Analyzed
(N
: Node_Id
) return Boolean is
522 pragma Assert
(N
<= Nodes
.Last
);
523 return Nodes
.Table
(N
).Analyzed
;
526 --------------------------
527 -- Basic_Set_Convention --
528 --------------------------
530 procedure Basic_Set_Convention
(E
: Entity_Id
; Val
: Convention_Id
) is
532 pragma Assert
(Nkind
(E
) in N_Entity
);
535 (Nodes.Table (E + 2).Field12'Unrestricted_Access)).Convention := Val;
536 end Basic_Set_Convention;
542 procedure Change_Node (N : Node_Id; New_Node_Kind : Node_Kind) is
543 Save_Sloc : constant Source_Ptr := Sloc (N);
544 Save_In_List : constant Boolean := Nodes.Table (N).In_List;
545 Save_Link : constant Union_Id := Nodes.Table (N).Link;
546 Save_CFS : constant Boolean := Nodes.Table (N).Comes_From_Source;
547 Save_Posted : constant Boolean := Nodes.Table (N).Error_Posted;
548 Par_Count : Nat := 0;
551 if Nkind (N) in N_Subexpr then
552 Par_Count := Paren_Count (N);
555 Nodes.Table (N) := Default_Node;
556 Nodes.Table (N).Sloc := Save_Sloc;
557 Nodes.Table (N).In_List := Save_In_List;
558 Nodes.Table (N).Link := Save_Link;
559 Nodes.Table (N).Comes_From_Source := Save_CFS;
560 Nodes.Table (N).Nkind := New_Node_Kind;
561 Nodes.Table (N).Error_Posted := Save_Posted;
563 if New_Node_Kind in N_Subexpr then
564 Set_Paren_Count (N, Par_Count);
568 -----------------------
569 -- Comes_From_Source --
570 -----------------------
572 function Comes_From_Source (N : Node_Id) return Boolean is
574 pragma Assert (N <= Nodes.Last);
575 return Nodes.Table (N).Comes_From_Source;
576 end Comes_From_Source;
582 function Convention (E : Entity_Id) return Convention_Id is
584 pragma Assert (Nkind (E) in N_Entity);
585 return To_Flag_Word (Nodes.Table (E + 2).Field12).Convention;
592 procedure Copy_Node (Source : Node_Id; Destination : Node_Id) is
593 Save_In_List : constant Boolean := Nodes.Table (Destination).In_List;
594 Save_Link : constant Union_Id := Nodes.Table (Destination).Link;
597 Nodes.Table (Destination) := Nodes.Table (Source);
598 Nodes.Table (Destination).In_List := Save_In_List;
599 Nodes.Table (Destination).Link := Save_Link;
601 -- Specifically set Paren_Count to make sure auxiliary table entry
602 -- gets correctly made if the parentheses count is at the max value.
604 if Nkind (Destination) in N_Subexpr then
605 Set_Paren_Count (Destination, Paren_Count (Source));
608 -- Deal with copying extension nodes if present
610 if Has_Extension (Source) then
611 pragma Assert (Has_Extension (Destination));
612 Nodes.Table (Destination + 1) := Nodes.Table (Source + 1);
613 Nodes.Table (Destination + 2) := Nodes.Table (Source + 2);
614 Nodes.Table (Destination + 3) := Nodes.Table (Source + 3);
615 Nodes.Table (Destination + 4) := Nodes.Table (Source + 4);
618 pragma Assert (not Has_Extension (Source));
623 ------------------------
624 -- Copy_Separate_Tree --
625 ------------------------
627 function Copy_Separate_Tree (Source : Node_Id) return Node_Id is
630 function Copy_Entity (E : Entity_Id) return Entity_Id;
631 -- Copy Entity, copying only the Ekind and Chars fields
633 function Copy_List (List : List_Id) return List_Id;
636 function Possible_Copy (Field : Union_Id) return Union_Id;
637 -- Given a field, returns a copy of the node or list if its parent
638 -- is the current source node, and otherwise returns the input
644 function Copy_Entity (E : Entity_Id) return Entity_Id is
648 case N_Entity (Nkind (E)) is
649 when N_Defining_Identifier =>
650 New_Ent := New_Entity (N_Defining_Identifier, Sloc (E));
652 when N_Defining_Character_Literal =>
653 New_Ent := New_Entity (N_Defining_Character_Literal, Sloc (E));
655 when N_Defining_Operator_Symbol =>
656 New_Ent := New_Entity (N_Defining_Operator_Symbol, Sloc (E));
659 Set_Chars (New_Ent, Chars (E));
667 function Copy_List (List : List_Id) return List_Id is
672 if List = No_List then
679 while Present (E) loop
680 if Has_Extension (E) then
681 Append (Copy_Entity (E), NL);
683 Append (Copy_Separate_Tree (E), NL);
697 function Possible_Copy (Field : Union_Id) return Union_Id is
701 if Field in Node_Range then
702 New_N := Union_Id (Copy_Separate_Tree (Node_Id (Field)));
704 if Parent (Node_Id (Field)) = Source then
705 Set_Parent (Node_Id (New_N), New_Id);
710 elsif Field in List_Range then
711 New_N := Union_Id (Copy_List (List_Id (Field)));
713 if Parent (List_Id (Field)) = Source then
714 Set_Parent (List_Id (New_N), New_Id);
724 -- Start of processing for Copy_Separate_Tree
727 if Source <= Empty_Or_Error then
730 elsif Has_Extension (Source) then
731 return Copy_Entity (Source);
734 New_Id := New_Copy (Source);
736 -- Recursively copy descendents
738 Set_Field1 (New_Id, Possible_Copy (Field1 (New_Id)));
739 Set_Field2 (New_Id, Possible_Copy (Field2 (New_Id)));
740 Set_Field3 (New_Id, Possible_Copy (Field3 (New_Id)));
741 Set_Field4 (New_Id, Possible_Copy (Field4 (New_Id)));
742 Set_Field5 (New_Id, Possible_Copy (Field5 (New_Id)));
744 -- Set Entity field to Empty
745 -- Why is this done??? and why is it always right to do it???
747 if Nkind (New_Id) in N_Has_Entity
748 or else Nkind (New_Id) = N_Freeze_Entity
750 Set_Entity (New_Id, Empty);
753 -- All done, return copied node
757 end Copy_Separate_Tree;
763 function Ekind (E : Entity_Id) return Entity_Kind is
765 pragma Assert (Nkind (E) in N_Entity);
766 return N_To_E (Nodes.Table (E + 1).Nkind);
773 function Error_Posted (N : Node_Id) return Boolean is
775 pragma Assert (N <= Nodes.Last);
776 return Nodes.Table (N).Error_Posted;
779 -----------------------
780 -- Exchange_Entities --
781 -----------------------
783 procedure Exchange_Entities (E1 : Entity_Id; E2 : Entity_Id) is
784 Temp_Ent : Node_Record;
787 pragma Assert (Has_Extension (E1)
788 and then Has_Extension (E2)
789 and then not Nodes.Table (E1).In_List
790 and then not Nodes.Table (E2).In_List);
792 -- Exchange the contents of the two entities
794 Temp_Ent := Nodes.Table (E1);
795 Nodes.Table (E1) := Nodes.Table (E2);
796 Nodes.Table (E2) := Temp_Ent;
797 Temp_Ent := Nodes.Table (E1 + 1);
798 Nodes.Table (E1 + 1) := Nodes.Table (E2 + 1);
799 Nodes.Table (E2 + 1) := Temp_Ent;
800 Temp_Ent := Nodes.Table (E1 + 2);
801 Nodes.Table (E1 + 2) := Nodes.Table (E2 + 2);
802 Nodes.Table (E2 + 2) := Temp_Ent;
803 Temp_Ent := Nodes.Table (E1 + 3);
804 Nodes.Table (E1 + 3) := Nodes.Table (E2 + 3);
805 Nodes.Table (E2 + 3) := Temp_Ent;
806 Temp_Ent := Nodes.Table (E1 + 4);
807 Nodes.Table (E1 + 4) := Nodes.Table (E2 + 4);
808 Nodes.Table (E2 + 4) := Temp_Ent;
810 -- That exchange exchanged the parent pointers as well, which is what
811 -- we want, but we need to patch up the defining identifier pointers
812 -- in the parent nodes (the child pointers) to match this switch
813 -- unless for Implicit types entities which have no parent, in which
814 -- case we don't do anything otherwise we won't be able to revert back
815 -- to the original situation.
817 -- Shouldn't this use Is_Itype instead of the Parent test
819 if Present (Parent (E1)) and then Present (Parent (E2)) then
820 Set_Defining_Identifier (Parent (E1), E1);
821 Set_Defining_Identifier (Parent (E2), E2);
823 end Exchange_Entities;
829 function Extend_Node (Node : Node_Id) return Entity_Id is
832 procedure Debug_Extend_Node;
833 pragma Inline (Debug_Extend_Node);
834 -- Debug routine for debug flag N
836 -----------------------
837 -- Debug_Extend_Node --
838 -----------------------
840 procedure Debug_Extend_Node is
843 Write_Str ("Extend node ");
844 Write_Int (Int (Node));
846 if Result = Node then
847 Write_Str (" in place");
849 Write_Str (" copied to ");
850 Write_Int (Int (Result));
855 end Debug_Extend_Node;
857 -- Start of processing for Extend_Node
860 pragma Assert (not (Has_Extension (Node)));
861 Result := Allocate_Initialize_Node (Node, With_Extension => True);
862 pragma Debug (Debug_Extend_Node);
870 procedure Fix_Parents (Ref_Node, Fix_Node : Node_Id) is
872 procedure Fix_Parent (Field : Union_Id);
873 -- Fixup one parent pointer. Field is checked to see if it points to
874 -- a node, list, or element list that has a parent that points to
875 -- Ref_Node. If so, the parent is reset to point to Fix_Node.
881 procedure Fix_Parent (Field : Union_Id) is
883 -- Fix parent of node that is referenced by Field. Note that we must
884 -- exclude the case where the node is a member of a list, because in
885 -- this case the parent is the parent of the list.
887 if Field in Node_Range
888 and then Present (Node_Id (Field))
889 and then not Nodes.Table (Node_Id (Field)).In_List
890 and then Parent (Node_Id (Field)) = Ref_Node
892 Set_Parent (Node_Id (Field), Fix_Node);
894 -- Fix parent of list that is referenced by Field
896 elsif Field in List_Range
897 and then Present (List_Id (Field))
898 and then Parent (List_Id (Field)) = Ref_Node
900 Set_Parent (List_Id (Field), Fix_Node);
904 -- Start of processing for Fix_Parents
907 Fix_Parent (Field1 (Fix_Node));
908 Fix_Parent (Field2 (Fix_Node));
909 Fix_Parent (Field3 (Fix_Node));
910 Fix_Parent (Field4 (Fix_Node));
911 Fix_Parent (Field5 (Fix_Node));
914 -----------------------------------
915 -- Get_Comes_From_Source_Default --
916 -----------------------------------
918 function Get_Comes_From_Source_Default return Boolean is
920 return Default_Node.Comes_From_Source;
921 end Get_Comes_From_Source_Default;
927 function Has_Extension (N : Node_Id) return Boolean is
929 return N < Nodes.Last and then Nodes.Table (N + 1).Is_Extension;
936 procedure Initialize is
938 pragma Warnings (Off, Dummy);
942 Atree_Private_Part.Nodes.Init;
946 -- Allocate Empty node
948 Dummy := New_Node (N_Empty, No_Location);
949 Set_Name1 (Empty, No_Name);
951 -- Allocate Error node, and set Error_Posted, since we certainly
952 -- only generate an Error node if we do post some kind of error!
954 Dummy := New_Node (N_Error, No_Location);
955 Set_Name1 (Error, Error_Name);
956 Set_Error_Posted (Error, True);
959 --------------------------
960 -- Is_Rewrite_Insertion --
961 --------------------------
963 function Is_Rewrite_Insertion (Node : Node_Id) return Boolean is
965 return Nodes.Table (Node).Rewrite_Ins;
966 end Is_Rewrite_Insertion;
968 -----------------------------
969 -- Is_Rewrite_Substitution --
970 -----------------------------
972 function Is_Rewrite_Substitution (Node : Node_Id) return Boolean is
974 return Orig_Nodes.Table (Node) /= Node;
975 end Is_Rewrite_Substitution;
981 function Last_Node_Id return Node_Id is
992 Nodes.Locked := True;
993 Orig_Nodes.Locked := True;
998 ----------------------------
999 -- Mark_Rewrite_Insertion --
1000 ----------------------------
1002 procedure Mark_Rewrite_Insertion (New_Node : Node_Id) is
1004 Nodes.Table (New_Node).Rewrite_Ins := True;
1005 end Mark_Rewrite_Insertion;
1011 function New_Copy (Source : Node_Id) return Node_Id is
1012 New_Id : Node_Id := Source;
1015 if Source > Empty_Or_Error then
1017 New_Id := Allocate_Initialize_Node (Source, Has_Extension (Source));
1019 Nodes.Table (New_Id).Link := Empty_List_Or_Node;
1020 Nodes.Table (New_Id).In_List := False;
1022 -- If the original is marked as a rewrite insertion, then unmark
1023 -- the copy, since we inserted the original, not the copy.
1025 Nodes.Table (New_Id).Rewrite_Ins := False;
1026 pragma Debug (New_Node_Debugging_Output (New_Id));
1037 (New_Node_Kind : Node_Kind;
1038 New_Sloc : Source_Ptr) return Entity_Id
1043 pragma Assert (New_Node_Kind in N_Entity);
1045 Ent := Allocate_Initialize_Node (Empty, With_Extension => True);
1047 -- If this is a node with a real location and we are generating
1048 -- source nodes, then reset Current_Error_Node. This is useful
1049 -- if we bomb during parsing to get a error location for the bomb.
1051 if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
1052 Current_Error_Node := Ent;
1055 Nodes.Table (Ent).Nkind := New_Node_Kind;
1056 Nodes.Table (Ent).Sloc := New_Sloc;
1057 pragma Debug (New_Node_Debugging_Output (Ent));
1067 (New_Node_Kind : Node_Kind;
1068 New_Sloc : Source_Ptr) return Node_Id
1073 pragma Assert (New_Node_Kind not in N_Entity);
1074 Nod := Allocate_Initialize_Node (Empty, With_Extension => False);
1075 Nodes.Table (Nod).Nkind := New_Node_Kind;
1076 Nodes.Table (Nod).Sloc := New_Sloc;
1077 pragma Debug (New_Node_Debugging_Output (Nod));
1079 -- If this is a node with a real location and we are generating source
1080 -- nodes, then reset Current_Error_Node. This is useful if we bomb
1081 -- during parsing to get an error location for the bomb.
1083 if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
1084 Current_Error_Node := Nod;
1090 -------------------------
1091 -- New_Node_Breakpoint --
1092 -------------------------
1094 procedure nn is -- New_Node_Breakpoint
1096 Write_Str ("Watched node ");
1097 Write_Int (Int (Watch_Node));
1098 Write_Str (" created");
1102 -------------------------------
1103 -- New_Node_Debugging_Output --
1104 -------------------------------
1106 procedure nnd (N : Node_Id) is -- New_Node_Debugging_Output
1107 Node_Is_Watched : constant Boolean := N = Watch_Node;
1110 if Debug_Flag_N or else Node_Is_Watched then
1111 Write_Str ("Allocate ");
1113 if Nkind (N) in N_Entity then
1114 Write_Str ("entity");
1119 Write_Str (", Id = ");
1120 Write_Int (Int (N));
1122 Write_Location (Sloc (N));
1124 Write_Str (Node_Kind'Image (Nkind (N)));
1127 if Node_Is_Watched then
1128 New_Node_Breakpoint;
1137 function Nkind (N : Node_Id) return Node_Kind is
1139 return Nodes.Table (N).Nkind;
1149 V2 : Node_Kind) return Boolean
1152 return Nkind_In (Nkind (N), V1, V2);
1159 V3 : Node_Kind) return Boolean
1162 return Nkind_In (Nkind (N), V1, V2, V3);
1170 V4 : Node_Kind) return Boolean
1173 return Nkind_In (Nkind (N), V1, V2, V3, V4);
1182 V5 : Node_Kind) return Boolean
1185 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5);
1195 V6 : Node_Kind) return Boolean
1198 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6);
1209 V7 : Node_Kind) return Boolean
1212 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7);
1224 V8 : Node_Kind) return Boolean
1227 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7, V8);
1234 function No (N : Node_Id) return Boolean is
1243 function Nodes_Address return System.Address is
1245 return Nodes.Table (First_Node_Id)'Address;
1252 function Num_Nodes return Nat is
1261 function Original_Node (Node : Node_Id) return Node_Id is
1263 return Orig_Nodes.Table (Node);
1270 function Paren_Count (N : Node_Id) return Nat is
1274 pragma Assert (N <= Nodes.Last);
1276 if Nodes.Table (N).Pflag1 then
1280 if Nodes.Table (N).Pflag2 then
1284 -- Value of 0,1,2 returned as is
1289 -- Value of 3 means we search the table, and we must find an entry
1292 for J in Paren_Counts.First .. Paren_Counts.Last loop
1293 if N = Paren_Counts.Table (J).Nod then
1294 return Paren_Counts.Table (J).Count;
1298 raise Program_Error;
1306 function Parent (N : Node_Id) return Node_Id is
1308 if Is_List_Member (N) then
1309 return Parent (List_Containing (N));
1311 return Node_Id (Nodes.Table (N).Link);
1319 function Present (N : Node_Id) return Boolean is
1324 --------------------------------
1325 -- Preserve_Comes_From_Source --
1326 --------------------------------
1328 procedure Preserve_Comes_From_Source (NewN, OldN : Node_Id) is
1330 Nodes.Table (NewN).Comes_From_Source :=
1331 Nodes.Table (OldN).Comes_From_Source;
1332 end Preserve_Comes_From_Source;
1338 function Relocate_Node (Source : Node_Id) return Node_Id is
1346 New_Node := New_Copy (Source);
1347 Fix_Parents (Ref_Node => Source, Fix_Node => New_Node);
1349 -- We now set the parent of the new node to be the same as the
1350 -- parent of the source. Almost always this parent will be
1351 -- replaced by a new value when the relocated node is reattached
1352 -- to the tree, but by doing it now, we ensure that this node is
1353 -- not even temporarily disconnected from the tree. Note that this
1354 -- does not happen free, because in the list case, the parent does
1357 Set_Parent (New_Node, Parent (Source));
1359 -- If the node being relocated was a rewriting of some original
1360 -- node, then the relocated node has the same original node.
1362 if Orig_Nodes.Table (Source) /= Source then
1363 Orig_Nodes.Table (New_Node) := Orig_Nodes.Table (Source);
1373 procedure Replace (Old_Node, New_Node : Node_Id) is
1374 Old_Post : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
1375 Old_CFS : constant Boolean := Nodes.Table (Old_Node).Comes_From_Source;
1379 (not Has_Extension (Old_Node)
1380 and not Has_Extension (New_Node)
1381 and not Nodes.Table (New_Node).In_List);
1383 -- Do copy, preserving link and in list status and comes from source
1385 Copy_Node (Source => New_Node, Destination => Old_Node);
1386 Nodes.Table (Old_Node).Comes_From_Source := Old_CFS;
1387 Nodes.Table (Old_Node).Error_Posted := Old_Post;
1389 -- Fix parents of substituted node, since it has changed identity
1391 Fix_Parents (Ref_Node => New_Node, Fix_Node => Old_Node);
1393 -- Since we are doing a replace, we assume that the original node
1394 -- is intended to become the new replaced node. The call would be
1395 -- to Rewrite if there were an intention to save the original node.
1397 Orig_Nodes.Table (Old_Node) := Old_Node;
1404 procedure Rewrite (Old_Node, New_Node : Node_Id) is
1405 Old_Error_P : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
1406 -- This fields is always preserved in the new node
1408 Old_Paren_Count : Nat;
1409 Old_Must_Not_Freeze : Boolean;
1410 -- These fields are preserved in the new node only if the new node
1411 -- and the old node are both subexpression nodes.
1413 -- Note: it is a violation of abstraction levels for Must_Not_Freeze
1414 -- to be referenced like this. ???
1420 (not Has_Extension (Old_Node)
1421 and not Has_Extension (New_Node)
1422 and not Nodes.Table (New_Node).In_List);
1424 if Nkind (Old_Node) in N_Subexpr then
1425 Old_Paren_Count := Paren_Count (Old_Node);
1426 Old_Must_Not_Freeze := Must_Not_Freeze (Old_Node);
1428 Old_Paren_Count := 0;
1429 Old_Must_Not_Freeze := False;
1432 -- Allocate a new node, to be used to preserve the original contents
1433 -- of the Old_Node, for possible later retrival by Original_Node and
1434 -- make an entry in the Orig_Nodes table. This is only done if we have
1435 -- not already rewritten the node, as indicated by an Orig_Nodes entry
1436 -- that does not reference the Old_Node.
1438 if Orig_Nodes.Table (Old_Node) = Old_Node then
1439 Sav_Node := New_Copy (Old_Node);
1440 Orig_Nodes.Table (Sav_Node) := Sav_Node;
1441 Orig_Nodes.Table (Old_Node) := Sav_Node;
1444 -- Copy substitute node into place, preserving old fields as required
1446 Copy_Node (Source => New_Node, Destination => Old_Node);
1447 Nodes.Table (Old_Node).Error_Posted := Old_Error_P;
1449 if Nkind (New_Node) in N_Subexpr then
1450 Set_Paren_Count (Old_Node, Old_Paren_Count);
1451 Set_Must_Not_Freeze (Old_Node, Old_Must_Not_Freeze);
1454 Fix_Parents (Ref_Node => New_Node, Fix_Node => Old_Node);
1461 procedure Set_Analyzed (N : Node_Id; Val : Boolean := True) is
1463 Nodes.Table (N).Analyzed := Val;
1466 ---------------------------
1467 -- Set_Comes_From_Source --
1468 ---------------------------
1470 procedure Set_Comes_From_Source (N : Node_Id; Val : Boolean) is
1472 pragma Assert (N <= Nodes.Last);
1473 Nodes.Table (N).Comes_From_Source := Val;
1474 end Set_Comes_From_Source;
1476 -----------------------------------
1477 -- Set_Comes_From_Source_Default --
1478 -----------------------------------
1480 procedure Set_Comes_From_Source_Default (Default : Boolean) is
1482 Default_Node.Comes_From_Source := Default;
1483 end Set_Comes_From_Source_Default;
1489 procedure Set_Ekind (E : Entity_Id; Val : Entity_Kind) is
1491 pragma Assert (Nkind (E) in N_Entity);
1492 Nodes.Table (E + 1).Nkind := E_To_N (Val);
1495 ----------------------
1496 -- Set_Error_Posted --
1497 ----------------------
1499 procedure Set_Error_Posted (N : Node_Id; Val : Boolean := True) is
1501 Nodes.Table (N).Error_Posted := Val;
1502 end Set_Error_Posted;
1504 ---------------------
1505 -- Set_Paren_Count --
1506 ---------------------
1508 procedure Set_Paren_Count (N : Node_Id; Val : Nat) is
1510 pragma Assert (Nkind (N) in N_Subexpr);
1512 -- Value of 0,1,2 stored as is
1515 Nodes.Table (N).Pflag1 := (Val mod 2 /= 0);
1516 Nodes.Table (N).Pflag2 := (Val = 2);
1518 -- Value of 3 or greater stores 3 in node and makes table entry
1521 Nodes.Table (N).Pflag1 := True;
1522 Nodes.Table (N).Pflag2 := True;
1524 for J in Paren_Counts.First .. Paren_Counts.Last loop
1525 if N = Paren_Counts.Table (J).Nod then
1526 Paren_Counts.Table (J).Count := Val;
1531 Paren_Counts.Append ((Nod => N, Count => Val));
1533 end Set_Paren_Count;
1539 procedure Set_Parent (N : Node_Id; Val : Node_Id) is
1541 pragma Assert (not Nodes.Table (N).In_List);
1542 Nodes.Table (N).Link := Union_Id (Val);
1549 procedure Set_Sloc (N : Node_Id; Val : Source_Ptr) is
1551 Nodes.Table (N).Sloc := Val;
1558 function Sloc (N : Node_Id) return Source_Ptr is
1560 return Nodes.Table (N).Sloc;
1567 function Traverse_Func (Node : Node_Id) return Traverse_Final_Result is
1569 function Traverse_Field
1572 FN : Field_Num) return Traverse_Final_Result;
1573 -- Fld is one of the fields of Nod. If the field points to syntactic
1574 -- node or list, then this node or list is traversed, and the result is
1575 -- the result of this traversal. Otherwise a value of True is returned
1576 -- with no processing. FN is the number of the field (1 .. 5).
1578 --------------------
1579 -- Traverse_Field --
1580 --------------------
1582 function Traverse_Field
1585 FN : Field_Num) return Traverse_Final_Result
1588 if Fld = Union_Id (Empty) then
1591 -- Descendent is a node
1593 elsif Fld in Node_Range then
1595 -- Traverse descendent that is syntactic subtree node
1597 if Is_Syntactic_Field (Nkind (Nod), FN) then
1598 return Traverse_Func (Node_Id (Fld));
1600 -- Node that is not a syntactic subtree
1606 -- Descendent is a list
1608 elsif Fld in List_Range then
1610 -- Traverse descendent that is a syntactic subtree list
1612 if Is_Syntactic_Field (Nkind (Nod), FN) then
1614 Elmt : Node_Id := First (List_Id (Fld));
1616 while Present (Elmt) loop
1617 if Traverse_Func (Elmt) = Abandon then
1627 -- List that is not a syntactic subtree
1633 -- Field was not a node or a list
1640 Cur_Node : Node_Id := Node;
1642 -- Start of processing for Traverse_Func
1645 -- We walk Field2 last, and if it is a node, we eliminate the tail
1646 -- recursion by jumping back to this label. This is because Field2 is
1647 -- where the Left_Opnd field of N_Op_Concat is stored, and in practice
1648 -- concatenations are sometimes deeply nested, as in X1&X2&...&XN. This
1649 -- trick prevents us from running out of memory in that case. We don't
1650 -- bother eliminating the tail recursion if Field2 is a list.
1654 case Process (Cur_Node) is
1665 Cur_Node := Original_Node (Cur_Node);
1668 if Traverse_Field (Cur_Node, Field1 (Cur_Node), 1) = Abandon
1669 or else -- skip Field2 here
1670 Traverse_Field (Cur_Node, Field3 (Cur_Node), 3) = Abandon
1672 Traverse_Field (Cur_Node, Field4 (Cur_Node), 4) = Abandon
1674 Traverse_Field (Cur_Node, Field5 (Cur_Node), 5) = Abandon
1679 if Field2 (Cur_Node) not in Node_Range then
1680 return Traverse_Field (Cur_Node, Field2 (Cur_Node), 2);
1682 elsif Is_Syntactic_Field (Nkind (Cur_Node), 2)
1683 and then Field2 (Cur_Node) /= Empty_List_Or_Node
1685 -- Here is the tail recursion step, we reset Cur_Node and jump back
1686 -- to the start of the procedure, which has the same semantic effect
1689 Cur_Node := Node_Id (Field2 (Cur_Node));
1700 procedure Traverse_Proc (Node : Node_Id) is
1701 function Traverse is new Traverse_Func (Process);
1702 Discard : Traverse_Final_Result;
1703 pragma Warnings (Off, Discard);
1705 Discard := Traverse (Node);
1712 procedure Tree_Read is
1714 Tree_Read_Int (Node_Count);
1716 Orig_Nodes.Tree_Read;
1717 Paren_Counts.Tree_Read;
1724 procedure Tree_Write is
1726 Tree_Write_Int (Node_Count);
1728 Orig_Nodes.Tree_Write;
1729 Paren_Counts.Tree_Write;
1732 ------------------------------
1733 -- Unchecked Access Package --
1734 ------------------------------
1736 package body Unchecked_Access is
1738 function Field1 (N : Node_Id) return Union_Id is
1740 pragma Assert (N <= Nodes.Last);
1741 return Nodes.Table (N).Field1;
1744 function Field2 (N : Node_Id) return Union_Id is
1746 pragma Assert (N <= Nodes.Last);
1747 return Nodes.Table (N).Field2;
1750 function Field3 (N : Node_Id) return Union_Id is
1752 pragma Assert (N <= Nodes.Last);
1753 return Nodes.Table (N).Field3;
1756 function Field4 (N : Node_Id) return Union_Id is
1758 pragma Assert (N <= Nodes.Last);
1759 return Nodes.Table (N).Field4;
1762 function Field5 (N : Node_Id) return Union_Id is
1764 pragma Assert (N <= Nodes.Last);
1765 return Nodes.Table (N).Field5;
1768 function Field6 (N : Node_Id) return Union_Id is
1770 pragma Assert (Nkind (N) in N_Entity);
1771 return Nodes.Table (N + 1).Field6;
1774 function Field7 (N : Node_Id) return Union_Id is
1776 pragma Assert (Nkind (N) in N_Entity);
1777 return Nodes.Table (N + 1).Field7;
1780 function Field8 (N : Node_Id) return Union_Id is
1782 pragma Assert (Nkind (N) in N_Entity);
1783 return Nodes.Table (N + 1).Field8;
1786 function Field9 (N : Node_Id) return Union_Id is
1788 pragma Assert (Nkind (N) in N_Entity);
1789 return Nodes.Table (N + 1).Field9;
1792 function Field10 (N : Node_Id) return Union_Id is
1794 pragma Assert (Nkind (N) in N_Entity);
1795 return Nodes.Table (N + 1).Field10;
1798 function Field11 (N : Node_Id) return Union_Id is
1800 pragma Assert (Nkind (N) in N_Entity);
1801 return Nodes.Table (N + 1).Field11;
1804 function Field12 (N : Node_Id) return Union_Id is
1806 pragma Assert (Nkind (N) in N_Entity);
1807 return Nodes.Table (N + 1).Field12;
1810 function Field13 (N : Node_Id) return Union_Id is
1812 pragma Assert (Nkind (N) in N_Entity);
1813 return Nodes.Table (N + 2).Field6;
1816 function Field14 (N : Node_Id) return Union_Id is
1818 pragma Assert (Nkind (N) in N_Entity);
1819 return Nodes.Table (N + 2).Field7;
1822 function Field15 (N : Node_Id) return Union_Id is
1824 pragma Assert (Nkind (N) in N_Entity);
1825 return Nodes.Table (N + 2).Field8;
1828 function Field16 (N : Node_Id) return Union_Id is
1830 pragma Assert (Nkind (N) in N_Entity);
1831 return Nodes.Table (N + 2).Field9;
1834 function Field17 (N : Node_Id) return Union_Id is
1836 pragma Assert (Nkind (N) in N_Entity);
1837 return Nodes.Table (N + 2).Field10;
1840 function Field18 (N : Node_Id) return Union_Id is
1842 pragma Assert (Nkind (N) in N_Entity);
1843 return Nodes.Table (N + 2).Field11;
1846 function Field19 (N : Node_Id) return Union_Id is
1848 pragma Assert (Nkind (N) in N_Entity);
1849 return Nodes.Table (N + 3).Field6;
1852 function Field20 (N : Node_Id) return Union_Id is
1854 pragma Assert (Nkind (N) in N_Entity);
1855 return Nodes.Table (N + 3).Field7;
1858 function Field21 (N : Node_Id) return Union_Id is
1860 pragma Assert (Nkind (N) in N_Entity);
1861 return Nodes.Table (N + 3).Field8;
1864 function Field22 (N : Node_Id) return Union_Id is
1866 pragma Assert (Nkind (N) in N_Entity);
1867 return Nodes.Table (N + 3).Field9;
1870 function Field23 (N : Node_Id) return Union_Id is
1872 pragma Assert (Nkind (N) in N_Entity);
1873 return Nodes.Table (N + 3).Field10;
1876 function Field24 (N : Node_Id) return Union_Id is
1878 pragma Assert (Nkind (N) in N_Entity);
1879 return Nodes.Table (N + 4).Field6;
1882 function Field25 (N : Node_Id) return Union_Id is
1884 pragma Assert (Nkind (N) in N_Entity);
1885 return Nodes.Table (N + 4).Field7;
1888 function Field26 (N : Node_Id) return Union_Id is
1890 pragma Assert (Nkind (N) in N_Entity);
1891 return Nodes.Table (N + 4).Field8;
1894 function Field27 (N : Node_Id) return Union_Id is
1896 pragma Assert (Nkind (N) in N_Entity);
1897 return Nodes.Table (N + 4).Field9;
1900 function Field28 (N : Node_Id) return Union_Id is
1902 pragma Assert (Nkind (N) in N_Entity);
1903 return Nodes.Table (N + 4).Field10;
1906 function Node1 (N : Node_Id) return Node_Id is
1908 pragma Assert (N <= Nodes.Last);
1909 return Node_Id (Nodes.Table (N).Field1);
1912 function Node2 (N : Node_Id) return Node_Id is
1914 pragma Assert (N <= Nodes.Last);
1915 return Node_Id (Nodes.Table (N).Field2);
1918 function Node3 (N : Node_Id) return Node_Id is
1920 pragma Assert (N <= Nodes.Last);
1921 return Node_Id (Nodes.Table (N).Field3);
1924 function Node4 (N : Node_Id) return Node_Id is
1926 pragma Assert (N <= Nodes.Last);
1927 return Node_Id (Nodes.Table (N).Field4);
1930 function Node5 (N : Node_Id) return Node_Id is
1932 pragma Assert (N <= Nodes.Last);
1933 return Node_Id (Nodes.Table (N).Field5);
1936 function Node6 (N : Node_Id) return Node_Id is
1938 pragma Assert (Nkind (N) in N_Entity);
1939 return Node_Id (Nodes.Table (N + 1).Field6);
1942 function Node7 (N : Node_Id) return Node_Id is
1944 pragma Assert (Nkind (N) in N_Entity);
1945 return Node_Id (Nodes.Table (N + 1).Field7);
1948 function Node8 (N : Node_Id) return Node_Id is
1950 pragma Assert (Nkind (N) in N_Entity);
1951 return Node_Id (Nodes.Table (N + 1).Field8);
1954 function Node9 (N : Node_Id) return Node_Id is
1956 pragma Assert (Nkind (N) in N_Entity);
1957 return Node_Id (Nodes.Table (N + 1).Field9);
1960 function Node10 (N : Node_Id) return Node_Id is
1962 pragma Assert (Nkind (N) in N_Entity);
1963 return Node_Id (Nodes.Table (N + 1).Field10);
1966 function Node11 (N : Node_Id) return Node_Id is
1968 pragma Assert (Nkind (N) in N_Entity);
1969 return Node_Id (Nodes.Table (N + 1).Field11);
1972 function Node12 (N : Node_Id) return Node_Id is
1974 pragma Assert (Nkind (N) in N_Entity);
1975 return Node_Id (Nodes.Table (N + 1).Field12);
1978 function Node13 (N : Node_Id) return Node_Id is
1980 pragma Assert (Nkind (N) in N_Entity);
1981 return Node_Id (Nodes.Table (N + 2).Field6);
1984 function Node14 (N : Node_Id) return Node_Id is
1986 pragma Assert (Nkind (N) in N_Entity);
1987 return Node_Id (Nodes.Table (N + 2).Field7);
1990 function Node15 (N : Node_Id) return Node_Id is
1992 pragma Assert (Nkind (N) in N_Entity);
1993 return Node_Id (Nodes.Table (N + 2).Field8);
1996 function Node16 (N : Node_Id) return Node_Id is
1998 pragma Assert (Nkind (N) in N_Entity);
1999 return Node_Id (Nodes.Table (N + 2).Field9);
2002 function Node17 (N : Node_Id) return Node_Id is
2004 pragma Assert (Nkind (N) in N_Entity);
2005 return Node_Id (Nodes.Table (N + 2).Field10);
2008 function Node18 (N : Node_Id) return Node_Id is
2010 pragma Assert (Nkind (N) in N_Entity);
2011 return Node_Id (Nodes.Table (N + 2).Field11);
2014 function Node19 (N : Node_Id) return Node_Id is
2016 pragma Assert (Nkind (N) in N_Entity);
2017 return Node_Id (Nodes.Table (N + 3).Field6);
2020 function Node20 (N : Node_Id) return Node_Id is
2022 pragma Assert (Nkind (N) in N_Entity);
2023 return Node_Id (Nodes.Table (N + 3).Field7);
2026 function Node21 (N : Node_Id) return Node_Id is
2028 pragma Assert (Nkind (N) in N_Entity);
2029 return Node_Id (Nodes.Table (N + 3).Field8);
2032 function Node22 (N : Node_Id) return Node_Id is
2034 pragma Assert (Nkind (N) in N_Entity);
2035 return Node_Id (Nodes.Table (N + 3).Field9);
2038 function Node23 (N : Node_Id) return Node_Id is
2040 pragma Assert (Nkind (N) in N_Entity);
2041 return Node_Id (Nodes.Table (N + 3).Field10);
2044 function Node24 (N : Node_Id) return Node_Id is
2046 pragma Assert (Nkind (N) in N_Entity);
2047 return Node_Id (Nodes.Table (N + 4).Field6);
2050 function Node25 (N : Node_Id) return Node_Id is
2052 pragma Assert (Nkind (N) in N_Entity);
2053 return Node_Id (Nodes.Table (N + 4).Field7);
2056 function Node26 (N : Node_Id) return Node_Id is
2058 pragma Assert (Nkind (N) in N_Entity);
2059 return Node_Id (Nodes.Table (N + 4).Field8);
2062 function Node27 (N : Node_Id) return Node_Id is
2064 pragma Assert (Nkind (N) in N_Entity);
2065 return Node_Id (Nodes.Table (N + 4).Field9);
2068 function Node28 (N : Node_Id) return Node_Id is
2070 pragma Assert (Nkind (N) in N_Entity);
2071 return Node_Id (Nodes.Table (N + 4).Field10);
2074 function List1 (N : Node_Id) return List_Id is
2076 pragma Assert (N <= Nodes.Last);
2077 return List_Id (Nodes.Table (N).Field1);
2080 function List2 (N : Node_Id) return List_Id is
2082 pragma Assert (N <= Nodes.Last);
2083 return List_Id (Nodes.Table (N).Field2);
2086 function List3 (N : Node_Id) return List_Id is
2088 pragma Assert (N <= Nodes.Last);
2089 return List_Id (Nodes.Table (N).Field3);
2092 function List4 (N : Node_Id) return List_Id is
2094 pragma Assert (N <= Nodes.Last);
2095 return List_Id (Nodes.Table (N).Field4);
2098 function List5 (N : Node_Id) return List_Id is
2100 pragma Assert (N <= Nodes.Last);
2101 return List_Id (Nodes.Table (N).Field5);
2104 function List10 (N : Node_Id) return List_Id is
2106 pragma Assert (Nkind (N) in N_Entity);
2107 return List_Id (Nodes.Table (N + 1).Field10);
2110 function List14 (N : Node_Id) return List_Id is
2112 pragma Assert (Nkind (N) in N_Entity);
2113 return List_Id (Nodes.Table (N + 2).Field7);
2116 function Elist1 (N : Node_Id) return Elist_Id is
2117 pragma Assert (N <= Nodes.Last);
2118 Value : constant Union_Id := Nodes.Table (N).Field1;
2123 return Elist_Id (Value);
2127 function Elist2 (N : Node_Id) return Elist_Id is
2128 pragma Assert (N <= Nodes.Last);
2129 Value : constant Union_Id := Nodes.Table (N).Field2;
2134 return Elist_Id (Value);
2138 function Elist3 (N : Node_Id) return Elist_Id is
2139 pragma Assert (N <= Nodes.Last);
2140 Value : constant Union_Id := Nodes.Table (N).Field3;
2145 return Elist_Id (Value);
2149 function Elist4 (N : Node_Id) return Elist_Id is
2150 pragma Assert (N <= Nodes.Last);
2151 Value : constant Union_Id := Nodes.Table (N).Field4;
2156 return Elist_Id (Value);
2160 function Elist8 (N : Node_Id) return Elist_Id is
2161 pragma Assert (Nkind (N) in N_Entity);
2162 Value : constant Union_Id := Nodes.Table (N + 1).Field8;
2167 return Elist_Id (Value);
2171 function Elist13 (N : Node_Id) return Elist_Id is
2172 pragma Assert (Nkind (N) in N_Entity);
2173 Value : constant Union_Id := Nodes.Table (N + 2).Field6;
2178 return Elist_Id (Value);
2182 function Elist15 (N : Node_Id) return Elist_Id is
2183 pragma Assert (Nkind (N) in N_Entity);
2184 Value : constant Union_Id := Nodes.Table (N + 2).Field8;
2189 return Elist_Id (Value);
2193 function Elist16 (N : Node_Id) return Elist_Id is
2194 pragma Assert (Nkind (N) in N_Entity);
2195 Value : constant Union_Id := Nodes.Table (N + 2).Field9;
2200 return Elist_Id (Value);
2204 function Elist18 (N : Node_Id) return Elist_Id is
2205 pragma Assert (Nkind (N) in N_Entity);
2206 Value : constant Union_Id := Nodes.Table (N + 2).Field11;
2211 return Elist_Id (Value);
2215 function Elist21 (N : Node_Id) return Elist_Id is
2216 pragma Assert (Nkind (N) in N_Entity);
2217 Value : constant Union_Id := Nodes.Table (N + 3).Field8;
2222 return Elist_Id (Value);
2226 function Elist23 (N : Node_Id) return Elist_Id is
2227 pragma Assert (Nkind (N) in N_Entity);
2228 Value : constant Union_Id := Nodes.Table (N + 3).Field10;
2233 return Elist_Id (Value);
2237 function Elist25 (N : Node_Id) return Elist_Id is
2238 pragma Assert (Nkind (N) in N_Entity);
2239 Value : constant Union_Id := Nodes.Table (N + 4).Field7;
2244 return Elist_Id (Value);
2248 function Elist26 (N : Node_Id) return Elist_Id is
2249 pragma Assert (Nkind (N) in N_Entity);
2250 Value : constant Union_Id := Nodes.Table (N + 4).Field8;
2255 return Elist_Id (Value);
2259 function Name1 (N : Node_Id) return Name_Id is
2261 pragma Assert (N <= Nodes.Last);
2262 return Name_Id (Nodes.Table (N).Field1);
2265 function Name2 (N : Node_Id) return Name_Id is
2267 pragma Assert (N <= Nodes.Last);
2268 return Name_Id (Nodes.Table (N).Field2);
2271 function Str3 (N : Node_Id) return String_Id is
2273 pragma Assert (N <= Nodes.Last);
2274 return String_Id (Nodes.Table (N).Field3);
2277 function Uint2 (N : Node_Id) return Uint is
2278 pragma Assert (N <= Nodes.Last);
2279 U : constant Union_Id := Nodes.Table (N).Field2;
2284 return From_Union (U);
2288 function Uint3 (N : Node_Id) return Uint is
2289 pragma Assert (N <= Nodes.Last);
2290 U : constant Union_Id := Nodes.Table (N).Field3;
2295 return From_Union (U);
2299 function Uint4 (N : Node_Id) return Uint is
2300 pragma Assert (N <= Nodes.Last);
2301 U : constant Union_Id := Nodes.Table (N).Field4;
2306 return From_Union (U);
2310 function Uint5 (N : Node_Id) return Uint is
2311 pragma Assert (N <= Nodes.Last);
2312 U : constant Union_Id := Nodes.Table (N).Field5;
2317 return From_Union (U);
2321 function Uint8 (N : Node_Id) return Uint is
2322 pragma Assert (Nkind (N) in N_Entity);
2323 U : constant Union_Id := Nodes.Table (N + 1).Field8;
2328 return From_Union (U);
2332 function Uint9 (N : Node_Id) return Uint is
2333 pragma Assert (Nkind (N) in N_Entity);
2334 U : constant Union_Id := Nodes.Table (N + 1).Field9;
2339 return From_Union (U);
2343 function Uint10 (N : Node_Id) return Uint is
2344 pragma Assert (Nkind (N) in N_Entity);
2345 U : constant Union_Id := Nodes.Table (N + 1).Field10;
2350 return From_Union (U);
2354 function Uint11 (N : Node_Id) return Uint is
2355 pragma Assert (Nkind (N) in N_Entity);
2356 U : constant Union_Id := Nodes.Table (N + 1).Field11;
2361 return From_Union (U);
2365 function Uint12 (N : Node_Id) return Uint is
2366 pragma Assert (Nkind (N) in N_Entity);
2367 U : constant Union_Id := Nodes.Table (N + 1).Field12;
2372 return From_Union (U);
2376 function Uint13 (N : Node_Id) return Uint is
2377 pragma Assert (Nkind (N) in N_Entity);
2378 U : constant Union_Id := Nodes.Table (N + 2).Field6;
2383 return From_Union (U);
2387 function Uint14 (N : Node_Id) return Uint is
2388 pragma Assert (Nkind (N) in N_Entity);
2389 U : constant Union_Id := Nodes.Table (N + 2).Field7;
2394 return From_Union (U);
2398 function Uint15 (N : Node_Id) return Uint is
2399 pragma Assert (Nkind (N) in N_Entity);
2400 U : constant Union_Id := Nodes.Table (N + 2).Field8;
2405 return From_Union (U);
2409 function Uint16 (N : Node_Id) return Uint is
2410 pragma Assert (Nkind (N) in N_Entity);
2411 U : constant Union_Id := Nodes.Table (N + 2).Field9;
2416 return From_Union (U);
2420 function Uint17 (N : Node_Id) return Uint is
2421 pragma Assert (Nkind (N) in N_Entity);
2422 U : constant Union_Id := Nodes.Table (N + 2).Field10;
2427 return From_Union (U);
2431 function Uint22 (N : Node_Id) return Uint is
2432 pragma Assert (Nkind (N) in N_Entity);
2433 U : constant Union_Id := Nodes.Table (N + 3).Field9;
2438 return From_Union (U);
2442 function Ureal3 (N : Node_Id) return Ureal is
2444 pragma Assert (N <= Nodes.Last);
2445 return From_Union (Nodes.Table (N).Field3);
2448 function Ureal18 (N : Node_Id) return Ureal is
2450 pragma Assert (Nkind (N) in N_Entity);
2451 return From_Union (Nodes.Table (N + 2).Field11);
2454 function Ureal21 (N : Node_Id) return Ureal is
2456 pragma Assert (Nkind (N) in N_Entity);
2457 return From_Union (Nodes.Table (N + 3).Field8);
2460 function Flag4 (N : Node_Id) return Boolean is
2462 pragma Assert (N <= Nodes.Last);
2463 return Nodes.Table (N).Flag4;
2466 function Flag5 (N : Node_Id) return Boolean is
2468 pragma Assert (N <= Nodes.Last);
2469 return Nodes.Table (N).Flag5;
2472 function Flag6 (N : Node_Id) return Boolean is
2474 pragma Assert (N <= Nodes.Last);
2475 return Nodes.Table (N).Flag6;
2478 function Flag7 (N : Node_Id) return Boolean is
2480 pragma Assert (N <= Nodes.Last);
2481 return Nodes.Table (N).Flag7;
2484 function Flag8 (N : Node_Id) return Boolean is
2486 pragma Assert (N <= Nodes.Last);
2487 return Nodes.Table (N).Flag8;
2490 function Flag9 (N : Node_Id) return Boolean is
2492 pragma Assert (N <= Nodes.Last);
2493 return Nodes.Table (N).Flag9;
2496 function Flag10 (N : Node_Id) return Boolean is
2498 pragma Assert (N <= Nodes.Last);
2499 return Nodes.Table (N).Flag10;
2502 function Flag11 (N : Node_Id) return Boolean is
2504 pragma Assert (N <= Nodes.Last);
2505 return Nodes.Table (N).Flag11;
2508 function Flag12 (N : Node_Id) return Boolean is
2510 pragma Assert (N <= Nodes.Last);
2511 return Nodes.Table (N).Flag12;
2514 function Flag13 (N : Node_Id) return Boolean is
2516 pragma Assert (N <= Nodes.Last);
2517 return Nodes.Table (N).Flag13;
2520 function Flag14 (N : Node_Id) return Boolean is
2522 pragma Assert (N <= Nodes.Last);
2523 return Nodes.Table (N).Flag14;
2526 function Flag15 (N : Node_Id) return Boolean is
2528 pragma Assert (N <= Nodes.Last);
2529 return Nodes.Table (N).Flag15;
2532 function Flag16 (N : Node_Id) return Boolean is
2534 pragma Assert (N <= Nodes.Last);
2535 return Nodes.Table (N).Flag16;
2538 function Flag17 (N : Node_Id) return Boolean is
2540 pragma Assert (N <= Nodes.Last);
2541 return Nodes.Table (N).Flag17;
2544 function Flag18 (N : Node_Id) return Boolean is
2546 pragma Assert (N <= Nodes.Last);
2547 return Nodes.Table (N).Flag18;
2550 function Flag19 (N : Node_Id) return Boolean is
2552 pragma Assert (Nkind (N) in N_Entity);
2553 return Nodes.Table (N + 1).In_List;
2556 function Flag20 (N : Node_Id) return Boolean is
2558 pragma Assert (Nkind (N) in N_Entity);
2559 return Nodes.Table (N + 1).Unused_1;
2562 function Flag21 (N : Node_Id) return Boolean is
2564 pragma Assert (Nkind (N) in N_Entity);
2565 return Nodes.Table (N + 1).Rewrite_Ins;
2568 function Flag22 (N : Node_Id) return Boolean is
2570 pragma Assert (Nkind (N) in N_Entity);
2571 return Nodes.Table (N + 1).Analyzed;
2574 function Flag23 (N : Node_Id) return Boolean is
2576 pragma Assert (Nkind (N) in N_Entity);
2577 return Nodes.Table (N + 1).Comes_From_Source;
2580 function Flag24 (N : Node_Id) return Boolean is
2582 pragma Assert (Nkind (N) in N_Entity);
2583 return Nodes.Table (N + 1).Error_Posted;
2586 function Flag25 (N : Node_Id) return Boolean is
2588 pragma Assert (Nkind (N) in N_Entity);
2589 return Nodes.Table (N + 1).Flag4;
2592 function Flag26 (N : Node_Id) return Boolean is
2594 pragma Assert (Nkind (N) in N_Entity);
2595 return Nodes.Table (N + 1).Flag5;
2598 function Flag27 (N : Node_Id) return Boolean is
2600 pragma Assert (Nkind (N) in N_Entity);
2601 return Nodes.Table (N + 1).Flag6;
2604 function Flag28 (N : Node_Id) return Boolean is
2606 pragma Assert (Nkind (N) in N_Entity);
2607 return Nodes.Table (N + 1).Flag7;
2610 function Flag29 (N : Node_Id) return Boolean is
2612 pragma Assert (Nkind (N) in N_Entity);
2613 return Nodes.Table (N + 1).Flag8;
2616 function Flag30 (N : Node_Id) return Boolean is
2618 pragma Assert (Nkind (N) in N_Entity);
2619 return Nodes.Table (N + 1).Flag9;
2622 function Flag31 (N : Node_Id) return Boolean is
2624 pragma Assert (Nkind (N) in N_Entity);
2625 return Nodes.Table (N + 1).Flag10;
2628 function Flag32 (N : Node_Id) return Boolean is
2630 pragma Assert (Nkind (N) in N_Entity);
2631 return Nodes.Table (N + 1).Flag11;
2634 function Flag33 (N : Node_Id) return Boolean is
2636 pragma Assert (Nkind (N) in N_Entity);
2637 return Nodes.Table (N + 1).Flag12;
2640 function Flag34 (N : Node_Id) return Boolean is
2642 pragma Assert (Nkind (N) in N_Entity);
2643 return Nodes.Table (N + 1).Flag13;
2646 function Flag35 (N : Node_Id) return Boolean is
2648 pragma Assert (Nkind (N) in N_Entity);
2649 return Nodes.Table (N + 1).Flag14;
2652 function Flag36 (N : Node_Id) return Boolean is
2654 pragma Assert (Nkind (N) in N_Entity);
2655 return Nodes.Table (N + 1).Flag15;
2658 function Flag37 (N : Node_Id) return Boolean is
2660 pragma Assert (Nkind (N) in N_Entity);
2661 return Nodes.Table (N + 1).Flag16;
2664 function Flag38 (N : Node_Id) return Boolean is
2666 pragma Assert (Nkind (N) in N_Entity);
2667 return Nodes.Table (N + 1).Flag17;
2670 function Flag39 (N : Node_Id) return Boolean is
2672 pragma Assert (Nkind (N) in N_Entity);
2673 return Nodes.Table (N + 1).Flag18;
2676 function Flag40 (N : Node_Id) return Boolean is
2678 pragma Assert (Nkind (N) in N_Entity);
2679 return Nodes.Table (N + 2).In_List;
2682 function Flag41 (N : Node_Id) return Boolean is
2684 pragma Assert (Nkind (N) in N_Entity);
2685 return Nodes.Table (N + 2).Unused_1;
2688 function Flag42 (N : Node_Id) return Boolean is
2690 pragma Assert (Nkind (N) in N_Entity);
2691 return Nodes.Table (N + 2).Rewrite_Ins;
2694 function Flag43 (N : Node_Id) return Boolean is
2696 pragma Assert (Nkind (N) in N_Entity);
2697 return Nodes.Table (N + 2).Analyzed;
2700 function Flag44 (N : Node_Id) return Boolean is
2702 pragma Assert (Nkind (N) in N_Entity);
2703 return Nodes.Table (N + 2).Comes_From_Source;
2706 function Flag45 (N : Node_Id) return Boolean is
2708 pragma Assert (Nkind (N) in N_Entity);
2709 return Nodes.Table (N + 2).Error_Posted;
2712 function Flag46 (N : Node_Id) return Boolean is
2714 pragma Assert (Nkind (N) in N_Entity);
2715 return Nodes.Table (N + 2).Flag4;
2718 function Flag47 (N : Node_Id) return Boolean is
2720 pragma Assert (Nkind (N) in N_Entity);
2721 return Nodes.Table (N + 2).Flag5;
2724 function Flag48 (N : Node_Id) return Boolean is
2726 pragma Assert (Nkind (N) in N_Entity);
2727 return Nodes.Table (N + 2).Flag6;
2730 function Flag49 (N : Node_Id) return Boolean is
2732 pragma Assert (Nkind (N) in N_Entity);
2733 return Nodes.Table (N + 2).Flag7;
2736 function Flag50 (N : Node_Id) return Boolean is
2738 pragma Assert (Nkind (N) in N_Entity);
2739 return Nodes.Table (N + 2).Flag8;
2742 function Flag51 (N : Node_Id) return Boolean is
2744 pragma Assert (Nkind (N) in N_Entity);
2745 return Nodes.Table (N + 2).Flag9;
2748 function Flag52 (N : Node_Id) return Boolean is
2750 pragma Assert (Nkind (N) in N_Entity);
2751 return Nodes.Table (N + 2).Flag10;
2754 function Flag53 (N : Node_Id) return Boolean is
2756 pragma Assert (Nkind (N) in N_Entity);
2757 return Nodes.Table (N + 2).Flag11;
2760 function Flag54 (N : Node_Id) return Boolean is
2762 pragma Assert (Nkind (N) in N_Entity);
2763 return Nodes.Table (N + 2).Flag12;
2766 function Flag55 (N : Node_Id) return Boolean is
2768 pragma Assert (Nkind (N) in N_Entity);
2769 return Nodes.Table (N + 2).Flag13;
2772 function Flag56 (N : Node_Id) return Boolean is
2774 pragma Assert (Nkind (N) in N_Entity);
2775 return Nodes.Table (N + 2).Flag14;
2778 function Flag57 (N : Node_Id) return Boolean is
2780 pragma Assert (Nkind (N) in N_Entity);
2781 return Nodes.Table (N + 2).Flag15;
2784 function Flag58 (N : Node_Id) return Boolean is
2786 pragma Assert (Nkind (N) in N_Entity);
2787 return Nodes.Table (N + 2).Flag16;
2790 function Flag59 (N : Node_Id) return Boolean is
2792 pragma Assert (Nkind (N) in N_Entity);
2793 return Nodes.Table (N + 2).Flag17;
2796 function Flag60 (N : Node_Id) return Boolean is
2798 pragma Assert (Nkind (N) in N_Entity);
2799 return Nodes.Table (N + 2).Flag18;
2802 function Flag61 (N : Node_Id) return Boolean is
2804 pragma Assert (Nkind (N) in N_Entity);
2805 return Nodes.Table (N + 1).Pflag1;
2808 function Flag62 (N : Node_Id) return Boolean is
2810 pragma Assert (Nkind (N) in N_Entity);
2811 return Nodes.Table (N + 1).Pflag2;
2814 function Flag63 (N : Node_Id) return Boolean is
2816 pragma Assert (Nkind (N) in N_Entity);
2817 return Nodes.Table (N + 2).Pflag1;
2820 function Flag64 (N : Node_Id) return Boolean is
2822 pragma Assert (Nkind (N) in N_Entity);
2823 return Nodes.Table (N + 2).Pflag2;
2826 function Flag65 (N : Node_Id) return Boolean is
2828 pragma Assert (Nkind (N) in N_Entity);
2829 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag65;
2832 function Flag66 (N : Node_Id) return Boolean is
2834 pragma Assert (Nkind (N) in N_Entity);
2835 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag66;
2838 function Flag67 (N : Node_Id) return Boolean is
2840 pragma Assert (Nkind (N) in N_Entity);
2841 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag67;
2844 function Flag68 (N : Node_Id) return Boolean is
2846 pragma Assert (Nkind (N) in N_Entity);
2847 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag68;
2850 function Flag69 (N : Node_Id) return Boolean is
2852 pragma Assert (Nkind (N) in N_Entity);
2853 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag69;
2856 function Flag70 (N : Node_Id) return Boolean is
2858 pragma Assert (Nkind (N) in N_Entity);
2859 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag70;
2862 function Flag71 (N : Node_Id) return Boolean is
2864 pragma Assert (Nkind (N) in N_Entity);
2865 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag71;
2868 function Flag72 (N : Node_Id) return Boolean is
2870 pragma Assert (Nkind (N) in N_Entity);
2871 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag72;
2874 function Flag73 (N : Node_Id) return Boolean is
2876 pragma Assert (Nkind (N) in N_Entity);
2877 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag73;
2880 function Flag74 (N : Node_Id) return Boolean is
2882 pragma Assert (Nkind (N) in N_Entity);
2883 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag74;
2886 function Flag75 (N : Node_Id) return Boolean is
2888 pragma Assert (Nkind (N) in N_Entity);
2889 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag75;
2892 function Flag76 (N : Node_Id) return Boolean is
2894 pragma Assert (Nkind (N) in N_Entity);
2895 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag76;
2898 function Flag77 (N : Node_Id) return Boolean is
2900 pragma Assert (Nkind (N) in N_Entity);
2901 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag77;
2904 function Flag78 (N : Node_Id) return Boolean is
2906 pragma Assert (Nkind (N) in N_Entity);
2907 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag78;
2910 function Flag79 (N : Node_Id) return Boolean is
2912 pragma Assert (Nkind (N) in N_Entity);
2913 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag79;
2916 function Flag80 (N : Node_Id) return Boolean is
2918 pragma Assert (Nkind (N) in N_Entity);
2919 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag80;
2922 function Flag81 (N : Node_Id) return Boolean is
2924 pragma Assert (Nkind (N) in N_Entity);
2925 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag81;
2928 function Flag82 (N : Node_Id) return Boolean is
2930 pragma Assert (Nkind (N) in N_Entity);
2931 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag82;
2934 function Flag83 (N : Node_Id) return Boolean is
2936 pragma Assert (Nkind (N) in N_Entity);
2937 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag83;
2940 function Flag84 (N : Node_Id) return Boolean is
2942 pragma Assert (Nkind (N) in N_Entity);
2943 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag84;
2946 function Flag85 (N : Node_Id) return Boolean is
2948 pragma Assert (Nkind (N) in N_Entity);
2949 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag85;
2952 function Flag86 (N : Node_Id) return Boolean is
2954 pragma Assert (Nkind (N) in N_Entity);
2955 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag86;
2958 function Flag87 (N : Node_Id) return Boolean is
2960 pragma Assert (Nkind (N) in N_Entity);
2961 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag87;
2964 function Flag88 (N : Node_Id) return Boolean is
2966 pragma Assert (Nkind (N) in N_Entity);
2967 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag88;
2970 function Flag89 (N : Node_Id) return Boolean is
2972 pragma Assert (Nkind (N) in N_Entity);
2973 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag89;
2976 function Flag90 (N : Node_Id) return Boolean is
2978 pragma Assert (Nkind (N) in N_Entity);
2979 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag90;
2982 function Flag91 (N : Node_Id) return Boolean is
2984 pragma Assert (Nkind (N) in N_Entity);
2985 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag91;
2988 function Flag92 (N : Node_Id) return Boolean is
2990 pragma Assert (Nkind (N) in N_Entity);
2991 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag92;
2994 function Flag93 (N : Node_Id) return Boolean is
2996 pragma Assert (Nkind (N) in N_Entity);
2997 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag93;
3000 function Flag94 (N : Node_Id) return Boolean is
3002 pragma Assert (Nkind (N) in N_Entity);
3003 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag94;
3006 function Flag95 (N : Node_Id) return Boolean is
3008 pragma Assert (Nkind (N) in N_Entity);
3009 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag95;
3012 function Flag96 (N : Node_Id) return Boolean is
3014 pragma Assert (Nkind (N) in N_Entity);
3015 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag96;
3018 function Flag97 (N : Node_Id) return Boolean is
3020 pragma Assert (Nkind (N) in N_Entity);
3021 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag97;
3024 function Flag98 (N : Node_Id) return Boolean is
3026 pragma Assert (Nkind (N) in N_Entity);
3027 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag98;
3030 function Flag99 (N : Node_Id) return Boolean is
3032 pragma Assert (Nkind (N) in N_Entity);
3033 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag99;
3036 function Flag100 (N : Node_Id) return Boolean is
3038 pragma Assert (Nkind (N) in N_Entity);
3039 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag100;
3042 function Flag101 (N : Node_Id) return Boolean is
3044 pragma Assert (Nkind (N) in N_Entity);
3045 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag101;
3048 function Flag102 (N : Node_Id) return Boolean is
3050 pragma Assert (Nkind (N) in N_Entity);
3051 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag102;
3054 function Flag103 (N : Node_Id) return Boolean is
3056 pragma Assert (Nkind (N) in N_Entity);
3057 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag103;
3060 function Flag104 (N : Node_Id) return Boolean is
3062 pragma Assert (Nkind (N) in N_Entity);
3063 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag104;
3066 function Flag105 (N : Node_Id) return Boolean is
3068 pragma Assert (Nkind (N) in N_Entity);
3069 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag105;
3072 function Flag106 (N : Node_Id) return Boolean is
3074 pragma Assert (Nkind (N) in N_Entity);
3075 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag106;
3078 function Flag107 (N : Node_Id) return Boolean is
3080 pragma Assert (Nkind (N) in N_Entity);
3081 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag107;
3084 function Flag108 (N : Node_Id) return Boolean is
3086 pragma Assert (Nkind (N) in N_Entity);
3087 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag108;
3090 function Flag109 (N : Node_Id) return Boolean is
3092 pragma Assert (Nkind (N) in N_Entity);
3093 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag109;
3096 function Flag110 (N : Node_Id) return Boolean is
3098 pragma Assert (Nkind (N) in N_Entity);
3099 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag110;
3102 function Flag111 (N : Node_Id) return Boolean is
3104 pragma Assert (Nkind (N) in N_Entity);
3105 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag111;
3108 function Flag112 (N : Node_Id) return Boolean is
3110 pragma Assert (Nkind (N) in N_Entity);
3111 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag112;
3114 function Flag113 (N : Node_Id) return Boolean is
3116 pragma Assert (Nkind (N) in N_Entity);
3117 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag113;
3120 function Flag114 (N : Node_Id) return Boolean is
3122 pragma Assert (Nkind (N) in N_Entity);
3123 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag114;
3126 function Flag115 (N : Node_Id) return Boolean is
3128 pragma Assert (Nkind (N) in N_Entity);
3129 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag115;
3132 function Flag116 (N : Node_Id) return Boolean is
3134 pragma Assert (Nkind (N) in N_Entity);
3135 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag116;
3138 function Flag117 (N : Node_Id) return Boolean is
3140 pragma Assert (Nkind (N) in N_Entity);
3141 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag117;
3144 function Flag118 (N : Node_Id) return Boolean is
3146 pragma Assert (Nkind (N) in N_Entity);
3147 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag118;
3150 function Flag119 (N : Node_Id) return Boolean is
3152 pragma Assert (Nkind (N) in N_Entity);
3153 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag119;
3156 function Flag120 (N : Node_Id) return Boolean is
3158 pragma Assert (Nkind (N) in N_Entity);
3159 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag120;
3162 function Flag121 (N : Node_Id) return Boolean is
3164 pragma Assert (Nkind (N) in N_Entity);
3165 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag121;
3168 function Flag122 (N : Node_Id) return Boolean is
3170 pragma Assert (Nkind (N) in N_Entity);
3171 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag122;
3174 function Flag123 (N : Node_Id) return Boolean is
3176 pragma Assert (Nkind (N) in N_Entity);
3177 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag123;
3180 function Flag124 (N : Node_Id) return Boolean is
3182 pragma Assert (Nkind (N) in N_Entity);
3183 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag124;
3186 function Flag125 (N : Node_Id) return Boolean is
3188 pragma Assert (Nkind (N) in N_Entity);
3189 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag125;
3192 function Flag126 (N : Node_Id) return Boolean is
3194 pragma Assert (Nkind (N) in N_Entity);
3195 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag126;
3198 function Flag127 (N : Node_Id) return Boolean is
3200 pragma Assert (Nkind (N) in N_Entity);
3201 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag127;
3204 function Flag128 (N : Node_Id) return Boolean is
3206 pragma Assert (Nkind (N) in N_Entity);
3207 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag128;
3210 function Flag129 (N : Node_Id) return Boolean is
3212 pragma Assert (Nkind (N) in N_Entity);
3213 return Nodes.Table (N + 3).In_List;
3216 function Flag130 (N : Node_Id) return Boolean is
3218 pragma Assert (Nkind (N) in N_Entity);
3219 return Nodes.Table (N + 3).Unused_1;
3222 function Flag131 (N : Node_Id) return Boolean is
3224 pragma Assert (Nkind (N) in N_Entity);
3225 return Nodes.Table (N + 3).Rewrite_Ins;
3228 function Flag132 (N : Node_Id) return Boolean is
3230 pragma Assert (Nkind (N) in N_Entity);
3231 return Nodes.Table (N + 3).Analyzed;
3234 function Flag133 (N : Node_Id) return Boolean is
3236 pragma Assert (Nkind (N) in N_Entity);
3237 return Nodes.Table (N + 3).Comes_From_Source;
3240 function Flag134 (N : Node_Id) return Boolean is
3242 pragma Assert (Nkind (N) in N_Entity);
3243 return Nodes.Table (N + 3).Error_Posted;
3246 function Flag135 (N : Node_Id) return Boolean is
3248 pragma Assert (Nkind (N) in N_Entity);
3249 return Nodes.Table (N + 3).Flag4;
3252 function Flag136 (N : Node_Id) return Boolean is
3254 pragma Assert (Nkind (N) in N_Entity);
3255 return Nodes.Table (N + 3).Flag5;
3258 function Flag137 (N : Node_Id) return Boolean is
3260 pragma Assert (Nkind (N) in N_Entity);
3261 return Nodes.Table (N + 3).Flag6;
3264 function Flag138 (N : Node_Id) return Boolean is
3266 pragma Assert (Nkind (N) in N_Entity);
3267 return Nodes.Table (N + 3).Flag7;
3270 function Flag139 (N : Node_Id) return Boolean is
3272 pragma Assert (Nkind (N) in N_Entity);
3273 return Nodes.Table (N + 3).Flag8;
3276 function Flag140 (N : Node_Id) return Boolean is
3278 pragma Assert (Nkind (N) in N_Entity);
3279 return Nodes.Table (N + 3).Flag9;
3282 function Flag141 (N : Node_Id) return Boolean is
3284 pragma Assert (Nkind (N) in N_Entity);
3285 return Nodes.Table (N + 3).Flag10;
3288 function Flag142 (N : Node_Id) return Boolean is
3290 pragma Assert (Nkind (N) in N_Entity);
3291 return Nodes.Table (N + 3).Flag11;
3294 function Flag143 (N : Node_Id) return Boolean is
3296 pragma Assert (Nkind (N) in N_Entity);
3297 return Nodes.Table (N + 3).Flag12;
3300 function Flag144 (N : Node_Id) return Boolean is
3302 pragma Assert (Nkind (N) in N_Entity);
3303 return Nodes.Table (N + 3).Flag13;
3306 function Flag145 (N : Node_Id) return Boolean is
3308 pragma Assert (Nkind (N) in N_Entity);
3309 return Nodes.Table (N + 3).Flag14;
3312 function Flag146 (N : Node_Id) return Boolean is
3314 pragma Assert (Nkind (N) in N_Entity);
3315 return Nodes.Table (N + 3).Flag15;
3318 function Flag147 (N : Node_Id) return Boolean is
3320 pragma Assert (Nkind (N) in N_Entity);
3321 return Nodes.Table (N + 3).Flag16;
3324 function Flag148 (N : Node_Id) return Boolean is
3326 pragma Assert (Nkind (N) in N_Entity);
3327 return Nodes.Table (N + 3).Flag17;
3330 function Flag149 (N : Node_Id) return Boolean is
3332 pragma Assert (Nkind (N) in N_Entity);
3333 return Nodes.Table (N + 3).Flag18;
3336 function Flag150 (N : Node_Id) return Boolean is
3338 pragma Assert (Nkind (N) in N_Entity);
3339 return Nodes.Table (N + 3).Pflag1;
3342 function Flag151 (N : Node_Id) return Boolean is
3344 pragma Assert (Nkind (N) in N_Entity);
3345 return Nodes.Table (N + 3).Pflag2;
3348 function Flag152 (N : Node_Id) return Boolean is
3350 pragma Assert (Nkind (N) in N_Entity);
3351 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag152;
3354 function Flag153 (N : Node_Id) return Boolean is
3356 pragma Assert (Nkind (N) in N_Entity);
3357 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag153;
3360 function Flag154 (N : Node_Id) return Boolean is
3362 pragma Assert (Nkind (N) in N_Entity);
3363 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag154;
3366 function Flag155 (N : Node_Id) return Boolean is
3368 pragma Assert (Nkind (N) in N_Entity);
3369 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag155;
3372 function Flag156 (N : Node_Id) return Boolean is
3374 pragma Assert (Nkind (N) in N_Entity);
3375 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag156;
3378 function Flag157 (N : Node_Id) return Boolean is
3380 pragma Assert (Nkind (N) in N_Entity);
3381 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag157;
3384 function Flag158 (N : Node_Id) return Boolean is
3386 pragma Assert (Nkind (N) in N_Entity);
3387 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag158;
3390 function Flag159 (N : Node_Id) return Boolean is
3392 pragma Assert (Nkind (N) in N_Entity);
3393 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag159;
3396 function Flag160 (N : Node_Id) return Boolean is
3398 pragma Assert (Nkind (N) in N_Entity);
3399 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag160;
3402 function Flag161 (N : Node_Id) return Boolean is
3404 pragma Assert (Nkind (N) in N_Entity);
3405 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag161;
3408 function Flag162 (N : Node_Id) return Boolean is
3410 pragma Assert (Nkind (N) in N_Entity);
3411 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag162;
3414 function Flag163 (N : Node_Id) return Boolean is
3416 pragma Assert (Nkind (N) in N_Entity);
3417 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag163;
3420 function Flag164 (N : Node_Id) return Boolean is
3422 pragma Assert (Nkind (N) in N_Entity);
3423 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag164;
3426 function Flag165 (N : Node_Id) return Boolean is
3428 pragma Assert (Nkind (N) in N_Entity);
3429 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag165;
3432 function Flag166 (N : Node_Id) return Boolean is
3434 pragma Assert (Nkind (N) in N_Entity);
3435 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag166;
3438 function Flag167 (N : Node_Id) return Boolean is
3440 pragma Assert (Nkind (N) in N_Entity);
3441 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag167;
3444 function Flag168 (N : Node_Id) return Boolean is
3446 pragma Assert (Nkind (N) in N_Entity);
3447 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag168;
3450 function Flag169 (N : Node_Id) return Boolean is
3452 pragma Assert (Nkind (N) in N_Entity);
3453 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag169;
3456 function Flag170 (N : Node_Id) return Boolean is
3458 pragma Assert (Nkind (N) in N_Entity);
3459 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag170;
3462 function Flag171 (N : Node_Id) return Boolean is
3464 pragma Assert (Nkind (N) in N_Entity);
3465 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag171;
3468 function Flag172 (N : Node_Id) return Boolean is
3470 pragma Assert (Nkind (N) in N_Entity);
3471 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag172;
3474 function Flag173 (N : Node_Id) return Boolean is
3476 pragma Assert (Nkind (N) in N_Entity);
3477 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag173;
3480 function Flag174 (N : Node_Id) return Boolean is
3482 pragma Assert (Nkind (N) in N_Entity);
3483 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag174;
3486 function Flag175 (N : Node_Id) return Boolean is
3488 pragma Assert (Nkind (N) in N_Entity);
3489 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag175;
3492 function Flag176 (N : Node_Id) return Boolean is
3494 pragma Assert (Nkind (N) in N_Entity);
3495 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag176;
3498 function Flag177 (N : Node_Id) return Boolean is
3500 pragma Assert (Nkind (N) in N_Entity);
3501 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag177;
3504 function Flag178 (N : Node_Id) return Boolean is
3506 pragma Assert (Nkind (N) in N_Entity);
3507 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag178;
3510 function Flag179 (N : Node_Id) return Boolean is
3512 pragma Assert (Nkind (N) in N_Entity);
3513 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag179;
3516 function Flag180 (N : Node_Id) return Boolean is
3518 pragma Assert (Nkind (N) in N_Entity);
3519 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag180;
3522 function Flag181 (N : Node_Id) return Boolean is
3524 pragma Assert (Nkind (N) in N_Entity);
3525 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag181;
3528 function Flag182 (N : Node_Id) return Boolean is
3530 pragma Assert (Nkind (N) in N_Entity);
3531 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag182;
3534 function Flag183 (N : Node_Id) return Boolean is
3536 pragma Assert (Nkind (N) in N_Entity);
3537 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag183;
3540 function Flag184 (N : Node_Id) return Boolean is
3542 pragma Assert (Nkind (N) in N_Entity);
3543 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag184;
3546 function Flag185 (N : Node_Id) return Boolean is
3548 pragma Assert (Nkind (N) in N_Entity);
3549 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag185;
3552 function Flag186 (N : Node_Id) return Boolean is
3554 pragma Assert (Nkind (N) in N_Entity);
3555 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag186;
3558 function Flag187 (N : Node_Id) return Boolean is
3560 pragma Assert (Nkind (N) in N_Entity);
3561 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag187;
3564 function Flag188 (N : Node_Id) return Boolean is
3566 pragma Assert (Nkind (N) in N_Entity);
3567 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag188;
3570 function Flag189 (N : Node_Id) return Boolean is
3572 pragma Assert (Nkind (N) in N_Entity);
3573 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag189;
3576 function Flag190 (N : Node_Id) return Boolean is
3578 pragma Assert (Nkind (N) in N_Entity);
3579 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag190;
3582 function Flag191 (N : Node_Id) return Boolean is
3584 pragma Assert (Nkind (N) in N_Entity);
3585 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag191;
3588 function Flag192 (N : Node_Id) return Boolean is
3590 pragma Assert (Nkind (N) in N_Entity);
3591 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag192;
3594 function Flag193 (N : Node_Id) return Boolean is
3596 pragma Assert (Nkind (N) in N_Entity);
3597 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag193;
3600 function Flag194 (N : Node_Id) return Boolean is
3602 pragma Assert (Nkind (N) in N_Entity);
3603 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag194;
3606 function Flag195 (N : Node_Id) return Boolean is
3608 pragma Assert (Nkind (N) in N_Entity);
3609 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag195;
3612 function Flag196 (N : Node_Id) return Boolean is
3614 pragma Assert (Nkind (N) in N_Entity);
3615 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag196;
3618 function Flag197 (N : Node_Id) return Boolean is
3620 pragma Assert (Nkind (N) in N_Entity);
3621 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag197;
3624 function Flag198 (N : Node_Id) return Boolean is
3626 pragma Assert (Nkind (N) in N_Entity);
3627 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag198;
3630 function Flag199 (N : Node_Id) return Boolean is
3632 pragma Assert (Nkind (N) in N_Entity);
3633 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag199;
3636 function Flag200 (N : Node_Id) return Boolean is
3638 pragma Assert (Nkind (N) in N_Entity);
3639 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag200;
3642 function Flag201 (N : Node_Id) return Boolean is
3644 pragma Assert (Nkind (N) in N_Entity);
3645 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag201;
3648 function Flag202 (N : Node_Id) return Boolean is
3650 pragma Assert (Nkind (N) in N_Entity);
3651 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag202;
3654 function Flag203 (N : Node_Id) return Boolean is
3656 pragma Assert (Nkind (N) in N_Entity);
3657 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag203;
3660 function Flag204 (N : Node_Id) return Boolean is
3662 pragma Assert (Nkind (N) in N_Entity);
3663 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag204;
3666 function Flag205 (N : Node_Id) return Boolean is
3668 pragma Assert (Nkind (N) in N_Entity);
3669 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag205;
3672 function Flag206 (N : Node_Id) return Boolean is
3674 pragma Assert (Nkind (N) in N_Entity);
3675 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag206;
3678 function Flag207 (N : Node_Id) return Boolean is
3680 pragma Assert (Nkind (N) in N_Entity);
3681 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag207;
3684 function Flag208 (N : Node_Id) return Boolean is
3686 pragma Assert (Nkind (N) in N_Entity);
3687 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag208;
3690 function Flag209 (N : Node_Id) return Boolean is
3692 pragma Assert (Nkind (N) in N_Entity);
3693 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag209;
3696 function Flag210 (N : Node_Id) return Boolean is
3698 pragma Assert (Nkind (N) in N_Entity);
3699 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag210;
3702 function Flag211 (N : Node_Id) return Boolean is
3704 pragma Assert (Nkind (N) in N_Entity);
3705 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag211;
3708 function Flag212 (N : Node_Id) return Boolean is
3710 pragma Assert (Nkind (N) in N_Entity);
3711 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag212;
3714 function Flag213 (N : Node_Id) return Boolean is
3716 pragma Assert (Nkind (N) in N_Entity);
3717 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag213;
3720 function Flag214 (N : Node_Id) return Boolean is
3722 pragma Assert (Nkind (N) in N_Entity);
3723 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag214;
3726 function Flag215 (N : Node_Id) return Boolean is
3728 pragma Assert (Nkind (N) in N_Entity);
3729 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag215;
3732 function Flag216 (N : Node_Id) return Boolean is
3734 pragma Assert (Nkind (N) in N_Entity);
3735 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag216;
3738 function Flag217 (N : Node_Id) return Boolean is
3740 pragma Assert (Nkind (N) in N_Entity);
3741 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag217;
3744 function Flag218 (N : Node_Id) return Boolean is
3746 pragma Assert (Nkind (N) in N_Entity);
3747 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag218;
3750 function Flag219 (N : Node_Id) return Boolean is
3752 pragma Assert (Nkind (N) in N_Entity);
3753 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag219;
3756 function Flag220 (N : Node_Id) return Boolean is
3758 pragma Assert (Nkind (N) in N_Entity);
3759 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag220;
3762 function Flag221 (N : Node_Id) return Boolean is
3764 pragma Assert (Nkind (N) in N_Entity);
3765 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag221;
3768 function Flag222 (N : Node_Id) return Boolean is
3770 pragma Assert (Nkind (N) in N_Entity);
3771 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag222;
3774 function Flag223 (N : Node_Id) return Boolean is
3776 pragma Assert (Nkind (N) in N_Entity);
3777 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag223;
3780 function Flag224 (N : Node_Id) return Boolean is
3782 pragma Assert (Nkind (N) in N_Entity);
3783 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag224;
3786 function Flag225 (N : Node_Id) return Boolean is
3788 pragma Assert (Nkind (N) in N_Entity);
3789 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag225;
3792 function Flag226 (N : Node_Id) return Boolean is
3794 pragma Assert (Nkind (N) in N_Entity);
3795 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag226;
3798 function Flag227 (N : Node_Id) return Boolean is
3800 pragma Assert (Nkind (N) in N_Entity);
3801 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag227;
3804 function Flag228 (N : Node_Id) return Boolean is
3806 pragma Assert (Nkind (N) in N_Entity);
3807 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag228;
3810 function Flag229 (N : Node_Id) return Boolean is
3812 pragma Assert (Nkind (N) in N_Entity);
3813 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag229;
3816 function Flag230 (N : Node_Id) return Boolean is
3818 pragma Assert (Nkind (N) in N_Entity);
3819 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag230;
3822 function Flag231 (N : Node_Id) return Boolean is
3824 pragma Assert (Nkind (N) in N_Entity);
3825 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag231;
3828 function Flag232 (N : Node_Id) return Boolean is
3830 pragma Assert (Nkind (N) in N_Entity);
3831 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag232;
3834 function Flag233 (N : Node_Id) return Boolean is
3836 pragma Assert (Nkind (N) in N_Entity);
3837 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag233;
3840 function Flag234 (N : Node_Id) return Boolean is
3842 pragma Assert (Nkind (N) in N_Entity);
3843 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag234;
3846 function Flag235 (N : Node_Id) return Boolean is
3848 pragma Assert (Nkind (N) in N_Entity);
3849 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag235;
3852 function Flag236 (N : Node_Id) return Boolean is
3854 pragma Assert (Nkind (N) in N_Entity);
3855 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag236;
3858 function Flag237 (N : Node_Id) return Boolean is
3860 pragma Assert (Nkind (N) in N_Entity);
3861 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag237;
3864 function Flag238 (N : Node_Id) return Boolean is
3866 pragma Assert (Nkind (N) in N_Entity);
3867 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag238;
3870 function Flag239 (N : Node_Id) return Boolean is
3872 pragma Assert (Nkind (N) in N_Entity);
3873 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag239;
3876 function Flag240 (N : Node_Id) return Boolean is
3878 pragma Assert (Nkind (N) in N_Entity);
3879 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag240;
3882 function Flag241 (N : Node_Id) return Boolean is
3884 pragma Assert (Nkind (N) in N_Entity);
3885 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag241;
3888 function Flag242 (N : Node_Id) return Boolean is
3890 pragma Assert (Nkind (N) in N_Entity);
3891 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag242;
3894 function Flag243 (N : Node_Id) return Boolean is
3896 pragma Assert (Nkind (N) in N_Entity);
3897 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag243;
3900 function Flag244 (N : Node_Id) return Boolean is
3902 pragma Assert (Nkind (N) in N_Entity);
3903 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag244;
3906 function Flag245 (N : Node_Id) return Boolean is
3908 pragma Assert (Nkind (N) in N_Entity);
3909 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag245;
3912 function Flag246 (N : Node_Id) return Boolean is
3914 pragma Assert (Nkind (N) in N_Entity);
3915 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag246;
3918 function Flag247 (N : Node_Id) return Boolean is
3920 pragma Assert (Nkind (N) in N_Entity);
3921 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag247;
3924 procedure Set_Nkind (N : Node_Id; Val : Node_Kind) is
3926 pragma Assert (N <= Nodes.Last);
3927 Nodes.Table (N).Nkind := Val;
3930 procedure Set_Field1 (N : Node_Id; Val : Union_Id) is
3932 pragma Assert (N <= Nodes.Last);
3933 Nodes.Table (N).Field1 := Val;
3936 procedure Set_Field2 (N : Node_Id; Val : Union_Id) is
3938 pragma Assert (N <= Nodes.Last);
3939 Nodes.Table (N).Field2 := Val;
3942 procedure Set_Field3 (N : Node_Id; Val : Union_Id) is
3944 pragma Assert (N <= Nodes.Last);
3945 Nodes.Table (N).Field3 := Val;
3948 procedure Set_Field4 (N : Node_Id; Val : Union_Id) is
3950 pragma Assert (N <= Nodes.Last);
3951 Nodes.Table (N).Field4 := Val;
3954 procedure Set_Field5 (N : Node_Id; Val : Union_Id) is
3956 pragma Assert (N <= Nodes.Last);
3957 Nodes.Table (N).Field5 := Val;
3960 procedure Set_Field6 (N : Node_Id; Val : Union_Id) is
3962 pragma Assert (Nkind (N) in N_Entity);
3963 Nodes.Table (N + 1).Field6 := Val;
3966 procedure Set_Field7 (N : Node_Id; Val : Union_Id) is
3968 pragma Assert (Nkind (N) in N_Entity);
3969 Nodes.Table (N + 1).Field7 := Val;
3972 procedure Set_Field8 (N : Node_Id; Val : Union_Id) is
3974 pragma Assert (Nkind (N) in N_Entity);
3975 Nodes.Table (N + 1).Field8 := Val;
3978 procedure Set_Field9 (N : Node_Id; Val : Union_Id) is
3980 pragma Assert (Nkind (N) in N_Entity);
3981 Nodes.Table (N + 1).Field9 := Val;
3984 procedure Set_Field10 (N : Node_Id; Val : Union_Id) is
3986 pragma Assert (Nkind (N) in N_Entity);
3987 Nodes.Table (N + 1).Field10 := Val;
3990 procedure Set_Field11 (N : Node_Id; Val : Union_Id) is
3992 pragma Assert (Nkind (N) in N_Entity);
3993 Nodes.Table (N + 1).Field11 := Val;
3996 procedure Set_Field12 (N : Node_Id; Val : Union_Id) is
3998 pragma Assert (Nkind (N) in N_Entity);
3999 Nodes.Table (N + 1).Field12 := Val;
4002 procedure Set_Field13 (N : Node_Id; Val : Union_Id) is
4004 pragma Assert (Nkind (N) in N_Entity);
4005 Nodes.Table (N + 2).Field6 := Val;
4008 procedure Set_Field14 (N : Node_Id; Val : Union_Id) is
4010 pragma Assert (Nkind (N) in N_Entity);
4011 Nodes.Table (N + 2).Field7 := Val;
4014 procedure Set_Field15 (N : Node_Id; Val : Union_Id) is
4016 pragma Assert (Nkind (N) in N_Entity);
4017 Nodes.Table (N + 2).Field8 := Val;
4020 procedure Set_Field16 (N : Node_Id; Val : Union_Id) is
4022 pragma Assert (Nkind (N) in N_Entity);
4023 Nodes.Table (N + 2).Field9 := Val;
4026 procedure Set_Field17 (N : Node_Id; Val : Union_Id) is
4028 pragma Assert (Nkind (N) in N_Entity);
4029 Nodes.Table (N + 2).Field10 := Val;
4032 procedure Set_Field18 (N : Node_Id; Val : Union_Id) is
4034 pragma Assert (Nkind (N) in N_Entity);
4035 Nodes.Table (N + 2).Field11 := Val;
4038 procedure Set_Field19 (N : Node_Id; Val : Union_Id) is
4040 pragma Assert (Nkind (N) in N_Entity);
4041 Nodes.Table (N + 3).Field6 := Val;
4044 procedure Set_Field20 (N : Node_Id; Val : Union_Id) is
4046 pragma Assert (Nkind (N) in N_Entity);
4047 Nodes.Table (N + 3).Field7 := Val;
4050 procedure Set_Field21 (N : Node_Id; Val : Union_Id) is
4052 pragma Assert (Nkind (N) in N_Entity);
4053 Nodes.Table (N + 3).Field8 := Val;
4056 procedure Set_Field22 (N : Node_Id; Val : Union_Id) is
4058 pragma Assert (Nkind (N) in N_Entity);
4059 Nodes.Table (N + 3).Field9 := Val;
4062 procedure Set_Field23 (N : Node_Id; Val : Union_Id) is
4064 pragma Assert (Nkind (N) in N_Entity);
4065 Nodes.Table (N + 3).Field10 := Val;
4068 procedure Set_Field24 (N : Node_Id; Val : Union_Id) is
4070 pragma Assert (Nkind (N) in N_Entity);
4071 Nodes.Table (N + 4).Field6 := Val;
4074 procedure Set_Field25 (N : Node_Id; Val : Union_Id) is
4076 pragma Assert (Nkind (N) in N_Entity);
4077 Nodes.Table (N + 4).Field7 := Val;
4080 procedure Set_Field26 (N : Node_Id; Val : Union_Id) is
4082 pragma Assert (Nkind (N) in N_Entity);
4083 Nodes.Table (N + 4).Field8 := Val;
4086 procedure Set_Field27 (N : Node_Id; Val : Union_Id) is
4088 pragma Assert (Nkind (N) in N_Entity);
4089 Nodes.Table (N + 4).Field9 := Val;
4092 procedure Set_Field28 (N : Node_Id; Val : Union_Id) is
4094 pragma Assert (Nkind (N) in N_Entity);
4095 Nodes.Table (N + 4).Field10 := Val;
4098 procedure Set_Node1 (N : Node_Id; Val : Node_Id) is
4100 pragma Assert (N <= Nodes.Last);
4101 Nodes.Table (N).Field1 := Union_Id (Val);
4104 procedure Set_Node2 (N : Node_Id; Val : Node_Id) is
4106 pragma Assert (N <= Nodes.Last);
4107 Nodes.Table (N).Field2 := Union_Id (Val);
4110 procedure Set_Node3 (N : Node_Id; Val : Node_Id) is
4112 pragma Assert (N <= Nodes.Last);
4113 Nodes.Table (N).Field3 := Union_Id (Val);
4116 procedure Set_Node4 (N : Node_Id; Val : Node_Id) is
4118 pragma Assert (N <= Nodes.Last);
4119 Nodes.Table (N).Field4 := Union_Id (Val);
4122 procedure Set_Node5 (N : Node_Id; Val : Node_Id) is
4124 pragma Assert (N <= Nodes.Last);
4125 Nodes.Table (N).Field5 := Union_Id (Val);
4128 procedure Set_Node6 (N : Node_Id; Val : Node_Id) is
4130 pragma Assert (Nkind (N) in N_Entity);
4131 Nodes.Table (N + 1).Field6 := Union_Id (Val);
4134 procedure Set_Node7 (N : Node_Id; Val : Node_Id) is
4136 pragma Assert (Nkind (N) in N_Entity);
4137 Nodes.Table (N + 1).Field7 := Union_Id (Val);
4140 procedure Set_Node8 (N : Node_Id; Val : Node_Id) is
4142 pragma Assert (Nkind (N) in N_Entity);
4143 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4146 procedure Set_Node9 (N : Node_Id; Val : Node_Id) is
4148 pragma Assert (Nkind (N) in N_Entity);
4149 Nodes.Table (N + 1).Field9 := Union_Id (Val);
4152 procedure Set_Node10 (N : Node_Id; Val : Node_Id) is
4154 pragma Assert (Nkind (N) in N_Entity);
4155 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4158 procedure Set_Node11 (N : Node_Id; Val : Node_Id) is
4160 pragma Assert (Nkind (N) in N_Entity);
4161 Nodes.Table (N + 1).Field11 := Union_Id (Val);
4164 procedure Set_Node12 (N : Node_Id; Val : Node_Id) is
4166 pragma Assert (Nkind (N) in N_Entity);
4167 Nodes.Table (N + 1).Field12 := Union_Id (Val);
4170 procedure Set_Node13 (N : Node_Id; Val : Node_Id) is
4172 pragma Assert (Nkind (N) in N_Entity);
4173 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4176 procedure Set_Node14 (N : Node_Id; Val : Node_Id) is
4178 pragma Assert (Nkind (N) in N_Entity);
4179 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4182 procedure Set_Node15 (N : Node_Id; Val : Node_Id) is
4184 pragma Assert (Nkind (N) in N_Entity);
4185 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4188 procedure Set_Node16 (N : Node_Id; Val : Node_Id) is
4190 pragma Assert (Nkind (N) in N_Entity);
4191 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4194 procedure Set_Node17 (N : Node_Id; Val : Node_Id) is
4196 pragma Assert (Nkind (N) in N_Entity);
4197 Nodes.Table (N + 2).Field10 := Union_Id (Val);
4200 procedure Set_Node18 (N : Node_Id; Val : Node_Id) is
4202 pragma Assert (Nkind (N) in N_Entity);
4203 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4206 procedure Set_Node19 (N : Node_Id; Val : Node_Id) is
4208 pragma Assert (Nkind (N) in N_Entity);
4209 Nodes.Table (N + 3).Field6 := Union_Id (Val);
4212 procedure Set_Node20 (N : Node_Id; Val : Node_Id) is
4214 pragma Assert (Nkind (N) in N_Entity);
4215 Nodes.Table (N + 3).Field7 := Union_Id (Val);
4218 procedure Set_Node21 (N : Node_Id; Val : Node_Id) is
4220 pragma Assert (Nkind (N) in N_Entity);
4221 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4224 procedure Set_Node22 (N : Node_Id; Val : Node_Id) is
4226 pragma Assert (Nkind (N) in N_Entity);
4227 Nodes.Table (N + 3).Field9 := Union_Id (Val);
4230 procedure Set_Node23 (N : Node_Id; Val : Node_Id) is
4232 pragma Assert (Nkind (N) in N_Entity);
4233 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4236 procedure Set_Node24 (N : Node_Id; Val : Node_Id) is
4238 pragma Assert (Nkind (N) in N_Entity);
4239 Nodes.Table (N + 4).Field6 := Union_Id (Val);
4242 procedure Set_Node25 (N : Node_Id; Val : Node_Id) is
4244 pragma Assert (Nkind (N) in N_Entity);
4245 Nodes.Table (N + 4).Field7 := Union_Id (Val);
4248 procedure Set_Node26 (N : Node_Id; Val : Node_Id) is
4250 pragma Assert (Nkind (N) in N_Entity);
4251 Nodes.Table (N + 4).Field8 := Union_Id (Val);
4254 procedure Set_Node27 (N : Node_Id; Val : Node_Id) is
4256 pragma Assert (Nkind (N) in N_Entity);
4257 Nodes.Table (N + 4).Field9 := Union_Id (Val);
4260 procedure Set_Node28 (N : Node_Id; Val : Node_Id) is
4262 pragma Assert (Nkind (N) in N_Entity);
4263 Nodes.Table (N + 4).Field10 := Union_Id (Val);
4266 procedure Set_List1 (N : Node_Id; Val : List_Id) is
4268 pragma Assert (N <= Nodes.Last);
4269 Nodes.Table (N).Field1 := Union_Id (Val);
4272 procedure Set_List2 (N : Node_Id; Val : List_Id) is
4274 pragma Assert (N <= Nodes.Last);
4275 Nodes.Table (N).Field2 := Union_Id (Val);
4278 procedure Set_List3 (N : Node_Id; Val : List_Id) is
4280 pragma Assert (N <= Nodes.Last);
4281 Nodes.Table (N).Field3 := Union_Id (Val);
4284 procedure Set_List4 (N : Node_Id; Val : List_Id) is
4286 pragma Assert (N <= Nodes.Last);
4287 Nodes.Table (N).Field4 := Union_Id (Val);
4290 procedure Set_List5 (N : Node_Id; Val : List_Id) is
4292 pragma Assert (N <= Nodes.Last);
4293 Nodes.Table (N).Field5 := Union_Id (Val);
4296 procedure Set_List10 (N : Node_Id; Val : List_Id) is
4298 pragma Assert (Nkind (N) in N_Entity);
4299 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4302 procedure Set_List14 (N : Node_Id; Val : List_Id) is
4304 pragma Assert (Nkind (N) in N_Entity);
4305 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4308 procedure Set_Elist1 (N : Node_Id; Val : Elist_Id) is
4310 Nodes.Table (N).Field1 := Union_Id (Val);
4313 procedure Set_Elist2 (N : Node_Id; Val : Elist_Id) is
4315 Nodes.Table (N).Field2 := Union_Id (Val);
4318 procedure Set_Elist3 (N : Node_Id; Val : Elist_Id) is
4320 Nodes.Table (N).Field3 := Union_Id (Val);
4323 procedure Set_Elist4 (N : Node_Id; Val : Elist_Id) is
4325 Nodes.Table (N).Field4 := Union_Id (Val);
4328 procedure Set_Elist8 (N : Node_Id; Val : Elist_Id) is
4330 pragma Assert (Nkind (N) in N_Entity);
4331 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4334 procedure Set_Elist13 (N : Node_Id; Val : Elist_Id) is
4336 pragma Assert (Nkind (N) in N_Entity);
4337 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4340 procedure Set_Elist15 (N : Node_Id; Val : Elist_Id) is
4342 pragma Assert (Nkind (N) in N_Entity);
4343 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4346 procedure Set_Elist16 (N : Node_Id; Val : Elist_Id) is
4348 pragma Assert (Nkind (N) in N_Entity);
4349 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4352 procedure Set_Elist18 (N : Node_Id; Val : Elist_Id) is
4354 pragma Assert (Nkind (N) in N_Entity);
4355 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4358 procedure Set_Elist21 (N : Node_Id; Val : Elist_Id) is
4360 pragma Assert (Nkind (N) in N_Entity);
4361 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4364 procedure Set_Elist23 (N : Node_Id; Val : Elist_Id) is
4366 pragma Assert (Nkind (N) in N_Entity);
4367 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4370 procedure Set_Elist25 (N : Node_Id; Val : Elist_Id) is
4372 pragma Assert (Nkind (N) in N_Entity);
4373 Nodes.Table (N + 4).Field7 := Union_Id (Val);
4376 procedure Set_Elist26 (N : Node_Id; Val : Elist_Id) is
4378 pragma Assert (Nkind (N) in N_Entity);
4379 Nodes.Table (N + 4).Field8 := Union_Id (Val);
4382 procedure Set_Name1 (N : Node_Id; Val : Name_Id) is
4384 pragma Assert (N <= Nodes.Last);
4385 Nodes.Table (N).Field1 := Union_Id (Val);
4388 procedure Set_Name2 (N : Node_Id; Val : Name_Id) is
4390 pragma Assert (N <= Nodes.Last);
4391 Nodes.Table (N).Field2 := Union_Id (Val);
4394 procedure Set_Str3 (N : Node_Id; Val : String_Id) is
4396 pragma Assert (N <= Nodes.Last);
4397 Nodes.Table (N).Field3 := Union_Id (Val);
4400 procedure Set_Uint2 (N : Node_Id; Val : Uint) is
4402 pragma Assert (N <= Nodes.Last);
4403 Nodes.Table (N).Field2 := To_Union (Val);
4406 procedure Set_Uint3 (N : Node_Id; Val : Uint) is
4408 pragma Assert (N <= Nodes.Last);
4409 Nodes.Table (N).Field3 := To_Union (Val);
4412 procedure Set_Uint4 (N : Node_Id; Val : Uint) is
4414 pragma Assert (N <= Nodes.Last);
4415 Nodes.Table (N).Field4 := To_Union (Val);
4418 procedure Set_Uint5 (N : Node_Id; Val : Uint) is
4420 pragma Assert (N <= Nodes.Last);
4421 Nodes.Table (N).Field5 := To_Union (Val);
4424 procedure Set_Uint8 (N : Node_Id; Val : Uint) is
4426 pragma Assert (Nkind (N) in N_Entity);
4427 Nodes.Table (N + 1).Field8 := To_Union (Val);
4430 procedure Set_Uint9 (N : Node_Id; Val : Uint) is
4432 pragma Assert (Nkind (N) in N_Entity);
4433 Nodes.Table (N + 1).Field9 := To_Union (Val);
4436 procedure Set_Uint10 (N : Node_Id; Val : Uint) is
4438 pragma Assert (Nkind (N) in N_Entity);
4439 Nodes.Table (N + 1).Field10 := To_Union (Val);
4442 procedure Set_Uint11 (N : Node_Id; Val : Uint) is
4444 pragma Assert (Nkind (N) in N_Entity);
4445 Nodes.Table (N + 1).Field11 := To_Union (Val);
4448 procedure Set_Uint12 (N : Node_Id; Val : Uint) is
4450 pragma Assert (Nkind (N) in N_Entity);
4451 Nodes.Table (N + 1).Field12 := To_Union (Val);
4454 procedure Set_Uint13 (N : Node_Id; Val : Uint) is
4456 pragma Assert (Nkind (N) in N_Entity);
4457 Nodes.Table (N + 2).Field6 := To_Union (Val);
4460 procedure Set_Uint14 (N : Node_Id; Val : Uint) is
4462 pragma Assert (Nkind (N) in N_Entity);
4463 Nodes.Table (N + 2).Field7 := To_Union (Val);
4466 procedure Set_Uint15 (N : Node_Id; Val : Uint) is
4468 pragma Assert (Nkind (N) in N_Entity);
4469 Nodes.Table (N + 2).Field8 := To_Union (Val);
4472 procedure Set_Uint16 (N : Node_Id; Val : Uint) is
4474 pragma Assert (Nkind (N) in N_Entity);
4475 Nodes.Table (N + 2).Field9 := To_Union (Val);
4478 procedure Set_Uint17 (N : Node_Id; Val : Uint) is
4480 pragma Assert (Nkind (N) in N_Entity);
4481 Nodes.Table (N + 2).Field10 := To_Union (Val);
4484 procedure Set_Uint22 (N : Node_Id; Val : Uint) is
4486 pragma Assert (Nkind (N) in N_Entity);
4487 Nodes.Table (N + 3).Field9 := To_Union (Val);
4490 procedure Set_Ureal3 (N : Node_Id; Val : Ureal) is
4492 pragma Assert (N <= Nodes.Last);
4493 Nodes.Table (N).Field3 := To_Union (Val);
4496 procedure Set_Ureal18 (N : Node_Id; Val : Ureal) is
4498 pragma Assert (Nkind (N) in N_Entity);
4499 Nodes.Table (N + 2).Field11 := To_Union (Val);
4502 procedure Set_Ureal21 (N : Node_Id; Val : Ureal) is
4504 pragma Assert (Nkind (N) in N_Entity);
4505 Nodes.Table (N + 3).Field8 := To_Union (Val);
4508 procedure Set_Flag4 (N : Node_Id; Val : Boolean) is
4510 pragma Assert (N <= Nodes.Last);
4511 Nodes.Table (N).Flag4 := Val;
4514 procedure Set_Flag5 (N : Node_Id; Val : Boolean) is
4516 pragma Assert (N <= Nodes.Last);
4517 Nodes.Table (N).Flag5 := Val;
4520 procedure Set_Flag6 (N : Node_Id; Val : Boolean) is
4522 pragma Assert (N <= Nodes.Last);
4523 Nodes.Table (N).Flag6 := Val;
4526 procedure Set_Flag7 (N : Node_Id; Val : Boolean) is
4528 pragma Assert (N <= Nodes.Last);
4529 Nodes.Table (N).Flag7 := Val;
4532 procedure Set_Flag8 (N : Node_Id; Val : Boolean) is
4534 pragma Assert (N <= Nodes.Last);
4535 Nodes.Table (N).Flag8 := Val;
4538 procedure Set_Flag9 (N : Node_Id; Val : Boolean) is
4540 pragma Assert (N <= Nodes.Last);
4541 Nodes.Table (N).Flag9 := Val;
4544 procedure Set_Flag10 (N : Node_Id; Val : Boolean) is
4546 pragma Assert (N <= Nodes.Last);
4547 Nodes.Table (N).Flag10 := Val;
4550 procedure Set_Flag11 (N : Node_Id; Val : Boolean) is
4552 pragma Assert (N <= Nodes.Last);
4553 Nodes.Table (N).Flag11 := Val;
4556 procedure Set_Flag12 (N : Node_Id; Val : Boolean) is
4558 pragma Assert (N <= Nodes.Last);
4559 Nodes.Table (N).Flag12 := Val;
4562 procedure Set_Flag13 (N : Node_Id; Val : Boolean) is
4564 pragma Assert (N <= Nodes.Last);
4565 Nodes.Table (N).Flag13 := Val;
4568 procedure Set_Flag14 (N : Node_Id; Val : Boolean) is
4570 pragma Assert (N <= Nodes.Last);
4571 Nodes.Table (N).Flag14 := Val;
4574 procedure Set_Flag15 (N : Node_Id; Val : Boolean) is
4576 pragma Assert (N <= Nodes.Last);
4577 Nodes.Table (N).Flag15 := Val;
4580 procedure Set_Flag16 (N : Node_Id; Val : Boolean) is
4582 pragma Assert (N <= Nodes.Last);
4583 Nodes.Table (N).Flag16 := Val;
4586 procedure Set_Flag17 (N : Node_Id; Val : Boolean) is
4588 pragma Assert (N <= Nodes.Last);
4589 Nodes.Table (N).Flag17 := Val;
4592 procedure Set_Flag18 (N : Node_Id; Val : Boolean) is
4594 pragma Assert (N <= Nodes.Last);
4595 Nodes.Table (N).Flag18 := Val;
4598 procedure Set_Flag19 (N : Node_Id; Val : Boolean) is
4600 pragma Assert (Nkind (N) in N_Entity);
4601 Nodes.Table (N + 1).In_List := Val;
4604 procedure Set_Flag20 (N : Node_Id; Val : Boolean) is
4606 pragma Assert (Nkind (N) in N_Entity);
4607 Nodes.Table (N + 1).Unused_1 := Val;
4610 procedure Set_Flag21 (N : Node_Id; Val : Boolean) is
4612 pragma Assert (Nkind (N) in N_Entity);
4613 Nodes.Table (N + 1).Rewrite_Ins := Val;
4616 procedure Set_Flag22 (N : Node_Id; Val : Boolean) is
4618 pragma Assert (Nkind (N) in N_Entity);
4619 Nodes.Table (N + 1).Analyzed := Val;
4622 procedure Set_Flag23 (N : Node_Id; Val : Boolean) is
4624 pragma Assert (Nkind (N) in N_Entity);
4625 Nodes.Table (N + 1).Comes_From_Source := Val;
4628 procedure Set_Flag24 (N : Node_Id; Val : Boolean) is
4630 pragma Assert (Nkind (N) in N_Entity);
4631 Nodes.Table (N + 1).Error_Posted := Val;
4634 procedure Set_Flag25 (N : Node_Id; Val : Boolean) is
4636 pragma Assert (Nkind (N) in N_Entity);
4637 Nodes.Table (N + 1).Flag4 := Val;
4640 procedure Set_Flag26 (N : Node_Id; Val : Boolean) is
4642 pragma Assert (Nkind (N) in N_Entity);
4643 Nodes.Table (N + 1).Flag5 := Val;
4646 procedure Set_Flag27 (N : Node_Id; Val : Boolean) is
4648 pragma Assert (Nkind (N) in N_Entity);
4649 Nodes.Table (N + 1).Flag6 := Val;
4652 procedure Set_Flag28 (N : Node_Id; Val : Boolean) is
4654 pragma Assert (Nkind (N) in N_Entity);
4655 Nodes.Table (N + 1).Flag7 := Val;
4658 procedure Set_Flag29 (N : Node_Id; Val : Boolean) is
4660 pragma Assert (Nkind (N) in N_Entity);
4661 Nodes.Table (N + 1).Flag8 := Val;
4664 procedure Set_Flag30 (N : Node_Id; Val : Boolean) is
4666 pragma Assert (Nkind (N) in N_Entity);
4667 Nodes.Table (N + 1).Flag9 := Val;
4670 procedure Set_Flag31 (N : Node_Id; Val : Boolean) is
4672 pragma Assert (Nkind (N) in N_Entity);
4673 Nodes.Table (N + 1).Flag10 := Val;
4676 procedure Set_Flag32 (N : Node_Id; Val : Boolean) is
4678 pragma Assert (Nkind (N) in N_Entity);
4679 Nodes.Table (N + 1).Flag11 := Val;
4682 procedure Set_Flag33 (N : Node_Id; Val : Boolean) is
4684 pragma Assert (Nkind (N) in N_Entity);
4685 Nodes.Table (N + 1).Flag12 := Val;
4688 procedure Set_Flag34 (N : Node_Id; Val : Boolean) is
4690 pragma Assert (Nkind (N) in N_Entity);
4691 Nodes.Table (N + 1).Flag13 := Val;
4694 procedure Set_Flag35 (N : Node_Id; Val : Boolean) is
4696 pragma Assert (Nkind (N) in N_Entity);
4697 Nodes.Table (N + 1).Flag14 := Val;
4700 procedure Set_Flag36 (N : Node_Id; Val : Boolean) is
4702 pragma Assert (Nkind (N) in N_Entity);
4703 Nodes.Table (N + 1).Flag15 := Val;
4706 procedure Set_Flag37 (N : Node_Id; Val : Boolean) is
4708 pragma Assert (Nkind (N) in N_Entity);
4709 Nodes.Table (N + 1).Flag16 := Val;
4712 procedure Set_Flag38 (N : Node_Id; Val : Boolean) is
4714 pragma Assert (Nkind (N) in N_Entity);
4715 Nodes.Table (N + 1).Flag17 := Val;
4718 procedure Set_Flag39 (N : Node_Id; Val : Boolean) is
4720 pragma Assert (Nkind (N) in N_Entity);
4721 Nodes.Table (N + 1).Flag18 := Val;
4724 procedure Set_Flag40 (N : Node_Id; Val : Boolean) is
4726 pragma Assert (Nkind (N) in N_Entity);
4727 Nodes.Table (N + 2).In_List := Val;
4730 procedure Set_Flag41 (N : Node_Id; Val : Boolean) is
4732 pragma Assert (Nkind (N) in N_Entity);
4733 Nodes.Table (N + 2).Unused_1 := Val;
4736 procedure Set_Flag42 (N : Node_Id; Val : Boolean) is
4738 pragma Assert (Nkind (N) in N_Entity);
4739 Nodes.Table (N + 2).Rewrite_Ins := Val;
4742 procedure Set_Flag43 (N : Node_Id; Val : Boolean) is
4744 pragma Assert (Nkind (N) in N_Entity);
4745 Nodes.Table (N + 2).Analyzed := Val;
4748 procedure Set_Flag44 (N : Node_Id; Val : Boolean) is
4750 pragma Assert (Nkind (N) in N_Entity);
4751 Nodes.Table (N + 2).Comes_From_Source := Val;
4754 procedure Set_Flag45 (N : Node_Id; Val : Boolean) is
4756 pragma Assert (Nkind (N) in N_Entity);
4757 Nodes.Table (N + 2).Error_Posted := Val;
4760 procedure Set_Flag46 (N : Node_Id; Val : Boolean) is
4762 pragma Assert (Nkind (N) in N_Entity);
4763 Nodes.Table (N + 2).Flag4 := Val;
4766 procedure Set_Flag47 (N : Node_Id; Val : Boolean) is
4768 pragma Assert (Nkind (N) in N_Entity);
4769 Nodes.Table (N + 2).Flag5 := Val;
4772 procedure Set_Flag48 (N : Node_Id; Val : Boolean) is
4774 pragma Assert (Nkind (N) in N_Entity);
4775 Nodes.Table (N + 2).Flag6 := Val;
4778 procedure Set_Flag49 (N : Node_Id; Val : Boolean) is
4780 pragma Assert (Nkind (N) in N_Entity);
4781 Nodes.Table (N + 2).Flag7 := Val;
4784 procedure Set_Flag50 (N : Node_Id; Val : Boolean) is
4786 pragma Assert (Nkind (N) in N_Entity);
4787 Nodes.Table (N + 2).Flag8 := Val;
4790 procedure Set_Flag51 (N : Node_Id; Val : Boolean) is
4792 pragma Assert (Nkind (N) in N_Entity);
4793 Nodes.Table (N + 2).Flag9 := Val;
4796 procedure Set_Flag52 (N : Node_Id; Val : Boolean) is
4798 pragma Assert (Nkind (N) in N_Entity);
4799 Nodes.Table (N + 2).Flag10 := Val;
4802 procedure Set_Flag53 (N : Node_Id; Val : Boolean) is
4804 pragma Assert (Nkind (N) in N_Entity);
4805 Nodes.Table (N + 2).Flag11 := Val;
4808 procedure Set_Flag54 (N : Node_Id; Val : Boolean) is
4810 pragma Assert (Nkind (N) in N_Entity);
4811 Nodes.Table (N + 2).Flag12 := Val;
4814 procedure Set_Flag55 (N : Node_Id; Val : Boolean) is
4816 pragma Assert (Nkind (N) in N_Entity);
4817 Nodes.Table (N + 2).Flag13 := Val;
4820 procedure Set_Flag56 (N : Node_Id; Val : Boolean) is
4822 pragma Assert (Nkind (N) in N_Entity);
4823 Nodes.Table (N + 2).Flag14 := Val;
4826 procedure Set_Flag57 (N : Node_Id; Val : Boolean) is
4828 pragma Assert (Nkind (N) in N_Entity);
4829 Nodes.Table (N + 2).Flag15 := Val;
4832 procedure Set_Flag58 (N : Node_Id; Val : Boolean) is
4834 pragma Assert (Nkind (N) in N_Entity);
4835 Nodes.Table (N + 2).Flag16 := Val;
4838 procedure Set_Flag59 (N : Node_Id; Val : Boolean) is
4840 pragma Assert (Nkind (N) in N_Entity);
4841 Nodes.Table (N + 2).Flag17 := Val;
4844 procedure Set_Flag60 (N : Node_Id; Val : Boolean) is
4846 pragma Assert (Nkind (N) in N_Entity);
4847 Nodes.Table (N + 2).Flag18 := Val;
4850 procedure Set_Flag61 (N : Node_Id; Val : Boolean) is
4852 pragma Assert (Nkind (N) in N_Entity);
4853 Nodes.Table (N + 1).Pflag1 := Val;
4856 procedure Set_Flag62 (N : Node_Id; Val : Boolean) is
4858 pragma Assert (Nkind (N) in N_Entity);
4859 Nodes.Table (N + 1).Pflag2 := Val;
4862 procedure Set_Flag63 (N : Node_Id; Val : Boolean) is
4864 pragma Assert (Nkind (N) in N_Entity);
4865 Nodes.Table (N + 2).Pflag1 := Val;
4868 procedure Set_Flag64 (N : Node_Id; Val : Boolean) is
4870 pragma Assert (Nkind (N) in N_Entity);
4871 Nodes.Table (N + 2).Pflag2 := Val;
4874 procedure Set_Flag65 (N : Node_Id; Val : Boolean) is
4876 pragma Assert (Nkind (N) in N_Entity);
4879 (Nodes
.Table
(N
+ 2).Nkind
'Unrestricted_Access)).Flag65
:= Val
;
4882 procedure Set_Flag66
(N
: Node_Id
; Val
: Boolean) is
4884 pragma Assert
(Nkind
(N
) in N_Entity
);
4887 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag66 := Val;
4890 procedure Set_Flag67 (N : Node_Id; Val : Boolean) is
4892 pragma Assert (Nkind (N) in N_Entity);
4895 (Nodes
.Table
(N
+ 2).Nkind
'Unrestricted_Access)).Flag67
:= Val
;
4898 procedure Set_Flag68
(N
: Node_Id
; Val
: Boolean) is
4900 pragma Assert
(Nkind
(N
) in N_Entity
);
4903 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag68 := Val;
4906 procedure Set_Flag69 (N : Node_Id; Val : Boolean) is
4908 pragma Assert (Nkind (N) in N_Entity);
4911 (Nodes
.Table
(N
+ 2).Nkind
'Unrestricted_Access)).Flag69
:= Val
;
4914 procedure Set_Flag70
(N
: Node_Id
; Val
: Boolean) is
4916 pragma Assert
(Nkind
(N
) in N_Entity
);
4919 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag70 := Val;
4922 procedure Set_Flag71 (N : Node_Id; Val : Boolean) is
4924 pragma Assert (Nkind (N) in N_Entity);
4927 (Nodes
.Table
(N
+ 2).Nkind
'Unrestricted_Access)).Flag71
:= Val
;
4930 procedure Set_Flag72
(N
: Node_Id
; Val
: Boolean) is
4932 pragma Assert
(Nkind
(N
) in N_Entity
);
4935 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag72 := Val;
4938 procedure Set_Flag73 (N : Node_Id; Val : Boolean) is
4940 pragma Assert (Nkind (N) in N_Entity);
4943 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag73
:= Val
;
4946 procedure Set_Flag74
(N
: Node_Id
; Val
: Boolean) is
4948 pragma Assert
(Nkind
(N
) in N_Entity
);
4951 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag74 := Val;
4954 procedure Set_Flag75 (N : Node_Id; Val : Boolean) is
4956 pragma Assert (Nkind (N) in N_Entity);
4959 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag75
:= Val
;
4962 procedure Set_Flag76
(N
: Node_Id
; Val
: Boolean) is
4964 pragma Assert
(Nkind
(N
) in N_Entity
);
4967 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag76 := Val;
4970 procedure Set_Flag77 (N : Node_Id; Val : Boolean) is
4972 pragma Assert (Nkind (N) in N_Entity);
4975 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag77
:= Val
;
4978 procedure Set_Flag78
(N
: Node_Id
; Val
: Boolean) is
4980 pragma Assert
(Nkind
(N
) in N_Entity
);
4983 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag78 := Val;
4986 procedure Set_Flag79 (N : Node_Id; Val : Boolean) is
4988 pragma Assert (Nkind (N) in N_Entity);
4991 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag79
:= Val
;
4994 procedure Set_Flag80
(N
: Node_Id
; Val
: Boolean) is
4996 pragma Assert
(Nkind
(N
) in N_Entity
);
4999 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag80 := Val;
5002 procedure Set_Flag81 (N : Node_Id; Val : Boolean) is
5004 pragma Assert (Nkind (N) in N_Entity);
5007 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag81
:= Val
;
5010 procedure Set_Flag82
(N
: Node_Id
; Val
: Boolean) is
5012 pragma Assert
(Nkind
(N
) in N_Entity
);
5015 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag82 := Val;
5018 procedure Set_Flag83 (N : Node_Id; Val : Boolean) is
5020 pragma Assert (Nkind (N) in N_Entity);
5023 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag83
:= Val
;
5026 procedure Set_Flag84
(N
: Node_Id
; Val
: Boolean) is
5028 pragma Assert
(Nkind
(N
) in N_Entity
);
5031 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag84 := Val;
5034 procedure Set_Flag85 (N : Node_Id; Val : Boolean) is
5036 pragma Assert (Nkind (N) in N_Entity);
5039 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag85
:= Val
;
5042 procedure Set_Flag86
(N
: Node_Id
; Val
: Boolean) is
5044 pragma Assert
(Nkind
(N
) in N_Entity
);
5047 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag86 := Val;
5050 procedure Set_Flag87 (N : Node_Id; Val : Boolean) is
5052 pragma Assert (Nkind (N) in N_Entity);
5055 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag87
:= Val
;
5058 procedure Set_Flag88
(N
: Node_Id
; Val
: Boolean) is
5060 pragma Assert
(Nkind
(N
) in N_Entity
);
5063 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag88 := Val;
5066 procedure Set_Flag89 (N : Node_Id; Val : Boolean) is
5068 pragma Assert (Nkind (N) in N_Entity);
5071 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag89
:= Val
;
5074 procedure Set_Flag90
(N
: Node_Id
; Val
: Boolean) is
5076 pragma Assert
(Nkind
(N
) in N_Entity
);
5079 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag90 := Val;
5082 procedure Set_Flag91 (N : Node_Id; Val : Boolean) is
5084 pragma Assert (Nkind (N) in N_Entity);
5087 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag91
:= Val
;
5090 procedure Set_Flag92
(N
: Node_Id
; Val
: Boolean) is
5092 pragma Assert
(Nkind
(N
) in N_Entity
);
5095 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag92 := Val;
5098 procedure Set_Flag93 (N : Node_Id; Val : Boolean) is
5100 pragma Assert (Nkind (N) in N_Entity);
5103 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag93
:= Val
;
5106 procedure Set_Flag94
(N
: Node_Id
; Val
: Boolean) is
5108 pragma Assert
(Nkind
(N
) in N_Entity
);
5111 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag94 := Val;
5114 procedure Set_Flag95 (N : Node_Id; Val : Boolean) is
5116 pragma Assert (Nkind (N) in N_Entity);
5119 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag95
:= Val
;
5122 procedure Set_Flag96
(N
: Node_Id
; Val
: Boolean) is
5124 pragma Assert
(Nkind
(N
) in N_Entity
);
5127 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag96 := Val;
5130 procedure Set_Flag97 (N : Node_Id; Val : Boolean) is
5132 pragma Assert (Nkind (N) in N_Entity);
5135 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag97
:= Val
;
5138 procedure Set_Flag98
(N
: Node_Id
; Val
: Boolean) is
5140 pragma Assert
(Nkind
(N
) in N_Entity
);
5143 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag98 := Val;
5146 procedure Set_Flag99 (N : Node_Id; Val : Boolean) is
5148 pragma Assert (Nkind (N) in N_Entity);
5151 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag99
:= Val
;
5154 procedure Set_Flag100
(N
: Node_Id
; Val
: Boolean) is
5156 pragma Assert
(Nkind
(N
) in N_Entity
);
5159 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag100 := Val;
5162 procedure Set_Flag101 (N : Node_Id; Val : Boolean) is
5164 pragma Assert (Nkind (N) in N_Entity);
5167 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag101
:= Val
;
5170 procedure Set_Flag102
(N
: Node_Id
; Val
: Boolean) is
5172 pragma Assert
(Nkind
(N
) in N_Entity
);
5175 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag102 := Val;
5178 procedure Set_Flag103 (N : Node_Id; Val : Boolean) is
5180 pragma Assert (Nkind (N) in N_Entity);
5183 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag103
:= Val
;
5186 procedure Set_Flag104
(N
: Node_Id
; Val
: Boolean) is
5188 pragma Assert
(Nkind
(N
) in N_Entity
);
5191 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag104 := Val;
5194 procedure Set_Flag105 (N : Node_Id; Val : Boolean) is
5196 pragma Assert (Nkind (N) in N_Entity);
5199 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag105
:= Val
;
5202 procedure Set_Flag106
(N
: Node_Id
; Val
: Boolean) is
5204 pragma Assert
(Nkind
(N
) in N_Entity
);
5207 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag106 := Val;
5210 procedure Set_Flag107 (N : Node_Id; Val : Boolean) is
5212 pragma Assert (Nkind (N) in N_Entity);
5215 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag107
:= Val
;
5218 procedure Set_Flag108
(N
: Node_Id
; Val
: Boolean) is
5220 pragma Assert
(Nkind
(N
) in N_Entity
);
5223 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag108 := Val;
5226 procedure Set_Flag109 (N : Node_Id; Val : Boolean) is
5228 pragma Assert (Nkind (N) in N_Entity);
5231 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag109
:= Val
;
5234 procedure Set_Flag110
(N
: Node_Id
; Val
: Boolean) is
5236 pragma Assert
(Nkind
(N
) in N_Entity
);
5239 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag110 := Val;
5242 procedure Set_Flag111 (N : Node_Id; Val : Boolean) is
5244 pragma Assert (Nkind (N) in N_Entity);
5247 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag111
:= Val
;
5250 procedure Set_Flag112
(N
: Node_Id
; Val
: Boolean) is
5252 pragma Assert
(Nkind
(N
) in N_Entity
);
5255 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag112 := Val;
5258 procedure Set_Flag113 (N : Node_Id; Val : Boolean) is
5260 pragma Assert (Nkind (N) in N_Entity);
5263 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag113
:= Val
;
5266 procedure Set_Flag114
(N
: Node_Id
; Val
: Boolean) is
5268 pragma Assert
(Nkind
(N
) in N_Entity
);
5271 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag114 := Val;
5274 procedure Set_Flag115 (N : Node_Id; Val : Boolean) is
5276 pragma Assert (Nkind (N) in N_Entity);
5279 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag115
:= Val
;
5282 procedure Set_Flag116
(N
: Node_Id
; Val
: Boolean) is
5284 pragma Assert
(Nkind
(N
) in N_Entity
);
5287 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag116 := Val;
5290 procedure Set_Flag117 (N : Node_Id; Val : Boolean) is
5292 pragma Assert (Nkind (N) in N_Entity);
5295 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag117
:= Val
;
5298 procedure Set_Flag118
(N
: Node_Id
; Val
: Boolean) is
5300 pragma Assert
(Nkind
(N
) in N_Entity
);
5303 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag118 := Val;
5306 procedure Set_Flag119 (N : Node_Id; Val : Boolean) is
5308 pragma Assert (Nkind (N) in N_Entity);
5311 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag119
:= Val
;
5314 procedure Set_Flag120
(N
: Node_Id
; Val
: Boolean) is
5316 pragma Assert
(Nkind
(N
) in N_Entity
);
5319 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag120 := Val;
5322 procedure Set_Flag121 (N : Node_Id; Val : Boolean) is
5324 pragma Assert (Nkind (N) in N_Entity);
5327 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag121
:= Val
;
5330 procedure Set_Flag122
(N
: Node_Id
; Val
: Boolean) is
5332 pragma Assert
(Nkind
(N
) in N_Entity
);
5335 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag122 := Val;
5338 procedure Set_Flag123 (N : Node_Id; Val : Boolean) is
5340 pragma Assert (Nkind (N) in N_Entity);
5343 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag123
:= Val
;
5346 procedure Set_Flag124
(N
: Node_Id
; Val
: Boolean) is
5348 pragma Assert
(Nkind
(N
) in N_Entity
);
5351 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag124 := Val;
5354 procedure Set_Flag125 (N : Node_Id; Val : Boolean) is
5356 pragma Assert (Nkind (N) in N_Entity);
5359 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag125
:= Val
;
5362 procedure Set_Flag126
(N
: Node_Id
; Val
: Boolean) is
5364 pragma Assert
(Nkind
(N
) in N_Entity
);
5367 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag126 := Val;
5370 procedure Set_Flag127 (N : Node_Id; Val : Boolean) is
5372 pragma Assert (Nkind (N) in N_Entity);
5375 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag127
:= Val
;
5378 procedure Set_Flag128
(N
: Node_Id
; Val
: Boolean) is
5380 pragma Assert
(Nkind
(N
) in N_Entity
);
5383 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag128 := Val;
5386 procedure Set_Flag129 (N : Node_Id; Val : Boolean) is
5388 pragma Assert (Nkind (N) in N_Entity);
5389 Nodes.Table (N + 3).In_List := Val;
5392 procedure Set_Flag130 (N : Node_Id; Val : Boolean) is
5394 pragma Assert (Nkind (N) in N_Entity);
5395 Nodes.Table (N + 3).Unused_1 := Val;
5398 procedure Set_Flag131 (N : Node_Id; Val : Boolean) is
5400 pragma Assert (Nkind (N) in N_Entity);
5401 Nodes.Table (N + 3).Rewrite_Ins := Val;
5404 procedure Set_Flag132 (N : Node_Id; Val : Boolean) is
5406 pragma Assert (Nkind (N) in N_Entity);
5407 Nodes.Table (N + 3).Analyzed := Val;
5410 procedure Set_Flag133 (N : Node_Id; Val : Boolean) is
5412 pragma Assert (Nkind (N) in N_Entity);
5413 Nodes.Table (N + 3).Comes_From_Source := Val;
5416 procedure Set_Flag134 (N : Node_Id; Val : Boolean) is
5418 pragma Assert (Nkind (N) in N_Entity);
5419 Nodes.Table (N + 3).Error_Posted := Val;
5422 procedure Set_Flag135 (N : Node_Id; Val : Boolean) is
5424 pragma Assert (Nkind (N) in N_Entity);
5425 Nodes.Table (N + 3).Flag4 := Val;
5428 procedure Set_Flag136 (N : Node_Id; Val : Boolean) is
5430 pragma Assert (Nkind (N) in N_Entity);
5431 Nodes.Table (N + 3).Flag5 := Val;
5434 procedure Set_Flag137 (N : Node_Id; Val : Boolean) is
5436 pragma Assert (Nkind (N) in N_Entity);
5437 Nodes.Table (N + 3).Flag6 := Val;
5440 procedure Set_Flag138 (N : Node_Id; Val : Boolean) is
5442 pragma Assert (Nkind (N) in N_Entity);
5443 Nodes.Table (N + 3).Flag7 := Val;
5446 procedure Set_Flag139 (N : Node_Id; Val : Boolean) is
5448 pragma Assert (Nkind (N) in N_Entity);
5449 Nodes.Table (N + 3).Flag8 := Val;
5452 procedure Set_Flag140 (N : Node_Id; Val : Boolean) is
5454 pragma Assert (Nkind (N) in N_Entity);
5455 Nodes.Table (N + 3).Flag9 := Val;
5458 procedure Set_Flag141 (N : Node_Id; Val : Boolean) is
5460 pragma Assert (Nkind (N) in N_Entity);
5461 Nodes.Table (N + 3).Flag10 := Val;
5464 procedure Set_Flag142 (N : Node_Id; Val : Boolean) is
5466 pragma Assert (Nkind (N) in N_Entity);
5467 Nodes.Table (N + 3).Flag11 := Val;
5470 procedure Set_Flag143 (N : Node_Id; Val : Boolean) is
5472 pragma Assert (Nkind (N) in N_Entity);
5473 Nodes.Table (N + 3).Flag12 := Val;
5476 procedure Set_Flag144 (N : Node_Id; Val : Boolean) is
5478 pragma Assert (Nkind (N) in N_Entity);
5479 Nodes.Table (N + 3).Flag13 := Val;
5482 procedure Set_Flag145 (N : Node_Id; Val : Boolean) is
5484 pragma Assert (Nkind (N) in N_Entity);
5485 Nodes.Table (N + 3).Flag14 := Val;
5488 procedure Set_Flag146 (N : Node_Id; Val : Boolean) is
5490 pragma Assert (Nkind (N) in N_Entity);
5491 Nodes.Table (N + 3).Flag15 := Val;
5494 procedure Set_Flag147 (N : Node_Id; Val : Boolean) is
5496 pragma Assert (Nkind (N) in N_Entity);
5497 Nodes.Table (N + 3).Flag16 := Val;
5500 procedure Set_Flag148 (N : Node_Id; Val : Boolean) is
5502 pragma Assert (Nkind (N) in N_Entity);
5503 Nodes.Table (N + 3).Flag17 := Val;
5506 procedure Set_Flag149 (N : Node_Id; Val : Boolean) is
5508 pragma Assert (Nkind (N) in N_Entity);
5509 Nodes.Table (N + 3).Flag18 := Val;
5512 procedure Set_Flag150 (N : Node_Id; Val : Boolean) is
5514 pragma Assert (Nkind (N) in N_Entity);
5515 Nodes.Table (N + 3).Pflag1 := Val;
5518 procedure Set_Flag151 (N : Node_Id; Val : Boolean) is
5520 pragma Assert (Nkind (N) in N_Entity);
5521 Nodes.Table (N + 3).Pflag2 := Val;
5524 procedure Set_Flag152 (N : Node_Id; Val : Boolean) is
5526 pragma Assert (Nkind (N) in N_Entity);
5529 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag152
:= Val
;
5532 procedure Set_Flag153
(N
: Node_Id
; Val
: Boolean) is
5534 pragma Assert
(Nkind
(N
) in N_Entity
);
5537 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag153 := Val;
5540 procedure Set_Flag154 (N : Node_Id; Val : Boolean) is
5542 pragma Assert (Nkind (N) in N_Entity);
5545 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag154
:= Val
;
5548 procedure Set_Flag155
(N
: Node_Id
; Val
: Boolean) is
5550 pragma Assert
(Nkind
(N
) in N_Entity
);
5553 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag155 := Val;
5556 procedure Set_Flag156 (N : Node_Id; Val : Boolean) is
5558 pragma Assert (Nkind (N) in N_Entity);
5561 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag156
:= Val
;
5564 procedure Set_Flag157
(N
: Node_Id
; Val
: Boolean) is
5566 pragma Assert
(Nkind
(N
) in N_Entity
);
5569 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag157 := Val;
5572 procedure Set_Flag158 (N : Node_Id; Val : Boolean) is
5574 pragma Assert (Nkind (N) in N_Entity);
5577 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag158
:= Val
;
5580 procedure Set_Flag159
(N
: Node_Id
; Val
: Boolean) is
5582 pragma Assert
(Nkind
(N
) in N_Entity
);
5585 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag159 := Val;
5588 procedure Set_Flag160 (N : Node_Id; Val : Boolean) is
5590 pragma Assert (Nkind (N) in N_Entity);
5593 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag160
:= Val
;
5596 procedure Set_Flag161
(N
: Node_Id
; Val
: Boolean) is
5598 pragma Assert
(Nkind
(N
) in N_Entity
);
5601 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag161 := Val;
5604 procedure Set_Flag162 (N : Node_Id; Val : Boolean) is
5606 pragma Assert (Nkind (N) in N_Entity);
5609 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag162
:= Val
;
5612 procedure Set_Flag163
(N
: Node_Id
; Val
: Boolean) is
5614 pragma Assert
(Nkind
(N
) in N_Entity
);
5617 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag163 := Val;
5620 procedure Set_Flag164 (N : Node_Id; Val : Boolean) is
5622 pragma Assert (Nkind (N) in N_Entity);
5625 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag164
:= Val
;
5628 procedure Set_Flag165
(N
: Node_Id
; Val
: Boolean) is
5630 pragma Assert
(Nkind
(N
) in N_Entity
);
5633 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag165 := Val;
5636 procedure Set_Flag166 (N : Node_Id; Val : Boolean) is
5638 pragma Assert (Nkind (N) in N_Entity);
5641 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag166
:= Val
;
5644 procedure Set_Flag167
(N
: Node_Id
; Val
: Boolean) is
5646 pragma Assert
(Nkind
(N
) in N_Entity
);
5649 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag167 := Val;
5652 procedure Set_Flag168 (N : Node_Id; Val : Boolean) is
5654 pragma Assert (Nkind (N) in N_Entity);
5657 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag168
:= Val
;
5660 procedure Set_Flag169
(N
: Node_Id
; Val
: Boolean) is
5662 pragma Assert
(Nkind
(N
) in N_Entity
);
5665 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag169 := Val;
5668 procedure Set_Flag170 (N : Node_Id; Val : Boolean) is
5670 pragma Assert (Nkind (N) in N_Entity);
5673 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag170
:= Val
;
5676 procedure Set_Flag171
(N
: Node_Id
; Val
: Boolean) is
5678 pragma Assert
(Nkind
(N
) in N_Entity
);
5681 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag171 := Val;
5684 procedure Set_Flag172 (N : Node_Id; Val : Boolean) is
5686 pragma Assert (Nkind (N) in N_Entity);
5689 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag172
:= Val
;
5692 procedure Set_Flag173
(N
: Node_Id
; Val
: Boolean) is
5694 pragma Assert
(Nkind
(N
) in N_Entity
);
5697 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag173 := Val;
5700 procedure Set_Flag174 (N : Node_Id; Val : Boolean) is
5702 pragma Assert (Nkind (N) in N_Entity);
5705 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag174
:= Val
;
5708 procedure Set_Flag175
(N
: Node_Id
; Val
: Boolean) is
5710 pragma Assert
(Nkind
(N
) in N_Entity
);
5713 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag175 := Val;
5716 procedure Set_Flag176 (N : Node_Id; Val : Boolean) is
5718 pragma Assert (Nkind (N) in N_Entity);
5721 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag176
:= Val
;
5724 procedure Set_Flag177
(N
: Node_Id
; Val
: Boolean) is
5726 pragma Assert
(Nkind
(N
) in N_Entity
);
5729 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag177 := Val;
5732 procedure Set_Flag178 (N : Node_Id; Val : Boolean) is
5734 pragma Assert (Nkind (N) in N_Entity);
5737 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag178
:= Val
;
5740 procedure Set_Flag179
(N
: Node_Id
; Val
: Boolean) is
5742 pragma Assert
(Nkind
(N
) in N_Entity
);
5745 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag179 := Val;
5748 procedure Set_Flag180 (N : Node_Id; Val : Boolean) is
5750 pragma Assert (Nkind (N) in N_Entity);
5753 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag180
:= Val
;
5756 procedure Set_Flag181
(N
: Node_Id
; Val
: Boolean) is
5758 pragma Assert
(Nkind
(N
) in N_Entity
);
5761 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag181 := Val;
5764 procedure Set_Flag182 (N : Node_Id; Val : Boolean) is
5766 pragma Assert (Nkind (N) in N_Entity);
5769 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag182
:= Val
;
5772 procedure Set_Flag183
(N
: Node_Id
; Val
: Boolean) is
5774 pragma Assert
(Nkind
(N
) in N_Entity
);
5777 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag183 := Val;
5780 procedure Set_Flag184 (N : Node_Id; Val : Boolean) is
5782 pragma Assert (Nkind (N) in N_Entity);
5785 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag184
:= Val
;
5788 procedure Set_Flag185
(N
: Node_Id
; Val
: Boolean) is
5790 pragma Assert
(Nkind
(N
) in N_Entity
);
5793 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag185 := Val;
5796 procedure Set_Flag186 (N : Node_Id; Val : Boolean) is
5798 pragma Assert (Nkind (N) in N_Entity);
5801 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag186
:= Val
;
5804 procedure Set_Flag187
(N
: Node_Id
; Val
: Boolean) is
5806 pragma Assert
(Nkind
(N
) in N_Entity
);
5809 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag187 := Val;
5812 procedure Set_Flag188 (N : Node_Id; Val : Boolean) is
5814 pragma Assert (Nkind (N) in N_Entity);
5817 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag188
:= Val
;
5820 procedure Set_Flag189
(N
: Node_Id
; Val
: Boolean) is
5822 pragma Assert
(Nkind
(N
) in N_Entity
);
5825 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag189 := Val;
5828 procedure Set_Flag190 (N : Node_Id; Val : Boolean) is
5830 pragma Assert (Nkind (N) in N_Entity);
5833 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag190
:= Val
;
5836 procedure Set_Flag191
(N
: Node_Id
; Val
: Boolean) is
5838 pragma Assert
(Nkind
(N
) in N_Entity
);
5841 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag191 := Val;
5844 procedure Set_Flag192 (N : Node_Id; Val : Boolean) is
5846 pragma Assert (Nkind (N) in N_Entity);
5849 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag192
:= Val
;
5852 procedure Set_Flag193
(N
: Node_Id
; Val
: Boolean) is
5854 pragma Assert
(Nkind
(N
) in N_Entity
);
5857 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag193 := Val;
5860 procedure Set_Flag194 (N : Node_Id; Val : Boolean) is
5862 pragma Assert (Nkind (N) in N_Entity);
5865 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag194
:= Val
;
5868 procedure Set_Flag195
(N
: Node_Id
; Val
: Boolean) is
5870 pragma Assert
(Nkind
(N
) in N_Entity
);
5873 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag195 := Val;
5876 procedure Set_Flag196 (N : Node_Id; Val : Boolean) is
5878 pragma Assert (Nkind (N) in N_Entity);
5881 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag196
:= Val
;
5884 procedure Set_Flag197
(N
: Node_Id
; Val
: Boolean) is
5886 pragma Assert
(Nkind
(N
) in N_Entity
);
5889 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag197 := Val;
5892 procedure Set_Flag198 (N : Node_Id; Val : Boolean) is
5894 pragma Assert (Nkind (N) in N_Entity);
5897 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag198
:= Val
;
5900 procedure Set_Flag199
(N
: Node_Id
; Val
: Boolean) is
5902 pragma Assert
(Nkind
(N
) in N_Entity
);
5905 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag199 := Val;
5908 procedure Set_Flag200 (N : Node_Id; Val : Boolean) is
5910 pragma Assert (Nkind (N) in N_Entity);
5913 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag200
:= Val
;
5916 procedure Set_Flag201
(N
: Node_Id
; Val
: Boolean) is
5918 pragma Assert
(Nkind
(N
) in N_Entity
);
5921 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag201 := Val;
5924 procedure Set_Flag202 (N : Node_Id; Val : Boolean) is
5926 pragma Assert (Nkind (N) in N_Entity);
5929 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag202
:= Val
;
5932 procedure Set_Flag203
(N
: Node_Id
; Val
: Boolean) is
5934 pragma Assert
(Nkind
(N
) in N_Entity
);
5937 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag203 := Val;
5940 procedure Set_Flag204 (N : Node_Id; Val : Boolean) is
5942 pragma Assert (Nkind (N) in N_Entity);
5945 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag204
:= Val
;
5948 procedure Set_Flag205
(N
: Node_Id
; Val
: Boolean) is
5950 pragma Assert
(Nkind
(N
) in N_Entity
);
5953 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag205 := Val;
5956 procedure Set_Flag206 (N : Node_Id; Val : Boolean) is
5958 pragma Assert (Nkind (N) in N_Entity);
5961 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag206
:= Val
;
5964 procedure Set_Flag207
(N
: Node_Id
; Val
: Boolean) is
5966 pragma Assert
(Nkind
(N
) in N_Entity
);
5969 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag207 := Val;
5972 procedure Set_Flag208 (N : Node_Id; Val : Boolean) is
5974 pragma Assert (Nkind (N) in N_Entity);
5977 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag208
:= Val
;
5980 procedure Set_Flag209
(N
: Node_Id
; Val
: Boolean) is
5982 pragma Assert
(Nkind
(N
) in N_Entity
);
5985 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag209 := Val;
5988 procedure Set_Flag210 (N : Node_Id; Val : Boolean) is
5990 pragma Assert (Nkind (N) in N_Entity);
5993 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag210
:= Val
;
5996 procedure Set_Flag211
(N
: Node_Id
; Val
: Boolean) is
5998 pragma Assert
(Nkind
(N
) in N_Entity
);
6001 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag211 := Val;
6004 procedure Set_Flag212 (N : Node_Id; Val : Boolean) is
6006 pragma Assert (Nkind (N) in N_Entity);
6009 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag212
:= Val
;
6012 procedure Set_Flag213
(N
: Node_Id
; Val
: Boolean) is
6014 pragma Assert
(Nkind
(N
) in N_Entity
);
6017 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag213 := Val;
6020 procedure Set_Flag214 (N : Node_Id; Val : Boolean) is
6022 pragma Assert (Nkind (N) in N_Entity);
6025 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag214
:= Val
;
6028 procedure Set_Flag215
(N
: Node_Id
; Val
: Boolean) is
6030 pragma Assert
(Nkind
(N
) in N_Entity
);
6033 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag215 := Val;
6036 procedure Set_Flag216 (N : Node_Id; Val : Boolean) is
6038 pragma Assert (Nkind (N) in N_Entity);
6041 (Nodes
.Table
(N
+ 4).Field12
'Unrestricted_Access)).Flag216
:= Val
;
6044 procedure Set_Flag217
(N
: Node_Id
; Val
: Boolean) is
6046 pragma Assert
(Nkind
(N
) in N_Entity
);
6049 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag217 := Val;
6052 procedure Set_Flag218 (N : Node_Id; Val : Boolean) is
6054 pragma Assert (Nkind (N) in N_Entity);
6057 (Nodes
.Table
(N
+ 4).Field12
'Unrestricted_Access)).Flag218
:= Val
;
6060 procedure Set_Flag219
(N
: Node_Id
; Val
: Boolean) is
6062 pragma Assert
(Nkind
(N
) in N_Entity
);
6065 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag219 := Val;
6068 procedure Set_Flag220 (N : Node_Id; Val : Boolean) is
6070 pragma Assert (Nkind (N) in N_Entity);
6073 (Nodes
.Table
(N
+ 4).Field12
'Unrestricted_Access)).Flag220
:= Val
;
6076 procedure Set_Flag221
(N
: Node_Id
; Val
: Boolean) is
6078 pragma Assert
(Nkind
(N
) in N_Entity
);
6081 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag221 := Val;
6084 procedure Set_Flag222 (N : Node_Id; Val : Boolean) is
6086 pragma Assert (Nkind (N) in N_Entity);
6089 (Nodes
.Table
(N
+ 4).Field12
'Unrestricted_Access)).Flag222
:= Val
;
6092 procedure Set_Flag223
(N
: Node_Id
; Val
: Boolean) is
6094 pragma Assert
(Nkind
(N
) in N_Entity
);
6097 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag223 := Val;
6100 procedure Set_Flag224 (N : Node_Id; Val : Boolean) is
6102 pragma Assert (Nkind (N) in N_Entity);
6105 (Nodes
.Table
(N
+ 4).Field12
'Unrestricted_Access)).Flag224
:= Val
;
6108 procedure Set_Flag225
(N
: Node_Id
; Val
: Boolean) is
6110 pragma Assert
(Nkind
(N
) in N_Entity
);
6113 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag225 := Val;
6116 procedure Set_Flag226 (N : Node_Id; Val : Boolean) is
6118 pragma Assert (Nkind (N) in N_Entity);
6121 (Nodes
.Table
(N
+ 4).Field12
'Unrestricted_Access)).Flag226
:= Val
;
6124 procedure Set_Flag227
(N
: Node_Id
; Val
: Boolean) is
6126 pragma Assert
(Nkind
(N
) in N_Entity
);
6129 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag227 := Val;
6132 procedure Set_Flag228 (N : Node_Id; Val : Boolean) is
6134 pragma Assert (Nkind (N) in N_Entity);
6137 (Nodes
.Table
(N
+ 4).Field12
'Unrestricted_Access)).Flag228
:= Val
;
6140 procedure Set_Flag229
(N
: Node_Id
; Val
: Boolean) is
6142 pragma Assert
(Nkind
(N
) in N_Entity
);
6145 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag229 := Val;
6148 procedure Set_Flag230 (N : Node_Id; Val : Boolean) is
6150 pragma Assert (Nkind (N) in N_Entity);
6153 (Nodes
.Table
(N
+ 4).Field12
'Unrestricted_Access)).Flag230
:= Val
;
6156 procedure Set_Flag231
(N
: Node_Id
; Val
: Boolean) is
6158 pragma Assert
(Nkind
(N
) in N_Entity
);
6161 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag231 := Val;
6164 procedure Set_Flag232 (N : Node_Id; Val : Boolean) is
6166 pragma Assert (Nkind (N) in N_Entity);
6169 (Nodes
.Table
(N
+ 4).Field12
'Unrestricted_Access)).Flag232
:= Val
;
6172 procedure Set_Flag233
(N
: Node_Id
; Val
: Boolean) is
6174 pragma Assert
(Nkind
(N
) in N_Entity
);
6177 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag233 := Val;
6180 procedure Set_Flag234 (N : Node_Id; Val : Boolean) is
6182 pragma Assert (Nkind (N) in N_Entity);
6185 (Nodes
.Table
(N
+ 4).Field12
'Unrestricted_Access)).Flag234
:= Val
;
6188 procedure Set_Flag235
(N
: Node_Id
; Val
: Boolean) is
6190 pragma Assert
(Nkind
(N
) in N_Entity
);
6193 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag235 := Val;
6196 procedure Set_Flag236 (N : Node_Id; Val : Boolean) is
6198 pragma Assert (Nkind (N) in N_Entity);
6201 (Nodes
.Table
(N
+ 4).Field12
'Unrestricted_Access)).Flag236
:= Val
;
6204 procedure Set_Flag237
(N
: Node_Id
; Val
: Boolean) is
6206 pragma Assert
(Nkind
(N
) in N_Entity
);
6209 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag237 := Val;
6212 procedure Set_Flag238 (N : Node_Id; Val : Boolean) is
6214 pragma Assert (Nkind (N) in N_Entity);
6217 (Nodes
.Table
(N
+ 4).Field12
'Unrestricted_Access)).Flag238
:= Val
;
6220 procedure Set_Flag239
(N
: Node_Id
; Val
: Boolean) is
6222 pragma Assert
(Nkind
(N
) in N_Entity
);
6225 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag239 := Val;
6228 procedure Set_Flag240 (N : Node_Id; Val : Boolean) is
6230 pragma Assert (Nkind (N) in N_Entity);
6233 (Nodes
.Table
(N
+ 4).Field12
'Unrestricted_Access)).Flag240
:= Val
;
6236 procedure Set_Flag241
(N
: Node_Id
; Val
: Boolean) is
6238 pragma Assert
(Nkind
(N
) in N_Entity
);
6241 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag241 := Val;
6244 procedure Set_Flag242 (N : Node_Id; Val : Boolean) is
6246 pragma Assert (Nkind (N) in N_Entity);
6249 (Nodes
.Table
(N
+ 4).Field12
'Unrestricted_Access)).Flag242
:= Val
;
6252 procedure Set_Flag243
(N
: Node_Id
; Val
: Boolean) is
6254 pragma Assert
(Nkind
(N
) in N_Entity
);
6257 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag243 := Val;
6260 procedure Set_Flag244 (N : Node_Id; Val : Boolean) is
6262 pragma Assert (Nkind (N) in N_Entity);
6265 (Nodes
.Table
(N
+ 4).Field12
'Unrestricted_Access)).Flag244
:= Val
;
6268 procedure Set_Flag245
(N
: Node_Id
; Val
: Boolean) is
6270 pragma Assert
(Nkind
(N
) in N_Entity
);
6273 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag245 := Val;
6276 procedure Set_Flag246 (N : Node_Id; Val : Boolean) is
6278 pragma Assert (Nkind (N) in N_Entity);
6281 (Nodes
.Table
(N
+ 4).Field12
'Unrestricted_Access)).Flag246
:= Val
;
6284 procedure Set_Flag247
(N
: Node_Id
; Val
: Boolean) is
6286 pragma Assert
(Nkind
(N
) in N_Entity
);
6289 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag247 := Val;
6292 procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id) is
6294 pragma Assert (N <= Nodes.Last);
6297 Set_Parent (N => Val, Val => N);
6301 end Set_Node1_With_Parent;
6303 procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id) is
6305 pragma Assert (N <= Nodes.Last);
6308 Set_Parent (N => Val, Val => N);
6312 end Set_Node2_With_Parent;
6314 procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id) is
6316 pragma Assert (N <= Nodes.Last);
6319 Set_Parent (N => Val, Val => N);
6323 end Set_Node3_With_Parent;
6325 procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id) is
6327 pragma Assert (N <= Nodes.Last);
6330 Set_Parent (N => Val, Val => N);
6334 end Set_Node4_With_Parent;
6336 procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id) is
6338 pragma Assert (N <= Nodes.Last);
6341 Set_Parent (N => Val, Val => N);
6345 end Set_Node5_With_Parent;
6347 procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id) is
6349 pragma Assert (N <= Nodes.Last);
6350 if Val /= No_List and then Val /= Error_List then
6351 Set_Parent (Val, N);
6354 end Set_List1_With_Parent;
6356 procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id) is
6358 pragma Assert (N <= Nodes.Last);
6359 if Val /= No_List and then Val /= Error_List then
6360 Set_Parent (Val, N);
6363 end Set_List2_With_Parent;
6365 procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id) is
6367 pragma Assert (N <= Nodes.Last);
6368 if Val /= No_List and then Val /= Error_List then
6369 Set_Parent (Val, N);
6372 end Set_List3_With_Parent;
6374 procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id) is
6376 pragma Assert (N <= Nodes.Last);
6377 if Val /= No_List and then Val /= Error_List then
6378 Set_Parent (Val, N);
6381 end Set_List4_With_Parent;
6383 procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id) is
6385 pragma Assert (N <= Nodes.Last);
6386 if Val /= No_List and then Val /= Error_List then
6387 Set_Parent (Val, N);
6390 end Set_List5_With_Parent;
6392 end Unchecked_Access;
6400 Nodes.Locked := False;
6401 Orig_Nodes.Locked := False;