1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
10 -- Copyright (C) 1992-2001, Free Software Foundation, Inc. --
12 -- GNAT is free software; you can redistribute it and/or modify it under --
13 -- terms of the GNU General Public License as published by the Free Soft- --
14 -- ware Foundation; either version 2, or (at your option) any later ver- --
15 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
16 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
17 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
18 -- for more details. You should have received a copy of the GNU General --
19 -- Public License distributed with GNAT; see file COPYING. If not, write --
20 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
21 -- MA 02111-1307, USA. --
23 -- As a special exception, if other files instantiate generics from this --
24 -- unit, or you link this unit with other files to produce an executable, --
25 -- this unit does not by itself cause the resulting executable to be --
26 -- covered by the GNU General Public License. This exception does not --
27 -- however invalidate any other reasons why the executable file might be --
28 -- covered by the GNU Public License. --
30 -- GNAT was originally developed by the GNAT team at New York University. --
31 -- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). --
33 ------------------------------------------------------------------------------
35 pragma Style_Checks
(All_Checks
);
36 -- Turn off subprogram ordering check for this package
38 -- WARNING: There is a C version of this package. Any changes to this source
39 -- file must be properly reflected in the C header a-atree.h (for inlined
40 -- bodies) and the C file a-atree.c (for remaining non-inlined bodies).
42 with Debug
; use Debug
;
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 in the
93 -- Field12 field of the third component of an extended (entity) node.
95 type Flag_Word
is record
123 Convention
: Convention_Id
;
126 pragma Pack
(Flag_Word
);
127 for Flag_Word
'Size use 32;
128 for Flag_Word
'Alignment use 4;
130 type Flag_Word_Ptr
is access all Flag_Word
;
131 type Union_Id_Ptr
is access all Union_Id
;
133 function To_Flag_Word
is new
134 Unchecked_Conversion
(Union_Id
, Flag_Word
);
136 function To_Flag_Word_Ptr
is new
137 Unchecked_Conversion
(Union_Id_Ptr
, Flag_Word_Ptr
);
139 -- The following declarations are used to store flags 97-128 in the
140 -- Field12 field of the fourth component of an extended (entity) node.
142 type Flag_Word2
is record
180 pragma Pack
(Flag_Word2
);
181 for Flag_Word2
'Size use 32;
182 for Flag_Word2
'Alignment use 4;
184 type Flag_Word2_Ptr
is access all Flag_Word2
;
186 function To_Flag_Word2
is new
187 Unchecked_Conversion
(Union_Id
, Flag_Word2
);
189 function To_Flag_Word2_Ptr
is new
190 Unchecked_Conversion
(Union_Id_Ptr
, Flag_Word2_Ptr
);
192 -- The following declarations are used to store flags 97-120 in the
193 -- Field12 field of the fourth component of an extended (entity) node.
195 type Flag_Word3
is record
233 pragma Pack
(Flag_Word3
);
234 for Flag_Word3
'Size use 32;
235 for Flag_Word3
'Alignment use 4;
237 type Flag_Word3_Ptr
is access all Flag_Word3
;
239 function To_Flag_Word3
is new
240 Unchecked_Conversion
(Union_Id
, Flag_Word3
);
242 function To_Flag_Word3_Ptr
is new
243 Unchecked_Conversion
(Union_Id_Ptr
, Flag_Word3_Ptr
);
245 -- Default value used to initialize default nodes. Note that some of the
246 -- fields get overwritten, and in particular, Nkind always gets reset.
248 Default_Node
: Node_Record
:= (
249 Is_Extension
=> False,
254 Rewrite_Ins
=> False,
256 Comes_From_Source
=> False, -- modified by Set_Comes_From_Source_Default
257 Error_Posted
=> False,
276 Nkind
=> N_Unused_At_Start
,
279 Link
=> Empty_List_Or_Node
,
280 Field1
=> Empty_List_Or_Node
,
281 Field2
=> Empty_List_Or_Node
,
282 Field3
=> Empty_List_Or_Node
,
283 Field4
=> Empty_List_Or_Node
,
284 Field5
=> Empty_List_Or_Node
);
286 -- Default value used to initialize node extensions (i.e. the second
287 -- and third and fourth components of an extended node). Note we are
288 -- cheating a bit here when it comes to Node12, which really holds
289 -- flags an (for the third component), the convention. But it works
290 -- because Empty, False, Convention_Ada, all happen to be all zero bits.
292 Default_Node_Extension
: constant Node_Record
:= (
293 Is_Extension
=> True,
298 Rewrite_Ins
=> False,
300 Comes_From_Source
=> False,
301 Error_Posted
=> False,
320 Nkind
=> E_To_N
(E_Void
),
322 Field6
=> Empty_List_Or_Node
,
323 Field7
=> Empty_List_Or_Node
,
324 Field8
=> Empty_List_Or_Node
,
325 Field9
=> Empty_List_Or_Node
,
326 Field10
=> Empty_List_Or_Node
,
327 Field11
=> Empty_List_Or_Node
,
328 Field12
=> Empty_List_Or_Node
);
330 --------------------------------------------------
331 -- Implementation of Tree Substitution Routines --
332 --------------------------------------------------
334 -- A separate table keeps track of the mapping between rewritten nodes
335 -- and their corresponding original tree nodes. Rewrite makes an entry
336 -- in this table for use by Original_Node. By default, if no call is
337 -- Rewrite, the entry in this table points to the original unwritten node.
339 -- Note: eventually, this should be a field in the Node directly, but
340 -- for now we do not want to disturb the efficiency of a power of 2
343 package Orig_Nodes
is new Table
.Table
(
344 Table_Component_Type
=> Node_Id
,
345 Table_Index_Type
=> Node_Id
,
346 Table_Low_Bound
=> First_Node_Id
,
347 Table_Initial
=> Alloc
.Orig_Nodes_Initial
,
348 Table_Increment
=> Alloc
.Orig_Nodes_Increment
,
349 Table_Name
=> "Orig_Nodes");
351 -----------------------
352 -- Local Subprograms --
353 -----------------------
355 procedure Fix_Parent
(Field
: Union_Id
; Old_Node
, New_Node
: Node_Id
);
356 -- This subprogram is used to fixup parent pointers that are rendered
357 -- incorrect because of a node copy. Field is checked to see if it
358 -- points to a node, list, or element list that has a parent that
359 -- points to Old_Node. If so, the parent is reset to point to New_Node.
365 function Analyzed
(N
: Node_Id
) return Boolean is
367 pragma Assert
(N
in Nodes
.First
.. Nodes
.Last
);
368 return Nodes
.Table
(N
).Analyzed
;
375 procedure Change_Node
(N
: Node_Id
; New_Node_Kind
: Node_Kind
) is
376 Save_Sloc
: constant Source_Ptr
:= Sloc
(N
);
377 Save_In_List
: constant Boolean := Nodes
.Table
(N
).In_List
;
378 Save_Link
: constant Union_Id
:= Nodes
.Table
(N
).Link
;
379 Save_CFS
: constant Boolean := Nodes
.Table
(N
).Comes_From_Source
;
380 Save_Posted
: constant Boolean := Nodes
.Table
(N
).Error_Posted
;
381 Par_Count
: Paren_Count_Type
:= 0;
384 if Nkind
(N
) in N_Subexpr
then
385 Par_Count
:= Paren_Count
(N
);
388 Nodes
.Table
(N
) := Default_Node
;
389 Nodes
.Table
(N
).Sloc
:= Save_Sloc
;
390 Nodes
.Table
(N
).In_List
:= Save_In_List
;
391 Nodes
.Table
(N
).Link
:= Save_Link
;
392 Nodes
.Table
(N
).Comes_From_Source
:= Save_CFS
;
393 Nodes
.Table
(N
).Nkind
:= New_Node_Kind
;
394 Nodes
.Table
(N
).Error_Posted
:= Save_Posted
;
396 if New_Node_Kind
in N_Subexpr
then
397 Set_Paren_Count
(N
, Par_Count
);
401 -----------------------
402 -- Comes_From_Source --
403 -----------------------
405 function Comes_From_Source
(N
: Node_Id
) return Boolean is
407 pragma Assert
(N
in Nodes
.First
.. Nodes
.Last
);
408 return Nodes
.Table
(N
).Comes_From_Source
;
409 end Comes_From_Source
;
415 function Convention
(E
: Entity_Id
) return Convention_Id
is
417 pragma Assert
(Nkind
(E
) in N_Entity
);
418 return To_Flag_Word
(Nodes
.Table
(E
+ 2).Field12
).Convention
;
425 procedure Copy_Node
(Source
: Node_Id
; Destination
: Node_Id
) is
426 Save_In_List
: constant Boolean := Nodes
.Table
(Destination
).In_List
;
427 Save_Link
: constant Union_Id
:= Nodes
.Table
(Destination
).Link
;
430 Nodes
.Table
(Destination
) := Nodes
.Table
(Source
);
431 Nodes
.Table
(Destination
).In_List
:= Save_In_List
;
432 Nodes
.Table
(Destination
).Link
:= Save_Link
;
434 if Has_Extension
(Source
) then
435 pragma Assert
(Has_Extension
(Destination
));
436 Nodes
.Table
(Destination
+ 1) := Nodes
.Table
(Source
+ 1);
437 Nodes
.Table
(Destination
+ 2) := Nodes
.Table
(Source
+ 2);
438 Nodes
.Table
(Destination
+ 3) := Nodes
.Table
(Source
+ 3);
441 pragma Assert
(not Has_Extension
(Source
));
446 ------------------------
447 -- Copy_Separate_Tree --
448 ------------------------
450 function Copy_Separate_Tree
(Source
: Node_Id
) return Node_Id
is
453 function Copy_Entity
(E
: Entity_Id
) return Entity_Id
;
454 -- Copy Entity, copying only the Ekind and Chars fields
456 function Copy_List
(List
: List_Id
) return List_Id
;
459 function Possible_Copy
(Field
: Union_Id
) return Union_Id
;
460 -- Given a field, returns a copy of the node or list if its parent
461 -- is the current source node, and otherwise returns the input
467 function Copy_Entity
(E
: Entity_Id
) return Entity_Id
is
471 case N_Entity
(Nkind
(E
)) is
472 when N_Defining_Identifier
=>
473 New_Ent
:= New_Entity
(N_Defining_Identifier
, Sloc
(E
));
475 when N_Defining_Character_Literal
=>
476 New_Ent
:= New_Entity
(N_Defining_Character_Literal
, Sloc
(E
));
478 when N_Defining_Operator_Symbol
=>
479 New_Ent
:= New_Entity
(N_Defining_Operator_Symbol
, Sloc
(E
));
482 Set_Chars
(New_Ent
, Chars
(E
));
490 function Copy_List
(List
: List_Id
) return List_Id
is
495 if List
= No_List
then
502 while Present
(E
) loop
504 if Has_Extension
(E
) then
505 Append
(Copy_Entity
(E
), NL
);
507 Append
(Copy_Separate_Tree
(E
), NL
);
522 function Possible_Copy
(Field
: Union_Id
) return Union_Id
is
526 if Field
in Node_Range
then
528 New_N
:= Union_Id
(Copy_Separate_Tree
(Node_Id
(Field
)));
530 if Parent
(Node_Id
(Field
)) = Source
then
531 Set_Parent
(Node_Id
(New_N
), New_Id
);
536 elsif Field
in List_Range
then
537 New_N
:= Union_Id
(Copy_List
(List_Id
(Field
)));
539 if Parent
(List_Id
(Field
)) = Source
then
540 Set_Parent
(List_Id
(New_N
), New_Id
);
550 -- Start of processing for Copy_Separate_Tree
553 if Source
<= Empty_Or_Error
then
556 elsif Has_Extension
(Source
) then
557 return Copy_Entity
(Source
);
560 Nodes
.Increment_Last
;
561 New_Id
:= Nodes
.Last
;
562 Nodes
.Table
(New_Id
) := Nodes
.Table
(Source
);
563 Nodes
.Table
(New_Id
).Link
:= Empty_List_Or_Node
;
564 Nodes
.Table
(New_Id
).In_List
:= False;
565 Nodes
.Table
(New_Id
).Rewrite_Ins
:= False;
566 Node_Count
:= Node_Count
+ 1;
568 Orig_Nodes
.Increment_Last
;
569 Allocate_List_Tables
(Nodes
.Last
);
570 Orig_Nodes
.Table
(New_Id
) := New_Id
;
572 -- Recursively copy descendents
574 Set_Field1
(New_Id
, Possible_Copy
(Field1
(New_Id
)));
575 Set_Field2
(New_Id
, Possible_Copy
(Field2
(New_Id
)));
576 Set_Field3
(New_Id
, Possible_Copy
(Field3
(New_Id
)));
577 Set_Field4
(New_Id
, Possible_Copy
(Field4
(New_Id
)));
578 Set_Field5
(New_Id
, Possible_Copy
(Field5
(New_Id
)));
580 -- Set Entity field to Empty
581 -- Why is this done??? and why is it always right to do it???
583 if Nkind
(New_Id
) in N_Has_Entity
584 or else Nkind
(New_Id
) = N_Freeze_Entity
586 Set_Entity
(New_Id
, Empty
);
589 -- All done, return copied node
593 end Copy_Separate_Tree
;
599 procedure Delete_Node
(Node
: Node_Id
) is
601 pragma Assert
(not Nodes
.Table
(Node
).In_List
);
604 Write_Str
("Delete node ");
605 Write_Int
(Int
(Node
));
609 Nodes
.Table
(Node
) := Default_Node
;
610 Nodes
.Table
(Node
).Nkind
:= N_Unused_At_Start
;
611 Node_Count
:= Node_Count
- 1;
613 -- Note: for now, we are not bothering to reuse deleted nodes
621 procedure Delete_Tree
(Node
: Node_Id
) is
623 procedure Delete_Field
(F
: Union_Id
);
624 -- Delete item pointed to by field F if it is a syntactic element
626 procedure Delete_List
(L
: List_Id
);
627 -- Delete all elements on the given list
629 procedure Delete_Field
(F
: Union_Id
) is
631 if F
= Union_Id
(Empty
) then
634 elsif F
in Node_Range
635 and then Parent
(Node_Id
(F
)) = Node
637 Delete_Tree
(Node_Id
(F
));
639 elsif F
in List_Range
640 and then Parent
(List_Id
(F
)) = Node
642 Delete_List
(List_Id
(F
));
644 -- No need to test Elist case, there are no syntactic Elists
651 procedure Delete_List
(L
: List_Id
) is
653 while Is_Non_Empty_List
(L
) loop
654 Delete_Tree
(Remove_Head
(L
));
658 -- Start of processing for Delete_Tree
661 -- Delete descendents
663 Delete_Field
(Field1
(Node
));
664 Delete_Field
(Field2
(Node
));
665 Delete_Field
(Field3
(Node
));
666 Delete_Field
(Field4
(Node
));
667 Delete_Field
(Field5
(Node
));
675 function Ekind
(E
: Entity_Id
) return Entity_Kind
is
677 pragma Assert
(Nkind
(E
) in N_Entity
);
678 return N_To_E
(Nodes
.Table
(E
+ 1).Nkind
);
685 function Error_Posted
(N
: Node_Id
) return Boolean is
687 pragma Assert
(N
in Nodes
.First
.. Nodes
.Last
);
688 return Nodes
.Table
(N
).Error_Posted
;
691 -----------------------
692 -- Exchange_Entities --
693 -----------------------
695 procedure Exchange_Entities
(E1
: Entity_Id
; E2
: Entity_Id
) is
696 Temp_Ent
: Node_Record
;
699 pragma Assert
(Has_Extension
(E1
)
700 and then Has_Extension
(E2
)
701 and then not Nodes
.Table
(E1
).In_List
702 and then not Nodes
.Table
(E2
).In_List
);
704 -- Exchange the contents of the two entities
706 Temp_Ent
:= Nodes
.Table
(E1
);
707 Nodes
.Table
(E1
) := Nodes
.Table
(E2
);
708 Nodes
.Table
(E2
) := Temp_Ent
;
709 Temp_Ent
:= Nodes
.Table
(E1
+ 1);
710 Nodes
.Table
(E1
+ 1) := Nodes
.Table
(E2
+ 1);
711 Nodes
.Table
(E2
+ 1) := Temp_Ent
;
712 Temp_Ent
:= Nodes
.Table
(E1
+ 2);
713 Nodes
.Table
(E1
+ 2) := Nodes
.Table
(E2
+ 2);
714 Nodes
.Table
(E2
+ 2) := Temp_Ent
;
715 Temp_Ent
:= Nodes
.Table
(E1
+ 3);
716 Nodes
.Table
(E1
+ 3) := Nodes
.Table
(E2
+ 3);
717 Nodes
.Table
(E2
+ 3) := Temp_Ent
;
719 -- That exchange exchanged the parent pointers as well, which is what
720 -- we want, but we need to patch up the defining identifier pointers
721 -- in the parent nodes (the child pointers) to match this switch
722 -- unless for Implicit types entities which have no parent, in which
723 -- case we don't do anything otherwise we won't be able to revert back
724 -- to the original situation.
726 -- Shouldn't this use Is_Itype instead of the Parent test
728 if Present
(Parent
(E1
)) and then Present
(Parent
(E2
)) then
729 Set_Defining_Identifier
(Parent
(E1
), E1
);
730 Set_Defining_Identifier
(Parent
(E2
), E2
);
732 end Exchange_Entities
;
738 function Extend_Node
(Node
: Node_Id
) return Entity_Id
is
741 procedure Debug_Extend_Node
;
742 -- Debug routine for debug flag N
744 procedure Debug_Extend_Node
is
747 Write_Str
("Extend node ");
748 Write_Int
(Int
(Node
));
750 if Result
= Node
then
751 Write_Str
(" in place");
753 Write_Str
(" copied to ");
754 Write_Int
(Int
(Result
));
759 end Debug_Extend_Node
;
761 pragma Inline
(Debug_Extend_Node
);
764 if Node
/= Nodes
.Last
then
765 Nodes
.Increment_Last
;
766 Nodes
.Table
(Nodes
.Last
) := Nodes
.Table
(Node
);
767 Result
:= Nodes
.Last
;
769 Orig_Nodes
.Increment_Last
;
770 Orig_Nodes
.Table
(Nodes
.Last
) := Nodes
.Last
;
776 Nodes
.Increment_Last
;
777 Nodes
.Table
(Nodes
.Last
) := Default_Node_Extension
;
778 Nodes
.Increment_Last
;
779 Nodes
.Table
(Nodes
.Last
) := Default_Node_Extension
;
780 Nodes
.Increment_Last
;
781 Nodes
.Table
(Nodes
.Last
) := Default_Node_Extension
;
783 Orig_Nodes
.Set_Last
(Nodes
.Last
);
784 Allocate_List_Tables
(Nodes
.Last
);
786 pragma Debug
(Debug_Extend_Node
);
794 procedure Fix_Parent
(Field
: Union_Id
; Old_Node
, New_Node
: Node_Id
) is
796 -- Fix parent of node that is referenced by Field. Note that we must
797 -- exclude the case where the node is a member of a list, because in
798 -- this case the parent is the parent of the list.
800 if Field
in Node_Range
801 and then Present
(Node_Id
(Field
))
802 and then not Nodes
.Table
(Node_Id
(Field
)).In_List
803 and then Parent
(Node_Id
(Field
)) = Old_Node
805 Set_Parent
(Node_Id
(Field
), New_Node
);
807 -- Fix parent of list that is referenced by Field
809 elsif Field
in List_Range
810 and then Present
(List_Id
(Field
))
811 and then Parent
(List_Id
(Field
)) = Old_Node
813 Set_Parent
(List_Id
(Field
), New_Node
);
818 -----------------------------------
819 -- Get_Comes_From_Source_Default --
820 -----------------------------------
822 function Get_Comes_From_Source_Default
return Boolean is
824 return Default_Node
.Comes_From_Source
;
825 end Get_Comes_From_Source_Default
;
831 function Has_Extension
(N
: Node_Id
) return Boolean is
833 return N
< Nodes
.Last
and then Nodes
.Table
(N
+ 1).Is_Extension
;
840 procedure Initialize
is
844 -- Allocate Empty node
846 Dummy
:= New_Node
(N_Empty
, No_Location
);
847 Set_Name1
(Empty
, No_Name
);
849 -- Allocate Error node, and set Error_Posted, since we certainly
850 -- only generate an Error node if we do post some kind of error!
852 Dummy
:= New_Node
(N_Error
, No_Location
);
853 Set_Name1
(Error
, Error_Name
);
854 Set_Error_Posted
(Error
, True);
857 --------------------------
858 -- Is_Rewrite_Insertion --
859 --------------------------
861 function Is_Rewrite_Insertion
(Node
: Node_Id
) return Boolean is
863 return Nodes
.Table
(Node
).Rewrite_Ins
;
864 end Is_Rewrite_Insertion
;
866 -----------------------------
867 -- Is_Rewrite_Substitution --
868 -----------------------------
870 function Is_Rewrite_Substitution
(Node
: Node_Id
) return Boolean is
872 return Orig_Nodes
.Table
(Node
) /= Node
;
873 end Is_Rewrite_Substitution
;
879 function Last_Node_Id
return Node_Id
is
890 Nodes
.Locked
:= True;
891 Orig_Nodes
.Locked
:= True;
896 ----------------------------
897 -- Mark_Rewrite_Insertion --
898 ----------------------------
900 procedure Mark_Rewrite_Insertion
(New_Node
: Node_Id
) is
902 Nodes
.Table
(New_Node
).Rewrite_Ins
:= True;
903 end Mark_Rewrite_Insertion
;
909 function New_Copy
(Source
: Node_Id
) return Node_Id
is
913 if Source
<= Empty_Or_Error
then
917 Nodes
.Increment_Last
;
918 New_Id
:= Nodes
.Last
;
919 Nodes
.Table
(New_Id
) := Nodes
.Table
(Source
);
920 Nodes
.Table
(New_Id
).Link
:= Empty_List_Or_Node
;
921 Nodes
.Table
(New_Id
).In_List
:= False;
922 Nodes
.Table
(New_Id
).Rewrite_Ins
:= False;
924 Orig_Nodes
.Increment_Last
;
925 Orig_Nodes
.Table
(New_Id
) := New_Id
;
927 if Has_Extension
(Source
) then
928 Nodes
.Increment_Last
;
929 Nodes
.Table
(New_Id
+ 1) := Nodes
.Table
(Source
+ 1);
930 Nodes
.Increment_Last
;
931 Nodes
.Table
(New_Id
+ 2) := Nodes
.Table
(Source
+ 2);
932 Nodes
.Increment_Last
;
933 Nodes
.Table
(New_Id
+ 3) := Nodes
.Table
(Source
+ 3);
935 Orig_Nodes
.Set_Last
(Nodes
.Last
);
938 Allocate_List_Tables
(Nodes
.Last
);
939 Node_Count
:= Node_Count
+ 1;
948 -- Our approach here requires a two pass traversal of the tree. The
949 -- first pass visits all nodes that eventually will be copied looking
950 -- for defining Itypes. If any defining Itypes are found, then they are
951 -- copied, and an entry is added to the replacement map. In the second
952 -- phase, the tree is copied, using the replacement map to replace any
953 -- Itype references within the copied tree.
955 -- The following hash tables are used if the Map supplied has more
956 -- than hash threshhold entries to speed up access to the map. If
957 -- there are fewer entries, then the map is searched sequentially
958 -- (because setting up a hash table for only a few entries takes
959 -- more time than it saves.
961 -- Global variables are safe for this purpose, since there is no case
962 -- of a recursive call from the processing inside New_Copy_Tree.
964 NCT_Hash_Threshhold
: constant := 20;
965 -- If there are more than this number of pairs of entries in the
966 -- map, then Hash_Tables_Used will be set, and the hash tables will
967 -- be initialized and used for the searches.
969 NCT_Hash_Tables_Used
: Boolean := False;
970 -- Set to True if hash tables are in use
972 NCT_Table_Entries
: Nat
;
973 -- Count entries in table to see if threshhold is reached
975 NCT_Hash_Table_Setup
: Boolean := False;
976 -- Set to True if hash table contains data. We set this True if we
977 -- setup the hash table with data, and leave it set permanently
978 -- from then on, this is a signal that second and subsequent users
979 -- of the hash table must clear the old entries before reuse.
981 subtype NCT_Header_Num
is Int
range 0 .. 511;
982 -- Defines range of headers in hash tables (512 headers)
984 function New_Copy_Hash
(E
: Entity_Id
) return NCT_Header_Num
;
985 -- Hash function used for hash operations
987 function New_Copy_Hash
(E
: Entity_Id
) return NCT_Header_Num
is
989 return Nat
(E
) mod (NCT_Header_Num
'Last + 1);
992 -- The hash table NCT_Assoc associates old entities in the table
993 -- with their corresponding new entities (i.e. the pairs of entries
994 -- presented in the original Map argument are Key-Element pairs).
996 package NCT_Assoc
is new Simple_HTable
(
997 Header_Num
=> NCT_Header_Num
,
998 Element
=> Entity_Id
,
1001 Hash
=> New_Copy_Hash
,
1002 Equal
=> Types
."=");
1004 -- The hash table NCT_Itype_Assoc contains entries only for those
1005 -- old nodes which have a non-empty Associated_Node_For_Itype set.
1006 -- The key is the associated node, and the element is the new node
1007 -- itself (NOT the associated node for the new node).
1009 package NCT_Itype_Assoc
is new Simple_HTable
(
1010 Header_Num
=> NCT_Header_Num
,
1011 Element
=> Entity_Id
,
1012 No_Element
=> Empty
,
1014 Hash
=> New_Copy_Hash
,
1015 Equal
=> Types
."=");
1017 -- Start of New_Copy_Tree function
1019 function New_Copy_Tree
1021 Map
: Elist_Id
:= No_Elist
;
1022 New_Sloc
: Source_Ptr
:= No_Location
;
1023 New_Scope
: Entity_Id
:= Empty
)
1026 Actual_Map
: Elist_Id
:= Map
;
1027 -- This is the actual map for the copy. It is initialized with the
1028 -- given elements, and then enlarged as required for Itypes that are
1029 -- copied during the first phase of the copy operation. The visit
1030 -- procedures add elements to this map as Itypes are encountered.
1031 -- The reason we cannot use Map directly, is that it may well be
1032 -- (and normally is) initialized to No_Elist, and if we have mapped
1033 -- entities, we have to reset it to point to a real Elist.
1035 function Assoc
(N
: Node_Or_Entity_Id
) return Node_Id
;
1036 -- Called during second phase to map entities into their corresponding
1037 -- copies using Actual_Map. If the argument is not an entity, or is not
1038 -- in Actual_Map, then it is returned unchanged.
1040 procedure Build_NCT_Hash_Tables
;
1041 -- Builds hash tables (number of elements >= threshold value)
1043 function Copy_Elist_With_Replacement
1044 (Old_Elist
: Elist_Id
)
1046 -- Called during second phase to copy element list doing replacements.
1048 procedure Copy_Itype_With_Replacement
(New_Itype
: Entity_Id
);
1049 -- Called during the second phase to process a copied Itype. The actual
1050 -- copy happened during the first phase (so that we could make the entry
1051 -- in the mapping), but we still have to deal with the descendents of
1052 -- the copied Itype and copy them where necessary.
1054 function Copy_List_With_Replacement
(Old_List
: List_Id
) return List_Id
;
1055 -- Called during second phase to copy list doing replacements.
1057 function Copy_Node_With_Replacement
(Old_Node
: Node_Id
) return Node_Id
;
1058 -- Called during second phase to copy node doing replacements
1060 procedure Visit_Elist
(E
: Elist_Id
);
1061 -- Called during first phase to visit all elements of an Elist
1063 procedure Visit_Field
(F
: Union_Id
; N
: Node_Id
);
1064 -- Visit a single field, recursing to call Visit_Node or Visit_List
1065 -- if the field is a syntactic descendent of the current node (i.e.
1066 -- its parent is Node N).
1068 procedure Visit_Itype
(Old_Itype
: Entity_Id
);
1069 -- Called during first phase to visit subsidiary fields of a defining
1070 -- Itype, and also create a copy and make an entry in the replacement
1071 -- map for the new copy.
1073 procedure Visit_List
(L
: List_Id
);
1074 -- Called during first phase to visit all elements of a List
1076 procedure Visit_Node
(N
: Node_Or_Entity_Id
);
1077 -- Called during first phase to visit a node and all its subtrees
1083 function Assoc
(N
: Node_Or_Entity_Id
) return Node_Id
is
1088 if not Has_Extension
(N
) or else No
(Actual_Map
) then
1091 elsif NCT_Hash_Tables_Used
then
1092 Ent
:= NCT_Assoc
.Get
(Entity_Id
(N
));
1094 if Present
(Ent
) then
1100 -- No hash table used, do serial search
1103 E
:= First_Elmt
(Actual_Map
);
1104 while Present
(E
) loop
1105 if Node
(E
) = N
then
1106 return Node
(Next_Elmt
(E
));
1108 E
:= Next_Elmt
(Next_Elmt
(E
));
1116 ---------------------------
1117 -- Build_NCT_Hash_Tables --
1118 ---------------------------
1120 procedure Build_NCT_Hash_Tables
is
1124 if NCT_Hash_Table_Setup
then
1126 NCT_Itype_Assoc
.Reset
;
1129 Elmt
:= First_Elmt
(Actual_Map
);
1130 while Present
(Elmt
) loop
1133 NCT_Assoc
.Set
(Ent
, Node
(Elmt
));
1136 if Is_Type
(Ent
) then
1138 Anode
: constant Entity_Id
:=
1139 Associated_Node_For_Itype
(Ent
);
1142 if Present
(Anode
) then
1143 NCT_Itype_Assoc
.Set
(Anode
, Node
(Elmt
));
1149 NCT_Hash_Tables_Used
:= True;
1150 NCT_Hash_Table_Setup
:= True;
1151 end Build_NCT_Hash_Tables
;
1153 ---------------------------------
1154 -- Copy_Elist_With_Replacement --
1155 ---------------------------------
1157 function Copy_Elist_With_Replacement
1158 (Old_Elist
: Elist_Id
)
1162 New_Elist
: Elist_Id
;
1165 if No
(Old_Elist
) then
1169 New_Elist
:= New_Elmt_List
;
1170 M
:= First_Elmt
(Old_Elist
);
1172 while Present
(M
) loop
1173 Append_Elmt
(Copy_Node_With_Replacement
(Node
(M
)), New_Elist
);
1179 end Copy_Elist_With_Replacement
;
1181 ---------------------------------
1182 -- Copy_Itype_With_Replacement --
1183 ---------------------------------
1185 -- This routine exactly parallels its phase one analog Visit_Itype,
1186 -- and like that routine, knows far too many semantic details about
1187 -- the descendents of Itypes and whether they need copying or not.
1189 procedure Copy_Itype_With_Replacement
(New_Itype
: Entity_Id
) is
1191 -- Translate Next_Entity, Scope and Etype fields, in case they
1192 -- reference entities that have been mapped into copies.
1194 Set_Next_Entity
(New_Itype
, Assoc
(Next_Entity
(New_Itype
)));
1195 Set_Etype
(New_Itype
, Assoc
(Etype
(New_Itype
)));
1197 if Present
(New_Scope
) then
1198 Set_Scope
(New_Itype
, New_Scope
);
1200 Set_Scope
(New_Itype
, Assoc
(Scope
(New_Itype
)));
1203 -- Copy referenced fields
1205 if Is_Discrete_Type
(New_Itype
) then
1206 Set_Scalar_Range
(New_Itype
,
1207 Copy_Node_With_Replacement
(Scalar_Range
(New_Itype
)));
1209 elsif Has_Discriminants
(Base_Type
(New_Itype
)) then
1210 Set_Discriminant_Constraint
(New_Itype
,
1211 Copy_Elist_With_Replacement
1212 (Discriminant_Constraint
(New_Itype
)));
1214 elsif Is_Array_Type
(New_Itype
) then
1215 if Present
(First_Index
(New_Itype
)) then
1216 Set_First_Index
(New_Itype
,
1217 First
(Copy_List_With_Replacement
1218 (List_Containing
(First_Index
(New_Itype
)))));
1221 if Is_Packed
(New_Itype
) then
1222 Set_Packed_Array_Type
(New_Itype
,
1223 Copy_Node_With_Replacement
1224 (Packed_Array_Type
(New_Itype
)));
1227 end Copy_Itype_With_Replacement
;
1229 --------------------------------
1230 -- Copy_List_With_Replacement --
1231 --------------------------------
1233 function Copy_List_With_Replacement
1234 (Old_List
: List_Id
)
1241 if Old_List
= No_List
then
1245 New_List
:= Empty_List
;
1246 E
:= First
(Old_List
);
1247 while Present
(E
) loop
1248 Append
(Copy_Node_With_Replacement
(E
), New_List
);
1254 end Copy_List_With_Replacement
;
1256 --------------------------------
1257 -- Copy_Node_With_Replacement --
1258 --------------------------------
1260 function Copy_Node_With_Replacement
1261 (Old_Node
: Node_Id
)
1266 function Copy_Field_With_Replacement
1269 -- Given Field, which is a field of Old_Node, return a copy of it
1270 -- if it is a syntactic field (i.e. its parent is Node), setting
1271 -- the parent of the copy to poit to New_Node. Otherwise returns
1272 -- the field (possibly mapped if it is an entity).
1274 ---------------------------------
1275 -- Copy_Field_With_Replacement --
1276 ---------------------------------
1278 function Copy_Field_With_Replacement
1283 if Field
= Union_Id
(Empty
) then
1286 elsif Field
in Node_Range
then
1288 Old_N
: constant Node_Id
:= Node_Id
(Field
);
1292 -- If syntactic field, as indicated by the parent pointer
1293 -- being set, then copy the referenced node recursively.
1295 if Parent
(Old_N
) = Old_Node
then
1296 New_N
:= Copy_Node_With_Replacement
(Old_N
);
1298 if New_N
/= Old_N
then
1299 Set_Parent
(New_N
, New_Node
);
1302 -- For semantic fields, update possible entity reference
1303 -- from the replacement map.
1306 New_N
:= Assoc
(Old_N
);
1309 return Union_Id
(New_N
);
1312 elsif Field
in List_Range
then
1314 Old_L
: constant List_Id
:= List_Id
(Field
);
1318 -- If syntactic field, as indicated by the parent pointer,
1319 -- then recursively copy the entire referenced list.
1321 if Parent
(Old_L
) = Old_Node
then
1322 New_L
:= Copy_List_With_Replacement
(Old_L
);
1323 Set_Parent
(New_L
, New_Node
);
1325 -- For semantic list, just returned unchanged
1331 return Union_Id
(New_L
);
1334 -- Anything other than a list or a node is returned unchanged
1339 end Copy_Field_With_Replacement
;
1341 -- Start of processing for Copy_Node_With_Replacement
1344 if Old_Node
<= Empty_Or_Error
then
1347 elsif Has_Extension
(Old_Node
) then
1348 return Assoc
(Old_Node
);
1351 Nodes
.Increment_Last
;
1352 New_Node
:= Nodes
.Last
;
1353 Nodes
.Table
(New_Node
) := Nodes
.Table
(Old_Node
);
1354 Nodes
.Table
(New_Node
).Link
:= Empty_List_Or_Node
;
1355 Nodes
.Table
(New_Node
).In_List
:= False;
1356 Node_Count
:= Node_Count
+ 1;
1358 Orig_Nodes
.Increment_Last
;
1359 Allocate_List_Tables
(Nodes
.Last
);
1361 Orig_Nodes
.Table
(Nodes
.Last
) := Nodes
.Last
;
1363 -- If the node we are copying is the associated node of a
1364 -- previously copied Itype, then adjust the associated node
1365 -- of the copy of that Itype accordingly.
1367 if Present
(Actual_Map
) then
1373 -- Case of hash table used
1375 if NCT_Hash_Tables_Used
then
1376 Ent
:= NCT_Itype_Assoc
.Get
(Old_Node
);
1378 if Present
(Ent
) then
1379 Set_Associated_Node_For_Itype
(Ent
, New_Node
);
1382 -- Case of no hash table used
1385 E
:= First_Elmt
(Actual_Map
);
1386 while Present
(E
) loop
1387 if Old_Node
= Associated_Node_For_Itype
(Node
(E
)) then
1388 Set_Associated_Node_For_Itype
1389 (Node
(Next_Elmt
(E
)), New_Node
);
1392 E
:= Next_Elmt
(Next_Elmt
(E
));
1398 -- Recursively copy descendents
1401 (New_Node
, Copy_Field_With_Replacement
(Field1
(New_Node
)));
1403 (New_Node
, Copy_Field_With_Replacement
(Field2
(New_Node
)));
1405 (New_Node
, Copy_Field_With_Replacement
(Field3
(New_Node
)));
1407 (New_Node
, Copy_Field_With_Replacement
(Field4
(New_Node
)));
1409 (New_Node
, Copy_Field_With_Replacement
(Field5
(New_Node
)));
1411 -- If the original is marked as a rewrite insertion, then unmark
1412 -- the copy, since we inserted the original, not the copy.
1414 Nodes
.Table
(New_Node
).Rewrite_Ins
:= False;
1416 -- Adjust Sloc of new node if necessary
1418 if New_Sloc
/= No_Location
then
1419 Set_Sloc
(New_Node
, New_Sloc
);
1421 -- If we adjust the Sloc, then we are essentially making
1422 -- a completely new node, so the Comes_From_Source flag
1423 -- should be reset to the proper default value.
1425 Nodes
.Table
(New_Node
).Comes_From_Source
:=
1426 Default_Node
.Comes_From_Source
;
1429 -- Reset First_Real_Statement for Handled_Sequence_Of_Statements.
1430 -- The replacement mechanism applies to entities, and is not used
1431 -- here. Eventually we may need a more general graph-copying
1432 -- routine. For now, do a sequential search to find desired node.
1434 if Nkind
(Old_Node
) = N_Handled_Sequence_Of_Statements
1435 and then Present
(First_Real_Statement
(Old_Node
))
1438 Old_F
: constant Node_Id
:= First_Real_Statement
(Old_Node
);
1442 N1
:= First
(Statements
(Old_Node
));
1443 N2
:= First
(Statements
(New_Node
));
1445 while N1
/= Old_F
loop
1450 Set_First_Real_Statement
(New_Node
, N2
);
1455 -- All done, return copied node
1458 end Copy_Node_With_Replacement
;
1464 procedure Visit_Elist
(E
: Elist_Id
) is
1469 Elmt
:= First_Elmt
(E
);
1471 while Elmt
/= No_Elmt
loop
1472 Visit_Node
(Node
(Elmt
));
1482 procedure Visit_Field
(F
: Union_Id
; N
: Node_Id
) is
1484 if F
= Union_Id
(Empty
) then
1487 elsif F
in Node_Range
then
1489 -- Copy node if it is syntactic, i.e. its parent pointer is
1490 -- set to point to the field that referenced it (certain
1491 -- Itypes will also meet this criterion, which is fine, since
1492 -- these are clearly Itypes that do need to be copied, since
1493 -- we are copying their parent.)
1495 if Parent
(Node_Id
(F
)) = N
then
1496 Visit_Node
(Node_Id
(F
));
1499 -- Another case, if we are pointing to an Itype, then we want
1500 -- to copy it if its associated node is somewhere in the tree
1503 -- Note: the exclusion of self-referential copies is just an
1504 -- optimization, since the search of the already copied list
1505 -- would catch it, but it is a common case (Etype pointing
1506 -- to itself for an Itype that is a base type).
1508 elsif Has_Extension
(Node_Id
(F
))
1509 and then Is_Itype
(Entity_Id
(F
))
1510 and then Node_Id
(F
) /= N
1516 P
:= Associated_Node_For_Itype
(Node_Id
(F
));
1517 while Present
(P
) loop
1519 Visit_Node
(Node_Id
(F
));
1526 -- An Itype whose parent is not being copied definitely
1527 -- should NOT be copied, since it does not belong in any
1528 -- sense to the copied subtree.
1534 elsif F
in List_Range
1535 and then Parent
(List_Id
(F
)) = N
1537 Visit_List
(List_Id
(F
));
1546 -- Note: we are relying on far too much semantic knowledge in this
1547 -- routine, it really should just do a blind replacement of all
1548 -- fields, or at least a more blind replacement. For example, we
1549 -- do not deal with corresponding record types, and that works
1550 -- because we have no Itypes of task types, but nowhere is there
1551 -- a guarantee that this will always be the case. ???
1553 procedure Visit_Itype
(Old_Itype
: Entity_Id
) is
1554 New_Itype
: Entity_Id
;
1559 -- Itypes that describe the designated type of access to subprograms
1560 -- have the structure of subprogram declarations, with signatures,
1561 -- etc. Either we duplicate the signatures completely, or choose to
1562 -- share such itypes, which is fine because their elaboration will
1563 -- have no side effects. In any case, this is additional semantic
1564 -- information that seems awkward to have in atree.
1566 if Ekind
(Old_Itype
) = E_Subprogram_Type
then
1570 New_Itype
:= New_Copy
(Old_Itype
);
1572 -- If our associated node is an entity that has already been copied,
1573 -- then set the associated node of the copy to point to the right
1574 -- copy. If we have copied an Itype that is itself the associated
1575 -- node of some previously copied Itype, then we set the right
1576 -- pointer in the other direction.
1578 if Present
(Actual_Map
) then
1580 -- Case of hash tables used
1582 if NCT_Hash_Tables_Used
then
1584 Ent
:= NCT_Assoc
.Get
(Associated_Node_For_Itype
(Old_Itype
));
1585 if Present
(Ent
) then
1586 Set_Associated_Node_For_Itype
(New_Itype
, Ent
);
1589 Ent
:= NCT_Itype_Assoc
.Get
(Old_Itype
);
1590 if Present
(Ent
) then
1591 Set_Associated_Node_For_Itype
(Ent
, New_Itype
);
1594 -- Csae of hash tables not used
1597 E
:= First_Elmt
(Actual_Map
);
1598 while Present
(E
) loop
1599 if Associated_Node_For_Itype
(Old_Itype
) = Node
(E
) then
1600 Set_Associated_Node_For_Itype
1601 (New_Itype
, Node
(Next_Elmt
(E
)));
1604 if Old_Itype
= Associated_Node_For_Itype
(Node
(E
)) then
1605 Set_Associated_Node_For_Itype
1606 (Node
(Next_Elmt
(E
)), New_Itype
);
1609 E
:= Next_Elmt
(Next_Elmt
(E
));
1614 if Present
(Freeze_Node
(New_Itype
)) then
1615 Set_Is_Frozen
(New_Itype
, False);
1616 Set_Freeze_Node
(New_Itype
, Empty
);
1619 -- Add new association to map
1621 if No
(Actual_Map
) then
1622 Actual_Map
:= New_Elmt_List
;
1625 Append_Elmt
(Old_Itype
, Actual_Map
);
1626 Append_Elmt
(New_Itype
, Actual_Map
);
1628 if NCT_Hash_Tables_Used
then
1629 NCT_Assoc
.Set
(Old_Itype
, New_Itype
);
1632 NCT_Table_Entries
:= NCT_Table_Entries
+ 1;
1634 if NCT_Table_Entries
> NCT_Hash_Threshhold
then
1635 Build_NCT_Hash_Tables
;
1639 -- If a record subtype is simply copied, the entity list will be
1640 -- shared. Thus cloned_Subtype must be set to indicate the sharing.
1642 if Ekind
(Old_Itype
) = E_Record_Subtype
1643 or else Ekind
(Old_Itype
) = E_Class_Wide_Subtype
1645 Set_Cloned_Subtype
(New_Itype
, Old_Itype
);
1648 -- Visit descendents that eventually get copied
1650 Visit_Field
(Union_Id
(Etype
(Old_Itype
)), Old_Itype
);
1652 if Is_Discrete_Type
(Old_Itype
) then
1653 Visit_Field
(Union_Id
(Scalar_Range
(Old_Itype
)), Old_Itype
);
1655 elsif Has_Discriminants
(Base_Type
(Old_Itype
)) then
1656 -- ??? This should involve call to Visit_Field.
1657 Visit_Elist
(Discriminant_Constraint
(Old_Itype
));
1659 elsif Is_Array_Type
(Old_Itype
) then
1660 if Present
(First_Index
(Old_Itype
)) then
1661 Visit_Field
(Union_Id
(List_Containing
1662 (First_Index
(Old_Itype
))),
1666 if Is_Packed
(Old_Itype
) then
1667 Visit_Field
(Union_Id
(Packed_Array_Type
(Old_Itype
)),
1677 procedure Visit_List
(L
: List_Id
) is
1681 if L
/= No_List
then
1684 while Present
(N
) loop
1695 procedure Visit_Node
(N
: Node_Or_Entity_Id
) is
1697 -- Start of processing for Visit_Node
1700 -- Handle case of an Itype, which must be copied
1702 if Has_Extension
(N
)
1703 and then Is_Itype
(N
)
1705 -- Nothing to do if already in the list. This can happen with an
1706 -- Itype entity that appears more than once in the tree.
1707 -- Note that we do not want to visit descendents in this case.
1709 -- Test for already in list when hash table is used
1711 if NCT_Hash_Tables_Used
then
1712 if Present
(NCT_Assoc
.Get
(Entity_Id
(N
))) then
1716 -- Test for already in list when hash table not used
1723 if Present
(Actual_Map
) then
1724 E
:= First_Elmt
(Actual_Map
);
1725 while Present
(E
) loop
1726 if Node
(E
) = N
then
1729 E
:= Next_Elmt
(Next_Elmt
(E
));
1739 -- Visit descendents
1741 Visit_Field
(Field1
(N
), N
);
1742 Visit_Field
(Field2
(N
), N
);
1743 Visit_Field
(Field3
(N
), N
);
1744 Visit_Field
(Field4
(N
), N
);
1745 Visit_Field
(Field5
(N
), N
);
1748 -- Start of processing for New_Copy_Tree
1753 -- See if we should use hash table
1755 if No
(Actual_Map
) then
1756 NCT_Hash_Tables_Used
:= False;
1763 NCT_Table_Entries
:= 0;
1764 Elmt
:= First_Elmt
(Actual_Map
);
1765 while Present
(Elmt
) loop
1766 NCT_Table_Entries
:= NCT_Table_Entries
+ 1;
1771 if NCT_Table_Entries
> NCT_Hash_Threshhold
then
1772 Build_NCT_Hash_Tables
;
1774 NCT_Hash_Tables_Used
:= False;
1779 -- Hash table set up if required, now start phase one by visiting
1780 -- top node (we will recursively visit the descendents).
1782 Visit_Node
(Source
);
1784 -- Now the second phase of the copy can start. First we process
1785 -- all the mapped entities, copying their descendents.
1787 if Present
(Actual_Map
) then
1790 New_Itype
: Entity_Id
;
1793 Elmt
:= First_Elmt
(Actual_Map
);
1794 while Present
(Elmt
) loop
1796 New_Itype
:= Node
(Elmt
);
1797 Copy_Itype_With_Replacement
(New_Itype
);
1803 -- Now we can copy the actual tree
1805 return Copy_Node_With_Replacement
(Source
);
1813 (New_Node_Kind
: Node_Kind
;
1814 New_Sloc
: Source_Ptr
)
1817 procedure New_Entity_Debugging_Output
;
1818 -- Debugging routine for debug flag N
1820 procedure New_Entity_Debugging_Output
is
1822 if Debug_Flag_N
then
1823 Write_Str
("Allocate entity, Id = ");
1824 Write_Int
(Int
(Nodes
.Last
));
1826 Write_Location
(New_Sloc
);
1828 Write_Str
(Node_Kind
'Image (New_Node_Kind
));
1831 end New_Entity_Debugging_Output
;
1833 pragma Inline
(New_Entity_Debugging_Output
);
1835 -- Start of processing for New_Entity
1838 pragma Assert
(New_Node_Kind
in N_Entity
);
1840 Nodes
.Increment_Last
;
1841 Current_Error_Node
:= Nodes
.Last
;
1842 Nodes
.Table
(Nodes
.Last
) := Default_Node
;
1843 Nodes
.Table
(Nodes
.Last
).Nkind
:= New_Node_Kind
;
1844 Nodes
.Table
(Nodes
.Last
).Sloc
:= New_Sloc
;
1845 pragma Debug
(New_Entity_Debugging_Output
);
1847 Orig_Nodes
.Increment_Last
;
1848 Orig_Nodes
.Table
(Nodes
.Last
) := Nodes
.Last
;
1850 Nodes
.Increment_Last
;
1851 Nodes
.Table
(Nodes
.Last
) := Default_Node_Extension
;
1853 Nodes
.Increment_Last
;
1854 Nodes
.Table
(Nodes
.Last
) := Default_Node_Extension
;
1856 Nodes
.Increment_Last
;
1857 Nodes
.Table
(Nodes
.Last
) := Default_Node_Extension
;
1859 Orig_Nodes
.Set_Last
(Nodes
.Last
);
1860 Allocate_List_Tables
(Nodes
.Last
);
1861 Node_Count
:= Node_Count
+ 1;
1862 return Current_Error_Node
;
1870 (New_Node_Kind
: Node_Kind
;
1871 New_Sloc
: Source_Ptr
)
1874 procedure New_Node_Debugging_Output
;
1875 -- Debugging routine for debug flag N
1877 procedure New_Node_Debugging_Output
is
1879 if Debug_Flag_N
then
1880 Write_Str
("Allocate node, Id = ");
1881 Write_Int
(Int
(Nodes
.Last
));
1883 Write_Location
(New_Sloc
);
1885 Write_Str
(Node_Kind
'Image (New_Node_Kind
));
1888 end New_Node_Debugging_Output
;
1890 pragma Inline
(New_Node_Debugging_Output
);
1892 -- Start of processing for New_Node
1895 pragma Assert
(New_Node_Kind
not in N_Entity
);
1896 Nodes
.Increment_Last
;
1897 Nodes
.Table
(Nodes
.Last
) := Default_Node
;
1898 Nodes
.Table
(Nodes
.Last
).Nkind
:= New_Node_Kind
;
1899 Nodes
.Table
(Nodes
.Last
).Sloc
:= New_Sloc
;
1900 pragma Debug
(New_Node_Debugging_Output
);
1901 Current_Error_Node
:= Nodes
.Last
;
1902 Node_Count
:= Node_Count
+ 1;
1904 Orig_Nodes
.Increment_Last
;
1905 Allocate_List_Tables
(Nodes
.Last
);
1906 Orig_Nodes
.Table
(Nodes
.Last
) := Nodes
.Last
;
1914 function Nkind
(N
: Node_Id
) return Node_Kind
is
1916 return Nodes
.Table
(N
).Nkind
;
1923 function No
(N
: Node_Id
) return Boolean is
1932 function Nodes_Address
return System
.Address
is
1934 return Nodes
.Table
(First_Node_Id
)'Address;
1941 function Num_Nodes
return Nat
is
1950 function Original_Node
(Node
: Node_Id
) return Node_Id
is
1952 return Orig_Nodes
.Table
(Node
);
1959 function Paren_Count
(N
: Node_Id
) return Paren_Count_Type
is
1960 C
: Paren_Count_Type
:= 0;
1963 pragma Assert
(N
in Nodes
.First
.. Nodes
.Last
);
1965 if Nodes
.Table
(N
).Pflag1
then
1969 if Nodes
.Table
(N
).Pflag2
then
1980 function Parent
(N
: Node_Id
) return Node_Id
is
1982 if Is_List_Member
(N
) then
1983 return Parent
(List_Containing
(N
));
1985 return Node_Id
(Nodes
.Table
(N
).Link
);
1993 function Present
(N
: Node_Id
) return Boolean is
1998 --------------------------------
1999 -- Preserve_Comes_From_Source --
2000 --------------------------------
2002 procedure Preserve_Comes_From_Source
(NewN
, OldN
: Node_Id
) is
2004 Nodes
.Table
(NewN
).Comes_From_Source
:=
2005 Nodes
.Table
(OldN
).Comes_From_Source
;
2006 end Preserve_Comes_From_Source
;
2012 function Relocate_Node
(Source
: Node_Id
) return Node_Id
is
2020 New_Node
:= New_Copy
(Source
);
2021 Fix_Parent
(Field1
(Source
), Source
, New_Node
);
2022 Fix_Parent
(Field2
(Source
), Source
, New_Node
);
2023 Fix_Parent
(Field3
(Source
), Source
, New_Node
);
2024 Fix_Parent
(Field4
(Source
), Source
, New_Node
);
2025 Fix_Parent
(Field5
(Source
), Source
, New_Node
);
2027 -- We now set the parent of the new node to be the same as the
2028 -- parent of the source. Almost always this parent will be
2029 -- replaced by a new value when the relocated node is reattached
2030 -- to the tree, but by doing it now, we ensure that this node is
2031 -- not even temporarily disconnected from the tree. Note that this
2032 -- does not happen free, because in the list case, the parent does
2035 Set_Parent
(New_Node
, Parent
(Source
));
2043 procedure Replace
(Old_Node
, New_Node
: Node_Id
) is
2044 Old_Link
: constant Union_Id
:= Nodes
.Table
(Old_Node
).Link
;
2045 Old_InL
: constant Boolean := Nodes
.Table
(Old_Node
).In_List
;
2046 Old_Post
: constant Boolean := Nodes
.Table
(Old_Node
).Error_Posted
;
2047 Old_CFS
: constant Boolean := Nodes
.Table
(Old_Node
).Comes_From_Source
;
2051 (not Has_Extension
(Old_Node
)
2052 and not Has_Extension
(New_Node
)
2053 and not Nodes
.Table
(New_Node
).In_List
);
2055 -- Do copy, preserving link and in list status and comes from source
2057 Nodes
.Table
(Old_Node
) := Nodes
.Table
(New_Node
);
2058 Nodes
.Table
(Old_Node
).Link
:= Old_Link
;
2059 Nodes
.Table
(Old_Node
).In_List
:= Old_InL
;
2060 Nodes
.Table
(Old_Node
).Comes_From_Source
:= Old_CFS
;
2061 Nodes
.Table
(Old_Node
).Error_Posted
:= Old_Post
;
2063 -- Fix parents of substituted node, since it has changed identity
2065 Fix_Parent
(Field1
(Old_Node
), New_Node
, Old_Node
);
2066 Fix_Parent
(Field2
(Old_Node
), New_Node
, Old_Node
);
2067 Fix_Parent
(Field3
(Old_Node
), New_Node
, Old_Node
);
2068 Fix_Parent
(Field4
(Old_Node
), New_Node
, Old_Node
);
2069 Fix_Parent
(Field5
(Old_Node
), New_Node
, Old_Node
);
2071 -- Since we are doing a replace, we assume that the original node
2072 -- is intended to become the new replaced node. The call would be
2073 -- to Rewrite_Substitute_Node if there were an intention to save
2074 -- the original node.
2076 Orig_Nodes
.Table
(Old_Node
) := Old_Node
;
2078 -- Finally delete the source, since it is now copied
2080 Delete_Node
(New_Node
);
2088 procedure Rewrite
(Old_Node
, New_Node
: Node_Id
) is
2090 Old_Link
: constant Union_Id
:= Nodes
.Table
(Old_Node
).Link
;
2091 Old_In_List
: constant Boolean := Nodes
.Table
(Old_Node
).In_List
;
2092 Old_Error_P
: constant Boolean := Nodes
.Table
(Old_Node
).Error_Posted
;
2093 -- These three fields are always preserved in the new node
2095 Old_Paren_Count
: Paren_Count_Type
;
2096 Old_Must_Not_Freeze
: Boolean;
2097 -- These fields are preserved in the new node only if the new node
2098 -- and the old node are both subexpression nodes.
2100 -- Note: it is a violation of abstraction levels for Must_Not_Freeze
2101 -- to be referenced like this. ???
2107 (not Has_Extension
(Old_Node
)
2108 and not Has_Extension
(New_Node
)
2109 and not Nodes
.Table
(New_Node
).In_List
);
2111 if Nkind
(Old_Node
) in N_Subexpr
then
2112 Old_Paren_Count
:= Paren_Count
(Old_Node
);
2113 Old_Must_Not_Freeze
:= Must_Not_Freeze
(Old_Node
);
2115 Old_Paren_Count
:= 0;
2116 Old_Must_Not_Freeze
:= False;
2119 -- Allocate a new node, to be used to preserve the original contents
2120 -- of the Old_Node, for possible later retrival by Original_Node and
2121 -- make an entry in the Orig_Nodes table. This is only done if we have
2122 -- not already rewritten the node, as indicated by an Orig_Nodes entry
2123 -- that does not reference the Old_Node.
2125 if Orig_Nodes
.Table
(Old_Node
) = Old_Node
then
2126 Nodes
.Increment_Last
;
2127 Sav_Node
:= Nodes
.Last
;
2128 Nodes
.Table
(Sav_Node
) := Nodes
.Table
(Old_Node
);
2129 Nodes
.Table
(Sav_Node
).In_List
:= False;
2130 Nodes
.Table
(Sav_Node
).Link
:= Union_Id
(Empty
);
2132 Orig_Nodes
.Increment_Last
;
2133 Allocate_List_Tables
(Nodes
.Last
);
2135 Orig_Nodes
.Table
(Sav_Node
) := Sav_Node
;
2136 Orig_Nodes
.Table
(Old_Node
) := Sav_Node
;
2139 -- Copy substitute node into place, preserving old fields as required
2141 Nodes
.Table
(Old_Node
) := Nodes
.Table
(New_Node
);
2142 Nodes
.Table
(Old_Node
).Link
:= Old_Link
;
2143 Nodes
.Table
(Old_Node
).In_List
:= Old_In_List
;
2144 Nodes
.Table
(Old_Node
).Error_Posted
:= Old_Error_P
;
2146 if Nkind
(New_Node
) in N_Subexpr
then
2147 Set_Paren_Count
(Old_Node
, Old_Paren_Count
);
2148 Set_Must_Not_Freeze
(Old_Node
, Old_Must_Not_Freeze
);
2151 Fix_Parent
(Field1
(Old_Node
), New_Node
, Old_Node
);
2152 Fix_Parent
(Field2
(Old_Node
), New_Node
, Old_Node
);
2153 Fix_Parent
(Field3
(Old_Node
), New_Node
, Old_Node
);
2154 Fix_Parent
(Field4
(Old_Node
), New_Node
, Old_Node
);
2155 Fix_Parent
(Field5
(Old_Node
), New_Node
, Old_Node
);
2163 procedure Set_Analyzed
(N
: Node_Id
; Val
: Boolean := True) is
2165 Nodes
.Table
(N
).Analyzed
:= Val
;
2168 ---------------------------
2169 -- Set_Comes_From_Source --
2170 ---------------------------
2172 procedure Set_Comes_From_Source
(N
: Node_Id
; Val
: Boolean) is
2174 pragma Assert
(N
in Nodes
.First
.. Nodes
.Last
);
2175 Nodes
.Table
(N
).Comes_From_Source
:= Val
;
2176 end Set_Comes_From_Source
;
2178 -----------------------------------
2179 -- Set_Comes_From_Source_Default --
2180 -----------------------------------
2182 procedure Set_Comes_From_Source_Default
(Default
: Boolean) is
2184 Default_Node
.Comes_From_Source
:= Default
;
2185 end Set_Comes_From_Source_Default
;
2187 --------------------
2188 -- Set_Convention --
2189 --------------------
2191 procedure Set_Convention
(E
: Entity_Id
; Val
: Convention_Id
) is
2193 pragma Assert
(Nkind
(E
) in N_Entity
);
2196 (Nodes.Table (E + 2).Field12'Unrestricted_Access)).Convention :=
2204 procedure Set_Ekind (E : Entity_Id; Val : Entity_Kind) is
2206 pragma Assert (Nkind (E) in N_Entity);
2207 Nodes.Table (E + 1).Nkind := E_To_N (Val);
2210 ----------------------
2211 -- Set_Error_Posted --
2212 ----------------------
2214 procedure Set_Error_Posted (N : Node_Id; Val : Boolean := True) is
2216 Nodes.Table (N).Error_Posted := Val;
2217 end Set_Error_Posted;
2219 ---------------------
2220 -- Set_Paren_Count --
2221 ---------------------
2223 procedure Set_Paren_Count (N : Node_Id; Val : Paren_Count_Type) is
2225 pragma Assert (Nkind (N) in N_Subexpr);
2226 Nodes.Table (N).Pflag1 := (Val mod 2 /= 0);
2227 Nodes.Table (N).Pflag2 := (Val >= 2);
2228 end Set_Paren_Count;
2234 procedure Set_Parent (N : Node_Id; Val : Node_Id) is
2236 pragma Assert (not Nodes.Table (N).In_List);
2237 Nodes.Table (N).Link := Union_Id (Val);
2244 procedure Set_Sloc (N : Node_Id; Val : Source_Ptr) is
2246 Nodes.Table (N).Sloc := Val;
2253 function Sloc (N : Node_Id) return Source_Ptr is
2255 return Nodes.Table (N).Sloc;
2262 function Traverse_Func (Node : Node_Id) return Traverse_Result is
2264 function Traverse_Field (Fld : Union_Id) return Traverse_Result;
2265 -- Fld is one of the fields of Node. If the field points to a
2266 -- syntactic node or list, then this node or list is traversed,
2267 -- and the result is the result of this traversal. Otherwise
2268 -- a value of True is returned with no processing.
2270 --------------------
2271 -- Traverse_Field --
2272 --------------------
2274 function Traverse_Field (Fld : Union_Id) return Traverse_Result is
2276 if Fld = Union_Id (Empty) then
2279 -- Descendent is a node
2281 elsif Fld in Node_Range then
2283 -- Traverse descendent that is syntactic subtree node
2285 if Parent (Node_Id (Fld)) = Node then
2286 return Traverse_Func (Node_Id (Fld));
2288 -- Node that is not a syntactic subtree
2294 -- Descendent is a list
2296 elsif Fld in List_Range then
2298 -- Traverse descendent that is a syntactic subtree list
2300 if Parent (List_Id (Fld)) = Node then
2303 Elmt : Node_Id := First (List_Id (Fld));
2305 while Present (Elmt) loop
2306 if Traverse_Func (Elmt) = Abandon then
2316 -- List that is not a syntactic subtree
2322 -- Field was not a node or a list
2329 -- Start of processing for Traverse_Func
2332 case Process (Node) is
2340 if Traverse_Field (Union_Id (Field1 (Node))) = Abandon
2342 Traverse_Field (Union_Id (Field2 (Node))) = Abandon
2344 Traverse_Field (Union_Id (Field3 (Node))) = Abandon
2346 Traverse_Field (Union_Id (Field4 (Node))) = Abandon
2348 Traverse_Field (Union_Id (Field5 (Node))) = Abandon
2358 Onode : constant Node_Id := Original_Node (Node);
2361 if Traverse_Field (Union_Id (Field1 (Onode))) = Abandon
2363 Traverse_Field (Union_Id (Field2 (Onode))) = Abandon
2365 Traverse_Field (Union_Id (Field3 (Onode))) = Abandon
2367 Traverse_Field (Union_Id (Field4 (Onode))) = Abandon
2369 Traverse_Field (Union_Id (Field5 (Onode))) = Abandon
2385 procedure Traverse_Proc (Node : Node_Id) is
2386 function Traverse is new Traverse_Func (Process);
2387 Discard : Traverse_Result;
2390 Discard := Traverse (Node);
2397 procedure Tree_Read is
2399 Tree_Read_Int (Node_Count);
2401 Orig_Nodes.Tree_Read;
2408 procedure Tree_Write is
2410 Tree_Write_Int (Node_Count);
2412 Orig_Nodes.Tree_Write;
2415 ------------------------------
2416 -- Unchecked Access Package --
2417 ------------------------------
2419 package body Unchecked_Access is
2421 function Field1 (N : Node_Id) return Union_Id is
2423 pragma Assert (N in Nodes.First .. Nodes.Last);
2424 return Nodes.Table (N).Field1;
2427 function Field2 (N : Node_Id) return Union_Id is
2429 pragma Assert (N in Nodes.First .. Nodes.Last);
2430 return Nodes.Table (N).Field2;
2433 function Field3 (N : Node_Id) return Union_Id is
2435 pragma Assert (N in Nodes.First .. Nodes.Last);
2436 return Nodes.Table (N).Field3;
2439 function Field4 (N : Node_Id) return Union_Id is
2441 pragma Assert (N in Nodes.First .. Nodes.Last);
2442 return Nodes.Table (N).Field4;
2445 function Field5 (N : Node_Id) return Union_Id is
2447 pragma Assert (N in Nodes.First .. Nodes.Last);
2448 return Nodes.Table (N).Field5;
2451 function Field6 (N : Node_Id) return Union_Id is
2453 pragma Assert (Nkind (N) in N_Entity);
2454 return Nodes.Table (N + 1).Field6;
2457 function Field7 (N : Node_Id) return Union_Id is
2459 pragma Assert (Nkind (N) in N_Entity);
2460 return Nodes.Table (N + 1).Field7;
2463 function Field8 (N : Node_Id) return Union_Id is
2465 pragma Assert (Nkind (N) in N_Entity);
2466 return Nodes.Table (N + 1).Field8;
2469 function Field9 (N : Node_Id) return Union_Id is
2471 pragma Assert (Nkind (N) in N_Entity);
2472 return Nodes.Table (N + 1).Field9;
2475 function Field10 (N : Node_Id) return Union_Id is
2477 pragma Assert (Nkind (N) in N_Entity);
2478 return Nodes.Table (N + 1).Field10;
2481 function Field11 (N : Node_Id) return Union_Id is
2483 pragma Assert (Nkind (N) in N_Entity);
2484 return Nodes.Table (N + 1).Field11;
2487 function Field12 (N : Node_Id) return Union_Id is
2489 pragma Assert (Nkind (N) in N_Entity);
2490 return Nodes.Table (N + 1).Field12;
2493 function Field13 (N : Node_Id) return Union_Id is
2495 pragma Assert (Nkind (N) in N_Entity);
2496 return Nodes.Table (N + 2).Field6;
2499 function Field14 (N : Node_Id) return Union_Id is
2501 pragma Assert (Nkind (N) in N_Entity);
2502 return Nodes.Table (N + 2).Field7;
2505 function Field15 (N : Node_Id) return Union_Id is
2507 pragma Assert (Nkind (N) in N_Entity);
2508 return Nodes.Table (N + 2).Field8;
2511 function Field16 (N : Node_Id) return Union_Id is
2513 pragma Assert (Nkind (N) in N_Entity);
2514 return Nodes.Table (N + 2).Field9;
2517 function Field17 (N : Node_Id) return Union_Id is
2519 pragma Assert (Nkind (N) in N_Entity);
2520 return Nodes.Table (N + 2).Field10;
2523 function Field18 (N : Node_Id) return Union_Id is
2525 pragma Assert (Nkind (N) in N_Entity);
2526 return Nodes.Table (N + 2).Field11;
2529 function Field19 (N : Node_Id) return Union_Id is
2531 pragma Assert (Nkind (N) in N_Entity);
2532 return Nodes.Table (N + 3).Field6;
2535 function Field20 (N : Node_Id) return Union_Id is
2537 pragma Assert (Nkind (N) in N_Entity);
2538 return Nodes.Table (N + 3).Field7;
2541 function Field21 (N : Node_Id) return Union_Id is
2543 pragma Assert (Nkind (N) in N_Entity);
2544 return Nodes.Table (N + 3).Field8;
2547 function Field22 (N : Node_Id) return Union_Id is
2549 pragma Assert (Nkind (N) in N_Entity);
2550 return Nodes.Table (N + 3).Field9;
2553 function Field23 (N : Node_Id) return Union_Id is
2555 pragma Assert (Nkind (N) in N_Entity);
2556 return Nodes.Table (N + 3).Field10;
2559 function Node1 (N : Node_Id) return Node_Id is
2561 pragma Assert (N in Nodes.First .. Nodes.Last);
2562 return Node_Id (Nodes.Table (N).Field1);
2565 function Node2 (N : Node_Id) return Node_Id is
2567 pragma Assert (N in Nodes.First .. Nodes.Last);
2568 return Node_Id (Nodes.Table (N).Field2);
2571 function Node3 (N : Node_Id) return Node_Id is
2573 pragma Assert (N in Nodes.First .. Nodes.Last);
2574 return Node_Id (Nodes.Table (N).Field3);
2577 function Node4 (N : Node_Id) return Node_Id is
2579 pragma Assert (N in Nodes.First .. Nodes.Last);
2580 return Node_Id (Nodes.Table (N).Field4);
2583 function Node5 (N : Node_Id) return Node_Id is
2585 pragma Assert (N in Nodes.First .. Nodes.Last);
2586 return Node_Id (Nodes.Table (N).Field5);
2589 function Node6 (N : Node_Id) return Node_Id is
2591 pragma Assert (Nkind (N) in N_Entity);
2592 return Node_Id (Nodes.Table (N + 1).Field6);
2595 function Node7 (N : Node_Id) return Node_Id is
2597 pragma Assert (Nkind (N) in N_Entity);
2598 return Node_Id (Nodes.Table (N + 1).Field7);
2601 function Node8 (N : Node_Id) return Node_Id is
2603 pragma Assert (Nkind (N) in N_Entity);
2604 return Node_Id (Nodes.Table (N + 1).Field8);
2607 function Node9 (N : Node_Id) return Node_Id is
2609 pragma Assert (Nkind (N) in N_Entity);
2610 return Node_Id (Nodes.Table (N + 1).Field9);
2613 function Node10 (N : Node_Id) return Node_Id is
2615 pragma Assert (Nkind (N) in N_Entity);
2616 return Node_Id (Nodes.Table (N + 1).Field10);
2619 function Node11 (N : Node_Id) return Node_Id is
2621 pragma Assert (Nkind (N) in N_Entity);
2622 return Node_Id (Nodes.Table (N + 1).Field11);
2625 function Node12 (N : Node_Id) return Node_Id is
2627 pragma Assert (Nkind (N) in N_Entity);
2628 return Node_Id (Nodes.Table (N + 1).Field12);
2631 function Node13 (N : Node_Id) return Node_Id is
2633 pragma Assert (Nkind (N) in N_Entity);
2634 return Node_Id (Nodes.Table (N + 2).Field6);
2637 function Node14 (N : Node_Id) return Node_Id is
2639 pragma Assert (Nkind (N) in N_Entity);
2640 return Node_Id (Nodes.Table (N + 2).Field7);
2643 function Node15 (N : Node_Id) return Node_Id is
2645 pragma Assert (Nkind (N) in N_Entity);
2646 return Node_Id (Nodes.Table (N + 2).Field8);
2649 function Node16 (N : Node_Id) return Node_Id is
2651 pragma Assert (Nkind (N) in N_Entity);
2652 return Node_Id (Nodes.Table (N + 2).Field9);
2655 function Node17 (N : Node_Id) return Node_Id is
2657 pragma Assert (Nkind (N) in N_Entity);
2658 return Node_Id (Nodes.Table (N + 2).Field10);
2661 function Node18 (N : Node_Id) return Node_Id is
2663 pragma Assert (Nkind (N) in N_Entity);
2664 return Node_Id (Nodes.Table (N + 2).Field11);
2667 function Node19 (N : Node_Id) return Node_Id is
2669 pragma Assert (Nkind (N) in N_Entity);
2670 return Node_Id (Nodes.Table (N + 3).Field6);
2673 function Node20 (N : Node_Id) return Node_Id is
2675 pragma Assert (Nkind (N) in N_Entity);
2676 return Node_Id (Nodes.Table (N + 3).Field7);
2679 function Node21 (N : Node_Id) return Node_Id is
2681 pragma Assert (Nkind (N) in N_Entity);
2682 return Node_Id (Nodes.Table (N + 3).Field8);
2685 function Node22 (N : Node_Id) return Node_Id is
2687 pragma Assert (Nkind (N) in N_Entity);
2688 return Node_Id (Nodes.Table (N + 3).Field9);
2691 function Node23 (N : Node_Id) return Node_Id is
2693 pragma Assert (Nkind (N) in N_Entity);
2694 return Node_Id (Nodes.Table (N + 3).Field10);
2697 function List1 (N : Node_Id) return List_Id is
2699 pragma Assert (N in Nodes.First .. Nodes.Last);
2700 return List_Id (Nodes.Table (N).Field1);
2703 function List2 (N : Node_Id) return List_Id is
2705 pragma Assert (N in Nodes.First .. Nodes.Last);
2706 return List_Id (Nodes.Table (N).Field2);
2709 function List3 (N : Node_Id) return List_Id is
2711 pragma Assert (N in Nodes.First .. Nodes.Last);
2712 return List_Id (Nodes.Table (N).Field3);
2715 function List4 (N : Node_Id) return List_Id is
2717 pragma Assert (N in Nodes.First .. Nodes.Last);
2718 return List_Id (Nodes.Table (N).Field4);
2721 function List5 (N : Node_Id) return List_Id is
2723 pragma Assert (N in Nodes.First .. Nodes.Last);
2724 return List_Id (Nodes.Table (N).Field5);
2727 function List10 (N : Node_Id) return List_Id is
2729 pragma Assert (Nkind (N) in N_Entity);
2730 return List_Id (Nodes.Table (N + 1).Field10);
2733 function List14 (N : Node_Id) return List_Id is
2735 pragma Assert (Nkind (N) in N_Entity);
2736 return List_Id (Nodes.Table (N + 2).Field7);
2739 function Elist2 (N : Node_Id) return Elist_Id is
2741 return Elist_Id (Nodes.Table (N).Field2);
2744 function Elist3 (N : Node_Id) return Elist_Id is
2746 return Elist_Id (Nodes.Table (N).Field3);
2749 function Elist4 (N : Node_Id) return Elist_Id is
2751 return Elist_Id (Nodes.Table (N).Field4);
2754 function Elist8 (N : Node_Id) return Elist_Id is
2756 pragma Assert (Nkind (N) in N_Entity);
2757 return Elist_Id (Nodes.Table (N + 1).Field8);
2760 function Elist13 (N : Node_Id) return Elist_Id is
2762 pragma Assert (Nkind (N) in N_Entity);
2763 return Elist_Id (Nodes.Table (N + 2).Field6);
2766 function Elist15 (N : Node_Id) return Elist_Id is
2768 pragma Assert (Nkind (N) in N_Entity);
2769 return Elist_Id (Nodes.Table (N + 2).Field8);
2772 function Elist16 (N : Node_Id) return Elist_Id is
2774 pragma Assert (Nkind (N) in N_Entity);
2775 return Elist_Id (Nodes.Table (N + 2).Field9);
2778 function Elist18 (N : Node_Id) return Elist_Id is
2780 pragma Assert (Nkind (N) in N_Entity);
2781 return Elist_Id (Nodes.Table (N + 2).Field11);
2784 function Elist21 (N : Node_Id) return Elist_Id is
2786 pragma Assert (Nkind (N) in N_Entity);
2787 return Elist_Id (Nodes.Table (N + 3).Field8);
2790 function Elist23 (N : Node_Id) return Elist_Id is
2792 pragma Assert (Nkind (N) in N_Entity);
2793 return Elist_Id (Nodes.Table (N + 3).Field10);
2796 function Name1 (N : Node_Id) return Name_Id is
2798 pragma Assert (N in Nodes.First .. Nodes.Last);
2799 return Name_Id (Nodes.Table (N).Field1);
2802 function Name2 (N : Node_Id) return Name_Id is
2804 pragma Assert (N in Nodes.First .. Nodes.Last);
2805 return Name_Id (Nodes.Table (N).Field2);
2808 function Str3 (N : Node_Id) return String_Id is
2810 pragma Assert (N in Nodes.First .. Nodes.Last);
2811 return String_Id (Nodes.Table (N).Field3);
2814 function Char_Code2 (N : Node_Id) return Char_Code is
2816 pragma Assert (N in Nodes.First .. Nodes.Last);
2817 return Char_Code (Nodes.Table (N).Field2 - Char_Code_Bias);
2820 function Uint3 (N : Node_Id) return Uint is
2821 pragma Assert (N in Nodes.First .. Nodes.Last);
2822 U : constant Union_Id := Nodes.Table (N).Field3;
2828 return From_Union (U);
2832 function Uint4 (N : Node_Id) return Uint is
2833 pragma Assert (N in Nodes.First .. Nodes.Last);
2834 U : constant Union_Id := Nodes.Table (N).Field4;
2840 return From_Union (U);
2844 function Uint5 (N : Node_Id) return Uint is
2845 pragma Assert (N in Nodes.First .. Nodes.Last);
2846 U : constant Union_Id := Nodes.Table (N).Field5;
2852 return From_Union (U);
2856 function Uint8 (N : Node_Id) return Uint is
2857 pragma Assert (Nkind (N) in N_Entity);
2858 U : constant Union_Id := Nodes.Table (N + 1).Field8;
2864 return From_Union (U);
2868 function Uint9 (N : Node_Id) return Uint is
2869 pragma Assert (Nkind (N) in N_Entity);
2870 U : constant Union_Id := Nodes.Table (N + 1).Field9;
2876 return From_Union (U);
2880 function Uint11 (N : Node_Id) return Uint is
2881 pragma Assert (Nkind (N) in N_Entity);
2882 U : constant Union_Id := Nodes.Table (N + 1).Field11;
2888 return From_Union (U);
2892 function Uint10 (N : Node_Id) return Uint is
2893 pragma Assert (Nkind (N) in N_Entity);
2894 U : constant Union_Id := Nodes.Table (N + 1).Field10;
2900 return From_Union (U);
2904 function Uint12 (N : Node_Id) return Uint is
2905 pragma Assert (Nkind (N) in N_Entity);
2906 U : constant Union_Id := Nodes.Table (N + 1).Field12;
2912 return From_Union (U);
2916 function Uint13 (N : Node_Id) return Uint is
2917 pragma Assert (Nkind (N) in N_Entity);
2918 U : constant Union_Id := Nodes.Table (N + 2).Field6;
2924 return From_Union (U);
2928 function Uint14 (N : Node_Id) return Uint is
2929 pragma Assert (Nkind (N) in N_Entity);
2930 U : constant Union_Id := Nodes.Table (N + 2).Field7;
2936 return From_Union (U);
2940 function Uint15 (N : Node_Id) return Uint is
2941 pragma Assert (Nkind (N) in N_Entity);
2942 U : constant Union_Id := Nodes.Table (N + 2).Field8;
2948 return From_Union (U);
2952 function Uint16 (N : Node_Id) return Uint is
2953 pragma Assert (Nkind (N) in N_Entity);
2954 U : constant Union_Id := Nodes.Table (N + 2).Field9;
2960 return From_Union (U);
2964 function Uint17 (N : Node_Id) return Uint is
2965 pragma Assert (Nkind (N) in N_Entity);
2966 U : constant Union_Id := Nodes.Table (N + 2).Field10;
2972 return From_Union (U);
2976 function Uint22 (N : Node_Id) return Uint is
2977 pragma Assert (Nkind (N) in N_Entity);
2978 U : constant Union_Id := Nodes.Table (N + 3).Field9;
2984 return From_Union (U);
2988 function Ureal3 (N : Node_Id) return Ureal is
2990 pragma Assert (N in Nodes.First .. Nodes.Last);
2991 return From_Union (Nodes.Table (N).Field3);
2994 function Ureal18 (N : Node_Id) return Ureal is
2996 pragma Assert (Nkind (N) in N_Entity);
2997 return From_Union (Nodes.Table (N + 2).Field11);
3000 function Ureal21 (N : Node_Id) return Ureal is
3002 pragma Assert (Nkind (N) in N_Entity);
3003 return From_Union (Nodes.Table (N + 3).Field8);
3006 function Flag4 (N : Node_Id) return Boolean is
3008 pragma Assert (N in Nodes.First .. Nodes.Last);
3009 return Nodes.Table (N).Flag4;
3012 function Flag5 (N : Node_Id) return Boolean is
3014 pragma Assert (N in Nodes.First .. Nodes.Last);
3015 return Nodes.Table (N).Flag5;
3018 function Flag6 (N : Node_Id) return Boolean is
3020 pragma Assert (N in Nodes.First .. Nodes.Last);
3021 return Nodes.Table (N).Flag6;
3024 function Flag7 (N : Node_Id) return Boolean is
3026 pragma Assert (N in Nodes.First .. Nodes.Last);
3027 return Nodes.Table (N).Flag7;
3030 function Flag8 (N : Node_Id) return Boolean is
3032 pragma Assert (N in Nodes.First .. Nodes.Last);
3033 return Nodes.Table (N).Flag8;
3036 function Flag9 (N : Node_Id) return Boolean is
3038 pragma Assert (N in Nodes.First .. Nodes.Last);
3039 return Nodes.Table (N).Flag9;
3042 function Flag10 (N : Node_Id) return Boolean is
3044 pragma Assert (N in Nodes.First .. Nodes.Last);
3045 return Nodes.Table (N).Flag10;
3048 function Flag11 (N : Node_Id) return Boolean is
3050 pragma Assert (N in Nodes.First .. Nodes.Last);
3051 return Nodes.Table (N).Flag11;
3054 function Flag12 (N : Node_Id) return Boolean is
3056 pragma Assert (N in Nodes.First .. Nodes.Last);
3057 return Nodes.Table (N).Flag12;
3060 function Flag13 (N : Node_Id) return Boolean is
3062 pragma Assert (N in Nodes.First .. Nodes.Last);
3063 return Nodes.Table (N).Flag13;
3066 function Flag14 (N : Node_Id) return Boolean is
3068 pragma Assert (N in Nodes.First .. Nodes.Last);
3069 return Nodes.Table (N).Flag14;
3072 function Flag15 (N : Node_Id) return Boolean is
3074 pragma Assert (N in Nodes.First .. Nodes.Last);
3075 return Nodes.Table (N).Flag15;
3078 function Flag16 (N : Node_Id) return Boolean is
3080 pragma Assert (N in Nodes.First .. Nodes.Last);
3081 return Nodes.Table (N).Flag16;
3084 function Flag17 (N : Node_Id) return Boolean is
3086 pragma Assert (N in Nodes.First .. Nodes.Last);
3087 return Nodes.Table (N).Flag17;
3090 function Flag18 (N : Node_Id) return Boolean is
3092 pragma Assert (N in Nodes.First .. Nodes.Last);
3093 return Nodes.Table (N).Flag18;
3096 function Flag19 (N : Node_Id) return Boolean is
3098 pragma Assert (Nkind (N) in N_Entity);
3099 return Nodes.Table (N + 1).In_List;
3102 function Flag20 (N : Node_Id) return Boolean is
3104 pragma Assert (Nkind (N) in N_Entity);
3105 return Nodes.Table (N + 1).Unused_1;
3108 function Flag21 (N : Node_Id) return Boolean is
3110 pragma Assert (Nkind (N) in N_Entity);
3111 return Nodes.Table (N + 1).Rewrite_Ins;
3114 function Flag22 (N : Node_Id) return Boolean is
3116 pragma Assert (Nkind (N) in N_Entity);
3117 return Nodes.Table (N + 1).Analyzed;
3120 function Flag23 (N : Node_Id) return Boolean is
3122 pragma Assert (Nkind (N) in N_Entity);
3123 return Nodes.Table (N + 1).Comes_From_Source;
3126 function Flag24 (N : Node_Id) return Boolean is
3128 pragma Assert (Nkind (N) in N_Entity);
3129 return Nodes.Table (N + 1).Error_Posted;
3132 function Flag25 (N : Node_Id) return Boolean is
3134 pragma Assert (Nkind (N) in N_Entity);
3135 return Nodes.Table (N + 1).Flag4;
3138 function Flag26 (N : Node_Id) return Boolean is
3140 pragma Assert (Nkind (N) in N_Entity);
3141 return Nodes.Table (N + 1).Flag5;
3144 function Flag27 (N : Node_Id) return Boolean is
3146 pragma Assert (Nkind (N) in N_Entity);
3147 return Nodes.Table (N + 1).Flag6;
3150 function Flag28 (N : Node_Id) return Boolean is
3152 pragma Assert (Nkind (N) in N_Entity);
3153 return Nodes.Table (N + 1).Flag7;
3156 function Flag29 (N : Node_Id) return Boolean is
3158 pragma Assert (Nkind (N) in N_Entity);
3159 return Nodes.Table (N + 1).Flag8;
3162 function Flag30 (N : Node_Id) return Boolean is
3164 pragma Assert (Nkind (N) in N_Entity);
3165 return Nodes.Table (N + 1).Flag9;
3168 function Flag31 (N : Node_Id) return Boolean is
3170 pragma Assert (Nkind (N) in N_Entity);
3171 return Nodes.Table (N + 1).Flag10;
3174 function Flag32 (N : Node_Id) return Boolean is
3176 pragma Assert (Nkind (N) in N_Entity);
3177 return Nodes.Table (N + 1).Flag11;
3180 function Flag33 (N : Node_Id) return Boolean is
3182 pragma Assert (Nkind (N) in N_Entity);
3183 return Nodes.Table (N + 1).Flag12;
3186 function Flag34 (N : Node_Id) return Boolean is
3188 pragma Assert (Nkind (N) in N_Entity);
3189 return Nodes.Table (N + 1).Flag13;
3192 function Flag35 (N : Node_Id) return Boolean is
3194 pragma Assert (Nkind (N) in N_Entity);
3195 return Nodes.Table (N + 1).Flag14;
3198 function Flag36 (N : Node_Id) return Boolean is
3200 pragma Assert (Nkind (N) in N_Entity);
3201 return Nodes.Table (N + 1).Flag15;
3204 function Flag37 (N : Node_Id) return Boolean is
3206 pragma Assert (Nkind (N) in N_Entity);
3207 return Nodes.Table (N + 1).Flag16;
3210 function Flag38 (N : Node_Id) return Boolean is
3212 pragma Assert (Nkind (N) in N_Entity);
3213 return Nodes.Table (N + 1).Flag17;
3216 function Flag39 (N : Node_Id) return Boolean is
3218 pragma Assert (Nkind (N) in N_Entity);
3219 return Nodes.Table (N + 1).Flag18;
3222 function Flag40 (N : Node_Id) return Boolean is
3224 pragma Assert (Nkind (N) in N_Entity);
3225 return Nodes.Table (N + 2).In_List;
3228 function Flag41 (N : Node_Id) return Boolean is
3230 pragma Assert (Nkind (N) in N_Entity);
3231 return Nodes.Table (N + 2).Unused_1;
3234 function Flag42 (N : Node_Id) return Boolean is
3236 pragma Assert (Nkind (N) in N_Entity);
3237 return Nodes.Table (N + 2).Rewrite_Ins;
3240 function Flag43 (N : Node_Id) return Boolean is
3242 pragma Assert (Nkind (N) in N_Entity);
3243 return Nodes.Table (N + 2).Analyzed;
3246 function Flag44 (N : Node_Id) return Boolean is
3248 pragma Assert (Nkind (N) in N_Entity);
3249 return Nodes.Table (N + 2).Comes_From_Source;
3252 function Flag45 (N : Node_Id) return Boolean is
3254 pragma Assert (Nkind (N) in N_Entity);
3255 return Nodes.Table (N + 2).Error_Posted;
3258 function Flag46 (N : Node_Id) return Boolean is
3260 pragma Assert (Nkind (N) in N_Entity);
3261 return Nodes.Table (N + 2).Flag4;
3264 function Flag47 (N : Node_Id) return Boolean is
3266 pragma Assert (Nkind (N) in N_Entity);
3267 return Nodes.Table (N + 2).Flag5;
3270 function Flag48 (N : Node_Id) return Boolean is
3272 pragma Assert (Nkind (N) in N_Entity);
3273 return Nodes.Table (N + 2).Flag6;
3276 function Flag49 (N : Node_Id) return Boolean is
3278 pragma Assert (Nkind (N) in N_Entity);
3279 return Nodes.Table (N + 2).Flag7;
3282 function Flag50 (N : Node_Id) return Boolean is
3284 pragma Assert (Nkind (N) in N_Entity);
3285 return Nodes.Table (N + 2).Flag8;
3288 function Flag51 (N : Node_Id) return Boolean is
3290 pragma Assert (Nkind (N) in N_Entity);
3291 return Nodes.Table (N + 2).Flag9;
3294 function Flag52 (N : Node_Id) return Boolean is
3296 pragma Assert (Nkind (N) in N_Entity);
3297 return Nodes.Table (N + 2).Flag10;
3300 function Flag53 (N : Node_Id) return Boolean is
3302 pragma Assert (Nkind (N) in N_Entity);
3303 return Nodes.Table (N + 2).Flag11;
3306 function Flag54 (N : Node_Id) return Boolean is
3308 pragma Assert (Nkind (N) in N_Entity);
3309 return Nodes.Table (N + 2).Flag12;
3312 function Flag55 (N : Node_Id) return Boolean is
3314 pragma Assert (Nkind (N) in N_Entity);
3315 return Nodes.Table (N + 2).Flag13;
3318 function Flag56 (N : Node_Id) return Boolean is
3320 pragma Assert (Nkind (N) in N_Entity);
3321 return Nodes.Table (N + 2).Flag14;
3324 function Flag57 (N : Node_Id) return Boolean is
3326 pragma Assert (Nkind (N) in N_Entity);
3327 return Nodes.Table (N + 2).Flag15;
3330 function Flag58 (N : Node_Id) return Boolean is
3332 pragma Assert (Nkind (N) in N_Entity);
3333 return Nodes.Table (N + 2).Flag16;
3336 function Flag59 (N : Node_Id) return Boolean is
3338 pragma Assert (Nkind (N) in N_Entity);
3339 return Nodes.Table (N + 2).Flag17;
3342 function Flag60 (N : Node_Id) return Boolean is
3344 pragma Assert (Nkind (N) in N_Entity);
3345 return Nodes.Table (N + 2).Flag18;
3348 function Flag61 (N : Node_Id) return Boolean is
3350 pragma Assert (Nkind (N) in N_Entity);
3351 return Nodes.Table (N + 1).Pflag1;
3354 function Flag62 (N : Node_Id) return Boolean is
3356 pragma Assert (Nkind (N) in N_Entity);
3357 return Nodes.Table (N + 1).Pflag2;
3360 function Flag63 (N : Node_Id) return Boolean is
3362 pragma Assert (Nkind (N) in N_Entity);
3363 return Nodes.Table (N + 2).Pflag1;
3366 function Flag64 (N : Node_Id) return Boolean is
3368 pragma Assert (Nkind (N) in N_Entity);
3369 return Nodes.Table (N + 2).Pflag2;
3372 function Flag65 (N : Node_Id) return Boolean is
3374 pragma Assert (Nkind (N) in N_Entity);
3375 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag65;
3378 function Flag66 (N : Node_Id) return Boolean is
3380 pragma Assert (Nkind (N) in N_Entity);
3381 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag66;
3384 function Flag67 (N : Node_Id) return Boolean is
3386 pragma Assert (Nkind (N) in N_Entity);
3387 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag67;
3390 function Flag68 (N : Node_Id) return Boolean is
3392 pragma Assert (Nkind (N) in N_Entity);
3393 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag68;
3396 function Flag69 (N : Node_Id) return Boolean is
3398 pragma Assert (Nkind (N) in N_Entity);
3399 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag69;
3402 function Flag70 (N : Node_Id) return Boolean is
3404 pragma Assert (Nkind (N) in N_Entity);
3405 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag70;
3408 function Flag71 (N : Node_Id) return Boolean is
3410 pragma Assert (Nkind (N) in N_Entity);
3411 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag71;
3414 function Flag72 (N : Node_Id) return Boolean is
3416 pragma Assert (Nkind (N) in N_Entity);
3417 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag72;
3420 function Flag73 (N : Node_Id) return Boolean is
3422 pragma Assert (Nkind (N) in N_Entity);
3423 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag73;
3426 function Flag74 (N : Node_Id) return Boolean is
3428 pragma Assert (Nkind (N) in N_Entity);
3429 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag74;
3432 function Flag75 (N : Node_Id) return Boolean is
3434 pragma Assert (Nkind (N) in N_Entity);
3435 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag75;
3438 function Flag76 (N : Node_Id) return Boolean is
3440 pragma Assert (Nkind (N) in N_Entity);
3441 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag76;
3444 function Flag77 (N : Node_Id) return Boolean is
3446 pragma Assert (Nkind (N) in N_Entity);
3447 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag77;
3450 function Flag78 (N : Node_Id) return Boolean is
3452 pragma Assert (Nkind (N) in N_Entity);
3453 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag78;
3456 function Flag79 (N : Node_Id) return Boolean is
3458 pragma Assert (Nkind (N) in N_Entity);
3459 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag79;
3462 function Flag80 (N : Node_Id) return Boolean is
3464 pragma Assert (Nkind (N) in N_Entity);
3465 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag80;
3468 function Flag81 (N : Node_Id) return Boolean is
3470 pragma Assert (Nkind (N) in N_Entity);
3471 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag81;
3474 function Flag82 (N : Node_Id) return Boolean is
3476 pragma Assert (Nkind (N) in N_Entity);
3477 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag82;
3480 function Flag83 (N : Node_Id) return Boolean is
3482 pragma Assert (Nkind (N) in N_Entity);
3483 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag83;
3486 function Flag84 (N : Node_Id) return Boolean is
3488 pragma Assert (Nkind (N) in N_Entity);
3489 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag84;
3492 function Flag85 (N : Node_Id) return Boolean is
3494 pragma Assert (Nkind (N) in N_Entity);
3495 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag85;
3498 function Flag86 (N : Node_Id) return Boolean is
3500 pragma Assert (Nkind (N) in N_Entity);
3501 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag86;
3504 function Flag87 (N : Node_Id) return Boolean is
3506 pragma Assert (Nkind (N) in N_Entity);
3507 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag87;
3510 function Flag88 (N : Node_Id) return Boolean is
3512 pragma Assert (Nkind (N) in N_Entity);
3513 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag88;
3516 function Flag89 (N : Node_Id) return Boolean is
3518 pragma Assert (Nkind (N) in N_Entity);
3519 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag89;
3522 function Flag90 (N : Node_Id) return Boolean is
3524 pragma Assert (Nkind (N) in N_Entity);
3525 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag90;
3528 function Flag91 (N : Node_Id) return Boolean is
3530 pragma Assert (Nkind (N) in N_Entity);
3531 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag91;
3534 function Flag92 (N : Node_Id) return Boolean is
3536 pragma Assert (Nkind (N) in N_Entity);
3537 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag92;
3540 function Flag93 (N : Node_Id) return Boolean is
3542 pragma Assert (Nkind (N) in N_Entity);
3543 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag93;
3546 function Flag94 (N : Node_Id) return Boolean is
3548 pragma Assert (Nkind (N) in N_Entity);
3549 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag94;
3552 function Flag95 (N : Node_Id) return Boolean is
3554 pragma Assert (Nkind (N) in N_Entity);
3555 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag95;
3558 function Flag96 (N : Node_Id) return Boolean is
3560 pragma Assert (Nkind (N) in N_Entity);
3561 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag96;
3564 function Flag97 (N : Node_Id) return Boolean is
3566 pragma Assert (Nkind (N) in N_Entity);
3567 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag97;
3570 function Flag98 (N : Node_Id) return Boolean is
3572 pragma Assert (Nkind (N) in N_Entity);
3573 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag98;
3576 function Flag99 (N : Node_Id) return Boolean is
3578 pragma Assert (Nkind (N) in N_Entity);
3579 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag99;
3582 function Flag100 (N : Node_Id) return Boolean is
3584 pragma Assert (Nkind (N) in N_Entity);
3585 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag100;
3588 function Flag101 (N : Node_Id) return Boolean is
3590 pragma Assert (Nkind (N) in N_Entity);
3591 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag101;
3594 function Flag102 (N : Node_Id) return Boolean is
3596 pragma Assert (Nkind (N) in N_Entity);
3597 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag102;
3600 function Flag103 (N : Node_Id) return Boolean is
3602 pragma Assert (Nkind (N) in N_Entity);
3603 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag103;
3606 function Flag104 (N : Node_Id) return Boolean is
3608 pragma Assert (Nkind (N) in N_Entity);
3609 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag104;
3612 function Flag105 (N : Node_Id) return Boolean is
3614 pragma Assert (Nkind (N) in N_Entity);
3615 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag105;
3618 function Flag106 (N : Node_Id) return Boolean is
3620 pragma Assert (Nkind (N) in N_Entity);
3621 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag106;
3624 function Flag107 (N : Node_Id) return Boolean is
3626 pragma Assert (Nkind (N) in N_Entity);
3627 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag107;
3630 function Flag108 (N : Node_Id) return Boolean is
3632 pragma Assert (Nkind (N) in N_Entity);
3633 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag108;
3636 function Flag109 (N : Node_Id) return Boolean is
3638 pragma Assert (Nkind (N) in N_Entity);
3639 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag109;
3642 function Flag110 (N : Node_Id) return Boolean is
3644 pragma Assert (Nkind (N) in N_Entity);
3645 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag110;
3648 function Flag111 (N : Node_Id) return Boolean is
3650 pragma Assert (Nkind (N) in N_Entity);
3651 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag111;
3654 function Flag112 (N : Node_Id) return Boolean is
3656 pragma Assert (Nkind (N) in N_Entity);
3657 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag112;
3660 function Flag113 (N : Node_Id) return Boolean is
3662 pragma Assert (Nkind (N) in N_Entity);
3663 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag113;
3666 function Flag114 (N : Node_Id) return Boolean is
3668 pragma Assert (Nkind (N) in N_Entity);
3669 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag114;
3672 function Flag115 (N : Node_Id) return Boolean is
3674 pragma Assert (Nkind (N) in N_Entity);
3675 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag115;
3678 function Flag116 (N : Node_Id) return Boolean is
3680 pragma Assert (Nkind (N) in N_Entity);
3681 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag116;
3684 function Flag117 (N : Node_Id) return Boolean is
3686 pragma Assert (Nkind (N) in N_Entity);
3687 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag117;
3690 function Flag118 (N : Node_Id) return Boolean is
3692 pragma Assert (Nkind (N) in N_Entity);
3693 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag118;
3696 function Flag119 (N : Node_Id) return Boolean is
3698 pragma Assert (Nkind (N) in N_Entity);
3699 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag119;
3702 function Flag120 (N : Node_Id) return Boolean is
3704 pragma Assert (Nkind (N) in N_Entity);
3705 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag120;
3708 function Flag121 (N : Node_Id) return Boolean is
3710 pragma Assert (Nkind (N) in N_Entity);
3711 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag121;
3714 function Flag122 (N : Node_Id) return Boolean is
3716 pragma Assert (Nkind (N) in N_Entity);
3717 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag122;
3720 function Flag123 (N : Node_Id) return Boolean is
3722 pragma Assert (Nkind (N) in N_Entity);
3723 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag123;
3726 function Flag124 (N : Node_Id) return Boolean is
3728 pragma Assert (Nkind (N) in N_Entity);
3729 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag124;
3732 function Flag125 (N : Node_Id) return Boolean is
3734 pragma Assert (Nkind (N) in N_Entity);
3735 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag125;
3738 function Flag126 (N : Node_Id) return Boolean is
3740 pragma Assert (Nkind (N) in N_Entity);
3741 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag126;
3744 function Flag127 (N : Node_Id) return Boolean is
3746 pragma Assert (Nkind (N) in N_Entity);
3747 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag127;
3750 function Flag128 (N : Node_Id) return Boolean is
3752 pragma Assert (Nkind (N) in N_Entity);
3753 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag128;
3756 function Flag129 (N : Node_Id) return Boolean is
3758 pragma Assert (Nkind (N) in N_Entity);
3759 return Nodes.Table (N + 3).In_List;
3762 function Flag130 (N : Node_Id) return Boolean is
3764 pragma Assert (Nkind (N) in N_Entity);
3765 return Nodes.Table (N + 3).Unused_1;
3768 function Flag131 (N : Node_Id) return Boolean is
3770 pragma Assert (Nkind (N) in N_Entity);
3771 return Nodes.Table (N + 3).Rewrite_Ins;
3774 function Flag132 (N : Node_Id) return Boolean is
3776 pragma Assert (Nkind (N) in N_Entity);
3777 return Nodes.Table (N + 3).Analyzed;
3780 function Flag133 (N : Node_Id) return Boolean is
3782 pragma Assert (Nkind (N) in N_Entity);
3783 return Nodes.Table (N + 3).Comes_From_Source;
3786 function Flag134 (N : Node_Id) return Boolean is
3788 pragma Assert (Nkind (N) in N_Entity);
3789 return Nodes.Table (N + 3).Error_Posted;
3792 function Flag135 (N : Node_Id) return Boolean is
3794 pragma Assert (Nkind (N) in N_Entity);
3795 return Nodes.Table (N + 3).Flag4;
3798 function Flag136 (N : Node_Id) return Boolean is
3800 pragma Assert (Nkind (N) in N_Entity);
3801 return Nodes.Table (N + 3).Flag5;
3804 function Flag137 (N : Node_Id) return Boolean is
3806 pragma Assert (Nkind (N) in N_Entity);
3807 return Nodes.Table (N + 3).Flag6;
3810 function Flag138 (N : Node_Id) return Boolean is
3812 pragma Assert (Nkind (N) in N_Entity);
3813 return Nodes.Table (N + 3).Flag7;
3816 function Flag139 (N : Node_Id) return Boolean is
3818 pragma Assert (Nkind (N) in N_Entity);
3819 return Nodes.Table (N + 3).Flag8;
3822 function Flag140 (N : Node_Id) return Boolean is
3824 pragma Assert (Nkind (N) in N_Entity);
3825 return Nodes.Table (N + 3).Flag9;
3828 function Flag141 (N : Node_Id) return Boolean is
3830 pragma Assert (Nkind (N) in N_Entity);
3831 return Nodes.Table (N + 3).Flag10;
3834 function Flag142 (N : Node_Id) return Boolean is
3836 pragma Assert (Nkind (N) in N_Entity);
3837 return Nodes.Table (N + 3).Flag11;
3840 function Flag143 (N : Node_Id) return Boolean is
3842 pragma Assert (Nkind (N) in N_Entity);
3843 return Nodes.Table (N + 3).Flag12;
3846 function Flag144 (N : Node_Id) return Boolean is
3848 pragma Assert (Nkind (N) in N_Entity);
3849 return Nodes.Table (N + 3).Flag13;
3852 function Flag145 (N : Node_Id) return Boolean is
3854 pragma Assert (Nkind (N) in N_Entity);
3855 return Nodes.Table (N + 3).Flag14;
3858 function Flag146 (N : Node_Id) return Boolean is
3860 pragma Assert (Nkind (N) in N_Entity);
3861 return Nodes.Table (N + 3).Flag15;
3864 function Flag147 (N : Node_Id) return Boolean is
3866 pragma Assert (Nkind (N) in N_Entity);
3867 return Nodes.Table (N + 3).Flag16;
3870 function Flag148 (N : Node_Id) return Boolean is
3872 pragma Assert (Nkind (N) in N_Entity);
3873 return Nodes.Table (N + 3).Flag17;
3876 function Flag149 (N : Node_Id) return Boolean is
3878 pragma Assert (Nkind (N) in N_Entity);
3879 return Nodes.Table (N + 3).Flag18;
3882 function Flag150 (N : Node_Id) return Boolean is
3884 pragma Assert (Nkind (N) in N_Entity);
3885 return Nodes.Table (N + 3).Pflag1;
3888 function Flag151 (N : Node_Id) return Boolean is
3890 pragma Assert (Nkind (N) in N_Entity);
3891 return Nodes.Table (N + 3).Pflag2;
3894 function Flag152 (N : Node_Id) return Boolean is
3896 pragma Assert (Nkind (N) in N_Entity);
3897 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag152;
3900 function Flag153 (N : Node_Id) return Boolean is
3902 pragma Assert (Nkind (N) in N_Entity);
3903 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag153;
3906 function Flag154 (N : Node_Id) return Boolean is
3908 pragma Assert (Nkind (N) in N_Entity);
3909 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag154;
3912 function Flag155 (N : Node_Id) return Boolean is
3914 pragma Assert (Nkind (N) in N_Entity);
3915 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag155;
3918 function Flag156 (N : Node_Id) return Boolean is
3920 pragma Assert (Nkind (N) in N_Entity);
3921 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag156;
3924 function Flag157 (N : Node_Id) return Boolean is
3926 pragma Assert (Nkind (N) in N_Entity);
3927 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag157;
3930 function Flag158 (N : Node_Id) return Boolean is
3932 pragma Assert (Nkind (N) in N_Entity);
3933 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag158;
3936 function Flag159 (N : Node_Id) return Boolean is
3938 pragma Assert (Nkind (N) in N_Entity);
3939 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag159;
3942 function Flag160 (N : Node_Id) return Boolean is
3944 pragma Assert (Nkind (N) in N_Entity);
3945 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag160;
3948 function Flag161 (N : Node_Id) return Boolean is
3950 pragma Assert (Nkind (N) in N_Entity);
3951 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag161;
3954 function Flag162 (N : Node_Id) return Boolean is
3956 pragma Assert (Nkind (N) in N_Entity);
3957 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag162;
3960 function Flag163 (N : Node_Id) return Boolean is
3962 pragma Assert (Nkind (N) in N_Entity);
3963 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag163;
3966 function Flag164 (N : Node_Id) return Boolean is
3968 pragma Assert (Nkind (N) in N_Entity);
3969 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag164;
3972 function Flag165 (N : Node_Id) return Boolean is
3974 pragma Assert (Nkind (N) in N_Entity);
3975 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag165;
3978 function Flag166 (N : Node_Id) return Boolean is
3980 pragma Assert (Nkind (N) in N_Entity);
3981 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag166;
3984 function Flag167 (N : Node_Id) return Boolean is
3986 pragma Assert (Nkind (N) in N_Entity);
3987 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag167;
3990 function Flag168 (N : Node_Id) return Boolean is
3992 pragma Assert (Nkind (N) in N_Entity);
3993 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag168;
3996 function Flag169 (N : Node_Id) return Boolean is
3998 pragma Assert (Nkind (N) in N_Entity);
3999 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag169;
4002 function Flag170 (N : Node_Id) return Boolean is
4004 pragma Assert (Nkind (N) in N_Entity);
4005 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag170;
4008 function Flag171 (N : Node_Id) return Boolean is
4010 pragma Assert (Nkind (N) in N_Entity);
4011 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag171;
4014 function Flag172 (N : Node_Id) return Boolean is
4016 pragma Assert (Nkind (N) in N_Entity);
4017 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag172;
4020 function Flag173 (N : Node_Id) return Boolean is
4022 pragma Assert (Nkind (N) in N_Entity);
4023 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag173;
4026 function Flag174 (N : Node_Id) return Boolean is
4028 pragma Assert (Nkind (N) in N_Entity);
4029 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag174;
4032 function Flag175 (N : Node_Id) return Boolean is
4034 pragma Assert (Nkind (N) in N_Entity);
4035 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag175;
4038 function Flag176 (N : Node_Id) return Boolean is
4040 pragma Assert (Nkind (N) in N_Entity);
4041 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag176;
4044 function Flag177 (N : Node_Id) return Boolean is
4046 pragma Assert (Nkind (N) in N_Entity);
4047 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag177;
4050 function Flag178 (N : Node_Id) return Boolean is
4052 pragma Assert (Nkind (N) in N_Entity);
4053 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag178;
4056 function Flag179 (N : Node_Id) return Boolean is
4058 pragma Assert (Nkind (N) in N_Entity);
4059 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag179;
4062 function Flag180 (N : Node_Id) return Boolean is
4064 pragma Assert (Nkind (N) in N_Entity);
4065 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag180;
4068 function Flag181 (N : Node_Id) return Boolean is
4070 pragma Assert (Nkind (N) in N_Entity);
4071 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag181;
4074 function Flag182 (N : Node_Id) return Boolean is
4076 pragma Assert (Nkind (N) in N_Entity);
4077 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag182;
4080 function Flag183 (N : Node_Id) return Boolean is
4082 pragma Assert (Nkind (N) in N_Entity);
4083 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag183;
4086 procedure Set_Nkind (N : Node_Id; Val : Node_Kind) is
4088 pragma Assert (N in Nodes.First .. Nodes.Last);
4089 Nodes.Table (N).Nkind := Val;
4092 procedure Set_Field1 (N : Node_Id; Val : Union_Id) is
4094 pragma Assert (N in Nodes.First .. Nodes.Last);
4095 Nodes.Table (N).Field1 := Val;
4098 procedure Set_Field2 (N : Node_Id; Val : Union_Id) is
4100 pragma Assert (N in Nodes.First .. Nodes.Last);
4101 Nodes.Table (N).Field2 := Val;
4104 procedure Set_Field3 (N : Node_Id; Val : Union_Id) is
4106 pragma Assert (N in Nodes.First .. Nodes.Last);
4107 Nodes.Table (N).Field3 := Val;
4110 procedure Set_Field4 (N : Node_Id; Val : Union_Id) is
4112 pragma Assert (N in Nodes.First .. Nodes.Last);
4113 Nodes.Table (N).Field4 := Val;
4116 procedure Set_Field5 (N : Node_Id; Val : Union_Id) is
4118 pragma Assert (N in Nodes.First .. Nodes.Last);
4119 Nodes.Table (N).Field5 := Val;
4122 procedure Set_Field6 (N : Node_Id; Val : Union_Id) is
4124 pragma Assert (Nkind (N) in N_Entity);
4125 Nodes.Table (N + 1).Field6 := Val;
4128 procedure Set_Field7 (N : Node_Id; Val : Union_Id) is
4130 pragma Assert (Nkind (N) in N_Entity);
4131 Nodes.Table (N + 1).Field7 := Val;
4134 procedure Set_Field8 (N : Node_Id; Val : Union_Id) is
4136 pragma Assert (Nkind (N) in N_Entity);
4137 Nodes.Table (N + 1).Field8 := Val;
4140 procedure Set_Field9 (N : Node_Id; Val : Union_Id) is
4142 pragma Assert (Nkind (N) in N_Entity);
4143 Nodes.Table (N + 1).Field9 := Val;
4146 procedure Set_Field10 (N : Node_Id; Val : Union_Id) is
4148 pragma Assert (Nkind (N) in N_Entity);
4149 Nodes.Table (N + 1).Field10 := Val;
4152 procedure Set_Field11 (N : Node_Id; Val : Union_Id) is
4154 pragma Assert (Nkind (N) in N_Entity);
4155 Nodes.Table (N + 1).Field11 := Val;
4158 procedure Set_Field12 (N : Node_Id; Val : Union_Id) is
4160 pragma Assert (Nkind (N) in N_Entity);
4161 Nodes.Table (N + 1).Field12 := Val;
4164 procedure Set_Field13 (N : Node_Id; Val : Union_Id) is
4166 pragma Assert (Nkind (N) in N_Entity);
4167 Nodes.Table (N + 2).Field6 := Val;
4170 procedure Set_Field14 (N : Node_Id; Val : Union_Id) is
4172 pragma Assert (Nkind (N) in N_Entity);
4173 Nodes.Table (N + 2).Field7 := Val;
4176 procedure Set_Field15 (N : Node_Id; Val : Union_Id) is
4178 pragma Assert (Nkind (N) in N_Entity);
4179 Nodes.Table (N + 2).Field8 := Val;
4182 procedure Set_Field16 (N : Node_Id; Val : Union_Id) is
4184 pragma Assert (Nkind (N) in N_Entity);
4185 Nodes.Table (N + 2).Field9 := Val;
4188 procedure Set_Field17 (N : Node_Id; Val : Union_Id) is
4190 pragma Assert (Nkind (N) in N_Entity);
4191 Nodes.Table (N + 2).Field10 := Val;
4194 procedure Set_Field18 (N : Node_Id; Val : Union_Id) is
4196 pragma Assert (Nkind (N) in N_Entity);
4197 Nodes.Table (N + 2).Field11 := Val;
4200 procedure Set_Field19 (N : Node_Id; Val : Union_Id) is
4202 pragma Assert (Nkind (N) in N_Entity);
4203 Nodes.Table (N + 3).Field6 := Val;
4206 procedure Set_Field20 (N : Node_Id; Val : Union_Id) is
4208 pragma Assert (Nkind (N) in N_Entity);
4209 Nodes.Table (N + 3).Field7 := Val;
4212 procedure Set_Field21 (N : Node_Id; Val : Union_Id) is
4214 pragma Assert (Nkind (N) in N_Entity);
4215 Nodes.Table (N + 3).Field8 := Val;
4218 procedure Set_Field22 (N : Node_Id; Val : Union_Id) is
4220 pragma Assert (Nkind (N) in N_Entity);
4221 Nodes.Table (N + 3).Field9 := Val;
4224 procedure Set_Field23 (N : Node_Id; Val : Union_Id) is
4226 pragma Assert (Nkind (N) in N_Entity);
4227 Nodes.Table (N + 3).Field10 := Val;
4230 procedure Set_Node1 (N : Node_Id; Val : Node_Id) is
4232 pragma Assert (N in Nodes.First .. Nodes.Last);
4233 Nodes.Table (N).Field1 := Union_Id (Val);
4236 procedure Set_Node2 (N : Node_Id; Val : Node_Id) is
4238 pragma Assert (N in Nodes.First .. Nodes.Last);
4239 Nodes.Table (N).Field2 := Union_Id (Val);
4242 procedure Set_Node3 (N : Node_Id; Val : Node_Id) is
4244 pragma Assert (N in Nodes.First .. Nodes.Last);
4245 Nodes.Table (N).Field3 := Union_Id (Val);
4248 procedure Set_Node4 (N : Node_Id; Val : Node_Id) is
4250 pragma Assert (N in Nodes.First .. Nodes.Last);
4251 Nodes.Table (N).Field4 := Union_Id (Val);
4254 procedure Set_Node5 (N : Node_Id; Val : Node_Id) is
4256 pragma Assert (N in Nodes.First .. Nodes.Last);
4257 Nodes.Table (N).Field5 := Union_Id (Val);
4260 procedure Set_Node6 (N : Node_Id; Val : Node_Id) is
4262 pragma Assert (Nkind (N) in N_Entity);
4263 Nodes.Table (N + 1).Field6 := Union_Id (Val);
4266 procedure Set_Node7 (N : Node_Id; Val : Node_Id) is
4268 pragma Assert (Nkind (N) in N_Entity);
4269 Nodes.Table (N + 1).Field7 := Union_Id (Val);
4272 procedure Set_Node8 (N : Node_Id; Val : Node_Id) is
4274 pragma Assert (Nkind (N) in N_Entity);
4275 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4278 procedure Set_Node9 (N : Node_Id; Val : Node_Id) is
4280 pragma Assert (Nkind (N) in N_Entity);
4281 Nodes.Table (N + 1).Field9 := Union_Id (Val);
4284 procedure Set_Node10 (N : Node_Id; Val : Node_Id) is
4286 pragma Assert (Nkind (N) in N_Entity);
4287 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4290 procedure Set_Node11 (N : Node_Id; Val : Node_Id) is
4292 pragma Assert (Nkind (N) in N_Entity);
4293 Nodes.Table (N + 1).Field11 := Union_Id (Val);
4296 procedure Set_Node12 (N : Node_Id; Val : Node_Id) is
4298 pragma Assert (Nkind (N) in N_Entity);
4299 Nodes.Table (N + 1).Field12 := Union_Id (Val);
4302 procedure Set_Node13 (N : Node_Id; Val : Node_Id) is
4304 pragma Assert (Nkind (N) in N_Entity);
4305 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4308 procedure Set_Node14 (N : Node_Id; Val : Node_Id) is
4310 pragma Assert (Nkind (N) in N_Entity);
4311 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4314 procedure Set_Node15 (N : Node_Id; Val : Node_Id) is
4316 pragma Assert (Nkind (N) in N_Entity);
4317 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4320 procedure Set_Node16 (N : Node_Id; Val : Node_Id) is
4322 pragma Assert (Nkind (N) in N_Entity);
4323 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4326 procedure Set_Node17 (N : Node_Id; Val : Node_Id) is
4328 pragma Assert (Nkind (N) in N_Entity);
4329 Nodes.Table (N + 2).Field10 := Union_Id (Val);
4332 procedure Set_Node18 (N : Node_Id; Val : Node_Id) is
4334 pragma Assert (Nkind (N) in N_Entity);
4335 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4338 procedure Set_Node19 (N : Node_Id; Val : Node_Id) is
4340 pragma Assert (Nkind (N) in N_Entity);
4341 Nodes.Table (N + 3).Field6 := Union_Id (Val);
4344 procedure Set_Node20 (N : Node_Id; Val : Node_Id) is
4346 pragma Assert (Nkind (N) in N_Entity);
4347 Nodes.Table (N + 3).Field7 := Union_Id (Val);
4350 procedure Set_Node21 (N : Node_Id; Val : Node_Id) is
4352 pragma Assert (Nkind (N) in N_Entity);
4353 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4356 procedure Set_Node22 (N : Node_Id; Val : Node_Id) is
4358 pragma Assert (Nkind (N) in N_Entity);
4359 Nodes.Table (N + 3).Field9 := Union_Id (Val);
4362 procedure Set_Node23 (N : Node_Id; Val : Node_Id) is
4364 pragma Assert (Nkind (N) in N_Entity);
4365 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4368 procedure Set_List1 (N : Node_Id; Val : List_Id) is
4370 pragma Assert (N in Nodes.First .. Nodes.Last);
4371 Nodes.Table (N).Field1 := Union_Id (Val);
4374 procedure Set_List2 (N : Node_Id; Val : List_Id) is
4376 pragma Assert (N in Nodes.First .. Nodes.Last);
4377 Nodes.Table (N).Field2 := Union_Id (Val);
4380 procedure Set_List3 (N : Node_Id; Val : List_Id) is
4382 pragma Assert (N in Nodes.First .. Nodes.Last);
4383 Nodes.Table (N).Field3 := Union_Id (Val);
4386 procedure Set_List4 (N : Node_Id; Val : List_Id) is
4388 pragma Assert (N in Nodes.First .. Nodes.Last);
4389 Nodes.Table (N).Field4 := Union_Id (Val);
4392 procedure Set_List5 (N : Node_Id; Val : List_Id) is
4394 pragma Assert (N in Nodes.First .. Nodes.Last);
4395 Nodes.Table (N).Field5 := Union_Id (Val);
4398 procedure Set_List10 (N : Node_Id; Val : List_Id) is
4400 pragma Assert (Nkind (N) in N_Entity);
4401 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4404 procedure Set_List14 (N : Node_Id; Val : List_Id) is
4406 pragma Assert (Nkind (N) in N_Entity);
4407 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4410 procedure Set_Elist2 (N : Node_Id; Val : Elist_Id) is
4412 Nodes.Table (N).Field2 := Union_Id (Val);
4415 procedure Set_Elist3 (N : Node_Id; Val : Elist_Id) is
4417 Nodes.Table (N).Field3 := Union_Id (Val);
4420 procedure Set_Elist4 (N : Node_Id; Val : Elist_Id) is
4422 Nodes.Table (N).Field4 := Union_Id (Val);
4425 procedure Set_Elist8 (N : Node_Id; Val : Elist_Id) is
4427 pragma Assert (Nkind (N) in N_Entity);
4428 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4431 procedure Set_Elist13 (N : Node_Id; Val : Elist_Id) is
4433 pragma Assert (Nkind (N) in N_Entity);
4434 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4437 procedure Set_Elist15 (N : Node_Id; Val : Elist_Id) is
4439 pragma Assert (Nkind (N) in N_Entity);
4440 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4443 procedure Set_Elist16 (N : Node_Id; Val : Elist_Id) is
4445 pragma Assert (Nkind (N) in N_Entity);
4446 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4449 procedure Set_Elist18 (N : Node_Id; Val : Elist_Id) is
4451 pragma Assert (Nkind (N) in N_Entity);
4452 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4455 procedure Set_Elist21 (N : Node_Id; Val : Elist_Id) is
4457 pragma Assert (Nkind (N) in N_Entity);
4458 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4461 procedure Set_Elist23 (N : Node_Id; Val : Elist_Id) is
4463 pragma Assert (Nkind (N) in N_Entity);
4464 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4467 procedure Set_Name1 (N : Node_Id; Val : Name_Id) is
4469 pragma Assert (N in Nodes.First .. Nodes.Last);
4470 Nodes.Table (N).Field1 := Union_Id (Val);
4473 procedure Set_Name2 (N : Node_Id; Val : Name_Id) is
4475 pragma Assert (N in Nodes.First .. Nodes.Last);
4476 Nodes.Table (N).Field2 := Union_Id (Val);
4479 procedure Set_Str3 (N : Node_Id; Val : String_Id) is
4481 pragma Assert (N in Nodes.First .. Nodes.Last);
4482 Nodes.Table (N).Field3 := Union_Id (Val);
4485 procedure Set_Uint3 (N : Node_Id; Val : Uint) is
4487 pragma Assert (N in Nodes.First .. Nodes.Last);
4488 Nodes.Table (N).Field3 := To_Union (Val);
4491 procedure Set_Uint4 (N : Node_Id; Val : Uint) is
4493 pragma Assert (N in Nodes.First .. Nodes.Last);
4494 Nodes.Table (N).Field4 := To_Union (Val);
4497 procedure Set_Uint5 (N : Node_Id; Val : Uint) is
4499 pragma Assert (N in Nodes.First .. Nodes.Last);
4500 Nodes.Table (N).Field5 := To_Union (Val);
4503 procedure Set_Uint8 (N : Node_Id; Val : Uint) is
4505 pragma Assert (Nkind (N) in N_Entity);
4506 Nodes.Table (N + 1).Field8 := To_Union (Val);
4509 procedure Set_Uint9 (N : Node_Id; Val : Uint) is
4511 pragma Assert (Nkind (N) in N_Entity);
4512 Nodes.Table (N + 1).Field9 := To_Union (Val);
4515 procedure Set_Uint10 (N : Node_Id; Val : Uint) is
4517 pragma Assert (Nkind (N) in N_Entity);
4518 Nodes.Table (N + 1).Field10 := To_Union (Val);
4521 procedure Set_Uint11 (N : Node_Id; Val : Uint) is
4523 pragma Assert (Nkind (N) in N_Entity);
4524 Nodes.Table (N + 1).Field11 := To_Union (Val);
4527 procedure Set_Uint12 (N : Node_Id; Val : Uint) is
4529 pragma Assert (Nkind (N) in N_Entity);
4530 Nodes.Table (N + 1).Field12 := To_Union (Val);
4533 procedure Set_Uint13 (N : Node_Id; Val : Uint) is
4535 pragma Assert (Nkind (N) in N_Entity);
4536 Nodes.Table (N + 2).Field6 := To_Union (Val);
4539 procedure Set_Uint14 (N : Node_Id; Val : Uint) is
4541 pragma Assert (Nkind (N) in N_Entity);
4542 Nodes.Table (N + 2).Field7 := To_Union (Val);
4545 procedure Set_Uint15 (N : Node_Id; Val : Uint) is
4547 pragma Assert (Nkind (N) in N_Entity);
4548 Nodes.Table (N + 2).Field8 := To_Union (Val);
4551 procedure Set_Uint16 (N : Node_Id; Val : Uint) is
4553 pragma Assert (Nkind (N) in N_Entity);
4554 Nodes.Table (N + 2).Field9 := To_Union (Val);
4557 procedure Set_Uint17 (N : Node_Id; Val : Uint) is
4559 pragma Assert (Nkind (N) in N_Entity);
4560 Nodes.Table (N + 2).Field10 := To_Union (Val);
4563 procedure Set_Uint22 (N : Node_Id; Val : Uint) is
4565 pragma Assert (Nkind (N) in N_Entity);
4566 Nodes.Table (N + 3).Field9 := To_Union (Val);
4569 procedure Set_Ureal3 (N : Node_Id; Val : Ureal) is
4571 pragma Assert (N in Nodes.First .. Nodes.Last);
4572 Nodes.Table (N).Field3 := To_Union (Val);
4575 procedure Set_Ureal18 (N : Node_Id; Val : Ureal) is
4577 pragma Assert (Nkind (N) in N_Entity);
4578 Nodes.Table (N + 2).Field11 := To_Union (Val);
4581 procedure Set_Ureal21 (N : Node_Id; Val : Ureal) is
4583 pragma Assert (Nkind (N) in N_Entity);
4584 Nodes.Table (N + 3).Field8 := To_Union (Val);
4587 procedure Set_Char_Code2 (N : Node_Id; Val : Char_Code) is
4589 pragma Assert (N in Nodes.First .. Nodes.Last);
4590 Nodes.Table (N).Field2 := Union_Id (Val) + Char_Code_Bias;
4593 procedure Set_Flag4 (N : Node_Id; Val : Boolean) is
4595 pragma Assert (N in Nodes.First .. Nodes.Last);
4596 Nodes.Table (N).Flag4 := Val;
4599 procedure Set_Flag5 (N : Node_Id; Val : Boolean) is
4601 pragma Assert (N in Nodes.First .. Nodes.Last);
4602 Nodes.Table (N).Flag5 := Val;
4605 procedure Set_Flag6 (N : Node_Id; Val : Boolean) is
4607 pragma Assert (N in Nodes.First .. Nodes.Last);
4608 Nodes.Table (N).Flag6 := Val;
4611 procedure Set_Flag7 (N : Node_Id; Val : Boolean) is
4613 pragma Assert (N in Nodes.First .. Nodes.Last);
4614 Nodes.Table (N).Flag7 := Val;
4617 procedure Set_Flag8 (N : Node_Id; Val : Boolean) is
4619 pragma Assert (N in Nodes.First .. Nodes.Last);
4620 Nodes.Table (N).Flag8 := Val;
4623 procedure Set_Flag9 (N : Node_Id; Val : Boolean) is
4625 pragma Assert (N in Nodes.First .. Nodes.Last);
4626 Nodes.Table (N).Flag9 := Val;
4629 procedure Set_Flag10 (N : Node_Id; Val : Boolean) is
4631 pragma Assert (N in Nodes.First .. Nodes.Last);
4632 Nodes.Table (N).Flag10 := Val;
4635 procedure Set_Flag11 (N : Node_Id; Val : Boolean) is
4637 pragma Assert (N in Nodes.First .. Nodes.Last);
4638 Nodes.Table (N).Flag11 := Val;
4641 procedure Set_Flag12 (N : Node_Id; Val : Boolean) is
4643 pragma Assert (N in Nodes.First .. Nodes.Last);
4644 Nodes.Table (N).Flag12 := Val;
4647 procedure Set_Flag13 (N : Node_Id; Val : Boolean) is
4649 pragma Assert (N in Nodes.First .. Nodes.Last);
4650 Nodes.Table (N).Flag13 := Val;
4653 procedure Set_Flag14 (N : Node_Id; Val : Boolean) is
4655 pragma Assert (N in Nodes.First .. Nodes.Last);
4656 Nodes.Table (N).Flag14 := Val;
4659 procedure Set_Flag15 (N : Node_Id; Val : Boolean) is
4661 pragma Assert (N in Nodes.First .. Nodes.Last);
4662 Nodes.Table (N).Flag15 := Val;
4665 procedure Set_Flag16 (N : Node_Id; Val : Boolean) is
4667 pragma Assert (N in Nodes.First .. Nodes.Last);
4668 Nodes.Table (N).Flag16 := Val;
4671 procedure Set_Flag17 (N : Node_Id; Val : Boolean) is
4673 pragma Assert (N in Nodes.First .. Nodes.Last);
4674 Nodes.Table (N).Flag17 := Val;
4677 procedure Set_Flag18 (N : Node_Id; Val : Boolean) is
4679 pragma Assert (N in Nodes.First .. Nodes.Last);
4680 Nodes.Table (N).Flag18 := Val;
4683 procedure Set_Flag19 (N : Node_Id; Val : Boolean) is
4685 pragma Assert (Nkind (N) in N_Entity);
4686 Nodes.Table (N + 1).In_List := Val;
4689 procedure Set_Flag20 (N : Node_Id; Val : Boolean) is
4691 pragma Assert (Nkind (N) in N_Entity);
4692 Nodes.Table (N + 1).Unused_1 := Val;
4695 procedure Set_Flag21 (N : Node_Id; Val : Boolean) is
4697 pragma Assert (Nkind (N) in N_Entity);
4698 Nodes.Table (N + 1).Rewrite_Ins := Val;
4701 procedure Set_Flag22 (N : Node_Id; Val : Boolean) is
4703 pragma Assert (Nkind (N) in N_Entity);
4704 Nodes.Table (N + 1).Analyzed := Val;
4707 procedure Set_Flag23 (N : Node_Id; Val : Boolean) is
4709 pragma Assert (Nkind (N) in N_Entity);
4710 Nodes.Table (N + 1).Comes_From_Source := Val;
4713 procedure Set_Flag24 (N : Node_Id; Val : Boolean) is
4715 pragma Assert (Nkind (N) in N_Entity);
4716 Nodes.Table (N + 1).Error_Posted := Val;
4719 procedure Set_Flag25 (N : Node_Id; Val : Boolean) is
4721 pragma Assert (Nkind (N) in N_Entity);
4722 Nodes.Table (N + 1).Flag4 := Val;
4725 procedure Set_Flag26 (N : Node_Id; Val : Boolean) is
4727 pragma Assert (Nkind (N) in N_Entity);
4728 Nodes.Table (N + 1).Flag5 := Val;
4731 procedure Set_Flag27 (N : Node_Id; Val : Boolean) is
4733 pragma Assert (Nkind (N) in N_Entity);
4734 Nodes.Table (N + 1).Flag6 := Val;
4737 procedure Set_Flag28 (N : Node_Id; Val : Boolean) is
4739 pragma Assert (Nkind (N) in N_Entity);
4740 Nodes.Table (N + 1).Flag7 := Val;
4743 procedure Set_Flag29 (N : Node_Id; Val : Boolean) is
4745 pragma Assert (Nkind (N) in N_Entity);
4746 Nodes.Table (N + 1).Flag8 := Val;
4749 procedure Set_Flag30 (N : Node_Id; Val : Boolean) is
4751 pragma Assert (Nkind (N) in N_Entity);
4752 Nodes.Table (N + 1).Flag9 := Val;
4755 procedure Set_Flag31 (N : Node_Id; Val : Boolean) is
4757 pragma Assert (Nkind (N) in N_Entity);
4758 Nodes.Table (N + 1).Flag10 := Val;
4761 procedure Set_Flag32 (N : Node_Id; Val : Boolean) is
4763 pragma Assert (Nkind (N) in N_Entity);
4764 Nodes.Table (N + 1).Flag11 := Val;
4767 procedure Set_Flag33 (N : Node_Id; Val : Boolean) is
4769 pragma Assert (Nkind (N) in N_Entity);
4770 Nodes.Table (N + 1).Flag12 := Val;
4773 procedure Set_Flag34 (N : Node_Id; Val : Boolean) is
4775 pragma Assert (Nkind (N) in N_Entity);
4776 Nodes.Table (N + 1).Flag13 := Val;
4779 procedure Set_Flag35 (N : Node_Id; Val : Boolean) is
4781 pragma Assert (Nkind (N) in N_Entity);
4782 Nodes.Table (N + 1).Flag14 := Val;
4785 procedure Set_Flag36 (N : Node_Id; Val : Boolean) is
4787 pragma Assert (Nkind (N) in N_Entity);
4788 Nodes.Table (N + 1).Flag15 := Val;
4791 procedure Set_Flag37 (N : Node_Id; Val : Boolean) is
4793 pragma Assert (Nkind (N) in N_Entity);
4794 Nodes.Table (N + 1).Flag16 := Val;
4797 procedure Set_Flag38 (N : Node_Id; Val : Boolean) is
4799 pragma Assert (Nkind (N) in N_Entity);
4800 Nodes.Table (N + 1).Flag17 := Val;
4803 procedure Set_Flag39 (N : Node_Id; Val : Boolean) is
4805 pragma Assert (Nkind (N) in N_Entity);
4806 Nodes.Table (N + 1).Flag18 := Val;
4809 procedure Set_Flag40 (N : Node_Id; Val : Boolean) is
4811 pragma Assert (Nkind (N) in N_Entity);
4812 Nodes.Table (N + 2).In_List := Val;
4815 procedure Set_Flag41 (N : Node_Id; Val : Boolean) is
4817 pragma Assert (Nkind (N) in N_Entity);
4818 Nodes.Table (N + 2).Unused_1 := Val;
4821 procedure Set_Flag42 (N : Node_Id; Val : Boolean) is
4823 pragma Assert (Nkind (N) in N_Entity);
4824 Nodes.Table (N + 2).Rewrite_Ins := Val;
4827 procedure Set_Flag43 (N : Node_Id; Val : Boolean) is
4829 pragma Assert (Nkind (N) in N_Entity);
4830 Nodes.Table (N + 2).Analyzed := Val;
4833 procedure Set_Flag44 (N : Node_Id; Val : Boolean) is
4835 pragma Assert (Nkind (N) in N_Entity);
4836 Nodes.Table (N + 2).Comes_From_Source := Val;
4839 procedure Set_Flag45 (N : Node_Id; Val : Boolean) is
4841 pragma Assert (Nkind (N) in N_Entity);
4842 Nodes.Table (N + 2).Error_Posted := Val;
4845 procedure Set_Flag46 (N : Node_Id; Val : Boolean) is
4847 pragma Assert (Nkind (N) in N_Entity);
4848 Nodes.Table (N + 2).Flag4 := Val;
4851 procedure Set_Flag47 (N : Node_Id; Val : Boolean) is
4853 pragma Assert (Nkind (N) in N_Entity);
4854 Nodes.Table (N + 2).Flag5 := Val;
4857 procedure Set_Flag48 (N : Node_Id; Val : Boolean) is
4859 pragma Assert (Nkind (N) in N_Entity);
4860 Nodes.Table (N + 2).Flag6 := Val;
4863 procedure Set_Flag49 (N : Node_Id; Val : Boolean) is
4865 pragma Assert (Nkind (N) in N_Entity);
4866 Nodes.Table (N + 2).Flag7 := Val;
4869 procedure Set_Flag50 (N : Node_Id; Val : Boolean) is
4871 pragma Assert (Nkind (N) in N_Entity);
4872 Nodes.Table (N + 2).Flag8 := Val;
4875 procedure Set_Flag51 (N : Node_Id; Val : Boolean) is
4877 pragma Assert (Nkind (N) in N_Entity);
4878 Nodes.Table (N + 2).Flag9 := Val;
4881 procedure Set_Flag52 (N : Node_Id; Val : Boolean) is
4883 pragma Assert (Nkind (N) in N_Entity);
4884 Nodes.Table (N + 2).Flag10 := Val;
4887 procedure Set_Flag53 (N : Node_Id; Val : Boolean) is
4889 pragma Assert (Nkind (N) in N_Entity);
4890 Nodes.Table (N + 2).Flag11 := Val;
4893 procedure Set_Flag54 (N : Node_Id; Val : Boolean) is
4895 pragma Assert (Nkind (N) in N_Entity);
4896 Nodes.Table (N + 2).Flag12 := Val;
4899 procedure Set_Flag55 (N : Node_Id; Val : Boolean) is
4901 pragma Assert (Nkind (N) in N_Entity);
4902 Nodes.Table (N + 2).Flag13 := Val;
4905 procedure Set_Flag56 (N : Node_Id; Val : Boolean) is
4907 pragma Assert (Nkind (N) in N_Entity);
4908 Nodes.Table (N + 2).Flag14 := Val;
4911 procedure Set_Flag57 (N : Node_Id; Val : Boolean) is
4913 pragma Assert (Nkind (N) in N_Entity);
4914 Nodes.Table (N + 2).Flag15 := Val;
4917 procedure Set_Flag58 (N : Node_Id; Val : Boolean) is
4919 pragma Assert (Nkind (N) in N_Entity);
4920 Nodes.Table (N + 2).Flag16 := Val;
4923 procedure Set_Flag59 (N : Node_Id; Val : Boolean) is
4925 pragma Assert (Nkind (N) in N_Entity);
4926 Nodes.Table (N + 2).Flag17 := Val;
4929 procedure Set_Flag60 (N : Node_Id; Val : Boolean) is
4931 pragma Assert (Nkind (N) in N_Entity);
4932 Nodes.Table (N + 2).Flag18 := Val;
4935 procedure Set_Flag61 (N : Node_Id; Val : Boolean) is
4937 pragma Assert (Nkind (N) in N_Entity);
4938 Nodes.Table (N + 1).Pflag1 := Val;
4941 procedure Set_Flag62 (N : Node_Id; Val : Boolean) is
4943 pragma Assert (Nkind (N) in N_Entity);
4944 Nodes.Table (N + 1).Pflag2 := Val;
4947 procedure Set_Flag63 (N : Node_Id; Val : Boolean) is
4949 pragma Assert (Nkind (N) in N_Entity);
4950 Nodes.Table (N + 2).Pflag1 := Val;
4953 procedure Set_Flag64 (N : Node_Id; Val : Boolean) is
4955 pragma Assert (Nkind (N) in N_Entity);
4956 Nodes.Table (N + 2).Pflag2 := Val;
4959 procedure Set_Flag65 (N : Node_Id; Val : Boolean) is
4961 pragma Assert (Nkind (N) in N_Entity);
4964 (Nodes
.Table
(N
+ 2).Nkind
'Unrestricted_Access)).Flag65
:= Val
;
4967 procedure Set_Flag66
(N
: Node_Id
; Val
: Boolean) is
4969 pragma Assert
(Nkind
(N
) in N_Entity
);
4972 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag66 := Val;
4975 procedure Set_Flag67 (N : Node_Id; Val : Boolean) is
4977 pragma Assert (Nkind (N) in N_Entity);
4980 (Nodes
.Table
(N
+ 2).Nkind
'Unrestricted_Access)).Flag67
:= Val
;
4983 procedure Set_Flag68
(N
: Node_Id
; Val
: Boolean) is
4985 pragma Assert
(Nkind
(N
) in N_Entity
);
4988 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag68 := Val;
4991 procedure Set_Flag69 (N : Node_Id; Val : Boolean) is
4993 pragma Assert (Nkind (N) in N_Entity);
4996 (Nodes
.Table
(N
+ 2).Nkind
'Unrestricted_Access)).Flag69
:= Val
;
4999 procedure Set_Flag70
(N
: Node_Id
; Val
: Boolean) is
5001 pragma Assert
(Nkind
(N
) in N_Entity
);
5004 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag70 := Val;
5007 procedure Set_Flag71 (N : Node_Id; Val : Boolean) is
5009 pragma Assert (Nkind (N) in N_Entity);
5012 (Nodes
.Table
(N
+ 2).Nkind
'Unrestricted_Access)).Flag71
:= Val
;
5015 procedure Set_Flag72
(N
: Node_Id
; Val
: Boolean) is
5017 pragma Assert
(Nkind
(N
) in N_Entity
);
5020 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag72 := Val;
5023 procedure Set_Flag73 (N : Node_Id; Val : Boolean) is
5025 pragma Assert (Nkind (N) in N_Entity);
5028 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag73
:= Val
;
5031 procedure Set_Flag74
(N
: Node_Id
; Val
: Boolean) is
5033 pragma Assert
(Nkind
(N
) in N_Entity
);
5036 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag74 := Val;
5039 procedure Set_Flag75 (N : Node_Id; Val : Boolean) is
5041 pragma Assert (Nkind (N) in N_Entity);
5044 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag75
:= Val
;
5047 procedure Set_Flag76
(N
: Node_Id
; Val
: Boolean) is
5049 pragma Assert
(Nkind
(N
) in N_Entity
);
5052 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag76 := Val;
5055 procedure Set_Flag77 (N : Node_Id; Val : Boolean) is
5057 pragma Assert (Nkind (N) in N_Entity);
5060 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag77
:= Val
;
5063 procedure Set_Flag78
(N
: Node_Id
; Val
: Boolean) is
5065 pragma Assert
(Nkind
(N
) in N_Entity
);
5068 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag78 := Val;
5071 procedure Set_Flag79 (N : Node_Id; Val : Boolean) is
5073 pragma Assert (Nkind (N) in N_Entity);
5076 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag79
:= Val
;
5079 procedure Set_Flag80
(N
: Node_Id
; Val
: Boolean) is
5081 pragma Assert
(Nkind
(N
) in N_Entity
);
5084 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag80 := Val;
5087 procedure Set_Flag81 (N : Node_Id; Val : Boolean) is
5089 pragma Assert (Nkind (N) in N_Entity);
5092 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag81
:= Val
;
5095 procedure Set_Flag82
(N
: Node_Id
; Val
: Boolean) is
5097 pragma Assert
(Nkind
(N
) in N_Entity
);
5100 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag82 := Val;
5103 procedure Set_Flag83 (N : Node_Id; Val : Boolean) is
5105 pragma Assert (Nkind (N) in N_Entity);
5108 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag83
:= Val
;
5111 procedure Set_Flag84
(N
: Node_Id
; Val
: Boolean) is
5113 pragma Assert
(Nkind
(N
) in N_Entity
);
5116 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag84 := Val;
5119 procedure Set_Flag85 (N : Node_Id; Val : Boolean) is
5121 pragma Assert (Nkind (N) in N_Entity);
5124 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag85
:= Val
;
5127 procedure Set_Flag86
(N
: Node_Id
; Val
: Boolean) is
5129 pragma Assert
(Nkind
(N
) in N_Entity
);
5132 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag86 := Val;
5135 procedure Set_Flag87 (N : Node_Id; Val : Boolean) is
5137 pragma Assert (Nkind (N) in N_Entity);
5140 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag87
:= Val
;
5143 procedure Set_Flag88
(N
: Node_Id
; Val
: Boolean) is
5145 pragma Assert
(Nkind
(N
) in N_Entity
);
5148 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag88 := Val;
5151 procedure Set_Flag89 (N : Node_Id; Val : Boolean) is
5153 pragma Assert (Nkind (N) in N_Entity);
5156 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag89
:= Val
;
5159 procedure Set_Flag90
(N
: Node_Id
; Val
: Boolean) is
5161 pragma Assert
(Nkind
(N
) in N_Entity
);
5164 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag90 := Val;
5167 procedure Set_Flag91 (N : Node_Id; Val : Boolean) is
5169 pragma Assert (Nkind (N) in N_Entity);
5172 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag91
:= Val
;
5175 procedure Set_Flag92
(N
: Node_Id
; Val
: Boolean) is
5177 pragma Assert
(Nkind
(N
) in N_Entity
);
5180 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag92 := Val;
5183 procedure Set_Flag93 (N : Node_Id; Val : Boolean) is
5185 pragma Assert (Nkind (N) in N_Entity);
5188 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag93
:= Val
;
5191 procedure Set_Flag94
(N
: Node_Id
; Val
: Boolean) is
5193 pragma Assert
(Nkind
(N
) in N_Entity
);
5196 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag94 := Val;
5199 procedure Set_Flag95 (N : Node_Id; Val : Boolean) is
5201 pragma Assert (Nkind (N) in N_Entity);
5204 (Nodes
.Table
(N
+ 2).Field12
'Unrestricted_Access)).Flag95
:= Val
;
5207 procedure Set_Flag96
(N
: Node_Id
; Val
: Boolean) is
5209 pragma Assert
(Nkind
(N
) in N_Entity
);
5212 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag96 := Val;
5215 procedure Set_Flag97 (N : Node_Id; Val : Boolean) is
5217 pragma Assert (Nkind (N) in N_Entity);
5220 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag97
:= Val
;
5223 procedure Set_Flag98
(N
: Node_Id
; Val
: Boolean) is
5225 pragma Assert
(Nkind
(N
) in N_Entity
);
5228 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag98 := Val;
5231 procedure Set_Flag99 (N : Node_Id; Val : Boolean) is
5233 pragma Assert (Nkind (N) in N_Entity);
5236 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag99
:= Val
;
5239 procedure Set_Flag100
(N
: Node_Id
; Val
: Boolean) is
5241 pragma Assert
(Nkind
(N
) in N_Entity
);
5244 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag100 := Val;
5247 procedure Set_Flag101 (N : Node_Id; Val : Boolean) is
5249 pragma Assert (Nkind (N) in N_Entity);
5252 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag101
:= Val
;
5255 procedure Set_Flag102
(N
: Node_Id
; Val
: Boolean) is
5257 pragma Assert
(Nkind
(N
) in N_Entity
);
5260 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag102 := Val;
5263 procedure Set_Flag103 (N : Node_Id; Val : Boolean) is
5265 pragma Assert (Nkind (N) in N_Entity);
5268 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag103
:= Val
;
5271 procedure Set_Flag104
(N
: Node_Id
; Val
: Boolean) is
5273 pragma Assert
(Nkind
(N
) in N_Entity
);
5276 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag104 := Val;
5279 procedure Set_Flag105 (N : Node_Id; Val : Boolean) is
5281 pragma Assert (Nkind (N) in N_Entity);
5284 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag105
:= Val
;
5287 procedure Set_Flag106
(N
: Node_Id
; Val
: Boolean) is
5289 pragma Assert
(Nkind
(N
) in N_Entity
);
5292 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag106 := Val;
5295 procedure Set_Flag107 (N : Node_Id; Val : Boolean) is
5297 pragma Assert (Nkind (N) in N_Entity);
5300 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag107
:= Val
;
5303 procedure Set_Flag108
(N
: Node_Id
; Val
: Boolean) is
5305 pragma Assert
(Nkind
(N
) in N_Entity
);
5308 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag108 := Val;
5311 procedure Set_Flag109 (N : Node_Id; Val : Boolean) is
5313 pragma Assert (Nkind (N) in N_Entity);
5316 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag109
:= Val
;
5319 procedure Set_Flag110
(N
: Node_Id
; Val
: Boolean) is
5321 pragma Assert
(Nkind
(N
) in N_Entity
);
5324 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag110 := Val;
5327 procedure Set_Flag111 (N : Node_Id; Val : Boolean) is
5329 pragma Assert (Nkind (N) in N_Entity);
5332 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag111
:= Val
;
5335 procedure Set_Flag112
(N
: Node_Id
; Val
: Boolean) is
5337 pragma Assert
(Nkind
(N
) in N_Entity
);
5340 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag112 := Val;
5343 procedure Set_Flag113 (N : Node_Id; Val : Boolean) is
5345 pragma Assert (Nkind (N) in N_Entity);
5348 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag113
:= Val
;
5351 procedure Set_Flag114
(N
: Node_Id
; Val
: Boolean) is
5353 pragma Assert
(Nkind
(N
) in N_Entity
);
5356 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag114 := Val;
5359 procedure Set_Flag115 (N : Node_Id; Val : Boolean) is
5361 pragma Assert (Nkind (N) in N_Entity);
5364 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag115
:= Val
;
5367 procedure Set_Flag116
(N
: Node_Id
; Val
: Boolean) is
5369 pragma Assert
(Nkind
(N
) in N_Entity
);
5372 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag116 := Val;
5375 procedure Set_Flag117 (N : Node_Id; Val : Boolean) is
5377 pragma Assert (Nkind (N) in N_Entity);
5380 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag117
:= Val
;
5383 procedure Set_Flag118
(N
: Node_Id
; Val
: Boolean) is
5385 pragma Assert
(Nkind
(N
) in N_Entity
);
5388 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag118 := Val;
5391 procedure Set_Flag119 (N : Node_Id; Val : Boolean) is
5393 pragma Assert (Nkind (N) in N_Entity);
5396 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag119
:= Val
;
5399 procedure Set_Flag120
(N
: Node_Id
; Val
: Boolean) is
5401 pragma Assert
(Nkind
(N
) in N_Entity
);
5404 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag120 := Val;
5407 procedure Set_Flag121 (N : Node_Id; Val : Boolean) is
5409 pragma Assert (Nkind (N) in N_Entity);
5412 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag121
:= Val
;
5415 procedure Set_Flag122
(N
: Node_Id
; Val
: Boolean) is
5417 pragma Assert
(Nkind
(N
) in N_Entity
);
5420 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag122 := Val;
5423 procedure Set_Flag123 (N : Node_Id; Val : Boolean) is
5425 pragma Assert (Nkind (N) in N_Entity);
5428 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag123
:= Val
;
5431 procedure Set_Flag124
(N
: Node_Id
; Val
: Boolean) is
5433 pragma Assert
(Nkind
(N
) in N_Entity
);
5436 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag124 := Val;
5439 procedure Set_Flag125 (N : Node_Id; Val : Boolean) is
5441 pragma Assert (Nkind (N) in N_Entity);
5444 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag125
:= Val
;
5447 procedure Set_Flag126
(N
: Node_Id
; Val
: Boolean) is
5449 pragma Assert
(Nkind
(N
) in N_Entity
);
5452 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag126 := Val;
5455 procedure Set_Flag127 (N : Node_Id; Val : Boolean) is
5457 pragma Assert (Nkind (N) in N_Entity);
5460 (Nodes
.Table
(N
+ 3).Field12
'Unrestricted_Access)).Flag127
:= Val
;
5463 procedure Set_Flag128
(N
: Node_Id
; Val
: Boolean) is
5465 pragma Assert
(Nkind
(N
) in N_Entity
);
5468 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag128 := Val;
5471 procedure Set_Flag129 (N : Node_Id; Val : Boolean) is
5473 pragma Assert (Nkind (N) in N_Entity);
5474 Nodes.Table (N + 3).In_List := Val;
5477 procedure Set_Flag130 (N : Node_Id; Val : Boolean) is
5479 pragma Assert (Nkind (N) in N_Entity);
5480 Nodes.Table (N + 3).Unused_1 := Val;
5483 procedure Set_Flag131 (N : Node_Id; Val : Boolean) is
5485 pragma Assert (Nkind (N) in N_Entity);
5486 Nodes.Table (N + 3).Rewrite_Ins := Val;
5489 procedure Set_Flag132 (N : Node_Id; Val : Boolean) is
5491 pragma Assert (Nkind (N) in N_Entity);
5492 Nodes.Table (N + 3).Analyzed := Val;
5495 procedure Set_Flag133 (N : Node_Id; Val : Boolean) is
5497 pragma Assert (Nkind (N) in N_Entity);
5498 Nodes.Table (N + 3).Comes_From_Source := Val;
5501 procedure Set_Flag134 (N : Node_Id; Val : Boolean) is
5503 pragma Assert (Nkind (N) in N_Entity);
5504 Nodes.Table (N + 3).Error_Posted := Val;
5507 procedure Set_Flag135 (N : Node_Id; Val : Boolean) is
5509 pragma Assert (Nkind (N) in N_Entity);
5510 Nodes.Table (N + 3).Flag4 := Val;
5513 procedure Set_Flag136 (N : Node_Id; Val : Boolean) is
5515 pragma Assert (Nkind (N) in N_Entity);
5516 Nodes.Table (N + 3).Flag5 := Val;
5519 procedure Set_Flag137 (N : Node_Id; Val : Boolean) is
5521 pragma Assert (Nkind (N) in N_Entity);
5522 Nodes.Table (N + 3).Flag6 := Val;
5525 procedure Set_Flag138 (N : Node_Id; Val : Boolean) is
5527 pragma Assert (Nkind (N) in N_Entity);
5528 Nodes.Table (N + 3).Flag7 := Val;
5531 procedure Set_Flag139 (N : Node_Id; Val : Boolean) is
5533 pragma Assert (Nkind (N) in N_Entity);
5534 Nodes.Table (N + 3).Flag8 := Val;
5537 procedure Set_Flag140 (N : Node_Id; Val : Boolean) is
5539 pragma Assert (Nkind (N) in N_Entity);
5540 Nodes.Table (N + 3).Flag9 := Val;
5543 procedure Set_Flag141 (N : Node_Id; Val : Boolean) is
5545 pragma Assert (Nkind (N) in N_Entity);
5546 Nodes.Table (N + 3).Flag10 := Val;
5549 procedure Set_Flag142 (N : Node_Id; Val : Boolean) is
5551 pragma Assert (Nkind (N) in N_Entity);
5552 Nodes.Table (N + 3).Flag11 := Val;
5555 procedure Set_Flag143 (N : Node_Id; Val : Boolean) is
5557 pragma Assert (Nkind (N) in N_Entity);
5558 Nodes.Table (N + 3).Flag12 := Val;
5561 procedure Set_Flag144 (N : Node_Id; Val : Boolean) is
5563 pragma Assert (Nkind (N) in N_Entity);
5564 Nodes.Table (N + 3).Flag13 := Val;
5567 procedure Set_Flag145 (N : Node_Id; Val : Boolean) is
5569 pragma Assert (Nkind (N) in N_Entity);
5570 Nodes.Table (N + 3).Flag14 := Val;
5573 procedure Set_Flag146 (N : Node_Id; Val : Boolean) is
5575 pragma Assert (Nkind (N) in N_Entity);
5576 Nodes.Table (N + 3).Flag15 := Val;
5579 procedure Set_Flag147 (N : Node_Id; Val : Boolean) is
5581 pragma Assert (Nkind (N) in N_Entity);
5582 Nodes.Table (N + 3).Flag16 := Val;
5585 procedure Set_Flag148 (N : Node_Id; Val : Boolean) is
5587 pragma Assert (Nkind (N) in N_Entity);
5588 Nodes.Table (N + 3).Flag17 := Val;
5591 procedure Set_Flag149 (N : Node_Id; Val : Boolean) is
5593 pragma Assert (Nkind (N) in N_Entity);
5594 Nodes.Table (N + 3).Flag18 := Val;
5597 procedure Set_Flag150 (N : Node_Id; Val : Boolean) is
5599 pragma Assert (Nkind (N) in N_Entity);
5600 Nodes.Table (N + 3).Pflag1 := Val;
5603 procedure Set_Flag151 (N : Node_Id; Val : Boolean) is
5605 pragma Assert (Nkind (N) in N_Entity);
5606 Nodes.Table (N + 3).Pflag2 := Val;
5609 procedure Set_Flag152 (N : Node_Id; Val : Boolean) is
5611 pragma Assert (Nkind (N) in N_Entity);
5614 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag152
:= Val
;
5617 procedure Set_Flag153
(N
: Node_Id
; Val
: Boolean) is
5619 pragma Assert
(Nkind
(N
) in N_Entity
);
5622 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag153 := Val;
5625 procedure Set_Flag154 (N : Node_Id; Val : Boolean) is
5627 pragma Assert (Nkind (N) in N_Entity);
5630 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag154
:= Val
;
5633 procedure Set_Flag155
(N
: Node_Id
; Val
: Boolean) is
5635 pragma Assert
(Nkind
(N
) in N_Entity
);
5638 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag155 := Val;
5641 procedure Set_Flag156 (N : Node_Id; Val : Boolean) is
5643 pragma Assert (Nkind (N) in N_Entity);
5646 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag156
:= Val
;
5649 procedure Set_Flag157
(N
: Node_Id
; Val
: Boolean) is
5651 pragma Assert
(Nkind
(N
) in N_Entity
);
5654 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag157 := Val;
5657 procedure Set_Flag158 (N : Node_Id; Val : Boolean) is
5659 pragma Assert (Nkind (N) in N_Entity);
5662 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag158
:= Val
;
5665 procedure Set_Flag159
(N
: Node_Id
; Val
: Boolean) is
5667 pragma Assert
(Nkind
(N
) in N_Entity
);
5670 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag159 := Val;
5673 procedure Set_Flag160 (N : Node_Id; Val : Boolean) is
5675 pragma Assert (Nkind (N) in N_Entity);
5678 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag160
:= Val
;
5681 procedure Set_Flag161
(N
: Node_Id
; Val
: Boolean) is
5683 pragma Assert
(Nkind
(N
) in N_Entity
);
5686 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag161 := Val;
5689 procedure Set_Flag162 (N : Node_Id; Val : Boolean) is
5691 pragma Assert (Nkind (N) in N_Entity);
5694 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag162
:= Val
;
5697 procedure Set_Flag163
(N
: Node_Id
; Val
: Boolean) is
5699 pragma Assert
(Nkind
(N
) in N_Entity
);
5702 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag163 := Val;
5705 procedure Set_Flag164 (N : Node_Id; Val : Boolean) is
5707 pragma Assert (Nkind (N) in N_Entity);
5710 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag164
:= Val
;
5713 procedure Set_Flag165
(N
: Node_Id
; Val
: Boolean) is
5715 pragma Assert
(Nkind
(N
) in N_Entity
);
5718 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag165 := Val;
5721 procedure Set_Flag166 (N : Node_Id; Val : Boolean) is
5723 pragma Assert (Nkind (N) in N_Entity);
5726 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag166
:= Val
;
5729 procedure Set_Flag167
(N
: Node_Id
; Val
: Boolean) is
5731 pragma Assert
(Nkind
(N
) in N_Entity
);
5734 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag167 := Val;
5737 procedure Set_Flag168 (N : Node_Id; Val : Boolean) is
5739 pragma Assert (Nkind (N) in N_Entity);
5742 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag168
:= Val
;
5745 procedure Set_Flag169
(N
: Node_Id
; Val
: Boolean) is
5747 pragma Assert
(Nkind
(N
) in N_Entity
);
5750 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag169 := Val;
5753 procedure Set_Flag170 (N : Node_Id; Val : Boolean) is
5755 pragma Assert (Nkind (N) in N_Entity);
5758 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag170
:= Val
;
5761 procedure Set_Flag171
(N
: Node_Id
; Val
: Boolean) is
5763 pragma Assert
(Nkind
(N
) in N_Entity
);
5766 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag171 := Val;
5769 procedure Set_Flag172 (N : Node_Id; Val : Boolean) is
5771 pragma Assert (Nkind (N) in N_Entity);
5774 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag172
:= Val
;
5777 procedure Set_Flag173
(N
: Node_Id
; Val
: Boolean) is
5779 pragma Assert
(Nkind
(N
) in N_Entity
);
5782 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag173 := Val;
5785 procedure Set_Flag174 (N : Node_Id; Val : Boolean) is
5787 pragma Assert (Nkind (N) in N_Entity);
5790 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag174
:= Val
;
5793 procedure Set_Flag175
(N
: Node_Id
; Val
: Boolean) is
5795 pragma Assert
(Nkind
(N
) in N_Entity
);
5798 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag175 := Val;
5801 procedure Set_Flag176 (N : Node_Id; Val : Boolean) is
5803 pragma Assert (Nkind (N) in N_Entity);
5806 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag176
:= Val
;
5809 procedure Set_Flag177
(N
: Node_Id
; Val
: Boolean) is
5811 pragma Assert
(Nkind
(N
) in N_Entity
);
5814 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag177 := Val;
5817 procedure Set_Flag178 (N : Node_Id; Val : Boolean) is
5819 pragma Assert (Nkind (N) in N_Entity);
5822 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag178
:= Val
;
5825 procedure Set_Flag179
(N
: Node_Id
; Val
: Boolean) is
5827 pragma Assert
(Nkind
(N
) in N_Entity
);
5830 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag179 := Val;
5833 procedure Set_Flag180 (N : Node_Id; Val : Boolean) is
5835 pragma Assert (Nkind (N) in N_Entity);
5838 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag180
:= Val
;
5841 procedure Set_Flag181
(N
: Node_Id
; Val
: Boolean) is
5843 pragma Assert
(Nkind
(N
) in N_Entity
);
5846 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag181 := Val;
5849 procedure Set_Flag182 (N : Node_Id; Val : Boolean) is
5851 pragma Assert (Nkind (N) in N_Entity);
5854 (Nodes
.Table
(N
+ 3).Field11
'Unrestricted_Access)).Flag182
:= Val
;
5857 procedure Set_Flag183
(N
: Node_Id
; Val
: Boolean) is
5859 pragma Assert
(Nkind
(N
) in N_Entity
);
5862 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag183 := Val;
5865 procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id) is
5867 pragma Assert (N in Nodes.First .. Nodes.Last);
5868 if Val > Error then Set_Parent (Val, N); end if;
5870 end Set_Node1_With_Parent;
5872 procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id) is
5874 pragma Assert (N in Nodes.First .. Nodes.Last);
5875 if Val > Error then Set_Parent (Val, N); end if;
5877 end Set_Node2_With_Parent;
5879 procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id) is
5881 pragma Assert (N in Nodes.First .. Nodes.Last);
5882 if Val > Error then Set_Parent (Val, N); end if;
5884 end Set_Node3_With_Parent;
5886 procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id) is
5888 pragma Assert (N in Nodes.First .. Nodes.Last);
5889 if Val > Error then Set_Parent (Val, N); end if;
5891 end Set_Node4_With_Parent;
5893 procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id) is
5895 pragma Assert (N in Nodes.First .. Nodes.Last);
5896 if Val > Error then Set_Parent (Val, N); end if;
5898 end Set_Node5_With_Parent;
5900 procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id) is
5902 pragma Assert (N in Nodes.First .. Nodes.Last);
5903 if Val /= No_List and then Val /= Error_List then
5904 Set_Parent (Val, N);
5907 end Set_List1_With_Parent;
5909 procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id) is
5911 pragma Assert (N in Nodes.First .. Nodes.Last);
5912 if Val /= No_List and then Val /= Error_List then
5913 Set_Parent (Val, N);
5916 end Set_List2_With_Parent;
5918 procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id) is
5920 pragma Assert (N in Nodes.First .. Nodes.Last);
5921 if Val /= No_List and then Val /= Error_List then
5922 Set_Parent (Val, N);
5925 end Set_List3_With_Parent;
5927 procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id) is
5929 pragma Assert (N in Nodes.First .. Nodes.Last);
5930 if Val /= No_List and then Val /= Error_List then
5931 Set_Parent (Val, N);
5934 end Set_List4_With_Parent;
5936 procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id) is
5938 pragma Assert (N in Nodes.First .. Nodes.Last);
5939 if Val /= No_List and then Val /= Error_List then
5940 Set_Parent (Val, N);
5943 end Set_List5_With_Parent;
5945 end Unchecked_Access;