?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Remove some compile time warnings about duplicate definitions.
[official-gcc.git] / gcc / ada / treepr.adb
blob80954c9e660c54dcd69b5c96a7aeea225154dc8d
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT COMPILER COMPONENTS --
4 -- --
5 -- T R E E P R --
6 -- --
7 -- B o d y --
8 -- --
9 -- $Revision: 1.128 $
10 -- --
11 -- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
12 -- --
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. --
23 -- --
24 -- GNAT was originally developed by the GNAT team at New York University. --
25 -- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). --
26 -- --
27 ------------------------------------------------------------------------------
28
29 with Atree; use Atree;
30 with Csets; use Csets;
31 with Debug; use Debug;
32 with Einfo; use Einfo;
33 with Elists; use Elists;
34 with Lib; use Lib;
35 with Namet; use Namet;
36 with Nlists; use Nlists;
37 with Output; use Output;
38 with Sem_Mech; use Sem_Mech;
39 with Sinfo; use Sinfo;
40 with Snames; use Snames;
41 with Sinput; use Sinput;
42 with Stand; use Stand;
43 with Stringt; use Stringt;
44 with Treeprs; use Treeprs;
45 with Uintp; use Uintp;
46 with Urealp; use Urealp;
47 with Uname; use Uname;
48 with Unchecked_Deallocation;
49
50 package body Treepr is
51
52 use Atree.Unchecked_Access;
53 -- This module uses the unchecked access functions in package Atree
54 -- since it does an untyped traversal of the tree (we do not want to
55 -- count on the structure of the tree being correct in this routine!)
56
57 ----------------------------------
58 -- Approach Used for Tree Print --
59 ----------------------------------
60
61 -- When a complete subtree is being printed, a trace phase first marks
62 -- the nodes and lists to be printed. This trace phase allocates logical
63 -- numbers corresponding to the order in which the nodes and lists will
64 -- be printed. The Node_Id, List_Id and Elist_Id values are mapped to
65 -- logical node numbers using a hash table. Output is done using a set
66 -- of Print_xxx routines, which are similar to the Write_xxx routines
67 -- with the same name, except that they do not generate any output in
68 -- the marking phase. This allows identical logic to be used in the
69 -- two phases.
70
71 -- Note that the hash table not only holds the serial numbers, but also
72 -- acts as a record of which nodes have already been visited. In the
73 -- marking phase, a node has been visited if it is already in the hash
74 -- table, and in the printing phase, we can tell whether a node has
75 -- already been printed by looking at the value of the serial number.
76
77 ----------------------
78 -- Global Variables --
79 ----------------------
80
81 type Hash_Record is record
82 Serial : Nat;
83 -- Serial number for hash table entry. A value of zero means that
84 -- the entry is currently unused.
85
86 Id : Int;
87 -- If serial number field is non-zero, contains corresponding Id value
88 end record;
89
90 type Hash_Table_Type is array (Nat range <>) of Hash_Record;
91 type Access_Hash_Table_Type is access Hash_Table_Type;
92 Hash_Table : Access_Hash_Table_Type;
93 -- The hash table itself, see Serial_Number function for details of use
94
95 Hash_Table_Len : Nat;
96 -- Range of Hash_Table is from 0 .. Hash_Table_Len - 1 so that dividing
97 -- by Hash_Table_Len gives a remainder that is in Hash_Table'Range.
98
99 Next_Serial_Number : Nat;
100 -- Number of last visited node or list. Used during the marking phase to
101 -- set proper node numbers in the hash table, and during the printing
102 -- phase to make sure that a given node is not printed more than once.
103 -- (nodes are printed in order during the printing phase, that's the
104 -- point of numbering them in the first place!)
105
106 Printing_Descendants : Boolean;
107 -- True if descendants are being printed, False if not. In the false case,
108 -- only node Id's are printed. In the true case, node numbers as well as
109 -- node Id's are printed, as described above.
110
111 type Phase_Type is (Marking, Printing);
112 -- Type for Phase variable
113
114 Phase : Phase_Type;
115 -- When an entire tree is being printed, the traversal operates in two
116 -- phases. The first phase marks the nodes in use by installing node
117 -- numbers in the node number table. The second phase prints the nodes.
118 -- This variable indicates the current phase.
119
120 ----------------------
121 -- Local Procedures --
122 ----------------------
123
124 procedure Print_End_Span (N : Node_Id);
125 -- Special routine to print contents of End_Span field of node N.
126 -- The format includes the implicit source location as well as the
127 -- value of the field.
128
129 procedure Print_Init;
130 -- Initialize for printing of tree with descendents
131
132 procedure Print_Term;
133 -- Clean up after printing of tree with descendents
134
135 procedure Print_Char (C : Character);
136 -- Print character C if currently in print phase, noop if in marking phase
137
138 procedure Print_Name (N : Name_Id);
139 -- Print name from names table if currently in print phase, noop if in
140 -- marking phase. Note that the name is output in mixed case mode.
141
142 procedure Print_Node_Kind (N : Node_Id);
143 -- Print node kind name in mixed case if in print phase, noop if in
144 -- marking phase.
145
146 procedure Print_Str (S : String);
147 -- Print string S if currently in print phase, noop if in marking phase
148
149 procedure Print_Str_Mixed_Case (S : String);
150 -- Like Print_Str, except that the string is printed in mixed case mode
151
152 procedure Print_Int (I : Int);
153 -- Print integer I if currently in print phase, noop if in marking phase
154
155 procedure Print_Eol;
156 -- Print end of line if currently in print phase, noop if in marking phase
157
158 procedure Print_Node_Ref (N : Node_Id);
159 -- Print "<empty>", "<error>" or "Node #nnn" with additional information
160 -- in the latter case, including the Id and the Nkind of the node.
161
162 procedure Print_List_Ref (L : List_Id);
163 -- Print "<no list>", or "<empty node list>" or "Node list #nnn"
164
165 procedure Print_Elist_Ref (E : Elist_Id);
166 -- Print "<no elist>", or "<empty element list>" or "Element list #nnn"
167
168 procedure Print_Entity_Info (Ent : Entity_Id; Prefix : String);
169 -- Called if the node being printed is an entity. Prints fields from the
170 -- extension, using routines in Einfo to get the field names and flags.
171
172 procedure Print_Field (Val : Union_Id; Format : UI_Format := Auto);
173 -- Print representation of Field value (name, tree, string, uint, charcode)
174 -- The format parameter controls the format of printing in the case of an
175 -- integer value (see UI_Write for details).
176
177 procedure Print_Flag (F : Boolean);
178 -- Print True or False
179
180 procedure Print_Node
181 (N : Node_Id;
182 Prefix_Str : String;
183 Prefix_Char : Character);
184 -- This is the internal routine used to print a single node. Each line of
185 -- output is preceded by Prefix_Str (which is used to set the indentation
186 -- level and the bars used to link list elements). In addition, for lines
187 -- other than the first, an additional character Prefix_Char is output.
188
189 function Serial_Number (Id : Int) return Nat;
190 -- Given a Node_Id, List_Id or Elist_Id, returns the previously assigned
191 -- serial number, or zero if no serial number has yet been assigned.
192
193 procedure Set_Serial_Number;
194 -- Can be called only immediately following a call to Serial_Number that
195 -- returned a value of zero. Causes the value of Next_Serial_Number to be
196 -- placed in the hash table (corresponding to the Id argument used in the
197 -- Serial_Number call), and increments Next_Serial_Number.
198
199 procedure Visit_Node
200 (N : Node_Id;
201 Prefix_Str : String;
202 Prefix_Char : Character);
203 -- Called to process a single node in the case where descendents are to
204 -- be printed before every line, and Prefix_Char added to all lines
205 -- except the header line for the node.
206
207 procedure Visit_List (L : List_Id; Prefix_Str : String);
208 -- Visit_List is called to process a list in the case where descendents
209 -- are to be printed. Prefix_Str is to be added to all printed lines.
210
211 procedure Visit_Elist (E : Elist_Id; Prefix_Str : String);
212 -- Visit_Elist is called to process an element list in the case where
213 -- descendents are to be printed. Prefix_Str is to be added to all
214 -- printed lines.
215
216 --------
217 -- PE --
218 --------
219
220 procedure PE (E : Elist_Id) is
221 begin
222 Print_Tree_Elist (E);
223 end PE;
224
225 --------
226 -- PL --
227 --------
228
229 procedure PL (L : List_Id) is
230 begin
231 Print_Tree_List (L);
232 end PL;
233
234 --------
235 -- PN --
236 --------
237
238 procedure PN (N : Node_Id) is
239 begin
240 Print_Tree_Node (N);
241 end PN;
242
243 ----------------
244 -- Print_Char --
245 ----------------
246
247 procedure Print_Char (C : Character) is
248 begin
249 if Phase = Printing then
250 Write_Char (C);
251 end if;
252 end Print_Char;
253
254 ---------------------
255 -- Print_Elist_Ref --
256 ---------------------
257
258 procedure Print_Elist_Ref (E : Elist_Id) is
259 begin
260 if Phase /= Printing then
261 return;
262 end if;
263
264 if E = No_Elist then
265 Write_Str ("<no elist>");
266
267 elsif Is_Empty_Elmt_List (E) then
268 Write_Str ("Empty elist, (Elist_Id=");
269 Write_Int (Int (E));
270 Write_Char (')');
271
272 else
273 Write_Str ("(Elist_Id=");
274 Write_Int (Int (E));
275 Write_Char (')');
276
277 if Printing_Descendants then
278 Write_Str (" #");
279 Write_Int (Serial_Number (Int (E)));
280 end if;
281 end if;
282 end Print_Elist_Ref;
283
284 -------------------------
285 -- Print_Elist_Subtree --
286 -------------------------
287
288 procedure Print_Elist_Subtree (E : Elist_Id) is
289 begin
290 Print_Init;
291
292 Next_Serial_Number := 1;
293 Phase := Marking;
294 Visit_Elist (E, "");
295
296 Next_Serial_Number := 1;
297 Phase := Printing;
298 Visit_Elist (E, "");
299
300 Print_Term;
301 end Print_Elist_Subtree;
302
303 --------------------
304 -- Print_End_Span --
305 --------------------
306
307 procedure Print_End_Span (N : Node_Id) is
308 Val : constant Uint := End_Span (N);
309
310 begin
311 UI_Write (Val);
312 Write_Str (" (Uint = ");
313 Write_Int (Int (Field5 (N)));
314 Write_Str (") ");
315
316 if Val /= No_Uint then
317 Write_Location (End_Location (N));
318 end if;
319 end Print_End_Span;
320
321 -----------------------
322 -- Print_Entity_Info --
323 -----------------------
324
325 procedure Print_Entity_Info (Ent : Entity_Id; Prefix : String) is
326 function Field_Present (U : Union_Id) return Boolean;
327 -- Returns False unless the value U represents a missing value
328 -- (Empty, No_Uint, No_Ureal or No_String)
329
330 function Field_Present (U : Union_Id) return Boolean is
331 begin
332 return
333 U /= Union_Id (Empty) and then
334 U /= To_Union (No_Uint) and then
335 U /= To_Union (No_Ureal) and then
336 U /= Union_Id (No_String);
337 end Field_Present;
338
339 -- Start of processing for Print_Entity_Info
340
341 begin
342 Print_Str (Prefix);
343 Print_Str ("Ekind = ");
344 Print_Str_Mixed_Case (Entity_Kind'Image (Ekind (Ent)));
345 Print_Eol;
346
347 Print_Str (Prefix);
348 Print_Str ("Etype = ");
349 Print_Node_Ref (Etype (Ent));
350 Print_Eol;
351
352 if Convention (Ent) /= Convention_Ada then
353 Print_Str (Prefix);
354 Print_Str ("Convention = ");
355
356 -- Print convention name skipping the Convention_ at the start
357
358 declare
359 S : constant String := Convention_Id'Image (Convention (Ent));
360
361 begin
362 Print_Str_Mixed_Case (S (12 .. S'Last));
363 Print_Eol;
364 end;
365 end if;
366
367 if Field_Present (Field6 (Ent)) then
368 Print_Str (Prefix);
369 Write_Field6_Name (Ent);
370 Write_Str (" = ");
371 Print_Field (Field6 (Ent));
372 Print_Eol;
373 end if;
374
375 if Field_Present (Field7 (Ent)) then
376 Print_Str (Prefix);
377 Write_Field7_Name (Ent);
378 Write_Str (" = ");
379 Print_Field (Field7 (Ent));
380 Print_Eol;
381 end if;
382
383 if Field_Present (Field8 (Ent)) then
384 Print_Str (Prefix);
385 Write_Field8_Name (Ent);
386 Write_Str (" = ");
387 Print_Field (Field8 (Ent));
388 Print_Eol;
389 end if;
390
391 if Field_Present (Field9 (Ent)) then
392 Print_Str (Prefix);
393 Write_Field9_Name (Ent);
394 Write_Str (" = ");
395 Print_Field (Field9 (Ent));
396 Print_Eol;
397 end if;
398
399 if Field_Present (Field10 (Ent)) then
400 Print_Str (Prefix);
401 Write_Field10_Name (Ent);
402 Write_Str (" = ");
403 Print_Field (Field10 (Ent));
404 Print_Eol;
405 end if;
406
407 if Field_Present (Field11 (Ent)) then
408 Print_Str (Prefix);
409 Write_Field11_Name (Ent);
410 Write_Str (" = ");
411 Print_Field (Field11 (Ent));
412 Print_Eol;
413 end if;
414
415 if Field_Present (Field12 (Ent)) then
416 Print_Str (Prefix);
417 Write_Field12_Name (Ent);
418 Write_Str (" = ");
419 Print_Field (Field12 (Ent));
420 Print_Eol;
421 end if;
422
423 if Field_Present (Field13 (Ent)) then
424 Print_Str (Prefix);
425 Write_Field13_Name (Ent);
426 Write_Str (" = ");
427 Print_Field (Field13 (Ent));
428 Print_Eol;
429 end if;
430
431 if Field_Present (Field14 (Ent)) then
432 Print_Str (Prefix);
433 Write_Field14_Name (Ent);
434 Write_Str (" = ");
435 Print_Field (Field14 (Ent));
436 Print_Eol;
437 end if;
438
439 if Field_Present (Field15 (Ent)) then
440 Print_Str (Prefix);
441 Write_Field15_Name (Ent);
442 Write_Str (" = ");
443 Print_Field (Field15 (Ent));
444 Print_Eol;
445 end if;
446
447 if Field_Present (Field16 (Ent)) then
448 Print_Str (Prefix);
449 Write_Field16_Name (Ent);
450 Write_Str (" = ");
451 Print_Field (Field16 (Ent));
452 Print_Eol;
453 end if;
454
455 if Field_Present (Field17 (Ent)) then
456 Print_Str (Prefix);
457 Write_Field17_Name (Ent);
458 Write_Str (" = ");
459 Print_Field (Field17 (Ent));
460 Print_Eol;
461 end if;
462
463 if Field_Present (Field18 (Ent)) then
464 Print_Str (Prefix);
465 Write_Field18_Name (Ent);
466 Write_Str (" = ");
467 Print_Field (Field18 (Ent));
468 Print_Eol;
469 end if;
470
471 if Field_Present (Field19 (Ent)) then
472 Print_Str (Prefix);
473 Write_Field19_Name (Ent);
474 Write_Str (" = ");
475 Print_Field (Field19 (Ent));
476 Print_Eol;
477 end if;
478
479 if Field_Present (Field20 (Ent)) then
480 Print_Str (Prefix);
481 Write_Field20_Name (Ent);
482 Write_Str (" = ");
483 Print_Field (Field20 (Ent));
484 Print_Eol;
485 end if;
486
487 if Field_Present (Field21 (Ent)) then
488 Print_Str (Prefix);
489 Write_Field21_Name (Ent);
490 Write_Str (" = ");
491 Print_Field (Field21 (Ent));
492 Print_Eol;
493 end if;
494
495 if Field_Present (Field22 (Ent)) then
496 Print_Str (Prefix);
497 Write_Field22_Name (Ent);
498 Write_Str (" = ");
499
500 -- Mechanism case has to be handled specially
501
502 if Ekind (Ent) = E_Function or else Is_Formal (Ent) then
503 declare
504 M : constant Mechanism_Type := Mechanism (Ent);
505
506 begin
507 case M is
508 when Default_Mechanism => Write_Str ("Default");
509 when By_Copy => Write_Str ("By_Copy");
510 when By_Reference => Write_Str ("By_Reference");
511 when By_Descriptor => Write_Str ("By_Descriptor");
512 when By_Descriptor_UBS => Write_Str ("By_Descriptor_UBS");
513 when By_Descriptor_UBSB => Write_Str ("By_Descriptor_UBSB");
514 when By_Descriptor_UBA => Write_Str ("By_Descriptor_UBA");
515 when By_Descriptor_S => Write_Str ("By_Descriptor_S");
516 when By_Descriptor_SB => Write_Str ("By_Descriptor_SB");
517 when By_Descriptor_A => Write_Str ("By_Descriptor_A");
518 when By_Descriptor_NCA => Write_Str ("By_Descriptor_NCA");
519
520 when 1 .. Mechanism_Type'Last =>
521 Write_Str ("By_Copy if size <= ");
522 Write_Int (Int (M));
523
524 end case;
525 end;
526
527 -- Normal case (not Mechanism)
528
529 else
530 Print_Field (Field22 (Ent));
531 end if;
532
533 Print_Eol;
534 end if;
535
536 if Field_Present (Field23 (Ent)) then
537 Print_Str (Prefix);
538 Write_Field23_Name (Ent);
539 Write_Str (" = ");
540 Print_Field (Field23 (Ent));
541 Print_Eol;
542 end if;
543
544 Write_Entity_Flags (Ent, Prefix);
545
546 end Print_Entity_Info;
547
548 ---------------
549 -- Print_Eol --
550 ---------------
551
552 procedure Print_Eol is
553 begin
554 if Phase = Printing then
555 Write_Eol;
556 end if;
557 end Print_Eol;
558
559 -----------------
560 -- Print_Field --
561 -----------------
562
563 procedure Print_Field (Val : Union_Id; Format : UI_Format := Auto) is
564 begin
565 if Phase /= Printing then
566 return;
567 end if;
568
569 if Val in Node_Range then
570 Print_Node_Ref (Node_Id (Val));
571
572 elsif Val in List_Range then
573 Print_List_Ref (List_Id (Val));
574
575 elsif Val in Elist_Range then
576 Print_Elist_Ref (Elist_Id (Val));
577
578 elsif Val in Names_Range then
579 Print_Name (Name_Id (Val));
580 Write_Str (" (Name_Id=");
581 Write_Int (Int (Val));
582 Write_Char (')');
583
584 elsif Val in Strings_Range then
585 Write_String_Table_Entry (String_Id (Val));
586 Write_Str (" (String_Id=");
587 Write_Int (Int (Val));
588 Write_Char (')');
589
590 elsif Val in Uint_Range then
591 UI_Write (From_Union (Val), Format);
592 Write_Str (" (Uint = ");
593 Write_Int (Int (Val));
594 Write_Char (')');
595
596 elsif Val in Ureal_Range then
597 UR_Write (From_Union (Val));
598 Write_Str (" (Ureal = ");
599 Write_Int (Int (Val));
600 Write_Char (')');
601
602 elsif Val in Char_Code_Range then
603 Write_Str ("Character code = ");
604
605 declare
606 C : Char_Code := Char_Code (Val - Char_Code_Bias);
607
608 begin
609 Write_Int (Int (C));
610 Write_Str (" ('");
611 Write_Char_Code (C);
612 Write_Str ("')");
613 end;
614
615 else
616 Print_Str ("****** Incorrect value = ");
617 Print_Int (Int (Val));
618 end if;
619 end Print_Field;
620
621 ----------------
622 -- Print_Flag --
623 ----------------
624
625 procedure Print_Flag (F : Boolean) is
626 begin
627 if F then
628 Print_Str ("True");
629 else
630 Print_Str ("False");
631 end if;
632 end Print_Flag;
633
634 ----------------
635 -- Print_Init --
636 ----------------
637
638 procedure Print_Init is
639 begin
640 Printing_Descendants := True;
641 Write_Eol;
642
643 -- Allocate and clear serial number hash table. The size is 150% of
644 -- the maximum possible number of entries, so that the hash table
645 -- cannot get significantly overloaded.
646
647 Hash_Table_Len := (150 * (Num_Nodes + Num_Lists + Num_Elists)) / 100;
648 Hash_Table := new Hash_Table_Type (0 .. Hash_Table_Len - 1);
649
650 for J in Hash_Table'Range loop
651 Hash_Table (J).Serial := 0;
652 end loop;
653
654 end Print_Init;
655
656 ---------------
657 -- Print_Int --
658 ---------------
659
660 procedure Print_Int (I : Int) is
661 begin
662 if Phase = Printing then
663 Write_Int (I);
664 end if;
665 end Print_Int;
666
667 --------------------
668 -- Print_List_Ref --
669 --------------------
670
671 procedure Print_List_Ref (L : List_Id) is
672 begin
673 if Phase /= Printing then
674 return;
675 end if;
676
677 if No (L) then
678 Write_Str ("<no list>");
679
680 elsif Is_Empty_List (L) then
681 Write_Str ("<empty list> (List_Id=");
682 Write_Int (Int (L));
683 Write_Char (')');
684
685 else
686 Write_Str ("List");
687
688 if Printing_Descendants then
689 Write_Str (" #");
690 Write_Int (Serial_Number (Int (L)));
691 end if;
692
693 Write_Str (" (List_Id=");
694 Write_Int (Int (L));
695 Write_Char (')');
696 end if;
697 end Print_List_Ref;
698
699 ------------------------
700 -- Print_List_Subtree --
701 ------------------------
702
703 procedure Print_List_Subtree (L : List_Id) is
704 begin
705 Print_Init;
706
707 Next_Serial_Number := 1;
708 Phase := Marking;
709 Visit_List (L, "");
710
711 Next_Serial_Number := 1;
712 Phase := Printing;
713 Visit_List (L, "");
714
715 Print_Term;
716 end Print_List_Subtree;
717
718 ----------------
719 -- Print_Name --
720 ----------------
721
722 procedure Print_Name (N : Name_Id) is
723 begin
724 if Phase = Printing then
725 if N = No_Name then
726 Print_Str ("<No_Name>");
727
728 elsif N = Error_Name then
729 Print_Str ("<Error_Name>");
730
731 else
732 Get_Name_String (N);
733 Print_Char ('"');
734 Write_Name (N);
735 Print_Char ('"');
736 end if;
737 end if;
738 end Print_Name;
739
740 ----------------
741 -- Print_Node --
742 ----------------
743
744 procedure Print_Node
745 (N : Node_Id;
746 Prefix_Str : String;
747 Prefix_Char : Character)
748 is
749 F : Fchar;
750 P : Natural := Pchar_Pos (Nkind (N));
751
752 Field_To_Be_Printed : Boolean;
753 Prefix_Str_Char : String (Prefix_Str'First .. Prefix_Str'Last + 1);
754
755 Sfile : Source_File_Index;
756 Notes : Boolean;
757 Fmt : UI_Format;
758
759 begin
760 if Phase /= Printing then
761 return;
762 end if;
763
764 if Nkind (N) = N_Integer_Literal and then Print_In_Hex (N) then
765 Fmt := Hex;
766 else
767 Fmt := Auto;
768 end if;
769
770 Prefix_Str_Char (Prefix_Str'Range) := Prefix_Str;
771 Prefix_Str_Char (Prefix_Str'Last + 1) := Prefix_Char;
772
773 -- Print header line
774
775 Print_Str (Prefix_Str);
776 Print_Node_Ref (N);
777
778 Notes := False;
779
780 if Comes_From_Source (N) then
781 Notes := True;
782 Print_Str (" (source");
783 end if;
784
785 if Analyzed (N) then
786 if not Notes then
787 Notes := True;
788 Print_Str (" (");
789 else
790 Print_Str (",");
791 end if;
792
793 Print_Str ("analyzed");
794 end if;
795
796 if Error_Posted (N) then
797 if not Notes then
798 Notes := True;
799 Print_Str (" (");
800 else
801 Print_Str (",");
802 end if;
803
804 Print_Str ("posted");
805 end if;
806
807 if Notes then
808 Print_Char (')');
809 end if;
810
811 Print_Eol;
812
813 if Is_Rewrite_Substitution (N) then
814 Print_Str (Prefix_Str);
815 Print_Str (" Rewritten: original node = ");
816 Print_Node_Ref (Original_Node (N));
817 Print_Eol;
818 end if;
819
820 if N = Empty then
821 return;
822 end if;
823
824 if not Is_List_Member (N) then
825 Print_Str (Prefix_Str);
826 Print_Str (" Parent = ");
827 Print_Node_Ref (Parent (N));
828 Print_Eol;
829 end if;
830
831 -- Print Sloc field if it is set
832
833 if Sloc (N) /= No_Location then
834 Print_Str (Prefix_Str_Char);
835 Print_Str ("Sloc = ");
836
837 if Sloc (N) = Standard_Location then
838 Print_Str ("Standard_Location");
839
840 elsif Sloc (N) = Standard_ASCII_Location then
841 Print_Str ("Standard_ASCII_Location");
842
843 else
844 Sfile := Get_Source_File_Index (Sloc (N));
845 Print_Int (Int (Sloc (N)) - Int (Source_Text (Sfile)'First));
846 Write_Str (" ");
847 Write_Location (Sloc (N));
848 end if;
849
850 Print_Eol;
851 end if;
852
853 -- Print Chars field if present
854
855 if Nkind (N) in N_Has_Chars and then Chars (N) /= No_Name then
856 Print_Str (Prefix_Str_Char);
857 Print_Str ("Chars = ");
858 Print_Name (Chars (N));
859 Write_Str (" (Name_Id=");
860 Write_Int (Int (Chars (N)));
861 Write_Char (')');
862 Print_Eol;
863 end if;
864
865 -- Special field print operations for non-entity nodes
866
867 if Nkind (N) not in N_Entity then
868
869 -- Deal with Left_Opnd and Right_Opnd fields
870
871 if Nkind (N) in N_Op
872 or else Nkind (N) = N_And_Then
873 or else Nkind (N) = N_In
874 or else Nkind (N) = N_Not_In
875 or else Nkind (N) = N_Or_Else
876 then
877 -- Print Left_Opnd if present
878
879 if Nkind (N) not in N_Unary_Op then
880 Print_Str (Prefix_Str_Char);
881 Print_Str ("Left_Opnd = ");
882 Print_Node_Ref (Left_Opnd (N));
883 Print_Eol;
884 end if;
885
886 -- Print Right_Opnd
887
888 Print_Str (Prefix_Str_Char);
889 Print_Str ("Right_Opnd = ");
890 Print_Node_Ref (Right_Opnd (N));
891 Print_Eol;
892 end if;
893
894 -- Print Entity field if operator (other cases of Entity
895 -- are in the table, so are handled in the normal circuit)
896
897 if Nkind (N) in N_Op and then Present (Entity (N)) then
898 Print_Str (Prefix_Str_Char);
899 Print_Str ("Entity = ");
900 Print_Node_Ref (Entity (N));
901 Print_Eol;
902 end if;
903
904 -- Print special fields if we have a subexpression
905
906 if Nkind (N) in N_Subexpr then
907
908 if Assignment_OK (N) then
909 Print_Str (Prefix_Str_Char);
910 Print_Str ("Assignment_OK = True");
911 Print_Eol;
912 end if;
913
914 if Do_Range_Check (N) then
915 Print_Str (Prefix_Str_Char);
916 Print_Str ("Do_Range_Check = True");
917 Print_Eol;
918 end if;
919
920 if Has_Dynamic_Length_Check (N) then
921 Print_Str (Prefix_Str_Char);
922 Print_Str ("Has_Dynamic_Length_Check = True");
923 Print_Eol;
924 end if;
925
926 if Has_Dynamic_Range_Check (N) then
927 Print_Str (Prefix_Str_Char);
928 Print_Str ("Has_Dynamic_Range_Check = True");
929 Print_Eol;
930 end if;
931
932 if Is_Controlling_Actual (N) then
933 Print_Str (Prefix_Str_Char);
934 Print_Str ("Is_Controlling_Actual = True");
935 Print_Eol;
936 end if;
937
938 if Is_Overloaded (N) then
939 Print_Str (Prefix_Str_Char);
940 Print_Str ("Is_Overloaded = True");
941 Print_Eol;
942 end if;
943
944 if Is_Static_Expression (N) then
945 Print_Str (Prefix_Str_Char);
946 Print_Str ("Is_Static_Expression = True");
947 Print_Eol;
948 end if;
949
950 if Must_Not_Freeze (N) then
951 Print_Str (Prefix_Str_Char);
952 Print_Str ("Must_Not_Freeze = True");
953 Print_Eol;
954 end if;
955
956 if Paren_Count (N) /= 0 then
957 Print_Str (Prefix_Str_Char);
958 Print_Str ("Paren_Count = ");
959 Print_Int (Int (Paren_Count (N)));
960 Print_Eol;
961 end if;
962
963 if Raises_Constraint_Error (N) then
964 Print_Str (Prefix_Str_Char);
965 Print_Str ("Raise_Constraint_Error = True");
966 Print_Eol;
967 end if;
968
969 end if;
970
971 -- Print Do_Overflow_Check field if present
972
973 if Nkind (N) in N_Op and then Do_Overflow_Check (N) then
974 Print_Str (Prefix_Str_Char);
975 Print_Str ("Do_Overflow_Check = True");
976 Print_Eol;
977 end if;
978
979 -- Print Etype field if present (printing of this field for entities
980 -- is handled by the Print_Entity_Info procedure).
981
982 if Nkind (N) in N_Has_Etype
983 and then Present (Etype (N))
984 then
985 Print_Str (Prefix_Str_Char);
986 Print_Str ("Etype = ");
987 Print_Node_Ref (Etype (N));
988 Print_Eol;
989 end if;
990 end if;
991
992 -- Loop to print fields included in Pchars array
993
994 while P < Pchar_Pos (Node_Kind'Succ (Nkind (N))) loop
995 F := Pchars (P);
996 P := P + 1;
997
998 -- Check for case of False flag, which we never print, or
999 -- an Empty field, which is also never printed
1000
1001 case F is
1002 when F_Field1 =>
1003 Field_To_Be_Printed := Field1 (N) /= Union_Id (Empty);
1004
1005 when F_Field2 =>
1006 Field_To_Be_Printed := Field2 (N) /= Union_Id (Empty);
1007
1008 when F_Field3 =>
1009 Field_To_Be_Printed := Field3 (N) /= Union_Id (Empty);
1010
1011 when F_Field4 =>
1012 Field_To_Be_Printed := Field4 (N) /= Union_Id (Empty);
1013
1014 when F_Field5 =>
1015 Field_To_Be_Printed := Field5 (N) /= Union_Id (Empty);
1016
1017 when F_Flag4 => Field_To_Be_Printed := Flag4 (N);
1018 when F_Flag5 => Field_To_Be_Printed := Flag5 (N);
1019 when F_Flag6 => Field_To_Be_Printed := Flag6 (N);
1020 when F_Flag7 => Field_To_Be_Printed := Flag7 (N);
1021 when F_Flag8 => Field_To_Be_Printed := Flag8 (N);
1022 when F_Flag9 => Field_To_Be_Printed := Flag9 (N);
1023 when F_Flag10 => Field_To_Be_Printed := Flag10 (N);
1024 when F_Flag11 => Field_To_Be_Printed := Flag11 (N);
1025 when F_Flag12 => Field_To_Be_Printed := Flag12 (N);
1026 when F_Flag13 => Field_To_Be_Printed := Flag13 (N);
1027 when F_Flag14 => Field_To_Be_Printed := Flag14 (N);
1028 when F_Flag15 => Field_To_Be_Printed := Flag15 (N);
1029 when F_Flag16 => Field_To_Be_Printed := Flag16 (N);
1030 when F_Flag17 => Field_To_Be_Printed := Flag17 (N);
1031 when F_Flag18 => Field_To_Be_Printed := Flag18 (N);
1032
1033 -- Flag1,2,3 are no longer used
1034
1035 when F_Flag1 => raise Program_Error;
1036 when F_Flag2 => raise Program_Error;
1037 when F_Flag3 => raise Program_Error;
1038
1039 end case;
1040
1041 -- Print field if it is to be printed
1042
1043 if Field_To_Be_Printed then
1044 Print_Str (Prefix_Str_Char);
1045
1046 while P < Pchar_Pos (Node_Kind'Succ (Nkind (N)))
1047 and then Pchars (P) not in Fchar
1048 loop
1049 Print_Char (Pchars (P));
1050 P := P + 1;
1051 end loop;
1052
1053 Print_Str (" = ");
1054
1055 case F is
1056 when F_Field1 => Print_Field (Field1 (N), Fmt);
1057 when F_Field2 => Print_Field (Field2 (N), Fmt);
1058 when F_Field3 => Print_Field (Field3 (N), Fmt);
1059 when F_Field4 => Print_Field (Field4 (N), Fmt);
1060
1061 -- Special case End_Span = Uint5
1062
1063 when F_Field5 =>
1064 if Nkind (N) = N_Case_Statement
1065 or else Nkind (N) = N_If_Statement
1066 then
1067 Print_End_Span (N);
1068 else
1069 Print_Field (Field5 (N), Fmt);
1070 end if;
1071
1072 when F_Flag4 => Print_Flag (Flag4 (N));
1073 when F_Flag5 => Print_Flag (Flag5 (N));
1074 when F_Flag6 => Print_Flag (Flag6 (N));
1075 when F_Flag7 => Print_Flag (Flag7 (N));
1076 when F_Flag8 => Print_Flag (Flag8 (N));
1077 when F_Flag9 => Print_Flag (Flag9 (N));
1078 when F_Flag10 => Print_Flag (Flag10 (N));
1079 when F_Flag11 => Print_Flag (Flag11 (N));
1080 when F_Flag12 => Print_Flag (Flag12 (N));
1081 when F_Flag13 => Print_Flag (Flag13 (N));
1082 when F_Flag14 => Print_Flag (Flag14 (N));
1083 when F_Flag15 => Print_Flag (Flag15 (N));
1084 when F_Flag16 => Print_Flag (Flag16 (N));
1085 when F_Flag17 => Print_Flag (Flag17 (N));
1086 when F_Flag18 => Print_Flag (Flag18 (N));
1087
1088 -- Flag1,2,3 are no longer used
1089
1090 when F_Flag1 => raise Program_Error;
1091 when F_Flag2 => raise Program_Error;
1092 when F_Flag3 => raise Program_Error;
1093 end case;
1094
1095 Print_Eol;
1096
1097 -- Field is not to be printed (False flag field)
1098
1099 else
1100 while P < Pchar_Pos (Node_Kind'Succ (Nkind (N)))
1101 and then Pchars (P) not in Fchar
1102 loop
1103 P := P + 1;
1104 end loop;
1105 end if;
1106
1107 end loop;
1108
1109 -- Print entity information for entities
1110
1111 if Nkind (N) in N_Entity then
1112 Print_Entity_Info (N, Prefix_Str_Char);
1113 end if;
1114
1115 end Print_Node;
1116
1117 ---------------------
1118 -- Print_Node_Kind --
1119 ---------------------
1120
1121 procedure Print_Node_Kind (N : Node_Id) is
1122 Ucase : Boolean;
1123 S : constant String := Node_Kind'Image (Nkind (N));
1124
1125 begin
1126 if Phase = Printing then
1127 Ucase := True;
1128
1129 -- Note: the call to Fold_Upper in this loop is to get past the GNAT
1130 -- bug of 'Image returning lower case instead of upper case.
1131
1132 for J in S'Range loop
1133 if Ucase then
1134 Write_Char (Fold_Upper (S (J)));
1135 else
1136 Write_Char (Fold_Lower (S (J)));
1137 end if;
1138
1139 Ucase := (S (J) = '_');
1140 end loop;
1141 end if;
1142 end Print_Node_Kind;
1143
1144 --------------------
1145 -- Print_Node_Ref --
1146 --------------------
1147
1148 procedure Print_Node_Ref (N : Node_Id) is
1149 S : Nat;
1150
1151 begin
1152 if Phase /= Printing then
1153 return;
1154 end if;
1155
1156 if N = Empty then
1157 Write_Str ("<empty>");
1158
1159 elsif N = Error then
1160 Write_Str ("<error>");
1161
1162 else
1163 if Printing_Descendants then
1164 S := Serial_Number (Int (N));
1165
1166 if S /= 0 then
1167 Write_Str ("Node");
1168 Write_Str (" #");
1169 Write_Int (S);
1170 Write_Char (' ');
1171 end if;
1172 end if;
1173
1174 Print_Node_Kind (N);
1175
1176 if Nkind (N) in N_Has_Chars then
1177 Write_Char (' ');
1178 Print_Name (Chars (N));
1179 end if;
1180
1181 if Nkind (N) in N_Entity then
1182 Write_Str (" (Entity_Id=");
1183 else
1184 Write_Str (" (Node_Id=");
1185 end if;
1186
1187 Write_Int (Int (N));
1188
1189 if Sloc (N) <= Standard_Location then
1190 Write_Char ('s');
1191 end if;
1192
1193 Write_Char (')');
1194
1195 end if;
1196 end Print_Node_Ref;
1197
1198 ------------------------
1199 -- Print_Node_Subtree --
1200 ------------------------
1201
1202 procedure Print_Node_Subtree (N : Node_Id) is
1203 begin
1204 Print_Init;
1205
1206 Next_Serial_Number := 1;
1207 Phase := Marking;
1208 Visit_Node (N, "", ' ');
1209
1210 Next_Serial_Number := 1;
1211 Phase := Printing;
1212 Visit_Node (N, "", ' ');
1213
1214 Print_Term;
1215 end Print_Node_Subtree;
1216
1217 ---------------
1218 -- Print_Str --
1219 ---------------
1220
1221 procedure Print_Str (S : String) is
1222 begin
1223 if Phase = Printing then
1224 Write_Str (S);
1225 end if;
1226 end Print_Str;
1227
1228 --------------------------
1229 -- Print_Str_Mixed_Case --
1230 --------------------------
1231
1232 procedure Print_Str_Mixed_Case (S : String) is
1233 Ucase : Boolean;
1234
1235 begin
1236 if Phase = Printing then
1237 Ucase := True;
1238
1239 for J in S'Range loop
1240 if Ucase then
1241 Write_Char (S (J));
1242 else
1243 Write_Char (Fold_Lower (S (J)));
1244 end if;
1245
1246 Ucase := (S (J) = '_');
1247 end loop;
1248 end if;
1249 end Print_Str_Mixed_Case;
1250
1251 ----------------
1252 -- Print_Term --
1253 ----------------
1254
1255 procedure Print_Term is
1256 procedure Free is new Unchecked_Deallocation
1257 (Hash_Table_Type, Access_Hash_Table_Type);
1258
1259 begin
1260 Free (Hash_Table);
1261 end Print_Term;
1262
1263 ---------------------
1264 -- Print_Tree_Elist --
1265 ---------------------
1266
1267 procedure Print_Tree_Elist (E : Elist_Id) is
1268 M : Elmt_Id;
1269
1270 begin
1271 Printing_Descendants := False;
1272 Phase := Printing;
1273
1274 Print_Elist_Ref (E);
1275 Print_Eol;
1276
1277 M := First_Elmt (E);
1278
1279 if No (M) then
1280 Print_Str ("<empty element list>");
1281 Print_Eol;
1282
1283 else
1284 loop
1285 Print_Char ('|');
1286 Print_Eol;
1287 exit when No (Next_Elmt (M));
1288 Print_Node (Node (M), "", '|');
1289 Next_Elmt (M);
1290 end loop;
1291
1292 Print_Node (Node (M), "", ' ');
1293 Print_Eol;
1294 end if;
1295 end Print_Tree_Elist;
1296
1297 ---------------------
1298 -- Print_Tree_List --
1299 ---------------------
1300
1301 procedure Print_Tree_List (L : List_Id) is
1302 N : Node_Id;
1303
1304 begin
1305 Printing_Descendants := False;
1306 Phase := Printing;
1307
1308 Print_List_Ref (L);
1309 Print_Str (" List_Id=");
1310 Print_Int (Int (L));
1311 Print_Eol;
1312
1313 N := First (L);
1314
1315 if N = Empty then
1316 Print_Str ("<empty node list>");
1317 Print_Eol;
1318
1319 else
1320 loop
1321 Print_Char ('|');
1322 Print_Eol;
1323 exit when Next (N) = Empty;
1324 Print_Node (N, "", '|');
1325 Next (N);
1326 end loop;
1327
1328 Print_Node (N, "", ' ');
1329 Print_Eol;
1330 end if;
1331 end Print_Tree_List;
1332
1333 ---------------------
1334 -- Print_Tree_Node --
1335 ---------------------
1336
1337 procedure Print_Tree_Node (N : Node_Id; Label : String := "") is
1338 begin
1339 Printing_Descendants := False;
1340 Phase := Printing;
1341 Print_Node (N, Label, ' ');
1342 end Print_Tree_Node;
1343
1344 --------
1345 -- PT --
1346 --------
1347
1348 procedure PT (N : Node_Id) is
1349 begin
1350 Print_Node_Subtree (N);
1351 end PT;
1352
1353 -------------------
1354 -- Serial_Number --
1355 -------------------
1356
1357 -- The hashing algorithm is to use the remainder of the ID value divided
1358 -- by the hash table length as the starting point in the table, and then
1359 -- handle collisions by serial searching wrapping at the end of the table.
1360
1361 Hash_Slot : Nat;
1362 -- Set by an unsuccessful call to Serial_Number (one which returns zero)
1363 -- to save the slot that should be used if Set_Serial_Number is called.
1364
1365 function Serial_Number (Id : Int) return Nat is
1366 H : Int := Id mod Hash_Table_Len;
1367
1368 begin
1369 while Hash_Table (H).Serial /= 0 loop
1370
1371 if Id = Hash_Table (H).Id then
1372 return Hash_Table (H).Serial;
1373 end if;
1374
1375 H := H + 1;
1376
1377 if H > Hash_Table'Last then
1378 H := 0;
1379 end if;
1380 end loop;
1381
1382 -- Entry was not found, save slot number for possible subsequent call
1383 -- to Set_Serial_Number, and unconditionally save the Id in this slot
1384 -- in case of such a call (the Id field is never read if the serial
1385 -- number of the slot is zero, so this is harmless in the case where
1386 -- Set_Serial_Number is not subsequently called).
1387
1388 Hash_Slot := H;
1389 Hash_Table (H).Id := Id;
1390 return 0;
1391
1392 end Serial_Number;
1393
1394 -----------------------
1395 -- Set_Serial_Number --
1396 -----------------------
1397
1398 procedure Set_Serial_Number is
1399 begin
1400 Hash_Table (Hash_Slot).Serial := Next_Serial_Number;
1401 Next_Serial_Number := Next_Serial_Number + 1;
1402 end Set_Serial_Number;
1403
1404 ---------------
1405 -- Tree_Dump --
1406 ---------------
1407
1408 procedure Tree_Dump is
1409 procedure Underline;
1410 -- Put underline under string we just printed
1411
1412 procedure Underline is
1413 Col : constant Int := Column;
1414
1415 begin
1416 Write_Eol;
1417
1418 while Col > Column loop
1419 Write_Char ('-');
1420 end loop;
1421
1422 Write_Eol;
1423 end Underline;
1424
1425 -- Start of processing for Tree_Dump. Note that we turn off the tree dump
1426 -- flags immediately, before starting the dump. This avoids generating two
1427 -- copies of the dump if an abort occurs after printing the dump, and more
1428 -- importantly, avoids an infinite loop if an abort occurs during the dump.
1429
1430 -- Note: unlike in the source print case (in Sprint), we do not output
1431 -- separate trees for each unit. Instead the -df debug switch causes the
1432 -- tree that is output from the main unit to trace references into other
1433 -- units (normally such references are not traced). Since all other units
1434 -- are linked to the main unit by at least one reference, this causes all
1435 -- tree nodes to be included in the output tree.
1436
1437 begin
1438 if Debug_Flag_Y then
1439 Debug_Flag_Y := False;
1440 Write_Eol;
1441 Write_Str ("Tree created for Standard (spec) ");
1442 Underline;
1443 Print_Node_Subtree (Standard_Package_Node);
1444 Write_Eol;
1445 end if;
1446
1447 if Debug_Flag_T then
1448 Debug_Flag_T := False;
1449
1450 Write_Eol;
1451 Write_Str ("Tree created for ");
1452 Write_Unit_Name (Unit_Name (Main_Unit));
1453 Underline;
1454 Print_Node_Subtree (Cunit (Main_Unit));
1455 Write_Eol;
1456 end if;
1457
1458 end Tree_Dump;
1459
1460 -----------------
1461 -- Visit_Elist --
1462 -----------------
1463
1464 procedure Visit_Elist (E : Elist_Id; Prefix_Str : String) is
1465 M : Elmt_Id;
1466 N : Node_Id;
1467 S : constant Nat := Serial_Number (Int (E));
1468
1469 begin
1470 -- In marking phase, return if already marked, otherwise set next
1471 -- serial number in hash table for later reference.
1472
1473 if Phase = Marking then
1474 if S /= 0 then
1475 return; -- already visited
1476 else
1477 Set_Serial_Number;
1478 end if;
1479
1480 -- In printing phase, if already printed, then return, otherwise we
1481 -- are printing the next item, so increment the serial number.
1482
1483 else
1484 if S < Next_Serial_Number then
1485 return; -- already printed
1486 else
1487 Next_Serial_Number := Next_Serial_Number + 1;
1488 end if;
1489 end if;
1490
1491 -- Now process the list (Print calls have no effect in marking phase)
1492
1493 Print_Str (Prefix_Str);
1494 Print_Elist_Ref (E);
1495 Print_Eol;
1496
1497 if Is_Empty_Elmt_List (E) then
1498 Print_Str (Prefix_Str);
1499 Print_Str ("(Empty element list)");
1500 Print_Eol;
1501 Print_Eol;
1502
1503 else
1504 if Phase = Printing then
1505 M := First_Elmt (E);
1506 while Present (M) loop
1507 N := Node (M);
1508 Print_Str (Prefix_Str);
1509 Print_Str (" ");
1510 Print_Node_Ref (N);
1511 Print_Eol;
1512 Next_Elmt (M);
1513 end loop;
1514
1515 Print_Str (Prefix_Str);
1516 Print_Eol;
1517 end if;
1518
1519 M := First_Elmt (E);
1520 while Present (M) loop
1521 Visit_Node (Node (M), Prefix_Str, ' ');
1522 Next_Elmt (M);
1523 end loop;
1524 end if;
1525 end Visit_Elist;
1526
1527 ----------------
1528 -- Visit_List --
1529 ----------------
1530
1531 procedure Visit_List (L : List_Id; Prefix_Str : String) is
1532 N : Node_Id;
1533 S : constant Nat := Serial_Number (Int (L));
1534
1535 begin
1536 -- In marking phase, return if already marked, otherwise set next
1537 -- serial number in hash table for later reference.
1538
1539 if Phase = Marking then
1540 if S /= 0 then
1541 return;
1542 else
1543 Set_Serial_Number;
1544 end if;
1545
1546 -- In printing phase, if already printed, then return, otherwise we
1547 -- are printing the next item, so increment the serial number.
1548
1549 else
1550 if S < Next_Serial_Number then
1551 return; -- already printed
1552 else
1553 Next_Serial_Number := Next_Serial_Number + 1;
1554 end if;
1555 end if;
1556
1557 -- Now process the list (Print calls have no effect in marking phase)
1558
1559 Print_Str (Prefix_Str);
1560 Print_List_Ref (L);
1561 Print_Eol;
1562
1563 Print_Str (Prefix_Str);
1564 Print_Str ("|Parent = ");
1565 Print_Node_Ref (Parent (L));
1566 Print_Eol;
1567
1568 N := First (L);
1569
1570 if N = Empty then
1571 Print_Str (Prefix_Str);
1572 Print_Str ("(Empty list)");
1573 Print_Eol;
1574 Print_Eol;
1575
1576 else
1577 Print_Str (Prefix_Str);
1578 Print_Char ('|');
1579 Print_Eol;
1580
1581 while Next (N) /= Empty loop
1582 Visit_Node (N, Prefix_Str, '|');
1583 Next (N);
1584 end loop;
1585 end if;
1586
1587 Visit_Node (N, Prefix_Str, ' ');
1588 end Visit_List;
1589
1590 ----------------
1591 -- Visit_Node --
1592 ----------------
1593
1594 procedure Visit_Node
1595 (N : Node_Id;
1596 Prefix_Str : String;
1597 Prefix_Char : Character)
1598 is
1599 New_Prefix : String (Prefix_Str'First .. Prefix_Str'Last + 2);
1600 -- Prefix string for printing referenced fields
1601
1602 procedure Visit_Descendent
1603 (D : Union_Id;
1604 No_Indent : Boolean := False);
1605 -- This procedure tests the given value of one of the Fields referenced
1606 -- by the current node to determine whether to visit it recursively.
1607 -- Normally No_Indent is false, which means tha the visited node will
1608 -- be indented using New_Prefix. If No_Indent is set to True, then
1609 -- this indentation is skipped, and Prefix_Str is used for the call
1610 -- to print the descendent. No_Indent is effective only if the
1611 -- referenced descendent is a node.
1612
1613 ----------------------
1614 -- Visit_Descendent --
1615 ----------------------
1616
1617 procedure Visit_Descendent
1618 (D : Union_Id;
1619 No_Indent : Boolean := False)
1620 is
1621 begin
1622 -- Case of descendent is a node
1623
1624 if D in Node_Range then
1625
1626 -- Don't bother about Empty or Error descendents
1627
1628 if D <= Union_Id (Empty_Or_Error) then
1629 return;
1630 end if;
1631
1632 declare
1633 Nod : constant Node_Or_Entity_Id := Node_Or_Entity_Id (D);
1634
1635 begin
1636 -- Descendents in one of the standardly compiled internal
1637 -- packages are normally ignored, unless the parent is also
1638 -- in such a package (happens when Standard itself is output)
1639 -- or if the -df switch is set which causes all links to be
1640 -- followed, even into package standard.
1641
1642 if Sloc (Nod) <= Standard_Location then
1643 if Sloc (N) > Standard_Location
1644 and then not Debug_Flag_F
1645 then
1646 return;
1647 end if;
1648
1649 -- Don't bother about a descendent in a different unit than
1650 -- the node we came from unless the -df switch is set. Note
1651 -- that we know at this point that Sloc (D) > Standard_Location
1652
1653 -- Note: the tests for No_Location here just make sure that we
1654 -- don't blow up on a node which is missing an Sloc value. This
1655 -- should not normally happen.
1656
1657 else
1658 if (Sloc (N) <= Standard_Location
1659 or else Sloc (N) = No_Location
1660 or else Sloc (Nod) = No_Location
1661 or else not In_Same_Source_Unit (Nod, N))
1662 and then not Debug_Flag_F
1663 then
1664 return;
1665 end if;
1666 end if;
1667
1668 -- Don't bother visiting a source node that has a parent which
1669 -- is not the node we came from. We prefer to trace such nodes
1670 -- from their real parents. This causes the tree to be printed
1671 -- in a more coherent order, e.g. a defining identifier listed
1672 -- next to its corresponding declaration, instead of next to
1673 -- some semantic reference.
1674
1675 -- This test is skipped for nodes in standard packages unless
1676 -- the -dy option is set (which outputs the tree for standard)
1677
1678 -- Also, always follow pointers to Is_Itype entities,
1679 -- since we want to list these when they are first referenced.
1680
1681 if Parent (Nod) /= Empty
1682 and then Comes_From_Source (Nod)
1683 and then Parent (Nod) /= N
1684 and then (Sloc (N) > Standard_Location or else Debug_Flag_Y)
1685 then
1686 return;
1687 end if;
1688
1689 -- If we successfully fall through all the above tests (which
1690 -- execute a return if the node is not to be visited), we can
1691 -- go ahead and visit the node!
1692
1693 if No_Indent then
1694 Visit_Node (Nod, Prefix_Str, Prefix_Char);
1695 else
1696 Visit_Node (Nod, New_Prefix, ' ');
1697 end if;
1698 end;
1699
1700 -- Case of descendent is a list
1701
1702 elsif D in List_Range then
1703
1704 -- Don't bother with a missing list, empty list or error list
1705
1706 if D = Union_Id (No_List)
1707 or else D = Union_Id (Error_List)
1708 or else Is_Empty_List (List_Id (D))
1709 then
1710 return;
1711
1712 -- Otherwise we can visit the list. Note that we don't bother
1713 -- to do the parent test that we did for the node case, because
1714 -- it just does not happen that lists are referenced more than
1715 -- one place in the tree. We aren't counting on this being the
1716 -- case to generate valid output, it is just that we don't need
1717 -- in practice to worry about listing the list at a place that
1718 -- is inconvenient.
1719
1720 else
1721 Visit_List (List_Id (D), New_Prefix);
1722 end if;
1723
1724 -- Case of descendent is an element list
1725
1726 elsif D in Elist_Range then
1727
1728 -- Don't bother with a missing list, or an empty list
1729
1730 if D = Union_Id (No_Elist)
1731 or else Is_Empty_Elmt_List (Elist_Id (D))
1732 then
1733 return;
1734
1735 -- Otherwise, visit the referenced element list
1736
1737 else
1738 Visit_Elist (Elist_Id (D), New_Prefix);
1739 end if;
1740
1741 -- For all other kinds of descendents (strings, names, uints etc),
1742 -- there is nothing to visit (the contents of the field will be
1743 -- printed when we print the containing node, but what concerns
1744 -- us now is looking for descendents in the tree.
1745
1746 else
1747 null;
1748 end if;
1749 end Visit_Descendent;
1750
1751 -- Start of processing for Visit_Node
1752
1753 begin
1754 if N = Empty then
1755 return;
1756 end if;
1757
1758 -- Set fatal error node in case we get a blow up during the trace
1759
1760 Current_Error_Node := N;
1761
1762 New_Prefix (Prefix_Str'Range) := Prefix_Str;
1763 New_Prefix (Prefix_Str'Last + 1) := Prefix_Char;
1764 New_Prefix (Prefix_Str'Last + 2) := ' ';
1765
1766 -- In the marking phase, all we do is to set the serial number
1767
1768 if Phase = Marking then
1769 if Serial_Number (Int (N)) /= 0 then
1770 return; -- already visited
1771 else
1772 Set_Serial_Number;
1773 end if;
1774
1775 -- In the printing phase, we print the node
1776
1777 else
1778 if Serial_Number (Int (N)) < Next_Serial_Number then
1779
1780 -- Here we have already visited the node, but if it is in
1781 -- a list, we still want to print the reference, so that
1782 -- it is clear that it belongs to the list.
1783
1784 if Is_List_Member (N) then
1785 Print_Str (Prefix_Str);
1786 Print_Node_Ref (N);
1787 Print_Eol;
1788 Print_Str (Prefix_Str);
1789 Print_Char (Prefix_Char);
1790 Print_Str ("(already output)");
1791 Print_Eol;
1792 Print_Str (Prefix_Str);
1793 Print_Char (Prefix_Char);
1794 Print_Eol;
1795 end if;
1796
1797 return;
1798
1799 else
1800 Print_Node (N, Prefix_Str, Prefix_Char);
1801 Print_Str (Prefix_Str);
1802 Print_Char (Prefix_Char);
1803 Print_Eol;
1804 Next_Serial_Number := Next_Serial_Number + 1;
1805 end if;
1806 end if;
1807
1808 -- Visit all descendents of this node
1809
1810 if Nkind (N) not in N_Entity then
1811 Visit_Descendent (Field1 (N));
1812 Visit_Descendent (Field2 (N));
1813 Visit_Descendent (Field3 (N));
1814 Visit_Descendent (Field4 (N));
1815 Visit_Descendent (Field5 (N));
1816
1817 -- Entity case
1818
1819 else
1820 Visit_Descendent (Field1 (N));
1821 Visit_Descendent (Field3 (N));
1822 Visit_Descendent (Field4 (N));
1823 Visit_Descendent (Field5 (N));
1824 Visit_Descendent (Field6 (N));
1825 Visit_Descendent (Field7 (N));
1826 Visit_Descendent (Field8 (N));
1827 Visit_Descendent (Field9 (N));
1828 Visit_Descendent (Field10 (N));
1829 Visit_Descendent (Field11 (N));
1830 Visit_Descendent (Field12 (N));
1831 Visit_Descendent (Field13 (N));
1832 Visit_Descendent (Field14 (N));
1833 Visit_Descendent (Field15 (N));
1834 Visit_Descendent (Field16 (N));
1835 Visit_Descendent (Field17 (N));
1836 Visit_Descendent (Field18 (N));
1837 Visit_Descendent (Field19 (N));
1838 Visit_Descendent (Field20 (N));
1839 Visit_Descendent (Field21 (N));
1840 Visit_Descendent (Field22 (N));
1841 Visit_Descendent (Field23 (N));
1842
1843 -- You may be wondering why we omitted Field2 above. The answer
1844 -- is that this is the Next_Entity field, and we want to treat
1845 -- it rather specially. Why? Because a Next_Entity link does not
1846 -- correspond to a level deeper in the tree, and we do not want
1847 -- the tree to march off to the right of the page due to bogus
1848 -- indentations coming from this effect.
1849
1850 -- To prevent this, what we do is to control references via
1851 -- Next_Entity only from the first entity on a given scope
1852 -- chain, and we keep them all at the same level. Of course
1853 -- if an entity has already been referenced it is not printed.
1854
1855 if Present (Next_Entity (N))
1856 and then Present (Scope (N))
1857 and then First_Entity (Scope (N)) = N
1858 then
1859 declare
1860 Nod : Node_Id;
1861
1862 begin
1863 Nod := N;
1864 while Present (Nod) loop
1865 Visit_Descendent (Union_Id (Next_Entity (Nod)));
1866 Nod := Next_Entity (Nod);
1867 end loop;
1868 end;
1869 end if;
1870 end if;
1871 end Visit_Node;
1872
1873 end Treepr;
Mirror of the offical gcc git repository hosted at gcc.gnu.org