1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2004, 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 -- Field12 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 Char_Code2 (N : Node_Id) return Char_Code is
2965 pragma Assert (N in Nodes.First .. Nodes.Last);
2966 return Char_Code (Nodes.Table (N).Field2 - Char_Code_Bias);
2969 function Uint3 (N : Node_Id) return Uint is
2970 pragma Assert (N in Nodes.First .. Nodes.Last);
2971 U : constant Union_Id := Nodes.Table (N).Field3;
2976 return From_Union (U);
2980 function Uint4 (N : Node_Id) return Uint is
2981 pragma Assert (N in Nodes.First .. Nodes.Last);
2982 U : constant Union_Id := Nodes.Table (N).Field4;
2987 return From_Union (U);
2991 function Uint5 (N : Node_Id) return Uint is
2992 pragma Assert (N in Nodes.First .. Nodes.Last);
2993 U : constant Union_Id := Nodes.Table (N).Field5;
2998 return From_Union (U);
3002 function Uint8 (N : Node_Id) return Uint is
3003 pragma Assert (Nkind (N) in N_Entity);
3004 U : constant Union_Id := Nodes.Table (N + 1).Field8;
3010 return From_Union (U);
3014 function Uint9 (N : Node_Id) return Uint is
3015 pragma Assert (Nkind (N) in N_Entity);
3016 U : constant Union_Id := Nodes.Table (N + 1).Field9;
3021 return From_Union (U);
3025 function Uint10 (N : Node_Id) return Uint is
3026 pragma Assert (Nkind (N) in N_Entity);
3027 U : constant Union_Id := Nodes.Table (N + 1).Field10;
3032 return From_Union (U);
3036 function Uint11 (N : Node_Id) return Uint is
3037 pragma Assert (Nkind (N) in N_Entity);
3038 U : constant Union_Id := Nodes.Table (N + 1).Field11;
3043 return From_Union (U);
3047 function Uint12 (N : Node_Id) return Uint is
3048 pragma Assert (Nkind (N) in N_Entity);
3049 U : constant Union_Id := Nodes.Table (N + 1).Field12;
3054 return From_Union (U);
3058 function Uint13 (N : Node_Id) return Uint is
3059 pragma Assert (Nkind (N) in N_Entity);
3060 U : constant Union_Id := Nodes.Table (N + 2).Field6;
3065 return From_Union (U);
3069 function Uint14 (N : Node_Id) return Uint is
3070 pragma Assert (Nkind (N) in N_Entity);
3071 U : constant Union_Id := Nodes.Table (N + 2).Field7;
3076 return From_Union (U);
3080 function Uint15 (N : Node_Id) return Uint is
3081 pragma Assert (Nkind (N) in N_Entity);
3082 U : constant Union_Id := Nodes.Table (N + 2).Field8;
3087 return From_Union (U);
3091 function Uint16 (N : Node_Id) return Uint is
3092 pragma Assert (Nkind (N) in N_Entity);
3093 U : constant Union_Id := Nodes.Table (N + 2).Field9;
3098 return From_Union (U);
3102 function Uint17 (N : Node_Id) return Uint is
3103 pragma Assert (Nkind (N) in N_Entity);
3104 U : constant Union_Id := Nodes.Table (N + 2).Field10;
3109 return From_Union (U);
3113 function Uint22 (N : Node_Id) return Uint is
3114 pragma Assert (Nkind (N) in N_Entity);
3115 U : constant Union_Id := Nodes.Table (N + 3).Field9;
3120 return From_Union (U);
3124 function Ureal3 (N : Node_Id) return Ureal is
3126 pragma Assert (N in Nodes.First .. Nodes.Last);
3127 return From_Union (Nodes.Table (N).Field3);
3130 function Ureal18 (N : Node_Id) return Ureal is
3132 pragma Assert (Nkind (N) in N_Entity);
3133 return From_Union (Nodes.Table (N + 2).Field11);
3136 function Ureal21 (N : Node_Id) return Ureal is
3138 pragma Assert (Nkind (N) in N_Entity);
3139 return From_Union (Nodes.Table (N + 3).Field8);
3142 function Flag4 (N : Node_Id) return Boolean is
3144 pragma Assert (N in Nodes.First .. Nodes.Last);
3145 return Nodes.Table (N).Flag4;
3148 function Flag5 (N : Node_Id) return Boolean is
3150 pragma Assert (N in Nodes.First .. Nodes.Last);
3151 return Nodes.Table (N).Flag5;
3154 function Flag6 (N : Node_Id) return Boolean is
3156 pragma Assert (N in Nodes.First .. Nodes.Last);
3157 return Nodes.Table (N).Flag6;
3160 function Flag7 (N : Node_Id) return Boolean is
3162 pragma Assert (N in Nodes.First .. Nodes.Last);
3163 return Nodes.Table (N).Flag7;
3166 function Flag8 (N : Node_Id) return Boolean is
3168 pragma Assert (N in Nodes.First .. Nodes.Last);
3169 return Nodes.Table (N).Flag8;
3172 function Flag9 (N : Node_Id) return Boolean is
3174 pragma Assert (N in Nodes.First .. Nodes.Last);
3175 return Nodes.Table (N).Flag9;
3178 function Flag10 (N : Node_Id) return Boolean is
3180 pragma Assert (N in Nodes.First .. Nodes.Last);
3181 return Nodes.Table (N).Flag10;
3184 function Flag11 (N : Node_Id) return Boolean is
3186 pragma Assert (N in Nodes.First .. Nodes.Last);
3187 return Nodes.Table (N).Flag11;
3190 function Flag12 (N : Node_Id) return Boolean is
3192 pragma Assert (N in Nodes.First .. Nodes.Last);
3193 return Nodes.Table (N).Flag12;
3196 function Flag13 (N : Node_Id) return Boolean is
3198 pragma Assert (N in Nodes.First .. Nodes.Last);
3199 return Nodes.Table (N).Flag13;
3202 function Flag14 (N : Node_Id) return Boolean is
3204 pragma Assert (N in Nodes.First .. Nodes.Last);
3205 return Nodes.Table (N).Flag14;
3208 function Flag15 (N : Node_Id) return Boolean is
3210 pragma Assert (N in Nodes.First .. Nodes.Last);
3211 return Nodes.Table (N).Flag15;
3214 function Flag16 (N : Node_Id) return Boolean is
3216 pragma Assert (N in Nodes.First .. Nodes.Last);
3217 return Nodes.Table (N).Flag16;
3220 function Flag17 (N : Node_Id) return Boolean is
3222 pragma Assert (N in Nodes.First .. Nodes.Last);
3223 return Nodes.Table (N).Flag17;
3226 function Flag18 (N : Node_Id) return Boolean is
3228 pragma Assert (N in Nodes.First .. Nodes.Last);
3229 return Nodes.Table (N).Flag18;
3232 function Flag19 (N : Node_Id) return Boolean is
3234 pragma Assert (Nkind (N) in N_Entity);
3235 return Nodes.Table (N + 1).In_List;
3238 function Flag20 (N : Node_Id) return Boolean is
3240 pragma Assert (Nkind (N) in N_Entity);
3241 return Nodes.Table (N + 1).Unused_1;
3244 function Flag21 (N : Node_Id) return Boolean is
3246 pragma Assert (Nkind (N) in N_Entity);
3247 return Nodes.Table (N + 1).Rewrite_Ins;
3250 function Flag22 (N : Node_Id) return Boolean is
3252 pragma Assert (Nkind (N) in N_Entity);
3253 return Nodes.Table (N + 1).Analyzed;
3256 function Flag23 (N : Node_Id) return Boolean is
3258 pragma Assert (Nkind (N) in N_Entity);
3259 return Nodes.Table (N + 1).Comes_From_Source;
3262 function Flag24 (N : Node_Id) return Boolean is
3264 pragma Assert (Nkind (N) in N_Entity);
3265 return Nodes.Table (N + 1).Error_Posted;
3268 function Flag25 (N : Node_Id) return Boolean is
3270 pragma Assert (Nkind (N) in N_Entity);
3271 return Nodes.Table (N + 1).Flag4;
3274 function Flag26 (N : Node_Id) return Boolean is
3276 pragma Assert (Nkind (N) in N_Entity);
3277 return Nodes.Table (N + 1).Flag5;
3280 function Flag27 (N : Node_Id) return Boolean is
3282 pragma Assert (Nkind (N) in N_Entity);
3283 return Nodes.Table (N + 1).Flag6;
3286 function Flag28 (N : Node_Id) return Boolean is
3288 pragma Assert (Nkind (N) in N_Entity);
3289 return Nodes.Table (N + 1).Flag7;
3292 function Flag29 (N : Node_Id) return Boolean is
3294 pragma Assert (Nkind (N) in N_Entity);
3295 return Nodes.Table (N + 1).Flag8;
3298 function Flag30 (N : Node_Id) return Boolean is
3300 pragma Assert (Nkind (N) in N_Entity);
3301 return Nodes.Table (N + 1).Flag9;
3304 function Flag31 (N : Node_Id) return Boolean is
3306 pragma Assert (Nkind (N) in N_Entity);
3307 return Nodes.Table (N + 1).Flag10;
3310 function Flag32 (N : Node_Id) return Boolean is
3312 pragma Assert (Nkind (N) in N_Entity);
3313 return Nodes.Table (N + 1).Flag11;
3316 function Flag33 (N : Node_Id) return Boolean is
3318 pragma Assert (Nkind (N) in N_Entity);
3319 return Nodes.Table (N + 1).Flag12;
3322 function Flag34 (N : Node_Id) return Boolean is
3324 pragma Assert (Nkind (N) in N_Entity);
3325 return Nodes.Table (N + 1).Flag13;
3328 function Flag35 (N : Node_Id) return Boolean is
3330 pragma Assert (Nkind (N) in N_Entity);
3331 return Nodes.Table (N + 1).Flag14;
3334 function Flag36 (N : Node_Id) return Boolean is
3336 pragma Assert (Nkind (N) in N_Entity);
3337 return Nodes.Table (N + 1).Flag15;
3340 function Flag37 (N : Node_Id) return Boolean is
3342 pragma Assert (Nkind (N) in N_Entity);
3343 return Nodes.Table (N + 1).Flag16;
3346 function Flag38 (N : Node_Id) return Boolean is
3348 pragma Assert (Nkind (N) in N_Entity);
3349 return Nodes.Table (N + 1).Flag17;
3352 function Flag39 (N : Node_Id) return Boolean is
3354 pragma Assert (Nkind (N) in N_Entity);
3355 return Nodes.Table (N + 1).Flag18;
3358 function Flag40 (N : Node_Id) return Boolean is
3360 pragma Assert (Nkind (N) in N_Entity);
3361 return Nodes.Table (N + 2).In_List;
3364 function Flag41 (N : Node_Id) return Boolean is
3366 pragma Assert (Nkind (N) in N_Entity);
3367 return Nodes.Table (N + 2).Unused_1;
3370 function Flag42 (N : Node_Id) return Boolean is
3372 pragma Assert (Nkind (N) in N_Entity);
3373 return Nodes.Table (N + 2).Rewrite_Ins;
3376 function Flag43 (N : Node_Id) return Boolean is
3378 pragma Assert (Nkind (N) in N_Entity);
3379 return Nodes.Table (N + 2).Analyzed;
3382 function Flag44 (N : Node_Id) return Boolean is
3384 pragma Assert (Nkind (N) in N_Entity);
3385 return Nodes.Table (N + 2).Comes_From_Source;
3388 function Flag45 (N : Node_Id) return Boolean is
3390 pragma Assert (Nkind (N) in N_Entity);
3391 return Nodes.Table (N + 2).Error_Posted;
3394 function Flag46 (N : Node_Id) return Boolean is
3396 pragma Assert (Nkind (N) in N_Entity);
3397 return Nodes.Table (N + 2).Flag4;
3400 function Flag47 (N : Node_Id) return Boolean is
3402 pragma Assert (Nkind (N) in N_Entity);
3403 return Nodes.Table (N + 2).Flag5;
3406 function Flag48 (N : Node_Id) return Boolean is
3408 pragma Assert (Nkind (N) in N_Entity);
3409 return Nodes.Table (N + 2).Flag6;
3412 function Flag49 (N : Node_Id) return Boolean is
3414 pragma Assert (Nkind (N) in N_Entity);
3415 return Nodes.Table (N + 2).Flag7;
3418 function Flag50 (N : Node_Id) return Boolean is
3420 pragma Assert (Nkind (N) in N_Entity);
3421 return Nodes.Table (N + 2).Flag8;
3424 function Flag51 (N : Node_Id) return Boolean is
3426 pragma Assert (Nkind (N) in N_Entity);
3427 return Nodes.Table (N + 2).Flag9;
3430 function Flag52 (N : Node_Id) return Boolean is
3432 pragma Assert (Nkind (N) in N_Entity);
3433 return Nodes.Table (N + 2).Flag10;
3436 function Flag53 (N : Node_Id) return Boolean is
3438 pragma Assert (Nkind (N) in N_Entity);
3439 return Nodes.Table (N + 2).Flag11;
3442 function Flag54 (N : Node_Id) return Boolean is
3444 pragma Assert (Nkind (N) in N_Entity);
3445 return Nodes.Table (N + 2).Flag12;
3448 function Flag55 (N : Node_Id) return Boolean is
3450 pragma Assert (Nkind (N) in N_Entity);
3451 return Nodes.Table (N + 2).Flag13;
3454 function Flag56 (N : Node_Id) return Boolean is
3456 pragma Assert (Nkind (N) in N_Entity);
3457 return Nodes.Table (N + 2).Flag14;
3460 function Flag57 (N : Node_Id) return Boolean is
3462 pragma Assert (Nkind (N) in N_Entity);
3463 return Nodes.Table (N + 2).Flag15;
3466 function Flag58 (N : Node_Id) return Boolean is
3468 pragma Assert (Nkind (N) in N_Entity);
3469 return Nodes.Table (N + 2).Flag16;
3472 function Flag59 (N : Node_Id) return Boolean is
3474 pragma Assert (Nkind (N) in N_Entity);
3475 return Nodes.Table (N + 2).Flag17;
3478 function Flag60 (N : Node_Id) return Boolean is
3480 pragma Assert (Nkind (N) in N_Entity);
3481 return Nodes.Table (N + 2).Flag18;
3484 function Flag61 (N : Node_Id) return Boolean is
3486 pragma Assert (Nkind (N) in N_Entity);
3487 return Nodes.Table (N + 1).Pflag1;
3490 function Flag62 (N : Node_Id) return Boolean is
3492 pragma Assert (Nkind (N) in N_Entity);
3493 return Nodes.Table (N + 1).Pflag2;
3496 function Flag63 (N : Node_Id) return Boolean is
3498 pragma Assert (Nkind (N) in N_Entity);
3499 return Nodes.Table (N + 2).Pflag1;
3502 function Flag64 (N : Node_Id) return Boolean is
3504 pragma Assert (Nkind (N) in N_Entity);
3505 return Nodes.Table (N + 2).Pflag2;
3508 function Flag65 (N : Node_Id) return Boolean is
3510 pragma Assert (Nkind (N) in N_Entity);
3511 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag65;
3514 function Flag66 (N : Node_Id) return Boolean is
3516 pragma Assert (Nkind (N) in N_Entity);
3517 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag66;
3520 function Flag67 (N : Node_Id) return Boolean is
3522 pragma Assert (Nkind (N) in N_Entity);
3523 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag67;
3526 function Flag68 (N : Node_Id) return Boolean is
3528 pragma Assert (Nkind (N) in N_Entity);
3529 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag68;
3532 function Flag69 (N : Node_Id) return Boolean is
3534 pragma Assert (Nkind (N) in N_Entity);
3535 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag69;
3538 function Flag70 (N : Node_Id) return Boolean is
3540 pragma Assert (Nkind (N) in N_Entity);
3541 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag70;
3544 function Flag71 (N : Node_Id) return Boolean is
3546 pragma Assert (Nkind (N) in N_Entity);
3547 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag71;
3550 function Flag72 (N : Node_Id) return Boolean is
3552 pragma Assert (Nkind (N) in N_Entity);
3553 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag72;
3556 function Flag73 (N : Node_Id) return Boolean is
3558 pragma Assert (Nkind (N) in N_Entity);
3559 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag73;
3562 function Flag74 (N : Node_Id) return Boolean is
3564 pragma Assert (Nkind (N) in N_Entity);
3565 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag74;
3568 function Flag75 (N : Node_Id) return Boolean is
3570 pragma Assert (Nkind (N) in N_Entity);
3571 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag75;
3574 function Flag76 (N : Node_Id) return Boolean is
3576 pragma Assert (Nkind (N) in N_Entity);
3577 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag76;
3580 function Flag77 (N : Node_Id) return Boolean is
3582 pragma Assert (Nkind (N) in N_Entity);
3583 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag77;
3586 function Flag78 (N : Node_Id) return Boolean is
3588 pragma Assert (Nkind (N) in N_Entity);
3589 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag78;
3592 function Flag79 (N : Node_Id) return Boolean is
3594 pragma Assert (Nkind (N) in N_Entity);
3595 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag79;
3598 function Flag80 (N : Node_Id) return Boolean is
3600 pragma Assert (Nkind (N) in N_Entity);
3601 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag80;
3604 function Flag81 (N : Node_Id) return Boolean is
3606 pragma Assert (Nkind (N) in N_Entity);
3607 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag81;
3610 function Flag82 (N : Node_Id) return Boolean is
3612 pragma Assert (Nkind (N) in N_Entity);
3613 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag82;
3616 function Flag83 (N : Node_Id) return Boolean is
3618 pragma Assert (Nkind (N) in N_Entity);
3619 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag83;
3622 function Flag84 (N : Node_Id) return Boolean is
3624 pragma Assert (Nkind (N) in N_Entity);
3625 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag84;
3628 function Flag85 (N : Node_Id) return Boolean is
3630 pragma Assert (Nkind (N) in N_Entity);
3631 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag85;
3634 function Flag86 (N : Node_Id) return Boolean is
3636 pragma Assert (Nkind (N) in N_Entity);
3637 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag86;
3640 function Flag87 (N : Node_Id) return Boolean is
3642 pragma Assert (Nkind (N) in N_Entity);
3643 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag87;
3646 function Flag88 (N : Node_Id) return Boolean is
3648 pragma Assert (Nkind (N) in N_Entity);
3649 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag88;
3652 function Flag89 (N : Node_Id) return Boolean is
3654 pragma Assert (Nkind (N) in N_Entity);
3655 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag89;
3658 function Flag90 (N : Node_Id) return Boolean is
3660 pragma Assert (Nkind (N) in N_Entity);
3661 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag90;
3664 function Flag91 (N : Node_Id) return Boolean is
3666 pragma Assert (Nkind (N) in N_Entity);
3667 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag91;
3670 function Flag92 (N : Node_Id) return Boolean is
3672 pragma Assert (Nkind (N) in N_Entity);
3673 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag92;
3676 function Flag93 (N : Node_Id) return Boolean is
3678 pragma Assert (Nkind (N) in N_Entity);
3679 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag93;
3682 function Flag94 (N : Node_Id) return Boolean is
3684 pragma Assert (Nkind (N) in N_Entity);
3685 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag94;
3688 function Flag95 (N : Node_Id) return Boolean is
3690 pragma Assert (Nkind (N) in N_Entity);
3691 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag95;
3694 function Flag96 (N : Node_Id) return Boolean is
3696 pragma Assert (Nkind (N) in N_Entity);
3697 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag96;
3700 function Flag97 (N : Node_Id) return Boolean is
3702 pragma Assert (Nkind (N) in N_Entity);
3703 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag97;
3706 function Flag98 (N : Node_Id) return Boolean is
3708 pragma Assert (Nkind (N) in N_Entity);
3709 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag98;
3712 function Flag99 (N : Node_Id) return Boolean is
3714 pragma Assert (Nkind (N) in N_Entity);
3715 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag99;
3718 function Flag100 (N : Node_Id) return Boolean is
3720 pragma Assert (Nkind (N) in N_Entity);
3721 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag100;
3724 function Flag101 (N : Node_Id) return Boolean is
3726 pragma Assert (Nkind (N) in N_Entity);
3727 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag101;
3730 function Flag102 (N : Node_Id) return Boolean is
3732 pragma Assert (Nkind (N) in N_Entity);
3733 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag102;
3736 function Flag103 (N : Node_Id) return Boolean is
3738 pragma Assert (Nkind (N) in N_Entity);
3739 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag103;
3742 function Flag104 (N : Node_Id) return Boolean is
3744 pragma Assert (Nkind (N) in N_Entity);
3745 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag104;
3748 function Flag105 (N : Node_Id) return Boolean is
3750 pragma Assert (Nkind (N) in N_Entity);
3751 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag105;
3754 function Flag106 (N : Node_Id) return Boolean is
3756 pragma Assert (Nkind (N) in N_Entity);
3757 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag106;
3760 function Flag107 (N : Node_Id) return Boolean is
3762 pragma Assert (Nkind (N) in N_Entity);
3763 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag107;
3766 function Flag108 (N : Node_Id) return Boolean is
3768 pragma Assert (Nkind (N) in N_Entity);
3769 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag108;
3772 function Flag109 (N : Node_Id) return Boolean is
3774 pragma Assert (Nkind (N) in N_Entity);
3775 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag109;
3778 function Flag110 (N : Node_Id) return Boolean is
3780 pragma Assert (Nkind (N) in N_Entity);
3781 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag110;
3784 function Flag111 (N : Node_Id) return Boolean is
3786 pragma Assert (Nkind (N) in N_Entity);
3787 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag111;
3790 function Flag112 (N : Node_Id) return Boolean is
3792 pragma Assert (Nkind (N) in N_Entity);
3793 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag112;
3796 function Flag113 (N : Node_Id) return Boolean is
3798 pragma Assert (Nkind (N) in N_Entity);
3799 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag113;
3802 function Flag114 (N : Node_Id) return Boolean is
3804 pragma Assert (Nkind (N) in N_Entity);
3805 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag114;
3808 function Flag115 (N : Node_Id) return Boolean is
3810 pragma Assert (Nkind (N) in N_Entity);
3811 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag115;
3814 function Flag116 (N : Node_Id) return Boolean is
3816 pragma Assert (Nkind (N) in N_Entity);
3817 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag116;
3820 function Flag117 (N : Node_Id) return Boolean is
3822 pragma Assert (Nkind (N) in N_Entity);
3823 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag117;
3826 function Flag118 (N : Node_Id) return Boolean is
3828 pragma Assert (Nkind (N) in N_Entity);
3829 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag118;
3832 function Flag119 (N : Node_Id) return Boolean is
3834 pragma Assert (Nkind (N) in N_Entity);
3835 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag119;
3838 function Flag120 (N : Node_Id) return Boolean is
3840 pragma Assert (Nkind (N) in N_Entity);
3841 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag120;
3844 function Flag121 (N : Node_Id) return Boolean is
3846 pragma Assert (Nkind (N) in N_Entity);
3847 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag121;
3850 function Flag122 (N : Node_Id) return Boolean is
3852 pragma Assert (Nkind (N) in N_Entity);
3853 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag122;
3856 function Flag123 (N : Node_Id) return Boolean is
3858 pragma Assert (Nkind (N) in N_Entity);
3859 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag123;
3862 function Flag124 (N : Node_Id) return Boolean is
3864 pragma Assert (Nkind (N) in N_Entity);
3865 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag124;
3868 function Flag125 (N : Node_Id) return Boolean is
3870 pragma Assert (Nkind (N) in N_Entity);
3871 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag125;
3874 function Flag126 (N : Node_Id) return Boolean is
3876 pragma Assert (Nkind (N) in N_Entity);
3877 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag126;
3880 function Flag127 (N : Node_Id) return Boolean is
3882 pragma Assert (Nkind (N) in N_Entity);
3883 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag127;
3886 function Flag128 (N : Node_Id) return Boolean is
3888 pragma Assert (Nkind (N) in N_Entity);
3889 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag128;
3892 function Flag129 (N : Node_Id) return Boolean is
3894 pragma Assert (Nkind (N) in N_Entity);
3895 return Nodes.Table (N + 3).In_List;
3898 function Flag130 (N : Node_Id) return Boolean is
3900 pragma Assert (Nkind (N) in N_Entity);
3901 return Nodes.Table (N + 3).Unused_1;
3904 function Flag131 (N : Node_Id) return Boolean is
3906 pragma Assert (Nkind (N) in N_Entity);
3907 return Nodes.Table (N + 3).Rewrite_Ins;
3910 function Flag132 (N : Node_Id) return Boolean is
3912 pragma Assert (Nkind (N) in N_Entity);
3913 return Nodes.Table (N + 3).Analyzed;
3916 function Flag133 (N : Node_Id) return Boolean is
3918 pragma Assert (Nkind (N) in N_Entity);
3919 return Nodes.Table (N + 3).Comes_From_Source;
3922 function Flag134 (N : Node_Id) return Boolean is
3924 pragma Assert (Nkind (N) in N_Entity);
3925 return Nodes.Table (N + 3).Error_Posted;
3928 function Flag135 (N : Node_Id) return Boolean is
3930 pragma Assert (Nkind (N) in N_Entity);
3931 return Nodes.Table (N + 3).Flag4;
3934 function Flag136 (N : Node_Id) return Boolean is
3936 pragma Assert (Nkind (N) in N_Entity);
3937 return Nodes.Table (N + 3).Flag5;
3940 function Flag137 (N : Node_Id) return Boolean is
3942 pragma Assert (Nkind (N) in N_Entity);
3943 return Nodes.Table (N + 3).Flag6;
3946 function Flag138 (N : Node_Id) return Boolean is
3948 pragma Assert (Nkind (N) in N_Entity);
3949 return Nodes.Table (N + 3).Flag7;
3952 function Flag139 (N : Node_Id) return Boolean is
3954 pragma Assert (Nkind (N) in N_Entity);
3955 return Nodes.Table (N + 3).Flag8;
3958 function Flag140 (N : Node_Id) return Boolean is
3960 pragma Assert (Nkind (N) in N_Entity);
3961 return Nodes.Table (N + 3).Flag9;
3964 function Flag141 (N : Node_Id) return Boolean is
3966 pragma Assert (Nkind (N) in N_Entity);
3967 return Nodes.Table (N + 3).Flag10;
3970 function Flag142 (N : Node_Id) return Boolean is
3972 pragma Assert (Nkind (N) in N_Entity);
3973 return Nodes.Table (N + 3).Flag11;
3976 function Flag143 (N : Node_Id) return Boolean is
3978 pragma Assert (Nkind (N) in N_Entity);
3979 return Nodes.Table (N + 3).Flag12;
3982 function Flag144 (N : Node_Id) return Boolean is
3984 pragma Assert (Nkind (N) in N_Entity);
3985 return Nodes.Table (N + 3).Flag13;
3988 function Flag145 (N : Node_Id) return Boolean is
3990 pragma Assert (Nkind (N) in N_Entity);
3991 return Nodes.Table (N + 3).Flag14;
3994 function Flag146 (N : Node_Id) return Boolean is
3996 pragma Assert (Nkind (N) in N_Entity);
3997 return Nodes.Table (N + 3).Flag15;
4000 function Flag147 (N : Node_Id) return Boolean is
4002 pragma Assert (Nkind (N) in N_Entity);
4003 return Nodes.Table (N + 3).Flag16;
4006 function Flag148 (N : Node_Id) return Boolean is
4008 pragma Assert (Nkind (N) in N_Entity);
4009 return Nodes.Table (N + 3).Flag17;
4012 function Flag149 (N : Node_Id) return Boolean is
4014 pragma Assert (Nkind (N) in N_Entity);
4015 return Nodes.Table (N + 3).Flag18;
4018 function Flag150 (N : Node_Id) return Boolean is
4020 pragma Assert (Nkind (N) in N_Entity);
4021 return Nodes.Table (N + 3).Pflag1;
4024 function Flag151 (N : Node_Id) return Boolean is
4026 pragma Assert (Nkind (N) in N_Entity);
4027 return Nodes.Table (N + 3).Pflag2;
4030 function Flag152 (N : Node_Id) return Boolean is
4032 pragma Assert (Nkind (N) in N_Entity);
4033 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag152;
4036 function Flag153 (N : Node_Id) return Boolean is
4038 pragma Assert (Nkind (N) in N_Entity);
4039 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag153;
4042 function Flag154 (N : Node_Id) return Boolean is
4044 pragma Assert (Nkind (N) in N_Entity);
4045 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag154;
4048 function Flag155 (N : Node_Id) return Boolean is
4050 pragma Assert (Nkind (N) in N_Entity);
4051 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag155;
4054 function Flag156 (N : Node_Id) return Boolean is
4056 pragma Assert (Nkind (N) in N_Entity);
4057 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag156;
4060 function Flag157 (N : Node_Id) return Boolean is
4062 pragma Assert (Nkind (N) in N_Entity);
4063 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag157;
4066 function Flag158 (N : Node_Id) return Boolean is
4068 pragma Assert (Nkind (N) in N_Entity);
4069 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag158;
4072 function Flag159 (N : Node_Id) return Boolean is
4074 pragma Assert (Nkind (N) in N_Entity);
4075 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag159;
4078 function Flag160 (N : Node_Id) return Boolean is
4080 pragma Assert (Nkind (N) in N_Entity);
4081 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag160;
4084 function Flag161 (N : Node_Id) return Boolean is
4086 pragma Assert (Nkind (N) in N_Entity);
4087 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag161;
4090 function Flag162 (N : Node_Id) return Boolean is
4092 pragma Assert (Nkind (N) in N_Entity);
4093 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag162;
4096 function Flag163 (N : Node_Id) return Boolean is
4098 pragma Assert (Nkind (N) in N_Entity);
4099 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag163;
4102 function Flag164 (N : Node_Id) return Boolean is
4104 pragma Assert (Nkind (N) in N_Entity);
4105 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag164;
4108 function Flag165 (N : Node_Id) return Boolean is
4110 pragma Assert (Nkind (N) in N_Entity);
4111 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag165;
4114 function Flag166 (N : Node_Id) return Boolean is
4116 pragma Assert (Nkind (N) in N_Entity);
4117 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag166;
4120 function Flag167 (N : Node_Id) return Boolean is
4122 pragma Assert (Nkind (N) in N_Entity);
4123 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag167;
4126 function Flag168 (N : Node_Id) return Boolean is
4128 pragma Assert (Nkind (N) in N_Entity);
4129 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag168;
4132 function Flag169 (N : Node_Id) return Boolean is
4134 pragma Assert (Nkind (N) in N_Entity);
4135 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag169;
4138 function Flag170 (N : Node_Id) return Boolean is
4140 pragma Assert (Nkind (N) in N_Entity);
4141 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag170;
4144 function Flag171 (N : Node_Id) return Boolean is
4146 pragma Assert (Nkind (N) in N_Entity);
4147 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag171;
4150 function Flag172 (N : Node_Id) return Boolean is
4152 pragma Assert (Nkind (N) in N_Entity);
4153 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag172;
4156 function Flag173 (N : Node_Id) return Boolean is
4158 pragma Assert (Nkind (N) in N_Entity);
4159 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag173;
4162 function Flag174 (N : Node_Id) return Boolean is
4164 pragma Assert (Nkind (N) in N_Entity);
4165 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag174;
4168 function Flag175 (N : Node_Id) return Boolean is
4170 pragma Assert (Nkind (N) in N_Entity);
4171 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag175;
4174 function Flag176 (N : Node_Id) return Boolean is
4176 pragma Assert (Nkind (N) in N_Entity);
4177 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag176;
4180 function Flag177 (N : Node_Id) return Boolean is
4182 pragma Assert (Nkind (N) in N_Entity);
4183 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag177;
4186 function Flag178 (N : Node_Id) return Boolean is
4188 pragma Assert (Nkind (N) in N_Entity);
4189 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag178;
4192 function Flag179 (N : Node_Id) return Boolean is
4194 pragma Assert (Nkind (N) in N_Entity);
4195 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag179;
4198 function Flag180 (N : Node_Id) return Boolean is
4200 pragma Assert (Nkind (N) in N_Entity);
4201 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag180;
4204 function Flag181 (N : Node_Id) return Boolean is
4206 pragma Assert (Nkind (N) in N_Entity);
4207 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag181;
4210 function Flag182 (N : Node_Id) return Boolean is
4212 pragma Assert (Nkind (N) in N_Entity);
4213 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag182;
4216 function Flag183 (N : Node_Id) return Boolean is
4218 pragma Assert (Nkind (N) in N_Entity);
4219 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag183;
4222 function Flag184 (N : Node_Id) return Boolean is
4224 pragma Assert (Nkind (N) in N_Entity);
4225 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag184;
4228 function Flag185 (N : Node_Id) return Boolean is
4230 pragma Assert (Nkind (N) in N_Entity);
4231 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag185;
4234 function Flag186 (N : Node_Id) return Boolean is
4236 pragma Assert (Nkind (N) in N_Entity);
4237 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag186;
4240 function Flag187 (N : Node_Id) return Boolean is
4242 pragma Assert (Nkind (N) in N_Entity);
4243 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag187;
4246 function Flag188 (N : Node_Id) return Boolean is
4248 pragma Assert (Nkind (N) in N_Entity);
4249 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag188;
4252 function Flag189 (N : Node_Id) return Boolean is
4254 pragma Assert (Nkind (N) in N_Entity);
4255 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag189;
4258 function Flag190 (N : Node_Id) return Boolean is
4260 pragma Assert (Nkind (N) in N_Entity);
4261 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag190;
4264 function Flag191 (N : Node_Id) return Boolean is
4266 pragma Assert (Nkind (N) in N_Entity);
4267 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag191;
4270 function Flag192 (N : Node_Id) return Boolean is
4272 pragma Assert (Nkind (N) in N_Entity);
4273 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag192;
4276 function Flag193 (N : Node_Id) return Boolean is
4278 pragma Assert (Nkind (N) in N_Entity);
4279 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag193;
4282 function Flag194 (N : Node_Id) return Boolean is
4284 pragma Assert (Nkind (N) in N_Entity);
4285 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag194;
4288 function Flag195 (N : Node_Id) return Boolean is
4290 pragma Assert (Nkind (N) in N_Entity);
4291 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag195;
4294 function Flag196 (N : Node_Id) return Boolean is
4296 pragma Assert (Nkind (N) in N_Entity);
4297 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag196;
4300 function Flag197 (N : Node_Id) return Boolean is
4302 pragma Assert (Nkind (N) in N_Entity);
4303 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag197;
4306 function Flag198 (N : Node_Id) return Boolean is
4308 pragma Assert (Nkind (N) in N_Entity);
4309 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag198;
4312 function Flag199 (N : Node_Id) return Boolean is
4314 pragma Assert (Nkind (N) in N_Entity);
4315 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag199;
4318 function Flag200 (N : Node_Id) return Boolean is
4320 pragma Assert (Nkind (N) in N_Entity);
4321 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag200;
4324 function Flag201 (N : Node_Id) return Boolean is
4326 pragma Assert (Nkind (N) in N_Entity);
4327 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag201;
4330 function Flag202 (N : Node_Id) return Boolean is
4332 pragma Assert (Nkind (N) in N_Entity);
4333 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag202;
4336 function Flag203 (N : Node_Id) return Boolean is
4338 pragma Assert (Nkind (N) in N_Entity);
4339 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag203;
4342 function Flag204 (N : Node_Id) return Boolean is
4344 pragma Assert (Nkind (N) in N_Entity);
4345 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag204;
4348 function Flag205 (N : Node_Id) return Boolean is
4350 pragma Assert (Nkind (N) in N_Entity);
4351 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag205;
4354 function Flag206 (N : Node_Id) return Boolean is
4356 pragma Assert (Nkind (N) in N_Entity);
4357 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag206;
4360 function Flag207 (N : Node_Id) return Boolean is
4362 pragma Assert (Nkind (N) in N_Entity);
4363 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag207;
4366 function Flag208 (N : Node_Id) return Boolean is
4368 pragma Assert (Nkind (N) in N_Entity);
4369 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag208;
4372 function Flag209 (N : Node_Id) return Boolean is
4374 pragma Assert (Nkind (N) in N_Entity);
4375 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag209;
4378 function Flag210 (N : Node_Id) return Boolean is
4380 pragma Assert (Nkind (N) in N_Entity);
4381 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag210;
4384 function Flag211 (N : Node_Id) return Boolean is
4386 pragma Assert (Nkind (N) in N_Entity);
4387 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag211;
4390 function Flag212 (N : Node_Id) return Boolean is
4392 pragma Assert (Nkind (N) in N_Entity);
4393 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag212;
4396 function Flag213 (N : Node_Id) return Boolean is
4398 pragma Assert (Nkind (N) in N_Entity);
4399 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag213;
4402 function Flag214 (N : Node_Id) return Boolean is
4404 pragma Assert (Nkind (N) in N_Entity);
4405 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag214;
4408 function Flag215 (N : Node_Id) return Boolean is
4410 pragma Assert (Nkind (N) in N_Entity);
4411 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag215;
4414 procedure Set_Nkind (N : Node_Id; Val : Node_Kind) is
4416 pragma Assert (N in Nodes.First .. Nodes.Last);
4417 Nodes.Table (N).Nkind := Val;
4420 procedure Set_Field1 (N : Node_Id; Val : Union_Id) is
4422 pragma Assert (N in Nodes.First .. Nodes.Last);
4423 Nodes.Table (N).Field1 := Val;
4426 procedure Set_Field2 (N : Node_Id; Val : Union_Id) is
4428 pragma Assert (N in Nodes.First .. Nodes.Last);
4429 Nodes.Table (N).Field2 := Val;
4432 procedure Set_Field3 (N : Node_Id; Val : Union_Id) is
4434 pragma Assert (N in Nodes.First .. Nodes.Last);
4435 Nodes.Table (N).Field3 := Val;
4438 procedure Set_Field4 (N : Node_Id; Val : Union_Id) is
4440 pragma Assert (N in Nodes.First .. Nodes.Last);
4441 Nodes.Table (N).Field4 := Val;
4444 procedure Set_Field5 (N : Node_Id; Val : Union_Id) is
4446 pragma Assert (N in Nodes.First .. Nodes.Last);
4447 Nodes.Table (N).Field5 := Val;
4450 procedure Set_Field6 (N : Node_Id; Val : Union_Id) is
4452 pragma Assert (Nkind (N) in N_Entity);
4453 Nodes.Table (N + 1).Field6 := Val;
4456 procedure Set_Field7 (N : Node_Id; Val : Union_Id) is
4458 pragma Assert (Nkind (N) in N_Entity);
4459 Nodes.Table (N + 1).Field7 := Val;
4462 procedure Set_Field8 (N : Node_Id; Val : Union_Id) is
4464 pragma Assert (Nkind (N) in N_Entity);
4465 Nodes.Table (N + 1).Field8 := Val;
4468 procedure Set_Field9 (N : Node_Id; Val : Union_Id) is
4470 pragma Assert (Nkind (N) in N_Entity);
4471 Nodes.Table (N + 1).Field9 := Val;
4474 procedure Set_Field10 (N : Node_Id; Val : Union_Id) is
4476 pragma Assert (Nkind (N) in N_Entity);
4477 Nodes.Table (N + 1).Field10 := Val;
4480 procedure Set_Field11 (N : Node_Id; Val : Union_Id) is
4482 pragma Assert (Nkind (N) in N_Entity);
4483 Nodes.Table (N + 1).Field11 := Val;
4486 procedure Set_Field12 (N : Node_Id; Val : Union_Id) is
4488 pragma Assert (Nkind (N) in N_Entity);
4489 Nodes.Table (N + 1).Field12 := Val;
4492 procedure Set_Field13 (N : Node_Id; Val : Union_Id) is
4494 pragma Assert (Nkind (N) in N_Entity);
4495 Nodes.Table (N + 2).Field6 := Val;
4498 procedure Set_Field14 (N : Node_Id; Val : Union_Id) is
4500 pragma Assert (Nkind (N) in N_Entity);
4501 Nodes.Table (N + 2).Field7 := Val;
4504 procedure Set_Field15 (N : Node_Id; Val : Union_Id) is
4506 pragma Assert (Nkind (N) in N_Entity);
4507 Nodes.Table (N + 2).Field8 := Val;
4510 procedure Set_Field16 (N : Node_Id; Val : Union_Id) is
4512 pragma Assert (Nkind (N) in N_Entity);
4513 Nodes.Table (N + 2).Field9 := Val;
4516 procedure Set_Field17 (N : Node_Id; Val : Union_Id) is
4518 pragma Assert (Nkind (N) in N_Entity);
4519 Nodes.Table (N + 2).Field10 := Val;
4522 procedure Set_Field18 (N : Node_Id; Val : Union_Id) is
4524 pragma Assert (Nkind (N) in N_Entity);
4525 Nodes.Table (N + 2).Field11 := Val;
4528 procedure Set_Field19 (N : Node_Id; Val : Union_Id) is
4530 pragma Assert (Nkind (N) in N_Entity);
4531 Nodes.Table (N + 3).Field6 := Val;
4534 procedure Set_Field20 (N : Node_Id; Val : Union_Id) is
4536 pragma Assert (Nkind (N) in N_Entity);
4537 Nodes.Table (N + 3).Field7 := Val;
4540 procedure Set_Field21 (N : Node_Id; Val : Union_Id) is
4542 pragma Assert (Nkind (N) in N_Entity);
4543 Nodes.Table (N + 3).Field8 := Val;
4546 procedure Set_Field22 (N : Node_Id; Val : Union_Id) is
4548 pragma Assert (Nkind (N) in N_Entity);
4549 Nodes.Table (N + 3).Field9 := Val;
4552 procedure Set_Field23 (N : Node_Id; Val : Union_Id) is
4554 pragma Assert (Nkind (N) in N_Entity);
4555 Nodes.Table (N + 3).Field10 := Val;
4558 procedure Set_Field24 (N : Node_Id; Val : Union_Id) is
4560 pragma Assert (Nkind (N) in N_Entity);
4561 Nodes.Table (N + 4).Field6 := Val;
4564 procedure Set_Field25 (N : Node_Id; Val : Union_Id) is
4566 pragma Assert (Nkind (N) in N_Entity);
4567 Nodes.Table (N + 4).Field7 := Val;
4570 procedure Set_Field26 (N : Node_Id; Val : Union_Id) is
4572 pragma Assert (Nkind (N) in N_Entity);
4573 Nodes.Table (N + 4).Field8 := Val;
4576 procedure Set_Field27 (N : Node_Id; Val : Union_Id) is
4578 pragma Assert (Nkind (N) in N_Entity);
4579 Nodes.Table (N + 4).Field9 := Val;
4582 procedure Set_Node1 (N : Node_Id; Val : Node_Id) is
4584 pragma Assert (N in Nodes.First .. Nodes.Last);
4585 Nodes.Table (N).Field1 := Union_Id (Val);
4588 procedure Set_Node2 (N : Node_Id; Val : Node_Id) is
4590 pragma Assert (N in Nodes.First .. Nodes.Last);
4591 Nodes.Table (N).Field2 := Union_Id (Val);
4594 procedure Set_Node3 (N : Node_Id; Val : Node_Id) is
4596 pragma Assert (N in Nodes.First .. Nodes.Last);
4597 Nodes.Table (N).Field3 := Union_Id (Val);
4600 procedure Set_Node4 (N : Node_Id; Val : Node_Id) is
4602 pragma Assert (N in Nodes.First .. Nodes.Last);
4603 Nodes.Table (N).Field4 := Union_Id (Val);
4606 procedure Set_Node5 (N : Node_Id; Val : Node_Id) is
4608 pragma Assert (N in Nodes.First .. Nodes.Last);
4609 Nodes.Table (N).Field5 := Union_Id (Val);
4612 procedure Set_Node6 (N : Node_Id; Val : Node_Id) is
4614 pragma Assert (Nkind (N) in N_Entity);
4615 Nodes.Table (N + 1).Field6 := Union_Id (Val);
4618 procedure Set_Node7 (N : Node_Id; Val : Node_Id) is
4620 pragma Assert (Nkind (N) in N_Entity);
4621 Nodes.Table (N + 1).Field7 := Union_Id (Val);
4624 procedure Set_Node8 (N : Node_Id; Val : Node_Id) is
4626 pragma Assert (Nkind (N) in N_Entity);
4627 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4630 procedure Set_Node9 (N : Node_Id; Val : Node_Id) is
4632 pragma Assert (Nkind (N) in N_Entity);
4633 Nodes.Table (N + 1).Field9 := Union_Id (Val);
4636 procedure Set_Node10 (N : Node_Id; Val : Node_Id) is
4638 pragma Assert (Nkind (N) in N_Entity);
4639 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4642 procedure Set_Node11 (N : Node_Id; Val : Node_Id) is
4644 pragma Assert (Nkind (N) in N_Entity);
4645 Nodes.Table (N + 1).Field11 := Union_Id (Val);
4648 procedure Set_Node12 (N : Node_Id; Val : Node_Id) is
4650 pragma Assert (Nkind (N) in N_Entity);
4651 Nodes.Table (N + 1).Field12 := Union_Id (Val);
4654 procedure Set_Node13 (N : Node_Id; Val : Node_Id) is
4656 pragma Assert (Nkind (N) in N_Entity);
4657 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4660 procedure Set_Node14 (N : Node_Id; Val : Node_Id) is
4662 pragma Assert (Nkind (N) in N_Entity);
4663 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4666 procedure Set_Node15 (N : Node_Id; Val : Node_Id) is
4668 pragma Assert (Nkind (N) in N_Entity);
4669 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4672 procedure Set_Node16 (N : Node_Id; Val : Node_Id) is
4674 pragma Assert (Nkind (N) in N_Entity);
4675 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4678 procedure Set_Node17 (N : Node_Id; Val : Node_Id) is
4680 pragma Assert (Nkind (N) in N_Entity);
4681 Nodes.Table (N + 2).Field10 := Union_Id (Val);
4684 procedure Set_Node18 (N : Node_Id; Val : Node_Id) is
4686 pragma Assert (Nkind (N) in N_Entity);
4687 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4690 procedure Set_Node19 (N : Node_Id; Val : Node_Id) is
4692 pragma Assert (Nkind (N) in N_Entity);
4693 Nodes.Table (N + 3).Field6 := Union_Id (Val);
4696 procedure Set_Node20 (N : Node_Id; Val : Node_Id) is
4698 pragma Assert (Nkind (N) in N_Entity);
4699 Nodes.Table (N + 3).Field7 := Union_Id (Val);
4702 procedure Set_Node21 (N : Node_Id; Val : Node_Id) is
4704 pragma Assert (Nkind (N) in N_Entity);
4705 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4708 procedure Set_Node22 (N : Node_Id; Val : Node_Id) is
4710 pragma Assert (Nkind (N) in N_Entity);
4711 Nodes.Table (N + 3).Field9 := Union_Id (Val);
4714 procedure Set_Node23 (N : Node_Id; Val : Node_Id) is
4716 pragma Assert (Nkind (N) in N_Entity);
4717 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4720 procedure Set_Node24 (N : Node_Id; Val : Node_Id) is
4722 pragma Assert (Nkind (N) in N_Entity);
4723 Nodes.Table (N + 4).Field6 := Union_Id (Val);
4726 procedure Set_Node25 (N : Node_Id; Val : Node_Id) is
4728 pragma Assert (Nkind (N) in N_Entity);
4729 Nodes.Table (N + 4).Field7 := Union_Id (Val);
4732 procedure Set_Node26 (N : Node_Id; Val : Node_Id) is
4734 pragma Assert (Nkind (N) in N_Entity);
4735 Nodes.Table (N + 4).Field8 := Union_Id (Val);
4738 procedure Set_Node27 (N : Node_Id; Val : Node_Id) is
4740 pragma Assert (Nkind (N) in N_Entity);
4741 Nodes.Table (N + 4).Field9 := Union_Id (Val);
4744 procedure Set_List1 (N : Node_Id; Val : List_Id) is
4746 pragma Assert (N in Nodes.First .. Nodes.Last);
4747 Nodes.Table (N).Field1 := Union_Id (Val);
4750 procedure Set_List2 (N : Node_Id; Val : List_Id) is
4752 pragma Assert (N in Nodes.First .. Nodes.Last);
4753 Nodes.Table (N).Field2 := Union_Id (Val);
4756 procedure Set_List3 (N : Node_Id; Val : List_Id) is
4758 pragma Assert (N in Nodes.First .. Nodes.Last);
4759 Nodes.Table (N).Field3 := Union_Id (Val);
4762 procedure Set_List4 (N : Node_Id; Val : List_Id) is
4764 pragma Assert (N in Nodes.First .. Nodes.Last);
4765 Nodes.Table (N).Field4 := Union_Id (Val);
4768 procedure Set_List5 (N : Node_Id; Val : List_Id) is
4770 pragma Assert (N in Nodes.First .. Nodes.Last);
4771 Nodes.Table (N).Field5 := Union_Id (Val);
4774 procedure Set_List10 (N : Node_Id; Val : List_Id) is
4776 pragma Assert (Nkind (N) in N_Entity);
4777 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4780 procedure Set_List14 (N : Node_Id; Val : List_Id) is
4782 pragma Assert (Nkind (N) in N_Entity);
4783 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4786 procedure Set_Elist2 (N : Node_Id; Val : Elist_Id) is
4788 Nodes.Table (N).Field2 := Union_Id (Val);
4791 procedure Set_Elist3 (N : Node_Id; Val : Elist_Id) is
4793 Nodes.Table (N).Field3 := Union_Id (Val);
4796 procedure Set_Elist4 (N : Node_Id; Val : Elist_Id) is
4798 Nodes.Table (N).Field4 := Union_Id (Val);
4801 procedure Set_Elist8 (N : Node_Id; Val : Elist_Id) is
4803 pragma Assert (Nkind (N) in N_Entity);
4804 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4807 procedure Set_Elist13 (N : Node_Id; Val : Elist_Id) is
4809 pragma Assert (Nkind (N) in N_Entity);
4810 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4813 procedure Set_Elist15 (N : Node_Id; Val : Elist_Id) is
4815 pragma Assert (Nkind (N) in N_Entity);
4816 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4819 procedure Set_Elist16 (N : Node_Id; Val : Elist_Id) is
4821 pragma Assert (Nkind (N) in N_Entity);
4822 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4825 procedure Set_Elist18 (N : Node_Id; Val : Elist_Id) is
4827 pragma Assert (Nkind (N) in N_Entity);
4828 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4831 procedure Set_Elist21 (N : Node_Id; Val : Elist_Id) is
4833 pragma Assert (Nkind (N) in N_Entity);
4834 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4837 procedure Set_Elist23 (N : Node_Id; Val : Elist_Id) is
4839 pragma Assert (Nkind (N) in N_Entity);
4840 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4843 procedure Set_Name1 (N : Node_Id; Val : Name_Id) is
4845 pragma Assert (N in Nodes.First .. Nodes.Last);
4846 Nodes.Table (N).Field1 := Union_Id (Val);
4849 procedure Set_Name2 (N : Node_Id; Val : Name_Id) is
4851 pragma Assert (N in Nodes.First .. Nodes.Last);
4852 Nodes.Table (N).Field2 := Union_Id (Val);
4855 procedure Set_Str3 (N : Node_Id; Val : String_Id) is
4857 pragma Assert (N in Nodes.First .. Nodes.Last);
4858 Nodes.Table (N).Field3 := Union_Id (Val);
4861 procedure Set_Uint3 (N : Node_Id; Val : Uint) is
4863 pragma Assert (N in Nodes.First .. Nodes.Last);
4864 Nodes.Table (N).Field3 := To_Union (Val);
4867 procedure Set_Uint4 (N : Node_Id; Val : Uint) is
4869 pragma Assert (N in Nodes.First .. Nodes.Last);
4870 Nodes.Table (N).Field4 := To_Union (Val);
4873 procedure Set_Uint5 (N : Node_Id; Val : Uint) is
4875 pragma Assert (N in Nodes.First .. Nodes.Last);
4876 Nodes.Table (N).Field5 := To_Union (Val);
4879 procedure Set_Uint8 (N : Node_Id; Val : Uint) is
4881 pragma Assert (Nkind (N) in N_Entity);
4882 Nodes.Table (N + 1).Field8 := To_Union (Val);
4885 procedure Set_Uint9 (N : Node_Id; Val : Uint) is
4887 pragma Assert (Nkind (N) in N_Entity);
4888 Nodes.Table (N + 1).Field9 := To_Union (Val);
4891 procedure Set_Uint10 (N : Node_Id; Val : Uint) is
4893 pragma Assert (Nkind (N) in N_Entity);
4894 Nodes.Table (N + 1).Field10 := To_Union (Val);
4897 procedure Set_Uint11 (N : Node_Id; Val : Uint) is
4899 pragma Assert (Nkind (N) in N_Entity);
4900 Nodes.Table (N + 1).Field11 := To_Union (Val);
4903 procedure Set_Uint12 (N : Node_Id; Val : Uint) is
4905 pragma Assert (Nkind (N) in N_Entity);
4906 Nodes.Table (N + 1).Field12 := To_Union (Val);
4909 procedure Set_Uint13 (N : Node_Id; Val : Uint) is
4911 pragma Assert (Nkind (N) in N_Entity);
4912 Nodes.Table (N + 2).Field6 := To_Union (Val);
4915 procedure Set_Uint14 (N : Node_Id; Val : Uint) is
4917 pragma Assert (Nkind (N) in N_Entity);
4918 Nodes.Table (N + 2).Field7 := To_Union (Val);
4921 procedure Set_Uint15 (N : Node_Id; Val : Uint) is
4923 pragma Assert (Nkind (N) in N_Entity);
4924 Nodes.Table (N + 2).Field8 := To_Union (Val);
4927 procedure Set_Uint16 (N : Node_Id; Val : Uint) is
4929 pragma Assert (Nkind (N) in N_Entity);
4930 Nodes.Table (N + 2).Field9 := To_Union (Val);
4933 procedure Set_Uint17 (N : Node_Id; Val : Uint) is
4935 pragma Assert (Nkind (N) in N_Entity);
4936 Nodes.Table (N + 2).Field10 := To_Union (Val);
4939 procedure Set_Uint22 (N : Node_Id; Val : Uint) is
4941 pragma Assert (Nkind (N) in N_Entity);
4942 Nodes.Table (N + 3).Field9 := To_Union (Val);
4945 procedure Set_Ureal3 (N : Node_Id; Val : Ureal) is
4947 pragma Assert (N in Nodes.First .. Nodes.Last);
4948 Nodes.Table (N).Field3 := To_Union (Val);
4951 procedure Set_Ureal18 (N : Node_Id; Val : Ureal) is
4953 pragma Assert (Nkind (N) in N_Entity);
4954 Nodes.Table (N + 2).Field11 := To_Union (Val);
4957 procedure Set_Ureal21 (N : Node_Id; Val : Ureal) is
4959 pragma Assert (Nkind (N) in N_Entity);
4960 Nodes.Table (N + 3).Field8 := To_Union (Val);
4963 procedure Set_Char_Code2 (N : Node_Id; Val : Char_Code) is
4965 pragma Assert (N in Nodes.First .. Nodes.Last);
4966 Nodes.Table (N).Field2 := Union_Id (Val) + Char_Code_Bias;
4969 procedure Set_Flag4 (N : Node_Id; Val : Boolean) is
4971 pragma Assert (N in Nodes.First .. Nodes.Last);
4972 Nodes.Table (N).Flag4 := Val;
4975 procedure Set_Flag5 (N : Node_Id; Val : Boolean) is
4977 pragma Assert (N in Nodes.First .. Nodes.Last);
4978 Nodes.Table (N).Flag5 := Val;
4981 procedure Set_Flag6 (N : Node_Id; Val : Boolean) is
4983 pragma Assert (N in Nodes.First .. Nodes.Last);
4984 Nodes.Table (N).Flag6 := Val;
4987 procedure Set_Flag7 (N : Node_Id; Val : Boolean) is
4989 pragma Assert (N in Nodes.First .. Nodes.Last);
4990 Nodes.Table (N).Flag7 := Val;
4993 procedure Set_Flag8 (N : Node_Id; Val : Boolean) is
4995 pragma Assert (N in Nodes.First .. Nodes.Last);
4996 Nodes.Table (N).Flag8 := Val;
4999 procedure Set_Flag9 (N : Node_Id; Val : Boolean) is
5001 pragma Assert (N in Nodes.First .. Nodes.Last);
5002 Nodes.Table (N).Flag9 := Val;
5005 procedure Set_Flag10 (N : Node_Id; Val : Boolean) is
5007 pragma Assert (N in Nodes.First .. Nodes.Last);
5008 Nodes.Table (N).Flag10 := Val;
5011 procedure Set_Flag11 (N : Node_Id; Val : Boolean) is
5013 pragma Assert (N in Nodes.First .. Nodes.Last);
5014 Nodes.Table (N).Flag11 := Val;
5017 procedure Set_Flag12 (N : Node_Id; Val : Boolean) is
5019 pragma Assert (N in Nodes.First .. Nodes.Last);
5020 Nodes.Table (N).Flag12 := Val;
5023 procedure Set_Flag13 (N : Node_Id; Val : Boolean) is
5025 pragma Assert (N in Nodes.First .. Nodes.Last);
5026 Nodes.Table (N).Flag13 := Val;
5029 procedure Set_Flag14 (N : Node_Id; Val : Boolean) is
5031 pragma Assert (N in Nodes.First .. Nodes.Last);
5032 Nodes.Table (N).Flag14 := Val;
5035 procedure Set_Flag15 (N : Node_Id; Val : Boolean) is
5037 pragma Assert (N in Nodes.First .. Nodes.Last);
5038 Nodes.Table (N).Flag15 := Val;
5041 procedure Set_Flag16 (N : Node_Id; Val : Boolean) is
5043 pragma Assert (N in Nodes.First .. Nodes.Last);
5044 Nodes.Table (N).Flag16 := Val;
5047 procedure Set_Flag17 (N : Node_Id; Val : Boolean) is
5049 pragma Assert (N in Nodes.First .. Nodes.Last);
5050 Nodes.Table (N).Flag17 := Val;
5053 procedure Set_Flag18 (N : Node_Id; Val : Boolean) is
5055 pragma Assert (N in Nodes.First .. Nodes.Last);
5056 Nodes.Table (N).Flag18 := Val;
5059 procedure Set_Flag19 (N : Node_Id; Val : Boolean) is
5061 pragma Assert (Nkind (N) in N_Entity);
5062 Nodes.Table (N + 1).In_List := Val;
5065 procedure Set_Flag20 (N : Node_Id; Val : Boolean) is
5067 pragma Assert (Nkind (N) in N_Entity);
5068 Nodes.Table (N + 1).Unused_1 := Val;
5071 procedure Set_Flag21 (N : Node_Id; Val : Boolean) is
5073 pragma Assert (Nkind (N) in N_Entity);
5074 Nodes.Table (N + 1).Rewrite_Ins := Val;
5077 procedure Set_Flag22 (N : Node_Id; Val : Boolean) is
5079 pragma Assert (Nkind (N) in N_Entity);
5080 Nodes.Table (N + 1).Analyzed := Val;
5083 procedure Set_Flag23 (N : Node_Id; Val : Boolean) is
5085 pragma Assert (Nkind (N) in N_Entity);
5086 Nodes.Table (N + 1).Comes_From_Source := Val;
5089 procedure Set_Flag24 (N : Node_Id; Val : Boolean) is
5091 pragma Assert (Nkind (N) in N_Entity);
5092 Nodes.Table (N + 1).Error_Posted := Val;
5095 procedure Set_Flag25 (N : Node_Id; Val : Boolean) is
5097 pragma Assert (Nkind (N) in N_Entity);
5098 Nodes.Table (N + 1).Flag4 := Val;
5101 procedure Set_Flag26 (N : Node_Id; Val : Boolean) is
5103 pragma Assert (Nkind (N) in N_Entity);
5104 Nodes.Table (N + 1).Flag5 := Val;
5107 procedure Set_Flag27 (N : Node_Id; Val : Boolean) is
5109 pragma Assert (Nkind (N) in N_Entity);
5110 Nodes.Table (N + 1).Flag6 := Val;
5113 procedure Set_Flag28 (N : Node_Id; Val : Boolean) is
5115 pragma Assert (Nkind (N) in N_Entity);
5116 Nodes.Table (N + 1).Flag7 := Val;
5119 procedure Set_Flag29 (N : Node_Id; Val : Boolean) is
5121 pragma Assert (Nkind (N) in N_Entity);
5122 Nodes.Table (N + 1).Flag8 := Val;
5125 procedure Set_Flag30 (N : Node_Id; Val : Boolean) is
5127 pragma Assert (Nkind (N) in N_Entity);
5128 Nodes.Table (N + 1).Flag9 := Val;
5131 procedure Set_Flag31 (N : Node_Id; Val : Boolean) is
5133 pragma Assert (Nkind (N) in N_Entity);
5134 Nodes.Table (N + 1).Flag10 := Val;
5137 procedure Set_Flag32 (N : Node_Id; Val : Boolean) is
5139 pragma Assert (Nkind (N) in N_Entity);
5140 Nodes.Table (N + 1).Flag11 := Val;
5143 procedure Set_Flag33 (N : Node_Id; Val : Boolean) is
5145 pragma Assert (Nkind (N) in N_Entity);
5146 Nodes.Table (N + 1).Flag12 := Val;
5149 procedure Set_Flag34 (N : Node_Id; Val : Boolean) is
5151 pragma Assert (Nkind (N) in N_Entity);
5152 Nodes.Table (N + 1).Flag13 := Val;
5155 procedure Set_Flag35 (N : Node_Id; Val : Boolean) is
5157 pragma Assert (Nkind (N) in N_Entity);
5158 Nodes.Table (N + 1).Flag14 := Val;
5161 procedure Set_Flag36 (N : Node_Id; Val : Boolean) is
5163 pragma Assert (Nkind (N) in N_Entity);
5164 Nodes.Table (N + 1).Flag15 := Val;
5167 procedure Set_Flag37 (N : Node_Id; Val : Boolean) is
5169 pragma Assert (Nkind (N) in N_Entity);
5170 Nodes.Table (N + 1).Flag16 := Val;
5173 procedure Set_Flag38 (N : Node_Id; Val : Boolean) is
5175 pragma Assert (Nkind (N) in N_Entity);
5176 Nodes.Table (N + 1).Flag17 := Val;
5179 procedure Set_Flag39 (N : Node_Id; Val : Boolean) is
5181 pragma Assert (Nkind (N) in N_Entity);
5182 Nodes.Table (N + 1).Flag18 := Val;
5185 procedure Set_Flag40 (N : Node_Id; Val : Boolean) is
5187 pragma Assert (Nkind (N) in N_Entity);
5188 Nodes.Table (N + 2).In_List := Val;
5191 procedure Set_Flag41 (N : Node_Id; Val : Boolean) is
5193 pragma Assert (Nkind (N) in N_Entity);
5194 Nodes.Table (N + 2).Unused_1 := Val;
5197 procedure Set_Flag42 (N : Node_Id; Val : Boolean) is
5199 pragma Assert (Nkind (N) in N_Entity);
5200 Nodes.Table (N + 2).Rewrite_Ins := Val;
5203 procedure Set_Flag43 (N : Node_Id; Val : Boolean) is
5205 pragma Assert (Nkind (N) in N_Entity);
5206 Nodes.Table (N + 2).Analyzed := Val;
5209 procedure Set_Flag44 (N : Node_Id; Val : Boolean) is
5211 pragma Assert (Nkind (N) in N_Entity);
5212 Nodes.Table (N + 2).Comes_From_Source := Val;
5215 procedure Set_Flag45 (N : Node_Id; Val : Boolean) is
5217 pragma Assert (Nkind (N) in N_Entity);
5218 Nodes.Table (N + 2).Error_Posted := Val;
5221 procedure Set_Flag46 (N : Node_Id; Val : Boolean) is
5223 pragma Assert (Nkind (N) in N_Entity);
5224 Nodes.Table (N + 2).Flag4 := Val;
5227 procedure Set_Flag47 (N : Node_Id; Val : Boolean) is
5229 pragma Assert (Nkind (N) in N_Entity);
5230 Nodes.Table (N + 2).Flag5 := Val;
5233 procedure Set_Flag48 (N : Node_Id; Val : Boolean) is
5235 pragma Assert (Nkind (N) in N_Entity);
5236 Nodes.Table (N + 2).Flag6 := Val;
5239 procedure Set_Flag49 (N : Node_Id; Val : Boolean) is
5241 pragma Assert (Nkind (N) in N_Entity);
5242 Nodes.Table (N + 2).Flag7 := Val;
5245 procedure Set_Flag50 (N : Node_Id; Val : Boolean) is
5247 pragma Assert (Nkind (N) in N_Entity);
5248 Nodes.Table (N + 2).Flag8 := Val;
5251 procedure Set_Flag51 (N : Node_Id; Val : Boolean) is
5253 pragma Assert (Nkind (N) in N_Entity);
5254 Nodes.Table (N + 2).Flag9 := Val;
5257 procedure Set_Flag52 (N : Node_Id; Val : Boolean) is
5259 pragma Assert (Nkind (N) in N_Entity);
5260 Nodes.Table (N + 2).Flag10 := Val;
5263 procedure Set_Flag53 (N : Node_Id; Val : Boolean) is
5265 pragma Assert (Nkind (N) in N_Entity);
5266 Nodes.Table (N + 2).Flag11 := Val;
5269 procedure Set_Flag54 (N : Node_Id; Val : Boolean) is
5271 pragma Assert (Nkind (N) in N_Entity);
5272 Nodes.Table (N + 2).Flag12 := Val;
5275 procedure Set_Flag55 (N : Node_Id; Val : Boolean) is
5277 pragma Assert (Nkind (N) in N_Entity);
5278 Nodes.Table (N + 2).Flag13 := Val;
5281 procedure Set_Flag56 (N : Node_Id; Val : Boolean) is
5283 pragma Assert (Nkind (N) in N_Entity);
5284 Nodes.Table (N + 2).Flag14 := Val;
5287 procedure Set_Flag57 (N : Node_Id; Val : Boolean) is
5289 pragma Assert (Nkind (N) in N_Entity);
5290 Nodes.Table (N + 2).Flag15 := Val;
5293 procedure Set_Flag58 (N : Node_Id; Val : Boolean) is
5295 pragma Assert (Nkind (N) in N_Entity);
5296 Nodes.Table (N + 2).Flag16 := Val;
5299 procedure Set_Flag59 (N : Node_Id; Val : Boolean) is
5301 pragma Assert (Nkind (N) in N_Entity);
5302 Nodes.Table (N + 2).Flag17 := Val;
5305 procedure Set_Flag60 (N : Node_Id; Val : Boolean) is
5307 pragma Assert (Nkind (N) in N_Entity);
5308 Nodes.Table (N + 2).Flag18 := Val;
5311 procedure Set_Flag61 (N : Node_Id; Val : Boolean) is
5313 pragma Assert (Nkind (N) in N_Entity);
5314 Nodes.Table (N + 1).Pflag1 := Val;
5317 procedure Set_Flag62 (N : Node_Id; Val : Boolean) is
5319 pragma Assert (Nkind (N) in N_Entity);
5320 Nodes.Table (N + 1).Pflag2 := Val;
5323 procedure Set_Flag63 (N : Node_Id; Val : Boolean) is
5325 pragma Assert (Nkind (N) in N_Entity);
5326 Nodes.Table (N + 2).Pflag1 := Val;
5329 procedure Set_Flag64 (N : Node_Id; Val : Boolean) is
5331 pragma Assert (Nkind (N) in N_Entity);
5332 Nodes.Table (N + 2).Pflag2 := Val;
5335 procedure Set_Flag65 (N : Node_Id; Val : Boolean) is
5337 pragma Assert (Nkind (N) in N_Entity);
5340 (Nodes
.Table
(N
+ 2).Nkind
'Unrestricted_Access)).Flag65
:= Val
;
5343 procedure Set_Flag66
(N
: Node_Id
; Val
: Boolean) is
5345 pragma Assert
(Nkind
(N
) in N_Entity
);
5348 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag66 := Val;
5351 procedure Set_Flag67 (N : Node_Id; Val : Boolean) is
5353 pragma Assert (Nkind (N) in N_Entity);
5356 (Nodes
.Table
(N
+ 2).Nkind
'Unrestricted_Access)).Flag67
:= Val
;
5359 procedure Set_Flag68
(N
: Node_Id
; Val
: Boolean) is
5361 pragma Assert
(Nkind
(N
) in N_Entity
);
5364 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag68 := Val;
5367 procedure Set_Flag69 (N : Node_Id; Val : Boolean) is
5369 pragma Assert (Nkind (N) in N_Entity);
5372 (Nodes
.Table
(N
+ 2).Nkind
'Unrestricted_Access)).Flag69
:= Val
;
5375 procedure Set_Flag70
(N
: Node_Id
; Val
: Boolean) is
5377 pragma Assert
(Nkind
(N
) in N_Entity
);
5380 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag70 := Val;
5383 procedure Set_Flag71 (N : Node_Id; Val : Boolean) is
5385 pragma Assert (Nkind (N) in N_Entity);
5388 (Nodes
.Table
(N
+ 2).Nkind
'Unrestricted_Access)).Flag71
:= Val
;
5391 procedure Set_Flag72
(N
: Node_Id
; Val
: Boolean) is
5393 pragma Assert
(Nkind
(N
) in N_Entity
);
5396 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag72 := Val;
5399 procedure Set_Flag73 (N : Node_Id; Val : Boolean) is
5401 pragma Assert (Nkind (N) in N_Entity);
5404 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag73
:= Val
;
5407 procedure Set_Flag74
(N
: Node_Id
; Val
: Boolean) is
5409 pragma Assert
(Nkind
(N
) in N_Entity
);
5412 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag74 := Val;
5415 procedure Set_Flag75 (N : Node_Id; Val : Boolean) is
5417 pragma Assert (Nkind (N) in N_Entity);
5420 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag75
:= Val
;
5423 procedure Set_Flag76
(N
: Node_Id
; Val
: Boolean) is
5425 pragma Assert
(Nkind
(N
) in N_Entity
);
5428 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag76 := Val;
5431 procedure Set_Flag77 (N : Node_Id; Val : Boolean) is
5433 pragma Assert (Nkind (N) in N_Entity);
5436 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag77
:= Val
;
5439 procedure Set_Flag78
(N
: Node_Id
; Val
: Boolean) is
5441 pragma Assert
(Nkind
(N
) in N_Entity
);
5444 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag78 := Val;
5447 procedure Set_Flag79 (N : Node_Id; Val : Boolean) is
5449 pragma Assert (Nkind (N) in N_Entity);
5452 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag79
:= Val
;
5455 procedure Set_Flag80
(N
: Node_Id
; Val
: Boolean) is
5457 pragma Assert
(Nkind
(N
) in N_Entity
);
5460 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag80 := Val;
5463 procedure Set_Flag81 (N : Node_Id; Val : Boolean) is
5465 pragma Assert (Nkind (N) in N_Entity);
5468 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag81
:= Val
;
5471 procedure Set_Flag82
(N
: Node_Id
; Val
: Boolean) is
5473 pragma Assert
(Nkind
(N
) in N_Entity
);
5476 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag82 := Val;
5479 procedure Set_Flag83 (N : Node_Id; Val : Boolean) is
5481 pragma Assert (Nkind (N) in N_Entity);
5484 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag83
:= Val
;
5487 procedure Set_Flag84
(N
: Node_Id
; Val
: Boolean) is
5489 pragma Assert
(Nkind
(N
) in N_Entity
);
5492 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag84 := Val;
5495 procedure Set_Flag85 (N : Node_Id; Val : Boolean) is
5497 pragma Assert (Nkind (N) in N_Entity);
5500 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag85
:= Val
;
5503 procedure Set_Flag86
(N
: Node_Id
; Val
: Boolean) is
5505 pragma Assert
(Nkind
(N
) in N_Entity
);
5508 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag86 := Val;
5511 procedure Set_Flag87 (N : Node_Id; Val : Boolean) is
5513 pragma Assert (Nkind (N) in N_Entity);
5516 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag87
:= Val
;
5519 procedure Set_Flag88
(N
: Node_Id
; Val
: Boolean) is
5521 pragma Assert
(Nkind
(N
) in N_Entity
);
5524 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag88 := Val;
5527 procedure Set_Flag89 (N : Node_Id; Val : Boolean) is
5529 pragma Assert (Nkind (N) in N_Entity);
5532 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag89
:= Val
;
5535 procedure Set_Flag90
(N
: Node_Id
; Val
: Boolean) is
5537 pragma Assert
(Nkind
(N
) in N_Entity
);
5540 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag90 := Val;
5543 procedure Set_Flag91 (N : Node_Id; Val : Boolean) is
5545 pragma Assert (Nkind (N) in N_Entity);
5548 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag91
:= Val
;
5551 procedure Set_Flag92
(N
: Node_Id
; Val
: Boolean) is
5553 pragma Assert
(Nkind
(N
) in N_Entity
);
5556 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag92 := Val;
5559 procedure Set_Flag93 (N : Node_Id; Val : Boolean) is
5561 pragma Assert (Nkind (N) in N_Entity);
5564 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag93
:= Val
;
5567 procedure Set_Flag94
(N
: Node_Id
; Val
: Boolean) is
5569 pragma Assert
(Nkind
(N
) in N_Entity
);
5572 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag94 := Val;
5575 procedure Set_Flag95 (N : Node_Id; Val : Boolean) is
5577 pragma Assert (Nkind (N) in N_Entity);
5580 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag95
:= Val
;
5583 procedure Set_Flag96
(N
: Node_Id
; Val
: Boolean) is
5585 pragma Assert
(Nkind
(N
) in N_Entity
);
5588 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag96 := Val;
5591 procedure Set_Flag97 (N : Node_Id; Val : Boolean) is
5593 pragma Assert (Nkind (N) in N_Entity);
5596 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag97
:= Val
;
5599 procedure Set_Flag98
(N
: Node_Id
; Val
: Boolean) is
5601 pragma Assert
(Nkind
(N
) in N_Entity
);
5604 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag98 := Val;
5607 procedure Set_Flag99 (N : Node_Id; Val : Boolean) is
5609 pragma Assert (Nkind (N) in N_Entity);
5612 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag99
:= Val
;
5615 procedure Set_Flag100
(N
: Node_Id
; Val
: Boolean) is
5617 pragma Assert
(Nkind
(N
) in N_Entity
);
5620 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag100 := Val;
5623 procedure Set_Flag101 (N : Node_Id; Val : Boolean) is
5625 pragma Assert (Nkind (N) in N_Entity);
5628 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag101
:= Val
;
5631 procedure Set_Flag102
(N
: Node_Id
; Val
: Boolean) is
5633 pragma Assert
(Nkind
(N
) in N_Entity
);
5636 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag102 := Val;
5639 procedure Set_Flag103 (N : Node_Id; Val : Boolean) is
5641 pragma Assert (Nkind (N) in N_Entity);
5644 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag103
:= Val
;
5647 procedure Set_Flag104
(N
: Node_Id
; Val
: Boolean) is
5649 pragma Assert
(Nkind
(N
) in N_Entity
);
5652 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag104 := Val;
5655 procedure Set_Flag105 (N : Node_Id; Val : Boolean) is
5657 pragma Assert (Nkind (N) in N_Entity);
5660 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag105
:= Val
;
5663 procedure Set_Flag106
(N
: Node_Id
; Val
: Boolean) is
5665 pragma Assert
(Nkind
(N
) in N_Entity
);
5668 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag106 := Val;
5671 procedure Set_Flag107 (N : Node_Id; Val : Boolean) is
5673 pragma Assert (Nkind (N) in N_Entity);
5676 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag107
:= Val
;
5679 procedure Set_Flag108
(N
: Node_Id
; Val
: Boolean) is
5681 pragma Assert
(Nkind
(N
) in N_Entity
);
5684 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag108 := Val;
5687 procedure Set_Flag109 (N : Node_Id; Val : Boolean) is
5689 pragma Assert (Nkind (N) in N_Entity);
5692 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag109
:= Val
;
5695 procedure Set_Flag110
(N
: Node_Id
; Val
: Boolean) is
5697 pragma Assert
(Nkind
(N
) in N_Entity
);
5700 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag110 := Val;
5703 procedure Set_Flag111 (N : Node_Id; Val : Boolean) is
5705 pragma Assert (Nkind (N) in N_Entity);
5708 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag111
:= Val
;
5711 procedure Set_Flag112
(N
: Node_Id
; Val
: Boolean) is
5713 pragma Assert
(Nkind
(N
) in N_Entity
);
5716 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag112 := Val;
5719 procedure Set_Flag113 (N : Node_Id; Val : Boolean) is
5721 pragma Assert (Nkind (N) in N_Entity);
5724 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag113
:= Val
;
5727 procedure Set_Flag114
(N
: Node_Id
; Val
: Boolean) is
5729 pragma Assert
(Nkind
(N
) in N_Entity
);
5732 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag114 := Val;
5735 procedure Set_Flag115 (N : Node_Id; Val : Boolean) is
5737 pragma Assert (Nkind (N) in N_Entity);
5740 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag115
:= Val
;
5743 procedure Set_Flag116
(N
: Node_Id
; Val
: Boolean) is
5745 pragma Assert
(Nkind
(N
) in N_Entity
);
5748 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag116 := Val;
5751 procedure Set_Flag117 (N : Node_Id; Val : Boolean) is
5753 pragma Assert (Nkind (N) in N_Entity);
5756 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag117
:= Val
;
5759 procedure Set_Flag118
(N
: Node_Id
; Val
: Boolean) is
5761 pragma Assert
(Nkind
(N
) in N_Entity
);
5764 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag118 := Val;
5767 procedure Set_Flag119 (N : Node_Id; Val : Boolean) is
5769 pragma Assert (Nkind (N) in N_Entity);
5772 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag119
:= Val
;
5775 procedure Set_Flag120
(N
: Node_Id
; Val
: Boolean) is
5777 pragma Assert
(Nkind
(N
) in N_Entity
);
5780 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag120 := Val;
5783 procedure Set_Flag121 (N : Node_Id; Val : Boolean) is
5785 pragma Assert (Nkind (N) in N_Entity);
5788 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag121
:= Val
;
5791 procedure Set_Flag122
(N
: Node_Id
; Val
: Boolean) is
5793 pragma Assert
(Nkind
(N
) in N_Entity
);
5796 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag122 := Val;
5799 procedure Set_Flag123 (N : Node_Id; Val : Boolean) is
5801 pragma Assert (Nkind (N) in N_Entity);
5804 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag123
:= Val
;
5807 procedure Set_Flag124
(N
: Node_Id
; Val
: Boolean) is
5809 pragma Assert
(Nkind
(N
) in N_Entity
);
5812 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag124 := Val;
5815 procedure Set_Flag125 (N : Node_Id; Val : Boolean) is
5817 pragma Assert (Nkind (N) in N_Entity);
5820 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag125
:= Val
;
5823 procedure Set_Flag126
(N
: Node_Id
; Val
: Boolean) is
5825 pragma Assert
(Nkind
(N
) in N_Entity
);
5828 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag126 := Val;
5831 procedure Set_Flag127 (N : Node_Id; Val : Boolean) is
5833 pragma Assert (Nkind (N) in N_Entity);
5836 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag127
:= Val
;
5839 procedure Set_Flag128
(N
: Node_Id
; Val
: Boolean) is
5841 pragma Assert
(Nkind
(N
) in N_Entity
);
5844 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag128 := Val;
5847 procedure Set_Flag129 (N : Node_Id; Val : Boolean) is
5849 pragma Assert (Nkind (N) in N_Entity);
5850 Nodes.Table (N + 3).In_List := Val;
5853 procedure Set_Flag130 (N : Node_Id; Val : Boolean) is
5855 pragma Assert (Nkind (N) in N_Entity);
5856 Nodes.Table (N + 3).Unused_1 := Val;
5859 procedure Set_Flag131 (N : Node_Id; Val : Boolean) is
5861 pragma Assert (Nkind (N) in N_Entity);
5862 Nodes.Table (N + 3).Rewrite_Ins := Val;
5865 procedure Set_Flag132 (N : Node_Id; Val : Boolean) is
5867 pragma Assert (Nkind (N) in N_Entity);
5868 Nodes.Table (N + 3).Analyzed := Val;
5871 procedure Set_Flag133 (N : Node_Id; Val : Boolean) is
5873 pragma Assert (Nkind (N) in N_Entity);
5874 Nodes.Table (N + 3).Comes_From_Source := Val;
5877 procedure Set_Flag134 (N : Node_Id; Val : Boolean) is
5879 pragma Assert (Nkind (N) in N_Entity);
5880 Nodes.Table (N + 3).Error_Posted := Val;
5883 procedure Set_Flag135 (N : Node_Id; Val : Boolean) is
5885 pragma Assert (Nkind (N) in N_Entity);
5886 Nodes.Table (N + 3).Flag4 := Val;
5889 procedure Set_Flag136 (N : Node_Id; Val : Boolean) is
5891 pragma Assert (Nkind (N) in N_Entity);
5892 Nodes.Table (N + 3).Flag5 := Val;
5895 procedure Set_Flag137 (N : Node_Id; Val : Boolean) is
5897 pragma Assert (Nkind (N) in N_Entity);
5898 Nodes.Table (N + 3).Flag6 := Val;
5901 procedure Set_Flag138 (N : Node_Id; Val : Boolean) is
5903 pragma Assert (Nkind (N) in N_Entity);
5904 Nodes.Table (N + 3).Flag7 := Val;
5907 procedure Set_Flag139 (N : Node_Id; Val : Boolean) is
5909 pragma Assert (Nkind (N) in N_Entity);
5910 Nodes.Table (N + 3).Flag8 := Val;
5913 procedure Set_Flag140 (N : Node_Id; Val : Boolean) is
5915 pragma Assert (Nkind (N) in N_Entity);
5916 Nodes.Table (N + 3).Flag9 := Val;
5919 procedure Set_Flag141 (N : Node_Id; Val : Boolean) is
5921 pragma Assert (Nkind (N) in N_Entity);
5922 Nodes.Table (N + 3).Flag10 := Val;
5925 procedure Set_Flag142 (N : Node_Id; Val : Boolean) is
5927 pragma Assert (Nkind (N) in N_Entity);
5928 Nodes.Table (N + 3).Flag11 := Val;
5931 procedure Set_Flag143 (N : Node_Id; Val : Boolean) is
5933 pragma Assert (Nkind (N) in N_Entity);
5934 Nodes.Table (N + 3).Flag12 := Val;
5937 procedure Set_Flag144 (N : Node_Id; Val : Boolean) is
5939 pragma Assert (Nkind (N) in N_Entity);
5940 Nodes.Table (N + 3).Flag13 := Val;
5943 procedure Set_Flag145 (N : Node_Id; Val : Boolean) is
5945 pragma Assert (Nkind (N) in N_Entity);
5946 Nodes.Table (N + 3).Flag14 := Val;
5949 procedure Set_Flag146 (N : Node_Id; Val : Boolean) is
5951 pragma Assert (Nkind (N) in N_Entity);
5952 Nodes.Table (N + 3).Flag15 := Val;
5955 procedure Set_Flag147 (N : Node_Id; Val : Boolean) is
5957 pragma Assert (Nkind (N) in N_Entity);
5958 Nodes.Table (N + 3).Flag16 := Val;
5961 procedure Set_Flag148 (N : Node_Id; Val : Boolean) is
5963 pragma Assert (Nkind (N) in N_Entity);
5964 Nodes.Table (N + 3).Flag17 := Val;
5967 procedure Set_Flag149 (N : Node_Id; Val : Boolean) is
5969 pragma Assert (Nkind (N) in N_Entity);
5970 Nodes.Table (N + 3).Flag18 := Val;
5973 procedure Set_Flag150 (N : Node_Id; Val : Boolean) is
5975 pragma Assert (Nkind (N) in N_Entity);
5976 Nodes.Table (N + 3).Pflag1 := Val;
5979 procedure Set_Flag151 (N : Node_Id; Val : Boolean) is
5981 pragma Assert (Nkind (N) in N_Entity);
5982 Nodes.Table (N + 3).Pflag2 := Val;
5985 procedure Set_Flag152 (N : Node_Id; Val : Boolean) is
5987 pragma Assert (Nkind (N) in N_Entity);
5990 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag152
:= Val
;
5993 procedure Set_Flag153
(N
: Node_Id
; Val
: Boolean) is
5995 pragma Assert
(Nkind
(N
) in N_Entity
);
5998 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag153 := Val;
6001 procedure Set_Flag154 (N : Node_Id; Val : Boolean) is
6003 pragma Assert (Nkind (N) in N_Entity);
6006 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag154
:= Val
;
6009 procedure Set_Flag155
(N
: Node_Id
; Val
: Boolean) is
6011 pragma Assert
(Nkind
(N
) in N_Entity
);
6014 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag155 := Val;
6017 procedure Set_Flag156 (N : Node_Id; Val : Boolean) is
6019 pragma Assert (Nkind (N) in N_Entity);
6022 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag156
:= Val
;
6025 procedure Set_Flag157
(N
: Node_Id
; Val
: Boolean) is
6027 pragma Assert
(Nkind
(N
) in N_Entity
);
6030 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag157 := Val;
6033 procedure Set_Flag158 (N : Node_Id; Val : Boolean) is
6035 pragma Assert (Nkind (N) in N_Entity);
6038 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag158
:= Val
;
6041 procedure Set_Flag159
(N
: Node_Id
; Val
: Boolean) is
6043 pragma Assert
(Nkind
(N
) in N_Entity
);
6046 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag159 := Val;
6049 procedure Set_Flag160 (N : Node_Id; Val : Boolean) is
6051 pragma Assert (Nkind (N) in N_Entity);
6054 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag160
:= Val
;
6057 procedure Set_Flag161
(N
: Node_Id
; Val
: Boolean) is
6059 pragma Assert
(Nkind
(N
) in N_Entity
);
6062 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag161 := Val;
6065 procedure Set_Flag162 (N : Node_Id; Val : Boolean) is
6067 pragma Assert (Nkind (N) in N_Entity);
6070 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag162
:= Val
;
6073 procedure Set_Flag163
(N
: Node_Id
; Val
: Boolean) is
6075 pragma Assert
(Nkind
(N
) in N_Entity
);
6078 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag163 := Val;
6081 procedure Set_Flag164 (N : Node_Id; Val : Boolean) is
6083 pragma Assert (Nkind (N) in N_Entity);
6086 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag164
:= Val
;
6089 procedure Set_Flag165
(N
: Node_Id
; Val
: Boolean) is
6091 pragma Assert
(Nkind
(N
) in N_Entity
);
6094 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag165 := Val;
6097 procedure Set_Flag166 (N : Node_Id; Val : Boolean) is
6099 pragma Assert (Nkind (N) in N_Entity);
6102 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag166
:= Val
;
6105 procedure Set_Flag167
(N
: Node_Id
; Val
: Boolean) is
6107 pragma Assert
(Nkind
(N
) in N_Entity
);
6110 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag167 := Val;
6113 procedure Set_Flag168 (N : Node_Id; Val : Boolean) is
6115 pragma Assert (Nkind (N) in N_Entity);
6118 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag168
:= Val
;
6121 procedure Set_Flag169
(N
: Node_Id
; Val
: Boolean) is
6123 pragma Assert
(Nkind
(N
) in N_Entity
);
6126 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag169 := Val;
6129 procedure Set_Flag170 (N : Node_Id; Val : Boolean) is
6131 pragma Assert (Nkind (N) in N_Entity);
6134 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag170
:= Val
;
6137 procedure Set_Flag171
(N
: Node_Id
; Val
: Boolean) is
6139 pragma Assert
(Nkind
(N
) in N_Entity
);
6142 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag171 := Val;
6145 procedure Set_Flag172 (N : Node_Id; Val : Boolean) is
6147 pragma Assert (Nkind (N) in N_Entity);
6150 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag172
:= Val
;
6153 procedure Set_Flag173
(N
: Node_Id
; Val
: Boolean) is
6155 pragma Assert
(Nkind
(N
) in N_Entity
);
6158 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag173 := Val;
6161 procedure Set_Flag174 (N : Node_Id; Val : Boolean) is
6163 pragma Assert (Nkind (N) in N_Entity);
6166 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag174
:= Val
;
6169 procedure Set_Flag175
(N
: Node_Id
; Val
: Boolean) is
6171 pragma Assert
(Nkind
(N
) in N_Entity
);
6174 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag175 := Val;
6177 procedure Set_Flag176 (N : Node_Id; Val : Boolean) is
6179 pragma Assert (Nkind (N) in N_Entity);
6182 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag176
:= Val
;
6185 procedure Set_Flag177
(N
: Node_Id
; Val
: Boolean) is
6187 pragma Assert
(Nkind
(N
) in N_Entity
);
6190 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag177 := Val;
6193 procedure Set_Flag178 (N : Node_Id; Val : Boolean) is
6195 pragma Assert (Nkind (N) in N_Entity);
6198 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag178
:= Val
;
6201 procedure Set_Flag179
(N
: Node_Id
; Val
: Boolean) is
6203 pragma Assert
(Nkind
(N
) in N_Entity
);
6206 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag179 := Val;
6209 procedure Set_Flag180 (N : Node_Id; Val : Boolean) is
6211 pragma Assert (Nkind (N) in N_Entity);
6214 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag180
:= Val
;
6217 procedure Set_Flag181
(N
: Node_Id
; Val
: Boolean) is
6219 pragma Assert
(Nkind
(N
) in N_Entity
);
6222 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag181 := Val;
6225 procedure Set_Flag182 (N : Node_Id; Val : Boolean) is
6227 pragma Assert (Nkind (N) in N_Entity);
6230 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag182
:= Val
;
6233 procedure Set_Flag183
(N
: Node_Id
; Val
: Boolean) is
6235 pragma Assert
(Nkind
(N
) in N_Entity
);
6238 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag183 := Val;
6241 procedure Set_Flag184 (N : Node_Id; Val : Boolean) is
6243 pragma Assert (Nkind (N) in N_Entity);
6246 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag184
:= Val
;
6249 procedure Set_Flag185
(N
: Node_Id
; Val
: Boolean) is
6251 pragma Assert
(Nkind
(N
) in N_Entity
);
6254 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag185 := Val;
6257 procedure Set_Flag186 (N : Node_Id; Val : Boolean) is
6259 pragma Assert (Nkind (N) in N_Entity);
6262 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag186
:= Val
;
6265 procedure Set_Flag187
(N
: Node_Id
; Val
: Boolean) is
6267 pragma Assert
(Nkind
(N
) in N_Entity
);
6270 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag187 := Val;
6273 procedure Set_Flag188 (N : Node_Id; Val : Boolean) is
6275 pragma Assert (Nkind (N) in N_Entity);
6278 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag188
:= Val
;
6281 procedure Set_Flag189
(N
: Node_Id
; Val
: Boolean) is
6283 pragma Assert
(Nkind
(N
) in N_Entity
);
6286 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag189 := Val;
6289 procedure Set_Flag190 (N : Node_Id; Val : Boolean) is
6291 pragma Assert (Nkind (N) in N_Entity);
6294 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag190
:= Val
;
6297 procedure Set_Flag191
(N
: Node_Id
; Val
: Boolean) is
6299 pragma Assert
(Nkind
(N
) in N_Entity
);
6302 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag191 := Val;
6305 procedure Set_Flag192 (N : Node_Id; Val : Boolean) is
6307 pragma Assert (Nkind (N) in N_Entity);
6310 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag192
:= Val
;
6313 procedure Set_Flag193
(N
: Node_Id
; Val
: Boolean) is
6315 pragma Assert
(Nkind
(N
) in N_Entity
);
6318 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag193 := Val;
6321 procedure Set_Flag194 (N : Node_Id; Val : Boolean) is
6323 pragma Assert (Nkind (N) in N_Entity);
6326 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag194
:= Val
;
6329 procedure Set_Flag195
(N
: Node_Id
; Val
: Boolean) is
6331 pragma Assert
(Nkind
(N
) in N_Entity
);
6334 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag195 := Val;
6337 procedure Set_Flag196 (N : Node_Id; Val : Boolean) is
6339 pragma Assert (Nkind (N) in N_Entity);
6342 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag196
:= Val
;
6345 procedure Set_Flag197
(N
: Node_Id
; Val
: Boolean) is
6347 pragma Assert
(Nkind
(N
) in N_Entity
);
6350 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag197 := Val;
6353 procedure Set_Flag198 (N : Node_Id; Val : Boolean) is
6355 pragma Assert (Nkind (N) in N_Entity);
6358 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag198
:= Val
;
6361 procedure Set_Flag199
(N
: Node_Id
; Val
: Boolean) is
6363 pragma Assert
(Nkind
(N
) in N_Entity
);
6366 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag199 := Val;
6369 procedure Set_Flag200 (N : Node_Id; Val : Boolean) is
6371 pragma Assert (Nkind (N) in N_Entity);
6374 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag200
:= Val
;
6377 procedure Set_Flag201
(N
: Node_Id
; Val
: Boolean) is
6379 pragma Assert
(Nkind
(N
) in N_Entity
);
6382 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag201 := Val;
6385 procedure Set_Flag202 (N : Node_Id; Val : Boolean) is
6387 pragma Assert (Nkind (N) in N_Entity);
6390 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag202
:= Val
;
6393 procedure Set_Flag203
(N
: Node_Id
; Val
: Boolean) is
6395 pragma Assert
(Nkind
(N
) in N_Entity
);
6398 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag203 := Val;
6401 procedure Set_Flag204 (N : Node_Id; Val : Boolean) is
6403 pragma Assert (Nkind (N) in N_Entity);
6406 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag204
:= Val
;
6409 procedure Set_Flag205
(N
: Node_Id
; Val
: Boolean) is
6411 pragma Assert
(Nkind
(N
) in N_Entity
);
6414 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag205 := Val;
6417 procedure Set_Flag206 (N : Node_Id; Val : Boolean) is
6419 pragma Assert (Nkind (N) in N_Entity);
6422 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag206
:= Val
;
6425 procedure Set_Flag207
(N
: Node_Id
; Val
: Boolean) is
6427 pragma Assert
(Nkind
(N
) in N_Entity
);
6430 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag207 := Val;
6433 procedure Set_Flag208 (N : Node_Id; Val : Boolean) is
6435 pragma Assert (Nkind (N) in N_Entity);
6438 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag208
:= Val
;
6441 procedure Set_Flag209
(N
: Node_Id
; Val
: Boolean) is
6443 pragma Assert
(Nkind
(N
) in N_Entity
);
6446 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag209 := Val;
6449 procedure Set_Flag210 (N : Node_Id; Val : Boolean) is
6451 pragma Assert (Nkind (N) in N_Entity);
6454 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag210
:= Val
;
6457 procedure Set_Flag211
(N
: Node_Id
; Val
: Boolean) is
6459 pragma Assert
(Nkind
(N
) in N_Entity
);
6462 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag211 := Val;
6465 procedure Set_Flag212 (N : Node_Id; Val : Boolean) is
6467 pragma Assert (Nkind (N) in N_Entity);
6470 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag212
:= Val
;
6473 procedure Set_Flag213
(N
: Node_Id
; Val
: Boolean) is
6475 pragma Assert
(Nkind
(N
) in N_Entity
);
6478 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag213 := Val;
6481 procedure Set_Flag214 (N : Node_Id; Val : Boolean) is
6483 pragma Assert (Nkind (N) in N_Entity);
6486 (Nodes
.Table
(N
+ 4).Field11
'Unrestricted_Access)).Flag214
:= Val
;
6489 procedure Set_Flag215
(N
: Node_Id
; Val
: Boolean) is
6491 pragma Assert
(Nkind
(N
) in N_Entity
);
6494 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag215 := Val;
6497 procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id) is
6499 pragma Assert (N in Nodes.First .. Nodes.Last);
6500 if Val > Error then Set_Parent (Val, N); end if;
6502 end Set_Node1_With_Parent;
6504 procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id) is
6506 pragma Assert (N in Nodes.First .. Nodes.Last);
6507 if Val > Error then Set_Parent (Val, N); end if;
6509 end Set_Node2_With_Parent;
6511 procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id) is
6513 pragma Assert (N in Nodes.First .. Nodes.Last);
6514 if Val > Error then Set_Parent (Val, N); end if;
6516 end Set_Node3_With_Parent;
6518 procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id) is
6520 pragma Assert (N in Nodes.First .. Nodes.Last);
6521 if Val > Error then Set_Parent (Val, N); end if;
6523 end Set_Node4_With_Parent;
6525 procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id) is
6527 pragma Assert (N in Nodes.First .. Nodes.Last);
6528 if Val > Error then Set_Parent (Val, N); end if;
6530 end Set_Node5_With_Parent;
6532 procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id) is
6534 pragma Assert (N in Nodes.First .. Nodes.Last);
6535 if Val /= No_List and then Val /= Error_List then
6536 Set_Parent (Val, N);
6539 end Set_List1_With_Parent;
6541 procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id) is
6543 pragma Assert (N in Nodes.First .. Nodes.Last);
6544 if Val /= No_List and then Val /= Error_List then
6545 Set_Parent (Val, N);
6548 end Set_List2_With_Parent;
6550 procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id) is
6552 pragma Assert (N in Nodes.First .. Nodes.Last);
6553 if Val /= No_List and then Val /= Error_List then
6554 Set_Parent (Val, N);
6557 end Set_List3_With_Parent;
6559 procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id) is
6561 pragma Assert (N in Nodes.First .. Nodes.Last);
6562 if Val /= No_List and then Val /= Error_List then
6563 Set_Parent (Val, N);
6566 end Set_List4_With_Parent;
6568 procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id) is
6570 pragma Assert (N in Nodes.First .. Nodes.Last);
6571 if Val /= No_List and then Val /= Error_List then
6572 Set_Parent (Val, N);
6575 end Set_List5_With_Parent;
6577 end Unchecked_Access;