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
2365 procedure Traverse_Proc (Node : Node_Id) is
2366 function Traverse is new Traverse_Func (Process);
2367 Discard : Traverse_Result;
2370 Discard := Traverse (Node);
2377 procedure Tree_Read is
2379 Tree_Read_Int (Node_Count);
2381 Orig_Nodes.Tree_Read;
2388 procedure Tree_Write is
2390 Tree_Write_Int (Node_Count);
2392 Orig_Nodes.Tree_Write;
2395 ------------------------------
2396 -- Unchecked Access Package --
2397 ------------------------------
2399 package body Unchecked_Access is
2401 function Field1 (N : Node_Id) return Union_Id is
2403 pragma Assert (N in Nodes.First .. Nodes.Last);
2404 return Nodes.Table (N).Field1;
2407 function Field2 (N : Node_Id) return Union_Id is
2409 pragma Assert (N in Nodes.First .. Nodes.Last);
2410 return Nodes.Table (N).Field2;
2413 function Field3 (N : Node_Id) return Union_Id is
2415 pragma Assert (N in Nodes.First .. Nodes.Last);
2416 return Nodes.Table (N).Field3;
2419 function Field4 (N : Node_Id) return Union_Id is
2421 pragma Assert (N in Nodes.First .. Nodes.Last);
2422 return Nodes.Table (N).Field4;
2425 function Field5 (N : Node_Id) return Union_Id is
2427 pragma Assert (N in Nodes.First .. Nodes.Last);
2428 return Nodes.Table (N).Field5;
2431 function Field6 (N : Node_Id) return Union_Id is
2433 pragma Assert (Nkind (N) in N_Entity);
2434 return Nodes.Table (N + 1).Field6;
2437 function Field7 (N : Node_Id) return Union_Id is
2439 pragma Assert (Nkind (N) in N_Entity);
2440 return Nodes.Table (N + 1).Field7;
2443 function Field8 (N : Node_Id) return Union_Id is
2445 pragma Assert (Nkind (N) in N_Entity);
2446 return Nodes.Table (N + 1).Field8;
2449 function Field9 (N : Node_Id) return Union_Id is
2451 pragma Assert (Nkind (N) in N_Entity);
2452 return Nodes.Table (N + 1).Field9;
2455 function Field10 (N : Node_Id) return Union_Id is
2457 pragma Assert (Nkind (N) in N_Entity);
2458 return Nodes.Table (N + 1).Field10;
2461 function Field11 (N : Node_Id) return Union_Id is
2463 pragma Assert (Nkind (N) in N_Entity);
2464 return Nodes.Table (N + 1).Field11;
2467 function Field12 (N : Node_Id) return Union_Id is
2469 pragma Assert (Nkind (N) in N_Entity);
2470 return Nodes.Table (N + 1).Field12;
2473 function Field13 (N : Node_Id) return Union_Id is
2475 pragma Assert (Nkind (N) in N_Entity);
2476 return Nodes.Table (N + 2).Field6;
2479 function Field14 (N : Node_Id) return Union_Id is
2481 pragma Assert (Nkind (N) in N_Entity);
2482 return Nodes.Table (N + 2).Field7;
2485 function Field15 (N : Node_Id) return Union_Id is
2487 pragma Assert (Nkind (N) in N_Entity);
2488 return Nodes.Table (N + 2).Field8;
2491 function Field16 (N : Node_Id) return Union_Id is
2493 pragma Assert (Nkind (N) in N_Entity);
2494 return Nodes.Table (N + 2).Field9;
2497 function Field17 (N : Node_Id) return Union_Id is
2499 pragma Assert (Nkind (N) in N_Entity);
2500 return Nodes.Table (N + 2).Field10;
2503 function Field18 (N : Node_Id) return Union_Id is
2505 pragma Assert (Nkind (N) in N_Entity);
2506 return Nodes.Table (N + 2).Field11;
2509 function Field19 (N : Node_Id) return Union_Id is
2511 pragma Assert (Nkind (N) in N_Entity);
2512 return Nodes.Table (N + 3).Field6;
2515 function Field20 (N : Node_Id) return Union_Id is
2517 pragma Assert (Nkind (N) in N_Entity);
2518 return Nodes.Table (N + 3).Field7;
2521 function Field21 (N : Node_Id) return Union_Id is
2523 pragma Assert (Nkind (N) in N_Entity);
2524 return Nodes.Table (N + 3).Field8;
2527 function Field22 (N : Node_Id) return Union_Id is
2529 pragma Assert (Nkind (N) in N_Entity);
2530 return Nodes.Table (N + 3).Field9;
2533 function Field23 (N : Node_Id) return Union_Id is
2535 pragma Assert (Nkind (N) in N_Entity);
2536 return Nodes.Table (N + 3).Field10;
2539 function Node1 (N : Node_Id) return Node_Id is
2541 pragma Assert (N in Nodes.First .. Nodes.Last);
2542 return Node_Id (Nodes.Table (N).Field1);
2545 function Node2 (N : Node_Id) return Node_Id is
2547 pragma Assert (N in Nodes.First .. Nodes.Last);
2548 return Node_Id (Nodes.Table (N).Field2);
2551 function Node3 (N : Node_Id) return Node_Id is
2553 pragma Assert (N in Nodes.First .. Nodes.Last);
2554 return Node_Id (Nodes.Table (N).Field3);
2557 function Node4 (N : Node_Id) return Node_Id is
2559 pragma Assert (N in Nodes.First .. Nodes.Last);
2560 return Node_Id (Nodes.Table (N).Field4);
2563 function Node5 (N : Node_Id) return Node_Id is
2565 pragma Assert (N in Nodes.First .. Nodes.Last);
2566 return Node_Id (Nodes.Table (N).Field5);
2569 function Node6 (N : Node_Id) return Node_Id is
2571 pragma Assert (Nkind (N) in N_Entity);
2572 return Node_Id (Nodes.Table (N + 1).Field6);
2575 function Node7 (N : Node_Id) return Node_Id is
2577 pragma Assert (Nkind (N) in N_Entity);
2578 return Node_Id (Nodes.Table (N + 1).Field7);
2581 function Node8 (N : Node_Id) return Node_Id is
2583 pragma Assert (Nkind (N) in N_Entity);
2584 return Node_Id (Nodes.Table (N + 1).Field8);
2587 function Node9 (N : Node_Id) return Node_Id is
2589 pragma Assert (Nkind (N) in N_Entity);
2590 return Node_Id (Nodes.Table (N + 1).Field9);
2593 function Node10 (N : Node_Id) return Node_Id is
2595 pragma Assert (Nkind (N) in N_Entity);
2596 return Node_Id (Nodes.Table (N + 1).Field10);
2599 function Node11 (N : Node_Id) return Node_Id is
2601 pragma Assert (Nkind (N) in N_Entity);
2602 return Node_Id (Nodes.Table (N + 1).Field11);
2605 function Node12 (N : Node_Id) return Node_Id is
2607 pragma Assert (Nkind (N) in N_Entity);
2608 return Node_Id (Nodes.Table (N + 1).Field12);
2611 function Node13 (N : Node_Id) return Node_Id is
2613 pragma Assert (Nkind (N) in N_Entity);
2614 return Node_Id (Nodes.Table (N + 2).Field6);
2617 function Node14 (N : Node_Id) return Node_Id is
2619 pragma Assert (Nkind (N) in N_Entity);
2620 return Node_Id (Nodes.Table (N + 2).Field7);
2623 function Node15 (N : Node_Id) return Node_Id is
2625 pragma Assert (Nkind (N) in N_Entity);
2626 return Node_Id (Nodes.Table (N + 2).Field8);
2629 function Node16 (N : Node_Id) return Node_Id is
2631 pragma Assert (Nkind (N) in N_Entity);
2632 return Node_Id (Nodes.Table (N + 2).Field9);
2635 function Node17 (N : Node_Id) return Node_Id is
2637 pragma Assert (Nkind (N) in N_Entity);
2638 return Node_Id (Nodes.Table (N + 2).Field10);
2641 function Node18 (N : Node_Id) return Node_Id is
2643 pragma Assert (Nkind (N) in N_Entity);
2644 return Node_Id (Nodes.Table (N + 2).Field11);
2647 function Node19 (N : Node_Id) return Node_Id is
2649 pragma Assert (Nkind (N) in N_Entity);
2650 return Node_Id (Nodes.Table (N + 3).Field6);
2653 function Node20 (N : Node_Id) return Node_Id is
2655 pragma Assert (Nkind (N) in N_Entity);
2656 return Node_Id (Nodes.Table (N + 3).Field7);
2659 function Node21 (N : Node_Id) return Node_Id is
2661 pragma Assert (Nkind (N) in N_Entity);
2662 return Node_Id (Nodes.Table (N + 3).Field8);
2665 function Node22 (N : Node_Id) return Node_Id is
2667 pragma Assert (Nkind (N) in N_Entity);
2668 return Node_Id (Nodes.Table (N + 3).Field9);
2671 function Node23 (N : Node_Id) return Node_Id is
2673 pragma Assert (Nkind (N) in N_Entity);
2674 return Node_Id (Nodes.Table (N + 3).Field10);
2677 function List1 (N : Node_Id) return List_Id is
2679 pragma Assert (N in Nodes.First .. Nodes.Last);
2680 return List_Id (Nodes.Table (N).Field1);
2683 function List2 (N : Node_Id) return List_Id is
2685 pragma Assert (N in Nodes.First .. Nodes.Last);
2686 return List_Id (Nodes.Table (N).Field2);
2689 function List3 (N : Node_Id) return List_Id is
2691 pragma Assert (N in Nodes.First .. Nodes.Last);
2692 return List_Id (Nodes.Table (N).Field3);
2695 function List4 (N : Node_Id) return List_Id is
2697 pragma Assert (N in Nodes.First .. Nodes.Last);
2698 return List_Id (Nodes.Table (N).Field4);
2701 function List5 (N : Node_Id) return List_Id is
2703 pragma Assert (N in Nodes.First .. Nodes.Last);
2704 return List_Id (Nodes.Table (N).Field5);
2707 function List10 (N : Node_Id) return List_Id is
2709 pragma Assert (Nkind (N) in N_Entity);
2710 return List_Id (Nodes.Table (N + 1).Field10);
2713 function List14 (N : Node_Id) return List_Id is
2715 pragma Assert (Nkind (N) in N_Entity);
2716 return List_Id (Nodes.Table (N + 2).Field7);
2719 function Elist2 (N : Node_Id) return Elist_Id is
2721 return Elist_Id (Nodes.Table (N).Field2);
2724 function Elist3 (N : Node_Id) return Elist_Id is
2726 return Elist_Id (Nodes.Table (N).Field3);
2729 function Elist4 (N : Node_Id) return Elist_Id is
2731 return Elist_Id (Nodes.Table (N).Field4);
2734 function Elist8 (N : Node_Id) return Elist_Id is
2736 pragma Assert (Nkind (N) in N_Entity);
2737 return Elist_Id (Nodes.Table (N + 1).Field8);
2740 function Elist13 (N : Node_Id) return Elist_Id is
2742 pragma Assert (Nkind (N) in N_Entity);
2743 return Elist_Id (Nodes.Table (N + 2).Field6);
2746 function Elist15 (N : Node_Id) return Elist_Id is
2748 pragma Assert (Nkind (N) in N_Entity);
2749 return Elist_Id (Nodes.Table (N + 2).Field8);
2752 function Elist16 (N : Node_Id) return Elist_Id is
2754 pragma Assert (Nkind (N) in N_Entity);
2755 return Elist_Id (Nodes.Table (N + 2).Field9);
2758 function Elist18 (N : Node_Id) return Elist_Id is
2760 pragma Assert (Nkind (N) in N_Entity);
2761 return Elist_Id (Nodes.Table (N + 2).Field11);
2764 function Elist21 (N : Node_Id) return Elist_Id is
2766 pragma Assert (Nkind (N) in N_Entity);
2767 return Elist_Id (Nodes.Table (N + 3).Field8);
2770 function Elist23 (N : Node_Id) return Elist_Id is
2772 pragma Assert (Nkind (N) in N_Entity);
2773 return Elist_Id (Nodes.Table (N + 3).Field10);
2776 function Name1 (N : Node_Id) return Name_Id is
2778 pragma Assert (N in Nodes.First .. Nodes.Last);
2779 return Name_Id (Nodes.Table (N).Field1);
2782 function Name2 (N : Node_Id) return Name_Id is
2784 pragma Assert (N in Nodes.First .. Nodes.Last);
2785 return Name_Id (Nodes.Table (N).Field2);
2788 function Str3 (N : Node_Id) return String_Id is
2790 pragma Assert (N in Nodes.First .. Nodes.Last);
2791 return String_Id (Nodes.Table (N).Field3);
2794 function Char_Code2 (N : Node_Id) return Char_Code is
2796 pragma Assert (N in Nodes.First .. Nodes.Last);
2797 return Char_Code (Nodes.Table (N).Field2 - Char_Code_Bias);
2800 function Uint3 (N : Node_Id) return Uint is
2801 pragma Assert (N in Nodes.First .. Nodes.Last);
2802 U : constant Union_Id := Nodes.Table (N).Field3;
2808 return From_Union (U);
2812 function Uint4 (N : Node_Id) return Uint is
2813 pragma Assert (N in Nodes.First .. Nodes.Last);
2814 U : constant Union_Id := Nodes.Table (N).Field4;
2820 return From_Union (U);
2824 function Uint5 (N : Node_Id) return Uint is
2825 pragma Assert (N in Nodes.First .. Nodes.Last);
2826 U : constant Union_Id := Nodes.Table (N).Field5;
2832 return From_Union (U);
2836 function Uint8 (N : Node_Id) return Uint is
2837 pragma Assert (Nkind (N) in N_Entity);
2838 U : constant Union_Id := Nodes.Table (N + 1).Field8;
2844 return From_Union (U);
2848 function Uint9 (N : Node_Id) return Uint is
2849 pragma Assert (Nkind (N) in N_Entity);
2850 U : constant Union_Id := Nodes.Table (N + 1).Field9;
2856 return From_Union (U);
2860 function Uint11 (N : Node_Id) return Uint is
2861 pragma Assert (Nkind (N) in N_Entity);
2862 U : constant Union_Id := Nodes.Table (N + 1).Field11;
2868 return From_Union (U);
2872 function Uint10 (N : Node_Id) return Uint is
2873 pragma Assert (Nkind (N) in N_Entity);
2874 U : constant Union_Id := Nodes.Table (N + 1).Field10;
2880 return From_Union (U);
2884 function Uint12 (N : Node_Id) return Uint is
2885 pragma Assert (Nkind (N) in N_Entity);
2886 U : constant Union_Id := Nodes.Table (N + 1).Field12;
2892 return From_Union (U);
2896 function Uint13 (N : Node_Id) return Uint is
2897 pragma Assert (Nkind (N) in N_Entity);
2898 U : constant Union_Id := Nodes.Table (N + 2).Field6;
2904 return From_Union (U);
2908 function Uint14 (N : Node_Id) return Uint is
2909 pragma Assert (Nkind (N) in N_Entity);
2910 U : constant Union_Id := Nodes.Table (N + 2).Field7;
2916 return From_Union (U);
2920 function Uint15 (N : Node_Id) return Uint is
2921 pragma Assert (Nkind (N) in N_Entity);
2922 U : constant Union_Id := Nodes.Table (N + 2).Field8;
2928 return From_Union (U);
2932 function Uint16 (N : Node_Id) return Uint is
2933 pragma Assert (Nkind (N) in N_Entity);
2934 U : constant Union_Id := Nodes.Table (N + 2).Field9;
2940 return From_Union (U);
2944 function Uint17 (N : Node_Id) return Uint is
2945 pragma Assert (Nkind (N) in N_Entity);
2946 U : constant Union_Id := Nodes.Table (N + 2).Field10;
2952 return From_Union (U);
2956 function Uint22 (N : Node_Id) return Uint is
2957 pragma Assert (Nkind (N) in N_Entity);
2958 U : constant Union_Id := Nodes.Table (N + 3).Field9;
2964 return From_Union (U);
2968 function Ureal3 (N : Node_Id) return Ureal is
2970 pragma Assert (N in Nodes.First .. Nodes.Last);
2971 return From_Union (Nodes.Table (N).Field3);
2974 function Ureal18 (N : Node_Id) return Ureal is
2976 pragma Assert (Nkind (N) in N_Entity);
2977 return From_Union (Nodes.Table (N + 2).Field11);
2980 function Ureal21 (N : Node_Id) return Ureal is
2982 pragma Assert (Nkind (N) in N_Entity);
2983 return From_Union (Nodes.Table (N + 3).Field8);
2986 function Flag4 (N : Node_Id) return Boolean is
2988 pragma Assert (N in Nodes.First .. Nodes.Last);
2989 return Nodes.Table (N).Flag4;
2992 function Flag5 (N : Node_Id) return Boolean is
2994 pragma Assert (N in Nodes.First .. Nodes.Last);
2995 return Nodes.Table (N).Flag5;
2998 function Flag6 (N : Node_Id) return Boolean is
3000 pragma Assert (N in Nodes.First .. Nodes.Last);
3001 return Nodes.Table (N).Flag6;
3004 function Flag7 (N : Node_Id) return Boolean is
3006 pragma Assert (N in Nodes.First .. Nodes.Last);
3007 return Nodes.Table (N).Flag7;
3010 function Flag8 (N : Node_Id) return Boolean is
3012 pragma Assert (N in Nodes.First .. Nodes.Last);
3013 return Nodes.Table (N).Flag8;
3016 function Flag9 (N : Node_Id) return Boolean is
3018 pragma Assert (N in Nodes.First .. Nodes.Last);
3019 return Nodes.Table (N).Flag9;
3022 function Flag10 (N : Node_Id) return Boolean is
3024 pragma Assert (N in Nodes.First .. Nodes.Last);
3025 return Nodes.Table (N).Flag10;
3028 function Flag11 (N : Node_Id) return Boolean is
3030 pragma Assert (N in Nodes.First .. Nodes.Last);
3031 return Nodes.Table (N).Flag11;
3034 function Flag12 (N : Node_Id) return Boolean is
3036 pragma Assert (N in Nodes.First .. Nodes.Last);
3037 return Nodes.Table (N).Flag12;
3040 function Flag13 (N : Node_Id) return Boolean is
3042 pragma Assert (N in Nodes.First .. Nodes.Last);
3043 return Nodes.Table (N).Flag13;
3046 function Flag14 (N : Node_Id) return Boolean is
3048 pragma Assert (N in Nodes.First .. Nodes.Last);
3049 return Nodes.Table (N).Flag14;
3052 function Flag15 (N : Node_Id) return Boolean is
3054 pragma Assert (N in Nodes.First .. Nodes.Last);
3055 return Nodes.Table (N).Flag15;
3058 function Flag16 (N : Node_Id) return Boolean is
3060 pragma Assert (N in Nodes.First .. Nodes.Last);
3061 return Nodes.Table (N).Flag16;
3064 function Flag17 (N : Node_Id) return Boolean is
3066 pragma Assert (N in Nodes.First .. Nodes.Last);
3067 return Nodes.Table (N).Flag17;
3070 function Flag18 (N : Node_Id) return Boolean is
3072 pragma Assert (N in Nodes.First .. Nodes.Last);
3073 return Nodes.Table (N).Flag18;
3076 function Flag19 (N : Node_Id) return Boolean is
3078 pragma Assert (Nkind (N) in N_Entity);
3079 return Nodes.Table (N + 1).In_List;
3082 function Flag20 (N : Node_Id) return Boolean is
3084 pragma Assert (Nkind (N) in N_Entity);
3085 return Nodes.Table (N + 1).Unused_1;
3088 function Flag21 (N : Node_Id) return Boolean is
3090 pragma Assert (Nkind (N) in N_Entity);
3091 return Nodes.Table (N + 1).Rewrite_Ins;
3094 function Flag22 (N : Node_Id) return Boolean is
3096 pragma Assert (Nkind (N) in N_Entity);
3097 return Nodes.Table (N + 1).Analyzed;
3100 function Flag23 (N : Node_Id) return Boolean is
3102 pragma Assert (Nkind (N) in N_Entity);
3103 return Nodes.Table (N + 1).Comes_From_Source;
3106 function Flag24 (N : Node_Id) return Boolean is
3108 pragma Assert (Nkind (N) in N_Entity);
3109 return Nodes.Table (N + 1).Error_Posted;
3112 function Flag25 (N : Node_Id) return Boolean is
3114 pragma Assert (Nkind (N) in N_Entity);
3115 return Nodes.Table (N + 1).Flag4;
3118 function Flag26 (N : Node_Id) return Boolean is
3120 pragma Assert (Nkind (N) in N_Entity);
3121 return Nodes.Table (N + 1).Flag5;
3124 function Flag27 (N : Node_Id) return Boolean is
3126 pragma Assert (Nkind (N) in N_Entity);
3127 return Nodes.Table (N + 1).Flag6;
3130 function Flag28 (N : Node_Id) return Boolean is
3132 pragma Assert (Nkind (N) in N_Entity);
3133 return Nodes.Table (N + 1).Flag7;
3136 function Flag29 (N : Node_Id) return Boolean is
3138 pragma Assert (Nkind (N) in N_Entity);
3139 return Nodes.Table (N + 1).Flag8;
3142 function Flag30 (N : Node_Id) return Boolean is
3144 pragma Assert (Nkind (N) in N_Entity);
3145 return Nodes.Table (N + 1).Flag9;
3148 function Flag31 (N : Node_Id) return Boolean is
3150 pragma Assert (Nkind (N) in N_Entity);
3151 return Nodes.Table (N + 1).Flag10;
3154 function Flag32 (N : Node_Id) return Boolean is
3156 pragma Assert (Nkind (N) in N_Entity);
3157 return Nodes.Table (N + 1).Flag11;
3160 function Flag33 (N : Node_Id) return Boolean is
3162 pragma Assert (Nkind (N) in N_Entity);
3163 return Nodes.Table (N + 1).Flag12;
3166 function Flag34 (N : Node_Id) return Boolean is
3168 pragma Assert (Nkind (N) in N_Entity);
3169 return Nodes.Table (N + 1).Flag13;
3172 function Flag35 (N : Node_Id) return Boolean is
3174 pragma Assert (Nkind (N) in N_Entity);
3175 return Nodes.Table (N + 1).Flag14;
3178 function Flag36 (N : Node_Id) return Boolean is
3180 pragma Assert (Nkind (N) in N_Entity);
3181 return Nodes.Table (N + 1).Flag15;
3184 function Flag37 (N : Node_Id) return Boolean is
3186 pragma Assert (Nkind (N) in N_Entity);
3187 return Nodes.Table (N + 1).Flag16;
3190 function Flag38 (N : Node_Id) return Boolean is
3192 pragma Assert (Nkind (N) in N_Entity);
3193 return Nodes.Table (N + 1).Flag17;
3196 function Flag39 (N : Node_Id) return Boolean is
3198 pragma Assert (Nkind (N) in N_Entity);
3199 return Nodes.Table (N + 1).Flag18;
3202 function Flag40 (N : Node_Id) return Boolean is
3204 pragma Assert (Nkind (N) in N_Entity);
3205 return Nodes.Table (N + 2).In_List;
3208 function Flag41 (N : Node_Id) return Boolean is
3210 pragma Assert (Nkind (N) in N_Entity);
3211 return Nodes.Table (N + 2).Unused_1;
3214 function Flag42 (N : Node_Id) return Boolean is
3216 pragma Assert (Nkind (N) in N_Entity);
3217 return Nodes.Table (N + 2).Rewrite_Ins;
3220 function Flag43 (N : Node_Id) return Boolean is
3222 pragma Assert (Nkind (N) in N_Entity);
3223 return Nodes.Table (N + 2).Analyzed;
3226 function Flag44 (N : Node_Id) return Boolean is
3228 pragma Assert (Nkind (N) in N_Entity);
3229 return Nodes.Table (N + 2).Comes_From_Source;
3232 function Flag45 (N : Node_Id) return Boolean is
3234 pragma Assert (Nkind (N) in N_Entity);
3235 return Nodes.Table (N + 2).Error_Posted;
3238 function Flag46 (N : Node_Id) return Boolean is
3240 pragma Assert (Nkind (N) in N_Entity);
3241 return Nodes.Table (N + 2).Flag4;
3244 function Flag47 (N : Node_Id) return Boolean is
3246 pragma Assert (Nkind (N) in N_Entity);
3247 return Nodes.Table (N + 2).Flag5;
3250 function Flag48 (N : Node_Id) return Boolean is
3252 pragma Assert (Nkind (N) in N_Entity);
3253 return Nodes.Table (N + 2).Flag6;
3256 function Flag49 (N : Node_Id) return Boolean is
3258 pragma Assert (Nkind (N) in N_Entity);
3259 return Nodes.Table (N + 2).Flag7;
3262 function Flag50 (N : Node_Id) return Boolean is
3264 pragma Assert (Nkind (N) in N_Entity);
3265 return Nodes.Table (N + 2).Flag8;
3268 function Flag51 (N : Node_Id) return Boolean is
3270 pragma Assert (Nkind (N) in N_Entity);
3271 return Nodes.Table (N + 2).Flag9;
3274 function Flag52 (N : Node_Id) return Boolean is
3276 pragma Assert (Nkind (N) in N_Entity);
3277 return Nodes.Table (N + 2).Flag10;
3280 function Flag53 (N : Node_Id) return Boolean is
3282 pragma Assert (Nkind (N) in N_Entity);
3283 return Nodes.Table (N + 2).Flag11;
3286 function Flag54 (N : Node_Id) return Boolean is
3288 pragma Assert (Nkind (N) in N_Entity);
3289 return Nodes.Table (N + 2).Flag12;
3292 function Flag55 (N : Node_Id) return Boolean is
3294 pragma Assert (Nkind (N) in N_Entity);
3295 return Nodes.Table (N + 2).Flag13;
3298 function Flag56 (N : Node_Id) return Boolean is
3300 pragma Assert (Nkind (N) in N_Entity);
3301 return Nodes.Table (N + 2).Flag14;
3304 function Flag57 (N : Node_Id) return Boolean is
3306 pragma Assert (Nkind (N) in N_Entity);
3307 return Nodes.Table (N + 2).Flag15;
3310 function Flag58 (N : Node_Id) return Boolean is
3312 pragma Assert (Nkind (N) in N_Entity);
3313 return Nodes.Table (N + 2).Flag16;
3316 function Flag59 (N : Node_Id) return Boolean is
3318 pragma Assert (Nkind (N) in N_Entity);
3319 return Nodes.Table (N + 2).Flag17;
3322 function Flag60 (N : Node_Id) return Boolean is
3324 pragma Assert (Nkind (N) in N_Entity);
3325 return Nodes.Table (N + 2).Flag18;
3328 function Flag61 (N : Node_Id) return Boolean is
3330 pragma Assert (Nkind (N) in N_Entity);
3331 return Nodes.Table (N + 1).Pflag1;
3334 function Flag62 (N : Node_Id) return Boolean is
3336 pragma Assert (Nkind (N) in N_Entity);
3337 return Nodes.Table (N + 1).Pflag2;
3340 function Flag63 (N : Node_Id) return Boolean is
3342 pragma Assert (Nkind (N) in N_Entity);
3343 return Nodes.Table (N + 2).Pflag1;
3346 function Flag64 (N : Node_Id) return Boolean is
3348 pragma Assert (Nkind (N) in N_Entity);
3349 return Nodes.Table (N + 2).Pflag2;
3352 function Flag65 (N : Node_Id) return Boolean is
3354 pragma Assert (Nkind (N) in N_Entity);
3355 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag65;
3358 function Flag66 (N : Node_Id) return Boolean is
3360 pragma Assert (Nkind (N) in N_Entity);
3361 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag66;
3364 function Flag67 (N : Node_Id) return Boolean is
3366 pragma Assert (Nkind (N) in N_Entity);
3367 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag67;
3370 function Flag68 (N : Node_Id) return Boolean is
3372 pragma Assert (Nkind (N) in N_Entity);
3373 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag68;
3376 function Flag69 (N : Node_Id) return Boolean is
3378 pragma Assert (Nkind (N) in N_Entity);
3379 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag69;
3382 function Flag70 (N : Node_Id) return Boolean is
3384 pragma Assert (Nkind (N) in N_Entity);
3385 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag70;
3388 function Flag71 (N : Node_Id) return Boolean is
3390 pragma Assert (Nkind (N) in N_Entity);
3391 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag71;
3394 function Flag72 (N : Node_Id) return Boolean is
3396 pragma Assert (Nkind (N) in N_Entity);
3397 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag72;
3400 function Flag73 (N : Node_Id) return Boolean is
3402 pragma Assert (Nkind (N) in N_Entity);
3403 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag73;
3406 function Flag74 (N : Node_Id) return Boolean is
3408 pragma Assert (Nkind (N) in N_Entity);
3409 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag74;
3412 function Flag75 (N : Node_Id) return Boolean is
3414 pragma Assert (Nkind (N) in N_Entity);
3415 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag75;
3418 function Flag76 (N : Node_Id) return Boolean is
3420 pragma Assert (Nkind (N) in N_Entity);
3421 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag76;
3424 function Flag77 (N : Node_Id) return Boolean is
3426 pragma Assert (Nkind (N) in N_Entity);
3427 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag77;
3430 function Flag78 (N : Node_Id) return Boolean is
3432 pragma Assert (Nkind (N) in N_Entity);
3433 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag78;
3436 function Flag79 (N : Node_Id) return Boolean is
3438 pragma Assert (Nkind (N) in N_Entity);
3439 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag79;
3442 function Flag80 (N : Node_Id) return Boolean is
3444 pragma Assert (Nkind (N) in N_Entity);
3445 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag80;
3448 function Flag81 (N : Node_Id) return Boolean is
3450 pragma Assert (Nkind (N) in N_Entity);
3451 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag81;
3454 function Flag82 (N : Node_Id) return Boolean is
3456 pragma Assert (Nkind (N) in N_Entity);
3457 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag82;
3460 function Flag83 (N : Node_Id) return Boolean is
3462 pragma Assert (Nkind (N) in N_Entity);
3463 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag83;
3466 function Flag84 (N : Node_Id) return Boolean is
3468 pragma Assert (Nkind (N) in N_Entity);
3469 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag84;
3472 function Flag85 (N : Node_Id) return Boolean is
3474 pragma Assert (Nkind (N) in N_Entity);
3475 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag85;
3478 function Flag86 (N : Node_Id) return Boolean is
3480 pragma Assert (Nkind (N) in N_Entity);
3481 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag86;
3484 function Flag87 (N : Node_Id) return Boolean is
3486 pragma Assert (Nkind (N) in N_Entity);
3487 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag87;
3490 function Flag88 (N : Node_Id) return Boolean is
3492 pragma Assert (Nkind (N) in N_Entity);
3493 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag88;
3496 function Flag89 (N : Node_Id) return Boolean is
3498 pragma Assert (Nkind (N) in N_Entity);
3499 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag89;
3502 function Flag90 (N : Node_Id) return Boolean is
3504 pragma Assert (Nkind (N) in N_Entity);
3505 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag90;
3508 function Flag91 (N : Node_Id) return Boolean is
3510 pragma Assert (Nkind (N) in N_Entity);
3511 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag91;
3514 function Flag92 (N : Node_Id) return Boolean is
3516 pragma Assert (Nkind (N) in N_Entity);
3517 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag92;
3520 function Flag93 (N : Node_Id) return Boolean is
3522 pragma Assert (Nkind (N) in N_Entity);
3523 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag93;
3526 function Flag94 (N : Node_Id) return Boolean is
3528 pragma Assert (Nkind (N) in N_Entity);
3529 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag94;
3532 function Flag95 (N : Node_Id) return Boolean is
3534 pragma Assert (Nkind (N) in N_Entity);
3535 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag95;
3538 function Flag96 (N : Node_Id) return Boolean is
3540 pragma Assert (Nkind (N) in N_Entity);
3541 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag96;
3544 function Flag97 (N : Node_Id) return Boolean is
3546 pragma Assert (Nkind (N) in N_Entity);
3547 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag97;
3550 function Flag98 (N : Node_Id) return Boolean is
3552 pragma Assert (Nkind (N) in N_Entity);
3553 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag98;
3556 function Flag99 (N : Node_Id) return Boolean is
3558 pragma Assert (Nkind (N) in N_Entity);
3559 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag99;
3562 function Flag100 (N : Node_Id) return Boolean is
3564 pragma Assert (Nkind (N) in N_Entity);
3565 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag100;
3568 function Flag101 (N : Node_Id) return Boolean is
3570 pragma Assert (Nkind (N) in N_Entity);
3571 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag101;
3574 function Flag102 (N : Node_Id) return Boolean is
3576 pragma Assert (Nkind (N) in N_Entity);
3577 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag102;
3580 function Flag103 (N : Node_Id) return Boolean is
3582 pragma Assert (Nkind (N) in N_Entity);
3583 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag103;
3586 function Flag104 (N : Node_Id) return Boolean is
3588 pragma Assert (Nkind (N) in N_Entity);
3589 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag104;
3592 function Flag105 (N : Node_Id) return Boolean is
3594 pragma Assert (Nkind (N) in N_Entity);
3595 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag105;
3598 function Flag106 (N : Node_Id) return Boolean is
3600 pragma Assert (Nkind (N) in N_Entity);
3601 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag106;
3604 function Flag107 (N : Node_Id) return Boolean is
3606 pragma Assert (Nkind (N) in N_Entity);
3607 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag107;
3610 function Flag108 (N : Node_Id) return Boolean is
3612 pragma Assert (Nkind (N) in N_Entity);
3613 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag108;
3616 function Flag109 (N : Node_Id) return Boolean is
3618 pragma Assert (Nkind (N) in N_Entity);
3619 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag109;
3622 function Flag110 (N : Node_Id) return Boolean is
3624 pragma Assert (Nkind (N) in N_Entity);
3625 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag110;
3628 function Flag111 (N : Node_Id) return Boolean is
3630 pragma Assert (Nkind (N) in N_Entity);
3631 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag111;
3634 function Flag112 (N : Node_Id) return Boolean is
3636 pragma Assert (Nkind (N) in N_Entity);
3637 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag112;
3640 function Flag113 (N : Node_Id) return Boolean is
3642 pragma Assert (Nkind (N) in N_Entity);
3643 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag113;
3646 function Flag114 (N : Node_Id) return Boolean is
3648 pragma Assert (Nkind (N) in N_Entity);
3649 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag114;
3652 function Flag115 (N : Node_Id) return Boolean is
3654 pragma Assert (Nkind (N) in N_Entity);
3655 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag115;
3658 function Flag116 (N : Node_Id) return Boolean is
3660 pragma Assert (Nkind (N) in N_Entity);
3661 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag116;
3664 function Flag117 (N : Node_Id) return Boolean is
3666 pragma Assert (Nkind (N) in N_Entity);
3667 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag117;
3670 function Flag118 (N : Node_Id) return Boolean is
3672 pragma Assert (Nkind (N) in N_Entity);
3673 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag118;
3676 function Flag119 (N : Node_Id) return Boolean is
3678 pragma Assert (Nkind (N) in N_Entity);
3679 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag119;
3682 function Flag120 (N : Node_Id) return Boolean is
3684 pragma Assert (Nkind (N) in N_Entity);
3685 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag120;
3688 function Flag121 (N : Node_Id) return Boolean is
3690 pragma Assert (Nkind (N) in N_Entity);
3691 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag121;
3694 function Flag122 (N : Node_Id) return Boolean is
3696 pragma Assert (Nkind (N) in N_Entity);
3697 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag122;
3700 function Flag123 (N : Node_Id) return Boolean is
3702 pragma Assert (Nkind (N) in N_Entity);
3703 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag123;
3706 function Flag124 (N : Node_Id) return Boolean is
3708 pragma Assert (Nkind (N) in N_Entity);
3709 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag124;
3712 function Flag125 (N : Node_Id) return Boolean is
3714 pragma Assert (Nkind (N) in N_Entity);
3715 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag125;
3718 function Flag126 (N : Node_Id) return Boolean is
3720 pragma Assert (Nkind (N) in N_Entity);
3721 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag126;
3724 function Flag127 (N : Node_Id) return Boolean is
3726 pragma Assert (Nkind (N) in N_Entity);
3727 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag127;
3730 function Flag128 (N : Node_Id) return Boolean is
3732 pragma Assert (Nkind (N) in N_Entity);
3733 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag128;
3736 function Flag129 (N : Node_Id) return Boolean is
3738 pragma Assert (Nkind (N) in N_Entity);
3739 return Nodes.Table (N + 3).In_List;
3742 function Flag130 (N : Node_Id) return Boolean is
3744 pragma Assert (Nkind (N) in N_Entity);
3745 return Nodes.Table (N + 3).Unused_1;
3748 function Flag131 (N : Node_Id) return Boolean is
3750 pragma Assert (Nkind (N) in N_Entity);
3751 return Nodes.Table (N + 3).Rewrite_Ins;
3754 function Flag132 (N : Node_Id) return Boolean is
3756 pragma Assert (Nkind (N) in N_Entity);
3757 return Nodes.Table (N + 3).Analyzed;
3760 function Flag133 (N : Node_Id) return Boolean is
3762 pragma Assert (Nkind (N) in N_Entity);
3763 return Nodes.Table (N + 3).Comes_From_Source;
3766 function Flag134 (N : Node_Id) return Boolean is
3768 pragma Assert (Nkind (N) in N_Entity);
3769 return Nodes.Table (N + 3).Error_Posted;
3772 function Flag135 (N : Node_Id) return Boolean is
3774 pragma Assert (Nkind (N) in N_Entity);
3775 return Nodes.Table (N + 3).Flag4;
3778 function Flag136 (N : Node_Id) return Boolean is
3780 pragma Assert (Nkind (N) in N_Entity);
3781 return Nodes.Table (N + 3).Flag5;
3784 function Flag137 (N : Node_Id) return Boolean is
3786 pragma Assert (Nkind (N) in N_Entity);
3787 return Nodes.Table (N + 3).Flag6;
3790 function Flag138 (N : Node_Id) return Boolean is
3792 pragma Assert (Nkind (N) in N_Entity);
3793 return Nodes.Table (N + 3).Flag7;
3796 function Flag139 (N : Node_Id) return Boolean is
3798 pragma Assert (Nkind (N) in N_Entity);
3799 return Nodes.Table (N + 3).Flag8;
3802 function Flag140 (N : Node_Id) return Boolean is
3804 pragma Assert (Nkind (N) in N_Entity);
3805 return Nodes.Table (N + 3).Flag9;
3808 function Flag141 (N : Node_Id) return Boolean is
3810 pragma Assert (Nkind (N) in N_Entity);
3811 return Nodes.Table (N + 3).Flag10;
3814 function Flag142 (N : Node_Id) return Boolean is
3816 pragma Assert (Nkind (N) in N_Entity);
3817 return Nodes.Table (N + 3).Flag11;
3820 function Flag143 (N : Node_Id) return Boolean is
3822 pragma Assert (Nkind (N) in N_Entity);
3823 return Nodes.Table (N + 3).Flag12;
3826 function Flag144 (N : Node_Id) return Boolean is
3828 pragma Assert (Nkind (N) in N_Entity);
3829 return Nodes.Table (N + 3).Flag13;
3832 function Flag145 (N : Node_Id) return Boolean is
3834 pragma Assert (Nkind (N) in N_Entity);
3835 return Nodes.Table (N + 3).Flag14;
3838 function Flag146 (N : Node_Id) return Boolean is
3840 pragma Assert (Nkind (N) in N_Entity);
3841 return Nodes.Table (N + 3).Flag15;
3844 function Flag147 (N : Node_Id) return Boolean is
3846 pragma Assert (Nkind (N) in N_Entity);
3847 return Nodes.Table (N + 3).Flag16;
3850 function Flag148 (N : Node_Id) return Boolean is
3852 pragma Assert (Nkind (N) in N_Entity);
3853 return Nodes.Table (N + 3).Flag17;
3856 function Flag149 (N : Node_Id) return Boolean is
3858 pragma Assert (Nkind (N) in N_Entity);
3859 return Nodes.Table (N + 3).Flag18;
3862 function Flag150 (N : Node_Id) return Boolean is
3864 pragma Assert (Nkind (N) in N_Entity);
3865 return Nodes.Table (N + 3).Pflag1;
3868 function Flag151 (N : Node_Id) return Boolean is
3870 pragma Assert (Nkind (N) in N_Entity);
3871 return Nodes.Table (N + 3).Pflag2;
3874 function Flag152 (N : Node_Id) return Boolean is
3876 pragma Assert (Nkind (N) in N_Entity);
3877 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag152;
3880 function Flag153 (N : Node_Id) return Boolean is
3882 pragma Assert (Nkind (N) in N_Entity);
3883 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag153;
3886 function Flag154 (N : Node_Id) return Boolean is
3888 pragma Assert (Nkind (N) in N_Entity);
3889 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag154;
3892 function Flag155 (N : Node_Id) return Boolean is
3894 pragma Assert (Nkind (N) in N_Entity);
3895 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag155;
3898 function Flag156 (N : Node_Id) return Boolean is
3900 pragma Assert (Nkind (N) in N_Entity);
3901 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag156;
3904 function Flag157 (N : Node_Id) return Boolean is
3906 pragma Assert (Nkind (N) in N_Entity);
3907 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag157;
3910 function Flag158 (N : Node_Id) return Boolean is
3912 pragma Assert (Nkind (N) in N_Entity);
3913 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag158;
3916 function Flag159 (N : Node_Id) return Boolean is
3918 pragma Assert (Nkind (N) in N_Entity);
3919 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag159;
3922 function Flag160 (N : Node_Id) return Boolean is
3924 pragma Assert (Nkind (N) in N_Entity);
3925 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag160;
3928 function Flag161 (N : Node_Id) return Boolean is
3930 pragma Assert (Nkind (N) in N_Entity);
3931 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag161;
3934 function Flag162 (N : Node_Id) return Boolean is
3936 pragma Assert (Nkind (N) in N_Entity);
3937 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag162;
3940 function Flag163 (N : Node_Id) return Boolean is
3942 pragma Assert (Nkind (N) in N_Entity);
3943 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag163;
3946 function Flag164 (N : Node_Id) return Boolean is
3948 pragma Assert (Nkind (N) in N_Entity);
3949 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag164;
3952 function Flag165 (N : Node_Id) return Boolean is
3954 pragma Assert (Nkind (N) in N_Entity);
3955 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag165;
3958 function Flag166 (N : Node_Id) return Boolean is
3960 pragma Assert (Nkind (N) in N_Entity);
3961 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag166;
3964 function Flag167 (N : Node_Id) return Boolean is
3966 pragma Assert (Nkind (N) in N_Entity);
3967 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag167;
3970 function Flag168 (N : Node_Id) return Boolean is
3972 pragma Assert (Nkind (N) in N_Entity);
3973 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag168;
3976 function Flag169 (N : Node_Id) return Boolean is
3978 pragma Assert (Nkind (N) in N_Entity);
3979 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag169;
3982 function Flag170 (N : Node_Id) return Boolean is
3984 pragma Assert (Nkind (N) in N_Entity);
3985 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag170;
3988 function Flag171 (N : Node_Id) return Boolean is
3990 pragma Assert (Nkind (N) in N_Entity);
3991 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag171;
3994 function Flag172 (N : Node_Id) return Boolean is
3996 pragma Assert (Nkind (N) in N_Entity);
3997 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag172;
4000 function Flag173 (N : Node_Id) return Boolean is
4002 pragma Assert (Nkind (N) in N_Entity);
4003 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag173;
4006 function Flag174 (N : Node_Id) return Boolean is
4008 pragma Assert (Nkind (N) in N_Entity);
4009 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag174;
4012 function Flag175 (N : Node_Id) return Boolean is
4014 pragma Assert (Nkind (N) in N_Entity);
4015 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag175;
4018 function Flag176 (N : Node_Id) return Boolean is
4020 pragma Assert (Nkind (N) in N_Entity);
4021 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag176;
4024 function Flag177 (N : Node_Id) return Boolean is
4026 pragma Assert (Nkind (N) in N_Entity);
4027 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag177;
4030 function Flag178 (N : Node_Id) return Boolean is
4032 pragma Assert (Nkind (N) in N_Entity);
4033 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag178;
4036 function Flag179 (N : Node_Id) return Boolean is
4038 pragma Assert (Nkind (N) in N_Entity);
4039 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag179;
4042 function Flag180 (N : Node_Id) return Boolean is
4044 pragma Assert (Nkind (N) in N_Entity);
4045 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag180;
4048 function Flag181 (N : Node_Id) return Boolean is
4050 pragma Assert (Nkind (N) in N_Entity);
4051 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag181;
4054 function Flag182 (N : Node_Id) return Boolean is
4056 pragma Assert (Nkind (N) in N_Entity);
4057 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag182;
4060 function Flag183 (N : Node_Id) return Boolean is
4062 pragma Assert (Nkind (N) in N_Entity);
4063 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag183;
4066 procedure Set_Nkind (N : Node_Id; Val : Node_Kind) is
4068 pragma Assert (N in Nodes.First .. Nodes.Last);
4069 Nodes.Table (N).Nkind := Val;
4072 procedure Set_Field1 (N : Node_Id; Val : Union_Id) is
4074 pragma Assert (N in Nodes.First .. Nodes.Last);
4075 Nodes.Table (N).Field1 := Val;
4078 procedure Set_Field2 (N : Node_Id; Val : Union_Id) is
4080 pragma Assert (N in Nodes.First .. Nodes.Last);
4081 Nodes.Table (N).Field2 := Val;
4084 procedure Set_Field3 (N : Node_Id; Val : Union_Id) is
4086 pragma Assert (N in Nodes.First .. Nodes.Last);
4087 Nodes.Table (N).Field3 := Val;
4090 procedure Set_Field4 (N : Node_Id; Val : Union_Id) is
4092 pragma Assert (N in Nodes.First .. Nodes.Last);
4093 Nodes.Table (N).Field4 := Val;
4096 procedure Set_Field5 (N : Node_Id; Val : Union_Id) is
4098 pragma Assert (N in Nodes.First .. Nodes.Last);
4099 Nodes.Table (N).Field5 := Val;
4102 procedure Set_Field6 (N : Node_Id; Val : Union_Id) is
4104 pragma Assert (Nkind (N) in N_Entity);
4105 Nodes.Table (N + 1).Field6 := Val;
4108 procedure Set_Field7 (N : Node_Id; Val : Union_Id) is
4110 pragma Assert (Nkind (N) in N_Entity);
4111 Nodes.Table (N + 1).Field7 := Val;
4114 procedure Set_Field8 (N : Node_Id; Val : Union_Id) is
4116 pragma Assert (Nkind (N) in N_Entity);
4117 Nodes.Table (N + 1).Field8 := Val;
4120 procedure Set_Field9 (N : Node_Id; Val : Union_Id) is
4122 pragma Assert (Nkind (N) in N_Entity);
4123 Nodes.Table (N + 1).Field9 := Val;
4126 procedure Set_Field10 (N : Node_Id; Val : Union_Id) is
4128 pragma Assert (Nkind (N) in N_Entity);
4129 Nodes.Table (N + 1).Field10 := Val;
4132 procedure Set_Field11 (N : Node_Id; Val : Union_Id) is
4134 pragma Assert (Nkind (N) in N_Entity);
4135 Nodes.Table (N + 1).Field11 := Val;
4138 procedure Set_Field12 (N : Node_Id; Val : Union_Id) is
4140 pragma Assert (Nkind (N) in N_Entity);
4141 Nodes.Table (N + 1).Field12 := Val;
4144 procedure Set_Field13 (N : Node_Id; Val : Union_Id) is
4146 pragma Assert (Nkind (N) in N_Entity);
4147 Nodes.Table (N + 2).Field6 := Val;
4150 procedure Set_Field14 (N : Node_Id; Val : Union_Id) is
4152 pragma Assert (Nkind (N) in N_Entity);
4153 Nodes.Table (N + 2).Field7 := Val;
4156 procedure Set_Field15 (N : Node_Id; Val : Union_Id) is
4158 pragma Assert (Nkind (N) in N_Entity);
4159 Nodes.Table (N + 2).Field8 := Val;
4162 procedure Set_Field16 (N : Node_Id; Val : Union_Id) is
4164 pragma Assert (Nkind (N) in N_Entity);
4165 Nodes.Table (N + 2).Field9 := Val;
4168 procedure Set_Field17 (N : Node_Id; Val : Union_Id) is
4170 pragma Assert (Nkind (N) in N_Entity);
4171 Nodes.Table (N + 2).Field10 := Val;
4174 procedure Set_Field18 (N : Node_Id; Val : Union_Id) is
4176 pragma Assert (Nkind (N) in N_Entity);
4177 Nodes.Table (N + 2).Field11 := Val;
4180 procedure Set_Field19 (N : Node_Id; Val : Union_Id) is
4182 pragma Assert (Nkind (N) in N_Entity);
4183 Nodes.Table (N + 3).Field6 := Val;
4186 procedure Set_Field20 (N : Node_Id; Val : Union_Id) is
4188 pragma Assert (Nkind (N) in N_Entity);
4189 Nodes.Table (N + 3).Field7 := Val;
4192 procedure Set_Field21 (N : Node_Id; Val : Union_Id) is
4194 pragma Assert (Nkind (N) in N_Entity);
4195 Nodes.Table (N + 3).Field8 := Val;
4198 procedure Set_Field22 (N : Node_Id; Val : Union_Id) is
4200 pragma Assert (Nkind (N) in N_Entity);
4201 Nodes.Table (N + 3).Field9 := Val;
4204 procedure Set_Field23 (N : Node_Id; Val : Union_Id) is
4206 pragma Assert (Nkind (N) in N_Entity);
4207 Nodes.Table (N + 3).Field10 := Val;
4210 procedure Set_Node1 (N : Node_Id; Val : Node_Id) is
4212 pragma Assert (N in Nodes.First .. Nodes.Last);
4213 Nodes.Table (N).Field1 := Union_Id (Val);
4216 procedure Set_Node2 (N : Node_Id; Val : Node_Id) is
4218 pragma Assert (N in Nodes.First .. Nodes.Last);
4219 Nodes.Table (N).Field2 := Union_Id (Val);
4222 procedure Set_Node3 (N : Node_Id; Val : Node_Id) is
4224 pragma Assert (N in Nodes.First .. Nodes.Last);
4225 Nodes.Table (N).Field3 := Union_Id (Val);
4228 procedure Set_Node4 (N : Node_Id; Val : Node_Id) is
4230 pragma Assert (N in Nodes.First .. Nodes.Last);
4231 Nodes.Table (N).Field4 := Union_Id (Val);
4234 procedure Set_Node5 (N : Node_Id; Val : Node_Id) is
4236 pragma Assert (N in Nodes.First .. Nodes.Last);
4237 Nodes.Table (N).Field5 := Union_Id (Val);
4240 procedure Set_Node6 (N : Node_Id; Val : Node_Id) is
4242 pragma Assert (Nkind (N) in N_Entity);
4243 Nodes.Table (N + 1).Field6 := Union_Id (Val);
4246 procedure Set_Node7 (N : Node_Id; Val : Node_Id) is
4248 pragma Assert (Nkind (N) in N_Entity);
4249 Nodes.Table (N + 1).Field7 := Union_Id (Val);
4252 procedure Set_Node8 (N : Node_Id; Val : Node_Id) is
4254 pragma Assert (Nkind (N) in N_Entity);
4255 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4258 procedure Set_Node9 (N : Node_Id; Val : Node_Id) is
4260 pragma Assert (Nkind (N) in N_Entity);
4261 Nodes.Table (N + 1).Field9 := Union_Id (Val);
4264 procedure Set_Node10 (N : Node_Id; Val : Node_Id) is
4266 pragma Assert (Nkind (N) in N_Entity);
4267 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4270 procedure Set_Node11 (N : Node_Id; Val : Node_Id) is
4272 pragma Assert (Nkind (N) in N_Entity);
4273 Nodes.Table (N + 1).Field11 := Union_Id (Val);
4276 procedure Set_Node12 (N : Node_Id; Val : Node_Id) is
4278 pragma Assert (Nkind (N) in N_Entity);
4279 Nodes.Table (N + 1).Field12 := Union_Id (Val);
4282 procedure Set_Node13 (N : Node_Id; Val : Node_Id) is
4284 pragma Assert (Nkind (N) in N_Entity);
4285 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4288 procedure Set_Node14 (N : Node_Id; Val : Node_Id) is
4290 pragma Assert (Nkind (N) in N_Entity);
4291 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4294 procedure Set_Node15 (N : Node_Id; Val : Node_Id) is
4296 pragma Assert (Nkind (N) in N_Entity);
4297 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4300 procedure Set_Node16 (N : Node_Id; Val : Node_Id) is
4302 pragma Assert (Nkind (N) in N_Entity);
4303 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4306 procedure Set_Node17 (N : Node_Id; Val : Node_Id) is
4308 pragma Assert (Nkind (N) in N_Entity);
4309 Nodes.Table (N + 2).Field10 := Union_Id (Val);
4312 procedure Set_Node18 (N : Node_Id; Val : Node_Id) is
4314 pragma Assert (Nkind (N) in N_Entity);
4315 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4318 procedure Set_Node19 (N : Node_Id; Val : Node_Id) is
4320 pragma Assert (Nkind (N) in N_Entity);
4321 Nodes.Table (N + 3).Field6 := Union_Id (Val);
4324 procedure Set_Node20 (N : Node_Id; Val : Node_Id) is
4326 pragma Assert (Nkind (N) in N_Entity);
4327 Nodes.Table (N + 3).Field7 := Union_Id (Val);
4330 procedure Set_Node21 (N : Node_Id; Val : Node_Id) is
4332 pragma Assert (Nkind (N) in N_Entity);
4333 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4336 procedure Set_Node22 (N : Node_Id; Val : Node_Id) is
4338 pragma Assert (Nkind (N) in N_Entity);
4339 Nodes.Table (N + 3).Field9 := Union_Id (Val);
4342 procedure Set_Node23 (N : Node_Id; Val : Node_Id) is
4344 pragma Assert (Nkind (N) in N_Entity);
4345 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4348 procedure Set_List1 (N : Node_Id; Val : List_Id) is
4350 pragma Assert (N in Nodes.First .. Nodes.Last);
4351 Nodes.Table (N).Field1 := Union_Id (Val);
4354 procedure Set_List2 (N : Node_Id; Val : List_Id) is
4356 pragma Assert (N in Nodes.First .. Nodes.Last);
4357 Nodes.Table (N).Field2 := Union_Id (Val);
4360 procedure Set_List3 (N : Node_Id; Val : List_Id) is
4362 pragma Assert (N in Nodes.First .. Nodes.Last);
4363 Nodes.Table (N).Field3 := Union_Id (Val);
4366 procedure Set_List4 (N : Node_Id; Val : List_Id) is
4368 pragma Assert (N in Nodes.First .. Nodes.Last);
4369 Nodes.Table (N).Field4 := Union_Id (Val);
4372 procedure Set_List5 (N : Node_Id; Val : List_Id) is
4374 pragma Assert (N in Nodes.First .. Nodes.Last);
4375 Nodes.Table (N).Field5 := Union_Id (Val);
4378 procedure Set_List10 (N : Node_Id; Val : List_Id) is
4380 pragma Assert (Nkind (N) in N_Entity);
4381 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4384 procedure Set_List14 (N : Node_Id; Val : List_Id) is
4386 pragma Assert (Nkind (N) in N_Entity);
4387 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4390 procedure Set_Elist2 (N : Node_Id; Val : Elist_Id) is
4392 Nodes.Table (N).Field2 := Union_Id (Val);
4395 procedure Set_Elist3 (N : Node_Id; Val : Elist_Id) is
4397 Nodes.Table (N).Field3 := Union_Id (Val);
4400 procedure Set_Elist4 (N : Node_Id; Val : Elist_Id) is
4402 Nodes.Table (N).Field4 := Union_Id (Val);
4405 procedure Set_Elist8 (N : Node_Id; Val : Elist_Id) is
4407 pragma Assert (Nkind (N) in N_Entity);
4408 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4411 procedure Set_Elist13 (N : Node_Id; Val : Elist_Id) is
4413 pragma Assert (Nkind (N) in N_Entity);
4414 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4417 procedure Set_Elist15 (N : Node_Id; Val : Elist_Id) is
4419 pragma Assert (Nkind (N) in N_Entity);
4420 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4423 procedure Set_Elist16 (N : Node_Id; Val : Elist_Id) is
4425 pragma Assert (Nkind (N) in N_Entity);
4426 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4429 procedure Set_Elist18 (N : Node_Id; Val : Elist_Id) is
4431 pragma Assert (Nkind (N) in N_Entity);
4432 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4435 procedure Set_Elist21 (N : Node_Id; Val : Elist_Id) is
4437 pragma Assert (Nkind (N) in N_Entity);
4438 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4441 procedure Set_Elist23 (N : Node_Id; Val : Elist_Id) is
4443 pragma Assert (Nkind (N) in N_Entity);
4444 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4447 procedure Set_Name1 (N : Node_Id; Val : Name_Id) is
4449 pragma Assert (N in Nodes.First .. Nodes.Last);
4450 Nodes.Table (N).Field1 := Union_Id (Val);
4453 procedure Set_Name2 (N : Node_Id; Val : Name_Id) is
4455 pragma Assert (N in Nodes.First .. Nodes.Last);
4456 Nodes.Table (N).Field2 := Union_Id (Val);
4459 procedure Set_Str3 (N : Node_Id; Val : String_Id) is
4461 pragma Assert (N in Nodes.First .. Nodes.Last);
4462 Nodes.Table (N).Field3 := Union_Id (Val);
4465 procedure Set_Uint3 (N : Node_Id; Val : Uint) is
4467 pragma Assert (N in Nodes.First .. Nodes.Last);
4468 Nodes.Table (N).Field3 := To_Union (Val);
4471 procedure Set_Uint4 (N : Node_Id; Val : Uint) is
4473 pragma Assert (N in Nodes.First .. Nodes.Last);
4474 Nodes.Table (N).Field4 := To_Union (Val);
4477 procedure Set_Uint5 (N : Node_Id; Val : Uint) is
4479 pragma Assert (N in Nodes.First .. Nodes.Last);
4480 Nodes.Table (N).Field5 := To_Union (Val);
4483 procedure Set_Uint8 (N : Node_Id; Val : Uint) is
4485 pragma Assert (Nkind (N) in N_Entity);
4486 Nodes.Table (N + 1).Field8 := To_Union (Val);
4489 procedure Set_Uint9 (N : Node_Id; Val : Uint) is
4491 pragma Assert (Nkind (N) in N_Entity);
4492 Nodes.Table (N + 1).Field9 := To_Union (Val);
4495 procedure Set_Uint10 (N : Node_Id; Val : Uint) is
4497 pragma Assert (Nkind (N) in N_Entity);
4498 Nodes.Table (N + 1).Field10 := To_Union (Val);
4501 procedure Set_Uint11 (N : Node_Id; Val : Uint) is
4503 pragma Assert (Nkind (N) in N_Entity);
4504 Nodes.Table (N + 1).Field11 := To_Union (Val);
4507 procedure Set_Uint12 (N : Node_Id; Val : Uint) is
4509 pragma Assert (Nkind (N) in N_Entity);
4510 Nodes.Table (N + 1).Field12 := To_Union (Val);
4513 procedure Set_Uint13 (N : Node_Id; Val : Uint) is
4515 pragma Assert (Nkind (N) in N_Entity);
4516 Nodes.Table (N + 2).Field6 := To_Union (Val);
4519 procedure Set_Uint14 (N : Node_Id; Val : Uint) is
4521 pragma Assert (Nkind (N) in N_Entity);
4522 Nodes.Table (N + 2).Field7 := To_Union (Val);
4525 procedure Set_Uint15 (N : Node_Id; Val : Uint) is
4527 pragma Assert (Nkind (N) in N_Entity);
4528 Nodes.Table (N + 2).Field8 := To_Union (Val);
4531 procedure Set_Uint16 (N : Node_Id; Val : Uint) is
4533 pragma Assert (Nkind (N) in N_Entity);
4534 Nodes.Table (N + 2).Field9 := To_Union (Val);
4537 procedure Set_Uint17 (N : Node_Id; Val : Uint) is
4539 pragma Assert (Nkind (N) in N_Entity);
4540 Nodes.Table (N + 2).Field10 := To_Union (Val);
4543 procedure Set_Uint22 (N : Node_Id; Val : Uint) is
4545 pragma Assert (Nkind (N) in N_Entity);
4546 Nodes.Table (N + 3).Field9 := To_Union (Val);
4549 procedure Set_Ureal3 (N : Node_Id; Val : Ureal) is
4551 pragma Assert (N in Nodes.First .. Nodes.Last);
4552 Nodes.Table (N).Field3 := To_Union (Val);
4555 procedure Set_Ureal18 (N : Node_Id; Val : Ureal) is
4557 pragma Assert (Nkind (N) in N_Entity);
4558 Nodes.Table (N + 2).Field11 := To_Union (Val);
4561 procedure Set_Ureal21 (N : Node_Id; Val : Ureal) is
4563 pragma Assert (Nkind (N) in N_Entity);
4564 Nodes.Table (N + 3).Field8 := To_Union (Val);
4567 procedure Set_Char_Code2 (N : Node_Id; Val : Char_Code) is
4569 pragma Assert (N in Nodes.First .. Nodes.Last);
4570 Nodes.Table (N).Field2 := Union_Id (Val) + Char_Code_Bias;
4573 procedure Set_Flag4 (N : Node_Id; Val : Boolean) is
4575 pragma Assert (N in Nodes.First .. Nodes.Last);
4576 Nodes.Table (N).Flag4 := Val;
4579 procedure Set_Flag5 (N : Node_Id; Val : Boolean) is
4581 pragma Assert (N in Nodes.First .. Nodes.Last);
4582 Nodes.Table (N).Flag5 := Val;
4585 procedure Set_Flag6 (N : Node_Id; Val : Boolean) is
4587 pragma Assert (N in Nodes.First .. Nodes.Last);
4588 Nodes.Table (N).Flag6 := Val;
4591 procedure Set_Flag7 (N : Node_Id; Val : Boolean) is
4593 pragma Assert (N in Nodes.First .. Nodes.Last);
4594 Nodes.Table (N).Flag7 := Val;
4597 procedure Set_Flag8 (N : Node_Id; Val : Boolean) is
4599 pragma Assert (N in Nodes.First .. Nodes.Last);
4600 Nodes.Table (N).Flag8 := Val;
4603 procedure Set_Flag9 (N : Node_Id; Val : Boolean) is
4605 pragma Assert (N in Nodes.First .. Nodes.Last);
4606 Nodes.Table (N).Flag9 := Val;
4609 procedure Set_Flag10 (N : Node_Id; Val : Boolean) is
4611 pragma Assert (N in Nodes.First .. Nodes.Last);
4612 Nodes.Table (N).Flag10 := Val;
4615 procedure Set_Flag11 (N : Node_Id; Val : Boolean) is
4617 pragma Assert (N in Nodes.First .. Nodes.Last);
4618 Nodes.Table (N).Flag11 := Val;
4621 procedure Set_Flag12 (N : Node_Id; Val : Boolean) is
4623 pragma Assert (N in Nodes.First .. Nodes.Last);
4624 Nodes.Table (N).Flag12 := Val;
4627 procedure Set_Flag13 (N : Node_Id; Val : Boolean) is
4629 pragma Assert (N in Nodes.First .. Nodes.Last);
4630 Nodes.Table (N).Flag13 := Val;
4633 procedure Set_Flag14 (N : Node_Id; Val : Boolean) is
4635 pragma Assert (N in Nodes.First .. Nodes.Last);
4636 Nodes.Table (N).Flag14 := Val;
4639 procedure Set_Flag15 (N : Node_Id; Val : Boolean) is
4641 pragma Assert (N in Nodes.First .. Nodes.Last);
4642 Nodes.Table (N).Flag15 := Val;
4645 procedure Set_Flag16 (N : Node_Id; Val : Boolean) is
4647 pragma Assert (N in Nodes.First .. Nodes.Last);
4648 Nodes.Table (N).Flag16 := Val;
4651 procedure Set_Flag17 (N : Node_Id; Val : Boolean) is
4653 pragma Assert (N in Nodes.First .. Nodes.Last);
4654 Nodes.Table (N).Flag17 := Val;
4657 procedure Set_Flag18 (N : Node_Id; Val : Boolean) is
4659 pragma Assert (N in Nodes.First .. Nodes.Last);
4660 Nodes.Table (N).Flag18 := Val;
4663 procedure Set_Flag19 (N : Node_Id; Val : Boolean) is
4665 pragma Assert (Nkind (N) in N_Entity);
4666 Nodes.Table (N + 1).In_List := Val;
4669 procedure Set_Flag20 (N : Node_Id; Val : Boolean) is
4671 pragma Assert (Nkind (N) in N_Entity);
4672 Nodes.Table (N + 1).Unused_1 := Val;
4675 procedure Set_Flag21 (N : Node_Id; Val : Boolean) is
4677 pragma Assert (Nkind (N) in N_Entity);
4678 Nodes.Table (N + 1).Rewrite_Ins := Val;
4681 procedure Set_Flag22 (N : Node_Id; Val : Boolean) is
4683 pragma Assert (Nkind (N) in N_Entity);
4684 Nodes.Table (N + 1).Analyzed := Val;
4687 procedure Set_Flag23 (N : Node_Id; Val : Boolean) is
4689 pragma Assert (Nkind (N) in N_Entity);
4690 Nodes.Table (N + 1).Comes_From_Source := Val;
4693 procedure Set_Flag24 (N : Node_Id; Val : Boolean) is
4695 pragma Assert (Nkind (N) in N_Entity);
4696 Nodes.Table (N + 1).Error_Posted := Val;
4699 procedure Set_Flag25 (N : Node_Id; Val : Boolean) is
4701 pragma Assert (Nkind (N) in N_Entity);
4702 Nodes.Table (N + 1).Flag4 := Val;
4705 procedure Set_Flag26 (N : Node_Id; Val : Boolean) is
4707 pragma Assert (Nkind (N) in N_Entity);
4708 Nodes.Table (N + 1).Flag5 := Val;
4711 procedure Set_Flag27 (N : Node_Id; Val : Boolean) is
4713 pragma Assert (Nkind (N) in N_Entity);
4714 Nodes.Table (N + 1).Flag6 := Val;
4717 procedure Set_Flag28 (N : Node_Id; Val : Boolean) is
4719 pragma Assert (Nkind (N) in N_Entity);
4720 Nodes.Table (N + 1).Flag7 := Val;
4723 procedure Set_Flag29 (N : Node_Id; Val : Boolean) is
4725 pragma Assert (Nkind (N) in N_Entity);
4726 Nodes.Table (N + 1).Flag8 := Val;
4729 procedure Set_Flag30 (N : Node_Id; Val : Boolean) is
4731 pragma Assert (Nkind (N) in N_Entity);
4732 Nodes.Table (N + 1).Flag9 := Val;
4735 procedure Set_Flag31 (N : Node_Id; Val : Boolean) is
4737 pragma Assert (Nkind (N) in N_Entity);
4738 Nodes.Table (N + 1).Flag10 := Val;
4741 procedure Set_Flag32 (N : Node_Id; Val : Boolean) is
4743 pragma Assert (Nkind (N) in N_Entity);
4744 Nodes.Table (N + 1).Flag11 := Val;
4747 procedure Set_Flag33 (N : Node_Id; Val : Boolean) is
4749 pragma Assert (Nkind (N) in N_Entity);
4750 Nodes.Table (N + 1).Flag12 := Val;
4753 procedure Set_Flag34 (N : Node_Id; Val : Boolean) is
4755 pragma Assert (Nkind (N) in N_Entity);
4756 Nodes.Table (N + 1).Flag13 := Val;
4759 procedure Set_Flag35 (N : Node_Id; Val : Boolean) is
4761 pragma Assert (Nkind (N) in N_Entity);
4762 Nodes.Table (N + 1).Flag14 := Val;
4765 procedure Set_Flag36 (N : Node_Id; Val : Boolean) is
4767 pragma Assert (Nkind (N) in N_Entity);
4768 Nodes.Table (N + 1).Flag15 := Val;
4771 procedure Set_Flag37 (N : Node_Id; Val : Boolean) is
4773 pragma Assert (Nkind (N) in N_Entity);
4774 Nodes.Table (N + 1).Flag16 := Val;
4777 procedure Set_Flag38 (N : Node_Id; Val : Boolean) is
4779 pragma Assert (Nkind (N) in N_Entity);
4780 Nodes.Table (N + 1).Flag17 := Val;
4783 procedure Set_Flag39 (N : Node_Id; Val : Boolean) is
4785 pragma Assert (Nkind (N) in N_Entity);
4786 Nodes.Table (N + 1).Flag18 := Val;
4789 procedure Set_Flag40 (N : Node_Id; Val : Boolean) is
4791 pragma Assert (Nkind (N) in N_Entity);
4792 Nodes.Table (N + 2).In_List := Val;
4795 procedure Set_Flag41 (N : Node_Id; Val : Boolean) is
4797 pragma Assert (Nkind (N) in N_Entity);
4798 Nodes.Table (N + 2).Unused_1 := Val;
4801 procedure Set_Flag42 (N : Node_Id; Val : Boolean) is
4803 pragma Assert (Nkind (N) in N_Entity);
4804 Nodes.Table (N + 2).Rewrite_Ins := Val;
4807 procedure Set_Flag43 (N : Node_Id; Val : Boolean) is
4809 pragma Assert (Nkind (N) in N_Entity);
4810 Nodes.Table (N + 2).Analyzed := Val;
4813 procedure Set_Flag44 (N : Node_Id; Val : Boolean) is
4815 pragma Assert (Nkind (N) in N_Entity);
4816 Nodes.Table (N + 2).Comes_From_Source := Val;
4819 procedure Set_Flag45 (N : Node_Id; Val : Boolean) is
4821 pragma Assert (Nkind (N) in N_Entity);
4822 Nodes.Table (N + 2).Error_Posted := Val;
4825 procedure Set_Flag46 (N : Node_Id; Val : Boolean) is
4827 pragma Assert (Nkind (N) in N_Entity);
4828 Nodes.Table (N + 2).Flag4 := Val;
4831 procedure Set_Flag47 (N : Node_Id; Val : Boolean) is
4833 pragma Assert (Nkind (N) in N_Entity);
4834 Nodes.Table (N + 2).Flag5 := Val;
4837 procedure Set_Flag48 (N : Node_Id; Val : Boolean) is
4839 pragma Assert (Nkind (N) in N_Entity);
4840 Nodes.Table (N + 2).Flag6 := Val;
4843 procedure Set_Flag49 (N : Node_Id; Val : Boolean) is
4845 pragma Assert (Nkind (N) in N_Entity);
4846 Nodes.Table (N + 2).Flag7 := Val;
4849 procedure Set_Flag50 (N : Node_Id; Val : Boolean) is
4851 pragma Assert (Nkind (N) in N_Entity);
4852 Nodes.Table (N + 2).Flag8 := Val;
4855 procedure Set_Flag51 (N : Node_Id; Val : Boolean) is
4857 pragma Assert (Nkind (N) in N_Entity);
4858 Nodes.Table (N + 2).Flag9 := Val;
4861 procedure Set_Flag52 (N : Node_Id; Val : Boolean) is
4863 pragma Assert (Nkind (N) in N_Entity);
4864 Nodes.Table (N + 2).Flag10 := Val;
4867 procedure Set_Flag53 (N : Node_Id; Val : Boolean) is
4869 pragma Assert (Nkind (N) in N_Entity);
4870 Nodes.Table (N + 2).Flag11 := Val;
4873 procedure Set_Flag54 (N : Node_Id; Val : Boolean) is
4875 pragma Assert (Nkind (N) in N_Entity);
4876 Nodes.Table (N + 2).Flag12 := Val;
4879 procedure Set_Flag55 (N : Node_Id; Val : Boolean) is
4881 pragma Assert (Nkind (N) in N_Entity);
4882 Nodes.Table (N + 2).Flag13 := Val;
4885 procedure Set_Flag56 (N : Node_Id; Val : Boolean) is
4887 pragma Assert (Nkind (N) in N_Entity);
4888 Nodes.Table (N + 2).Flag14 := Val;
4891 procedure Set_Flag57 (N : Node_Id; Val : Boolean) is
4893 pragma Assert (Nkind (N) in N_Entity);
4894 Nodes.Table (N + 2).Flag15 := Val;
4897 procedure Set_Flag58 (N : Node_Id; Val : Boolean) is
4899 pragma Assert (Nkind (N) in N_Entity);
4900 Nodes.Table (N + 2).Flag16 := Val;
4903 procedure Set_Flag59 (N : Node_Id; Val : Boolean) is
4905 pragma Assert (Nkind (N) in N_Entity);
4906 Nodes.Table (N + 2).Flag17 := Val;
4909 procedure Set_Flag60 (N : Node_Id; Val : Boolean) is
4911 pragma Assert (Nkind (N) in N_Entity);
4912 Nodes.Table (N + 2).Flag18 := Val;
4915 procedure Set_Flag61 (N : Node_Id; Val : Boolean) is
4917 pragma Assert (Nkind (N) in N_Entity);
4918 Nodes.Table (N + 1).Pflag1 := Val;
4921 procedure Set_Flag62 (N : Node_Id; Val : Boolean) is
4923 pragma Assert (Nkind (N) in N_Entity);
4924 Nodes.Table (N + 1).Pflag2 := Val;
4927 procedure Set_Flag63 (N : Node_Id; Val : Boolean) is
4929 pragma Assert (Nkind (N) in N_Entity);
4930 Nodes.Table (N + 2).Pflag1 := Val;
4933 procedure Set_Flag64 (N : Node_Id; Val : Boolean) is
4935 pragma Assert (Nkind (N) in N_Entity);
4936 Nodes.Table (N + 2).Pflag2 := Val;
4939 procedure Set_Flag65 (N : Node_Id; Val : Boolean) is
4941 pragma Assert (Nkind (N) in N_Entity);
4944 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag65 := Val;
4947 procedure Set_Flag66 (N : Node_Id; Val : Boolean) is
4949 pragma Assert (Nkind (N) in N_Entity);
4952 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag66 := Val;
4955 procedure Set_Flag67 (N : Node_Id; Val : Boolean) is
4957 pragma Assert (Nkind (N) in N_Entity);
4960 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag67 := Val;
4963 procedure Set_Flag68 (N : Node_Id; Val : Boolean) is
4965 pragma Assert (Nkind (N) in N_Entity);
4968 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag68 := Val;
4971 procedure Set_Flag69 (N : Node_Id; Val : Boolean) is
4973 pragma Assert (Nkind (N) in N_Entity);
4976 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag69 := Val;
4979 procedure Set_Flag70 (N : Node_Id; Val : Boolean) is
4981 pragma Assert (Nkind (N) in N_Entity);
4984 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag70 := Val;
4987 procedure Set_Flag71 (N : Node_Id; Val : Boolean) is
4989 pragma Assert (Nkind (N) in N_Entity);
4992 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag71 := Val;
4995 procedure Set_Flag72 (N : Node_Id; Val : Boolean) is
4997 pragma Assert (Nkind (N) in N_Entity);
5000 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag72 := Val;
5003 procedure Set_Flag73 (N : Node_Id; Val : Boolean) is
5005 pragma Assert (Nkind (N) in N_Entity);
5008 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag73 := Val;
5011 procedure Set_Flag74 (N : Node_Id; Val : Boolean) is
5013 pragma Assert (Nkind (N) in N_Entity);
5016 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag74 := Val;
5019 procedure Set_Flag75 (N : Node_Id; Val : Boolean) is
5021 pragma Assert (Nkind (N) in N_Entity);
5024 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag75 := Val;
5027 procedure Set_Flag76 (N : Node_Id; Val : Boolean) is
5029 pragma Assert (Nkind (N) in N_Entity);
5032 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag76 := Val;
5035 procedure Set_Flag77 (N : Node_Id; Val : Boolean) is
5037 pragma Assert (Nkind (N) in N_Entity);
5040 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag77 := Val;
5043 procedure Set_Flag78 (N : Node_Id; Val : Boolean) is
5045 pragma Assert (Nkind (N) in N_Entity);
5048 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag78 := Val;
5051 procedure Set_Flag79 (N : Node_Id; Val : Boolean) is
5053 pragma Assert (Nkind (N) in N_Entity);
5056 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag79 := Val;
5059 procedure Set_Flag80 (N : Node_Id; Val : Boolean) is
5061 pragma Assert (Nkind (N) in N_Entity);
5064 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag80 := Val;
5067 procedure Set_Flag81 (N : Node_Id; Val : Boolean) is
5069 pragma Assert (Nkind (N) in N_Entity);
5072 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag81 := Val;
5075 procedure Set_Flag82 (N : Node_Id; Val : Boolean) is
5077 pragma Assert (Nkind (N) in N_Entity);
5080 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag82 := Val;
5083 procedure Set_Flag83 (N : Node_Id; Val : Boolean) is
5085 pragma Assert (Nkind (N) in N_Entity);
5088 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag83 := Val;
5091 procedure Set_Flag84 (N : Node_Id; Val : Boolean) is
5093 pragma Assert (Nkind (N) in N_Entity);
5096 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag84 := Val;
5099 procedure Set_Flag85 (N : Node_Id; Val : Boolean) is
5101 pragma Assert (Nkind (N) in N_Entity);
5104 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag85 := Val;
5107 procedure Set_Flag86 (N : Node_Id; Val : Boolean) is
5109 pragma Assert (Nkind (N) in N_Entity);
5112 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag86 := Val;
5115 procedure Set_Flag87 (N : Node_Id; Val : Boolean) is
5117 pragma Assert (Nkind (N) in N_Entity);
5120 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag87 := Val;
5123 procedure Set_Flag88 (N : Node_Id; Val : Boolean) is
5125 pragma Assert (Nkind (N) in N_Entity);
5128 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag88 := Val;
5131 procedure Set_Flag89 (N : Node_Id; Val : Boolean) is
5133 pragma Assert (Nkind (N) in N_Entity);
5136 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag89 := Val;
5139 procedure Set_Flag90 (N : Node_Id; Val : Boolean) is
5141 pragma Assert (Nkind (N) in N_Entity);
5144 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag90 := Val;
5147 procedure Set_Flag91 (N : Node_Id; Val : Boolean) is
5149 pragma Assert (Nkind (N) in N_Entity);
5152 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag91 := Val;
5155 procedure Set_Flag92 (N : Node_Id; Val : Boolean) is
5157 pragma Assert (Nkind (N) in N_Entity);
5160 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag92 := Val;
5163 procedure Set_Flag93 (N : Node_Id; Val : Boolean) is
5165 pragma Assert (Nkind (N) in N_Entity);
5168 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag93 := Val;
5171 procedure Set_Flag94 (N : Node_Id; Val : Boolean) is
5173 pragma Assert (Nkind (N) in N_Entity);
5176 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag94 := Val;
5179 procedure Set_Flag95 (N : Node_Id; Val : Boolean) is
5181 pragma Assert (Nkind (N) in N_Entity);
5184 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag95 := Val;
5187 procedure Set_Flag96 (N : Node_Id; Val : Boolean) is
5189 pragma Assert (Nkind (N) in N_Entity);
5192 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag96 := Val;
5195 procedure Set_Flag97 (N : Node_Id; Val : Boolean) is
5197 pragma Assert (Nkind (N) in N_Entity);
5200 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag97 := Val;
5203 procedure Set_Flag98 (N : Node_Id; Val : Boolean) is
5205 pragma Assert (Nkind (N) in N_Entity);
5208 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag98 := Val;
5211 procedure Set_Flag99 (N : Node_Id; Val : Boolean) is
5213 pragma Assert (Nkind (N) in N_Entity);
5216 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag99 := Val;
5219 procedure Set_Flag100 (N : Node_Id; Val : Boolean) is
5221 pragma Assert (Nkind (N) in N_Entity);
5224 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag100 := Val;
5227 procedure Set_Flag101 (N : Node_Id; Val : Boolean) is
5229 pragma Assert (Nkind (N) in N_Entity);
5232 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag101 := Val;
5235 procedure Set_Flag102 (N : Node_Id; Val : Boolean) is
5237 pragma Assert (Nkind (N) in N_Entity);
5240 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag102 := Val;
5243 procedure Set_Flag103 (N : Node_Id; Val : Boolean) is
5245 pragma Assert (Nkind (N) in N_Entity);
5248 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag103 := Val;
5251 procedure Set_Flag104 (N : Node_Id; Val : Boolean) is
5253 pragma Assert (Nkind (N) in N_Entity);
5256 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag104 := Val;
5259 procedure Set_Flag105 (N : Node_Id; Val : Boolean) is
5261 pragma Assert (Nkind (N) in N_Entity);
5264 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag105 := Val;
5267 procedure Set_Flag106 (N : Node_Id; Val : Boolean) is
5269 pragma Assert (Nkind (N) in N_Entity);
5272 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag106 := Val;
5275 procedure Set_Flag107 (N : Node_Id; Val : Boolean) is
5277 pragma Assert (Nkind (N) in N_Entity);
5280 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag107 := Val;
5283 procedure Set_Flag108 (N : Node_Id; Val : Boolean) is
5285 pragma Assert (Nkind (N) in N_Entity);
5288 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag108 := Val;
5291 procedure Set_Flag109 (N : Node_Id; Val : Boolean) is
5293 pragma Assert (Nkind (N) in N_Entity);
5296 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag109 := Val;
5299 procedure Set_Flag110 (N : Node_Id; Val : Boolean) is
5301 pragma Assert (Nkind (N) in N_Entity);
5304 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag110 := Val;
5307 procedure Set_Flag111 (N : Node_Id; Val : Boolean) is
5309 pragma Assert (Nkind (N) in N_Entity);
5312 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag111 := Val;
5315 procedure Set_Flag112 (N : Node_Id; Val : Boolean) is
5317 pragma Assert (Nkind (N) in N_Entity);
5320 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag112 := Val;
5323 procedure Set_Flag113 (N : Node_Id; Val : Boolean) is
5325 pragma Assert (Nkind (N) in N_Entity);
5328 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag113 := Val;
5331 procedure Set_Flag114 (N : Node_Id; Val : Boolean) is
5333 pragma Assert (Nkind (N) in N_Entity);
5336 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag114 := Val;
5339 procedure Set_Flag115 (N : Node_Id; Val : Boolean) is
5341 pragma Assert (Nkind (N) in N_Entity);
5344 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag115 := Val;
5347 procedure Set_Flag116 (N : Node_Id; Val : Boolean) is
5349 pragma Assert (Nkind (N) in N_Entity);
5352 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag116 := Val;
5355 procedure Set_Flag117 (N : Node_Id; Val : Boolean) is
5357 pragma Assert (Nkind (N) in N_Entity);
5360 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag117 := Val;
5363 procedure Set_Flag118 (N : Node_Id; Val : Boolean) is
5365 pragma Assert (Nkind (N) in N_Entity);
5368 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag118 := Val;
5371 procedure Set_Flag119 (N : Node_Id; Val : Boolean) is
5373 pragma Assert (Nkind (N) in N_Entity);
5376 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag119 := Val;
5379 procedure Set_Flag120 (N : Node_Id; Val : Boolean) is
5381 pragma Assert (Nkind (N) in N_Entity);
5384 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag120 := Val;
5387 procedure Set_Flag121 (N : Node_Id; Val : Boolean) is
5389 pragma Assert (Nkind (N) in N_Entity);
5392 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag121 := Val;
5395 procedure Set_Flag122 (N : Node_Id; Val : Boolean) is
5397 pragma Assert (Nkind (N) in N_Entity);
5400 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag122 := Val;
5403 procedure Set_Flag123 (N : Node_Id; Val : Boolean) is
5405 pragma Assert (Nkind (N) in N_Entity);
5408 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag123 := Val;
5411 procedure Set_Flag124 (N : Node_Id; Val : Boolean) is
5413 pragma Assert (Nkind (N) in N_Entity);
5416 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag124 := Val;
5419 procedure Set_Flag125 (N : Node_Id; Val : Boolean) is
5421 pragma Assert (Nkind (N) in N_Entity);
5424 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag125 := Val;
5427 procedure Set_Flag126 (N : Node_Id; Val : Boolean) is
5429 pragma Assert (Nkind (N) in N_Entity);
5432 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag126 := Val;
5435 procedure Set_Flag127 (N : Node_Id; Val : Boolean) is
5437 pragma Assert (Nkind (N) in N_Entity);
5440 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag127 := Val;
5443 procedure Set_Flag128 (N : Node_Id; Val : Boolean) is
5445 pragma Assert (Nkind (N) in N_Entity);
5448 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag128 := Val;
5451 procedure Set_Flag129 (N : Node_Id; Val : Boolean) is
5453 pragma Assert (Nkind (N) in N_Entity);
5454 Nodes.Table (N + 3).In_List := Val;
5457 procedure Set_Flag130 (N : Node_Id; Val : Boolean) is
5459 pragma Assert (Nkind (N) in N_Entity);
5460 Nodes.Table (N + 3).Unused_1 := Val;
5463 procedure Set_Flag131 (N : Node_Id; Val : Boolean) is
5465 pragma Assert (Nkind (N) in N_Entity);
5466 Nodes.Table (N + 3).Rewrite_Ins := Val;
5469 procedure Set_Flag132 (N : Node_Id; Val : Boolean) is
5471 pragma Assert (Nkind (N) in N_Entity);
5472 Nodes.Table (N + 3).Analyzed := Val;
5475 procedure Set_Flag133 (N : Node_Id; Val : Boolean) is
5477 pragma Assert (Nkind (N) in N_Entity);
5478 Nodes.Table (N + 3).Comes_From_Source := Val;
5481 procedure Set_Flag134 (N : Node_Id; Val : Boolean) is
5483 pragma Assert (Nkind (N) in N_Entity);
5484 Nodes.Table (N + 3).Error_Posted := Val;
5487 procedure Set_Flag135 (N : Node_Id; Val : Boolean) is
5489 pragma Assert (Nkind (N) in N_Entity);
5490 Nodes.Table (N + 3).Flag4 := Val;
5493 procedure Set_Flag136 (N : Node_Id; Val : Boolean) is
5495 pragma Assert (Nkind (N) in N_Entity);
5496 Nodes.Table (N + 3).Flag5 := Val;
5499 procedure Set_Flag137 (N : Node_Id; Val : Boolean) is
5501 pragma Assert (Nkind (N) in N_Entity);
5502 Nodes.Table (N + 3).Flag6 := Val;
5505 procedure Set_Flag138 (N : Node_Id; Val : Boolean) is
5507 pragma Assert (Nkind (N) in N_Entity);
5508 Nodes.Table (N + 3).Flag7 := Val;
5511 procedure Set_Flag139 (N : Node_Id; Val : Boolean) is
5513 pragma Assert (Nkind (N) in N_Entity);
5514 Nodes.Table (N + 3).Flag8 := Val;
5517 procedure Set_Flag140 (N : Node_Id; Val : Boolean) is
5519 pragma Assert (Nkind (N) in N_Entity);
5520 Nodes.Table (N + 3).Flag9 := Val;
5523 procedure Set_Flag141 (N : Node_Id; Val : Boolean) is
5525 pragma Assert (Nkind (N) in N_Entity);
5526 Nodes.Table (N + 3).Flag10 := Val;
5529 procedure Set_Flag142 (N : Node_Id; Val : Boolean) is
5531 pragma Assert (Nkind (N) in N_Entity);
5532 Nodes.Table (N + 3).Flag11 := Val;
5535 procedure Set_Flag143 (N : Node_Id; Val : Boolean) is
5537 pragma Assert (Nkind (N) in N_Entity);
5538 Nodes.Table (N + 3).Flag12 := Val;
5541 procedure Set_Flag144 (N : Node_Id; Val : Boolean) is
5543 pragma Assert (Nkind (N) in N_Entity);
5544 Nodes.Table (N + 3).Flag13 := Val;
5547 procedure Set_Flag145 (N : Node_Id; Val : Boolean) is
5549 pragma Assert (Nkind (N) in N_Entity);
5550 Nodes.Table (N + 3).Flag14 := Val;
5553 procedure Set_Flag146 (N : Node_Id; Val : Boolean) is
5555 pragma Assert (Nkind (N) in N_Entity);
5556 Nodes.Table (N + 3).Flag15 := Val;
5559 procedure Set_Flag147 (N : Node_Id; Val : Boolean) is
5561 pragma Assert (Nkind (N) in N_Entity);
5562 Nodes.Table (N + 3).Flag16 := Val;
5565 procedure Set_Flag148 (N : Node_Id; Val : Boolean) is
5567 pragma Assert (Nkind (N) in N_Entity);
5568 Nodes.Table (N + 3).Flag17 := Val;
5571 procedure Set_Flag149 (N : Node_Id; Val : Boolean) is
5573 pragma Assert (Nkind (N) in N_Entity);
5574 Nodes.Table (N + 3).Flag18 := Val;
5577 procedure Set_Flag150 (N : Node_Id; Val : Boolean) is
5579 pragma Assert (Nkind (N) in N_Entity);
5580 Nodes.Table (N + 3).Pflag1 := Val;
5583 procedure Set_Flag151 (N : Node_Id; Val : Boolean) is
5585 pragma Assert (Nkind (N) in N_Entity);
5586 Nodes.Table (N + 3).Pflag2 := Val;
5589 procedure Set_Flag152 (N : Node_Id; Val : Boolean) is
5591 pragma Assert (Nkind (N) in N_Entity);
5594 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag152 := Val;
5597 procedure Set_Flag153 (N : Node_Id; Val : Boolean) is
5599 pragma Assert (Nkind (N) in N_Entity);
5602 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag153 := Val;
5605 procedure Set_Flag154 (N : Node_Id; Val : Boolean) is
5607 pragma Assert (Nkind (N) in N_Entity);
5610 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag154 := Val;
5613 procedure Set_Flag155 (N : Node_Id; Val : Boolean) is
5615 pragma Assert (Nkind (N) in N_Entity);
5618 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag155 := Val;
5621 procedure Set_Flag156 (N : Node_Id; Val : Boolean) is
5623 pragma Assert (Nkind (N) in N_Entity);
5626 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag156 := Val;
5629 procedure Set_Flag157 (N : Node_Id; Val : Boolean) is
5631 pragma Assert (Nkind (N) in N_Entity);
5634 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag157 := Val;
5637 procedure Set_Flag158 (N : Node_Id; Val : Boolean) is
5639 pragma Assert (Nkind (N) in N_Entity);
5642 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag158 := Val;
5645 procedure Set_Flag159 (N : Node_Id; Val : Boolean) is
5647 pragma Assert (Nkind (N) in N_Entity);
5650 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag159 := Val;
5653 procedure Set_Flag160 (N : Node_Id; Val : Boolean) is
5655 pragma Assert (Nkind (N) in N_Entity);
5658 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag160 := Val;
5661 procedure Set_Flag161 (N : Node_Id; Val : Boolean) is
5663 pragma Assert (Nkind (N) in N_Entity);
5666 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag161 := Val;
5669 procedure Set_Flag162 (N : Node_Id; Val : Boolean) is
5671 pragma Assert (Nkind (N) in N_Entity);
5674 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag162 := Val;
5677 procedure Set_Flag163 (N : Node_Id; Val : Boolean) is
5679 pragma Assert (Nkind (N) in N_Entity);
5682 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag163 := Val;
5685 procedure Set_Flag164 (N : Node_Id; Val : Boolean) is
5687 pragma Assert (Nkind (N) in N_Entity);
5690 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag164 := Val;
5693 procedure Set_Flag165 (N : Node_Id; Val : Boolean) is
5695 pragma Assert (Nkind (N) in N_Entity);
5698 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag165 := Val;
5701 procedure Set_Flag166 (N : Node_Id; Val : Boolean) is
5703 pragma Assert (Nkind (N) in N_Entity);
5706 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag166 := Val;
5709 procedure Set_Flag167 (N : Node_Id; Val : Boolean) is
5711 pragma Assert (Nkind (N) in N_Entity);
5714 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag167 := Val;
5717 procedure Set_Flag168 (N : Node_Id; Val : Boolean) is
5719 pragma Assert (Nkind (N) in N_Entity);
5722 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag168 := Val;
5725 procedure Set_Flag169 (N : Node_Id; Val : Boolean) is
5727 pragma Assert (Nkind (N) in N_Entity);
5730 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag169 := Val;
5733 procedure Set_Flag170 (N : Node_Id; Val : Boolean) is
5735 pragma Assert (Nkind (N) in N_Entity);
5738 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag170 := Val;
5741 procedure Set_Flag171 (N : Node_Id; Val : Boolean) is
5743 pragma Assert (Nkind (N) in N_Entity);
5746 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag171 := Val;
5749 procedure Set_Flag172 (N : Node_Id; Val : Boolean) is
5751 pragma Assert (Nkind (N) in N_Entity);
5754 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag172 := Val;
5757 procedure Set_Flag173 (N : Node_Id; Val : Boolean) is
5759 pragma Assert (Nkind (N) in N_Entity);
5762 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag173 := Val;
5765 procedure Set_Flag174 (N : Node_Id; Val : Boolean) is
5767 pragma Assert (Nkind (N) in N_Entity);
5770 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag174 := Val;
5773 procedure Set_Flag175 (N : Node_Id; Val : Boolean) is
5775 pragma Assert (Nkind (N) in N_Entity);
5778 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag175 := Val;
5781 procedure Set_Flag176 (N : Node_Id; Val : Boolean) is
5783 pragma Assert (Nkind (N) in N_Entity);
5786 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag176 := Val;
5789 procedure Set_Flag177 (N : Node_Id; Val : Boolean) is
5791 pragma Assert (Nkind (N) in N_Entity);
5794 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag177 := Val;
5797 procedure Set_Flag178 (N : Node_Id; Val : Boolean) is
5799 pragma Assert (Nkind (N) in N_Entity);
5802 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag178 := Val;
5805 procedure Set_Flag179 (N : Node_Id; Val : Boolean) is
5807 pragma Assert (Nkind (N) in N_Entity);
5810 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag179 := Val;
5813 procedure Set_Flag180 (N : Node_Id; Val : Boolean) is
5815 pragma Assert (Nkind (N) in N_Entity);
5818 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag180 := Val;
5821 procedure Set_Flag181 (N : Node_Id; Val : Boolean) is
5823 pragma Assert (Nkind (N) in N_Entity);
5826 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag181 := Val;
5829 procedure Set_Flag182 (N : Node_Id; Val : Boolean) is
5831 pragma Assert (Nkind (N) in N_Entity);
5834 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag182 := Val;
5837 procedure Set_Flag183 (N : Node_Id; Val : Boolean) is
5839 pragma Assert (Nkind (N) in N_Entity);
5842 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag183 := Val;
5845 procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id) is
5847 pragma Assert (N in Nodes.First .. Nodes.Last);
5848 if Val > Error then Set_Parent (Val, N); end if;
5850 end Set_Node1_With_Parent;
5852 procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id) is
5854 pragma Assert (N in Nodes.First .. Nodes.Last);
5855 if Val > Error then Set_Parent (Val, N); end if;
5857 end Set_Node2_With_Parent;
5859 procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id) is
5861 pragma Assert (N in Nodes.First .. Nodes.Last);
5862 if Val > Error then Set_Parent (Val, N); end if;
5864 end Set_Node3_With_Parent;
5866 procedure Set_Node4_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_Node4_With_Parent;
5873 procedure Set_Node5_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_Node5_With_Parent;
5880 procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id) is
5882 pragma Assert (N in Nodes.First .. Nodes.Last);
5883 if Val /= No_List and then Val /= Error_List then
5884 Set_Parent (Val, N);
5887 end Set_List1_With_Parent;
5889 procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id) is
5891 pragma Assert (N in Nodes.First .. Nodes.Last);
5892 if Val /= No_List and then Val /= Error_List then
5893 Set_Parent (Val, N);
5896 end Set_List2_With_Parent;
5898 procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id) is
5900 pragma Assert (N in Nodes.First .. Nodes.Last);
5901 if Val /= No_List and then Val /= Error_List then
5902 Set_Parent (Val, N);
5905 end Set_List3_With_Parent;
5907 procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id) is
5909 pragma Assert (N in Nodes.First .. Nodes.Last);
5910 if Val /= No_List and then Val /= Error_List then
5911 Set_Parent (Val, N);
5914 end Set_List4_With_Parent;
5916 procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id) is
5918 pragma Assert (N in Nodes.First .. Nodes.Last);
5919 if Val /= No_List and then Val /= Error_List then
5920 Set_Parent (Val, N);
5923 end Set_List5_With_Parent;
5925 end Unchecked_Access;