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