tree-optimization/113126 - vector extension compare optimization
[official-gcc.git] / gcc / print-rtl.cc
blobecb689f56a945c1d3a2f5614036926d787295018
1 /* Print RTL for GCC.
2 Copyright (C) 1987-2024 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file is compiled twice: once for the generator programs,
21 once for the compiler. */
22 #ifdef GENERATOR_FILE
23 #include "bconfig.h"
24 #else
25 #include "config.h"
26 #endif
28 #include "system.h"
29 #include "coretypes.h"
30 #include "tm.h"
31 #include "rtl.h"
33 /* These headers all define things which are not available in
34 generator programs. */
35 #ifndef GENERATOR_FILE
36 #include "alias.h"
37 #include "tree.h"
38 #include "basic-block.h"
39 #include "print-tree.h"
40 #include "flags.h"
41 #include "predict.h"
42 #include "function.h"
43 #include "cfg.h"
44 #include "basic-block.h"
45 #include "diagnostic.h"
46 #include "tree-pretty-print.h"
47 #include "alloc-pool.h"
48 #include "cselib.h"
49 #include "dumpfile.h" /* for dump_flags */
50 #include "dwarf2out.h"
51 #include "pretty-print.h"
52 #endif
54 #include "print-rtl.h"
55 #include "rtl-iter.h"
57 /* Disable warnings about quoting issues in the pp_xxx calls below
58 that (intentionally) don't follow GCC diagnostic conventions. */
59 #if __GNUC__ >= 10
60 # pragma GCC diagnostic push
61 # pragma GCC diagnostic ignored "-Wformat-diag"
62 #endif
64 /* String printed at beginning of each RTL when it is dumped.
65 This string is set to ASM_COMMENT_START when the RTL is dumped in
66 the assembly output file. */
67 const char *print_rtx_head = "";
69 #ifdef GENERATOR_FILE
70 /* These are defined from the .opt file when not used in generator
71 programs. */
73 /* Nonzero means suppress output of instruction numbers
74 in debugging dumps.
75 This must be defined here so that programs like gencodes can be linked. */
76 int flag_dump_unnumbered = 0;
78 /* Nonzero means suppress output of instruction numbers for previous
79 and next insns in debugging dumps.
80 This must be defined here so that programs like gencodes can be linked. */
81 int flag_dump_unnumbered_links = 0;
82 #endif
84 /* Constructor for rtx_writer. */
86 rtx_writer::rtx_writer (FILE *outf, int ind, bool simple, bool compact,
87 rtx_reuse_manager *reuse_manager ATTRIBUTE_UNUSED)
88 : m_outfile (outf), m_indent (ind), m_sawclose (false),
89 m_in_call_function_usage (false), m_simple (simple), m_compact (compact)
90 #ifndef GENERATOR_FILE
91 , m_rtx_reuse_manager (reuse_manager)
92 #endif
96 #ifndef GENERATOR_FILE
98 /* rtx_reuse_manager's ctor. */
100 rtx_reuse_manager::rtx_reuse_manager ()
101 : m_next_id (0)
105 /* Determine if X is of a kind suitable for dumping via reuse_rtx. */
107 static bool
108 uses_rtx_reuse_p (const_rtx x)
110 if (x == NULL)
111 return false;
113 switch (GET_CODE (x))
115 case DEBUG_EXPR:
116 case VALUE:
117 case SCRATCH:
118 return true;
120 /* We don't use reuse_rtx for consts. */
121 CASE_CONST_UNIQUE:
122 default:
123 return false;
127 /* Traverse X and its descendents, determining if we see any rtx more than
128 once. Any rtx suitable for "reuse_rtx" that is seen more than once is
129 assigned an ID. */
131 void
132 rtx_reuse_manager::preprocess (const_rtx x)
134 subrtx_iterator::array_type array;
135 FOR_EACH_SUBRTX (iter, array, x, NONCONST)
136 if (uses_rtx_reuse_p (*iter))
138 if (int *count = m_rtx_occurrence_count.get (*iter))
140 if (*(count++) == 1)
141 m_rtx_reuse_ids.put (*iter, m_next_id++);
143 else
144 m_rtx_occurrence_count.put (*iter, 1);
148 /* Return true iff X has been assigned a reuse ID. If it has,
149 and OUT is non-NULL, then write the reuse ID to *OUT. */
151 bool
152 rtx_reuse_manager::has_reuse_id (const_rtx x, int *out)
154 int *id = m_rtx_reuse_ids.get (x);
155 if (id)
157 if (out)
158 *out = *id;
159 return true;
161 else
162 return false;
165 /* Determine if set_seen_def has been called for the given reuse ID. */
167 bool
168 rtx_reuse_manager::seen_def_p (int reuse_id)
170 return bitmap_bit_p (m_defs_seen, reuse_id);
173 /* Record that the definition of the given reuse ID has been seen. */
175 void
176 rtx_reuse_manager::set_seen_def (int reuse_id)
178 bitmap_set_bit (m_defs_seen, reuse_id);
181 #endif /* #ifndef GENERATOR_FILE */
183 #ifndef GENERATOR_FILE
184 void
185 print_mem_expr (FILE *outfile, const_tree expr)
187 fputc (' ', outfile);
188 print_generic_expr (outfile, CONST_CAST_TREE (expr),
189 dump_flags | TDF_SLIM);
191 #endif
193 /* Print X to FILE. */
195 static void
196 print_poly_int (FILE *file, poly_int64 x)
198 HOST_WIDE_INT const_x;
199 if (x.is_constant (&const_x))
200 fprintf (file, HOST_WIDE_INT_PRINT_DEC, const_x);
201 else
203 fprintf (file, "[" HOST_WIDE_INT_PRINT_DEC, x.coeffs[0]);
204 for (int i = 1; i < NUM_POLY_INT_COEFFS; ++i)
205 fprintf (file, ", " HOST_WIDE_INT_PRINT_DEC, x.coeffs[i]);
206 fprintf (file, "]");
210 /* Subroutine of print_rtx_operand for handling code '0'.
211 0 indicates a field for internal use that should not be printed.
212 However there are various special cases, such as the third field
213 of a NOTE, where it indicates that the field has several different
214 valid contents. */
216 void
217 rtx_writer::print_rtx_operand_code_0 (const_rtx in_rtx ATTRIBUTE_UNUSED,
218 int idx ATTRIBUTE_UNUSED)
220 #ifndef GENERATOR_FILE
221 if (idx == 1 && GET_CODE (in_rtx) == SYMBOL_REF)
223 int flags = SYMBOL_REF_FLAGS (in_rtx);
224 if (flags)
225 fprintf (m_outfile, " [flags %#x]", flags);
226 tree decl = SYMBOL_REF_DECL (in_rtx);
227 if (decl)
228 print_node_brief (m_outfile, "", decl, dump_flags);
230 else if (idx == 3 && NOTE_P (in_rtx))
232 switch (NOTE_KIND (in_rtx))
234 case NOTE_INSN_EH_REGION_BEG:
235 case NOTE_INSN_EH_REGION_END:
236 if (flag_dump_unnumbered)
237 fprintf (m_outfile, " #");
238 else
239 fprintf (m_outfile, " %d", NOTE_EH_HANDLER (in_rtx));
240 m_sawclose = true;
241 break;
243 case NOTE_INSN_BLOCK_BEG:
244 case NOTE_INSN_BLOCK_END:
245 dump_addr (m_outfile, " ", NOTE_BLOCK (in_rtx));
246 m_sawclose = true;
247 break;
249 case NOTE_INSN_BASIC_BLOCK:
251 basic_block bb = NOTE_BASIC_BLOCK (in_rtx);
252 if (bb != 0)
253 fprintf (m_outfile, " [bb %d]", bb->index);
254 break;
257 case NOTE_INSN_DELETED_LABEL:
258 case NOTE_INSN_DELETED_DEBUG_LABEL:
260 const char *label = NOTE_DELETED_LABEL_NAME (in_rtx);
261 if (label)
262 fprintf (m_outfile, " (\"%s\")", label);
263 else
264 fprintf (m_outfile, " \"\"");
266 break;
268 case NOTE_INSN_SWITCH_TEXT_SECTIONS:
270 basic_block bb = NOTE_BASIC_BLOCK (in_rtx);
271 if (bb != 0)
272 fprintf (m_outfile, " [bb %d]", bb->index);
273 break;
276 case NOTE_INSN_VAR_LOCATION:
277 fputc (' ', m_outfile);
278 print_rtx (NOTE_VAR_LOCATION (in_rtx));
279 break;
281 case NOTE_INSN_CFI:
282 fputc ('\n', m_outfile);
283 output_cfi_directive (m_outfile, NOTE_CFI (in_rtx));
284 fputc ('\t', m_outfile);
285 break;
287 case NOTE_INSN_BEGIN_STMT:
288 case NOTE_INSN_INLINE_ENTRY:
289 #ifndef GENERATOR_FILE
291 expanded_location xloc
292 = expand_location (NOTE_MARKER_LOCATION (in_rtx));
293 fprintf (m_outfile, " %s:%i", xloc.file, xloc.line);
295 #endif
296 break;
298 default:
299 break;
302 else if (idx == 7 && JUMP_P (in_rtx) && JUMP_LABEL (in_rtx) != NULL
303 && !m_compact)
305 /* Output the JUMP_LABEL reference. */
306 fprintf (m_outfile, "\n%s%*s -> ", print_rtx_head, m_indent * 2, "");
307 if (GET_CODE (JUMP_LABEL (in_rtx)) == RETURN)
308 fprintf (m_outfile, "return");
309 else if (GET_CODE (JUMP_LABEL (in_rtx)) == SIMPLE_RETURN)
310 fprintf (m_outfile, "simple_return");
311 else
312 fprintf (m_outfile, "%d", INSN_UID (JUMP_LABEL (in_rtx)));
314 else if (idx == 0 && GET_CODE (in_rtx) == VALUE)
316 cselib_val *val = CSELIB_VAL_PTR (in_rtx);
318 fprintf (m_outfile, " %u:%u", val->uid, val->hash);
319 dump_addr (m_outfile, " @", in_rtx);
320 dump_addr (m_outfile, "/", (void*)val);
322 else if (idx == 0 && GET_CODE (in_rtx) == DEBUG_EXPR)
324 fprintf (m_outfile, " D#%i",
325 DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (in_rtx)));
327 else if (idx == 0 && GET_CODE (in_rtx) == ENTRY_VALUE)
329 m_indent += 2;
330 if (!m_sawclose)
331 fprintf (m_outfile, " ");
332 print_rtx (ENTRY_VALUE_EXP (in_rtx));
333 m_indent -= 2;
335 #endif
338 /* Subroutine of print_rtx_operand for handling code 'e'.
339 Also called by print_rtx_operand_code_u for handling code 'u'
340 for LABEL_REFs when they don't reference a CODE_LABEL. */
342 void
343 rtx_writer::print_rtx_operand_code_e (const_rtx in_rtx, int idx)
345 m_indent += 2;
346 if (idx == 6 && INSN_P (in_rtx))
347 /* Put REG_NOTES on their own line. */
348 fprintf (m_outfile, "\n%s%*s",
349 print_rtx_head, m_indent * 2, "");
350 if (!m_sawclose)
351 fprintf (m_outfile, " ");
352 if (idx == 7 && CALL_P (in_rtx))
354 m_in_call_function_usage = true;
355 print_rtx (XEXP (in_rtx, idx));
356 m_in_call_function_usage = false;
358 else
359 print_rtx (XEXP (in_rtx, idx));
360 m_indent -= 2;
363 /* Subroutine of print_rtx_operand for handling codes 'E' and 'V'. */
365 void
366 rtx_writer::print_rtx_operand_codes_E_and_V (const_rtx in_rtx, int idx)
368 m_indent += 2;
369 if (m_sawclose)
371 fprintf (m_outfile, "\n%s%*s",
372 print_rtx_head, m_indent * 2, "");
373 m_sawclose = false;
375 if (GET_CODE (in_rtx) == CONST_VECTOR
376 && !GET_MODE_NUNITS (GET_MODE (in_rtx)).is_constant ()
377 && CONST_VECTOR_DUPLICATE_P (in_rtx))
378 fprintf (m_outfile, " repeat");
379 fputs (" [", m_outfile);
380 if (XVEC (in_rtx, idx) != NULL)
382 m_indent += 2;
383 if (XVECLEN (in_rtx, idx))
384 m_sawclose = true;
386 int barrier = XVECLEN (in_rtx, idx);
387 if (GET_CODE (in_rtx) == CONST_VECTOR
388 && !GET_MODE_NUNITS (GET_MODE (in_rtx)).is_constant ())
389 barrier = CONST_VECTOR_NPATTERNS (in_rtx);
391 for (int j = 0; j < XVECLEN (in_rtx, idx); j++)
393 int j1;
395 if (j == barrier)
397 fprintf (m_outfile, "\n%s%*s",
398 print_rtx_head, m_indent * 2, "");
399 if (!CONST_VECTOR_STEPPED_P (in_rtx))
400 fprintf (m_outfile, "repeat [");
401 else if (CONST_VECTOR_NPATTERNS (in_rtx) == 1)
402 fprintf (m_outfile, "stepped [");
403 else
404 fprintf (m_outfile, "stepped (interleave %d) [",
405 CONST_VECTOR_NPATTERNS (in_rtx));
406 m_indent += 2;
409 print_rtx (XVECEXP (in_rtx, idx, j));
410 int limit = MIN (barrier, XVECLEN (in_rtx, idx));
411 for (j1 = j + 1; j1 < limit; j1++)
412 if (XVECEXP (in_rtx, idx, j) != XVECEXP (in_rtx, idx, j1))
413 break;
415 if (j1 != j + 1)
417 fprintf (m_outfile, " repeated x%i", j1 - j);
418 j = j1 - 1;
422 if (barrier < XVECLEN (in_rtx, idx))
424 m_indent -= 2;
425 fprintf (m_outfile, "\n%s%*s]", print_rtx_head, m_indent * 2, "");
428 m_indent -= 2;
430 if (m_sawclose)
431 fprintf (m_outfile, "\n%s%*s", print_rtx_head, m_indent * 2, "");
433 fputs ("]", m_outfile);
434 m_sawclose = true;
435 m_indent -= 2;
438 /* Subroutine of print_rtx_operand for handling code 'i'. */
440 void
441 rtx_writer::print_rtx_operand_code_i (const_rtx in_rtx, int idx)
443 if (idx == 4 && INSN_P (in_rtx))
445 #ifndef GENERATOR_FILE
446 const rtx_insn *in_insn = as_a <const rtx_insn *> (in_rtx);
448 /* Pretty-print insn locations. Ignore scoping as it is mostly
449 redundant with line number information and do not print anything
450 when there is no location information available. */
451 if (INSN_HAS_LOCATION (in_insn))
453 expanded_location xloc = insn_location (in_insn);
454 fprintf (m_outfile, " \"%s\":%i:%i", xloc.file, xloc.line,
455 xloc.column);
456 int discriminator = insn_discriminator (in_insn);
457 if (discriminator)
458 fprintf (m_outfile, " discrim %d", discriminator);
461 #endif
463 else if (idx == 6 && GET_CODE (in_rtx) == ASM_OPERANDS)
465 #ifndef GENERATOR_FILE
466 if (ASM_OPERANDS_SOURCE_LOCATION (in_rtx) != UNKNOWN_LOCATION)
467 fprintf (m_outfile, " %s:%i",
468 LOCATION_FILE (ASM_OPERANDS_SOURCE_LOCATION (in_rtx)),
469 LOCATION_LINE (ASM_OPERANDS_SOURCE_LOCATION (in_rtx)));
470 #endif
472 else if (idx == 1 && GET_CODE (in_rtx) == ASM_INPUT)
474 #ifndef GENERATOR_FILE
475 if (ASM_INPUT_SOURCE_LOCATION (in_rtx) != UNKNOWN_LOCATION)
476 fprintf (m_outfile, " %s:%i",
477 LOCATION_FILE (ASM_INPUT_SOURCE_LOCATION (in_rtx)),
478 LOCATION_LINE (ASM_INPUT_SOURCE_LOCATION (in_rtx)));
479 #endif
481 else if (idx == 5 && NOTE_P (in_rtx))
483 /* This field is only used for NOTE_INSN_DELETED_LABEL, and
484 other times often contains garbage from INSN->NOTE death. */
485 if (NOTE_KIND (in_rtx) == NOTE_INSN_DELETED_LABEL
486 || NOTE_KIND (in_rtx) == NOTE_INSN_DELETED_DEBUG_LABEL)
487 fprintf (m_outfile, " %d", XINT (in_rtx, idx));
489 #if !defined(GENERATOR_FILE) && NUM_UNSPECV_VALUES > 0
490 else if (idx == 1
491 && GET_CODE (in_rtx) == UNSPEC_VOLATILE
492 && XINT (in_rtx, 1) >= 0
493 && XINT (in_rtx, 1) < NUM_UNSPECV_VALUES)
494 fprintf (m_outfile, " %s", unspecv_strings[XINT (in_rtx, 1)]);
495 #endif
496 #if !defined(GENERATOR_FILE) && NUM_UNSPEC_VALUES > 0
497 else if (idx == 1
498 && (GET_CODE (in_rtx) == UNSPEC
499 || GET_CODE (in_rtx) == UNSPEC_VOLATILE)
500 && XINT (in_rtx, 1) >= 0
501 && XINT (in_rtx, 1) < NUM_UNSPEC_VALUES)
502 fprintf (m_outfile, " %s", unspec_strings[XINT (in_rtx, 1)]);
503 #endif
504 else
506 int value = XINT (in_rtx, idx);
507 const char *name;
508 int is_insn = INSN_P (in_rtx);
510 /* Don't print INSN_CODEs in compact mode. */
511 if (m_compact && is_insn && &INSN_CODE (in_rtx) == &XINT (in_rtx, idx))
513 m_sawclose = false;
514 return;
517 if (flag_dump_unnumbered
518 && (is_insn || NOTE_P (in_rtx)))
519 fputc ('#', m_outfile);
520 else
521 fprintf (m_outfile, " %d", value);
523 if (is_insn && &INSN_CODE (in_rtx) == &XINT (in_rtx, idx)
524 && XINT (in_rtx, idx) >= 0
525 && (name = get_insn_name (XINT (in_rtx, idx))) != NULL)
526 fprintf (m_outfile, " {%s}", name);
527 m_sawclose = false;
531 /* Subroutine of print_rtx_operand for handling code 'r'. */
533 void
534 rtx_writer::print_rtx_operand_code_r (const_rtx in_rtx)
536 int is_insn = INSN_P (in_rtx);
537 unsigned int regno = REGNO (in_rtx);
539 #ifndef GENERATOR_FILE
540 /* For hard registers and virtuals, always print the
541 regno, except in compact mode. */
542 if (regno <= LAST_VIRTUAL_REGISTER && !m_compact)
543 fprintf (m_outfile, " %d", regno);
544 if (regno < FIRST_PSEUDO_REGISTER)
545 fprintf (m_outfile, " %s", reg_names[regno]);
546 else if (regno <= LAST_VIRTUAL_REGISTER)
548 if (regno == VIRTUAL_INCOMING_ARGS_REGNUM)
549 fprintf (m_outfile, " virtual-incoming-args");
550 else if (regno == VIRTUAL_STACK_VARS_REGNUM)
551 fprintf (m_outfile, " virtual-stack-vars");
552 else if (regno == VIRTUAL_STACK_DYNAMIC_REGNUM)
553 fprintf (m_outfile, " virtual-stack-dynamic");
554 else if (regno == VIRTUAL_OUTGOING_ARGS_REGNUM)
555 fprintf (m_outfile, " virtual-outgoing-args");
556 else if (regno == VIRTUAL_CFA_REGNUM)
557 fprintf (m_outfile, " virtual-cfa");
558 else if (regno == VIRTUAL_PREFERRED_STACK_BOUNDARY_REGNUM)
559 fprintf (m_outfile, " virtual-preferred-stack-boundary");
560 else
561 fprintf (m_outfile, " virtual-reg-%d", regno-FIRST_VIRTUAL_REGISTER);
563 else
564 #endif
565 if (flag_dump_unnumbered && is_insn)
566 fputc ('#', m_outfile);
567 else if (m_compact)
569 /* In compact mode, print pseudos with '< and '>' wrapping the regno,
570 offseting it by (LAST_VIRTUAL_REGISTER + 1), so that the
571 first non-virtual pseudo is dumped as "<0>". */
572 gcc_assert (regno > LAST_VIRTUAL_REGISTER);
573 fprintf (m_outfile, " <%d>", regno - (LAST_VIRTUAL_REGISTER + 1));
575 else
576 fprintf (m_outfile, " %d", regno);
578 #ifndef GENERATOR_FILE
579 if (REG_ATTRS (in_rtx))
581 fputs (" [", m_outfile);
582 if (regno != ORIGINAL_REGNO (in_rtx))
583 fprintf (m_outfile, "orig:%i", ORIGINAL_REGNO (in_rtx));
584 if (REG_EXPR (in_rtx))
585 print_mem_expr (m_outfile, REG_EXPR (in_rtx));
587 if (maybe_ne (REG_OFFSET (in_rtx), 0))
589 fprintf (m_outfile, "+");
590 print_poly_int (m_outfile, REG_OFFSET (in_rtx));
592 fputs (" ]", m_outfile);
594 if (regno != ORIGINAL_REGNO (in_rtx))
595 fprintf (m_outfile, " [%d]", ORIGINAL_REGNO (in_rtx));
596 #endif
599 /* Subroutine of print_rtx_operand for handling code 'u'. */
601 void
602 rtx_writer::print_rtx_operand_code_u (const_rtx in_rtx, int idx)
604 /* Don't print insn UIDs for PREV/NEXT_INSN in compact mode. */
605 if (m_compact && INSN_CHAIN_CODE_P (GET_CODE (in_rtx)) && idx < 2)
606 return;
608 if (XEXP (in_rtx, idx) != NULL)
610 rtx sub = XEXP (in_rtx, idx);
611 enum rtx_code subc = GET_CODE (sub);
613 if (GET_CODE (in_rtx) == LABEL_REF)
615 if (subc == NOTE
616 && NOTE_KIND (sub) == NOTE_INSN_DELETED_LABEL)
618 if (flag_dump_unnumbered)
619 fprintf (m_outfile, " [# deleted]");
620 else
621 fprintf (m_outfile, " [%d deleted]", INSN_UID (sub));
622 m_sawclose = false;
623 return;
626 if (subc != CODE_LABEL)
628 print_rtx_operand_code_e (in_rtx, idx);
629 return;
633 if (flag_dump_unnumbered
634 || (flag_dump_unnumbered_links && idx <= 1
635 && (INSN_P (in_rtx) || NOTE_P (in_rtx)
636 || LABEL_P (in_rtx) || BARRIER_P (in_rtx))))
637 fputs (" #", m_outfile);
638 else
639 fprintf (m_outfile, " %d", INSN_UID (sub));
641 else
642 fputs (" 0", m_outfile);
643 m_sawclose = false;
646 /* Subroutine of print_rtx. Print operand IDX of IN_RTX. */
648 void
649 rtx_writer::print_rtx_operand (const_rtx in_rtx, int idx)
651 const char *format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
653 switch (format_ptr[idx])
655 const char *str;
657 case 'T':
658 str = XTMPL (in_rtx, idx);
659 goto string;
661 case 'S':
662 case 's':
663 str = XSTR (in_rtx, idx);
664 string:
666 if (str == 0)
667 fputs (" (nil)", m_outfile);
668 else
669 fprintf (m_outfile, " (\"%s\")", str);
670 m_sawclose = true;
671 break;
673 case '0':
674 print_rtx_operand_code_0 (in_rtx, idx);
675 break;
677 case 'e':
678 print_rtx_operand_code_e (in_rtx, idx);
679 break;
681 case 'E':
682 case 'V':
683 print_rtx_operand_codes_E_and_V (in_rtx, idx);
684 break;
686 case 'w':
687 if (! m_simple)
688 fprintf (m_outfile, " ");
689 fprintf (m_outfile, HOST_WIDE_INT_PRINT_DEC, XWINT (in_rtx, idx));
690 if (! m_simple && !m_compact)
691 fprintf (m_outfile, " [" HOST_WIDE_INT_PRINT_HEX "]",
692 (unsigned HOST_WIDE_INT) XWINT (in_rtx, idx));
693 break;
695 case 'i':
696 print_rtx_operand_code_i (in_rtx, idx);
697 break;
699 case 'p':
700 fprintf (m_outfile, " ");
701 print_poly_int (m_outfile, SUBREG_BYTE (in_rtx));
702 break;
704 case 'r':
705 print_rtx_operand_code_r (in_rtx);
706 break;
708 /* Print NOTE_INSN names rather than integer codes. */
710 case 'n':
711 fprintf (m_outfile, " %s", GET_NOTE_INSN_NAME (XINT (in_rtx, idx)));
712 m_sawclose = false;
713 break;
715 case 'u':
716 print_rtx_operand_code_u (in_rtx, idx);
717 break;
719 case 't':
720 #ifndef GENERATOR_FILE
721 if (idx == 0 && GET_CODE (in_rtx) == DEBUG_IMPLICIT_PTR)
722 print_mem_expr (m_outfile, DEBUG_IMPLICIT_PTR_DECL (in_rtx));
723 else if (idx == 0 && GET_CODE (in_rtx) == DEBUG_PARAMETER_REF)
724 print_mem_expr (m_outfile, DEBUG_PARAMETER_REF_DECL (in_rtx));
725 else
726 dump_addr (m_outfile, " ", XTREE (in_rtx, idx));
727 #endif
728 break;
730 case '*':
731 fputs (" Unknown", m_outfile);
732 m_sawclose = false;
733 break;
735 case 'B':
736 /* Don't print basic block ids in compact mode. */
737 if (m_compact)
738 break;
739 #ifndef GENERATOR_FILE
740 if (XBBDEF (in_rtx, idx))
741 fprintf (m_outfile, " %i", XBBDEF (in_rtx, idx)->index);
742 #endif
743 break;
745 default:
746 gcc_unreachable ();
750 /* Subroutine of rtx_writer::print_rtx.
751 In compact mode, determine if operand IDX of IN_RTX is interesting
752 to dump, or (if in a trailing position) it can be omitted. */
754 bool
755 rtx_writer::operand_has_default_value_p (const_rtx in_rtx, int idx)
757 const char *format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
759 switch (format_ptr[idx])
761 case 'e':
762 case 'u':
763 return XEXP (in_rtx, idx) == NULL_RTX;
765 case 's':
766 return XSTR (in_rtx, idx) == NULL;
768 case '0':
769 switch (GET_CODE (in_rtx))
771 case JUMP_INSN:
772 /* JUMP_LABELs are always omitted in compact mode, so treat
773 any value here as omittable, so that earlier operands can
774 potentially be omitted also. */
775 return m_compact;
777 default:
778 return false;
782 default:
783 return false;
787 /* Print IN_RTX onto m_outfile. This is the recursive part of printing. */
789 void
790 rtx_writer::print_rtx (const_rtx in_rtx)
792 int idx = 0;
794 if (m_sawclose)
796 if (m_simple)
797 fputc (' ', m_outfile);
798 else
799 fprintf (m_outfile, "\n%s%*s", print_rtx_head, m_indent * 2, "");
800 m_sawclose = false;
803 if (in_rtx == 0)
805 fputs ("(nil)", m_outfile);
806 m_sawclose = true;
807 return;
809 else if (GET_CODE (in_rtx) > NUM_RTX_CODE)
811 fprintf (m_outfile, "(??? bad code %d\n%s%*s)", GET_CODE (in_rtx),
812 print_rtx_head, m_indent * 2, "");
813 m_sawclose = true;
814 return;
817 fputc ('(', m_outfile);
819 /* Print name of expression code. */
821 /* Handle reuse. */
822 #ifndef GENERATOR_FILE
823 if (m_rtx_reuse_manager)
825 int reuse_id;
826 if (m_rtx_reuse_manager->has_reuse_id (in_rtx, &reuse_id))
828 /* Have we already seen the defn of this rtx? */
829 if (m_rtx_reuse_manager->seen_def_p (reuse_id))
831 fprintf (m_outfile, "reuse_rtx %i)", reuse_id);
832 m_sawclose = true;
833 return;
835 else
837 /* First time we've seen this reused-rtx. */
838 fprintf (m_outfile, "%i|", reuse_id);
839 m_rtx_reuse_manager->set_seen_def (reuse_id);
843 #endif /* #ifndef GENERATOR_FILE */
845 /* In compact mode, prefix the code of insns with "c",
846 giving "cinsn", "cnote" etc. */
847 if (m_compact && is_a <const rtx_insn *, const struct rtx_def> (in_rtx))
849 /* "ccode_label" is slightly awkward, so special-case it as
850 just "clabel". */
851 rtx_code code = GET_CODE (in_rtx);
852 if (code == CODE_LABEL)
853 fprintf (m_outfile, "clabel");
854 else
855 fprintf (m_outfile, "c%s", GET_RTX_NAME (code));
857 else if (m_simple && CONST_INT_P (in_rtx))
858 ; /* no code. */
859 else
860 fprintf (m_outfile, "%s", GET_RTX_NAME (GET_CODE (in_rtx)));
862 if (! m_simple)
864 if (RTX_FLAG (in_rtx, in_struct))
865 fputs ("/s", m_outfile);
867 if (RTX_FLAG (in_rtx, volatil))
868 fputs ("/v", m_outfile);
870 if (RTX_FLAG (in_rtx, unchanging))
871 fputs ("/u", m_outfile);
873 if (RTX_FLAG (in_rtx, frame_related))
874 fputs ("/f", m_outfile);
876 if (RTX_FLAG (in_rtx, jump))
877 fputs ("/j", m_outfile);
879 if (RTX_FLAG (in_rtx, call))
880 fputs ("/c", m_outfile);
882 if (RTX_FLAG (in_rtx, return_val))
883 fputs ("/i", m_outfile);
885 /* Print REG_NOTE names for EXPR_LIST and INSN_LIST. */
886 if ((GET_CODE (in_rtx) == EXPR_LIST
887 || GET_CODE (in_rtx) == INSN_LIST
888 || GET_CODE (in_rtx) == INT_LIST)
889 && (int)GET_MODE (in_rtx) < REG_NOTE_MAX
890 && !m_in_call_function_usage)
891 fprintf (m_outfile, ":%s",
892 GET_REG_NOTE_NAME (GET_MODE (in_rtx)));
894 /* For other rtl, print the mode if it's not VOID. */
895 else if (GET_MODE (in_rtx) != VOIDmode)
896 fprintf (m_outfile, ":%s", GET_MODE_NAME (GET_MODE (in_rtx)));
898 #ifndef GENERATOR_FILE
899 if (GET_CODE (in_rtx) == VAR_LOCATION)
901 if (TREE_CODE (PAT_VAR_LOCATION_DECL (in_rtx)) == STRING_CST)
902 fputs (" <debug string placeholder>", m_outfile);
903 else
904 print_mem_expr (m_outfile, PAT_VAR_LOCATION_DECL (in_rtx));
905 fputc (' ', m_outfile);
906 print_rtx (PAT_VAR_LOCATION_LOC (in_rtx));
907 if (PAT_VAR_LOCATION_STATUS (in_rtx)
908 == VAR_INIT_STATUS_UNINITIALIZED)
909 fprintf (m_outfile, " [uninit]");
910 m_sawclose = true;
911 idx = GET_RTX_LENGTH (VAR_LOCATION);
913 #endif
916 #ifndef GENERATOR_FILE
917 if (CONST_DOUBLE_AS_FLOAT_P (in_rtx))
918 idx = 5;
919 #endif
921 /* For insns, print the INSN_UID. */
922 if (INSN_CHAIN_CODE_P (GET_CODE (in_rtx)))
924 if (flag_dump_unnumbered)
925 fprintf (m_outfile, " #");
926 else
927 fprintf (m_outfile, " %d", INSN_UID (in_rtx));
930 /* Determine which is the final operand to print.
931 In compact mode, skip trailing operands that have the default values
932 e.g. trailing "(nil)" values. */
933 int limit = GET_RTX_LENGTH (GET_CODE (in_rtx));
934 if (m_compact)
935 while (limit > idx && operand_has_default_value_p (in_rtx, limit - 1))
936 limit--;
938 /* Get the format string and skip the first elements if we have handled
939 them already. */
941 for (; idx < limit; idx++)
942 print_rtx_operand (in_rtx, idx);
944 switch (GET_CODE (in_rtx))
946 #ifndef GENERATOR_FILE
947 case MEM:
948 if (UNLIKELY (final_insns_dump_p))
949 fprintf (m_outfile, " [");
950 else
951 fprintf (m_outfile, " [" HOST_WIDE_INT_PRINT_DEC,
952 (HOST_WIDE_INT) MEM_ALIAS_SET (in_rtx));
954 if (MEM_EXPR (in_rtx))
955 print_mem_expr (m_outfile, MEM_EXPR (in_rtx));
956 else
957 fputc (' ', m_outfile);
959 if (MEM_OFFSET_KNOWN_P (in_rtx))
961 fprintf (m_outfile, "+");
962 print_poly_int (m_outfile, MEM_OFFSET (in_rtx));
965 if (MEM_SIZE_KNOWN_P (in_rtx))
967 fprintf (m_outfile, " S");
968 print_poly_int (m_outfile, MEM_SIZE (in_rtx));
971 if (MEM_ALIGN (in_rtx) != 1)
972 fprintf (m_outfile, " A%u", MEM_ALIGN (in_rtx));
974 if (!ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (in_rtx)))
975 fprintf (m_outfile, " AS%u", MEM_ADDR_SPACE (in_rtx));
977 fputc (']', m_outfile);
978 break;
980 case CONST_DOUBLE:
981 if (FLOAT_MODE_P (GET_MODE (in_rtx)))
983 char s[60];
985 real_to_decimal (s, CONST_DOUBLE_REAL_VALUE (in_rtx),
986 sizeof (s), 0, 1);
987 fprintf (m_outfile, " %s", s);
989 real_to_hexadecimal (s, CONST_DOUBLE_REAL_VALUE (in_rtx),
990 sizeof (s), 0, 1);
991 fprintf (m_outfile, " [%s]", s);
993 break;
995 case CONST_WIDE_INT:
996 fprintf (m_outfile, " ");
997 cwi_output_hex (m_outfile, in_rtx);
998 break;
1000 case CONST_POLY_INT:
1001 fprintf (m_outfile, " [");
1002 print_dec (CONST_POLY_INT_COEFFS (in_rtx)[0], m_outfile, SIGNED);
1003 for (unsigned int i = 1; i < NUM_POLY_INT_COEFFS; ++i)
1005 fprintf (m_outfile, ", ");
1006 print_dec (CONST_POLY_INT_COEFFS (in_rtx)[i], m_outfile, SIGNED);
1008 fprintf (m_outfile, "]");
1009 break;
1010 #endif
1012 case CODE_LABEL:
1013 if (!m_compact)
1014 fprintf (m_outfile, " [%d uses]", LABEL_NUSES (in_rtx));
1015 switch (LABEL_KIND (in_rtx))
1017 case LABEL_NORMAL: break;
1018 case LABEL_STATIC_ENTRY: fputs (" [entry]", m_outfile); break;
1019 case LABEL_GLOBAL_ENTRY: fputs (" [global entry]", m_outfile); break;
1020 case LABEL_WEAK_ENTRY: fputs (" [weak entry]", m_outfile); break;
1021 default: gcc_unreachable ();
1023 break;
1025 default:
1026 break;
1029 fputc (')', m_outfile);
1030 m_sawclose = true;
1033 /* Emit a closing parenthesis and newline. */
1035 void
1036 rtx_writer::finish_directive ()
1038 fprintf (m_outfile, ")\n");
1039 m_sawclose = false;
1042 /* Print an rtx on the current line of FILE. Initially indent IND
1043 characters. */
1045 void
1046 print_inline_rtx (FILE *outf, const_rtx x, int ind)
1048 rtx_writer w (outf, ind, false, false, NULL);
1049 w.print_rtx (x);
1052 /* Call this function from the debugger to see what X looks like. */
1054 DEBUG_FUNCTION void
1055 debug_rtx (const_rtx x)
1057 rtx_writer w (stderr, 0, false, false, NULL);
1058 w.print_rtx (x);
1059 fprintf (stderr, "\n");
1062 /* Dump rtx REF. */
1064 DEBUG_FUNCTION void
1065 debug (const rtx_def &ref)
1067 debug_rtx (&ref);
1070 DEBUG_FUNCTION void
1071 debug (const rtx_def *ptr)
1073 if (ptr)
1074 debug (*ptr);
1075 else
1076 fprintf (stderr, "<nil>\n");
1079 /* Like debug_rtx but with no newline, as debug_helper will add one.
1081 Note: No debug_slim(rtx_insn *) variant implemented, as this
1082 function can serve for both rtx and rtx_insn. */
1084 static void
1085 debug_slim (const_rtx x)
1087 rtx_writer w (stderr, 0, false, false, NULL);
1088 w.print_rtx (x);
1091 DEFINE_DEBUG_VEC (rtx_def *)
1092 DEFINE_DEBUG_VEC (rtx_insn *)
1093 DEFINE_DEBUG_HASH_SET (rtx_def *)
1094 DEFINE_DEBUG_HASH_SET (rtx_insn *)
1096 /* Count of rtx's to print with debug_rtx_list.
1097 This global exists because gdb user defined commands have no arguments. */
1099 DEBUG_VARIABLE int debug_rtx_count = 0; /* 0 is treated as equivalent to 1 */
1101 /* Call this function to print list from X on.
1103 N is a count of the rtx's to print. Positive values print from the specified
1104 rtx_insn on. Negative values print a window around the rtx_insn.
1105 EG: -5 prints 2 rtx_insn's on either side (in addition to the specified
1106 rtx_insn). */
1108 DEBUG_FUNCTION void
1109 debug_rtx_list (const rtx_insn *x, int n)
1111 int i,count;
1112 const rtx_insn *insn;
1114 count = n == 0 ? 1 : n < 0 ? -n : n;
1116 /* If we are printing a window, back up to the start. */
1118 if (n < 0)
1119 for (i = count / 2; i > 0; i--)
1121 if (PREV_INSN (x) == 0)
1122 break;
1123 x = PREV_INSN (x);
1126 for (i = count, insn = x; i > 0 && insn != 0; i--, insn = NEXT_INSN (insn))
1128 debug_rtx (insn);
1129 fprintf (stderr, "\n");
1133 /* Call this function to print an rtx_insn list from START to END
1134 inclusive. */
1136 DEBUG_FUNCTION void
1137 debug_rtx_range (const rtx_insn *start, const rtx_insn *end)
1139 while (1)
1141 debug_rtx (start);
1142 fprintf (stderr, "\n");
1143 if (!start || start == end)
1144 break;
1145 start = NEXT_INSN (start);
1149 /* Call this function to search an rtx_insn list to find one with insn uid UID,
1150 and then call debug_rtx_list to print it, using DEBUG_RTX_COUNT.
1151 The found insn is returned to enable further debugging analysis. */
1153 DEBUG_FUNCTION const rtx_insn *
1154 debug_rtx_find (const rtx_insn *x, int uid)
1156 while (x != 0 && INSN_UID (x) != uid)
1157 x = NEXT_INSN (x);
1158 if (x != 0)
1160 debug_rtx_list (x, debug_rtx_count);
1161 return x;
1163 else
1165 fprintf (stderr, "insn uid %d not found\n", uid);
1166 return 0;
1170 /* External entry point for printing a chain of insns
1171 starting with RTX_FIRST.
1172 A blank line separates insns.
1174 If RTX_FIRST is not an insn, then it alone is printed, with no newline. */
1176 void
1177 rtx_writer::print_rtl (const_rtx rtx_first)
1179 const rtx_insn *tmp_rtx;
1181 if (rtx_first == 0)
1183 fputs (print_rtx_head, m_outfile);
1184 fputs ("(nil)\n", m_outfile);
1186 else
1187 switch (GET_CODE (rtx_first))
1189 case INSN:
1190 case JUMP_INSN:
1191 case CALL_INSN:
1192 case NOTE:
1193 case CODE_LABEL:
1194 case JUMP_TABLE_DATA:
1195 case BARRIER:
1196 for (tmp_rtx = as_a <const rtx_insn *> (rtx_first);
1197 tmp_rtx != 0;
1198 tmp_rtx = NEXT_INSN (tmp_rtx))
1200 fputs (print_rtx_head, m_outfile);
1201 print_rtx (tmp_rtx);
1202 fprintf (m_outfile, "\n");
1204 break;
1206 default:
1207 fputs (print_rtx_head, m_outfile);
1208 print_rtx (rtx_first);
1212 /* External entry point for printing a chain of insns
1213 starting with RTX_FIRST onto file OUTF.
1214 A blank line separates insns.
1216 If RTX_FIRST is not an insn, then it alone is printed, with no newline. */
1218 void
1219 print_rtl (FILE *outf, const_rtx rtx_first)
1221 rtx_writer w (outf, 0, false, false, NULL);
1222 w.print_rtl (rtx_first);
1225 /* Like print_rtx, except specify a file. */
1227 void
1228 print_rtl_single (FILE *outf, const_rtx x)
1230 rtx_writer w (outf, 0, false, false, NULL);
1231 w.print_rtl_single_with_indent (x, 0);
1234 /* Like print_rtl_single, except specify an indentation. */
1236 void
1237 rtx_writer::print_rtl_single_with_indent (const_rtx x, int ind)
1239 char *s_indent = (char *) alloca ((size_t) ind + 1);
1240 memset ((void *) s_indent, ' ', (size_t) ind);
1241 s_indent[ind] = '\0';
1242 fputs (s_indent, m_outfile);
1243 fputs (print_rtx_head, m_outfile);
1245 int old_indent = m_indent;
1246 m_indent = ind;
1247 m_sawclose = false;
1248 print_rtx (x);
1249 putc ('\n', m_outfile);
1250 m_indent = old_indent;
1254 /* Like print_rtl except without all the detail; for example,
1255 if RTX is a CONST_INT then print in decimal format. */
1257 void
1258 print_simple_rtl (FILE *outf, const_rtx x)
1260 rtx_writer w (outf, 0, true, false, NULL);
1261 w.print_rtl (x);
1264 /* Print the elements of VEC to FILE. */
1266 void
1267 print_rtx_insn_vec (FILE *file, const vec<rtx_insn *> &vec)
1269 fputc('{', file);
1271 unsigned int len = vec.length ();
1272 for (unsigned int i = 0; i < len; i++)
1274 print_rtl_single (file, vec[i]);
1275 if (i < len - 1)
1276 fputs (", ", file);
1279 fputc ('}', file);
1282 #ifndef GENERATOR_FILE
1283 /* The functions below try to print RTL in a form resembling assembler
1284 mnemonics. Because this form is more concise than the "traditional" form
1285 of RTL printing in Lisp-style, the form printed by this file is called
1286 "slim". RTL dumps in slim format can be obtained by appending the "-slim"
1287 option to -fdump-rtl-<pass>. Control flow graph output as a DOT file is
1288 always printed in slim form.
1290 The normal interface to the functionality provided in this pretty-printer
1291 is through the dump_*_slim functions to print to a stream, or via the
1292 print_*_slim functions to print into a user's pretty-printer.
1294 It is also possible to obtain a string for a single pattern as a string
1295 pointer, via str_pattern_slim, but this usage is discouraged. */
1297 /* This recognizes rtx'en classified as expressions. These are always
1298 represent some action on values or results of other expression, that
1299 may be stored in objects representing values. */
1301 static void
1302 print_exp (pretty_printer *pp, const_rtx x, int verbose)
1304 const char *st[4];
1305 const char *fun;
1306 rtx op[4];
1307 int i;
1309 fun = (char *) 0;
1310 for (i = 0; i < 4; i++)
1312 st[i] = (char *) 0;
1313 op[i] = NULL_RTX;
1316 switch (GET_CODE (x))
1318 case PLUS:
1319 op[0] = XEXP (x, 0);
1320 if (CONST_INT_P (XEXP (x, 1))
1321 && INTVAL (XEXP (x, 1)) < 0)
1323 st[1] = "-";
1324 op[1] = GEN_INT (-INTVAL (XEXP (x, 1)));
1326 else
1328 st[1] = "+";
1329 op[1] = XEXP (x, 1);
1331 break;
1332 case LO_SUM:
1333 op[0] = XEXP (x, 0);
1334 st[1] = "+low(";
1335 op[1] = XEXP (x, 1);
1336 st[2] = ")";
1337 break;
1338 case MINUS:
1339 op[0] = XEXP (x, 0);
1340 st[1] = "-";
1341 op[1] = XEXP (x, 1);
1342 break;
1343 case COMPARE:
1344 fun = "cmp";
1345 op[0] = XEXP (x, 0);
1346 op[1] = XEXP (x, 1);
1347 break;
1348 case NEG:
1349 st[0] = "-";
1350 op[0] = XEXP (x, 0);
1351 break;
1352 case FMA:
1353 st[0] = "{";
1354 op[0] = XEXP (x, 0);
1355 st[1] = "*";
1356 op[1] = XEXP (x, 1);
1357 st[2] = "+";
1358 op[2] = XEXP (x, 2);
1359 st[3] = "}";
1360 break;
1361 case MULT:
1362 op[0] = XEXP (x, 0);
1363 st[1] = "*";
1364 op[1] = XEXP (x, 1);
1365 break;
1366 case DIV:
1367 op[0] = XEXP (x, 0);
1368 st[1] = "/";
1369 op[1] = XEXP (x, 1);
1370 break;
1371 case UDIV:
1372 fun = "udiv";
1373 op[0] = XEXP (x, 0);
1374 op[1] = XEXP (x, 1);
1375 break;
1376 case MOD:
1377 op[0] = XEXP (x, 0);
1378 st[1] = "%";
1379 op[1] = XEXP (x, 1);
1380 break;
1381 case UMOD:
1382 fun = "umod";
1383 op[0] = XEXP (x, 0);
1384 op[1] = XEXP (x, 1);
1385 break;
1386 case SMIN:
1387 fun = "smin";
1388 op[0] = XEXP (x, 0);
1389 op[1] = XEXP (x, 1);
1390 break;
1391 case SMAX:
1392 fun = "smax";
1393 op[0] = XEXP (x, 0);
1394 op[1] = XEXP (x, 1);
1395 break;
1396 case UMIN:
1397 fun = "umin";
1398 op[0] = XEXP (x, 0);
1399 op[1] = XEXP (x, 1);
1400 break;
1401 case UMAX:
1402 fun = "umax";
1403 op[0] = XEXP (x, 0);
1404 op[1] = XEXP (x, 1);
1405 break;
1406 case NOT:
1407 st[0] = "~";
1408 op[0] = XEXP (x, 0);
1409 break;
1410 case AND:
1411 op[0] = XEXP (x, 0);
1412 st[1] = "&";
1413 op[1] = XEXP (x, 1);
1414 break;
1415 case IOR:
1416 op[0] = XEXP (x, 0);
1417 st[1] = "|";
1418 op[1] = XEXP (x, 1);
1419 break;
1420 case XOR:
1421 op[0] = XEXP (x, 0);
1422 st[1] = "^";
1423 op[1] = XEXP (x, 1);
1424 break;
1425 case ASHIFT:
1426 op[0] = XEXP (x, 0);
1427 st[1] = "<<";
1428 op[1] = XEXP (x, 1);
1429 break;
1430 case LSHIFTRT:
1431 op[0] = XEXP (x, 0);
1432 st[1] = " 0>>";
1433 op[1] = XEXP (x, 1);
1434 break;
1435 case ASHIFTRT:
1436 op[0] = XEXP (x, 0);
1437 st[1] = ">>";
1438 op[1] = XEXP (x, 1);
1439 break;
1440 case ROTATE:
1441 op[0] = XEXP (x, 0);
1442 st[1] = "<-<";
1443 op[1] = XEXP (x, 1);
1444 break;
1445 case ROTATERT:
1446 op[0] = XEXP (x, 0);
1447 st[1] = ">->";
1448 op[1] = XEXP (x, 1);
1449 break;
1450 case NE:
1451 op[0] = XEXP (x, 0);
1452 st[1] = "!=";
1453 op[1] = XEXP (x, 1);
1454 break;
1455 case EQ:
1456 op[0] = XEXP (x, 0);
1457 st[1] = "==";
1458 op[1] = XEXP (x, 1);
1459 break;
1460 case GE:
1461 op[0] = XEXP (x, 0);
1462 st[1] = ">=";
1463 op[1] = XEXP (x, 1);
1464 break;
1465 case GT:
1466 op[0] = XEXP (x, 0);
1467 st[1] = ">";
1468 op[1] = XEXP (x, 1);
1469 break;
1470 case LE:
1471 op[0] = XEXP (x, 0);
1472 st[1] = "<=";
1473 op[1] = XEXP (x, 1);
1474 break;
1475 case LT:
1476 op[0] = XEXP (x, 0);
1477 st[1] = "<";
1478 op[1] = XEXP (x, 1);
1479 break;
1480 case SIGN_EXTRACT:
1481 fun = (verbose) ? "sign_extract" : "sxt";
1482 op[0] = XEXP (x, 0);
1483 op[1] = XEXP (x, 1);
1484 op[2] = XEXP (x, 2);
1485 break;
1486 case ZERO_EXTRACT:
1487 fun = (verbose) ? "zero_extract" : "zxt";
1488 op[0] = XEXP (x, 0);
1489 op[1] = XEXP (x, 1);
1490 op[2] = XEXP (x, 2);
1491 break;
1492 case SIGN_EXTEND:
1493 fun = (verbose) ? "sign_extend" : "sxn";
1494 op[0] = XEXP (x, 0);
1495 break;
1496 case ZERO_EXTEND:
1497 fun = (verbose) ? "zero_extend" : "zxn";
1498 op[0] = XEXP (x, 0);
1499 break;
1500 case FLOAT_EXTEND:
1501 fun = (verbose) ? "float_extend" : "fxn";
1502 op[0] = XEXP (x, 0);
1503 break;
1504 case TRUNCATE:
1505 fun = (verbose) ? "trunc" : "trn";
1506 op[0] = XEXP (x, 0);
1507 break;
1508 case FLOAT_TRUNCATE:
1509 fun = (verbose) ? "float_trunc" : "ftr";
1510 op[0] = XEXP (x, 0);
1511 break;
1512 case FLOAT:
1513 fun = (verbose) ? "float" : "flt";
1514 op[0] = XEXP (x, 0);
1515 break;
1516 case UNSIGNED_FLOAT:
1517 fun = (verbose) ? "uns_float" : "ufl";
1518 op[0] = XEXP (x, 0);
1519 break;
1520 case FIX:
1521 fun = "fix";
1522 op[0] = XEXP (x, 0);
1523 break;
1524 case UNSIGNED_FIX:
1525 fun = (verbose) ? "uns_fix" : "ufx";
1526 op[0] = XEXP (x, 0);
1527 break;
1528 case PRE_DEC:
1529 st[0] = "--";
1530 op[0] = XEXP (x, 0);
1531 break;
1532 case PRE_INC:
1533 st[0] = "++";
1534 op[0] = XEXP (x, 0);
1535 break;
1536 case POST_DEC:
1537 op[0] = XEXP (x, 0);
1538 st[1] = "--";
1539 break;
1540 case POST_INC:
1541 op[0] = XEXP (x, 0);
1542 st[1] = "++";
1543 break;
1544 case PRE_MODIFY:
1545 st[0] = "pre ";
1546 op[0] = XEXP (XEXP (x, 1), 0);
1547 st[1] = "+=";
1548 op[1] = XEXP (XEXP (x, 1), 1);
1549 break;
1550 case POST_MODIFY:
1551 st[0] = "post ";
1552 op[0] = XEXP (XEXP (x, 1), 0);
1553 st[1] = "+=";
1554 op[1] = XEXP (XEXP (x, 1), 1);
1555 break;
1556 case CALL:
1557 st[0] = "call ";
1558 op[0] = XEXP (x, 0);
1559 if (verbose)
1561 st[1] = " argc:";
1562 op[1] = XEXP (x, 1);
1564 break;
1565 case IF_THEN_ELSE:
1566 st[0] = "{(";
1567 op[0] = XEXP (x, 0);
1568 st[1] = ")?";
1569 op[1] = XEXP (x, 1);
1570 st[2] = ":";
1571 op[2] = XEXP (x, 2);
1572 st[3] = "}";
1573 break;
1574 case TRAP_IF:
1575 fun = "trap_if";
1576 op[0] = TRAP_CONDITION (x);
1577 break;
1578 case PREFETCH:
1579 fun = "prefetch";
1580 op[0] = XEXP (x, 0);
1581 op[1] = XEXP (x, 1);
1582 op[2] = XEXP (x, 2);
1583 break;
1584 case UNSPEC:
1585 case UNSPEC_VOLATILE:
1587 pp_string (pp, "unspec");
1588 if (GET_CODE (x) == UNSPEC_VOLATILE)
1589 pp_string (pp, "/v");
1590 pp_left_bracket (pp);
1591 for (i = 0; i < XVECLEN (x, 0); i++)
1593 if (i != 0)
1594 pp_comma (pp);
1595 print_pattern (pp, XVECEXP (x, 0, i), verbose);
1597 pp_string (pp, "] ");
1598 pp_decimal_int (pp, XINT (x, 1));
1600 break;
1601 default:
1603 /* Most unhandled codes can be printed as pseudo-functions. */
1604 if (GET_RTX_CLASS (GET_CODE (x)) == RTX_UNARY)
1606 fun = GET_RTX_NAME (GET_CODE (x));
1607 op[0] = XEXP (x, 0);
1609 else if (GET_RTX_CLASS (GET_CODE (x)) == RTX_COMPARE
1610 || GET_RTX_CLASS (GET_CODE (x)) == RTX_COMM_COMPARE
1611 || GET_RTX_CLASS (GET_CODE (x)) == RTX_BIN_ARITH
1612 || GET_RTX_CLASS (GET_CODE (x)) == RTX_COMM_ARITH)
1614 fun = GET_RTX_NAME (GET_CODE (x));
1615 op[0] = XEXP (x, 0);
1616 op[1] = XEXP (x, 1);
1618 else if (GET_RTX_CLASS (GET_CODE (x)) == RTX_TERNARY)
1620 fun = GET_RTX_NAME (GET_CODE (x));
1621 op[0] = XEXP (x, 0);
1622 op[1] = XEXP (x, 1);
1623 op[2] = XEXP (x, 2);
1625 else
1626 /* Give up, just print the RTX name. */
1627 st[0] = GET_RTX_NAME (GET_CODE (x));
1629 break;
1632 /* Print this as a function? */
1633 if (fun)
1635 pp_string (pp, fun);
1636 pp_left_paren (pp);
1639 for (i = 0; i < 4; i++)
1641 if (st[i])
1642 pp_string (pp, st[i]);
1644 if (op[i])
1646 if (fun && i != 0)
1647 pp_comma (pp);
1648 print_value (pp, op[i], verbose);
1652 if (fun)
1653 pp_right_paren (pp);
1654 } /* print_exp */
1656 /* Prints rtxes, I customarily classified as values. They're constants,
1657 registers, labels, symbols and memory accesses. */
1659 void
1660 print_value (pretty_printer *pp, const_rtx x, int verbose)
1662 char tmp[1024];
1664 if (!x)
1666 pp_string (pp, "(nil)");
1667 return;
1669 switch (GET_CODE (x))
1671 case CONST_INT:
1672 pp_scalar (pp, HOST_WIDE_INT_PRINT_HEX,
1673 (unsigned HOST_WIDE_INT) INTVAL (x));
1674 break;
1676 case CONST_WIDE_INT:
1678 const char *sep = "<";
1679 int i;
1680 for (i = CONST_WIDE_INT_NUNITS (x) - 1; i >= 0; i--)
1682 pp_string (pp, sep);
1683 sep = ",";
1684 sprintf (tmp, HOST_WIDE_INT_PRINT_HEX,
1685 (unsigned HOST_WIDE_INT) CONST_WIDE_INT_ELT (x, i));
1686 pp_string (pp, tmp);
1688 pp_greater (pp);
1690 break;
1692 case CONST_POLY_INT:
1693 pp_left_bracket (pp);
1694 pp_wide_int (pp, CONST_POLY_INT_COEFFS (x)[0], SIGNED);
1695 for (unsigned int i = 1; i < NUM_POLY_INT_COEFFS; ++i)
1697 pp_string (pp, ", ");
1698 pp_wide_int (pp, CONST_POLY_INT_COEFFS (x)[i], SIGNED);
1700 pp_right_bracket (pp);
1701 break;
1703 case CONST_DOUBLE:
1704 if (FLOAT_MODE_P (GET_MODE (x)))
1706 real_to_decimal (tmp, CONST_DOUBLE_REAL_VALUE (x),
1707 sizeof (tmp), 0, 1);
1708 pp_string (pp, tmp);
1710 else
1711 pp_printf (pp, "<%wx,%wx>",
1712 (unsigned HOST_WIDE_INT) CONST_DOUBLE_LOW (x),
1713 (unsigned HOST_WIDE_INT) CONST_DOUBLE_HIGH (x));
1714 break;
1715 case CONST_FIXED:
1716 fixed_to_decimal (tmp, CONST_FIXED_VALUE (x), sizeof (tmp));
1717 pp_string (pp, tmp);
1718 break;
1719 case CONST_STRING:
1720 pp_string (pp, "\"");
1721 pretty_print_string (pp, XSTR (x, 0), strlen (XSTR (x, 0)));
1722 pp_string (pp, "\"");
1723 break;
1724 case SYMBOL_REF:
1725 pp_printf (pp, "`%s'", XSTR (x, 0));
1726 break;
1727 case LABEL_REF:
1728 pp_printf (pp, "L%d", INSN_UID (label_ref_label (x)));
1729 break;
1730 case CONST:
1731 case HIGH:
1732 case STRICT_LOW_PART:
1733 pp_printf (pp, "%s(", GET_RTX_NAME (GET_CODE (x)));
1734 print_value (pp, XEXP (x, 0), verbose);
1735 pp_right_paren (pp);
1736 break;
1737 case REG:
1738 if (REGNO (x) < FIRST_PSEUDO_REGISTER)
1740 if (ISDIGIT (reg_names[REGNO (x)][0]))
1741 pp_modulo (pp);
1742 pp_string (pp, reg_names[REGNO (x)]);
1744 else
1745 pp_printf (pp, "r%d", REGNO (x));
1746 if (verbose)
1747 pp_printf (pp, ":%s", GET_MODE_NAME (GET_MODE (x)));
1748 break;
1749 case SUBREG:
1750 print_value (pp, SUBREG_REG (x), verbose);
1751 pp_printf (pp, "#");
1752 pp_wide_integer (pp, SUBREG_BYTE (x));
1753 break;
1754 case SCRATCH:
1755 case PC:
1756 pp_string (pp, GET_RTX_NAME (GET_CODE (x)));
1757 break;
1758 case MEM:
1759 pp_left_bracket (pp);
1760 print_value (pp, XEXP (x, 0), verbose);
1761 pp_right_bracket (pp);
1762 break;
1763 case DEBUG_EXPR:
1764 pp_printf (pp, "D#%i", DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (x)));
1765 break;
1766 default:
1767 print_exp (pp, x, verbose);
1768 break;
1770 } /* print_value */
1772 /* The next step in insn detalization, its pattern recognition. */
1774 void
1775 print_pattern (pretty_printer *pp, const_rtx x, int verbose)
1777 if (! x)
1779 pp_string (pp, "(nil)");
1780 return;
1783 switch (GET_CODE (x))
1785 case SET:
1786 print_value (pp, SET_DEST (x), verbose);
1787 pp_equal (pp);
1788 print_value (pp, SET_SRC (x), verbose);
1789 break;
1790 case RETURN:
1791 case SIMPLE_RETURN:
1792 case EH_RETURN:
1793 pp_string (pp, GET_RTX_NAME (GET_CODE (x)));
1794 break;
1795 case CALL:
1796 print_exp (pp, x, verbose);
1797 break;
1798 case CLOBBER:
1799 case USE:
1800 pp_printf (pp, "%s ", GET_RTX_NAME (GET_CODE (x)));
1801 print_value (pp, XEXP (x, 0), verbose);
1802 break;
1803 case VAR_LOCATION:
1804 pp_string (pp, "loc ");
1805 print_value (pp, PAT_VAR_LOCATION_LOC (x), verbose);
1806 break;
1807 case COND_EXEC:
1808 pp_left_paren (pp);
1809 if (GET_CODE (COND_EXEC_TEST (x)) == NE
1810 && XEXP (COND_EXEC_TEST (x), 1) == const0_rtx)
1811 print_value (pp, XEXP (COND_EXEC_TEST (x), 0), verbose);
1812 else if (GET_CODE (COND_EXEC_TEST (x)) == EQ
1813 && XEXP (COND_EXEC_TEST (x), 1) == const0_rtx)
1815 pp_exclamation (pp);
1816 print_value (pp, XEXP (COND_EXEC_TEST (x), 0), verbose);
1818 else
1819 print_value (pp, COND_EXEC_TEST (x), verbose);
1820 pp_string (pp, ") ");
1821 print_pattern (pp, COND_EXEC_CODE (x), verbose);
1822 break;
1823 case PARALLEL:
1825 int i;
1827 pp_left_brace (pp);
1828 for (i = 0; i < XVECLEN (x, 0); i++)
1830 print_pattern (pp, XVECEXP (x, 0, i), verbose);
1831 pp_semicolon (pp);
1833 pp_right_brace (pp);
1835 break;
1836 case SEQUENCE:
1838 const rtx_sequence *seq = as_a <const rtx_sequence *> (x);
1839 pp_string (pp, "sequence{");
1840 if (INSN_P (seq->element (0)))
1842 /* Print the sequence insns indented. */
1843 const char * save_print_rtx_head = print_rtx_head;
1844 char indented_print_rtx_head[32];
1846 pp_newline (pp);
1847 gcc_assert (strlen (print_rtx_head) < sizeof (indented_print_rtx_head) - 4);
1848 snprintf (indented_print_rtx_head,
1849 sizeof (indented_print_rtx_head),
1850 "%s ", print_rtx_head);
1851 print_rtx_head = indented_print_rtx_head;
1852 for (int i = 0; i < seq->len (); i++)
1853 print_insn_with_notes (pp, seq->insn (i));
1854 pp_printf (pp, "%s ", save_print_rtx_head);
1855 print_rtx_head = save_print_rtx_head;
1857 else
1859 for (int i = 0; i < seq->len (); i++)
1861 print_pattern (pp, seq->element (i), verbose);
1862 pp_semicolon (pp);
1865 pp_right_brace (pp);
1867 break;
1868 case ASM_INPUT:
1869 pp_printf (pp, "asm {%s}", XSTR (x, 0));
1870 break;
1871 case ADDR_VEC:
1872 for (int i = 0; i < XVECLEN (x, 0); i++)
1874 print_value (pp, XVECEXP (x, 0, i), verbose);
1875 pp_semicolon (pp);
1877 break;
1878 case ADDR_DIFF_VEC:
1879 for (int i = 0; i < XVECLEN (x, 1); i++)
1881 print_value (pp, XVECEXP (x, 1, i), verbose);
1882 pp_semicolon (pp);
1884 break;
1885 case TRAP_IF:
1886 pp_string (pp, "trap_if ");
1887 print_value (pp, TRAP_CONDITION (x), verbose);
1888 break;
1889 case UNSPEC:
1890 case UNSPEC_VOLATILE:
1891 /* Fallthru -- leave UNSPECs to print_exp. */
1892 default:
1893 print_value (pp, x, verbose);
1895 } /* print_pattern */
1897 /* This is the main function in slim rtl visualization mechanism.
1899 X is an insn, to be printed into PP.
1901 This function tries to print it properly in human-readable form,
1902 resembling assembler mnemonics (instead of the older Lisp-style
1903 form).
1905 If VERBOSE is TRUE, insns are printed with more complete (but
1906 longer) pattern names and with extra information, and prefixed
1907 with their INSN_UIDs. */
1909 void
1910 print_insn (pretty_printer *pp, const rtx_insn *x, int verbose)
1912 if (verbose)
1914 /* Blech, pretty-print can't print integers with a specified width. */
1915 char uid_prefix[32];
1916 snprintf (uid_prefix, sizeof uid_prefix, " %4d: ", INSN_UID (x));
1917 pp_string (pp, uid_prefix);
1920 switch (GET_CODE (x))
1922 case INSN:
1923 print_pattern (pp, PATTERN (x), verbose);
1924 break;
1926 case DEBUG_INSN:
1928 if (DEBUG_MARKER_INSN_P (x))
1930 switch (INSN_DEBUG_MARKER_KIND (x))
1932 case NOTE_INSN_BEGIN_STMT:
1933 pp_string (pp, "debug begin stmt marker");
1934 break;
1936 case NOTE_INSN_INLINE_ENTRY:
1937 pp_string (pp, "debug inline entry marker");
1938 break;
1940 default:
1941 gcc_unreachable ();
1943 break;
1946 const char *name = "?";
1947 char idbuf[32];
1949 if (DECL_P (INSN_VAR_LOCATION_DECL (x)))
1951 tree id = DECL_NAME (INSN_VAR_LOCATION_DECL (x));
1952 if (id)
1953 name = IDENTIFIER_POINTER (id);
1954 else if (TREE_CODE (INSN_VAR_LOCATION_DECL (x))
1955 == DEBUG_EXPR_DECL)
1957 sprintf (idbuf, "D#%i",
1958 DEBUG_TEMP_UID (INSN_VAR_LOCATION_DECL (x)));
1959 name = idbuf;
1961 else
1963 sprintf (idbuf, "D.%i",
1964 DECL_UID (INSN_VAR_LOCATION_DECL (x)));
1965 name = idbuf;
1968 pp_printf (pp, "debug %s => ", name);
1969 if (VAR_LOC_UNKNOWN_P (INSN_VAR_LOCATION_LOC (x)))
1970 pp_string (pp, "optimized away");
1971 else
1972 print_pattern (pp, INSN_VAR_LOCATION_LOC (x), verbose);
1974 break;
1976 case JUMP_INSN:
1977 print_pattern (pp, PATTERN (x), verbose);
1978 break;
1979 case CALL_INSN:
1980 if (GET_CODE (PATTERN (x)) == PARALLEL)
1981 print_pattern (pp, XVECEXP (PATTERN (x), 0, 0), verbose);
1982 else
1983 print_pattern (pp, PATTERN (x), verbose);
1984 break;
1985 case CODE_LABEL:
1986 pp_printf (pp, "L%d:", INSN_UID (x));
1987 break;
1988 case JUMP_TABLE_DATA:
1989 pp_string (pp, "jump_table_data{\n");
1990 print_pattern (pp, PATTERN (x), verbose);
1991 pp_right_brace (pp);
1992 break;
1993 case BARRIER:
1994 pp_string (pp, "barrier");
1995 break;
1996 case NOTE:
1998 pp_string (pp, GET_NOTE_INSN_NAME (NOTE_KIND (x)));
1999 switch (NOTE_KIND (x))
2001 case NOTE_INSN_EH_REGION_BEG:
2002 case NOTE_INSN_EH_REGION_END:
2003 pp_printf (pp, " %d", NOTE_EH_HANDLER (x));
2004 break;
2006 case NOTE_INSN_BLOCK_BEG:
2007 case NOTE_INSN_BLOCK_END:
2008 pp_printf (pp, " %d", BLOCK_NUMBER (NOTE_BLOCK (x)));
2009 break;
2011 case NOTE_INSN_BASIC_BLOCK:
2012 pp_printf (pp, " %d", NOTE_BASIC_BLOCK (x)->index);
2013 break;
2015 case NOTE_INSN_DELETED_LABEL:
2016 case NOTE_INSN_DELETED_DEBUG_LABEL:
2018 const char *label = NOTE_DELETED_LABEL_NAME (x);
2019 if (label == NULL)
2020 label = "";
2021 pp_printf (pp, " (\"%s\")", label);
2023 break;
2025 case NOTE_INSN_VAR_LOCATION:
2026 pp_left_brace (pp);
2027 print_pattern (pp, NOTE_VAR_LOCATION (x), verbose);
2028 pp_right_brace (pp);
2029 break;
2031 default:
2032 break;
2034 break;
2036 default:
2037 gcc_unreachable ();
2039 } /* print_insn */
2041 /* Pretty-print a slim dump of X (an insn) to PP, including any register
2042 note attached to the instruction. */
2044 void
2045 print_insn_with_notes (pretty_printer *pp, const rtx_insn *x)
2047 pp_string (pp, print_rtx_head);
2048 print_insn (pp, x, 1);
2049 pp_newline (pp);
2050 if (INSN_P (x) && REG_NOTES (x))
2051 for (rtx note = REG_NOTES (x); note; note = XEXP (note, 1))
2053 pp_printf (pp, "%s %s ", print_rtx_head,
2054 GET_REG_NOTE_NAME (REG_NOTE_KIND (note)));
2055 if (GET_CODE (note) == INT_LIST)
2056 pp_printf (pp, "%d", XINT (note, 0));
2057 else
2058 print_pattern (pp, XEXP (note, 0), 1);
2059 pp_newline (pp);
2063 /* Print X, an RTL value node, to file F in slim format. Include
2064 additional information if VERBOSE is nonzero.
2066 Value nodes are constants, registers, labels, symbols and
2067 memory. */
2069 void
2070 dump_value_slim (FILE *f, const_rtx x, int verbose)
2072 pretty_printer rtl_slim_pp;
2073 rtl_slim_pp.buffer->stream = f;
2074 print_value (&rtl_slim_pp, x, verbose);
2075 pp_flush (&rtl_slim_pp);
2078 /* Emit a slim dump of X (an insn) to the file F, including any register
2079 note attached to the instruction. */
2080 void
2081 dump_insn_slim (FILE *f, const rtx_insn *x)
2083 pretty_printer rtl_slim_pp;
2084 rtl_slim_pp.buffer->stream = f;
2085 print_insn_with_notes (&rtl_slim_pp, x);
2086 pp_flush (&rtl_slim_pp);
2089 /* Same as above, but stop at LAST or when COUNT == 0.
2090 If COUNT < 0 it will stop only at LAST or NULL rtx. */
2092 void
2093 dump_rtl_slim (FILE *f, const rtx_insn *first, const rtx_insn *last,
2094 int count, int flags ATTRIBUTE_UNUSED)
2096 const rtx_insn *insn, *tail;
2097 pretty_printer rtl_slim_pp;
2098 rtl_slim_pp.buffer->stream = f;
2100 tail = last ? NEXT_INSN (last) : NULL;
2101 for (insn = first;
2102 (insn != NULL) && (insn != tail) && (count != 0);
2103 insn = NEXT_INSN (insn))
2105 print_insn_with_notes (&rtl_slim_pp, insn);
2106 if (count > 0)
2107 count--;
2110 pp_flush (&rtl_slim_pp);
2113 /* Dumps basic block BB to pretty-printer PP in slim form and without and
2114 no indentation, for use as a label of a DOT graph record-node. */
2116 void
2117 rtl_dump_bb_for_graph (pretty_printer *pp, basic_block bb)
2119 rtx_insn *insn;
2120 bool first = true;
2122 /* TODO: inter-bb stuff. */
2123 FOR_BB_INSNS (bb, insn)
2125 if (! first)
2127 pp_bar (pp);
2128 pp_write_text_to_stream (pp);
2130 first = false;
2131 print_insn_with_notes (pp, insn);
2132 pp_write_text_as_dot_label_to_stream (pp, /*for_record=*/true);
2136 /* Pretty-print pattern X of some insn in non-verbose mode.
2137 Return a string pointer to the pretty-printer buffer.
2139 This function is only exported exists only to accommodate some older users
2140 of the slim RTL pretty printers. Please do not use it for new code. */
2142 const char *
2143 str_pattern_slim (const_rtx x)
2145 pretty_printer rtl_slim_pp;
2146 print_pattern (&rtl_slim_pp, x, 0);
2147 return ggc_strdup (pp_formatted_text (&rtl_slim_pp));
2150 /* Emit a slim dump of X (an insn) to stderr. */
2151 extern void debug_insn_slim (const rtx_insn *);
2152 DEBUG_FUNCTION void
2153 debug_insn_slim (const rtx_insn *x)
2155 dump_insn_slim (stderr, x);
2158 /* Same as above, but using dump_rtl_slim. */
2159 extern void debug_rtl_slim (FILE *, const rtx_insn *, const rtx_insn *,
2160 int, int);
2161 DEBUG_FUNCTION void
2162 debug_rtl_slim (const rtx_insn *first, const rtx_insn *last, int count,
2163 int flags)
2165 dump_rtl_slim (stderr, first, last, count, flags);
2168 extern void debug_bb_slim (basic_block);
2169 DEBUG_FUNCTION void
2170 debug_bb_slim (basic_block bb)
2172 debug_bb (bb, TDF_SLIM | TDF_BLOCKS);
2175 extern void debug_bb_n_slim (int);
2176 DEBUG_FUNCTION void
2177 debug_bb_n_slim (int n)
2179 basic_block bb = BASIC_BLOCK_FOR_FN (cfun, n);
2180 debug_bb_slim (bb);
2183 #endif
2185 #if __GNUC__ >= 10
2186 # pragma GCC diagnostic pop
2187 #endif