1 /* Pretty formatting of GENERIC trees in C syntax.
2 Copyright (C) 2001, 2002, 2003 Free Software Foundation, Inc.
3 Adapted from c-pretty-print.c by Diego Novillo <dnovillo@redhat.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
28 #include "diagnostic.h"
31 #include "tree-flow.h"
32 #include "langhooks.h"
33 #include "tree-iterator.h"
34 #include "tree-chrec.h"
36 /* Local functions, macros and variables. */
37 static int op_prio (tree);
38 static const char *op_symbol (tree);
39 static void pretty_print_string (pretty_printer *, const char*);
40 static void print_call_name (pretty_printer *, tree);
41 static void newline_and_indent (pretty_printer *, int);
42 static void maybe_init_pretty_print (FILE *);
43 static void print_declaration (pretty_printer *, tree, int, int);
44 static void print_struct_decl (pretty_printer *, tree, int, int);
45 static void do_niy (pretty_printer *, tree);
46 static void dump_vops (pretty_printer *, tree, int, int);
47 static void dump_generic_bb_buff (pretty_printer *, basic_block, int, int);
49 #define INDENT(SPACE) do { \
50 int i; for (i = 0; i<SPACE; i++) pp_space (buffer); } while (0)
52 #define NIY do_niy(buffer,node)
54 #define PRINT_FUNCTION_NAME(NODE) pp_printf \
55 (buffer, "%s", TREE_CODE (NODE) == NOP_EXPR ? \
56 lang_hooks.decl_printable_name (TREE_OPERAND (NODE, 0), 1) : \
57 lang_hooks.decl_printable_name (NODE, 1))
59 static pretty_printer buffer;
60 static int initialized = 0;
61 static bool dumping_stmts;
63 /* Try to print something for an unknown tree code. */
66 do_niy (pretty_printer *buffer, tree node)
70 pp_string (buffer, "<<< Unknown tree: ");
71 pp_string (buffer, tree_code_name[(int) TREE_CODE (node)]);
73 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (node))))
75 len = first_rtl_op (TREE_CODE (node));
76 for (i = 0; i < len; ++i)
78 newline_and_indent (buffer, 2);
79 dump_generic_node (buffer, TREE_OPERAND (node, i), 2, 0, false);
83 pp_string (buffer, " >>>\n");
87 debug_generic_expr (tree t)
89 print_generic_expr (stderr, t, TDF_VOPS|TDF_UID);
90 fprintf (stderr, "\n");
94 debug_generic_stmt (tree t)
96 print_generic_stmt (stderr, t, TDF_VOPS|TDF_UID);
97 fprintf (stderr, "\n");
100 /* Prints declaration DECL to the FILE with details specified by FLAGS. */
102 print_generic_decl (FILE *file, tree decl, int flags)
104 maybe_init_pretty_print (file);
105 dumping_stmts = true;
106 print_declaration (&buffer, decl, 2, flags);
107 pp_write_text_to_stream (&buffer);
110 /* Print tree T, and its successors, on file FILE. FLAGS specifies details
111 to show in the dump. See TDF_* in tree.h. */
114 print_generic_stmt (FILE *file, tree t, int flags)
116 maybe_init_pretty_print (file);
117 dumping_stmts = true;
118 dump_generic_node (&buffer, t, 0, flags, true);
122 /* Print tree T, and its successors, on file FILE. FLAGS specifies details
123 to show in the dump. See TDF_* in tree.h. The output is indented by
127 print_generic_stmt_indented (FILE *file, tree t, int flags, int indent)
131 maybe_init_pretty_print (file);
132 dumping_stmts = true;
134 for (i = 0; i < indent; i++)
136 dump_generic_node (&buffer, t, indent, flags, true);
140 /* Print a single expression T on file FILE. FLAGS specifies details to show
141 in the dump. See TDF_* in tree.h. */
144 print_generic_expr (FILE *file, tree t, int flags)
146 maybe_init_pretty_print (file);
147 dumping_stmts = false;
148 dump_generic_node (&buffer, t, 0, flags, false);
151 /* Dump the name of a _DECL node and its DECL_UID if TDF_UID is set
155 dump_decl_name (pretty_printer *buffer, tree node, int flags)
157 if (DECL_NAME (node))
158 pp_tree_identifier (buffer, DECL_NAME (node));
160 if ((flags & TDF_UID)
161 || DECL_NAME (node) == NULL_TREE)
163 if (TREE_CODE (node) == LABEL_DECL
164 && LABEL_DECL_UID (node) != -1)
165 pp_printf (buffer, "<L" HOST_WIDE_INT_PRINT_DEC ">",
166 LABEL_DECL_UID (node));
168 pp_printf (buffer, "<D%u>", DECL_UID (node));
172 /* Dump a function declaration. NODE is the FUNCTION_TYPE. BUFFER, SPC and
173 FLAGS are as in dump_generic_node. */
176 dump_function_declaration (pretty_printer *buffer, tree node,
179 bool wrote_arg = false;
183 pp_character (buffer, '(');
185 /* Print the argument types. The last element in the list is a VOID_TYPE.
186 The following avoids printing the last element. */
187 arg = TYPE_ARG_TYPES (node);
188 while (arg && TREE_CHAIN (arg) && arg != error_mark_node)
191 dump_generic_node (buffer, TREE_VALUE (arg), spc, flags, false);
192 arg = TREE_CHAIN (arg);
193 if (TREE_CHAIN (arg) && TREE_CODE (TREE_CHAIN (arg)) == TREE_LIST)
195 pp_character (buffer, ',');
201 pp_string (buffer, "void");
203 pp_character (buffer, ')');
206 /* Dump the node NODE on the pretty_printer BUFFER, SPC spaces of indent.
207 FLAGS specifies details to show in the dump (see TDF_* in tree.h). If
208 IS_STMT is true, the object printed is considered to be a statement
209 and it is terminated by ';' if appropriate. */
212 dump_generic_node (pretty_printer *buffer, tree node, int spc, int flags,
220 if (node == NULL_TREE)
223 is_expr = EXPR_P (node);
225 if (TREE_CODE (node) != ERROR_MARK
226 && is_gimple_stmt (node)
227 && (flags & TDF_VOPS)
229 dump_vops (buffer, node, spc, flags);
232 && (flags & TDF_LINENO)
233 && EXPR_HAS_LOCATION (node))
235 expanded_location xloc = expand_location (EXPR_LOCATION (node));
236 pp_character (buffer, '[');
239 pp_string (buffer, xloc.file);
240 pp_string (buffer, " : ");
242 pp_decimal_int (buffer, xloc.line);
243 pp_string (buffer, "] ");
246 switch (TREE_CODE (node))
249 pp_string (buffer, "<<< error >>>");
252 case IDENTIFIER_NODE:
253 pp_tree_identifier (buffer, node);
257 while (node && node != error_mark_node)
259 if (TREE_PURPOSE (node))
261 dump_generic_node (buffer, TREE_PURPOSE (node), spc, flags, false);
264 dump_generic_node (buffer, TREE_VALUE (node), spc, flags, false);
265 node = TREE_CHAIN (node);
266 if (node && TREE_CODE (node) == TREE_LIST)
268 pp_character (buffer, ',');
275 dump_generic_node (buffer, BINFO_TYPE (node), spc, flags, false);
291 unsigned int quals = TYPE_QUALS (node);
294 if (quals & TYPE_QUAL_CONST)
295 pp_string (buffer, "const ");
296 else if (quals & TYPE_QUAL_VOLATILE)
297 pp_string (buffer, "volatile ");
298 else if (quals & TYPE_QUAL_RESTRICT)
299 pp_string (buffer, "restrict ");
301 class = TREE_CODE_CLASS (TREE_CODE (node));
305 if (DECL_NAME (node))
306 dump_decl_name (buffer, node, flags);
308 pp_string (buffer, "<unnamed type decl>");
310 else if (class == 't')
312 if (TYPE_NAME (node))
314 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
315 pp_tree_identifier (buffer, TYPE_NAME (node));
316 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
317 && DECL_NAME (TYPE_NAME (node)))
318 dump_decl_name (buffer, TYPE_NAME (node), flags);
320 pp_string (buffer, "<unnamed type>");
323 pp_string (buffer, "<unnamed type>");
330 str = (TREE_CODE (node) == POINTER_TYPE ? "*" : "&");
332 if (TREE_CODE (TREE_TYPE (node)) == FUNCTION_TYPE)
334 tree fnode = TREE_TYPE (node);
336 dump_generic_node (buffer, TREE_TYPE (fnode), spc, flags, false);
338 pp_character (buffer, '(');
339 pp_string (buffer, str);
340 if (TYPE_NAME (node) && DECL_NAME (TYPE_NAME (node)))
341 dump_decl_name (buffer, TYPE_NAME (node), flags);
343 pp_printf (buffer, "<T%x>", TYPE_UID (node));
345 pp_character (buffer, ')');
346 dump_function_declaration (buffer, fnode, spc, flags);
350 unsigned int quals = TYPE_QUALS (node);
352 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
354 pp_string (buffer, str);
356 if (quals & TYPE_QUAL_CONST)
357 pp_string (buffer, " const");
358 else if (quals & TYPE_QUAL_VOLATILE)
359 pp_string (buffer, "volatile");
360 else if (quals & TYPE_QUAL_RESTRICT)
361 pp_string (buffer, " restrict");
370 dump_decl_name (buffer, TYPE_NAME (TYPE_METHOD_BASETYPE (node)), flags);
371 pp_string (buffer, "::");
382 /* Print the innermost component type. */
383 for (tmp = TREE_TYPE (node); TREE_CODE (tmp) == ARRAY_TYPE;
384 tmp = TREE_TYPE (tmp))
386 dump_generic_node (buffer, tmp, spc, flags, false);
388 /* Print the dimensions. */
389 for (tmp = node; TREE_CODE (tmp) == ARRAY_TYPE;
390 tmp = TREE_TYPE (tmp))
392 tree domain = TYPE_DOMAIN (tmp);
394 pp_character (buffer, '[');
397 if (TYPE_MIN_VALUE (domain)
398 && !integer_zerop (TYPE_MIN_VALUE (domain)))
400 dump_generic_node (buffer, TYPE_MIN_VALUE (domain),
402 pp_string (buffer, " .. ");
405 if (TYPE_MAX_VALUE (domain))
406 dump_generic_node (buffer, TYPE_MAX_VALUE (domain),
410 pp_string (buffer, "<unknown>");
412 pp_character (buffer, ']');
423 case QUAL_UNION_TYPE:
424 /* Print the name of the structure. */
425 if (TREE_CODE (node) == RECORD_TYPE)
426 pp_string (buffer, "struct ");
427 else if (TREE_CODE (node) == UNION_TYPE)
428 pp_string (buffer, "union ");
430 if (TYPE_NAME (node))
431 dump_generic_node (buffer, TYPE_NAME (node), spc, flags, false);
433 print_struct_decl (buffer, node, spc, flags);
441 if (TREE_CODE (TREE_TYPE (node)) == POINTER_TYPE)
443 /* In the case of a pointer, one may want to divide by the
444 size of the pointed-to type. Unfortunately, this not
445 straightforward. The C front-end maps expressions
450 in such a way that the two INTEGER_CST nodes for "5" have
451 different values but identical types. In the latter
452 case, the 5 is multiplied by sizeof (int) in c-common.c
453 (pointer_int_sum) to convert it to a byte address, and
454 yet the type of the node is left unchanged. Argh. What
455 is consistent though is that the number value corresponds
456 to bytes (UNITS) offset.
458 NB: Neither of the following divisors can be trivially
459 used to recover the original literal:
461 TREE_INT_CST_LOW (TYPE_SIZE_UNIT (TREE_TYPE (node)))
462 TYPE_PRECISION (TREE_TYPE (TREE_TYPE (node))) */
463 pp_wide_integer (buffer, TREE_INT_CST_LOW (node));
464 pp_string (buffer, "B"); /* pseudo-unit */
466 else if (! host_integerp (node, 0))
470 if (tree_int_cst_sgn (val) < 0)
472 pp_character (buffer, '-');
473 val = build_int_2 (-TREE_INT_CST_LOW (val),
474 ~TREE_INT_CST_HIGH (val)
475 + !TREE_INT_CST_LOW (val));
477 /* Would "%x%0*x" or "%x%*0x" get zero-padding on all
480 static char format[10]; /* "%x%09999x\0" */
482 sprintf (format, "%%x%%0%dx", HOST_BITS_PER_INT / 4);
483 sprintf (pp_buffer (buffer)->digit_buffer, format,
484 TREE_INT_CST_HIGH (val),
485 TREE_INT_CST_LOW (val));
486 pp_string (buffer, pp_buffer (buffer)->digit_buffer);
490 pp_wide_integer (buffer, TREE_INT_CST_LOW (node));
494 /* Code copied from print_node. */
497 if (TREE_OVERFLOW (node))
498 pp_string (buffer, " overflow");
500 #if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
501 d = TREE_REAL_CST (node);
502 if (REAL_VALUE_ISINF (d))
503 pp_string (buffer, " Inf");
504 else if (REAL_VALUE_ISNAN (d))
505 pp_string (buffer, " Nan");
509 real_to_decimal (string, &d, sizeof (string), 0, 1);
510 pp_string (buffer, string);
515 unsigned char *p = (unsigned char *) &TREE_REAL_CST (node);
516 pp_string (buffer, "0x");
517 for (i = 0; i < sizeof TREE_REAL_CST (node); i++)
518 output_formatted_integer (buffer, "%02x", *p++);
525 pp_string (buffer, "__complex__ (");
526 dump_generic_node (buffer, TREE_REALPART (node), spc, flags, false);
527 pp_string (buffer, ", ");
528 dump_generic_node (buffer, TREE_IMAGPART (node), spc, flags, false);
529 pp_string (buffer, ")");
533 pp_string (buffer, "\"");
534 pretty_print_string (buffer, TREE_STRING_POINTER (node));
535 pp_string (buffer, "\"");
541 pp_string (buffer, "{ ");
542 for (elt = TREE_VECTOR_CST_ELTS (node); elt; elt = TREE_CHAIN (elt))
544 dump_generic_node (buffer, TREE_VALUE (elt), spc, flags, false);
545 if (TREE_CHAIN (elt))
546 pp_string (buffer, ", ");
548 pp_string (buffer, " }");
557 dump_decl_name (buffer, node, flags);
561 if (DECL_NAME (node))
562 dump_decl_name (buffer, node, flags);
563 else if (LABEL_DECL_UID (node) != -1)
564 pp_printf (buffer, "<L" HOST_WIDE_INT_PRINT_DEC ">",
565 LABEL_DECL_UID (node));
567 pp_printf (buffer, "<D%u>", DECL_UID (node));
571 if (DECL_IS_BUILTIN (node))
573 /* Don't print the declaration of built-in types. */
576 if (DECL_NAME (node))
577 dump_decl_name (buffer, node, flags);
580 if ((TREE_CODE (TREE_TYPE (node)) == RECORD_TYPE
581 || TREE_CODE (TREE_TYPE (node)) == UNION_TYPE)
582 && TYPE_METHODS (TREE_TYPE (node)))
584 /* The type is a c++ class: all structures have at least
586 pp_string (buffer, "class ");
587 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
592 (TREE_CODE (TREE_TYPE (node)) == UNION_TYPE
593 ? "union" : "struct "));
594 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
603 dump_decl_name (buffer, node, flags);
607 pp_string (buffer, "<retval>");
611 op0 = TREE_OPERAND (node, 0);
613 if (TREE_CODE (op0) == INDIRECT_REF)
615 op0 = TREE_OPERAND (op0, 0);
618 if (op_prio (op0) < op_prio (node))
619 pp_character (buffer, '(');
620 dump_generic_node (buffer, op0, spc, flags, false);
621 if (op_prio (op0) < op_prio (node))
622 pp_character (buffer, ')');
623 pp_string (buffer, str);
624 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
626 op0 = component_ref_field_offset (node);
627 if (op0 && TREE_CODE (op0) != INTEGER_CST)
629 pp_string (buffer, "{off: ");
630 dump_generic_node (buffer, op0, spc, flags, false);
631 pp_character (buffer, '}');
636 pp_string (buffer, "BIT_FIELD_REF <");
637 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
638 pp_string (buffer, ", ");
639 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
640 pp_string (buffer, ", ");
641 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
642 pp_string (buffer, ">");
646 case ARRAY_RANGE_REF:
647 op0 = TREE_OPERAND (node, 0);
648 if (op_prio (op0) < op_prio (node))
649 pp_character (buffer, '(');
650 dump_generic_node (buffer, op0, spc, flags, false);
651 if (op_prio (op0) < op_prio (node))
652 pp_character (buffer, ')');
653 pp_character (buffer, '[');
654 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
655 if (TREE_CODE (node) == ARRAY_RANGE_REF)
656 pp_string (buffer, " ...");
657 pp_character (buffer, ']');
659 op0 = array_ref_low_bound (node);
660 op1 = array_ref_element_size (node);
662 if (!integer_zerop (op0)
663 || (TYPE_SIZE_UNIT (TREE_TYPE (node))
664 && !operand_equal_p (op1, TYPE_SIZE_UNIT (TREE_TYPE (node)), 0)))
666 pp_string (buffer, "{lb: ");
667 dump_generic_node (buffer, op0, spc, flags, false);
668 pp_string (buffer, " sz: ");
669 dump_generic_node (buffer, op1, spc, flags, false);
670 pp_character (buffer, '}');
677 bool is_struct_init = FALSE;
678 pp_character (buffer, '{');
679 lnode = CONSTRUCTOR_ELTS (node);
680 if (TREE_CODE (TREE_TYPE (node)) == RECORD_TYPE
681 || TREE_CODE (TREE_TYPE (node)) == UNION_TYPE)
682 is_struct_init = TRUE;
683 while (lnode && lnode != error_mark_node)
686 if (TREE_PURPOSE (lnode) && is_struct_init)
688 pp_character (buffer, '.');
689 dump_generic_node (buffer, TREE_PURPOSE (lnode), spc, flags, false);
690 pp_string (buffer, "=");
692 val = TREE_VALUE (lnode);
693 if (val && TREE_CODE (val) == ADDR_EXPR)
694 if (TREE_CODE (TREE_OPERAND (val, 0)) == FUNCTION_DECL)
695 val = TREE_OPERAND (val, 0);
696 if (val && TREE_CODE (val) == FUNCTION_DECL)
698 dump_decl_name (buffer, val, flags);
702 dump_generic_node (buffer, TREE_VALUE (lnode), spc, flags, false);
704 lnode = TREE_CHAIN (lnode);
705 if (lnode && TREE_CODE (lnode) == TREE_LIST)
707 pp_character (buffer, ',');
711 pp_character (buffer, '}');
718 if (flags & TDF_SLIM)
720 pp_string (buffer, "<COMPOUND_EXPR>");
724 dump_generic_node (buffer, TREE_OPERAND (node, 0),
725 spc, flags, dumping_stmts);
727 newline_and_indent (buffer, spc);
730 pp_character (buffer, ',');
734 for (tp = &TREE_OPERAND (node, 1);
735 TREE_CODE (*tp) == COMPOUND_EXPR;
736 tp = &TREE_OPERAND (*tp, 1))
738 dump_generic_node (buffer, TREE_OPERAND (*tp, 0),
739 spc, flags, dumping_stmts);
741 newline_and_indent (buffer, spc);
744 pp_character (buffer, ',');
749 dump_generic_node (buffer, *tp, spc, flags, dumping_stmts);
755 tree_stmt_iterator si;
758 if ((flags & TDF_SLIM) || !dumping_stmts)
760 pp_string (buffer, "<STATEMENT_LIST>");
764 for (si = tsi_start (node); !tsi_end_p (si); tsi_next (&si))
767 newline_and_indent (buffer, spc);
770 dump_generic_node (buffer, tsi_stmt (si), spc, flags, true);
777 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
779 pp_character (buffer, '=');
781 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
785 pp_string (buffer, "TARGET_EXPR <");
786 dump_generic_node (buffer, TARGET_EXPR_SLOT (node), spc, flags, false);
787 pp_character (buffer, ',');
789 dump_generic_node (buffer, TARGET_EXPR_INITIAL (node), spc, flags, false);
790 pp_character (buffer, '>');
794 print_declaration (buffer, DECL_EXPR_DECL (node), spc, flags);
799 if (TREE_TYPE (node) == NULL || TREE_TYPE (node) == void_type_node)
801 pp_string (buffer, "if (");
802 dump_generic_node (buffer, COND_EXPR_COND (node), spc, flags, false);
803 pp_character (buffer, ')');
804 /* The lowered cond_exprs should always be printed in full. */
805 if (COND_EXPR_THEN (node)
806 && TREE_CODE (COND_EXPR_THEN (node)) == GOTO_EXPR
807 && COND_EXPR_ELSE (node)
808 && TREE_CODE (COND_EXPR_ELSE (node)) == GOTO_EXPR)
811 dump_generic_node (buffer, COND_EXPR_THEN (node), 0, flags, true);
812 pp_string (buffer, " else ");
813 dump_generic_node (buffer, COND_EXPR_ELSE (node), 0, flags, true);
815 else if (!(flags & TDF_SLIM))
817 /* Output COND_EXPR_THEN. */
818 if (COND_EXPR_THEN (node))
820 newline_and_indent (buffer, spc+2);
821 pp_character (buffer, '{');
822 newline_and_indent (buffer, spc+4);
823 dump_generic_node (buffer, COND_EXPR_THEN (node), spc+4,
825 newline_and_indent (buffer, spc+2);
826 pp_character (buffer, '}');
829 /* Output COND_EXPR_ELSE. */
830 if (COND_EXPR_ELSE (node))
832 newline_and_indent (buffer, spc);
833 pp_string (buffer, "else");
834 newline_and_indent (buffer, spc+2);
835 pp_character (buffer, '{');
836 newline_and_indent (buffer, spc+4);
837 dump_generic_node (buffer, COND_EXPR_ELSE (node), spc+4,
839 newline_and_indent (buffer, spc+2);
840 pp_character (buffer, '}');
847 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
849 pp_character (buffer, '?');
851 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
853 pp_character (buffer, ':');
855 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
860 pp_character (buffer, '{');
861 if (!(flags & TDF_SLIM))
863 if (BIND_EXPR_VARS (node))
867 for (op0 = BIND_EXPR_VARS (node); op0; op0 = TREE_CHAIN (op0))
869 print_declaration (buffer, op0, spc+2, flags);
874 newline_and_indent (buffer, spc+2);
875 dump_generic_node (buffer, BIND_EXPR_BODY (node), spc+2, flags, true);
876 newline_and_indent (buffer, spc);
877 pp_character (buffer, '}');
883 print_call_name (buffer, node);
885 /* Print parameters. */
887 pp_character (buffer, '(');
888 op1 = TREE_OPERAND (node, 1);
890 dump_generic_node (buffer, op1, spc, flags, false);
891 pp_character (buffer, ')');
893 op1 = TREE_OPERAND (node, 2);
896 pp_string (buffer, " [static-chain: ");
897 dump_generic_node (buffer, op1, spc, flags, false);
898 pp_character (buffer, ']');
901 if (CALL_EXPR_TAILCALL (node))
902 pp_string (buffer, " [tail call]");
905 case WITH_CLEANUP_EXPR:
909 case CLEANUP_POINT_EXPR:
910 pp_string (buffer, "<<cleanup_point ");
911 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
912 pp_string (buffer, ">>");
915 case PLACEHOLDER_EXPR:
916 pp_string (buffer, "<PLACEHOLDER_EXPR ");
917 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
918 pp_character (buffer, '>');
921 /* Binary arithmetic and logic expressions. */
942 case TRUTH_ANDIF_EXPR:
943 case TRUTH_ORIF_EXPR:
962 const char *op = op_symbol (node);
963 op0 = TREE_OPERAND (node, 0);
964 op1 = TREE_OPERAND (node, 1);
966 /* When the operands are expressions with less priority,
967 keep semantics of the tree representation. */
968 if (op_prio (op0) < op_prio (node))
970 pp_character (buffer, '(');
971 dump_generic_node (buffer, op0, spc, flags, false);
972 pp_character (buffer, ')');
975 dump_generic_node (buffer, op0, spc, flags, false);
978 pp_string (buffer, op);
981 /* When the operands are expressions with less priority,
982 keep semantics of the tree representation. */
983 if (op_prio (op1) < op_prio (node))
985 pp_character (buffer, '(');
986 dump_generic_node (buffer, op1, spc, flags, false);
987 pp_character (buffer, ')');
990 dump_generic_node (buffer, op1, spc, flags, false);
994 /* Unary arithmetic and logic expressions. */
999 case PREDECREMENT_EXPR:
1000 case PREINCREMENT_EXPR:
1002 if (TREE_CODE (node) == ADDR_EXPR
1003 && (TREE_CODE (TREE_OPERAND (node, 0)) == STRING_CST
1004 || TREE_CODE (TREE_OPERAND (node, 0)) == FUNCTION_DECL))
1005 ; /* Do not output '&' for strings and function pointers. */
1007 pp_string (buffer, op_symbol (node));
1009 if (op_prio (TREE_OPERAND (node, 0)) < op_prio (node))
1011 pp_character (buffer, '(');
1012 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1013 pp_character (buffer, ')');
1016 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1019 case POSTDECREMENT_EXPR:
1020 case POSTINCREMENT_EXPR:
1021 if (op_prio (TREE_OPERAND (node, 0)) < op_prio (node))
1023 pp_character (buffer, '(');
1024 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1025 pp_character (buffer, ')');
1028 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1029 pp_string (buffer, op_symbol (node));
1033 pp_string (buffer, "MIN_EXPR <");
1034 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1035 pp_string (buffer, ", ");
1036 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1037 pp_character (buffer, '>');
1041 pp_string (buffer, "MAX_EXPR <");
1042 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1043 pp_string (buffer, ", ");
1044 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1045 pp_character (buffer, '>');
1049 pp_string (buffer, "ABS_EXPR <");
1050 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1051 pp_character (buffer, '>');
1058 case FIX_TRUNC_EXPR:
1060 case FIX_FLOOR_EXPR:
1061 case FIX_ROUND_EXPR:
1065 type = TREE_TYPE (node);
1066 op0 = TREE_OPERAND (node, 0);
1067 if (type != TREE_TYPE (op0))
1069 pp_character (buffer, '(');
1070 dump_generic_node (buffer, type, spc, flags, false);
1071 pp_string (buffer, ")");
1073 if (op_prio (op0) < op_prio (node))
1074 pp_character (buffer, '(');
1075 dump_generic_node (buffer, op0, spc, flags, false);
1076 if (op_prio (op0) < op_prio (node))
1077 pp_character (buffer, ')');
1080 case VIEW_CONVERT_EXPR:
1081 pp_string (buffer, "VIEW_CONVERT_EXPR<");
1082 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
1083 pp_string (buffer, ">(");
1084 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1085 pp_character (buffer, ')');
1088 case NON_LVALUE_EXPR:
1089 pp_string (buffer, "NON_LVALUE_EXPR <");
1090 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1091 pp_character (buffer, '>');
1095 pp_string (buffer, "SAVE_EXPR <");
1096 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1097 pp_character (buffer, '>');
1101 pp_string (buffer, "UNSAVE_EXPR <");
1102 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1103 pp_character (buffer, '>');
1106 case ENTRY_VALUE_EXPR:
1111 pp_string (buffer, "COMPLEX_EXPR <");
1112 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1113 pp_string (buffer, ", ");
1114 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1115 pp_string (buffer, ">");
1119 pp_string (buffer, "CONJ_EXPR <");
1120 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1121 pp_string (buffer, ">");
1125 pp_string (buffer, "REALPART_EXPR <");
1126 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1127 pp_string (buffer, ">");
1131 pp_string (buffer, "IMAGPART_EXPR <");
1132 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1133 pp_string (buffer, ">");
1137 pp_string (buffer, "VA_ARG_EXPR <");
1138 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1139 pp_string (buffer, ">");
1142 case TRY_FINALLY_EXPR:
1143 case TRY_CATCH_EXPR:
1144 pp_string (buffer, "try");
1145 newline_and_indent (buffer, spc+2);
1146 pp_string (buffer, "{");
1147 newline_and_indent (buffer, spc+4);
1148 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc+4, flags, true);
1149 newline_and_indent (buffer, spc+2);
1150 pp_string (buffer, "}");
1151 newline_and_indent (buffer, spc);
1153 (TREE_CODE (node) == TRY_CATCH_EXPR) ? "catch" : "finally");
1154 newline_and_indent (buffer, spc+2);
1155 pp_string (buffer, "{");
1156 newline_and_indent (buffer, spc+4);
1157 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc+4, flags, true);
1158 newline_and_indent (buffer, spc+2);
1159 pp_string (buffer, "}");
1164 pp_string (buffer, "catch (");
1165 dump_generic_node (buffer, CATCH_TYPES (node), spc+2, flags, false);
1166 pp_string (buffer, ")");
1167 newline_and_indent (buffer, spc+2);
1168 pp_string (buffer, "{");
1169 newline_and_indent (buffer, spc+4);
1170 dump_generic_node (buffer, CATCH_BODY (node), spc+4, flags, true);
1171 newline_and_indent (buffer, spc+2);
1172 pp_string (buffer, "}");
1176 case EH_FILTER_EXPR:
1177 pp_string (buffer, "<<<eh_filter (");
1178 dump_generic_node (buffer, EH_FILTER_TYPES (node), spc+2, flags, false);
1179 pp_string (buffer, ")>>>");
1180 newline_and_indent (buffer, spc+2);
1181 pp_string (buffer, "{");
1182 newline_and_indent (buffer, spc+4);
1183 dump_generic_node (buffer, EH_FILTER_FAILURE (node), spc+4, flags, true);
1184 newline_and_indent (buffer, spc+2);
1185 pp_string (buffer, "}");
1190 op0 = TREE_OPERAND (node, 0);
1191 /* If this is for break or continue, don't bother printing it. */
1192 if (DECL_NAME (op0))
1194 const char *name = IDENTIFIER_POINTER (DECL_NAME (op0));
1195 if (strcmp (name, "break") == 0
1196 || strcmp (name, "continue") == 0)
1199 dump_generic_node (buffer, op0, spc, flags, false);
1200 pp_character (buffer, ':');
1201 if (DECL_NONLOCAL (op0))
1202 pp_string (buffer, " [non-local]");
1205 case LABELED_BLOCK_EXPR:
1206 op0 = LABELED_BLOCK_LABEL (node);
1207 /* If this is for break or continue, don't bother printing it. */
1208 if (DECL_NAME (op0))
1210 const char *name = IDENTIFIER_POINTER (DECL_NAME (op0));
1211 if (strcmp (name, "break") == 0
1212 || strcmp (name, "continue") == 0)
1214 dump_generic_node (buffer, LABELED_BLOCK_BODY (node), spc, flags, false);
1218 dump_generic_node (buffer, LABELED_BLOCK_LABEL (node), spc, flags, false);
1219 pp_string (buffer, ": {");
1220 if (!(flags & TDF_SLIM))
1221 newline_and_indent (buffer, spc+2);
1222 dump_generic_node (buffer, LABELED_BLOCK_BODY (node), spc+2, flags, true);
1224 newline_and_indent (buffer, spc);
1225 pp_character (buffer, '}');
1229 case EXIT_BLOCK_EXPR:
1230 op0 = LABELED_BLOCK_LABEL (EXIT_BLOCK_LABELED_BLOCK (node));
1231 /* If this is for a break or continue, print it accordingly. */
1232 if (DECL_NAME (op0))
1234 const char *name = IDENTIFIER_POINTER (DECL_NAME (op0));
1235 if (strcmp (name, "break") == 0
1236 || strcmp (name, "continue") == 0)
1238 pp_string (buffer, name);
1242 pp_string (buffer, "<<<exit block ");
1243 dump_generic_node (buffer, op0, spc, flags, false);
1244 pp_string (buffer, ">>>");
1248 pp_string (buffer, "<<<exception object>>>");
1252 pp_string (buffer, "<<<filter object>>>");
1256 pp_string (buffer, "while (1)");
1257 if (!(flags & TDF_SLIM))
1259 newline_and_indent (buffer, spc+2);
1260 pp_character (buffer, '{');
1261 newline_and_indent (buffer, spc+4);
1262 dump_generic_node (buffer, LOOP_EXPR_BODY (node), spc+4, flags, true);
1263 newline_and_indent (buffer, spc+2);
1264 pp_character (buffer, '}');
1270 pp_string (buffer, "return");
1271 op0 = TREE_OPERAND (node, 0);
1275 if (TREE_CODE (op0) == MODIFY_EXPR)
1276 dump_generic_node (buffer, TREE_OPERAND (op0, 1), spc, flags, false);
1278 dump_generic_node (buffer, op0, spc, flags, false);
1283 pp_string (buffer, "if (");
1284 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1285 pp_string (buffer, ") break");
1289 pp_string (buffer, "switch (");
1290 dump_generic_node (buffer, SWITCH_COND (node), spc, flags, false);
1291 pp_character (buffer, ')');
1292 if (!(flags & TDF_SLIM))
1294 newline_and_indent (buffer, spc+2);
1295 pp_character (buffer, '{');
1296 if (SWITCH_BODY (node))
1298 newline_and_indent (buffer, spc+4);
1299 dump_generic_node (buffer, SWITCH_BODY (node), spc+4, flags, true);
1303 tree vec = SWITCH_LABELS (node);
1304 size_t i, n = TREE_VEC_LENGTH (vec);
1305 for (i = 0; i < n; ++i)
1307 tree elt = TREE_VEC_ELT (vec, i);
1308 newline_and_indent (buffer, spc+4);
1309 dump_generic_node (buffer, elt, spc+4, flags, false);
1310 pp_string (buffer, " goto ");
1311 dump_generic_node (buffer, CASE_LABEL (elt), spc+4, flags, true);
1312 pp_semicolon (buffer);
1315 newline_and_indent (buffer, spc+2);
1316 pp_character (buffer, '}');
1322 op0 = GOTO_DESTINATION (node);
1323 if (TREE_CODE (op0) != SSA_NAME
1327 const char *name = IDENTIFIER_POINTER (DECL_NAME (op0));
1328 if (strcmp (name, "break") == 0
1329 || strcmp (name, "continue") == 0)
1331 pp_string (buffer, name);
1335 pp_string (buffer, "goto ");
1336 dump_generic_node (buffer, op0, spc, flags, false);
1340 pp_string (buffer, "resx");
1341 /* ??? Any sensible way to present the eh region? */
1345 pp_string (buffer, "__asm__");
1346 if (ASM_VOLATILE_P (node))
1347 pp_string (buffer, " __volatile__");
1348 pp_character (buffer, '(');
1349 dump_generic_node (buffer, ASM_STRING (node), spc, flags, false);
1350 pp_character (buffer, ':');
1351 dump_generic_node (buffer, ASM_OUTPUTS (node), spc, flags, false);
1352 pp_character (buffer, ':');
1353 dump_generic_node (buffer, ASM_INPUTS (node), spc, flags, false);
1354 if (ASM_CLOBBERS (node))
1356 pp_character (buffer, ':');
1357 dump_generic_node (buffer, ASM_CLOBBERS (node), spc, flags, false);
1359 pp_string (buffer, ")");
1362 case CASE_LABEL_EXPR:
1363 if (CASE_LOW (node) && CASE_HIGH (node))
1365 pp_string (buffer, "case ");
1366 dump_generic_node (buffer, CASE_LOW (node), spc, flags, false);
1367 pp_string (buffer, " ... ");
1368 dump_generic_node (buffer, CASE_HIGH (node), spc, flags, false);
1370 else if (CASE_LOW (node))
1372 pp_string (buffer, "case ");
1373 dump_generic_node (buffer, CASE_LOW (node), spc, flags, false);
1376 pp_string (buffer, "default ");
1377 pp_character (buffer, ':');
1381 pp_string (buffer, "OBJ_TYPE_REF(");
1382 dump_generic_node (buffer, OBJ_TYPE_REF_EXPR (node), spc, flags, false);
1383 pp_character (buffer, ';');
1384 dump_generic_node (buffer, OBJ_TYPE_REF_OBJECT (node), spc, flags, false);
1385 pp_character (buffer, '-');
1386 pp_character (buffer, '>');
1387 dump_generic_node (buffer, OBJ_TYPE_REF_TOKEN (node), spc, flags, false);
1388 pp_character (buffer, ')');
1395 dump_generic_node (buffer, PHI_RESULT (node), spc, flags, false);
1396 pp_string (buffer, " = PHI <");
1397 for (i = 0; i < PHI_NUM_ARGS (node); i++)
1399 dump_generic_node (buffer, PHI_ARG_DEF (node, i), spc, flags, false);
1400 pp_string (buffer, "(");
1401 pp_decimal_int (buffer, PHI_ARG_EDGE (node, i)->src->index);
1402 pp_string (buffer, ")");
1403 if (i < PHI_NUM_ARGS (node) - 1)
1404 pp_string (buffer, ", ");
1406 pp_string (buffer, ">;");
1411 dump_generic_node (buffer, SSA_NAME_VAR (node), spc, flags, false);
1412 pp_string (buffer, "_");
1413 pp_decimal_int (buffer, SSA_NAME_VERSION (node));
1417 pp_printf (buffer, "VH.%d", VALUE_HANDLE_ID (node));
1421 pp_string (buffer, "scev_known");
1424 case SCEV_NOT_KNOWN:
1425 pp_string (buffer, "scev_not_known");
1428 case POLYNOMIAL_CHREC:
1429 pp_string (buffer, "{");
1430 dump_generic_node (buffer, CHREC_LEFT (node), spc, flags, false);
1431 pp_string (buffer, ", +, ");
1432 dump_generic_node (buffer, CHREC_RIGHT (node), spc, flags, false);
1433 pp_string (buffer, "}_");
1434 dump_generic_node (buffer, CHREC_VAR (node), spc, flags, false);
1442 if (is_stmt && is_expr)
1443 pp_semicolon (buffer);
1444 pp_write_text_to_stream (buffer);
1449 /* Print the declaration of a variable. */
1452 print_declaration (pretty_printer *buffer, tree t, int spc, int flags)
1456 if (TREE_CODE (t) == TYPE_DECL)
1457 pp_string (buffer, "typedef ");
1459 if (DECL_REGISTER (t))
1460 pp_string (buffer, "register ");
1462 if (TREE_PUBLIC (t) && DECL_EXTERNAL (t))
1463 pp_string (buffer, "extern ");
1464 else if (TREE_STATIC (t))
1465 pp_string (buffer, "static ");
1467 /* Print the type and name. */
1468 if (TREE_CODE (TREE_TYPE (t)) == ARRAY_TYPE)
1472 /* Print array's type. */
1473 tmp = TREE_TYPE (t);
1474 while (TREE_CODE (TREE_TYPE (tmp)) == ARRAY_TYPE)
1475 tmp = TREE_TYPE (tmp);
1476 dump_generic_node (buffer, TREE_TYPE (tmp), spc, flags, false);
1478 /* Print variable's name. */
1480 dump_generic_node (buffer, t, spc, flags, false);
1482 /* Print the dimensions. */
1483 tmp = TREE_TYPE (t);
1484 while (TREE_CODE (tmp) == ARRAY_TYPE)
1486 pp_character (buffer, '[');
1487 if (TYPE_DOMAIN (tmp))
1489 if (TREE_CODE (TYPE_SIZE (tmp)) == INTEGER_CST)
1490 pp_wide_integer (buffer,
1491 TREE_INT_CST_LOW (TYPE_SIZE (tmp)) /
1492 TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (tmp))));
1494 dump_generic_node (buffer, TYPE_SIZE_UNIT (tmp), spc, flags,
1497 pp_character (buffer, ']');
1498 tmp = TREE_TYPE (tmp);
1501 else if (TREE_CODE (t) == FUNCTION_DECL)
1503 dump_generic_node (buffer, TREE_TYPE (TREE_TYPE (t)), spc, flags, false);
1505 dump_decl_name (buffer, t, flags);
1506 dump_function_declaration (buffer, TREE_TYPE (t), spc, flags);
1510 /* Print type declaration. */
1511 dump_generic_node (buffer, TREE_TYPE (t), spc, flags, false);
1513 /* Print variable's name. */
1515 dump_generic_node (buffer, t, spc, flags, false);
1518 /* The initial value of a function serves to determine wether the function
1519 is declared or defined. So the following does not apply to function
1521 if (TREE_CODE (t) != FUNCTION_DECL)
1523 /* Print the initial value. */
1524 if (DECL_INITIAL (t))
1527 pp_character (buffer, '=');
1529 dump_generic_node (buffer, DECL_INITIAL (t), spc, flags, false);
1533 pp_character (buffer, ';');
1537 /* Prints a structure: name, fields, and methods.
1538 FIXME: Still incomplete. */
1541 print_struct_decl (pretty_printer *buffer, tree node, int spc, int flags)
1543 /* Print the name of the structure. */
1544 if (TYPE_NAME (node))
1547 if (TREE_CODE (node) == RECORD_TYPE)
1548 pp_string (buffer, "struct ");
1549 else if ((TREE_CODE (node) == UNION_TYPE
1550 || TREE_CODE (node) == QUAL_UNION_TYPE))
1551 pp_string (buffer, "union ");
1553 dump_generic_node (buffer, TYPE_NAME (node), spc, 0, false);
1556 /* Print the contents of the structure. */
1557 pp_newline (buffer);
1559 pp_character (buffer, '{');
1560 pp_newline (buffer);
1562 /* Print the fields of the structure. */
1565 tmp = TYPE_FIELDS (node);
1568 /* Avoid to print recursively the structure. */
1569 /* FIXME : Not implemented correctly...,
1570 what about the case when we have a cycle in the contain graph? ...
1571 Maybe this could be solved by looking at the scope in which the
1572 structure was declared. */
1573 if (TREE_TYPE (tmp) != node
1574 || (TREE_CODE (TREE_TYPE (tmp)) == POINTER_TYPE
1575 && TREE_TYPE (TREE_TYPE (tmp)) != node))
1577 print_declaration (buffer, tmp, spc+2, flags);
1578 pp_newline (buffer);
1580 tmp = TREE_CHAIN (tmp);
1584 pp_character (buffer, '}');
1587 /* Return the priority of the operator OP.
1589 From lowest to highest precedence with either left-to-right (L-R)
1590 or right-to-left (R-L) associativity]:
1593 2 [R-L] = += -= *= /= %= &= ^= |= <<= >>=
1605 14 [R-L] ! ~ ++ -- + - * & (type) sizeof
1606 15 [L-R] fn() [] -> .
1608 unary +, - and * have higher precedence than the corresponding binary
1617 switch (TREE_CODE (op))
1632 case TRUTH_ORIF_EXPR:
1635 case TRUTH_AND_EXPR:
1636 case TRUTH_ANDIF_EXPR:
1643 case TRUTH_XOR_EXPR:
1660 case UNORDERED_EXPR:
1678 case TRUNC_DIV_EXPR:
1680 case FLOOR_DIV_EXPR:
1681 case ROUND_DIV_EXPR:
1683 case EXACT_DIV_EXPR:
1684 case TRUNC_MOD_EXPR:
1686 case FLOOR_MOD_EXPR:
1687 case ROUND_MOD_EXPR:
1690 case TRUTH_NOT_EXPR:
1692 case POSTINCREMENT_EXPR:
1693 case POSTDECREMENT_EXPR:
1694 case PREINCREMENT_EXPR:
1695 case PREDECREMENT_EXPR:
1702 case FIX_TRUNC_EXPR:
1704 case FIX_FLOOR_EXPR:
1705 case FIX_ROUND_EXPR:
1711 case ARRAY_RANGE_REF:
1715 /* Special expressions. */
1724 case NON_LVALUE_EXPR:
1725 return op_prio (TREE_OPERAND (op, 0));
1728 /* Return an arbitrarily high precedence to avoid surrounding single
1729 VAR_DECLs in ()s. */
1735 /* Return the symbol associated with operator OP. */
1743 switch (TREE_CODE (op))
1749 case TRUTH_ORIF_EXPR:
1752 case TRUTH_AND_EXPR:
1753 case TRUTH_ANDIF_EXPR:
1759 case TRUTH_XOR_EXPR:
1769 case UNORDERED_EXPR:
1819 case TRUTH_NOT_EXPR:
1826 case TRUNC_DIV_EXPR:
1828 case FLOOR_DIV_EXPR:
1829 case ROUND_DIV_EXPR:
1831 case EXACT_DIV_EXPR:
1834 case TRUNC_MOD_EXPR:
1836 case FLOOR_MOD_EXPR:
1837 case ROUND_MOD_EXPR:
1840 case PREDECREMENT_EXPR:
1843 case PREINCREMENT_EXPR:
1846 case POSTDECREMENT_EXPR:
1849 case POSTINCREMENT_EXPR:
1853 return "<<< ??? >>>";
1857 /* Prints the name of a CALL_EXPR. */
1860 print_call_name (pretty_printer *buffer, tree node)
1864 if (TREE_CODE (node) != CALL_EXPR)
1867 op0 = TREE_OPERAND (node, 0);
1869 if (TREE_CODE (op0) == NON_LVALUE_EXPR)
1870 op0 = TREE_OPERAND (op0, 0);
1872 switch (TREE_CODE (op0))
1876 PRINT_FUNCTION_NAME (op0);
1882 dump_generic_node (buffer, TREE_OPERAND (op0, 0), 0, 0, false);
1886 pp_string (buffer, "(");
1887 dump_generic_node (buffer, TREE_OPERAND (op0, 0), 0, 0, false);
1888 pp_string (buffer, ") ? ");
1889 dump_generic_node (buffer, TREE_OPERAND (op0, 1), 0, 0, false);
1890 pp_string (buffer, " : ");
1891 dump_generic_node (buffer, TREE_OPERAND (op0, 2), 0, 0, false);
1895 /* The function is a pointer contained in a structure. */
1896 if (TREE_CODE (TREE_OPERAND (op0, 0)) == INDIRECT_REF ||
1897 TREE_CODE (TREE_OPERAND (op0, 0)) == VAR_DECL)
1898 PRINT_FUNCTION_NAME (TREE_OPERAND (op0, 1));
1900 dump_generic_node (buffer, TREE_OPERAND (op0, 0), 0, 0, false);
1902 We can have several levels of structures and a function
1903 pointer inside. This is not implemented yet... */
1908 if (TREE_CODE (TREE_OPERAND (op0, 0)) == VAR_DECL)
1909 PRINT_FUNCTION_NAME (TREE_OPERAND (op0, 0));
1911 dump_generic_node (buffer, op0, 0, 0, false);
1916 dump_generic_node (buffer, op0, 0, 0, false);
1924 /* Parses the string STR and replaces new-lines by '\n', tabs by '\t', ... */
1927 pretty_print_string (pretty_printer *buffer, const char *str)
1937 pp_string (buffer, "\\b");
1941 pp_string (buffer, "\\f");
1945 pp_string (buffer, "\\n");
1949 pp_string (buffer, "\\r");
1953 pp_string (buffer, "\\t");
1957 pp_string (buffer, "\\v");
1961 pp_string (buffer, "\\\\");
1965 pp_string (buffer, "\\\"");
1969 pp_string (buffer, "\\'");
1973 pp_string (buffer, "\\0");
1977 pp_string (buffer, "\\1");
1981 pp_string (buffer, "\\2");
1985 pp_string (buffer, "\\3");
1989 pp_string (buffer, "\\4");
1993 pp_string (buffer, "\\5");
1997 pp_string (buffer, "\\6");
2001 pp_string (buffer, "\\7");
2005 pp_character (buffer, str[0]);
2013 maybe_init_pretty_print (FILE *file)
2017 pp_construct (&buffer, /* prefix */NULL, /* line-width */0);
2018 pp_needs_newline (&buffer) = true;
2022 buffer.buffer->stream = file;
2026 newline_and_indent (pretty_printer *buffer, int spc)
2028 pp_newline (buffer);
2033 dump_vops (pretty_printer *buffer, tree stmt, int spc, int flags)
2036 stmt_ann_t ann = stmt_ann (stmt);
2037 v_may_def_optype v_may_defs = V_MAY_DEF_OPS (ann);
2038 v_must_def_optype v_must_defs = V_MUST_DEF_OPS (ann);
2039 vuse_optype vuses = VUSE_OPS (ann);
2041 for (i = 0; i < NUM_V_MAY_DEFS (v_may_defs); i++)
2043 pp_string (buffer, "# ");
2044 dump_generic_node (buffer, V_MAY_DEF_RESULT (v_may_defs, i),
2045 spc + 2, flags, false);
2046 pp_string (buffer, " = V_MAY_DEF <");
2047 dump_generic_node (buffer, V_MAY_DEF_OP (v_may_defs, i),
2048 spc + 2, flags, false);
2049 pp_string (buffer, ">;");
2050 newline_and_indent (buffer, spc);
2053 for (i = 0; i < NUM_V_MUST_DEFS (v_must_defs); i++)
2055 tree v_must_def = V_MUST_DEF_OP (v_must_defs, i);
2056 pp_string (buffer, "# V_MUST_DEF <");
2057 dump_generic_node (buffer, v_must_def, spc + 2, flags, false);
2058 pp_string (buffer, ">;");
2059 newline_and_indent (buffer, spc);
2062 for (i = 0; i < NUM_VUSES (vuses); i++)
2064 tree vuse = VUSE_OP (vuses, i);
2065 pp_string (buffer, "# VUSE <");
2066 dump_generic_node (buffer, vuse, spc + 2, flags, false);
2067 pp_string (buffer, ">;");
2068 newline_and_indent (buffer, spc);
2072 /* Dumps basic block BB to FILE with details described by FLAGS and
2073 indented by INDENT spaces. */
2076 dump_generic_bb (FILE *file, basic_block bb, int indent, int flags)
2078 maybe_init_pretty_print (file);
2079 dumping_stmts = true;
2080 dump_generic_bb_buff (&buffer, bb, indent, flags);
2084 /* Dumps header of basic block BB to buffer BUFFER indented by INDENT
2085 spaces and details described by flags. */
2088 dump_bb_header (pretty_printer *buffer, basic_block bb, int indent, int flags)
2093 if (flags & TDF_BLOCKS)
2096 pp_string (buffer, "# BLOCK ");
2097 pp_decimal_int (buffer, bb->index);
2099 if (flags & TDF_LINENO)
2101 block_stmt_iterator bsi;
2103 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
2104 if (get_lineno (bsi_stmt (bsi)) != -1)
2106 pp_string (buffer, ", starting at line ");
2107 pp_decimal_int (buffer, get_lineno (bsi_stmt (bsi)));
2111 newline_and_indent (buffer, indent);
2113 pp_string (buffer, "# PRED:");
2114 pp_write_text_to_stream (buffer);
2115 for (e = bb->pred; e; e = e->pred_next)
2116 if (flags & TDF_SLIM)
2118 pp_string (buffer, " ");
2119 if (e->src == ENTRY_BLOCK_PTR)
2120 pp_string (buffer, "ENTRY");
2122 pp_decimal_int (buffer, e->src->index);
2125 dump_edge_info (buffer->buffer->stream, e, 0);
2126 pp_newline (buffer);
2130 stmt = first_stmt (bb);
2131 if (!stmt || TREE_CODE (stmt) != LABEL_EXPR)
2133 INDENT (indent - 2);
2134 pp_string (buffer, "<bb ");
2135 pp_decimal_int (buffer, bb->index);
2136 pp_string (buffer, ">:");
2137 pp_newline (buffer);
2142 /* Dumps end of basic block BB to buffer BUFFER indented by INDENT
2146 dump_bb_end (pretty_printer *buffer, basic_block bb, int indent, int flags)
2151 pp_string (buffer, "# SUCC:");
2152 pp_write_text_to_stream (buffer);
2153 for (e = bb->succ; e; e = e->succ_next)
2154 if (flags & TDF_SLIM)
2156 pp_string (buffer, " ");
2157 if (e->dest == EXIT_BLOCK_PTR)
2158 pp_string (buffer, "EXIT");
2160 pp_decimal_int (buffer, e->dest->index);
2163 dump_edge_info (buffer->buffer->stream, e, 1);
2164 pp_newline (buffer);
2167 /* Dumps phi nodes of basic block BB to buffer BUFFER with details described by
2168 FLAGS indented by INDENT spaces. */
2171 dump_phi_nodes (pretty_printer *buffer, basic_block bb, int indent, int flags)
2173 tree phi = phi_nodes (bb);
2177 for (; phi; phi = PHI_CHAIN (phi))
2179 if (is_gimple_reg (PHI_RESULT (phi)) || (flags & TDF_VOPS))
2182 pp_string (buffer, "# ");
2183 dump_generic_node (buffer, phi, indent, flags, false);
2184 pp_newline (buffer);
2189 /* Dump jump to basic block BB that is represented implicitly in the cfg
2193 pp_cfg_jump (pretty_printer *buffer, basic_block bb)
2197 stmt = first_stmt (bb);
2199 pp_string (buffer, "goto <bb ");
2200 pp_decimal_int (buffer, bb->index);
2201 pp_string (buffer, ">");
2202 if (stmt && TREE_CODE (stmt) == LABEL_EXPR)
2204 pp_string (buffer, " (");
2205 dump_generic_node (buffer, LABEL_EXPR_LABEL (stmt), 0, 0, false);
2206 pp_string (buffer, ")");
2208 pp_semicolon (buffer);
2211 /* Dump edges represented implicitly in basic block BB to BUFFER, indented
2212 by INDENT spaces, with details given by FLAGS. */
2215 dump_implicit_edges (pretty_printer *buffer, basic_block bb, int indent,
2220 /* If there is a fallthru edge, we may need to add an artificial goto to the
2222 for (e = bb->succ; e; e = e->succ_next)
2223 if (e->flags & EDGE_FALLTHRU)
2225 if (e && e->dest != bb->next_bb)
2229 if ((flags & TDF_LINENO)
2230 #ifdef USE_MAPPED_LOCATION
2231 && e->goto_locus != UNKNOWN_LOCATION
2237 expanded_location goto_xloc;
2238 #ifdef USE_MAPPED_LOCATION
2239 goto_xloc = expand_location (e->goto_locus);
2241 goto_xloc = *e->goto_locus;
2243 pp_character (buffer, '[');
2246 pp_string (buffer, goto_xloc.file);
2247 pp_string (buffer, " : ");
2249 pp_decimal_int (buffer, goto_xloc.line);
2250 pp_string (buffer, "] ");
2253 pp_cfg_jump (buffer, e->dest);
2254 pp_newline (buffer);
2258 /* Dumps basic block BB to buffer BUFFER with details described by FLAGS and
2259 indented by INDENT spaces. */
2262 dump_generic_bb_buff (pretty_printer *buffer, basic_block bb,
2263 int indent, int flags)
2265 block_stmt_iterator bsi;
2267 int label_indent = indent - 2;
2269 if (label_indent < 0)
2272 dump_bb_header (buffer, bb, indent, flags);
2275 dump_phi_nodes (buffer, bb, indent, flags);
2277 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
2281 stmt = bsi_stmt (bsi);
2283 curr_indent = TREE_CODE (stmt) == LABEL_EXPR ? label_indent : indent;
2285 INDENT (curr_indent);
2286 dump_generic_node (buffer, stmt, curr_indent, flags, true);
2287 pp_newline (buffer);
2290 dump_implicit_edges (buffer, bb, indent, flags);
2292 if (flags & TDF_BLOCKS)
2293 dump_bb_end (buffer, bb, indent, flags);