1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2010, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Atree; use Atree;
27 with Csets; use Csets;
28 with Debug; use Debug;
29 with Einfo; use Einfo;
30 with Elists; use Elists;
32 with Namet; use Namet;
33 with Nlists; use Nlists;
34 with Output; use Output;
35 with Sem_Mech; use Sem_Mech;
36 with Sinfo; use Sinfo;
37 with Snames; use Snames;
38 with Sinput; use Sinput;
39 with Stand; use Stand;
40 with Stringt; use Stringt;
41 with SCIL_LL; use SCIL_LL;
42 with Treeprs; use Treeprs;
43 with Uintp; use Uintp;
44 with Urealp; use Urealp;
45 with Uname; use Uname;
46 with Unchecked_Deallocation;
48 package body Treepr is
50 use Atree.Unchecked_Access;
51 -- This module uses the unchecked access functions in package Atree
52 -- since it does an untyped traversal of the tree (we do not want to
53 -- count on the structure of the tree being correct in this routine!)
55 ----------------------------------
56 -- Approach Used for Tree Print --
57 ----------------------------------
59 -- When a complete subtree is being printed, a trace phase first marks
60 -- the nodes and lists to be printed. This trace phase allocates logical
61 -- numbers corresponding to the order in which the nodes and lists will
62 -- be printed. The Node_Id, List_Id and Elist_Id values are mapped to
63 -- logical node numbers using a hash table. Output is done using a set
64 -- of Print_xxx routines, which are similar to the Write_xxx routines
65 -- with the same name, except that they do not generate any output in
66 -- the marking phase. This allows identical logic to be used in the
69 -- Note that the hash table not only holds the serial numbers, but also
70 -- acts as a record of which nodes have already been visited. In the
71 -- marking phase, a node has been visited if it is already in the hash
72 -- table, and in the printing phase, we can tell whether a node has
73 -- already been printed by looking at the value of the serial number.
75 ----------------------
76 -- Global Variables --
77 ----------------------
79 type Hash_Record is record
81 -- Serial number for hash table entry. A value of zero means that
82 -- the entry is currently unused.
85 -- If serial number field is non-zero, contains corresponding Id value
88 type Hash_Table_Type is array (Nat range <>) of Hash_Record;
89 type Access_Hash_Table_Type is access Hash_Table_Type;
90 Hash_Table : Access_Hash_Table_Type;
91 -- The hash table itself, see Serial_Number function for details of use
94 -- Range of Hash_Table is from 0 .. Hash_Table_Len - 1 so that dividing
95 -- by Hash_Table_Len gives a remainder that is in Hash_Table'Range.
97 Next_Serial_Number : Nat;
98 -- Number of last visited node or list. Used during the marking phase to
99 -- set proper node numbers in the hash table, and during the printing
100 -- phase to make sure that a given node is not printed more than once.
101 -- (nodes are printed in order during the printing phase, that's the
102 -- point of numbering them in the first place!)
104 Printing_Descendants : Boolean;
105 -- True if descendants are being printed, False if not. In the false case,
106 -- only node Id's are printed. In the true case, node numbers as well as
107 -- node Id's are printed, as described above.
109 type Phase_Type is (Marking, Printing);
110 -- Type for Phase variable
113 -- When an entire tree is being printed, the traversal operates in two
114 -- phases. The first phase marks the nodes in use by installing node
115 -- numbers in the node number table. The second phase prints the nodes.
116 -- This variable indicates the current phase.
118 ----------------------
119 -- Local Procedures --
120 ----------------------
122 procedure Print_End_Span (N : Node_Id);
123 -- Special routine to print contents of End_Span field of node N.
124 -- The format includes the implicit source location as well as the
125 -- value of the field.
127 procedure Print_Init;
128 -- Initialize for printing of tree with descendents
130 procedure Print_Term;
131 -- Clean up after printing of tree with descendents
133 procedure Print_Char (C : Character);
134 -- Print character C if currently in print phase, noop if in marking phase
136 procedure Print_Name (N : Name_Id);
137 -- Print name from names table if currently in print phase, noop if in
138 -- marking phase. Note that the name is output in mixed case mode.
140 procedure Print_Node_Kind (N : Node_Id);
141 -- Print node kind name in mixed case if in print phase, noop if in
144 procedure Print_Str (S : String);
145 -- Print string S if currently in print phase, noop if in marking phase
147 procedure Print_Str_Mixed_Case (S : String);
148 -- Like Print_Str, except that the string is printed in mixed case mode
150 procedure Print_Int (I : Int);
151 -- Print integer I if currently in print phase, noop if in marking phase
154 -- Print end of line if currently in print phase, noop if in marking phase
156 procedure Print_Node_Ref (N : Node_Id);
157 -- Print "<empty>", "<error>" or "Node #nnn" with additional information
158 -- in the latter case, including the Id and the Nkind of the node.
160 procedure Print_List_Ref (L : List_Id);
161 -- Print "<no list>", or "<empty node list>" or "Node list #nnn"
163 procedure Print_Elist_Ref (E : Elist_Id);
164 -- Print "<no elist>", or "<empty element list>" or "Element list #nnn"
166 procedure Print_Entity_Info (Ent : Entity_Id; Prefix : String);
167 -- Called if the node being printed is an entity. Prints fields from the
168 -- extension, using routines in Einfo to get the field names and flags.
170 procedure Print_Field (Val : Union_Id; Format : UI_Format := Auto);
171 -- Print representation of Field value (name, tree, string, uint, charcode)
172 -- The format parameter controls the format of printing in the case of an
173 -- integer value (see UI_Write for details).
175 procedure Print_Flag (F : Boolean);
176 -- Print True or False
181 Prefix_Char : Character);
182 -- This is the internal routine used to print a single node. Each line of
183 -- output is preceded by Prefix_Str (which is used to set the indentation
184 -- level and the bars used to link list elements). In addition, for lines
185 -- other than the first, an additional character Prefix_Char is output.
187 function Serial_Number (Id : Int) return Nat;
188 -- Given a Node_Id, List_Id or Elist_Id, returns the previously assigned
189 -- serial number, or zero if no serial number has yet been assigned.
191 procedure Set_Serial_Number;
192 -- Can be called only immediately following a call to Serial_Number that
193 -- returned a value of zero. Causes the value of Next_Serial_Number to be
194 -- placed in the hash table (corresponding to the Id argument used in the
195 -- Serial_Number call), and increments Next_Serial_Number.
200 Prefix_Char : Character);
201 -- Called to process a single node in the case where descendents are to
202 -- be printed before every line, and Prefix_Char added to all lines
203 -- except the header line for the node.
205 procedure Visit_List (L : List_Id; Prefix_Str : String);
206 -- Visit_List is called to process a list in the case where descendents
207 -- are to be printed. Prefix_Str is to be added to all printed lines.
209 procedure Visit_Elist (E : Elist_Id; Prefix_Str : String);
210 -- Visit_Elist is called to process an element list in the case where
211 -- descendents are to be printed. Prefix_Str is to be added to all
218 procedure pe (E : Elist_Id) is
220 Print_Tree_Elist (E);
227 procedure pl (L : Int) is
234 -- This is the case where we transform e.g. +36 to -99999936
238 Lid := -(99999990 + L);
240 Lid := -(99999900 + L);
242 Lid := -(99999000 + L);
244 Lid := -(99990000 + L);
245 elsif L <= 99999 then
246 Lid := -(99900000 + L);
247 elsif L <= 999999 then
248 Lid := -(99000000 + L);
249 elsif L <= 9999999 then
250 Lid := -(90000000 + L);
256 -- Now output the list
258 Print_Tree_List (List_Id (Lid));
265 procedure pn (N : Node_Id) is
274 procedure Print_Char (C : Character) is
276 if Phase = Printing then
281 ---------------------
282 -- Print_Elist_Ref --
283 ---------------------
285 procedure Print_Elist_Ref (E : Elist_Id) is
287 if Phase /= Printing then
292 Write_Str ("<no elist>");
294 elsif Is_Empty_Elmt_List (E) then
295 Write_Str ("Empty elist, (Elist_Id=");
300 Write_Str ("(Elist_Id=");
304 if Printing_Descendants then
306 Write_Int (Serial_Number (Int (E)));
311 -------------------------
312 -- Print_Elist_Subtree --
313 -------------------------
315 procedure Print_Elist_Subtree (E : Elist_Id) is
319 Next_Serial_Number := 1;
323 Next_Serial_Number := 1;
328 end Print_Elist_Subtree;
334 procedure Print_End_Span (N : Node_Id) is
335 Val : constant Uint := End_Span (N);
339 Write_Str (" (Uint = ");
340 Write_Int (Int (Field5 (N)));
343 if Val /= No_Uint then
344 Write_Location (End_Location (N));
348 -----------------------
349 -- Print_Entity_Info --
350 -----------------------
352 procedure Print_Entity_Info (Ent : Entity_Id; Prefix : String) is
353 function Field_Present (U : Union_Id) return Boolean;
354 -- Returns False unless the value U represents a missing value
355 -- (Empty, No_Uint, No_Ureal or No_String)
357 function Field_Present (U : Union_Id) return Boolean is
360 U /= Union_Id (Empty) and then
361 U /= To_Union (No_Uint) and then
362 U /= To_Union (No_Ureal) and then
363 U /= Union_Id (No_String);
366 -- Start of processing for Print_Entity_Info
370 Print_Str ("Ekind = ");
371 Print_Str_Mixed_Case (Entity_Kind'Image (Ekind (Ent)));
375 Print_Str ("Etype = ");
376 Print_Node_Ref (Etype (Ent));
379 if Convention (Ent) /= Convention_Ada then
381 Print_Str ("Convention = ");
383 -- Print convention name skipping the Convention_ at the start
386 S : constant String := Convention_Id'Image (Convention (Ent));
389 Print_Str_Mixed_Case (S (12 .. S'Last));
394 if Field_Present (Field6 (Ent)) then
396 Write_Field6_Name (Ent);
398 Print_Field (Field6 (Ent));
402 if Field_Present (Field7 (Ent)) then
404 Write_Field7_Name (Ent);
406 Print_Field (Field7 (Ent));
410 if Field_Present (Field8 (Ent)) then
412 Write_Field8_Name (Ent);
414 Print_Field (Field8 (Ent));
418 if Field_Present (Field9 (Ent)) then
420 Write_Field9_Name (Ent);
422 Print_Field (Field9 (Ent));
426 if Field_Present (Field10 (Ent)) then
428 Write_Field10_Name (Ent);
430 Print_Field (Field10 (Ent));
434 if Field_Present (Field11 (Ent)) then
436 Write_Field11_Name (Ent);
438 Print_Field (Field11 (Ent));
442 if Field_Present (Field12 (Ent)) then
444 Write_Field12_Name (Ent);
446 Print_Field (Field12 (Ent));
450 if Field_Present (Field13 (Ent)) then
452 Write_Field13_Name (Ent);
454 Print_Field (Field13 (Ent));
458 if Field_Present (Field14 (Ent)) then
460 Write_Field14_Name (Ent);
462 Print_Field (Field14 (Ent));
466 if Field_Present (Field15 (Ent)) then
468 Write_Field15_Name (Ent);
470 Print_Field (Field15 (Ent));
474 if Field_Present (Field16 (Ent)) then
476 Write_Field16_Name (Ent);
478 Print_Field (Field16 (Ent));
482 if Field_Present (Field17 (Ent)) then
484 Write_Field17_Name (Ent);
486 Print_Field (Field17 (Ent));
490 if Field_Present (Field18 (Ent)) then
492 Write_Field18_Name (Ent);
494 Print_Field (Field18 (Ent));
498 if Field_Present (Field19 (Ent)) then
500 Write_Field19_Name (Ent);
502 Print_Field (Field19 (Ent));
506 if Field_Present (Field20 (Ent)) then
508 Write_Field20_Name (Ent);
510 Print_Field (Field20 (Ent));
514 if Field_Present (Field21 (Ent)) then
516 Write_Field21_Name (Ent);
518 Print_Field (Field21 (Ent));
522 if Field_Present (Field22 (Ent)) then
524 Write_Field22_Name (Ent);
527 -- Mechanism case has to be handled specially
529 if Ekind (Ent) = E_Function or else Is_Formal (Ent) then
531 M : constant Mechanism_Type := Mechanism (Ent);
535 when Default_Mechanism
536 => Write_Str ("Default");
538 => Write_Str ("By_Copy");
540 => Write_Str ("By_Reference");
542 => Write_Str ("By_Descriptor");
543 when By_Descriptor_UBS
544 => Write_Str ("By_Descriptor_UBS");
545 when By_Descriptor_UBSB
546 => Write_Str ("By_Descriptor_UBSB");
547 when By_Descriptor_UBA
548 => Write_Str ("By_Descriptor_UBA");
550 => Write_Str ("By_Descriptor_S");
551 when By_Descriptor_SB
552 => Write_Str ("By_Descriptor_SB");
554 => Write_Str ("By_Descriptor_A");
555 when By_Descriptor_NCA
556 => Write_Str ("By_Descriptor_NCA");
557 when By_Short_Descriptor
558 => Write_Str ("By_Short_Descriptor");
559 when By_Short_Descriptor_UBS
560 => Write_Str ("By_Short_Descriptor_UBS");
561 when By_Short_Descriptor_UBSB
562 => Write_Str ("By_Short_Descriptor_UBSB");
563 when By_Short_Descriptor_UBA
564 => Write_Str ("By_Short_Descriptor_UBA");
565 when By_Short_Descriptor_S
566 => Write_Str ("By_Short_Descriptor_S");
567 when By_Short_Descriptor_SB
568 => Write_Str ("By_Short_Descriptor_SB");
569 when By_Short_Descriptor_A
570 => Write_Str ("By_Short_Descriptor_A");
571 when By_Short_Descriptor_NCA
572 => Write_Str ("By_Short_Descriptor_NCA");
574 when 1 .. Mechanism_Type'Last =>
575 Write_Str ("By_Copy if size <= ");
581 -- Normal case (not Mechanism)
584 Print_Field (Field22 (Ent));
590 if Field_Present (Field23 (Ent)) then
592 Write_Field23_Name (Ent);
594 Print_Field (Field23 (Ent));
598 if Field_Present (Field24 (Ent)) then
600 Write_Field24_Name (Ent);
602 Print_Field (Field24 (Ent));
606 if Field_Present (Field25 (Ent)) then
608 Write_Field25_Name (Ent);
610 Print_Field (Field25 (Ent));
614 if Field_Present (Field26 (Ent)) then
616 Write_Field26_Name (Ent);
618 Print_Field (Field26 (Ent));
622 if Field_Present (Field27 (Ent)) then
624 Write_Field27_Name (Ent);
626 Print_Field (Field27 (Ent));
630 Write_Entity_Flags (Ent, Prefix);
631 end Print_Entity_Info;
637 procedure Print_Eol is
639 if Phase = Printing then
648 procedure Print_Field (Val : Union_Id; Format : UI_Format := Auto) is
650 if Phase /= Printing then
654 if Val in Node_Range then
655 Print_Node_Ref (Node_Id (Val));
657 elsif Val in List_Range then
658 Print_List_Ref (List_Id (Val));
660 elsif Val in Elist_Range then
661 Print_Elist_Ref (Elist_Id (Val));
663 elsif Val in Names_Range then
664 Print_Name (Name_Id (Val));
665 Write_Str (" (Name_Id=");
666 Write_Int (Int (Val));
669 elsif Val in Strings_Range then
670 Write_String_Table_Entry (String_Id (Val));
671 Write_Str (" (String_Id=");
672 Write_Int (Int (Val));
675 elsif Val in Uint_Range then
676 UI_Write (From_Union (Val), Format);
677 Write_Str (" (Uint = ");
678 Write_Int (Int (Val));
681 elsif Val in Ureal_Range then
682 UR_Write (From_Union (Val));
683 Write_Str (" (Ureal = ");
684 Write_Int (Int (Val));
688 Print_Str ("****** Incorrect value = ");
689 Print_Int (Int (Val));
697 procedure Print_Flag (F : Boolean) is
710 procedure Print_Init is
712 Printing_Descendants := True;
715 -- Allocate and clear serial number hash table. The size is 150% of
716 -- the maximum possible number of entries, so that the hash table
717 -- cannot get significantly overloaded.
719 Hash_Table_Len := (150 * (Num_Nodes + Num_Lists + Num_Elists)) / 100;
720 Hash_Table := new Hash_Table_Type (0 .. Hash_Table_Len - 1);
722 for J in Hash_Table'Range loop
723 Hash_Table (J).Serial := 0;
732 procedure Print_Int (I : Int) is
734 if Phase = Printing then
743 procedure Print_List_Ref (L : List_Id) is
745 if Phase /= Printing then
750 Write_Str ("<no list>");
752 elsif Is_Empty_List (L) then
753 Write_Str ("<empty list> (List_Id=");
760 if Printing_Descendants then
762 Write_Int (Serial_Number (Int (L)));
765 Write_Str (" (List_Id=");
771 ------------------------
772 -- Print_List_Subtree --
773 ------------------------
775 procedure Print_List_Subtree (L : List_Id) is
779 Next_Serial_Number := 1;
783 Next_Serial_Number := 1;
788 end Print_List_Subtree;
794 procedure Print_Name (N : Name_Id) is
796 if Phase = Printing then
798 Print_Str ("<No_Name>");
800 elsif N = Error_Name then
801 Print_Str ("<Error_Name>");
803 elsif Is_Valid_Name (N) then
810 Print_Str ("<invalid name ???>");
822 Prefix_Char : Character)
825 P : Natural := Pchar_Pos (Nkind (N));
827 Field_To_Be_Printed : Boolean;
828 Prefix_Str_Char : String (Prefix_Str'First .. Prefix_Str'Last + 1);
830 Sfile : Source_File_Index;
835 if Phase /= Printing then
839 if Nkind (N) = N_Integer_Literal and then Print_In_Hex (N) then
845 Prefix_Str_Char (Prefix_Str'Range) := Prefix_Str;
846 Prefix_Str_Char (Prefix_Str'Last + 1) := Prefix_Char;
850 Print_Str (Prefix_Str);
855 if N > Atree_Private_Part.Nodes.Last then
856 Print_Str (" (no such node)");
861 if Comes_From_Source (N) then
863 Print_Str (" (source");
874 Print_Str ("analyzed");
877 if Error_Posted (N) then
885 Print_Str ("posted");
894 if Is_Rewrite_Substitution (N) then
895 Print_Str (Prefix_Str);
896 Print_Str (" Rewritten: original node = ");
897 Print_Node_Ref (Original_Node (N));
905 if not Is_List_Member (N) then
906 Print_Str (Prefix_Str);
907 Print_Str (" Parent = ");
908 Print_Node_Ref (Parent (N));
912 -- Print Sloc field if it is set
914 if Sloc (N) /= No_Location then
915 Print_Str (Prefix_Str_Char);
916 Print_Str ("Sloc = ");
918 if Sloc (N) = Standard_Location then
919 Print_Str ("Standard_Location");
921 elsif Sloc (N) = Standard_ASCII_Location then
922 Print_Str ("Standard_ASCII_Location");
925 Sfile := Get_Source_File_Index (Sloc (N));
926 Print_Int (Int (Sloc (N)) - Int (Source_Text (Sfile)'First));
928 Write_Location (Sloc (N));
934 -- Print Chars field if present
936 if Nkind (N) in N_Has_Chars and then Chars (N) /= No_Name then
937 Print_Str (Prefix_Str_Char);
938 Print_Str ("Chars = ");
939 Print_Name (Chars (N));
940 Write_Str (" (Name_Id=");
941 Write_Int (Int (Chars (N)));
946 -- Special field print operations for non-entity nodes
948 if Nkind (N) not in N_Entity then
950 -- Deal with Left_Opnd and Right_Opnd fields
953 or else Nkind (N) in N_Short_Circuit
954 or else Nkind (N) in N_Membership_Test
956 -- Print Left_Opnd if present
958 if Nkind (N) not in N_Unary_Op then
959 Print_Str (Prefix_Str_Char);
960 Print_Str ("Left_Opnd = ");
961 Print_Node_Ref (Left_Opnd (N));
967 Print_Str (Prefix_Str_Char);
968 Print_Str ("Right_Opnd = ");
969 Print_Node_Ref (Right_Opnd (N));
973 -- Print Entity field if operator (other cases of Entity
974 -- are in the table, so are handled in the normal circuit)
976 if Nkind (N) in N_Op and then Present (Entity (N)) then
977 Print_Str (Prefix_Str_Char);
978 Print_Str ("Entity = ");
979 Print_Node_Ref (Entity (N));
983 -- Print special fields if we have a subexpression
985 if Nkind (N) in N_Subexpr then
987 if Assignment_OK (N) then
988 Print_Str (Prefix_Str_Char);
989 Print_Str ("Assignment_OK = True");
993 if Do_Range_Check (N) then
994 Print_Str (Prefix_Str_Char);
995 Print_Str ("Do_Range_Check = True");
999 if Has_Dynamic_Length_Check (N) then
1000 Print_Str (Prefix_Str_Char);
1001 Print_Str ("Has_Dynamic_Length_Check = True");
1005 if Has_Dynamic_Range_Check (N) then
1006 Print_Str (Prefix_Str_Char);
1007 Print_Str ("Has_Dynamic_Range_Check = True");
1011 if Is_Controlling_Actual (N) then
1012 Print_Str (Prefix_Str_Char);
1013 Print_Str ("Is_Controlling_Actual = True");
1017 if Is_Overloaded (N) then
1018 Print_Str (Prefix_Str_Char);
1019 Print_Str ("Is_Overloaded = True");
1023 if Is_Static_Expression (N) then
1024 Print_Str (Prefix_Str_Char);
1025 Print_Str ("Is_Static_Expression = True");
1029 if Must_Not_Freeze (N) then
1030 Print_Str (Prefix_Str_Char);
1031 Print_Str ("Must_Not_Freeze = True");
1035 if Paren_Count (N) /= 0 then
1036 Print_Str (Prefix_Str_Char);
1037 Print_Str ("Paren_Count = ");
1038 Print_Int (Int (Paren_Count (N)));
1042 if Raises_Constraint_Error (N) then
1043 Print_Str (Prefix_Str_Char);
1044 Print_Str ("Raise_Constraint_Error = True");
1050 -- Print Do_Overflow_Check field if present
1052 if Nkind (N) in N_Op and then Do_Overflow_Check (N) then
1053 Print_Str (Prefix_Str_Char);
1054 Print_Str ("Do_Overflow_Check = True");
1058 -- Print Etype field if present (printing of this field for entities
1059 -- is handled by the Print_Entity_Info procedure).
1061 if Nkind (N) in N_Has_Etype and then Present (Etype (N)) then
1062 Print_Str (Prefix_Str_Char);
1063 Print_Str ("Etype = ");
1064 Print_Node_Ref (Etype (N));
1069 -- Loop to print fields included in Pchars array
1071 while P < Pchar_Pos (Node_Kind'Succ (Nkind (N))) loop
1075 -- Check for case of False flag, which we never print, or
1076 -- an Empty field, which is also never printed
1080 Field_To_Be_Printed := Field1 (N) /= Union_Id (Empty);
1083 Field_To_Be_Printed := Field2 (N) /= Union_Id (Empty);
1086 Field_To_Be_Printed := Field3 (N) /= Union_Id (Empty);
1089 Field_To_Be_Printed := Field4 (N) /= Union_Id (Empty);
1092 Field_To_Be_Printed := Field5 (N) /= Union_Id (Empty);
1094 when F_Flag4 => Field_To_Be_Printed := Flag4 (N);
1095 when F_Flag5 => Field_To_Be_Printed := Flag5 (N);
1096 when F_Flag6 => Field_To_Be_Printed := Flag6 (N);
1097 when F_Flag7 => Field_To_Be_Printed := Flag7 (N);
1098 when F_Flag8 => Field_To_Be_Printed := Flag8 (N);
1099 when F_Flag9 => Field_To_Be_Printed := Flag9 (N);
1100 when F_Flag10 => Field_To_Be_Printed := Flag10 (N);
1101 when F_Flag11 => Field_To_Be_Printed := Flag11 (N);
1102 when F_Flag12 => Field_To_Be_Printed := Flag12 (N);
1103 when F_Flag13 => Field_To_Be_Printed := Flag13 (N);
1104 when F_Flag14 => Field_To_Be_Printed := Flag14 (N);
1105 when F_Flag15 => Field_To_Be_Printed := Flag15 (N);
1106 when F_Flag16 => Field_To_Be_Printed := Flag16 (N);
1107 when F_Flag17 => Field_To_Be_Printed := Flag17 (N);
1108 when F_Flag18 => Field_To_Be_Printed := Flag18 (N);
1110 -- Flag1,2,3 are no longer used
1112 when F_Flag1 => raise Program_Error;
1113 when F_Flag2 => raise Program_Error;
1114 when F_Flag3 => raise Program_Error;
1118 -- Print field if it is to be printed
1120 if Field_To_Be_Printed then
1121 Print_Str (Prefix_Str_Char);
1123 while P < Pchar_Pos (Node_Kind'Succ (Nkind (N)))
1124 and then Pchars (P) not in Fchar
1126 Print_Char (Pchars (P));
1133 when F_Field1 => Print_Field (Field1 (N), Fmt);
1134 when F_Field2 => Print_Field (Field2 (N), Fmt);
1135 when F_Field3 => Print_Field (Field3 (N), Fmt);
1136 when F_Field4 => Print_Field (Field4 (N), Fmt);
1138 -- Special case End_Span = Uint5
1141 if Nkind (N) = N_Case_Statement
1142 or else Nkind (N) = N_If_Statement
1146 Print_Field (Field5 (N), Fmt);
1149 when F_Flag4 => Print_Flag (Flag4 (N));
1150 when F_Flag5 => Print_Flag (Flag5 (N));
1151 when F_Flag6 => Print_Flag (Flag6 (N));
1152 when F_Flag7 => Print_Flag (Flag7 (N));
1153 when F_Flag8 => Print_Flag (Flag8 (N));
1154 when F_Flag9 => Print_Flag (Flag9 (N));
1155 when F_Flag10 => Print_Flag (Flag10 (N));
1156 when F_Flag11 => Print_Flag (Flag11 (N));
1157 when F_Flag12 => Print_Flag (Flag12 (N));
1158 when F_Flag13 => Print_Flag (Flag13 (N));
1159 when F_Flag14 => Print_Flag (Flag14 (N));
1160 when F_Flag15 => Print_Flag (Flag15 (N));
1161 when F_Flag16 => Print_Flag (Flag16 (N));
1162 when F_Flag17 => Print_Flag (Flag17 (N));
1163 when F_Flag18 => Print_Flag (Flag18 (N));
1165 -- Flag1,2,3 are no longer used
1167 when F_Flag1 => raise Program_Error;
1168 when F_Flag2 => raise Program_Error;
1169 when F_Flag3 => raise Program_Error;
1174 -- Field is not to be printed (False flag field)
1177 while P < Pchar_Pos (Node_Kind'Succ (Nkind (N)))
1178 and then Pchars (P) not in Fchar
1186 -- Print entity information for entities
1188 if Nkind (N) in N_Entity then
1189 Print_Entity_Info (N, Prefix_Str_Char);
1192 -- Print the SCIL node (if available)
1194 if Present (Get_SCIL_Node (N)) then
1195 Print_Str (Prefix_Str_Char);
1196 Print_Str ("SCIL_Node = ");
1197 Print_Node_Ref (Get_SCIL_Node (N));
1202 ---------------------
1203 -- Print_Node_Kind --
1204 ---------------------
1206 procedure Print_Node_Kind (N : Node_Id) is
1208 S : constant String := Node_Kind'Image (Nkind (N));
1211 if Phase = Printing then
1214 -- Note: the call to Fold_Upper in this loop is to get past the GNAT
1215 -- bug of 'Image returning lower case instead of upper case.
1217 for J in S'Range loop
1219 Write_Char (Fold_Upper (S (J)));
1221 Write_Char (Fold_Lower (S (J)));
1224 Ucase := (S (J) = '_');
1227 end Print_Node_Kind;
1229 --------------------
1230 -- Print_Node_Ref --
1231 --------------------
1233 procedure Print_Node_Ref (N : Node_Id) is
1237 if Phase /= Printing then
1242 Write_Str ("<empty>");
1244 elsif N = Error then
1245 Write_Str ("<error>");
1248 if Printing_Descendants then
1249 S := Serial_Number (Int (N));
1259 Print_Node_Kind (N);
1261 if Nkind (N) in N_Has_Chars then
1263 Print_Name (Chars (N));
1266 if Nkind (N) in N_Entity then
1267 Write_Str (" (Entity_Id=");
1269 Write_Str (" (Node_Id=");
1272 Write_Int (Int (N));
1274 if Sloc (N) <= Standard_Location then
1283 ------------------------
1284 -- Print_Node_Subtree --
1285 ------------------------
1287 procedure Print_Node_Subtree (N : Node_Id) is
1291 Next_Serial_Number := 1;
1293 Visit_Node (N, "", ' ');
1295 Next_Serial_Number := 1;
1297 Visit_Node (N, "", ' ');
1300 end Print_Node_Subtree;
1306 procedure Print_Str (S : String) is
1308 if Phase = Printing then
1313 --------------------------
1314 -- Print_Str_Mixed_Case --
1315 --------------------------
1317 procedure Print_Str_Mixed_Case (S : String) is
1321 if Phase = Printing then
1324 for J in S'Range loop
1328 Write_Char (Fold_Lower (S (J)));
1331 Ucase := (S (J) = '_');
1334 end Print_Str_Mixed_Case;
1340 procedure Print_Term is
1341 procedure Free is new Unchecked_Deallocation
1342 (Hash_Table_Type, Access_Hash_Table_Type);
1348 ---------------------
1349 -- Print_Tree_Elist --
1350 ---------------------
1352 procedure Print_Tree_Elist (E : Elist_Id) is
1356 Printing_Descendants := False;
1359 Print_Elist_Ref (E);
1362 M := First_Elmt (E);
1365 Print_Str ("<empty element list>");
1372 exit when No (Next_Elmt (M));
1373 Print_Node (Node (M), "", '|');
1377 Print_Node (Node (M), "", ' ');
1380 end Print_Tree_Elist;
1382 ---------------------
1383 -- Print_Tree_List --
1384 ---------------------
1386 procedure Print_Tree_List (L : List_Id) is
1390 Printing_Descendants := False;
1394 Print_Str (" List_Id=");
1395 Print_Int (Int (L));
1401 Print_Str ("<empty node list>");
1408 exit when Next (N) = Empty;
1409 Print_Node (N, "", '|');
1413 Print_Node (N, "", ' ');
1416 end Print_Tree_List;
1418 ---------------------
1419 -- Print_Tree_Node --
1420 ---------------------
1422 procedure Print_Tree_Node (N : Node_Id; Label : String := "") is
1424 Printing_Descendants := False;
1426 Print_Node (N, Label, ' ');
1427 end Print_Tree_Node;
1433 procedure pt (N : Node_Id) is
1435 Print_Node_Subtree (N);
1442 -- The hashing algorithm is to use the remainder of the ID value divided
1443 -- by the hash table length as the starting point in the table, and then
1444 -- handle collisions by serial searching wrapping at the end of the table.
1447 -- Set by an unsuccessful call to Serial_Number (one which returns zero)
1448 -- to save the slot that should be used if Set_Serial_Number is called.
1450 function Serial_Number (Id : Int) return Nat is
1451 H : Int := Id mod Hash_Table_Len;
1454 while Hash_Table (H).Serial /= 0 loop
1456 if Id = Hash_Table (H).Id then
1457 return Hash_Table (H).Serial;
1462 if H > Hash_Table'Last then
1467 -- Entry was not found, save slot number for possible subsequent call
1468 -- to Set_Serial_Number, and unconditionally save the Id in this slot
1469 -- in case of such a call (the Id field is never read if the serial
1470 -- number of the slot is zero, so this is harmless in the case where
1471 -- Set_Serial_Number is not subsequently called).
1474 Hash_Table (H).Id := Id;
1479 -----------------------
1480 -- Set_Serial_Number --
1481 -----------------------
1483 procedure Set_Serial_Number is
1485 Hash_Table (Hash_Slot).Serial := Next_Serial_Number;
1486 Next_Serial_Number := Next_Serial_Number + 1;
1487 end Set_Serial_Number;
1493 procedure Tree_Dump is
1494 procedure Underline;
1495 -- Put underline under string we just printed
1497 procedure Underline is
1498 Col : constant Int := Column;
1503 while Col > Column loop
1510 -- Start of processing for Tree_Dump. Note that we turn off the tree dump
1511 -- flags immediately, before starting the dump. This avoids generating two
1512 -- copies of the dump if an abort occurs after printing the dump, and more
1513 -- importantly, avoids an infinite loop if an abort occurs during the dump.
1515 -- Note: unlike in the source print case (in Sprint), we do not output
1516 -- separate trees for each unit. Instead the -df debug switch causes the
1517 -- tree that is output from the main unit to trace references into other
1518 -- units (normally such references are not traced). Since all other units
1519 -- are linked to the main unit by at least one reference, this causes all
1520 -- tree nodes to be included in the output tree.
1523 if Debug_Flag_Y then
1524 Debug_Flag_Y := False;
1526 Write_Str ("Tree created for Standard (spec) ");
1528 Print_Node_Subtree (Standard_Package_Node);
1532 if Debug_Flag_T then
1533 Debug_Flag_T := False;
1536 Write_Str ("Tree created for ");
1537 Write_Unit_Name (Unit_Name (Main_Unit));
1539 Print_Node_Subtree (Cunit (Main_Unit));
1549 procedure Visit_Elist (E : Elist_Id; Prefix_Str : String) is
1552 S : constant Nat := Serial_Number (Int (E));
1555 -- In marking phase, return if already marked, otherwise set next
1556 -- serial number in hash table for later reference.
1558 if Phase = Marking then
1560 return; -- already visited
1565 -- In printing phase, if already printed, then return, otherwise we
1566 -- are printing the next item, so increment the serial number.
1569 if S < Next_Serial_Number then
1570 return; -- already printed
1572 Next_Serial_Number := Next_Serial_Number + 1;
1576 -- Now process the list (Print calls have no effect in marking phase)
1578 Print_Str (Prefix_Str);
1579 Print_Elist_Ref (E);
1582 if Is_Empty_Elmt_List (E) then
1583 Print_Str (Prefix_Str);
1584 Print_Str ("(Empty element list)");
1589 if Phase = Printing then
1590 M := First_Elmt (E);
1591 while Present (M) loop
1593 Print_Str (Prefix_Str);
1600 Print_Str (Prefix_Str);
1604 M := First_Elmt (E);
1605 while Present (M) loop
1606 Visit_Node (Node (M), Prefix_Str, ' ');
1616 procedure Visit_List (L : List_Id; Prefix_Str : String) is
1618 S : constant Nat := Serial_Number (Int (L));
1621 -- In marking phase, return if already marked, otherwise set next
1622 -- serial number in hash table for later reference.
1624 if Phase = Marking then
1631 -- In printing phase, if already printed, then return, otherwise we
1632 -- are printing the next item, so increment the serial number.
1635 if S < Next_Serial_Number then
1636 return; -- already printed
1638 Next_Serial_Number := Next_Serial_Number + 1;
1642 -- Now process the list (Print calls have no effect in marking phase)
1644 Print_Str (Prefix_Str);
1648 Print_Str (Prefix_Str);
1649 Print_Str ("|Parent = ");
1650 Print_Node_Ref (Parent (L));
1656 Print_Str (Prefix_Str);
1657 Print_Str ("(Empty list)");
1662 Print_Str (Prefix_Str);
1666 while Next (N) /= Empty loop
1667 Visit_Node (N, Prefix_Str, '|');
1672 Visit_Node (N, Prefix_Str, ' ');
1679 procedure Visit_Node
1681 Prefix_Str : String;
1682 Prefix_Char : Character)
1684 New_Prefix : String (Prefix_Str'First .. Prefix_Str'Last + 2);
1685 -- Prefix string for printing referenced fields
1687 procedure Visit_Descendent
1689 No_Indent : Boolean := False);
1690 -- This procedure tests the given value of one of the Fields referenced
1691 -- by the current node to determine whether to visit it recursively.
1692 -- Normally No_Indent is false, which means that the visited node will
1693 -- be indented using New_Prefix. If No_Indent is set to True, then
1694 -- this indentation is skipped, and Prefix_Str is used for the call
1695 -- to print the descendent. No_Indent is effective only if the
1696 -- referenced descendent is a node.
1698 ----------------------
1699 -- Visit_Descendent --
1700 ----------------------
1702 procedure Visit_Descendent
1704 No_Indent : Boolean := False)
1707 -- Case of descendent is a node
1709 if D in Node_Range then
1711 -- Don't bother about Empty or Error descendents
1713 if D <= Union_Id (Empty_Or_Error) then
1718 Nod : constant Node_Or_Entity_Id := Node_Or_Entity_Id (D);
1721 -- Descendents in one of the standardly compiled internal
1722 -- packages are normally ignored, unless the parent is also
1723 -- in such a package (happens when Standard itself is output)
1724 -- or if the -df switch is set which causes all links to be
1725 -- followed, even into package standard.
1727 if Sloc (Nod) <= Standard_Location then
1728 if Sloc (N) > Standard_Location
1729 and then not Debug_Flag_F
1734 -- Don't bother about a descendent in a different unit than
1735 -- the node we came from unless the -df switch is set. Note
1736 -- that we know at this point that Sloc (D) > Standard_Location
1738 -- Note: the tests for No_Location here just make sure that we
1739 -- don't blow up on a node which is missing an Sloc value. This
1740 -- should not normally happen.
1743 if (Sloc (N) <= Standard_Location
1744 or else Sloc (N) = No_Location
1745 or else Sloc (Nod) = No_Location
1746 or else not In_Same_Source_Unit (Nod, N))
1747 and then not Debug_Flag_F
1753 -- Don't bother visiting a source node that has a parent which
1754 -- is not the node we came from. We prefer to trace such nodes
1755 -- from their real parents. This causes the tree to be printed
1756 -- in a more coherent order, e.g. a defining identifier listed
1757 -- next to its corresponding declaration, instead of next to
1758 -- some semantic reference.
1760 -- This test is skipped for nodes in standard packages unless
1761 -- the -dy option is set (which outputs the tree for standard)
1763 -- Also, always follow pointers to Is_Itype entities,
1764 -- since we want to list these when they are first referenced.
1766 if Parent (Nod) /= Empty
1767 and then Comes_From_Source (Nod)
1768 and then Parent (Nod) /= N
1769 and then (Sloc (N) > Standard_Location or else Debug_Flag_Y)
1774 -- If we successfully fall through all the above tests (which
1775 -- execute a return if the node is not to be visited), we can
1776 -- go ahead and visit the node!
1779 Visit_Node (Nod, Prefix_Str, Prefix_Char);
1781 Visit_Node (Nod, New_Prefix, ' ');
1785 -- Case of descendent is a list
1787 elsif D in List_Range then
1789 -- Don't bother with a missing list, empty list or error list
1791 if D = Union_Id (No_List)
1792 or else D = Union_Id (Error_List)
1793 or else Is_Empty_List (List_Id (D))
1797 -- Otherwise we can visit the list. Note that we don't bother
1798 -- to do the parent test that we did for the node case, because
1799 -- it just does not happen that lists are referenced more than
1800 -- one place in the tree. We aren't counting on this being the
1801 -- case to generate valid output, it is just that we don't need
1802 -- in practice to worry about listing the list at a place that
1806 Visit_List (List_Id (D), New_Prefix);
1809 -- Case of descendent is an element list
1811 elsif D in Elist_Range then
1813 -- Don't bother with a missing list, or an empty list
1815 if D = Union_Id (No_Elist)
1816 or else Is_Empty_Elmt_List (Elist_Id (D))
1820 -- Otherwise, visit the referenced element list
1823 Visit_Elist (Elist_Id (D), New_Prefix);
1826 -- For all other kinds of descendents (strings, names, uints etc),
1827 -- there is nothing to visit (the contents of the field will be
1828 -- printed when we print the containing node, but what concerns
1829 -- us now is looking for descendents in the tree.
1834 end Visit_Descendent;
1836 -- Start of processing for Visit_Node
1843 -- Set fatal error node in case we get a blow up during the trace
1845 Current_Error_Node := N;
1847 New_Prefix (Prefix_Str'Range) := Prefix_Str;
1848 New_Prefix (Prefix_Str'Last + 1) := Prefix_Char;
1849 New_Prefix (Prefix_Str'Last + 2) := ' ';
1851 -- In the marking phase, all we do is to set the serial number
1853 if Phase = Marking then
1854 if Serial_Number (Int (N)) /= 0 then
1855 return; -- already visited
1860 -- In the printing phase, we print the node
1863 if Serial_Number (Int (N)) < Next_Serial_Number then
1865 -- Here we have already visited the node, but if it is in
1866 -- a list, we still want to print the reference, so that
1867 -- it is clear that it belongs to the list.
1869 if Is_List_Member (N) then
1870 Print_Str (Prefix_Str);
1873 Print_Str (Prefix_Str);
1874 Print_Char (Prefix_Char);
1875 Print_Str ("(already output)");
1877 Print_Str (Prefix_Str);
1878 Print_Char (Prefix_Char);
1885 Print_Node (N, Prefix_Str, Prefix_Char);
1886 Print_Str (Prefix_Str);
1887 Print_Char (Prefix_Char);
1889 Next_Serial_Number := Next_Serial_Number + 1;
1893 -- Visit all descendents of this node
1895 if Nkind (N) not in N_Entity then
1896 Visit_Descendent (Field1 (N));
1897 Visit_Descendent (Field2 (N));
1898 Visit_Descendent (Field3 (N));
1899 Visit_Descendent (Field4 (N));
1900 Visit_Descendent (Field5 (N));
1905 Visit_Descendent (Field1 (N));
1906 Visit_Descendent (Field3 (N));
1907 Visit_Descendent (Field4 (N));
1908 Visit_Descendent (Field5 (N));
1909 Visit_Descendent (Field6 (N));
1910 Visit_Descendent (Field7 (N));
1911 Visit_Descendent (Field8 (N));
1912 Visit_Descendent (Field9 (N));
1913 Visit_Descendent (Field10 (N));
1914 Visit_Descendent (Field11 (N));
1915 Visit_Descendent (Field12 (N));
1916 Visit_Descendent (Field13 (N));
1917 Visit_Descendent (Field14 (N));
1918 Visit_Descendent (Field15 (N));
1919 Visit_Descendent (Field16 (N));
1920 Visit_Descendent (Field17 (N));
1921 Visit_Descendent (Field18 (N));
1922 Visit_Descendent (Field19 (N));
1923 Visit_Descendent (Field20 (N));
1924 Visit_Descendent (Field21 (N));
1925 Visit_Descendent (Field22 (N));
1926 Visit_Descendent (Field23 (N));
1928 -- Now an interesting kludge. Normally parents are always printed
1929 -- since we traverse the tree in a downwards direction. There is
1930 -- however an exception to this rule, which is the case where a
1931 -- parent is constructed by the compiler and is not referenced
1932 -- elsewhere in the tree. The following catches this case
1934 if not Comes_From_Source (N) then
1935 Visit_Descendent (Union_Id (Parent (N)));
1938 -- You may be wondering why we omitted Field2 above. The answer
1939 -- is that this is the Next_Entity field, and we want to treat
1940 -- it rather specially. Why? Because a Next_Entity link does not
1941 -- correspond to a level deeper in the tree, and we do not want
1942 -- the tree to march off to the right of the page due to bogus
1943 -- indentations coming from this effect.
1945 -- To prevent this, what we do is to control references via
1946 -- Next_Entity only from the first entity on a given scope
1947 -- chain, and we keep them all at the same level. Of course
1948 -- if an entity has already been referenced it is not printed.
1950 if Present (Next_Entity (N))
1951 and then Present (Scope (N))
1952 and then First_Entity (Scope (N)) = N
1959 while Present (Nod) loop
1960 Visit_Descendent (Union_Id (Next_Entity (Nod)));
1961 Nod := Next_Entity (Nod);