1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2005, 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 2, 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. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING. If not, write --
19 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
20 -- MA 02111-1307, USA. --
22 -- As a special exception, if other files instantiate generics from this --
23 -- unit, or you link this unit with other files to produce an executable, --
24 -- this unit does not by itself cause the resulting executable to be --
25 -- covered by the GNU General Public License. This exception does not --
26 -- however invalidate any other reasons why the executable file might be --
27 -- covered by the GNU Public License. --
29 -- GNAT was originally developed by the GNAT team at New York University. --
30 -- Extensive contributions were provided by Ada Core Technologies Inc. --
32 ------------------------------------------------------------------------------
34 pragma Style_Checks
(All_Checks
);
35 -- Turn off subprogram ordering check for this package
37 -- WARNING: There is a C version of this package. Any changes to this source
38 -- file must be properly reflected in the C header a-atree.h (for inlined
39 -- bodies) and the C file a-atree.c (for remaining non-inlined bodies).
41 with Debug
; use Debug
;
42 with Namet
; use Namet
;
43 with Nlists
; use Nlists
;
44 with Elists
; use Elists
;
45 with Output
; use Output
;
46 with Sinput
; use Sinput
;
47 with Tree_IO
; use Tree_IO
;
49 with GNAT
.HTable
; use GNAT
.HTable
;
54 -- Count allocated nodes for Num_Nodes function
57 -- We are allowed to see these from within our own body!
59 use Atree_Private_Part
;
60 -- We are also allowed to see our private data structures!
62 function E_To_N
is new Unchecked_Conversion
(Entity_Kind
, Node_Kind
);
63 function N_To_E
is new Unchecked_Conversion
(Node_Kind
, Entity_Kind
);
64 -- Functions used to store Entity_Kind value in Nkind field
66 -- The following declarations are used to store flags 65-72 in the
67 -- Nkind field of the third component of an extended (entity) node.
69 type Flag_Byte
is record
80 pragma Pack
(Flag_Byte
);
81 for Flag_Byte
'Size use 8;
83 type Flag_Byte_Ptr
is access all Flag_Byte
;
84 type Node_Kind_Ptr
is access all Node_Kind
;
86 function To_Flag_Byte
is new
87 Unchecked_Conversion
(Node_Kind
, Flag_Byte
);
89 function To_Flag_Byte_Ptr
is new
90 Unchecked_Conversion
(Node_Kind_Ptr
, Flag_Byte_Ptr
);
92 -- The following declarations are used to store flags 73-96 and the
93 -- Convention field in the Field12 field of the third component of an
94 -- extended (Entity) node.
96 type Flag_Word
is record
124 Convention
: Convention_Id
;
127 pragma Pack
(Flag_Word
);
128 for Flag_Word
'Size use 32;
129 for Flag_Word
'Alignment use 4;
131 type Flag_Word_Ptr
is access all Flag_Word
;
132 type Union_Id_Ptr
is access all Union_Id
;
134 function To_Flag_Word
is new
135 Unchecked_Conversion
(Union_Id
, Flag_Word
);
137 function To_Flag_Word_Ptr
is new
138 Unchecked_Conversion
(Union_Id_Ptr
, Flag_Word_Ptr
);
140 -- The following declarations are used to store flags 97-128 in the
141 -- Field12 field of the fourth component of an extended (entity) node.
143 type Flag_Word2
is record
181 pragma Pack
(Flag_Word2
);
182 for Flag_Word2
'Size use 32;
183 for Flag_Word2
'Alignment use 4;
185 type Flag_Word2_Ptr
is access all Flag_Word2
;
187 function To_Flag_Word2
is new
188 Unchecked_Conversion
(Union_Id
, Flag_Word2
);
190 function To_Flag_Word2_Ptr
is new
191 Unchecked_Conversion
(Union_Id_Ptr
, Flag_Word2_Ptr
);
193 -- The following declarations are used to store flags 152-183 in the
194 -- Field11 field of the fourth component of an extended (entity) node.
196 type Flag_Word3
is record
234 pragma Pack
(Flag_Word3
);
235 for Flag_Word3
'Size use 32;
236 for Flag_Word3
'Alignment use 4;
238 type Flag_Word3_Ptr
is access all Flag_Word3
;
240 function To_Flag_Word3
is new
241 Unchecked_Conversion
(Union_Id
, Flag_Word3
);
243 function To_Flag_Word3_Ptr
is new
244 Unchecked_Conversion
(Union_Id_Ptr
, Flag_Word3_Ptr
);
246 -- The following declarations are used to store flags 184-215 in the
247 -- Field11 field of the fifth component of an extended (entity) node.
249 type Flag_Word4
is record
287 pragma Pack
(Flag_Word4
);
288 for Flag_Word4
'Size use 32;
289 for Flag_Word4
'Alignment use 4;
291 type Flag_Word4_Ptr
is access all Flag_Word4
;
293 function To_Flag_Word4
is new
294 Unchecked_Conversion
(Union_Id
, Flag_Word4
);
296 function To_Flag_Word4_Ptr
is new
297 Unchecked_Conversion
(Union_Id_Ptr
, Flag_Word4_Ptr
);
299 -- Default value used to initialize default nodes. Note that some of the
300 -- fields get overwritten, and in particular, Nkind always gets reset.
302 Default_Node
: Node_Record
:= (
303 Is_Extension
=> False,
308 Rewrite_Ins
=> False,
310 Comes_From_Source
=> False, -- modified by Set_Comes_From_Source_Default
311 Error_Posted
=> False,
330 Nkind
=> N_Unused_At_Start
,
333 Link
=> Empty_List_Or_Node
,
334 Field1
=> Empty_List_Or_Node
,
335 Field2
=> Empty_List_Or_Node
,
336 Field3
=> Empty_List_Or_Node
,
337 Field4
=> Empty_List_Or_Node
,
338 Field5
=> Empty_List_Or_Node
);
340 -- Default value used to initialize node extensions (i.e. the second
341 -- and third and fourth components of an extended node). Note we are
342 -- cheating a bit here when it comes to Node12, which really holds
343 -- flags an (for the third component), the convention. But it works
344 -- because Empty, False, Convention_Ada, all happen to be all zero bits.
346 Default_Node_Extension
: constant Node_Record
:= (
347 Is_Extension
=> True,
352 Rewrite_Ins
=> False,
354 Comes_From_Source
=> False,
355 Error_Posted
=> False,
374 Nkind
=> E_To_N
(E_Void
),
376 Field6
=> Empty_List_Or_Node
,
377 Field7
=> Empty_List_Or_Node
,
378 Field8
=> Empty_List_Or_Node
,
379 Field9
=> Empty_List_Or_Node
,
380 Field10
=> Empty_List_Or_Node
,
381 Field11
=> Empty_List_Or_Node
,
382 Field12
=> Empty_List_Or_Node
);
384 --------------------------------------------------
385 -- Implementation of Tree Substitution Routines --
386 --------------------------------------------------
388 -- A separate table keeps track of the mapping between rewritten nodes
389 -- and their corresponding original tree nodes. Rewrite makes an entry
390 -- in this table for use by Original_Node. By default, if no call is
391 -- Rewrite, the entry in this table points to the original unwritten node.
393 -- Note: eventually, this should be a field in the Node directly, but
394 -- for now we do not want to disturb the efficiency of a power of 2
397 package Orig_Nodes
is new Table
.Table
(
398 Table_Component_Type
=> Node_Id
,
399 Table_Index_Type
=> Node_Id
,
400 Table_Low_Bound
=> First_Node_Id
,
401 Table_Initial
=> Alloc
.Orig_Nodes_Initial
,
402 Table_Increment
=> Alloc
.Orig_Nodes_Increment
,
403 Table_Name
=> "Orig_Nodes");
405 ----------------------------------------
406 -- Global_Variables for New_Copy_Tree --
407 ----------------------------------------
409 -- These global variables are used by New_Copy_Tree. See description
410 -- of the body of this subprogram for details. Global variables can be
411 -- safely used by New_Copy_Tree, since there is no case of a recursive
412 -- call from the processing inside New_Copy_Tree.
414 NCT_Hash_Threshhold
: constant := 20;
415 -- If there are more than this number of pairs of entries in the
416 -- map, then Hash_Tables_Used will be set, and the hash tables will
417 -- be initialized and used for the searches.
419 NCT_Hash_Tables_Used
: Boolean := False;
420 -- Set to True if hash tables are in use
422 NCT_Table_Entries
: Nat
;
423 -- Count entries in table to see if threshhold is reached
425 NCT_Hash_Table_Setup
: Boolean := False;
426 -- Set to True if hash table contains data. We set this True if we
427 -- setup the hash table with data, and leave it set permanently
428 -- from then on, this is a signal that second and subsequent users
429 -- of the hash table must clear the old entries before reuse.
431 subtype NCT_Header_Num
is Int
range 0 .. 511;
432 -- Defines range of headers in hash tables (512 headers)
434 -----------------------
435 -- Local Subprograms --
436 -----------------------
438 procedure Fix_Parents
(Old_Node
, New_Node
: Node_Id
);
439 -- Fixup parent pointers for the syntactic children of New_Node after
440 -- a copy, setting them to New_Node when they pointed to Old_Node.
442 function Allocate_Initialize_Node
444 With_Extension
: Boolean) return Node_Id
;
445 -- Allocate a new node or node extension. If Src is not empty,
446 -- the information for the newly-allocated node is copied from it.
448 ------------------------------
449 -- Allocate_Initialize_Node --
450 ------------------------------
452 function Allocate_Initialize_Node
454 With_Extension
: Boolean) return Node_Id
456 New_Id
: Node_Id
:= Src
;
457 Nod
: Node_Record
:= Default_Node
;
458 Ext1
: Node_Record
:= Default_Node_Extension
;
459 Ext2
: Node_Record
:= Default_Node_Extension
;
460 Ext3
: Node_Record
:= Default_Node_Extension
;
461 Ext4
: Node_Record
:= Default_Node_Extension
;
464 if Present
(Src
) then
465 Nod
:= Nodes
.Table
(Src
);
467 if Has_Extension
(Src
) then
468 Ext1
:= Nodes
.Table
(Src
+ 1);
469 Ext2
:= Nodes
.Table
(Src
+ 2);
470 Ext3
:= Nodes
.Table
(Src
+ 3);
471 Ext4
:= Nodes
.Table
(Src
+ 4);
475 if not (Present
(Src
)
476 and then not Has_Extension
(Src
)
477 and then With_Extension
478 and then Src
= Nodes
.Last
)
480 -- We are allocating a new node, or extending a node
481 -- other than Nodes.Last.
484 New_Id
:= Nodes
.Last
;
485 Orig_Nodes
.Append
(New_Id
);
486 Node_Count
:= Node_Count
+ 1;
489 if With_Extension
then
496 Orig_Nodes
.Set_Last
(Nodes
.Last
);
497 Allocate_List_Tables
(Nodes
.Last
);
499 end Allocate_Initialize_Node
;
505 function Analyzed
(N
: Node_Id
) return Boolean is
507 pragma Assert
(N
in Nodes
.First
.. Nodes
.Last
);
508 return Nodes
.Table
(N
).Analyzed
;
515 procedure Change_Node
(N
: Node_Id
; New_Node_Kind
: Node_Kind
) is
516 Save_Sloc
: constant Source_Ptr
:= Sloc
(N
);
517 Save_In_List
: constant Boolean := Nodes
.Table
(N
).In_List
;
518 Save_Link
: constant Union_Id
:= Nodes
.Table
(N
).Link
;
519 Save_CFS
: constant Boolean := Nodes
.Table
(N
).Comes_From_Source
;
520 Save_Posted
: constant Boolean := Nodes
.Table
(N
).Error_Posted
;
521 Par_Count
: Paren_Count_Type
:= 0;
524 if Nkind
(N
) in N_Subexpr
then
525 Par_Count
:= Paren_Count
(N
);
528 Nodes
.Table
(N
) := Default_Node
;
529 Nodes
.Table
(N
).Sloc
:= Save_Sloc
;
530 Nodes
.Table
(N
).In_List
:= Save_In_List
;
531 Nodes
.Table
(N
).Link
:= Save_Link
;
532 Nodes
.Table
(N
).Comes_From_Source
:= Save_CFS
;
533 Nodes
.Table
(N
).Nkind
:= New_Node_Kind
;
534 Nodes
.Table
(N
).Error_Posted
:= Save_Posted
;
536 if New_Node_Kind
in N_Subexpr
then
537 Set_Paren_Count
(N
, Par_Count
);
541 -----------------------
542 -- Comes_From_Source --
543 -----------------------
545 function Comes_From_Source
(N
: Node_Id
) return Boolean is
547 pragma Assert
(N
in Nodes
.First
.. Nodes
.Last
);
548 return Nodes
.Table
(N
).Comes_From_Source
;
549 end Comes_From_Source
;
555 function Convention
(E
: Entity_Id
) return Convention_Id
is
557 pragma Assert
(Nkind
(E
) in N_Entity
);
558 return To_Flag_Word
(Nodes
.Table
(E
+ 2).Field12
).Convention
;
565 procedure Copy_Node
(Source
: Node_Id
; Destination
: Node_Id
) is
566 Save_In_List
: constant Boolean := Nodes
.Table
(Destination
).In_List
;
567 Save_Link
: constant Union_Id
:= Nodes
.Table
(Destination
).Link
;
570 Nodes
.Table
(Destination
) := Nodes
.Table
(Source
);
571 Nodes
.Table
(Destination
).In_List
:= Save_In_List
;
572 Nodes
.Table
(Destination
).Link
:= Save_Link
;
574 if Has_Extension
(Source
) then
575 pragma Assert
(Has_Extension
(Destination
));
576 Nodes
.Table
(Destination
+ 1) := Nodes
.Table
(Source
+ 1);
577 Nodes
.Table
(Destination
+ 2) := Nodes
.Table
(Source
+ 2);
578 Nodes
.Table
(Destination
+ 3) := Nodes
.Table
(Source
+ 3);
579 Nodes
.Table
(Destination
+ 4) := Nodes
.Table
(Source
+ 4);
582 pragma Assert
(not Has_Extension
(Source
));
587 ------------------------
588 -- Copy_Separate_Tree --
589 ------------------------
591 function Copy_Separate_Tree
(Source
: Node_Id
) return Node_Id
is
594 function Copy_Entity
(E
: Entity_Id
) return Entity_Id
;
595 -- Copy Entity, copying only the Ekind and Chars fields
597 function Copy_List
(List
: List_Id
) return List_Id
;
600 function Possible_Copy
(Field
: Union_Id
) return Union_Id
;
601 -- Given a field, returns a copy of the node or list if its parent
602 -- is the current source node, and otherwise returns the input
608 function Copy_Entity
(E
: Entity_Id
) return Entity_Id
is
612 case N_Entity
(Nkind
(E
)) is
613 when N_Defining_Identifier
=>
614 New_Ent
:= New_Entity
(N_Defining_Identifier
, Sloc
(E
));
616 when N_Defining_Character_Literal
=>
617 New_Ent
:= New_Entity
(N_Defining_Character_Literal
, Sloc
(E
));
619 when N_Defining_Operator_Symbol
=>
620 New_Ent
:= New_Entity
(N_Defining_Operator_Symbol
, Sloc
(E
));
623 Set_Chars
(New_Ent
, Chars
(E
));
631 function Copy_List
(List
: List_Id
) return List_Id
is
636 if List
= No_List
then
643 while Present
(E
) loop
644 if Has_Extension
(E
) then
645 Append
(Copy_Entity
(E
), NL
);
647 Append
(Copy_Separate_Tree
(E
), NL
);
661 function Possible_Copy
(Field
: Union_Id
) return Union_Id
is
665 if Field
in Node_Range
then
666 New_N
:= Union_Id
(Copy_Separate_Tree
(Node_Id
(Field
)));
668 if Parent
(Node_Id
(Field
)) = Source
then
669 Set_Parent
(Node_Id
(New_N
), New_Id
);
674 elsif Field
in List_Range
then
675 New_N
:= Union_Id
(Copy_List
(List_Id
(Field
)));
677 if Parent
(List_Id
(Field
)) = Source
then
678 Set_Parent
(List_Id
(New_N
), New_Id
);
688 -- Start of processing for Copy_Separate_Tree
691 if Source
<= Empty_Or_Error
then
694 elsif Has_Extension
(Source
) then
695 return Copy_Entity
(Source
);
698 New_Id
:= New_Copy
(Source
);
700 -- Recursively copy descendents
702 Set_Field1
(New_Id
, Possible_Copy
(Field1
(New_Id
)));
703 Set_Field2
(New_Id
, Possible_Copy
(Field2
(New_Id
)));
704 Set_Field3
(New_Id
, Possible_Copy
(Field3
(New_Id
)));
705 Set_Field4
(New_Id
, Possible_Copy
(Field4
(New_Id
)));
706 Set_Field5
(New_Id
, Possible_Copy
(Field5
(New_Id
)));
708 -- Set Entity field to Empty
709 -- Why is this done??? and why is it always right to do it???
711 if Nkind
(New_Id
) in N_Has_Entity
712 or else Nkind
(New_Id
) = N_Freeze_Entity
714 Set_Entity
(New_Id
, Empty
);
717 -- All done, return copied node
721 end Copy_Separate_Tree
;
727 procedure Delete_Node
(Node
: Node_Id
) is
729 pragma Assert
(not Nodes
.Table
(Node
).In_List
);
732 Write_Str
("Delete node ");
733 Write_Int
(Int
(Node
));
737 Nodes
.Table
(Node
) := Default_Node
;
738 Nodes
.Table
(Node
).Nkind
:= N_Unused_At_Start
;
739 Node_Count
:= Node_Count
- 1;
741 -- Note: for now, we are not bothering to reuse deleted nodes
749 procedure Delete_Tree
(Node
: Node_Id
) is
751 procedure Delete_Field
(F
: Union_Id
);
752 -- Delete item pointed to by field F if it is a syntactic element
754 procedure Delete_List
(L
: List_Id
);
755 -- Delete all elements on the given list
761 procedure Delete_Field
(F
: Union_Id
) is
763 if F
= Union_Id
(Empty
) then
766 elsif F
in Node_Range
767 and then Parent
(Node_Id
(F
)) = Node
769 Delete_Tree
(Node_Id
(F
));
771 elsif F
in List_Range
772 and then Parent
(List_Id
(F
)) = Node
774 Delete_List
(List_Id
(F
));
776 -- No need to test Elist case, there are no syntactic Elists
787 procedure Delete_List
(L
: List_Id
) is
789 while Is_Non_Empty_List
(L
) loop
790 Delete_Tree
(Remove_Head
(L
));
794 -- Start of processing for Delete_Tree
797 -- Delete descendents
799 Delete_Field
(Field1
(Node
));
800 Delete_Field
(Field2
(Node
));
801 Delete_Field
(Field3
(Node
));
802 Delete_Field
(Field4
(Node
));
803 Delete_Field
(Field5
(Node
));
810 function Ekind
(E
: Entity_Id
) return Entity_Kind
is
812 pragma Assert
(Nkind
(E
) in N_Entity
);
813 return N_To_E
(Nodes
.Table
(E
+ 1).Nkind
);
820 function Error_Posted
(N
: Node_Id
) return Boolean is
822 pragma Assert
(N
in Nodes
.First
.. Nodes
.Last
);
823 return Nodes
.Table
(N
).Error_Posted
;
826 -----------------------
827 -- Exchange_Entities --
828 -----------------------
830 procedure Exchange_Entities
(E1
: Entity_Id
; E2
: Entity_Id
) is
831 Temp_Ent
: Node_Record
;
834 pragma Assert
(Has_Extension
(E1
)
835 and then Has_Extension
(E2
)
836 and then not Nodes
.Table
(E1
).In_List
837 and then not Nodes
.Table
(E2
).In_List
);
839 -- Exchange the contents of the two entities
841 Temp_Ent
:= Nodes
.Table
(E1
);
842 Nodes
.Table
(E1
) := Nodes
.Table
(E2
);
843 Nodes
.Table
(E2
) := Temp_Ent
;
844 Temp_Ent
:= Nodes
.Table
(E1
+ 1);
845 Nodes
.Table
(E1
+ 1) := Nodes
.Table
(E2
+ 1);
846 Nodes
.Table
(E2
+ 1) := Temp_Ent
;
847 Temp_Ent
:= Nodes
.Table
(E1
+ 2);
848 Nodes
.Table
(E1
+ 2) := Nodes
.Table
(E2
+ 2);
849 Nodes
.Table
(E2
+ 2) := Temp_Ent
;
850 Temp_Ent
:= Nodes
.Table
(E1
+ 3);
851 Nodes
.Table
(E1
+ 3) := Nodes
.Table
(E2
+ 3);
852 Nodes
.Table
(E2
+ 3) := Temp_Ent
;
853 Temp_Ent
:= Nodes
.Table
(E1
+ 4);
854 Nodes
.Table
(E1
+ 4) := Nodes
.Table
(E2
+ 4);
855 Nodes
.Table
(E2
+ 4) := Temp_Ent
;
857 -- That exchange exchanged the parent pointers as well, which is what
858 -- we want, but we need to patch up the defining identifier pointers
859 -- in the parent nodes (the child pointers) to match this switch
860 -- unless for Implicit types entities which have no parent, in which
861 -- case we don't do anything otherwise we won't be able to revert back
862 -- to the original situation.
864 -- Shouldn't this use Is_Itype instead of the Parent test
866 if Present
(Parent
(E1
)) and then Present
(Parent
(E2
)) then
867 Set_Defining_Identifier
(Parent
(E1
), E1
);
868 Set_Defining_Identifier
(Parent
(E2
), E2
);
870 end Exchange_Entities
;
876 function Extend_Node
(Node
: Node_Id
) return Entity_Id
is
879 procedure Debug_Extend_Node
;
880 pragma Inline
(Debug_Extend_Node
);
881 -- Debug routine for debug flag N
883 -----------------------
884 -- Debug_Extend_Node --
885 -----------------------
887 procedure Debug_Extend_Node
is
890 Write_Str
("Extend node ");
891 Write_Int
(Int
(Node
));
893 if Result
= Node
then
894 Write_Str
(" in place");
896 Write_Str
(" copied to ");
897 Write_Int
(Int
(Result
));
902 end Debug_Extend_Node
;
904 -- Start of processing for Extend_Node
907 pragma Assert
(not (Has_Extension
(Node
)));
908 Result
:= Allocate_Initialize_Node
(Node
, With_Extension
=> True);
909 pragma Debug
(Debug_Extend_Node
);
917 procedure Fix_Parents
(Old_Node
, New_Node
: Node_Id
) is
919 procedure Fix_Parent
(Field
: Union_Id
; Old_Node
, New_Node
: Node_Id
);
920 -- Fixup one parent pointer. Field is checked to see if it
921 -- points to a node, list, or element list that has a parent that
922 -- points to Old_Node. If so, the parent is reset to point to New_Node.
928 procedure Fix_Parent
(Field
: Union_Id
; Old_Node
, New_Node
: Node_Id
) is
930 -- Fix parent of node that is referenced by Field. Note that we must
931 -- exclude the case where the node is a member of a list, because in
932 -- this case the parent is the parent of the list.
934 if Field
in Node_Range
935 and then Present
(Node_Id
(Field
))
936 and then not Nodes
.Table
(Node_Id
(Field
)).In_List
937 and then Parent
(Node_Id
(Field
)) = Old_Node
939 Set_Parent
(Node_Id
(Field
), New_Node
);
941 -- Fix parent of list that is referenced by Field
943 elsif Field
in List_Range
944 and then Present
(List_Id
(Field
))
945 and then Parent
(List_Id
(Field
)) = Old_Node
947 Set_Parent
(List_Id
(Field
), New_Node
);
951 -- Start of processing for Fix_Parents
954 Fix_Parent
(Field1
(New_Node
), Old_Node
, New_Node
);
955 Fix_Parent
(Field2
(New_Node
), Old_Node
, New_Node
);
956 Fix_Parent
(Field3
(New_Node
), Old_Node
, New_Node
);
957 Fix_Parent
(Field4
(New_Node
), Old_Node
, New_Node
);
958 Fix_Parent
(Field5
(New_Node
), Old_Node
, New_Node
);
961 -----------------------------------
962 -- Get_Comes_From_Source_Default --
963 -----------------------------------
965 function Get_Comes_From_Source_Default
return Boolean is
967 return Default_Node
.Comes_From_Source
;
968 end Get_Comes_From_Source_Default
;
974 function Has_Extension
(N
: Node_Id
) return Boolean is
976 return N
< Nodes
.Last
and then Nodes
.Table
(N
+ 1).Is_Extension
;
983 procedure Initialize
is
985 pragma Warnings
(Off
, Dummy
);
989 Atree_Private_Part
.Nodes
.Init
;
992 -- Allocate Empty node
994 Dummy
:= New_Node
(N_Empty
, No_Location
);
995 Set_Name1
(Empty
, No_Name
);
997 -- Allocate Error node, and set Error_Posted, since we certainly
998 -- only generate an Error node if we do post some kind of error!
1000 Dummy
:= New_Node
(N_Error
, No_Location
);
1001 Set_Name1
(Error
, Error_Name
);
1002 Set_Error_Posted
(Error
, True);
1004 -- Set global variables for New_Copy_Tree
1006 NCT_Hash_Tables_Used
:= False;
1007 NCT_Table_Entries
:= 0;
1008 NCT_Hash_Table_Setup
:= False;
1011 --------------------------
1012 -- Is_Rewrite_Insertion --
1013 --------------------------
1015 function Is_Rewrite_Insertion
(Node
: Node_Id
) return Boolean is
1017 return Nodes
.Table
(Node
).Rewrite_Ins
;
1018 end Is_Rewrite_Insertion
;
1020 -----------------------------
1021 -- Is_Rewrite_Substitution --
1022 -----------------------------
1024 function Is_Rewrite_Substitution
(Node
: Node_Id
) return Boolean is
1026 return Orig_Nodes
.Table
(Node
) /= Node
;
1027 end Is_Rewrite_Substitution
;
1033 function Last_Node_Id
return Node_Id
is
1044 Nodes
.Locked
:= True;
1045 Orig_Nodes
.Locked
:= True;
1050 ----------------------------
1051 -- Mark_Rewrite_Insertion --
1052 ----------------------------
1054 procedure Mark_Rewrite_Insertion
(New_Node
: Node_Id
) is
1056 Nodes
.Table
(New_Node
).Rewrite_Ins
:= True;
1057 end Mark_Rewrite_Insertion
;
1063 function New_Copy
(Source
: Node_Id
) return Node_Id
is
1064 New_Id
: Node_Id
:= Source
;
1067 if Source
> Empty_Or_Error
then
1069 New_Id
:= Allocate_Initialize_Node
(Source
, Has_Extension
(Source
));
1071 Nodes
.Table
(New_Id
).Link
:= Empty_List_Or_Node
;
1072 Nodes
.Table
(New_Id
).In_List
:= False;
1074 -- If the original is marked as a rewrite insertion, then unmark
1075 -- the copy, since we inserted the original, not the copy.
1077 Nodes
.Table
(New_Id
).Rewrite_Ins
:= False;
1087 -- Our approach here requires a two pass traversal of the tree. The
1088 -- first pass visits all nodes that eventually will be copied looking
1089 -- for defining Itypes. If any defining Itypes are found, then they are
1090 -- copied, and an entry is added to the replacement map. In the second
1091 -- phase, the tree is copied, using the replacement map to replace any
1092 -- Itype references within the copied tree.
1094 -- The following hash tables are used if the Map supplied has more
1095 -- than hash threshhold entries to speed up access to the map. If
1096 -- there are fewer entries, then the map is searched sequentially
1097 -- (because setting up a hash table for only a few entries takes
1098 -- more time than it saves.
1100 function New_Copy_Hash
(E
: Entity_Id
) return NCT_Header_Num
;
1101 -- Hash function used for hash operations
1107 function New_Copy_Hash
(E
: Entity_Id
) return NCT_Header_Num
is
1109 return Nat
(E
) mod (NCT_Header_Num
'Last + 1);
1116 -- The hash table NCT_Assoc associates old entities in the table
1117 -- with their corresponding new entities (i.e. the pairs of entries
1118 -- presented in the original Map argument are Key-Element pairs).
1120 package NCT_Assoc
is new Simple_HTable
(
1121 Header_Num
=> NCT_Header_Num
,
1122 Element
=> Entity_Id
,
1123 No_Element
=> Empty
,
1125 Hash
=> New_Copy_Hash
,
1126 Equal
=> Types
."=");
1128 ---------------------
1129 -- NCT_Itype_Assoc --
1130 ---------------------
1132 -- The hash table NCT_Itype_Assoc contains entries only for those
1133 -- old nodes which have a non-empty Associated_Node_For_Itype set.
1134 -- The key is the associated node, and the element is the new node
1135 -- itself (NOT the associated node for the new node).
1137 package NCT_Itype_Assoc
is new Simple_HTable
(
1138 Header_Num
=> NCT_Header_Num
,
1139 Element
=> Entity_Id
,
1140 No_Element
=> Empty
,
1142 Hash
=> New_Copy_Hash
,
1143 Equal
=> Types
."=");
1145 -- Start of processing for New_Copy_Tree function
1147 function New_Copy_Tree
1149 Map
: Elist_Id
:= No_Elist
;
1150 New_Sloc
: Source_Ptr
:= No_Location
;
1151 New_Scope
: Entity_Id
:= Empty
) return Node_Id
1153 Actual_Map
: Elist_Id
:= Map
;
1154 -- This is the actual map for the copy. It is initialized with the
1155 -- given elements, and then enlarged as required for Itypes that are
1156 -- copied during the first phase of the copy operation. The visit
1157 -- procedures add elements to this map as Itypes are encountered.
1158 -- The reason we cannot use Map directly, is that it may well be
1159 -- (and normally is) initialized to No_Elist, and if we have mapped
1160 -- entities, we have to reset it to point to a real Elist.
1162 function Assoc
(N
: Node_Or_Entity_Id
) return Node_Id
;
1163 -- Called during second phase to map entities into their corresponding
1164 -- copies using Actual_Map. If the argument is not an entity, or is not
1165 -- in Actual_Map, then it is returned unchanged.
1167 procedure Build_NCT_Hash_Tables
;
1168 -- Builds hash tables (number of elements >= threshold value)
1170 function Copy_Elist_With_Replacement
1171 (Old_Elist
: Elist_Id
) return Elist_Id
;
1172 -- Called during second phase to copy element list doing replacements.
1174 procedure Copy_Itype_With_Replacement
(New_Itype
: Entity_Id
);
1175 -- Called during the second phase to process a copied Itype. The actual
1176 -- copy happened during the first phase (so that we could make the entry
1177 -- in the mapping), but we still have to deal with the descendents of
1178 -- the copied Itype and copy them where necessary.
1180 function Copy_List_With_Replacement
(Old_List
: List_Id
) return List_Id
;
1181 -- Called during second phase to copy list doing replacements.
1183 function Copy_Node_With_Replacement
(Old_Node
: Node_Id
) return Node_Id
;
1184 -- Called during second phase to copy node doing replacements
1186 procedure Visit_Elist
(E
: Elist_Id
);
1187 -- Called during first phase to visit all elements of an Elist
1189 procedure Visit_Field
(F
: Union_Id
; N
: Node_Id
);
1190 -- Visit a single field, recursing to call Visit_Node or Visit_List
1191 -- if the field is a syntactic descendent of the current node (i.e.
1192 -- its parent is Node N).
1194 procedure Visit_Itype
(Old_Itype
: Entity_Id
);
1195 -- Called during first phase to visit subsidiary fields of a defining
1196 -- Itype, and also create a copy and make an entry in the replacement
1197 -- map for the new copy.
1199 procedure Visit_List
(L
: List_Id
);
1200 -- Called during first phase to visit all elements of a List
1202 procedure Visit_Node
(N
: Node_Or_Entity_Id
);
1203 -- Called during first phase to visit a node and all its subtrees
1209 function Assoc
(N
: Node_Or_Entity_Id
) return Node_Id
is
1214 if not Has_Extension
(N
) or else No
(Actual_Map
) then
1217 elsif NCT_Hash_Tables_Used
then
1218 Ent
:= NCT_Assoc
.Get
(Entity_Id
(N
));
1220 if Present
(Ent
) then
1226 -- No hash table used, do serial search
1229 E
:= First_Elmt
(Actual_Map
);
1230 while Present
(E
) loop
1231 if Node
(E
) = N
then
1232 return Node
(Next_Elmt
(E
));
1234 E
:= Next_Elmt
(Next_Elmt
(E
));
1242 ---------------------------
1243 -- Build_NCT_Hash_Tables --
1244 ---------------------------
1246 procedure Build_NCT_Hash_Tables
is
1250 if NCT_Hash_Table_Setup
then
1252 NCT_Itype_Assoc
.Reset
;
1255 Elmt
:= First_Elmt
(Actual_Map
);
1256 while Present
(Elmt
) loop
1259 NCT_Assoc
.Set
(Ent
, Node
(Elmt
));
1262 if Is_Type
(Ent
) then
1264 Anode
: constant Entity_Id
:=
1265 Associated_Node_For_Itype
(Ent
);
1268 if Present
(Anode
) then
1269 NCT_Itype_Assoc
.Set
(Anode
, Node
(Elmt
));
1275 NCT_Hash_Tables_Used
:= True;
1276 NCT_Hash_Table_Setup
:= True;
1277 end Build_NCT_Hash_Tables
;
1279 ---------------------------------
1280 -- Copy_Elist_With_Replacement --
1281 ---------------------------------
1283 function Copy_Elist_With_Replacement
1284 (Old_Elist
: Elist_Id
) return Elist_Id
1287 New_Elist
: Elist_Id
;
1290 if No
(Old_Elist
) then
1294 New_Elist
:= New_Elmt_List
;
1296 M
:= First_Elmt
(Old_Elist
);
1297 while Present
(M
) loop
1298 Append_Elmt
(Copy_Node_With_Replacement
(Node
(M
)), New_Elist
);
1304 end Copy_Elist_With_Replacement
;
1306 ---------------------------------
1307 -- Copy_Itype_With_Replacement --
1308 ---------------------------------
1310 -- This routine exactly parallels its phase one analog Visit_Itype,
1311 -- and like that routine, knows far too many semantic details about
1312 -- the descendents of Itypes and whether they need copying or not.
1314 procedure Copy_Itype_With_Replacement
(New_Itype
: Entity_Id
) is
1316 -- Translate Next_Entity, Scope and Etype fields, in case they
1317 -- reference entities that have been mapped into copies.
1319 Set_Next_Entity
(New_Itype
, Assoc
(Next_Entity
(New_Itype
)));
1320 Set_Etype
(New_Itype
, Assoc
(Etype
(New_Itype
)));
1322 if Present
(New_Scope
) then
1323 Set_Scope
(New_Itype
, New_Scope
);
1325 Set_Scope
(New_Itype
, Assoc
(Scope
(New_Itype
)));
1328 -- Copy referenced fields
1330 if Is_Discrete_Type
(New_Itype
) then
1331 Set_Scalar_Range
(New_Itype
,
1332 Copy_Node_With_Replacement
(Scalar_Range
(New_Itype
)));
1334 elsif Has_Discriminants
(Base_Type
(New_Itype
)) then
1335 Set_Discriminant_Constraint
(New_Itype
,
1336 Copy_Elist_With_Replacement
1337 (Discriminant_Constraint
(New_Itype
)));
1339 elsif Is_Array_Type
(New_Itype
) then
1340 if Present
(First_Index
(New_Itype
)) then
1341 Set_First_Index
(New_Itype
,
1342 First
(Copy_List_With_Replacement
1343 (List_Containing
(First_Index
(New_Itype
)))));
1346 if Is_Packed
(New_Itype
) then
1347 Set_Packed_Array_Type
(New_Itype
,
1348 Copy_Node_With_Replacement
1349 (Packed_Array_Type
(New_Itype
)));
1352 end Copy_Itype_With_Replacement
;
1354 --------------------------------
1355 -- Copy_List_With_Replacement --
1356 --------------------------------
1358 function Copy_List_With_Replacement
1359 (Old_List
: List_Id
) return List_Id
1365 if Old_List
= No_List
then
1369 New_List
:= Empty_List
;
1371 E
:= First
(Old_List
);
1372 while Present
(E
) loop
1373 Append
(Copy_Node_With_Replacement
(E
), New_List
);
1379 end Copy_List_With_Replacement
;
1381 --------------------------------
1382 -- Copy_Node_With_Replacement --
1383 --------------------------------
1385 function Copy_Node_With_Replacement
1386 (Old_Node
: Node_Id
) return Node_Id
1390 function Copy_Field_With_Replacement
1391 (Field
: Union_Id
) return Union_Id
;
1392 -- Given Field, which is a field of Old_Node, return a copy of it
1393 -- if it is a syntactic field (i.e. its parent is Node), setting
1394 -- the parent of the copy to poit to New_Node. Otherwise returns
1395 -- the field (possibly mapped if it is an entity).
1397 ---------------------------------
1398 -- Copy_Field_With_Replacement --
1399 ---------------------------------
1401 function Copy_Field_With_Replacement
1402 (Field
: Union_Id
) return Union_Id
1405 if Field
= Union_Id
(Empty
) then
1408 elsif Field
in Node_Range
then
1410 Old_N
: constant Node_Id
:= Node_Id
(Field
);
1414 -- If syntactic field, as indicated by the parent pointer
1415 -- being set, then copy the referenced node recursively.
1417 if Parent
(Old_N
) = Old_Node
then
1418 New_N
:= Copy_Node_With_Replacement
(Old_N
);
1420 if New_N
/= Old_N
then
1421 Set_Parent
(New_N
, New_Node
);
1424 -- For semantic fields, update possible entity reference
1425 -- from the replacement map.
1428 New_N
:= Assoc
(Old_N
);
1431 return Union_Id
(New_N
);
1434 elsif Field
in List_Range
then
1436 Old_L
: constant List_Id
:= List_Id
(Field
);
1440 -- If syntactic field, as indicated by the parent pointer,
1441 -- then recursively copy the entire referenced list.
1443 if Parent
(Old_L
) = Old_Node
then
1444 New_L
:= Copy_List_With_Replacement
(Old_L
);
1445 Set_Parent
(New_L
, New_Node
);
1447 -- For semantic list, just returned unchanged
1453 return Union_Id
(New_L
);
1456 -- Anything other than a list or a node is returned unchanged
1461 end Copy_Field_With_Replacement
;
1463 -- Start of processing for Copy_Node_With_Replacement
1466 if Old_Node
<= Empty_Or_Error
then
1469 elsif Has_Extension
(Old_Node
) then
1470 return Assoc
(Old_Node
);
1473 New_Node
:= New_Copy
(Old_Node
);
1475 -- If the node we are copying is the associated node of a
1476 -- previously copied Itype, then adjust the associated node
1477 -- of the copy of that Itype accordingly.
1479 if Present
(Actual_Map
) then
1485 -- Case of hash table used
1487 if NCT_Hash_Tables_Used
then
1488 Ent
:= NCT_Itype_Assoc
.Get
(Old_Node
);
1490 if Present
(Ent
) then
1491 Set_Associated_Node_For_Itype
(Ent
, New_Node
);
1494 -- Case of no hash table used
1497 E
:= First_Elmt
(Actual_Map
);
1498 while Present
(E
) loop
1499 if Is_Itype
(Node
(E
))
1501 Old_Node
= Associated_Node_For_Itype
(Node
(E
))
1503 Set_Associated_Node_For_Itype
1504 (Node
(Next_Elmt
(E
)), New_Node
);
1507 E
:= Next_Elmt
(Next_Elmt
(E
));
1513 -- Recursively copy descendents
1516 (New_Node
, Copy_Field_With_Replacement
(Field1
(New_Node
)));
1518 (New_Node
, Copy_Field_With_Replacement
(Field2
(New_Node
)));
1520 (New_Node
, Copy_Field_With_Replacement
(Field3
(New_Node
)));
1522 (New_Node
, Copy_Field_With_Replacement
(Field4
(New_Node
)));
1524 (New_Node
, Copy_Field_With_Replacement
(Field5
(New_Node
)));
1526 -- Adjust Sloc of new node if necessary
1528 if New_Sloc
/= No_Location
then
1529 Set_Sloc
(New_Node
, New_Sloc
);
1531 -- If we adjust the Sloc, then we are essentially making
1532 -- a completely new node, so the Comes_From_Source flag
1533 -- should be reset to the proper default value.
1535 Nodes
.Table
(New_Node
).Comes_From_Source
:=
1536 Default_Node
.Comes_From_Source
;
1539 -- Reset First_Real_Statement for Handled_Sequence_Of_Statements.
1540 -- The replacement mechanism applies to entities, and is not used
1541 -- here. Eventually we may need a more general graph-copying
1542 -- routine. For now, do a sequential search to find desired node.
1544 if Nkind
(Old_Node
) = N_Handled_Sequence_Of_Statements
1545 and then Present
(First_Real_Statement
(Old_Node
))
1548 Old_F
: constant Node_Id
:= First_Real_Statement
(Old_Node
);
1552 N1
:= First
(Statements
(Old_Node
));
1553 N2
:= First
(Statements
(New_Node
));
1555 while N1
/= Old_F
loop
1560 Set_First_Real_Statement
(New_Node
, N2
);
1565 -- All done, return copied node
1568 end Copy_Node_With_Replacement
;
1574 procedure Visit_Elist
(E
: Elist_Id
) is
1578 Elmt
:= First_Elmt
(E
);
1580 while Elmt
/= No_Elmt
loop
1581 Visit_Node
(Node
(Elmt
));
1591 procedure Visit_Field
(F
: Union_Id
; N
: Node_Id
) is
1593 if F
= Union_Id
(Empty
) then
1596 elsif F
in Node_Range
then
1598 -- Copy node if it is syntactic, i.e. its parent pointer is
1599 -- set to point to the field that referenced it (certain
1600 -- Itypes will also meet this criterion, which is fine, since
1601 -- these are clearly Itypes that do need to be copied, since
1602 -- we are copying their parent.)
1604 if Parent
(Node_Id
(F
)) = N
then
1605 Visit_Node
(Node_Id
(F
));
1608 -- Another case, if we are pointing to an Itype, then we want
1609 -- to copy it if its associated node is somewhere in the tree
1612 -- Note: the exclusion of self-referential copies is just an
1613 -- optimization, since the search of the already copied list
1614 -- would catch it, but it is a common case (Etype pointing
1615 -- to itself for an Itype that is a base type).
1617 elsif Has_Extension
(Node_Id
(F
))
1618 and then Is_Itype
(Entity_Id
(F
))
1619 and then Node_Id
(F
) /= N
1625 P
:= Associated_Node_For_Itype
(Node_Id
(F
));
1626 while Present
(P
) loop
1628 Visit_Node
(Node_Id
(F
));
1635 -- An Itype whose parent is not being copied definitely
1636 -- should NOT be copied, since it does not belong in any
1637 -- sense to the copied subtree.
1643 elsif F
in List_Range
1644 and then Parent
(List_Id
(F
)) = N
1646 Visit_List
(List_Id
(F
));
1655 -- Note: we are relying on far too much semantic knowledge in this
1656 -- routine, it really should just do a blind replacement of all
1657 -- fields, or at least a more blind replacement. For example, we
1658 -- do not deal with corresponding record types, and that works
1659 -- because we have no Itypes of task types, but nowhere is there
1660 -- a guarantee that this will always be the case. ???
1662 procedure Visit_Itype
(Old_Itype
: Entity_Id
) is
1663 New_Itype
: Entity_Id
;
1668 -- Itypes that describe the designated type of access to subprograms
1669 -- have the structure of subprogram declarations, with signatures,
1670 -- etc. Either we duplicate the signatures completely, or choose to
1671 -- share such itypes, which is fine because their elaboration will
1672 -- have no side effects. In any case, this is additional semantic
1673 -- information that seems awkward to have in atree.
1675 if Ekind
(Old_Itype
) = E_Subprogram_Type
then
1679 New_Itype
:= New_Copy
(Old_Itype
);
1681 -- The new Itype has all the attributes of the old one, and
1682 -- we just copy the contents of the entity. However, the back-end
1683 -- needs different names for debugging purposes, so we create a
1684 -- new internal name by appending the letter 'c' (copy) to the
1685 -- name of the original.
1687 Get_Name_String
(Chars
(Old_Itype
));
1688 Add_Char_To_Name_Buffer
('c');
1689 Set_Chars
(New_Itype
, Name_Enter
);
1691 -- If our associated node is an entity that has already been copied,
1692 -- then set the associated node of the copy to point to the right
1693 -- copy. If we have copied an Itype that is itself the associated
1694 -- node of some previously copied Itype, then we set the right
1695 -- pointer in the other direction.
1697 if Present
(Actual_Map
) then
1699 -- Case of hash tables used
1701 if NCT_Hash_Tables_Used
then
1703 Ent
:= NCT_Assoc
.Get
(Associated_Node_For_Itype
(Old_Itype
));
1704 if Present
(Ent
) then
1705 Set_Associated_Node_For_Itype
(New_Itype
, Ent
);
1708 Ent
:= NCT_Itype_Assoc
.Get
(Old_Itype
);
1709 if Present
(Ent
) then
1710 Set_Associated_Node_For_Itype
(Ent
, New_Itype
);
1713 -- Case of hash tables not used
1716 E
:= First_Elmt
(Actual_Map
);
1717 while Present
(E
) loop
1718 if Associated_Node_For_Itype
(Old_Itype
) = Node
(E
) then
1719 Set_Associated_Node_For_Itype
1720 (New_Itype
, Node
(Next_Elmt
(E
)));
1723 if Is_Type
(Node
(E
))
1725 Old_Itype
= Associated_Node_For_Itype
(Node
(E
))
1727 Set_Associated_Node_For_Itype
1728 (Node
(Next_Elmt
(E
)), New_Itype
);
1731 E
:= Next_Elmt
(Next_Elmt
(E
));
1736 if Present
(Freeze_Node
(New_Itype
)) then
1737 Set_Is_Frozen
(New_Itype
, False);
1738 Set_Freeze_Node
(New_Itype
, Empty
);
1741 -- Add new association to map
1743 if No
(Actual_Map
) then
1744 Actual_Map
:= New_Elmt_List
;
1747 Append_Elmt
(Old_Itype
, Actual_Map
);
1748 Append_Elmt
(New_Itype
, Actual_Map
);
1750 if NCT_Hash_Tables_Used
then
1751 NCT_Assoc
.Set
(Old_Itype
, New_Itype
);
1754 NCT_Table_Entries
:= NCT_Table_Entries
+ 1;
1756 if NCT_Table_Entries
> NCT_Hash_Threshhold
then
1757 Build_NCT_Hash_Tables
;
1761 -- If a record subtype is simply copied, the entity list will be
1762 -- shared. Thus cloned_Subtype must be set to indicate the sharing.
1764 if Ekind
(Old_Itype
) = E_Record_Subtype
1765 or else Ekind
(Old_Itype
) = E_Class_Wide_Subtype
1767 Set_Cloned_Subtype
(New_Itype
, Old_Itype
);
1770 -- Visit descendents that eventually get copied
1772 Visit_Field
(Union_Id
(Etype
(Old_Itype
)), Old_Itype
);
1774 if Is_Discrete_Type
(Old_Itype
) then
1775 Visit_Field
(Union_Id
(Scalar_Range
(Old_Itype
)), Old_Itype
);
1777 elsif Has_Discriminants
(Base_Type
(Old_Itype
)) then
1778 -- ??? This should involve call to Visit_Field.
1779 Visit_Elist
(Discriminant_Constraint
(Old_Itype
));
1781 elsif Is_Array_Type
(Old_Itype
) then
1782 if Present
(First_Index
(Old_Itype
)) then
1783 Visit_Field
(Union_Id
(List_Containing
1784 (First_Index
(Old_Itype
))),
1788 if Is_Packed
(Old_Itype
) then
1789 Visit_Field
(Union_Id
(Packed_Array_Type
(Old_Itype
)),
1799 procedure Visit_List
(L
: List_Id
) is
1802 if L
/= No_List
then
1805 while Present
(N
) loop
1816 procedure Visit_Node
(N
: Node_Or_Entity_Id
) is
1818 -- Start of processing for Visit_Node
1821 -- Handle case of an Itype, which must be copied
1823 if Has_Extension
(N
)
1824 and then Is_Itype
(N
)
1826 -- Nothing to do if already in the list. This can happen with an
1827 -- Itype entity that appears more than once in the tree.
1828 -- Note that we do not want to visit descendents in this case.
1830 -- Test for already in list when hash table is used
1832 if NCT_Hash_Tables_Used
then
1833 if Present
(NCT_Assoc
.Get
(Entity_Id
(N
))) then
1837 -- Test for already in list when hash table not used
1843 if Present
(Actual_Map
) then
1844 E
:= First_Elmt
(Actual_Map
);
1845 while Present
(E
) loop
1846 if Node
(E
) = N
then
1849 E
:= Next_Elmt
(Next_Elmt
(E
));
1859 -- Visit descendents
1861 Visit_Field
(Field1
(N
), N
);
1862 Visit_Field
(Field2
(N
), N
);
1863 Visit_Field
(Field3
(N
), N
);
1864 Visit_Field
(Field4
(N
), N
);
1865 Visit_Field
(Field5
(N
), N
);
1868 -- Start of processing for New_Copy_Tree
1873 -- See if we should use hash table
1875 if No
(Actual_Map
) then
1876 NCT_Hash_Tables_Used
:= False;
1883 NCT_Table_Entries
:= 0;
1885 Elmt
:= First_Elmt
(Actual_Map
);
1886 while Present
(Elmt
) loop
1887 NCT_Table_Entries
:= NCT_Table_Entries
+ 1;
1892 if NCT_Table_Entries
> NCT_Hash_Threshhold
then
1893 Build_NCT_Hash_Tables
;
1895 NCT_Hash_Tables_Used
:= False;
1900 -- Hash table set up if required, now start phase one by visiting
1901 -- top node (we will recursively visit the descendents).
1903 Visit_Node
(Source
);
1905 -- Now the second phase of the copy can start. First we process
1906 -- all the mapped entities, copying their descendents.
1908 if Present
(Actual_Map
) then
1911 New_Itype
: Entity_Id
;
1913 Elmt
:= First_Elmt
(Actual_Map
);
1914 while Present
(Elmt
) loop
1916 New_Itype
:= Node
(Elmt
);
1917 Copy_Itype_With_Replacement
(New_Itype
);
1923 -- Now we can copy the actual tree
1925 return Copy_Node_With_Replacement
(Source
);
1933 (New_Node_Kind
: Node_Kind
;
1934 New_Sloc
: Source_Ptr
) return Entity_Id
1938 procedure New_Entity_Debugging_Output
;
1939 pragma Inline
(New_Entity_Debugging_Output
);
1940 -- Debugging routine for debug flag N
1942 ---------------------------------
1943 -- New_Entity_Debugging_Output --
1944 ---------------------------------
1946 procedure New_Entity_Debugging_Output
is
1948 if Debug_Flag_N
then
1949 Write_Str
("Allocate entity, Id = ");
1950 Write_Int
(Int
(Ent
));
1952 Write_Location
(New_Sloc
);
1954 Write_Str
(Node_Kind
'Image (New_Node_Kind
));
1957 end New_Entity_Debugging_Output
;
1959 -- Start of processing for New_Entity
1962 pragma Assert
(New_Node_Kind
in N_Entity
);
1964 Ent
:= Allocate_Initialize_Node
(Empty
, With_Extension
=> True);
1966 -- If this is a node with a real location and we are generating
1967 -- source nodes, then reset Current_Error_Node. This is useful
1968 -- if we bomb during parsing to get a error location for the bomb.
1970 if Default_Node
.Comes_From_Source
and then New_Sloc
> No_Location
then
1971 Current_Error_Node
:= Ent
;
1974 Nodes
.Table
(Ent
).Nkind
:= New_Node_Kind
;
1975 Nodes
.Table
(Ent
).Sloc
:= New_Sloc
;
1976 pragma Debug
(New_Entity_Debugging_Output
);
1986 (New_Node_Kind
: Node_Kind
;
1987 New_Sloc
: Source_Ptr
) return Node_Id
1991 procedure New_Node_Debugging_Output
;
1992 pragma Inline
(New_Node_Debugging_Output
);
1993 -- Debugging routine for debug flag N
1995 --------------------------
1996 -- New_Debugging_Output --
1997 --------------------------
1999 procedure New_Node_Debugging_Output
is
2001 if Debug_Flag_N
then
2002 Write_Str
("Allocate node, Id = ");
2003 Write_Int
(Int
(Nod
));
2005 Write_Location
(New_Sloc
);
2007 Write_Str
(Node_Kind
'Image (New_Node_Kind
));
2010 end New_Node_Debugging_Output
;
2012 -- Start of processing for New_Node
2015 pragma Assert
(New_Node_Kind
not in N_Entity
);
2016 Nod
:= Allocate_Initialize_Node
(Empty
, With_Extension
=> False);
2017 Nodes
.Table
(Nod
).Nkind
:= New_Node_Kind
;
2018 Nodes
.Table
(Nod
).Sloc
:= New_Sloc
;
2019 pragma Debug
(New_Node_Debugging_Output
);
2021 -- If this is a node with a real location and we are generating
2022 -- source nodes, then reset Current_Error_Node. This is useful
2023 -- if we bomb during parsing to get a error location for the bomb.
2025 if Default_Node
.Comes_From_Source
and then New_Sloc
> No_Location
then
2026 Current_Error_Node
:= Nod
;
2036 function Nkind
(N
: Node_Id
) return Node_Kind
is
2038 return Nodes
.Table
(N
).Nkind
;
2045 function No
(N
: Node_Id
) return Boolean is
2054 function Nodes_Address
return System
.Address
is
2056 return Nodes
.Table
(First_Node_Id
)'Address;
2063 function Num_Nodes
return Nat
is
2072 function Original_Node
(Node
: Node_Id
) return Node_Id
is
2074 return Orig_Nodes
.Table
(Node
);
2081 function Paren_Count
(N
: Node_Id
) return Paren_Count_Type
is
2082 C
: Paren_Count_Type
:= 0;
2085 pragma Assert
(N
in Nodes
.First
.. Nodes
.Last
);
2087 if Nodes
.Table
(N
).Pflag1
then
2091 if Nodes
.Table
(N
).Pflag2
then
2102 function Parent
(N
: Node_Id
) return Node_Id
is
2104 if Is_List_Member
(N
) then
2105 return Parent
(List_Containing
(N
));
2107 return Node_Id
(Nodes
.Table
(N
).Link
);
2115 function Present
(N
: Node_Id
) return Boolean is
2120 --------------------------------
2121 -- Preserve_Comes_From_Source --
2122 --------------------------------
2124 procedure Preserve_Comes_From_Source
(NewN
, OldN
: Node_Id
) is
2126 Nodes
.Table
(NewN
).Comes_From_Source
:=
2127 Nodes
.Table
(OldN
).Comes_From_Source
;
2128 end Preserve_Comes_From_Source
;
2134 function Relocate_Node
(Source
: Node_Id
) return Node_Id
is
2142 New_Node
:= New_Copy
(Source
);
2143 Fix_Parents
(Source
, New_Node
);
2145 -- We now set the parent of the new node to be the same as the
2146 -- parent of the source. Almost always this parent will be
2147 -- replaced by a new value when the relocated node is reattached
2148 -- to the tree, but by doing it now, we ensure that this node is
2149 -- not even temporarily disconnected from the tree. Note that this
2150 -- does not happen free, because in the list case, the parent does
2153 Set_Parent
(New_Node
, Parent
(Source
));
2155 -- If the node being relocated was a rewriting of some original
2156 -- node, then the relocated node has the same original node.
2158 if Orig_Nodes
.Table
(Source
) /= Source
then
2159 Orig_Nodes
.Table
(New_Node
) := Orig_Nodes
.Table
(Source
);
2169 procedure Replace
(Old_Node
, New_Node
: Node_Id
) is
2170 Old_Post
: constant Boolean := Nodes
.Table
(Old_Node
).Error_Posted
;
2171 Old_CFS
: constant Boolean := Nodes
.Table
(Old_Node
).Comes_From_Source
;
2175 (not Has_Extension
(Old_Node
)
2176 and not Has_Extension
(New_Node
)
2177 and not Nodes
.Table
(New_Node
).In_List
);
2179 -- Do copy, preserving link and in list status and comes from source
2181 Copy_Node
(Source
=> New_Node
, Destination
=> Old_Node
);
2182 Nodes
.Table
(Old_Node
).Comes_From_Source
:= Old_CFS
;
2183 Nodes
.Table
(Old_Node
).Error_Posted
:= Old_Post
;
2185 -- Fix parents of substituted node, since it has changed identity
2187 Fix_Parents
(New_Node
, Old_Node
);
2189 -- Since we are doing a replace, we assume that the original node
2190 -- is intended to become the new replaced node. The call would be
2191 -- to Rewrite if there were an intention to save the original node.
2193 Orig_Nodes
.Table
(Old_Node
) := Old_Node
;
2195 -- Finally delete the source, since it is now copied
2197 Delete_Node
(New_Node
);
2204 procedure Rewrite
(Old_Node
, New_Node
: Node_Id
) is
2206 Old_Error_P
: constant Boolean := Nodes
.Table
(Old_Node
).Error_Posted
;
2207 -- This fields is always preserved in the new node
2209 Old_Paren_Count
: Paren_Count_Type
;
2210 Old_Must_Not_Freeze
: Boolean;
2211 -- These fields are preserved in the new node only if the new node
2212 -- and the old node are both subexpression nodes.
2214 -- Note: it is a violation of abstraction levels for Must_Not_Freeze
2215 -- to be referenced like this. ???
2221 (not Has_Extension
(Old_Node
)
2222 and not Has_Extension
(New_Node
)
2223 and not Nodes
.Table
(New_Node
).In_List
);
2225 if Nkind
(Old_Node
) in N_Subexpr
then
2226 Old_Paren_Count
:= Paren_Count
(Old_Node
);
2227 Old_Must_Not_Freeze
:= Must_Not_Freeze
(Old_Node
);
2229 Old_Paren_Count
:= 0;
2230 Old_Must_Not_Freeze
:= False;
2233 -- Allocate a new node, to be used to preserve the original contents
2234 -- of the Old_Node, for possible later retrival by Original_Node and
2235 -- make an entry in the Orig_Nodes table. This is only done if we have
2236 -- not already rewritten the node, as indicated by an Orig_Nodes entry
2237 -- that does not reference the Old_Node.
2239 if Orig_Nodes
.Table
(Old_Node
) = Old_Node
then
2240 Sav_Node
:= New_Copy
(Old_Node
);
2241 Orig_Nodes
.Table
(Sav_Node
) := Sav_Node
;
2242 Orig_Nodes
.Table
(Old_Node
) := Sav_Node
;
2245 -- Copy substitute node into place, preserving old fields as required
2247 Copy_Node
(Source
=> New_Node
, Destination
=> Old_Node
);
2248 Nodes
.Table
(Old_Node
).Error_Posted
:= Old_Error_P
;
2250 if Nkind
(New_Node
) in N_Subexpr
then
2251 Set_Paren_Count
(Old_Node
, Old_Paren_Count
);
2252 Set_Must_Not_Freeze
(Old_Node
, Old_Must_Not_Freeze
);
2255 Fix_Parents
(New_Node
, Old_Node
);
2262 procedure Set_Analyzed
(N
: Node_Id
; Val
: Boolean := True) is
2264 Nodes
.Table
(N
).Analyzed
:= Val
;
2267 ---------------------------
2268 -- Set_Comes_From_Source --
2269 ---------------------------
2271 procedure Set_Comes_From_Source
(N
: Node_Id
; Val
: Boolean) is
2273 pragma Assert
(N
in Nodes
.First
.. Nodes
.Last
);
2274 Nodes
.Table
(N
).Comes_From_Source
:= Val
;
2275 end Set_Comes_From_Source
;
2277 -----------------------------------
2278 -- Set_Comes_From_Source_Default --
2279 -----------------------------------
2281 procedure Set_Comes_From_Source_Default
(Default
: Boolean) is
2283 Default_Node
.Comes_From_Source
:= Default
;
2284 end Set_Comes_From_Source_Default
;
2286 --------------------
2287 -- Set_Convention --
2288 --------------------
2290 procedure Set_Convention
(E
: Entity_Id
; Val
: Convention_Id
) is
2292 pragma Assert
(Nkind
(E
) in N_Entity
);
2295 (Nodes.Table (E + 2).Field12'Unrestricted_Access)).Convention :=
2303 procedure Set_Ekind (E : Entity_Id; Val : Entity_Kind) is
2305 pragma Assert (Nkind (E) in N_Entity);
2306 Nodes.Table (E + 1).Nkind := E_To_N (Val);
2309 ----------------------
2310 -- Set_Error_Posted --
2311 ----------------------
2313 procedure Set_Error_Posted (N : Node_Id; Val : Boolean := True) is
2315 Nodes.Table (N).Error_Posted := Val;
2316 end Set_Error_Posted;
2318 ---------------------
2319 -- Set_Paren_Count --
2320 ---------------------
2322 procedure Set_Paren_Count (N : Node_Id; Val : Paren_Count_Type) is
2324 pragma Assert (Nkind (N) in N_Subexpr);
2325 Nodes.Table (N).Pflag1 := (Val mod 2 /= 0);
2326 Nodes.Table (N).Pflag2 := (Val >= 2);
2327 end Set_Paren_Count;
2333 procedure Set_Parent (N : Node_Id; Val : Node_Id) is
2335 pragma Assert (not Nodes.Table (N).In_List);
2336 Nodes.Table (N).Link := Union_Id (Val);
2343 procedure Set_Sloc (N : Node_Id; Val : Source_Ptr) is
2345 Nodes.Table (N).Sloc := Val;
2352 function Sloc (N : Node_Id) return Source_Ptr is
2354 return Nodes.Table (N).Sloc;
2361 function Traverse_Func (Node : Node_Id) return Traverse_Result is
2363 function Traverse_Field (Fld : Union_Id) return Traverse_Result;
2364 -- Fld is one of the fields of Node. If the field points to a
2365 -- syntactic node or list, then this node or list is traversed,
2366 -- and the result is the result of this traversal. Otherwise
2367 -- a value of True is returned with no processing.
2369 --------------------
2370 -- Traverse_Field --
2371 --------------------
2373 function Traverse_Field (Fld : Union_Id) return Traverse_Result is
2375 if Fld = Union_Id (Empty) then
2378 -- Descendent is a node
2380 elsif Fld in Node_Range then
2382 -- Traverse descendent that is syntactic subtree node
2384 if Parent (Node_Id (Fld)) = Node
2385 or else Original_Node (Parent (Node_Id (Fld))) = Node
2387 return Traverse_Func (Node_Id (Fld));
2389 -- Node that is not a syntactic subtree
2395 -- Descendent is a list
2397 elsif Fld in List_Range then
2399 -- Traverse descendent that is a syntactic subtree list
2401 if Parent (List_Id (Fld)) = Node
2402 or else Original_Node (Parent (List_Id (Fld))) = Node
2405 Elmt : Node_Id := First (List_Id (Fld));
2407 while Present (Elmt) loop
2408 if Traverse_Func (Elmt) = Abandon then
2418 -- List that is not a syntactic subtree
2424 -- Field was not a node or a list
2431 -- Start of processing for Traverse_Func
2434 case Process (Node) is
2442 if Traverse_Field (Union_Id (Field1 (Node))) = Abandon
2444 Traverse_Field (Union_Id (Field2 (Node))) = Abandon
2446 Traverse_Field (Union_Id (Field3 (Node))) = Abandon
2448 Traverse_Field (Union_Id (Field4 (Node))) = Abandon
2450 Traverse_Field (Union_Id (Field5 (Node))) = Abandon
2460 Onode : constant Node_Id := Original_Node (Node);
2463 if Traverse_Field (Union_Id (Field1 (Onode))) = Abandon
2465 Traverse_Field (Union_Id (Field2 (Onode))) = Abandon
2467 Traverse_Field (Union_Id (Field3 (Onode))) = Abandon
2469 Traverse_Field (Union_Id (Field4 (Onode))) = Abandon
2471 Traverse_Field (Union_Id (Field5 (Onode))) = Abandon
2486 procedure Traverse_Proc (Node : Node_Id) is
2487 function Traverse is new Traverse_Func (Process);
2488 Discard : Traverse_Result;
2489 pragma Warnings (Off, Discard);
2491 Discard := Traverse (Node);
2498 procedure Tree_Read is
2500 Tree_Read_Int (Node_Count);
2502 Orig_Nodes.Tree_Read;
2509 procedure Tree_Write is
2511 Tree_Write_Int (Node_Count);
2513 Orig_Nodes.Tree_Write;
2516 ------------------------------
2517 -- Unchecked Access Package --
2518 ------------------------------
2520 package body Unchecked_Access is
2522 function Field1 (N : Node_Id) return Union_Id is
2524 pragma Assert (N in Nodes.First .. Nodes.Last);
2525 return Nodes.Table (N).Field1;
2528 function Field2 (N : Node_Id) return Union_Id is
2530 pragma Assert (N in Nodes.First .. Nodes.Last);
2531 return Nodes.Table (N).Field2;
2534 function Field3 (N : Node_Id) return Union_Id is
2536 pragma Assert (N in Nodes.First .. Nodes.Last);
2537 return Nodes.Table (N).Field3;
2540 function Field4 (N : Node_Id) return Union_Id is
2542 pragma Assert (N in Nodes.First .. Nodes.Last);
2543 return Nodes.Table (N).Field4;
2546 function Field5 (N : Node_Id) return Union_Id is
2548 pragma Assert (N in Nodes.First .. Nodes.Last);
2549 return Nodes.Table (N).Field5;
2552 function Field6 (N : Node_Id) return Union_Id is
2554 pragma Assert (Nkind (N) in N_Entity);
2555 return Nodes.Table (N + 1).Field6;
2558 function Field7 (N : Node_Id) return Union_Id is
2560 pragma Assert (Nkind (N) in N_Entity);
2561 return Nodes.Table (N + 1).Field7;
2564 function Field8 (N : Node_Id) return Union_Id is
2566 pragma Assert (Nkind (N) in N_Entity);
2567 return Nodes.Table (N + 1).Field8;
2570 function Field9 (N : Node_Id) return Union_Id is
2572 pragma Assert (Nkind (N) in N_Entity);
2573 return Nodes.Table (N + 1).Field9;
2576 function Field10 (N : Node_Id) return Union_Id is
2578 pragma Assert (Nkind (N) in N_Entity);
2579 return Nodes.Table (N + 1).Field10;
2582 function Field11 (N : Node_Id) return Union_Id is
2584 pragma Assert (Nkind (N) in N_Entity);
2585 return Nodes.Table (N + 1).Field11;
2588 function Field12 (N : Node_Id) return Union_Id is
2590 pragma Assert (Nkind (N) in N_Entity);
2591 return Nodes.Table (N + 1).Field12;
2594 function Field13 (N : Node_Id) return Union_Id is
2596 pragma Assert (Nkind (N) in N_Entity);
2597 return Nodes.Table (N + 2).Field6;
2600 function Field14 (N : Node_Id) return Union_Id is
2602 pragma Assert (Nkind (N) in N_Entity);
2603 return Nodes.Table (N + 2).Field7;
2606 function Field15 (N : Node_Id) return Union_Id is
2608 pragma Assert (Nkind (N) in N_Entity);
2609 return Nodes.Table (N + 2).Field8;
2612 function Field16 (N : Node_Id) return Union_Id is
2614 pragma Assert (Nkind (N) in N_Entity);
2615 return Nodes.Table (N + 2).Field9;
2618 function Field17 (N : Node_Id) return Union_Id is
2620 pragma Assert (Nkind (N) in N_Entity);
2621 return Nodes.Table (N + 2).Field10;
2624 function Field18 (N : Node_Id) return Union_Id is
2626 pragma Assert (Nkind (N) in N_Entity);
2627 return Nodes.Table (N + 2).Field11;
2630 function Field19 (N : Node_Id) return Union_Id is
2632 pragma Assert (Nkind (N) in N_Entity);
2633 return Nodes.Table (N + 3).Field6;
2636 function Field20 (N : Node_Id) return Union_Id is
2638 pragma Assert (Nkind (N) in N_Entity);
2639 return Nodes.Table (N + 3).Field7;
2642 function Field21 (N : Node_Id) return Union_Id is
2644 pragma Assert (Nkind (N) in N_Entity);
2645 return Nodes.Table (N + 3).Field8;
2648 function Field22 (N : Node_Id) return Union_Id is
2650 pragma Assert (Nkind (N) in N_Entity);
2651 return Nodes.Table (N + 3).Field9;
2654 function Field23 (N : Node_Id) return Union_Id is
2656 pragma Assert (Nkind (N) in N_Entity);
2657 return Nodes.Table (N + 3).Field10;
2660 function Field24 (N : Node_Id) return Union_Id is
2662 pragma Assert (Nkind (N) in N_Entity);
2663 return Nodes.Table (N + 4).Field6;
2666 function Field25 (N : Node_Id) return Union_Id is
2668 pragma Assert (Nkind (N) in N_Entity);
2669 return Nodes.Table (N + 4).Field7;
2672 function Field26 (N : Node_Id) return Union_Id is
2674 pragma Assert (Nkind (N) in N_Entity);
2675 return Nodes.Table (N + 4).Field8;
2678 function Field27 (N : Node_Id) return Union_Id is
2680 pragma Assert (Nkind (N) in N_Entity);
2681 return Nodes.Table (N + 4).Field9;
2684 function Node1 (N : Node_Id) return Node_Id is
2686 pragma Assert (N in Nodes.First .. Nodes.Last);
2687 return Node_Id (Nodes.Table (N).Field1);
2690 function Node2 (N : Node_Id) return Node_Id is
2692 pragma Assert (N in Nodes.First .. Nodes.Last);
2693 return Node_Id (Nodes.Table (N).Field2);
2696 function Node3 (N : Node_Id) return Node_Id is
2698 pragma Assert (N in Nodes.First .. Nodes.Last);
2699 return Node_Id (Nodes.Table (N).Field3);
2702 function Node4 (N : Node_Id) return Node_Id is
2704 pragma Assert (N in Nodes.First .. Nodes.Last);
2705 return Node_Id (Nodes.Table (N).Field4);
2708 function Node5 (N : Node_Id) return Node_Id is
2710 pragma Assert (N in Nodes.First .. Nodes.Last);
2711 return Node_Id (Nodes.Table (N).Field5);
2714 function Node6 (N : Node_Id) return Node_Id is
2716 pragma Assert (Nkind (N) in N_Entity);
2717 return Node_Id (Nodes.Table (N + 1).Field6);
2720 function Node7 (N : Node_Id) return Node_Id is
2722 pragma Assert (Nkind (N) in N_Entity);
2723 return Node_Id (Nodes.Table (N + 1).Field7);
2726 function Node8 (N : Node_Id) return Node_Id is
2728 pragma Assert (Nkind (N) in N_Entity);
2729 return Node_Id (Nodes.Table (N + 1).Field8);
2732 function Node9 (N : Node_Id) return Node_Id is
2734 pragma Assert (Nkind (N) in N_Entity);
2735 return Node_Id (Nodes.Table (N + 1).Field9);
2738 function Node10 (N : Node_Id) return Node_Id is
2740 pragma Assert (Nkind (N) in N_Entity);
2741 return Node_Id (Nodes.Table (N + 1).Field10);
2744 function Node11 (N : Node_Id) return Node_Id is
2746 pragma Assert (Nkind (N) in N_Entity);
2747 return Node_Id (Nodes.Table (N + 1).Field11);
2750 function Node12 (N : Node_Id) return Node_Id is
2752 pragma Assert (Nkind (N) in N_Entity);
2753 return Node_Id (Nodes.Table (N + 1).Field12);
2756 function Node13 (N : Node_Id) return Node_Id is
2758 pragma Assert (Nkind (N) in N_Entity);
2759 return Node_Id (Nodes.Table (N + 2).Field6);
2762 function Node14 (N : Node_Id) return Node_Id is
2764 pragma Assert (Nkind (N) in N_Entity);
2765 return Node_Id (Nodes.Table (N + 2).Field7);
2768 function Node15 (N : Node_Id) return Node_Id is
2770 pragma Assert (Nkind (N) in N_Entity);
2771 return Node_Id (Nodes.Table (N + 2).Field8);
2774 function Node16 (N : Node_Id) return Node_Id is
2776 pragma Assert (Nkind (N) in N_Entity);
2777 return Node_Id (Nodes.Table (N + 2).Field9);
2780 function Node17 (N : Node_Id) return Node_Id is
2782 pragma Assert (Nkind (N) in N_Entity);
2783 return Node_Id (Nodes.Table (N + 2).Field10);
2786 function Node18 (N : Node_Id) return Node_Id is
2788 pragma Assert (Nkind (N) in N_Entity);
2789 return Node_Id (Nodes.Table (N + 2).Field11);
2792 function Node19 (N : Node_Id) return Node_Id is
2794 pragma Assert (Nkind (N) in N_Entity);
2795 return Node_Id (Nodes.Table (N + 3).Field6);
2798 function Node20 (N : Node_Id) return Node_Id is
2800 pragma Assert (Nkind (N) in N_Entity);
2801 return Node_Id (Nodes.Table (N + 3).Field7);
2804 function Node21 (N : Node_Id) return Node_Id is
2806 pragma Assert (Nkind (N) in N_Entity);
2807 return Node_Id (Nodes.Table (N + 3).Field8);
2810 function Node22 (N : Node_Id) return Node_Id is
2812 pragma Assert (Nkind (N) in N_Entity);
2813 return Node_Id (Nodes.Table (N + 3).Field9);
2816 function Node23 (N : Node_Id) return Node_Id is
2818 pragma Assert (Nkind (N) in N_Entity);
2819 return Node_Id (Nodes.Table (N + 3).Field10);
2822 function Node24 (N : Node_Id) return Node_Id is
2824 pragma Assert (Nkind (N) in N_Entity);
2825 return Node_Id (Nodes.Table (N + 4).Field6);
2828 function Node25 (N : Node_Id) return Node_Id is
2830 pragma Assert (Nkind (N) in N_Entity);
2831 return Node_Id (Nodes.Table (N + 4).Field7);
2834 function Node26 (N : Node_Id) return Node_Id is
2836 pragma Assert (Nkind (N) in N_Entity);
2837 return Node_Id (Nodes.Table (N + 4).Field8);
2840 function Node27 (N : Node_Id) return Node_Id is
2842 pragma Assert (Nkind (N) in N_Entity);
2843 return Node_Id (Nodes.Table (N + 4).Field9);
2846 function List1 (N : Node_Id) return List_Id is
2848 pragma Assert (N in Nodes.First .. Nodes.Last);
2849 return List_Id (Nodes.Table (N).Field1);
2852 function List2 (N : Node_Id) return List_Id is
2854 pragma Assert (N in Nodes.First .. Nodes.Last);
2855 return List_Id (Nodes.Table (N).Field2);
2858 function List3 (N : Node_Id) return List_Id is
2860 pragma Assert (N in Nodes.First .. Nodes.Last);
2861 return List_Id (Nodes.Table (N).Field3);
2864 function List4 (N : Node_Id) return List_Id is
2866 pragma Assert (N in Nodes.First .. Nodes.Last);
2867 return List_Id (Nodes.Table (N).Field4);
2870 function List5 (N : Node_Id) return List_Id is
2872 pragma Assert (N in Nodes.First .. Nodes.Last);
2873 return List_Id (Nodes.Table (N).Field5);
2876 function List10 (N : Node_Id) return List_Id is
2878 pragma Assert (Nkind (N) in N_Entity);
2879 return List_Id (Nodes.Table (N + 1).Field10);
2882 function List14 (N : Node_Id) return List_Id is
2884 pragma Assert (Nkind (N) in N_Entity);
2885 return List_Id (Nodes.Table (N + 2).Field7);
2888 function Elist2 (N : Node_Id) return Elist_Id is
2890 return Elist_Id (Nodes.Table (N).Field2);
2893 function Elist3 (N : Node_Id) return Elist_Id is
2895 return Elist_Id (Nodes.Table (N).Field3);
2898 function Elist4 (N : Node_Id) return Elist_Id is
2900 return Elist_Id (Nodes.Table (N).Field4);
2903 function Elist8 (N : Node_Id) return Elist_Id is
2905 pragma Assert (Nkind (N) in N_Entity);
2906 return Elist_Id (Nodes.Table (N + 1).Field8);
2909 function Elist13 (N : Node_Id) return Elist_Id is
2911 pragma Assert (Nkind (N) in N_Entity);
2912 return Elist_Id (Nodes.Table (N + 2).Field6);
2915 function Elist15 (N : Node_Id) return Elist_Id is
2917 pragma Assert (Nkind (N) in N_Entity);
2918 return Elist_Id (Nodes.Table (N + 2).Field8);
2921 function Elist16 (N : Node_Id) return Elist_Id is
2923 pragma Assert (Nkind (N) in N_Entity);
2924 return Elist_Id (Nodes.Table (N + 2).Field9);
2927 function Elist18 (N : Node_Id) return Elist_Id is
2929 pragma Assert (Nkind (N) in N_Entity);
2930 return Elist_Id (Nodes.Table (N + 2).Field11);
2933 function Elist21 (N : Node_Id) return Elist_Id is
2935 pragma Assert (Nkind (N) in N_Entity);
2936 return Elist_Id (Nodes.Table (N + 3).Field8);
2939 function Elist23 (N : Node_Id) return Elist_Id is
2941 pragma Assert (Nkind (N) in N_Entity);
2942 return Elist_Id (Nodes.Table (N + 3).Field10);
2945 function Name1 (N : Node_Id) return Name_Id is
2947 pragma Assert (N in Nodes.First .. Nodes.Last);
2948 return Name_Id (Nodes.Table (N).Field1);
2951 function Name2 (N : Node_Id) return Name_Id is
2953 pragma Assert (N in Nodes.First .. Nodes.Last);
2954 return Name_Id (Nodes.Table (N).Field2);
2957 function Str3 (N : Node_Id) return String_Id is
2959 pragma Assert (N in Nodes.First .. Nodes.Last);
2960 return String_Id (Nodes.Table (N).Field3);
2963 function Uint2 (N : Node_Id) return Uint is
2964 pragma Assert (N in Nodes.First .. Nodes.Last);
2965 U : constant Union_Id := Nodes.Table (N).Field2;
2970 return From_Union (U);
2974 function Uint3 (N : Node_Id) return Uint is
2975 pragma Assert (N in Nodes.First .. Nodes.Last);
2976 U : constant Union_Id := Nodes.Table (N).Field3;
2981 return From_Union (U);
2985 function Uint4 (N : Node_Id) return Uint is
2986 pragma Assert (N in Nodes.First .. Nodes.Last);
2987 U : constant Union_Id := Nodes.Table (N).Field4;
2992 return From_Union (U);
2996 function Uint5 (N : Node_Id) return Uint is
2997 pragma Assert (N in Nodes.First .. Nodes.Last);
2998 U : constant Union_Id := Nodes.Table (N).Field5;
3003 return From_Union (U);
3007 function Uint8 (N : Node_Id) return Uint is
3008 pragma Assert (Nkind (N) in N_Entity);
3009 U : constant Union_Id := Nodes.Table (N + 1).Field8;
3015 return From_Union (U);
3019 function Uint9 (N : Node_Id) return Uint is
3020 pragma Assert (Nkind (N) in N_Entity);
3021 U : constant Union_Id := Nodes.Table (N + 1).Field9;
3026 return From_Union (U);
3030 function Uint10 (N : Node_Id) return Uint is
3031 pragma Assert (Nkind (N) in N_Entity);
3032 U : constant Union_Id := Nodes.Table (N + 1).Field10;
3037 return From_Union (U);
3041 function Uint11 (N : Node_Id) return Uint is
3042 pragma Assert (Nkind (N) in N_Entity);
3043 U : constant Union_Id := Nodes.Table (N + 1).Field11;
3048 return From_Union (U);
3052 function Uint12 (N : Node_Id) return Uint is
3053 pragma Assert (Nkind (N) in N_Entity);
3054 U : constant Union_Id := Nodes.Table (N + 1).Field12;
3059 return From_Union (U);
3063 function Uint13 (N : Node_Id) return Uint is
3064 pragma Assert (Nkind (N) in N_Entity);
3065 U : constant Union_Id := Nodes.Table (N + 2).Field6;
3070 return From_Union (U);
3074 function Uint14 (N : Node_Id) return Uint is
3075 pragma Assert (Nkind (N) in N_Entity);
3076 U : constant Union_Id := Nodes.Table (N + 2).Field7;
3081 return From_Union (U);
3085 function Uint15 (N : Node_Id) return Uint is
3086 pragma Assert (Nkind (N) in N_Entity);
3087 U : constant Union_Id := Nodes.Table (N + 2).Field8;
3092 return From_Union (U);
3096 function Uint16 (N : Node_Id) return Uint is
3097 pragma Assert (Nkind (N) in N_Entity);
3098 U : constant Union_Id := Nodes.Table (N + 2).Field9;
3103 return From_Union (U);
3107 function Uint17 (N : Node_Id) return Uint is
3108 pragma Assert (Nkind (N) in N_Entity);
3109 U : constant Union_Id := Nodes.Table (N + 2).Field10;
3114 return From_Union (U);
3118 function Uint22 (N : Node_Id) return Uint is
3119 pragma Assert (Nkind (N) in N_Entity);
3120 U : constant Union_Id := Nodes.Table (N + 3).Field9;
3125 return From_Union (U);
3129 function Ureal3 (N : Node_Id) return Ureal is
3131 pragma Assert (N in Nodes.First .. Nodes.Last);
3132 return From_Union (Nodes.Table (N).Field3);
3135 function Ureal18 (N : Node_Id) return Ureal is
3137 pragma Assert (Nkind (N) in N_Entity);
3138 return From_Union (Nodes.Table (N + 2).Field11);
3141 function Ureal21 (N : Node_Id) return Ureal is
3143 pragma Assert (Nkind (N) in N_Entity);
3144 return From_Union (Nodes.Table (N + 3).Field8);
3147 function Flag4 (N : Node_Id) return Boolean is
3149 pragma Assert (N in Nodes.First .. Nodes.Last);
3150 return Nodes.Table (N).Flag4;
3153 function Flag5 (N : Node_Id) return Boolean is
3155 pragma Assert (N in Nodes.First .. Nodes.Last);
3156 return Nodes.Table (N).Flag5;
3159 function Flag6 (N : Node_Id) return Boolean is
3161 pragma Assert (N in Nodes.First .. Nodes.Last);
3162 return Nodes.Table (N).Flag6;
3165 function Flag7 (N : Node_Id) return Boolean is
3167 pragma Assert (N in Nodes.First .. Nodes.Last);
3168 return Nodes.Table (N).Flag7;
3171 function Flag8 (N : Node_Id) return Boolean is
3173 pragma Assert (N in Nodes.First .. Nodes.Last);
3174 return Nodes.Table (N).Flag8;
3177 function Flag9 (N : Node_Id) return Boolean is
3179 pragma Assert (N in Nodes.First .. Nodes.Last);
3180 return Nodes.Table (N).Flag9;
3183 function Flag10 (N : Node_Id) return Boolean is
3185 pragma Assert (N in Nodes.First .. Nodes.Last);
3186 return Nodes.Table (N).Flag10;
3189 function Flag11 (N : Node_Id) return Boolean is
3191 pragma Assert (N in Nodes.First .. Nodes.Last);
3192 return Nodes.Table (N).Flag11;
3195 function Flag12 (N : Node_Id) return Boolean is
3197 pragma Assert (N in Nodes.First .. Nodes.Last);
3198 return Nodes.Table (N).Flag12;
3201 function Flag13 (N : Node_Id) return Boolean is
3203 pragma Assert (N in Nodes.First .. Nodes.Last);
3204 return Nodes.Table (N).Flag13;
3207 function Flag14 (N : Node_Id) return Boolean is
3209 pragma Assert (N in Nodes.First .. Nodes.Last);
3210 return Nodes.Table (N).Flag14;
3213 function Flag15 (N : Node_Id) return Boolean is
3215 pragma Assert (N in Nodes.First .. Nodes.Last);
3216 return Nodes.Table (N).Flag15;
3219 function Flag16 (N : Node_Id) return Boolean is
3221 pragma Assert (N in Nodes.First .. Nodes.Last);
3222 return Nodes.Table (N).Flag16;
3225 function Flag17 (N : Node_Id) return Boolean is
3227 pragma Assert (N in Nodes.First .. Nodes.Last);
3228 return Nodes.Table (N).Flag17;
3231 function Flag18 (N : Node_Id) return Boolean is
3233 pragma Assert (N in Nodes.First .. Nodes.Last);
3234 return Nodes.Table (N).Flag18;
3237 function Flag19 (N : Node_Id) return Boolean is
3239 pragma Assert (Nkind (N) in N_Entity);
3240 return Nodes.Table (N + 1).In_List;
3243 function Flag20 (N : Node_Id) return Boolean is
3245 pragma Assert (Nkind (N) in N_Entity);
3246 return Nodes.Table (N + 1).Unused_1;
3249 function Flag21 (N : Node_Id) return Boolean is
3251 pragma Assert (Nkind (N) in N_Entity);
3252 return Nodes.Table (N + 1).Rewrite_Ins;
3255 function Flag22 (N : Node_Id) return Boolean is
3257 pragma Assert (Nkind (N) in N_Entity);
3258 return Nodes.Table (N + 1).Analyzed;
3261 function Flag23 (N : Node_Id) return Boolean is
3263 pragma Assert (Nkind (N) in N_Entity);
3264 return Nodes.Table (N + 1).Comes_From_Source;
3267 function Flag24 (N : Node_Id) return Boolean is
3269 pragma Assert (Nkind (N) in N_Entity);
3270 return Nodes.Table (N + 1).Error_Posted;
3273 function Flag25 (N : Node_Id) return Boolean is
3275 pragma Assert (Nkind (N) in N_Entity);
3276 return Nodes.Table (N + 1).Flag4;
3279 function Flag26 (N : Node_Id) return Boolean is
3281 pragma Assert (Nkind (N) in N_Entity);
3282 return Nodes.Table (N + 1).Flag5;
3285 function Flag27 (N : Node_Id) return Boolean is
3287 pragma Assert (Nkind (N) in N_Entity);
3288 return Nodes.Table (N + 1).Flag6;
3291 function Flag28 (N : Node_Id) return Boolean is
3293 pragma Assert (Nkind (N) in N_Entity);
3294 return Nodes.Table (N + 1).Flag7;
3297 function Flag29 (N : Node_Id) return Boolean is
3299 pragma Assert (Nkind (N) in N_Entity);
3300 return Nodes.Table (N + 1).Flag8;
3303 function Flag30 (N : Node_Id) return Boolean is
3305 pragma Assert (Nkind (N) in N_Entity);
3306 return Nodes.Table (N + 1).Flag9;
3309 function Flag31 (N : Node_Id) return Boolean is
3311 pragma Assert (Nkind (N) in N_Entity);
3312 return Nodes.Table (N + 1).Flag10;
3315 function Flag32 (N : Node_Id) return Boolean is
3317 pragma Assert (Nkind (N) in N_Entity);
3318 return Nodes.Table (N + 1).Flag11;
3321 function Flag33 (N : Node_Id) return Boolean is
3323 pragma Assert (Nkind (N) in N_Entity);
3324 return Nodes.Table (N + 1).Flag12;
3327 function Flag34 (N : Node_Id) return Boolean is
3329 pragma Assert (Nkind (N) in N_Entity);
3330 return Nodes.Table (N + 1).Flag13;
3333 function Flag35 (N : Node_Id) return Boolean is
3335 pragma Assert (Nkind (N) in N_Entity);
3336 return Nodes.Table (N + 1).Flag14;
3339 function Flag36 (N : Node_Id) return Boolean is
3341 pragma Assert (Nkind (N) in N_Entity);
3342 return Nodes.Table (N + 1).Flag15;
3345 function Flag37 (N : Node_Id) return Boolean is
3347 pragma Assert (Nkind (N) in N_Entity);
3348 return Nodes.Table (N + 1).Flag16;
3351 function Flag38 (N : Node_Id) return Boolean is
3353 pragma Assert (Nkind (N) in N_Entity);
3354 return Nodes.Table (N + 1).Flag17;
3357 function Flag39 (N : Node_Id) return Boolean is
3359 pragma Assert (Nkind (N) in N_Entity);
3360 return Nodes.Table (N + 1).Flag18;
3363 function Flag40 (N : Node_Id) return Boolean is
3365 pragma Assert (Nkind (N) in N_Entity);
3366 return Nodes.Table (N + 2).In_List;
3369 function Flag41 (N : Node_Id) return Boolean is
3371 pragma Assert (Nkind (N) in N_Entity);
3372 return Nodes.Table (N + 2).Unused_1;
3375 function Flag42 (N : Node_Id) return Boolean is
3377 pragma Assert (Nkind (N) in N_Entity);
3378 return Nodes.Table (N + 2).Rewrite_Ins;
3381 function Flag43 (N : Node_Id) return Boolean is
3383 pragma Assert (Nkind (N) in N_Entity);
3384 return Nodes.Table (N + 2).Analyzed;
3387 function Flag44 (N : Node_Id) return Boolean is
3389 pragma Assert (Nkind (N) in N_Entity);
3390 return Nodes.Table (N + 2).Comes_From_Source;
3393 function Flag45 (N : Node_Id) return Boolean is
3395 pragma Assert (Nkind (N) in N_Entity);
3396 return Nodes.Table (N + 2).Error_Posted;
3399 function Flag46 (N : Node_Id) return Boolean is
3401 pragma Assert (Nkind (N) in N_Entity);
3402 return Nodes.Table (N + 2).Flag4;
3405 function Flag47 (N : Node_Id) return Boolean is
3407 pragma Assert (Nkind (N) in N_Entity);
3408 return Nodes.Table (N + 2).Flag5;
3411 function Flag48 (N : Node_Id) return Boolean is
3413 pragma Assert (Nkind (N) in N_Entity);
3414 return Nodes.Table (N + 2).Flag6;
3417 function Flag49 (N : Node_Id) return Boolean is
3419 pragma Assert (Nkind (N) in N_Entity);
3420 return Nodes.Table (N + 2).Flag7;
3423 function Flag50 (N : Node_Id) return Boolean is
3425 pragma Assert (Nkind (N) in N_Entity);
3426 return Nodes.Table (N + 2).Flag8;
3429 function Flag51 (N : Node_Id) return Boolean is
3431 pragma Assert (Nkind (N) in N_Entity);
3432 return Nodes.Table (N + 2).Flag9;
3435 function Flag52 (N : Node_Id) return Boolean is
3437 pragma Assert (Nkind (N) in N_Entity);
3438 return Nodes.Table (N + 2).Flag10;
3441 function Flag53 (N : Node_Id) return Boolean is
3443 pragma Assert (Nkind (N) in N_Entity);
3444 return Nodes.Table (N + 2).Flag11;
3447 function Flag54 (N : Node_Id) return Boolean is
3449 pragma Assert (Nkind (N) in N_Entity);
3450 return Nodes.Table (N + 2).Flag12;
3453 function Flag55 (N : Node_Id) return Boolean is
3455 pragma Assert (Nkind (N) in N_Entity);
3456 return Nodes.Table (N + 2).Flag13;
3459 function Flag56 (N : Node_Id) return Boolean is
3461 pragma Assert (Nkind (N) in N_Entity);
3462 return Nodes.Table (N + 2).Flag14;
3465 function Flag57 (N : Node_Id) return Boolean is
3467 pragma Assert (Nkind (N) in N_Entity);
3468 return Nodes.Table (N + 2).Flag15;
3471 function Flag58 (N : Node_Id) return Boolean is
3473 pragma Assert (Nkind (N) in N_Entity);
3474 return Nodes.Table (N + 2).Flag16;
3477 function Flag59 (N : Node_Id) return Boolean is
3479 pragma Assert (Nkind (N) in N_Entity);
3480 return Nodes.Table (N + 2).Flag17;
3483 function Flag60 (N : Node_Id) return Boolean is
3485 pragma Assert (Nkind (N) in N_Entity);
3486 return Nodes.Table (N + 2).Flag18;
3489 function Flag61 (N : Node_Id) return Boolean is
3491 pragma Assert (Nkind (N) in N_Entity);
3492 return Nodes.Table (N + 1).Pflag1;
3495 function Flag62 (N : Node_Id) return Boolean is
3497 pragma Assert (Nkind (N) in N_Entity);
3498 return Nodes.Table (N + 1).Pflag2;
3501 function Flag63 (N : Node_Id) return Boolean is
3503 pragma Assert (Nkind (N) in N_Entity);
3504 return Nodes.Table (N + 2).Pflag1;
3507 function Flag64 (N : Node_Id) return Boolean is
3509 pragma Assert (Nkind (N) in N_Entity);
3510 return Nodes.Table (N + 2).Pflag2;
3513 function Flag65 (N : Node_Id) return Boolean is
3515 pragma Assert (Nkind (N) in N_Entity);
3516 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag65;
3519 function Flag66 (N : Node_Id) return Boolean is
3521 pragma Assert (Nkind (N) in N_Entity);
3522 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag66;
3525 function Flag67 (N : Node_Id) return Boolean is
3527 pragma Assert (Nkind (N) in N_Entity);
3528 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag67;
3531 function Flag68 (N : Node_Id) return Boolean is
3533 pragma Assert (Nkind (N) in N_Entity);
3534 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag68;
3537 function Flag69 (N : Node_Id) return Boolean is
3539 pragma Assert (Nkind (N) in N_Entity);
3540 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag69;
3543 function Flag70 (N : Node_Id) return Boolean is
3545 pragma Assert (Nkind (N) in N_Entity);
3546 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag70;
3549 function Flag71 (N : Node_Id) return Boolean is
3551 pragma Assert (Nkind (N) in N_Entity);
3552 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag71;
3555 function Flag72 (N : Node_Id) return Boolean is
3557 pragma Assert (Nkind (N) in N_Entity);
3558 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag72;
3561 function Flag73 (N : Node_Id) return Boolean is
3563 pragma Assert (Nkind (N) in N_Entity);
3564 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag73;
3567 function Flag74 (N : Node_Id) return Boolean is
3569 pragma Assert (Nkind (N) in N_Entity);
3570 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag74;
3573 function Flag75 (N : Node_Id) return Boolean is
3575 pragma Assert (Nkind (N) in N_Entity);
3576 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag75;
3579 function Flag76 (N : Node_Id) return Boolean is
3581 pragma Assert (Nkind (N) in N_Entity);
3582 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag76;
3585 function Flag77 (N : Node_Id) return Boolean is
3587 pragma Assert (Nkind (N) in N_Entity);
3588 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag77;
3591 function Flag78 (N : Node_Id) return Boolean is
3593 pragma Assert (Nkind (N) in N_Entity);
3594 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag78;
3597 function Flag79 (N : Node_Id) return Boolean is
3599 pragma Assert (Nkind (N) in N_Entity);
3600 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag79;
3603 function Flag80 (N : Node_Id) return Boolean is
3605 pragma Assert (Nkind (N) in N_Entity);
3606 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag80;
3609 function Flag81 (N : Node_Id) return Boolean is
3611 pragma Assert (Nkind (N) in N_Entity);
3612 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag81;
3615 function Flag82 (N : Node_Id) return Boolean is
3617 pragma Assert (Nkind (N) in N_Entity);
3618 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag82;
3621 function Flag83 (N : Node_Id) return Boolean is
3623 pragma Assert (Nkind (N) in N_Entity);
3624 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag83;
3627 function Flag84 (N : Node_Id) return Boolean is
3629 pragma Assert (Nkind (N) in N_Entity);
3630 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag84;
3633 function Flag85 (N : Node_Id) return Boolean is
3635 pragma Assert (Nkind (N) in N_Entity);
3636 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag85;
3639 function Flag86 (N : Node_Id) return Boolean is
3641 pragma Assert (Nkind (N) in N_Entity);
3642 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag86;
3645 function Flag87 (N : Node_Id) return Boolean is
3647 pragma Assert (Nkind (N) in N_Entity);
3648 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag87;
3651 function Flag88 (N : Node_Id) return Boolean is
3653 pragma Assert (Nkind (N) in N_Entity);
3654 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag88;
3657 function Flag89 (N : Node_Id) return Boolean is
3659 pragma Assert (Nkind (N) in N_Entity);
3660 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag89;
3663 function Flag90 (N : Node_Id) return Boolean is
3665 pragma Assert (Nkind (N) in N_Entity);
3666 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag90;
3669 function Flag91 (N : Node_Id) return Boolean is
3671 pragma Assert (Nkind (N) in N_Entity);
3672 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag91;
3675 function Flag92 (N : Node_Id) return Boolean is
3677 pragma Assert (Nkind (N) in N_Entity);
3678 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag92;
3681 function Flag93 (N : Node_Id) return Boolean is
3683 pragma Assert (Nkind (N) in N_Entity);
3684 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag93;
3687 function Flag94 (N : Node_Id) return Boolean is
3689 pragma Assert (Nkind (N) in N_Entity);
3690 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag94;
3693 function Flag95 (N : Node_Id) return Boolean is
3695 pragma Assert (Nkind (N) in N_Entity);
3696 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag95;
3699 function Flag96 (N : Node_Id) return Boolean is
3701 pragma Assert (Nkind (N) in N_Entity);
3702 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag96;
3705 function Flag97 (N : Node_Id) return Boolean is
3707 pragma Assert (Nkind (N) in N_Entity);
3708 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag97;
3711 function Flag98 (N : Node_Id) return Boolean is
3713 pragma Assert (Nkind (N) in N_Entity);
3714 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag98;
3717 function Flag99 (N : Node_Id) return Boolean is
3719 pragma Assert (Nkind (N) in N_Entity);
3720 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag99;
3723 function Flag100 (N : Node_Id) return Boolean is
3725 pragma Assert (Nkind (N) in N_Entity);
3726 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag100;
3729 function Flag101 (N : Node_Id) return Boolean is
3731 pragma Assert (Nkind (N) in N_Entity);
3732 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag101;
3735 function Flag102 (N : Node_Id) return Boolean is
3737 pragma Assert (Nkind (N) in N_Entity);
3738 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag102;
3741 function Flag103 (N : Node_Id) return Boolean is
3743 pragma Assert (Nkind (N) in N_Entity);
3744 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag103;
3747 function Flag104 (N : Node_Id) return Boolean is
3749 pragma Assert (Nkind (N) in N_Entity);
3750 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag104;
3753 function Flag105 (N : Node_Id) return Boolean is
3755 pragma Assert (Nkind (N) in N_Entity);
3756 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag105;
3759 function Flag106 (N : Node_Id) return Boolean is
3761 pragma Assert (Nkind (N) in N_Entity);
3762 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag106;
3765 function Flag107 (N : Node_Id) return Boolean is
3767 pragma Assert (Nkind (N) in N_Entity);
3768 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag107;
3771 function Flag108 (N : Node_Id) return Boolean is
3773 pragma Assert (Nkind (N) in N_Entity);
3774 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag108;
3777 function Flag109 (N : Node_Id) return Boolean is
3779 pragma Assert (Nkind (N) in N_Entity);
3780 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag109;
3783 function Flag110 (N : Node_Id) return Boolean is
3785 pragma Assert (Nkind (N) in N_Entity);
3786 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag110;
3789 function Flag111 (N : Node_Id) return Boolean is
3791 pragma Assert (Nkind (N) in N_Entity);
3792 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag111;
3795 function Flag112 (N : Node_Id) return Boolean is
3797 pragma Assert (Nkind (N) in N_Entity);
3798 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag112;
3801 function Flag113 (N : Node_Id) return Boolean is
3803 pragma Assert (Nkind (N) in N_Entity);
3804 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag113;
3807 function Flag114 (N : Node_Id) return Boolean is
3809 pragma Assert (Nkind (N) in N_Entity);
3810 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag114;
3813 function Flag115 (N : Node_Id) return Boolean is
3815 pragma Assert (Nkind (N) in N_Entity);
3816 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag115;
3819 function Flag116 (N : Node_Id) return Boolean is
3821 pragma Assert (Nkind (N) in N_Entity);
3822 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag116;
3825 function Flag117 (N : Node_Id) return Boolean is
3827 pragma Assert (Nkind (N) in N_Entity);
3828 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag117;
3831 function Flag118 (N : Node_Id) return Boolean is
3833 pragma Assert (Nkind (N) in N_Entity);
3834 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag118;
3837 function Flag119 (N : Node_Id) return Boolean is
3839 pragma Assert (Nkind (N) in N_Entity);
3840 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag119;
3843 function Flag120 (N : Node_Id) return Boolean is
3845 pragma Assert (Nkind (N) in N_Entity);
3846 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag120;
3849 function Flag121 (N : Node_Id) return Boolean is
3851 pragma Assert (Nkind (N) in N_Entity);
3852 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag121;
3855 function Flag122 (N : Node_Id) return Boolean is
3857 pragma Assert (Nkind (N) in N_Entity);
3858 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag122;
3861 function Flag123 (N : Node_Id) return Boolean is
3863 pragma Assert (Nkind (N) in N_Entity);
3864 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag123;
3867 function Flag124 (N : Node_Id) return Boolean is
3869 pragma Assert (Nkind (N) in N_Entity);
3870 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag124;
3873 function Flag125 (N : Node_Id) return Boolean is
3875 pragma Assert (Nkind (N) in N_Entity);
3876 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag125;
3879 function Flag126 (N : Node_Id) return Boolean is
3881 pragma Assert (Nkind (N) in N_Entity);
3882 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag126;
3885 function Flag127 (N : Node_Id) return Boolean is
3887 pragma Assert (Nkind (N) in N_Entity);
3888 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag127;
3891 function Flag128 (N : Node_Id) return Boolean is
3893 pragma Assert (Nkind (N) in N_Entity);
3894 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag128;
3897 function Flag129 (N : Node_Id) return Boolean is
3899 pragma Assert (Nkind (N) in N_Entity);
3900 return Nodes.Table (N + 3).In_List;
3903 function Flag130 (N : Node_Id) return Boolean is
3905 pragma Assert (Nkind (N) in N_Entity);
3906 return Nodes.Table (N + 3).Unused_1;
3909 function Flag131 (N : Node_Id) return Boolean is
3911 pragma Assert (Nkind (N) in N_Entity);
3912 return Nodes.Table (N + 3).Rewrite_Ins;
3915 function Flag132 (N : Node_Id) return Boolean is
3917 pragma Assert (Nkind (N) in N_Entity);
3918 return Nodes.Table (N + 3).Analyzed;
3921 function Flag133 (N : Node_Id) return Boolean is
3923 pragma Assert (Nkind (N) in N_Entity);
3924 return Nodes.Table (N + 3).Comes_From_Source;
3927 function Flag134 (N : Node_Id) return Boolean is
3929 pragma Assert (Nkind (N) in N_Entity);
3930 return Nodes.Table (N + 3).Error_Posted;
3933 function Flag135 (N : Node_Id) return Boolean is
3935 pragma Assert (Nkind (N) in N_Entity);
3936 return Nodes.Table (N + 3).Flag4;
3939 function Flag136 (N : Node_Id) return Boolean is
3941 pragma Assert (Nkind (N) in N_Entity);
3942 return Nodes.Table (N + 3).Flag5;
3945 function Flag137 (N : Node_Id) return Boolean is
3947 pragma Assert (Nkind (N) in N_Entity);
3948 return Nodes.Table (N + 3).Flag6;
3951 function Flag138 (N : Node_Id) return Boolean is
3953 pragma Assert (Nkind (N) in N_Entity);
3954 return Nodes.Table (N + 3).Flag7;
3957 function Flag139 (N : Node_Id) return Boolean is
3959 pragma Assert (Nkind (N) in N_Entity);
3960 return Nodes.Table (N + 3).Flag8;
3963 function Flag140 (N : Node_Id) return Boolean is
3965 pragma Assert (Nkind (N) in N_Entity);
3966 return Nodes.Table (N + 3).Flag9;
3969 function Flag141 (N : Node_Id) return Boolean is
3971 pragma Assert (Nkind (N) in N_Entity);
3972 return Nodes.Table (N + 3).Flag10;
3975 function Flag142 (N : Node_Id) return Boolean is
3977 pragma Assert (Nkind (N) in N_Entity);
3978 return Nodes.Table (N + 3).Flag11;
3981 function Flag143 (N : Node_Id) return Boolean is
3983 pragma Assert (Nkind (N) in N_Entity);
3984 return Nodes.Table (N + 3).Flag12;
3987 function Flag144 (N : Node_Id) return Boolean is
3989 pragma Assert (Nkind (N) in N_Entity);
3990 return Nodes.Table (N + 3).Flag13;
3993 function Flag145 (N : Node_Id) return Boolean is
3995 pragma Assert (Nkind (N) in N_Entity);
3996 return Nodes.Table (N + 3).Flag14;
3999 function Flag146 (N : Node_Id) return Boolean is
4001 pragma Assert (Nkind (N) in N_Entity);
4002 return Nodes.Table (N + 3).Flag15;
4005 function Flag147 (N : Node_Id) return Boolean is
4007 pragma Assert (Nkind (N) in N_Entity);
4008 return Nodes.Table (N + 3).Flag16;
4011 function Flag148 (N : Node_Id) return Boolean is
4013 pragma Assert (Nkind (N) in N_Entity);
4014 return Nodes.Table (N + 3).Flag17;
4017 function Flag149 (N : Node_Id) return Boolean is
4019 pragma Assert (Nkind (N) in N_Entity);
4020 return Nodes.Table (N + 3).Flag18;
4023 function Flag150 (N : Node_Id) return Boolean is
4025 pragma Assert (Nkind (N) in N_Entity);
4026 return Nodes.Table (N + 3).Pflag1;
4029 function Flag151 (N : Node_Id) return Boolean is
4031 pragma Assert (Nkind (N) in N_Entity);
4032 return Nodes.Table (N + 3).Pflag2;
4035 function Flag152 (N : Node_Id) return Boolean is
4037 pragma Assert (Nkind (N) in N_Entity);
4038 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag152;
4041 function Flag153 (N : Node_Id) return Boolean is
4043 pragma Assert (Nkind (N) in N_Entity);
4044 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag153;
4047 function Flag154 (N : Node_Id) return Boolean is
4049 pragma Assert (Nkind (N) in N_Entity);
4050 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag154;
4053 function Flag155 (N : Node_Id) return Boolean is
4055 pragma Assert (Nkind (N) in N_Entity);
4056 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag155;
4059 function Flag156 (N : Node_Id) return Boolean is
4061 pragma Assert (Nkind (N) in N_Entity);
4062 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag156;
4065 function Flag157 (N : Node_Id) return Boolean is
4067 pragma Assert (Nkind (N) in N_Entity);
4068 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag157;
4071 function Flag158 (N : Node_Id) return Boolean is
4073 pragma Assert (Nkind (N) in N_Entity);
4074 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag158;
4077 function Flag159 (N : Node_Id) return Boolean is
4079 pragma Assert (Nkind (N) in N_Entity);
4080 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag159;
4083 function Flag160 (N : Node_Id) return Boolean is
4085 pragma Assert (Nkind (N) in N_Entity);
4086 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag160;
4089 function Flag161 (N : Node_Id) return Boolean is
4091 pragma Assert (Nkind (N) in N_Entity);
4092 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag161;
4095 function Flag162 (N : Node_Id) return Boolean is
4097 pragma Assert (Nkind (N) in N_Entity);
4098 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag162;
4101 function Flag163 (N : Node_Id) return Boolean is
4103 pragma Assert (Nkind (N) in N_Entity);
4104 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag163;
4107 function Flag164 (N : Node_Id) return Boolean is
4109 pragma Assert (Nkind (N) in N_Entity);
4110 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag164;
4113 function Flag165 (N : Node_Id) return Boolean is
4115 pragma Assert (Nkind (N) in N_Entity);
4116 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag165;
4119 function Flag166 (N : Node_Id) return Boolean is
4121 pragma Assert (Nkind (N) in N_Entity);
4122 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag166;
4125 function Flag167 (N : Node_Id) return Boolean is
4127 pragma Assert (Nkind (N) in N_Entity);
4128 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag167;
4131 function Flag168 (N : Node_Id) return Boolean is
4133 pragma Assert (Nkind (N) in N_Entity);
4134 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag168;
4137 function Flag169 (N : Node_Id) return Boolean is
4139 pragma Assert (Nkind (N) in N_Entity);
4140 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag169;
4143 function Flag170 (N : Node_Id) return Boolean is
4145 pragma Assert (Nkind (N) in N_Entity);
4146 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag170;
4149 function Flag171 (N : Node_Id) return Boolean is
4151 pragma Assert (Nkind (N) in N_Entity);
4152 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag171;
4155 function Flag172 (N : Node_Id) return Boolean is
4157 pragma Assert (Nkind (N) in N_Entity);
4158 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag172;
4161 function Flag173 (N : Node_Id) return Boolean is
4163 pragma Assert (Nkind (N) in N_Entity);
4164 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag173;
4167 function Flag174 (N : Node_Id) return Boolean is
4169 pragma Assert (Nkind (N) in N_Entity);
4170 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag174;
4173 function Flag175 (N : Node_Id) return Boolean is
4175 pragma Assert (Nkind (N) in N_Entity);
4176 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag175;
4179 function Flag176 (N : Node_Id) return Boolean is
4181 pragma Assert (Nkind (N) in N_Entity);
4182 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag176;
4185 function Flag177 (N : Node_Id) return Boolean is
4187 pragma Assert (Nkind (N) in N_Entity);
4188 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag177;
4191 function Flag178 (N : Node_Id) return Boolean is
4193 pragma Assert (Nkind (N) in N_Entity);
4194 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag178;
4197 function Flag179 (N : Node_Id) return Boolean is
4199 pragma Assert (Nkind (N) in N_Entity);
4200 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag179;
4203 function Flag180 (N : Node_Id) return Boolean is
4205 pragma Assert (Nkind (N) in N_Entity);
4206 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag180;
4209 function Flag181 (N : Node_Id) return Boolean is
4211 pragma Assert (Nkind (N) in N_Entity);
4212 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag181;
4215 function Flag182 (N : Node_Id) return Boolean is
4217 pragma Assert (Nkind (N) in N_Entity);
4218 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag182;
4221 function Flag183 (N : Node_Id) return Boolean is
4223 pragma Assert (Nkind (N) in N_Entity);
4224 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag183;
4227 function Flag184 (N : Node_Id) return Boolean is
4229 pragma Assert (Nkind (N) in N_Entity);
4230 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag184;
4233 function Flag185 (N : Node_Id) return Boolean is
4235 pragma Assert (Nkind (N) in N_Entity);
4236 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag185;
4239 function Flag186 (N : Node_Id) return Boolean is
4241 pragma Assert (Nkind (N) in N_Entity);
4242 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag186;
4245 function Flag187 (N : Node_Id) return Boolean is
4247 pragma Assert (Nkind (N) in N_Entity);
4248 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag187;
4251 function Flag188 (N : Node_Id) return Boolean is
4253 pragma Assert (Nkind (N) in N_Entity);
4254 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag188;
4257 function Flag189 (N : Node_Id) return Boolean is
4259 pragma Assert (Nkind (N) in N_Entity);
4260 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag189;
4263 function Flag190 (N : Node_Id) return Boolean is
4265 pragma Assert (Nkind (N) in N_Entity);
4266 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag190;
4269 function Flag191 (N : Node_Id) return Boolean is
4271 pragma Assert (Nkind (N) in N_Entity);
4272 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag191;
4275 function Flag192 (N : Node_Id) return Boolean is
4277 pragma Assert (Nkind (N) in N_Entity);
4278 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag192;
4281 function Flag193 (N : Node_Id) return Boolean is
4283 pragma Assert (Nkind (N) in N_Entity);
4284 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag193;
4287 function Flag194 (N : Node_Id) return Boolean is
4289 pragma Assert (Nkind (N) in N_Entity);
4290 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag194;
4293 function Flag195 (N : Node_Id) return Boolean is
4295 pragma Assert (Nkind (N) in N_Entity);
4296 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag195;
4299 function Flag196 (N : Node_Id) return Boolean is
4301 pragma Assert (Nkind (N) in N_Entity);
4302 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag196;
4305 function Flag197 (N : Node_Id) return Boolean is
4307 pragma Assert (Nkind (N) in N_Entity);
4308 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag197;
4311 function Flag198 (N : Node_Id) return Boolean is
4313 pragma Assert (Nkind (N) in N_Entity);
4314 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag198;
4317 function Flag199 (N : Node_Id) return Boolean is
4319 pragma Assert (Nkind (N) in N_Entity);
4320 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag199;
4323 function Flag200 (N : Node_Id) return Boolean is
4325 pragma Assert (Nkind (N) in N_Entity);
4326 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag200;
4329 function Flag201 (N : Node_Id) return Boolean is
4331 pragma Assert (Nkind (N) in N_Entity);
4332 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag201;
4335 function Flag202 (N : Node_Id) return Boolean is
4337 pragma Assert (Nkind (N) in N_Entity);
4338 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag202;
4341 function Flag203 (N : Node_Id) return Boolean is
4343 pragma Assert (Nkind (N) in N_Entity);
4344 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag203;
4347 function Flag204 (N : Node_Id) return Boolean is
4349 pragma Assert (Nkind (N) in N_Entity);
4350 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag204;
4353 function Flag205 (N : Node_Id) return Boolean is
4355 pragma Assert (Nkind (N) in N_Entity);
4356 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag205;
4359 function Flag206 (N : Node_Id) return Boolean is
4361 pragma Assert (Nkind (N) in N_Entity);
4362 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag206;
4365 function Flag207 (N : Node_Id) return Boolean is
4367 pragma Assert (Nkind (N) in N_Entity);
4368 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag207;
4371 function Flag208 (N : Node_Id) return Boolean is
4373 pragma Assert (Nkind (N) in N_Entity);
4374 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag208;
4377 function Flag209 (N : Node_Id) return Boolean is
4379 pragma Assert (Nkind (N) in N_Entity);
4380 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag209;
4383 function Flag210 (N : Node_Id) return Boolean is
4385 pragma Assert (Nkind (N) in N_Entity);
4386 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag210;
4389 function Flag211 (N : Node_Id) return Boolean is
4391 pragma Assert (Nkind (N) in N_Entity);
4392 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag211;
4395 function Flag212 (N : Node_Id) return Boolean is
4397 pragma Assert (Nkind (N) in N_Entity);
4398 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag212;
4401 function Flag213 (N : Node_Id) return Boolean is
4403 pragma Assert (Nkind (N) in N_Entity);
4404 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag213;
4407 function Flag214 (N : Node_Id) return Boolean is
4409 pragma Assert (Nkind (N) in N_Entity);
4410 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag214;
4413 function Flag215 (N : Node_Id) return Boolean is
4415 pragma Assert (Nkind (N) in N_Entity);
4416 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag215;
4419 procedure Set_Nkind (N : Node_Id; Val : Node_Kind) is
4421 pragma Assert (N in Nodes.First .. Nodes.Last);
4422 Nodes.Table (N).Nkind := Val;
4425 procedure Set_Field1 (N : Node_Id; Val : Union_Id) is
4427 pragma Assert (N in Nodes.First .. Nodes.Last);
4428 Nodes.Table (N).Field1 := Val;
4431 procedure Set_Field2 (N : Node_Id; Val : Union_Id) is
4433 pragma Assert (N in Nodes.First .. Nodes.Last);
4434 Nodes.Table (N).Field2 := Val;
4437 procedure Set_Field3 (N : Node_Id; Val : Union_Id) is
4439 pragma Assert (N in Nodes.First .. Nodes.Last);
4440 Nodes.Table (N).Field3 := Val;
4443 procedure Set_Field4 (N : Node_Id; Val : Union_Id) is
4445 pragma Assert (N in Nodes.First .. Nodes.Last);
4446 Nodes.Table (N).Field4 := Val;
4449 procedure Set_Field5 (N : Node_Id; Val : Union_Id) is
4451 pragma Assert (N in Nodes.First .. Nodes.Last);
4452 Nodes.Table (N).Field5 := Val;
4455 procedure Set_Field6 (N : Node_Id; Val : Union_Id) is
4457 pragma Assert (Nkind (N) in N_Entity);
4458 Nodes.Table (N + 1).Field6 := Val;
4461 procedure Set_Field7 (N : Node_Id; Val : Union_Id) is
4463 pragma Assert (Nkind (N) in N_Entity);
4464 Nodes.Table (N + 1).Field7 := Val;
4467 procedure Set_Field8 (N : Node_Id; Val : Union_Id) is
4469 pragma Assert (Nkind (N) in N_Entity);
4470 Nodes.Table (N + 1).Field8 := Val;
4473 procedure Set_Field9 (N : Node_Id; Val : Union_Id) is
4475 pragma Assert (Nkind (N) in N_Entity);
4476 Nodes.Table (N + 1).Field9 := Val;
4479 procedure Set_Field10 (N : Node_Id; Val : Union_Id) is
4481 pragma Assert (Nkind (N) in N_Entity);
4482 Nodes.Table (N + 1).Field10 := Val;
4485 procedure Set_Field11 (N : Node_Id; Val : Union_Id) is
4487 pragma Assert (Nkind (N) in N_Entity);
4488 Nodes.Table (N + 1).Field11 := Val;
4491 procedure Set_Field12 (N : Node_Id; Val : Union_Id) is
4493 pragma Assert (Nkind (N) in N_Entity);
4494 Nodes.Table (N + 1).Field12 := Val;
4497 procedure Set_Field13 (N : Node_Id; Val : Union_Id) is
4499 pragma Assert (Nkind (N) in N_Entity);
4500 Nodes.Table (N + 2).Field6 := Val;
4503 procedure Set_Field14 (N : Node_Id; Val : Union_Id) is
4505 pragma Assert (Nkind (N) in N_Entity);
4506 Nodes.Table (N + 2).Field7 := Val;
4509 procedure Set_Field15 (N : Node_Id; Val : Union_Id) is
4511 pragma Assert (Nkind (N) in N_Entity);
4512 Nodes.Table (N + 2).Field8 := Val;
4515 procedure Set_Field16 (N : Node_Id; Val : Union_Id) is
4517 pragma Assert (Nkind (N) in N_Entity);
4518 Nodes.Table (N + 2).Field9 := Val;
4521 procedure Set_Field17 (N : Node_Id; Val : Union_Id) is
4523 pragma Assert (Nkind (N) in N_Entity);
4524 Nodes.Table (N + 2).Field10 := Val;
4527 procedure Set_Field18 (N : Node_Id; Val : Union_Id) is
4529 pragma Assert (Nkind (N) in N_Entity);
4530 Nodes.Table (N + 2).Field11 := Val;
4533 procedure Set_Field19 (N : Node_Id; Val : Union_Id) is
4535 pragma Assert (Nkind (N) in N_Entity);
4536 Nodes.Table (N + 3).Field6 := Val;
4539 procedure Set_Field20 (N : Node_Id; Val : Union_Id) is
4541 pragma Assert (Nkind (N) in N_Entity);
4542 Nodes.Table (N + 3).Field7 := Val;
4545 procedure Set_Field21 (N : Node_Id; Val : Union_Id) is
4547 pragma Assert (Nkind (N) in N_Entity);
4548 Nodes.Table (N + 3).Field8 := Val;
4551 procedure Set_Field22 (N : Node_Id; Val : Union_Id) is
4553 pragma Assert (Nkind (N) in N_Entity);
4554 Nodes.Table (N + 3).Field9 := Val;
4557 procedure Set_Field23 (N : Node_Id; Val : Union_Id) is
4559 pragma Assert (Nkind (N) in N_Entity);
4560 Nodes.Table (N + 3).Field10 := Val;
4563 procedure Set_Field24 (N : Node_Id; Val : Union_Id) is
4565 pragma Assert (Nkind (N) in N_Entity);
4566 Nodes.Table (N + 4).Field6 := Val;
4569 procedure Set_Field25 (N : Node_Id; Val : Union_Id) is
4571 pragma Assert (Nkind (N) in N_Entity);
4572 Nodes.Table (N + 4).Field7 := Val;
4575 procedure Set_Field26 (N : Node_Id; Val : Union_Id) is
4577 pragma Assert (Nkind (N) in N_Entity);
4578 Nodes.Table (N + 4).Field8 := Val;
4581 procedure Set_Field27 (N : Node_Id; Val : Union_Id) is
4583 pragma Assert (Nkind (N) in N_Entity);
4584 Nodes.Table (N + 4).Field9 := Val;
4587 procedure Set_Node1 (N : Node_Id; Val : Node_Id) is
4589 pragma Assert (N in Nodes.First .. Nodes.Last);
4590 Nodes.Table (N).Field1 := Union_Id (Val);
4593 procedure Set_Node2 (N : Node_Id; Val : Node_Id) is
4595 pragma Assert (N in Nodes.First .. Nodes.Last);
4596 Nodes.Table (N).Field2 := Union_Id (Val);
4599 procedure Set_Node3 (N : Node_Id; Val : Node_Id) is
4601 pragma Assert (N in Nodes.First .. Nodes.Last);
4602 Nodes.Table (N).Field3 := Union_Id (Val);
4605 procedure Set_Node4 (N : Node_Id; Val : Node_Id) is
4607 pragma Assert (N in Nodes.First .. Nodes.Last);
4608 Nodes.Table (N).Field4 := Union_Id (Val);
4611 procedure Set_Node5 (N : Node_Id; Val : Node_Id) is
4613 pragma Assert (N in Nodes.First .. Nodes.Last);
4614 Nodes.Table (N).Field5 := Union_Id (Val);
4617 procedure Set_Node6 (N : Node_Id; Val : Node_Id) is
4619 pragma Assert (Nkind (N) in N_Entity);
4620 Nodes.Table (N + 1).Field6 := Union_Id (Val);
4623 procedure Set_Node7 (N : Node_Id; Val : Node_Id) is
4625 pragma Assert (Nkind (N) in N_Entity);
4626 Nodes.Table (N + 1).Field7 := Union_Id (Val);
4629 procedure Set_Node8 (N : Node_Id; Val : Node_Id) is
4631 pragma Assert (Nkind (N) in N_Entity);
4632 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4635 procedure Set_Node9 (N : Node_Id; Val : Node_Id) is
4637 pragma Assert (Nkind (N) in N_Entity);
4638 Nodes.Table (N + 1).Field9 := Union_Id (Val);
4641 procedure Set_Node10 (N : Node_Id; Val : Node_Id) is
4643 pragma Assert (Nkind (N) in N_Entity);
4644 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4647 procedure Set_Node11 (N : Node_Id; Val : Node_Id) is
4649 pragma Assert (Nkind (N) in N_Entity);
4650 Nodes.Table (N + 1).Field11 := Union_Id (Val);
4653 procedure Set_Node12 (N : Node_Id; Val : Node_Id) is
4655 pragma Assert (Nkind (N) in N_Entity);
4656 Nodes.Table (N + 1).Field12 := Union_Id (Val);
4659 procedure Set_Node13 (N : Node_Id; Val : Node_Id) is
4661 pragma Assert (Nkind (N) in N_Entity);
4662 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4665 procedure Set_Node14 (N : Node_Id; Val : Node_Id) is
4667 pragma Assert (Nkind (N) in N_Entity);
4668 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4671 procedure Set_Node15 (N : Node_Id; Val : Node_Id) is
4673 pragma Assert (Nkind (N) in N_Entity);
4674 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4677 procedure Set_Node16 (N : Node_Id; Val : Node_Id) is
4679 pragma Assert (Nkind (N) in N_Entity);
4680 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4683 procedure Set_Node17 (N : Node_Id; Val : Node_Id) is
4685 pragma Assert (Nkind (N) in N_Entity);
4686 Nodes.Table (N + 2).Field10 := Union_Id (Val);
4689 procedure Set_Node18 (N : Node_Id; Val : Node_Id) is
4691 pragma Assert (Nkind (N) in N_Entity);
4692 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4695 procedure Set_Node19 (N : Node_Id; Val : Node_Id) is
4697 pragma Assert (Nkind (N) in N_Entity);
4698 Nodes.Table (N + 3).Field6 := Union_Id (Val);
4701 procedure Set_Node20 (N : Node_Id; Val : Node_Id) is
4703 pragma Assert (Nkind (N) in N_Entity);
4704 Nodes.Table (N + 3).Field7 := Union_Id (Val);
4707 procedure Set_Node21 (N : Node_Id; Val : Node_Id) is
4709 pragma Assert (Nkind (N) in N_Entity);
4710 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4713 procedure Set_Node22 (N : Node_Id; Val : Node_Id) is
4715 pragma Assert (Nkind (N) in N_Entity);
4716 Nodes.Table (N + 3).Field9 := Union_Id (Val);
4719 procedure Set_Node23 (N : Node_Id; Val : Node_Id) is
4721 pragma Assert (Nkind (N) in N_Entity);
4722 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4725 procedure Set_Node24 (N : Node_Id; Val : Node_Id) is
4727 pragma Assert (Nkind (N) in N_Entity);
4728 Nodes.Table (N + 4).Field6 := Union_Id (Val);
4731 procedure Set_Node25 (N : Node_Id; Val : Node_Id) is
4733 pragma Assert (Nkind (N) in N_Entity);
4734 Nodes.Table (N + 4).Field7 := Union_Id (Val);
4737 procedure Set_Node26 (N : Node_Id; Val : Node_Id) is
4739 pragma Assert (Nkind (N) in N_Entity);
4740 Nodes.Table (N + 4).Field8 := Union_Id (Val);
4743 procedure Set_Node27 (N : Node_Id; Val : Node_Id) is
4745 pragma Assert (Nkind (N) in N_Entity);
4746 Nodes.Table (N + 4).Field9 := Union_Id (Val);
4749 procedure Set_List1 (N : Node_Id; Val : List_Id) is
4751 pragma Assert (N in Nodes.First .. Nodes.Last);
4752 Nodes.Table (N).Field1 := Union_Id (Val);
4755 procedure Set_List2 (N : Node_Id; Val : List_Id) is
4757 pragma Assert (N in Nodes.First .. Nodes.Last);
4758 Nodes.Table (N).Field2 := Union_Id (Val);
4761 procedure Set_List3 (N : Node_Id; Val : List_Id) is
4763 pragma Assert (N in Nodes.First .. Nodes.Last);
4764 Nodes.Table (N).Field3 := Union_Id (Val);
4767 procedure Set_List4 (N : Node_Id; Val : List_Id) is
4769 pragma Assert (N in Nodes.First .. Nodes.Last);
4770 Nodes.Table (N).Field4 := Union_Id (Val);
4773 procedure Set_List5 (N : Node_Id; Val : List_Id) is
4775 pragma Assert (N in Nodes.First .. Nodes.Last);
4776 Nodes.Table (N).Field5 := Union_Id (Val);
4779 procedure Set_List10 (N : Node_Id; Val : List_Id) is
4781 pragma Assert (Nkind (N) in N_Entity);
4782 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4785 procedure Set_List14 (N : Node_Id; Val : List_Id) is
4787 pragma Assert (Nkind (N) in N_Entity);
4788 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4791 procedure Set_Elist2 (N : Node_Id; Val : Elist_Id) is
4793 Nodes.Table (N).Field2 := Union_Id (Val);
4796 procedure Set_Elist3 (N : Node_Id; Val : Elist_Id) is
4798 Nodes.Table (N).Field3 := Union_Id (Val);
4801 procedure Set_Elist4 (N : Node_Id; Val : Elist_Id) is
4803 Nodes.Table (N).Field4 := Union_Id (Val);
4806 procedure Set_Elist8 (N : Node_Id; Val : Elist_Id) is
4808 pragma Assert (Nkind (N) in N_Entity);
4809 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4812 procedure Set_Elist13 (N : Node_Id; Val : Elist_Id) is
4814 pragma Assert (Nkind (N) in N_Entity);
4815 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4818 procedure Set_Elist15 (N : Node_Id; Val : Elist_Id) is
4820 pragma Assert (Nkind (N) in N_Entity);
4821 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4824 procedure Set_Elist16 (N : Node_Id; Val : Elist_Id) is
4826 pragma Assert (Nkind (N) in N_Entity);
4827 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4830 procedure Set_Elist18 (N : Node_Id; Val : Elist_Id) is
4832 pragma Assert (Nkind (N) in N_Entity);
4833 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4836 procedure Set_Elist21 (N : Node_Id; Val : Elist_Id) is
4838 pragma Assert (Nkind (N) in N_Entity);
4839 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4842 procedure Set_Elist23 (N : Node_Id; Val : Elist_Id) is
4844 pragma Assert (Nkind (N) in N_Entity);
4845 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4848 procedure Set_Name1 (N : Node_Id; Val : Name_Id) is
4850 pragma Assert (N in Nodes.First .. Nodes.Last);
4851 Nodes.Table (N).Field1 := Union_Id (Val);
4854 procedure Set_Name2 (N : Node_Id; Val : Name_Id) is
4856 pragma Assert (N in Nodes.First .. Nodes.Last);
4857 Nodes.Table (N).Field2 := Union_Id (Val);
4860 procedure Set_Str3 (N : Node_Id; Val : String_Id) is
4862 pragma Assert (N in Nodes.First .. Nodes.Last);
4863 Nodes.Table (N).Field3 := Union_Id (Val);
4866 procedure Set_Uint2 (N : Node_Id; Val : Uint) is
4868 pragma Assert (N in Nodes.First .. Nodes.Last);
4869 Nodes.Table (N).Field2 := To_Union (Val);
4872 procedure Set_Uint3 (N : Node_Id; Val : Uint) is
4874 pragma Assert (N in Nodes.First .. Nodes.Last);
4875 Nodes.Table (N).Field3 := To_Union (Val);
4878 procedure Set_Uint4 (N : Node_Id; Val : Uint) is
4880 pragma Assert (N in Nodes.First .. Nodes.Last);
4881 Nodes.Table (N).Field4 := To_Union (Val);
4884 procedure Set_Uint5 (N : Node_Id; Val : Uint) is
4886 pragma Assert (N in Nodes.First .. Nodes.Last);
4887 Nodes.Table (N).Field5 := To_Union (Val);
4890 procedure Set_Uint8 (N : Node_Id; Val : Uint) is
4892 pragma Assert (Nkind (N) in N_Entity);
4893 Nodes.Table (N + 1).Field8 := To_Union (Val);
4896 procedure Set_Uint9 (N : Node_Id; Val : Uint) is
4898 pragma Assert (Nkind (N) in N_Entity);
4899 Nodes.Table (N + 1).Field9 := To_Union (Val);
4902 procedure Set_Uint10 (N : Node_Id; Val : Uint) is
4904 pragma Assert (Nkind (N) in N_Entity);
4905 Nodes.Table (N + 1).Field10 := To_Union (Val);
4908 procedure Set_Uint11 (N : Node_Id; Val : Uint) is
4910 pragma Assert (Nkind (N) in N_Entity);
4911 Nodes.Table (N + 1).Field11 := To_Union (Val);
4914 procedure Set_Uint12 (N : Node_Id; Val : Uint) is
4916 pragma Assert (Nkind (N) in N_Entity);
4917 Nodes.Table (N + 1).Field12 := To_Union (Val);
4920 procedure Set_Uint13 (N : Node_Id; Val : Uint) is
4922 pragma Assert (Nkind (N) in N_Entity);
4923 Nodes.Table (N + 2).Field6 := To_Union (Val);
4926 procedure Set_Uint14 (N : Node_Id; Val : Uint) is
4928 pragma Assert (Nkind (N) in N_Entity);
4929 Nodes.Table (N + 2).Field7 := To_Union (Val);
4932 procedure Set_Uint15 (N : Node_Id; Val : Uint) is
4934 pragma Assert (Nkind (N) in N_Entity);
4935 Nodes.Table (N + 2).Field8 := To_Union (Val);
4938 procedure Set_Uint16 (N : Node_Id; Val : Uint) is
4940 pragma Assert (Nkind (N) in N_Entity);
4941 Nodes.Table (N + 2).Field9 := To_Union (Val);
4944 procedure Set_Uint17 (N : Node_Id; Val : Uint) is
4946 pragma Assert (Nkind (N) in N_Entity);
4947 Nodes.Table (N + 2).Field10 := To_Union (Val);
4950 procedure Set_Uint22 (N : Node_Id; Val : Uint) is
4952 pragma Assert (Nkind (N) in N_Entity);
4953 Nodes.Table (N + 3).Field9 := To_Union (Val);
4956 procedure Set_Ureal3 (N : Node_Id; Val : Ureal) is
4958 pragma Assert (N in Nodes.First .. Nodes.Last);
4959 Nodes.Table (N).Field3 := To_Union (Val);
4962 procedure Set_Ureal18 (N : Node_Id; Val : Ureal) is
4964 pragma Assert (Nkind (N) in N_Entity);
4965 Nodes.Table (N + 2).Field11 := To_Union (Val);
4968 procedure Set_Ureal21 (N : Node_Id; Val : Ureal) is
4970 pragma Assert (Nkind (N) in N_Entity);
4971 Nodes.Table (N + 3).Field8 := To_Union (Val);
4974 procedure Set_Flag4 (N : Node_Id; Val : Boolean) is
4976 pragma Assert (N in Nodes.First .. Nodes.Last);
4977 Nodes.Table (N).Flag4 := Val;
4980 procedure Set_Flag5 (N : Node_Id; Val : Boolean) is
4982 pragma Assert (N in Nodes.First .. Nodes.Last);
4983 Nodes.Table (N).Flag5 := Val;
4986 procedure Set_Flag6 (N : Node_Id; Val : Boolean) is
4988 pragma Assert (N in Nodes.First .. Nodes.Last);
4989 Nodes.Table (N).Flag6 := Val;
4992 procedure Set_Flag7 (N : Node_Id; Val : Boolean) is
4994 pragma Assert (N in Nodes.First .. Nodes.Last);
4995 Nodes.Table (N).Flag7 := Val;
4998 procedure Set_Flag8 (N : Node_Id; Val : Boolean) is
5000 pragma Assert (N in Nodes.First .. Nodes.Last);
5001 Nodes.Table (N).Flag8 := Val;
5004 procedure Set_Flag9 (N : Node_Id; Val : Boolean) is
5006 pragma Assert (N in Nodes.First .. Nodes.Last);
5007 Nodes.Table (N).Flag9 := Val;
5010 procedure Set_Flag10 (N : Node_Id; Val : Boolean) is
5012 pragma Assert (N in Nodes.First .. Nodes.Last);
5013 Nodes.Table (N).Flag10 := Val;
5016 procedure Set_Flag11 (N : Node_Id; Val : Boolean) is
5018 pragma Assert (N in Nodes.First .. Nodes.Last);
5019 Nodes.Table (N).Flag11 := Val;
5022 procedure Set_Flag12 (N : Node_Id; Val : Boolean) is
5024 pragma Assert (N in Nodes.First .. Nodes.Last);
5025 Nodes.Table (N).Flag12 := Val;
5028 procedure Set_Flag13 (N : Node_Id; Val : Boolean) is
5030 pragma Assert (N in Nodes.First .. Nodes.Last);
5031 Nodes.Table (N).Flag13 := Val;
5034 procedure Set_Flag14 (N : Node_Id; Val : Boolean) is
5036 pragma Assert (N in Nodes.First .. Nodes.Last);
5037 Nodes.Table (N).Flag14 := Val;
5040 procedure Set_Flag15 (N : Node_Id; Val : Boolean) is
5042 pragma Assert (N in Nodes.First .. Nodes.Last);
5043 Nodes.Table (N).Flag15 := Val;
5046 procedure Set_Flag16 (N : Node_Id; Val : Boolean) is
5048 pragma Assert (N in Nodes.First .. Nodes.Last);
5049 Nodes.Table (N).Flag16 := Val;
5052 procedure Set_Flag17 (N : Node_Id; Val : Boolean) is
5054 pragma Assert (N in Nodes.First .. Nodes.Last);
5055 Nodes.Table (N).Flag17 := Val;
5058 procedure Set_Flag18 (N : Node_Id; Val : Boolean) is
5060 pragma Assert (N in Nodes.First .. Nodes.Last);
5061 Nodes.Table (N).Flag18 := Val;
5064 procedure Set_Flag19 (N : Node_Id; Val : Boolean) is
5066 pragma Assert (Nkind (N) in N_Entity);
5067 Nodes.Table (N + 1).In_List := Val;
5070 procedure Set_Flag20 (N : Node_Id; Val : Boolean) is
5072 pragma Assert (Nkind (N) in N_Entity);
5073 Nodes.Table (N + 1).Unused_1 := Val;
5076 procedure Set_Flag21 (N : Node_Id; Val : Boolean) is
5078 pragma Assert (Nkind (N) in N_Entity);
5079 Nodes.Table (N + 1).Rewrite_Ins := Val;
5082 procedure Set_Flag22 (N : Node_Id; Val : Boolean) is
5084 pragma Assert (Nkind (N) in N_Entity);
5085 Nodes.Table (N + 1).Analyzed := Val;
5088 procedure Set_Flag23 (N : Node_Id; Val : Boolean) is
5090 pragma Assert (Nkind (N) in N_Entity);
5091 Nodes.Table (N + 1).Comes_From_Source := Val;
5094 procedure Set_Flag24 (N : Node_Id; Val : Boolean) is
5096 pragma Assert (Nkind (N) in N_Entity);
5097 Nodes.Table (N + 1).Error_Posted := Val;
5100 procedure Set_Flag25 (N : Node_Id; Val : Boolean) is
5102 pragma Assert (Nkind (N) in N_Entity);
5103 Nodes.Table (N + 1).Flag4 := Val;
5106 procedure Set_Flag26 (N : Node_Id; Val : Boolean) is
5108 pragma Assert (Nkind (N) in N_Entity);
5109 Nodes.Table (N + 1).Flag5 := Val;
5112 procedure Set_Flag27 (N : Node_Id; Val : Boolean) is
5114 pragma Assert (Nkind (N) in N_Entity);
5115 Nodes.Table (N + 1).Flag6 := Val;
5118 procedure Set_Flag28 (N : Node_Id; Val : Boolean) is
5120 pragma Assert (Nkind (N) in N_Entity);
5121 Nodes.Table (N + 1).Flag7 := Val;
5124 procedure Set_Flag29 (N : Node_Id; Val : Boolean) is
5126 pragma Assert (Nkind (N) in N_Entity);
5127 Nodes.Table (N + 1).Flag8 := Val;
5130 procedure Set_Flag30 (N : Node_Id; Val : Boolean) is
5132 pragma Assert (Nkind (N) in N_Entity);
5133 Nodes.Table (N + 1).Flag9 := Val;
5136 procedure Set_Flag31 (N : Node_Id; Val : Boolean) is
5138 pragma Assert (Nkind (N) in N_Entity);
5139 Nodes.Table (N + 1).Flag10 := Val;
5142 procedure Set_Flag32 (N : Node_Id; Val : Boolean) is
5144 pragma Assert (Nkind (N) in N_Entity);
5145 Nodes.Table (N + 1).Flag11 := Val;
5148 procedure Set_Flag33 (N : Node_Id; Val : Boolean) is
5150 pragma Assert (Nkind (N) in N_Entity);
5151 Nodes.Table (N + 1).Flag12 := Val;
5154 procedure Set_Flag34 (N : Node_Id; Val : Boolean) is
5156 pragma Assert (Nkind (N) in N_Entity);
5157 Nodes.Table (N + 1).Flag13 := Val;
5160 procedure Set_Flag35 (N : Node_Id; Val : Boolean) is
5162 pragma Assert (Nkind (N) in N_Entity);
5163 Nodes.Table (N + 1).Flag14 := Val;
5166 procedure Set_Flag36 (N : Node_Id; Val : Boolean) is
5168 pragma Assert (Nkind (N) in N_Entity);
5169 Nodes.Table (N + 1).Flag15 := Val;
5172 procedure Set_Flag37 (N : Node_Id; Val : Boolean) is
5174 pragma Assert (Nkind (N) in N_Entity);
5175 Nodes.Table (N + 1).Flag16 := Val;
5178 procedure Set_Flag38 (N : Node_Id; Val : Boolean) is
5180 pragma Assert (Nkind (N) in N_Entity);
5181 Nodes.Table (N + 1).Flag17 := Val;
5184 procedure Set_Flag39 (N : Node_Id; Val : Boolean) is
5186 pragma Assert (Nkind (N) in N_Entity);
5187 Nodes.Table (N + 1).Flag18 := Val;
5190 procedure Set_Flag40 (N : Node_Id; Val : Boolean) is
5192 pragma Assert (Nkind (N) in N_Entity);
5193 Nodes.Table (N + 2).In_List := Val;
5196 procedure Set_Flag41 (N : Node_Id; Val : Boolean) is
5198 pragma Assert (Nkind (N) in N_Entity);
5199 Nodes.Table (N + 2).Unused_1 := Val;
5202 procedure Set_Flag42 (N : Node_Id; Val : Boolean) is
5204 pragma Assert (Nkind (N) in N_Entity);
5205 Nodes.Table (N + 2).Rewrite_Ins := Val;
5208 procedure Set_Flag43 (N : Node_Id; Val : Boolean) is
5210 pragma Assert (Nkind (N) in N_Entity);
5211 Nodes.Table (N + 2).Analyzed := Val;
5214 procedure Set_Flag44 (N : Node_Id; Val : Boolean) is
5216 pragma Assert (Nkind (N) in N_Entity);
5217 Nodes.Table (N + 2).Comes_From_Source := Val;
5220 procedure Set_Flag45 (N : Node_Id; Val : Boolean) is
5222 pragma Assert (Nkind (N) in N_Entity);
5223 Nodes.Table (N + 2).Error_Posted := Val;
5226 procedure Set_Flag46 (N : Node_Id; Val : Boolean) is
5228 pragma Assert (Nkind (N) in N_Entity);
5229 Nodes.Table (N + 2).Flag4 := Val;
5232 procedure Set_Flag47 (N : Node_Id; Val : Boolean) is
5234 pragma Assert (Nkind (N) in N_Entity);
5235 Nodes.Table (N + 2).Flag5 := Val;
5238 procedure Set_Flag48 (N : Node_Id; Val : Boolean) is
5240 pragma Assert (Nkind (N) in N_Entity);
5241 Nodes.Table (N + 2).Flag6 := Val;
5244 procedure Set_Flag49 (N : Node_Id; Val : Boolean) is
5246 pragma Assert (Nkind (N) in N_Entity);
5247 Nodes.Table (N + 2).Flag7 := Val;
5250 procedure Set_Flag50 (N : Node_Id; Val : Boolean) is
5252 pragma Assert (Nkind (N) in N_Entity);
5253 Nodes.Table (N + 2).Flag8 := Val;
5256 procedure Set_Flag51 (N : Node_Id; Val : Boolean) is
5258 pragma Assert (Nkind (N) in N_Entity);
5259 Nodes.Table (N + 2).Flag9 := Val;
5262 procedure Set_Flag52 (N : Node_Id; Val : Boolean) is
5264 pragma Assert (Nkind (N) in N_Entity);
5265 Nodes.Table (N + 2).Flag10 := Val;
5268 procedure Set_Flag53 (N : Node_Id; Val : Boolean) is
5270 pragma Assert (Nkind (N) in N_Entity);
5271 Nodes.Table (N + 2).Flag11 := Val;
5274 procedure Set_Flag54 (N : Node_Id; Val : Boolean) is
5276 pragma Assert (Nkind (N) in N_Entity);
5277 Nodes.Table (N + 2).Flag12 := Val;
5280 procedure Set_Flag55 (N : Node_Id; Val : Boolean) is
5282 pragma Assert (Nkind (N) in N_Entity);
5283 Nodes.Table (N + 2).Flag13 := Val;
5286 procedure Set_Flag56 (N : Node_Id; Val : Boolean) is
5288 pragma Assert (Nkind (N) in N_Entity);
5289 Nodes.Table (N + 2).Flag14 := Val;
5292 procedure Set_Flag57 (N : Node_Id; Val : Boolean) is
5294 pragma Assert (Nkind (N) in N_Entity);
5295 Nodes.Table (N + 2).Flag15 := Val;
5298 procedure Set_Flag58 (N : Node_Id; Val : Boolean) is
5300 pragma Assert (Nkind (N) in N_Entity);
5301 Nodes.Table (N + 2).Flag16 := Val;
5304 procedure Set_Flag59 (N : Node_Id; Val : Boolean) is
5306 pragma Assert (Nkind (N) in N_Entity);
5307 Nodes.Table (N + 2).Flag17 := Val;
5310 procedure Set_Flag60 (N : Node_Id; Val : Boolean) is
5312 pragma Assert (Nkind (N) in N_Entity);
5313 Nodes.Table (N + 2).Flag18 := Val;
5316 procedure Set_Flag61 (N : Node_Id; Val : Boolean) is
5318 pragma Assert (Nkind (N) in N_Entity);
5319 Nodes.Table (N + 1).Pflag1 := Val;
5322 procedure Set_Flag62 (N : Node_Id; Val : Boolean) is
5324 pragma Assert (Nkind (N) in N_Entity);
5325 Nodes.Table (N + 1).Pflag2 := Val;
5328 procedure Set_Flag63 (N : Node_Id; Val : Boolean) is
5330 pragma Assert (Nkind (N) in N_Entity);
5331 Nodes.Table (N + 2).Pflag1 := Val;
5334 procedure Set_Flag64 (N : Node_Id; Val : Boolean) is
5336 pragma Assert (Nkind (N) in N_Entity);
5337 Nodes.Table (N + 2).Pflag2 := Val;
5340 procedure Set_Flag65 (N : Node_Id; Val : Boolean) is
5342 pragma Assert (Nkind (N) in N_Entity);
5345 (Nodes
.Table
(N
+ 2).Nkind
'Unrestricted_Access)).Flag65
:= Val
;
5348 procedure Set_Flag66
(N
: Node_Id
; Val
: Boolean) is
5350 pragma Assert
(Nkind
(N
) in N_Entity
);
5353 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag66 := Val;
5356 procedure Set_Flag67 (N : Node_Id; Val : Boolean) is
5358 pragma Assert (Nkind (N) in N_Entity);
5361 (Nodes
.Table
(N
+ 2).Nkind
'Unrestricted_Access)).Flag67
:= Val
;
5364 procedure Set_Flag68
(N
: Node_Id
; Val
: Boolean) is
5366 pragma Assert
(Nkind
(N
) in N_Entity
);
5369 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag68 := Val;
5372 procedure Set_Flag69 (N : Node_Id; Val : Boolean) is
5374 pragma Assert (Nkind (N) in N_Entity);
5377 (Nodes
.Table
(N
+ 2).Nkind
'Unrestricted_Access)).Flag69
:= Val
;
5380 procedure Set_Flag70
(N
: Node_Id
; Val
: Boolean) is
5382 pragma Assert
(Nkind
(N
) in N_Entity
);
5385 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag70 := Val;
5388 procedure Set_Flag71 (N : Node_Id; Val : Boolean) is
5390 pragma Assert (Nkind (N) in N_Entity);
5393 (Nodes
.Table
(N
+ 2).Nkind
'Unrestricted_Access)).Flag71
:= Val
;
5396 procedure Set_Flag72
(N
: Node_Id
; Val
: Boolean) is
5398 pragma Assert
(Nkind
(N
) in N_Entity
);
5401 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag72 := Val;
5404 procedure Set_Flag73 (N : Node_Id; Val : Boolean) is
5406 pragma Assert (Nkind (N) in N_Entity);
5409 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag73
:= Val
;
5412 procedure Set_Flag74
(N
: Node_Id
; Val
: Boolean) is
5414 pragma Assert
(Nkind
(N
) in N_Entity
);
5417 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag74 := Val;
5420 procedure Set_Flag75 (N : Node_Id; Val : Boolean) is
5422 pragma Assert (Nkind (N) in N_Entity);
5425 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag75
:= Val
;
5428 procedure Set_Flag76
(N
: Node_Id
; Val
: Boolean) is
5430 pragma Assert
(Nkind
(N
) in N_Entity
);
5433 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag76 := Val;
5436 procedure Set_Flag77 (N : Node_Id; Val : Boolean) is
5438 pragma Assert (Nkind (N) in N_Entity);
5441 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag77
:= Val
;
5444 procedure Set_Flag78
(N
: Node_Id
; Val
: Boolean) is
5446 pragma Assert
(Nkind
(N
) in N_Entity
);
5449 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag78 := Val;
5452 procedure Set_Flag79 (N : Node_Id; Val : Boolean) is
5454 pragma Assert (Nkind (N) in N_Entity);
5457 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag79
:= Val
;
5460 procedure Set_Flag80
(N
: Node_Id
; Val
: Boolean) is
5462 pragma Assert
(Nkind
(N
) in N_Entity
);
5465 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag80 := Val;
5468 procedure Set_Flag81 (N : Node_Id; Val : Boolean) is
5470 pragma Assert (Nkind (N) in N_Entity);
5473 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag81
:= Val
;
5476 procedure Set_Flag82
(N
: Node_Id
; Val
: Boolean) is
5478 pragma Assert
(Nkind
(N
) in N_Entity
);
5481 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag82 := Val;
5484 procedure Set_Flag83 (N : Node_Id; Val : Boolean) is
5486 pragma Assert (Nkind (N) in N_Entity);
5489 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag83
:= Val
;
5492 procedure Set_Flag84
(N
: Node_Id
; Val
: Boolean) is
5494 pragma Assert
(Nkind
(N
) in N_Entity
);
5497 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag84 := Val;
5500 procedure Set_Flag85 (N : Node_Id; Val : Boolean) is
5502 pragma Assert (Nkind (N) in N_Entity);
5505 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag85
:= Val
;
5508 procedure Set_Flag86
(N
: Node_Id
; Val
: Boolean) is
5510 pragma Assert
(Nkind
(N
) in N_Entity
);
5513 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag86 := Val;
5516 procedure Set_Flag87 (N : Node_Id; Val : Boolean) is
5518 pragma Assert (Nkind (N) in N_Entity);
5521 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag87
:= Val
;
5524 procedure Set_Flag88
(N
: Node_Id
; Val
: Boolean) is
5526 pragma Assert
(Nkind
(N
) in N_Entity
);
5529 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag88 := Val;
5532 procedure Set_Flag89 (N : Node_Id; Val : Boolean) is
5534 pragma Assert (Nkind (N) in N_Entity);
5537 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag89
:= Val
;
5540 procedure Set_Flag90
(N
: Node_Id
; Val
: Boolean) is
5542 pragma Assert
(Nkind
(N
) in N_Entity
);
5545 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag90 := Val;
5548 procedure Set_Flag91 (N : Node_Id; Val : Boolean) is
5550 pragma Assert (Nkind (N) in N_Entity);
5553 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag91
:= Val
;
5556 procedure Set_Flag92
(N
: Node_Id
; Val
: Boolean) is
5558 pragma Assert
(Nkind
(N
) in N_Entity
);
5561 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag92 := Val;
5564 procedure Set_Flag93 (N : Node_Id; Val : Boolean) is
5566 pragma Assert (Nkind (N) in N_Entity);
5569 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag93
:= Val
;
5572 procedure Set_Flag94
(N
: Node_Id
; Val
: Boolean) is
5574 pragma Assert
(Nkind
(N
) in N_Entity
);
5577 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag94 := Val;
5580 procedure Set_Flag95 (N : Node_Id; Val : Boolean) is
5582 pragma Assert (Nkind (N) in N_Entity);
5585 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag95
:= Val
;
5588 procedure Set_Flag96
(N
: Node_Id
; Val
: Boolean) is
5590 pragma Assert
(Nkind
(N
) in N_Entity
);
5593 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag96 := Val;
5596 procedure Set_Flag97 (N : Node_Id; Val : Boolean) is
5598 pragma Assert (Nkind (N) in N_Entity);
5601 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag97
:= Val
;
5604 procedure Set_Flag98
(N
: Node_Id
; Val
: Boolean) is
5606 pragma Assert
(Nkind
(N
) in N_Entity
);
5609 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag98 := Val;
5612 procedure Set_Flag99 (N : Node_Id; Val : Boolean) is
5614 pragma Assert (Nkind (N) in N_Entity);
5617 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag99
:= Val
;
5620 procedure Set_Flag100
(N
: Node_Id
; Val
: Boolean) is
5622 pragma Assert
(Nkind
(N
) in N_Entity
);
5625 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag100 := Val;
5628 procedure Set_Flag101 (N : Node_Id; Val : Boolean) is
5630 pragma Assert (Nkind (N) in N_Entity);
5633 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag101
:= Val
;
5636 procedure Set_Flag102
(N
: Node_Id
; Val
: Boolean) is
5638 pragma Assert
(Nkind
(N
) in N_Entity
);
5641 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag102 := Val;
5644 procedure Set_Flag103 (N : Node_Id; Val : Boolean) is
5646 pragma Assert (Nkind (N) in N_Entity);
5649 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag103
:= Val
;
5652 procedure Set_Flag104
(N
: Node_Id
; Val
: Boolean) is
5654 pragma Assert
(Nkind
(N
) in N_Entity
);
5657 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag104 := Val;
5660 procedure Set_Flag105 (N : Node_Id; Val : Boolean) is
5662 pragma Assert (Nkind (N) in N_Entity);
5665 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag105
:= Val
;
5668 procedure Set_Flag106
(N
: Node_Id
; Val
: Boolean) is
5670 pragma Assert
(Nkind
(N
) in N_Entity
);
5673 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag106 := Val;
5676 procedure Set_Flag107 (N : Node_Id; Val : Boolean) is
5678 pragma Assert (Nkind (N) in N_Entity);
5681 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag107
:= Val
;
5684 procedure Set_Flag108
(N
: Node_Id
; Val
: Boolean) is
5686 pragma Assert
(Nkind
(N
) in N_Entity
);
5689 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag108 := Val;
5692 procedure Set_Flag109 (N : Node_Id; Val : Boolean) is
5694 pragma Assert (Nkind (N) in N_Entity);
5697 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag109
:= Val
;
5700 procedure Set_Flag110
(N
: Node_Id
; Val
: Boolean) is
5702 pragma Assert
(Nkind
(N
) in N_Entity
);
5705 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag110 := Val;
5708 procedure Set_Flag111 (N : Node_Id; Val : Boolean) is
5710 pragma Assert (Nkind (N) in N_Entity);
5713 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag111
:= Val
;
5716 procedure Set_Flag112
(N
: Node_Id
; Val
: Boolean) is
5718 pragma Assert
(Nkind
(N
) in N_Entity
);
5721 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag112 := Val;
5724 procedure Set_Flag113 (N : Node_Id; Val : Boolean) is
5726 pragma Assert (Nkind (N) in N_Entity);
5729 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag113
:= Val
;
5732 procedure Set_Flag114
(N
: Node_Id
; Val
: Boolean) is
5734 pragma Assert
(Nkind
(N
) in N_Entity
);
5737 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag114 := Val;
5740 procedure Set_Flag115 (N : Node_Id; Val : Boolean) is
5742 pragma Assert (Nkind (N) in N_Entity);
5745 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag115
:= Val
;
5748 procedure Set_Flag116
(N
: Node_Id
; Val
: Boolean) is
5750 pragma Assert
(Nkind
(N
) in N_Entity
);
5753 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag116 := Val;
5756 procedure Set_Flag117 (N : Node_Id; Val : Boolean) is
5758 pragma Assert (Nkind (N) in N_Entity);
5761 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag117
:= Val
;
5764 procedure Set_Flag118
(N
: Node_Id
; Val
: Boolean) is
5766 pragma Assert
(Nkind
(N
) in N_Entity
);
5769 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag118 := Val;
5772 procedure Set_Flag119 (N : Node_Id; Val : Boolean) is
5774 pragma Assert (Nkind (N) in N_Entity);
5777 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag119
:= Val
;
5780 procedure Set_Flag120
(N
: Node_Id
; Val
: Boolean) is
5782 pragma Assert
(Nkind
(N
) in N_Entity
);
5785 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag120 := Val;
5788 procedure Set_Flag121 (N : Node_Id; Val : Boolean) is
5790 pragma Assert (Nkind (N) in N_Entity);
5793 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag121
:= Val
;
5796 procedure Set_Flag122
(N
: Node_Id
; Val
: Boolean) is
5798 pragma Assert
(Nkind
(N
) in N_Entity
);
5801 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag122 := Val;
5804 procedure Set_Flag123 (N : Node_Id; Val : Boolean) is
5806 pragma Assert (Nkind (N) in N_Entity);
5809 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag123
:= Val
;
5812 procedure Set_Flag124
(N
: Node_Id
; Val
: Boolean) is
5814 pragma Assert
(Nkind
(N
) in N_Entity
);
5817 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag124 := Val;
5820 procedure Set_Flag125 (N : Node_Id; Val : Boolean) is
5822 pragma Assert (Nkind (N) in N_Entity);
5825 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag125
:= Val
;
5828 procedure Set_Flag126
(N
: Node_Id
; Val
: Boolean) is
5830 pragma Assert
(Nkind
(N
) in N_Entity
);
5833 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag126 := Val;
5836 procedure Set_Flag127 (N : Node_Id; Val : Boolean) is
5838 pragma Assert (Nkind (N) in N_Entity);
5841 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag127
:= Val
;
5844 procedure Set_Flag128
(N
: Node_Id
; Val
: Boolean) is
5846 pragma Assert
(Nkind
(N
) in N_Entity
);
5849 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag128 := Val;
5852 procedure Set_Flag129 (N : Node_Id; Val : Boolean) is
5854 pragma Assert (Nkind (N) in N_Entity);
5855 Nodes.Table (N + 3).In_List := Val;
5858 procedure Set_Flag130 (N : Node_Id; Val : Boolean) is
5860 pragma Assert (Nkind (N) in N_Entity);
5861 Nodes.Table (N + 3).Unused_1 := Val;
5864 procedure Set_Flag131 (N : Node_Id; Val : Boolean) is
5866 pragma Assert (Nkind (N) in N_Entity);
5867 Nodes.Table (N + 3).Rewrite_Ins := Val;
5870 procedure Set_Flag132 (N : Node_Id; Val : Boolean) is
5872 pragma Assert (Nkind (N) in N_Entity);
5873 Nodes.Table (N + 3).Analyzed := Val;
5876 procedure Set_Flag133 (N : Node_Id; Val : Boolean) is
5878 pragma Assert (Nkind (N) in N_Entity);
5879 Nodes.Table (N + 3).Comes_From_Source := Val;
5882 procedure Set_Flag134 (N : Node_Id; Val : Boolean) is
5884 pragma Assert (Nkind (N) in N_Entity);
5885 Nodes.Table (N + 3).Error_Posted := Val;
5888 procedure Set_Flag135 (N : Node_Id; Val : Boolean) is
5890 pragma Assert (Nkind (N) in N_Entity);
5891 Nodes.Table (N + 3).Flag4 := Val;
5894 procedure Set_Flag136 (N : Node_Id; Val : Boolean) is
5896 pragma Assert (Nkind (N) in N_Entity);
5897 Nodes.Table (N + 3).Flag5 := Val;
5900 procedure Set_Flag137 (N : Node_Id; Val : Boolean) is
5902 pragma Assert (Nkind (N) in N_Entity);
5903 Nodes.Table (N + 3).Flag6 := Val;
5906 procedure Set_Flag138 (N : Node_Id; Val : Boolean) is
5908 pragma Assert (Nkind (N) in N_Entity);
5909 Nodes.Table (N + 3).Flag7 := Val;
5912 procedure Set_Flag139 (N : Node_Id; Val : Boolean) is
5914 pragma Assert (Nkind (N) in N_Entity);
5915 Nodes.Table (N + 3).Flag8 := Val;
5918 procedure Set_Flag140 (N : Node_Id; Val : Boolean) is
5920 pragma Assert (Nkind (N) in N_Entity);
5921 Nodes.Table (N + 3).Flag9 := Val;
5924 procedure Set_Flag141 (N : Node_Id; Val : Boolean) is
5926 pragma Assert (Nkind (N) in N_Entity);
5927 Nodes.Table (N + 3).Flag10 := Val;
5930 procedure Set_Flag142 (N : Node_Id; Val : Boolean) is
5932 pragma Assert (Nkind (N) in N_Entity);
5933 Nodes.Table (N + 3).Flag11 := Val;
5936 procedure Set_Flag143 (N : Node_Id; Val : Boolean) is
5938 pragma Assert (Nkind (N) in N_Entity);
5939 Nodes.Table (N + 3).Flag12 := Val;
5942 procedure Set_Flag144 (N : Node_Id; Val : Boolean) is
5944 pragma Assert (Nkind (N) in N_Entity);
5945 Nodes.Table (N + 3).Flag13 := Val;
5948 procedure Set_Flag145 (N : Node_Id; Val : Boolean) is
5950 pragma Assert (Nkind (N) in N_Entity);
5951 Nodes.Table (N + 3).Flag14 := Val;
5954 procedure Set_Flag146 (N : Node_Id; Val : Boolean) is
5956 pragma Assert (Nkind (N) in N_Entity);
5957 Nodes.Table (N + 3).Flag15 := Val;
5960 procedure Set_Flag147 (N : Node_Id; Val : Boolean) is
5962 pragma Assert (Nkind (N) in N_Entity);
5963 Nodes.Table (N + 3).Flag16 := Val;
5966 procedure Set_Flag148 (N : Node_Id; Val : Boolean) is
5968 pragma Assert (Nkind (N) in N_Entity);
5969 Nodes.Table (N + 3).Flag17 := Val;
5972 procedure Set_Flag149 (N : Node_Id; Val : Boolean) is
5974 pragma Assert (Nkind (N) in N_Entity);
5975 Nodes.Table (N + 3).Flag18 := Val;
5978 procedure Set_Flag150 (N : Node_Id; Val : Boolean) is
5980 pragma Assert (Nkind (N) in N_Entity);
5981 Nodes.Table (N + 3).Pflag1 := Val;
5984 procedure Set_Flag151 (N : Node_Id; Val : Boolean) is
5986 pragma Assert (Nkind (N) in N_Entity);
5987 Nodes.Table (N + 3).Pflag2 := Val;
5990 procedure Set_Flag152 (N : Node_Id; Val : Boolean) is
5992 pragma Assert (Nkind (N) in N_Entity);
5995 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag152
:= Val
;
5998 procedure Set_Flag153
(N
: Node_Id
; Val
: Boolean) is
6000 pragma Assert
(Nkind
(N
) in N_Entity
);
6003 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag153 := Val;
6006 procedure Set_Flag154 (N : Node_Id; Val : Boolean) is
6008 pragma Assert (Nkind (N) in N_Entity);
6011 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag154
:= Val
;
6014 procedure Set_Flag155
(N
: Node_Id
; Val
: Boolean) is
6016 pragma Assert
(Nkind
(N
) in N_Entity
);
6019 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag155 := Val;
6022 procedure Set_Flag156 (N : Node_Id; Val : Boolean) is
6024 pragma Assert (Nkind (N) in N_Entity);
6027 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag156
:= Val
;
6030 procedure Set_Flag157
(N
: Node_Id
; Val
: Boolean) is
6032 pragma Assert
(Nkind
(N
) in N_Entity
);
6035 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag157 := Val;
6038 procedure Set_Flag158 (N : Node_Id; Val : Boolean) is
6040 pragma Assert (Nkind (N) in N_Entity);
6043 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag158
:= Val
;
6046 procedure Set_Flag159
(N
: Node_Id
; Val
: Boolean) is
6048 pragma Assert
(Nkind
(N
) in N_Entity
);
6051 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag159 := Val;
6054 procedure Set_Flag160 (N : Node_Id; Val : Boolean) is
6056 pragma Assert (Nkind (N) in N_Entity);
6059 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag160
:= Val
;
6062 procedure Set_Flag161
(N
: Node_Id
; Val
: Boolean) is
6064 pragma Assert
(Nkind
(N
) in N_Entity
);
6067 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag161 := Val;
6070 procedure Set_Flag162 (N : Node_Id; Val : Boolean) is
6072 pragma Assert (Nkind (N) in N_Entity);
6075 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag162
:= Val
;
6078 procedure Set_Flag163
(N
: Node_Id
; Val
: Boolean) is
6080 pragma Assert
(Nkind
(N
) in N_Entity
);
6083 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag163 := Val;
6086 procedure Set_Flag164 (N : Node_Id; Val : Boolean) is
6088 pragma Assert (Nkind (N) in N_Entity);
6091 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag164
:= Val
;
6094 procedure Set_Flag165
(N
: Node_Id
; Val
: Boolean) is
6096 pragma Assert
(Nkind
(N
) in N_Entity
);
6099 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag165 := Val;
6102 procedure Set_Flag166 (N : Node_Id; Val : Boolean) is
6104 pragma Assert (Nkind (N) in N_Entity);
6107 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag166
:= Val
;
6110 procedure Set_Flag167
(N
: Node_Id
; Val
: Boolean) is
6112 pragma Assert
(Nkind
(N
) in N_Entity
);
6115 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag167 := Val;
6118 procedure Set_Flag168 (N : Node_Id; Val : Boolean) is
6120 pragma Assert (Nkind (N) in N_Entity);
6123 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag168
:= Val
;
6126 procedure Set_Flag169
(N
: Node_Id
; Val
: Boolean) is
6128 pragma Assert
(Nkind
(N
) in N_Entity
);
6131 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag169 := Val;
6134 procedure Set_Flag170 (N : Node_Id; Val : Boolean) is
6136 pragma Assert (Nkind (N) in N_Entity);
6139 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag170
:= Val
;
6142 procedure Set_Flag171
(N
: Node_Id
; Val
: Boolean) is
6144 pragma Assert
(Nkind
(N
) in N_Entity
);
6147 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag171 := Val;
6150 procedure Set_Flag172 (N : Node_Id; Val : Boolean) is
6152 pragma Assert (Nkind (N) in N_Entity);
6155 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag172
:= Val
;
6158 procedure Set_Flag173
(N
: Node_Id
; Val
: Boolean) is
6160 pragma Assert
(Nkind
(N
) in N_Entity
);
6163 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag173 := Val;
6166 procedure Set_Flag174 (N : Node_Id; Val : Boolean) is
6168 pragma Assert (Nkind (N) in N_Entity);
6171 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag174
:= Val
;
6174 procedure Set_Flag175
(N
: Node_Id
; Val
: Boolean) is
6176 pragma Assert
(Nkind
(N
) in N_Entity
);
6179 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag175 := Val;
6182 procedure Set_Flag176 (N : Node_Id; Val : Boolean) is
6184 pragma Assert (Nkind (N) in N_Entity);
6187 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag176
:= Val
;
6190 procedure Set_Flag177
(N
: Node_Id
; Val
: Boolean) is
6192 pragma Assert
(Nkind
(N
) in N_Entity
);
6195 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag177 := Val;
6198 procedure Set_Flag178 (N : Node_Id; Val : Boolean) is
6200 pragma Assert (Nkind (N) in N_Entity);
6203 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag178
:= Val
;
6206 procedure Set_Flag179
(N
: Node_Id
; Val
: Boolean) is
6208 pragma Assert
(Nkind
(N
) in N_Entity
);
6211 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag179 := Val;
6214 procedure Set_Flag180 (N : Node_Id; Val : Boolean) is
6216 pragma Assert (Nkind (N) in N_Entity);
6219 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag180
:= Val
;
6222 procedure Set_Flag181
(N
: Node_Id
; Val
: Boolean) is
6224 pragma Assert
(Nkind
(N
) in N_Entity
);
6227 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag181 := Val;
6230 procedure Set_Flag182 (N : Node_Id; Val : Boolean) is
6232 pragma Assert (Nkind (N) in N_Entity);
6235 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag182
:= Val
;
6238 procedure Set_Flag183
(N
: Node_Id
; Val
: Boolean) is
6240 pragma Assert
(Nkind
(N
) in N_Entity
);
6243 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag183 := Val;
6246 procedure Set_Flag184 (N : Node_Id; Val : Boolean) is
6248 pragma Assert (Nkind (N) in N_Entity);
6251 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag184
:= Val
;
6254 procedure Set_Flag185
(N
: Node_Id
; Val
: Boolean) is
6256 pragma Assert
(Nkind
(N
) in N_Entity
);
6259 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag185 := Val;
6262 procedure Set_Flag186 (N : Node_Id; Val : Boolean) is
6264 pragma Assert (Nkind (N) in N_Entity);
6267 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag186
:= Val
;
6270 procedure Set_Flag187
(N
: Node_Id
; Val
: Boolean) is
6272 pragma Assert
(Nkind
(N
) in N_Entity
);
6275 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag187 := Val;
6278 procedure Set_Flag188 (N : Node_Id; Val : Boolean) is
6280 pragma Assert (Nkind (N) in N_Entity);
6283 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag188
:= Val
;
6286 procedure Set_Flag189
(N
: Node_Id
; Val
: Boolean) is
6288 pragma Assert
(Nkind
(N
) in N_Entity
);
6291 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag189 := Val;
6294 procedure Set_Flag190 (N : Node_Id; Val : Boolean) is
6296 pragma Assert (Nkind (N) in N_Entity);
6299 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag190
:= Val
;
6302 procedure Set_Flag191
(N
: Node_Id
; Val
: Boolean) is
6304 pragma Assert
(Nkind
(N
) in N_Entity
);
6307 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag191 := Val;
6310 procedure Set_Flag192 (N : Node_Id; Val : Boolean) is
6312 pragma Assert (Nkind (N) in N_Entity);
6315 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag192
:= Val
;
6318 procedure Set_Flag193
(N
: Node_Id
; Val
: Boolean) is
6320 pragma Assert
(Nkind
(N
) in N_Entity
);
6323 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag193 := Val;
6326 procedure Set_Flag194 (N : Node_Id; Val : Boolean) is
6328 pragma Assert (Nkind (N) in N_Entity);
6331 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag194
:= Val
;
6334 procedure Set_Flag195
(N
: Node_Id
; Val
: Boolean) is
6336 pragma Assert
(Nkind
(N
) in N_Entity
);
6339 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag195 := Val;
6342 procedure Set_Flag196 (N : Node_Id; Val : Boolean) is
6344 pragma Assert (Nkind (N) in N_Entity);
6347 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag196
:= Val
;
6350 procedure Set_Flag197
(N
: Node_Id
; Val
: Boolean) is
6352 pragma Assert
(Nkind
(N
) in N_Entity
);
6355 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag197 := Val;
6358 procedure Set_Flag198 (N : Node_Id; Val : Boolean) is
6360 pragma Assert (Nkind (N) in N_Entity);
6363 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag198
:= Val
;
6366 procedure Set_Flag199
(N
: Node_Id
; Val
: Boolean) is
6368 pragma Assert
(Nkind
(N
) in N_Entity
);
6371 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag199 := Val;
6374 procedure Set_Flag200 (N : Node_Id; Val : Boolean) is
6376 pragma Assert (Nkind (N) in N_Entity);
6379 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag200
:= Val
;
6382 procedure Set_Flag201
(N
: Node_Id
; Val
: Boolean) is
6384 pragma Assert
(Nkind
(N
) in N_Entity
);
6387 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag201 := Val;
6390 procedure Set_Flag202 (N : Node_Id; Val : Boolean) is
6392 pragma Assert (Nkind (N) in N_Entity);
6395 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag202
:= Val
;
6398 procedure Set_Flag203
(N
: Node_Id
; Val
: Boolean) is
6400 pragma Assert
(Nkind
(N
) in N_Entity
);
6403 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag203 := Val;
6406 procedure Set_Flag204 (N : Node_Id; Val : Boolean) is
6408 pragma Assert (Nkind (N) in N_Entity);
6411 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag204
:= Val
;
6414 procedure Set_Flag205
(N
: Node_Id
; Val
: Boolean) is
6416 pragma Assert
(Nkind
(N
) in N_Entity
);
6419 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag205 := Val;
6422 procedure Set_Flag206 (N : Node_Id; Val : Boolean) is
6424 pragma Assert (Nkind (N) in N_Entity);
6427 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag206
:= Val
;
6430 procedure Set_Flag207
(N
: Node_Id
; Val
: Boolean) is
6432 pragma Assert
(Nkind
(N
) in N_Entity
);
6435 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag207 := Val;
6438 procedure Set_Flag208 (N : Node_Id; Val : Boolean) is
6440 pragma Assert (Nkind (N) in N_Entity);
6443 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag208
:= Val
;
6446 procedure Set_Flag209
(N
: Node_Id
; Val
: Boolean) is
6448 pragma Assert
(Nkind
(N
) in N_Entity
);
6451 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag209 := Val;
6454 procedure Set_Flag210 (N : Node_Id; Val : Boolean) is
6456 pragma Assert (Nkind (N) in N_Entity);
6459 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag210
:= Val
;
6462 procedure Set_Flag211
(N
: Node_Id
; Val
: Boolean) is
6464 pragma Assert
(Nkind
(N
) in N_Entity
);
6467 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag211 := Val;
6470 procedure Set_Flag212 (N : Node_Id; Val : Boolean) is
6472 pragma Assert (Nkind (N) in N_Entity);
6475 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag212
:= Val
;
6478 procedure Set_Flag213
(N
: Node_Id
; Val
: Boolean) is
6480 pragma Assert
(Nkind
(N
) in N_Entity
);
6483 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag213 := Val;
6486 procedure Set_Flag214 (N : Node_Id; Val : Boolean) is
6488 pragma Assert (Nkind (N) in N_Entity);
6491 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag214
:= Val
;
6494 procedure Set_Flag215
(N
: Node_Id
; Val
: Boolean) is
6496 pragma Assert
(Nkind
(N
) in N_Entity
);
6499 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag215 := Val;
6502 procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id) is
6504 pragma Assert (N in Nodes.First .. Nodes.Last);
6505 if Val > Error then Set_Parent (Val, N); end if;
6507 end Set_Node1_With_Parent;
6509 procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id) is
6511 pragma Assert (N in Nodes.First .. Nodes.Last);
6512 if Val > Error then Set_Parent (Val, N); end if;
6514 end Set_Node2_With_Parent;
6516 procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id) is
6518 pragma Assert (N in Nodes.First .. Nodes.Last);
6519 if Val > Error then Set_Parent (Val, N); end if;
6521 end Set_Node3_With_Parent;
6523 procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id) is
6525 pragma Assert (N in Nodes.First .. Nodes.Last);
6526 if Val > Error then Set_Parent (Val, N); end if;
6528 end Set_Node4_With_Parent;
6530 procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id) is
6532 pragma Assert (N in Nodes.First .. Nodes.Last);
6533 if Val > Error then Set_Parent (Val, N); end if;
6535 end Set_Node5_With_Parent;
6537 procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id) is
6539 pragma Assert (N in Nodes.First .. Nodes.Last);
6540 if Val /= No_List and then Val /= Error_List then
6541 Set_Parent (Val, N);
6544 end Set_List1_With_Parent;
6546 procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id) is
6548 pragma Assert (N in Nodes.First .. Nodes.Last);
6549 if Val /= No_List and then Val /= Error_List then
6550 Set_Parent (Val, N);
6553 end Set_List2_With_Parent;
6555 procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id) is
6557 pragma Assert (N in Nodes.First .. Nodes.Last);
6558 if Val /= No_List and then Val /= Error_List then
6559 Set_Parent (Val, N);
6562 end Set_List3_With_Parent;
6564 procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id) is
6566 pragma Assert (N in Nodes.First .. Nodes.Last);
6567 if Val /= No_List and then Val /= Error_List then
6568 Set_Parent (Val, N);
6571 end Set_List4_With_Parent;
6573 procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id) is
6575 pragma Assert (N in Nodes.First .. Nodes.Last);
6576 if Val /= No_List and then Val /= Error_List then
6577 Set_Parent (Val, N);
6580 end Set_List5_With_Parent;
6582 end Unchecked_Access;