1 /* Tree-dumping functionality for intermediate representation.
2 Copyright (C) 1999, 2000, 2002, 2003, 2004, 2005
3 Free Software Foundation, Inc.
4 Written by Mark Mitchell <mark@codesourcery.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
25 #include "coretypes.h"
28 #include "splay-tree.h"
29 #include "diagnostic.h"
31 #include "tree-dump.h"
32 #include "tree-pass.h"
33 #include "langhooks.h"
34 #include "tree-iterator.h"
36 static unsigned int queue (dump_info_p
, tree
, int);
37 static void dump_index (dump_info_p
, unsigned int);
38 static void dequeue_and_dump (dump_info_p
);
39 static void dump_new_line (dump_info_p
);
40 static void dump_maybe_newline (dump_info_p
);
41 static int dump_enable_all (int, int);
43 /* Add T to the end of the queue of nodes to dump. Returns the index
47 queue (dump_info_p di
, tree t
, int flags
)
53 /* Assign the next available index to T. */
56 /* Obtain a new queue node. */
60 di
->free_list
= dq
->next
;
63 dq
= xmalloc (sizeof (struct dump_queue
));
65 /* Create a new entry in the splay-tree. */
66 dni
= xmalloc (sizeof (struct dump_node_info
));
68 dni
->binfo_p
= ((flags
& DUMP_BINFO
) != 0);
69 dq
->node
= splay_tree_insert (di
->nodes
, (splay_tree_key
) t
,
70 (splay_tree_value
) dni
);
72 /* Add it to the end of the queue. */
77 di
->queue_end
->next
= dq
;
80 /* Return the index. */
85 dump_index (dump_info_p di
, unsigned int index
)
87 fprintf (di
->stream
, "@%-6u ", index
);
91 /* If T has not already been output, queue it for subsequent output.
92 FIELD is a string to print before printing the index. Then, the
93 index of T is printed. */
96 queue_and_dump_index (dump_info_p di
, const char *field
, tree t
, int flags
)
101 /* If there's no node, just return. This makes for fewer checks in
106 /* See if we've already queued or dumped this node. */
107 n
= splay_tree_lookup (di
->nodes
, (splay_tree_key
) t
);
109 index
= ((dump_node_info_p
) n
->value
)->index
;
111 /* If we haven't, add it to the queue. */
112 index
= queue (di
, t
, flags
);
114 /* Print the index of the node. */
115 dump_maybe_newline (di
);
116 fprintf (di
->stream
, "%-4s: ", field
);
118 dump_index (di
, index
);
121 /* Dump the type of T. */
124 queue_and_dump_type (dump_info_p di
, tree t
)
126 queue_and_dump_index (di
, "type", TREE_TYPE (t
), DUMP_NONE
);
129 /* Dump column control */
130 #define SOL_COLUMN 25 /* Start of line column. */
131 #define EOL_COLUMN 55 /* End of line column. */
132 #define COLUMN_ALIGNMENT 15 /* Alignment. */
134 /* Insert a new line in the dump output, and indent to an appropriate
135 place to start printing more fields. */
138 dump_new_line (dump_info_p di
)
140 fprintf (di
->stream
, "\n%*s", SOL_COLUMN
, "");
141 di
->column
= SOL_COLUMN
;
144 /* If necessary, insert a new line. */
147 dump_maybe_newline (dump_info_p di
)
151 /* See if we need a new line. */
152 if (di
->column
> EOL_COLUMN
)
154 /* See if we need any padding. */
155 else if ((extra
= (di
->column
- SOL_COLUMN
) % COLUMN_ALIGNMENT
) != 0)
157 fprintf (di
->stream
, "%*s", COLUMN_ALIGNMENT
- extra
, "");
158 di
->column
+= COLUMN_ALIGNMENT
- extra
;
162 /* Dump pointer PTR using FIELD to identify it. */
165 dump_pointer (dump_info_p di
, const char *field
, void *ptr
)
167 dump_maybe_newline (di
);
168 fprintf (di
->stream
, "%-4s: %-8lx ", field
, (long) ptr
);
172 /* Dump integer I using FIELD to identify it. */
175 dump_int (dump_info_p di
, const char *field
, int i
)
177 dump_maybe_newline (di
);
178 fprintf (di
->stream
, "%-4s: %-7d ", field
, i
);
182 /* Dump the string S. */
185 dump_string (dump_info_p di
, const char *string
)
187 dump_maybe_newline (di
);
188 fprintf (di
->stream
, "%-13s ", string
);
189 if (strlen (string
) > 13)
190 di
->column
+= strlen (string
) + 1;
195 /* Dump the string field S. */
198 dump_string_field (dump_info_p di
, const char *field
, const char *string
)
200 dump_maybe_newline (di
);
201 fprintf (di
->stream
, "%-4s: %-7s ", field
, string
);
202 if (strlen (string
) > 7)
203 di
->column
+= 6 + strlen (string
) + 1;
208 /* Dump the next node in the queue. */
211 dequeue_and_dump (dump_info_p di
)
215 dump_node_info_p dni
;
219 enum tree_code_class code_class
;
220 const char* code_name
;
222 /* Get the next node from the queue. */
226 dni
= (dump_node_info_p
) stn
->value
;
229 /* Remove the node from the queue, and put it on the free list. */
230 di
->queue
= dq
->next
;
233 dq
->next
= di
->free_list
;
236 /* Print the node index. */
237 dump_index (di
, index
);
238 /* And the type of node this is. */
242 code_name
= tree_code_name
[(int) TREE_CODE (t
)];
243 fprintf (di
->stream
, "%-16s ", code_name
);
246 /* Figure out what kind of node this is. */
247 code
= TREE_CODE (t
);
248 code_class
= TREE_CODE_CLASS (code
);
250 /* Although BINFOs are TREE_VECs, we dump them specially so as to be
256 VEC(tree
,gc
) *accesses
= BINFO_BASE_ACCESSES (t
);
258 dump_child ("type", BINFO_TYPE (t
));
260 if (BINFO_VIRTUAL_P (t
))
261 dump_string_field (di
, "spec", "virt");
263 dump_int (di
, "bases", BINFO_N_BASE_BINFOS (t
));
264 for (ix
= 0; BINFO_BASE_ITERATE (t
, ix
, base
); ix
++)
266 tree access
= (accesses
? VEC_index (tree
, accesses
, ix
)
267 : access_public_node
);
268 const char *string
= NULL
;
270 if (access
== access_public_node
)
272 else if (access
== access_protected_node
)
274 else if (access
== access_private_node
)
279 dump_string_field (di
, "accs", string
);
280 queue_and_dump_index (di
, "binf", base
, DUMP_BINFO
);
286 /* We can knock off a bunch of expression nodes in exactly the same
288 if (IS_EXPR_CODE_CLASS (code_class
))
290 /* If we're dumping children, dump them now. */
291 queue_and_dump_type (di
, t
);
296 dump_child ("op 0", TREE_OPERAND (t
, 0));
301 dump_child ("op 0", TREE_OPERAND (t
, 0));
302 dump_child ("op 1", TREE_OPERAND (t
, 1));
308 /* These nodes are handled explicitly below. */
317 expanded_location xloc
;
318 /* All declarations have names. */
320 dump_child ("name", DECL_NAME (t
));
321 if (DECL_ASSEMBLER_NAME_SET_P (t
)
322 && DECL_ASSEMBLER_NAME (t
) != DECL_NAME (t
))
323 dump_child ("mngl", DECL_ASSEMBLER_NAME (t
));
324 if (DECL_ABSTRACT_ORIGIN (t
))
325 dump_child ("orig", DECL_ABSTRACT_ORIGIN (t
));
327 queue_and_dump_type (di
, t
);
328 dump_child ("scpe", DECL_CONTEXT (t
));
329 /* And a source position. */
330 xloc
= expand_location (DECL_SOURCE_LOCATION (t
));
333 const char *filename
= strrchr (xloc
.file
, '/');
335 filename
= xloc
.file
;
337 /* Skip the slash. */
340 dump_maybe_newline (di
);
341 fprintf (di
->stream
, "srcp: %s:%-6d ", filename
,
343 di
->column
+= 6 + strlen (filename
) + 8;
345 /* And any declaration can be compiler-generated. */
346 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_COMMON
)
347 && DECL_ARTIFICIAL (t
))
348 dump_string_field (di
, "note", "artificial");
349 if (TREE_CHAIN (t
) && !dump_flag (di
, TDF_SLIM
, NULL
))
350 dump_child ("chan", TREE_CHAIN (t
));
352 else if (code_class
== tcc_type
)
354 /* All types have qualifiers. */
355 int quals
= lang_hooks
.tree_dump
.type_quals (t
);
357 if (quals
!= TYPE_UNQUALIFIED
)
359 fprintf (di
->stream
, "qual: %c%c%c ",
360 (quals
& TYPE_QUAL_CONST
) ? 'c' : ' ',
361 (quals
& TYPE_QUAL_VOLATILE
) ? 'v' : ' ',
362 (quals
& TYPE_QUAL_RESTRICT
) ? 'r' : ' ');
366 /* All types have associated declarations. */
367 dump_child ("name", TYPE_NAME (t
));
369 /* All types have a main variant. */
370 if (TYPE_MAIN_VARIANT (t
) != t
)
371 dump_child ("unql", TYPE_MAIN_VARIANT (t
));
374 dump_child ("size", TYPE_SIZE (t
));
376 /* All types have alignments. */
377 dump_int (di
, "algn", TYPE_ALIGN (t
));
379 else if (code_class
== tcc_constant
)
380 /* All constants can have types. */
381 queue_and_dump_type (di
, t
);
383 /* Give the language-specific code a chance to print something. If
384 it's completely taken care of things, don't bother printing
385 anything more ourselves. */
386 if (lang_hooks
.tree_dump
.dump_tree (di
, t
))
389 /* Now handle the various kinds of nodes. */
394 case IDENTIFIER_NODE
:
395 dump_string_field (di
, "strg", IDENTIFIER_POINTER (t
));
396 dump_int (di
, "lngt", IDENTIFIER_LENGTH (t
));
400 dump_child ("purp", TREE_PURPOSE (t
));
401 dump_child ("valu", TREE_VALUE (t
));
402 dump_child ("chan", TREE_CHAIN (t
));
407 tree_stmt_iterator it
;
408 for (i
= 0, it
= tsi_start (t
); !tsi_end_p (it
); tsi_next (&it
), i
++)
411 sprintf (buffer
, "%u", i
);
412 dump_child (buffer
, tsi_stmt (it
));
418 dump_int (di
, "lngt", TREE_VEC_LENGTH (t
));
419 for (i
= 0; i
< TREE_VEC_LENGTH (t
); ++i
)
422 sprintf (buffer
, "%u", i
);
423 dump_child (buffer
, TREE_VEC_ELT (t
, i
));
429 dump_int (di
, "prec", TYPE_PRECISION (t
));
430 dump_string_field (di
, "sign", TYPE_UNSIGNED (t
) ? "unsigned": "signed");
431 dump_child ("min", TYPE_MIN_VALUE (t
));
432 dump_child ("max", TYPE_MAX_VALUE (t
));
434 if (code
== ENUMERAL_TYPE
)
435 dump_child ("csts", TYPE_VALUES (t
));
439 dump_int (di
, "prec", TYPE_PRECISION (t
));
443 dump_child ("ptd", TREE_TYPE (t
));
447 dump_child ("refd", TREE_TYPE (t
));
451 dump_child ("clas", TYPE_METHOD_BASETYPE (t
));
455 dump_child ("retn", TREE_TYPE (t
));
456 dump_child ("prms", TYPE_ARG_TYPES (t
));
460 dump_child ("elts", TREE_TYPE (t
));
461 dump_child ("domn", TYPE_DOMAIN (t
));
466 if (TREE_CODE (t
) == RECORD_TYPE
)
467 dump_string_field (di
, "tag", "struct");
469 dump_string_field (di
, "tag", "union");
471 dump_child ("flds", TYPE_FIELDS (t
));
472 dump_child ("fncs", TYPE_METHODS (t
));
473 queue_and_dump_index (di
, "binf", TYPE_BINFO (t
),
478 dump_child ("cnst", DECL_INITIAL (t
));
481 case TYPE_MEMORY_TAG
:
482 case NAME_MEMORY_TAG
:
483 case STRUCT_FIELD_TAG
:
490 if (TREE_CODE (t
) == PARM_DECL
)
491 dump_child ("argt", DECL_ARG_TYPE (t
));
493 dump_child ("init", DECL_INITIAL (t
));
494 dump_child ("size", DECL_SIZE (t
));
495 dump_int (di
, "algn", DECL_ALIGN (t
));
497 if (TREE_CODE (t
) == FIELD_DECL
)
499 if (DECL_FIELD_OFFSET (t
))
500 dump_child ("bpos", bit_position (t
));
502 else if (TREE_CODE (t
) == VAR_DECL
503 || TREE_CODE (t
) == PARM_DECL
)
505 dump_int (di
, "used", TREE_USED (t
));
506 if (DECL_REGISTER (t
))
507 dump_string_field (di
, "spec", "register");
512 dump_child ("args", DECL_ARGUMENTS (t
));
513 if (DECL_EXTERNAL (t
))
514 dump_string_field (di
, "body", "undefined");
516 dump_string_field (di
, "link", "extern");
518 dump_string_field (di
, "link", "static");
519 if (DECL_LANG_SPECIFIC (t
) && !dump_flag (di
, TDF_SLIM
, t
))
520 dump_child ("body", DECL_SAVED_TREE (t
));
524 if (TREE_INT_CST_HIGH (t
))
525 dump_int (di
, "high", TREE_INT_CST_HIGH (t
));
526 dump_int (di
, "low", TREE_INT_CST_LOW (t
));
530 fprintf (di
->stream
, "strg: %-7s ", TREE_STRING_POINTER (t
));
531 dump_int (di
, "lngt", TREE_STRING_LENGTH (t
));
537 case ALIGN_INDIRECT_REF
:
538 case MISALIGNED_INDIRECT_REF
:
539 case CLEANUP_POINT_EXPR
:
543 /* These nodes are unary, but do not have code class `1'. */
544 dump_child ("op 0", TREE_OPERAND (t
, 0));
547 case TRUTH_ANDIF_EXPR
:
548 case TRUTH_ORIF_EXPR
:
552 case PREDECREMENT_EXPR
:
553 case PREINCREMENT_EXPR
:
554 case POSTDECREMENT_EXPR
:
555 case POSTINCREMENT_EXPR
:
556 /* These nodes are binary, but do not have code class `2'. */
557 dump_child ("op 0", TREE_OPERAND (t
, 0));
558 dump_child ("op 1", TREE_OPERAND (t
, 1));
562 dump_child ("op 0", TREE_OPERAND (t
, 0));
563 dump_child ("op 1", TREE_OPERAND (t
, 1));
564 dump_child ("op 2", TREE_OPERAND (t
, 2));
568 case ARRAY_RANGE_REF
:
569 dump_child ("op 0", TREE_OPERAND (t
, 0));
570 dump_child ("op 1", TREE_OPERAND (t
, 1));
571 dump_child ("op 2", TREE_OPERAND (t
, 2));
572 dump_child ("op 3", TREE_OPERAND (t
, 3));
576 dump_child ("op 0", TREE_OPERAND (t
, 0));
577 dump_child ("op 1", TREE_OPERAND (t
, 1));
578 dump_child ("op 2", TREE_OPERAND (t
, 2));
581 case TRY_FINALLY_EXPR
:
582 dump_child ("op 0", TREE_OPERAND (t
, 0));
583 dump_child ("op 1", TREE_OPERAND (t
, 1));
587 dump_child ("fn", TREE_OPERAND (t
, 0));
588 dump_child ("args", TREE_OPERAND (t
, 1));
593 unsigned HOST_WIDE_INT cnt
;
595 dump_int (di
, "lngt", VEC_length (constructor_elt
,
596 CONSTRUCTOR_ELTS (t
)));
597 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), cnt
, index
, value
)
599 dump_child ("idx", index
);
600 dump_child ("val", value
);
606 dump_child ("vars", TREE_OPERAND (t
, 0));
607 dump_child ("body", TREE_OPERAND (t
, 1));
611 dump_child ("body", TREE_OPERAND (t
, 0));
615 dump_child ("cond", TREE_OPERAND (t
, 0));
619 dump_child ("expr", TREE_OPERAND (t
, 0));
623 dump_child ("decl", TREE_OPERAND (t
, 0));
624 dump_child ("init", TREE_OPERAND (t
, 1));
625 dump_child ("clnp", TREE_OPERAND (t
, 2));
626 /* There really are two possible places the initializer can be.
627 After RTL expansion, the second operand is moved to the
628 position of the fourth operand, and the second operand
630 dump_child ("init", TREE_OPERAND (t
, 3));
633 case CASE_LABEL_EXPR
:
634 dump_child ("name", CASE_LABEL (t
));
636 dump_child ("low ", CASE_LOW (t
));
638 dump_child ("high", CASE_HIGH (t
));
643 dump_child ("name", TREE_OPERAND (t
,0));
646 dump_child ("labl", TREE_OPERAND (t
, 0));
649 dump_child ("cond", TREE_OPERAND (t
, 0));
650 dump_child ("body", TREE_OPERAND (t
, 1));
651 if (TREE_OPERAND (t
, 2))
653 dump_child ("labl", TREE_OPERAND (t
,2));
659 fprintf (di
->stream
, "%s\n", omp_clause_code_name
[OMP_CLAUSE_CODE (t
)]);
660 for (i
= 0; i
< omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)]; i
++)
661 dump_child ("op: ", OMP_CLAUSE_OPERAND (t
, i
));
665 /* There are no additional fields to print. */
670 if (dump_flag (di
, TDF_ADDRESS
, NULL
))
671 dump_pointer (di
, "addr", (void *)t
);
673 /* Terminate the line. */
674 fprintf (di
->stream
, "\n");
677 /* Return nonzero if FLAG has been specified for the dump, and NODE
678 is not the root node of the dump. */
680 int dump_flag (dump_info_p di
, int flag
, tree node
)
682 return (di
->flags
& flag
) && (node
!= di
->node
);
685 /* Dump T, and all its children, on STREAM. */
688 dump_node (tree t
, int flags
, FILE *stream
)
692 dump_queue_p next_dq
;
694 /* Initialize the dump-information structure. */
703 di
.nodes
= splay_tree_new (splay_tree_compare_pointers
, 0,
704 (splay_tree_delete_value_fn
) &free
);
706 /* Queue up the first node. */
707 queue (&di
, t
, DUMP_NONE
);
709 /* Until the queue is empty, keep dumping nodes. */
711 dequeue_and_dump (&di
);
714 for (dq
= di
.free_list
; dq
; dq
= next_dq
)
719 splay_tree_delete (di
.nodes
);
723 /* Table of tree dump switches. This must be consistent with the
724 TREE_DUMP_INDEX enumeration in tree.h */
725 static struct dump_file_info dump_files
[TDI_end
] =
727 {NULL
, NULL
, NULL
, 0, 0, 0, 0},
728 {".tu", "translation-unit", NULL
, TDF_TREE
, 0, 0, 0},
729 {".class", "class-hierarchy", NULL
, TDF_TREE
, 0, 1, 0},
730 {".original", "tree-original", NULL
, TDF_TREE
, 0, 2, 0},
731 {".gimple", "tree-gimple", NULL
, TDF_TREE
, 0, 3, 0},
732 {".nested", "tree-nested", NULL
, TDF_TREE
, 0, 4, 0},
733 {".inlined", "tree-inlined", NULL
, TDF_TREE
, 0, 5, 0},
734 {".vcg", "tree-vcg", NULL
, TDF_TREE
, 0, 6, 0},
735 {NULL
, "tree-all", NULL
, TDF_TREE
, 0, 0, 0},
736 {NULL
, "rtl-all", NULL
, TDF_RTL
, 0, 0, 0},
737 {NULL
, "ipa-all", NULL
, TDF_IPA
, 0, 0, 0},
739 { ".cgraph", "ipa-cgraph", NULL
, TDF_IPA
, 0, 0, 0},
742 /* Dynamically registered tree dump files and switches. */
743 static struct dump_file_info
*extra_dump_files
;
744 static size_t extra_dump_files_in_use
;
745 static size_t extra_dump_files_alloced
;
747 /* Define a name->number mapping for a dump flag value. */
748 struct dump_option_value_info
750 const char *const name
; /* the name of the value */
751 const int value
; /* the value of the name */
754 /* Table of dump options. This must be consistent with the TDF_* flags
756 static const struct dump_option_value_info dump_options
[] =
758 {"address", TDF_ADDRESS
},
761 {"details", TDF_DETAILS
},
762 {"stats", TDF_STATS
},
763 {"blocks", TDF_BLOCKS
},
765 {"lineno", TDF_LINENO
},
767 {"stmtaddr", TDF_STMTADDR
},
768 {"all", ~(TDF_RAW
| TDF_SLIM
| TDF_LINENO
| TDF_TREE
| TDF_RTL
| TDF_IPA
769 | TDF_STMTADDR
| TDF_GRAPH
)},
774 dump_register (const char *suffix
, const char *swtch
, const char *glob
,
775 int flags
, unsigned int num
, int letter
)
777 size_t this = extra_dump_files_in_use
++;
779 if (this >= extra_dump_files_alloced
)
781 if (extra_dump_files_alloced
== 0)
782 extra_dump_files_alloced
= 32;
784 extra_dump_files_alloced
*= 2;
785 extra_dump_files
= xrealloc (extra_dump_files
,
786 sizeof (struct dump_file_info
)
787 * extra_dump_files_alloced
);
790 memset (&extra_dump_files
[this], 0, sizeof (struct dump_file_info
));
791 extra_dump_files
[this].suffix
= suffix
;
792 extra_dump_files
[this].swtch
= swtch
;
793 extra_dump_files
[this].glob
= glob
;
794 extra_dump_files
[this].flags
= flags
;
795 extra_dump_files
[this].num
= num
;
796 extra_dump_files
[this].letter
= letter
;
798 return this + TDI_end
;
802 /* Return the dump_file_info for the given phase. */
804 struct dump_file_info
*
805 get_dump_file_info (enum tree_dump_index phase
)
808 return &dump_files
[phase
];
809 else if (phase
- TDI_end
>= extra_dump_files_in_use
)
812 return extra_dump_files
+ (phase
- TDI_end
);
816 /* Return the name of the dump file for the given phase.
817 If the dump is not enabled, returns NULL. */
820 get_dump_file_name (enum tree_dump_index phase
)
823 struct dump_file_info
*dfi
;
825 if (phase
== TDI_none
)
828 dfi
= get_dump_file_info (phase
);
836 const char *template;
837 if (dfi
->flags
& TDF_TREE
)
839 else if (dfi
->flags
& TDF_IPA
)
844 if (snprintf (dump_id
, sizeof (dump_id
), template, dfi
->num
) < 0)
848 return concat (dump_base_name
, dump_id
, dfi
->suffix
, NULL
);
851 /* Begin a tree dump for PHASE. Stores any user supplied flag in
852 *FLAG_PTR and returns a stream to write to. If the dump is not
853 enabled, returns NULL.
854 Multiple calls will reopen and append to the dump file. */
857 dump_begin (enum tree_dump_index phase
, int *flag_ptr
)
860 struct dump_file_info
*dfi
;
863 if (phase
== TDI_none
|| !dump_enabled_p (phase
))
866 name
= get_dump_file_name (phase
);
867 dfi
= get_dump_file_info (phase
);
868 stream
= fopen (name
, dfi
->state
< 0 ? "w" : "a");
870 error ("could not open dump file %qs: %s", name
, strerror (errno
));
876 *flag_ptr
= dfi
->flags
;
881 /* Returns nonzero if tree dump PHASE is enabled. If PHASE is
882 TDI_tree_all, return nonzero if any dump is enabled. */
885 dump_enabled_p (enum tree_dump_index phase
)
887 if (phase
== TDI_tree_all
)
890 for (i
= TDI_none
+ 1; i
< (size_t) TDI_end
; i
++)
891 if (dump_files
[i
].state
)
893 for (i
= 0; i
< extra_dump_files_in_use
; i
++)
894 if (extra_dump_files
[i
].state
)
900 struct dump_file_info
*dfi
= get_dump_file_info (phase
);
905 /* Returns nonzero if tree dump PHASE has been initialized. */
908 dump_initialized_p (enum tree_dump_index phase
)
910 struct dump_file_info
*dfi
= get_dump_file_info (phase
);
911 return dfi
->state
> 0;
914 /* Returns the switch name of PHASE. */
917 dump_flag_name (enum tree_dump_index phase
)
919 struct dump_file_info
*dfi
= get_dump_file_info (phase
);
923 /* Finish a tree dump for PHASE. STREAM is the stream created by
927 dump_end (enum tree_dump_index phase ATTRIBUTE_UNUSED
, FILE *stream
)
932 /* Enable all tree dumps. Return number of enabled tree dumps. */
935 dump_enable_all (int flags
, int letter
)
937 int ir_type
= (flags
& (TDF_TREE
| TDF_RTL
| TDF_IPA
));
941 for (i
= TDI_none
+ 1; i
< (size_t) TDI_end
; i
++)
942 if ((dump_files
[i
].flags
& ir_type
)
943 && (letter
== 0 || letter
== dump_files
[i
].letter
))
945 dump_files
[i
].state
= -1;
946 dump_files
[i
].flags
|= flags
;
950 for (i
= 0; i
< extra_dump_files_in_use
; i
++)
951 if ((extra_dump_files
[i
].flags
& ir_type
)
952 && (letter
== 0 || letter
== extra_dump_files
[i
].letter
))
954 extra_dump_files
[i
].state
= -1;
955 extra_dump_files
[i
].flags
|= flags
;
962 /* Parse ARG as a dump switch. Return nonzero if it is, and store the
963 relevant details in the dump_files array. */
966 dump_switch_p_1 (const char *arg
, struct dump_file_info
*dfi
, bool doglob
)
968 const char *option_value
;
972 if (doglob
&& !dfi
->glob
)
975 option_value
= skip_leading_substring (arg
, doglob
? dfi
->glob
: dfi
->swtch
);
984 const struct dump_option_value_info
*option_ptr
;
990 end_ptr
= strchr (ptr
, '-');
992 end_ptr
= ptr
+ strlen (ptr
);
993 length
= end_ptr
- ptr
;
995 for (option_ptr
= dump_options
; option_ptr
->name
; option_ptr
++)
996 if (strlen (option_ptr
->name
) == length
997 && !memcmp (option_ptr
->name
, ptr
, length
))
999 flags
|= option_ptr
->value
;
1002 warning (0, "ignoring unknown option %q.*s in %<-fdump-%s%>",
1003 length
, ptr
, dfi
->swtch
);
1009 dfi
->flags
|= flags
;
1011 /* Process -fdump-tree-all and -fdump-rtl-all, by enabling all the
1013 if (dfi
->suffix
== NULL
)
1014 dump_enable_all (dfi
->flags
, 0);
1020 dump_switch_p (const char *arg
)
1025 for (i
= TDI_none
+ 1; i
!= TDI_end
; i
++)
1026 any
|= dump_switch_p_1 (arg
, &dump_files
[i
], false);
1028 /* Don't glob if we got a hit already */
1030 for (i
= TDI_none
+ 1; i
!= TDI_end
; i
++)
1031 any
|= dump_switch_p_1 (arg
, &dump_files
[i
], true);
1033 for (i
= 0; i
< extra_dump_files_in_use
; i
++)
1034 any
|= dump_switch_p_1 (arg
, &extra_dump_files
[i
], false);
1037 for (i
= 0; i
< extra_dump_files_in_use
; i
++)
1038 any
|= dump_switch_p_1 (arg
, &extra_dump_files
[i
], true);
1044 /* Dump FUNCTION_DECL FN as tree dump PHASE. */
1047 dump_function (enum tree_dump_index phase
, tree fn
)
1052 stream
= dump_begin (phase
, &flags
);
1055 dump_function_to_file (fn
, stream
, flags
);
1056 dump_end (phase
, stream
);
1061 enable_rtl_dump_file (int letter
)
1066 return dump_enable_all (TDF_RTL
, letter
) > 0;