1 /* Pretty formatting of GENERIC trees in C syntax.
2 Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
3 Free Software Foundation, Inc.
4 Adapted from c-pretty-print.c by Diego Novillo <dnovillo@redhat.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 3, 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 COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
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"
35 #include "tree-pass.h"
36 #include "fixed-value.h"
37 #include "value-prof.h"
40 /* Local functions, macros and variables. */
41 static int op_prio (const_tree);
42 static const char *op_symbol (const_tree);
43 static void pretty_print_string (pretty_printer *, const char*);
44 static void print_call_name (pretty_printer *, const_tree);
45 static void newline_and_indent (pretty_printer *, int);
46 static void maybe_init_pretty_print (FILE *);
47 static void print_declaration (pretty_printer *, tree, int, int);
48 static void print_struct_decl (pretty_printer *, const_tree, int, int);
49 static void do_niy (pretty_printer *, const_tree);
50 static void dump_vops (pretty_printer *, tree, int, int);
51 static void dump_generic_bb_buff (pretty_printer *, basic_block, int, int);
53 #define INDENT(SPACE) do { \
54 int i; for (i = 0; i<SPACE; i++) pp_space (buffer); } while (0)
56 #define NIY do_niy(buffer,node)
58 #define PRINT_FUNCTION_NAME(NODE) pp_printf \
59 (buffer, "%s", TREE_CODE (NODE) == NOP_EXPR ? \
60 lang_hooks.decl_printable_name (TREE_OPERAND (NODE, 0), 1) : \
61 lang_hooks.decl_printable_name (NODE, 1))
63 static pretty_printer buffer;
64 static int initialized = 0;
66 /* Try to print something for an unknown tree code. */
69 do_niy (pretty_printer *buffer, const_tree node)
73 pp_string (buffer, "<<< Unknown tree: ");
74 pp_string (buffer, tree_code_name[(int) TREE_CODE (node)]);
78 len = TREE_OPERAND_LENGTH (node);
79 for (i = 0; i < len; ++i)
81 newline_and_indent (buffer, 2);
82 dump_generic_node (buffer, TREE_OPERAND (node, i), 2, 0, false);
86 pp_string (buffer, " >>>\n");
89 /* Debugging function to print out a generic expression. */
92 debug_generic_expr (tree t)
94 print_generic_expr (stderr, t, TDF_VOPS|TDF_MEMSYMS);
95 fprintf (stderr, "\n");
98 /* Debugging function to print out a generic statement. */
101 debug_generic_stmt (tree t)
103 print_generic_stmt (stderr, t, TDF_VOPS|TDF_MEMSYMS);
104 fprintf (stderr, "\n");
107 /* Debugging function to print out a chain of trees . */
110 debug_tree_chain (tree t)
114 print_generic_expr (stderr, t, TDF_VOPS|TDF_MEMSYMS|TDF_UID);
115 fprintf(stderr, " ");
118 fprintf (stderr, "\n");
121 /* Prints declaration DECL to the FILE with details specified by FLAGS. */
123 print_generic_decl (FILE *file, tree decl, int flags)
125 maybe_init_pretty_print (file);
126 print_declaration (&buffer, decl, 2, flags);
127 pp_write_text_to_stream (&buffer);
130 /* Print tree T, and its successors, on file FILE. FLAGS specifies details
131 to show in the dump. See TDF_* in tree-pass.h. */
134 print_generic_stmt (FILE *file, tree t, int flags)
136 maybe_init_pretty_print (file);
137 dump_generic_node (&buffer, t, 0, flags, true);
141 /* Print tree T, and its successors, on file FILE. FLAGS specifies details
142 to show in the dump. See TDF_* in tree-pass.h. The output is indented by
146 print_generic_stmt_indented (FILE *file, tree t, int flags, int indent)
150 maybe_init_pretty_print (file);
152 for (i = 0; i < indent; i++)
154 dump_generic_node (&buffer, t, indent, flags, true);
158 /* Print a single expression T on file FILE. FLAGS specifies details to show
159 in the dump. See TDF_* in tree-pass.h. */
162 print_generic_expr (FILE *file, tree t, int flags)
164 maybe_init_pretty_print (file);
165 dump_generic_node (&buffer, t, 0, flags, false);
168 /* Dump the name of a _DECL node and its DECL_UID if TDF_UID is set
172 dump_decl_name (pretty_printer *buffer, tree node, int flags)
177 pp_tree_identifier (buffer, DECL_NAME (t));
178 if ((flags & TDF_UID)
179 || DECL_NAME (t) == NULL_TREE)
181 if (TREE_CODE (t) == LABEL_DECL
182 && LABEL_DECL_UID (t) != -1)
183 pp_printf (buffer, "L.%d", (int) LABEL_DECL_UID (t));
186 char c = TREE_CODE (t) == CONST_DECL ? 'C' : 'D';
187 pp_printf (buffer, "%c.%u", c, DECL_UID (t));
192 /* Like the above, but used for pretty printing function calls. */
195 dump_function_name (pretty_printer *buffer, tree node)
197 if (DECL_NAME (node))
198 PRINT_FUNCTION_NAME (node);
200 dump_decl_name (buffer, node, 0);
203 /* Dump a function declaration. NODE is the FUNCTION_TYPE. BUFFER, SPC and
204 FLAGS are as in dump_generic_node. */
207 dump_function_declaration (pretty_printer *buffer, tree node,
210 bool wrote_arg = false;
214 pp_character (buffer, '(');
216 /* Print the argument types. The last element in the list is a VOID_TYPE.
217 The following avoids printing the last element. */
218 arg = TYPE_ARG_TYPES (node);
219 while (arg && TREE_CHAIN (arg) && arg != error_mark_node)
222 dump_generic_node (buffer, TREE_VALUE (arg), spc, flags, false);
223 arg = TREE_CHAIN (arg);
224 if (TREE_CHAIN (arg) && TREE_CODE (TREE_CHAIN (arg)) == TREE_LIST)
226 pp_character (buffer, ',');
232 pp_string (buffer, "void");
234 pp_character (buffer, ')');
237 /* Dump the domain associated with an array. */
240 dump_array_domain (pretty_printer *buffer, tree domain, int spc, int flags)
242 pp_character (buffer, '[');
245 tree min = TYPE_MIN_VALUE (domain);
246 tree max = TYPE_MAX_VALUE (domain);
249 && integer_zerop (min)
250 && host_integerp (max, 0))
251 pp_wide_integer (buffer, TREE_INT_CST_LOW (max) + 1);
255 dump_generic_node (buffer, min, spc, flags, false);
256 pp_character (buffer, ':');
258 dump_generic_node (buffer, max, spc, flags, false);
262 pp_string (buffer, "<unknown>");
263 pp_character (buffer, ']');
267 /* Dump OpenMP clause CLAUSE. BUFFER, CLAUSE, SPC and FLAGS are as in
268 dump_generic_node. */
271 dump_omp_clause (pretty_printer *buffer, tree clause, int spc, int flags)
275 switch (OMP_CLAUSE_CODE (clause))
277 case OMP_CLAUSE_PRIVATE:
280 case OMP_CLAUSE_SHARED:
283 case OMP_CLAUSE_FIRSTPRIVATE:
284 name = "firstprivate";
286 case OMP_CLAUSE_LASTPRIVATE:
287 name = "lastprivate";
289 case OMP_CLAUSE_COPYIN:
292 case OMP_CLAUSE_COPYPRIVATE:
293 name = "copyprivate";
296 pp_string (buffer, name);
297 pp_character (buffer, '(');
298 dump_generic_node (buffer, OMP_CLAUSE_DECL (clause),
300 pp_character (buffer, ')');
303 case OMP_CLAUSE_REDUCTION:
304 pp_string (buffer, "reduction(");
305 pp_string (buffer, op_symbol_code (OMP_CLAUSE_REDUCTION_CODE (clause)));
306 pp_character (buffer, ':');
307 dump_generic_node (buffer, OMP_CLAUSE_DECL (clause),
309 pp_character (buffer, ')');
313 pp_string (buffer, "if(");
314 dump_generic_node (buffer, OMP_CLAUSE_IF_EXPR (clause),
316 pp_character (buffer, ')');
319 case OMP_CLAUSE_NUM_THREADS:
320 pp_string (buffer, "num_threads(");
321 dump_generic_node (buffer, OMP_CLAUSE_NUM_THREADS_EXPR (clause),
323 pp_character (buffer, ')');
326 case OMP_CLAUSE_NOWAIT:
327 pp_string (buffer, "nowait");
329 case OMP_CLAUSE_ORDERED:
330 pp_string (buffer, "ordered");
333 case OMP_CLAUSE_DEFAULT:
334 pp_string (buffer, "default(");
335 switch (OMP_CLAUSE_DEFAULT_KIND (clause))
337 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
339 case OMP_CLAUSE_DEFAULT_SHARED:
340 pp_string (buffer, "shared");
342 case OMP_CLAUSE_DEFAULT_NONE:
343 pp_string (buffer, "none");
345 case OMP_CLAUSE_DEFAULT_PRIVATE:
346 pp_string (buffer, "private");
351 pp_character (buffer, ')');
354 case OMP_CLAUSE_SCHEDULE:
355 pp_string (buffer, "schedule(");
356 switch (OMP_CLAUSE_SCHEDULE_KIND (clause))
358 case OMP_CLAUSE_SCHEDULE_STATIC:
359 pp_string (buffer, "static");
361 case OMP_CLAUSE_SCHEDULE_DYNAMIC:
362 pp_string (buffer, "dynamic");
364 case OMP_CLAUSE_SCHEDULE_GUIDED:
365 pp_string (buffer, "guided");
367 case OMP_CLAUSE_SCHEDULE_RUNTIME:
368 pp_string (buffer, "runtime");
373 if (OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (clause))
375 pp_character (buffer, ',');
376 dump_generic_node (buffer,
377 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (clause),
380 pp_character (buffer, ')');
384 /* Should never happen. */
385 dump_generic_node (buffer, clause, spc, flags, false);
391 /* Dump the list of OpenMP clauses. BUFFER, SPC and FLAGS are as in
392 dump_generic_node. */
395 dump_omp_clauses (pretty_printer *buffer, tree clause, int spc, int flags)
403 dump_omp_clause (buffer, clause, spc, flags);
404 clause = OMP_CLAUSE_CHAIN (clause);
412 /* Dump the set of decls SYMS. BUFFER, SPC and FLAGS are as in
413 dump_generic_node. */
416 dump_symbols (pretty_printer *buffer, bitmap syms, int flags)
422 pp_string (buffer, "NIL");
425 pp_string (buffer, " { ");
427 EXECUTE_IF_SET_IN_BITMAP (syms, 0, i, bi)
429 tree sym = referenced_var_lookup (i);
430 dump_generic_node (buffer, sym, 0, flags, false);
431 pp_string (buffer, " ");
434 pp_string (buffer, "}");
439 /* Dump the node NODE on the pretty_printer BUFFER, SPC spaces of indent.
440 FLAGS specifies details to show in the dump (see TDF_* in tree-pass.h).
441 If IS_STMT is true, the object printed is considered to be a statement
442 and it is terminated by ';' if appropriate. */
445 dump_generic_node (pretty_printer *buffer, tree node, int spc, int flags,
453 if (node == NULL_TREE)
456 is_expr = EXPR_P (node) || GIMPLE_STMT_P (node);
458 /* We use has_stmt_ann because CALL_EXPR can be both an expression
459 and a statement, and we have no guarantee that it will have a
460 stmt_ann when it is used as an RHS expression. stmt_ann will assert
461 if you call it on something with a non-stmt annotation attached. */
462 if (TREE_CODE (node) != ERROR_MARK
463 && is_gimple_stmt (node)
464 && (flags & (TDF_VOPS|TDF_MEMSYMS))
465 && has_stmt_ann (node)
466 && TREE_CODE (node) != PHI_NODE)
467 dump_vops (buffer, node, spc, flags);
469 if (is_stmt && (flags & TDF_STMTADDR))
470 pp_printf (buffer, "<&%p> ", (void *)node);
472 if ((flags & TDF_LINENO) && EXPR_HAS_LOCATION (node))
474 expanded_location xloc = expand_location (EXPR_LOCATION (node));
475 pp_character (buffer, '[');
478 pp_string (buffer, xloc.file);
479 pp_string (buffer, " : ");
481 pp_decimal_int (buffer, xloc.line);
482 pp_string (buffer, "] ");
485 switch (TREE_CODE (node))
488 pp_string (buffer, "<<< error >>>");
491 case IDENTIFIER_NODE:
492 pp_tree_identifier (buffer, node);
496 while (node && node != error_mark_node)
498 if (TREE_PURPOSE (node))
500 dump_generic_node (buffer, TREE_PURPOSE (node), spc, flags, false);
503 dump_generic_node (buffer, TREE_VALUE (node), spc, flags, false);
504 node = TREE_CHAIN (node);
505 if (node && TREE_CODE (node) == TREE_LIST)
507 pp_character (buffer, ',');
514 dump_generic_node (buffer, BINFO_TYPE (node), spc, flags, false);
519 if (TREE_VEC_LENGTH (node) > 0)
521 size_t len = TREE_VEC_LENGTH (node);
522 for (i = 0; i < len - 1; i++)
524 dump_generic_node (buffer, TREE_VEC_ELT (node, i), spc, flags,
526 pp_character (buffer, ',');
529 dump_generic_node (buffer, TREE_VEC_ELT (node, len - 1), spc,
538 case FIXED_POINT_TYPE:
544 unsigned int quals = TYPE_QUALS (node);
545 enum tree_code_class class;
547 if (quals & TYPE_QUAL_CONST)
548 pp_string (buffer, "const ");
549 else if (quals & TYPE_QUAL_VOLATILE)
550 pp_string (buffer, "volatile ");
551 else if (quals & TYPE_QUAL_RESTRICT)
552 pp_string (buffer, "restrict ");
554 class = TREE_CODE_CLASS (TREE_CODE (node));
556 if (class == tcc_declaration)
558 if (DECL_NAME (node))
559 dump_decl_name (buffer, node, flags);
561 pp_string (buffer, "<unnamed type decl>");
563 else if (class == tcc_type)
565 if (TYPE_NAME (node))
567 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
568 pp_tree_identifier (buffer, TYPE_NAME (node));
569 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
570 && DECL_NAME (TYPE_NAME (node)))
571 dump_decl_name (buffer, TYPE_NAME (node), flags);
573 pp_string (buffer, "<unnamed type>");
575 else if (TREE_CODE (node) == VECTOR_TYPE)
577 pp_string (buffer, "vector ");
578 dump_generic_node (buffer, TREE_TYPE (node),
581 else if (TREE_CODE (node) == INTEGER_TYPE)
583 pp_string (buffer, (TYPE_UNSIGNED (node)
584 ? "<unnamed-unsigned:"
585 : "<unnamed-signed:"));
586 pp_decimal_int (buffer, TYPE_PRECISION (node));
587 pp_string (buffer, ">");
590 pp_string (buffer, "<unnamed type>");
597 str = (TREE_CODE (node) == POINTER_TYPE ? "*" : "&");
599 if (TREE_CODE (TREE_TYPE (node)) == FUNCTION_TYPE)
601 tree fnode = TREE_TYPE (node);
603 dump_generic_node (buffer, TREE_TYPE (fnode), spc, flags, false);
605 pp_character (buffer, '(');
606 pp_string (buffer, str);
607 if (TYPE_NAME (node) && DECL_NAME (TYPE_NAME (node)))
608 dump_decl_name (buffer, TYPE_NAME (node), flags);
610 pp_printf (buffer, "<T%x>", TYPE_UID (node));
612 pp_character (buffer, ')');
613 dump_function_declaration (buffer, fnode, spc, flags);
617 unsigned int quals = TYPE_QUALS (node);
619 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
621 pp_string (buffer, str);
623 if (quals & TYPE_QUAL_CONST)
624 pp_string (buffer, " const");
625 if (quals & TYPE_QUAL_VOLATILE)
626 pp_string (buffer, " volatile");
627 if (quals & TYPE_QUAL_RESTRICT)
628 pp_string (buffer, " restrict");
630 if (TYPE_REF_CAN_ALIAS_ALL (node))
631 pp_string (buffer, " {ref-all}");
640 dump_decl_name (buffer, TYPE_NAME (TYPE_METHOD_BASETYPE (node)), flags);
641 pp_string (buffer, "::");
646 const char *sep = "";
649 pp_string (buffer, "MEM[");
651 tmp = TMR_SYMBOL (node);
654 pp_string (buffer, sep);
656 pp_string (buffer, "symbol: ");
657 dump_generic_node (buffer, tmp, spc, flags, false);
659 tmp = TMR_BASE (node);
662 pp_string (buffer, sep);
664 pp_string (buffer, "base: ");
665 dump_generic_node (buffer, tmp, spc, flags, false);
667 tmp = TMR_INDEX (node);
670 pp_string (buffer, sep);
672 pp_string (buffer, "index: ");
673 dump_generic_node (buffer, tmp, spc, flags, false);
675 tmp = TMR_STEP (node);
678 pp_string (buffer, sep);
680 pp_string (buffer, "step: ");
681 dump_generic_node (buffer, tmp, spc, flags, false);
683 tmp = TMR_OFFSET (node);
686 pp_string (buffer, sep);
688 pp_string (buffer, "offset: ");
689 dump_generic_node (buffer, tmp, spc, flags, false);
691 pp_string (buffer, "]");
692 if (flags & TDF_DETAILS)
694 pp_string (buffer, "{");
695 dump_generic_node (buffer, TMR_ORIGINAL (node), spc, flags,
697 pp_string (buffer, "}");
706 /* Print the innermost component type. */
707 for (tmp = TREE_TYPE (node); TREE_CODE (tmp) == ARRAY_TYPE;
708 tmp = TREE_TYPE (tmp))
710 dump_generic_node (buffer, tmp, spc, flags, false);
712 /* Print the dimensions. */
713 for (tmp = node; TREE_CODE (tmp) == ARRAY_TYPE; tmp = TREE_TYPE (tmp))
714 dump_array_domain (buffer, TYPE_DOMAIN (tmp), spc, flags);
720 case QUAL_UNION_TYPE:
722 unsigned int quals = TYPE_QUALS (node);
724 if (quals & TYPE_QUAL_CONST)
725 pp_string (buffer, "const ");
726 if (quals & TYPE_QUAL_VOLATILE)
727 pp_string (buffer, "volatile ");
729 /* Print the name of the structure. */
730 if (TREE_CODE (node) == RECORD_TYPE)
731 pp_string (buffer, "struct ");
732 else if (TREE_CODE (node) == UNION_TYPE)
733 pp_string (buffer, "union ");
735 if (TYPE_NAME (node))
736 dump_generic_node (buffer, TYPE_NAME (node), spc, flags, false);
738 print_struct_decl (buffer, node, spc, flags);
747 if (TREE_CODE (TREE_TYPE (node)) == POINTER_TYPE)
749 /* In the case of a pointer, one may want to divide by the
750 size of the pointed-to type. Unfortunately, this not
751 straightforward. The C front-end maps expressions
756 in such a way that the two INTEGER_CST nodes for "5" have
757 different values but identical types. In the latter
758 case, the 5 is multiplied by sizeof (int) in c-common.c
759 (pointer_int_sum) to convert it to a byte address, and
760 yet the type of the node is left unchanged. Argh. What
761 is consistent though is that the number value corresponds
762 to bytes (UNITS) offset.
764 NB: Neither of the following divisors can be trivially
765 used to recover the original literal:
767 TREE_INT_CST_LOW (TYPE_SIZE_UNIT (TREE_TYPE (node)))
768 TYPE_PRECISION (TREE_TYPE (TREE_TYPE (node))) */
769 pp_wide_integer (buffer, TREE_INT_CST_LOW (node));
770 pp_string (buffer, "B"); /* pseudo-unit */
772 else if (! host_integerp (node, 0))
775 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (val);
776 HOST_WIDE_INT high = TREE_INT_CST_HIGH (val);
778 if (tree_int_cst_sgn (val) < 0)
780 pp_character (buffer, '-');
784 /* Would "%x%0*x" or "%x%*0x" get zero-padding on all
786 sprintf (pp_buffer (buffer)->digit_buffer,
787 HOST_WIDE_INT_PRINT_DOUBLE_HEX,
788 (unsigned HOST_WIDE_INT) high, low);
789 pp_string (buffer, pp_buffer (buffer)->digit_buffer);
792 pp_wide_integer (buffer, TREE_INT_CST_LOW (node));
796 /* Code copied from print_node. */
799 if (TREE_OVERFLOW (node))
800 pp_string (buffer, " overflow");
802 #if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
803 d = TREE_REAL_CST (node);
804 if (REAL_VALUE_ISINF (d))
805 pp_string (buffer, REAL_VALUE_NEGATIVE (d) ? " -Inf" : " Inf");
806 else if (REAL_VALUE_ISNAN (d))
807 pp_string (buffer, " Nan");
811 real_to_decimal (string, &d, sizeof (string), 0, 1);
812 pp_string (buffer, string);
817 unsigned char *p = (unsigned char *) &TREE_REAL_CST (node);
818 pp_string (buffer, "0x");
819 for (i = 0; i < sizeof TREE_REAL_CST (node); i++)
820 output_formatted_integer (buffer, "%02x", *p++);
829 fixed_to_decimal (string, TREE_FIXED_CST_PTR (node), sizeof (string));
830 pp_string (buffer, string);
835 pp_string (buffer, "__complex__ (");
836 dump_generic_node (buffer, TREE_REALPART (node), spc, flags, false);
837 pp_string (buffer, ", ");
838 dump_generic_node (buffer, TREE_IMAGPART (node), spc, flags, false);
839 pp_string (buffer, ")");
843 pp_string (buffer, "\"");
844 pretty_print_string (buffer, TREE_STRING_POINTER (node));
845 pp_string (buffer, "\"");
851 pp_string (buffer, "{ ");
852 for (elt = TREE_VECTOR_CST_ELTS (node); elt; elt = TREE_CHAIN (elt))
854 dump_generic_node (buffer, TREE_VALUE (elt), spc, flags, false);
855 if (TREE_CHAIN (elt))
856 pp_string (buffer, ", ");
858 pp_string (buffer, " }");
867 dump_decl_name (buffer, node, flags);
871 if (DECL_NAME (node))
872 dump_decl_name (buffer, node, flags);
873 else if (LABEL_DECL_UID (node) != -1)
874 pp_printf (buffer, "<L%d>", (int) LABEL_DECL_UID (node));
876 pp_printf (buffer, "<D.%u>", DECL_UID (node));
880 if (DECL_IS_BUILTIN (node))
882 /* Don't print the declaration of built-in types. */
885 if (DECL_NAME (node))
886 dump_decl_name (buffer, node, flags);
889 if ((TREE_CODE (TREE_TYPE (node)) == RECORD_TYPE
890 || TREE_CODE (TREE_TYPE (node)) == UNION_TYPE)
891 && TYPE_METHODS (TREE_TYPE (node)))
893 /* The type is a c++ class: all structures have at least
895 pp_string (buffer, "class ");
896 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
901 (TREE_CODE (TREE_TYPE (node)) == UNION_TYPE
902 ? "union" : "struct "));
903 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
908 case SYMBOL_MEMORY_TAG:
909 case NAME_MEMORY_TAG:
910 case STRUCT_FIELD_TAG:
915 case MEMORY_PARTITION_TAG:
916 dump_decl_name (buffer, node, flags);
920 pp_string (buffer, "<retval>");
924 op0 = TREE_OPERAND (node, 0);
926 if (TREE_CODE (op0) == INDIRECT_REF)
928 op0 = TREE_OPERAND (op0, 0);
931 if (op_prio (op0) < op_prio (node))
932 pp_character (buffer, '(');
933 dump_generic_node (buffer, op0, spc, flags, false);
934 if (op_prio (op0) < op_prio (node))
935 pp_character (buffer, ')');
936 pp_string (buffer, str);
937 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
939 if (TREE_CODE (op0) != VALUE_HANDLE)
941 op0 = component_ref_field_offset (node);
942 if (op0 && TREE_CODE (op0) != INTEGER_CST)
944 pp_string (buffer, "{off: ");
945 dump_generic_node (buffer, op0, spc, flags, false);
946 pp_character (buffer, '}');
952 pp_string (buffer, "BIT_FIELD_REF <");
953 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
954 pp_string (buffer, ", ");
955 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
956 pp_string (buffer, ", ");
957 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
958 pp_string (buffer, ">");
962 case ARRAY_RANGE_REF:
963 op0 = TREE_OPERAND (node, 0);
964 if (op_prio (op0) < op_prio (node))
965 pp_character (buffer, '(');
966 dump_generic_node (buffer, op0, spc, flags, false);
967 if (op_prio (op0) < op_prio (node))
968 pp_character (buffer, ')');
969 pp_character (buffer, '[');
970 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
971 if (TREE_CODE (node) == ARRAY_RANGE_REF)
972 pp_string (buffer, " ...");
973 pp_character (buffer, ']');
975 op0 = array_ref_low_bound (node);
976 op1 = array_ref_element_size (node);
978 if (!integer_zerop (op0)
979 || TREE_OPERAND (node, 2)
980 || TREE_OPERAND (node, 3))
982 pp_string (buffer, "{lb: ");
983 dump_generic_node (buffer, op0, spc, flags, false);
984 pp_string (buffer, " sz: ");
985 dump_generic_node (buffer, op1, spc, flags, false);
986 pp_character (buffer, '}');
992 unsigned HOST_WIDE_INT ix;
994 bool is_struct_init = FALSE;
995 pp_character (buffer, '{');
996 if (TREE_CODE (TREE_TYPE (node)) == RECORD_TYPE
997 || TREE_CODE (TREE_TYPE (node)) == UNION_TYPE)
998 is_struct_init = TRUE;
999 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (node), ix, field, val)
1001 if (field && is_struct_init)
1003 pp_character (buffer, '.');
1004 dump_generic_node (buffer, field, spc, flags, false);
1005 pp_string (buffer, "=");
1007 if (val && TREE_CODE (val) == ADDR_EXPR)
1008 if (TREE_CODE (TREE_OPERAND (val, 0)) == FUNCTION_DECL)
1009 val = TREE_OPERAND (val, 0);
1010 if (val && TREE_CODE (val) == FUNCTION_DECL)
1011 dump_decl_name (buffer, val, flags);
1013 dump_generic_node (buffer, val, spc, flags, false);
1014 if (ix != VEC_length (constructor_elt, CONSTRUCTOR_ELTS (node)) - 1)
1016 pp_character (buffer, ',');
1020 pp_character (buffer, '}');
1027 if (flags & TDF_SLIM)
1029 pp_string (buffer, "<COMPOUND_EXPR>");
1033 dump_generic_node (buffer, TREE_OPERAND (node, 0),
1034 spc, flags, !(flags & TDF_SLIM));
1035 if (flags & TDF_SLIM)
1036 newline_and_indent (buffer, spc);
1039 pp_character (buffer, ',');
1043 for (tp = &TREE_OPERAND (node, 1);
1044 TREE_CODE (*tp) == COMPOUND_EXPR;
1045 tp = &TREE_OPERAND (*tp, 1))
1047 dump_generic_node (buffer, TREE_OPERAND (*tp, 0),
1048 spc, flags, !(flags & TDF_SLIM));
1049 if (flags & TDF_SLIM)
1050 newline_and_indent (buffer, spc);
1053 pp_character (buffer, ',');
1058 dump_generic_node (buffer, *tp, spc, flags, !(flags & TDF_SLIM));
1062 case STATEMENT_LIST:
1064 tree_stmt_iterator si;
1067 if (flags & TDF_SLIM)
1069 pp_string (buffer, "<STATEMENT_LIST>");
1073 for (si = tsi_start (node); !tsi_end_p (si); tsi_next (&si))
1076 newline_and_indent (buffer, spc);
1079 dump_generic_node (buffer, tsi_stmt (si), spc, flags, true);
1085 case GIMPLE_MODIFY_STMT:
1087 dump_generic_node (buffer, GENERIC_TREE_OPERAND (node, 0), spc, flags,
1090 pp_character (buffer, '=');
1091 if (TREE_CODE (node) == GIMPLE_MODIFY_STMT
1092 && MOVE_NONTEMPORAL (node))
1093 pp_string (buffer, "{nt}");
1094 if (TREE_CODE (node) == GIMPLE_MODIFY_STMT)
1097 if ((ann = stmt_ann (node))
1098 && ann->has_volatile_ops)
1099 pp_string (buffer, "{v}");
1102 dump_generic_node (buffer, GENERIC_TREE_OPERAND (node, 1), spc, flags,
1107 pp_string (buffer, "TARGET_EXPR <");
1108 dump_generic_node (buffer, TARGET_EXPR_SLOT (node), spc, flags, false);
1109 pp_character (buffer, ',');
1111 dump_generic_node (buffer, TARGET_EXPR_INITIAL (node), spc, flags, false);
1112 pp_character (buffer, '>');
1116 print_declaration (buffer, DECL_EXPR_DECL (node), spc, flags);
1121 if (TREE_TYPE (node) == NULL || TREE_TYPE (node) == void_type_node)
1123 pp_string (buffer, "if (");
1124 dump_generic_node (buffer, COND_EXPR_COND (node), spc, flags, false);
1125 pp_character (buffer, ')');
1126 /* The lowered cond_exprs should always be printed in full. */
1127 if (COND_EXPR_THEN (node)
1128 && (IS_EMPTY_STMT (COND_EXPR_THEN (node))
1129 || TREE_CODE (COND_EXPR_THEN (node)) == GOTO_EXPR)
1130 && COND_EXPR_ELSE (node)
1131 && (IS_EMPTY_STMT (COND_EXPR_ELSE (node))
1132 || TREE_CODE (COND_EXPR_ELSE (node)) == GOTO_EXPR))
1135 dump_generic_node (buffer, COND_EXPR_THEN (node),
1137 if (!IS_EMPTY_STMT (COND_EXPR_ELSE (node)))
1139 pp_string (buffer, " else ");
1140 dump_generic_node (buffer, COND_EXPR_ELSE (node),
1144 else if (!(flags & TDF_SLIM))
1146 /* Output COND_EXPR_THEN. */
1147 if (COND_EXPR_THEN (node))
1149 newline_and_indent (buffer, spc+2);
1150 pp_character (buffer, '{');
1151 newline_and_indent (buffer, spc+4);
1152 dump_generic_node (buffer, COND_EXPR_THEN (node), spc+4,
1154 newline_and_indent (buffer, spc+2);
1155 pp_character (buffer, '}');
1158 /* Output COND_EXPR_ELSE. */
1159 if (COND_EXPR_ELSE (node)
1160 && !IS_EMPTY_STMT (COND_EXPR_ELSE (node)))
1162 newline_and_indent (buffer, spc);
1163 pp_string (buffer, "else");
1164 newline_and_indent (buffer, spc+2);
1165 pp_character (buffer, '{');
1166 newline_and_indent (buffer, spc+4);
1167 dump_generic_node (buffer, COND_EXPR_ELSE (node), spc+4,
1169 newline_and_indent (buffer, spc+2);
1170 pp_character (buffer, '}');
1177 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1179 pp_character (buffer, '?');
1181 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1183 pp_character (buffer, ':');
1185 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
1190 pp_character (buffer, '{');
1191 if (!(flags & TDF_SLIM))
1193 if (BIND_EXPR_VARS (node))
1195 pp_newline (buffer);
1197 for (op0 = BIND_EXPR_VARS (node); op0; op0 = TREE_CHAIN (op0))
1199 print_declaration (buffer, op0, spc+2, flags);
1200 pp_newline (buffer);
1204 newline_and_indent (buffer, spc+2);
1205 dump_generic_node (buffer, BIND_EXPR_BODY (node), spc+2, flags, true);
1206 newline_and_indent (buffer, spc);
1207 pp_character (buffer, '}');
1213 print_call_name (buffer, node);
1215 /* Print parameters. */
1217 pp_character (buffer, '(');
1220 call_expr_arg_iterator iter;
1221 FOR_EACH_CALL_EXPR_ARG (arg, iter, node)
1223 dump_generic_node (buffer, arg, spc, flags, false);
1224 if (more_call_expr_args_p (&iter))
1226 pp_character (buffer, ',');
1231 if (CALL_EXPR_VA_ARG_PACK (node))
1233 if (call_expr_nargs (node) > 0)
1235 pp_character (buffer, ',');
1238 pp_string (buffer, "__builtin_va_arg_pack ()");
1240 pp_character (buffer, ')');
1242 op1 = CALL_EXPR_STATIC_CHAIN (node);
1245 pp_string (buffer, " [static-chain: ");
1246 dump_generic_node (buffer, op1, spc, flags, false);
1247 pp_character (buffer, ']');
1250 if (CALL_EXPR_RETURN_SLOT_OPT (node))
1251 pp_string (buffer, " [return slot optimization]");
1252 if (CALL_EXPR_TAILCALL (node))
1253 pp_string (buffer, " [tail call]");
1256 case WITH_CLEANUP_EXPR:
1260 case CLEANUP_POINT_EXPR:
1261 pp_string (buffer, "<<cleanup_point ");
1262 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1263 pp_string (buffer, ">>");
1266 case PLACEHOLDER_EXPR:
1267 pp_string (buffer, "<PLACEHOLDER_EXPR ");
1268 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
1269 pp_character (buffer, '>');
1272 /* Binary arithmetic and logic expressions. */
1273 case WIDEN_SUM_EXPR:
1274 case WIDEN_MULT_EXPR:
1277 case POINTER_PLUS_EXPR:
1279 case TRUNC_DIV_EXPR:
1281 case FLOOR_DIV_EXPR:
1282 case ROUND_DIV_EXPR:
1283 case TRUNC_MOD_EXPR:
1285 case FLOOR_MOD_EXPR:
1286 case ROUND_MOD_EXPR:
1288 case EXACT_DIV_EXPR:
1293 case VEC_LSHIFT_EXPR:
1294 case VEC_RSHIFT_EXPR:
1298 case TRUTH_ANDIF_EXPR:
1299 case TRUTH_ORIF_EXPR:
1300 case TRUTH_AND_EXPR:
1302 case TRUTH_XOR_EXPR:
1316 case UNORDERED_EXPR:
1318 const char *op = op_symbol (node);
1319 op0 = TREE_OPERAND (node, 0);
1320 op1 = TREE_OPERAND (node, 1);
1322 /* When the operands are expressions with less priority,
1323 keep semantics of the tree representation. */
1324 if (op_prio (op0) <= op_prio (node))
1326 pp_character (buffer, '(');
1327 dump_generic_node (buffer, op0, spc, flags, false);
1328 pp_character (buffer, ')');
1331 dump_generic_node (buffer, op0, spc, flags, false);
1334 pp_string (buffer, op);
1337 /* When the operands are expressions with less priority,
1338 keep semantics of the tree representation. */
1339 if (op_prio (op1) <= op_prio (node))
1341 pp_character (buffer, '(');
1342 dump_generic_node (buffer, op1, spc, flags, false);
1343 pp_character (buffer, ')');
1346 dump_generic_node (buffer, op1, spc, flags, false);
1350 /* Unary arithmetic and logic expressions. */
1353 case TRUTH_NOT_EXPR:
1355 case PREDECREMENT_EXPR:
1356 case PREINCREMENT_EXPR:
1357 case ALIGN_INDIRECT_REF:
1358 case MISALIGNED_INDIRECT_REF:
1360 if (TREE_CODE (node) == ADDR_EXPR
1361 && (TREE_CODE (TREE_OPERAND (node, 0)) == STRING_CST
1362 || TREE_CODE (TREE_OPERAND (node, 0)) == FUNCTION_DECL))
1363 ; /* Do not output '&' for strings and function pointers. */
1365 pp_string (buffer, op_symbol (node));
1367 if (op_prio (TREE_OPERAND (node, 0)) < op_prio (node))
1369 pp_character (buffer, '(');
1370 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1371 pp_character (buffer, ')');
1374 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1376 if (TREE_CODE (node) == MISALIGNED_INDIRECT_REF)
1378 pp_string (buffer, "{misalignment: ");
1379 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1380 pp_character (buffer, '}');
1384 case POSTDECREMENT_EXPR:
1385 case POSTINCREMENT_EXPR:
1386 if (op_prio (TREE_OPERAND (node, 0)) < op_prio (node))
1388 pp_character (buffer, '(');
1389 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1390 pp_character (buffer, ')');
1393 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1394 pp_string (buffer, op_symbol (node));
1398 pp_string (buffer, "MIN_EXPR <");
1399 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1400 pp_string (buffer, ", ");
1401 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1402 pp_character (buffer, '>');
1406 pp_string (buffer, "MAX_EXPR <");
1407 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1408 pp_string (buffer, ", ");
1409 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1410 pp_character (buffer, '>');
1414 pp_string (buffer, "ABS_EXPR <");
1415 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1416 pp_character (buffer, '>');
1423 case FIXED_CONVERT_EXPR:
1424 case FIX_TRUNC_EXPR:
1428 type = TREE_TYPE (node);
1429 op0 = TREE_OPERAND (node, 0);
1430 if (type != TREE_TYPE (op0))
1432 pp_character (buffer, '(');
1433 dump_generic_node (buffer, type, spc, flags, false);
1434 pp_string (buffer, ") ");
1436 if (op_prio (op0) < op_prio (node))
1437 pp_character (buffer, '(');
1438 dump_generic_node (buffer, op0, spc, flags, false);
1439 if (op_prio (op0) < op_prio (node))
1440 pp_character (buffer, ')');
1443 case VIEW_CONVERT_EXPR:
1444 pp_string (buffer, "VIEW_CONVERT_EXPR<");
1445 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
1446 pp_string (buffer, ">(");
1447 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1448 pp_character (buffer, ')');
1452 pp_string (buffer, "((");
1453 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1454 pp_string (buffer, "))");
1457 case NON_LVALUE_EXPR:
1458 pp_string (buffer, "NON_LVALUE_EXPR <");
1459 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1460 pp_character (buffer, '>');
1464 pp_string (buffer, "SAVE_EXPR <");
1465 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1466 pp_character (buffer, '>');
1470 pp_string (buffer, "COMPLEX_EXPR <");
1471 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1472 pp_string (buffer, ", ");
1473 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1474 pp_string (buffer, ">");
1478 pp_string (buffer, "CONJ_EXPR <");
1479 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1480 pp_string (buffer, ">");
1484 pp_string (buffer, "REALPART_EXPR <");
1485 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1486 pp_string (buffer, ">");
1490 pp_string (buffer, "IMAGPART_EXPR <");
1491 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1492 pp_string (buffer, ">");
1496 pp_string (buffer, "VA_ARG_EXPR <");
1497 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1498 pp_string (buffer, ">");
1501 case TRY_FINALLY_EXPR:
1502 case TRY_CATCH_EXPR:
1503 pp_string (buffer, "try");
1504 newline_and_indent (buffer, spc+2);
1505 pp_string (buffer, "{");
1506 newline_and_indent (buffer, spc+4);
1507 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc+4, flags, true);
1508 newline_and_indent (buffer, spc+2);
1509 pp_string (buffer, "}");
1510 newline_and_indent (buffer, spc);
1512 (TREE_CODE (node) == TRY_CATCH_EXPR) ? "catch" : "finally");
1513 newline_and_indent (buffer, spc+2);
1514 pp_string (buffer, "{");
1515 newline_and_indent (buffer, spc+4);
1516 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc+4, flags, true);
1517 newline_and_indent (buffer, spc+2);
1518 pp_string (buffer, "}");
1523 pp_string (buffer, "catch (");
1524 dump_generic_node (buffer, CATCH_TYPES (node), spc+2, flags, false);
1525 pp_string (buffer, ")");
1526 newline_and_indent (buffer, spc+2);
1527 pp_string (buffer, "{");
1528 newline_and_indent (buffer, spc+4);
1529 dump_generic_node (buffer, CATCH_BODY (node), spc+4, flags, true);
1530 newline_and_indent (buffer, spc+2);
1531 pp_string (buffer, "}");
1535 case EH_FILTER_EXPR:
1536 pp_string (buffer, "<<<eh_filter (");
1537 dump_generic_node (buffer, EH_FILTER_TYPES (node), spc+2, flags, false);
1538 pp_string (buffer, ")>>>");
1539 newline_and_indent (buffer, spc+2);
1540 pp_string (buffer, "{");
1541 newline_and_indent (buffer, spc+4);
1542 dump_generic_node (buffer, EH_FILTER_FAILURE (node), spc+4, flags, true);
1543 newline_and_indent (buffer, spc+2);
1544 pp_string (buffer, "}");
1548 case CHANGE_DYNAMIC_TYPE_EXPR:
1549 pp_string (buffer, "<<<change_dynamic_type (");
1550 dump_generic_node (buffer, CHANGE_DYNAMIC_TYPE_NEW_TYPE (node), spc + 2,
1552 pp_string (buffer, ") ");
1553 dump_generic_node (buffer, CHANGE_DYNAMIC_TYPE_LOCATION (node), spc + 2,
1555 pp_string (buffer, ")>>>");
1560 op0 = TREE_OPERAND (node, 0);
1561 /* If this is for break or continue, don't bother printing it. */
1562 if (DECL_NAME (op0))
1564 const char *name = IDENTIFIER_POINTER (DECL_NAME (op0));
1565 if (strcmp (name, "break") == 0
1566 || strcmp (name, "continue") == 0)
1569 dump_generic_node (buffer, op0, spc, flags, false);
1570 pp_character (buffer, ':');
1571 if (DECL_NONLOCAL (op0))
1572 pp_string (buffer, " [non-local]");
1576 pp_string (buffer, "<<<exception object>>>");
1580 pp_string (buffer, "<<<filter object>>>");
1584 pp_string (buffer, "while (1)");
1585 if (!(flags & TDF_SLIM))
1587 newline_and_indent (buffer, spc+2);
1588 pp_character (buffer, '{');
1589 newline_and_indent (buffer, spc+4);
1590 dump_generic_node (buffer, LOOP_EXPR_BODY (node), spc+4, flags, true);
1591 newline_and_indent (buffer, spc+2);
1592 pp_character (buffer, '}');
1598 pp_string (buffer, "// predicted ");
1599 if (PREDICT_EXPR_OUTCOME (node))
1600 pp_string (buffer, "likely by ");
1602 pp_string (buffer, "unlikely by ");
1603 pp_string (buffer, predictor_name (PREDICT_EXPR_PREDICTOR (node)));
1604 pp_string (buffer, " predictor.");
1608 pp_string (buffer, "return");
1609 op0 = TREE_OPERAND (node, 0);
1613 if (TREE_CODE (op0) == MODIFY_EXPR
1614 || TREE_CODE (op0) == GIMPLE_MODIFY_STMT)
1615 dump_generic_node (buffer, GENERIC_TREE_OPERAND (op0, 1),
1618 dump_generic_node (buffer, op0, spc, flags, false);
1623 pp_string (buffer, "if (");
1624 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1625 pp_string (buffer, ") break");
1629 pp_string (buffer, "switch (");
1630 dump_generic_node (buffer, SWITCH_COND (node), spc, flags, false);
1631 pp_character (buffer, ')');
1632 if (!(flags & TDF_SLIM))
1634 newline_and_indent (buffer, spc+2);
1635 pp_character (buffer, '{');
1636 if (SWITCH_BODY (node))
1638 newline_and_indent (buffer, spc+4);
1639 dump_generic_node (buffer, SWITCH_BODY (node), spc+4, flags,
1644 tree vec = SWITCH_LABELS (node);
1645 size_t i, n = TREE_VEC_LENGTH (vec);
1646 for (i = 0; i < n; ++i)
1648 tree elt = TREE_VEC_ELT (vec, i);
1649 newline_and_indent (buffer, spc+4);
1652 dump_generic_node (buffer, elt, spc+4, flags, false);
1653 pp_string (buffer, " goto ");
1654 dump_generic_node (buffer, CASE_LABEL (elt), spc+4,
1656 pp_semicolon (buffer);
1659 pp_string (buffer, "case ???: goto ???;");
1662 newline_and_indent (buffer, spc+2);
1663 pp_character (buffer, '}');
1669 op0 = GOTO_DESTINATION (node);
1670 if (TREE_CODE (op0) != SSA_NAME && DECL_P (op0) && DECL_NAME (op0))
1672 const char *name = IDENTIFIER_POINTER (DECL_NAME (op0));
1673 if (strcmp (name, "break") == 0
1674 || strcmp (name, "continue") == 0)
1676 pp_string (buffer, name);
1680 pp_string (buffer, "goto ");
1681 dump_generic_node (buffer, op0, spc, flags, false);
1685 pp_string (buffer, "resx ");
1686 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1690 pp_string (buffer, "__asm__");
1691 if (ASM_VOLATILE_P (node))
1692 pp_string (buffer, " __volatile__");
1693 pp_character (buffer, '(');
1694 dump_generic_node (buffer, ASM_STRING (node), spc, flags, false);
1695 pp_character (buffer, ':');
1696 dump_generic_node (buffer, ASM_OUTPUTS (node), spc, flags, false);
1697 pp_character (buffer, ':');
1698 dump_generic_node (buffer, ASM_INPUTS (node), spc, flags, false);
1699 if (ASM_CLOBBERS (node))
1701 pp_character (buffer, ':');
1702 dump_generic_node (buffer, ASM_CLOBBERS (node), spc, flags, false);
1704 pp_string (buffer, ")");
1707 case CASE_LABEL_EXPR:
1708 if (CASE_LOW (node) && CASE_HIGH (node))
1710 pp_string (buffer, "case ");
1711 dump_generic_node (buffer, CASE_LOW (node), spc, flags, false);
1712 pp_string (buffer, " ... ");
1713 dump_generic_node (buffer, CASE_HIGH (node), spc, flags, false);
1715 else if (CASE_LOW (node))
1717 pp_string (buffer, "case ");
1718 dump_generic_node (buffer, CASE_LOW (node), spc, flags, false);
1721 pp_string (buffer, "default ");
1722 pp_character (buffer, ':');
1726 pp_string (buffer, "OBJ_TYPE_REF(");
1727 dump_generic_node (buffer, OBJ_TYPE_REF_EXPR (node), spc, flags, false);
1728 pp_character (buffer, ';');
1729 dump_generic_node (buffer, OBJ_TYPE_REF_OBJECT (node), spc, flags, false);
1730 pp_character (buffer, '-');
1731 pp_character (buffer, '>');
1732 dump_generic_node (buffer, OBJ_TYPE_REF_TOKEN (node), spc, flags, false);
1733 pp_character (buffer, ')');
1740 dump_generic_node (buffer, PHI_RESULT (node), spc, flags, false);
1741 pp_string (buffer, " = PHI <");
1742 for (i = 0; i < PHI_NUM_ARGS (node); i++)
1744 dump_generic_node (buffer, PHI_ARG_DEF (node, i), spc, flags, false);
1745 pp_string (buffer, "(");
1746 pp_decimal_int (buffer, PHI_ARG_EDGE (node, i)->src->index);
1747 pp_string (buffer, ")");
1748 if (i < PHI_NUM_ARGS (node) - 1)
1749 pp_string (buffer, ", ");
1751 pp_string (buffer, ">");
1753 if (stmt_references_memory_p (node) && (flags & TDF_MEMSYMS))
1754 dump_symbols (buffer, STORED_SYMS (node), flags);
1759 dump_generic_node (buffer, SSA_NAME_VAR (node), spc, flags, false);
1760 pp_string (buffer, "_");
1761 pp_decimal_int (buffer, SSA_NAME_VERSION (node));
1762 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (node))
1763 pp_string (buffer, "(ab)");
1764 else if (SSA_NAME_IS_DEFAULT_DEF (node))
1765 pp_string (buffer, "(D)");
1768 case WITH_SIZE_EXPR:
1769 pp_string (buffer, "WITH_SIZE_EXPR <");
1770 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1771 pp_string (buffer, ", ");
1772 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1773 pp_string (buffer, ">");
1777 pp_printf (buffer, "VH.%d", VALUE_HANDLE_ID (node));
1781 pp_string (buffer, "ASSERT_EXPR <");
1782 dump_generic_node (buffer, ASSERT_EXPR_VAR (node), spc, flags, false);
1783 pp_string (buffer, ", ");
1784 dump_generic_node (buffer, ASSERT_EXPR_COND (node), spc, flags, false);
1785 pp_string (buffer, ">");
1789 pp_string (buffer, "scev_known");
1792 case SCEV_NOT_KNOWN:
1793 pp_string (buffer, "scev_not_known");
1796 case POLYNOMIAL_CHREC:
1797 pp_string (buffer, "{");
1798 dump_generic_node (buffer, CHREC_LEFT (node), spc, flags, false);
1799 pp_string (buffer, ", +, ");
1800 dump_generic_node (buffer, CHREC_RIGHT (node), spc, flags, false);
1801 pp_string (buffer, "}_");
1802 dump_generic_node (buffer, CHREC_VAR (node), spc, flags, false);
1806 case REALIGN_LOAD_EXPR:
1807 pp_string (buffer, "REALIGN_LOAD <");
1808 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1809 pp_string (buffer, ", ");
1810 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1811 pp_string (buffer, ", ");
1812 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
1813 pp_string (buffer, ">");
1817 pp_string (buffer, " VEC_COND_EXPR < ");
1818 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1819 pp_string (buffer, " , ");
1820 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1821 pp_string (buffer, " , ");
1822 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
1823 pp_string (buffer, " > ");
1827 pp_string (buffer, " DOT_PROD_EXPR < ");
1828 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1829 pp_string (buffer, ", ");
1830 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1831 pp_string (buffer, ", ");
1832 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
1833 pp_string (buffer, " > ");
1837 pp_string (buffer, "#pragma omp parallel");
1838 dump_omp_clauses (buffer, OMP_PARALLEL_CLAUSES (node), spc, flags);
1839 if (OMP_PARALLEL_FN (node))
1841 pp_string (buffer, " [child fn: ");
1842 dump_generic_node (buffer, OMP_PARALLEL_FN (node), spc, flags, false);
1844 pp_string (buffer, " (");
1846 if (OMP_PARALLEL_DATA_ARG (node))
1847 dump_generic_node (buffer, OMP_PARALLEL_DATA_ARG (node), spc, flags,
1850 pp_string (buffer, "???");
1852 pp_string (buffer, ")]");
1856 if (!(flags & TDF_SLIM) && OMP_BODY (node))
1858 newline_and_indent (buffer, spc + 2);
1859 pp_character (buffer, '{');
1860 newline_and_indent (buffer, spc + 4);
1861 dump_generic_node (buffer, OMP_BODY (node), spc + 4, flags, false);
1862 newline_and_indent (buffer, spc + 2);
1863 pp_character (buffer, '}');
1869 pp_string (buffer, "#pragma omp for");
1870 dump_omp_clauses (buffer, OMP_FOR_CLAUSES (node), spc, flags);
1872 if (!(flags & TDF_SLIM))
1874 if (OMP_FOR_PRE_BODY (node))
1876 newline_and_indent (buffer, spc + 2);
1877 pp_character (buffer, '{');
1879 newline_and_indent (buffer, spc);
1880 dump_generic_node (buffer, OMP_FOR_PRE_BODY (node),
1883 newline_and_indent (buffer, spc);
1884 pp_string (buffer, "for (");
1885 dump_generic_node (buffer, OMP_FOR_INIT (node), spc, flags, false);
1886 pp_string (buffer, "; ");
1887 dump_generic_node (buffer, OMP_FOR_COND (node), spc, flags, false);
1888 pp_string (buffer, "; ");
1889 dump_generic_node (buffer, OMP_FOR_INCR (node), spc, flags, false);
1890 pp_string (buffer, ")");
1891 if (OMP_FOR_BODY (node))
1893 newline_and_indent (buffer, spc + 2);
1894 pp_character (buffer, '{');
1895 newline_and_indent (buffer, spc + 4);
1896 dump_generic_node (buffer, OMP_FOR_BODY (node), spc + 4, flags,
1898 newline_and_indent (buffer, spc + 2);
1899 pp_character (buffer, '}');
1901 if (OMP_FOR_PRE_BODY (node))
1904 newline_and_indent (buffer, spc + 2);
1905 pp_character (buffer, '}');
1912 pp_string (buffer, "#pragma omp sections");
1913 if (OMP_SECTIONS_CONTROL (node))
1915 pp_string (buffer, " <");
1916 dump_generic_node (buffer, OMP_SECTIONS_CONTROL (node), spc,
1918 pp_string (buffer, ">");
1920 dump_omp_clauses (buffer, OMP_SECTIONS_CLAUSES (node), spc, flags);
1923 case OMP_SECTIONS_SWITCH:
1924 pp_string (buffer, "OMP_SECTIONS_SWITCH");
1929 pp_string (buffer, "#pragma omp section");
1933 pp_string (buffer, "#pragma omp master");
1937 pp_string (buffer, "#pragma omp ordered");
1941 pp_string (buffer, "#pragma omp critical");
1942 if (OMP_CRITICAL_NAME (node))
1945 pp_character (buffer, '(');
1946 dump_generic_node (buffer, OMP_CRITICAL_NAME (node), spc,
1948 pp_character (buffer, ')');
1953 pp_string (buffer, "#pragma omp atomic");
1954 newline_and_indent (buffer, spc + 2);
1955 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1957 pp_character (buffer, '=');
1959 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1962 case OMP_ATOMIC_LOAD:
1963 pp_string (buffer, "#pragma omp atomic_load");
1964 newline_and_indent (buffer, spc + 2);
1965 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1967 pp_character (buffer, '=');
1969 pp_character (buffer, '*');
1970 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1973 case OMP_ATOMIC_STORE:
1974 pp_string (buffer, "#pragma omp atomic_store (");
1975 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1976 pp_character (buffer, ')');
1980 pp_string (buffer, "#pragma omp single");
1981 dump_omp_clauses (buffer, OMP_SINGLE_CLAUSES (node), spc, flags);
1985 pp_string (buffer, "OMP_RETURN");
1986 if (OMP_RETURN_NOWAIT (node))
1987 pp_string (buffer, " [nowait]");
1992 pp_string (buffer, "OMP_CONTINUE <");
1993 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1994 pp_string (buffer, " <- ");
1995 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1996 pp_string (buffer, ">");
2001 dump_omp_clause (buffer, node, spc, flags);
2005 case REDUC_MAX_EXPR:
2006 pp_string (buffer, " REDUC_MAX_EXPR < ");
2007 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2008 pp_string (buffer, " > ");
2011 case REDUC_MIN_EXPR:
2012 pp_string (buffer, " REDUC_MIN_EXPR < ");
2013 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2014 pp_string (buffer, " > ");
2017 case REDUC_PLUS_EXPR:
2018 pp_string (buffer, " REDUC_PLUS_EXPR < ");
2019 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2020 pp_string (buffer, " > ");
2023 case VEC_WIDEN_MULT_HI_EXPR:
2024 pp_string (buffer, " VEC_WIDEN_MULT_HI_EXPR < ");
2025 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2026 pp_string (buffer, ", ");
2027 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2028 pp_string (buffer, " > ");
2031 case VEC_WIDEN_MULT_LO_EXPR:
2032 pp_string (buffer, " VEC_WIDEN_MULT_LO_EXPR < ");
2033 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2034 pp_string (buffer, ", ");
2035 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2036 pp_string (buffer, " > ");
2039 case VEC_UNPACK_HI_EXPR:
2040 pp_string (buffer, " VEC_UNPACK_HI_EXPR < ");
2041 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2042 pp_string (buffer, " > ");
2045 case VEC_UNPACK_LO_EXPR:
2046 pp_string (buffer, " VEC_UNPACK_LO_EXPR < ");
2047 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2048 pp_string (buffer, " > ");
2051 case VEC_UNPACK_FLOAT_HI_EXPR:
2052 pp_string (buffer, " VEC_UNPACK_FLOAT_HI_EXPR < ");
2053 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2054 pp_string (buffer, " > ");
2057 case VEC_UNPACK_FLOAT_LO_EXPR:
2058 pp_string (buffer, " VEC_UNPACK_FLOAT_LO_EXPR < ");
2059 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2060 pp_string (buffer, " > ");
2063 case VEC_PACK_TRUNC_EXPR:
2064 pp_string (buffer, " VEC_PACK_TRUNC_EXPR < ");
2065 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2066 pp_string (buffer, ", ");
2067 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2068 pp_string (buffer, " > ");
2071 case VEC_PACK_SAT_EXPR:
2072 pp_string (buffer, " VEC_PACK_SAT_EXPR < ");
2073 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2074 pp_string (buffer, ", ");
2075 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2076 pp_string (buffer, " > ");
2079 case VEC_PACK_FIX_TRUNC_EXPR:
2080 pp_string (buffer, " VEC_PACK_FIX_TRUNC_EXPR < ");
2081 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2082 pp_string (buffer, ", ");
2083 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2084 pp_string (buffer, " > ");
2090 pp_string (buffer, "BLOCK");
2092 if (BLOCK_ABSTRACT (node))
2093 pp_string (buffer, " [abstract]");
2095 if (TREE_ASM_WRITTEN (node))
2096 pp_string (buffer, " [written]");
2098 newline_and_indent (buffer, spc + 2);
2100 if (BLOCK_SUPERCONTEXT (node))
2102 pp_string (buffer, "SUPERCONTEXT: ");
2103 if (TREE_CODE (BLOCK_SUPERCONTEXT (node)) == BLOCK)
2104 pp_printf (buffer, "BLOCK %p",
2105 (void *)BLOCK_SUPERCONTEXT (node));
2107 dump_generic_node (buffer, BLOCK_SUPERCONTEXT (node), 0, flags,
2109 newline_and_indent (buffer, spc + 2);
2112 if (BLOCK_SUBBLOCKS (node))
2114 pp_string (buffer, "SUBBLOCKS: ");
2115 for (t = BLOCK_SUBBLOCKS (node); t; t = BLOCK_CHAIN (t))
2116 pp_printf (buffer, "%p ", (void *)t);
2117 newline_and_indent (buffer, spc + 2);
2120 if (BLOCK_VARS (node))
2122 pp_string (buffer, "VARS: ");
2123 for (t = BLOCK_VARS (node); t; t = TREE_CHAIN (t))
2125 dump_generic_node (buffer, t, 0, flags, false);
2126 pp_string (buffer, " ");
2128 newline_and_indent (buffer, spc + 2);
2131 if (BLOCK_ABSTRACT_ORIGIN (node))
2133 pp_string (buffer, "ABSTRACT_ORIGIN: ");
2134 if (TREE_CODE (BLOCK_ABSTRACT_ORIGIN (node)) == BLOCK)
2135 pp_printf (buffer, "BLOCK %p",
2136 (void *)BLOCK_ABSTRACT_ORIGIN (node));
2138 dump_generic_node (buffer, BLOCK_ABSTRACT_ORIGIN (node), 0, flags,
2140 newline_and_indent (buffer, spc + 2);
2145 case VEC_EXTRACT_EVEN_EXPR:
2146 pp_string (buffer, " VEC_EXTRACT_EVEN_EXPR < ");
2147 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2148 pp_string (buffer, ", ");
2149 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2150 pp_string (buffer, " > ");
2153 case VEC_EXTRACT_ODD_EXPR:
2154 pp_string (buffer, " VEC_EXTRACT_ODD_EXPR < ");
2155 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2156 pp_string (buffer, ", ");
2157 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2158 pp_string (buffer, " > ");
2161 case VEC_INTERLEAVE_HIGH_EXPR:
2162 pp_string (buffer, " VEC_INTERLEAVE_HIGH_EXPR < ");
2163 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2164 pp_string (buffer, ", ");
2165 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2166 pp_string (buffer, " > ");
2169 case VEC_INTERLEAVE_LOW_EXPR:
2170 pp_string (buffer, " VEC_INTERLEAVE_LOW_EXPR < ");
2171 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2172 pp_string (buffer, ", ");
2173 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2174 pp_string (buffer, " > ");
2181 if (is_stmt && is_expr)
2182 pp_semicolon (buffer);
2184 /* If we're building a diagnostic, the formatted text will be written
2185 into BUFFER's stream by the caller; otherwise, write it now. */
2186 if (!(flags & TDF_DIAGNOSTIC))
2187 pp_write_text_to_stream (buffer);
2192 /* Print the declaration of a variable. */
2195 print_declaration (pretty_printer *buffer, tree t, int spc, int flags)
2199 if (TREE_CODE (t) == TYPE_DECL)
2200 pp_string (buffer, "typedef ");
2202 if (CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_DECL_WRTL) && DECL_REGISTER (t))
2203 pp_string (buffer, "register ");
2205 if (TREE_PUBLIC (t) && DECL_EXTERNAL (t))
2206 pp_string (buffer, "extern ");
2207 else if (TREE_STATIC (t))
2208 pp_string (buffer, "static ");
2210 /* Print the type and name. */
2211 if (TREE_CODE (TREE_TYPE (t)) == ARRAY_TYPE)
2215 /* Print array's type. */
2216 tmp = TREE_TYPE (t);
2217 while (TREE_CODE (TREE_TYPE (tmp)) == ARRAY_TYPE)
2218 tmp = TREE_TYPE (tmp);
2219 dump_generic_node (buffer, TREE_TYPE (tmp), spc, flags, false);
2221 /* Print variable's name. */
2223 dump_generic_node (buffer, t, spc, flags, false);
2225 /* Print the dimensions. */
2226 tmp = TREE_TYPE (t);
2227 while (TREE_CODE (tmp) == ARRAY_TYPE)
2229 dump_array_domain (buffer, TYPE_DOMAIN (tmp), spc, flags);
2230 tmp = TREE_TYPE (tmp);
2233 else if (TREE_CODE (t) == FUNCTION_DECL)
2235 dump_generic_node (buffer, TREE_TYPE (TREE_TYPE (t)), spc, flags, false);
2237 dump_decl_name (buffer, t, flags);
2238 dump_function_declaration (buffer, TREE_TYPE (t), spc, flags);
2242 /* Print type declaration. */
2243 dump_generic_node (buffer, TREE_TYPE (t), spc, flags, false);
2245 /* Print variable's name. */
2247 dump_generic_node (buffer, t, spc, flags, false);
2250 if (TREE_CODE (t) == VAR_DECL && DECL_HARD_REGISTER (t))
2252 pp_string (buffer, " __asm__ ");
2253 pp_character (buffer, '(');
2254 dump_generic_node (buffer, DECL_ASSEMBLER_NAME (t), spc, flags, false);
2255 pp_character (buffer, ')');
2258 /* The initial value of a function serves to determine wether the function
2259 is declared or defined. So the following does not apply to function
2261 if (TREE_CODE (t) != FUNCTION_DECL)
2263 /* Print the initial value. */
2264 if (DECL_INITIAL (t))
2267 pp_character (buffer, '=');
2269 dump_generic_node (buffer, DECL_INITIAL (t), spc, flags, false);
2273 if (TREE_CODE (t) == VAR_DECL && DECL_HAS_VALUE_EXPR_P (t))
2275 pp_string (buffer, " [value-expr: ");
2276 dump_generic_node (buffer, DECL_VALUE_EXPR (t), spc, flags, false);
2277 pp_character (buffer, ']');
2280 pp_character (buffer, ';');
2284 /* Prints a structure: name, fields, and methods.
2285 FIXME: Still incomplete. */
2288 print_struct_decl (pretty_printer *buffer, const_tree node, int spc, int flags)
2290 /* Print the name of the structure. */
2291 if (TYPE_NAME (node))
2294 if (TREE_CODE (node) == RECORD_TYPE)
2295 pp_string (buffer, "struct ");
2296 else if ((TREE_CODE (node) == UNION_TYPE
2297 || TREE_CODE (node) == QUAL_UNION_TYPE))
2298 pp_string (buffer, "union ");
2300 dump_generic_node (buffer, TYPE_NAME (node), spc, 0, false);
2303 /* Print the contents of the structure. */
2304 pp_newline (buffer);
2306 pp_character (buffer, '{');
2307 pp_newline (buffer);
2309 /* Print the fields of the structure. */
2312 tmp = TYPE_FIELDS (node);
2315 /* Avoid to print recursively the structure. */
2316 /* FIXME : Not implemented correctly...,
2317 what about the case when we have a cycle in the contain graph? ...
2318 Maybe this could be solved by looking at the scope in which the
2319 structure was declared. */
2320 if (TREE_TYPE (tmp) != node
2321 || (TREE_CODE (TREE_TYPE (tmp)) == POINTER_TYPE
2322 && TREE_TYPE (TREE_TYPE (tmp)) != node))
2324 print_declaration (buffer, tmp, spc+2, flags);
2325 pp_newline (buffer);
2327 tmp = TREE_CHAIN (tmp);
2331 pp_character (buffer, '}');
2334 /* Return the priority of the operator OP.
2336 From lowest to highest precedence with either left-to-right (L-R)
2337 or right-to-left (R-L) associativity]:
2340 2 [R-L] = += -= *= /= %= &= ^= |= <<= >>=
2352 14 [R-L] ! ~ ++ -- + - * & (type) sizeof
2353 15 [L-R] fn() [] -> .
2355 unary +, - and * have higher precedence than the corresponding binary
2359 op_prio (const_tree op)
2364 switch (TREE_CODE (op))
2372 case GIMPLE_MODIFY_STMT:
2380 case TRUTH_ORIF_EXPR:
2383 case TRUTH_AND_EXPR:
2384 case TRUTH_ANDIF_EXPR:
2391 case TRUTH_XOR_EXPR:
2408 case UNORDERED_EXPR:
2421 case WIDEN_SUM_EXPR:
2423 case POINTER_PLUS_EXPR:
2427 case VEC_WIDEN_MULT_HI_EXPR:
2428 case VEC_WIDEN_MULT_LO_EXPR:
2429 case WIDEN_MULT_EXPR:
2432 case TRUNC_DIV_EXPR:
2434 case FLOOR_DIV_EXPR:
2435 case ROUND_DIV_EXPR:
2437 case EXACT_DIV_EXPR:
2438 case TRUNC_MOD_EXPR:
2440 case FLOOR_MOD_EXPR:
2441 case ROUND_MOD_EXPR:
2444 case TRUTH_NOT_EXPR:
2446 case POSTINCREMENT_EXPR:
2447 case POSTDECREMENT_EXPR:
2448 case PREINCREMENT_EXPR:
2449 case PREDECREMENT_EXPR:
2451 case ALIGN_INDIRECT_REF:
2452 case MISALIGNED_INDIRECT_REF:
2458 case FIX_TRUNC_EXPR:
2464 case ARRAY_RANGE_REF:
2468 /* Special expressions. */
2474 case REDUC_MAX_EXPR:
2475 case REDUC_MIN_EXPR:
2476 case REDUC_PLUS_EXPR:
2477 case VEC_LSHIFT_EXPR:
2478 case VEC_RSHIFT_EXPR:
2479 case VEC_UNPACK_HI_EXPR:
2480 case VEC_UNPACK_LO_EXPR:
2481 case VEC_UNPACK_FLOAT_HI_EXPR:
2482 case VEC_UNPACK_FLOAT_LO_EXPR:
2483 case VEC_PACK_TRUNC_EXPR:
2484 case VEC_PACK_SAT_EXPR:
2488 case NON_LVALUE_EXPR:
2489 return op_prio (TREE_OPERAND (op, 0));
2492 /* Return an arbitrarily high precedence to avoid surrounding single
2493 VAR_DECLs in ()s. */
2499 /* Return the symbol associated with operator CODE. */
2502 op_symbol_code (enum tree_code code)
2507 case GIMPLE_MODIFY_STMT:
2511 case TRUTH_ORIF_EXPR:
2514 case TRUTH_AND_EXPR:
2515 case TRUTH_ANDIF_EXPR:
2521 case TRUTH_XOR_EXPR:
2531 case UNORDERED_EXPR:
2577 case VEC_LSHIFT_EXPR:
2580 case VEC_RSHIFT_EXPR:
2583 case POINTER_PLUS_EXPR:
2589 case REDUC_PLUS_EXPR:
2592 case WIDEN_SUM_EXPR:
2595 case WIDEN_MULT_EXPR:
2605 case TRUTH_NOT_EXPR:
2612 case ALIGN_INDIRECT_REF:
2615 case MISALIGNED_INDIRECT_REF:
2618 case TRUNC_DIV_EXPR:
2625 case FLOOR_DIV_EXPR:
2628 case ROUND_DIV_EXPR:
2631 case EXACT_DIV_EXPR:
2634 case TRUNC_MOD_EXPR:
2640 case FLOOR_MOD_EXPR:
2643 case ROUND_MOD_EXPR:
2646 case PREDECREMENT_EXPR:
2649 case PREINCREMENT_EXPR:
2652 case POSTDECREMENT_EXPR:
2655 case POSTINCREMENT_EXPR:
2665 return "<<< ??? >>>";
2669 /* Return the symbol associated with operator OP. */
2672 op_symbol (const_tree op)
2674 return op_symbol_code (TREE_CODE (op));
2677 /* Prints the name of a CALL_EXPR. */
2680 print_call_name (pretty_printer *buffer, const_tree node)
2684 gcc_assert (TREE_CODE (node) == CALL_EXPR);
2686 op0 = CALL_EXPR_FN (node);
2688 if (TREE_CODE (op0) == NON_LVALUE_EXPR)
2689 op0 = TREE_OPERAND (op0, 0);
2691 switch (TREE_CODE (op0))
2695 dump_function_name (buffer, op0);
2701 dump_generic_node (buffer, TREE_OPERAND (op0, 0), 0, 0, false);
2705 pp_string (buffer, "(");
2706 dump_generic_node (buffer, TREE_OPERAND (op0, 0), 0, 0, false);
2707 pp_string (buffer, ") ? ");
2708 dump_generic_node (buffer, TREE_OPERAND (op0, 1), 0, 0, false);
2709 pp_string (buffer, " : ");
2710 dump_generic_node (buffer, TREE_OPERAND (op0, 2), 0, 0, false);
2714 /* The function is a pointer contained in a structure. */
2715 if (TREE_CODE (TREE_OPERAND (op0, 0)) == INDIRECT_REF ||
2716 TREE_CODE (TREE_OPERAND (op0, 0)) == VAR_DECL)
2717 dump_function_name (buffer, TREE_OPERAND (op0, 1));
2719 dump_generic_node (buffer, TREE_OPERAND (op0, 0), 0, 0, false);
2721 We can have several levels of structures and a function
2722 pointer inside. This is not implemented yet... */
2727 if (TREE_CODE (TREE_OPERAND (op0, 0)) == VAR_DECL)
2728 dump_function_name (buffer, TREE_OPERAND (op0, 0));
2730 dump_generic_node (buffer, op0, 0, 0, false);
2735 dump_generic_node (buffer, op0, 0, 0, false);
2743 /* Parses the string STR and replaces new-lines by '\n', tabs by '\t', ... */
2746 pretty_print_string (pretty_printer *buffer, const char *str)
2756 pp_string (buffer, "\\b");
2760 pp_string (buffer, "\\f");
2764 pp_string (buffer, "\\n");
2768 pp_string (buffer, "\\r");
2772 pp_string (buffer, "\\t");
2776 pp_string (buffer, "\\v");
2780 pp_string (buffer, "\\\\");
2784 pp_string (buffer, "\\\"");
2788 pp_string (buffer, "\\'");
2791 /* No need to handle \0; the loop terminates on \0. */
2794 pp_string (buffer, "\\1");
2798 pp_string (buffer, "\\2");
2802 pp_string (buffer, "\\3");
2806 pp_string (buffer, "\\4");
2810 pp_string (buffer, "\\5");
2814 pp_string (buffer, "\\6");
2818 pp_string (buffer, "\\7");
2822 pp_character (buffer, str[0]);
2830 maybe_init_pretty_print (FILE *file)
2834 pp_construct (&buffer, /* prefix */NULL, /* line-width */0);
2835 pp_needs_newline (&buffer) = true;
2839 buffer.buffer->stream = file;
2843 newline_and_indent (pretty_printer *buffer, int spc)
2845 pp_newline (buffer);
2851 dump_vops (pretty_printer *buffer, tree stmt, int spc, int flags)
2853 struct voptype_d *vdefs;
2854 struct voptype_d *vuses;
2857 if (!ssa_operands_active () || !stmt_references_memory_p (stmt))
2860 /* Even if the statement doesn't have virtual operators yet, it may
2861 contain symbol information (this happens before aliases have been
2863 if ((flags & TDF_MEMSYMS)
2864 && VUSE_OPS (stmt) == NULL
2865 && VDEF_OPS (stmt) == NULL)
2867 if (LOADED_SYMS (stmt))
2869 pp_string (buffer, "# LOADS: ");
2870 dump_symbols (buffer, LOADED_SYMS (stmt), flags);
2871 newline_and_indent (buffer, spc);
2874 if (STORED_SYMS (stmt))
2876 pp_string (buffer, "# STORES: ");
2877 dump_symbols (buffer, STORED_SYMS (stmt), flags);
2878 newline_and_indent (buffer, spc);
2884 vuses = VUSE_OPS (stmt);
2887 pp_string (buffer, "# VUSE <");
2889 n = VUSE_NUM (vuses);
2890 for (i = 0; i < n; i++)
2892 dump_generic_node (buffer, VUSE_OP (vuses, i), spc + 2, flags, false);
2894 pp_string (buffer, ", ");
2897 pp_string (buffer, ">");
2899 if (flags & TDF_MEMSYMS)
2900 dump_symbols (buffer, LOADED_SYMS (stmt), flags);
2902 newline_and_indent (buffer, spc);
2903 vuses = vuses->next;
2906 vdefs = VDEF_OPS (stmt);
2909 pp_string (buffer, "# ");
2910 dump_generic_node (buffer, VDEF_RESULT (vdefs), spc + 2, flags, false);
2911 pp_string (buffer, " = VDEF <");
2913 n = VDEF_NUM (vdefs);
2914 for (i = 0; i < n; i++)
2916 dump_generic_node (buffer, VDEF_OP (vdefs, i), spc + 2, flags, 0);
2918 pp_string (buffer, ", ");
2921 pp_string (buffer, ">");
2923 if ((flags & TDF_MEMSYMS) && vdefs->next == NULL)
2924 dump_symbols (buffer, STORED_SYMS (stmt), flags);
2926 newline_and_indent (buffer, spc);
2927 vdefs = vdefs->next;
2932 /* Dumps basic block BB to FILE with details described by FLAGS and
2933 indented by INDENT spaces. */
2936 dump_generic_bb (FILE *file, basic_block bb, int indent, int flags)
2938 maybe_init_pretty_print (file);
2939 dump_generic_bb_buff (&buffer, bb, indent, flags);
2943 /* Dumps header of basic block BB to buffer BUFFER indented by INDENT
2944 spaces and details described by flags. */
2947 dump_bb_header (pretty_printer *buffer, basic_block bb, int indent, int flags)
2953 if (flags & TDF_BLOCKS)
2956 pp_string (buffer, "# BLOCK ");
2957 pp_decimal_int (buffer, bb->index);
2960 pp_string (buffer, " freq:");
2961 pp_decimal_int (buffer, bb->frequency);
2965 pp_string (buffer, " count:");
2966 pp_widest_integer (buffer, bb->count);
2969 if (flags & TDF_LINENO)
2971 block_stmt_iterator bsi;
2973 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
2974 if (get_lineno (bsi_stmt (bsi)) != -1)
2976 pp_string (buffer, ", starting at line ");
2977 pp_decimal_int (buffer, get_lineno (bsi_stmt (bsi)));
2981 newline_and_indent (buffer, indent);
2983 pp_string (buffer, "# PRED:");
2984 pp_write_text_to_stream (buffer);
2985 FOR_EACH_EDGE (e, ei, bb->preds)
2986 if (flags & TDF_SLIM)
2988 pp_string (buffer, " ");
2989 if (e->src == ENTRY_BLOCK_PTR)
2990 pp_string (buffer, "ENTRY");
2992 pp_decimal_int (buffer, e->src->index);
2995 dump_edge_info (buffer->buffer->stream, e, 0);
2996 pp_newline (buffer);
3000 stmt = first_stmt (bb);
3001 if (!stmt || TREE_CODE (stmt) != LABEL_EXPR)
3003 INDENT (indent - 2);
3004 pp_string (buffer, "<bb ");
3005 pp_decimal_int (buffer, bb->index);
3006 pp_string (buffer, ">:");
3007 pp_newline (buffer);
3010 pp_write_text_to_stream (buffer);
3011 check_bb_profile (bb, buffer->buffer->stream);
3014 /* Dumps end of basic block BB to buffer BUFFER indented by INDENT
3018 dump_bb_end (pretty_printer *buffer, basic_block bb, int indent, int flags)
3024 pp_string (buffer, "# SUCC:");
3025 pp_write_text_to_stream (buffer);
3026 FOR_EACH_EDGE (e, ei, bb->succs)
3027 if (flags & TDF_SLIM)
3029 pp_string (buffer, " ");
3030 if (e->dest == EXIT_BLOCK_PTR)
3031 pp_string (buffer, "EXIT");
3033 pp_decimal_int (buffer, e->dest->index);
3036 dump_edge_info (buffer->buffer->stream, e, 1);
3037 pp_newline (buffer);
3040 /* Dump PHI nodes of basic block BB to BUFFER with details described
3041 by FLAGS and indented by INDENT spaces. */
3044 dump_phi_nodes (pretty_printer *buffer, basic_block bb, int indent, int flags)
3046 tree phi = phi_nodes (bb);
3050 for (; phi; phi = PHI_CHAIN (phi))
3052 if (is_gimple_reg (PHI_RESULT (phi)) || (flags & TDF_VOPS))
3055 pp_string (buffer, "# ");
3056 dump_generic_node (buffer, phi, indent, flags, false);
3057 pp_newline (buffer);
3063 /* Dump jump to basic block BB that is represented implicitly in the cfg
3067 pp_cfg_jump (pretty_printer *buffer, basic_block bb)
3071 stmt = first_stmt (bb);
3073 pp_string (buffer, "goto <bb ");
3074 pp_decimal_int (buffer, bb->index);
3075 pp_string (buffer, ">");
3076 if (stmt && TREE_CODE (stmt) == LABEL_EXPR)
3078 pp_string (buffer, " (");
3079 dump_generic_node (buffer, LABEL_EXPR_LABEL (stmt), 0, 0, false);
3080 pp_string (buffer, ")");
3082 pp_semicolon (buffer);
3085 /* Dump edges represented implicitly in basic block BB to BUFFER, indented
3086 by INDENT spaces, with details given by FLAGS. */
3089 dump_implicit_edges (pretty_printer *buffer, basic_block bb, int indent,
3096 stmt = last_stmt (bb);
3097 if (stmt && TREE_CODE (stmt) == COND_EXPR)
3099 edge true_edge, false_edge;
3101 /* When we are emitting the code or changing CFG, it is possible that
3102 the edges are not yet created. When we are using debug_bb in such
3103 a situation, we do not want it to crash. */
3104 if (EDGE_COUNT (bb->succs) != 2)
3106 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
3108 INDENT (indent + 2);
3109 pp_cfg_jump (buffer, true_edge->dest);
3110 newline_and_indent (buffer, indent);
3111 pp_string (buffer, "else");
3112 newline_and_indent (buffer, indent + 2);
3113 pp_cfg_jump (buffer, false_edge->dest);
3114 pp_newline (buffer);
3118 /* If there is a fallthru edge, we may need to add an artificial goto to the
3120 FOR_EACH_EDGE (e, ei, bb->succs)
3121 if (e->flags & EDGE_FALLTHRU)
3123 if (e && e->dest != bb->next_bb)
3127 if ((flags & TDF_LINENO) && e->goto_locus != UNKNOWN_LOCATION)
3129 expanded_location goto_xloc;
3130 goto_xloc = expand_location (e->goto_locus);
3131 pp_character (buffer, '[');
3134 pp_string (buffer, goto_xloc.file);
3135 pp_string (buffer, " : ");
3137 pp_decimal_int (buffer, goto_xloc.line);
3138 pp_string (buffer, "] ");
3141 pp_cfg_jump (buffer, e->dest);
3142 pp_newline (buffer);
3146 /* Dumps basic block BB to buffer BUFFER with details described by FLAGS and
3147 indented by INDENT spaces. */
3150 dump_generic_bb_buff (pretty_printer *buffer, basic_block bb,
3151 int indent, int flags)
3153 block_stmt_iterator bsi;
3155 int label_indent = indent - 2;
3157 if (label_indent < 0)
3160 dump_bb_header (buffer, bb, indent, flags);
3162 dump_phi_nodes (buffer, bb, indent, flags);
3164 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
3168 stmt = bsi_stmt (bsi);
3170 curr_indent = TREE_CODE (stmt) == LABEL_EXPR ? label_indent : indent;
3172 INDENT (curr_indent);
3173 dump_generic_node (buffer, stmt, curr_indent, flags, true);
3174 pp_newline (buffer);
3175 dump_histograms_for_stmt (cfun, buffer->buffer->stream, stmt);
3178 dump_implicit_edges (buffer, bb, indent, flags);
3180 if (flags & TDF_BLOCKS)
3181 dump_bb_end (buffer, bb, indent, flags);