1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2012, 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 Aspects
; use Aspects
;
27 with Atree
; use Atree
;
28 with Csets
; use Csets
;
29 with Debug
; use Debug
;
30 with Einfo
; use Einfo
;
31 with Elists
; use Elists
;
33 with Namet
; use Namet
;
34 with Nlists
; use Nlists
;
35 with Output
; use Output
;
36 with Sem_Mech
; use Sem_Mech
;
37 with Sinfo
; use Sinfo
;
38 with Snames
; use Snames
;
39 with Sinput
; use Sinput
;
40 with Stand
; use Stand
;
41 with Stringt
; use Stringt
;
42 with SCIL_LL
; use SCIL_LL
;
43 with Treeprs
; use Treeprs
;
44 with Uintp
; use Uintp
;
45 with Urealp
; use Urealp
;
46 with Uname
; use Uname
;
47 with Unchecked_Deallocation
;
49 package body Treepr
is
51 use Atree
.Unchecked_Access
;
52 -- This module uses the unchecked access functions in package Atree
53 -- since it does an untyped traversal of the tree (we do not want to
54 -- count on the structure of the tree being correct in this routine!)
56 ----------------------------------
57 -- Approach Used for Tree Print --
58 ----------------------------------
60 -- When a complete subtree is being printed, a trace phase first marks
61 -- the nodes and lists to be printed. This trace phase allocates logical
62 -- numbers corresponding to the order in which the nodes and lists will
63 -- be printed. The Node_Id, List_Id and Elist_Id values are mapped to
64 -- logical node numbers using a hash table. Output is done using a set
65 -- of Print_xxx routines, which are similar to the Write_xxx routines
66 -- with the same name, except that they do not generate any output in
67 -- the marking phase. This allows identical logic to be used in the
70 -- Note that the hash table not only holds the serial numbers, but also
71 -- acts as a record of which nodes have already been visited. In the
72 -- marking phase, a node has been visited if it is already in the hash
73 -- table, and in the printing phase, we can tell whether a node has
74 -- already been printed by looking at the value of the serial number.
76 ----------------------
77 -- Global Variables --
78 ----------------------
80 type Hash_Record
is record
82 -- Serial number for hash table entry. A value of zero means that
83 -- the entry is currently unused.
86 -- If serial number field is non-zero, contains corresponding Id value
89 type Hash_Table_Type
is array (Nat
range <>) of Hash_Record
;
90 type Access_Hash_Table_Type
is access Hash_Table_Type
;
91 Hash_Table
: Access_Hash_Table_Type
;
92 -- The hash table itself, see Serial_Number function for details of use
95 -- Range of Hash_Table is from 0 .. Hash_Table_Len - 1 so that dividing
96 -- by Hash_Table_Len gives a remainder that is in Hash_Table'Range.
98 Next_Serial_Number
: Nat
;
99 -- Number of last visited node or list. Used during the marking phase to
100 -- set proper node numbers in the hash table, and during the printing
101 -- phase to make sure that a given node is not printed more than once.
102 -- (nodes are printed in order during the printing phase, that's the
103 -- point of numbering them in the first place!)
105 Printing_Descendants
: Boolean;
106 -- True if descendants are being printed, False if not. In the false case,
107 -- only node Id's are printed. In the true case, node numbers as well as
108 -- node Id's are printed, as described above.
110 type Phase_Type
is (Marking
, Printing
);
111 -- Type for Phase variable
114 -- When an entire tree is being printed, the traversal operates in two
115 -- phases. The first phase marks the nodes in use by installing node
116 -- numbers in the node number table. The second phase prints the nodes.
117 -- This variable indicates the current phase.
119 ----------------------
120 -- Local Procedures --
121 ----------------------
123 procedure Print_End_Span
(N
: Node_Id
);
124 -- Special routine to print contents of End_Span field of node N.
125 -- The format includes the implicit source location as well as the
126 -- value of the field.
128 procedure Print_Init
;
129 -- Initialize for printing of tree with descendents
131 procedure Print_Term
;
132 -- Clean up after printing of tree with descendents
134 procedure Print_Char
(C
: Character);
135 -- Print character C if currently in print phase, noop if in marking phase
137 procedure Print_Name
(N
: Name_Id
);
138 -- Print name from names table if currently in print phase, noop if in
139 -- marking phase. Note that the name is output in mixed case mode.
141 procedure Print_Node_Header
(N
: Node_Id
);
142 -- Print header line used by Print_Node and Print_Node_Briefly
144 procedure Print_Node_Kind
(N
: Node_Id
);
145 -- Print node kind name in mixed case if in print phase, noop if in
148 procedure Print_Str
(S
: String);
149 -- Print string S if currently in print phase, noop if in marking phase
151 procedure Print_Str_Mixed_Case
(S
: String);
152 -- Like Print_Str, except that the string is printed in mixed case mode
154 procedure Print_Int
(I
: Int
);
155 -- Print integer I if currently in print phase, noop if in marking phase
158 -- Print end of line if currently in print phase, noop if in marking phase
160 procedure Print_Node_Ref
(N
: Node_Id
);
161 -- Print "<empty>", "<error>" or "Node #nnn" with additional information
162 -- in the latter case, including the Id and the Nkind of the node.
164 procedure Print_List_Ref
(L
: List_Id
);
165 -- Print "<no list>", or "<empty node list>" or "Node list #nnn"
167 procedure Print_Elist_Ref
(E
: Elist_Id
);
168 -- Print "<no elist>", or "<empty element list>" or "Element list #nnn"
170 procedure Print_Entity_Info
(Ent
: Entity_Id
; Prefix
: String);
171 -- Called if the node being printed is an entity. Prints fields from the
172 -- extension, using routines in Einfo to get the field names and flags.
174 procedure Print_Field
(Val
: Union_Id
; Format
: UI_Format
:= Auto
);
175 -- Print representation of Field value (name, tree, string, uint, charcode)
176 -- The format parameter controls the format of printing in the case of an
177 -- integer value (see UI_Write for details).
179 procedure Print_Flag
(F
: Boolean);
180 -- Print True or False
185 Prefix_Char
: Character);
186 -- This is the internal routine used to print a single node. Each line of
187 -- output is preceded by Prefix_Str (which is used to set the indentation
188 -- level and the bars used to link list elements). In addition, for lines
189 -- other than the first, an additional character Prefix_Char is output.
191 function Serial_Number
(Id
: Int
) return Nat
;
192 -- Given a Node_Id, List_Id or Elist_Id, returns the previously assigned
193 -- serial number, or zero if no serial number has yet been assigned.
195 procedure Set_Serial_Number
;
196 -- Can be called only immediately following a call to Serial_Number that
197 -- returned a value of zero. Causes the value of Next_Serial_Number to be
198 -- placed in the hash table (corresponding to the Id argument used in the
199 -- Serial_Number call), and increments Next_Serial_Number.
204 Prefix_Char
: Character);
205 -- Called to process a single node in the case where descendents are to
206 -- be printed before every line, and Prefix_Char added to all lines
207 -- except the header line for the node.
209 procedure Visit_List
(L
: List_Id
; Prefix_Str
: String);
210 -- Visit_List is called to process a list in the case where descendents
211 -- are to be printed. Prefix_Str is to be added to all printed lines.
213 procedure Visit_Elist
(E
: Elist_Id
; Prefix_Str
: String);
214 -- Visit_Elist is called to process an element list in the case where
215 -- descendents are to be printed. Prefix_Str is to be added to all
222 procedure pe
(E
: Elist_Id
) is
224 Print_Tree_Elist
(E
);
231 procedure pl
(L
: Int
) is
238 -- This is the case where we transform e.g. +36 to -99999936
242 Lid
:= -(99999990 + L
);
244 Lid
:= -(99999900 + L
);
246 Lid
:= -(99999000 + L
);
248 Lid
:= -(99990000 + L
);
249 elsif L
<= 99999 then
250 Lid
:= -(99900000 + L
);
251 elsif L
<= 999999 then
252 Lid
:= -(99000000 + L
);
253 elsif L
<= 9999999 then
254 Lid
:= -(90000000 + L
);
260 -- Now output the list
262 Print_Tree_List
(List_Id
(Lid
));
269 procedure pn
(N
: Union_Id
) is
272 when List_Low_Bound
.. List_High_Bound
- 1 =>
275 Print_Tree_Node
(Node_Id
(N
));
277 Print_Tree_Elist
(Elist_Id
(N
));
280 Id
: constant Elmt_Id
:= Elmt_Id
(N
);
283 Write_Str
("No_Elmt");
286 Write_Str
("Elmt_Id --> ");
287 Print_Tree_Node
(Node
(Id
));
291 Namet
.wn
(Name_Id
(N
));
292 when Strings_Range
=>
293 Write_String_Table_Entry
(String_Id
(N
));
295 Uintp
.pid
(From_Union
(N
));
297 Urealp
.pr
(From_Union
(N
));
299 Write_Str
("Invalid Union_Id: ");
309 procedure pp
(N
: Union_Id
) is
318 procedure Print_Char
(C
: Character) is
320 if Phase
= Printing
then
325 ---------------------
326 -- Print_Elist_Ref --
327 ---------------------
329 procedure Print_Elist_Ref
(E
: Elist_Id
) is
331 if Phase
/= Printing
then
336 Write_Str
("<no elist>");
338 elsif Is_Empty_Elmt_List
(E
) then
339 Write_Str
("Empty elist, (Elist_Id=");
344 Write_Str
("(Elist_Id=");
348 if Printing_Descendants
then
350 Write_Int
(Serial_Number
(Int
(E
)));
355 -------------------------
356 -- Print_Elist_Subtree --
357 -------------------------
359 procedure Print_Elist_Subtree
(E
: Elist_Id
) is
363 Next_Serial_Number
:= 1;
367 Next_Serial_Number
:= 1;
372 end Print_Elist_Subtree
;
378 procedure Print_End_Span
(N
: Node_Id
) is
379 Val
: constant Uint
:= End_Span
(N
);
383 Write_Str
(" (Uint = ");
384 Write_Int
(Int
(Field5
(N
)));
387 if Val
/= No_Uint
then
388 Write_Location
(End_Location
(N
));
392 -----------------------
393 -- Print_Entity_Info --
394 -----------------------
396 procedure Print_Entity_Info
(Ent
: Entity_Id
; Prefix
: String) is
397 function Field_Present
(U
: Union_Id
) return Boolean;
398 -- Returns False unless the value U represents a missing value
399 -- (Empty, No_Uint, No_Ureal or No_String)
401 function Field_Present
(U
: Union_Id
) return Boolean is
404 U
/= Union_Id
(Empty
) and then
405 U
/= To_Union
(No_Uint
) and then
406 U
/= To_Union
(No_Ureal
) and then
407 U
/= Union_Id
(No_String
);
410 -- Start of processing for Print_Entity_Info
414 Print_Str
("Ekind = ");
415 Print_Str_Mixed_Case
(Entity_Kind
'Image (Ekind
(Ent
)));
419 Print_Str
("Etype = ");
420 Print_Node_Ref
(Etype
(Ent
));
423 if Convention
(Ent
) /= Convention_Ada
then
425 Print_Str
("Convention = ");
427 -- Print convention name skipping the Convention_ at the start
430 S
: constant String := Convention_Id
'Image (Convention
(Ent
));
433 Print_Str_Mixed_Case
(S
(12 .. S
'Last));
438 if Field_Present
(Field6
(Ent
)) then
440 Write_Field6_Name
(Ent
);
442 Print_Field
(Field6
(Ent
));
446 if Field_Present
(Field7
(Ent
)) then
448 Write_Field7_Name
(Ent
);
450 Print_Field
(Field7
(Ent
));
454 if Field_Present
(Field8
(Ent
)) then
456 Write_Field8_Name
(Ent
);
458 Print_Field
(Field8
(Ent
));
462 if Field_Present
(Field9
(Ent
)) then
464 Write_Field9_Name
(Ent
);
466 Print_Field
(Field9
(Ent
));
470 if Field_Present
(Field10
(Ent
)) then
472 Write_Field10_Name
(Ent
);
474 Print_Field
(Field10
(Ent
));
478 if Field_Present
(Field11
(Ent
)) then
480 Write_Field11_Name
(Ent
);
482 Print_Field
(Field11
(Ent
));
486 if Field_Present
(Field12
(Ent
)) then
488 Write_Field12_Name
(Ent
);
490 Print_Field
(Field12
(Ent
));
494 if Field_Present
(Field13
(Ent
)) then
496 Write_Field13_Name
(Ent
);
498 Print_Field
(Field13
(Ent
));
502 if Field_Present
(Field14
(Ent
)) then
504 Write_Field14_Name
(Ent
);
506 Print_Field
(Field14
(Ent
));
510 if Field_Present
(Field15
(Ent
)) then
512 Write_Field15_Name
(Ent
);
514 Print_Field
(Field15
(Ent
));
518 if Field_Present
(Field16
(Ent
)) then
520 Write_Field16_Name
(Ent
);
522 Print_Field
(Field16
(Ent
));
526 if Field_Present
(Field17
(Ent
)) then
528 Write_Field17_Name
(Ent
);
530 Print_Field
(Field17
(Ent
));
534 if Field_Present
(Field18
(Ent
)) then
536 Write_Field18_Name
(Ent
);
538 Print_Field
(Field18
(Ent
));
542 if Field_Present
(Field19
(Ent
)) then
544 Write_Field19_Name
(Ent
);
546 Print_Field
(Field19
(Ent
));
550 if Field_Present
(Field20
(Ent
)) then
552 Write_Field20_Name
(Ent
);
554 Print_Field
(Field20
(Ent
));
558 if Field_Present
(Field21
(Ent
)) then
560 Write_Field21_Name
(Ent
);
562 Print_Field
(Field21
(Ent
));
566 if Field_Present
(Field22
(Ent
)) then
568 Write_Field22_Name
(Ent
);
571 -- Mechanism case has to be handled specially
573 if Ekind
(Ent
) = E_Function
or else Is_Formal
(Ent
) then
575 M
: constant Mechanism_Type
:= Mechanism
(Ent
);
579 when Default_Mechanism
580 => Write_Str
("Default");
582 => Write_Str
("By_Copy");
584 => Write_Str
("By_Reference");
586 => Write_Str
("By_Descriptor");
587 when By_Descriptor_UBS
588 => Write_Str
("By_Descriptor_UBS");
589 when By_Descriptor_UBSB
590 => Write_Str
("By_Descriptor_UBSB");
591 when By_Descriptor_UBA
592 => Write_Str
("By_Descriptor_UBA");
594 => Write_Str
("By_Descriptor_S");
595 when By_Descriptor_SB
596 => Write_Str
("By_Descriptor_SB");
598 => Write_Str
("By_Descriptor_A");
599 when By_Descriptor_NCA
600 => Write_Str
("By_Descriptor_NCA");
601 when By_Short_Descriptor
602 => Write_Str
("By_Short_Descriptor");
603 when By_Short_Descriptor_UBS
604 => Write_Str
("By_Short_Descriptor_UBS");
605 when By_Short_Descriptor_UBSB
606 => Write_Str
("By_Short_Descriptor_UBSB");
607 when By_Short_Descriptor_UBA
608 => Write_Str
("By_Short_Descriptor_UBA");
609 when By_Short_Descriptor_S
610 => Write_Str
("By_Short_Descriptor_S");
611 when By_Short_Descriptor_SB
612 => Write_Str
("By_Short_Descriptor_SB");
613 when By_Short_Descriptor_A
614 => Write_Str
("By_Short_Descriptor_A");
615 when By_Short_Descriptor_NCA
616 => Write_Str
("By_Short_Descriptor_NCA");
618 when 1 .. Mechanism_Type
'Last =>
619 Write_Str
("By_Copy if size <= ");
625 -- Normal case (not Mechanism)
628 Print_Field
(Field22
(Ent
));
634 if Field_Present
(Field23
(Ent
)) then
636 Write_Field23_Name
(Ent
);
638 Print_Field
(Field23
(Ent
));
642 if Field_Present
(Field24
(Ent
)) then
644 Write_Field24_Name
(Ent
);
646 Print_Field
(Field24
(Ent
));
650 if Field_Present
(Field25
(Ent
)) then
652 Write_Field25_Name
(Ent
);
654 Print_Field
(Field25
(Ent
));
658 if Field_Present
(Field26
(Ent
)) then
660 Write_Field26_Name
(Ent
);
662 Print_Field
(Field26
(Ent
));
666 if Field_Present
(Field27
(Ent
)) then
668 Write_Field27_Name
(Ent
);
670 Print_Field
(Field27
(Ent
));
674 if Field_Present
(Field28
(Ent
)) then
676 Write_Field28_Name
(Ent
);
678 Print_Field
(Field28
(Ent
));
682 if Field_Present
(Field29
(Ent
)) then
684 Write_Field29_Name
(Ent
);
686 Print_Field
(Field29
(Ent
));
690 Write_Entity_Flags
(Ent
, Prefix
);
691 end Print_Entity_Info
;
697 procedure Print_Eol
is
699 if Phase
= Printing
then
708 procedure Print_Field
(Val
: Union_Id
; Format
: UI_Format
:= Auto
) is
710 if Phase
/= Printing
then
714 if Val
in Node_Range
then
715 Print_Node_Ref
(Node_Id
(Val
));
717 elsif Val
in List_Range
then
718 Print_List_Ref
(List_Id
(Val
));
720 elsif Val
in Elist_Range
then
721 Print_Elist_Ref
(Elist_Id
(Val
));
723 elsif Val
in Names_Range
then
724 Print_Name
(Name_Id
(Val
));
725 Write_Str
(" (Name_Id=");
726 Write_Int
(Int
(Val
));
729 elsif Val
in Strings_Range
then
730 Write_String_Table_Entry
(String_Id
(Val
));
731 Write_Str
(" (String_Id=");
732 Write_Int
(Int
(Val
));
735 elsif Val
in Uint_Range
then
736 UI_Write
(From_Union
(Val
), Format
);
737 Write_Str
(" (Uint = ");
738 Write_Int
(Int
(Val
));
741 elsif Val
in Ureal_Range
then
742 UR_Write
(From_Union
(Val
));
743 Write_Str
(" (Ureal = ");
744 Write_Int
(Int
(Val
));
748 Print_Str
("****** Incorrect value = ");
749 Print_Int
(Int
(Val
));
757 procedure Print_Flag
(F
: Boolean) is
770 procedure Print_Init
is
772 Printing_Descendants
:= True;
775 -- Allocate and clear serial number hash table. The size is 150% of
776 -- the maximum possible number of entries, so that the hash table
777 -- cannot get significantly overloaded.
779 Hash_Table_Len
:= (150 * (Num_Nodes
+ Num_Lists
+ Num_Elists
)) / 100;
780 Hash_Table
:= new Hash_Table_Type
(0 .. Hash_Table_Len
- 1);
782 for J
in Hash_Table
'Range loop
783 Hash_Table
(J
).Serial
:= 0;
792 procedure Print_Int
(I
: Int
) is
794 if Phase
= Printing
then
803 procedure Print_List_Ref
(L
: List_Id
) is
805 if Phase
/= Printing
then
810 Write_Str
("<no list>");
812 elsif Is_Empty_List
(L
) then
813 Write_Str
("<empty list> (List_Id=");
820 if Printing_Descendants
then
822 Write_Int
(Serial_Number
(Int
(L
)));
825 Write_Str
(" (List_Id=");
831 ------------------------
832 -- Print_List_Subtree --
833 ------------------------
835 procedure Print_List_Subtree
(L
: List_Id
) is
839 Next_Serial_Number
:= 1;
843 Next_Serial_Number
:= 1;
848 end Print_List_Subtree
;
854 procedure Print_Name
(N
: Name_Id
) is
856 if Phase
= Printing
then
858 Print_Str
("<No_Name>");
860 elsif N
= Error_Name
then
861 Print_Str
("<Error_Name>");
863 elsif Is_Valid_Name
(N
) then
870 Print_Str
("<invalid name ???>");
882 Prefix_Char
: Character)
885 P
: Natural := Pchar_Pos
(Nkind
(N
));
887 Field_To_Be_Printed
: Boolean;
888 Prefix_Str_Char
: String (Prefix_Str
'First .. Prefix_Str
'Last + 1);
890 Sfile
: Source_File_Index
;
894 if Phase
/= Printing
then
898 if Nkind
(N
) = N_Integer_Literal
and then Print_In_Hex
(N
) then
904 Prefix_Str_Char
(Prefix_Str
'Range) := Prefix_Str
;
905 Prefix_Str_Char
(Prefix_Str
'Last + 1) := Prefix_Char
;
909 Print_Str
(Prefix_Str
);
910 Print_Node_Header
(N
);
912 if Is_Rewrite_Substitution
(N
) then
913 Print_Str
(Prefix_Str
);
914 Print_Str
(" Rewritten: original node = ");
915 Print_Node_Ref
(Original_Node
(N
));
923 if not Is_List_Member
(N
) then
924 Print_Str
(Prefix_Str
);
925 Print_Str
(" Parent = ");
926 Print_Node_Ref
(Parent
(N
));
930 -- Print Sloc field if it is set
932 if Sloc
(N
) /= No_Location
then
933 Print_Str
(Prefix_Str_Char
);
934 Print_Str
("Sloc = ");
936 if Sloc
(N
) = Standard_Location
then
937 Print_Str
("Standard_Location");
939 elsif Sloc
(N
) = Standard_ASCII_Location
then
940 Print_Str
("Standard_ASCII_Location");
943 Sfile
:= Get_Source_File_Index
(Sloc
(N
));
944 Print_Int
(Int
(Sloc
(N
)) - Int
(Source_Text
(Sfile
)'First));
946 Write_Location
(Sloc
(N
));
952 -- Print Chars field if present
954 if Nkind
(N
) in N_Has_Chars
and then Chars
(N
) /= No_Name
then
955 Print_Str
(Prefix_Str_Char
);
956 Print_Str
("Chars = ");
957 Print_Name
(Chars
(N
));
958 Write_Str
(" (Name_Id=");
959 Write_Int
(Int
(Chars
(N
)));
964 -- Special field print operations for non-entity nodes
966 if Nkind
(N
) not in N_Entity
then
968 -- Deal with Left_Opnd and Right_Opnd fields
971 or else Nkind
(N
) in N_Short_Circuit
972 or else Nkind
(N
) in N_Membership_Test
974 -- Print Left_Opnd if present
976 if Nkind
(N
) not in N_Unary_Op
then
977 Print_Str
(Prefix_Str_Char
);
978 Print_Str
("Left_Opnd = ");
979 Print_Node_Ref
(Left_Opnd
(N
));
985 Print_Str
(Prefix_Str_Char
);
986 Print_Str
("Right_Opnd = ");
987 Print_Node_Ref
(Right_Opnd
(N
));
991 -- Print Entity field if operator (other cases of Entity
992 -- are in the table, so are handled in the normal circuit)
994 if Nkind
(N
) in N_Op
and then Present
(Entity
(N
)) then
995 Print_Str
(Prefix_Str_Char
);
996 Print_Str
("Entity = ");
997 Print_Node_Ref
(Entity
(N
));
1001 -- Print special fields if we have a subexpression
1003 if Nkind
(N
) in N_Subexpr
then
1005 if Assignment_OK
(N
) then
1006 Print_Str
(Prefix_Str_Char
);
1007 Print_Str
("Assignment_OK = True");
1011 if Do_Range_Check
(N
) then
1012 Print_Str
(Prefix_Str_Char
);
1013 Print_Str
("Do_Range_Check = True");
1017 if Has_Dynamic_Length_Check
(N
) then
1018 Print_Str
(Prefix_Str_Char
);
1019 Print_Str
("Has_Dynamic_Length_Check = True");
1023 if Has_Aspects
(N
) then
1024 Print_Str
(Prefix_Str_Char
);
1025 Print_Str
("Has_Aspects = True");
1029 if Has_Dynamic_Range_Check
(N
) then
1030 Print_Str
(Prefix_Str_Char
);
1031 Print_Str
("Has_Dynamic_Range_Check = True");
1035 if Is_Controlling_Actual
(N
) then
1036 Print_Str
(Prefix_Str_Char
);
1037 Print_Str
("Is_Controlling_Actual = True");
1041 if Is_Overloaded
(N
) then
1042 Print_Str
(Prefix_Str_Char
);
1043 Print_Str
("Is_Overloaded = True");
1047 if Is_Static_Expression
(N
) then
1048 Print_Str
(Prefix_Str_Char
);
1049 Print_Str
("Is_Static_Expression = True");
1053 if Must_Not_Freeze
(N
) then
1054 Print_Str
(Prefix_Str_Char
);
1055 Print_Str
("Must_Not_Freeze = True");
1059 if Paren_Count
(N
) /= 0 then
1060 Print_Str
(Prefix_Str_Char
);
1061 Print_Str
("Paren_Count = ");
1062 Print_Int
(Int
(Paren_Count
(N
)));
1066 if Raises_Constraint_Error
(N
) then
1067 Print_Str
(Prefix_Str_Char
);
1068 Print_Str
("Raise_Constraint_Error = True");
1074 -- Print Do_Overflow_Check field if present
1076 if Nkind
(N
) in N_Op
and then Do_Overflow_Check
(N
) then
1077 Print_Str
(Prefix_Str_Char
);
1078 Print_Str
("Do_Overflow_Check = True");
1082 -- Print Etype field if present (printing of this field for entities
1083 -- is handled by the Print_Entity_Info procedure).
1085 if Nkind
(N
) in N_Has_Etype
and then Present
(Etype
(N
)) then
1086 Print_Str
(Prefix_Str_Char
);
1087 Print_Str
("Etype = ");
1088 Print_Node_Ref
(Etype
(N
));
1093 -- Loop to print fields included in Pchars array
1095 while P
< Pchar_Pos
(Node_Kind
'Succ (Nkind
(N
))) loop
1099 -- Check for case of False flag, which we never print, or
1100 -- an Empty field, which is also never printed
1104 Field_To_Be_Printed
:= Field1
(N
) /= Union_Id
(Empty
);
1107 Field_To_Be_Printed
:= Field2
(N
) /= Union_Id
(Empty
);
1110 Field_To_Be_Printed
:= Field3
(N
) /= Union_Id
(Empty
);
1113 Field_To_Be_Printed
:= Field4
(N
) /= Union_Id
(Empty
);
1116 Field_To_Be_Printed
:= Field5
(N
) /= Union_Id
(Empty
);
1118 -- Flag3 is obsolete, so this probably gets removed ???
1120 when F_Flag3
=> Field_To_Be_Printed
:= Has_Aspects
(N
);
1122 when F_Flag4
=> Field_To_Be_Printed
:= Flag4
(N
);
1123 when F_Flag5
=> Field_To_Be_Printed
:= Flag5
(N
);
1124 when F_Flag6
=> Field_To_Be_Printed
:= Flag6
(N
);
1125 when F_Flag7
=> Field_To_Be_Printed
:= Flag7
(N
);
1126 when F_Flag8
=> Field_To_Be_Printed
:= Flag8
(N
);
1127 when F_Flag9
=> Field_To_Be_Printed
:= Flag9
(N
);
1128 when F_Flag10
=> Field_To_Be_Printed
:= Flag10
(N
);
1129 when F_Flag11
=> Field_To_Be_Printed
:= Flag11
(N
);
1130 when F_Flag12
=> Field_To_Be_Printed
:= Flag12
(N
);
1131 when F_Flag13
=> Field_To_Be_Printed
:= Flag13
(N
);
1132 when F_Flag14
=> Field_To_Be_Printed
:= Flag14
(N
);
1133 when F_Flag15
=> Field_To_Be_Printed
:= Flag15
(N
);
1134 when F_Flag16
=> Field_To_Be_Printed
:= Flag16
(N
);
1135 when F_Flag17
=> Field_To_Be_Printed
:= Flag17
(N
);
1136 when F_Flag18
=> Field_To_Be_Printed
:= Flag18
(N
);
1138 -- Flag1,2 are no longer used
1140 when F_Flag1
=> raise Program_Error
;
1141 when F_Flag2
=> raise Program_Error
;
1144 -- Print field if it is to be printed
1146 if Field_To_Be_Printed
then
1147 Print_Str
(Prefix_Str_Char
);
1149 while P
< Pchar_Pos
(Node_Kind
'Succ (Nkind
(N
)))
1150 and then Pchars
(P
) not in Fchar
1152 Print_Char
(Pchars
(P
));
1159 when F_Field1
=> Print_Field
(Field1
(N
), Fmt
);
1160 when F_Field2
=> Print_Field
(Field2
(N
), Fmt
);
1161 when F_Field3
=> Print_Field
(Field3
(N
), Fmt
);
1162 when F_Field4
=> Print_Field
(Field4
(N
), Fmt
);
1164 -- Special case End_Span = Uint5
1167 if Nkind
(N
) = N_Case_Statement
1168 or else Nkind
(N
) = N_If_Statement
1172 Print_Field
(Field5
(N
), Fmt
);
1175 when F_Flag4
=> Print_Flag
(Flag4
(N
));
1176 when F_Flag5
=> Print_Flag
(Flag5
(N
));
1177 when F_Flag6
=> Print_Flag
(Flag6
(N
));
1178 when F_Flag7
=> Print_Flag
(Flag7
(N
));
1179 when F_Flag8
=> Print_Flag
(Flag8
(N
));
1180 when F_Flag9
=> Print_Flag
(Flag9
(N
));
1181 when F_Flag10
=> Print_Flag
(Flag10
(N
));
1182 when F_Flag11
=> Print_Flag
(Flag11
(N
));
1183 when F_Flag12
=> Print_Flag
(Flag12
(N
));
1184 when F_Flag13
=> Print_Flag
(Flag13
(N
));
1185 when F_Flag14
=> Print_Flag
(Flag14
(N
));
1186 when F_Flag15
=> Print_Flag
(Flag15
(N
));
1187 when F_Flag16
=> Print_Flag
(Flag16
(N
));
1188 when F_Flag17
=> Print_Flag
(Flag17
(N
));
1189 when F_Flag18
=> Print_Flag
(Flag18
(N
));
1191 -- Flag1,2 are no longer used
1193 when F_Flag1
=> raise Program_Error
;
1194 when F_Flag2
=> raise Program_Error
;
1196 -- Not clear why we need the following ???
1198 when F_Flag3
=> Print_Flag
(Has_Aspects
(N
));
1203 -- Field is not to be printed (False flag field)
1206 while P
< Pchar_Pos
(Node_Kind
'Succ (Nkind
(N
)))
1207 and then Pchars
(P
) not in Fchar
1214 -- Print aspects if present
1216 if Has_Aspects
(N
) then
1217 Print_Str
(Prefix_Str_Char
);
1218 Print_Str
("Aspect_Specifications = ");
1219 Print_Field
(Union_Id
(Aspect_Specifications
(N
)));
1223 -- Print entity information for entities
1225 if Nkind
(N
) in N_Entity
then
1226 Print_Entity_Info
(N
, Prefix_Str_Char
);
1229 -- Print the SCIL node (if available)
1231 if Present
(Get_SCIL_Node
(N
)) then
1232 Print_Str
(Prefix_Str_Char
);
1233 Print_Str
("SCIL_Node = ");
1234 Print_Node_Ref
(Get_SCIL_Node
(N
));
1239 ------------------------
1240 -- Print_Node_Briefly --
1241 ------------------------
1243 procedure Print_Node_Briefly
(N
: Node_Id
) is
1245 Printing_Descendants
:= False;
1247 Print_Node_Header
(N
);
1248 end Print_Node_Briefly
;
1250 -----------------------
1251 -- Print_Node_Header --
1252 -----------------------
1254 procedure Print_Node_Header
(N
: Node_Id
) is
1255 Notes
: Boolean := False;
1260 if N
> Atree_Private_Part
.Nodes
.Last
then
1261 Print_Str
(" (no such node)");
1266 if Comes_From_Source
(N
) then
1268 Print_Str
(" (source");
1271 if Analyzed
(N
) then
1279 Print_Str
("analyzed");
1282 if Error_Posted
(N
) then
1290 Print_Str
("posted");
1298 end Print_Node_Header
;
1300 ---------------------
1301 -- Print_Node_Kind --
1302 ---------------------
1304 procedure Print_Node_Kind
(N
: Node_Id
) is
1306 S
: constant String := Node_Kind
'Image (Nkind
(N
));
1309 if Phase
= Printing
then
1312 -- Note: the call to Fold_Upper in this loop is to get past the GNAT
1313 -- bug of 'Image returning lower case instead of upper case.
1315 for J
in S
'Range loop
1317 Write_Char
(Fold_Upper
(S
(J
)));
1319 Write_Char
(Fold_Lower
(S
(J
)));
1322 Ucase
:= (S
(J
) = '_');
1325 end Print_Node_Kind
;
1327 --------------------
1328 -- Print_Node_Ref --
1329 --------------------
1331 procedure Print_Node_Ref
(N
: Node_Id
) is
1335 if Phase
/= Printing
then
1340 Write_Str
("<empty>");
1342 elsif N
= Error
then
1343 Write_Str
("<error>");
1346 if Printing_Descendants
then
1347 S
:= Serial_Number
(Int
(N
));
1357 Print_Node_Kind
(N
);
1359 if Nkind
(N
) in N_Has_Chars
then
1361 Print_Name
(Chars
(N
));
1364 if Nkind
(N
) in N_Entity
then
1365 Write_Str
(" (Entity_Id=");
1367 Write_Str
(" (Node_Id=");
1370 Write_Int
(Int
(N
));
1372 if Sloc
(N
) <= Standard_Location
then
1381 ------------------------
1382 -- Print_Node_Subtree --
1383 ------------------------
1385 procedure Print_Node_Subtree
(N
: Node_Id
) is
1389 Next_Serial_Number
:= 1;
1391 Visit_Node
(N
, "", ' ');
1393 Next_Serial_Number
:= 1;
1395 Visit_Node
(N
, "", ' ');
1398 end Print_Node_Subtree
;
1404 procedure Print_Str
(S
: String) is
1406 if Phase
= Printing
then
1411 --------------------------
1412 -- Print_Str_Mixed_Case --
1413 --------------------------
1415 procedure Print_Str_Mixed_Case
(S
: String) is
1419 if Phase
= Printing
then
1422 for J
in S
'Range loop
1426 Write_Char
(Fold_Lower
(S
(J
)));
1429 Ucase
:= (S
(J
) = '_');
1432 end Print_Str_Mixed_Case
;
1438 procedure Print_Term
is
1439 procedure Free
is new Unchecked_Deallocation
1440 (Hash_Table_Type
, Access_Hash_Table_Type
);
1446 ---------------------
1447 -- Print_Tree_Elist --
1448 ---------------------
1450 procedure Print_Tree_Elist
(E
: Elist_Id
) is
1454 Printing_Descendants
:= False;
1457 Print_Elist_Ref
(E
);
1460 M
:= First_Elmt
(E
);
1463 Print_Str
("<empty element list>");
1470 exit when No
(Next_Elmt
(M
));
1471 Print_Node
(Node
(M
), "", '|');
1475 Print_Node
(Node
(M
), "", ' ');
1478 end Print_Tree_Elist
;
1480 ---------------------
1481 -- Print_Tree_List --
1482 ---------------------
1484 procedure Print_Tree_List
(L
: List_Id
) is
1488 Printing_Descendants
:= False;
1492 Print_Str
(" List_Id=");
1493 Print_Int
(Int
(L
));
1499 Print_Str
("<empty node list>");
1506 exit when Next
(N
) = Empty
;
1507 Print_Node
(N
, "", '|');
1511 Print_Node
(N
, "", ' ');
1514 end Print_Tree_List
;
1516 ---------------------
1517 -- Print_Tree_Node --
1518 ---------------------
1520 procedure Print_Tree_Node
(N
: Node_Id
; Label
: String := "") is
1522 Printing_Descendants
:= False;
1524 Print_Node
(N
, Label
, ' ');
1525 end Print_Tree_Node
;
1531 procedure pt
(N
: Node_Id
) is
1533 Print_Node_Subtree
(N
);
1540 procedure ppp
(N
: Node_Id
) is
1549 -- The hashing algorithm is to use the remainder of the ID value divided
1550 -- by the hash table length as the starting point in the table, and then
1551 -- handle collisions by serial searching wrapping at the end of the table.
1554 -- Set by an unsuccessful call to Serial_Number (one which returns zero)
1555 -- to save the slot that should be used if Set_Serial_Number is called.
1557 function Serial_Number
(Id
: Int
) return Nat
is
1558 H
: Int
:= Id
mod Hash_Table_Len
;
1561 while Hash_Table
(H
).Serial
/= 0 loop
1563 if Id
= Hash_Table
(H
).Id
then
1564 return Hash_Table
(H
).Serial
;
1569 if H
> Hash_Table
'Last then
1574 -- Entry was not found, save slot number for possible subsequent call
1575 -- to Set_Serial_Number, and unconditionally save the Id in this slot
1576 -- in case of such a call (the Id field is never read if the serial
1577 -- number of the slot is zero, so this is harmless in the case where
1578 -- Set_Serial_Number is not subsequently called).
1581 Hash_Table
(H
).Id
:= Id
;
1586 -----------------------
1587 -- Set_Serial_Number --
1588 -----------------------
1590 procedure Set_Serial_Number
is
1592 Hash_Table
(Hash_Slot
).Serial
:= Next_Serial_Number
;
1593 Next_Serial_Number
:= Next_Serial_Number
+ 1;
1594 end Set_Serial_Number
;
1600 procedure Tree_Dump
is
1601 procedure Underline
;
1602 -- Put underline under string we just printed
1604 procedure Underline
is
1605 Col
: constant Int
:= Column
;
1610 while Col
> Column
loop
1617 -- Start of processing for Tree_Dump. Note that we turn off the tree dump
1618 -- flags immediately, before starting the dump. This avoids generating two
1619 -- copies of the dump if an abort occurs after printing the dump, and more
1620 -- importantly, avoids an infinite loop if an abort occurs during the dump.
1622 -- Note: unlike in the source print case (in Sprint), we do not output
1623 -- separate trees for each unit. Instead the -df debug switch causes the
1624 -- tree that is output from the main unit to trace references into other
1625 -- units (normally such references are not traced). Since all other units
1626 -- are linked to the main unit by at least one reference, this causes all
1627 -- tree nodes to be included in the output tree.
1630 if Debug_Flag_Y
then
1631 Debug_Flag_Y
:= False;
1633 Write_Str
("Tree created for Standard (spec) ");
1635 Print_Node_Subtree
(Standard_Package_Node
);
1639 if Debug_Flag_T
then
1640 Debug_Flag_T
:= False;
1643 Write_Str
("Tree created for ");
1644 Write_Unit_Name
(Unit_Name
(Main_Unit
));
1646 Print_Node_Subtree
(Cunit
(Main_Unit
));
1656 procedure Visit_Elist
(E
: Elist_Id
; Prefix_Str
: String) is
1659 S
: constant Nat
:= Serial_Number
(Int
(E
));
1662 -- In marking phase, return if already marked, otherwise set next
1663 -- serial number in hash table for later reference.
1665 if Phase
= Marking
then
1667 return; -- already visited
1672 -- In printing phase, if already printed, then return, otherwise we
1673 -- are printing the next item, so increment the serial number.
1676 if S
< Next_Serial_Number
then
1677 return; -- already printed
1679 Next_Serial_Number
:= Next_Serial_Number
+ 1;
1683 -- Now process the list (Print calls have no effect in marking phase)
1685 Print_Str
(Prefix_Str
);
1686 Print_Elist_Ref
(E
);
1689 if Is_Empty_Elmt_List
(E
) then
1690 Print_Str
(Prefix_Str
);
1691 Print_Str
("(Empty element list)");
1696 if Phase
= Printing
then
1697 M
:= First_Elmt
(E
);
1698 while Present
(M
) loop
1700 Print_Str
(Prefix_Str
);
1707 Print_Str
(Prefix_Str
);
1711 M
:= First_Elmt
(E
);
1712 while Present
(M
) loop
1713 Visit_Node
(Node
(M
), Prefix_Str
, ' ');
1723 procedure Visit_List
(L
: List_Id
; Prefix_Str
: String) is
1725 S
: constant Nat
:= Serial_Number
(Int
(L
));
1728 -- In marking phase, return if already marked, otherwise set next
1729 -- serial number in hash table for later reference.
1731 if Phase
= Marking
then
1738 -- In printing phase, if already printed, then return, otherwise we
1739 -- are printing the next item, so increment the serial number.
1742 if S
< Next_Serial_Number
then
1743 return; -- already printed
1745 Next_Serial_Number
:= Next_Serial_Number
+ 1;
1749 -- Now process the list (Print calls have no effect in marking phase)
1751 Print_Str
(Prefix_Str
);
1755 Print_Str
(Prefix_Str
);
1756 Print_Str
("|Parent = ");
1757 Print_Node_Ref
(Parent
(L
));
1763 Print_Str
(Prefix_Str
);
1764 Print_Str
("(Empty list)");
1769 Print_Str
(Prefix_Str
);
1773 while Next
(N
) /= Empty
loop
1774 Visit_Node
(N
, Prefix_Str
, '|');
1779 Visit_Node
(N
, Prefix_Str
, ' ');
1786 procedure Visit_Node
1788 Prefix_Str
: String;
1789 Prefix_Char
: Character)
1791 New_Prefix
: String (Prefix_Str
'First .. Prefix_Str
'Last + 2);
1792 -- Prefix string for printing referenced fields
1794 procedure Visit_Descendent
1796 No_Indent
: Boolean := False);
1797 -- This procedure tests the given value of one of the Fields referenced
1798 -- by the current node to determine whether to visit it recursively.
1799 -- Normally No_Indent is false, which means that the visited node will
1800 -- be indented using New_Prefix. If No_Indent is set to True, then
1801 -- this indentation is skipped, and Prefix_Str is used for the call
1802 -- to print the descendent. No_Indent is effective only if the
1803 -- referenced descendent is a node.
1805 ----------------------
1806 -- Visit_Descendent --
1807 ----------------------
1809 procedure Visit_Descendent
1811 No_Indent
: Boolean := False)
1814 -- Case of descendent is a node
1816 if D
in Node_Range
then
1818 -- Don't bother about Empty or Error descendents
1820 if D
<= Union_Id
(Empty_Or_Error
) then
1825 Nod
: constant Node_Or_Entity_Id
:= Node_Or_Entity_Id
(D
);
1828 -- Descendents in one of the standardly compiled internal
1829 -- packages are normally ignored, unless the parent is also
1830 -- in such a package (happens when Standard itself is output)
1831 -- or if the -df switch is set which causes all links to be
1832 -- followed, even into package standard.
1834 if Sloc
(Nod
) <= Standard_Location
then
1835 if Sloc
(N
) > Standard_Location
1836 and then not Debug_Flag_F
1841 -- Don't bother about a descendent in a different unit than
1842 -- the node we came from unless the -df switch is set. Note
1843 -- that we know at this point that Sloc (D) > Standard_Location
1845 -- Note: the tests for No_Location here just make sure that we
1846 -- don't blow up on a node which is missing an Sloc value. This
1847 -- should not normally happen.
1850 if (Sloc
(N
) <= Standard_Location
1851 or else Sloc
(N
) = No_Location
1852 or else Sloc
(Nod
) = No_Location
1853 or else not In_Same_Source_Unit
(Nod
, N
))
1854 and then not Debug_Flag_F
1860 -- Don't bother visiting a source node that has a parent which
1861 -- is not the node we came from. We prefer to trace such nodes
1862 -- from their real parents. This causes the tree to be printed
1863 -- in a more coherent order, e.g. a defining identifier listed
1864 -- next to its corresponding declaration, instead of next to
1865 -- some semantic reference.
1867 -- This test is skipped for nodes in standard packages unless
1868 -- the -dy option is set (which outputs the tree for standard)
1870 -- Also, always follow pointers to Is_Itype entities,
1871 -- since we want to list these when they are first referenced.
1873 if Parent
(Nod
) /= Empty
1874 and then Comes_From_Source
(Nod
)
1875 and then Parent
(Nod
) /= N
1876 and then (Sloc
(N
) > Standard_Location
or else Debug_Flag_Y
)
1881 -- If we successfully fall through all the above tests (which
1882 -- execute a return if the node is not to be visited), we can
1883 -- go ahead and visit the node!
1886 Visit_Node
(Nod
, Prefix_Str
, Prefix_Char
);
1888 Visit_Node
(Nod
, New_Prefix
, ' ');
1892 -- Case of descendent is a list
1894 elsif D
in List_Range
then
1896 -- Don't bother with a missing list, empty list or error list
1898 if D
= Union_Id
(No_List
)
1899 or else D
= Union_Id
(Error_List
)
1900 or else Is_Empty_List
(List_Id
(D
))
1904 -- Otherwise we can visit the list. Note that we don't bother
1905 -- to do the parent test that we did for the node case, because
1906 -- it just does not happen that lists are referenced more than
1907 -- one place in the tree. We aren't counting on this being the
1908 -- case to generate valid output, it is just that we don't need
1909 -- in practice to worry about listing the list at a place that
1913 Visit_List
(List_Id
(D
), New_Prefix
);
1916 -- Case of descendent is an element list
1918 elsif D
in Elist_Range
then
1920 -- Don't bother with a missing list, or an empty list
1922 if D
= Union_Id
(No_Elist
)
1923 or else Is_Empty_Elmt_List
(Elist_Id
(D
))
1927 -- Otherwise, visit the referenced element list
1930 Visit_Elist
(Elist_Id
(D
), New_Prefix
);
1933 -- For all other kinds of descendents (strings, names, uints etc),
1934 -- there is nothing to visit (the contents of the field will be
1935 -- printed when we print the containing node, but what concerns
1936 -- us now is looking for descendents in the tree.
1941 end Visit_Descendent
;
1943 -- Start of processing for Visit_Node
1950 -- Set fatal error node in case we get a blow up during the trace
1952 Current_Error_Node
:= N
;
1954 New_Prefix
(Prefix_Str
'Range) := Prefix_Str
;
1955 New_Prefix
(Prefix_Str
'Last + 1) := Prefix_Char
;
1956 New_Prefix
(Prefix_Str
'Last + 2) := ' ';
1958 -- In the marking phase, all we do is to set the serial number
1960 if Phase
= Marking
then
1961 if Serial_Number
(Int
(N
)) /= 0 then
1962 return; -- already visited
1967 -- In the printing phase, we print the node
1970 if Serial_Number
(Int
(N
)) < Next_Serial_Number
then
1972 -- Here we have already visited the node, but if it is in
1973 -- a list, we still want to print the reference, so that
1974 -- it is clear that it belongs to the list.
1976 if Is_List_Member
(N
) then
1977 Print_Str
(Prefix_Str
);
1980 Print_Str
(Prefix_Str
);
1981 Print_Char
(Prefix_Char
);
1982 Print_Str
("(already output)");
1984 Print_Str
(Prefix_Str
);
1985 Print_Char
(Prefix_Char
);
1992 Print_Node
(N
, Prefix_Str
, Prefix_Char
);
1993 Print_Str
(Prefix_Str
);
1994 Print_Char
(Prefix_Char
);
1996 Next_Serial_Number
:= Next_Serial_Number
+ 1;
2000 -- Visit all descendents of this node
2002 if Nkind
(N
) not in N_Entity
then
2003 Visit_Descendent
(Field1
(N
));
2004 Visit_Descendent
(Field2
(N
));
2005 Visit_Descendent
(Field3
(N
));
2006 Visit_Descendent
(Field4
(N
));
2007 Visit_Descendent
(Field5
(N
));
2009 if Has_Aspects
(N
) then
2010 Visit_Descendent
(Union_Id
(Aspect_Specifications
(N
)));
2016 Visit_Descendent
(Field1
(N
));
2017 Visit_Descendent
(Field3
(N
));
2018 Visit_Descendent
(Field4
(N
));
2019 Visit_Descendent
(Field5
(N
));
2020 Visit_Descendent
(Field6
(N
));
2021 Visit_Descendent
(Field7
(N
));
2022 Visit_Descendent
(Field8
(N
));
2023 Visit_Descendent
(Field9
(N
));
2024 Visit_Descendent
(Field10
(N
));
2025 Visit_Descendent
(Field11
(N
));
2026 Visit_Descendent
(Field12
(N
));
2027 Visit_Descendent
(Field13
(N
));
2028 Visit_Descendent
(Field14
(N
));
2029 Visit_Descendent
(Field15
(N
));
2030 Visit_Descendent
(Field16
(N
));
2031 Visit_Descendent
(Field17
(N
));
2032 Visit_Descendent
(Field18
(N
));
2033 Visit_Descendent
(Field19
(N
));
2034 Visit_Descendent
(Field20
(N
));
2035 Visit_Descendent
(Field21
(N
));
2036 Visit_Descendent
(Field22
(N
));
2037 Visit_Descendent
(Field23
(N
));
2039 -- Now an interesting kludge. Normally parents are always printed
2040 -- since we traverse the tree in a downwards direction. There is
2041 -- however an exception to this rule, which is the case where a
2042 -- parent is constructed by the compiler and is not referenced
2043 -- elsewhere in the tree. The following catches this case
2045 if not Comes_From_Source
(N
) then
2046 Visit_Descendent
(Union_Id
(Parent
(N
)));
2049 -- You may be wondering why we omitted Field2 above. The answer
2050 -- is that this is the Next_Entity field, and we want to treat
2051 -- it rather specially. Why? Because a Next_Entity link does not
2052 -- correspond to a level deeper in the tree, and we do not want
2053 -- the tree to march off to the right of the page due to bogus
2054 -- indentations coming from this effect.
2056 -- To prevent this, what we do is to control references via
2057 -- Next_Entity only from the first entity on a given scope
2058 -- chain, and we keep them all at the same level. Of course
2059 -- if an entity has already been referenced it is not printed.
2061 if Present
(Next_Entity
(N
))
2062 and then Present
(Scope
(N
))
2063 and then First_Entity
(Scope
(N
)) = N
2070 while Present
(Nod
) loop
2071 Visit_Descendent
(Union_Id
(Next_Entity
(Nod
)));
2072 Nod
:= Next_Entity
(Nod
);