?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Enable dumping of alias graphs.
[official-gcc/Ramakrishna.git] / gcc / tree-pretty-print.c
blob2c64ab96aa0a7a66133cdd8e2e815f4b660c84e1
1 /* Pretty formatting of GENERIC trees in C syntax.
2 Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
3 Free Software Foundation, Inc.
4 Adapted from c-pretty-print.c by Diego Novillo <dnovillo@redhat.com>
5
6 This file is part of GCC.
7
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
11 version.
12
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
16 for more details.
17
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/>. */
21
22 #include "config.h"
23 #include "system.h"
24 #include "coretypes.h"
25 #include "tm.h"
26 #include "tree.h"
27 #include "output.h"
28 #include "diagnostic.h"
29 #include "real.h"
30 #include "hashtab.h"
31 #include "tree-flow.h"
32 #include "langhooks.h"
33 #include "tree-iterator.h"
34 #include "tree-chrec.h"
35 #include "tree-pass.h"
36 #include "fixed-value.h"
37 #include "value-prof.h"
38 #include "predict.h"
39
40 /* Local functions, macros and variables. */
41 static const char *op_symbol (const_tree);
42 static void pretty_print_string (pretty_printer *, const char*);
43 static void newline_and_indent (pretty_printer *, int);
44 static void maybe_init_pretty_print (FILE *);
45 static void print_struct_decl (pretty_printer *, const_tree, int, int);
46 static void do_niy (pretty_printer *, const_tree);
47
48 #define INDENT(SPACE) do { \
49 int i; for (i = 0; i<SPACE; i++) pp_space (buffer); } while (0)
50
51 #define NIY do_niy(buffer,node)
52
53 static pretty_printer buffer;
54 static int initialized = 0;
55
56 /* Try to print something for an unknown tree code. */
57
58 static void
59 do_niy (pretty_printer *buffer, const_tree node)
60 {
61 int i, len;
62
63 pp_string (buffer, "<<< Unknown tree: ");
64 pp_string (buffer, tree_code_name[(int) TREE_CODE (node)]);
65
66 if (EXPR_P (node))
67 {
68 len = TREE_OPERAND_LENGTH (node);
69 for (i = 0; i < len; ++i)
70 {
71 newline_and_indent (buffer, 2);
72 dump_generic_node (buffer, TREE_OPERAND (node, i), 2, 0, false);
73 }
74 }
75
76 pp_string (buffer, " >>>\n");
77 }
78
79 /* Debugging function to print out a generic expression. */
80
81 void
82 debug_generic_expr (tree t)
83 {
84 print_generic_expr (stderr, t, TDF_VOPS|TDF_MEMSYMS);
85 fprintf (stderr, "\n");
86 }
87
88 /* Debugging function to print out a generic statement. */
89
90 void
91 debug_generic_stmt (tree t)
92 {
93 print_generic_stmt (stderr, t, TDF_VOPS|TDF_MEMSYMS);
94 fprintf (stderr, "\n");
95 }
96
97 /* Debugging function to print out a chain of trees . */
98
99 void
100 debug_tree_chain (tree t)
101 {
102 struct pointer_set_t *seen = pointer_set_create ();
103
104 while (t)
105 {
106 print_generic_expr (stderr, t, TDF_VOPS|TDF_MEMSYMS|TDF_UID);
107 fprintf (stderr, " ");
108 t = TREE_CHAIN (t);
109 if (pointer_set_insert (seen, t))
110 {
111 fprintf (stderr, "... [cycled back to ");
112 print_generic_expr (stderr, t, TDF_VOPS|TDF_MEMSYMS|TDF_UID);
113 fprintf (stderr, "]");
114 break;
115 }
116 }
117 fprintf (stderr, "\n");
118
119 pointer_set_destroy (seen);
120 }
121
122 /* Prints declaration DECL to the FILE with details specified by FLAGS. */
123 void
124 print_generic_decl (FILE *file, tree decl, int flags)
125 {
126 maybe_init_pretty_print (file);
127 print_declaration (&buffer, decl, 2, flags);
128 pp_write_text_to_stream (&buffer);
129 }
130
131 /* Print tree T, and its successors, on file FILE. FLAGS specifies details
132 to show in the dump. See TDF_* in tree-pass.h. */
133
134 void
135 print_generic_stmt (FILE *file, tree t, int flags)
136 {
137 maybe_init_pretty_print (file);
138 dump_generic_node (&buffer, t, 0, flags, true);
139 pp_flush (&buffer);
140 }
141
142 /* Print tree T, and its successors, on file FILE. FLAGS specifies details
143 to show in the dump. See TDF_* in tree-pass.h. The output is indented by
144 INDENT spaces. */
145
146 void
147 print_generic_stmt_indented (FILE *file, tree t, int flags, int indent)
148 {
149 int i;
150
151 maybe_init_pretty_print (file);
152
153 for (i = 0; i < indent; i++)
154 pp_space (&buffer);
155 dump_generic_node (&buffer, t, indent, flags, true);
156 pp_flush (&buffer);
157 }
158
159 /* Print a single expression T on file FILE. FLAGS specifies details to show
160 in the dump. See TDF_* in tree-pass.h. */
161
162 void
163 print_generic_expr (FILE *file, tree t, int flags)
164 {
165 maybe_init_pretty_print (file);
166 dump_generic_node (&buffer, t, 0, flags, false);
167 }
168
169 /* Dump the name of a _DECL node and its DECL_UID if TDF_UID is set
170 in FLAGS. */
171
172 static void
173 dump_decl_name (pretty_printer *buffer, tree node, int flags)
174 {
175 if (DECL_NAME (node))
176 {
177 if ((flags & TDF_ASMNAME) && DECL_ASSEMBLER_NAME_SET_P (node))
178 pp_tree_identifier (buffer, DECL_ASSEMBLER_NAME (node));
179 else
180 pp_tree_identifier (buffer, DECL_NAME (node));
181 }
182 if ((flags & TDF_UID) || DECL_NAME (node) == NULL_TREE)
183 {
184 if (TREE_CODE (node) == LABEL_DECL && LABEL_DECL_UID (node) != -1)
185 pp_printf (buffer, "L.%d", (int) LABEL_DECL_UID (node));
186 else
187 {
188 char c = TREE_CODE (node) == CONST_DECL ? 'C' : 'D';
189 pp_printf (buffer, "%c.%u", c, DECL_UID (node));
190 }
191 }
192 }
193
194 /* Like the above, but used for pretty printing function calls. */
195
196 static void
197 dump_function_name (pretty_printer *buffer, tree node, int flags)
198 {
199 if (TREE_CODE (node) == NOP_EXPR)
200 node = TREE_OPERAND (node, 0);
201 if (DECL_NAME (node) && (flags & TDF_ASMNAME) == 0)
202 pp_string (buffer, lang_hooks.decl_printable_name (node, 1));
203 else
204 dump_decl_name (buffer, node, flags);
205 }
206
207 /* Dump a function declaration. NODE is the FUNCTION_TYPE. BUFFER, SPC and
208 FLAGS are as in dump_generic_node. */
209
210 static void
211 dump_function_declaration (pretty_printer *buffer, tree node,
212 int spc, int flags)
213 {
214 bool wrote_arg = false;
215 tree arg;
216
217 pp_space (buffer);
218 pp_character (buffer, '(');
219
220 /* Print the argument types. The last element in the list is a VOID_TYPE.
221 The following avoids printing the last element. */
222 arg = TYPE_ARG_TYPES (node);
223 while (arg && TREE_CHAIN (arg) && arg != error_mark_node)
224 {
225 wrote_arg = true;
226 dump_generic_node (buffer, TREE_VALUE (arg), spc, flags, false);
227 arg = TREE_CHAIN (arg);
228 if (TREE_CHAIN (arg) && TREE_CODE (TREE_CHAIN (arg)) == TREE_LIST)
229 {
230 pp_character (buffer, ',');
231 pp_space (buffer);
232 }
233 }
234
235 if (!wrote_arg)
236 pp_string (buffer, "void");
237
238 pp_character (buffer, ')');
239 }
240
241 /* Dump the domain associated with an array. */
242
243 static void
244 dump_array_domain (pretty_printer *buffer, tree domain, int spc, int flags)
245 {
246 pp_character (buffer, '[');
247 if (domain)
248 {
249 tree min = TYPE_MIN_VALUE (domain);
250 tree max = TYPE_MAX_VALUE (domain);
251
252 if (min && max
253 && integer_zerop (min)
254 && host_integerp (max, 0))
255 pp_wide_integer (buffer, TREE_INT_CST_LOW (max) + 1);
256 else
257 {
258 if (min)
259 dump_generic_node (buffer, min, spc, flags, false);
260 pp_character (buffer, ':');
261 if (max)
262 dump_generic_node (buffer, max, spc, flags, false);
263 }
264 }
265 else
266 pp_string (buffer, "<unknown>");
267 pp_character (buffer, ']');
268 }
269
270
271 /* Dump OpenMP clause CLAUSE. BUFFER, CLAUSE, SPC and FLAGS are as in
272 dump_generic_node. */
273
274 static void
275 dump_omp_clause (pretty_printer *buffer, tree clause, int spc, int flags)
276 {
277 const char *name;
278
279 switch (OMP_CLAUSE_CODE (clause))
280 {
281 case OMP_CLAUSE_PRIVATE:
282 name = "private";
283 goto print_remap;
284 case OMP_CLAUSE_SHARED:
285 name = "shared";
286 goto print_remap;
287 case OMP_CLAUSE_FIRSTPRIVATE:
288 name = "firstprivate";
289 goto print_remap;
290 case OMP_CLAUSE_LASTPRIVATE:
291 name = "lastprivate";
292 goto print_remap;
293 case OMP_CLAUSE_COPYIN:
294 name = "copyin";
295 goto print_remap;
296 case OMP_CLAUSE_COPYPRIVATE:
297 name = "copyprivate";
298 goto print_remap;
299 print_remap:
300 pp_string (buffer, name);
301 pp_character (buffer, '(');
302 dump_generic_node (buffer, OMP_CLAUSE_DECL (clause),
303 spc, flags, false);
304 pp_character (buffer, ')');
305 break;
306
307 case OMP_CLAUSE_REDUCTION:
308 pp_string (buffer, "reduction(");
309 pp_string (buffer, op_symbol_code (OMP_CLAUSE_REDUCTION_CODE (clause)));
310 pp_character (buffer, ':');
311 dump_generic_node (buffer, OMP_CLAUSE_DECL (clause),
312 spc, flags, false);
313 pp_character (buffer, ')');
314 break;
315
316 case OMP_CLAUSE_IF:
317 pp_string (buffer, "if(");
318 dump_generic_node (buffer, OMP_CLAUSE_IF_EXPR (clause),
319 spc, flags, false);
320 pp_character (buffer, ')');
321 break;
322
323 case OMP_CLAUSE_NUM_THREADS:
324 pp_string (buffer, "num_threads(");
325 dump_generic_node (buffer, OMP_CLAUSE_NUM_THREADS_EXPR (clause),
326 spc, flags, false);
327 pp_character (buffer, ')');
328 break;
329
330 case OMP_CLAUSE_NOWAIT:
331 pp_string (buffer, "nowait");
332 break;
333 case OMP_CLAUSE_ORDERED:
334 pp_string (buffer, "ordered");
335 break;
336
337 case OMP_CLAUSE_DEFAULT:
338 pp_string (buffer, "default(");
339 switch (OMP_CLAUSE_DEFAULT_KIND (clause))
340 {
341 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
342 break;
343 case OMP_CLAUSE_DEFAULT_SHARED:
344 pp_string (buffer, "shared");
345 break;
346 case OMP_CLAUSE_DEFAULT_NONE:
347 pp_string (buffer, "none");
348 break;
349 case OMP_CLAUSE_DEFAULT_PRIVATE:
350 pp_string (buffer, "private");
351 break;
352 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE:
353 pp_string (buffer, "firstprivate");
354 break;
355 default:
356 gcc_unreachable ();
357 }
358 pp_character (buffer, ')');
359 break;
360
361 case OMP_CLAUSE_SCHEDULE:
362 pp_string (buffer, "schedule(");
363 switch (OMP_CLAUSE_SCHEDULE_KIND (clause))
364 {
365 case OMP_CLAUSE_SCHEDULE_STATIC:
366 pp_string (buffer, "static");
367 break;
368 case OMP_CLAUSE_SCHEDULE_DYNAMIC:
369 pp_string (buffer, "dynamic");
370 break;
371 case OMP_CLAUSE_SCHEDULE_GUIDED:
372 pp_string (buffer, "guided");
373 break;
374 case OMP_CLAUSE_SCHEDULE_RUNTIME:
375 pp_string (buffer, "runtime");
376 break;
377 case OMP_CLAUSE_SCHEDULE_AUTO:
378 pp_string (buffer, "auto");
379 break;
380 default:
381 gcc_unreachable ();
382 }
383 if (OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (clause))
384 {
385 pp_character (buffer, ',');
386 dump_generic_node (buffer,
387 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (clause),
388 spc, flags, false);
389 }
390 pp_character (buffer, ')');
391 break;
392
393 case OMP_CLAUSE_UNTIED:
394 pp_string (buffer, "untied");
395 break;
396
397 case OMP_CLAUSE_COLLAPSE:
398 pp_string (buffer, "collapse(");
399 dump_generic_node (buffer,
400 OMP_CLAUSE_COLLAPSE_EXPR (clause),
401 spc, flags, false);
402 pp_character (buffer, ')');
403 break;
404
405 default:
406 /* Should never happen. */
407 dump_generic_node (buffer, clause, spc, flags, false);
408 break;
409 }
410 }
411
412
413 /* Dump the list of OpenMP clauses. BUFFER, SPC and FLAGS are as in
414 dump_generic_node. */
415
416 void
417 dump_omp_clauses (pretty_printer *buffer, tree clause, int spc, int flags)
418 {
419 if (clause == NULL)
420 return;
421
422 pp_space (buffer);
423 while (1)
424 {
425 dump_omp_clause (buffer, clause, spc, flags);
426 clause = OMP_CLAUSE_CHAIN (clause);
427 if (clause == NULL)
428 return;
429 pp_space (buffer);
430 }
431 }
432
433
434 /* Dump location LOC to BUFFER. */
435
436 static void
437 dump_location (pretty_printer *buffer, location_t loc)
438 {
439 expanded_location xloc = expand_location (loc);
440
441 pp_character (buffer, '[');
442 if (xloc.file)
443 {
444 pp_string (buffer, xloc.file);
445 pp_string (buffer, " : ");
446 }
447 pp_decimal_int (buffer, xloc.line);
448 pp_string (buffer, "] ");
449 }
450
451
452 /* Dump lexical block BLOCK. BUFFER, SPC and FLAGS are as in
453 dump_generic_node. */
454
455 static void
456 dump_block_node (pretty_printer *buffer, tree block, int spc, int flags)
457 {
458 tree t;
459
460 pp_printf (buffer, "BLOCK #%d ", BLOCK_NUMBER (block));
461
462 if (flags & TDF_ADDRESS)
463 pp_printf (buffer, "[%p] ", (void *) block);
464
465 if (BLOCK_ABSTRACT (block))
466 pp_string (buffer, "[abstract] ");
467
468 if (TREE_ASM_WRITTEN (block))
469 pp_string (buffer, "[written] ");
470
471 if (flags & TDF_SLIM)
472 return;
473
474 if (BLOCK_SOURCE_LOCATION (block))
475 dump_location (buffer, BLOCK_SOURCE_LOCATION (block));
476
477 newline_and_indent (buffer, spc + 2);
478
479 if (BLOCK_SUPERCONTEXT (block))
480 {
481 pp_string (buffer, "SUPERCONTEXT: ");
482 dump_generic_node (buffer, BLOCK_SUPERCONTEXT (block), 0,
483 flags | TDF_SLIM, false);
484 newline_and_indent (buffer, spc + 2);
485 }
486
487 if (BLOCK_SUBBLOCKS (block))
488 {
489 pp_string (buffer, "SUBBLOCKS: ");
490 for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t))
491 {
492 dump_generic_node (buffer, t, 0, flags | TDF_SLIM, false);
493 pp_string (buffer, " ");
494 }
495 newline_and_indent (buffer, spc + 2);
496 }
497
498 if (BLOCK_CHAIN (block))
499 {
500 pp_string (buffer, "SIBLINGS: ");
501 for (t = BLOCK_CHAIN (block); t; t = BLOCK_CHAIN (t))
502 {
503 dump_generic_node (buffer, t, 0, flags | TDF_SLIM, false);
504 pp_string (buffer, " ");
505 }
506 newline_and_indent (buffer, spc + 2);
507 }
508
509 if (BLOCK_VARS (block))
510 {
511 pp_string (buffer, "VARS: ");
512 for (t = BLOCK_VARS (block); t; t = TREE_CHAIN (t))
513 {
514 dump_generic_node (buffer, t, 0, flags, false);
515 pp_string (buffer, " ");
516 }
517 newline_and_indent (buffer, spc + 2);
518 }
519
520 if (VEC_length (tree, BLOCK_NONLOCALIZED_VARS (block)) > 0)
521 {
522 unsigned i;
523 VEC(tree,gc) *nlv = BLOCK_NONLOCALIZED_VARS (block);
524
525 pp_string (buffer, "NONLOCALIZED_VARS: ");
526 for (i = 0; VEC_iterate (tree, nlv, i, t); i++)
527 {
528 dump_generic_node (buffer, t, 0, flags, false);
529 pp_string (buffer, " ");
530 }
531 newline_and_indent (buffer, spc + 2);
532 }
533
534 if (BLOCK_ABSTRACT_ORIGIN (block))
535 {
536 pp_string (buffer, "ABSTRACT_ORIGIN: ");
537 dump_generic_node (buffer, BLOCK_ABSTRACT_ORIGIN (block), 0,
538 flags | TDF_SLIM, false);
539 newline_and_indent (buffer, spc + 2);
540 }
541
542 if (BLOCK_FRAGMENT_ORIGIN (block))
543 {
544 pp_string (buffer, "FRAGMENT_ORIGIN: ");
545 dump_generic_node (buffer, BLOCK_FRAGMENT_ORIGIN (block), 0,
546 flags | TDF_SLIM, false);
547 newline_and_indent (buffer, spc + 2);
548 }
549
550 if (BLOCK_FRAGMENT_CHAIN (block))
551 {
552 pp_string (buffer, "FRAGMENT_CHAIN: ");
553 for (t = BLOCK_FRAGMENT_CHAIN (block); t; t = BLOCK_FRAGMENT_CHAIN (t))
554 {
555 dump_generic_node (buffer, t, 0, flags | TDF_SLIM, false);
556 pp_string (buffer, " ");
557 }
558 newline_and_indent (buffer, spc + 2);
559 }
560 }
561
562
563 /* Dump the node NODE on the pretty_printer BUFFER, SPC spaces of
564 indent. FLAGS specifies details to show in the dump (see TDF_* in
565 tree-pass.h). If IS_STMT is true, the object printed is considered
566 to be a statement and it is terminated by ';' if appropriate. */
567
568 int
569 dump_generic_node (pretty_printer *buffer, tree node, int spc, int flags,
570 bool is_stmt)
571 {
572 tree type;
573 tree op0, op1;
574 const char *str;
575 bool is_expr;
576
577 if (node == NULL_TREE)
578 return spc;
579
580 is_expr = EXPR_P (node);
581
582 if (is_stmt && (flags & TDF_STMTADDR))
583 pp_printf (buffer, "<&%p> ", (void *)node);
584
585 if ((flags & TDF_LINENO) && EXPR_HAS_LOCATION (node))
586 dump_location (buffer, EXPR_LOCATION (node));
587
588 switch (TREE_CODE (node))
589 {
590 case ERROR_MARK:
591 pp_string (buffer, "<<< error >>>");
592 break;
593
594 case IDENTIFIER_NODE:
595 pp_tree_identifier (buffer, node);
596 break;
597
598 case TREE_LIST:
599 while (node && node != error_mark_node)
600 {
601 if (TREE_PURPOSE (node))
602 {
603 dump_generic_node (buffer, TREE_PURPOSE (node), spc, flags, false);
604 pp_space (buffer);
605 }
606 dump_generic_node (buffer, TREE_VALUE (node), spc, flags, false);
607 node = TREE_CHAIN (node);
608 if (node && TREE_CODE (node) == TREE_LIST)
609 {
610 pp_character (buffer, ',');
611 pp_space (buffer);
612 }
613 }
614 break;
615
616 case TREE_BINFO:
617 dump_generic_node (buffer, BINFO_TYPE (node), spc, flags, false);
618 break;
619
620 case TREE_VEC:
621 {
622 size_t i;
623 if (TREE_VEC_LENGTH (node) > 0)
624 {
625 size_t len = TREE_VEC_LENGTH (node);
626 for (i = 0; i < len - 1; i++)
627 {
628 dump_generic_node (buffer, TREE_VEC_ELT (node, i), spc, flags,
629 false);
630 pp_character (buffer, ',');
631 pp_space (buffer);
632 }
633 dump_generic_node (buffer, TREE_VEC_ELT (node, len - 1), spc,
634 flags, false);
635 }
636 }
637 break;
638
639 case VOID_TYPE:
640 case INTEGER_TYPE:
641 case REAL_TYPE:
642 case FIXED_POINT_TYPE:
643 case COMPLEX_TYPE:
644 case VECTOR_TYPE:
645 case ENUMERAL_TYPE:
646 case BOOLEAN_TYPE:
647 {
648 unsigned int quals = TYPE_QUALS (node);
649 enum tree_code_class tclass;
650
651 if (quals & TYPE_QUAL_CONST)
652 pp_string (buffer, "const ");
653 else if (quals & TYPE_QUAL_VOLATILE)
654 pp_string (buffer, "volatile ");
655 else if (quals & TYPE_QUAL_RESTRICT)
656 pp_string (buffer, "restrict ");
657
658 tclass = TREE_CODE_CLASS (TREE_CODE (node));
659
660 if (tclass == tcc_declaration)
661 {
662 if (DECL_NAME (node))
663 dump_decl_name (buffer, node, flags);
664 else
665 pp_string (buffer, "<unnamed type decl>");
666 }
667 else if (tclass == tcc_type)
668 {
669 if (TYPE_NAME (node))
670 {
671 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
672 pp_tree_identifier (buffer, TYPE_NAME (node));
673 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
674 && DECL_NAME (TYPE_NAME (node)))
675 dump_decl_name (buffer, TYPE_NAME (node), flags);
676 else
677 pp_string (buffer, "<unnamed type>");
678 }
679 else if (TREE_CODE (node) == VECTOR_TYPE)
680 {
681 pp_string (buffer, "vector ");
682 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
683 }
684 else if (TREE_CODE (node) == INTEGER_TYPE)
685 {
686 pp_string (buffer, (TYPE_UNSIGNED (node)
687 ? "<unnamed-unsigned:"
688 : "<unnamed-signed:"));
689 pp_decimal_int (buffer, TYPE_PRECISION (node));
690 pp_string (buffer, ">");
691 }
692 else if (TREE_CODE (node) == COMPLEX_TYPE)
693 {
694 pp_string (buffer, "__complex__ ");
695 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
696 }
697 else if (TREE_CODE (node) == REAL_TYPE)
698 {
699 pp_string (buffer, "<float:");
700 pp_decimal_int (buffer, TYPE_PRECISION (node));
701 pp_string (buffer, ">");
702 }
703 else if (TREE_CODE (node) == FIXED_POINT_TYPE)
704 {
705 pp_string (buffer, "<fixed-point-");
706 pp_string (buffer, TYPE_SATURATING (node) ? "sat:" : "nonsat:");
707 pp_decimal_int (buffer, TYPE_PRECISION (node));
708 pp_string (buffer, ">");
709 }
710 else
711 pp_string (buffer, "<unnamed type>");
712 }
713 break;
714 }
715
716 case POINTER_TYPE:
717 case REFERENCE_TYPE:
718 str = (TREE_CODE (node) == POINTER_TYPE ? "*" : "&");
719
720 if (TREE_TYPE (node) == NULL)
721 {
722 pp_string (buffer, str);
723 pp_string (buffer, "<null type>");
724 }
725 else if (TREE_CODE (TREE_TYPE (node)) == FUNCTION_TYPE)
726 {
727 tree fnode = TREE_TYPE (node);
728
729 dump_generic_node (buffer, TREE_TYPE (fnode), spc, flags, false);
730 pp_space (buffer);
731 pp_character (buffer, '(');
732 pp_string (buffer, str);
733 if (TYPE_NAME (node) && DECL_NAME (TYPE_NAME (node)))
734 dump_decl_name (buffer, TYPE_NAME (node), flags);
735 else
736 pp_printf (buffer, "<T%x>", TYPE_UID (node));
737
738 pp_character (buffer, ')');
739 dump_function_declaration (buffer, fnode, spc, flags);
740 }
741 else
742 {
743 unsigned int quals = TYPE_QUALS (node);
744
745 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
746 pp_space (buffer);
747 pp_string (buffer, str);
748
749 if (quals & TYPE_QUAL_CONST)
750 pp_string (buffer, " const");
751 if (quals & TYPE_QUAL_VOLATILE)
752 pp_string (buffer, " volatile");
753 if (quals & TYPE_QUAL_RESTRICT)
754 pp_string (buffer, " restrict");
755
756 if (TYPE_REF_CAN_ALIAS_ALL (node))
757 pp_string (buffer, " {ref-all}");
758 }
759 break;
760
761 case OFFSET_TYPE:
762 NIY;
763 break;
764
765 case TARGET_MEM_REF:
766 {
767 const char *sep = "";
768 tree tmp;
769
770 pp_string (buffer, "MEM[");
771
772 tmp = TMR_SYMBOL (node);
773 if (tmp)
774 {
775 pp_string (buffer, sep);
776 sep = ", ";
777 pp_string (buffer, "symbol: ");
778 dump_generic_node (buffer, tmp, spc, flags, false);
779 }
780 tmp = TMR_BASE (node);
781 if (tmp)
782 {
783 pp_string (buffer, sep);
784 sep = ", ";
785 pp_string (buffer, "base: ");
786 dump_generic_node (buffer, tmp, spc, flags, false);
787 }
788 tmp = TMR_INDEX (node);
789 if (tmp)
790 {
791 pp_string (buffer, sep);
792 sep = ", ";
793 pp_string (buffer, "index: ");
794 dump_generic_node (buffer, tmp, spc, flags, false);
795 }
796 tmp = TMR_STEP (node);
797 if (tmp)
798 {
799 pp_string (buffer, sep);
800 sep = ", ";
801 pp_string (buffer, "step: ");
802 dump_generic_node (buffer, tmp, spc, flags, false);
803 }
804 tmp = TMR_OFFSET (node);
805 if (tmp)
806 {
807 pp_string (buffer, sep);
808 sep = ", ";
809 pp_string (buffer, "offset: ");
810 dump_generic_node (buffer, tmp, spc, flags, false);
811 }
812 pp_string (buffer, "]");
813 if (flags & TDF_DETAILS)
814 {
815 pp_string (buffer, "{");
816 dump_generic_node (buffer, TMR_ORIGINAL (node), spc, flags,
817 false);
818 pp_string (buffer, "}");
819 }
820 }
821 break;
822
823 case ARRAY_TYPE:
824 {
825 tree tmp;
826
827 /* Print the innermost component type. */
828 for (tmp = TREE_TYPE (node); TREE_CODE (tmp) == ARRAY_TYPE;
829 tmp = TREE_TYPE (tmp))
830 ;
831 dump_generic_node (buffer, tmp, spc, flags, false);
832
833 /* Print the dimensions. */
834 for (tmp = node; TREE_CODE (tmp) == ARRAY_TYPE; tmp = TREE_TYPE (tmp))
835 dump_array_domain (buffer, TYPE_DOMAIN (tmp), spc, flags);
836 break;
837 }
838
839 case RECORD_TYPE:
840 case UNION_TYPE:
841 case QUAL_UNION_TYPE:
842 {
843 unsigned int quals = TYPE_QUALS (node);
844
845 if (quals & TYPE_QUAL_CONST)
846 pp_string (buffer, "const ");
847 if (quals & TYPE_QUAL_VOLATILE)
848 pp_string (buffer, "volatile ");
849
850 /* Print the name of the structure. */
851 if (TREE_CODE (node) == RECORD_TYPE)
852 pp_string (buffer, "struct ");
853 else if (TREE_CODE (node) == UNION_TYPE)
854 pp_string (buffer, "union ");
855
856 if (TYPE_NAME (node))
857 dump_generic_node (buffer, TYPE_NAME (node), spc, flags, false);
858 else if (!(flags & TDF_SLIM))
859 /* FIXME: If we eliminate the 'else' above and attempt
860 to show the fields for named types, we may get stuck
861 following a cycle of pointers to structs. The alleged
862 self-reference check in print_struct_decl will not detect
863 cycles involving more than one pointer or struct type. */
864 print_struct_decl (buffer, node, spc, flags);
865 break;
866 }
867
868 case LANG_TYPE:
869 NIY;
870 break;
871
872 case INTEGER_CST:
873 if (TREE_CODE (TREE_TYPE (node)) == POINTER_TYPE)
874 {
875 /* In the case of a pointer, one may want to divide by the
876 size of the pointed-to type. Unfortunately, this not
877 straightforward. The C front-end maps expressions
878
879 (int *) 5
880 int *p; (p + 5)
881
882 in such a way that the two INTEGER_CST nodes for "5" have
883 different values but identical types. In the latter
884 case, the 5 is multiplied by sizeof (int) in c-common.c
885 (pointer_int_sum) to convert it to a byte address, and
886 yet the type of the node is left unchanged. Argh. What
887 is consistent though is that the number value corresponds
888 to bytes (UNITS) offset.
889
890 NB: Neither of the following divisors can be trivially
891 used to recover the original literal:
892
893 TREE_INT_CST_LOW (TYPE_SIZE_UNIT (TREE_TYPE (node)))
894 TYPE_PRECISION (TREE_TYPE (TREE_TYPE (node))) */
895 pp_wide_integer (buffer, TREE_INT_CST_LOW (node));
896 pp_string (buffer, "B"); /* pseudo-unit */
897 }
898 else if (! host_integerp (node, 0))
899 {
900 tree val = node;
901 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (val);
902 HOST_WIDE_INT high = TREE_INT_CST_HIGH (val);
903
904 if (tree_int_cst_sgn (val) < 0)
905 {
906 pp_character (buffer, '-');
907 high = ~high + !low;
908 low = -low;
909 }
910 /* Would "%x%0*x" or "%x%*0x" get zero-padding on all
911 systems? */
912 sprintf (pp_buffer (buffer)->digit_buffer,
913 HOST_WIDE_INT_PRINT_DOUBLE_HEX,
914 (unsigned HOST_WIDE_INT) high, low);
915 pp_string (buffer, pp_buffer (buffer)->digit_buffer);
916 }
917 else
918 pp_wide_integer (buffer, TREE_INT_CST_LOW (node));
919 break;
920
921 case REAL_CST:
922 /* Code copied from print_node. */
923 {
924 REAL_VALUE_TYPE d;
925 if (TREE_OVERFLOW (node))
926 pp_string (buffer, " overflow");
927
928 #if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
929 d = TREE_REAL_CST (node);
930 if (REAL_VALUE_ISINF (d))
931 pp_string (buffer, REAL_VALUE_NEGATIVE (d) ? " -Inf" : " Inf");
932 else if (REAL_VALUE_ISNAN (d))
933 pp_string (buffer, " Nan");
934 else
935 {
936 char string[100];
937 real_to_decimal (string, &d, sizeof (string), 0, 1);
938 pp_string (buffer, string);
939 }
940 #else
941 {
942 HOST_WIDE_INT i;
943 unsigned char *p = (unsigned char *) &TREE_REAL_CST (node);
944 pp_string (buffer, "0x");
945 for (i = 0; i < sizeof TREE_REAL_CST (node); i++)
946 output_formatted_integer (buffer, "%02x", *p++);
947 }
948 #endif
949 break;
950 }
951
952 case FIXED_CST:
953 {
954 char string[100];
955 fixed_to_decimal (string, TREE_FIXED_CST_PTR (node), sizeof (string));
956 pp_string (buffer, string);
957 break;
958 }
959
960 case COMPLEX_CST:
961 pp_string (buffer, "__complex__ (");
962 dump_generic_node (buffer, TREE_REALPART (node), spc, flags, false);
963 pp_string (buffer, ", ");
964 dump_generic_node (buffer, TREE_IMAGPART (node), spc, flags, false);
965 pp_string (buffer, ")");
966 break;
967
968 case STRING_CST:
969 pp_string (buffer, "\"");
970 pretty_print_string (buffer, TREE_STRING_POINTER (node));
971 pp_string (buffer, "\"");
972 break;
973
974 case VECTOR_CST:
975 {
976 tree elt;
977 pp_string (buffer, "{ ");
978 for (elt = TREE_VECTOR_CST_ELTS (node); elt; elt = TREE_CHAIN (elt))
979 {
980 dump_generic_node (buffer, TREE_VALUE (elt), spc, flags, false);
981 if (TREE_CHAIN (elt))
982 pp_string (buffer, ", ");
983 }
984 pp_string (buffer, " }");
985 }
986 break;
987
988 case FUNCTION_TYPE:
989 case METHOD_TYPE:
990 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
991 pp_space (buffer);
992 if (TREE_CODE (node) == METHOD_TYPE)
993 {
994 if (TYPE_METHOD_BASETYPE (node))
995 dump_decl_name (buffer, TYPE_NAME (TYPE_METHOD_BASETYPE (node)),
996 flags);
997 else
998 pp_string (buffer, "<null method basetype>");
999 pp_string (buffer, "::");
1000 }
1001 if (TYPE_NAME (node) && DECL_NAME (TYPE_NAME (node)))
1002 dump_decl_name (buffer, TYPE_NAME (node), flags);
1003 else
1004 pp_printf (buffer, "<T%x>", TYPE_UID (node));
1005 dump_function_declaration (buffer, node, spc, flags);
1006 break;
1007
1008 case FUNCTION_DECL:
1009 case CONST_DECL:
1010 dump_decl_name (buffer, node, flags);
1011 break;
1012
1013 case LABEL_DECL:
1014 if (DECL_NAME (node))
1015 dump_decl_name (buffer, node, flags);
1016 else if (LABEL_DECL_UID (node) != -1)
1017 pp_printf (buffer, "<L%d>", (int) LABEL_DECL_UID (node));
1018 else
1019 pp_printf (buffer, "<D.%u>", DECL_UID (node));
1020 break;
1021
1022 case TYPE_DECL:
1023 if (DECL_IS_BUILTIN (node))
1024 {
1025 /* Don't print the declaration of built-in types. */
1026 break;
1027 }
1028 if (DECL_NAME (node))
1029 dump_decl_name (buffer, node, flags);
1030 else
1031 {
1032 if ((TREE_CODE (TREE_TYPE (node)) == RECORD_TYPE
1033 || TREE_CODE (TREE_TYPE (node)) == UNION_TYPE)
1034 && TYPE_METHODS (TREE_TYPE (node)))
1035 {
1036 /* The type is a c++ class: all structures have at least
1037 4 methods. */
1038 pp_string (buffer, "class ");
1039 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
1040 }
1041 else
1042 {
1043 pp_string (buffer,
1044 (TREE_CODE (TREE_TYPE (node)) == UNION_TYPE
1045 ? "union" : "struct "));
1046 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
1047 }
1048 }
1049 break;
1050
1051 case VAR_DECL:
1052 case PARM_DECL:
1053 case FIELD_DECL:
1054 case NAMESPACE_DECL:
1055 dump_decl_name (buffer, node, flags);
1056 break;
1057
1058 case RESULT_DECL:
1059 pp_string (buffer, "<retval>");
1060 break;
1061
1062 case COMPONENT_REF:
1063 op0 = TREE_OPERAND (node, 0);
1064 str = ".";
1065 if (op0 && TREE_CODE (op0) == INDIRECT_REF)
1066 {
1067 op0 = TREE_OPERAND (op0, 0);
1068 str = "->";
1069 }
1070 if (op_prio (op0) < op_prio (node))
1071 pp_character (buffer, '(');
1072 dump_generic_node (buffer, op0, spc, flags, false);
1073 if (op_prio (op0) < op_prio (node))
1074 pp_character (buffer, ')');
1075 pp_string (buffer, str);
1076 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1077 op0 = component_ref_field_offset (node);
1078 if (op0 && TREE_CODE (op0) != INTEGER_CST)
1079 {
1080 pp_string (buffer, "{off: ");
1081 dump_generic_node (buffer, op0, spc, flags, false);
1082 pp_character (buffer, '}');
1083 }
1084 break;
1085
1086 case BIT_FIELD_REF:
1087 pp_string (buffer, "BIT_FIELD_REF <");
1088 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1089 pp_string (buffer, ", ");
1090 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1091 pp_string (buffer, ", ");
1092 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
1093 pp_string (buffer, ">");
1094 break;
1095
1096 case ARRAY_REF:
1097 case ARRAY_RANGE_REF:
1098 op0 = TREE_OPERAND (node, 0);
1099 if (op_prio (op0) < op_prio (node))
1100 pp_character (buffer, '(');
1101 dump_generic_node (buffer, op0, spc, flags, false);
1102 if (op_prio (op0) < op_prio (node))
1103 pp_character (buffer, ')');
1104 pp_character (buffer, '[');
1105 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1106 if (TREE_CODE (node) == ARRAY_RANGE_REF)
1107 pp_string (buffer, " ...");
1108 pp_character (buffer, ']');
1109
1110 op0 = array_ref_low_bound (node);
1111 op1 = array_ref_element_size (node);
1112
1113 if (!integer_zerop (op0)
1114 || TREE_OPERAND (node, 2)
1115 || TREE_OPERAND (node, 3))
1116 {
1117 pp_string (buffer, "{lb: ");
1118 dump_generic_node (buffer, op0, spc, flags, false);
1119 pp_string (buffer, " sz: ");
1120 dump_generic_node (buffer, op1, spc, flags, false);
1121 pp_character (buffer, '}');
1122 }
1123 break;
1124
1125 case CONSTRUCTOR:
1126 {
1127 unsigned HOST_WIDE_INT ix;
1128 tree field, val;
1129 bool is_struct_init = FALSE;
1130 pp_character (buffer, '{');
1131 if (TREE_CODE (TREE_TYPE (node)) == RECORD_TYPE
1132 || TREE_CODE (TREE_TYPE (node)) == UNION_TYPE)
1133 is_struct_init = TRUE;
1134 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (node), ix, field, val)
1135 {
1136 if (field && is_struct_init)
1137 {
1138 pp_character (buffer, '.');
1139 dump_generic_node (buffer, field, spc, flags, false);
1140 pp_string (buffer, "=");
1141 }
1142 if (val && TREE_CODE (val) == ADDR_EXPR)
1143 if (TREE_CODE (TREE_OPERAND (val, 0)) == FUNCTION_DECL)
1144 val = TREE_OPERAND (val, 0);
1145 if (val && TREE_CODE (val) == FUNCTION_DECL)
1146 dump_decl_name (buffer, val, flags);
1147 else
1148 dump_generic_node (buffer, val, spc, flags, false);
1149 if (ix != VEC_length (constructor_elt, CONSTRUCTOR_ELTS (node)) - 1)
1150 {
1151 pp_character (buffer, ',');
1152 pp_space (buffer);
1153 }
1154 }
1155 pp_character (buffer, '}');
1156 }
1157 break;
1158
1159 case COMPOUND_EXPR:
1160 {
1161 tree *tp;
1162 if (flags & TDF_SLIM)
1163 {
1164 pp_string (buffer, "<COMPOUND_EXPR>");
1165 break;
1166 }
1167
1168 dump_generic_node (buffer, TREE_OPERAND (node, 0),
1169 spc, flags, !(flags & TDF_SLIM));
1170 if (flags & TDF_SLIM)
1171 newline_and_indent (buffer, spc);
1172 else
1173 {
1174 pp_character (buffer, ',');
1175 pp_space (buffer);
1176 }
1177
1178 for (tp = &TREE_OPERAND (node, 1);
1179 TREE_CODE (*tp) == COMPOUND_EXPR;
1180 tp = &TREE_OPERAND (*tp, 1))
1181 {
1182 dump_generic_node (buffer, TREE_OPERAND (*tp, 0),
1183 spc, flags, !(flags & TDF_SLIM));
1184 if (flags & TDF_SLIM)
1185 newline_and_indent (buffer, spc);
1186 else
1187 {
1188 pp_character (buffer, ',');
1189 pp_space (buffer);
1190 }
1191 }
1192
1193 dump_generic_node (buffer, *tp, spc, flags, !(flags & TDF_SLIM));
1194 }
1195 break;
1196
1197 case STATEMENT_LIST:
1198 {
1199 tree_stmt_iterator si;
1200 bool first = true;
1201
1202 if (flags & TDF_SLIM)
1203 {
1204 pp_string (buffer, "<STATEMENT_LIST>");
1205 break;
1206 }
1207
1208 for (si = tsi_start (node); !tsi_end_p (si); tsi_next (&si))
1209 {
1210 if (!first)
1211 newline_and_indent (buffer, spc);
1212 else
1213 first = false;
1214 dump_generic_node (buffer, tsi_stmt (si), spc, flags, true);
1215 }
1216 }
1217 break;
1218
1219 case MODIFY_EXPR:
1220 case INIT_EXPR:
1221 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags,
1222 false);
1223 pp_space (buffer);
1224 pp_character (buffer, '=');
1225 if (TREE_CODE (node) == MODIFY_EXPR
1226 && MOVE_NONTEMPORAL (node))
1227 pp_string (buffer, "{nt}");
1228 pp_space (buffer);
1229 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags,
1230 false);
1231 break;
1232
1233 case TARGET_EXPR:
1234 pp_string (buffer, "TARGET_EXPR <");
1235 dump_generic_node (buffer, TARGET_EXPR_SLOT (node), spc, flags, false);
1236 pp_character (buffer, ',');
1237 pp_space (buffer);
1238 dump_generic_node (buffer, TARGET_EXPR_INITIAL (node), spc, flags, false);
1239 pp_character (buffer, '>');
1240 break;
1241
1242 case DECL_EXPR:
1243 print_declaration (buffer, DECL_EXPR_DECL (node), spc, flags);
1244 is_stmt = false;
1245 break;
1246
1247 case COND_EXPR:
1248 if (TREE_TYPE (node) == NULL || TREE_TYPE (node) == void_type_node)
1249 {
1250 pp_string (buffer, "if (");
1251 dump_generic_node (buffer, COND_EXPR_COND (node), spc, flags, false);
1252 pp_character (buffer, ')');
1253 /* The lowered cond_exprs should always be printed in full. */
1254 if (COND_EXPR_THEN (node)
1255 && (IS_EMPTY_STMT (COND_EXPR_THEN (node))
1256 || TREE_CODE (COND_EXPR_THEN (node)) == GOTO_EXPR)
1257 && COND_EXPR_ELSE (node)
1258 && (IS_EMPTY_STMT (COND_EXPR_ELSE (node))
1259 || TREE_CODE (COND_EXPR_ELSE (node)) == GOTO_EXPR))
1260 {
1261 pp_space (buffer);
1262 dump_generic_node (buffer, COND_EXPR_THEN (node),
1263 0, flags, true);
1264 if (!IS_EMPTY_STMT (COND_EXPR_ELSE (node)))
1265 {
1266 pp_string (buffer, " else ");
1267 dump_generic_node (buffer, COND_EXPR_ELSE (node),
1268 0, flags, true);
1269 }
1270 }
1271 else if (!(flags & TDF_SLIM))
1272 {
1273 /* Output COND_EXPR_THEN. */
1274 if (COND_EXPR_THEN (node))
1275 {
1276 newline_and_indent (buffer, spc+2);
1277 pp_character (buffer, '{');
1278 newline_and_indent (buffer, spc+4);
1279 dump_generic_node (buffer, COND_EXPR_THEN (node), spc+4,
1280 flags, true);
1281 newline_and_indent (buffer, spc+2);
1282 pp_character (buffer, '}');
1283 }
1284
1285 /* Output COND_EXPR_ELSE. */
1286 if (COND_EXPR_ELSE (node)
1287 && !IS_EMPTY_STMT (COND_EXPR_ELSE (node)))
1288 {
1289 newline_and_indent (buffer, spc);
1290 pp_string (buffer, "else");
1291 newline_and_indent (buffer, spc+2);
1292 pp_character (buffer, '{');
1293 newline_and_indent (buffer, spc+4);
1294 dump_generic_node (buffer, COND_EXPR_ELSE (node), spc+4,
1295 flags, true);
1296 newline_and_indent (buffer, spc+2);
1297 pp_character (buffer, '}');
1298 }
1299 }
1300 is_expr = false;
1301 }
1302 else
1303 {
1304 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1305 pp_space (buffer);
1306 pp_character (buffer, '?');
1307 pp_space (buffer);
1308 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1309 pp_space (buffer);
1310 pp_character (buffer, ':');
1311 pp_space (buffer);
1312 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
1313 }
1314 break;
1315
1316 case BIND_EXPR:
1317 pp_character (buffer, '{');
1318 if (!(flags & TDF_SLIM))
1319 {
1320 if (BIND_EXPR_VARS (node))
1321 {
1322 pp_newline (buffer);
1323
1324 for (op0 = BIND_EXPR_VARS (node); op0; op0 = TREE_CHAIN (op0))
1325 {
1326 print_declaration (buffer, op0, spc+2, flags);
1327 pp_newline (buffer);
1328 }
1329 }
1330
1331 newline_and_indent (buffer, spc+2);
1332 dump_generic_node (buffer, BIND_EXPR_BODY (node), spc+2, flags, true);
1333 newline_and_indent (buffer, spc);
1334 pp_character (buffer, '}');
1335 }
1336 is_expr = false;
1337 break;
1338
1339 case CALL_EXPR:
1340 print_call_name (buffer, CALL_EXPR_FN (node), flags);
1341
1342 /* Print parameters. */
1343 pp_space (buffer);
1344 pp_character (buffer, '(');
1345 {
1346 tree arg;
1347 call_expr_arg_iterator iter;
1348 FOR_EACH_CALL_EXPR_ARG (arg, iter, node)
1349 {
1350 dump_generic_node (buffer, arg, spc, flags, false);
1351 if (more_call_expr_args_p (&iter))
1352 {
1353 pp_character (buffer, ',');
1354 pp_space (buffer);
1355 }
1356 }
1357 }
1358 if (CALL_EXPR_VA_ARG_PACK (node))
1359 {
1360 if (call_expr_nargs (node) > 0)
1361 {
1362 pp_character (buffer, ',');
1363 pp_space (buffer);
1364 }
1365 pp_string (buffer, "__builtin_va_arg_pack ()");
1366 }
1367 pp_character (buffer, ')');
1368
1369 op1 = CALL_EXPR_STATIC_CHAIN (node);
1370 if (op1)
1371 {
1372 pp_string (buffer, " [static-chain: ");
1373 dump_generic_node (buffer, op1, spc, flags, false);
1374 pp_character (buffer, ']');
1375 }
1376
1377 if (CALL_EXPR_RETURN_SLOT_OPT (node))
1378 pp_string (buffer, " [return slot optimization]");
1379 if (CALL_EXPR_TAILCALL (node))
1380 pp_string (buffer, " [tail call]");
1381 break;
1382
1383 case WITH_CLEANUP_EXPR:
1384 NIY;
1385 break;
1386
1387 case CLEANUP_POINT_EXPR:
1388 pp_string (buffer, "<<cleanup_point ");
1389 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1390 pp_string (buffer, ">>");
1391 break;
1392
1393 case PLACEHOLDER_EXPR:
1394 pp_string (buffer, "<PLACEHOLDER_EXPR ");
1395 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
1396 pp_character (buffer, '>');
1397 break;
1398
1399 /* Binary arithmetic and logic expressions. */
1400 case WIDEN_SUM_EXPR:
1401 case WIDEN_MULT_EXPR:
1402 case MULT_EXPR:
1403 case PLUS_EXPR:
1404 case POINTER_PLUS_EXPR:
1405 case MINUS_EXPR:
1406 case TRUNC_DIV_EXPR:
1407 case CEIL_DIV_EXPR:
1408 case FLOOR_DIV_EXPR:
1409 case ROUND_DIV_EXPR:
1410 case TRUNC_MOD_EXPR:
1411 case CEIL_MOD_EXPR:
1412 case FLOOR_MOD_EXPR:
1413 case ROUND_MOD_EXPR:
1414 case RDIV_EXPR:
1415 case EXACT_DIV_EXPR:
1416 case LSHIFT_EXPR:
1417 case RSHIFT_EXPR:
1418 case LROTATE_EXPR:
1419 case RROTATE_EXPR:
1420 case VEC_LSHIFT_EXPR:
1421 case VEC_RSHIFT_EXPR:
1422 case BIT_IOR_EXPR:
1423 case BIT_XOR_EXPR:
1424 case BIT_AND_EXPR:
1425 case TRUTH_ANDIF_EXPR:
1426 case TRUTH_ORIF_EXPR:
1427 case TRUTH_AND_EXPR:
1428 case TRUTH_OR_EXPR:
1429 case TRUTH_XOR_EXPR:
1430 case LT_EXPR:
1431 case LE_EXPR:
1432 case GT_EXPR:
1433 case GE_EXPR:
1434 case EQ_EXPR:
1435 case NE_EXPR:
1436 case UNLT_EXPR:
1437 case UNLE_EXPR:
1438 case UNGT_EXPR:
1439 case UNGE_EXPR:
1440 case UNEQ_EXPR:
1441 case LTGT_EXPR:
1442 case ORDERED_EXPR:
1443 case UNORDERED_EXPR:
1444 {
1445 const char *op = op_symbol (node);
1446 op0 = TREE_OPERAND (node, 0);
1447 op1 = TREE_OPERAND (node, 1);
1448
1449 /* When the operands are expressions with less priority,
1450 keep semantics of the tree representation. */
1451 if (op_prio (op0) <= op_prio (node))
1452 {
1453 pp_character (buffer, '(');
1454 dump_generic_node (buffer, op0, spc, flags, false);
1455 pp_character (buffer, ')');
1456 }
1457 else
1458 dump_generic_node (buffer, op0, spc, flags, false);
1459
1460 pp_space (buffer);
1461 pp_string (buffer, op);
1462 pp_space (buffer);
1463
1464 /* When the operands are expressions with less priority,
1465 keep semantics of the tree representation. */
1466 if (op_prio (op1) <= op_prio (node))
1467 {
1468 pp_character (buffer, '(');
1469 dump_generic_node (buffer, op1, spc, flags, false);
1470 pp_character (buffer, ')');
1471 }
1472 else
1473 dump_generic_node (buffer, op1, spc, flags, false);
1474 }
1475 break;
1476
1477 /* Unary arithmetic and logic expressions. */
1478 case NEGATE_EXPR:
1479 case BIT_NOT_EXPR:
1480 case TRUTH_NOT_EXPR:
1481 case ADDR_EXPR:
1482 case PREDECREMENT_EXPR:
1483 case PREINCREMENT_EXPR:
1484 case ALIGN_INDIRECT_REF:
1485 case MISALIGNED_INDIRECT_REF:
1486 case INDIRECT_REF:
1487 if (TREE_CODE (node) == ADDR_EXPR
1488 && (TREE_CODE (TREE_OPERAND (node, 0)) == STRING_CST
1489 || TREE_CODE (TREE_OPERAND (node, 0)) == FUNCTION_DECL))
1490 ; /* Do not output '&' for strings and function pointers. */
1491 else
1492 pp_string (buffer, op_symbol (node));
1493
1494 if (op_prio (TREE_OPERAND (node, 0)) < op_prio (node))
1495 {
1496 pp_character (buffer, '(');
1497 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1498 pp_character (buffer, ')');
1499 }
1500 else
1501 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1502
1503 if (TREE_CODE (node) == MISALIGNED_INDIRECT_REF)
1504 {
1505 pp_string (buffer, "{misalignment: ");
1506 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1507 pp_character (buffer, '}');
1508 }
1509 break;
1510
1511 case POSTDECREMENT_EXPR:
1512 case POSTINCREMENT_EXPR:
1513 if (op_prio (TREE_OPERAND (node, 0)) < op_prio (node))
1514 {
1515 pp_character (buffer, '(');
1516 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1517 pp_character (buffer, ')');
1518 }
1519 else
1520 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1521 pp_string (buffer, op_symbol (node));
1522 break;
1523
1524 case MIN_EXPR:
1525 pp_string (buffer, "MIN_EXPR <");
1526 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1527 pp_string (buffer, ", ");
1528 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1529 pp_character (buffer, '>');
1530 break;
1531
1532 case MAX_EXPR:
1533 pp_string (buffer, "MAX_EXPR <");
1534 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1535 pp_string (buffer, ", ");
1536 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1537 pp_character (buffer, '>');
1538 break;
1539
1540 case ABS_EXPR:
1541 pp_string (buffer, "ABS_EXPR <");
1542 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1543 pp_character (buffer, '>');
1544 break;
1545
1546 case RANGE_EXPR:
1547 NIY;
1548 break;
1549
1550 case FIXED_CONVERT_EXPR:
1551 case FIX_TRUNC_EXPR:
1552 case FLOAT_EXPR:
1553 CASE_CONVERT:
1554 type = TREE_TYPE (node);
1555 op0 = TREE_OPERAND (node, 0);
1556 if (type != TREE_TYPE (op0))
1557 {
1558 pp_character (buffer, '(');
1559 dump_generic_node (buffer, type, spc, flags, false);
1560 pp_string (buffer, ") ");
1561 }
1562 if (op_prio (op0) < op_prio (node))
1563 pp_character (buffer, '(');
1564 dump_generic_node (buffer, op0, spc, flags, false);
1565 if (op_prio (op0) < op_prio (node))
1566 pp_character (buffer, ')');
1567 break;
1568
1569 case VIEW_CONVERT_EXPR:
1570 pp_string (buffer, "VIEW_CONVERT_EXPR<");
1571 dump_generic_node (buffer, TREE_TYPE (node), spc, flags, false);
1572 pp_string (buffer, ">(");
1573 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1574 pp_character (buffer, ')');
1575 break;
1576
1577 case PAREN_EXPR:
1578 pp_string (buffer, "((");
1579 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1580 pp_string (buffer, "))");
1581 break;
1582
1583 case NON_LVALUE_EXPR:
1584 pp_string (buffer, "NON_LVALUE_EXPR <");
1585 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1586 pp_character (buffer, '>');
1587 break;
1588
1589 case SAVE_EXPR:
1590 pp_string (buffer, "SAVE_EXPR <");
1591 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1592 pp_character (buffer, '>');
1593 break;
1594
1595 case COMPLEX_EXPR:
1596 pp_string (buffer, "COMPLEX_EXPR <");
1597 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1598 pp_string (buffer, ", ");
1599 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1600 pp_string (buffer, ">");
1601 break;
1602
1603 case CONJ_EXPR:
1604 pp_string (buffer, "CONJ_EXPR <");
1605 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1606 pp_string (buffer, ">");
1607 break;
1608
1609 case REALPART_EXPR:
1610 pp_string (buffer, "REALPART_EXPR <");
1611 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1612 pp_string (buffer, ">");
1613 break;
1614
1615 case IMAGPART_EXPR:
1616 pp_string (buffer, "IMAGPART_EXPR <");
1617 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1618 pp_string (buffer, ">");
1619 break;
1620
1621 case VA_ARG_EXPR:
1622 pp_string (buffer, "VA_ARG_EXPR <");
1623 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1624 pp_string (buffer, ">");
1625 break;
1626
1627 case TRY_FINALLY_EXPR:
1628 case TRY_CATCH_EXPR:
1629 pp_string (buffer, "try");
1630 newline_and_indent (buffer, spc+2);
1631 pp_string (buffer, "{");
1632 newline_and_indent (buffer, spc+4);
1633 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc+4, flags, true);
1634 newline_and_indent (buffer, spc+2);
1635 pp_string (buffer, "}");
1636 newline_and_indent (buffer, spc);
1637 pp_string (buffer,
1638 (TREE_CODE (node) == TRY_CATCH_EXPR) ? "catch" : "finally");
1639 newline_and_indent (buffer, spc+2);
1640 pp_string (buffer, "{");
1641 newline_and_indent (buffer, spc+4);
1642 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc+4, flags, true);
1643 newline_and_indent (buffer, spc+2);
1644 pp_string (buffer, "}");
1645 is_expr = false;
1646 break;
1647
1648 case CATCH_EXPR:
1649 pp_string (buffer, "catch (");
1650 dump_generic_node (buffer, CATCH_TYPES (node), spc+2, flags, false);
1651 pp_string (buffer, ")");
1652 newline_and_indent (buffer, spc+2);
1653 pp_string (buffer, "{");
1654 newline_and_indent (buffer, spc+4);
1655 dump_generic_node (buffer, CATCH_BODY (node), spc+4, flags, true);
1656 newline_and_indent (buffer, spc+2);
1657 pp_string (buffer, "}");
1658 is_expr = false;
1659 break;
1660
1661 case EH_FILTER_EXPR:
1662 pp_string (buffer, "<<<eh_filter (");
1663 dump_generic_node (buffer, EH_FILTER_TYPES (node), spc+2, flags, false);
1664 pp_string (buffer, ")>>>");
1665 newline_and_indent (buffer, spc+2);
1666 pp_string (buffer, "{");
1667 newline_and_indent (buffer, spc+4);
1668 dump_generic_node (buffer, EH_FILTER_FAILURE (node), spc+4, flags, true);
1669 newline_and_indent (buffer, spc+2);
1670 pp_string (buffer, "}");
1671 is_expr = false;
1672 break;
1673
1674 case LABEL_EXPR:
1675 op0 = TREE_OPERAND (node, 0);
1676 /* If this is for break or continue, don't bother printing it. */
1677 if (DECL_NAME (op0))
1678 {
1679 const char *name = IDENTIFIER_POINTER (DECL_NAME (op0));
1680 if (strcmp (name, "break") == 0
1681 || strcmp (name, "continue") == 0)
1682 break;
1683 }
1684 dump_generic_node (buffer, op0, spc, flags, false);
1685 pp_character (buffer, ':');
1686 if (DECL_NONLOCAL (op0))
1687 pp_string (buffer, " [non-local]");
1688 break;
1689
1690 case EXC_PTR_EXPR:
1691 pp_string (buffer, "<<<exception object>>>");
1692 break;
1693
1694 case FILTER_EXPR:
1695 pp_string (buffer, "<<<filter object>>>");
1696 break;
1697
1698 case LOOP_EXPR:
1699 pp_string (buffer, "while (1)");
1700 if (!(flags & TDF_SLIM))
1701 {
1702 newline_and_indent (buffer, spc+2);
1703 pp_character (buffer, '{');
1704 newline_and_indent (buffer, spc+4);
1705 dump_generic_node (buffer, LOOP_EXPR_BODY (node), spc+4, flags, true);
1706 newline_and_indent (buffer, spc+2);
1707 pp_character (buffer, '}');
1708 }
1709 is_expr = false;
1710 break;
1711
1712 case PREDICT_EXPR:
1713 pp_string (buffer, "// predicted ");
1714 if (PREDICT_EXPR_OUTCOME (node))
1715 pp_string (buffer, "likely by ");
1716 else
1717 pp_string (buffer, "unlikely by ");
1718 pp_string (buffer, predictor_name (PREDICT_EXPR_PREDICTOR (node)));
1719 pp_string (buffer, " predictor.");
1720 break;
1721
1722 case RETURN_EXPR:
1723 pp_string (buffer, "return");
1724 op0 = TREE_OPERAND (node, 0);
1725 if (op0)
1726 {
1727 pp_space (buffer);
1728 if (TREE_CODE (op0) == MODIFY_EXPR)
1729 dump_generic_node (buffer, TREE_OPERAND (op0, 1),
1730 spc, flags, false);
1731 else
1732 dump_generic_node (buffer, op0, spc, flags, false);
1733 }
1734 break;
1735
1736 case EXIT_EXPR:
1737 pp_string (buffer, "if (");
1738 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1739 pp_string (buffer, ") break");
1740 break;
1741
1742 case SWITCH_EXPR:
1743 pp_string (buffer, "switch (");
1744 dump_generic_node (buffer, SWITCH_COND (node), spc, flags, false);
1745 pp_character (buffer, ')');
1746 if (!(flags & TDF_SLIM))
1747 {
1748 newline_and_indent (buffer, spc+2);
1749 pp_character (buffer, '{');
1750 if (SWITCH_BODY (node))
1751 {
1752 newline_and_indent (buffer, spc+4);
1753 dump_generic_node (buffer, SWITCH_BODY (node), spc+4, flags,
1754 true);
1755 }
1756 else
1757 {
1758 tree vec = SWITCH_LABELS (node);
1759 size_t i, n = TREE_VEC_LENGTH (vec);
1760 for (i = 0; i < n; ++i)
1761 {
1762 tree elt = TREE_VEC_ELT (vec, i);
1763 newline_and_indent (buffer, spc+4);
1764 if (elt)
1765 {
1766 dump_generic_node (buffer, elt, spc+4, flags, false);
1767 pp_string (buffer, " goto ");
1768 dump_generic_node (buffer, CASE_LABEL (elt), spc+4,
1769 flags, true);
1770 pp_semicolon (buffer);
1771 }
1772 else
1773 pp_string (buffer, "case ???: goto ???;");
1774 }
1775 }
1776 newline_and_indent (buffer, spc+2);
1777 pp_character (buffer, '}');
1778 }
1779 is_expr = false;
1780 break;
1781
1782 case GOTO_EXPR:
1783 op0 = GOTO_DESTINATION (node);
1784 if (TREE_CODE (op0) != SSA_NAME && DECL_P (op0) && DECL_NAME (op0))
1785 {
1786 const char *name = IDENTIFIER_POINTER (DECL_NAME (op0));
1787 if (strcmp (name, "break") == 0
1788 || strcmp (name, "continue") == 0)
1789 {
1790 pp_string (buffer, name);
1791 break;
1792 }
1793 }
1794 pp_string (buffer, "goto ");
1795 dump_generic_node (buffer, op0, spc, flags, false);
1796 break;
1797
1798 case RESX_EXPR:
1799 pp_string (buffer, "resx ");
1800 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1801 break;
1802
1803 case ASM_EXPR:
1804 pp_string (buffer, "__asm__");
1805 if (ASM_VOLATILE_P (node))
1806 pp_string (buffer, " __volatile__");
1807 pp_character (buffer, '(');
1808 dump_generic_node (buffer, ASM_STRING (node), spc, flags, false);
1809 pp_character (buffer, ':');
1810 dump_generic_node (buffer, ASM_OUTPUTS (node), spc, flags, false);
1811 pp_character (buffer, ':');
1812 dump_generic_node (buffer, ASM_INPUTS (node), spc, flags, false);
1813 if (ASM_CLOBBERS (node))
1814 {
1815 pp_character (buffer, ':');
1816 dump_generic_node (buffer, ASM_CLOBBERS (node), spc, flags, false);
1817 }
1818 pp_string (buffer, ")");
1819 break;
1820
1821 case CASE_LABEL_EXPR:
1822 if (CASE_LOW (node) && CASE_HIGH (node))
1823 {
1824 pp_string (buffer, "case ");
1825 dump_generic_node (buffer, CASE_LOW (node), spc, flags, false);
1826 pp_string (buffer, " ... ");
1827 dump_generic_node (buffer, CASE_HIGH (node), spc, flags, false);
1828 }
1829 else if (CASE_LOW (node))
1830 {
1831 pp_string (buffer, "case ");
1832 dump_generic_node (buffer, CASE_LOW (node), spc, flags, false);
1833 }
1834 else
1835 pp_string (buffer, "default");
1836 pp_character (buffer, ':');
1837 break;
1838
1839 case OBJ_TYPE_REF:
1840 pp_string (buffer, "OBJ_TYPE_REF(");
1841 dump_generic_node (buffer, OBJ_TYPE_REF_EXPR (node), spc, flags, false);
1842 pp_character (buffer, ';');
1843 dump_generic_node (buffer, OBJ_TYPE_REF_OBJECT (node), spc, flags, false);
1844 pp_character (buffer, '-');
1845 pp_character (buffer, '>');
1846 dump_generic_node (buffer, OBJ_TYPE_REF_TOKEN (node), spc, flags, false);
1847 pp_character (buffer, ')');
1848 break;
1849
1850 case SSA_NAME:
1851 dump_generic_node (buffer, SSA_NAME_VAR (node), spc, flags, false);
1852 pp_string (buffer, "_");
1853 pp_decimal_int (buffer, SSA_NAME_VERSION (node));
1854 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (node))
1855 pp_string (buffer, "(ab)");
1856 else if (SSA_NAME_IS_DEFAULT_DEF (node))
1857 pp_string (buffer, "(D)");
1858 break;
1859
1860 case WITH_SIZE_EXPR:
1861 pp_string (buffer, "WITH_SIZE_EXPR <");
1862 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1863 pp_string (buffer, ", ");
1864 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1865 pp_string (buffer, ">");
1866 break;
1867
1868 case ASSERT_EXPR:
1869 pp_string (buffer, "ASSERT_EXPR <");
1870 dump_generic_node (buffer, ASSERT_EXPR_VAR (node), spc, flags, false);
1871 pp_string (buffer, ", ");
1872 dump_generic_node (buffer, ASSERT_EXPR_COND (node), spc, flags, false);
1873 pp_string (buffer, ">");
1874 break;
1875
1876 case SCEV_KNOWN:
1877 pp_string (buffer, "scev_known");
1878 break;
1879
1880 case SCEV_NOT_KNOWN:
1881 pp_string (buffer, "scev_not_known");
1882 break;
1883
1884 case POLYNOMIAL_CHREC:
1885 pp_string (buffer, "{");
1886 dump_generic_node (buffer, CHREC_LEFT (node), spc, flags, false);
1887 pp_string (buffer, ", +, ");
1888 dump_generic_node (buffer, CHREC_RIGHT (node), spc, flags, false);
1889 pp_string (buffer, "}_");
1890 dump_generic_node (buffer, CHREC_VAR (node), spc, flags, false);
1891 is_stmt = false;
1892 break;
1893
1894 case REALIGN_LOAD_EXPR:
1895 pp_string (buffer, "REALIGN_LOAD <");
1896 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1897 pp_string (buffer, ", ");
1898 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1899 pp_string (buffer, ", ");
1900 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
1901 pp_string (buffer, ">");
1902 break;
1903
1904 case VEC_COND_EXPR:
1905 pp_string (buffer, " VEC_COND_EXPR < ");
1906 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1907 pp_string (buffer, " , ");
1908 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1909 pp_string (buffer, " , ");
1910 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
1911 pp_string (buffer, " > ");
1912 break;
1913
1914 case DOT_PROD_EXPR:
1915 pp_string (buffer, " DOT_PROD_EXPR < ");
1916 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
1917 pp_string (buffer, ", ");
1918 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
1919 pp_string (buffer, ", ");
1920 dump_generic_node (buffer, TREE_OPERAND (node, 2), spc, flags, false);
1921 pp_string (buffer, " > ");
1922 break;
1923
1924 case OMP_PARALLEL:
1925 pp_string (buffer, "#pragma omp parallel");
1926 dump_omp_clauses (buffer, OMP_PARALLEL_CLAUSES (node), spc, flags);
1927
1928 dump_omp_body:
1929 if (!(flags & TDF_SLIM) && OMP_BODY (node))
1930 {
1931 newline_and_indent (buffer, spc + 2);
1932 pp_character (buffer, '{');
1933 newline_and_indent (buffer, spc + 4);
1934 dump_generic_node (buffer, OMP_BODY (node), spc + 4, flags, false);
1935 newline_and_indent (buffer, spc + 2);
1936 pp_character (buffer, '}');
1937 }
1938 is_expr = false;
1939 break;
1940
1941 case OMP_TASK:
1942 pp_string (buffer, "#pragma omp task");
1943 dump_omp_clauses (buffer, OMP_TASK_CLAUSES (node), spc, flags);
1944 goto dump_omp_body;
1945
1946 case OMP_FOR:
1947 pp_string (buffer, "#pragma omp for");
1948 dump_omp_clauses (buffer, OMP_FOR_CLAUSES (node), spc, flags);
1949
1950 if (!(flags & TDF_SLIM))
1951 {
1952 int i;
1953
1954 if (OMP_FOR_PRE_BODY (node))
1955 {
1956 newline_and_indent (buffer, spc + 2);
1957 pp_character (buffer, '{');
1958 spc += 4;
1959 newline_and_indent (buffer, spc);
1960 dump_generic_node (buffer, OMP_FOR_PRE_BODY (node),
1961 spc, flags, false);
1962 }
1963 spc -= 2;
1964 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (node)); i++)
1965 {
1966 spc += 2;
1967 newline_and_indent (buffer, spc);
1968 pp_string (buffer, "for (");
1969 dump_generic_node (buffer, TREE_VEC_ELT (OMP_FOR_INIT (node), i),
1970 spc, flags, false);
1971 pp_string (buffer, "; ");
1972 dump_generic_node (buffer, TREE_VEC_ELT (OMP_FOR_COND (node), i),
1973 spc, flags, false);
1974 pp_string (buffer, "; ");
1975 dump_generic_node (buffer, TREE_VEC_ELT (OMP_FOR_INCR (node), i),
1976 spc, flags, false);
1977 pp_string (buffer, ")");
1978 }
1979 if (OMP_FOR_BODY (node))
1980 {
1981 newline_and_indent (buffer, spc + 2);
1982 pp_character (buffer, '{');
1983 newline_and_indent (buffer, spc + 4);
1984 dump_generic_node (buffer, OMP_FOR_BODY (node), spc + 4, flags,
1985 false);
1986 newline_and_indent (buffer, spc + 2);
1987 pp_character (buffer, '}');
1988 }
1989 spc -= 2 * TREE_VEC_LENGTH (OMP_FOR_INIT (node)) - 2;
1990 if (OMP_FOR_PRE_BODY (node))
1991 {
1992 spc -= 4;
1993 newline_and_indent (buffer, spc + 2);
1994 pp_character (buffer, '}');
1995 }
1996 }
1997 is_expr = false;
1998 break;
1999
2000 case OMP_SECTIONS:
2001 pp_string (buffer, "#pragma omp sections");
2002 dump_omp_clauses (buffer, OMP_SECTIONS_CLAUSES (node), spc, flags);
2003 goto dump_omp_body;
2004
2005 case OMP_SECTION:
2006 pp_string (buffer, "#pragma omp section");
2007 goto dump_omp_body;
2008
2009 case OMP_MASTER:
2010 pp_string (buffer, "#pragma omp master");
2011 goto dump_omp_body;
2012
2013 case OMP_ORDERED:
2014 pp_string (buffer, "#pragma omp ordered");
2015 goto dump_omp_body;
2016
2017 case OMP_CRITICAL:
2018 pp_string (buffer, "#pragma omp critical");
2019 if (OMP_CRITICAL_NAME (node))
2020 {
2021 pp_space (buffer);
2022 pp_character (buffer, '(');
2023 dump_generic_node (buffer, OMP_CRITICAL_NAME (node), spc,
2024 flags, false);
2025 pp_character (buffer, ')');
2026 }
2027 goto dump_omp_body;
2028
2029 case OMP_ATOMIC:
2030 pp_string (buffer, "#pragma omp atomic");
2031 newline_and_indent (buffer, spc + 2);
2032 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2033 pp_space (buffer);
2034 pp_character (buffer, '=');
2035 pp_space (buffer);
2036 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2037 break;
2038
2039 case OMP_SINGLE:
2040 pp_string (buffer, "#pragma omp single");
2041 dump_omp_clauses (buffer, OMP_SINGLE_CLAUSES (node), spc, flags);
2042 goto dump_omp_body;
2043
2044 case OMP_CLAUSE:
2045 dump_omp_clause (buffer, node, spc, flags);
2046 is_expr = false;
2047 break;
2048
2049 case REDUC_MAX_EXPR:
2050 pp_string (buffer, " REDUC_MAX_EXPR < ");
2051 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2052 pp_string (buffer, " > ");
2053 break;
2054
2055 case REDUC_MIN_EXPR:
2056 pp_string (buffer, " REDUC_MIN_EXPR < ");
2057 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2058 pp_string (buffer, " > ");
2059 break;
2060
2061 case REDUC_PLUS_EXPR:
2062 pp_string (buffer, " REDUC_PLUS_EXPR < ");
2063 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2064 pp_string (buffer, " > ");
2065 break;
2066
2067 case VEC_WIDEN_MULT_HI_EXPR:
2068 pp_string (buffer, " VEC_WIDEN_MULT_HI_EXPR < ");
2069 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2070 pp_string (buffer, ", ");
2071 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2072 pp_string (buffer, " > ");
2073 break;
2074
2075 case VEC_WIDEN_MULT_LO_EXPR:
2076 pp_string (buffer, " VEC_WIDEN_MULT_LO_EXPR < ");
2077 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2078 pp_string (buffer, ", ");
2079 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2080 pp_string (buffer, " > ");
2081 break;
2082
2083 case VEC_UNPACK_HI_EXPR:
2084 pp_string (buffer, " VEC_UNPACK_HI_EXPR < ");
2085 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2086 pp_string (buffer, " > ");
2087 break;
2088
2089 case VEC_UNPACK_LO_EXPR:
2090 pp_string (buffer, " VEC_UNPACK_LO_EXPR < ");
2091 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2092 pp_string (buffer, " > ");
2093 break;
2094
2095 case VEC_UNPACK_FLOAT_HI_EXPR:
2096 pp_string (buffer, " VEC_UNPACK_FLOAT_HI_EXPR < ");
2097 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2098 pp_string (buffer, " > ");
2099 break;
2100
2101 case VEC_UNPACK_FLOAT_LO_EXPR:
2102 pp_string (buffer, " VEC_UNPACK_FLOAT_LO_EXPR < ");
2103 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2104 pp_string (buffer, " > ");
2105 break;
2106
2107 case VEC_PACK_TRUNC_EXPR:
2108 pp_string (buffer, " VEC_PACK_TRUNC_EXPR < ");
2109 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2110 pp_string (buffer, ", ");
2111 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2112 pp_string (buffer, " > ");
2113 break;
2114
2115 case VEC_PACK_SAT_EXPR:
2116 pp_string (buffer, " VEC_PACK_SAT_EXPR < ");
2117 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2118 pp_string (buffer, ", ");
2119 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2120 pp_string (buffer, " > ");
2121 break;
2122
2123 case VEC_PACK_FIX_TRUNC_EXPR:
2124 pp_string (buffer, " VEC_PACK_FIX_TRUNC_EXPR < ");
2125 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2126 pp_string (buffer, ", ");
2127 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2128 pp_string (buffer, " > ");
2129 break;
2130
2131 case BLOCK:
2132 dump_block_node (buffer, node, spc, flags);
2133 break;
2134
2135 case VEC_EXTRACT_EVEN_EXPR:
2136 pp_string (buffer, " VEC_EXTRACT_EVEN_EXPR < ");
2137 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2138 pp_string (buffer, ", ");
2139 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2140 pp_string (buffer, " > ");
2141 break;
2142
2143 case VEC_EXTRACT_ODD_EXPR:
2144 pp_string (buffer, " VEC_EXTRACT_ODD_EXPR < ");
2145 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2146 pp_string (buffer, ", ");
2147 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2148 pp_string (buffer, " > ");
2149 break;
2150
2151 case VEC_INTERLEAVE_HIGH_EXPR:
2152 pp_string (buffer, " VEC_INTERLEAVE_HIGH_EXPR < ");
2153 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2154 pp_string (buffer, ", ");
2155 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2156 pp_string (buffer, " > ");
2157 break;
2158
2159 case VEC_INTERLEAVE_LOW_EXPR:
2160 pp_string (buffer, " VEC_INTERLEAVE_LOW_EXPR < ");
2161 dump_generic_node (buffer, TREE_OPERAND (node, 0), spc, flags, false);
2162 pp_string (buffer, ", ");
2163 dump_generic_node (buffer, TREE_OPERAND (node, 1), spc, flags, false);
2164 pp_string (buffer, " > ");
2165 break;
2166
2167 default:
2168 NIY;
2169 }
2170
2171 if (is_stmt && is_expr)
2172 pp_semicolon (buffer);
2173
2174 /* If we're building a diagnostic, the formatted text will be written
2175 into BUFFER's stream by the caller; otherwise, write it now. */
2176 if (!(flags & TDF_DIAGNOSTIC))
2177 pp_write_text_to_stream (buffer);
2178
2179 return spc;
2180 }
2181
2182 /* Print the declaration of a variable. */
2183
2184 void
2185 print_declaration (pretty_printer *buffer, tree t, int spc, int flags)
2186 {
2187 INDENT (spc);
2188
2189 if (TREE_CODE (t) == TYPE_DECL)
2190 pp_string (buffer, "typedef ");
2191
2192 if (CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_DECL_WRTL) && DECL_REGISTER (t))
2193 pp_string (buffer, "register ");
2194
2195 if (TREE_PUBLIC (t) && DECL_EXTERNAL (t))
2196 pp_string (buffer, "extern ");
2197 else if (TREE_STATIC (t))
2198 pp_string (buffer, "static ");
2199
2200 /* Print the type and name. */
2201 if (TREE_CODE (TREE_TYPE (t)) == ARRAY_TYPE)
2202 {
2203 tree tmp;
2204
2205 /* Print array's type. */
2206 tmp = TREE_TYPE (t);
2207 while (TREE_CODE (TREE_TYPE (tmp)) == ARRAY_TYPE)
2208 tmp = TREE_TYPE (tmp);
2209 dump_generic_node (buffer, TREE_TYPE (tmp), spc, flags, false);
2210
2211 /* Print variable's name. */
2212 pp_space (buffer);
2213 dump_generic_node (buffer, t, spc, flags, false);
2214
2215 /* Print the dimensions. */
2216 tmp = TREE_TYPE (t);
2217 while (TREE_CODE (tmp) == ARRAY_TYPE)
2218 {
2219 dump_array_domain (buffer, TYPE_DOMAIN (tmp), spc, flags);
2220 tmp = TREE_TYPE (tmp);
2221 }
2222 }
2223 else if (TREE_CODE (t) == FUNCTION_DECL)
2224 {
2225 dump_generic_node (buffer, TREE_TYPE (TREE_TYPE (t)), spc, flags, false);
2226 pp_space (buffer);
2227 dump_decl_name (buffer, t, flags);
2228 dump_function_declaration (buffer, TREE_TYPE (t), spc, flags);
2229 }
2230 else
2231 {
2232 /* Print type declaration. */
2233 dump_generic_node (buffer, TREE_TYPE (t), spc, flags, false);
2234
2235 /* Print variable's name. */
2236 pp_space (buffer);
2237 dump_generic_node (buffer, t, spc, flags, false);
2238 }
2239
2240 if (TREE_CODE (t) == VAR_DECL && DECL_HARD_REGISTER (t))
2241 {
2242 pp_string (buffer, " __asm__ ");
2243 pp_character (buffer, '(');
2244 dump_generic_node (buffer, DECL_ASSEMBLER_NAME (t), spc, flags, false);
2245 pp_character (buffer, ')');
2246 }
2247
2248 /* The initial value of a function serves to determine whether the function
2249 is declared or defined. So the following does not apply to function
2250 nodes. */
2251 if (TREE_CODE (t) != FUNCTION_DECL)
2252 {
2253 /* Print the initial value. */
2254 if (DECL_INITIAL (t))
2255 {
2256 pp_space (buffer);
2257 pp_character (buffer, '=');
2258 pp_space (buffer);
2259 dump_generic_node (buffer, DECL_INITIAL (t), spc, flags, false);
2260 }
2261 }
2262
2263 if (TREE_CODE (t) == VAR_DECL && DECL_HAS_VALUE_EXPR_P (t))
2264 {
2265 pp_string (buffer, " [value-expr: ");
2266 dump_generic_node (buffer, DECL_VALUE_EXPR (t), spc, flags, false);
2267 pp_character (buffer, ']');
2268 }
2269
2270 pp_character (buffer, ';');
2271 }
2272
2273
2274 /* Prints a structure: name, fields, and methods.
2275 FIXME: Still incomplete. */
2276
2277 static void
2278 print_struct_decl (pretty_printer *buffer, const_tree node, int spc, int flags)
2279 {
2280 /* Print the name of the structure. */
2281 if (TYPE_NAME (node))
2282 {
2283 INDENT (spc);
2284 if (TREE_CODE (node) == RECORD_TYPE)
2285 pp_string (buffer, "struct ");
2286 else if ((TREE_CODE (node) == UNION_TYPE
2287 || TREE_CODE (node) == QUAL_UNION_TYPE))
2288 pp_string (buffer, "union ");
2289
2290 dump_generic_node (buffer, TYPE_NAME (node), spc, 0, false);
2291 }
2292
2293 /* Print the contents of the structure. */
2294 pp_newline (buffer);
2295 INDENT (spc);
2296 pp_character (buffer, '{');
2297 pp_newline (buffer);
2298
2299 /* Print the fields of the structure. */
2300 {
2301 tree tmp;
2302 tmp = TYPE_FIELDS (node);
2303 while (tmp)
2304 {
2305 /* Avoid to print recursively the structure. */
2306 /* FIXME : Not implemented correctly...,
2307 what about the case when we have a cycle in the contain graph? ...
2308 Maybe this could be solved by looking at the scope in which the
2309 structure was declared. */
2310 if (TREE_TYPE (tmp) != node
2311 && (TREE_CODE (TREE_TYPE (tmp)) != POINTER_TYPE
2312 || TREE_TYPE (TREE_TYPE (tmp)) != node))
2313 {
2314 print_declaration (buffer, tmp, spc+2, flags);
2315 pp_newline (buffer);
2316 }
2317 tmp = TREE_CHAIN (tmp);
2318 }
2319 }
2320 INDENT (spc);
2321 pp_character (buffer, '}');
2322 }
2323
2324 /* Return the priority of the operator CODE.
2325
2326 From lowest to highest precedence with either left-to-right (L-R)
2327 or right-to-left (R-L) associativity]:
2328
2329 1 [L-R] ,
2330 2 [R-L] = += -= *= /= %= &= ^= |= <<= >>=
2331 3 [R-L] ?:
2332 4 [L-R] ||
2333 5 [L-R] &&
2334 6 [L-R] |
2335 7 [L-R] ^
2336 8 [L-R] &
2337 9 [L-R] == !=
2338 10 [L-R] < <= > >=
2339 11 [L-R] << >>
2340 12 [L-R] + -
2341 13 [L-R] * / %
2342 14 [R-L] ! ~ ++ -- + - * & (type) sizeof
2343 15 [L-R] fn() [] -> .
2344
2345 unary +, - and * have higher precedence than the corresponding binary
2346 operators. */
2347
2348 int
2349 op_code_prio (enum tree_code code)
2350 {
2351 switch (code)
2352 {
2353 case TREE_LIST:
2354 case COMPOUND_EXPR:
2355 case BIND_EXPR:
2356 return 1;
2357
2358 case MODIFY_EXPR:
2359 case INIT_EXPR:
2360 return 2;
2361
2362 case COND_EXPR:
2363 return 3;
2364
2365 case TRUTH_OR_EXPR:
2366 case TRUTH_ORIF_EXPR:
2367 return 4;
2368
2369 case TRUTH_AND_EXPR:
2370 case TRUTH_ANDIF_EXPR:
2371 return 5;
2372
2373 case BIT_IOR_EXPR:
2374 return 6;
2375
2376 case BIT_XOR_EXPR:
2377 case TRUTH_XOR_EXPR:
2378 return 7;
2379
2380 case BIT_AND_EXPR:
2381 return 8;
2382
2383 case EQ_EXPR:
2384 case NE_EXPR:
2385 return 9;
2386
2387 case UNLT_EXPR:
2388 case UNLE_EXPR:
2389 case UNGT_EXPR:
2390 case UNGE_EXPR:
2391 case UNEQ_EXPR:
2392 case LTGT_EXPR:
2393 case ORDERED_EXPR:
2394 case UNORDERED_EXPR:
2395 case LT_EXPR:
2396 case LE_EXPR:
2397 case GT_EXPR:
2398 case GE_EXPR:
2399 return 10;
2400
2401 case LSHIFT_EXPR:
2402 case RSHIFT_EXPR:
2403 case LROTATE_EXPR:
2404 case RROTATE_EXPR:
2405 return 11;
2406
2407 case WIDEN_SUM_EXPR:
2408 case PLUS_EXPR:
2409 case POINTER_PLUS_EXPR:
2410 case MINUS_EXPR:
2411 return 12;
2412
2413 case VEC_WIDEN_MULT_HI_EXPR:
2414 case VEC_WIDEN_MULT_LO_EXPR:
2415 case WIDEN_MULT_EXPR:
2416 case DOT_PROD_EXPR:
2417 case MULT_EXPR:
2418 case TRUNC_DIV_EXPR:
2419 case CEIL_DIV_EXPR:
2420 case FLOOR_DIV_EXPR:
2421 case ROUND_DIV_EXPR:
2422 case RDIV_EXPR:
2423 case EXACT_DIV_EXPR:
2424 case TRUNC_MOD_EXPR:
2425 case CEIL_MOD_EXPR:
2426 case FLOOR_MOD_EXPR:
2427 case ROUND_MOD_EXPR:
2428 return 13;
2429
2430 case TRUTH_NOT_EXPR:
2431 case BIT_NOT_EXPR:
2432 case POSTINCREMENT_EXPR:
2433 case POSTDECREMENT_EXPR:
2434 case PREINCREMENT_EXPR:
2435 case PREDECREMENT_EXPR:
2436 case NEGATE_EXPR:
2437 case ALIGN_INDIRECT_REF:
2438 case MISALIGNED_INDIRECT_REF:
2439 case INDIRECT_REF:
2440 case ADDR_EXPR:
2441 case FLOAT_EXPR:
2442 CASE_CONVERT:
2443 case FIX_TRUNC_EXPR:
2444 case TARGET_EXPR:
2445 return 14;
2446
2447 case CALL_EXPR:
2448 case ARRAY_REF:
2449 case ARRAY_RANGE_REF:
2450 case COMPONENT_REF:
2451 return 15;
2452
2453 /* Special expressions. */
2454 case MIN_EXPR:
2455 case MAX_EXPR:
2456 case ABS_EXPR:
2457 case REALPART_EXPR:
2458 case IMAGPART_EXPR:
2459 case REDUC_MAX_EXPR:
2460 case REDUC_MIN_EXPR:
2461 case REDUC_PLUS_EXPR:
2462 case VEC_LSHIFT_EXPR:
2463 case VEC_RSHIFT_EXPR:
2464 case VEC_UNPACK_HI_EXPR:
2465 case VEC_UNPACK_LO_EXPR:
2466 case VEC_UNPACK_FLOAT_HI_EXPR:
2467 case VEC_UNPACK_FLOAT_LO_EXPR:
2468 case VEC_PACK_TRUNC_EXPR:
2469 case VEC_PACK_SAT_EXPR:
2470 return 16;
2471
2472 default:
2473 /* Return an arbitrarily high precedence to avoid surrounding single
2474 VAR_DECLs in ()s. */
2475 return 9999;
2476 }
2477 }
2478
2479 /* Return the priority of the operator OP. */
2480
2481 int
2482 op_prio (const_tree op)
2483 {
2484 enum tree_code code;
2485
2486 if (op == NULL)
2487 return 9999;
2488
2489 code = TREE_CODE (op);
2490 if (code == SAVE_EXPR || code == NON_LVALUE_EXPR)
2491 return op_prio (TREE_OPERAND (op, 0));
2492
2493 return op_code_prio (code);
2494 }
2495
2496 /* Return the symbol associated with operator CODE. */
2497
2498 const char *
2499 op_symbol_code (enum tree_code code)
2500 {
2501 switch (code)
2502 {
2503 case MODIFY_EXPR:
2504 return "=";
2505
2506 case TRUTH_OR_EXPR:
2507 case TRUTH_ORIF_EXPR:
2508 return "||";
2509
2510 case TRUTH_AND_EXPR:
2511 case TRUTH_ANDIF_EXPR:
2512 return "&&";
2513
2514 case BIT_IOR_EXPR:
2515 return "|";
2516
2517 case TRUTH_XOR_EXPR:
2518 case BIT_XOR_EXPR:
2519 return "^";
2520
2521 case ADDR_EXPR:
2522 case BIT_AND_EXPR:
2523 return "&";
2524
2525 case ORDERED_EXPR:
2526 return "ord";
2527 case UNORDERED_EXPR:
2528 return "unord";
2529
2530 case EQ_EXPR:
2531 return "==";
2532 case UNEQ_EXPR:
2533 return "u==";
2534
2535 case NE_EXPR:
2536 return "!=";
2537
2538 case LT_EXPR:
2539 return "<";
2540 case UNLT_EXPR:
2541 return "u<";
2542
2543 case LE_EXPR:
2544 return "<=";
2545 case UNLE_EXPR:
2546 return "u<=";
2547
2548 case GT_EXPR:
2549 return ">";
2550 case UNGT_EXPR:
2551 return "u>";
2552
2553 case GE_EXPR:
2554 return ">=";
2555 case UNGE_EXPR:
2556 return "u>=";
2557
2558 case LTGT_EXPR:
2559 return "<>";
2560
2561 case LSHIFT_EXPR:
2562 return "<<";
2563
2564 case RSHIFT_EXPR:
2565 return ">>";
2566
2567 case LROTATE_EXPR:
2568 return "r<<";
2569
2570 case RROTATE_EXPR:
2571 return "r>>";
2572
2573 case VEC_LSHIFT_EXPR:
2574 return "v<<";
2575
2576 case VEC_RSHIFT_EXPR:
2577 return "v>>";
2578
2579 case POINTER_PLUS_EXPR:
2580 return "+";
2581
2582 case PLUS_EXPR:
2583 return "+";
2584
2585 case REDUC_PLUS_EXPR:
2586 return "r+";
2587
2588 case WIDEN_SUM_EXPR:
2589 return "w+";
2590
2591 case WIDEN_MULT_EXPR:
2592 return "w*";
2593
2594 case NEGATE_EXPR:
2595 case MINUS_EXPR:
2596 return "-";
2597
2598 case BIT_NOT_EXPR:
2599 return "~";
2600
2601 case TRUTH_NOT_EXPR:
2602 return "!";
2603
2604 case MULT_EXPR:
2605 case INDIRECT_REF:
2606 return "*";
2607
2608 case ALIGN_INDIRECT_REF:
2609 return "A*";
2610
2611 case MISALIGNED_INDIRECT_REF:
2612 return "M*";
2613
2614 case TRUNC_DIV_EXPR:
2615 case RDIV_EXPR:
2616 return "/";
2617
2618 case CEIL_DIV_EXPR:
2619 return "/[cl]";
2620
2621 case FLOOR_DIV_EXPR:
2622 return "/[fl]";
2623
2624 case ROUND_DIV_EXPR:
2625 return "/[rd]";
2626
2627 case EXACT_DIV_EXPR:
2628 return "/[ex]";
2629
2630 case TRUNC_MOD_EXPR:
2631 return "%";
2632
2633 case CEIL_MOD_EXPR:
2634 return "%[cl]";
2635
2636 case FLOOR_MOD_EXPR:
2637 return "%[fl]";
2638
2639 case ROUND_MOD_EXPR:
2640 return "%[rd]";
2641
2642 case PREDECREMENT_EXPR:
2643 return " --";
2644
2645 case PREINCREMENT_EXPR:
2646 return " ++";
2647
2648 case POSTDECREMENT_EXPR:
2649 return "-- ";
2650
2651 case POSTINCREMENT_EXPR:
2652 return "++ ";
2653
2654 case MAX_EXPR:
2655 return "max";
2656
2657 case MIN_EXPR:
2658 return "min";
2659
2660 default:
2661 return "<<< ??? >>>";
2662 }
2663 }
2664
2665 /* Return the symbol associated with operator OP. */
2666
2667 static const char *
2668 op_symbol (const_tree op)
2669 {
2670 return op_symbol_code (TREE_CODE (op));
2671 }
2672
2673 /* Prints the name of a call. NODE is the CALL_EXPR_FN of a CALL_EXPR or
2674 the gimple_call_fn of a GIMPLE_CALL. */
2675
2676 void
2677 print_call_name (pretty_printer *buffer, tree node, int flags)
2678 {
2679 tree op0 = node;
2680
2681 if (TREE_CODE (op0) == NON_LVALUE_EXPR)
2682 op0 = TREE_OPERAND (op0, 0);
2683
2684 again:
2685 switch (TREE_CODE (op0))
2686 {
2687 case VAR_DECL:
2688 case PARM_DECL:
2689 case FUNCTION_DECL:
2690 dump_function_name (buffer, op0, flags);
2691 break;
2692
2693 case ADDR_EXPR:
2694 case INDIRECT_REF:
2695 case NOP_EXPR:
2696 op0 = TREE_OPERAND (op0, 0);
2697 goto again;
2698
2699 case COND_EXPR:
2700 pp_string (buffer, "(");
2701 dump_generic_node (buffer, TREE_OPERAND (op0, 0), 0, flags, false);
2702 pp_string (buffer, ") ? ");
2703 dump_generic_node (buffer, TREE_OPERAND (op0, 1), 0, flags, false);
2704 pp_string (buffer, " : ");
2705 dump_generic_node (buffer, TREE_OPERAND (op0, 2), 0, flags, false);
2706 break;
2707
2708 case ARRAY_REF:
2709 if (TREE_CODE (TREE_OPERAND (op0, 0)) == VAR_DECL)
2710 dump_function_name (buffer, TREE_OPERAND (op0, 0), flags);
2711 else
2712 dump_generic_node (buffer, op0, 0, flags, false);
2713 break;
2714
2715 case COMPONENT_REF:
2716 case SSA_NAME:
2717 case OBJ_TYPE_REF:
2718 dump_generic_node (buffer, op0, 0, flags, false);
2719 break;
2720
2721 default:
2722 NIY;
2723 }
2724 }
2725
2726 /* Parses the string STR and replaces new-lines by '\n', tabs by '\t', ... */
2727
2728 static void
2729 pretty_print_string (pretty_printer *buffer, const char *str)
2730 {
2731 if (str == NULL)
2732 return;
2733
2734 while (*str)
2735 {
2736 switch (str[0])
2737 {
2738 case '\b':
2739 pp_string (buffer, "\\b");
2740 break;
2741
2742 case '\f':
2743 pp_string (buffer, "\\f");
2744 break;
2745
2746 case '\n':
2747 pp_string (buffer, "\\n");
2748 break;
2749
2750 case '\r':
2751 pp_string (buffer, "\\r");
2752 break;
2753
2754 case '\t':
2755 pp_string (buffer, "\\t");
2756 break;
2757
2758 case '\v':
2759 pp_string (buffer, "\\v");
2760 break;
2761
2762 case '\\':
2763 pp_string (buffer, "\\\\");
2764 break;
2765
2766 case '\"':
2767 pp_string (buffer, "\\\"");
2768 break;
2769
2770 case '\'':
2771 pp_string (buffer, "\\'");
2772 break;
2773
2774 /* No need to handle \0; the loop terminates on \0. */
2775
2776 case '\1':
2777 pp_string (buffer, "\\1");
2778 break;
2779
2780 case '\2':
2781 pp_string (buffer, "\\2");
2782 break;
2783
2784 case '\3':
2785 pp_string (buffer, "\\3");
2786 break;
2787
2788 case '\4':
2789 pp_string (buffer, "\\4");
2790 break;
2791
2792 case '\5':
2793 pp_string (buffer, "\\5");
2794 break;
2795
2796 case '\6':
2797 pp_string (buffer, "\\6");
2798 break;
2799
2800 case '\7':
2801 pp_string (buffer, "\\7");
2802 break;
2803
2804 default:
2805 pp_character (buffer, str[0]);
2806 break;
2807 }
2808 str++;
2809 }
2810 }
2811
2812 static void
2813 maybe_init_pretty_print (FILE *file)
2814 {
2815 if (!initialized)
2816 {
2817 pp_construct (&buffer, /* prefix */NULL, /* line-width */0);
2818 pp_needs_newline (&buffer) = true;
2819 pp_translate_identifiers (&buffer) = false;
2820 initialized = 1;
2821 }
2822
2823 buffer.buffer->stream = file;
2824 }
2825
2826 static void
2827 newline_and_indent (pretty_printer *buffer, int spc)
2828 {
2829 pp_newline (buffer);
2830 INDENT (spc);
2831 }
Sandbox for GRAPHITE tests