1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
11 -- Copyright (C) 1992-2001, Free Software Foundation, Inc. --
13 -- GNAT is free software; you can redistribute it and/or modify it under --
14 -- terms of the GNU General Public License as published by the Free Soft- --
15 -- ware Foundation; either version 2, or (at your option) any later ver- --
16 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
17 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
18 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
19 -- for more details. You should have received a copy of the GNU General --
20 -- Public License distributed with GNAT; see file COPYING. If not, write --
21 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
22 -- MA 02111-1307, USA. --
24 -- As a special exception, if other files instantiate generics from this --
25 -- unit, or you link this unit with other files to produce an executable, --
26 -- this unit does not by itself cause the resulting executable to be --
27 -- covered by the GNU General Public License. This exception does not --
28 -- however invalidate any other reasons why the executable file might be --
29 -- covered by the GNU Public License. --
31 -- GNAT was originally developed by the GNAT team at New York University. --
32 -- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). --
34 ------------------------------------------------------------------------------
36 pragma Style_Checks (All_Checks);
37 -- Turn off subprogram ordering check for this package
39 -- WARNING: There is a C version of this package. Any changes to this source
40 -- file must be properly reflected in the C header a-atree.h (for inlined
41 -- bodies) and the C file a-atree.c (for remaining non-inlined bodies).
43 with Debug; use Debug;
44 with Nlists; use Nlists;
45 with Elists; use Elists;
46 with Output; use Output;
47 with Sinput; use Sinput;
48 with Tree_IO; use Tree_IO;
50 with GNAT.HTable; use GNAT.HTable;
55 -- Count allocated nodes for Num_Nodes function
58 -- We are allowed to see these from within our own body!
60 use Atree_Private_Part;
61 -- We are also allowed to see our private data structures!
63 function E_To_N is new Unchecked_Conversion (Entity_Kind, Node_Kind);
64 function N_To_E is new Unchecked_Conversion (Node_Kind, Entity_Kind);
65 -- Functions used to store Entity_Kind value in Nkind field
67 -- The following declarations are used to store flags 65-72 in the
68 -- Nkind field of the third component of an extended (entity) node.
70 type Flag_Byte is record
81 pragma Pack (Flag_Byte);
82 for Flag_Byte'Size use 8;
84 type Flag_Byte_Ptr is access all Flag_Byte;
85 type Node_Kind_Ptr is access all Node_Kind;
87 function To_Flag_Byte is new
88 Unchecked_Conversion (Node_Kind, Flag_Byte);
90 function To_Flag_Byte_Ptr is new
91 Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte_Ptr);
93 -- The following declarations are used to store flags 73-96 in the
94 -- Field12 field of the third component of an extended (entity) node.
96 type Flag_Word is record
124 Convention : Convention_Id;
127 pragma Pack (Flag_Word);
128 for Flag_Word'Size use 32;
129 for Flag_Word'Alignment use 4;
131 type Flag_Word_Ptr is access all Flag_Word;
132 type Union_Id_Ptr is access all Union_Id;
134 function To_Flag_Word is new
135 Unchecked_Conversion (Union_Id, Flag_Word);
137 function To_Flag_Word_Ptr is new
138 Unchecked_Conversion (Union_Id_Ptr, Flag_Word_Ptr);
140 -- The following declarations are used to store flags 97-128 in the
141 -- Field12 field of the fourth component of an extended (entity) node.
143 type Flag_Word2 is record
181 pragma Pack (Flag_Word2);
182 for Flag_Word2'Size use 32;
183 for Flag_Word2'Alignment use 4;
185 type Flag_Word2_Ptr is access all Flag_Word2;
187 function To_Flag_Word2 is new
188 Unchecked_Conversion (Union_Id, Flag_Word2);
190 function To_Flag_Word2_Ptr is new
191 Unchecked_Conversion (Union_Id_Ptr, Flag_Word2_Ptr);
193 -- The following declarations are used to store flags 97-120 in the
194 -- Field12 field of the fourth component of an extended (entity) node.
196 type Flag_Word3 is record
234 pragma Pack (Flag_Word3);
235 for Flag_Word3'Size use 32;
236 for Flag_Word3'Alignment use 4;
238 type Flag_Word3_Ptr is access all Flag_Word3;
240 function To_Flag_Word3 is new
241 Unchecked_Conversion (Union_Id, Flag_Word3);
243 function To_Flag_Word3_Ptr is new
244 Unchecked_Conversion (Union_Id_Ptr, Flag_Word3_Ptr);
246 -- Default value used to initialize default nodes. Note that some of the
247 -- fields get overwritten, and in particular, Nkind always gets reset.
249 Default_Node : Node_Record := (
250 Is_Extension => False,
255 Rewrite_Ins => False,
257 Comes_From_Source => False, -- modified by Set_Comes_From_Source_Default
258 Error_Posted => False,
277 Nkind => N_Unused_At_Start,
280 Link => Empty_List_Or_Node,
281 Field1 => Empty_List_Or_Node,
282 Field2 => Empty_List_Or_Node,
283 Field3 => Empty_List_Or_Node,
284 Field4 => Empty_List_Or_Node,
285 Field5 => Empty_List_Or_Node);
287 -- Default value used to initialize node extensions (i.e. the second
288 -- and third and fourth components of an extended node). Note we are
289 -- cheating a bit here when it comes to Node12, which really holds
290 -- flags an (for the third component), the convention. But it works
291 -- because Empty, False, Convention_Ada, all happen to be all zero bits.
293 Default_Node_Extension : constant Node_Record := (
294 Is_Extension => True,
299 Rewrite_Ins => False,
301 Comes_From_Source => False,
302 Error_Posted => False,
321 Nkind => E_To_N (E_Void),
323 Field6 => Empty_List_Or_Node,
324 Field7 => Empty_List_Or_Node,
325 Field8 => Empty_List_Or_Node,
326 Field9 => Empty_List_Or_Node,
327 Field10 => Empty_List_Or_Node,
328 Field11 => Empty_List_Or_Node,
329 Field12 => Empty_List_Or_Node);
331 --------------------------------------------------
332 -- Implementation of Tree Substitution Routines --
333 --------------------------------------------------
335 -- A separate table keeps track of the mapping between rewritten nodes
336 -- and their corresponding original tree nodes. Rewrite makes an entry
337 -- in this table for use by Original_Node. By default, if no call is
338 -- Rewrite, the entry in this table points to the original unwritten node.
340 -- Note: eventually, this should be a field in the Node directly, but
341 -- for now we do not want to disturb the efficiency of a power of 2
344 package Orig_Nodes is new Table.Table (
345 Table_Component_Type => Node_Id,
346 Table_Index_Type => Node_Id,
347 Table_Low_Bound => First_Node_Id,
348 Table_Initial => Alloc.Orig_Nodes_Initial,
349 Table_Increment => Alloc.Orig_Nodes_Increment,
350 Table_Name => "Orig_Nodes");
352 -----------------------
353 -- Local Subprograms --
354 -----------------------
356 procedure Fix_Parent (Field : Union_Id; Old_Node, New_Node : Node_Id);
357 -- This subprogram is used to fixup parent pointers that are rendered
358 -- incorrect because of a node copy. Field is checked to see if it
359 -- points to a node, list, or element list that has a parent that
360 -- points to Old_Node. If so, the parent is reset to point to New_Node.
366 function Analyzed (N : Node_Id) return Boolean is
368 pragma Assert (N in Nodes.First .. Nodes.Last);
369 return Nodes.Table (N).Analyzed;
376 procedure Change_Node (N : Node_Id; New_Node_Kind : Node_Kind) is
377 Save_Sloc : constant Source_Ptr := Sloc (N);
378 Save_In_List : constant Boolean := Nodes.Table (N).In_List;
379 Save_Link : constant Union_Id := Nodes.Table (N).Link;
380 Save_CFS : constant Boolean := Nodes.Table (N).Comes_From_Source;
381 Save_Posted : constant Boolean := Nodes.Table (N).Error_Posted;
382 Par_Count : Paren_Count_Type := 0;
385 if Nkind (N) in N_Subexpr then
386 Par_Count := Paren_Count (N);
389 Nodes.Table (N) := Default_Node;
390 Nodes.Table (N).Sloc := Save_Sloc;
391 Nodes.Table (N).In_List := Save_In_List;
392 Nodes.Table (N).Link := Save_Link;
393 Nodes.Table (N).Comes_From_Source := Save_CFS;
394 Nodes.Table (N).Nkind := New_Node_Kind;
395 Nodes.Table (N).Error_Posted := Save_Posted;
397 if New_Node_Kind in N_Subexpr then
398 Set_Paren_Count (N, Par_Count);
402 -----------------------
403 -- Comes_From_Source --
404 -----------------------
406 function Comes_From_Source (N : Node_Id) return Boolean is
408 pragma Assert (N in Nodes.First .. Nodes.Last);
409 return Nodes.Table (N).Comes_From_Source;
410 end Comes_From_Source;
416 function Convention (E : Entity_Id) return Convention_Id is
418 pragma Assert (Nkind (E) in N_Entity);
419 return To_Flag_Word (Nodes.Table (E + 2).Field12).Convention;
426 procedure Copy_Node (Source : Node_Id; Destination : Node_Id) is
427 Save_In_List : constant Boolean := Nodes.Table (Destination).In_List;
428 Save_Link : constant Union_Id := Nodes.Table (Destination).Link;
431 Nodes.Table (Destination) := Nodes.Table (Source);
432 Nodes.Table (Destination).In_List := Save_In_List;
433 Nodes.Table (Destination).Link := Save_Link;
435 if Has_Extension (Source) then
436 pragma Assert (Has_Extension (Destination));
437 Nodes.Table (Destination + 1) := Nodes.Table (Source + 1);
438 Nodes.Table (Destination + 2) := Nodes.Table (Source + 2);
439 Nodes.Table (Destination + 3) := Nodes.Table (Source + 3);
442 pragma Assert (not Has_Extension (Source));
447 ------------------------
448 -- Copy_Separate_Tree --
449 ------------------------
451 function Copy_Separate_Tree (Source : Node_Id) return Node_Id is
454 function Copy_Entity (E : Entity_Id) return Entity_Id;
455 -- Copy Entity, copying only the Ekind and Chars fields
457 function Copy_List (List : List_Id) return List_Id;
460 function Possible_Copy (Field : Union_Id) return Union_Id;
461 -- Given a field, returns a copy of the node or list if its parent
462 -- is the current source node, and otherwise returns the input
468 function Copy_Entity (E : Entity_Id) return Entity_Id is
472 case N_Entity (Nkind (E)) is
473 when N_Defining_Identifier =>
474 New_Ent := New_Entity (N_Defining_Identifier, Sloc (E));
476 when N_Defining_Character_Literal =>
477 New_Ent := New_Entity (N_Defining_Character_Literal, Sloc (E));
479 when N_Defining_Operator_Symbol =>
480 New_Ent := New_Entity (N_Defining_Operator_Symbol, Sloc (E));
483 Set_Chars (New_Ent, Chars (E));
491 function Copy_List (List : List_Id) return List_Id is
496 if List = No_List then
503 while Present (E) loop
505 if Has_Extension (E) then
506 Append (Copy_Entity (E), NL);
508 Append (Copy_Separate_Tree (E), NL);
523 function Possible_Copy (Field : Union_Id) return Union_Id is
527 if Field in Node_Range then
529 New_N := Union_Id (Copy_Separate_Tree (Node_Id (Field)));
531 if Parent (Node_Id (Field)) = Source then
532 Set_Parent (Node_Id (New_N), New_Id);
537 elsif Field in List_Range then
538 New_N := Union_Id (Copy_List (List_Id (Field)));
540 if Parent (List_Id (Field)) = Source then
541 Set_Parent (List_Id (New_N), New_Id);
551 -- Start of processing for Copy_Separate_Tree
554 if Source <= Empty_Or_Error then
557 elsif Has_Extension (Source) then
558 return Copy_Entity (Source);
561 Nodes.Increment_Last;
562 New_Id := Nodes.Last;
563 Nodes.Table (New_Id) := Nodes.Table (Source);
564 Nodes.Table (New_Id).Link := Empty_List_Or_Node;
565 Nodes.Table (New_Id).In_List := False;
566 Nodes.Table (New_Id).Rewrite_Ins := False;
567 Node_Count := Node_Count + 1;
569 Orig_Nodes.Increment_Last;
570 Allocate_List_Tables (Nodes.Last);
571 Orig_Nodes.Table (New_Id) := New_Id;
573 -- Recursively copy descendents
575 Set_Field1 (New_Id, Possible_Copy (Field1 (New_Id)));
576 Set_Field2 (New_Id, Possible_Copy (Field2 (New_Id)));
577 Set_Field3 (New_Id, Possible_Copy (Field3 (New_Id)));
578 Set_Field4 (New_Id, Possible_Copy (Field4 (New_Id)));
579 Set_Field5 (New_Id, Possible_Copy (Field5 (New_Id)));
581 -- Set Entity field to Empty
582 -- Why is this done??? and why is it always right to do it???
584 if Nkind (New_Id) in N_Has_Entity
585 or else Nkind (New_Id) = N_Freeze_Entity
587 Set_Entity (New_Id, Empty);
590 -- All done, return copied node
594 end Copy_Separate_Tree;
600 procedure Delete_Node (Node : Node_Id) is
602 pragma Assert (not Nodes.Table (Node).In_List);
605 Write_Str ("Delete node ");
606 Write_Int (Int (Node));
610 Nodes.Table (Node) := Default_Node;
611 Nodes.Table (Node).Nkind := N_Unused_At_Start;
612 Node_Count := Node_Count - 1;
614 -- Note: for now, we are not bothering to reuse deleted nodes
622 procedure Delete_Tree (Node : Node_Id) is
624 procedure Delete_Field (F : Union_Id);
625 -- Delete item pointed to by field F if it is a syntactic element
627 procedure Delete_List (L : List_Id);
628 -- Delete all elements on the given list
630 procedure Delete_Field (F : Union_Id) is
632 if F = Union_Id (Empty) then
635 elsif F in Node_Range
636 and then Parent (Node_Id (F)) = Node
638 Delete_Tree (Node_Id (F));
640 elsif F in List_Range
641 and then Parent (List_Id (F)) = Node
643 Delete_List (List_Id (F));
645 -- No need to test Elist case, there are no syntactic Elists
652 procedure Delete_List (L : List_Id) is
654 while Is_Non_Empty_List (L) loop
655 Delete_Tree (Remove_Head (L));
659 -- Start of processing for Delete_Tree
662 -- Delete descendents
664 Delete_Field (Field1 (Node));
665 Delete_Field (Field2 (Node));
666 Delete_Field (Field3 (Node));
667 Delete_Field (Field4 (Node));
668 Delete_Field (Field5 (Node));
676 function Ekind (E : Entity_Id) return Entity_Kind is
678 pragma Assert (Nkind (E) in N_Entity);
679 return N_To_E (Nodes.Table (E + 1).Nkind);
686 function Error_Posted (N : Node_Id) return Boolean is
688 pragma Assert (N in Nodes.First .. Nodes.Last);
689 return Nodes.Table (N).Error_Posted;
692 -----------------------
693 -- Exchange_Entities --
694 -----------------------
696 procedure Exchange_Entities (E1 : Entity_Id; E2 : Entity_Id) is
697 Temp_Ent : Node_Record;
700 pragma Assert (Has_Extension (E1)
701 and then Has_Extension (E2)
702 and then not Nodes.Table (E1).In_List
703 and then not Nodes.Table (E2).In_List);
705 -- Exchange the contents of the two entities
707 Temp_Ent := Nodes.Table (E1);
708 Nodes.Table (E1) := Nodes.Table (E2);
709 Nodes.Table (E2) := Temp_Ent;
710 Temp_Ent := Nodes.Table (E1 + 1);
711 Nodes.Table (E1 + 1) := Nodes.Table (E2 + 1);
712 Nodes.Table (E2 + 1) := Temp_Ent;
713 Temp_Ent := Nodes.Table (E1 + 2);
714 Nodes.Table (E1 + 2) := Nodes.Table (E2 + 2);
715 Nodes.Table (E2 + 2) := Temp_Ent;
716 Temp_Ent := Nodes.Table (E1 + 3);
717 Nodes.Table (E1 + 3) := Nodes.Table (E2 + 3);
718 Nodes.Table (E2 + 3) := Temp_Ent;
720 -- That exchange exchanged the parent pointers as well, which is what
721 -- we want, but we need to patch up the defining identifier pointers
722 -- in the parent nodes (the child pointers) to match this switch
723 -- unless for Implicit types entities which have no parent, in which
724 -- case we don't do anything otherwise we won't be able to revert back
725 -- to the original situation.
727 -- Shouldn't this use Is_Itype instead of the Parent test
729 if Present (Parent (E1)) and then Present (Parent (E2)) then
730 Set_Defining_Identifier (Parent (E1), E1);
731 Set_Defining_Identifier (Parent (E2), E2);
733 end Exchange_Entities;
739 function Extend_Node (Node : Node_Id) return Entity_Id is
742 procedure Debug_Extend_Node;
743 -- Debug routine for debug flag N
745 procedure Debug_Extend_Node is
748 Write_Str ("Extend node ");
749 Write_Int (Int (Node));
751 if Result = Node then
752 Write_Str (" in place");
754 Write_Str (" copied to ");
755 Write_Int (Int (Result));
760 end Debug_Extend_Node;
762 pragma Inline (Debug_Extend_Node);
765 if Node /= Nodes.Last then
766 Nodes.Increment_Last;
767 Nodes.Table (Nodes.Last) := Nodes.Table (Node);
768 Result := Nodes.Last;
770 Orig_Nodes.Increment_Last;
771 Orig_Nodes.Table (Nodes.Last) := Nodes.Last;
777 Nodes.Increment_Last;
778 Nodes.Table (Nodes.Last) := Default_Node_Extension;
779 Nodes.Increment_Last;
780 Nodes.Table (Nodes.Last) := Default_Node_Extension;
781 Nodes.Increment_Last;
782 Nodes.Table (Nodes.Last) := Default_Node_Extension;
784 Orig_Nodes.Set_Last (Nodes.Last);
785 Allocate_List_Tables (Nodes.Last);
787 pragma Debug (Debug_Extend_Node);
795 procedure Fix_Parent (Field : Union_Id; Old_Node, New_Node : Node_Id) is
797 -- Fix parent of node that is referenced by Field. Note that we must
798 -- exclude the case where the node is a member of a list, because in
799 -- this case the parent is the parent of the list.
801 if Field in Node_Range
802 and then Present (Node_Id (Field))
803 and then not Nodes.Table (Node_Id (Field)).In_List
804 and then Parent (Node_Id (Field)) = Old_Node
806 Set_Parent (Node_Id (Field), New_Node);
808 -- Fix parent of list that is referenced by Field
810 elsif Field in List_Range
811 and then Present (List_Id (Field))
812 and then Parent (List_Id (Field)) = Old_Node
814 Set_Parent (List_Id (Field), New_Node);
819 -----------------------------------
820 -- Get_Comes_From_Source_Default --
821 -----------------------------------
823 function Get_Comes_From_Source_Default return Boolean is
825 return Default_Node.Comes_From_Source;
826 end Get_Comes_From_Source_Default;
832 function Has_Extension (N : Node_Id) return Boolean is
834 return N < Nodes.Last and then Nodes.Table (N + 1).Is_Extension;
841 procedure Initialize is
845 -- Allocate Empty node
847 Dummy := New_Node (N_Empty, No_Location);
848 Set_Name1 (Empty, No_Name);
850 -- Allocate Error node, and set Error_Posted, since we certainly
851 -- only generate an Error node if we do post some kind of error!
853 Dummy := New_Node (N_Error, No_Location);
854 Set_Name1 (Error, Error_Name);
855 Set_Error_Posted (Error, True);
858 --------------------------
859 -- Is_Rewrite_Insertion --
860 --------------------------
862 function Is_Rewrite_Insertion (Node : Node_Id) return Boolean is
864 return Nodes.Table (Node).Rewrite_Ins;
865 end Is_Rewrite_Insertion;
867 -----------------------------
868 -- Is_Rewrite_Substitution --
869 -----------------------------
871 function Is_Rewrite_Substitution (Node : Node_Id) return Boolean is
873 return Orig_Nodes.Table (Node) /= Node;
874 end Is_Rewrite_Substitution;
880 function Last_Node_Id return Node_Id is
891 Nodes.Locked := True;
892 Orig_Nodes.Locked := True;
897 ----------------------------
898 -- Mark_Rewrite_Insertion --
899 ----------------------------
901 procedure Mark_Rewrite_Insertion (New_Node : Node_Id) is
903 Nodes.Table (New_Node).Rewrite_Ins := True;
904 end Mark_Rewrite_Insertion;
910 function New_Copy (Source : Node_Id) return Node_Id is
914 if Source <= Empty_Or_Error then
918 Nodes.Increment_Last;
919 New_Id := Nodes.Last;
920 Nodes.Table (New_Id) := Nodes.Table (Source);
921 Nodes.Table (New_Id).Link := Empty_List_Or_Node;
922 Nodes.Table (New_Id).In_List := False;
923 Nodes.Table (New_Id).Rewrite_Ins := False;
925 Orig_Nodes.Increment_Last;
926 Orig_Nodes.Table (New_Id) := New_Id;
928 if Has_Extension (Source) then
929 Nodes.Increment_Last;
930 Nodes.Table (New_Id + 1) := Nodes.Table (Source + 1);
931 Nodes.Increment_Last;
932 Nodes.Table (New_Id + 2) := Nodes.Table (Source + 2);
933 Nodes.Increment_Last;
934 Nodes.Table (New_Id + 3) := Nodes.Table (Source + 3);
936 Orig_Nodes.Set_Last (Nodes.Last);
939 Allocate_List_Tables (Nodes.Last);
940 Node_Count := Node_Count + 1;
949 -- Our approach here requires a two pass traversal of the tree. The
950 -- first pass visits all nodes that eventually will be copied looking
951 -- for defining Itypes. If any defining Itypes are found, then they are
952 -- copied, and an entry is added to the replacement map. In the second
953 -- phase, the tree is copied, using the replacement map to replace any
954 -- Itype references within the copied tree.
956 -- The following hash tables are used if the Map supplied has more
957 -- than hash threshhold entries to speed up access to the map. If
958 -- there are fewer entries, then the map is searched sequentially
959 -- (because setting up a hash table for only a few entries takes
960 -- more time than it saves.
962 -- Global variables are safe for this purpose, since there is no case
963 -- of a recursive call from the processing inside New_Copy_Tree.
965 NCT_Hash_Threshhold : constant := 20;
966 -- If there are more than this number of pairs of entries in the
967 -- map, then Hash_Tables_Used will be set, and the hash tables will
968 -- be initialized and used for the searches.
970 NCT_Hash_Tables_Used : Boolean := False;
971 -- Set to True if hash tables are in use
973 NCT_Table_Entries : Nat;
974 -- Count entries in table to see if threshhold is reached
976 NCT_Hash_Table_Setup : Boolean := False;
977 -- Set to True if hash table contains data. We set this True if we
978 -- setup the hash table with data, and leave it set permanently
979 -- from then on, this is a signal that second and subsequent users
980 -- of the hash table must clear the old entries before reuse.
982 subtype NCT_Header_Num is Int range 0 .. 511;
983 -- Defines range of headers in hash tables (512 headers)
985 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num;
986 -- Hash function used for hash operations
988 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num is
990 return Nat (E) mod (NCT_Header_Num'Last + 1);
993 -- The hash table NCT_Assoc associates old entities in the table
994 -- with their corresponding new entities (i.e. the pairs of entries
995 -- presented in the original Map argument are Key-Element pairs).
997 package NCT_Assoc is new Simple_HTable (
998 Header_Num => NCT_Header_Num,
999 Element => Entity_Id,
1000 No_Element => Empty,
1002 Hash => New_Copy_Hash,
1003 Equal => Types."=");
1005 -- The hash table NCT_Itype_Assoc contains entries only for those
1006 -- old nodes which have a non-empty Associated_Node_For_Itype set.
1007 -- The key is the associated node, and the element is the new node
1008 -- itself (NOT the associated node for the new node).
1010 package NCT_Itype_Assoc is new Simple_HTable (
1011 Header_Num => NCT_Header_Num,
1012 Element => Entity_Id,
1013 No_Element => Empty,
1015 Hash => New_Copy_Hash,
1016 Equal => Types."=");
1018 -- Start of New_Copy_Tree function
1020 function New_Copy_Tree
1022 Map : Elist_Id := No_Elist;
1023 New_Sloc : Source_Ptr := No_Location;
1024 New_Scope : Entity_Id := Empty)
1027 Actual_Map : Elist_Id := Map;
1028 -- This is the actual map for the copy. It is initialized with the
1029 -- given elements, and then enlarged as required for Itypes that are
1030 -- copied during the first phase of the copy operation. The visit
1031 -- procedures add elements to this map as Itypes are encountered.
1032 -- The reason we cannot use Map directly, is that it may well be
1033 -- (and normally is) initialized to No_Elist, and if we have mapped
1034 -- entities, we have to reset it to point to a real Elist.
1036 function Assoc (N : Node_Or_Entity_Id) return Node_Id;
1037 -- Called during second phase to map entities into their corresponding
1038 -- copies using Actual_Map. If the argument is not an entity, or is not
1039 -- in Actual_Map, then it is returned unchanged.
1041 procedure Build_NCT_Hash_Tables;
1042 -- Builds hash tables (number of elements >= threshold value)
1044 function Copy_Elist_With_Replacement
1045 (Old_Elist : Elist_Id)
1047 -- Called during second phase to copy element list doing replacements.
1049 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id);
1050 -- Called during the second phase to process a copied Itype. The actual
1051 -- copy happened during the first phase (so that we could make the entry
1052 -- in the mapping), but we still have to deal with the descendents of
1053 -- the copied Itype and copy them where necessary.
1055 function Copy_List_With_Replacement (Old_List : List_Id) return List_Id;
1056 -- Called during second phase to copy list doing replacements.
1058 function Copy_Node_With_Replacement (Old_Node : Node_Id) return Node_Id;
1059 -- Called during second phase to copy node doing replacements
1061 procedure Visit_Elist (E : Elist_Id);
1062 -- Called during first phase to visit all elements of an Elist
1064 procedure Visit_Field (F : Union_Id; N : Node_Id);
1065 -- Visit a single field, recursing to call Visit_Node or Visit_List
1066 -- if the field is a syntactic descendent of the current node (i.e.
1067 -- its parent is Node N).
1069 procedure Visit_Itype (Old_Itype : Entity_Id);
1070 -- Called during first phase to visit subsidiary fields of a defining
1071 -- Itype, and also create a copy and make an entry in the replacement
1072 -- map for the new copy.
1074 procedure Visit_List (L : List_Id);
1075 -- Called during first phase to visit all elements of a List
1077 procedure Visit_Node (N : Node_Or_Entity_Id);
1078 -- Called during first phase to visit a node and all its subtrees
1084 function Assoc (N : Node_Or_Entity_Id) return Node_Id is
1089 if not Has_Extension (N) or else No (Actual_Map) then
1092 elsif NCT_Hash_Tables_Used then
1093 Ent := NCT_Assoc.Get (Entity_Id (N));
1095 if Present (Ent) then
1101 -- No hash table used, do serial search
1104 E := First_Elmt (Actual_Map);
1105 while Present (E) loop
1106 if Node (E) = N then
1107 return Node (Next_Elmt (E));
1109 E := Next_Elmt (Next_Elmt (E));
1117 ---------------------------
1118 -- Build_NCT_Hash_Tables --
1119 ---------------------------
1121 procedure Build_NCT_Hash_Tables is
1125 if NCT_Hash_Table_Setup then
1127 NCT_Itype_Assoc.Reset;
1130 Elmt := First_Elmt (Actual_Map);
1131 while Present (Elmt) loop
1134 NCT_Assoc.Set (Ent, Node (Elmt));
1137 if Is_Type (Ent) then
1139 Anode : constant Entity_Id :=
1140 Associated_Node_For_Itype (Ent);
1143 if Present (Anode) then
1144 NCT_Itype_Assoc.Set (Anode, Node (Elmt));
1150 NCT_Hash_Tables_Used := True;
1151 NCT_Hash_Table_Setup := True;
1152 end Build_NCT_Hash_Tables;
1154 ---------------------------------
1155 -- Copy_Elist_With_Replacement --
1156 ---------------------------------
1158 function Copy_Elist_With_Replacement
1159 (Old_Elist : Elist_Id)
1163 New_Elist : Elist_Id;
1166 if No (Old_Elist) then
1170 New_Elist := New_Elmt_List;
1171 M := First_Elmt (Old_Elist);
1173 while Present (M) loop
1174 Append_Elmt (Copy_Node_With_Replacement (Node (M)), New_Elist);
1180 end Copy_Elist_With_Replacement;
1182 ---------------------------------
1183 -- Copy_Itype_With_Replacement --
1184 ---------------------------------
1186 -- This routine exactly parallels its phase one analog Visit_Itype,
1187 -- and like that routine, knows far too many semantic details about
1188 -- the descendents of Itypes and whether they need copying or not.
1190 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id) is
1192 -- Translate Next_Entity, Scope and Etype fields, in case they
1193 -- reference entities that have been mapped into copies.
1195 Set_Next_Entity (New_Itype, Assoc (Next_Entity (New_Itype)));
1196 Set_Etype (New_Itype, Assoc (Etype (New_Itype)));
1198 if Present (New_Scope) then
1199 Set_Scope (New_Itype, New_Scope);
1201 Set_Scope (New_Itype, Assoc (Scope (New_Itype)));
1204 -- Copy referenced fields
1206 if Is_Discrete_Type (New_Itype) then
1207 Set_Scalar_Range (New_Itype,
1208 Copy_Node_With_Replacement (Scalar_Range (New_Itype)));
1210 elsif Has_Discriminants (Base_Type (New_Itype)) then
1211 Set_Discriminant_Constraint (New_Itype,
1212 Copy_Elist_With_Replacement
1213 (Discriminant_Constraint (New_Itype)));
1215 elsif Is_Array_Type (New_Itype) then
1216 if Present (First_Index (New_Itype)) then
1217 Set_First_Index (New_Itype,
1218 First (Copy_List_With_Replacement
1219 (List_Containing (First_Index (New_Itype)))));
1222 if Is_Packed (New_Itype) then
1223 Set_Packed_Array_Type (New_Itype,
1224 Copy_Node_With_Replacement
1225 (Packed_Array_Type (New_Itype)));
1228 end Copy_Itype_With_Replacement;
1230 --------------------------------
1231 -- Copy_List_With_Replacement --
1232 --------------------------------
1234 function Copy_List_With_Replacement
1235 (Old_List : List_Id)
1242 if Old_List = No_List then
1246 New_List := Empty_List;
1247 E := First (Old_List);
1248 while Present (E) loop
1249 Append (Copy_Node_With_Replacement (E), New_List);
1255 end Copy_List_With_Replacement;
1257 --------------------------------
1258 -- Copy_Node_With_Replacement --
1259 --------------------------------
1261 function Copy_Node_With_Replacement
1262 (Old_Node : Node_Id)
1267 function Copy_Field_With_Replacement
1270 -- Given Field, which is a field of Old_Node, return a copy of it
1271 -- if it is a syntactic field (i.e. its parent is Node), setting
1272 -- the parent of the copy to poit to New_Node. Otherwise returns
1273 -- the field (possibly mapped if it is an entity).
1275 ---------------------------------
1276 -- Copy_Field_With_Replacement --
1277 ---------------------------------
1279 function Copy_Field_With_Replacement
1284 if Field = Union_Id (Empty) then
1287 elsif Field in Node_Range then
1289 Old_N : constant Node_Id := Node_Id (Field);
1293 -- If syntactic field, as indicated by the parent pointer
1294 -- being set, then copy the referenced node recursively.
1296 if Parent (Old_N) = Old_Node then
1297 New_N := Copy_Node_With_Replacement (Old_N);
1299 if New_N /= Old_N then
1300 Set_Parent (New_N, New_Node);
1303 -- For semantic fields, update possible entity reference
1304 -- from the replacement map.
1307 New_N := Assoc (Old_N);
1310 return Union_Id (New_N);
1313 elsif Field in List_Range then
1315 Old_L : constant List_Id := List_Id (Field);
1319 -- If syntactic field, as indicated by the parent pointer,
1320 -- then recursively copy the entire referenced list.
1322 if Parent (Old_L) = Old_Node then
1323 New_L := Copy_List_With_Replacement (Old_L);
1324 Set_Parent (New_L, New_Node);
1326 -- For semantic list, just returned unchanged
1332 return Union_Id (New_L);
1335 -- Anything other than a list or a node is returned unchanged
1340 end Copy_Field_With_Replacement;
1342 -- Start of processing for Copy_Node_With_Replacement
1345 if Old_Node <= Empty_Or_Error then
1348 elsif Has_Extension (Old_Node) then
1349 return Assoc (Old_Node);
1352 Nodes.Increment_Last;
1353 New_Node := Nodes.Last;
1354 Nodes.Table (New_Node) := Nodes.Table (Old_Node);
1355 Nodes.Table (New_Node).Link := Empty_List_Or_Node;
1356 Nodes.Table (New_Node).In_List := False;
1357 Node_Count := Node_Count + 1;
1359 Orig_Nodes.Increment_Last;
1360 Allocate_List_Tables (Nodes.Last);
1362 Orig_Nodes.Table (Nodes.Last) := Nodes.Last;
1364 -- If the node we are copying is the associated node of a
1365 -- previously copied Itype, then adjust the associated node
1366 -- of the copy of that Itype accordingly.
1368 if Present (Actual_Map) then
1374 -- Case of hash table used
1376 if NCT_Hash_Tables_Used then
1377 Ent := NCT_Itype_Assoc.Get (Old_Node);
1379 if Present (Ent) then
1380 Set_Associated_Node_For_Itype (Ent, New_Node);
1383 -- Case of no hash table used
1386 E := First_Elmt (Actual_Map);
1387 while Present (E) loop
1388 if Old_Node = Associated_Node_For_Itype (Node (E)) then
1389 Set_Associated_Node_For_Itype
1390 (Node (Next_Elmt (E)), New_Node);
1393 E := Next_Elmt (Next_Elmt (E));
1399 -- Recursively copy descendents
1402 (New_Node, Copy_Field_With_Replacement (Field1 (New_Node)));
1404 (New_Node, Copy_Field_With_Replacement (Field2 (New_Node)));
1406 (New_Node, Copy_Field_With_Replacement (Field3 (New_Node)));
1408 (New_Node, Copy_Field_With_Replacement (Field4 (New_Node)));
1410 (New_Node, Copy_Field_With_Replacement (Field5 (New_Node)));
1412 -- If the original is marked as a rewrite insertion, then unmark
1413 -- the copy, since we inserted the original, not the copy.
1415 Nodes.Table (New_Node).Rewrite_Ins := False;
1417 -- Adjust Sloc of new node if necessary
1419 if New_Sloc /= No_Location then
1420 Set_Sloc (New_Node, New_Sloc);
1422 -- If we adjust the Sloc, then we are essentially making
1423 -- a completely new node, so the Comes_From_Source flag
1424 -- should be reset to the proper default value.
1426 Nodes.Table (New_Node).Comes_From_Source :=
1427 Default_Node.Comes_From_Source;
1430 -- Reset First_Real_Statement for Handled_Sequence_Of_Statements.
1431 -- The replacement mechanism applies to entities, and is not used
1432 -- here. Eventually we may need a more general graph-copying
1433 -- routine. For now, do a sequential search to find desired node.
1435 if Nkind (Old_Node) = N_Handled_Sequence_Of_Statements
1436 and then Present (First_Real_Statement (Old_Node))
1439 Old_F : constant Node_Id := First_Real_Statement (Old_Node);
1443 N1 := First (Statements (Old_Node));
1444 N2 := First (Statements (New_Node));
1446 while N1 /= Old_F loop
1451 Set_First_Real_Statement (New_Node, N2);
1456 -- All done, return copied node
1459 end Copy_Node_With_Replacement;
1465 procedure Visit_Elist (E : Elist_Id) is
1470 Elmt := First_Elmt (E);
1472 while Elmt /= No_Elmt loop
1473 Visit_Node (Node (Elmt));
1483 procedure Visit_Field (F : Union_Id; N : Node_Id) is
1485 if F = Union_Id (Empty) then
1488 elsif F in Node_Range then
1490 -- Copy node if it is syntactic, i.e. its parent pointer is
1491 -- set to point to the field that referenced it (certain
1492 -- Itypes will also meet this criterion, which is fine, since
1493 -- these are clearly Itypes that do need to be copied, since
1494 -- we are copying their parent.)
1496 if Parent (Node_Id (F)) = N then
1497 Visit_Node (Node_Id (F));
1500 -- Another case, if we are pointing to an Itype, then we want
1501 -- to copy it if its associated node is somewhere in the tree
1504 -- Note: the exclusion of self-referential copies is just an
1505 -- optimization, since the search of the already copied list
1506 -- would catch it, but it is a common case (Etype pointing
1507 -- to itself for an Itype that is a base type).
1509 elsif Has_Extension (Node_Id (F))
1510 and then Is_Itype (Entity_Id (F))
1511 and then Node_Id (F) /= N
1517 P := Associated_Node_For_Itype (Node_Id (F));
1518 while Present (P) loop
1520 Visit_Node (Node_Id (F));
1527 -- An Itype whose parent is not being copied definitely
1528 -- should NOT be copied, since it does not belong in any
1529 -- sense to the copied subtree.
1535 elsif F in List_Range
1536 and then Parent (List_Id (F)) = N
1538 Visit_List (List_Id (F));
1547 -- Note: we are relying on far too much semantic knowledge in this
1548 -- routine, it really should just do a blind replacement of all
1549 -- fields, or at least a more blind replacement. For example, we
1550 -- do not deal with corresponding record types, and that works
1551 -- because we have no Itypes of task types, but nowhere is there
1552 -- a guarantee that this will always be the case. ???
1554 procedure Visit_Itype (Old_Itype : Entity_Id) is
1555 New_Itype : Entity_Id;
1560 -- Itypes that describe the designated type of access to subprograms
1561 -- have the structure of subprogram declarations, with signatures,
1562 -- etc. Either we duplicate the signatures completely, or choose to
1563 -- share such itypes, which is fine because their elaboration will
1564 -- have no side effects. In any case, this is additional semantic
1565 -- information that seems awkward to have in atree.
1567 if Ekind (Old_Itype) = E_Subprogram_Type then
1571 New_Itype := New_Copy (Old_Itype);
1573 -- If our associated node is an entity that has already been copied,
1574 -- then set the associated node of the copy to point to the right
1575 -- copy. If we have copied an Itype that is itself the associated
1576 -- node of some previously copied Itype, then we set the right
1577 -- pointer in the other direction.
1579 if Present (Actual_Map) then
1581 -- Case of hash tables used
1583 if NCT_Hash_Tables_Used then
1585 Ent := NCT_Assoc.Get (Associated_Node_For_Itype (Old_Itype));
1586 if Present (Ent) then
1587 Set_Associated_Node_For_Itype (New_Itype, Ent);
1590 Ent := NCT_Itype_Assoc.Get (Old_Itype);
1591 if Present (Ent) then
1592 Set_Associated_Node_For_Itype (Ent, New_Itype);
1595 -- Csae of hash tables not used
1598 E := First_Elmt (Actual_Map);
1599 while Present (E) loop
1600 if Associated_Node_For_Itype (Old_Itype) = Node (E) then
1601 Set_Associated_Node_For_Itype
1602 (New_Itype, Node (Next_Elmt (E)));
1605 if Old_Itype = Associated_Node_For_Itype (Node (E)) then
1606 Set_Associated_Node_For_Itype
1607 (Node (Next_Elmt (E)), New_Itype);
1610 E := Next_Elmt (Next_Elmt (E));
1615 if Present (Freeze_Node (New_Itype)) then
1616 Set_Is_Frozen (New_Itype, False);
1617 Set_Freeze_Node (New_Itype, Empty);
1620 -- Add new association to map
1622 if No (Actual_Map) then
1623 Actual_Map := New_Elmt_List;
1626 Append_Elmt (Old_Itype, Actual_Map);
1627 Append_Elmt (New_Itype, Actual_Map);
1629 if NCT_Hash_Tables_Used then
1630 NCT_Assoc.Set (Old_Itype, New_Itype);
1633 NCT_Table_Entries := NCT_Table_Entries + 1;
1635 if NCT_Table_Entries > NCT_Hash_Threshhold then
1636 Build_NCT_Hash_Tables;
1640 -- If a record subtype is simply copied, the entity list will be
1641 -- shared. Thus cloned_Subtype must be set to indicate the sharing.
1643 if Ekind (Old_Itype) = E_Record_Subtype
1644 or else Ekind (Old_Itype) = E_Class_Wide_Subtype
1646 Set_Cloned_Subtype (New_Itype, Old_Itype);
1649 -- Visit descendents that eventually get copied
1651 Visit_Field (Union_Id (Etype (Old_Itype)), Old_Itype);
1653 if Is_Discrete_Type (Old_Itype) then
1654 Visit_Field (Union_Id (Scalar_Range (Old_Itype)), Old_Itype);
1656 elsif Has_Discriminants (Base_Type (Old_Itype)) then
1657 -- ??? This should involve call to Visit_Field.
1658 Visit_Elist (Discriminant_Constraint (Old_Itype));
1660 elsif Is_Array_Type (Old_Itype) then
1661 if Present (First_Index (Old_Itype)) then
1662 Visit_Field (Union_Id (List_Containing
1663 (First_Index (Old_Itype))),
1667 if Is_Packed (Old_Itype) then
1668 Visit_Field (Union_Id (Packed_Array_Type (Old_Itype)),
1678 procedure Visit_List (L : List_Id) is
1682 if L /= No_List then
1685 while Present (N) loop
1696 procedure Visit_Node (N : Node_Or_Entity_Id) is
1698 -- Start of processing for Visit_Node
1701 -- Handle case of an Itype, which must be copied
1703 if Has_Extension (N)
1704 and then Is_Itype (N)
1706 -- Nothing to do if already in the list. This can happen with an
1707 -- Itype entity that appears more than once in the tree.
1708 -- Note that we do not want to visit descendents in this case.
1710 -- Test for already in list when hash table is used
1712 if NCT_Hash_Tables_Used then
1713 if Present (NCT_Assoc.Get (Entity_Id (N))) then
1717 -- Test for already in list when hash table not used
1724 if Present (Actual_Map) then
1725 E := First_Elmt (Actual_Map);
1726 while Present (E) loop
1727 if Node (E) = N then
1730 E := Next_Elmt (Next_Elmt (E));
1740 -- Visit descendents
1742 Visit_Field (Field1 (N), N);
1743 Visit_Field (Field2 (N), N);
1744 Visit_Field (Field3 (N), N);
1745 Visit_Field (Field4 (N), N);
1746 Visit_Field (Field5 (N), N);
1749 -- Start of processing for New_Copy_Tree
1754 -- See if we should use hash table
1756 if No (Actual_Map) then
1757 NCT_Hash_Tables_Used := False;
1764 NCT_Table_Entries := 0;
1765 Elmt := First_Elmt (Actual_Map);
1766 while Present (Elmt) loop
1767 NCT_Table_Entries := NCT_Table_Entries + 1;
1772 if NCT_Table_Entries > NCT_Hash_Threshhold then
1773 Build_NCT_Hash_Tables;
1775 NCT_Hash_Tables_Used := False;
1780 -- Hash table set up if required, now start phase one by visiting
1781 -- top node (we will recursively visit the descendents).
1783 Visit_Node (Source);
1785 -- Now the second phase of the copy can start. First we process
1786 -- all the mapped entities, copying their descendents.
1788 if Present (Actual_Map) then
1791 New_Itype : Entity_Id;
1794 Elmt := First_Elmt (Actual_Map);
1795 while Present (Elmt) loop
1797 New_Itype := Node (Elmt);
1798 Copy_Itype_With_Replacement (New_Itype);
1804 -- Now we can copy the actual tree
1806 return Copy_Node_With_Replacement (Source);
1814 (New_Node_Kind : Node_Kind;
1815 New_Sloc : Source_Ptr)
1818 procedure New_Entity_Debugging_Output;
1819 -- Debugging routine for debug flag N
1821 procedure New_Entity_Debugging_Output is
1823 if Debug_Flag_N then
1824 Write_Str ("Allocate entity, Id = ");
1825 Write_Int (Int (Nodes.Last));
1827 Write_Location (New_Sloc);
1829 Write_Str (Node_Kind'Image (New_Node_Kind));
1832 end New_Entity_Debugging_Output;
1834 pragma Inline (New_Entity_Debugging_Output);
1836 -- Start of processing for New_Entity
1839 pragma Assert (New_Node_Kind in N_Entity);
1841 Nodes.Increment_Last;
1842 Current_Error_Node := Nodes.Last;
1843 Nodes.Table (Nodes.Last) := Default_Node;
1844 Nodes.Table (Nodes.Last).Nkind := New_Node_Kind;
1845 Nodes.Table (Nodes.Last).Sloc := New_Sloc;
1846 pragma Debug (New_Entity_Debugging_Output);
1848 Orig_Nodes.Increment_Last;
1849 Orig_Nodes.Table (Nodes.Last) := Nodes.Last;
1851 Nodes.Increment_Last;
1852 Nodes.Table (Nodes.Last) := Default_Node_Extension;
1854 Nodes.Increment_Last;
1855 Nodes.Table (Nodes.Last) := Default_Node_Extension;
1857 Nodes.Increment_Last;
1858 Nodes.Table (Nodes.Last) := Default_Node_Extension;
1860 Orig_Nodes.Set_Last (Nodes.Last);
1861 Allocate_List_Tables (Nodes.Last);
1862 Node_Count := Node_Count + 1;
1863 return Current_Error_Node;
1871 (New_Node_Kind : Node_Kind;
1872 New_Sloc : Source_Ptr)
1875 procedure New_Node_Debugging_Output;
1876 -- Debugging routine for debug flag N
1878 procedure New_Node_Debugging_Output is
1880 if Debug_Flag_N then
1881 Write_Str ("Allocate node, Id = ");
1882 Write_Int (Int (Nodes.Last));
1884 Write_Location (New_Sloc);
1886 Write_Str (Node_Kind'Image (New_Node_Kind));
1889 end New_Node_Debugging_Output;
1891 pragma Inline (New_Node_Debugging_Output);
1893 -- Start of processing for New_Node
1896 pragma Assert (New_Node_Kind not in N_Entity);
1897 Nodes.Increment_Last;
1898 Nodes.Table (Nodes.Last) := Default_Node;
1899 Nodes.Table (Nodes.Last).Nkind := New_Node_Kind;
1900 Nodes.Table (Nodes.Last).Sloc := New_Sloc;
1901 pragma Debug (New_Node_Debugging_Output);
1902 Current_Error_Node := Nodes.Last;
1903 Node_Count := Node_Count + 1;
1905 Orig_Nodes.Increment_Last;
1906 Allocate_List_Tables (Nodes.Last);
1907 Orig_Nodes.Table (Nodes.Last) := Nodes.Last;
1915 function Nkind (N : Node_Id) return Node_Kind is
1917 return Nodes.Table (N).Nkind;
1924 function No (N : Node_Id) return Boolean is
1933 function Nodes_Address return System.Address is
1935 return Nodes.Table (First_Node_Id)'Address;
1942 function Num_Nodes return Nat is
1951 function Original_Node (Node : Node_Id) return Node_Id is
1953 return Orig_Nodes.Table (Node);
1960 function Paren_Count (N : Node_Id) return Paren_Count_Type is
1961 C : Paren_Count_Type := 0;
1964 pragma Assert (N in Nodes.First .. Nodes.Last);
1966 if Nodes.Table (N).Pflag1 then
1970 if Nodes.Table (N).Pflag2 then
1981 function Parent (N : Node_Id) return Node_Id is
1983 if Is_List_Member (N) then
1984 return Parent (List_Containing (N));
1986 return Node_Id (Nodes.Table (N).Link);
1994 function Present (N : Node_Id) return Boolean is
1999 --------------------------------
2000 -- Preserve_Comes_From_Source --
2001 --------------------------------
2003 procedure Preserve_Comes_From_Source (NewN, OldN : Node_Id) is
2005 Nodes.Table (NewN).Comes_From_Source :=
2006 Nodes.Table (OldN).Comes_From_Source;
2007 end Preserve_Comes_From_Source;
2013 function Relocate_Node (Source : Node_Id) return Node_Id is
2021 New_Node := New_Copy (Source);
2022 Fix_Parent (Field1 (Source), Source, New_Node);
2023 Fix_Parent (Field2 (Source), Source, New_Node);
2024 Fix_Parent (Field3 (Source), Source, New_Node);
2025 Fix_Parent (Field4 (Source), Source, New_Node);
2026 Fix_Parent (Field5 (Source), Source, New_Node);
2028 -- We now set the parent of the new node to be the same as the
2029 -- parent of the source. Almost always this parent will be
2030 -- replaced by a new value when the relocated node is reattached
2031 -- to the tree, but by doing it now, we ensure that this node is
2032 -- not even temporarily disconnected from the tree. Note that this
2033 -- does not happen free, because in the list case, the parent does
2036 Set_Parent (New_Node, Parent (Source));
2044 procedure Replace (Old_Node, New_Node : Node_Id) is
2045 Old_Link : constant Union_Id := Nodes.Table (Old_Node).Link;
2046 Old_InL : constant Boolean := Nodes.Table (Old_Node).In_List;
2047 Old_Post : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
2048 Old_CFS : constant Boolean := Nodes.Table (Old_Node).Comes_From_Source;
2052 (not Has_Extension (Old_Node)
2053 and not Has_Extension (New_Node)
2054 and not Nodes.Table (New_Node).In_List);
2056 -- Do copy, preserving link and in list status and comes from source
2058 Nodes.Table (Old_Node) := Nodes.Table (New_Node);
2059 Nodes.Table (Old_Node).Link := Old_Link;
2060 Nodes.Table (Old_Node).In_List := Old_InL;
2061 Nodes.Table (Old_Node).Comes_From_Source := Old_CFS;
2062 Nodes.Table (Old_Node).Error_Posted := Old_Post;
2064 -- Fix parents of substituted node, since it has changed identity
2066 Fix_Parent (Field1 (Old_Node), New_Node, Old_Node);
2067 Fix_Parent (Field2 (Old_Node), New_Node, Old_Node);
2068 Fix_Parent (Field3 (Old_Node), New_Node, Old_Node);
2069 Fix_Parent (Field4 (Old_Node), New_Node, Old_Node);
2070 Fix_Parent (Field5 (Old_Node), New_Node, Old_Node);
2072 -- Since we are doing a replace, we assume that the original node
2073 -- is intended to become the new replaced node. The call would be
2074 -- to Rewrite_Substitute_Node if there were an intention to save
2075 -- the original node.
2077 Orig_Nodes.Table (Old_Node) := Old_Node;
2079 -- Finally delete the source, since it is now copied
2081 Delete_Node (New_Node);
2089 procedure Rewrite (Old_Node, New_Node : Node_Id) is
2091 Old_Link : constant Union_Id := Nodes.Table (Old_Node).Link;
2092 Old_In_List : constant Boolean := Nodes.Table (Old_Node).In_List;
2093 Old_Error_P : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
2094 -- These three fields are always preserved in the new node
2096 Old_Paren_Count : Paren_Count_Type;
2097 Old_Must_Not_Freeze : Boolean;
2098 -- These fields are preserved in the new node only if the new node
2099 -- and the old node are both subexpression nodes.
2101 -- Note: it is a violation of abstraction levels for Must_Not_Freeze
2102 -- to be referenced like this. ???
2108 (not Has_Extension (Old_Node)
2109 and not Has_Extension (New_Node)
2110 and not Nodes.Table (New_Node).In_List);
2112 if Nkind (Old_Node) in N_Subexpr then
2113 Old_Paren_Count := Paren_Count (Old_Node);
2114 Old_Must_Not_Freeze := Must_Not_Freeze (Old_Node);
2116 Old_Paren_Count := 0;
2117 Old_Must_Not_Freeze := False;
2120 -- Allocate a new node, to be used to preserve the original contents
2121 -- of the Old_Node, for possible later retrival by Original_Node and
2122 -- make an entry in the Orig_Nodes table. This is only done if we have
2123 -- not already rewritten the node, as indicated by an Orig_Nodes entry
2124 -- that does not reference the Old_Node.
2126 if Orig_Nodes.Table (Old_Node) = Old_Node then
2127 Nodes.Increment_Last;
2128 Sav_Node := Nodes.Last;
2129 Nodes.Table (Sav_Node) := Nodes.Table (Old_Node);
2130 Nodes.Table (Sav_Node).In_List := False;
2131 Nodes.Table (Sav_Node).Link := Union_Id (Empty);
2133 Orig_Nodes.Increment_Last;
2134 Allocate_List_Tables (Nodes.Last);
2136 Orig_Nodes.Table (Sav_Node) := Sav_Node;
2137 Orig_Nodes.Table (Old_Node) := Sav_Node;
2140 -- Copy substitute node into place, preserving old fields as required
2142 Nodes.Table (Old_Node) := Nodes.Table (New_Node);
2143 Nodes.Table (Old_Node).Link := Old_Link;
2144 Nodes.Table (Old_Node).In_List := Old_In_List;
2145 Nodes.Table (Old_Node).Error_Posted := Old_Error_P;
2147 if Nkind (New_Node) in N_Subexpr then
2148 Set_Paren_Count (Old_Node, Old_Paren_Count);
2149 Set_Must_Not_Freeze (Old_Node, Old_Must_Not_Freeze);
2152 Fix_Parent (Field1 (Old_Node), New_Node, Old_Node);
2153 Fix_Parent (Field2 (Old_Node), New_Node, Old_Node);
2154 Fix_Parent (Field3 (Old_Node), New_Node, Old_Node);
2155 Fix_Parent (Field4 (Old_Node), New_Node, Old_Node);
2156 Fix_Parent (Field5 (Old_Node), New_Node, Old_Node);
2164 procedure Set_Analyzed (N : Node_Id; Val : Boolean := True) is
2166 Nodes.Table (N).Analyzed := Val;
2169 ---------------------------
2170 -- Set_Comes_From_Source --
2171 ---------------------------
2173 procedure Set_Comes_From_Source (N : Node_Id; Val : Boolean) is
2175 pragma Assert (N in Nodes.First .. Nodes.Last);
2176 Nodes.Table (N).Comes_From_Source := Val;
2177 end Set_Comes_From_Source;
2179 -----------------------------------
2180 -- Set_Comes_From_Source_Default --
2181 -----------------------------------
2183 procedure Set_Comes_From_Source_Default (Default : Boolean) is
2185 Default_Node.Comes_From_Source := Default;
2186 end Set_Comes_From_Source_Default;
2188 --------------------
2189 -- Set_Convention --
2190 --------------------
2192 procedure Set_Convention (E : Entity_Id; Val : Convention_Id) is
2194 pragma Assert (Nkind (E) in N_Entity);
2197 (Nodes.Table (E + 2).Field12'Unrestricted_Access)).Convention :=
2205 procedure Set_Ekind (E : Entity_Id; Val : Entity_Kind) is
2207 pragma Assert (Nkind (E) in N_Entity);
2208 Nodes.Table (E + 1).Nkind := E_To_N (Val);
2211 ----------------------
2212 -- Set_Error_Posted --
2213 ----------------------
2215 procedure Set_Error_Posted (N : Node_Id; Val : Boolean := True) is
2217 Nodes.Table (N).Error_Posted := Val;
2218 end Set_Error_Posted;
2220 ---------------------
2221 -- Set_Paren_Count --
2222 ---------------------
2224 procedure Set_Paren_Count (N : Node_Id; Val : Paren_Count_Type) is
2226 pragma Assert (Nkind (N) in N_Subexpr);
2227 Nodes.Table (N).Pflag1 := (Val mod 2 /= 0);
2228 Nodes.Table (N).Pflag2 := (Val >= 2);
2229 end Set_Paren_Count;
2235 procedure Set_Parent (N : Node_Id; Val : Node_Id) is
2237 pragma Assert (not Nodes.Table (N).In_List);
2238 Nodes.Table (N).Link := Union_Id (Val);
2245 procedure Set_Sloc (N : Node_Id; Val : Source_Ptr) is
2247 Nodes.Table (N).Sloc := Val;
2254 function Sloc (N : Node_Id) return Source_Ptr is
2256 return Nodes.Table (N).Sloc;
2263 function Traverse_Func (Node : Node_Id) return Traverse_Result is
2265 function Traverse_Field (Fld : Union_Id) return Traverse_Result;
2266 -- Fld is one of the fields of Node. If the field points to a
2267 -- syntactic node or list, then this node or list is traversed,
2268 -- and the result is the result of this traversal. Otherwise
2269 -- a value of True is returned with no processing.
2271 --------------------
2272 -- Traverse_Field --
2273 --------------------
2275 function Traverse_Field (Fld : Union_Id) return Traverse_Result is
2277 if Fld = Union_Id (Empty) then
2280 -- Descendent is a node
2282 elsif Fld in Node_Range then
2284 -- Traverse descendent that is syntactic subtree node
2286 if Parent (Node_Id (Fld)) = Node then
2287 return Traverse_Func (Node_Id (Fld));
2289 -- Node that is not a syntactic subtree
2295 -- Descendent is a list
2297 elsif Fld in List_Range then
2299 -- Traverse descendent that is a syntactic subtree list
2301 if Parent (List_Id (Fld)) = Node then
2304 Elmt : Node_Id := First (List_Id (Fld));
2306 while Present (Elmt) loop
2307 if Traverse_Func (Elmt) = Abandon then
2317 -- List that is not a syntactic subtree
2323 -- Field was not a node or a list
2330 -- Start of processing for Traverse_Func
2333 case Process (Node) is
2341 if Traverse_Field (Union_Id (Field1 (Node))) = Abandon
2343 Traverse_Field (Union_Id (Field2 (Node))) = Abandon
2345 Traverse_Field (Union_Id (Field3 (Node))) = Abandon
2347 Traverse_Field (Union_Id (Field4 (Node))) = Abandon
2349 Traverse_Field (Union_Id (Field5 (Node))) = Abandon
2359 Onode : constant Node_Id := Original_Node (Node);
2362 if Traverse_Field (Union_Id (Field1 (Onode))) = Abandon
2364 Traverse_Field (Union_Id (Field2 (Onode))) = Abandon
2366 Traverse_Field (Union_Id (Field3 (Onode))) = Abandon
2368 Traverse_Field (Union_Id (Field4 (Onode))) = Abandon
2370 Traverse_Field (Union_Id (Field5 (Onode))) = Abandon
2386 procedure Traverse_Proc (Node : Node_Id) is
2387 function Traverse is new Traverse_Func (Process);
2388 Discard : Traverse_Result;
2391 Discard := Traverse (Node);
2398 procedure Tree_Read is
2400 Tree_Read_Int (Node_Count);
2402 Orig_Nodes.Tree_Read;
2409 procedure Tree_Write is
2411 Tree_Write_Int (Node_Count);
2413 Orig_Nodes.Tree_Write;
2416 ------------------------------
2417 -- Unchecked Access Package --
2418 ------------------------------
2420 package body Unchecked_Access is
2422 function Field1 (N : Node_Id) return Union_Id is
2424 pragma Assert (N in Nodes.First .. Nodes.Last);
2425 return Nodes.Table (N).Field1;
2428 function Field2 (N : Node_Id) return Union_Id is
2430 pragma Assert (N in Nodes.First .. Nodes.Last);
2431 return Nodes.Table (N).Field2;
2434 function Field3 (N : Node_Id) return Union_Id is
2436 pragma Assert (N in Nodes.First .. Nodes.Last);
2437 return Nodes.Table (N).Field3;
2440 function Field4 (N : Node_Id) return Union_Id is
2442 pragma Assert (N in Nodes.First .. Nodes.Last);
2443 return Nodes.Table (N).Field4;
2446 function Field5 (N : Node_Id) return Union_Id is
2448 pragma Assert (N in Nodes.First .. Nodes.Last);
2449 return Nodes.Table (N).Field5;
2452 function Field6 (N : Node_Id) return Union_Id is
2454 pragma Assert (Nkind (N) in N_Entity);
2455 return Nodes.Table (N + 1).Field6;
2458 function Field7 (N : Node_Id) return Union_Id is
2460 pragma Assert (Nkind (N) in N_Entity);
2461 return Nodes.Table (N + 1).Field7;
2464 function Field8 (N : Node_Id) return Union_Id is
2466 pragma Assert (Nkind (N) in N_Entity);
2467 return Nodes.Table (N + 1).Field8;
2470 function Field9 (N : Node_Id) return Union_Id is
2472 pragma Assert (Nkind (N) in N_Entity);
2473 return Nodes.Table (N + 1).Field9;
2476 function Field10 (N : Node_Id) return Union_Id is
2478 pragma Assert (Nkind (N) in N_Entity);
2479 return Nodes.Table (N + 1).Field10;
2482 function Field11 (N : Node_Id) return Union_Id is
2484 pragma Assert (Nkind (N) in N_Entity);
2485 return Nodes.Table (N + 1).Field11;
2488 function Field12 (N : Node_Id) return Union_Id is
2490 pragma Assert (Nkind (N) in N_Entity);
2491 return Nodes.Table (N + 1).Field12;
2494 function Field13 (N : Node_Id) return Union_Id is
2496 pragma Assert (Nkind (N) in N_Entity);
2497 return Nodes.Table (N + 2).Field6;
2500 function Field14 (N : Node_Id) return Union_Id is
2502 pragma Assert (Nkind (N) in N_Entity);
2503 return Nodes.Table (N + 2).Field7;
2506 function Field15 (N : Node_Id) return Union_Id is
2508 pragma Assert (Nkind (N) in N_Entity);
2509 return Nodes.Table (N + 2).Field8;
2512 function Field16 (N : Node_Id) return Union_Id is
2514 pragma Assert (Nkind (N) in N_Entity);
2515 return Nodes.Table (N + 2).Field9;
2518 function Field17 (N : Node_Id) return Union_Id is
2520 pragma Assert (Nkind (N) in N_Entity);
2521 return Nodes.Table (N + 2).Field10;
2524 function Field18 (N : Node_Id) return Union_Id is
2526 pragma Assert (Nkind (N) in N_Entity);
2527 return Nodes.Table (N + 2).Field11;
2530 function Field19 (N : Node_Id) return Union_Id is
2532 pragma Assert (Nkind (N) in N_Entity);
2533 return Nodes.Table (N + 3).Field6;
2536 function Field20 (N : Node_Id) return Union_Id is
2538 pragma Assert (Nkind (N) in N_Entity);
2539 return Nodes.Table (N + 3).Field7;
2542 function Field21 (N : Node_Id) return Union_Id is
2544 pragma Assert (Nkind (N) in N_Entity);
2545 return Nodes.Table (N + 3).Field8;
2548 function Field22 (N : Node_Id) return Union_Id is
2550 pragma Assert (Nkind (N) in N_Entity);
2551 return Nodes.Table (N + 3).Field9;
2554 function Field23 (N : Node_Id) return Union_Id is
2556 pragma Assert (Nkind (N) in N_Entity);
2557 return Nodes.Table (N + 3).Field10;
2560 function Node1 (N : Node_Id) return Node_Id is
2562 pragma Assert (N in Nodes.First .. Nodes.Last);
2563 return Node_Id (Nodes.Table (N).Field1);
2566 function Node2 (N : Node_Id) return Node_Id is
2568 pragma Assert (N in Nodes.First .. Nodes.Last);
2569 return Node_Id (Nodes.Table (N).Field2);
2572 function Node3 (N : Node_Id) return Node_Id is
2574 pragma Assert (N in Nodes.First .. Nodes.Last);
2575 return Node_Id (Nodes.Table (N).Field3);
2578 function Node4 (N : Node_Id) return Node_Id is
2580 pragma Assert (N in Nodes.First .. Nodes.Last);
2581 return Node_Id (Nodes.Table (N).Field4);
2584 function Node5 (N : Node_Id) return Node_Id is
2586 pragma Assert (N in Nodes.First .. Nodes.Last);
2587 return Node_Id (Nodes.Table (N).Field5);
2590 function Node6 (N : Node_Id) return Node_Id is
2592 pragma Assert (Nkind (N) in N_Entity);
2593 return Node_Id (Nodes.Table (N + 1).Field6);
2596 function Node7 (N : Node_Id) return Node_Id is
2598 pragma Assert (Nkind (N) in N_Entity);
2599 return Node_Id (Nodes.Table (N + 1).Field7);
2602 function Node8 (N : Node_Id) return Node_Id is
2604 pragma Assert (Nkind (N) in N_Entity);
2605 return Node_Id (Nodes.Table (N + 1).Field8);
2608 function Node9 (N : Node_Id) return Node_Id is
2610 pragma Assert (Nkind (N) in N_Entity);
2611 return Node_Id (Nodes.Table (N + 1).Field9);
2614 function Node10 (N : Node_Id) return Node_Id is
2616 pragma Assert (Nkind (N) in N_Entity);
2617 return Node_Id (Nodes.Table (N + 1).Field10);
2620 function Node11 (N : Node_Id) return Node_Id is
2622 pragma Assert (Nkind (N) in N_Entity);
2623 return Node_Id (Nodes.Table (N + 1).Field11);
2626 function Node12 (N : Node_Id) return Node_Id is
2628 pragma Assert (Nkind (N) in N_Entity);
2629 return Node_Id (Nodes.Table (N + 1).Field12);
2632 function Node13 (N : Node_Id) return Node_Id is
2634 pragma Assert (Nkind (N) in N_Entity);
2635 return Node_Id (Nodes.Table (N + 2).Field6);
2638 function Node14 (N : Node_Id) return Node_Id is
2640 pragma Assert (Nkind (N) in N_Entity);
2641 return Node_Id (Nodes.Table (N + 2).Field7);
2644 function Node15 (N : Node_Id) return Node_Id is
2646 pragma Assert (Nkind (N) in N_Entity);
2647 return Node_Id (Nodes.Table (N + 2).Field8);
2650 function Node16 (N : Node_Id) return Node_Id is
2652 pragma Assert (Nkind (N) in N_Entity);
2653 return Node_Id (Nodes.Table (N + 2).Field9);
2656 function Node17 (N : Node_Id) return Node_Id is
2658 pragma Assert (Nkind (N) in N_Entity);
2659 return Node_Id (Nodes.Table (N + 2).Field10);
2662 function Node18 (N : Node_Id) return Node_Id is
2664 pragma Assert (Nkind (N) in N_Entity);
2665 return Node_Id (Nodes.Table (N + 2).Field11);
2668 function Node19 (N : Node_Id) return Node_Id is
2670 pragma Assert (Nkind (N) in N_Entity);
2671 return Node_Id (Nodes.Table (N + 3).Field6);
2674 function Node20 (N : Node_Id) return Node_Id is
2676 pragma Assert (Nkind (N) in N_Entity);
2677 return Node_Id (Nodes.Table (N + 3).Field7);
2680 function Node21 (N : Node_Id) return Node_Id is
2682 pragma Assert (Nkind (N) in N_Entity);
2683 return Node_Id (Nodes.Table (N + 3).Field8);
2686 function Node22 (N : Node_Id) return Node_Id is
2688 pragma Assert (Nkind (N) in N_Entity);
2689 return Node_Id (Nodes.Table (N + 3).Field9);
2692 function Node23 (N : Node_Id) return Node_Id is
2694 pragma Assert (Nkind (N) in N_Entity);
2695 return Node_Id (Nodes.Table (N + 3).Field10);
2698 function List1 (N : Node_Id) return List_Id is
2700 pragma Assert (N in Nodes.First .. Nodes.Last);
2701 return List_Id (Nodes.Table (N).Field1);
2704 function List2 (N : Node_Id) return List_Id is
2706 pragma Assert (N in Nodes.First .. Nodes.Last);
2707 return List_Id (Nodes.Table (N).Field2);
2710 function List3 (N : Node_Id) return List_Id is
2712 pragma Assert (N in Nodes.First .. Nodes.Last);
2713 return List_Id (Nodes.Table (N).Field3);
2716 function List4 (N : Node_Id) return List_Id is
2718 pragma Assert (N in Nodes.First .. Nodes.Last);
2719 return List_Id (Nodes.Table (N).Field4);
2722 function List5 (N : Node_Id) return List_Id is
2724 pragma Assert (N in Nodes.First .. Nodes.Last);
2725 return List_Id (Nodes.Table (N).Field5);
2728 function List10 (N : Node_Id) return List_Id is
2730 pragma Assert (Nkind (N) in N_Entity);
2731 return List_Id (Nodes.Table (N + 1).Field10);
2734 function List14 (N : Node_Id) return List_Id is
2736 pragma Assert (Nkind (N) in N_Entity);
2737 return List_Id (Nodes.Table (N + 2).Field7);
2740 function Elist2 (N : Node_Id) return Elist_Id is
2742 return Elist_Id (Nodes.Table (N).Field2);
2745 function Elist3 (N : Node_Id) return Elist_Id is
2747 return Elist_Id (Nodes.Table (N).Field3);
2750 function Elist4 (N : Node_Id) return Elist_Id is
2752 return Elist_Id (Nodes.Table (N).Field4);
2755 function Elist8 (N : Node_Id) return Elist_Id is
2757 pragma Assert (Nkind (N) in N_Entity);
2758 return Elist_Id (Nodes.Table (N + 1).Field8);
2761 function Elist13 (N : Node_Id) return Elist_Id is
2763 pragma Assert (Nkind (N) in N_Entity);
2764 return Elist_Id (Nodes.Table (N + 2).Field6);
2767 function Elist15 (N : Node_Id) return Elist_Id is
2769 pragma Assert (Nkind (N) in N_Entity);
2770 return Elist_Id (Nodes.Table (N + 2).Field8);
2773 function Elist16 (N : Node_Id) return Elist_Id is
2775 pragma Assert (Nkind (N) in N_Entity);
2776 return Elist_Id (Nodes.Table (N + 2).Field9);
2779 function Elist18 (N : Node_Id) return Elist_Id is
2781 pragma Assert (Nkind (N) in N_Entity);
2782 return Elist_Id (Nodes.Table (N + 2).Field11);
2785 function Elist21 (N : Node_Id) return Elist_Id is
2787 pragma Assert (Nkind (N) in N_Entity);
2788 return Elist_Id (Nodes.Table (N + 3).Field8);
2791 function Elist23 (N : Node_Id) return Elist_Id is
2793 pragma Assert (Nkind (N) in N_Entity);
2794 return Elist_Id (Nodes.Table (N + 3).Field10);
2797 function Name1 (N : Node_Id) return Name_Id is
2799 pragma Assert (N in Nodes.First .. Nodes.Last);
2800 return Name_Id (Nodes.Table (N).Field1);
2803 function Name2 (N : Node_Id) return Name_Id is
2805 pragma Assert (N in Nodes.First .. Nodes.Last);
2806 return Name_Id (Nodes.Table (N).Field2);
2809 function Str3 (N : Node_Id) return String_Id is
2811 pragma Assert (N in Nodes.First .. Nodes.Last);
2812 return String_Id (Nodes.Table (N).Field3);
2815 function Char_Code2 (N : Node_Id) return Char_Code is
2817 pragma Assert (N in Nodes.First .. Nodes.Last);
2818 return Char_Code (Nodes.Table (N).Field2 - Char_Code_Bias);
2821 function Uint3 (N : Node_Id) return Uint is
2822 pragma Assert (N in Nodes.First .. Nodes.Last);
2823 U : constant Union_Id := Nodes.Table (N).Field3;
2829 return From_Union (U);
2833 function Uint4 (N : Node_Id) return Uint is
2834 pragma Assert (N in Nodes.First .. Nodes.Last);
2835 U : constant Union_Id := Nodes.Table (N).Field4;
2841 return From_Union (U);
2845 function Uint5 (N : Node_Id) return Uint is
2846 pragma Assert (N in Nodes.First .. Nodes.Last);
2847 U : constant Union_Id := Nodes.Table (N).Field5;
2853 return From_Union (U);
2857 function Uint8 (N : Node_Id) return Uint is
2858 pragma Assert (Nkind (N) in N_Entity);
2859 U : constant Union_Id := Nodes.Table (N + 1).Field8;
2865 return From_Union (U);
2869 function Uint9 (N : Node_Id) return Uint is
2870 pragma Assert (Nkind (N) in N_Entity);
2871 U : constant Union_Id := Nodes.Table (N + 1).Field9;
2877 return From_Union (U);
2881 function Uint11 (N : Node_Id) return Uint is
2882 pragma Assert (Nkind (N) in N_Entity);
2883 U : constant Union_Id := Nodes.Table (N + 1).Field11;
2889 return From_Union (U);
2893 function Uint10 (N : Node_Id) return Uint is
2894 pragma Assert (Nkind (N) in N_Entity);
2895 U : constant Union_Id := Nodes.Table (N + 1).Field10;
2901 return From_Union (U);
2905 function Uint12 (N : Node_Id) return Uint is
2906 pragma Assert (Nkind (N) in N_Entity);
2907 U : constant Union_Id := Nodes.Table (N + 1).Field12;
2913 return From_Union (U);
2917 function Uint13 (N : Node_Id) return Uint is
2918 pragma Assert (Nkind (N) in N_Entity);
2919 U : constant Union_Id := Nodes.Table (N + 2).Field6;
2925 return From_Union (U);
2929 function Uint14 (N : Node_Id) return Uint is
2930 pragma Assert (Nkind (N) in N_Entity);
2931 U : constant Union_Id := Nodes.Table (N + 2).Field7;
2937 return From_Union (U);
2941 function Uint15 (N : Node_Id) return Uint is
2942 pragma Assert (Nkind (N) in N_Entity);
2943 U : constant Union_Id := Nodes.Table (N + 2).Field8;
2949 return From_Union (U);
2953 function Uint16 (N : Node_Id) return Uint is
2954 pragma Assert (Nkind (N) in N_Entity);
2955 U : constant Union_Id := Nodes.Table (N + 2).Field9;
2961 return From_Union (U);
2965 function Uint17 (N : Node_Id) return Uint is
2966 pragma Assert (Nkind (N) in N_Entity);
2967 U : constant Union_Id := Nodes.Table (N + 2).Field10;
2973 return From_Union (U);
2977 function Uint22 (N : Node_Id) return Uint is
2978 pragma Assert (Nkind (N) in N_Entity);
2979 U : constant Union_Id := Nodes.Table (N + 3).Field9;
2985 return From_Union (U);
2989 function Ureal3 (N : Node_Id) return Ureal is
2991 pragma Assert (N in Nodes.First .. Nodes.Last);
2992 return From_Union (Nodes.Table (N).Field3);
2995 function Ureal18 (N : Node_Id) return Ureal is
2997 pragma Assert (Nkind (N) in N_Entity);
2998 return From_Union (Nodes.Table (N + 2).Field11);
3001 function Ureal21 (N : Node_Id) return Ureal is
3003 pragma Assert (Nkind (N) in N_Entity);
3004 return From_Union (Nodes.Table (N + 3).Field8);
3007 function Flag4 (N : Node_Id) return Boolean is
3009 pragma Assert (N in Nodes.First .. Nodes.Last);
3010 return Nodes.Table (N).Flag4;
3013 function Flag5 (N : Node_Id) return Boolean is
3015 pragma Assert (N in Nodes.First .. Nodes.Last);
3016 return Nodes.Table (N).Flag5;
3019 function Flag6 (N : Node_Id) return Boolean is
3021 pragma Assert (N in Nodes.First .. Nodes.Last);
3022 return Nodes.Table (N).Flag6;
3025 function Flag7 (N : Node_Id) return Boolean is
3027 pragma Assert (N in Nodes.First .. Nodes.Last);
3028 return Nodes.Table (N).Flag7;
3031 function Flag8 (N : Node_Id) return Boolean is
3033 pragma Assert (N in Nodes.First .. Nodes.Last);
3034 return Nodes.Table (N).Flag8;
3037 function Flag9 (N : Node_Id) return Boolean is
3039 pragma Assert (N in Nodes.First .. Nodes.Last);
3040 return Nodes.Table (N).Flag9;
3043 function Flag10 (N : Node_Id) return Boolean is
3045 pragma Assert (N in Nodes.First .. Nodes.Last);
3046 return Nodes.Table (N).Flag10;
3049 function Flag11 (N : Node_Id) return Boolean is
3051 pragma Assert (N in Nodes.First .. Nodes.Last);
3052 return Nodes.Table (N).Flag11;
3055 function Flag12 (N : Node_Id) return Boolean is
3057 pragma Assert (N in Nodes.First .. Nodes.Last);
3058 return Nodes.Table (N).Flag12;
3061 function Flag13 (N : Node_Id) return Boolean is
3063 pragma Assert (N in Nodes.First .. Nodes.Last);
3064 return Nodes.Table (N).Flag13;
3067 function Flag14 (N : Node_Id) return Boolean is
3069 pragma Assert (N in Nodes.First .. Nodes.Last);
3070 return Nodes.Table (N).Flag14;
3073 function Flag15 (N : Node_Id) return Boolean is
3075 pragma Assert (N in Nodes.First .. Nodes.Last);
3076 return Nodes.Table (N).Flag15;
3079 function Flag16 (N : Node_Id) return Boolean is
3081 pragma Assert (N in Nodes.First .. Nodes.Last);
3082 return Nodes.Table (N).Flag16;
3085 function Flag17 (N : Node_Id) return Boolean is
3087 pragma Assert (N in Nodes.First .. Nodes.Last);
3088 return Nodes.Table (N).Flag17;
3091 function Flag18 (N : Node_Id) return Boolean is
3093 pragma Assert (N in Nodes.First .. Nodes.Last);
3094 return Nodes.Table (N).Flag18;
3097 function Flag19 (N : Node_Id) return Boolean is
3099 pragma Assert (Nkind (N) in N_Entity);
3100 return Nodes.Table (N + 1).In_List;
3103 function Flag20 (N : Node_Id) return Boolean is
3105 pragma Assert (Nkind (N) in N_Entity);
3106 return Nodes.Table (N + 1).Unused_1;
3109 function Flag21 (N : Node_Id) return Boolean is
3111 pragma Assert (Nkind (N) in N_Entity);
3112 return Nodes.Table (N + 1).Rewrite_Ins;
3115 function Flag22 (N : Node_Id) return Boolean is
3117 pragma Assert (Nkind (N) in N_Entity);
3118 return Nodes.Table (N + 1).Analyzed;
3121 function Flag23 (N : Node_Id) return Boolean is
3123 pragma Assert (Nkind (N) in N_Entity);
3124 return Nodes.Table (N + 1).Comes_From_Source;
3127 function Flag24 (N : Node_Id) return Boolean is
3129 pragma Assert (Nkind (N) in N_Entity);
3130 return Nodes.Table (N + 1).Error_Posted;
3133 function Flag25 (N : Node_Id) return Boolean is
3135 pragma Assert (Nkind (N) in N_Entity);
3136 return Nodes.Table (N + 1).Flag4;
3139 function Flag26 (N : Node_Id) return Boolean is
3141 pragma Assert (Nkind (N) in N_Entity);
3142 return Nodes.Table (N + 1).Flag5;
3145 function Flag27 (N : Node_Id) return Boolean is
3147 pragma Assert (Nkind (N) in N_Entity);
3148 return Nodes.Table (N + 1).Flag6;
3151 function Flag28 (N : Node_Id) return Boolean is
3153 pragma Assert (Nkind (N) in N_Entity);
3154 return Nodes.Table (N + 1).Flag7;
3157 function Flag29 (N : Node_Id) return Boolean is
3159 pragma Assert (Nkind (N) in N_Entity);
3160 return Nodes.Table (N + 1).Flag8;
3163 function Flag30 (N : Node_Id) return Boolean is
3165 pragma Assert (Nkind (N) in N_Entity);
3166 return Nodes.Table (N + 1).Flag9;
3169 function Flag31 (N : Node_Id) return Boolean is
3171 pragma Assert (Nkind (N) in N_Entity);
3172 return Nodes.Table (N + 1).Flag10;
3175 function Flag32 (N : Node_Id) return Boolean is
3177 pragma Assert (Nkind (N) in N_Entity);
3178 return Nodes.Table (N + 1).Flag11;
3181 function Flag33 (N : Node_Id) return Boolean is
3183 pragma Assert (Nkind (N) in N_Entity);
3184 return Nodes.Table (N + 1).Flag12;
3187 function Flag34 (N : Node_Id) return Boolean is
3189 pragma Assert (Nkind (N) in N_Entity);
3190 return Nodes.Table (N + 1).Flag13;
3193 function Flag35 (N : Node_Id) return Boolean is
3195 pragma Assert (Nkind (N) in N_Entity);
3196 return Nodes.Table (N + 1).Flag14;
3199 function Flag36 (N : Node_Id) return Boolean is
3201 pragma Assert (Nkind (N) in N_Entity);
3202 return Nodes.Table (N + 1).Flag15;
3205 function Flag37 (N : Node_Id) return Boolean is
3207 pragma Assert (Nkind (N) in N_Entity);
3208 return Nodes.Table (N + 1).Flag16;
3211 function Flag38 (N : Node_Id) return Boolean is
3213 pragma Assert (Nkind (N) in N_Entity);
3214 return Nodes.Table (N + 1).Flag17;
3217 function Flag39 (N : Node_Id) return Boolean is
3219 pragma Assert (Nkind (N) in N_Entity);
3220 return Nodes.Table (N + 1).Flag18;
3223 function Flag40 (N : Node_Id) return Boolean is
3225 pragma Assert (Nkind (N) in N_Entity);
3226 return Nodes.Table (N + 2).In_List;
3229 function Flag41 (N : Node_Id) return Boolean is
3231 pragma Assert (Nkind (N) in N_Entity);
3232 return Nodes.Table (N + 2).Unused_1;
3235 function Flag42 (N : Node_Id) return Boolean is
3237 pragma Assert (Nkind (N) in N_Entity);
3238 return Nodes.Table (N + 2).Rewrite_Ins;
3241 function Flag43 (N : Node_Id) return Boolean is
3243 pragma Assert (Nkind (N) in N_Entity);
3244 return Nodes.Table (N + 2).Analyzed;
3247 function Flag44 (N : Node_Id) return Boolean is
3249 pragma Assert (Nkind (N) in N_Entity);
3250 return Nodes.Table (N + 2).Comes_From_Source;
3253 function Flag45 (N : Node_Id) return Boolean is
3255 pragma Assert (Nkind (N) in N_Entity);
3256 return Nodes.Table (N + 2).Error_Posted;
3259 function Flag46 (N : Node_Id) return Boolean is
3261 pragma Assert (Nkind (N) in N_Entity);
3262 return Nodes.Table (N + 2).Flag4;
3265 function Flag47 (N : Node_Id) return Boolean is
3267 pragma Assert (Nkind (N) in N_Entity);
3268 return Nodes.Table (N + 2).Flag5;
3271 function Flag48 (N : Node_Id) return Boolean is
3273 pragma Assert (Nkind (N) in N_Entity);
3274 return Nodes.Table (N + 2).Flag6;
3277 function Flag49 (N : Node_Id) return Boolean is
3279 pragma Assert (Nkind (N) in N_Entity);
3280 return Nodes.Table (N + 2).Flag7;
3283 function Flag50 (N : Node_Id) return Boolean is
3285 pragma Assert (Nkind (N) in N_Entity);
3286 return Nodes.Table (N + 2).Flag8;
3289 function Flag51 (N : Node_Id) return Boolean is
3291 pragma Assert (Nkind (N) in N_Entity);
3292 return Nodes.Table (N + 2).Flag9;
3295 function Flag52 (N : Node_Id) return Boolean is
3297 pragma Assert (Nkind (N) in N_Entity);
3298 return Nodes.Table (N + 2).Flag10;
3301 function Flag53 (N : Node_Id) return Boolean is
3303 pragma Assert (Nkind (N) in N_Entity);
3304 return Nodes.Table (N + 2).Flag11;
3307 function Flag54 (N : Node_Id) return Boolean is
3309 pragma Assert (Nkind (N) in N_Entity);
3310 return Nodes.Table (N + 2).Flag12;
3313 function Flag55 (N : Node_Id) return Boolean is
3315 pragma Assert (Nkind (N) in N_Entity);
3316 return Nodes.Table (N + 2).Flag13;
3319 function Flag56 (N : Node_Id) return Boolean is
3321 pragma Assert (Nkind (N) in N_Entity);
3322 return Nodes.Table (N + 2).Flag14;
3325 function Flag57 (N : Node_Id) return Boolean is
3327 pragma Assert (Nkind (N) in N_Entity);
3328 return Nodes.Table (N + 2).Flag15;
3331 function Flag58 (N : Node_Id) return Boolean is
3333 pragma Assert (Nkind (N) in N_Entity);
3334 return Nodes.Table (N + 2).Flag16;
3337 function Flag59 (N : Node_Id) return Boolean is
3339 pragma Assert (Nkind (N) in N_Entity);
3340 return Nodes.Table (N + 2).Flag17;
3343 function Flag60 (N : Node_Id) return Boolean is
3345 pragma Assert (Nkind (N) in N_Entity);
3346 return Nodes.Table (N + 2).Flag18;
3349 function Flag61 (N : Node_Id) return Boolean is
3351 pragma Assert (Nkind (N) in N_Entity);
3352 return Nodes.Table (N + 1).Pflag1;
3355 function Flag62 (N : Node_Id) return Boolean is
3357 pragma Assert (Nkind (N) in N_Entity);
3358 return Nodes.Table (N + 1).Pflag2;
3361 function Flag63 (N : Node_Id) return Boolean is
3363 pragma Assert (Nkind (N) in N_Entity);
3364 return Nodes.Table (N + 2).Pflag1;
3367 function Flag64 (N : Node_Id) return Boolean is
3369 pragma Assert (Nkind (N) in N_Entity);
3370 return Nodes.Table (N + 2).Pflag2;
3373 function Flag65 (N : Node_Id) return Boolean is
3375 pragma Assert (Nkind (N) in N_Entity);
3376 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag65;
3379 function Flag66 (N : Node_Id) return Boolean is
3381 pragma Assert (Nkind (N) in N_Entity);
3382 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag66;
3385 function Flag67 (N : Node_Id) return Boolean is
3387 pragma Assert (Nkind (N) in N_Entity);
3388 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag67;
3391 function Flag68 (N : Node_Id) return Boolean is
3393 pragma Assert (Nkind (N) in N_Entity);
3394 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag68;
3397 function Flag69 (N : Node_Id) return Boolean is
3399 pragma Assert (Nkind (N) in N_Entity);
3400 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag69;
3403 function Flag70 (N : Node_Id) return Boolean is
3405 pragma Assert (Nkind (N) in N_Entity);
3406 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag70;
3409 function Flag71 (N : Node_Id) return Boolean is
3411 pragma Assert (Nkind (N) in N_Entity);
3412 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag71;
3415 function Flag72 (N : Node_Id) return Boolean is
3417 pragma Assert (Nkind (N) in N_Entity);
3418 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag72;
3421 function Flag73 (N : Node_Id) return Boolean is
3423 pragma Assert (Nkind (N) in N_Entity);
3424 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag73;
3427 function Flag74 (N : Node_Id) return Boolean is
3429 pragma Assert (Nkind (N) in N_Entity);
3430 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag74;
3433 function Flag75 (N : Node_Id) return Boolean is
3435 pragma Assert (Nkind (N) in N_Entity);
3436 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag75;
3439 function Flag76 (N : Node_Id) return Boolean is
3441 pragma Assert (Nkind (N) in N_Entity);
3442 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag76;
3445 function Flag77 (N : Node_Id) return Boolean is
3447 pragma Assert (Nkind (N) in N_Entity);
3448 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag77;
3451 function Flag78 (N : Node_Id) return Boolean is
3453 pragma Assert (Nkind (N) in N_Entity);
3454 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag78;
3457 function Flag79 (N : Node_Id) return Boolean is
3459 pragma Assert (Nkind (N) in N_Entity);
3460 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag79;
3463 function Flag80 (N : Node_Id) return Boolean is
3465 pragma Assert (Nkind (N) in N_Entity);
3466 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag80;
3469 function Flag81 (N : Node_Id) return Boolean is
3471 pragma Assert (Nkind (N) in N_Entity);
3472 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag81;
3475 function Flag82 (N : Node_Id) return Boolean is
3477 pragma Assert (Nkind (N) in N_Entity);
3478 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag82;
3481 function Flag83 (N : Node_Id) return Boolean is
3483 pragma Assert (Nkind (N) in N_Entity);
3484 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag83;
3487 function Flag84 (N : Node_Id) return Boolean is
3489 pragma Assert (Nkind (N) in N_Entity);
3490 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag84;
3493 function Flag85 (N : Node_Id) return Boolean is
3495 pragma Assert (Nkind (N) in N_Entity);
3496 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag85;
3499 function Flag86 (N : Node_Id) return Boolean is
3501 pragma Assert (Nkind (N) in N_Entity);
3502 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag86;
3505 function Flag87 (N : Node_Id) return Boolean is
3507 pragma Assert (Nkind (N) in N_Entity);
3508 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag87;
3511 function Flag88 (N : Node_Id) return Boolean is
3513 pragma Assert (Nkind (N) in N_Entity);
3514 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag88;
3517 function Flag89 (N : Node_Id) return Boolean is
3519 pragma Assert (Nkind (N) in N_Entity);
3520 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag89;
3523 function Flag90 (N : Node_Id) return Boolean is
3525 pragma Assert (Nkind (N) in N_Entity);
3526 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag90;
3529 function Flag91 (N : Node_Id) return Boolean is
3531 pragma Assert (Nkind (N) in N_Entity);
3532 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag91;
3535 function Flag92 (N : Node_Id) return Boolean is
3537 pragma Assert (Nkind (N) in N_Entity);
3538 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag92;
3541 function Flag93 (N : Node_Id) return Boolean is
3543 pragma Assert (Nkind (N) in N_Entity);
3544 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag93;
3547 function Flag94 (N : Node_Id) return Boolean is
3549 pragma Assert (Nkind (N) in N_Entity);
3550 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag94;
3553 function Flag95 (N : Node_Id) return Boolean is
3555 pragma Assert (Nkind (N) in N_Entity);
3556 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag95;
3559 function Flag96 (N : Node_Id) return Boolean is
3561 pragma Assert (Nkind (N) in N_Entity);
3562 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag96;
3565 function Flag97 (N : Node_Id) return Boolean is
3567 pragma Assert (Nkind (N) in N_Entity);
3568 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag97;
3571 function Flag98 (N : Node_Id) return Boolean is
3573 pragma Assert (Nkind (N) in N_Entity);
3574 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag98;
3577 function Flag99 (N : Node_Id) return Boolean is
3579 pragma Assert (Nkind (N) in N_Entity);
3580 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag99;
3583 function Flag100 (N : Node_Id) return Boolean is
3585 pragma Assert (Nkind (N) in N_Entity);
3586 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag100;
3589 function Flag101 (N : Node_Id) return Boolean is
3591 pragma Assert (Nkind (N) in N_Entity);
3592 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag101;
3595 function Flag102 (N : Node_Id) return Boolean is
3597 pragma Assert (Nkind (N) in N_Entity);
3598 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag102;
3601 function Flag103 (N : Node_Id) return Boolean is
3603 pragma Assert (Nkind (N) in N_Entity);
3604 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag103;
3607 function Flag104 (N : Node_Id) return Boolean is
3609 pragma Assert (Nkind (N) in N_Entity);
3610 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag104;
3613 function Flag105 (N : Node_Id) return Boolean is
3615 pragma Assert (Nkind (N) in N_Entity);
3616 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag105;
3619 function Flag106 (N : Node_Id) return Boolean is
3621 pragma Assert (Nkind (N) in N_Entity);
3622 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag106;
3625 function Flag107 (N : Node_Id) return Boolean is
3627 pragma Assert (Nkind (N) in N_Entity);
3628 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag107;
3631 function Flag108 (N : Node_Id) return Boolean is
3633 pragma Assert (Nkind (N) in N_Entity);
3634 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag108;
3637 function Flag109 (N : Node_Id) return Boolean is
3639 pragma Assert (Nkind (N) in N_Entity);
3640 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag109;
3643 function Flag110 (N : Node_Id) return Boolean is
3645 pragma Assert (Nkind (N) in N_Entity);
3646 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag110;
3649 function Flag111 (N : Node_Id) return Boolean is
3651 pragma Assert (Nkind (N) in N_Entity);
3652 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag111;
3655 function Flag112 (N : Node_Id) return Boolean is
3657 pragma Assert (Nkind (N) in N_Entity);
3658 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag112;
3661 function Flag113 (N : Node_Id) return Boolean is
3663 pragma Assert (Nkind (N) in N_Entity);
3664 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag113;
3667 function Flag114 (N : Node_Id) return Boolean is
3669 pragma Assert (Nkind (N) in N_Entity);
3670 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag114;
3673 function Flag115 (N : Node_Id) return Boolean is
3675 pragma Assert (Nkind (N) in N_Entity);
3676 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag115;
3679 function Flag116 (N : Node_Id) return Boolean is
3681 pragma Assert (Nkind (N) in N_Entity);
3682 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag116;
3685 function Flag117 (N : Node_Id) return Boolean is
3687 pragma Assert (Nkind (N) in N_Entity);
3688 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag117;
3691 function Flag118 (N : Node_Id) return Boolean is
3693 pragma Assert (Nkind (N) in N_Entity);
3694 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag118;
3697 function Flag119 (N : Node_Id) return Boolean is
3699 pragma Assert (Nkind (N) in N_Entity);
3700 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag119;
3703 function Flag120 (N : Node_Id) return Boolean is
3705 pragma Assert (Nkind (N) in N_Entity);
3706 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag120;
3709 function Flag121 (N : Node_Id) return Boolean is
3711 pragma Assert (Nkind (N) in N_Entity);
3712 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag121;
3715 function Flag122 (N : Node_Id) return Boolean is
3717 pragma Assert (Nkind (N) in N_Entity);
3718 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag122;
3721 function Flag123 (N : Node_Id) return Boolean is
3723 pragma Assert (Nkind (N) in N_Entity);
3724 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag123;
3727 function Flag124 (N : Node_Id) return Boolean is
3729 pragma Assert (Nkind (N) in N_Entity);
3730 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag124;
3733 function Flag125 (N : Node_Id) return Boolean is
3735 pragma Assert (Nkind (N) in N_Entity);
3736 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag125;
3739 function Flag126 (N : Node_Id) return Boolean is
3741 pragma Assert (Nkind (N) in N_Entity);
3742 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag126;
3745 function Flag127 (N : Node_Id) return Boolean is
3747 pragma Assert (Nkind (N) in N_Entity);
3748 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag127;
3751 function Flag128 (N : Node_Id) return Boolean is
3753 pragma Assert (Nkind (N) in N_Entity);
3754 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag128;
3757 function Flag129 (N : Node_Id) return Boolean is
3759 pragma Assert (Nkind (N) in N_Entity);
3760 return Nodes.Table (N + 3).In_List;
3763 function Flag130 (N : Node_Id) return Boolean is
3765 pragma Assert (Nkind (N) in N_Entity);
3766 return Nodes.Table (N + 3).Unused_1;
3769 function Flag131 (N : Node_Id) return Boolean is
3771 pragma Assert (Nkind (N) in N_Entity);
3772 return Nodes.Table (N + 3).Rewrite_Ins;
3775 function Flag132 (N : Node_Id) return Boolean is
3777 pragma Assert (Nkind (N) in N_Entity);
3778 return Nodes.Table (N + 3).Analyzed;
3781 function Flag133 (N : Node_Id) return Boolean is
3783 pragma Assert (Nkind (N) in N_Entity);
3784 return Nodes.Table (N + 3).Comes_From_Source;
3787 function Flag134 (N : Node_Id) return Boolean is
3789 pragma Assert (Nkind (N) in N_Entity);
3790 return Nodes.Table (N + 3).Error_Posted;
3793 function Flag135 (N : Node_Id) return Boolean is
3795 pragma Assert (Nkind (N) in N_Entity);
3796 return Nodes.Table (N + 3).Flag4;
3799 function Flag136 (N : Node_Id) return Boolean is
3801 pragma Assert (Nkind (N) in N_Entity);
3802 return Nodes.Table (N + 3).Flag5;
3805 function Flag137 (N : Node_Id) return Boolean is
3807 pragma Assert (Nkind (N) in N_Entity);
3808 return Nodes.Table (N + 3).Flag6;
3811 function Flag138 (N : Node_Id) return Boolean is
3813 pragma Assert (Nkind (N) in N_Entity);
3814 return Nodes.Table (N + 3).Flag7;
3817 function Flag139 (N : Node_Id) return Boolean is
3819 pragma Assert (Nkind (N) in N_Entity);
3820 return Nodes.Table (N + 3).Flag8;
3823 function Flag140 (N : Node_Id) return Boolean is
3825 pragma Assert (Nkind (N) in N_Entity);
3826 return Nodes.Table (N + 3).Flag9;
3829 function Flag141 (N : Node_Id) return Boolean is
3831 pragma Assert (Nkind (N) in N_Entity);
3832 return Nodes.Table (N + 3).Flag10;
3835 function Flag142 (N : Node_Id) return Boolean is
3837 pragma Assert (Nkind (N) in N_Entity);
3838 return Nodes.Table (N + 3).Flag11;
3841 function Flag143 (N : Node_Id) return Boolean is
3843 pragma Assert (Nkind (N) in N_Entity);
3844 return Nodes.Table (N + 3).Flag12;
3847 function Flag144 (N : Node_Id) return Boolean is
3849 pragma Assert (Nkind (N) in N_Entity);
3850 return Nodes.Table (N + 3).Flag13;
3853 function Flag145 (N : Node_Id) return Boolean is
3855 pragma Assert (Nkind (N) in N_Entity);
3856 return Nodes.Table (N + 3).Flag14;
3859 function Flag146 (N : Node_Id) return Boolean is
3861 pragma Assert (Nkind (N) in N_Entity);
3862 return Nodes.Table (N + 3).Flag15;
3865 function Flag147 (N : Node_Id) return Boolean is
3867 pragma Assert (Nkind (N) in N_Entity);
3868 return Nodes.Table (N + 3).Flag16;
3871 function Flag148 (N : Node_Id) return Boolean is
3873 pragma Assert (Nkind (N) in N_Entity);
3874 return Nodes.Table (N + 3).Flag17;
3877 function Flag149 (N : Node_Id) return Boolean is
3879 pragma Assert (Nkind (N) in N_Entity);
3880 return Nodes.Table (N + 3).Flag18;
3883 function Flag150 (N : Node_Id) return Boolean is
3885 pragma Assert (Nkind (N) in N_Entity);
3886 return Nodes.Table (N + 3).Pflag1;
3889 function Flag151 (N : Node_Id) return Boolean is
3891 pragma Assert (Nkind (N) in N_Entity);
3892 return Nodes.Table (N + 3).Pflag2;
3895 function Flag152 (N : Node_Id) return Boolean is
3897 pragma Assert (Nkind (N) in N_Entity);
3898 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag152;
3901 function Flag153 (N : Node_Id) return Boolean is
3903 pragma Assert (Nkind (N) in N_Entity);
3904 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag153;
3907 function Flag154 (N : Node_Id) return Boolean is
3909 pragma Assert (Nkind (N) in N_Entity);
3910 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag154;
3913 function Flag155 (N : Node_Id) return Boolean is
3915 pragma Assert (Nkind (N) in N_Entity);
3916 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag155;
3919 function Flag156 (N : Node_Id) return Boolean is
3921 pragma Assert (Nkind (N) in N_Entity);
3922 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag156;
3925 function Flag157 (N : Node_Id) return Boolean is
3927 pragma Assert (Nkind (N) in N_Entity);
3928 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag157;
3931 function Flag158 (N : Node_Id) return Boolean is
3933 pragma Assert (Nkind (N) in N_Entity);
3934 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag158;
3937 function Flag159 (N : Node_Id) return Boolean is
3939 pragma Assert (Nkind (N) in N_Entity);
3940 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag159;
3943 function Flag160 (N : Node_Id) return Boolean is
3945 pragma Assert (Nkind (N) in N_Entity);
3946 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag160;
3949 function Flag161 (N : Node_Id) return Boolean is
3951 pragma Assert (Nkind (N) in N_Entity);
3952 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag161;
3955 function Flag162 (N : Node_Id) return Boolean is
3957 pragma Assert (Nkind (N) in N_Entity);
3958 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag162;
3961 function Flag163 (N : Node_Id) return Boolean is
3963 pragma Assert (Nkind (N) in N_Entity);
3964 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag163;
3967 function Flag164 (N : Node_Id) return Boolean is
3969 pragma Assert (Nkind (N) in N_Entity);
3970 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag164;
3973 function Flag165 (N : Node_Id) return Boolean is
3975 pragma Assert (Nkind (N) in N_Entity);
3976 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag165;
3979 function Flag166 (N : Node_Id) return Boolean is
3981 pragma Assert (Nkind (N) in N_Entity);
3982 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag166;
3985 function Flag167 (N : Node_Id) return Boolean is
3987 pragma Assert (Nkind (N) in N_Entity);
3988 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag167;
3991 function Flag168 (N : Node_Id) return Boolean is
3993 pragma Assert (Nkind (N) in N_Entity);
3994 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag168;
3997 function Flag169 (N : Node_Id) return Boolean is
3999 pragma Assert (Nkind (N) in N_Entity);
4000 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag169;
4003 function Flag170 (N : Node_Id) return Boolean is
4005 pragma Assert (Nkind (N) in N_Entity);
4006 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag170;
4009 function Flag171 (N : Node_Id) return Boolean is
4011 pragma Assert (Nkind (N) in N_Entity);
4012 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag171;
4015 function Flag172 (N : Node_Id) return Boolean is
4017 pragma Assert (Nkind (N) in N_Entity);
4018 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag172;
4021 function Flag173 (N : Node_Id) return Boolean is
4023 pragma Assert (Nkind (N) in N_Entity);
4024 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag173;
4027 function Flag174 (N : Node_Id) return Boolean is
4029 pragma Assert (Nkind (N) in N_Entity);
4030 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag174;
4033 function Flag175 (N : Node_Id) return Boolean is
4035 pragma Assert (Nkind (N) in N_Entity);
4036 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag175;
4039 function Flag176 (N : Node_Id) return Boolean is
4041 pragma Assert (Nkind (N) in N_Entity);
4042 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag176;
4045 function Flag177 (N : Node_Id) return Boolean is
4047 pragma Assert (Nkind (N) in N_Entity);
4048 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag177;
4051 function Flag178 (N : Node_Id) return Boolean is
4053 pragma Assert (Nkind (N) in N_Entity);
4054 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag178;
4057 function Flag179 (N : Node_Id) return Boolean is
4059 pragma Assert (Nkind (N) in N_Entity);
4060 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag179;
4063 function Flag180 (N : Node_Id) return Boolean is
4065 pragma Assert (Nkind (N) in N_Entity);
4066 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag180;
4069 function Flag181 (N : Node_Id) return Boolean is
4071 pragma Assert (Nkind (N) in N_Entity);
4072 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag181;
4075 function Flag182 (N : Node_Id) return Boolean is
4077 pragma Assert (Nkind (N) in N_Entity);
4078 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag182;
4081 function Flag183 (N : Node_Id) return Boolean is
4083 pragma Assert (Nkind (N) in N_Entity);
4084 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag183;
4087 procedure Set_Nkind (N : Node_Id; Val : Node_Kind) is
4089 pragma Assert (N in Nodes.First .. Nodes.Last);
4090 Nodes.Table (N).Nkind := Val;
4093 procedure Set_Field1 (N : Node_Id; Val : Union_Id) is
4095 pragma Assert (N in Nodes.First .. Nodes.Last);
4096 Nodes.Table (N).Field1 := Val;
4099 procedure Set_Field2 (N : Node_Id; Val : Union_Id) is
4101 pragma Assert (N in Nodes.First .. Nodes.Last);
4102 Nodes.Table (N).Field2 := Val;
4105 procedure Set_Field3 (N : Node_Id; Val : Union_Id) is
4107 pragma Assert (N in Nodes.First .. Nodes.Last);
4108 Nodes.Table (N).Field3 := Val;
4111 procedure Set_Field4 (N : Node_Id; Val : Union_Id) is
4113 pragma Assert (N in Nodes.First .. Nodes.Last);
4114 Nodes.Table (N).Field4 := Val;
4117 procedure Set_Field5 (N : Node_Id; Val : Union_Id) is
4119 pragma Assert (N in Nodes.First .. Nodes.Last);
4120 Nodes.Table (N).Field5 := Val;
4123 procedure Set_Field6 (N : Node_Id; Val : Union_Id) is
4125 pragma Assert (Nkind (N) in N_Entity);
4126 Nodes.Table (N + 1).Field6 := Val;
4129 procedure Set_Field7 (N : Node_Id; Val : Union_Id) is
4131 pragma Assert (Nkind (N) in N_Entity);
4132 Nodes.Table (N + 1).Field7 := Val;
4135 procedure Set_Field8 (N : Node_Id; Val : Union_Id) is
4137 pragma Assert (Nkind (N) in N_Entity);
4138 Nodes.Table (N + 1).Field8 := Val;
4141 procedure Set_Field9 (N : Node_Id; Val : Union_Id) is
4143 pragma Assert (Nkind (N) in N_Entity);
4144 Nodes.Table (N + 1).Field9 := Val;
4147 procedure Set_Field10 (N : Node_Id; Val : Union_Id) is
4149 pragma Assert (Nkind (N) in N_Entity);
4150 Nodes.Table (N + 1).Field10 := Val;
4153 procedure Set_Field11 (N : Node_Id; Val : Union_Id) is
4155 pragma Assert (Nkind (N) in N_Entity);
4156 Nodes.Table (N + 1).Field11 := Val;
4159 procedure Set_Field12 (N : Node_Id; Val : Union_Id) is
4161 pragma Assert (Nkind (N) in N_Entity);
4162 Nodes.Table (N + 1).Field12 := Val;
4165 procedure Set_Field13 (N : Node_Id; Val : Union_Id) is
4167 pragma Assert (Nkind (N) in N_Entity);
4168 Nodes.Table (N + 2).Field6 := Val;
4171 procedure Set_Field14 (N : Node_Id; Val : Union_Id) is
4173 pragma Assert (Nkind (N) in N_Entity);
4174 Nodes.Table (N + 2).Field7 := Val;
4177 procedure Set_Field15 (N : Node_Id; Val : Union_Id) is
4179 pragma Assert (Nkind (N) in N_Entity);
4180 Nodes.Table (N + 2).Field8 := Val;
4183 procedure Set_Field16 (N : Node_Id; Val : Union_Id) is
4185 pragma Assert (Nkind (N) in N_Entity);
4186 Nodes.Table (N + 2).Field9 := Val;
4189 procedure Set_Field17 (N : Node_Id; Val : Union_Id) is
4191 pragma Assert (Nkind (N) in N_Entity);
4192 Nodes.Table (N + 2).Field10 := Val;
4195 procedure Set_Field18 (N : Node_Id; Val : Union_Id) is
4197 pragma Assert (Nkind (N) in N_Entity);
4198 Nodes.Table (N + 2).Field11 := Val;
4201 procedure Set_Field19 (N : Node_Id; Val : Union_Id) is
4203 pragma Assert (Nkind (N) in N_Entity);
4204 Nodes.Table (N + 3).Field6 := Val;
4207 procedure Set_Field20 (N : Node_Id; Val : Union_Id) is
4209 pragma Assert (Nkind (N) in N_Entity);
4210 Nodes.Table (N + 3).Field7 := Val;
4213 procedure Set_Field21 (N : Node_Id; Val : Union_Id) is
4215 pragma Assert (Nkind (N) in N_Entity);
4216 Nodes.Table (N + 3).Field8 := Val;
4219 procedure Set_Field22 (N : Node_Id; Val : Union_Id) is
4221 pragma Assert (Nkind (N) in N_Entity);
4222 Nodes.Table (N + 3).Field9 := Val;
4225 procedure Set_Field23 (N : Node_Id; Val : Union_Id) is
4227 pragma Assert (Nkind (N) in N_Entity);
4228 Nodes.Table (N + 3).Field10 := Val;
4231 procedure Set_Node1 (N : Node_Id; Val : Node_Id) is
4233 pragma Assert (N in Nodes.First .. Nodes.Last);
4234 Nodes.Table (N).Field1 := Union_Id (Val);
4237 procedure Set_Node2 (N : Node_Id; Val : Node_Id) is
4239 pragma Assert (N in Nodes.First .. Nodes.Last);
4240 Nodes.Table (N).Field2 := Union_Id (Val);
4243 procedure Set_Node3 (N : Node_Id; Val : Node_Id) is
4245 pragma Assert (N in Nodes.First .. Nodes.Last);
4246 Nodes.Table (N).Field3 := Union_Id (Val);
4249 procedure Set_Node4 (N : Node_Id; Val : Node_Id) is
4251 pragma Assert (N in Nodes.First .. Nodes.Last);
4252 Nodes.Table (N).Field4 := Union_Id (Val);
4255 procedure Set_Node5 (N : Node_Id; Val : Node_Id) is
4257 pragma Assert (N in Nodes.First .. Nodes.Last);
4258 Nodes.Table (N).Field5 := Union_Id (Val);
4261 procedure Set_Node6 (N : Node_Id; Val : Node_Id) is
4263 pragma Assert (Nkind (N) in N_Entity);
4264 Nodes.Table (N + 1).Field6 := Union_Id (Val);
4267 procedure Set_Node7 (N : Node_Id; Val : Node_Id) is
4269 pragma Assert (Nkind (N) in N_Entity);
4270 Nodes.Table (N + 1).Field7 := Union_Id (Val);
4273 procedure Set_Node8 (N : Node_Id; Val : Node_Id) is
4275 pragma Assert (Nkind (N) in N_Entity);
4276 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4279 procedure Set_Node9 (N : Node_Id; Val : Node_Id) is
4281 pragma Assert (Nkind (N) in N_Entity);
4282 Nodes.Table (N + 1).Field9 := Union_Id (Val);
4285 procedure Set_Node10 (N : Node_Id; Val : Node_Id) is
4287 pragma Assert (Nkind (N) in N_Entity);
4288 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4291 procedure Set_Node11 (N : Node_Id; Val : Node_Id) is
4293 pragma Assert (Nkind (N) in N_Entity);
4294 Nodes.Table (N + 1).Field11 := Union_Id (Val);
4297 procedure Set_Node12 (N : Node_Id; Val : Node_Id) is
4299 pragma Assert (Nkind (N) in N_Entity);
4300 Nodes.Table (N + 1).Field12 := Union_Id (Val);
4303 procedure Set_Node13 (N : Node_Id; Val : Node_Id) is
4305 pragma Assert (Nkind (N) in N_Entity);
4306 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4309 procedure Set_Node14 (N : Node_Id; Val : Node_Id) is
4311 pragma Assert (Nkind (N) in N_Entity);
4312 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4315 procedure Set_Node15 (N : Node_Id; Val : Node_Id) is
4317 pragma Assert (Nkind (N) in N_Entity);
4318 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4321 procedure Set_Node16 (N : Node_Id; Val : Node_Id) is
4323 pragma Assert (Nkind (N) in N_Entity);
4324 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4327 procedure Set_Node17 (N : Node_Id; Val : Node_Id) is
4329 pragma Assert (Nkind (N) in N_Entity);
4330 Nodes.Table (N + 2).Field10 := Union_Id (Val);
4333 procedure Set_Node18 (N : Node_Id; Val : Node_Id) is
4335 pragma Assert (Nkind (N) in N_Entity);
4336 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4339 procedure Set_Node19 (N : Node_Id; Val : Node_Id) is
4341 pragma Assert (Nkind (N) in N_Entity);
4342 Nodes.Table (N + 3).Field6 := Union_Id (Val);
4345 procedure Set_Node20 (N : Node_Id; Val : Node_Id) is
4347 pragma Assert (Nkind (N) in N_Entity);
4348 Nodes.Table (N + 3).Field7 := Union_Id (Val);
4351 procedure Set_Node21 (N : Node_Id; Val : Node_Id) is
4353 pragma Assert (Nkind (N) in N_Entity);
4354 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4357 procedure Set_Node22 (N : Node_Id; Val : Node_Id) is
4359 pragma Assert (Nkind (N) in N_Entity);
4360 Nodes.Table (N + 3).Field9 := Union_Id (Val);
4363 procedure Set_Node23 (N : Node_Id; Val : Node_Id) is
4365 pragma Assert (Nkind (N) in N_Entity);
4366 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4369 procedure Set_List1 (N : Node_Id; Val : List_Id) is
4371 pragma Assert (N in Nodes.First .. Nodes.Last);
4372 Nodes.Table (N).Field1 := Union_Id (Val);
4375 procedure Set_List2 (N : Node_Id; Val : List_Id) is
4377 pragma Assert (N in Nodes.First .. Nodes.Last);
4378 Nodes.Table (N).Field2 := Union_Id (Val);
4381 procedure Set_List3 (N : Node_Id; Val : List_Id) is
4383 pragma Assert (N in Nodes.First .. Nodes.Last);
4384 Nodes.Table (N).Field3 := Union_Id (Val);
4387 procedure Set_List4 (N : Node_Id; Val : List_Id) is
4389 pragma Assert (N in Nodes.First .. Nodes.Last);
4390 Nodes.Table (N).Field4 := Union_Id (Val);
4393 procedure Set_List5 (N : Node_Id; Val : List_Id) is
4395 pragma Assert (N in Nodes.First .. Nodes.Last);
4396 Nodes.Table (N).Field5 := Union_Id (Val);
4399 procedure Set_List10 (N : Node_Id; Val : List_Id) is
4401 pragma Assert (Nkind (N) in N_Entity);
4402 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4405 procedure Set_List14 (N : Node_Id; Val : List_Id) is
4407 pragma Assert (Nkind (N) in N_Entity);
4408 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4411 procedure Set_Elist2 (N : Node_Id; Val : Elist_Id) is
4413 Nodes.Table (N).Field2 := Union_Id (Val);
4416 procedure Set_Elist3 (N : Node_Id; Val : Elist_Id) is
4418 Nodes.Table (N).Field3 := Union_Id (Val);
4421 procedure Set_Elist4 (N : Node_Id; Val : Elist_Id) is
4423 Nodes.Table (N).Field4 := Union_Id (Val);
4426 procedure Set_Elist8 (N : Node_Id; Val : Elist_Id) is
4428 pragma Assert (Nkind (N) in N_Entity);
4429 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4432 procedure Set_Elist13 (N : Node_Id; Val : Elist_Id) is
4434 pragma Assert (Nkind (N) in N_Entity);
4435 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4438 procedure Set_Elist15 (N : Node_Id; Val : Elist_Id) is
4440 pragma Assert (Nkind (N) in N_Entity);
4441 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4444 procedure Set_Elist16 (N : Node_Id; Val : Elist_Id) is
4446 pragma Assert (Nkind (N) in N_Entity);
4447 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4450 procedure Set_Elist18 (N : Node_Id; Val : Elist_Id) is
4452 pragma Assert (Nkind (N) in N_Entity);
4453 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4456 procedure Set_Elist21 (N : Node_Id; Val : Elist_Id) is
4458 pragma Assert (Nkind (N) in N_Entity);
4459 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4462 procedure Set_Elist23 (N : Node_Id; Val : Elist_Id) is
4464 pragma Assert (Nkind (N) in N_Entity);
4465 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4468 procedure Set_Name1 (N : Node_Id; Val : Name_Id) is
4470 pragma Assert (N in Nodes.First .. Nodes.Last);
4471 Nodes.Table (N).Field1 := Union_Id (Val);
4474 procedure Set_Name2 (N : Node_Id; Val : Name_Id) is
4476 pragma Assert (N in Nodes.First .. Nodes.Last);
4477 Nodes.Table (N).Field2 := Union_Id (Val);
4480 procedure Set_Str3 (N : Node_Id; Val : String_Id) is
4482 pragma Assert (N in Nodes.First .. Nodes.Last);
4483 Nodes.Table (N).Field3 := Union_Id (Val);
4486 procedure Set_Uint3 (N : Node_Id; Val : Uint) is
4488 pragma Assert (N in Nodes.First .. Nodes.Last);
4489 Nodes.Table (N).Field3 := To_Union (Val);
4492 procedure Set_Uint4 (N : Node_Id; Val : Uint) is
4494 pragma Assert (N in Nodes.First .. Nodes.Last);
4495 Nodes.Table (N).Field4 := To_Union (Val);
4498 procedure Set_Uint5 (N : Node_Id; Val : Uint) is
4500 pragma Assert (N in Nodes.First .. Nodes.Last);
4501 Nodes.Table (N).Field5 := To_Union (Val);
4504 procedure Set_Uint8 (N : Node_Id; Val : Uint) is
4506 pragma Assert (Nkind (N) in N_Entity);
4507 Nodes.Table (N + 1).Field8 := To_Union (Val);
4510 procedure Set_Uint9 (N : Node_Id; Val : Uint) is
4512 pragma Assert (Nkind (N) in N_Entity);
4513 Nodes.Table (N + 1).Field9 := To_Union (Val);
4516 procedure Set_Uint10 (N : Node_Id; Val : Uint) is
4518 pragma Assert (Nkind (N) in N_Entity);
4519 Nodes.Table (N + 1).Field10 := To_Union (Val);
4522 procedure Set_Uint11 (N : Node_Id; Val : Uint) is
4524 pragma Assert (Nkind (N) in N_Entity);
4525 Nodes.Table (N + 1).Field11 := To_Union (Val);
4528 procedure Set_Uint12 (N : Node_Id; Val : Uint) is
4530 pragma Assert (Nkind (N) in N_Entity);
4531 Nodes.Table (N + 1).Field12 := To_Union (Val);
4534 procedure Set_Uint13 (N : Node_Id; Val : Uint) is
4536 pragma Assert (Nkind (N) in N_Entity);
4537 Nodes.Table (N + 2).Field6 := To_Union (Val);
4540 procedure Set_Uint14 (N : Node_Id; Val : Uint) is
4542 pragma Assert (Nkind (N) in N_Entity);
4543 Nodes.Table (N + 2).Field7 := To_Union (Val);
4546 procedure Set_Uint15 (N : Node_Id; Val : Uint) is
4548 pragma Assert (Nkind (N) in N_Entity);
4549 Nodes.Table (N + 2).Field8 := To_Union (Val);
4552 procedure Set_Uint16 (N : Node_Id; Val : Uint) is
4554 pragma Assert (Nkind (N) in N_Entity);
4555 Nodes.Table (N + 2).Field9 := To_Union (Val);
4558 procedure Set_Uint17 (N : Node_Id; Val : Uint) is
4560 pragma Assert (Nkind (N) in N_Entity);
4561 Nodes.Table (N + 2).Field10 := To_Union (Val);
4564 procedure Set_Uint22 (N : Node_Id; Val : Uint) is
4566 pragma Assert (Nkind (N) in N_Entity);
4567 Nodes.Table (N + 3).Field9 := To_Union (Val);
4570 procedure Set_Ureal3 (N : Node_Id; Val : Ureal) is
4572 pragma Assert (N in Nodes.First .. Nodes.Last);
4573 Nodes.Table (N).Field3 := To_Union (Val);
4576 procedure Set_Ureal18 (N : Node_Id; Val : Ureal) is
4578 pragma Assert (Nkind (N) in N_Entity);
4579 Nodes.Table (N + 2).Field11 := To_Union (Val);
4582 procedure Set_Ureal21 (N : Node_Id; Val : Ureal) is
4584 pragma Assert (Nkind (N) in N_Entity);
4585 Nodes.Table (N + 3).Field8 := To_Union (Val);
4588 procedure Set_Char_Code2 (N : Node_Id; Val : Char_Code) is
4590 pragma Assert (N in Nodes.First .. Nodes.Last);
4591 Nodes.Table (N).Field2 := Union_Id (Val) + Char_Code_Bias;
4594 procedure Set_Flag4 (N : Node_Id; Val : Boolean) is
4596 pragma Assert (N in Nodes.First .. Nodes.Last);
4597 Nodes.Table (N).Flag4 := Val;
4600 procedure Set_Flag5 (N : Node_Id; Val : Boolean) is
4602 pragma Assert (N in Nodes.First .. Nodes.Last);
4603 Nodes.Table (N).Flag5 := Val;
4606 procedure Set_Flag6 (N : Node_Id; Val : Boolean) is
4608 pragma Assert (N in Nodes.First .. Nodes.Last);
4609 Nodes.Table (N).Flag6 := Val;
4612 procedure Set_Flag7 (N : Node_Id; Val : Boolean) is
4614 pragma Assert (N in Nodes.First .. Nodes.Last);
4615 Nodes.Table (N).Flag7 := Val;
4618 procedure Set_Flag8 (N : Node_Id; Val : Boolean) is
4620 pragma Assert (N in Nodes.First .. Nodes.Last);
4621 Nodes.Table (N).Flag8 := Val;
4624 procedure Set_Flag9 (N : Node_Id; Val : Boolean) is
4626 pragma Assert (N in Nodes.First .. Nodes.Last);
4627 Nodes.Table (N).Flag9 := Val;
4630 procedure Set_Flag10 (N : Node_Id; Val : Boolean) is
4632 pragma Assert (N in Nodes.First .. Nodes.Last);
4633 Nodes.Table (N).Flag10 := Val;
4636 procedure Set_Flag11 (N : Node_Id; Val : Boolean) is
4638 pragma Assert (N in Nodes.First .. Nodes.Last);
4639 Nodes.Table (N).Flag11 := Val;
4642 procedure Set_Flag12 (N : Node_Id; Val : Boolean) is
4644 pragma Assert (N in Nodes.First .. Nodes.Last);
4645 Nodes.Table (N).Flag12 := Val;
4648 procedure Set_Flag13 (N : Node_Id; Val : Boolean) is
4650 pragma Assert (N in Nodes.First .. Nodes.Last);
4651 Nodes.Table (N).Flag13 := Val;
4654 procedure Set_Flag14 (N : Node_Id; Val : Boolean) is
4656 pragma Assert (N in Nodes.First .. Nodes.Last);
4657 Nodes.Table (N).Flag14 := Val;
4660 procedure Set_Flag15 (N : Node_Id; Val : Boolean) is
4662 pragma Assert (N in Nodes.First .. Nodes.Last);
4663 Nodes.Table (N).Flag15 := Val;
4666 procedure Set_Flag16 (N : Node_Id; Val : Boolean) is
4668 pragma Assert (N in Nodes.First .. Nodes.Last);
4669 Nodes.Table (N).Flag16 := Val;
4672 procedure Set_Flag17 (N : Node_Id; Val : Boolean) is
4674 pragma Assert (N in Nodes.First .. Nodes.Last);
4675 Nodes.Table (N).Flag17 := Val;
4678 procedure Set_Flag18 (N : Node_Id; Val : Boolean) is
4680 pragma Assert (N in Nodes.First .. Nodes.Last);
4681 Nodes.Table (N).Flag18 := Val;
4684 procedure Set_Flag19 (N : Node_Id; Val : Boolean) is
4686 pragma Assert (Nkind (N) in N_Entity);
4687 Nodes.Table (N + 1).In_List := Val;
4690 procedure Set_Flag20 (N : Node_Id; Val : Boolean) is
4692 pragma Assert (Nkind (N) in N_Entity);
4693 Nodes.Table (N + 1).Unused_1 := Val;
4696 procedure Set_Flag21 (N : Node_Id; Val : Boolean) is
4698 pragma Assert (Nkind (N) in N_Entity);
4699 Nodes.Table (N + 1).Rewrite_Ins := Val;
4702 procedure Set_Flag22 (N : Node_Id; Val : Boolean) is
4704 pragma Assert (Nkind (N) in N_Entity);
4705 Nodes.Table (N + 1).Analyzed := Val;
4708 procedure Set_Flag23 (N : Node_Id; Val : Boolean) is
4710 pragma Assert (Nkind (N) in N_Entity);
4711 Nodes.Table (N + 1).Comes_From_Source := Val;
4714 procedure Set_Flag24 (N : Node_Id; Val : Boolean) is
4716 pragma Assert (Nkind (N) in N_Entity);
4717 Nodes.Table (N + 1).Error_Posted := Val;
4720 procedure Set_Flag25 (N : Node_Id; Val : Boolean) is
4722 pragma Assert (Nkind (N) in N_Entity);
4723 Nodes.Table (N + 1).Flag4 := Val;
4726 procedure Set_Flag26 (N : Node_Id; Val : Boolean) is
4728 pragma Assert (Nkind (N) in N_Entity);
4729 Nodes.Table (N + 1).Flag5 := Val;
4732 procedure Set_Flag27 (N : Node_Id; Val : Boolean) is
4734 pragma Assert (Nkind (N) in N_Entity);
4735 Nodes.Table (N + 1).Flag6 := Val;
4738 procedure Set_Flag28 (N : Node_Id; Val : Boolean) is
4740 pragma Assert (Nkind (N) in N_Entity);
4741 Nodes.Table (N + 1).Flag7 := Val;
4744 procedure Set_Flag29 (N : Node_Id; Val : Boolean) is
4746 pragma Assert (Nkind (N) in N_Entity);
4747 Nodes.Table (N + 1).Flag8 := Val;
4750 procedure Set_Flag30 (N : Node_Id; Val : Boolean) is
4752 pragma Assert (Nkind (N) in N_Entity);
4753 Nodes.Table (N + 1).Flag9 := Val;
4756 procedure Set_Flag31 (N : Node_Id; Val : Boolean) is
4758 pragma Assert (Nkind (N) in N_Entity);
4759 Nodes.Table (N + 1).Flag10 := Val;
4762 procedure Set_Flag32 (N : Node_Id; Val : Boolean) is
4764 pragma Assert (Nkind (N) in N_Entity);
4765 Nodes.Table (N + 1).Flag11 := Val;
4768 procedure Set_Flag33 (N : Node_Id; Val : Boolean) is
4770 pragma Assert (Nkind (N) in N_Entity);
4771 Nodes.Table (N + 1).Flag12 := Val;
4774 procedure Set_Flag34 (N : Node_Id; Val : Boolean) is
4776 pragma Assert (Nkind (N) in N_Entity);
4777 Nodes.Table (N + 1).Flag13 := Val;
4780 procedure Set_Flag35 (N : Node_Id; Val : Boolean) is
4782 pragma Assert (Nkind (N) in N_Entity);
4783 Nodes.Table (N + 1).Flag14 := Val;
4786 procedure Set_Flag36 (N : Node_Id; Val : Boolean) is
4788 pragma Assert (Nkind (N) in N_Entity);
4789 Nodes.Table (N + 1).Flag15 := Val;
4792 procedure Set_Flag37 (N : Node_Id; Val : Boolean) is
4794 pragma Assert (Nkind (N) in N_Entity);
4795 Nodes.Table (N + 1).Flag16 := Val;
4798 procedure Set_Flag38 (N : Node_Id; Val : Boolean) is
4800 pragma Assert (Nkind (N) in N_Entity);
4801 Nodes.Table (N + 1).Flag17 := Val;
4804 procedure Set_Flag39 (N : Node_Id; Val : Boolean) is
4806 pragma Assert (Nkind (N) in N_Entity);
4807 Nodes.Table (N + 1).Flag18 := Val;
4810 procedure Set_Flag40 (N : Node_Id; Val : Boolean) is
4812 pragma Assert (Nkind (N) in N_Entity);
4813 Nodes.Table (N + 2).In_List := Val;
4816 procedure Set_Flag41 (N : Node_Id; Val : Boolean) is
4818 pragma Assert (Nkind (N) in N_Entity);
4819 Nodes.Table (N + 2).Unused_1 := Val;
4822 procedure Set_Flag42 (N : Node_Id; Val : Boolean) is
4824 pragma Assert (Nkind (N) in N_Entity);
4825 Nodes.Table (N + 2).Rewrite_Ins := Val;
4828 procedure Set_Flag43 (N : Node_Id; Val : Boolean) is
4830 pragma Assert (Nkind (N) in N_Entity);
4831 Nodes.Table (N + 2).Analyzed := Val;
4834 procedure Set_Flag44 (N : Node_Id; Val : Boolean) is
4836 pragma Assert (Nkind (N) in N_Entity);
4837 Nodes.Table (N + 2).Comes_From_Source := Val;
4840 procedure Set_Flag45 (N : Node_Id; Val : Boolean) is
4842 pragma Assert (Nkind (N) in N_Entity);
4843 Nodes.Table (N + 2).Error_Posted := Val;
4846 procedure Set_Flag46 (N : Node_Id; Val : Boolean) is
4848 pragma Assert (Nkind (N) in N_Entity);
4849 Nodes.Table (N + 2).Flag4 := Val;
4852 procedure Set_Flag47 (N : Node_Id; Val : Boolean) is
4854 pragma Assert (Nkind (N) in N_Entity);
4855 Nodes.Table (N + 2).Flag5 := Val;
4858 procedure Set_Flag48 (N : Node_Id; Val : Boolean) is
4860 pragma Assert (Nkind (N) in N_Entity);
4861 Nodes.Table (N + 2).Flag6 := Val;
4864 procedure Set_Flag49 (N : Node_Id; Val : Boolean) is
4866 pragma Assert (Nkind (N) in N_Entity);
4867 Nodes.Table (N + 2).Flag7 := Val;
4870 procedure Set_Flag50 (N : Node_Id; Val : Boolean) is
4872 pragma Assert (Nkind (N) in N_Entity);
4873 Nodes.Table (N + 2).Flag8 := Val;
4876 procedure Set_Flag51 (N : Node_Id; Val : Boolean) is
4878 pragma Assert (Nkind (N) in N_Entity);
4879 Nodes.Table (N + 2).Flag9 := Val;
4882 procedure Set_Flag52 (N : Node_Id; Val : Boolean) is
4884 pragma Assert (Nkind (N) in N_Entity);
4885 Nodes.Table (N + 2).Flag10 := Val;
4888 procedure Set_Flag53 (N : Node_Id; Val : Boolean) is
4890 pragma Assert (Nkind (N) in N_Entity);
4891 Nodes.Table (N + 2).Flag11 := Val;
4894 procedure Set_Flag54 (N : Node_Id; Val : Boolean) is
4896 pragma Assert (Nkind (N) in N_Entity);
4897 Nodes.Table (N + 2).Flag12 := Val;
4900 procedure Set_Flag55 (N : Node_Id; Val : Boolean) is
4902 pragma Assert (Nkind (N) in N_Entity);
4903 Nodes.Table (N + 2).Flag13 := Val;
4906 procedure Set_Flag56 (N : Node_Id; Val : Boolean) is
4908 pragma Assert (Nkind (N) in N_Entity);
4909 Nodes.Table (N + 2).Flag14 := Val;
4912 procedure Set_Flag57 (N : Node_Id; Val : Boolean) is
4914 pragma Assert (Nkind (N) in N_Entity);
4915 Nodes.Table (N + 2).Flag15 := Val;
4918 procedure Set_Flag58 (N : Node_Id; Val : Boolean) is
4920 pragma Assert (Nkind (N) in N_Entity);
4921 Nodes.Table (N + 2).Flag16 := Val;
4924 procedure Set_Flag59 (N : Node_Id; Val : Boolean) is
4926 pragma Assert (Nkind (N) in N_Entity);
4927 Nodes.Table (N + 2).Flag17 := Val;
4930 procedure Set_Flag60 (N : Node_Id; Val : Boolean) is
4932 pragma Assert (Nkind (N) in N_Entity);
4933 Nodes.Table (N + 2).Flag18 := Val;
4936 procedure Set_Flag61 (N : Node_Id; Val : Boolean) is
4938 pragma Assert (Nkind (N) in N_Entity);
4939 Nodes.Table (N + 1).Pflag1 := Val;
4942 procedure Set_Flag62 (N : Node_Id; Val : Boolean) is
4944 pragma Assert (Nkind (N) in N_Entity);
4945 Nodes.Table (N + 1).Pflag2 := Val;
4948 procedure Set_Flag63 (N : Node_Id; Val : Boolean) is
4950 pragma Assert (Nkind (N) in N_Entity);
4951 Nodes.Table (N + 2).Pflag1 := Val;
4954 procedure Set_Flag64 (N : Node_Id; Val : Boolean) is
4956 pragma Assert (Nkind (N) in N_Entity);
4957 Nodes.Table (N + 2).Pflag2 := Val;
4960 procedure Set_Flag65 (N : Node_Id; Val : Boolean) is
4962 pragma Assert (Nkind (N) in N_Entity);
4965 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag65 := Val;
4968 procedure Set_Flag66 (N : Node_Id; Val : Boolean) is
4970 pragma Assert (Nkind (N) in N_Entity);
4973 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag66 := Val;
4976 procedure Set_Flag67 (N : Node_Id; Val : Boolean) is
4978 pragma Assert (Nkind (N) in N_Entity);
4981 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag67 := Val;
4984 procedure Set_Flag68 (N : Node_Id; Val : Boolean) is
4986 pragma Assert (Nkind (N) in N_Entity);
4989 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag68 := Val;
4992 procedure Set_Flag69 (N : Node_Id; Val : Boolean) is
4994 pragma Assert (Nkind (N) in N_Entity);
4997 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag69 := Val;
5000 procedure Set_Flag70 (N : Node_Id; Val : Boolean) is
5002 pragma Assert (Nkind (N) in N_Entity);
5005 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag70 := Val;
5008 procedure Set_Flag71 (N : Node_Id; Val : Boolean) is
5010 pragma Assert (Nkind (N) in N_Entity);
5013 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag71 := Val;
5016 procedure Set_Flag72 (N : Node_Id; Val : Boolean) is
5018 pragma Assert (Nkind (N) in N_Entity);
5021 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag72 := Val;
5024 procedure Set_Flag73 (N : Node_Id; Val : Boolean) is
5026 pragma Assert (Nkind (N) in N_Entity);
5029 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag73 := Val;
5032 procedure Set_Flag74 (N : Node_Id; Val : Boolean) is
5034 pragma Assert (Nkind (N) in N_Entity);
5037 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag74 := Val;
5040 procedure Set_Flag75 (N : Node_Id; Val : Boolean) is
5042 pragma Assert (Nkind (N) in N_Entity);
5045 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag75 := Val;
5048 procedure Set_Flag76 (N : Node_Id; Val : Boolean) is
5050 pragma Assert (Nkind (N) in N_Entity);
5053 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag76 := Val;
5056 procedure Set_Flag77 (N : Node_Id; Val : Boolean) is
5058 pragma Assert (Nkind (N) in N_Entity);
5061 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag77 := Val;
5064 procedure Set_Flag78 (N : Node_Id; Val : Boolean) is
5066 pragma Assert (Nkind (N) in N_Entity);
5069 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag78 := Val;
5072 procedure Set_Flag79 (N : Node_Id; Val : Boolean) is
5074 pragma Assert (Nkind (N) in N_Entity);
5077 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag79 := Val;
5080 procedure Set_Flag80 (N : Node_Id; Val : Boolean) is
5082 pragma Assert (Nkind (N) in N_Entity);
5085 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag80 := Val;
5088 procedure Set_Flag81 (N : Node_Id; Val : Boolean) is
5090 pragma Assert (Nkind (N) in N_Entity);
5093 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag81 := Val;
5096 procedure Set_Flag82 (N : Node_Id; Val : Boolean) is
5098 pragma Assert (Nkind (N) in N_Entity);
5101 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag82 := Val;
5104 procedure Set_Flag83 (N : Node_Id; Val : Boolean) is
5106 pragma Assert (Nkind (N) in N_Entity);
5109 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag83 := Val;
5112 procedure Set_Flag84 (N : Node_Id; Val : Boolean) is
5114 pragma Assert (Nkind (N) in N_Entity);
5117 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag84 := Val;
5120 procedure Set_Flag85 (N : Node_Id; Val : Boolean) is
5122 pragma Assert (Nkind (N) in N_Entity);
5125 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag85 := Val;
5128 procedure Set_Flag86 (N : Node_Id; Val : Boolean) is
5130 pragma Assert (Nkind (N) in N_Entity);
5133 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag86 := Val;
5136 procedure Set_Flag87 (N : Node_Id; Val : Boolean) is
5138 pragma Assert (Nkind (N) in N_Entity);
5141 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag87 := Val;
5144 procedure Set_Flag88 (N : Node_Id; Val : Boolean) is
5146 pragma Assert (Nkind (N) in N_Entity);
5149 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag88 := Val;
5152 procedure Set_Flag89 (N : Node_Id; Val : Boolean) is
5154 pragma Assert (Nkind (N) in N_Entity);
5157 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag89 := Val;
5160 procedure Set_Flag90 (N : Node_Id; Val : Boolean) is
5162 pragma Assert (Nkind (N) in N_Entity);
5165 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag90 := Val;
5168 procedure Set_Flag91 (N : Node_Id; Val : Boolean) is
5170 pragma Assert (Nkind (N) in N_Entity);
5173 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag91 := Val;
5176 procedure Set_Flag92 (N : Node_Id; Val : Boolean) is
5178 pragma Assert (Nkind (N) in N_Entity);
5181 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag92 := Val;
5184 procedure Set_Flag93 (N : Node_Id; Val : Boolean) is
5186 pragma Assert (Nkind (N) in N_Entity);
5189 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag93 := Val;
5192 procedure Set_Flag94 (N : Node_Id; Val : Boolean) is
5194 pragma Assert (Nkind (N) in N_Entity);
5197 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag94 := Val;
5200 procedure Set_Flag95 (N : Node_Id; Val : Boolean) is
5202 pragma Assert (Nkind (N) in N_Entity);
5205 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag95 := Val;
5208 procedure Set_Flag96 (N : Node_Id; Val : Boolean) is
5210 pragma Assert (Nkind (N) in N_Entity);
5213 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag96 := Val;
5216 procedure Set_Flag97 (N : Node_Id; Val : Boolean) is
5218 pragma Assert (Nkind (N) in N_Entity);
5221 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag97 := Val;
5224 procedure Set_Flag98 (N : Node_Id; Val : Boolean) is
5226 pragma Assert (Nkind (N) in N_Entity);
5229 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag98 := Val;
5232 procedure Set_Flag99 (N : Node_Id; Val : Boolean) is
5234 pragma Assert (Nkind (N) in N_Entity);
5237 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag99 := Val;
5240 procedure Set_Flag100 (N : Node_Id; Val : Boolean) is
5242 pragma Assert (Nkind (N) in N_Entity);
5245 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag100 := Val;
5248 procedure Set_Flag101 (N : Node_Id; Val : Boolean) is
5250 pragma Assert (Nkind (N) in N_Entity);
5253 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag101 := Val;
5256 procedure Set_Flag102 (N : Node_Id; Val : Boolean) is
5258 pragma Assert (Nkind (N) in N_Entity);
5261 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag102 := Val;
5264 procedure Set_Flag103 (N : Node_Id; Val : Boolean) is
5266 pragma Assert (Nkind (N) in N_Entity);
5269 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag103 := Val;
5272 procedure Set_Flag104 (N : Node_Id; Val : Boolean) is
5274 pragma Assert (Nkind (N) in N_Entity);
5277 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag104 := Val;
5280 procedure Set_Flag105 (N : Node_Id; Val : Boolean) is
5282 pragma Assert (Nkind (N) in N_Entity);
5285 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag105 := Val;
5288 procedure Set_Flag106 (N : Node_Id; Val : Boolean) is
5290 pragma Assert (Nkind (N) in N_Entity);
5293 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag106 := Val;
5296 procedure Set_Flag107 (N : Node_Id; Val : Boolean) is
5298 pragma Assert (Nkind (N) in N_Entity);
5301 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag107 := Val;
5304 procedure Set_Flag108 (N : Node_Id; Val : Boolean) is
5306 pragma Assert (Nkind (N) in N_Entity);
5309 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag108 := Val;
5312 procedure Set_Flag109 (N : Node_Id; Val : Boolean) is
5314 pragma Assert (Nkind (N) in N_Entity);
5317 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag109 := Val;
5320 procedure Set_Flag110 (N : Node_Id; Val : Boolean) is
5322 pragma Assert (Nkind (N) in N_Entity);
5325 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag110 := Val;
5328 procedure Set_Flag111 (N : Node_Id; Val : Boolean) is
5330 pragma Assert (Nkind (N) in N_Entity);
5333 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag111 := Val;
5336 procedure Set_Flag112 (N : Node_Id; Val : Boolean) is
5338 pragma Assert (Nkind (N) in N_Entity);
5341 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag112 := Val;
5344 procedure Set_Flag113 (N : Node_Id; Val : Boolean) is
5346 pragma Assert (Nkind (N) in N_Entity);
5349 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag113 := Val;
5352 procedure Set_Flag114 (N : Node_Id; Val : Boolean) is
5354 pragma Assert (Nkind (N) in N_Entity);
5357 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag114 := Val;
5360 procedure Set_Flag115 (N : Node_Id; Val : Boolean) is
5362 pragma Assert (Nkind (N) in N_Entity);
5365 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag115 := Val;
5368 procedure Set_Flag116 (N : Node_Id; Val : Boolean) is
5370 pragma Assert (Nkind (N) in N_Entity);
5373 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag116 := Val;
5376 procedure Set_Flag117 (N : Node_Id; Val : Boolean) is
5378 pragma Assert (Nkind (N) in N_Entity);
5381 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag117 := Val;
5384 procedure Set_Flag118 (N : Node_Id; Val : Boolean) is
5386 pragma Assert (Nkind (N) in N_Entity);
5389 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag118 := Val;
5392 procedure Set_Flag119 (N : Node_Id; Val : Boolean) is
5394 pragma Assert (Nkind (N) in N_Entity);
5397 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag119 := Val;
5400 procedure Set_Flag120 (N : Node_Id; Val : Boolean) is
5402 pragma Assert (Nkind (N) in N_Entity);
5405 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag120 := Val;
5408 procedure Set_Flag121 (N : Node_Id; Val : Boolean) is
5410 pragma Assert (Nkind (N) in N_Entity);
5413 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag121 := Val;
5416 procedure Set_Flag122 (N : Node_Id; Val : Boolean) is
5418 pragma Assert (Nkind (N) in N_Entity);
5421 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag122 := Val;
5424 procedure Set_Flag123 (N : Node_Id; Val : Boolean) is
5426 pragma Assert (Nkind (N) in N_Entity);
5429 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag123 := Val;
5432 procedure Set_Flag124 (N : Node_Id; Val : Boolean) is
5434 pragma Assert (Nkind (N) in N_Entity);
5437 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag124 := Val;
5440 procedure Set_Flag125 (N : Node_Id; Val : Boolean) is
5442 pragma Assert (Nkind (N) in N_Entity);
5445 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag125 := Val;
5448 procedure Set_Flag126 (N : Node_Id; Val : Boolean) is
5450 pragma Assert (Nkind (N) in N_Entity);
5453 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag126 := Val;
5456 procedure Set_Flag127 (N : Node_Id; Val : Boolean) is
5458 pragma Assert (Nkind (N) in N_Entity);
5461 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag127 := Val;
5464 procedure Set_Flag128 (N : Node_Id; Val : Boolean) is
5466 pragma Assert (Nkind (N) in N_Entity);
5469 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag128 := Val;
5472 procedure Set_Flag129 (N : Node_Id; Val : Boolean) is
5474 pragma Assert (Nkind (N) in N_Entity);
5475 Nodes.Table (N + 3).In_List := Val;
5478 procedure Set_Flag130 (N : Node_Id; Val : Boolean) is
5480 pragma Assert (Nkind (N) in N_Entity);
5481 Nodes.Table (N + 3).Unused_1 := Val;
5484 procedure Set_Flag131 (N : Node_Id; Val : Boolean) is
5486 pragma Assert (Nkind (N) in N_Entity);
5487 Nodes.Table (N + 3).Rewrite_Ins := Val;
5490 procedure Set_Flag132 (N : Node_Id; Val : Boolean) is
5492 pragma Assert (Nkind (N) in N_Entity);
5493 Nodes.Table (N + 3).Analyzed := Val;
5496 procedure Set_Flag133 (N : Node_Id; Val : Boolean) is
5498 pragma Assert (Nkind (N) in N_Entity);
5499 Nodes.Table (N + 3).Comes_From_Source := Val;
5502 procedure Set_Flag134 (N : Node_Id; Val : Boolean) is
5504 pragma Assert (Nkind (N) in N_Entity);
5505 Nodes.Table (N + 3).Error_Posted := Val;
5508 procedure Set_Flag135 (N : Node_Id; Val : Boolean) is
5510 pragma Assert (Nkind (N) in N_Entity);
5511 Nodes.Table (N + 3).Flag4 := Val;
5514 procedure Set_Flag136 (N : Node_Id; Val : Boolean) is
5516 pragma Assert (Nkind (N) in N_Entity);
5517 Nodes.Table (N + 3).Flag5 := Val;
5520 procedure Set_Flag137 (N : Node_Id; Val : Boolean) is
5522 pragma Assert (Nkind (N) in N_Entity);
5523 Nodes.Table (N + 3).Flag6 := Val;
5526 procedure Set_Flag138 (N : Node_Id; Val : Boolean) is
5528 pragma Assert (Nkind (N) in N_Entity);
5529 Nodes.Table (N + 3).Flag7 := Val;
5532 procedure Set_Flag139 (N : Node_Id; Val : Boolean) is
5534 pragma Assert (Nkind (N) in N_Entity);
5535 Nodes.Table (N + 3).Flag8 := Val;
5538 procedure Set_Flag140 (N : Node_Id; Val : Boolean) is
5540 pragma Assert (Nkind (N) in N_Entity);
5541 Nodes.Table (N + 3).Flag9 := Val;
5544 procedure Set_Flag141 (N : Node_Id; Val : Boolean) is
5546 pragma Assert (Nkind (N) in N_Entity);
5547 Nodes.Table (N + 3).Flag10 := Val;
5550 procedure Set_Flag142 (N : Node_Id; Val : Boolean) is
5552 pragma Assert (Nkind (N) in N_Entity);
5553 Nodes.Table (N + 3).Flag11 := Val;
5556 procedure Set_Flag143 (N : Node_Id; Val : Boolean) is
5558 pragma Assert (Nkind (N) in N_Entity);
5559 Nodes.Table (N + 3).Flag12 := Val;
5562 procedure Set_Flag144 (N : Node_Id; Val : Boolean) is
5564 pragma Assert (Nkind (N) in N_Entity);
5565 Nodes.Table (N + 3).Flag13 := Val;
5568 procedure Set_Flag145 (N : Node_Id; Val : Boolean) is
5570 pragma Assert (Nkind (N) in N_Entity);
5571 Nodes.Table (N + 3).Flag14 := Val;
5574 procedure Set_Flag146 (N : Node_Id; Val : Boolean) is
5576 pragma Assert (Nkind (N) in N_Entity);
5577 Nodes.Table (N + 3).Flag15 := Val;
5580 procedure Set_Flag147 (N : Node_Id; Val : Boolean) is
5582 pragma Assert (Nkind (N) in N_Entity);
5583 Nodes.Table (N + 3).Flag16 := Val;
5586 procedure Set_Flag148 (N : Node_Id; Val : Boolean) is
5588 pragma Assert (Nkind (N) in N_Entity);
5589 Nodes.Table (N + 3).Flag17 := Val;
5592 procedure Set_Flag149 (N : Node_Id; Val : Boolean) is
5594 pragma Assert (Nkind (N) in N_Entity);
5595 Nodes.Table (N + 3).Flag18 := Val;
5598 procedure Set_Flag150 (N : Node_Id; Val : Boolean) is
5600 pragma Assert (Nkind (N) in N_Entity);
5601 Nodes.Table (N + 3).Pflag1 := Val;
5604 procedure Set_Flag151 (N : Node_Id; Val : Boolean) is
5606 pragma Assert (Nkind (N) in N_Entity);
5607 Nodes.Table (N + 3).Pflag2 := Val;
5610 procedure Set_Flag152 (N : Node_Id; Val : Boolean) is
5612 pragma Assert (Nkind (N) in N_Entity);
5615 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag152 := Val;
5618 procedure Set_Flag153 (N : Node_Id; Val : Boolean) is
5620 pragma Assert (Nkind (N) in N_Entity);
5623 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag153 := Val;
5626 procedure Set_Flag154 (N : Node_Id; Val : Boolean) is
5628 pragma Assert (Nkind (N) in N_Entity);
5631 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag154 := Val;
5634 procedure Set_Flag155 (N : Node_Id; Val : Boolean) is
5636 pragma Assert (Nkind (N) in N_Entity);
5639 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag155 := Val;
5642 procedure Set_Flag156 (N : Node_Id; Val : Boolean) is
5644 pragma Assert (Nkind (N) in N_Entity);
5647 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag156 := Val;
5650 procedure Set_Flag157 (N : Node_Id; Val : Boolean) is
5652 pragma Assert (Nkind (N) in N_Entity);
5655 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag157 := Val;
5658 procedure Set_Flag158 (N : Node_Id; Val : Boolean) is
5660 pragma Assert (Nkind (N) in N_Entity);
5663 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag158 := Val;
5666 procedure Set_Flag159 (N : Node_Id; Val : Boolean) is
5668 pragma Assert (Nkind (N) in N_Entity);
5671 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag159 := Val;
5674 procedure Set_Flag160 (N : Node_Id; Val : Boolean) is
5676 pragma Assert (Nkind (N) in N_Entity);
5679 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag160 := Val;
5682 procedure Set_Flag161 (N : Node_Id; Val : Boolean) is
5684 pragma Assert (Nkind (N) in N_Entity);
5687 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag161 := Val;
5690 procedure Set_Flag162 (N : Node_Id; Val : Boolean) is
5692 pragma Assert (Nkind (N) in N_Entity);
5695 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag162 := Val;
5698 procedure Set_Flag163 (N : Node_Id; Val : Boolean) is
5700 pragma Assert (Nkind (N) in N_Entity);
5703 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag163 := Val;
5706 procedure Set_Flag164 (N : Node_Id; Val : Boolean) is
5708 pragma Assert (Nkind (N) in N_Entity);
5711 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag164 := Val;
5714 procedure Set_Flag165 (N : Node_Id; Val : Boolean) is
5716 pragma Assert (Nkind (N) in N_Entity);
5719 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag165 := Val;
5722 procedure Set_Flag166 (N : Node_Id; Val : Boolean) is
5724 pragma Assert (Nkind (N) in N_Entity);
5727 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag166 := Val;
5730 procedure Set_Flag167 (N : Node_Id; Val : Boolean) is
5732 pragma Assert (Nkind (N) in N_Entity);
5735 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag167 := Val;
5738 procedure Set_Flag168 (N : Node_Id; Val : Boolean) is
5740 pragma Assert (Nkind (N) in N_Entity);
5743 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag168 := Val;
5746 procedure Set_Flag169 (N : Node_Id; Val : Boolean) is
5748 pragma Assert (Nkind (N) in N_Entity);
5751 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag169 := Val;
5754 procedure Set_Flag170 (N : Node_Id; Val : Boolean) is
5756 pragma Assert (Nkind (N) in N_Entity);
5759 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag170 := Val;
5762 procedure Set_Flag171 (N : Node_Id; Val : Boolean) is
5764 pragma Assert (Nkind (N) in N_Entity);
5767 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag171 := Val;
5770 procedure Set_Flag172 (N : Node_Id; Val : Boolean) is
5772 pragma Assert (Nkind (N) in N_Entity);
5775 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag172 := Val;
5778 procedure Set_Flag173 (N : Node_Id; Val : Boolean) is
5780 pragma Assert (Nkind (N) in N_Entity);
5783 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag173 := Val;
5786 procedure Set_Flag174 (N : Node_Id; Val : Boolean) is
5788 pragma Assert (Nkind (N) in N_Entity);
5791 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag174 := Val;
5794 procedure Set_Flag175 (N : Node_Id; Val : Boolean) is
5796 pragma Assert (Nkind (N) in N_Entity);
5799 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag175 := Val;
5802 procedure Set_Flag176 (N : Node_Id; Val : Boolean) is
5804 pragma Assert (Nkind (N) in N_Entity);
5807 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag176 := Val;
5810 procedure Set_Flag177 (N : Node_Id; Val : Boolean) is
5812 pragma Assert (Nkind (N) in N_Entity);
5815 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag177 := Val;
5818 procedure Set_Flag178 (N : Node_Id; Val : Boolean) is
5820 pragma Assert (Nkind (N) in N_Entity);
5823 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag178 := Val;
5826 procedure Set_Flag179 (N : Node_Id; Val : Boolean) is
5828 pragma Assert (Nkind (N) in N_Entity);
5831 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag179 := Val;
5834 procedure Set_Flag180 (N : Node_Id; Val : Boolean) is
5836 pragma Assert (Nkind (N) in N_Entity);
5839 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag180 := Val;
5842 procedure Set_Flag181 (N : Node_Id; Val : Boolean) is
5844 pragma Assert (Nkind (N) in N_Entity);
5847 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag181 := Val;
5850 procedure Set_Flag182 (N : Node_Id; Val : Boolean) is
5852 pragma Assert (Nkind (N) in N_Entity);
5855 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag182 := Val;
5858 procedure Set_Flag183 (N : Node_Id; Val : Boolean) is
5860 pragma Assert (Nkind (N) in N_Entity);
5863 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag183 := Val;
5866 procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id) is
5868 pragma Assert (N in Nodes.First .. Nodes.Last);
5869 if Val > Error then Set_Parent (Val, N); end if;
5871 end Set_Node1_With_Parent;
5873 procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id) is
5875 pragma Assert (N in Nodes.First .. Nodes.Last);
5876 if Val > Error then Set_Parent (Val, N); end if;
5878 end Set_Node2_With_Parent;
5880 procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id) is
5882 pragma Assert (N in Nodes.First .. Nodes.Last);
5883 if Val > Error then Set_Parent (Val, N); end if;
5885 end Set_Node3_With_Parent;
5887 procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id) is
5889 pragma Assert (N in Nodes.First .. Nodes.Last);
5890 if Val > Error then Set_Parent (Val, N); end if;
5892 end Set_Node4_With_Parent;
5894 procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id) is
5896 pragma Assert (N in Nodes.First .. Nodes.Last);
5897 if Val > Error then Set_Parent (Val, N); end if;
5899 end Set_Node5_With_Parent;
5901 procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id) is
5903 pragma Assert (N in Nodes.First .. Nodes.Last);
5904 if Val /= No_List and then Val /= Error_List then
5905 Set_Parent (Val, N);
5908 end Set_List1_With_Parent;
5910 procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id) is
5912 pragma Assert (N in Nodes.First .. Nodes.Last);
5913 if Val /= No_List and then Val /= Error_List then
5914 Set_Parent (Val, N);
5917 end Set_List2_With_Parent;
5919 procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id) is
5921 pragma Assert (N in Nodes.First .. Nodes.Last);
5922 if Val /= No_List and then Val /= Error_List then
5923 Set_Parent (Val, N);
5926 end Set_List3_With_Parent;
5928 procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id) is
5930 pragma Assert (N in Nodes.First .. Nodes.Last);
5931 if Val /= No_List and then Val /= Error_List then
5932 Set_Parent (Val, N);
5935 end Set_List4_With_Parent;
5937 procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id) is
5939 pragma Assert (N in Nodes.First .. Nodes.Last);
5940 if Val /= No_List and then Val /= Error_List then
5941 Set_Parent (Val, N);
5944 end Set_List5_With_Parent;
5946 end Unchecked_Access;