1 /* Pretty formatting of GENERIC trees in C syntax.
2 Copyright (C) 2001-2015 Free Software Foundation, Inc.
3 Adapted from c-pretty-print.c by Diego Novillo <dnovillo@redhat.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
29 #include "tree-pretty-print.h"
30 #include "stor-layout.h"
31 #include "langhooks.h"
32 #include "tree-iterator.h"
34 #include "internal-fn.h"
35 #include "gomp-constants.h"
37 /* Local functions, macros and variables. */
38 static const char *op_symbol (const_tree
);
39 static void pretty_print_string (pretty_printer
*, const char*);
40 static void newline_and_indent (pretty_printer
*, int);
41 static void maybe_init_pretty_print (FILE *);
42 static void print_struct_decl (pretty_printer
*, const_tree
, int, int);
43 static void do_niy (pretty_printer
*, const_tree
);
45 #define INDENT(SPACE) do { \
46 int i; for (i = 0; i<SPACE; i++) pp_space (pp); } while (0)
48 #define NIY do_niy (pp, node)
50 static pretty_printer
*tree_pp
;
52 /* Try to print something for an unknown tree code. */
55 do_niy (pretty_printer
*pp
, const_tree node
)
59 pp_string (pp
, "<<< Unknown tree: ");
60 pp_string (pp
, get_tree_code_name (TREE_CODE (node
)));
64 len
= TREE_OPERAND_LENGTH (node
);
65 for (i
= 0; i
< len
; ++i
)
67 newline_and_indent (pp
, 2);
68 dump_generic_node (pp
, TREE_OPERAND (node
, i
), 2, 0, false);
72 pp_string (pp
, " >>>");
75 /* Debugging function to print out a generic expression. */
78 debug_generic_expr (tree t
)
80 print_generic_expr (stderr
, t
, TDF_VOPS
|TDF_MEMSYMS
);
81 fprintf (stderr
, "\n");
84 /* Debugging function to print out a generic statement. */
87 debug_generic_stmt (tree t
)
89 print_generic_stmt (stderr
, t
, TDF_VOPS
|TDF_MEMSYMS
);
90 fprintf (stderr
, "\n");
93 /* Debugging function to print out a chain of trees . */
96 debug_tree_chain (tree t
)
102 print_generic_expr (stderr
, t
, TDF_VOPS
|TDF_MEMSYMS
|TDF_UID
);
103 fprintf (stderr
, " ");
107 fprintf (stderr
, "... [cycled back to ");
108 print_generic_expr (stderr
, t
, TDF_VOPS
|TDF_MEMSYMS
|TDF_UID
);
109 fprintf (stderr
, "]");
113 fprintf (stderr
, "\n");
116 /* Prints declaration DECL to the FILE with details specified by FLAGS. */
118 print_generic_decl (FILE *file
, tree decl
, int flags
)
120 maybe_init_pretty_print (file
);
121 print_declaration (tree_pp
, decl
, 2, flags
);
122 pp_write_text_to_stream (tree_pp
);
125 /* Print tree T, and its successors, on file FILE. FLAGS specifies details
126 to show in the dump. See TDF_* in dumpfile.h. */
129 print_generic_stmt (FILE *file
, tree t
, int flags
)
131 maybe_init_pretty_print (file
);
132 dump_generic_node (tree_pp
, t
, 0, flags
, true);
133 pp_newline_and_flush (tree_pp
);
136 /* Print tree T, and its successors, on file FILE. FLAGS specifies details
137 to show in the dump. See TDF_* in dumpfile.h. The output is indented by
141 print_generic_stmt_indented (FILE *file
, tree t
, int flags
, int indent
)
145 maybe_init_pretty_print (file
);
147 for (i
= 0; i
< indent
; i
++)
149 dump_generic_node (tree_pp
, t
, indent
, flags
, true);
150 pp_newline_and_flush (tree_pp
);
153 /* Print a single expression T on file FILE. FLAGS specifies details to show
154 in the dump. See TDF_* in dumpfile.h. */
157 print_generic_expr (FILE *file
, tree t
, int flags
)
159 maybe_init_pretty_print (file
);
160 dump_generic_node (tree_pp
, t
, 0, flags
, false);
164 /* Dump the name of a _DECL node and its DECL_UID if TDF_UID is set
168 dump_decl_name (pretty_printer
*pp
, tree node
, int flags
)
170 if (DECL_NAME (node
))
172 if ((flags
& TDF_ASMNAME
) && DECL_ASSEMBLER_NAME_SET_P (node
))
173 pp_tree_identifier (pp
, DECL_ASSEMBLER_NAME (node
));
175 pp_tree_identifier (pp
, DECL_NAME (node
));
177 if ((flags
& TDF_UID
) || DECL_NAME (node
) == NULL_TREE
)
179 if (TREE_CODE (node
) == LABEL_DECL
&& LABEL_DECL_UID (node
) != -1)
180 pp_printf (pp
, "L.%d", (int) LABEL_DECL_UID (node
));
181 else if (TREE_CODE (node
) == DEBUG_EXPR_DECL
)
183 if (flags
& TDF_NOUID
)
184 pp_string (pp
, "D#xxxx");
186 pp_printf (pp
, "D#%i", DEBUG_TEMP_UID (node
));
190 char c
= TREE_CODE (node
) == CONST_DECL
? 'C' : 'D';
191 if (flags
& TDF_NOUID
)
192 pp_printf (pp
, "%c.xxxx", c
);
194 pp_printf (pp
, "%c.%u", c
, DECL_UID (node
));
197 if ((flags
& TDF_ALIAS
) && DECL_PT_UID (node
) != DECL_UID (node
))
199 if (flags
& TDF_NOUID
)
200 pp_printf (pp
, "ptD.xxxx");
202 pp_printf (pp
, "ptD.%u", DECL_PT_UID (node
));
206 /* Like the above, but used for pretty printing function calls. */
209 dump_function_name (pretty_printer
*pp
, tree node
, int flags
)
211 if (CONVERT_EXPR_P (node
))
212 node
= TREE_OPERAND (node
, 0);
213 if (DECL_NAME (node
) && (flags
& TDF_ASMNAME
) == 0)
214 pp_string (pp
, lang_hooks
.decl_printable_name (node
, 1));
216 dump_decl_name (pp
, node
, flags
);
219 /* Dump a function declaration. NODE is the FUNCTION_TYPE. PP, SPC and
220 FLAGS are as in dump_generic_node. */
223 dump_function_declaration (pretty_printer
*pp
, tree node
,
226 bool wrote_arg
= false;
232 /* Print the argument types. */
233 arg
= TYPE_ARG_TYPES (node
);
234 while (arg
&& arg
!= void_list_node
&& arg
!= error_mark_node
)
242 dump_generic_node (pp
, TREE_VALUE (arg
), spc
, flags
, false);
243 arg
= TREE_CHAIN (arg
);
246 /* Drop the trailing void_type_node if we had any previous argument. */
247 if (arg
== void_list_node
&& !wrote_arg
)
248 pp_string (pp
, "void");
249 /* Properly dump vararg function types. */
250 else if (!arg
&& wrote_arg
)
251 pp_string (pp
, ", ...");
252 /* Avoid printing any arg for unprototyped functions. */
257 /* Dump the domain associated with an array. */
260 dump_array_domain (pretty_printer
*pp
, tree domain
, int spc
, int flags
)
262 pp_left_bracket (pp
);
265 tree min
= TYPE_MIN_VALUE (domain
);
266 tree max
= TYPE_MAX_VALUE (domain
);
269 && integer_zerop (min
)
270 && tree_fits_shwi_p (max
))
271 pp_wide_integer (pp
, tree_to_shwi (max
) + 1);
275 dump_generic_node (pp
, min
, spc
, flags
, false);
278 dump_generic_node (pp
, max
, spc
, flags
, false);
282 pp_string (pp
, "<unknown>");
283 pp_right_bracket (pp
);
287 /* Dump OpenMP clause CLAUSE. PP, CLAUSE, SPC and FLAGS are as in
288 dump_generic_node. */
291 dump_omp_clause (pretty_printer
*pp
, tree clause
, int spc
, int flags
)
295 switch (OMP_CLAUSE_CODE (clause
))
297 case OMP_CLAUSE_PRIVATE
:
300 case OMP_CLAUSE_SHARED
:
303 case OMP_CLAUSE_FIRSTPRIVATE
:
304 name
= "firstprivate";
306 case OMP_CLAUSE_LASTPRIVATE
:
307 name
= "lastprivate";
309 case OMP_CLAUSE_COPYIN
:
312 case OMP_CLAUSE_COPYPRIVATE
:
313 name
= "copyprivate";
315 case OMP_CLAUSE_UNIFORM
:
318 case OMP_CLAUSE_USE_DEVICE_PTR
:
319 name
= "use_device_ptr";
321 case OMP_CLAUSE_IS_DEVICE_PTR
:
322 name
= "is_device_ptr";
324 case OMP_CLAUSE__LOOPTEMP_
:
327 case OMP_CLAUSE_DEVICE_RESIDENT
:
328 name
= "device_resident";
330 case OMP_CLAUSE_USE_DEVICE
:
333 case OMP_CLAUSE_TO_DECLARE
:
336 case OMP_CLAUSE_LINK
:
340 pp_string (pp
, name
);
342 dump_generic_node (pp
, OMP_CLAUSE_DECL (clause
),
347 case OMP_CLAUSE_REDUCTION
:
348 pp_string (pp
, "reduction(");
349 if (OMP_CLAUSE_REDUCTION_CODE (clause
) != ERROR_MARK
)
352 op_symbol_code (OMP_CLAUSE_REDUCTION_CODE (clause
)));
355 dump_generic_node (pp
, OMP_CLAUSE_DECL (clause
),
361 pp_string (pp
, "if(");
362 switch (OMP_CLAUSE_IF_MODIFIER (clause
))
364 case ERROR_MARK
: break;
365 case OMP_PARALLEL
: pp_string (pp
, "parallel:"); break;
366 case OMP_TASK
: pp_string (pp
, "task:"); break;
367 case OMP_TASKLOOP
: pp_string (pp
, "taskloop:"); break;
368 case OMP_TARGET_DATA
: pp_string (pp
, "target data:"); break;
369 case OMP_TARGET
: pp_string (pp
, "target:"); break;
370 case OMP_TARGET_UPDATE
: pp_string (pp
, "target update:"); break;
371 case OMP_TARGET_ENTER_DATA
:
372 pp_string (pp
, "target enter data:"); break;
373 case OMP_TARGET_EXIT_DATA
: pp_string (pp
, "target exit data:"); break;
374 default: gcc_unreachable ();
376 dump_generic_node (pp
, OMP_CLAUSE_IF_EXPR (clause
),
381 case OMP_CLAUSE_NUM_THREADS
:
382 pp_string (pp
, "num_threads(");
383 dump_generic_node (pp
, OMP_CLAUSE_NUM_THREADS_EXPR (clause
),
388 case OMP_CLAUSE__CILK_FOR_COUNT_
:
389 pp_string (pp
, "_Cilk_for_count_(");
390 dump_generic_node (pp
, OMP_CLAUSE_OPERAND (clause
, 0),
395 case OMP_CLAUSE_NOWAIT
:
396 pp_string (pp
, "nowait");
398 case OMP_CLAUSE_ORDERED
:
399 pp_string (pp
, "ordered");
400 if (OMP_CLAUSE_ORDERED_EXPR (clause
))
403 dump_generic_node (pp
, OMP_CLAUSE_ORDERED_EXPR (clause
),
409 case OMP_CLAUSE_DEFAULT
:
410 pp_string (pp
, "default(");
411 switch (OMP_CLAUSE_DEFAULT_KIND (clause
))
413 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
415 case OMP_CLAUSE_DEFAULT_SHARED
:
416 pp_string (pp
, "shared");
418 case OMP_CLAUSE_DEFAULT_NONE
:
419 pp_string (pp
, "none");
421 case OMP_CLAUSE_DEFAULT_PRIVATE
:
422 pp_string (pp
, "private");
424 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
:
425 pp_string (pp
, "firstprivate");
433 case OMP_CLAUSE_SCHEDULE
:
434 pp_string (pp
, "schedule(");
435 if (OMP_CLAUSE_SCHEDULE_KIND (clause
)
436 & (OMP_CLAUSE_SCHEDULE_MONOTONIC
437 | OMP_CLAUSE_SCHEDULE_NONMONOTONIC
))
439 if (OMP_CLAUSE_SCHEDULE_KIND (clause
)
440 & OMP_CLAUSE_SCHEDULE_MONOTONIC
)
441 pp_string (pp
, "monotonic");
443 pp_string (pp
, "nonmonotonic");
444 if (OMP_CLAUSE_SCHEDULE_SIMD (clause
))
449 if (OMP_CLAUSE_SCHEDULE_SIMD (clause
))
450 pp_string (pp
, "simd:");
452 switch (OMP_CLAUSE_SCHEDULE_KIND (clause
) & OMP_CLAUSE_SCHEDULE_MASK
)
454 case OMP_CLAUSE_SCHEDULE_STATIC
:
455 pp_string (pp
, "static");
457 case OMP_CLAUSE_SCHEDULE_DYNAMIC
:
458 pp_string (pp
, "dynamic");
460 case OMP_CLAUSE_SCHEDULE_GUIDED
:
461 pp_string (pp
, "guided");
463 case OMP_CLAUSE_SCHEDULE_RUNTIME
:
464 pp_string (pp
, "runtime");
466 case OMP_CLAUSE_SCHEDULE_AUTO
:
467 pp_string (pp
, "auto");
469 case OMP_CLAUSE_SCHEDULE_CILKFOR
:
470 pp_string (pp
, "cilk-for grain");
475 if (OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (clause
))
478 dump_generic_node (pp
, OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (clause
),
484 case OMP_CLAUSE_UNTIED
:
485 pp_string (pp
, "untied");
488 case OMP_CLAUSE_COLLAPSE
:
489 pp_string (pp
, "collapse(");
490 dump_generic_node (pp
, OMP_CLAUSE_COLLAPSE_EXPR (clause
),
495 case OMP_CLAUSE_FINAL
:
496 pp_string (pp
, "final(");
497 dump_generic_node (pp
, OMP_CLAUSE_FINAL_EXPR (clause
),
502 case OMP_CLAUSE_MERGEABLE
:
503 pp_string (pp
, "mergeable");
506 case OMP_CLAUSE_LINEAR
:
507 pp_string (pp
, "linear(");
508 switch (OMP_CLAUSE_LINEAR_KIND (clause
))
510 case OMP_CLAUSE_LINEAR_DEFAULT
:
512 case OMP_CLAUSE_LINEAR_REF
:
513 pp_string (pp
, "ref(");
515 case OMP_CLAUSE_LINEAR_VAL
:
516 pp_string (pp
, "val(");
518 case OMP_CLAUSE_LINEAR_UVAL
:
519 pp_string (pp
, "uval(");
524 dump_generic_node (pp
, OMP_CLAUSE_DECL (clause
),
526 if (OMP_CLAUSE_LINEAR_KIND (clause
) != OMP_CLAUSE_LINEAR_DEFAULT
)
529 dump_generic_node (pp
, OMP_CLAUSE_LINEAR_STEP (clause
),
534 case OMP_CLAUSE_ALIGNED
:
535 pp_string (pp
, "aligned(");
536 dump_generic_node (pp
, OMP_CLAUSE_DECL (clause
),
538 if (OMP_CLAUSE_ALIGNED_ALIGNMENT (clause
))
541 dump_generic_node (pp
, OMP_CLAUSE_ALIGNED_ALIGNMENT (clause
),
547 case OMP_CLAUSE_DEPEND
:
548 pp_string (pp
, "depend(");
549 switch (OMP_CLAUSE_DEPEND_KIND (clause
))
551 case OMP_CLAUSE_DEPEND_IN
:
552 pp_string (pp
, "in");
554 case OMP_CLAUSE_DEPEND_OUT
:
555 pp_string (pp
, "out");
557 case OMP_CLAUSE_DEPEND_INOUT
:
558 pp_string (pp
, "inout");
560 case OMP_CLAUSE_DEPEND_SOURCE
:
561 pp_string (pp
, "source)");
563 case OMP_CLAUSE_DEPEND_SINK
:
564 pp_string (pp
, "sink:");
565 for (tree t
= OMP_CLAUSE_DECL (clause
); t
; t
= TREE_CHAIN (t
))
566 if (TREE_CODE (t
) == TREE_LIST
)
568 dump_generic_node (pp
, TREE_VALUE (t
), spc
, flags
, false);
569 if (TREE_PURPOSE (t
) != integer_zero_node
)
571 if (OMP_CLAUSE_DEPEND_SINK_NEGATIVE (t
))
575 dump_generic_node (pp
, TREE_PURPOSE (t
), spc
, flags
,
589 dump_generic_node (pp
, OMP_CLAUSE_DECL (clause
),
595 pp_string (pp
, "map(");
596 switch (OMP_CLAUSE_MAP_KIND (clause
))
599 case GOMP_MAP_POINTER
:
600 pp_string (pp
, "alloc");
603 case GOMP_MAP_TO_PSET
:
604 pp_string (pp
, "to");
607 pp_string (pp
, "from");
609 case GOMP_MAP_TOFROM
:
610 pp_string (pp
, "tofrom");
612 case GOMP_MAP_FORCE_ALLOC
:
613 pp_string (pp
, "force_alloc");
615 case GOMP_MAP_FORCE_TO
:
616 pp_string (pp
, "force_to");
618 case GOMP_MAP_FORCE_FROM
:
619 pp_string (pp
, "force_from");
621 case GOMP_MAP_FORCE_TOFROM
:
622 pp_string (pp
, "force_tofrom");
624 case GOMP_MAP_FORCE_PRESENT
:
625 pp_string (pp
, "force_present");
627 case GOMP_MAP_FORCE_DEALLOC
:
628 pp_string (pp
, "delete");
630 case GOMP_MAP_FORCE_DEVICEPTR
:
631 pp_string (pp
, "force_deviceptr");
633 case GOMP_MAP_ALWAYS_TO
:
634 pp_string (pp
, "always,to");
636 case GOMP_MAP_ALWAYS_FROM
:
637 pp_string (pp
, "always,from");
639 case GOMP_MAP_ALWAYS_TOFROM
:
640 pp_string (pp
, "always,tofrom");
642 case GOMP_MAP_RELEASE
:
643 pp_string (pp
, "release");
645 case GOMP_MAP_FIRSTPRIVATE_POINTER
:
646 pp_string (pp
, "firstprivate");
648 case GOMP_MAP_FIRSTPRIVATE_REFERENCE
:
649 pp_string (pp
, "firstprivate ref");
651 case GOMP_MAP_STRUCT
:
652 pp_string (pp
, "struct");
654 case GOMP_MAP_ALWAYS_POINTER
:
655 pp_string (pp
, "always_pointer");
657 case GOMP_MAP_DEVICE_RESIDENT
:
658 pp_string (pp
, "device_resident");
661 pp_string (pp
, "link");
667 dump_generic_node (pp
, OMP_CLAUSE_DECL (clause
),
670 if (OMP_CLAUSE_SIZE (clause
))
672 switch (OMP_CLAUSE_CODE (clause
) == OMP_CLAUSE_MAP
673 ? OMP_CLAUSE_MAP_KIND (clause
) : GOMP_MAP_TO
)
675 case GOMP_MAP_POINTER
:
676 case GOMP_MAP_FIRSTPRIVATE_POINTER
:
677 case GOMP_MAP_FIRSTPRIVATE_REFERENCE
:
678 case GOMP_MAP_ALWAYS_POINTER
:
679 pp_string (pp
, " [pointer assign, bias: ");
681 case GOMP_MAP_TO_PSET
:
682 pp_string (pp
, " [pointer set, len: ");
685 pp_string (pp
, " [len: ");
688 dump_generic_node (pp
, OMP_CLAUSE_SIZE (clause
),
690 pp_right_bracket (pp
);
695 case OMP_CLAUSE_FROM
:
696 pp_string (pp
, "from(");
697 dump_generic_node (pp
, OMP_CLAUSE_DECL (clause
),
699 goto print_clause_size
;
702 pp_string (pp
, "to(");
703 dump_generic_node (pp
, OMP_CLAUSE_DECL (clause
),
705 goto print_clause_size
;
707 case OMP_CLAUSE__CACHE_
:
709 dump_generic_node (pp
, OMP_CLAUSE_DECL (clause
),
711 goto print_clause_size
;
713 case OMP_CLAUSE_NUM_TEAMS
:
714 pp_string (pp
, "num_teams(");
715 dump_generic_node (pp
, OMP_CLAUSE_NUM_TEAMS_EXPR (clause
),
720 case OMP_CLAUSE_THREAD_LIMIT
:
721 pp_string (pp
, "thread_limit(");
722 dump_generic_node (pp
, OMP_CLAUSE_THREAD_LIMIT_EXPR (clause
),
727 case OMP_CLAUSE_DEVICE
:
728 pp_string (pp
, "device(");
729 dump_generic_node (pp
, OMP_CLAUSE_DEVICE_ID (clause
),
734 case OMP_CLAUSE_DIST_SCHEDULE
:
735 pp_string (pp
, "dist_schedule(static");
736 if (OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (clause
))
739 dump_generic_node (pp
,
740 OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (clause
),
746 case OMP_CLAUSE_PROC_BIND
:
747 pp_string (pp
, "proc_bind(");
748 switch (OMP_CLAUSE_PROC_BIND_KIND (clause
))
750 case OMP_CLAUSE_PROC_BIND_MASTER
:
751 pp_string (pp
, "master");
753 case OMP_CLAUSE_PROC_BIND_CLOSE
:
754 pp_string (pp
, "close");
756 case OMP_CLAUSE_PROC_BIND_SPREAD
:
757 pp_string (pp
, "spread");
765 case OMP_CLAUSE_SAFELEN
:
766 pp_string (pp
, "safelen(");
767 dump_generic_node (pp
, OMP_CLAUSE_SAFELEN_EXPR (clause
),
772 case OMP_CLAUSE_SIMDLEN
:
773 pp_string (pp
, "simdlen(");
774 dump_generic_node (pp
, OMP_CLAUSE_SIMDLEN_EXPR (clause
),
779 case OMP_CLAUSE_PRIORITY
:
780 pp_string (pp
, "priority(");
781 dump_generic_node (pp
, OMP_CLAUSE_PRIORITY_EXPR (clause
),
786 case OMP_CLAUSE_GRAINSIZE
:
787 pp_string (pp
, "grainsize(");
788 dump_generic_node (pp
, OMP_CLAUSE_GRAINSIZE_EXPR (clause
),
793 case OMP_CLAUSE_NUM_TASKS
:
794 pp_string (pp
, "num_tasks(");
795 dump_generic_node (pp
, OMP_CLAUSE_NUM_TASKS_EXPR (clause
),
800 case OMP_CLAUSE_HINT
:
801 pp_string (pp
, "hint(");
802 dump_generic_node (pp
, OMP_CLAUSE_HINT_EXPR (clause
),
807 case OMP_CLAUSE_DEFAULTMAP
:
808 pp_string (pp
, "defaultmap(tofrom:scalar)");
811 case OMP_CLAUSE__SIMDUID_
:
812 pp_string (pp
, "_simduid_(");
813 dump_generic_node (pp
, OMP_CLAUSE__SIMDUID__DECL (clause
),
818 case OMP_CLAUSE_GANG
:
819 pp_string (pp
, "gang");
820 if (OMP_CLAUSE_GANG_EXPR (clause
) != NULL_TREE
)
822 pp_string (pp
, "(num: ");
823 dump_generic_node (pp
, OMP_CLAUSE_GANG_EXPR (clause
),
826 if (OMP_CLAUSE_GANG_STATIC_EXPR (clause
) != NULL_TREE
)
828 if (OMP_CLAUSE_GANG_EXPR (clause
) == NULL_TREE
)
832 pp_string (pp
, "static:");
833 if (OMP_CLAUSE_GANG_STATIC_EXPR (clause
)
834 == integer_minus_one_node
)
835 pp_character (pp
, '*');
837 dump_generic_node (pp
, OMP_CLAUSE_GANG_STATIC_EXPR (clause
),
840 if (OMP_CLAUSE_GANG_EXPR (clause
) != NULL_TREE
841 || OMP_CLAUSE_GANG_STATIC_EXPR (clause
) != NULL_TREE
)
845 case OMP_CLAUSE_ASYNC
:
846 pp_string (pp
, "async");
847 if (OMP_CLAUSE_ASYNC_EXPR (clause
))
849 pp_character(pp
, '(');
850 dump_generic_node (pp
, OMP_CLAUSE_ASYNC_EXPR (clause
),
852 pp_character(pp
, ')');
856 case OMP_CLAUSE_AUTO
:
858 pp_string (pp
, omp_clause_code_name
[OMP_CLAUSE_CODE (clause
)]);
861 case OMP_CLAUSE_WAIT
:
862 pp_string (pp
, "wait(");
863 dump_generic_node (pp
, OMP_CLAUSE_WAIT_EXPR (clause
),
865 pp_character(pp
, ')');
868 case OMP_CLAUSE_WORKER
:
869 pp_string (pp
, "worker");
870 if (OMP_CLAUSE_WORKER_EXPR (clause
) != NULL_TREE
)
873 dump_generic_node (pp
, OMP_CLAUSE_WORKER_EXPR (clause
),
879 case OMP_CLAUSE_VECTOR
:
880 pp_string (pp
, "vector");
881 if (OMP_CLAUSE_VECTOR_EXPR (clause
) != NULL_TREE
)
884 dump_generic_node (pp
, OMP_CLAUSE_VECTOR_EXPR (clause
),
890 case OMP_CLAUSE_NUM_GANGS
:
891 pp_string (pp
, "num_gangs(");
892 dump_generic_node (pp
, OMP_CLAUSE_NUM_GANGS_EXPR (clause
),
894 pp_character (pp
, ')');
897 case OMP_CLAUSE_NUM_WORKERS
:
898 pp_string (pp
, "num_workers(");
899 dump_generic_node (pp
, OMP_CLAUSE_NUM_WORKERS_EXPR (clause
),
901 pp_character (pp
, ')');
904 case OMP_CLAUSE_VECTOR_LENGTH
:
905 pp_string (pp
, "vector_length(");
906 dump_generic_node (pp
, OMP_CLAUSE_VECTOR_LENGTH_EXPR (clause
),
908 pp_character (pp
, ')');
911 case OMP_CLAUSE_INBRANCH
:
912 pp_string (pp
, "inbranch");
914 case OMP_CLAUSE_NOTINBRANCH
:
915 pp_string (pp
, "notinbranch");
918 pp_string (pp
, "for");
920 case OMP_CLAUSE_PARALLEL
:
921 pp_string (pp
, "parallel");
923 case OMP_CLAUSE_SECTIONS
:
924 pp_string (pp
, "sections");
926 case OMP_CLAUSE_TASKGROUP
:
927 pp_string (pp
, "taskgroup");
929 case OMP_CLAUSE_NOGROUP
:
930 pp_string (pp
, "nogroup");
932 case OMP_CLAUSE_THREADS
:
933 pp_string (pp
, "threads");
935 case OMP_CLAUSE_SIMD
:
936 pp_string (pp
, "simd");
938 case OMP_CLAUSE_INDEPENDENT
:
939 pp_string (pp
, "independent");
941 case OMP_CLAUSE_TILE
:
942 pp_string (pp
, "tile(");
943 dump_generic_node (pp
, OMP_CLAUSE_TILE_LIST (clause
),
949 /* Should never happen. */
950 dump_generic_node (pp
, clause
, spc
, flags
, false);
956 /* Dump the list of OpenMP clauses. PP, SPC and FLAGS are as in
957 dump_generic_node. */
960 dump_omp_clauses (pretty_printer
*pp
, tree clause
, int spc
, int flags
)
968 dump_omp_clause (pp
, clause
, spc
, flags
);
969 clause
= OMP_CLAUSE_CHAIN (clause
);
977 /* Dump location LOC to PP. */
980 dump_location (pretty_printer
*pp
, location_t loc
)
982 expanded_location xloc
= expand_location (loc
);
984 pp_left_bracket (pp
);
987 pp_string (pp
, xloc
.file
);
990 pp_decimal_int (pp
, xloc
.line
);
992 pp_decimal_int (pp
, xloc
.column
);
993 pp_string (pp
, "] ");
997 /* Dump lexical block BLOCK. PP, SPC and FLAGS are as in
998 dump_generic_node. */
1001 dump_block_node (pretty_printer
*pp
, tree block
, int spc
, int flags
)
1005 pp_printf (pp
, "BLOCK #%d ", BLOCK_NUMBER (block
));
1007 if (flags
& TDF_ADDRESS
)
1008 pp_printf (pp
, "[%p] ", (void *) block
);
1010 if (BLOCK_ABSTRACT (block
))
1011 pp_string (pp
, "[abstract] ");
1013 if (TREE_ASM_WRITTEN (block
))
1014 pp_string (pp
, "[written] ");
1016 if (flags
& TDF_SLIM
)
1019 if (BLOCK_SOURCE_LOCATION (block
))
1020 dump_location (pp
, BLOCK_SOURCE_LOCATION (block
));
1022 newline_and_indent (pp
, spc
+ 2);
1024 if (BLOCK_SUPERCONTEXT (block
))
1026 pp_string (pp
, "SUPERCONTEXT: ");
1027 dump_generic_node (pp
, BLOCK_SUPERCONTEXT (block
), 0,
1028 flags
| TDF_SLIM
, false);
1029 newline_and_indent (pp
, spc
+ 2);
1032 if (BLOCK_SUBBLOCKS (block
))
1034 pp_string (pp
, "SUBBLOCKS: ");
1035 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
1037 dump_generic_node (pp
, t
, 0, flags
| TDF_SLIM
, false);
1040 newline_and_indent (pp
, spc
+ 2);
1043 if (BLOCK_CHAIN (block
))
1045 pp_string (pp
, "SIBLINGS: ");
1046 for (t
= BLOCK_CHAIN (block
); t
; t
= BLOCK_CHAIN (t
))
1048 dump_generic_node (pp
, t
, 0, flags
| TDF_SLIM
, false);
1051 newline_and_indent (pp
, spc
+ 2);
1054 if (BLOCK_VARS (block
))
1056 pp_string (pp
, "VARS: ");
1057 for (t
= BLOCK_VARS (block
); t
; t
= TREE_CHAIN (t
))
1059 dump_generic_node (pp
, t
, 0, flags
, false);
1062 newline_and_indent (pp
, spc
+ 2);
1065 if (vec_safe_length (BLOCK_NONLOCALIZED_VARS (block
)) > 0)
1068 vec
<tree
, va_gc
> *nlv
= BLOCK_NONLOCALIZED_VARS (block
);
1070 pp_string (pp
, "NONLOCALIZED_VARS: ");
1071 FOR_EACH_VEC_ELT (*nlv
, i
, t
)
1073 dump_generic_node (pp
, t
, 0, flags
, false);
1076 newline_and_indent (pp
, spc
+ 2);
1079 if (BLOCK_ABSTRACT_ORIGIN (block
))
1081 pp_string (pp
, "ABSTRACT_ORIGIN: ");
1082 dump_generic_node (pp
, BLOCK_ABSTRACT_ORIGIN (block
), 0,
1083 flags
| TDF_SLIM
, false);
1084 newline_and_indent (pp
, spc
+ 2);
1087 if (BLOCK_FRAGMENT_ORIGIN (block
))
1089 pp_string (pp
, "FRAGMENT_ORIGIN: ");
1090 dump_generic_node (pp
, BLOCK_FRAGMENT_ORIGIN (block
), 0,
1091 flags
| TDF_SLIM
, false);
1092 newline_and_indent (pp
, spc
+ 2);
1095 if (BLOCK_FRAGMENT_CHAIN (block
))
1097 pp_string (pp
, "FRAGMENT_CHAIN: ");
1098 for (t
= BLOCK_FRAGMENT_CHAIN (block
); t
; t
= BLOCK_FRAGMENT_CHAIN (t
))
1100 dump_generic_node (pp
, t
, 0, flags
| TDF_SLIM
, false);
1103 newline_and_indent (pp
, spc
+ 2);
1108 /* Dump the node NODE on the pretty_printer PP, SPC spaces of
1109 indent. FLAGS specifies details to show in the dump (see TDF_* in
1110 dumpfile.h). If IS_STMT is true, the object printed is considered
1111 to be a statement and it is terminated by ';' if appropriate. */
1114 dump_generic_node (pretty_printer
*pp
, tree node
, int spc
, int flags
,
1121 enum tree_code code
;
1123 if (node
== NULL_TREE
)
1126 is_expr
= EXPR_P (node
);
1128 if (is_stmt
&& (flags
& TDF_STMTADDR
))
1129 pp_printf (pp
, "<&%p> ", (void *)node
);
1131 if ((flags
& TDF_LINENO
) && EXPR_HAS_LOCATION (node
))
1132 dump_location (pp
, EXPR_LOCATION (node
));
1134 code
= TREE_CODE (node
);
1138 pp_string (pp
, "<<< error >>>");
1141 case IDENTIFIER_NODE
:
1142 pp_tree_identifier (pp
, node
);
1146 while (node
&& node
!= error_mark_node
)
1148 if (TREE_PURPOSE (node
))
1150 dump_generic_node (pp
, TREE_PURPOSE (node
), spc
, flags
, false);
1153 dump_generic_node (pp
, TREE_VALUE (node
), spc
, flags
, false);
1154 node
= TREE_CHAIN (node
);
1155 if (node
&& TREE_CODE (node
) == TREE_LIST
)
1164 dump_generic_node (pp
, BINFO_TYPE (node
), spc
, flags
, false);
1170 if (TREE_VEC_LENGTH (node
) > 0)
1172 size_t len
= TREE_VEC_LENGTH (node
);
1173 for (i
= 0; i
< len
- 1; i
++)
1175 dump_generic_node (pp
, TREE_VEC_ELT (node
, i
), spc
, flags
,
1180 dump_generic_node (pp
, TREE_VEC_ELT (node
, len
- 1), spc
,
1187 case POINTER_BOUNDS_TYPE
:
1190 case FIXED_POINT_TYPE
:
1196 unsigned int quals
= TYPE_QUALS (node
);
1197 enum tree_code_class tclass
;
1199 if (quals
& TYPE_QUAL_ATOMIC
)
1200 pp_string (pp
, "atomic ");
1201 if (quals
& TYPE_QUAL_CONST
)
1202 pp_string (pp
, "const ");
1203 else if (quals
& TYPE_QUAL_VOLATILE
)
1204 pp_string (pp
, "volatile ");
1205 else if (quals
& TYPE_QUAL_RESTRICT
)
1206 pp_string (pp
, "restrict ");
1208 if (!ADDR_SPACE_GENERIC_P (TYPE_ADDR_SPACE (node
)))
1210 pp_string (pp
, "<address-space-");
1211 pp_decimal_int (pp
, TYPE_ADDR_SPACE (node
));
1212 pp_string (pp
, "> ");
1215 tclass
= TREE_CODE_CLASS (TREE_CODE (node
));
1217 if (tclass
== tcc_declaration
)
1219 if (DECL_NAME (node
))
1220 dump_decl_name (pp
, node
, flags
);
1222 pp_string (pp
, "<unnamed type decl>");
1224 else if (tclass
== tcc_type
)
1226 if (TYPE_NAME (node
))
1228 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
1229 pp_tree_identifier (pp
, TYPE_NAME (node
));
1230 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
1231 && DECL_NAME (TYPE_NAME (node
)))
1232 dump_decl_name (pp
, TYPE_NAME (node
), flags
);
1234 pp_string (pp
, "<unnamed type>");
1236 else if (TREE_CODE (node
) == VECTOR_TYPE
)
1238 pp_string (pp
, "vector");
1240 pp_wide_integer (pp
, TYPE_VECTOR_SUBPARTS (node
));
1241 pp_string (pp
, ") ");
1242 dump_generic_node (pp
, TREE_TYPE (node
), spc
, flags
, false);
1244 else if (TREE_CODE (node
) == INTEGER_TYPE
)
1246 if (TYPE_PRECISION (node
) == CHAR_TYPE_SIZE
)
1247 pp_string (pp
, (TYPE_UNSIGNED (node
)
1250 else if (TYPE_PRECISION (node
) == SHORT_TYPE_SIZE
)
1251 pp_string (pp
, (TYPE_UNSIGNED (node
)
1254 else if (TYPE_PRECISION (node
) == INT_TYPE_SIZE
)
1255 pp_string (pp
, (TYPE_UNSIGNED (node
)
1258 else if (TYPE_PRECISION (node
) == LONG_TYPE_SIZE
)
1259 pp_string (pp
, (TYPE_UNSIGNED (node
)
1262 else if (TYPE_PRECISION (node
) == LONG_LONG_TYPE_SIZE
)
1263 pp_string (pp
, (TYPE_UNSIGNED (node
)
1264 ? "unsigned long long"
1265 : "signed long long"));
1266 else if (TYPE_PRECISION (node
) >= CHAR_TYPE_SIZE
1267 && exact_log2 (TYPE_PRECISION (node
)) != -1)
1269 pp_string (pp
, (TYPE_UNSIGNED (node
) ? "uint" : "int"));
1270 pp_decimal_int (pp
, TYPE_PRECISION (node
));
1271 pp_string (pp
, "_t");
1275 pp_string (pp
, (TYPE_UNSIGNED (node
)
1276 ? "<unnamed-unsigned:"
1277 : "<unnamed-signed:"));
1278 pp_decimal_int (pp
, TYPE_PRECISION (node
));
1282 else if (TREE_CODE (node
) == COMPLEX_TYPE
)
1284 pp_string (pp
, "__complex__ ");
1285 dump_generic_node (pp
, TREE_TYPE (node
), spc
, flags
, false);
1287 else if (TREE_CODE (node
) == REAL_TYPE
)
1289 pp_string (pp
, "<float:");
1290 pp_decimal_int (pp
, TYPE_PRECISION (node
));
1293 else if (TREE_CODE (node
) == FIXED_POINT_TYPE
)
1295 pp_string (pp
, "<fixed-point-");
1296 pp_string (pp
, TYPE_SATURATING (node
) ? "sat:" : "nonsat:");
1297 pp_decimal_int (pp
, TYPE_PRECISION (node
));
1300 else if (TREE_CODE (node
) == VOID_TYPE
)
1301 pp_string (pp
, "void");
1303 pp_string (pp
, "<unnamed type>");
1309 case REFERENCE_TYPE
:
1310 str
= (TREE_CODE (node
) == POINTER_TYPE
? "*" : "&");
1312 if (TREE_TYPE (node
) == NULL
)
1314 pp_string (pp
, str
);
1315 pp_string (pp
, "<null type>");
1317 else if (TREE_CODE (TREE_TYPE (node
)) == FUNCTION_TYPE
)
1319 tree fnode
= TREE_TYPE (node
);
1321 dump_generic_node (pp
, TREE_TYPE (fnode
), spc
, flags
, false);
1324 pp_string (pp
, str
);
1325 if (TYPE_NAME (node
) && DECL_NAME (TYPE_NAME (node
)))
1326 dump_decl_name (pp
, TYPE_NAME (node
), flags
);
1327 else if (flags
& TDF_NOUID
)
1328 pp_printf (pp
, "<Txxxx>");
1330 pp_printf (pp
, "<T%x>", TYPE_UID (node
));
1332 pp_right_paren (pp
);
1333 dump_function_declaration (pp
, fnode
, spc
, flags
);
1337 unsigned int quals
= TYPE_QUALS (node
);
1339 dump_generic_node (pp
, TREE_TYPE (node
), spc
, flags
, false);
1341 pp_string (pp
, str
);
1343 if (quals
& TYPE_QUAL_CONST
)
1344 pp_string (pp
, " const");
1345 if (quals
& TYPE_QUAL_VOLATILE
)
1346 pp_string (pp
, " volatile");
1347 if (quals
& TYPE_QUAL_RESTRICT
)
1348 pp_string (pp
, " restrict");
1350 if (!ADDR_SPACE_GENERIC_P (TYPE_ADDR_SPACE (node
)))
1352 pp_string (pp
, " <address-space-");
1353 pp_decimal_int (pp
, TYPE_ADDR_SPACE (node
));
1357 if (TYPE_REF_CAN_ALIAS_ALL (node
))
1358 pp_string (pp
, " {ref-all}");
1368 if (integer_zerop (TREE_OPERAND (node
, 1))
1369 /* Dump the types of INTEGER_CSTs explicitly, for we can't
1370 infer them and MEM_ATTR caching will share MEM_REFs
1371 with differently-typed op0s. */
1372 && TREE_CODE (TREE_OPERAND (node
, 0)) != INTEGER_CST
1373 /* Released SSA_NAMES have no TREE_TYPE. */
1374 && TREE_TYPE (TREE_OPERAND (node
, 0)) != NULL_TREE
1375 /* Same pointer types, but ignoring POINTER_TYPE vs.
1377 && (TREE_TYPE (TREE_TYPE (TREE_OPERAND (node
, 0)))
1378 == TREE_TYPE (TREE_TYPE (TREE_OPERAND (node
, 1))))
1379 && (TYPE_MODE (TREE_TYPE (TREE_OPERAND (node
, 0)))
1380 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (node
, 1))))
1381 && (TYPE_REF_CAN_ALIAS_ALL (TREE_TYPE (TREE_OPERAND (node
, 0)))
1382 == TYPE_REF_CAN_ALIAS_ALL (TREE_TYPE (TREE_OPERAND (node
, 1))))
1383 /* Same value types ignoring qualifiers. */
1384 && (TYPE_MAIN_VARIANT (TREE_TYPE (node
))
1385 == TYPE_MAIN_VARIANT
1386 (TREE_TYPE (TREE_TYPE (TREE_OPERAND (node
, 1)))))
1387 && (!(flags
& TDF_ALIAS
)
1388 || MR_DEPENDENCE_CLIQUE (node
) == 0))
1390 if (TREE_CODE (TREE_OPERAND (node
, 0)) != ADDR_EXPR
)
1393 dump_generic_node (pp
, TREE_OPERAND (node
, 0),
1397 dump_generic_node (pp
,
1398 TREE_OPERAND (TREE_OPERAND (node
, 0), 0),
1405 pp_string (pp
, "MEM[");
1407 ptype
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (node
, 1)));
1408 dump_generic_node (pp
, ptype
,
1409 spc
, flags
| TDF_SLIM
, false);
1410 pp_right_paren (pp
);
1411 dump_generic_node (pp
, TREE_OPERAND (node
, 0),
1413 if (!integer_zerop (TREE_OPERAND (node
, 1)))
1415 pp_string (pp
, " + ");
1416 dump_generic_node (pp
, TREE_OPERAND (node
, 1),
1419 if ((flags
& TDF_ALIAS
)
1420 && MR_DEPENDENCE_CLIQUE (node
) != 0)
1422 pp_string (pp
, " clique ");
1423 pp_unsigned_wide_integer (pp
, MR_DEPENDENCE_CLIQUE (node
));
1424 pp_string (pp
, " base ");
1425 pp_unsigned_wide_integer (pp
, MR_DEPENDENCE_BASE (node
));
1427 pp_right_bracket (pp
);
1432 case TARGET_MEM_REF
:
1434 const char *sep
= "";
1437 pp_string (pp
, "MEM[");
1439 if (TREE_CODE (TMR_BASE (node
)) == ADDR_EXPR
)
1441 pp_string (pp
, sep
);
1443 pp_string (pp
, "symbol: ");
1444 dump_generic_node (pp
, TREE_OPERAND (TMR_BASE (node
), 0),
1449 pp_string (pp
, sep
);
1451 pp_string (pp
, "base: ");
1452 dump_generic_node (pp
, TMR_BASE (node
), spc
, flags
, false);
1454 tmp
= TMR_INDEX2 (node
);
1457 pp_string (pp
, sep
);
1459 pp_string (pp
, "base: ");
1460 dump_generic_node (pp
, tmp
, spc
, flags
, false);
1462 tmp
= TMR_INDEX (node
);
1465 pp_string (pp
, sep
);
1467 pp_string (pp
, "index: ");
1468 dump_generic_node (pp
, tmp
, spc
, flags
, false);
1470 tmp
= TMR_STEP (node
);
1473 pp_string (pp
, sep
);
1475 pp_string (pp
, "step: ");
1476 dump_generic_node (pp
, tmp
, spc
, flags
, false);
1478 tmp
= TMR_OFFSET (node
);
1481 pp_string (pp
, sep
);
1483 pp_string (pp
, "offset: ");
1484 dump_generic_node (pp
, tmp
, spc
, flags
, false);
1486 pp_right_bracket (pp
);
1494 /* Print the innermost component type. */
1495 for (tmp
= TREE_TYPE (node
); TREE_CODE (tmp
) == ARRAY_TYPE
;
1496 tmp
= TREE_TYPE (tmp
))
1498 dump_generic_node (pp
, tmp
, spc
, flags
, false);
1500 /* Print the dimensions. */
1501 for (tmp
= node
; TREE_CODE (tmp
) == ARRAY_TYPE
; tmp
= TREE_TYPE (tmp
))
1502 dump_array_domain (pp
, TYPE_DOMAIN (tmp
), spc
, flags
);
1508 case QUAL_UNION_TYPE
:
1510 unsigned int quals
= TYPE_QUALS (node
);
1512 if (quals
& TYPE_QUAL_ATOMIC
)
1513 pp_string (pp
, "atomic ");
1514 if (quals
& TYPE_QUAL_CONST
)
1515 pp_string (pp
, "const ");
1516 if (quals
& TYPE_QUAL_VOLATILE
)
1517 pp_string (pp
, "volatile ");
1519 /* Print the name of the structure. */
1520 if (TREE_CODE (node
) == RECORD_TYPE
)
1521 pp_string (pp
, "struct ");
1522 else if (TREE_CODE (node
) == UNION_TYPE
)
1523 pp_string (pp
, "union ");
1525 if (TYPE_NAME (node
))
1526 dump_generic_node (pp
, TYPE_NAME (node
), spc
, flags
, false);
1527 else if (!(flags
& TDF_SLIM
))
1528 /* FIXME: If we eliminate the 'else' above and attempt
1529 to show the fields for named types, we may get stuck
1530 following a cycle of pointers to structs. The alleged
1531 self-reference check in print_struct_decl will not detect
1532 cycles involving more than one pointer or struct type. */
1533 print_struct_decl (pp
, node
, spc
, flags
);
1542 if (TREE_CODE (TREE_TYPE (node
)) == POINTER_TYPE
)
1544 /* In the case of a pointer, one may want to divide by the
1545 size of the pointed-to type. Unfortunately, this not
1546 straightforward. The C front-end maps expressions
1551 in such a way that the two INTEGER_CST nodes for "5" have
1552 different values but identical types. In the latter
1553 case, the 5 is multiplied by sizeof (int) in c-common.c
1554 (pointer_int_sum) to convert it to a byte address, and
1555 yet the type of the node is left unchanged. Argh. What
1556 is consistent though is that the number value corresponds
1557 to bytes (UNITS) offset.
1559 NB: Neither of the following divisors can be trivially
1560 used to recover the original literal:
1562 TREE_INT_CST_LOW (TYPE_SIZE_UNIT (TREE_TYPE (node)))
1563 TYPE_PRECISION (TREE_TYPE (TREE_TYPE (node))) */
1564 pp_wide_integer (pp
, TREE_INT_CST_LOW (node
));
1565 pp_string (pp
, "B"); /* pseudo-unit */
1567 else if (tree_fits_shwi_p (node
))
1568 pp_wide_integer (pp
, tree_to_shwi (node
));
1569 else if (tree_fits_uhwi_p (node
))
1570 pp_unsigned_wide_integer (pp
, tree_to_uhwi (node
));
1573 wide_int val
= node
;
1575 if (wi::neg_p (val
, TYPE_SIGN (TREE_TYPE (node
))))
1580 print_hex (val
, pp_buffer (pp
)->digit_buffer
);
1581 pp_string (pp
, pp_buffer (pp
)->digit_buffer
);
1583 if (TREE_OVERFLOW (node
))
1584 pp_string (pp
, "(OVF)");
1588 /* Code copied from print_node. */
1591 if (TREE_OVERFLOW (node
))
1592 pp_string (pp
, " overflow");
1594 d
= TREE_REAL_CST (node
);
1595 if (REAL_VALUE_ISINF (d
))
1596 pp_string (pp
, REAL_VALUE_NEGATIVE (d
) ? " -Inf" : " Inf");
1597 else if (REAL_VALUE_ISNAN (d
))
1598 pp_string (pp
, " Nan");
1602 real_to_decimal (string
, &d
, sizeof (string
), 0, 1);
1603 pp_string (pp
, string
);
1611 fixed_to_decimal (string
, TREE_FIXED_CST_PTR (node
), sizeof (string
));
1612 pp_string (pp
, string
);
1617 pp_string (pp
, "__complex__ (");
1618 dump_generic_node (pp
, TREE_REALPART (node
), spc
, flags
, false);
1619 pp_string (pp
, ", ");
1620 dump_generic_node (pp
, TREE_IMAGPART (node
), spc
, flags
, false);
1621 pp_right_paren (pp
);
1625 pp_string (pp
, "\"");
1626 pretty_print_string (pp
, TREE_STRING_POINTER (node
));
1627 pp_string (pp
, "\"");
1633 pp_string (pp
, "{ ");
1634 for (i
= 0; i
< VECTOR_CST_NELTS (node
); ++i
)
1637 pp_string (pp
, ", ");
1638 dump_generic_node (pp
, VECTOR_CST_ELT (node
, i
),
1641 pp_string (pp
, " }");
1647 dump_generic_node (pp
, TREE_TYPE (node
), spc
, flags
, false);
1649 if (TREE_CODE (node
) == METHOD_TYPE
)
1651 if (TYPE_METHOD_BASETYPE (node
))
1652 dump_decl_name (pp
, TYPE_NAME (TYPE_METHOD_BASETYPE (node
)),
1655 pp_string (pp
, "<null method basetype>");
1656 pp_colon_colon (pp
);
1658 if (TYPE_NAME (node
) && DECL_NAME (TYPE_NAME (node
)))
1659 dump_decl_name (pp
, TYPE_NAME (node
), flags
);
1660 else if (flags
& TDF_NOUID
)
1661 pp_printf (pp
, "<Txxxx>");
1663 pp_printf (pp
, "<T%x>", TYPE_UID (node
));
1664 dump_function_declaration (pp
, node
, spc
, flags
);
1669 dump_decl_name (pp
, node
, flags
);
1673 if (DECL_NAME (node
))
1674 dump_decl_name (pp
, node
, flags
);
1675 else if (LABEL_DECL_UID (node
) != -1)
1676 pp_printf (pp
, "<L%d>", (int) LABEL_DECL_UID (node
));
1679 if (flags
& TDF_NOUID
)
1680 pp_string (pp
, "<D.xxxx>");
1682 pp_printf (pp
, "<D.%u>", DECL_UID (node
));
1687 if (DECL_IS_BUILTIN (node
))
1689 /* Don't print the declaration of built-in types. */
1692 if (DECL_NAME (node
))
1693 dump_decl_name (pp
, node
, flags
);
1694 else if (TYPE_NAME (TREE_TYPE (node
)) != node
)
1696 if ((TREE_CODE (TREE_TYPE (node
)) == RECORD_TYPE
1697 || TREE_CODE (TREE_TYPE (node
)) == UNION_TYPE
)
1698 && TYPE_METHODS (TREE_TYPE (node
)))
1700 /* The type is a c++ class: all structures have at least
1702 pp_string (pp
, "class ");
1703 dump_generic_node (pp
, TREE_TYPE (node
), spc
, flags
, false);
1708 (TREE_CODE (TREE_TYPE (node
)) == UNION_TYPE
1709 ? "union" : "struct "));
1710 dump_generic_node (pp
, TREE_TYPE (node
), spc
, flags
, false);
1714 pp_string (pp
, "<anon>");
1720 case DEBUG_EXPR_DECL
:
1721 case NAMESPACE_DECL
:
1723 dump_decl_name (pp
, node
, flags
);
1727 pp_string (pp
, "<retval>");
1731 op0
= TREE_OPERAND (node
, 0);
1734 && (TREE_CODE (op0
) == INDIRECT_REF
1735 || (TREE_CODE (op0
) == MEM_REF
1736 && TREE_CODE (TREE_OPERAND (op0
, 0)) != ADDR_EXPR
1737 && integer_zerop (TREE_OPERAND (op0
, 1))
1738 /* Dump the types of INTEGER_CSTs explicitly, for we
1739 can't infer them and MEM_ATTR caching will share
1740 MEM_REFs with differently-typed op0s. */
1741 && TREE_CODE (TREE_OPERAND (op0
, 0)) != INTEGER_CST
1742 /* Released SSA_NAMES have no TREE_TYPE. */
1743 && TREE_TYPE (TREE_OPERAND (op0
, 0)) != NULL_TREE
1744 /* Same pointer types, but ignoring POINTER_TYPE vs.
1746 && (TREE_TYPE (TREE_TYPE (TREE_OPERAND (op0
, 0)))
1747 == TREE_TYPE (TREE_TYPE (TREE_OPERAND (op0
, 1))))
1748 && (TYPE_MODE (TREE_TYPE (TREE_OPERAND (op0
, 0)))
1749 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (op0
, 1))))
1750 && (TYPE_REF_CAN_ALIAS_ALL (TREE_TYPE (TREE_OPERAND (op0
, 0)))
1751 == TYPE_REF_CAN_ALIAS_ALL (TREE_TYPE (TREE_OPERAND (op0
, 1))))
1752 /* Same value types ignoring qualifiers. */
1753 && (TYPE_MAIN_VARIANT (TREE_TYPE (op0
))
1754 == TYPE_MAIN_VARIANT
1755 (TREE_TYPE (TREE_TYPE (TREE_OPERAND (op0
, 1)))))
1756 && MR_DEPENDENCE_CLIQUE (op0
) == 0)))
1758 op0
= TREE_OPERAND (op0
, 0);
1761 if (op_prio (op0
) < op_prio (node
))
1763 dump_generic_node (pp
, op0
, spc
, flags
, false);
1764 if (op_prio (op0
) < op_prio (node
))
1765 pp_right_paren (pp
);
1766 pp_string (pp
, str
);
1767 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
1768 op0
= component_ref_field_offset (node
);
1769 if (op0
&& TREE_CODE (op0
) != INTEGER_CST
)
1771 pp_string (pp
, "{off: ");
1772 dump_generic_node (pp
, op0
, spc
, flags
, false);
1773 pp_right_brace (pp
);
1778 pp_string (pp
, "BIT_FIELD_REF <");
1779 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
1780 pp_string (pp
, ", ");
1781 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
1782 pp_string (pp
, ", ");
1783 dump_generic_node (pp
, TREE_OPERAND (node
, 2), spc
, flags
, false);
1788 case ARRAY_RANGE_REF
:
1789 op0
= TREE_OPERAND (node
, 0);
1790 if (op_prio (op0
) < op_prio (node
))
1792 dump_generic_node (pp
, op0
, spc
, flags
, false);
1793 if (op_prio (op0
) < op_prio (node
))
1794 pp_right_paren (pp
);
1795 pp_left_bracket (pp
);
1796 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
1797 if (TREE_CODE (node
) == ARRAY_RANGE_REF
)
1798 pp_string (pp
, " ...");
1799 pp_right_bracket (pp
);
1801 op0
= array_ref_low_bound (node
);
1802 op1
= array_ref_element_size (node
);
1804 if (!integer_zerop (op0
)
1805 || TREE_OPERAND (node
, 2)
1806 || TREE_OPERAND (node
, 3))
1808 pp_string (pp
, "{lb: ");
1809 dump_generic_node (pp
, op0
, spc
, flags
, false);
1810 pp_string (pp
, " sz: ");
1811 dump_generic_node (pp
, op1
, spc
, flags
, false);
1812 pp_right_brace (pp
);
1818 unsigned HOST_WIDE_INT ix
;
1820 bool is_struct_init
= false;
1821 bool is_array_init
= false;
1824 if (TREE_CLOBBER_P (node
))
1825 pp_string (pp
, "CLOBBER");
1826 else if (TREE_CODE (TREE_TYPE (node
)) == RECORD_TYPE
1827 || TREE_CODE (TREE_TYPE (node
)) == UNION_TYPE
)
1828 is_struct_init
= true;
1829 else if (TREE_CODE (TREE_TYPE (node
)) == ARRAY_TYPE
1830 && TYPE_DOMAIN (TREE_TYPE (node
))
1831 && TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (node
)))
1832 && TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (node
))))
1835 tree minv
= TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (node
)));
1836 is_array_init
= true;
1837 curidx
= wi::to_widest (minv
);
1839 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (node
), ix
, field
, val
)
1846 dump_generic_node (pp
, field
, spc
, flags
, false);
1849 else if (is_array_init
1850 && (TREE_CODE (field
) != INTEGER_CST
1851 || curidx
!= wi::to_widest (field
)))
1853 pp_left_bracket (pp
);
1854 if (TREE_CODE (field
) == RANGE_EXPR
)
1856 dump_generic_node (pp
, TREE_OPERAND (field
, 0), spc
,
1858 pp_string (pp
, " ... ");
1859 dump_generic_node (pp
, TREE_OPERAND (field
, 1), spc
,
1861 if (TREE_CODE (TREE_OPERAND (field
, 1)) == INTEGER_CST
)
1862 curidx
= wi::to_widest (TREE_OPERAND (field
, 1));
1865 dump_generic_node (pp
, field
, spc
, flags
, false);
1866 if (TREE_CODE (field
) == INTEGER_CST
)
1867 curidx
= wi::to_widest (field
);
1868 pp_string (pp
, "]=");
1873 if (val
&& TREE_CODE (val
) == ADDR_EXPR
)
1874 if (TREE_CODE (TREE_OPERAND (val
, 0)) == FUNCTION_DECL
)
1875 val
= TREE_OPERAND (val
, 0);
1876 if (val
&& TREE_CODE (val
) == FUNCTION_DECL
)
1877 dump_decl_name (pp
, val
, flags
);
1879 dump_generic_node (pp
, val
, spc
, flags
, false);
1880 if (ix
!= vec_safe_length (CONSTRUCTOR_ELTS (node
)) - 1)
1886 pp_right_brace (pp
);
1893 if (flags
& TDF_SLIM
)
1895 pp_string (pp
, "<COMPOUND_EXPR>");
1899 dump_generic_node (pp
, TREE_OPERAND (node
, 0),
1900 spc
, flags
, !(flags
& TDF_SLIM
));
1901 if (flags
& TDF_SLIM
)
1902 newline_and_indent (pp
, spc
);
1909 for (tp
= &TREE_OPERAND (node
, 1);
1910 TREE_CODE (*tp
) == COMPOUND_EXPR
;
1911 tp
= &TREE_OPERAND (*tp
, 1))
1913 dump_generic_node (pp
, TREE_OPERAND (*tp
, 0),
1914 spc
, flags
, !(flags
& TDF_SLIM
));
1915 if (flags
& TDF_SLIM
)
1916 newline_and_indent (pp
, spc
);
1924 dump_generic_node (pp
, *tp
, spc
, flags
, !(flags
& TDF_SLIM
));
1928 case STATEMENT_LIST
:
1930 tree_stmt_iterator si
;
1933 if (flags
& TDF_SLIM
)
1935 pp_string (pp
, "<STATEMENT_LIST>");
1939 for (si
= tsi_start (node
); !tsi_end_p (si
); tsi_next (&si
))
1942 newline_and_indent (pp
, spc
);
1945 dump_generic_node (pp
, tsi_stmt (si
), spc
, flags
, true);
1952 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
,
1957 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
,
1962 pp_string (pp
, "TARGET_EXPR <");
1963 dump_generic_node (pp
, TARGET_EXPR_SLOT (node
), spc
, flags
, false);
1966 dump_generic_node (pp
, TARGET_EXPR_INITIAL (node
), spc
, flags
, false);
1971 print_declaration (pp
, DECL_EXPR_DECL (node
), spc
, flags
);
1976 if (TREE_TYPE (node
) == NULL
|| TREE_TYPE (node
) == void_type_node
)
1978 pp_string (pp
, "if (");
1979 dump_generic_node (pp
, COND_EXPR_COND (node
), spc
, flags
, false);
1980 pp_right_paren (pp
);
1981 /* The lowered cond_exprs should always be printed in full. */
1982 if (COND_EXPR_THEN (node
)
1983 && (IS_EMPTY_STMT (COND_EXPR_THEN (node
))
1984 || TREE_CODE (COND_EXPR_THEN (node
)) == GOTO_EXPR
)
1985 && COND_EXPR_ELSE (node
)
1986 && (IS_EMPTY_STMT (COND_EXPR_ELSE (node
))
1987 || TREE_CODE (COND_EXPR_ELSE (node
)) == GOTO_EXPR
))
1990 dump_generic_node (pp
, COND_EXPR_THEN (node
),
1992 if (!IS_EMPTY_STMT (COND_EXPR_ELSE (node
)))
1994 pp_string (pp
, " else ");
1995 dump_generic_node (pp
, COND_EXPR_ELSE (node
),
1999 else if (!(flags
& TDF_SLIM
))
2001 /* Output COND_EXPR_THEN. */
2002 if (COND_EXPR_THEN (node
))
2004 newline_and_indent (pp
, spc
+2);
2006 newline_and_indent (pp
, spc
+4);
2007 dump_generic_node (pp
, COND_EXPR_THEN (node
), spc
+4,
2009 newline_and_indent (pp
, spc
+2);
2010 pp_right_brace (pp
);
2013 /* Output COND_EXPR_ELSE. */
2014 if (COND_EXPR_ELSE (node
)
2015 && !IS_EMPTY_STMT (COND_EXPR_ELSE (node
)))
2017 newline_and_indent (pp
, spc
);
2018 pp_string (pp
, "else");
2019 newline_and_indent (pp
, spc
+2);
2021 newline_and_indent (pp
, spc
+4);
2022 dump_generic_node (pp
, COND_EXPR_ELSE (node
), spc
+4,
2024 newline_and_indent (pp
, spc
+2);
2025 pp_right_brace (pp
);
2032 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2036 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
2040 dump_generic_node (pp
, TREE_OPERAND (node
, 2), spc
, flags
, false);
2046 if (!(flags
& TDF_SLIM
))
2048 if (BIND_EXPR_VARS (node
))
2052 for (op0
= BIND_EXPR_VARS (node
); op0
; op0
= DECL_CHAIN (op0
))
2054 print_declaration (pp
, op0
, spc
+2, flags
);
2059 newline_and_indent (pp
, spc
+2);
2060 dump_generic_node (pp
, BIND_EXPR_BODY (node
), spc
+2, flags
, true);
2061 newline_and_indent (pp
, spc
);
2062 pp_right_brace (pp
);
2068 if (CALL_EXPR_FN (node
) != NULL_TREE
)
2069 print_call_name (pp
, CALL_EXPR_FN (node
), flags
);
2071 pp_string (pp
, internal_fn_name (CALL_EXPR_IFN (node
)));
2073 /* Print parameters. */
2078 call_expr_arg_iterator iter
;
2079 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, node
)
2081 dump_generic_node (pp
, arg
, spc
, flags
, false);
2082 if (more_call_expr_args_p (&iter
))
2089 if (CALL_EXPR_VA_ARG_PACK (node
))
2091 if (call_expr_nargs (node
) > 0)
2096 pp_string (pp
, "__builtin_va_arg_pack ()");
2098 pp_right_paren (pp
);
2100 op1
= CALL_EXPR_STATIC_CHAIN (node
);
2103 pp_string (pp
, " [static-chain: ");
2104 dump_generic_node (pp
, op1
, spc
, flags
, false);
2105 pp_right_bracket (pp
);
2108 if (CALL_EXPR_RETURN_SLOT_OPT (node
))
2109 pp_string (pp
, " [return slot optimization]");
2110 if (CALL_EXPR_TAILCALL (node
))
2111 pp_string (pp
, " [tail call]");
2114 case WITH_CLEANUP_EXPR
:
2118 case CLEANUP_POINT_EXPR
:
2119 pp_string (pp
, "<<cleanup_point ");
2120 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2121 pp_string (pp
, ">>");
2124 case PLACEHOLDER_EXPR
:
2125 pp_string (pp
, "<PLACEHOLDER_EXPR ");
2126 dump_generic_node (pp
, TREE_TYPE (node
), spc
, flags
, false);
2130 /* Binary arithmetic and logic expressions. */
2131 case WIDEN_SUM_EXPR
:
2132 case WIDEN_MULT_EXPR
:
2134 case MULT_HIGHPART_EXPR
:
2136 case POINTER_PLUS_EXPR
:
2138 case TRUNC_DIV_EXPR
:
2140 case FLOOR_DIV_EXPR
:
2141 case ROUND_DIV_EXPR
:
2142 case TRUNC_MOD_EXPR
:
2144 case FLOOR_MOD_EXPR
:
2145 case ROUND_MOD_EXPR
:
2147 case EXACT_DIV_EXPR
:
2152 case WIDEN_LSHIFT_EXPR
:
2156 case TRUTH_ANDIF_EXPR
:
2157 case TRUTH_ORIF_EXPR
:
2158 case TRUTH_AND_EXPR
:
2160 case TRUTH_XOR_EXPR
:
2174 case UNORDERED_EXPR
:
2176 const char *op
= op_symbol (node
);
2177 op0
= TREE_OPERAND (node
, 0);
2178 op1
= TREE_OPERAND (node
, 1);
2180 /* When the operands are expressions with less priority,
2181 keep semantics of the tree representation. */
2182 if (op_prio (op0
) <= op_prio (node
))
2185 dump_generic_node (pp
, op0
, spc
, flags
, false);
2186 pp_right_paren (pp
);
2189 dump_generic_node (pp
, op0
, spc
, flags
, false);
2195 /* When the operands are expressions with less priority,
2196 keep semantics of the tree representation. */
2197 if (op_prio (op1
) <= op_prio (node
))
2200 dump_generic_node (pp
, op1
, spc
, flags
, false);
2201 pp_right_paren (pp
);
2204 dump_generic_node (pp
, op1
, spc
, flags
, false);
2208 /* Unary arithmetic and logic expressions. */
2211 case TRUTH_NOT_EXPR
:
2213 case PREDECREMENT_EXPR
:
2214 case PREINCREMENT_EXPR
:
2216 if (TREE_CODE (node
) == ADDR_EXPR
2217 && (TREE_CODE (TREE_OPERAND (node
, 0)) == STRING_CST
2218 || TREE_CODE (TREE_OPERAND (node
, 0)) == FUNCTION_DECL
))
2219 ; /* Do not output '&' for strings and function pointers. */
2221 pp_string (pp
, op_symbol (node
));
2223 if (op_prio (TREE_OPERAND (node
, 0)) < op_prio (node
))
2226 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2227 pp_right_paren (pp
);
2230 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2233 case POSTDECREMENT_EXPR
:
2234 case POSTINCREMENT_EXPR
:
2235 if (op_prio (TREE_OPERAND (node
, 0)) < op_prio (node
))
2238 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2239 pp_right_paren (pp
);
2242 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2243 pp_string (pp
, op_symbol (node
));
2247 pp_string (pp
, "MIN_EXPR <");
2248 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2249 pp_string (pp
, ", ");
2250 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
2255 pp_string (pp
, "MAX_EXPR <");
2256 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2257 pp_string (pp
, ", ");
2258 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
2263 pp_string (pp
, "ABS_EXPR <");
2264 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2272 case ADDR_SPACE_CONVERT_EXPR
:
2273 case FIXED_CONVERT_EXPR
:
2274 case FIX_TRUNC_EXPR
:
2277 type
= TREE_TYPE (node
);
2278 op0
= TREE_OPERAND (node
, 0);
2279 if (type
!= TREE_TYPE (op0
))
2282 dump_generic_node (pp
, type
, spc
, flags
, false);
2283 pp_string (pp
, ") ");
2285 if (op_prio (op0
) < op_prio (node
))
2287 dump_generic_node (pp
, op0
, spc
, flags
, false);
2288 if (op_prio (op0
) < op_prio (node
))
2289 pp_right_paren (pp
);
2292 case VIEW_CONVERT_EXPR
:
2293 pp_string (pp
, "VIEW_CONVERT_EXPR<");
2294 dump_generic_node (pp
, TREE_TYPE (node
), spc
, flags
, false);
2295 pp_string (pp
, ">(");
2296 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2297 pp_right_paren (pp
);
2301 pp_string (pp
, "((");
2302 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2303 pp_string (pp
, "))");
2306 case NON_LVALUE_EXPR
:
2307 pp_string (pp
, "NON_LVALUE_EXPR <");
2308 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2313 pp_string (pp
, "SAVE_EXPR <");
2314 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2319 pp_string (pp
, "COMPLEX_EXPR <");
2320 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2321 pp_string (pp
, ", ");
2322 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
2327 pp_string (pp
, "CONJ_EXPR <");
2328 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2333 pp_string (pp
, "REALPART_EXPR <");
2334 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2339 pp_string (pp
, "IMAGPART_EXPR <");
2340 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2345 pp_string (pp
, "VA_ARG_EXPR <");
2346 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2350 case TRY_FINALLY_EXPR
:
2351 case TRY_CATCH_EXPR
:
2352 pp_string (pp
, "try");
2353 newline_and_indent (pp
, spc
+2);
2355 newline_and_indent (pp
, spc
+4);
2356 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
+4, flags
, true);
2357 newline_and_indent (pp
, spc
+2);
2358 pp_right_brace (pp
);
2359 newline_and_indent (pp
, spc
);
2361 (TREE_CODE (node
) == TRY_CATCH_EXPR
) ? "catch" : "finally");
2362 newline_and_indent (pp
, spc
+2);
2364 newline_and_indent (pp
, spc
+4);
2365 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
+4, flags
, true);
2366 newline_and_indent (pp
, spc
+2);
2367 pp_right_brace (pp
);
2372 pp_string (pp
, "catch (");
2373 dump_generic_node (pp
, CATCH_TYPES (node
), spc
+2, flags
, false);
2374 pp_right_paren (pp
);
2375 newline_and_indent (pp
, spc
+2);
2377 newline_and_indent (pp
, spc
+4);
2378 dump_generic_node (pp
, CATCH_BODY (node
), spc
+4, flags
, true);
2379 newline_and_indent (pp
, spc
+2);
2380 pp_right_brace (pp
);
2384 case EH_FILTER_EXPR
:
2385 pp_string (pp
, "<<<eh_filter (");
2386 dump_generic_node (pp
, EH_FILTER_TYPES (node
), spc
+2, flags
, false);
2387 pp_string (pp
, ")>>>");
2388 newline_and_indent (pp
, spc
+2);
2390 newline_and_indent (pp
, spc
+4);
2391 dump_generic_node (pp
, EH_FILTER_FAILURE (node
), spc
+4, flags
, true);
2392 newline_and_indent (pp
, spc
+2);
2393 pp_right_brace (pp
);
2398 op0
= TREE_OPERAND (node
, 0);
2399 /* If this is for break or continue, don't bother printing it. */
2400 if (DECL_NAME (op0
))
2402 const char *name
= IDENTIFIER_POINTER (DECL_NAME (op0
));
2403 if (strcmp (name
, "break") == 0
2404 || strcmp (name
, "continue") == 0)
2407 dump_generic_node (pp
, op0
, spc
, flags
, false);
2409 if (DECL_NONLOCAL (op0
))
2410 pp_string (pp
, " [non-local]");
2414 pp_string (pp
, "while (1)");
2415 if (!(flags
& TDF_SLIM
))
2417 newline_and_indent (pp
, spc
+2);
2419 newline_and_indent (pp
, spc
+4);
2420 dump_generic_node (pp
, LOOP_EXPR_BODY (node
), spc
+4, flags
, true);
2421 newline_and_indent (pp
, spc
+2);
2422 pp_right_brace (pp
);
2428 pp_string (pp
, "// predicted ");
2429 if (PREDICT_EXPR_OUTCOME (node
))
2430 pp_string (pp
, "likely by ");
2432 pp_string (pp
, "unlikely by ");
2433 pp_string (pp
, predictor_name (PREDICT_EXPR_PREDICTOR (node
)));
2434 pp_string (pp
, " predictor.");
2438 pp_string (pp
, "ANNOTATE_EXPR <");
2439 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2440 switch ((enum annot_expr_kind
) TREE_INT_CST_LOW (TREE_OPERAND (node
, 1)))
2442 case annot_expr_ivdep_kind
:
2443 pp_string (pp
, ", ivdep");
2445 case annot_expr_no_vector_kind
:
2446 pp_string (pp
, ", no-vector");
2448 case annot_expr_vector_kind
:
2449 pp_string (pp
, ", vector");
2458 pp_string (pp
, "return");
2459 op0
= TREE_OPERAND (node
, 0);
2463 if (TREE_CODE (op0
) == MODIFY_EXPR
)
2464 dump_generic_node (pp
, TREE_OPERAND (op0
, 1),
2467 dump_generic_node (pp
, op0
, spc
, flags
, false);
2472 pp_string (pp
, "if (");
2473 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2474 pp_string (pp
, ") break");
2478 pp_string (pp
, "switch (");
2479 dump_generic_node (pp
, SWITCH_COND (node
), spc
, flags
, false);
2480 pp_right_paren (pp
);
2481 if (!(flags
& TDF_SLIM
))
2483 newline_and_indent (pp
, spc
+2);
2485 if (SWITCH_BODY (node
))
2487 newline_and_indent (pp
, spc
+4);
2488 dump_generic_node (pp
, SWITCH_BODY (node
), spc
+4, flags
,
2493 tree vec
= SWITCH_LABELS (node
);
2494 size_t i
, n
= TREE_VEC_LENGTH (vec
);
2495 for (i
= 0; i
< n
; ++i
)
2497 tree elt
= TREE_VEC_ELT (vec
, i
);
2498 newline_and_indent (pp
, spc
+4);
2501 dump_generic_node (pp
, elt
, spc
+4, flags
, false);
2502 pp_string (pp
, " goto ");
2503 dump_generic_node (pp
, CASE_LABEL (elt
), spc
+4,
2508 pp_string (pp
, "case ???: goto ???;");
2511 newline_and_indent (pp
, spc
+2);
2512 pp_right_brace (pp
);
2518 op0
= GOTO_DESTINATION (node
);
2519 if (TREE_CODE (op0
) != SSA_NAME
&& DECL_P (op0
) && DECL_NAME (op0
))
2521 const char *name
= IDENTIFIER_POINTER (DECL_NAME (op0
));
2522 if (strcmp (name
, "break") == 0
2523 || strcmp (name
, "continue") == 0)
2525 pp_string (pp
, name
);
2529 pp_string (pp
, "goto ");
2530 dump_generic_node (pp
, op0
, spc
, flags
, false);
2534 pp_string (pp
, "__asm__");
2535 if (ASM_VOLATILE_P (node
))
2536 pp_string (pp
, " __volatile__");
2538 dump_generic_node (pp
, ASM_STRING (node
), spc
, flags
, false);
2540 dump_generic_node (pp
, ASM_OUTPUTS (node
), spc
, flags
, false);
2542 dump_generic_node (pp
, ASM_INPUTS (node
), spc
, flags
, false);
2543 if (ASM_CLOBBERS (node
))
2546 dump_generic_node (pp
, ASM_CLOBBERS (node
), spc
, flags
, false);
2548 pp_right_paren (pp
);
2551 case CASE_LABEL_EXPR
:
2552 if (CASE_LOW (node
) && CASE_HIGH (node
))
2554 pp_string (pp
, "case ");
2555 dump_generic_node (pp
, CASE_LOW (node
), spc
, flags
, false);
2556 pp_string (pp
, " ... ");
2557 dump_generic_node (pp
, CASE_HIGH (node
), spc
, flags
, false);
2559 else if (CASE_LOW (node
))
2561 pp_string (pp
, "case ");
2562 dump_generic_node (pp
, CASE_LOW (node
), spc
, flags
, false);
2565 pp_string (pp
, "default");
2570 pp_string (pp
, "OBJ_TYPE_REF(");
2571 dump_generic_node (pp
, OBJ_TYPE_REF_EXPR (node
), spc
, flags
, false);
2573 if (!(flags
& TDF_SLIM
) && virtual_method_call_p (node
))
2575 pp_string (pp
, "(");
2576 dump_generic_node (pp
, obj_type_ref_class (node
), spc
, flags
, false);
2577 pp_string (pp
, ")");
2579 dump_generic_node (pp
, OBJ_TYPE_REF_OBJECT (node
), spc
, flags
, false);
2581 dump_generic_node (pp
, OBJ_TYPE_REF_TOKEN (node
), spc
, flags
, false);
2582 pp_right_paren (pp
);
2586 if (SSA_NAME_IDENTIFIER (node
))
2587 dump_generic_node (pp
, SSA_NAME_IDENTIFIER (node
),
2590 pp_decimal_int (pp
, SSA_NAME_VERSION (node
));
2591 if (SSA_NAME_IS_DEFAULT_DEF (node
))
2592 pp_string (pp
, "(D)");
2593 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (node
))
2594 pp_string (pp
, "(ab)");
2597 case WITH_SIZE_EXPR
:
2598 pp_string (pp
, "WITH_SIZE_EXPR <");
2599 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2600 pp_string (pp
, ", ");
2601 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
2606 pp_string (pp
, "ASSERT_EXPR <");
2607 dump_generic_node (pp
, ASSERT_EXPR_VAR (node
), spc
, flags
, false);
2608 pp_string (pp
, ", ");
2609 dump_generic_node (pp
, ASSERT_EXPR_COND (node
), spc
, flags
, false);
2614 pp_string (pp
, "scev_known");
2617 case SCEV_NOT_KNOWN
:
2618 pp_string (pp
, "scev_not_known");
2621 case POLYNOMIAL_CHREC
:
2623 dump_generic_node (pp
, CHREC_LEFT (node
), spc
, flags
, false);
2624 pp_string (pp
, ", +, ");
2625 dump_generic_node (pp
, CHREC_RIGHT (node
), spc
, flags
, false);
2626 pp_string (pp
, "}_");
2627 dump_generic_node (pp
, CHREC_VAR (node
), spc
, flags
, false);
2631 case REALIGN_LOAD_EXPR
:
2632 pp_string (pp
, "REALIGN_LOAD <");
2633 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2634 pp_string (pp
, ", ");
2635 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
2636 pp_string (pp
, ", ");
2637 dump_generic_node (pp
, TREE_OPERAND (node
, 2), spc
, flags
, false);
2642 pp_string (pp
, " VEC_COND_EXPR < ");
2643 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2644 pp_string (pp
, " , ");
2645 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
2646 pp_string (pp
, " , ");
2647 dump_generic_node (pp
, TREE_OPERAND (node
, 2), spc
, flags
, false);
2648 pp_string (pp
, " > ");
2652 pp_string (pp
, " VEC_PERM_EXPR < ");
2653 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2654 pp_string (pp
, " , ");
2655 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
2656 pp_string (pp
, " , ");
2657 dump_generic_node (pp
, TREE_OPERAND (node
, 2), spc
, flags
, false);
2658 pp_string (pp
, " > ");
2662 pp_string (pp
, " DOT_PROD_EXPR < ");
2663 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2664 pp_string (pp
, ", ");
2665 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
2666 pp_string (pp
, ", ");
2667 dump_generic_node (pp
, TREE_OPERAND (node
, 2), spc
, flags
, false);
2668 pp_string (pp
, " > ");
2671 case WIDEN_MULT_PLUS_EXPR
:
2672 pp_string (pp
, " WIDEN_MULT_PLUS_EXPR < ");
2673 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2674 pp_string (pp
, ", ");
2675 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
2676 pp_string (pp
, ", ");
2677 dump_generic_node (pp
, TREE_OPERAND (node
, 2), spc
, flags
, false);
2678 pp_string (pp
, " > ");
2681 case WIDEN_MULT_MINUS_EXPR
:
2682 pp_string (pp
, " WIDEN_MULT_MINUS_EXPR < ");
2683 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2684 pp_string (pp
, ", ");
2685 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
2686 pp_string (pp
, ", ");
2687 dump_generic_node (pp
, TREE_OPERAND (node
, 2), spc
, flags
, false);
2688 pp_string (pp
, " > ");
2692 pp_string (pp
, " FMA_EXPR < ");
2693 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2694 pp_string (pp
, ", ");
2695 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
2696 pp_string (pp
, ", ");
2697 dump_generic_node (pp
, TREE_OPERAND (node
, 2), spc
, flags
, false);
2698 pp_string (pp
, " > ");
2702 pp_string (pp
, "#pragma acc parallel");
2703 goto dump_omp_clauses_body
;
2706 pp_string (pp
, "#pragma acc kernels");
2707 goto dump_omp_clauses_body
;
2710 pp_string (pp
, "#pragma acc data");
2711 dump_omp_clauses (pp
, OACC_DATA_CLAUSES (node
), spc
, flags
);
2714 case OACC_HOST_DATA
:
2715 pp_string (pp
, "#pragma acc host_data");
2716 dump_omp_clauses (pp
, OACC_HOST_DATA_CLAUSES (node
), spc
, flags
);
2720 pp_string (pp
, "#pragma acc declare");
2721 dump_omp_clauses (pp
, OACC_DECLARE_CLAUSES (node
), spc
, flags
);
2725 pp_string (pp
, "#pragma acc update");
2726 dump_omp_clauses (pp
, OACC_UPDATE_CLAUSES (node
), spc
, flags
);
2729 case OACC_ENTER_DATA
:
2730 pp_string (pp
, "#pragma acc enter data");
2731 dump_omp_clauses (pp
, OACC_ENTER_DATA_CLAUSES (node
), spc
, flags
);
2734 case OACC_EXIT_DATA
:
2735 pp_string (pp
, "#pragma acc exit data");
2736 dump_omp_clauses (pp
, OACC_EXIT_DATA_CLAUSES (node
), spc
, flags
);
2740 pp_string (pp
, "#pragma acc cache");
2741 dump_omp_clauses (pp
, OACC_CACHE_CLAUSES (node
), spc
, flags
);
2745 pp_string (pp
, "#pragma omp parallel");
2746 dump_omp_clauses (pp
, OMP_PARALLEL_CLAUSES (node
), spc
, flags
);
2749 dump_omp_clauses_body
:
2750 dump_omp_clauses (pp
, OMP_CLAUSES (node
), spc
, flags
);
2754 if (!(flags
& TDF_SLIM
) && OMP_BODY (node
))
2756 newline_and_indent (pp
, spc
+ 2);
2758 newline_and_indent (pp
, spc
+ 4);
2759 dump_generic_node (pp
, OMP_BODY (node
), spc
+ 4, flags
, false);
2760 newline_and_indent (pp
, spc
+ 2);
2761 pp_right_brace (pp
);
2767 pp_string (pp
, "#pragma omp task");
2768 dump_omp_clauses (pp
, OMP_TASK_CLAUSES (node
), spc
, flags
);
2772 pp_string (pp
, "#pragma omp for");
2776 pp_string (pp
, "#pragma omp simd");
2780 pp_string (pp
, "#pragma simd");
2784 /* This label points one line after dumping the clauses.
2785 For _Cilk_for the clauses are dumped after the _Cilk_for (...)
2786 parameters are printed out. */
2787 goto dump_omp_loop_cilk_for
;
2789 case OMP_DISTRIBUTE
:
2790 pp_string (pp
, "#pragma omp distribute");
2794 pp_string (pp
, "#pragma omp taskloop");
2798 pp_string (pp
, "#pragma acc loop");
2802 pp_string (pp
, "#pragma omp teams");
2803 dump_omp_clauses (pp
, OMP_TEAMS_CLAUSES (node
), spc
, flags
);
2806 case OMP_TARGET_DATA
:
2807 pp_string (pp
, "#pragma omp target data");
2808 dump_omp_clauses (pp
, OMP_TARGET_DATA_CLAUSES (node
), spc
, flags
);
2811 case OMP_TARGET_ENTER_DATA
:
2812 pp_string (pp
, "#pragma omp target enter data");
2813 dump_omp_clauses (pp
, OMP_TARGET_ENTER_DATA_CLAUSES (node
), spc
, flags
);
2817 case OMP_TARGET_EXIT_DATA
:
2818 pp_string (pp
, "#pragma omp target exit data");
2819 dump_omp_clauses (pp
, OMP_TARGET_EXIT_DATA_CLAUSES (node
), spc
, flags
);
2824 pp_string (pp
, "#pragma omp target");
2825 dump_omp_clauses (pp
, OMP_TARGET_CLAUSES (node
), spc
, flags
);
2828 case OMP_TARGET_UPDATE
:
2829 pp_string (pp
, "#pragma omp target update");
2830 dump_omp_clauses (pp
, OMP_TARGET_UPDATE_CLAUSES (node
), spc
, flags
);
2835 dump_omp_clauses (pp
, OMP_FOR_CLAUSES (node
), spc
, flags
);
2837 dump_omp_loop_cilk_for
:
2838 if (!(flags
& TDF_SLIM
))
2842 if (OMP_FOR_PRE_BODY (node
))
2844 if (TREE_CODE (node
) == CILK_FOR
)
2845 pp_string (pp
, " ");
2847 newline_and_indent (pp
, spc
+ 2);
2850 newline_and_indent (pp
, spc
);
2851 dump_generic_node (pp
, OMP_FOR_PRE_BODY (node
),
2854 if (OMP_FOR_INIT (node
))
2857 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (node
)); i
++)
2860 if (TREE_CODE (node
) != CILK_FOR
|| OMP_FOR_PRE_BODY (node
))
2861 newline_and_indent (pp
, spc
);
2862 if (TREE_CODE (node
) == CILK_FOR
)
2863 pp_string (pp
, "_Cilk_for (");
2865 pp_string (pp
, "for (");
2866 dump_generic_node (pp
,
2867 TREE_VEC_ELT (OMP_FOR_INIT (node
), i
),
2869 pp_string (pp
, "; ");
2870 dump_generic_node (pp
,
2871 TREE_VEC_ELT (OMP_FOR_COND (node
), i
),
2873 pp_string (pp
, "; ");
2874 dump_generic_node (pp
,
2875 TREE_VEC_ELT (OMP_FOR_INCR (node
), i
),
2877 pp_right_paren (pp
);
2879 if (TREE_CODE (node
) == CILK_FOR
)
2880 dump_omp_clauses (pp
, OMP_FOR_CLAUSES (node
), spc
, flags
);
2882 if (OMP_FOR_BODY (node
))
2884 newline_and_indent (pp
, spc
+ 2);
2886 newline_and_indent (pp
, spc
+ 4);
2887 dump_generic_node (pp
, OMP_FOR_BODY (node
), spc
+ 4, flags
,
2889 newline_and_indent (pp
, spc
+ 2);
2890 pp_right_brace (pp
);
2892 if (OMP_FOR_INIT (node
))
2893 spc
-= 2 * TREE_VEC_LENGTH (OMP_FOR_INIT (node
)) - 2;
2894 if (OMP_FOR_PRE_BODY (node
))
2897 newline_and_indent (pp
, spc
+ 2);
2898 pp_right_brace (pp
);
2905 pp_string (pp
, "#pragma omp sections");
2906 dump_omp_clauses (pp
, OMP_SECTIONS_CLAUSES (node
), spc
, flags
);
2910 pp_string (pp
, "#pragma omp section");
2914 pp_string (pp
, "#pragma omp master");
2918 pp_string (pp
, "#pragma omp taskgroup");
2922 pp_string (pp
, "#pragma omp ordered");
2923 dump_omp_clauses (pp
, OMP_ORDERED_CLAUSES (node
), spc
, flags
);
2927 pp_string (pp
, "#pragma omp critical");
2928 if (OMP_CRITICAL_NAME (node
))
2932 dump_generic_node (pp
, OMP_CRITICAL_NAME (node
), spc
,
2934 pp_right_paren (pp
);
2936 dump_omp_clauses (pp
, OMP_CRITICAL_CLAUSES (node
), spc
, flags
);
2940 pp_string (pp
, "#pragma omp atomic");
2941 if (OMP_ATOMIC_SEQ_CST (node
))
2942 pp_string (pp
, " seq_cst");
2943 newline_and_indent (pp
, spc
+ 2);
2944 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2948 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
2951 case OMP_ATOMIC_READ
:
2952 pp_string (pp
, "#pragma omp atomic read");
2953 if (OMP_ATOMIC_SEQ_CST (node
))
2954 pp_string (pp
, " seq_cst");
2955 newline_and_indent (pp
, spc
+ 2);
2956 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2960 case OMP_ATOMIC_CAPTURE_OLD
:
2961 case OMP_ATOMIC_CAPTURE_NEW
:
2962 pp_string (pp
, "#pragma omp atomic capture");
2963 if (OMP_ATOMIC_SEQ_CST (node
))
2964 pp_string (pp
, " seq_cst");
2965 newline_and_indent (pp
, spc
+ 2);
2966 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
2970 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
2974 pp_string (pp
, "#pragma omp single");
2975 dump_omp_clauses (pp
, OMP_SINGLE_CLAUSES (node
), spc
, flags
);
2979 dump_omp_clause (pp
, node
, spc
, flags
);
2983 case TRANSACTION_EXPR
:
2984 if (TRANSACTION_EXPR_OUTER (node
))
2985 pp_string (pp
, "__transaction_atomic [[outer]]");
2986 else if (TRANSACTION_EXPR_RELAXED (node
))
2987 pp_string (pp
, "__transaction_relaxed");
2989 pp_string (pp
, "__transaction_atomic");
2990 if (!(flags
& TDF_SLIM
) && TRANSACTION_EXPR_BODY (node
))
2992 newline_and_indent (pp
, spc
);
2994 newline_and_indent (pp
, spc
+ 2);
2995 dump_generic_node (pp
, TRANSACTION_EXPR_BODY (node
),
2996 spc
+ 2, flags
, false);
2997 newline_and_indent (pp
, spc
);
2998 pp_right_brace (pp
);
3003 case REDUC_MAX_EXPR
:
3004 pp_string (pp
, " REDUC_MAX_EXPR < ");
3005 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
3006 pp_string (pp
, " > ");
3009 case REDUC_MIN_EXPR
:
3010 pp_string (pp
, " REDUC_MIN_EXPR < ");
3011 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
3012 pp_string (pp
, " > ");
3015 case REDUC_PLUS_EXPR
:
3016 pp_string (pp
, " REDUC_PLUS_EXPR < ");
3017 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
3018 pp_string (pp
, " > ");
3021 case VEC_WIDEN_MULT_HI_EXPR
:
3022 case VEC_WIDEN_MULT_LO_EXPR
:
3023 case VEC_WIDEN_MULT_EVEN_EXPR
:
3024 case VEC_WIDEN_MULT_ODD_EXPR
:
3025 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3026 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3028 for (str
= get_tree_code_name (code
); *str
; str
++)
3029 pp_character (pp
, TOUPPER (*str
));
3030 pp_string (pp
, " < ");
3031 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
3032 pp_string (pp
, ", ");
3033 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
3034 pp_string (pp
, " > ");
3037 case VEC_UNPACK_HI_EXPR
:
3038 pp_string (pp
, " VEC_UNPACK_HI_EXPR < ");
3039 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
3040 pp_string (pp
, " > ");
3043 case VEC_UNPACK_LO_EXPR
:
3044 pp_string (pp
, " VEC_UNPACK_LO_EXPR < ");
3045 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
3046 pp_string (pp
, " > ");
3049 case VEC_UNPACK_FLOAT_HI_EXPR
:
3050 pp_string (pp
, " VEC_UNPACK_FLOAT_HI_EXPR < ");
3051 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
3052 pp_string (pp
, " > ");
3055 case VEC_UNPACK_FLOAT_LO_EXPR
:
3056 pp_string (pp
, " VEC_UNPACK_FLOAT_LO_EXPR < ");
3057 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
3058 pp_string (pp
, " > ");
3061 case VEC_PACK_TRUNC_EXPR
:
3062 pp_string (pp
, " VEC_PACK_TRUNC_EXPR < ");
3063 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
3064 pp_string (pp
, ", ");
3065 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
3066 pp_string (pp
, " > ");
3069 case VEC_PACK_SAT_EXPR
:
3070 pp_string (pp
, " VEC_PACK_SAT_EXPR < ");
3071 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
3072 pp_string (pp
, ", ");
3073 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
3074 pp_string (pp
, " > ");
3077 case VEC_PACK_FIX_TRUNC_EXPR
:
3078 pp_string (pp
, " VEC_PACK_FIX_TRUNC_EXPR < ");
3079 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
3080 pp_string (pp
, ", ");
3081 dump_generic_node (pp
, TREE_OPERAND (node
, 1), spc
, flags
, false);
3082 pp_string (pp
, " > ");
3086 dump_block_node (pp
, node
, spc
, flags
);
3089 case CILK_SPAWN_STMT
:
3090 pp_string (pp
, "_Cilk_spawn ");
3091 dump_generic_node (pp
, TREE_OPERAND (node
, 0), spc
, flags
, false);
3094 case CILK_SYNC_STMT
:
3095 pp_string (pp
, "_Cilk_sync");
3102 if (is_stmt
&& is_expr
)
3108 /* Print the declaration of a variable. */
3111 print_declaration (pretty_printer
*pp
, tree t
, int spc
, int flags
)
3115 if (TREE_CODE(t
) == NAMELIST_DECL
)
3117 pp_string(pp
, "namelist ");
3118 dump_decl_name (pp
, t
, flags
);
3123 if (TREE_CODE (t
) == TYPE_DECL
)
3124 pp_string (pp
, "typedef ");
3126 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
) && DECL_REGISTER (t
))
3127 pp_string (pp
, "register ");
3129 if (TREE_PUBLIC (t
) && DECL_EXTERNAL (t
))
3130 pp_string (pp
, "extern ");
3131 else if (TREE_STATIC (t
))
3132 pp_string (pp
, "static ");
3134 /* Print the type and name. */
3135 if (TREE_TYPE (t
) && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
3139 /* Print array's type. */
3140 tmp
= TREE_TYPE (t
);
3141 while (TREE_CODE (TREE_TYPE (tmp
)) == ARRAY_TYPE
)
3142 tmp
= TREE_TYPE (tmp
);
3143 dump_generic_node (pp
, TREE_TYPE (tmp
), spc
, flags
, false);
3145 /* Print variable's name. */
3147 dump_generic_node (pp
, t
, spc
, flags
, false);
3149 /* Print the dimensions. */
3150 tmp
= TREE_TYPE (t
);
3151 while (TREE_CODE (tmp
) == ARRAY_TYPE
)
3153 dump_array_domain (pp
, TYPE_DOMAIN (tmp
), spc
, flags
);
3154 tmp
= TREE_TYPE (tmp
);
3157 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3159 dump_generic_node (pp
, TREE_TYPE (TREE_TYPE (t
)), spc
, flags
, false);
3161 dump_decl_name (pp
, t
, flags
);
3162 dump_function_declaration (pp
, TREE_TYPE (t
), spc
, flags
);
3166 /* Print type declaration. */
3167 dump_generic_node (pp
, TREE_TYPE (t
), spc
, flags
, false);
3169 /* Print variable's name. */
3171 dump_generic_node (pp
, t
, spc
, flags
, false);
3174 if (TREE_CODE (t
) == VAR_DECL
&& DECL_HARD_REGISTER (t
))
3176 pp_string (pp
, " __asm__ ");
3178 dump_generic_node (pp
, DECL_ASSEMBLER_NAME (t
), spc
, flags
, false);
3179 pp_right_paren (pp
);
3182 /* The initial value of a function serves to determine whether the function
3183 is declared or defined. So the following does not apply to function
3185 if (TREE_CODE (t
) != FUNCTION_DECL
)
3187 /* Print the initial value. */
3188 if (DECL_INITIAL (t
))
3193 dump_generic_node (pp
, DECL_INITIAL (t
), spc
, flags
, false);
3197 if (TREE_CODE (t
) == VAR_DECL
&& DECL_HAS_VALUE_EXPR_P (t
))
3199 pp_string (pp
, " [value-expr: ");
3200 dump_generic_node (pp
, DECL_VALUE_EXPR (t
), spc
, flags
, false);
3201 pp_right_bracket (pp
);
3208 /* Prints a structure: name, fields, and methods.
3209 FIXME: Still incomplete. */
3212 print_struct_decl (pretty_printer
*pp
, const_tree node
, int spc
, int flags
)
3214 /* Print the name of the structure. */
3215 if (TYPE_NAME (node
))
3218 if (TREE_CODE (node
) == RECORD_TYPE
)
3219 pp_string (pp
, "struct ");
3220 else if ((TREE_CODE (node
) == UNION_TYPE
3221 || TREE_CODE (node
) == QUAL_UNION_TYPE
))
3222 pp_string (pp
, "union ");
3224 dump_generic_node (pp
, TYPE_NAME (node
), spc
, 0, false);
3227 /* Print the contents of the structure. */
3233 /* Print the fields of the structure. */
3236 tmp
= TYPE_FIELDS (node
);
3239 /* Avoid to print recursively the structure. */
3240 /* FIXME : Not implemented correctly...,
3241 what about the case when we have a cycle in the contain graph? ...
3242 Maybe this could be solved by looking at the scope in which the
3243 structure was declared. */
3244 if (TREE_TYPE (tmp
) != node
3245 && (TREE_CODE (TREE_TYPE (tmp
)) != POINTER_TYPE
3246 || TREE_TYPE (TREE_TYPE (tmp
)) != node
))
3248 print_declaration (pp
, tmp
, spc
+2, flags
);
3251 tmp
= DECL_CHAIN (tmp
);
3255 pp_right_brace (pp
);
3258 /* Return the priority of the operator CODE.
3260 From lowest to highest precedence with either left-to-right (L-R)
3261 or right-to-left (R-L) associativity]:
3264 2 [R-L] = += -= *= /= %= &= ^= |= <<= >>=
3276 14 [R-L] ! ~ ++ -- + - * & (type) sizeof
3277 15 [L-R] fn() [] -> .
3279 unary +, - and * have higher precedence than the corresponding binary
3283 op_code_prio (enum tree_code code
)
3300 case TRUTH_ORIF_EXPR
:
3303 case TRUTH_AND_EXPR
:
3304 case TRUTH_ANDIF_EXPR
:
3311 case TRUTH_XOR_EXPR
:
3328 case UNORDERED_EXPR
:
3339 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3340 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3341 case WIDEN_LSHIFT_EXPR
:
3344 case WIDEN_SUM_EXPR
:
3346 case POINTER_PLUS_EXPR
:
3350 case VEC_WIDEN_MULT_HI_EXPR
:
3351 case VEC_WIDEN_MULT_LO_EXPR
:
3352 case WIDEN_MULT_EXPR
:
3354 case WIDEN_MULT_PLUS_EXPR
:
3355 case WIDEN_MULT_MINUS_EXPR
:
3357 case MULT_HIGHPART_EXPR
:
3358 case TRUNC_DIV_EXPR
:
3360 case FLOOR_DIV_EXPR
:
3361 case ROUND_DIV_EXPR
:
3363 case EXACT_DIV_EXPR
:
3364 case TRUNC_MOD_EXPR
:
3366 case FLOOR_MOD_EXPR
:
3367 case ROUND_MOD_EXPR
:
3371 case TRUTH_NOT_EXPR
:
3373 case POSTINCREMENT_EXPR
:
3374 case POSTDECREMENT_EXPR
:
3375 case PREINCREMENT_EXPR
:
3376 case PREDECREMENT_EXPR
:
3382 case FIX_TRUNC_EXPR
:
3388 case ARRAY_RANGE_REF
:
3392 /* Special expressions. */
3398 case REDUC_MAX_EXPR
:
3399 case REDUC_MIN_EXPR
:
3400 case REDUC_PLUS_EXPR
:
3401 case VEC_UNPACK_HI_EXPR
:
3402 case VEC_UNPACK_LO_EXPR
:
3403 case VEC_UNPACK_FLOAT_HI_EXPR
:
3404 case VEC_UNPACK_FLOAT_LO_EXPR
:
3405 case VEC_PACK_TRUNC_EXPR
:
3406 case VEC_PACK_SAT_EXPR
:
3410 /* Return an arbitrarily high precedence to avoid surrounding single
3411 VAR_DECLs in ()s. */
3416 /* Return the priority of the operator OP. */
3419 op_prio (const_tree op
)
3421 enum tree_code code
;
3426 code
= TREE_CODE (op
);
3427 if (code
== SAVE_EXPR
|| code
== NON_LVALUE_EXPR
)
3428 return op_prio (TREE_OPERAND (op
, 0));
3430 return op_code_prio (code
);
3433 /* Return the symbol associated with operator CODE. */
3436 op_symbol_code (enum tree_code code
)
3444 case TRUTH_ORIF_EXPR
:
3447 case TRUTH_AND_EXPR
:
3448 case TRUTH_ANDIF_EXPR
:
3454 case TRUTH_XOR_EXPR
:
3464 case UNORDERED_EXPR
:
3510 case WIDEN_LSHIFT_EXPR
:
3513 case POINTER_PLUS_EXPR
:
3519 case REDUC_PLUS_EXPR
:
3522 case WIDEN_SUM_EXPR
:
3525 case WIDEN_MULT_EXPR
:
3528 case MULT_HIGHPART_EXPR
:
3538 case TRUTH_NOT_EXPR
:
3545 case TRUNC_DIV_EXPR
:
3552 case FLOOR_DIV_EXPR
:
3555 case ROUND_DIV_EXPR
:
3558 case EXACT_DIV_EXPR
:
3561 case TRUNC_MOD_EXPR
:
3567 case FLOOR_MOD_EXPR
:
3570 case ROUND_MOD_EXPR
:
3573 case PREDECREMENT_EXPR
:
3576 case PREINCREMENT_EXPR
:
3579 case POSTDECREMENT_EXPR
:
3582 case POSTINCREMENT_EXPR
:
3592 return "<<< ??? >>>";
3596 /* Return the symbol associated with operator OP. */
3599 op_symbol (const_tree op
)
3601 return op_symbol_code (TREE_CODE (op
));
3604 /* Prints the name of a call. NODE is the CALL_EXPR_FN of a CALL_EXPR or
3605 the gimple_call_fn of a GIMPLE_CALL. */
3608 print_call_name (pretty_printer
*pp
, tree node
, int flags
)
3612 if (TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3613 op0
= TREE_OPERAND (op0
, 0);
3616 switch (TREE_CODE (op0
))
3621 dump_function_name (pp
, op0
, flags
);
3627 op0
= TREE_OPERAND (op0
, 0);
3632 dump_generic_node (pp
, TREE_OPERAND (op0
, 0), 0, flags
, false);
3633 pp_string (pp
, ") ? ");
3634 dump_generic_node (pp
, TREE_OPERAND (op0
, 1), 0, flags
, false);
3635 pp_string (pp
, " : ");
3636 dump_generic_node (pp
, TREE_OPERAND (op0
, 2), 0, flags
, false);
3640 if (TREE_CODE (TREE_OPERAND (op0
, 0)) == VAR_DECL
)
3641 dump_function_name (pp
, TREE_OPERAND (op0
, 0), flags
);
3643 dump_generic_node (pp
, op0
, 0, flags
, false);
3647 if (integer_zerop (TREE_OPERAND (op0
, 1)))
3649 op0
= TREE_OPERAND (op0
, 0);
3656 dump_generic_node (pp
, op0
, 0, flags
, false);
3664 /* Parses the string STR and replaces new-lines by '\n', tabs by '\t', ... */
3667 pretty_print_string (pretty_printer
*pp
, const char *str
)
3677 pp_string (pp
, "\\b");
3681 pp_string (pp
, "\\f");
3685 pp_string (pp
, "\\n");
3689 pp_string (pp
, "\\r");
3693 pp_string (pp
, "\\t");
3697 pp_string (pp
, "\\v");
3701 pp_string (pp
, "\\\\");
3705 pp_string (pp
, "\\\"");
3709 pp_string (pp
, "\\'");
3712 /* No need to handle \0; the loop terminates on \0. */
3715 pp_string (pp
, "\\1");
3719 pp_string (pp
, "\\2");
3723 pp_string (pp
, "\\3");
3727 pp_string (pp
, "\\4");
3731 pp_string (pp
, "\\5");
3735 pp_string (pp
, "\\6");
3739 pp_string (pp
, "\\7");
3743 pp_character (pp
, str
[0]);
3751 maybe_init_pretty_print (FILE *file
)
3755 tree_pp
= new pretty_printer ();
3756 pp_needs_newline (tree_pp
) = true;
3757 pp_translate_identifiers (tree_pp
) = false;
3760 tree_pp
->buffer
->stream
= file
;
3764 newline_and_indent (pretty_printer
*pp
, int spc
)
3770 /* Handle a %K format for TEXT. Separate from default_tree_printer so
3771 it can also be used in front ends.
3772 %K: a statement, from which EXPR_LOCATION and TREE_BLOCK will be recorded.
3776 percent_K_format (text_info
*text
)
3778 tree t
= va_arg (*text
->args_ptr
, tree
), block
;
3779 text
->set_location (0, EXPR_LOCATION (t
), true);
3780 gcc_assert (pp_ti_abstract_origin (text
) != NULL
);
3781 block
= TREE_BLOCK (t
);
3782 *pp_ti_abstract_origin (text
) = NULL
;
3786 /* ??? LTO drops all BLOCK_ABSTRACT_ORIGINs apart from those
3787 representing the outermost block of an inlined function.
3788 So walk the BLOCK tree until we hit such a scope. */
3790 && TREE_CODE (block
) == BLOCK
)
3792 if (inlined_function_outer_scope_p (block
))
3794 *pp_ti_abstract_origin (text
) = block
;
3797 block
= BLOCK_SUPERCONTEXT (block
);
3803 && TREE_CODE (block
) == BLOCK
3804 && BLOCK_ABSTRACT_ORIGIN (block
))
3806 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
3808 while (TREE_CODE (ao
) == BLOCK
3809 && BLOCK_ABSTRACT_ORIGIN (ao
)
3810 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
3811 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
3813 if (TREE_CODE (ao
) == FUNCTION_DECL
)
3815 *pp_ti_abstract_origin (text
) = block
;
3818 block
= BLOCK_SUPERCONTEXT (block
);
3822 /* Print the identifier ID to PRETTY-PRINTER. */
3825 pp_tree_identifier (pretty_printer
*pp
, tree id
)
3827 if (pp_translate_identifiers (pp
))
3829 const char *text
= identifier_to_locale (IDENTIFIER_POINTER (id
));
3830 pp_append_text (pp
, text
, text
+ strlen (text
));
3833 pp_append_text (pp
, IDENTIFIER_POINTER (id
),
3834 IDENTIFIER_POINTER (id
) + IDENTIFIER_LENGTH (id
));
3837 /* A helper function that is used to dump function information before the
3841 dump_function_header (FILE *dump_file
, tree fdecl
, int flags
)
3843 const char *dname
, *aname
;
3844 struct cgraph_node
*node
= cgraph_node::get (fdecl
);
3845 struct function
*fun
= DECL_STRUCT_FUNCTION (fdecl
);
3847 dname
= lang_hooks
.decl_printable_name (fdecl
, 2);
3849 if (DECL_ASSEMBLER_NAME_SET_P (fdecl
))
3850 aname
= (IDENTIFIER_POINTER
3851 (DECL_ASSEMBLER_NAME (fdecl
)));
3853 aname
= "<unset-asm-name>";
3855 fprintf (dump_file
, "\n;; Function %s (%s, funcdef_no=%d",
3856 dname
, aname
, fun
->funcdef_no
);
3857 if (!(flags
& TDF_NOUID
))
3858 fprintf (dump_file
, ", decl_uid=%d", DECL_UID (fdecl
));
3861 fprintf (dump_file
, ", cgraph_uid=%d", node
->uid
);
3862 fprintf (dump_file
, ", symbol_order=%d)%s\n\n", node
->order
,
3863 node
->frequency
== NODE_FREQUENCY_HOT
3865 : node
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
3866 ? " (unlikely executed)"
3867 : node
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
3868 ? " (executed once)"
3872 fprintf (dump_file
, ")\n\n");
3875 /* Dump double_int D to pretty_printer PP. UNS is true
3876 if D is unsigned and false otherwise. */
3878 pp_double_int (pretty_printer
*pp
, double_int d
, bool uns
)
3881 pp_wide_integer (pp
, d
.low
);
3882 else if (d
.fits_uhwi ())
3883 pp_unsigned_wide_integer (pp
, d
.low
);
3886 unsigned HOST_WIDE_INT low
= d
.low
;
3887 HOST_WIDE_INT high
= d
.high
;
3888 if (!uns
&& d
.is_negative ())
3891 high
= ~high
+ !low
;
3894 /* Would "%x%0*x" or "%x%*0x" get zero-padding on all
3896 sprintf (pp_buffer (pp
)->digit_buffer
,
3897 HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
3898 (unsigned HOST_WIDE_INT
) high
, low
);
3899 pp_string (pp
, pp_buffer (pp
)->digit_buffer
);