1 /* Pretty formatting of GENERIC trees in C syntax.
2 Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
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 "tree-pretty-print.h"
30 #include "tree-flow.h"
31 #include "langhooks.h"
32 #include "tree-iterator.h"
33 #include "tree-chrec.h"
34 #include "tree-pass.h"
35 #include "value-prof.h"
38 /* Local functions, macros and variables. */
39 static const char *op_symbol (const_tree);
40 static void pretty_print_string (pretty_printer *, const char*);
41 static void newline_and_indent (pretty_printer *, int);
42 static void maybe_init_pretty_print (FILE *);
43 static void print_struct_decl (pretty_printer *, const_tree, int, int);
44 static void do_niy (pretty_printer *, const_tree);
46 #define INDENT(SPACE) do { \
47 int i; for (i = 0; i<SPACE; i++) pp_space (buffer); } while (0)
49 #define NIY do_niy(buffer,node)
51 static pretty_printer buffer;
52 static int initialized = 0;
54 /* Try to print something for an unknown tree code. */
57 do_niy (pretty_printer *buffer, const_tree node)
61 pp_string (buffer, "<<< Unknown tree: ");
62 pp_string (buffer, tree_code_name[(int) TREE_CODE (node)]);
66 len = TREE_OPERAND_LENGTH (node);
67 for (i = 0; i < len; ++i)
69 newline_and_indent (buffer, 2);
70 dump_generic_node (buffer, TREE_OPERAND (node, i), 2, 0, false);
74 pp_string (buffer, " >>>\n");
77 /* Debugging function to print out a generic expression. */
80 debug_generic_expr (tree t)
82 print_generic_expr (stderr, t, TDF_VOPS|TDF_MEMSYMS);
83 fprintf (stderr, "\n");
86 /* Debugging function to print out a generic statement. */
89 debug_generic_stmt (tree t)
91 print_generic_stmt (stderr, t, TDF_VOPS|TDF_MEMSYMS);
92 fprintf (stderr, "\n");
95 /* Debugging function to print out a chain of trees . */
98 debug_tree_chain (tree t)
100 struct pointer_set_t *seen = pointer_set_create ();
104 print_generic_expr (stderr, t, TDF_VOPS|TDF_MEMSYMS|TDF_UID);
105 fprintf (stderr, " ");
107 if (pointer_set_insert (seen, t))
109 fprintf (stderr, "... [cycled back to ");
110 print_generic_expr (stderr, t, TDF_VOPS|TDF_MEMSYMS|TDF_UID);
111 fprintf (stderr, "]");
115 fprintf (stderr, "\n");
117 pointer_set_destroy (seen);
120 /* Prints declaration DECL to the FILE with details specified by FLAGS. */
122 print_generic_decl (FILE *file, tree decl, int flags)
124 maybe_init_pretty_print (file);
125 print_declaration (&buffer, decl, 2, flags);
126 pp_write_text_to_stream (&buffer);
129 /* Print tree T, and its successors, on file FILE. FLAGS specifies details
130 to show in the dump. See TDF_* in tree-pass.h. */
133 print_generic_stmt (FILE *file, tree t, int flags)
135 maybe_init_pretty_print (file);
136 dump_generic_node (&buffer, t, 0, flags, true);
140 /* Print tree T, and its successors, on file FILE. FLAGS specifies details
141 to show in the dump. See TDF_* in tree-pass.h. The output is indented by
145 print_generic_stmt_indented (FILE *file, tree t, int flags, int indent)
149 maybe_init_pretty_print (file);
151 for (i = 0; i < indent; i++)
153 dump_generic_node (&buffer, t, indent, flags, true);
157 /* Print a single expression T on file FILE. FLAGS specifies details to show
158 in the dump. See TDF_* in tree-pass.h. */
161 print_generic_expr (FILE *file, tree t, int flags)
163 maybe_init_pretty_print (file);
164 dump_generic_node (&buffer, t, 0, flags, false);
167 /* Dump the name of a _DECL node and its DECL_UID if TDF_UID is set
171 dump_decl_name (pretty_printer *buffer, tree node, int flags)
173 if (DECL_NAME (node))
175 if ((flags & TDF_ASMNAME) && DECL_ASSEMBLER_NAME_SET_P (node))
176 pp_tree_identifier (buffer, DECL_ASSEMBLER_NAME (node));
178 pp_tree_identifier (buffer, DECL_NAME (node));
180 if ((flags & TDF_UID) || DECL_NAME (node) == NULL_TREE)
182 if (TREE_CODE (node) == LABEL_DECL && LABEL_DECL_UID (node) != -1)
183 pp_printf (buffer, "L.%d", (int) LABEL_DECL_UID (node));
184 else if (TREE_CODE (node) == DEBUG_EXPR_DECL)
186 if (flags & TDF_NOUID)
187 pp_string (buffer, "D#xxxx");
189 pp_printf (buffer, "D#%i", DEBUG_TEMP_UID (node));
193 char c = TREE_CODE (node) == CONST_DECL ? 'C' : 'D';
194 if (flags & TDF_NOUID)
195 pp_printf (buffer, "%c.xxxx", c);
197 pp_printf (buffer, "%c.%u", c, DECL_UID (node));
200 if ((flags & TDF_ALIAS) && DECL_PT_UID (node) != DECL_UID (node))
202 if (flags & TDF_NOUID)
203 pp_printf (buffer, "ptD.xxxx");
205 pp_printf (buffer, "ptD.%u", DECL_PT_UID (node));
209 /* Like the above, but used for pretty printing function calls. */
212 dump_function_name (pretty_printer *buffer, tree node, int flags)
214 if (TREE_CODE (node) == NOP_EXPR)
215 node = TREE_OPERAND (node, 0);
216 if (DECL_NAME (node) && (flags & TDF_ASMNAME) == 0)
217 pp_string (buffer, lang_hooks.decl_printable_name (node, 1));
219 dump_decl_name (buffer, node, flags);
222 /* Dump a function declaration. NODE is the FUNCTION_TYPE. BUFFER, SPC and
223 FLAGS are as in dump_generic_node. */
226 dump_function_declaration (pretty_printer *buffer, tree node,
229 bool wrote_arg = false;
233 pp_character (buffer, '(');
235 /* Print the argument types. The last element in the list is a VOID_TYPE.
236 The following avoids printing the last element. */
237 arg = TYPE_ARG_TYPES (node);
238 while (arg && TREE_CHAIN (arg) && arg != error_mark_node)
241 dump_generic_node (buffer, TREE_VALUE (arg), spc, flags, false);
242 arg = TREE_CHAIN (arg);
243 if (TREE_CHAIN (arg) && TREE_CODE (TREE_CHAIN (arg)) == TREE_LIST)
245 pp_character (buffer, ',');
251 pp_string (buffer, "void");
253 pp_character (buffer, ')');
256 /* Dump the domain associated with an array. */
259 dump_array_domain (pretty_printer *buffer, tree domain, int spc, int flags)
261 pp_character (buffer, '[');
264 tree min = TYPE_MIN_VALUE (domain);
265 tree max = TYPE_MAX_VALUE (domain);
268 && integer_zerop (min)
269 && host_integerp (max, 0))
270 pp_wide_integer (buffer, TREE_INT_CST_LOW (max) + 1);
274 dump_generic_node (buffer, min, spc, flags, false);
275 pp_character (buffer, ':');
277 dump_generic_node (buffer, max, spc, flags, false);
281 pp_string (buffer, "<unknown>");
282 pp_character (buffer, ']');
286 /* Dump OpenMP clause CLAUSE. BUFFER, CLAUSE, SPC and FLAGS are as in
287 dump_generic_node. */
290 dump_omp_clause (pretty_printer *buffer, tree clause, int spc, int flags)
294 switch (OMP_CLAUSE_CODE (clause))
296 case OMP_CLAUSE_PRIVATE:
299 case OMP_CLAUSE_SHARED:
302 case OMP_CLAUSE_FIRSTPRIVATE:
303 name = "firstprivate";
305 case OMP_CLAUSE_LASTPRIVATE:
306 name = "lastprivate";
308 case OMP_CLAUSE_COPYIN:
311 case OMP_CLAUSE_COPYPRIVATE:
312 name = "copyprivate";
315 pp_string (buffer, name);
316 pp_character (buffer, '(');
317 dump_generic_node (buffer, OMP_CLAUSE_DECL (clause),
319 pp_character (buffer, ')');
322 case OMP_CLAUSE_REDUCTION:
323 pp_string (buffer, "reduction(");
324 pp_string (buffer, op_symbol_code (OMP_CLAUSE_REDUCTION_CODE (clause)));
325 pp_character (buffer, ':');
326 dump_generic_node (buffer, OMP_CLAUSE_DECL (clause),
328 pp_character (buffer, ')');
332 pp_string (buffer, "if(");
333 dump_generic_node (buffer, OMP_CLAUSE_IF_EXPR (clause),
335 pp_character (buffer, ')');
338 case OMP_CLAUSE_NUM_THREADS:
339 pp_string (buffer, "num_threads(");
340 dump_generic_node (buffer, OMP_CLAUSE_NUM_THREADS_EXPR (clause),
342 pp_character (buffer, ')');
345 case OMP_CLAUSE_NOWAIT:
346 pp_string (buffer, "nowait");
348 case OMP_CLAUSE_ORDERED:
349 pp_string (buffer, "ordered");
352 case OMP_CLAUSE_DEFAULT:
353 pp_string (buffer, "default(");
354 switch (OMP_CLAUSE_DEFAULT_KIND (clause))
356 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
358 case OMP_CLAUSE_DEFAULT_SHARED:
359 pp_string (buffer, "shared");
361 case OMP_CLAUSE_DEFAULT_NONE:
362 pp_string (buffer, "none");
364 case OMP_CLAUSE_DEFAULT_PRIVATE:
365 pp_string (buffer, "private");
367 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE:
368 pp_string (buffer, "firstprivate");
373 pp_character (buffer, ')');
376 case OMP_CLAUSE_SCHEDULE:
377 pp_string (buffer, "schedule(");
378 switch (OMP_CLAUSE_SCHEDULE_KIND (clause))
380 case OMP_CLAUSE_SCHEDULE_STATIC:
381 pp_string (buffer, "static");
383 case OMP_CLAUSE_SCHEDULE_DYNAMIC:
384 pp_string (buffer, "dynamic");
386 case OMP_CLAUSE_SCHEDULE_GUIDED:
387 pp_string (buffer, "guided");
389 case OMP_CLAUSE_SCHEDULE_RUNTIME:
390 pp_string (buffer, "runtime");
392 case OMP_CLAUSE_SCHEDULE_AUTO:
393 pp_string (buffer, "auto");
398 if (OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (clause))
400 pp_character (buffer, ',');
401 dump_generic_node (buffer,
402 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (clause),
405 pp_character (buffer, ')');
408 case OMP_CLAUSE_UNTIED:
409 pp_string (buffer, "untied");
412 case OMP_CLAUSE_COLLAPSE:
413 pp_string (buffer, "collapse(");
414 dump_generic_node (buffer,
415 OMP_CLAUSE_COLLAPSE_EXPR (clause),
417 pp_character (buffer, ')');
421 /* Should never happen. */
422 dump_generic_node (buffer, clause, spc, flags, false);
428 /* Dump the list of OpenMP clauses. BUFFER, SPC and FLAGS are as in
429 dump_generic_node. */
432 dump_omp_clauses (pretty_printer *buffer, tree clause, int spc, int flags)
440 dump_omp_clause (buffer, clause, spc, flags);
441 clause = OMP_CLAUSE_CHAIN (clause);
449 /* Dump location LOC to BUFFER. */
452 dump_location (pretty_printer *buffer, location_t loc)
454 expanded_location xloc = expand_location (loc);
456 pp_character (buffer, '[');
459 pp_string (buffer, xloc.file);
460 pp_string (buffer, " : ");
462 pp_decimal_int (buffer, xloc.line);
463 pp_string (buffer, "] ");
467 /* Dump lexical block BLOCK. BUFFER, SPC and FLAGS are as in
468 dump_generic_node. */
471 dump_block_node (pretty_printer *buffer, tree block, int spc, int flags)
475 pp_printf (buffer, "BLOCK #%d ", BLOCK_NUMBER (block));
477 if (flags & TDF_ADDRESS)
478 pp_printf (buffer, "[%p] ", (void *) block);
480 if (BLOCK_ABSTRACT (block))
481 pp_string (buffer, "[abstract] ");
483 if (TREE_ASM_WRITTEN (block))
484 pp_string (buffer, "[written] ");
486 if (flags & TDF_SLIM)
489 if (BLOCK_SOURCE_LOCATION (block))
490 dump_location (buffer, BLOCK_SOURCE_LOCATION (block));
492 newline_and_indent (buffer, spc + 2);
494 if (BLOCK_SUPERCONTEXT (block))
496 pp_string (buffer, "SUPERCONTEXT: ");
497 dump_generic_node (buffer, BLOCK_SUPERCONTEXT (block), 0,
498 flags | TDF_SLIM, false);
499 newline_and_indent (buffer, spc + 2);
502 if (BLOCK_SUBBLOCKS (block))
504 pp_string (buffer, "SUBBLOCKS: ");
505 for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t))
507 dump_generic_node (buffer, t, 0, flags | TDF_SLIM, false);
508 pp_string (buffer, " ");
510 newline_and_indent (buffer, spc + 2);
513 if (BLOCK_CHAIN (block))
515 pp_string (buffer, "SIBLINGS: ");
516 for (t = BLOCK_CHAIN (block); t; t = BLOCK_CHAIN (t))
518 dump_generic_node (buffer, t, 0, flags | TDF_SLIM, false);
519 pp_string (buffer, " ");
521 newline_and_indent (buffer, spc + 2);
524 if (BLOCK_VARS (block))
526 pp_string (buffer, "VARS: ");
527 for (t = BLOCK_VARS (block); t; t = TREE_CHAIN (t))
529 dump_generic_node (buffer, t, 0, flags, false);
530 pp_string (buffer, " ");
532 newline_and_indent (buffer, spc + 2);
535 if (VEC_length (tree, BLOCK_NONLOCALIZED_VARS (block)) > 0)
538 VEC(tree,gc) *nlv = BLOCK_NONLOCALIZED_VARS (block);
540 pp_string (buffer, "NONLOCALIZED_VARS: ");
541 for (i = 0; VEC_iterate (tree, nlv, i, t); i++)
543 dump_generic_node (buffer, t, 0, flags, false);
544 pp_string (buffer, " ");
546 newline_and_indent (buffer, spc + 2);
549 if (BLOCK_ABSTRACT_ORIGIN (block))
551 pp_string (buffer, "ABSTRACT_ORIGIN: ");
552 dump_generic_node (buffer, BLOCK_ABSTRACT_ORIGIN (block), 0,
553 flags | TDF_SLIM, false);
554 newline_and_indent (buffer, spc + 2);
557 if (BLOCK_FRAGMENT_ORIGIN (block))
559 pp_string (buffer, "FRAGMENT_ORIGIN: ");
560 dump_generic_node (buffer, BLOCK_FRAGMENT_ORIGIN (block), 0,
561 flags | TDF_SLIM, false);
562 newline_and_indent (buffer, spc + 2);
565 if (BLOCK_FRAGMENT_CHAIN (block))
567 pp_string (buffer, "FRAGMENT_CHAIN: ");
568 for (t = BLOCK_FRAGMENT_CHAIN (block); t; t = BLOCK_FRAGMENT_CHAIN (t))
570 dump_generic_node (buffer, t, 0, flags | TDF_SLIM, false);
571 pp_string (buffer, " ");
573 newline_and_indent (buffer, spc + 2);
578 /* Dump the node NODE on the pretty_printer BUFFER, SPC spaces of
579 indent. FLAGS specifies details to show in the dump (see TDF_* in
580 tree-pass.h). If IS_STMT is true, the object printed is considered
581 to be a statement and it is terminated by ';' if appropriate. */
584 dump_generic_node (pretty_printer *buffer, tree node, int spc, int flags,
592 if (node == NULL_TREE)
595 is_expr = EXPR_P (node);
597 if (is_stmt && (flags & TDF_STMTADDR))
598 pp_printf (buffer, "<&%p> ", (void *)node);
600 if ((flags & TDF_LINENO) && EXPR_HAS_LOCATION (node))
601 dump_location (buffer, EXPR_LOCATION (node));
603 switch (TREE_CODE (node))
606 pp_string (buffer, "<<< error >>>");
609 case IDENTIFIER_NODE:
610 pp_tree_identifier (buffer, node);
614 while (node && node != error_mark_node)
616 if (TREE_PURPOSE (node))
618 dump_generic_node (buffer, TREE_PURPOSE (node), spc, flags, false);
621 dump_generic_node (buffer, TREE_VALUE (node), spc, flags, false);
622 node = TREE_CHAIN (node);
623 if (node && TREE_CODE (node) == TREE_LIST)
625 pp_character (buffer, ',');
632 dump_generic_node (buffer, BINFO_TYPE (node), spc, flags, false);
638 if (TREE_VEC_LENGTH (node) > 0)
640 size_t len = TREE_VEC_LENGTH (node);
641 for (i = 0; i < len - 1; i++)
643 dump_generic_node (buffer, TREE_VEC_ELT (node, i), spc, flags,
645 pp_character (buffer, ',');
648 dump_generic_node (buffer, TREE_VEC_ELT (node, len - 1), spc,
657 case FIXED_POINT_TYPE:
663 unsigned int quals = TYPE_QUALS (node);
664 enum tree_code_class tclass;
666 if (quals & TYPE_QUAL_CONST)
667 pp_string (buffer, "const ");
668 else if (quals & TYPE_QUAL_VOLATILE)
669 pp_string (buffer, "volatile ");
670 else if (quals & TYPE_QUAL_RESTRICT)
671 pp_string (buffer, "restrict ");
673 if (!ADDR_SPACE_GENERIC_P (TYPE_ADDR_SPACE (node)))
675 pp_string (buffer, "<address-space-");
676 pp_decimal_int (buffer, TYPE_ADDR_SPACE (node));
677 pp_string (buffer, "> ");
680 tclass = TREE_CODE_CLASS (TREE_CODE (node));
682 if (tclass == tcc_declaration)
684 if (DECL_NAME (node))
685 dump_decl_name (buffer, node, flags);
687 pp_string (buffer, "<unnamed type decl>");
689 else if (tclass == tcc_type)
691 if (TYPE_NAME (node))
693 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
694 pp_tree_identifier (buffer, TYPE_NAME (node));
695 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
696 && DECL_NAME (TYPE_NAME (node)))
697 dump_decl_name (buffer, TYPE_NAME (node), flags);
699 pp_string (buffer, "<unnamed type>");
701 else if (TREE_CODE (node) == VECTOR_TYPE)
703 pp_string (buffer, "vector");
704 pp_character (buffer, '(');
705 pp_wide_integer (buffer, TYPE_VECTOR_SUBPARTS (node));
706 pp_string (buffer, ") ");
707 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
709 else if (TREE_CODE (node) == INTEGER_TYPE)
711 pp_string (buffer, (TYPE_UNSIGNED (node)
712 ? "<unnamed-unsigned:"
713 : "<unnamed-signed:"));
714 pp_decimal_int (buffer, TYPE_PRECISION (node));
715 pp_string (buffer, ">");
717 else if (TREE_CODE (node) == COMPLEX_TYPE)
719 pp_string (buffer, "__complex__ ");
720 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
722 else if (TREE_CODE (node) == REAL_TYPE)
724 pp_string (buffer, "<float:");
725 pp_decimal_int (buffer, TYPE_PRECISION (node));
726 pp_string (buffer, ">");
728 else if (TREE_CODE (node) == FIXED_POINT_TYPE)
730 pp_string (buffer, "<fixed-point-");
731 pp_string (buffer, TYPE_SATURATING (node) ? "sat:" : "nonsat:");
732 pp_decimal_int (buffer, TYPE_PRECISION (node));
733 pp_string (buffer, ">");
736 pp_string (buffer, "<unnamed type>");
743 str = (TREE_CODE (node) == POINTER_TYPE ? "*" : "&");
745 if (TREE_TYPE (node) == NULL)
747 pp_string (buffer, str);
748 pp_string (buffer, "<null type>");
750 else if (TREE_CODE (TREE_TYPE (node)) == FUNCTION_TYPE)
752 tree fnode = TREE_TYPE (node);
754 dump_generic_node (buffer, TREE_TYPE (fnode), spc, flags, false);
756 pp_character (buffer, '(');
757 pp_string (buffer, str);
758 if (TYPE_NAME (node) && DECL_NAME (TYPE_NAME (node)))
759 dump_decl_name (buffer, TYPE_NAME (node), flags);
761 pp_printf (buffer, "<T%x>", TYPE_UID (node));
763 pp_character (buffer, ')');
764 dump_function_declaration (buffer, fnode, spc, flags);
768 unsigned int quals = TYPE_QUALS (node);
770 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
772 pp_string (buffer, str);
774 if (quals & TYPE_QUAL_CONST)
775 pp_string (buffer, " const");
776 if (quals & TYPE_QUAL_VOLATILE)
777 pp_string (buffer, " volatile");
778 if (quals & TYPE_QUAL_RESTRICT)
779 pp_string (buffer, " restrict");
781 if (!ADDR_SPACE_GENERIC_P (TYPE_ADDR_SPACE (node)))
783 pp_string (buffer, " <address-space-");
784 pp_decimal_int (buffer, TYPE_ADDR_SPACE (node));
785 pp_string (buffer, ">");
788 if (TYPE_REF_CAN_ALIAS_ALL (node))
789 pp_string (buffer, " {ref-all}");
799 if (integer_zerop (TREE_OPERAND (node, 1))
800 /* Same pointer types, but ignoring POINTER_TYPE vs.
802 && (TREE_TYPE (TREE_TYPE (TREE_OPERAND (node, 0)))
803 == TREE_TYPE (TREE_TYPE (TREE_OPERAND (node, 1))))
804 && (TYPE_MODE (TREE_TYPE (TREE_OPERAND (node, 0)))
805 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (node, 1))))
806 && (TYPE_REF_CAN_ALIAS_ALL (TREE_TYPE (TREE_OPERAND (node, 0)))
807 == TYPE_REF_CAN_ALIAS_ALL (TREE_TYPE (TREE_OPERAND (node, 1))))
808 && (TYPE_QUALS (TREE_TYPE (TREE_OPERAND (node, 0)))
809 == TYPE_QUALS (TREE_TYPE (TREE_OPERAND (node, 1))))
810 /* Same value types ignoring qualifiers. */
811 && (TYPE_MAIN_VARIANT (TREE_TYPE (node))
813 (TREE_TYPE (TREE_TYPE (TREE_OPERAND (node, 1))))))
815 if (TREE_CODE (TREE_OPERAND (node, 0)) != ADDR_EXPR)
817 pp_string (buffer, "*");
818 dump_generic_node (buffer, TREE_OPERAND (node, 0),
822 dump_generic_node (buffer,
823 TREE_OPERAND (TREE_OPERAND (node, 0), 0),
828 pp_string (buffer, "MEM[");
829 pp_string (buffer, "(");
830 dump_generic_node (buffer, TREE_TYPE (TREE_OPERAND (node, 1)),
832 pp_string (buffer, ")");
833 dump_generic_node (buffer, TREE_OPERAND (node, 0),
835 if (!integer_zerop (TREE_OPERAND (node, 1)))
837 pp_string (buffer, " + ");
838 dump_generic_node (buffer, TREE_OPERAND (node, 1),
841 pp_string (buffer, "]");
848 const char *sep = "";
851 pp_string (buffer, "MEM[");
853 tmp = TMR_SYMBOL (node);
856 pp_string (buffer, sep);
858 pp_string (buffer, "symbol: ");
859 dump_generic_node (buffer, tmp, spc, flags, false);
861 tmp = TMR_BASE (node);
864 pp_string (buffer, sep);
866 pp_string (buffer, "base: ");
867 dump_generic_node (buffer, tmp, spc, flags, false);
869 tmp = TMR_INDEX (node);
872 pp_string (buffer, sep);
874 pp_string (buffer, "index: ");
875 dump_generic_node (buffer, tmp, spc, flags, false);
877 tmp = TMR_STEP (node);
880 pp_string (buffer, sep);
882 pp_string (buffer, "step: ");
883 dump_generic_node (buffer, tmp, spc, flags, false);
885 tmp = TMR_OFFSET (node);
888 pp_string (buffer, sep);
890 pp_string (buffer, "offset: ");
891 dump_generic_node (buffer, tmp, spc, flags, false);
893 pp_string (buffer, "]");
894 if (flags & TDF_DETAILS)
896 pp_string (buffer, "{");
897 dump_generic_node (buffer, TMR_ORIGINAL (node), spc, flags,
899 pp_string (buffer, "}");
908 /* Print the innermost component type. */
909 for (tmp = TREE_TYPE (node); TREE_CODE (tmp) == ARRAY_TYPE;
910 tmp = TREE_TYPE (tmp))
912 dump_generic_node (buffer, tmp, spc, flags, false);
914 /* Print the dimensions. */
915 for (tmp = node; TREE_CODE (tmp) == ARRAY_TYPE; tmp = TREE_TYPE (tmp))
916 dump_array_domain (buffer, TYPE_DOMAIN (tmp), spc, flags);
922 case QUAL_UNION_TYPE:
924 unsigned int quals = TYPE_QUALS (node);
926 if (quals & TYPE_QUAL_CONST)
927 pp_string (buffer, "const ");
928 if (quals & TYPE_QUAL_VOLATILE)
929 pp_string (buffer, "volatile ");
931 /* Print the name of the structure. */
932 if (TREE_CODE (node) == RECORD_TYPE)
933 pp_string (buffer, "struct ");
934 else if (TREE_CODE (node) == UNION_TYPE)
935 pp_string (buffer, "union ");
937 if (TYPE_NAME (node))
938 dump_generic_node (buffer, TYPE_NAME (node), spc, flags, false);
939 else if (!(flags & TDF_SLIM))
940 /* FIXME: If we eliminate the 'else' above and attempt
941 to show the fields for named types, we may get stuck
942 following a cycle of pointers to structs. The alleged
943 self-reference check in print_struct_decl will not detect
944 cycles involving more than one pointer or struct type. */
945 print_struct_decl (buffer, node, spc, flags);
954 if (TREE_CODE (TREE_TYPE (node)) == POINTER_TYPE)
956 /* In the case of a pointer, one may want to divide by the
957 size of the pointed-to type. Unfortunately, this not
958 straightforward. The C front-end maps expressions
963 in such a way that the two INTEGER_CST nodes for "5" have
964 different values but identical types. In the latter
965 case, the 5 is multiplied by sizeof (int) in c-common.c
966 (pointer_int_sum) to convert it to a byte address, and
967 yet the type of the node is left unchanged. Argh. What
968 is consistent though is that the number value corresponds
969 to bytes (UNITS) offset.
971 NB: Neither of the following divisors can be trivially
972 used to recover the original literal:
974 TREE_INT_CST_LOW (TYPE_SIZE_UNIT (TREE_TYPE (node)))
975 TYPE_PRECISION (TREE_TYPE (TREE_TYPE (node))) */
976 pp_wide_integer (buffer, TREE_INT_CST_LOW (node));
977 pp_string (buffer, "B"); /* pseudo-unit */
979 else if (! host_integerp (node, 0))
982 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (val);
983 HOST_WIDE_INT high = TREE_INT_CST_HIGH (val);
985 if (tree_int_cst_sgn (val) < 0)
987 pp_character (buffer, '-');
991 /* Would "%x%0*x" or "%x%*0x" get zero-padding on all
993 sprintf (pp_buffer (buffer)->digit_buffer,
994 HOST_WIDE_INT_PRINT_DOUBLE_HEX,
995 (unsigned HOST_WIDE_INT) high, low);
996 pp_string (buffer, pp_buffer (buffer)->digit_buffer);
999 pp_wide_integer (buffer, TREE_INT_CST_LOW (node));
1003 /* Code copied from print_node. */
1006 if (TREE_OVERFLOW (node))
1007 pp_string (buffer, " overflow");
1009 #if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
1010 d = TREE_REAL_CST (node);
1011 if (REAL_VALUE_ISINF (d))
1012 pp_string (buffer, REAL_VALUE_NEGATIVE (d) ? " -Inf" : " Inf");
1013 else if (REAL_VALUE_ISNAN (d))
1014 pp_string (buffer, " Nan");
1018 real_to_decimal (string, &d, sizeof (string), 0, 1);
1019 pp_string (buffer, string);
1024 unsigned char *p = (unsigned char *) &TREE_REAL_CST (node);
1025 pp_string (buffer, "0x");
1026 for (i = 0; i < sizeof TREE_REAL_CST (node); i++)
1027 output_formatted_integer (buffer, "%02x", *p++);
1036 fixed_to_decimal (string, TREE_FIXED_CST_PTR (node), sizeof (string));
1037 pp_string (buffer, string);
1042 pp_string (buffer, "__complex__ (");
1043 dump_generic_node (buffer, TREE_REALPART (node), spc, flags, false);
1044 pp_string (buffer, ", ");
1045 dump_generic_node (buffer, TREE_IMAGPART (node), spc, flags, false);
1046 pp_string (buffer, ")");
1050 pp_string (buffer, "\"");
1051 pretty_print_string (buffer, TREE_STRING_POINTER (node));
1052 pp_string (buffer, "\"");
1058 pp_string (buffer, "{ ");
1059 for (elt = TREE_VECTOR_CST_ELTS (node); elt; elt = TREE_CHAIN (elt))
1061 dump_generic_node (buffer, TREE_VALUE (elt), spc, flags, false);
1062 if (TREE_CHAIN (elt))
1063 pp_string (buffer, ", ");
1065 pp_string (buffer, " }");
1071 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
1073 if (TREE_CODE (node) == METHOD_TYPE)
1075 if (TYPE_METHOD_BASETYPE (node))
1076 dump_decl_name (buffer, TYPE_NAME (TYPE_METHOD_BASETYPE (node)),
1079 pp_string (buffer, "<null method basetype>");
1080 pp_string (buffer, "::");
1082 if (TYPE_NAME (node) && DECL_NAME (TYPE_NAME (node)))
1083 dump_decl_name (buffer, TYPE_NAME (node), flags);
1085 pp_printf (buffer, "<T%x>", TYPE_UID (node));
1086 dump_function_declaration (buffer, node, spc, flags);
1091 dump_decl_name (buffer, node, flags);
1095 if (DECL_NAME (node))
1096 dump_decl_name (buffer, node, flags);
1097 else if (LABEL_DECL_UID (node) != -1)
1098 pp_printf (buffer, "<L%d>", (int) LABEL_DECL_UID (node));
1101 if (flags & TDF_NOUID)
1102 pp_string (buffer, "<D.xxxx>");
1104 pp_printf (buffer, "<D.%u>", DECL_UID (node));
1109 if (DECL_IS_BUILTIN (node))
1111 /* Don't print the declaration of built-in types. */
1114 if (DECL_NAME (node))
1115 dump_decl_name (buffer, node, flags);
1118 if ((TREE_CODE (TREE_TYPE (node)) == RECORD_TYPE
1119 || TREE_CODE (TREE_TYPE (node)) == UNION_TYPE)
1120 && TYPE_METHODS (TREE_TYPE (node)))
1122 /* The type is a c++ class: all structures have at least
1124 pp_string (buffer, "class ");
1125 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
1130 (TREE_CODE (TREE_TYPE (node)) == UNION_TYPE
1131 ? "union" : "struct "));
1132 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
1140 case DEBUG_EXPR_DECL:
1141 case NAMESPACE_DECL:
1142 dump_decl_name (buffer, node, flags);
1146 pp_string (buffer, "<retval>");
1150 op0 = TREE_OPERAND (node, 0);
1153 && (TREE_CODE (op0) == INDIRECT_REF
1154 || (TREE_CODE (op0) == MEM_REF
1155 && TREE_CODE (TREE_OPERAND (op0, 0)) != ADDR_EXPR
1156 && integer_zerop (TREE_OPERAND (op0, 1))
1157 /* Same pointer types, but ignoring POINTER_TYPE vs.
1159 && (TREE_TYPE (TREE_TYPE (TREE_OPERAND (op0, 0)))
1160 == TREE_TYPE (TREE_TYPE (TREE_OPERAND (op0, 1))))
1161 && (TYPE_MODE (TREE_TYPE (TREE_OPERAND (op0, 0)))
1162 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (op0, 1))))
1163 && (TYPE_REF_CAN_ALIAS_ALL (TREE_TYPE (TREE_OPERAND (op0, 0)))
1164 == TYPE_REF_CAN_ALIAS_ALL (TREE_TYPE (TREE_OPERAND (op0, 1))))
1165 && (TYPE_QUALS (TREE_TYPE (TREE_OPERAND (op0, 0)))
1166 == TYPE_QUALS (TREE_TYPE (TREE_OPERAND (op0, 1))))
1167 /* Same value types ignoring qualifiers. */
1168 && (TYPE_MAIN_VARIANT (TREE_TYPE (op0))
1169 == TYPE_MAIN_VARIANT
1170 (TREE_TYPE (TREE_TYPE (TREE_OPERAND (op0, 1))))))))
1172 op0 = TREE_OPERAND (op0, 0);
1175 if (op_prio (op0) < op_prio (node))
1176 pp_character (buffer, '(');
1177 dump_generic_node (buffer, op0, spc, flags, false);
1178 if (op_prio (op0) < op_prio (node))
1179 pp_character (buffer, ')');
1180 pp_string (buffer, str);
1181 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1182 op0 = component_ref_field_offset (node);
1183 if (op0 && TREE_CODE (op0) != INTEGER_CST)
1185 pp_string (buffer, "{off: ");
1186 dump_generic_node (buffer, op0, spc, flags, false);
1187 pp_character (buffer, '}');
1192 pp_string (buffer, "BIT_FIELD_REF <");
1193 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1194 pp_string (buffer, ", ");
1195 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1196 pp_string (buffer, ", ");
1197 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
1198 pp_string (buffer, ">");
1202 case ARRAY_RANGE_REF:
1203 op0 = TREE_OPERAND (node, 0);
1204 if (op_prio (op0) < op_prio (node))
1205 pp_character (buffer, '(');
1206 dump_generic_node (buffer, op0, spc, flags, false);
1207 if (op_prio (op0) < op_prio (node))
1208 pp_character (buffer, ')');
1209 pp_character (buffer, '[');
1210 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1211 if (TREE_CODE (node) == ARRAY_RANGE_REF)
1212 pp_string (buffer, " ...");
1213 pp_character (buffer, ']');
1215 op0 = array_ref_low_bound (node);
1216 op1 = array_ref_element_size (node);
1218 if (!integer_zerop (op0)
1219 || TREE_OPERAND (node, 2)
1220 || TREE_OPERAND (node, 3))
1222 pp_string (buffer, "{lb: ");
1223 dump_generic_node (buffer, op0, spc, flags, false);
1224 pp_string (buffer, " sz: ");
1225 dump_generic_node (buffer, op1, spc, flags, false);
1226 pp_character (buffer, '}');
1232 unsigned HOST_WIDE_INT ix;
1234 bool is_struct_init = FALSE;
1235 pp_character (buffer, '{');
1236 if (TREE_CODE (TREE_TYPE (node)) == RECORD_TYPE
1237 || TREE_CODE (TREE_TYPE (node)) == UNION_TYPE)
1238 is_struct_init = TRUE;
1239 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (node), ix, field, val)
1241 if (field && is_struct_init)
1243 pp_character (buffer, '.');
1244 dump_generic_node (buffer, field, spc, flags, false);
1245 pp_string (buffer, "=");
1247 if (val && TREE_CODE (val) == ADDR_EXPR)
1248 if (TREE_CODE (TREE_OPERAND (val, 0)) == FUNCTION_DECL)
1249 val = TREE_OPERAND (val, 0);
1250 if (val && TREE_CODE (val) == FUNCTION_DECL)
1251 dump_decl_name (buffer, val, flags);
1253 dump_generic_node (buffer, val, spc, flags, false);
1254 if (ix != VEC_length (constructor_elt, CONSTRUCTOR_ELTS (node)) - 1)
1256 pp_character (buffer, ',');
1260 pp_character (buffer, '}');
1267 if (flags & TDF_SLIM)
1269 pp_string (buffer, "<COMPOUND_EXPR>");
1273 dump_generic_node (buffer, TREE_OPERAND (node, 0),
1274 spc, flags, !(flags & TDF_SLIM));
1275 if (flags & TDF_SLIM)
1276 newline_and_indent (buffer, spc);
1279 pp_character (buffer, ',');
1283 for (tp = &TREE_OPERAND (node, 1);
1284 TREE_CODE (*tp) == COMPOUND_EXPR;
1285 tp = &TREE_OPERAND (*tp, 1))
1287 dump_generic_node (buffer, TREE_OPERAND (*tp, 0),
1288 spc, flags, !(flags & TDF_SLIM));
1289 if (flags & TDF_SLIM)
1290 newline_and_indent (buffer, spc);
1293 pp_character (buffer, ',');
1298 dump_generic_node (buffer, *tp, spc, flags, !(flags & TDF_SLIM));
1302 case STATEMENT_LIST:
1304 tree_stmt_iterator si;
1307 if (flags & TDF_SLIM)
1309 pp_string (buffer, "<STATEMENT_LIST>");
1313 for (si = tsi_start (node); !tsi_end_p (si); tsi_next (&si))
1316 newline_and_indent (buffer, spc);
1319 dump_generic_node (buffer, tsi_stmt (si), spc, flags, true);
1326 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags,
1329 pp_character (buffer, '=');
1330 if (TREE_CODE (node) == MODIFY_EXPR
1331 && MOVE_NONTEMPORAL (node))
1332 pp_string (buffer, "{nt}");
1334 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags,
1339 pp_string (buffer, "TARGET_EXPR <");
1340 dump_generic_node (buffer, TARGET_EXPR_SLOT (node), spc, flags, false);
1341 pp_character (buffer, ',');
1343 dump_generic_node (buffer, TARGET_EXPR_INITIAL (node), spc, flags, false);
1344 pp_character (buffer, '>');
1348 print_declaration (buffer, DECL_EXPR_DECL (node), spc, flags);
1353 if (TREE_TYPE (node) == NULL || TREE_TYPE (node) == void_type_node)
1355 pp_string (buffer, "if (");
1356 dump_generic_node (buffer, COND_EXPR_COND (node), spc, flags, false);
1357 pp_character (buffer, ')');
1358 /* The lowered cond_exprs should always be printed in full. */
1359 if (COND_EXPR_THEN (node)
1360 && (IS_EMPTY_STMT (COND_EXPR_THEN (node))
1361 || TREE_CODE (COND_EXPR_THEN (node)) == GOTO_EXPR)
1362 && COND_EXPR_ELSE (node)
1363 && (IS_EMPTY_STMT (COND_EXPR_ELSE (node))
1364 || TREE_CODE (COND_EXPR_ELSE (node)) == GOTO_EXPR))
1367 dump_generic_node (buffer, COND_EXPR_THEN (node),
1369 if (!IS_EMPTY_STMT (COND_EXPR_ELSE (node)))
1371 pp_string (buffer, " else ");
1372 dump_generic_node (buffer, COND_EXPR_ELSE (node),
1376 else if (!(flags & TDF_SLIM))
1378 /* Output COND_EXPR_THEN. */
1379 if (COND_EXPR_THEN (node))
1381 newline_and_indent (buffer, spc+2);
1382 pp_character (buffer, '{');
1383 newline_and_indent (buffer, spc+4);
1384 dump_generic_node (buffer, COND_EXPR_THEN (node), spc+4,
1386 newline_and_indent (buffer, spc+2);
1387 pp_character (buffer, '}');
1390 /* Output COND_EXPR_ELSE. */
1391 if (COND_EXPR_ELSE (node)
1392 && !IS_EMPTY_STMT (COND_EXPR_ELSE (node)))
1394 newline_and_indent (buffer, spc);
1395 pp_string (buffer, "else");
1396 newline_and_indent (buffer, spc+2);
1397 pp_character (buffer, '{');
1398 newline_and_indent (buffer, spc+4);
1399 dump_generic_node (buffer, COND_EXPR_ELSE (node), spc+4,
1401 newline_and_indent (buffer, spc+2);
1402 pp_character (buffer, '}');
1409 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1411 pp_character (buffer, '?');
1413 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1415 pp_character (buffer, ':');
1417 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
1422 pp_character (buffer, '{');
1423 if (!(flags & TDF_SLIM))
1425 if (BIND_EXPR_VARS (node))
1427 pp_newline (buffer);
1429 for (op0 = BIND_EXPR_VARS (node); op0; op0 = TREE_CHAIN (op0))
1431 print_declaration (buffer, op0, spc+2, flags);
1432 pp_newline (buffer);
1436 newline_and_indent (buffer, spc+2);
1437 dump_generic_node (buffer, BIND_EXPR_BODY (node), spc+2, flags, true);
1438 newline_and_indent (buffer, spc);
1439 pp_character (buffer, '}');
1445 print_call_name (buffer, CALL_EXPR_FN (node), flags);
1447 /* Print parameters. */
1449 pp_character (buffer, '(');
1452 call_expr_arg_iterator iter;
1453 FOR_EACH_CALL_EXPR_ARG (arg, iter, node)
1455 dump_generic_node (buffer, arg, spc, flags, false);
1456 if (more_call_expr_args_p (&iter))
1458 pp_character (buffer, ',');
1463 if (CALL_EXPR_VA_ARG_PACK (node))
1465 if (call_expr_nargs (node) > 0)
1467 pp_character (buffer, ',');
1470 pp_string (buffer, "__builtin_va_arg_pack ()");
1472 pp_character (buffer, ')');
1474 op1 = CALL_EXPR_STATIC_CHAIN (node);
1477 pp_string (buffer, " [static-chain: ");
1478 dump_generic_node (buffer, op1, spc, flags, false);
1479 pp_character (buffer, ']');
1482 if (CALL_EXPR_RETURN_SLOT_OPT (node))
1483 pp_string (buffer, " [return slot optimization]");
1484 if (CALL_EXPR_TAILCALL (node))
1485 pp_string (buffer, " [tail call]");
1488 case WITH_CLEANUP_EXPR:
1492 case CLEANUP_POINT_EXPR:
1493 pp_string (buffer, "<<cleanup_point ");
1494 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1495 pp_string (buffer, ">>");
1498 case PLACEHOLDER_EXPR:
1499 pp_string (buffer, "<PLACEHOLDER_EXPR ");
1500 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
1501 pp_character (buffer, '>');
1504 /* Binary arithmetic and logic expressions. */
1505 case WIDEN_SUM_EXPR:
1506 case WIDEN_MULT_EXPR:
1509 case POINTER_PLUS_EXPR:
1511 case TRUNC_DIV_EXPR:
1513 case FLOOR_DIV_EXPR:
1514 case ROUND_DIV_EXPR:
1515 case TRUNC_MOD_EXPR:
1517 case FLOOR_MOD_EXPR:
1518 case ROUND_MOD_EXPR:
1520 case EXACT_DIV_EXPR:
1525 case VEC_LSHIFT_EXPR:
1526 case VEC_RSHIFT_EXPR:
1530 case TRUTH_ANDIF_EXPR:
1531 case TRUTH_ORIF_EXPR:
1532 case TRUTH_AND_EXPR:
1534 case TRUTH_XOR_EXPR:
1548 case UNORDERED_EXPR:
1550 const char *op = op_symbol (node);
1551 op0 = TREE_OPERAND (node, 0);
1552 op1 = TREE_OPERAND (node, 1);
1554 /* When the operands are expressions with less priority,
1555 keep semantics of the tree representation. */
1556 if (op_prio (op0) <= op_prio (node))
1558 pp_character (buffer, '(');
1559 dump_generic_node (buffer, op0, spc, flags, false);
1560 pp_character (buffer, ')');
1563 dump_generic_node (buffer, op0, spc, flags, false);
1566 pp_string (buffer, op);
1569 /* When the operands are expressions with less priority,
1570 keep semantics of the tree representation. */
1571 if (op_prio (op1) <= op_prio (node))
1573 pp_character (buffer, '(');
1574 dump_generic_node (buffer, op1, spc, flags, false);
1575 pp_character (buffer, ')');
1578 dump_generic_node (buffer, op1, spc, flags, false);
1582 /* Unary arithmetic and logic expressions. */
1585 case TRUTH_NOT_EXPR:
1587 case PREDECREMENT_EXPR:
1588 case PREINCREMENT_EXPR:
1589 case MISALIGNED_INDIRECT_REF:
1591 if (TREE_CODE (node) == ADDR_EXPR
1592 && (TREE_CODE (TREE_OPERAND (node, 0)) == STRING_CST
1593 || TREE_CODE (TREE_OPERAND (node, 0)) == FUNCTION_DECL))
1594 ; /* Do not output '&' for strings and function pointers. */
1596 pp_string (buffer, op_symbol (node));
1598 if (op_prio (TREE_OPERAND (node, 0)) < op_prio (node))
1600 pp_character (buffer, '(');
1601 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1602 pp_character (buffer, ')');
1605 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1607 if (TREE_CODE (node) == MISALIGNED_INDIRECT_REF)
1609 pp_string (buffer, "{misalignment: ");
1610 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1611 pp_character (buffer, '}');
1615 case POSTDECREMENT_EXPR:
1616 case POSTINCREMENT_EXPR:
1617 if (op_prio (TREE_OPERAND (node, 0)) < op_prio (node))
1619 pp_character (buffer, '(');
1620 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1621 pp_character (buffer, ')');
1624 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1625 pp_string (buffer, op_symbol (node));
1629 pp_string (buffer, "MIN_EXPR <");
1630 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1631 pp_string (buffer, ", ");
1632 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1633 pp_character (buffer, '>');
1637 pp_string (buffer, "MAX_EXPR <");
1638 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1639 pp_string (buffer, ", ");
1640 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1641 pp_character (buffer, '>');
1645 pp_string (buffer, "ABS_EXPR <");
1646 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1647 pp_character (buffer, '>');
1654 case ADDR_SPACE_CONVERT_EXPR:
1655 case FIXED_CONVERT_EXPR:
1656 case FIX_TRUNC_EXPR:
1659 type = TREE_TYPE (node);
1660 op0 = TREE_OPERAND (node, 0);
1661 if (type != TREE_TYPE (op0))
1663 pp_character (buffer, '(');
1664 dump_generic_node (buffer, type, spc, flags, false);
1665 pp_string (buffer, ") ");
1667 if (op_prio (op0) < op_prio (node))
1668 pp_character (buffer, '(');
1669 dump_generic_node (buffer, op0, spc, flags, false);
1670 if (op_prio (op0) < op_prio (node))
1671 pp_character (buffer, ')');
1674 case VIEW_CONVERT_EXPR:
1675 pp_string (buffer, "VIEW_CONVERT_EXPR<");
1676 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
1677 pp_string (buffer, ">(");
1678 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1679 pp_character (buffer, ')');
1683 pp_string (buffer, "((");
1684 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1685 pp_string (buffer, "))");
1688 case NON_LVALUE_EXPR:
1689 pp_string (buffer, "NON_LVALUE_EXPR <");
1690 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1691 pp_character (buffer, '>');
1695 pp_string (buffer, "SAVE_EXPR <");
1696 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1697 pp_character (buffer, '>');
1701 pp_string (buffer, "COMPLEX_EXPR <");
1702 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1703 pp_string (buffer, ", ");
1704 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1705 pp_string (buffer, ">");
1709 pp_string (buffer, "CONJ_EXPR <");
1710 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1711 pp_string (buffer, ">");
1715 pp_string (buffer, "REALPART_EXPR <");
1716 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1717 pp_string (buffer, ">");
1721 pp_string (buffer, "IMAGPART_EXPR <");
1722 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1723 pp_string (buffer, ">");
1727 pp_string (buffer, "VA_ARG_EXPR <");
1728 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1729 pp_string (buffer, ">");
1732 case TRY_FINALLY_EXPR:
1733 case TRY_CATCH_EXPR:
1734 pp_string (buffer, "try");
1735 newline_and_indent (buffer, spc+2);
1736 pp_string (buffer, "{");
1737 newline_and_indent (buffer, spc+4);
1738 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc+4, flags, true);
1739 newline_and_indent (buffer, spc+2);
1740 pp_string (buffer, "}");
1741 newline_and_indent (buffer, spc);
1743 (TREE_CODE (node) == TRY_CATCH_EXPR) ? "catch" : "finally");
1744 newline_and_indent (buffer, spc+2);
1745 pp_string (buffer, "{");
1746 newline_and_indent (buffer, spc+4);
1747 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc+4, flags, true);
1748 newline_and_indent (buffer, spc+2);
1749 pp_string (buffer, "}");
1754 pp_string (buffer, "catch (");
1755 dump_generic_node (buffer, CATCH_TYPES (node), spc+2, flags, false);
1756 pp_string (buffer, ")");
1757 newline_and_indent (buffer, spc+2);
1758 pp_string (buffer, "{");
1759 newline_and_indent (buffer, spc+4);
1760 dump_generic_node (buffer, CATCH_BODY (node), spc+4, flags, true);
1761 newline_and_indent (buffer, spc+2);
1762 pp_string (buffer, "}");
1766 case EH_FILTER_EXPR:
1767 pp_string (buffer, "<<<eh_filter (");
1768 dump_generic_node (buffer, EH_FILTER_TYPES (node), spc+2, flags, false);
1769 pp_string (buffer, ")>>>");
1770 newline_and_indent (buffer, spc+2);
1771 pp_string (buffer, "{");
1772 newline_and_indent (buffer, spc+4);
1773 dump_generic_node (buffer, EH_FILTER_FAILURE (node), spc+4, flags, true);
1774 newline_and_indent (buffer, spc+2);
1775 pp_string (buffer, "}");
1780 op0 = TREE_OPERAND (node, 0);
1781 /* If this is for break or continue, don't bother printing it. */
1782 if (DECL_NAME (op0))
1784 const char *name = IDENTIFIER_POINTER (DECL_NAME (op0));
1785 if (strcmp (name, "break") == 0
1786 || strcmp (name, "continue") == 0)
1789 dump_generic_node (buffer, op0, spc, flags, false);
1790 pp_character (buffer, ':');
1791 if (DECL_NONLOCAL (op0))
1792 pp_string (buffer, " [non-local]");
1796 pp_string (buffer, "while (1)");
1797 if (!(flags & TDF_SLIM))
1799 newline_and_indent (buffer, spc+2);
1800 pp_character (buffer, '{');
1801 newline_and_indent (buffer, spc+4);
1802 dump_generic_node (buffer, LOOP_EXPR_BODY (node), spc+4, flags, true);
1803 newline_and_indent (buffer, spc+2);
1804 pp_character (buffer, '}');
1810 pp_string (buffer, "// predicted ");
1811 if (PREDICT_EXPR_OUTCOME (node))
1812 pp_string (buffer, "likely by ");
1814 pp_string (buffer, "unlikely by ");
1815 pp_string (buffer, predictor_name (PREDICT_EXPR_PREDICTOR (node)));
1816 pp_string (buffer, " predictor.");
1820 pp_string (buffer, "return");
1821 op0 = TREE_OPERAND (node, 0);
1825 if (TREE_CODE (op0) == MODIFY_EXPR)
1826 dump_generic_node (buffer, TREE_OPERAND (op0, 1),
1829 dump_generic_node (buffer, op0, spc, flags, false);
1834 pp_string (buffer, "if (");
1835 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1836 pp_string (buffer, ") break");
1840 pp_string (buffer, "switch (");
1841 dump_generic_node (buffer, SWITCH_COND (node), spc, flags, false);
1842 pp_character (buffer, ')');
1843 if (!(flags & TDF_SLIM))
1845 newline_and_indent (buffer, spc+2);
1846 pp_character (buffer, '{');
1847 if (SWITCH_BODY (node))
1849 newline_and_indent (buffer, spc+4);
1850 dump_generic_node (buffer, SWITCH_BODY (node), spc+4, flags,
1855 tree vec = SWITCH_LABELS (node);
1856 size_t i, n = TREE_VEC_LENGTH (vec);
1857 for (i = 0; i < n; ++i)
1859 tree elt = TREE_VEC_ELT (vec, i);
1860 newline_and_indent (buffer, spc+4);
1863 dump_generic_node (buffer, elt, spc+4, flags, false);
1864 pp_string (buffer, " goto ");
1865 dump_generic_node (buffer, CASE_LABEL (elt), spc+4,
1867 pp_semicolon (buffer);
1870 pp_string (buffer, "case ???: goto ???;");
1873 newline_and_indent (buffer, spc+2);
1874 pp_character (buffer, '}');
1880 op0 = GOTO_DESTINATION (node);
1881 if (TREE_CODE (op0) != SSA_NAME && DECL_P (op0) && DECL_NAME (op0))
1883 const char *name = IDENTIFIER_POINTER (DECL_NAME (op0));
1884 if (strcmp (name, "break") == 0
1885 || strcmp (name, "continue") == 0)
1887 pp_string (buffer, name);
1891 pp_string (buffer, "goto ");
1892 dump_generic_node (buffer, op0, spc, flags, false);
1896 pp_string (buffer, "__asm__");
1897 if (ASM_VOLATILE_P (node))
1898 pp_string (buffer, " __volatile__");
1899 pp_character (buffer, '(');
1900 dump_generic_node (buffer, ASM_STRING (node), spc, flags, false);
1901 pp_character (buffer, ':');
1902 dump_generic_node (buffer, ASM_OUTPUTS (node), spc, flags, false);
1903 pp_character (buffer, ':');
1904 dump_generic_node (buffer, ASM_INPUTS (node), spc, flags, false);
1905 if (ASM_CLOBBERS (node))
1907 pp_character (buffer, ':');
1908 dump_generic_node (buffer, ASM_CLOBBERS (node), spc, flags, false);
1910 pp_string (buffer, ")");
1913 case CASE_LABEL_EXPR:
1914 if (CASE_LOW (node) && CASE_HIGH (node))
1916 pp_string (buffer, "case ");
1917 dump_generic_node (buffer, CASE_LOW (node), spc, flags, false);
1918 pp_string (buffer, " ... ");
1919 dump_generic_node (buffer, CASE_HIGH (node), spc, flags, false);
1921 else if (CASE_LOW (node))
1923 pp_string (buffer, "case ");
1924 dump_generic_node (buffer, CASE_LOW (node), spc, flags, false);
1927 pp_string (buffer, "default");
1928 pp_character (buffer, ':');
1932 pp_string (buffer, "OBJ_TYPE_REF(");
1933 dump_generic_node (buffer, OBJ_TYPE_REF_EXPR (node), spc, flags, false);
1934 pp_character (buffer, ';');
1935 dump_generic_node (buffer, OBJ_TYPE_REF_OBJECT (node), spc, flags, false);
1936 pp_character (buffer, '-');
1937 pp_character (buffer, '>');
1938 dump_generic_node (buffer, OBJ_TYPE_REF_TOKEN (node), spc, flags, false);
1939 pp_character (buffer, ')');
1943 dump_generic_node (buffer, SSA_NAME_VAR (node), spc, flags, false);
1944 pp_string (buffer, "_");
1945 pp_decimal_int (buffer, SSA_NAME_VERSION (node));
1946 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (node))
1947 pp_string (buffer, "(ab)");
1948 else if (SSA_NAME_IS_DEFAULT_DEF (node))
1949 pp_string (buffer, "(D)");
1952 case WITH_SIZE_EXPR:
1953 pp_string (buffer, "WITH_SIZE_EXPR <");
1954 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1955 pp_string (buffer, ", ");
1956 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1957 pp_string (buffer, ">");
1961 pp_string (buffer, "ASSERT_EXPR <");
1962 dump_generic_node (buffer, ASSERT_EXPR_VAR (node), spc, flags, false);
1963 pp_string (buffer, ", ");
1964 dump_generic_node (buffer, ASSERT_EXPR_COND (node), spc, flags, false);
1965 pp_string (buffer, ">");
1969 pp_string (buffer, "scev_known");
1972 case SCEV_NOT_KNOWN:
1973 pp_string (buffer, "scev_not_known");
1976 case POLYNOMIAL_CHREC:
1977 pp_string (buffer, "{");
1978 dump_generic_node (buffer, CHREC_LEFT (node), spc, flags, false);
1979 pp_string (buffer, ", +, ");
1980 dump_generic_node (buffer, CHREC_RIGHT (node), spc, flags, false);
1981 pp_string (buffer, "}_");
1982 dump_generic_node (buffer, CHREC_VAR (node), spc, flags, false);
1986 case REALIGN_LOAD_EXPR:
1987 pp_string (buffer, "REALIGN_LOAD <");
1988 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1989 pp_string (buffer, ", ");
1990 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1991 pp_string (buffer, ", ");
1992 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
1993 pp_string (buffer, ">");
1997 pp_string (buffer, " VEC_COND_EXPR < ");
1998 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1999 pp_string (buffer, " , ");
2000 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2001 pp_string (buffer, " , ");
2002 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
2003 pp_string (buffer, " > ");
2007 pp_string (buffer, " DOT_PROD_EXPR < ");
2008 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2009 pp_string (buffer, ", ");
2010 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2011 pp_string (buffer, ", ");
2012 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
2013 pp_string (buffer, " > ");
2016 case WIDEN_MULT_PLUS_EXPR:
2017 pp_string (buffer, " WIDEN_MULT_PLUS_EXPR < ");
2018 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2019 pp_string (buffer, ", ");
2020 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2021 pp_string (buffer, ", ");
2022 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
2023 pp_string (buffer, " > ");
2026 case WIDEN_MULT_MINUS_EXPR:
2027 pp_string (buffer, " WIDEN_MULT_MINUS_EXPR < ");
2028 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2029 pp_string (buffer, ", ");
2030 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2031 pp_string (buffer, ", ");
2032 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
2033 pp_string (buffer, " > ");
2037 pp_string (buffer, "#pragma omp parallel");
2038 dump_omp_clauses (buffer, OMP_PARALLEL_CLAUSES (node), spc, flags);
2041 if (!(flags & TDF_SLIM) && OMP_BODY (node))
2043 newline_and_indent (buffer, spc + 2);
2044 pp_character (buffer, '{');
2045 newline_and_indent (buffer, spc + 4);
2046 dump_generic_node (buffer, OMP_BODY (node), spc + 4, flags, false);
2047 newline_and_indent (buffer, spc + 2);
2048 pp_character (buffer, '}');
2054 pp_string (buffer, "#pragma omp task");
2055 dump_omp_clauses (buffer, OMP_TASK_CLAUSES (node), spc, flags);
2059 pp_string (buffer, "#pragma omp for");
2060 dump_omp_clauses (buffer, OMP_FOR_CLAUSES (node), spc, flags);
2062 if (!(flags & TDF_SLIM))
2066 if (OMP_FOR_PRE_BODY (node))
2068 newline_and_indent (buffer, spc + 2);
2069 pp_character (buffer, '{');
2071 newline_and_indent (buffer, spc);
2072 dump_generic_node (buffer, OMP_FOR_PRE_BODY (node),
2076 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (node)); i++)
2079 newline_and_indent (buffer, spc);
2080 pp_string (buffer, "for (");
2081 dump_generic_node (buffer, TREE_VEC_ELT (OMP_FOR_INIT (node), i),
2083 pp_string (buffer, "; ");
2084 dump_generic_node (buffer, TREE_VEC_ELT (OMP_FOR_COND (node), i),
2086 pp_string (buffer, "; ");
2087 dump_generic_node (buffer, TREE_VEC_ELT (OMP_FOR_INCR (node), i),
2089 pp_string (buffer, ")");
2091 if (OMP_FOR_BODY (node))
2093 newline_and_indent (buffer, spc + 2);
2094 pp_character (buffer, '{');
2095 newline_and_indent (buffer, spc + 4);
2096 dump_generic_node (buffer, OMP_FOR_BODY (node), spc + 4, flags,
2098 newline_and_indent (buffer, spc + 2);
2099 pp_character (buffer, '}');
2101 spc -= 2 * TREE_VEC_LENGTH (OMP_FOR_INIT (node)) - 2;
2102 if (OMP_FOR_PRE_BODY (node))
2105 newline_and_indent (buffer, spc + 2);
2106 pp_character (buffer, '}');
2113 pp_string (buffer, "#pragma omp sections");
2114 dump_omp_clauses (buffer, OMP_SECTIONS_CLAUSES (node), spc, flags);
2118 pp_string (buffer, "#pragma omp section");
2122 pp_string (buffer, "#pragma omp master");
2126 pp_string (buffer, "#pragma omp ordered");
2130 pp_string (buffer, "#pragma omp critical");
2131 if (OMP_CRITICAL_NAME (node))
2134 pp_character (buffer, '(');
2135 dump_generic_node (buffer, OMP_CRITICAL_NAME (node), spc,
2137 pp_character (buffer, ')');
2142 pp_string (buffer, "#pragma omp atomic");
2143 newline_and_indent (buffer, spc + 2);
2144 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2146 pp_character (buffer, '=');
2148 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2152 pp_string (buffer, "#pragma omp single");
2153 dump_omp_clauses (buffer, OMP_SINGLE_CLAUSES (node), spc, flags);
2157 dump_omp_clause (buffer, node, spc, flags);
2161 case REDUC_MAX_EXPR:
2162 pp_string (buffer, " REDUC_MAX_EXPR < ");
2163 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2164 pp_string (buffer, " > ");
2167 case REDUC_MIN_EXPR:
2168 pp_string (buffer, " REDUC_MIN_EXPR < ");
2169 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2170 pp_string (buffer, " > ");
2173 case REDUC_PLUS_EXPR:
2174 pp_string (buffer, " REDUC_PLUS_EXPR < ");
2175 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2176 pp_string (buffer, " > ");
2179 case VEC_WIDEN_MULT_HI_EXPR:
2180 pp_string (buffer, " VEC_WIDEN_MULT_HI_EXPR < ");
2181 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2182 pp_string (buffer, ", ");
2183 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2184 pp_string (buffer, " > ");
2187 case VEC_WIDEN_MULT_LO_EXPR:
2188 pp_string (buffer, " VEC_WIDEN_MULT_LO_EXPR < ");
2189 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2190 pp_string (buffer, ", ");
2191 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2192 pp_string (buffer, " > ");
2195 case VEC_UNPACK_HI_EXPR:
2196 pp_string (buffer, " VEC_UNPACK_HI_EXPR < ");
2197 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2198 pp_string (buffer, " > ");
2201 case VEC_UNPACK_LO_EXPR:
2202 pp_string (buffer, " VEC_UNPACK_LO_EXPR < ");
2203 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2204 pp_string (buffer, " > ");
2207 case VEC_UNPACK_FLOAT_HI_EXPR:
2208 pp_string (buffer, " VEC_UNPACK_FLOAT_HI_EXPR < ");
2209 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2210 pp_string (buffer, " > ");
2213 case VEC_UNPACK_FLOAT_LO_EXPR:
2214 pp_string (buffer, " VEC_UNPACK_FLOAT_LO_EXPR < ");
2215 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2216 pp_string (buffer, " > ");
2219 case VEC_PACK_TRUNC_EXPR:
2220 pp_string (buffer, " VEC_PACK_TRUNC_EXPR < ");
2221 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2222 pp_string (buffer, ", ");
2223 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2224 pp_string (buffer, " > ");
2227 case VEC_PACK_SAT_EXPR:
2228 pp_string (buffer, " VEC_PACK_SAT_EXPR < ");
2229 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2230 pp_string (buffer, ", ");
2231 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2232 pp_string (buffer, " > ");
2235 case VEC_PACK_FIX_TRUNC_EXPR:
2236 pp_string (buffer, " VEC_PACK_FIX_TRUNC_EXPR < ");
2237 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2238 pp_string (buffer, ", ");
2239 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2240 pp_string (buffer, " > ");
2244 dump_block_node (buffer, node, spc, flags);
2247 case VEC_EXTRACT_EVEN_EXPR:
2248 pp_string (buffer, " VEC_EXTRACT_EVEN_EXPR < ");
2249 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2250 pp_string (buffer, ", ");
2251 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2252 pp_string (buffer, " > ");
2255 case VEC_EXTRACT_ODD_EXPR:
2256 pp_string (buffer, " VEC_EXTRACT_ODD_EXPR < ");
2257 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2258 pp_string (buffer, ", ");
2259 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2260 pp_string (buffer, " > ");
2263 case VEC_INTERLEAVE_HIGH_EXPR:
2264 pp_string (buffer, " VEC_INTERLEAVE_HIGH_EXPR < ");
2265 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2266 pp_string (buffer, ", ");
2267 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2268 pp_string (buffer, " > ");
2271 case VEC_INTERLEAVE_LOW_EXPR:
2272 pp_string (buffer, " VEC_INTERLEAVE_LOW_EXPR < ");
2273 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2274 pp_string (buffer, ", ");
2275 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2276 pp_string (buffer, " > ");
2283 if (is_stmt && is_expr)
2284 pp_semicolon (buffer);
2286 /* If we're building a diagnostic, the formatted text will be written
2287 into BUFFER's stream by the caller; otherwise, write it now. */
2288 if (!(flags & TDF_DIAGNOSTIC))
2289 pp_write_text_to_stream (buffer);
2294 /* Print the declaration of a variable. */
2297 print_declaration (pretty_printer *buffer, tree t, int spc, int flags)
2301 if (TREE_CODE (t) == TYPE_DECL)
2302 pp_string (buffer, "typedef ");
2304 if (CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_DECL_WRTL) && DECL_REGISTER (t))
2305 pp_string (buffer, "register ");
2307 if (TREE_PUBLIC (t) && DECL_EXTERNAL (t))
2308 pp_string (buffer, "extern ");
2309 else if (TREE_STATIC (t))
2310 pp_string (buffer, "static ");
2312 /* Print the type and name. */
2313 if (TREE_CODE (TREE_TYPE (t)) == ARRAY_TYPE)
2317 /* Print array's type. */
2318 tmp = TREE_TYPE (t);
2319 while (TREE_CODE (TREE_TYPE (tmp)) == ARRAY_TYPE)
2320 tmp = TREE_TYPE (tmp);
2321 dump_generic_node (buffer, TREE_TYPE (tmp), spc, flags, false);
2323 /* Print variable's name. */
2325 dump_generic_node (buffer, t, spc, flags, false);
2327 /* Print the dimensions. */
2328 tmp = TREE_TYPE (t);
2329 while (TREE_CODE (tmp) == ARRAY_TYPE)
2331 dump_array_domain (buffer, TYPE_DOMAIN (tmp), spc, flags);
2332 tmp = TREE_TYPE (tmp);
2335 else if (TREE_CODE (t) == FUNCTION_DECL)
2337 dump_generic_node (buffer, TREE_TYPE (TREE_TYPE (t)), spc, flags, false);
2339 dump_decl_name (buffer, t, flags);
2340 dump_function_declaration (buffer, TREE_TYPE (t), spc, flags);
2344 /* Print type declaration. */
2345 dump_generic_node (buffer, TREE_TYPE (t), spc, flags, false);
2347 /* Print variable's name. */
2349 dump_generic_node (buffer, t, spc, flags, false);
2352 if (TREE_CODE (t) == VAR_DECL && DECL_HARD_REGISTER (t))
2354 pp_string (buffer, " __asm__ ");
2355 pp_character (buffer, '(');
2356 dump_generic_node (buffer, DECL_ASSEMBLER_NAME (t), spc, flags, false);
2357 pp_character (buffer, ')');
2360 /* The initial value of a function serves to determine whether the function
2361 is declared or defined. So the following does not apply to function
2363 if (TREE_CODE (t) != FUNCTION_DECL)
2365 /* Print the initial value. */
2366 if (DECL_INITIAL (t))
2369 pp_character (buffer, '=');
2371 dump_generic_node (buffer, DECL_INITIAL (t), spc, flags, false);
2375 if (TREE_CODE (t) == VAR_DECL && DECL_HAS_VALUE_EXPR_P (t))
2377 pp_string (buffer, " [value-expr: ");
2378 dump_generic_node (buffer, DECL_VALUE_EXPR (t), spc, flags, false);
2379 pp_character (buffer, ']');
2382 pp_character (buffer, ';');
2386 /* Prints a structure: name, fields, and methods.
2387 FIXME: Still incomplete. */
2390 print_struct_decl (pretty_printer *buffer, const_tree node, int spc, int flags)
2392 /* Print the name of the structure. */
2393 if (TYPE_NAME (node))
2396 if (TREE_CODE (node) == RECORD_TYPE)
2397 pp_string (buffer, "struct ");
2398 else if ((TREE_CODE (node) == UNION_TYPE
2399 || TREE_CODE (node) == QUAL_UNION_TYPE))
2400 pp_string (buffer, "union ");
2402 dump_generic_node (buffer, TYPE_NAME (node), spc, 0, false);
2405 /* Print the contents of the structure. */
2406 pp_newline (buffer);
2408 pp_character (buffer, '{');
2409 pp_newline (buffer);
2411 /* Print the fields of the structure. */
2414 tmp = TYPE_FIELDS (node);
2417 /* Avoid to print recursively the structure. */
2418 /* FIXME : Not implemented correctly...,
2419 what about the case when we have a cycle in the contain graph? ...
2420 Maybe this could be solved by looking at the scope in which the
2421 structure was declared. */
2422 if (TREE_TYPE (tmp) != node
2423 && (TREE_CODE (TREE_TYPE (tmp)) != POINTER_TYPE
2424 || TREE_TYPE (TREE_TYPE (tmp)) != node))
2426 print_declaration (buffer, tmp, spc+2, flags);
2427 pp_newline (buffer);
2429 tmp = TREE_CHAIN (tmp);
2433 pp_character (buffer, '}');
2436 /* Return the priority of the operator CODE.
2438 From lowest to highest precedence with either left-to-right (L-R)
2439 or right-to-left (R-L) associativity]:
2442 2 [R-L] = += -= *= /= %= &= ^= |= <<= >>=
2454 14 [R-L] ! ~ ++ -- + - * & (type) sizeof
2455 15 [L-R] fn() [] -> .
2457 unary +, - and * have higher precedence than the corresponding binary
2461 op_code_prio (enum tree_code code)
2478 case TRUTH_ORIF_EXPR:
2481 case TRUTH_AND_EXPR:
2482 case TRUTH_ANDIF_EXPR:
2489 case TRUTH_XOR_EXPR:
2506 case UNORDERED_EXPR:
2519 case WIDEN_SUM_EXPR:
2521 case POINTER_PLUS_EXPR:
2525 case VEC_WIDEN_MULT_HI_EXPR:
2526 case VEC_WIDEN_MULT_LO_EXPR:
2527 case WIDEN_MULT_EXPR:
2529 case WIDEN_MULT_PLUS_EXPR:
2530 case WIDEN_MULT_MINUS_EXPR:
2532 case TRUNC_DIV_EXPR:
2534 case FLOOR_DIV_EXPR:
2535 case ROUND_DIV_EXPR:
2537 case EXACT_DIV_EXPR:
2538 case TRUNC_MOD_EXPR:
2540 case FLOOR_MOD_EXPR:
2541 case ROUND_MOD_EXPR:
2544 case TRUTH_NOT_EXPR:
2546 case POSTINCREMENT_EXPR:
2547 case POSTDECREMENT_EXPR:
2548 case PREINCREMENT_EXPR:
2549 case PREDECREMENT_EXPR:
2551 case MISALIGNED_INDIRECT_REF:
2556 case FIX_TRUNC_EXPR:
2562 case ARRAY_RANGE_REF:
2566 /* Special expressions. */
2572 case REDUC_MAX_EXPR:
2573 case REDUC_MIN_EXPR:
2574 case REDUC_PLUS_EXPR:
2575 case VEC_LSHIFT_EXPR:
2576 case VEC_RSHIFT_EXPR:
2577 case VEC_UNPACK_HI_EXPR:
2578 case VEC_UNPACK_LO_EXPR:
2579 case VEC_UNPACK_FLOAT_HI_EXPR:
2580 case VEC_UNPACK_FLOAT_LO_EXPR:
2581 case VEC_PACK_TRUNC_EXPR:
2582 case VEC_PACK_SAT_EXPR:
2586 /* Return an arbitrarily high precedence to avoid surrounding single
2587 VAR_DECLs in ()s. */
2592 /* Return the priority of the operator OP. */
2595 op_prio (const_tree op)
2597 enum tree_code code;
2602 code = TREE_CODE (op);
2603 if (code == SAVE_EXPR || code == NON_LVALUE_EXPR)
2604 return op_prio (TREE_OPERAND (op, 0));
2606 return op_code_prio (code);
2609 /* Return the symbol associated with operator CODE. */
2612 op_symbol_code (enum tree_code code)
2620 case TRUTH_ORIF_EXPR:
2623 case TRUTH_AND_EXPR:
2624 case TRUTH_ANDIF_EXPR:
2630 case TRUTH_XOR_EXPR:
2640 case UNORDERED_EXPR:
2686 case VEC_LSHIFT_EXPR:
2689 case VEC_RSHIFT_EXPR:
2692 case POINTER_PLUS_EXPR:
2698 case REDUC_PLUS_EXPR:
2701 case WIDEN_SUM_EXPR:
2704 case WIDEN_MULT_EXPR:
2714 case TRUTH_NOT_EXPR:
2721 case MISALIGNED_INDIRECT_REF:
2724 case TRUNC_DIV_EXPR:
2731 case FLOOR_DIV_EXPR:
2734 case ROUND_DIV_EXPR:
2737 case EXACT_DIV_EXPR:
2740 case TRUNC_MOD_EXPR:
2746 case FLOOR_MOD_EXPR:
2749 case ROUND_MOD_EXPR:
2752 case PREDECREMENT_EXPR:
2755 case PREINCREMENT_EXPR:
2758 case POSTDECREMENT_EXPR:
2761 case POSTINCREMENT_EXPR:
2771 return "<<< ??? >>>";
2775 /* Return the symbol associated with operator OP. */
2778 op_symbol (const_tree op)
2780 return op_symbol_code (TREE_CODE (op));
2783 /* Prints the name of a call. NODE is the CALL_EXPR_FN of a CALL_EXPR or
2784 the gimple_call_fn of a GIMPLE_CALL. */
2787 print_call_name (pretty_printer *buffer, tree node, int flags)
2791 if (TREE_CODE (op0) == NON_LVALUE_EXPR)
2792 op0 = TREE_OPERAND (op0, 0);
2795 switch (TREE_CODE (op0))
2800 dump_function_name (buffer, op0, flags);
2806 op0 = TREE_OPERAND (op0, 0);
2810 pp_string (buffer, "(");
2811 dump_generic_node (buffer, TREE_OPERAND (op0, 0), 0, flags, false);
2812 pp_string (buffer, ") ? ");
2813 dump_generic_node (buffer, TREE_OPERAND (op0, 1), 0, flags, false);
2814 pp_string (buffer, " : ");
2815 dump_generic_node (buffer, TREE_OPERAND (op0, 2), 0, flags, false);
2819 if (TREE_CODE (TREE_OPERAND (op0, 0)) == VAR_DECL)
2820 dump_function_name (buffer, TREE_OPERAND (op0, 0), flags);
2822 dump_generic_node (buffer, op0, 0, flags, false);
2826 if (integer_zerop (TREE_OPERAND (op0, 1)))
2828 op0 = TREE_OPERAND (op0, 0);
2835 dump_generic_node (buffer, op0, 0, flags, false);
2843 /* Parses the string STR and replaces new-lines by '\n', tabs by '\t', ... */
2846 pretty_print_string (pretty_printer *buffer, const char *str)
2856 pp_string (buffer, "\\b");
2860 pp_string (buffer, "\\f");
2864 pp_string (buffer, "\\n");
2868 pp_string (buffer, "\\r");
2872 pp_string (buffer, "\\t");
2876 pp_string (buffer, "\\v");
2880 pp_string (buffer, "\\\\");
2884 pp_string (buffer, "\\\"");
2888 pp_string (buffer, "\\'");
2891 /* No need to handle \0; the loop terminates on \0. */
2894 pp_string (buffer, "\\1");
2898 pp_string (buffer, "\\2");
2902 pp_string (buffer, "\\3");
2906 pp_string (buffer, "\\4");
2910 pp_string (buffer, "\\5");
2914 pp_string (buffer, "\\6");
2918 pp_string (buffer, "\\7");
2922 pp_character (buffer, str[0]);
2930 maybe_init_pretty_print (FILE *file)
2934 pp_construct (&buffer, /* prefix */NULL, /* line-width */0);
2935 pp_needs_newline (&buffer) = true;
2936 pp_translate_identifiers (&buffer) = false;
2940 buffer.buffer->stream = file;
2944 newline_and_indent (pretty_printer *buffer, int spc)
2946 pp_newline (buffer);
2950 /* Handle a %K format for TEXT. Separate from default_tree_printer so
2951 it can also be used in front ends.
2952 %K: a statement, from which EXPR_LOCATION and TREE_BLOCK will be recorded.
2956 percent_K_format (text_info *text)
2958 tree t = va_arg (*text->args_ptr, tree), block;
2959 gcc_assert (text->locus != NULL);
2960 *text->locus = EXPR_LOCATION (t);
2961 gcc_assert (pp_ti_abstract_origin (text) != NULL);
2962 block = TREE_BLOCK (t);
2963 *pp_ti_abstract_origin (text) = NULL;
2965 && TREE_CODE (block) == BLOCK
2966 && BLOCK_ABSTRACT_ORIGIN (block))
2968 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
2970 while (TREE_CODE (ao) == BLOCK
2971 && BLOCK_ABSTRACT_ORIGIN (ao)
2972 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
2973 ao = BLOCK_ABSTRACT_ORIGIN (ao);
2975 if (TREE_CODE (ao) == FUNCTION_DECL)
2977 *pp_ti_abstract_origin (text) = block;
2980 block = BLOCK_SUPERCONTEXT (block);
2984 /* Print the identifier ID to PRETTY-PRINTER. */
2987 pp_base_tree_identifier (pretty_printer *pp, tree id)
2989 if (pp_translate_identifiers (pp))
2991 const char *text = identifier_to_locale (IDENTIFIER_POINTER (id));
2992 pp_append_text (pp, text, text + strlen (text));
2995 pp_append_text (pp, IDENTIFIER_POINTER (id),
2996 IDENTIFIER_POINTER (id) + IDENTIFIER_LENGTH (id));