1 /* RTL utility routines.
2 Copyright (C) 1987, 1988, 1991, 1994, 1997, 1998, 1999, 2000, 2001
3 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
30 /* Calculate the format for CONST_DOUBLE. This depends on the relative
31 widths of HOST_WIDE_INT and REAL_VALUE_TYPE.
33 We need to go out to e0wwwww, since REAL_ARITHMETIC assumes 16-bits
34 per element in REAL_VALUE_TYPE.
36 This is duplicated in gengenrtl.c.
38 A number of places assume that there are always at least two 'w'
39 slots in a CONST_DOUBLE, so we provide them even if one would suffice. */
41 #ifdef REAL_ARITHMETIC
42 # if MAX_LONG_DOUBLE_TYPE_SIZE == 96
44 (11*8 + HOST_BITS_PER_WIDE_INT)/HOST_BITS_PER_WIDE_INT
46 # if MAX_LONG_DOUBLE_TYPE_SIZE == 128
48 (19*8 + HOST_BITS_PER_WIDE_INT)/HOST_BITS_PER_WIDE_INT
50 # if HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
52 (7*8 + HOST_BITS_PER_WIDE_INT)/HOST_BITS_PER_WIDE_INT
56 #endif /* REAL_ARITHMETIC */
59 # if HOST_BITS_PER_WIDE_INT*2 >= MAX_LONG_DOUBLE_TYPE_SIZE
62 # if HOST_BITS_PER_WIDE_INT*3 >= MAX_LONG_DOUBLE_TYPE_SIZE
65 # if HOST_BITS_PER_WIDE_INT*4 >= MAX_LONG_DOUBLE_TYPE_SIZE
70 #endif /* REAL_WIDTH */
73 # define CONST_DOUBLE_FORMAT "e0ww"
76 # define CONST_DOUBLE_FORMAT "e0ww"
79 # define CONST_DOUBLE_FORMAT "e0www"
82 # define CONST_DOUBLE_FORMAT "e0wwww"
85 # define CONST_DOUBLE_FORMAT "e0wwwww"
87 # define CONST_DOUBLE_FORMAT /* nothing - will cause syntax error */
94 /* Indexed by rtx code, gives number of operands for an rtx with that code.
95 Does NOT include rtx header data (code and links). */
97 #define DEF_RTL_EXPR(ENUM, NAME, FORMAT, CLASS) sizeof FORMAT - 1 ,
99 const int rtx_length[NUM_RTX_CODE + 1] = {
105 /* Indexed by rtx code, gives the name of that kind of rtx, as a C string. */
107 #define DEF_RTL_EXPR(ENUM, NAME, FORMAT, CLASS) NAME ,
109 const char * const rtx_name[] = {
110 #include "rtl.def" /* rtl expressions are documented here */
115 /* Indexed by machine mode, gives the name of that machine mode.
116 This name does not include the letters "mode". */
118 #define DEF_MACHMODE(SYM, NAME, CLASS, BITSIZE, SIZE, UNIT, WIDER) NAME,
120 const char * const mode_name[] = {
121 #include "machmode.def"
126 /* Indexed by machine mode, gives the class mode for GET_MODE_CLASS. */
128 #define DEF_MACHMODE(SYM, NAME, CLASS, BITSIZE, SIZE, UNIT, WIDER) CLASS,
130 const enum mode_class mode_class[] = {
131 #include "machmode.def"
136 /* Indexed by machine mode, gives the length of the mode, in bits.
137 GET_MODE_BITSIZE uses this. */
139 #define DEF_MACHMODE(SYM, NAME, CLASS, BITSIZE, SIZE, UNIT, WIDER) BITSIZE,
141 const unsigned int mode_bitsize[] = {
142 #include "machmode.def"
147 /* Indexed by machine mode, gives the length of the mode, in bytes.
148 GET_MODE_SIZE uses this. */
150 #define DEF_MACHMODE(SYM, NAME, CLASS, BITSIZE, SIZE, UNIT, WIDER) SIZE,
152 const unsigned int mode_size[] = {
153 #include "machmode.def"
158 /* Indexed by machine mode, gives the length of the mode's subunit.
159 GET_MODE_UNIT_SIZE uses this. */
161 #define DEF_MACHMODE(SYM, NAME, CLASS, BITSIZE, SIZE, UNIT, WIDER) UNIT,
163 const unsigned int mode_unit_size[] = {
164 #include "machmode.def" /* machine modes are documented here */
169 /* Indexed by machine mode, gives next wider natural mode
170 (QI -> HI -> SI -> DI, etc.) Widening multiply instructions
173 #define DEF_MACHMODE(SYM, NAME, CLASS, BITSIZE, SIZE, UNIT, WIDER) \
174 (unsigned char) WIDER,
176 const unsigned char mode_wider_mode[] = {
177 #include "machmode.def" /* machine modes are documented here */
182 #define DEF_MACHMODE(SYM, NAME, CLASS, BITSIZE, SIZE, UNIT, WIDER) \
183 ((BITSIZE) >= HOST_BITS_PER_WIDE_INT) ? ~(unsigned HOST_WIDE_INT)0 : ((unsigned HOST_WIDE_INT) 1 << (BITSIZE)) - 1,
185 /* Indexed by machine mode, gives mask of significant bits in mode. */
187 const unsigned HOST_WIDE_INT mode_mask_array[] = {
188 #include "machmode.def"
191 /* Indexed by mode class, gives the narrowest mode for each class.
192 The Q modes are always of width 1 (2 for complex) - it is impossible
193 for any mode to be narrower.
195 Note that we use QImode instead of BImode for MODE_INT, since
196 otherwise the middle end will try to use it for bitfields in
197 structures and the like, which we do not want. Only the target
198 md file should generate BImode widgets. */
200 const enum machine_mode class_narrowest_mode[(int) MAX_MODE_CLASS] = {
201 /* MODE_RANDOM */ VOIDmode,
202 /* MODE_INT */ QImode,
203 /* MODE_FLOAT */ QFmode,
204 /* MODE_PARTIAL_INT */ PQImode,
205 /* MODE_CC */ CCmode,
206 /* MODE_COMPLEX_INT */ CQImode,
207 /* MODE_COMPLEX_FLOAT */ QCmode,
208 /* MODE_VECTOR_INT */ V2QImode,
209 /* MODE_VECTOR_FLOAT */ V2SFmode
213 /* Indexed by rtx code, gives a sequence of operand-types for
214 rtx's of that code. The sequence is a C string in which
215 each character describes one operand. */
217 const char * const rtx_format[] = {
219 can cause a warning message
220 "0" field is unused (or used in a phase-dependent manner)
224 "n" like "i", but prints entries from `note_insn_name'
225 "w" an integer of width HOST_BITS_PER_WIDE_INT
227 "s" a pointer to a string
229 "S" like "s", but optional:
230 the containing rtx may end before this operand
231 "T" like "s", but treated specially by the RTL reader;
232 only found in machine description patterns.
233 "e" a pointer to an rtl expression
234 prints the expression
235 "E" a pointer to a vector that points to a number of rtl expressions
236 prints a list of the rtl expressions
237 "V" like "E", but optional:
238 the containing rtx may end before this operand
239 "u" a pointer to another insn
240 prints the uid of the insn.
241 "b" is a pointer to a bitmap header.
242 "t" is a tree pointer. */
244 #define DEF_RTL_EXPR(ENUM, NAME, FORMAT, CLASS) FORMAT ,
245 #include "rtl.def" /* rtl expressions are defined here */
249 /* Indexed by rtx code, gives a character representing the "class" of
250 that rtx code. See rtl.def for documentation on the defined classes. */
252 const char rtx_class[] = {
253 #define DEF_RTL_EXPR(ENUM, NAME, FORMAT, CLASS) CLASS,
254 #include "rtl.def" /* rtl expressions are defined here */
258 /* Names for kinds of NOTEs and REG_NOTEs. */
260 const char * const note_insn_name[NOTE_INSN_MAX - NOTE_INSN_BIAS] =
262 "", "NOTE_INSN_DELETED",
263 "NOTE_INSN_BLOCK_BEG", "NOTE_INSN_BLOCK_END",
264 "NOTE_INSN_LOOP_BEG", "NOTE_INSN_LOOP_END",
265 "NOTE_INSN_LOOP_CONT", "NOTE_INSN_LOOP_VTOP",
266 "NOTE_INSN_FUNCTION_END",
267 "NOTE_INSN_PROLOGUE_END", "NOTE_INSN_EPILOGUE_BEG",
268 "NOTE_INSN_DELETED_LABEL", "NOTE_INSN_FUNCTION_BEG",
269 "NOTE_INSN_EH_REGION_BEG", "NOTE_INSN_EH_REGION_END",
270 "NOTE_INSN_REPEATED_LINE_NUMBER", "NOTE_INSN_RANGE_BEG",
271 "NOTE_INSN_RANGE_END", "NOTE_INSN_LIVE",
272 "NOTE_INSN_BASIC_BLOCK", "NOTE_INSN_EXPECTED_VALUE"
275 const char * const reg_note_name[] =
277 "", "REG_DEAD", "REG_INC", "REG_EQUIV", "REG_EQUAL",
278 "REG_WAS_0", "REG_RETVAL", "REG_LIBCALL", "REG_NONNEG",
279 "REG_NO_CONFLICT", "REG_UNUSED", "REG_CC_SETTER", "REG_CC_USER",
280 "REG_LABEL", "REG_DEP_ANTI", "REG_DEP_OUTPUT", "REG_BR_PROB",
281 "REG_EXEC_COUNT", "REG_NOALIAS", "REG_SAVE_AREA", "REG_BR_PRED",
282 "REG_FRAME_RELATED_EXPR", "REG_EH_CONTEXT", "REG_EH_REGION",
283 "REG_SAVE_NOTE", "REG_MAYBE_DEAD", "REG_NORETURN",
284 "REG_NON_LOCAL_GOTO", "REG_SETJMP", "REG_ALWAYS_RETURN"
288 /* Allocate an rtx vector of N elements.
289 Store the length, and initialize all elements to zero. */
297 rt = ggc_alloc_rtvec (n);
298 /* clear out the vector */
299 memset (&rt->elem[0], 0, n * sizeof (rtx));
301 PUT_NUM_ELEM (rt, n);
305 /* Allocate an rtx of code CODE. The CODE is stored in the rtx;
306 all the rest is initialized to zero. */
313 int n = GET_RTX_LENGTH (code);
315 rt = ggc_alloc_rtx (n);
317 /* We want to clear everything up to the FLD array. Normally, this
318 is one int, but we don't want to assume that and it isn't very
319 portable anyway; this is. */
321 memset (rt, 0, sizeof (struct rtx_def) - sizeof (rtunion));
327 /* Create a new copy of an rtx.
328 Recursively copies the operands of the rtx,
329 except for those few rtx codes that are sharable. */
338 const char *format_ptr;
340 code = GET_CODE (orig);
353 /* SCRATCH must be shared because they represent distinct values. */
358 /* CONST can be shared if it contains a SYMBOL_REF. If it contains
359 a LABEL_REF, it isn't sharable. */
360 if (GET_CODE (XEXP (orig, 0)) == PLUS
361 && GET_CODE (XEXP (XEXP (orig, 0), 0)) == SYMBOL_REF
362 && GET_CODE (XEXP (XEXP (orig, 0), 1)) == CONST_INT)
366 /* A MEM with a constant address is not sharable. The problem is that
367 the constant address may need to be reloaded. If the mem is shared,
368 then reloading one copy of this mem will cause all copies to appear
369 to have been reloaded. */
375 copy = rtx_alloc (code);
377 /* Copy the various flags, and other information. We assume that
378 all fields need copying, and then clear the fields that should
379 not be copied. That is the sensible default behavior, and forces
380 us to explicitly document why we are *not* copying a flag. */
381 memcpy (copy, orig, sizeof (struct rtx_def) - sizeof (rtunion));
383 /* We do not copy the USED flag, which is used as a mark bit during
384 walks over the RTL. */
387 /* We do not copy FRAME_RELATED for INSNs. */
388 if (GET_RTX_CLASS (code) == 'i')
389 copy->frame_related = 0;
390 copy->jump = orig->jump;
391 copy->call = orig->call;
393 format_ptr = GET_RTX_FORMAT (GET_CODE (copy));
395 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (copy)); i++)
397 copy->fld[i] = orig->fld[i];
398 switch (*format_ptr++)
401 if (XEXP (orig, i) != NULL)
402 XEXP (copy, i) = copy_rtx (XEXP (orig, i));
407 if (XVEC (orig, i) != NULL)
409 XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i));
410 for (j = 0; j < XVECLEN (copy, i); j++)
411 XVECEXP (copy, i, j) = copy_rtx (XVECEXP (orig, i, j));
423 /* These are left unchanged. */
433 /* Similar to `copy_rtx' except that if MAY_SHARE is present, it is
434 placed in the result directly, rather than being copied. */
437 copy_most_rtx (orig, may_share)
444 const char *format_ptr;
446 if (orig == may_share)
449 code = GET_CODE (orig);
466 copy = rtx_alloc (code);
467 PUT_MODE (copy, GET_MODE (orig));
468 copy->in_struct = orig->in_struct;
469 copy->volatil = orig->volatil;
470 copy->unchanging = orig->unchanging;
471 copy->integrated = orig->integrated;
472 copy->frame_related = orig->frame_related;
474 format_ptr = GET_RTX_FORMAT (GET_CODE (copy));
476 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (copy)); i++)
478 switch (*format_ptr++)
481 XEXP (copy, i) = XEXP (orig, i);
482 if (XEXP (orig, i) != NULL && XEXP (orig, i) != may_share)
483 XEXP (copy, i) = copy_most_rtx (XEXP (orig, i), may_share);
487 XEXP (copy, i) = XEXP (orig, i);
492 XVEC (copy, i) = XVEC (orig, i);
493 if (XVEC (orig, i) != NULL)
495 XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i));
496 for (j = 0; j < XVECLEN (copy, i); j++)
498 = copy_most_rtx (XVECEXP (orig, i, j), may_share);
503 XWINT (copy, i) = XWINT (orig, i);
508 XINT (copy, i) = XINT (orig, i);
512 XTREE (copy, i) = XTREE (orig, i);
517 XSTR (copy, i) = XSTR (orig, i);
521 /* Copy this through the wide int field; that's safest. */
522 X0WINT (copy, i) = X0WINT (orig, i);
532 /* Create a new copy of an rtx. Only copy just one level. */
534 shallow_copy_rtx (orig)
538 RTX_CODE code = GET_CODE (orig);
539 rtx copy = rtx_alloc (code);
541 PUT_MODE (copy, GET_MODE (orig));
542 copy->in_struct = orig->in_struct;
543 copy->volatil = orig->volatil;
544 copy->unchanging = orig->unchanging;
545 copy->integrated = orig->integrated;
546 copy->frame_related = orig->frame_related;
548 for (i = 0; i < GET_RTX_LENGTH (code); i++)
549 copy->fld[i] = orig->fld[i];
554 /* This is 1 until after the rtl generation pass. */
555 int rtx_equal_function_value_matters;
557 /* Nonzero when we are generating CONCATs. */
558 int generating_concat_p;
560 /* Return 1 if X and Y are identical-looking rtx's.
561 This is the Lisp function EQUAL for rtx arguments. */
574 if (x == 0 || y == 0)
578 /* Rtx's of different codes cannot be equal. */
579 if (code != GET_CODE (y))
582 /* (MULT:SI x y) and (MULT:HI x y) are NOT equivalent.
583 (REG:SI x) and (REG:HI x) are NOT equivalent. */
585 if (GET_MODE (x) != GET_MODE (y))
588 /* Some RTL can be compared nonrecursively. */
592 /* Until rtl generation is complete, don't consider a reference
593 to the return register of the current function the same as
594 the return from a called function. This eases the job of
595 function integration. Once the distinction is no longer
596 needed, they can be considered equivalent. */
597 return (REGNO (x) == REGNO (y)
598 && (! rtx_equal_function_value_matters
599 || REG_FUNCTION_VALUE_P (x) == REG_FUNCTION_VALUE_P (y)));
602 return XEXP (x, 0) == XEXP (y, 0);
605 return XSTR (x, 0) == XSTR (y, 0);
616 /* Compare the elements. If any pair of corresponding elements
617 fail to match, return 0 for the whole things. */
619 fmt = GET_RTX_FORMAT (code);
620 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
625 if (XWINT (x, i) != XWINT (y, i))
631 if (XINT (x, i) != XINT (y, i))
637 /* Two vectors must have the same length. */
638 if (XVECLEN (x, i) != XVECLEN (y, i))
641 /* And the corresponding elements must match. */
642 for (j = 0; j < XVECLEN (x, i); j++)
643 if (rtx_equal_p (XVECEXP (x, i, j), XVECEXP (y, i, j)) == 0)
648 if (rtx_equal_p (XEXP (x, i), XEXP (y, i)) == 0)
654 if (strcmp (XSTR (x, i), XSTR (y, i)))
659 /* These are just backpointers, so they don't matter. */
666 /* It is believed that rtx's at this level will never
667 contain anything but integers and other rtx's,
668 except for within LABEL_REFs and SYMBOL_REFs. */
676 #if defined ENABLE_RTL_CHECKING && (GCC_VERSION >= 2007)
678 rtl_check_failed_bounds (r, n, file, line, func)
686 ("RTL check: access of elt %d of `%s' with last elt %d in %s, at %s:%d",
687 n, GET_RTX_NAME (GET_CODE (r)), GET_RTX_LENGTH (GET_CODE (r)) - 1,
688 func, trim_filename (file), line);
692 rtl_check_failed_type1 (r, n, c1, file, line, func)
701 ("RTL check: expected elt %d type '%c', have '%c' (rtx %s) in %s, at %s:%d",
702 n, c1, GET_RTX_FORMAT (GET_CODE (r))[n], GET_RTX_NAME (GET_CODE (r)),
703 func, trim_filename (file), line);
707 rtl_check_failed_type2 (r, n, c1, c2, file, line, func)
717 ("RTL check: expected elt %d type '%c' or '%c', have '%c' (rtx %s) in %s, at %s:%d",
718 n, c1, c2, GET_RTX_FORMAT (GET_CODE (r))[n], GET_RTX_NAME (GET_CODE (r)),
719 func, trim_filename (file), line);
723 rtl_check_failed_code1 (r, code, file, line, func)
730 internal_error ("RTL check: expected code `%s', have `%s' in %s, at %s:%d",
731 GET_RTX_NAME (code), GET_RTX_NAME (GET_CODE (r)), func,
732 trim_filename (file), line);
736 rtl_check_failed_code2 (r, code1, code2, file, line, func)
738 enum rtx_code code1, code2;
744 ("RTL check: expected code `%s' or `%s', have `%s' in %s, at %s:%d",
745 GET_RTX_NAME (code1), GET_RTX_NAME (code2), GET_RTX_NAME (GET_CODE (r)),
746 func, trim_filename (file), line);
749 /* XXX Maybe print the vector? */
751 rtvec_check_failed_bounds (r, n, file, line, func)
759 ("RTL check: access of elt %d of vector with last elt %d in %s, at %s:%d",
760 n, GET_NUM_ELEM (r) - 1, func, trim_filename (file), line);
762 #endif /* ENABLE_RTL_CHECKING */