1 /* Emit RTL for the GCC expander.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
24 /* Middle-to-low level generation of rtx code and insns.
26 This file contains support functions for creating rtl expressions
27 and manipulating them in the doubly-linked chain of insns.
29 The patterns of the insns are created by machine-dependent
30 routines in insn-emit.c, which is generated automatically from
31 the machine description. These routines make the individual rtx's
32 of the pattern with `gen_rtx_fmt_ee' and others in genrtl.[ch],
33 which are automatically generated from rtl.def; what is machine
34 dependent is the kind of rtx's they make and what arguments they
39 #include "coretypes.h"
49 #include "hard-reg-set.h"
51 #include "insn-config.h"
55 #include "basic-block.h"
58 #include "langhooks.h"
59 #include "tree-pass.h"
61 /* Commonly used modes. */
63 enum machine_mode byte_mode; /* Mode whose width is BITS_PER_UNIT. */
64 enum machine_mode word_mode; /* Mode whose width is BITS_PER_WORD. */
65 enum machine_mode double_mode; /* Mode whose width is DOUBLE_TYPE_SIZE. */
66 enum machine_mode ptr_mode; /* Mode whose width is POINTER_SIZE. */
69 /* This is *not* reset after each function. It gives each CODE_LABEL
70 in the entire compilation a unique label number. */
72 static GTY(()) int label_num = 1;
74 /* Nonzero means do not generate NOTEs for source line numbers. */
76 static int no_line_numbers;
78 /* Commonly used rtx's, so that we only need space for one copy.
79 These are initialized once for the entire compilation.
80 All of these are unique; no other rtx-object will be equal to any
83 rtx global_rtl[GR_MAX];
85 /* Commonly used RTL for hard registers. These objects are not necessarily
86 unique, so we allocate them separately from global_rtl. They are
87 initialized once per compilation unit, then copied into regno_reg_rtx
88 at the beginning of each function. */
89 static GTY(()) rtx static_regno_reg_rtx[FIRST_PSEUDO_REGISTER];
91 /* We record floating-point CONST_DOUBLEs in each floating-point mode for
92 the values of 0, 1, and 2. For the integer entries and VOIDmode, we
93 record a copy of const[012]_rtx. */
95 rtx const_tiny_rtx[3][(int) MAX_MACHINE_MODE];
99 REAL_VALUE_TYPE dconst0;
100 REAL_VALUE_TYPE dconst1;
101 REAL_VALUE_TYPE dconst2;
102 REAL_VALUE_TYPE dconst3;
103 REAL_VALUE_TYPE dconst10;
104 REAL_VALUE_TYPE dconstm1;
105 REAL_VALUE_TYPE dconstm2;
106 REAL_VALUE_TYPE dconsthalf;
107 REAL_VALUE_TYPE dconstthird;
108 REAL_VALUE_TYPE dconstsqrt2;
109 REAL_VALUE_TYPE dconste;
111 /* All references to the following fixed hard registers go through
112 these unique rtl objects. On machines where the frame-pointer and
113 arg-pointer are the same register, they use the same unique object.
115 After register allocation, other rtl objects which used to be pseudo-regs
116 may be clobbered to refer to the frame-pointer register.
117 But references that were originally to the frame-pointer can be
118 distinguished from the others because they contain frame_pointer_rtx.
120 When to use frame_pointer_rtx and hard_frame_pointer_rtx is a little
121 tricky: until register elimination has taken place hard_frame_pointer_rtx
122 should be used if it is being set, and frame_pointer_rtx otherwise. After
123 register elimination hard_frame_pointer_rtx should always be used.
124 On machines where the two registers are same (most) then these are the
127 In an inline procedure, the stack and frame pointer rtxs may not be
128 used for anything else. */
129 rtx static_chain_rtx; /* (REG:Pmode STATIC_CHAIN_REGNUM) */
130 rtx static_chain_incoming_rtx; /* (REG:Pmode STATIC_CHAIN_INCOMING_REGNUM) */
131 rtx pic_offset_table_rtx; /* (REG:Pmode PIC_OFFSET_TABLE_REGNUM) */
133 /* This is used to implement __builtin_return_address for some machines.
134 See for instance the MIPS port. */
135 rtx return_address_pointer_rtx; /* (REG:Pmode RETURN_ADDRESS_POINTER_REGNUM) */
137 /* We make one copy of (const_int C) where C is in
138 [- MAX_SAVED_CONST_INT, MAX_SAVED_CONST_INT]
139 to save space during the compilation and simplify comparisons of
142 rtx const_int_rtx[MAX_SAVED_CONST_INT * 2 + 1];
144 /* A hash table storing CONST_INTs whose absolute value is greater
145 than MAX_SAVED_CONST_INT. */
147 static GTY ((if_marked ("ggc_marked_p"), param_is (struct rtx_def)))
148 htab_t const_int_htab;
150 /* A hash table storing memory attribute structures. */
151 static GTY ((if_marked ("ggc_marked_p"), param_is (struct mem_attrs)))
152 htab_t mem_attrs_htab;
154 /* A hash table storing register attribute structures. */
155 static GTY ((if_marked ("ggc_marked_p"), param_is (struct reg_attrs)))
156 htab_t reg_attrs_htab;
158 /* A hash table storing all CONST_DOUBLEs. */
159 static GTY ((if_marked ("ggc_marked_p"), param_is (struct rtx_def)))
160 htab_t const_double_htab;
162 #define first_insn (cfun->emit->x_first_insn)
163 #define last_insn (cfun->emit->x_last_insn)
164 #define cur_insn_uid (cfun->emit->x_cur_insn_uid)
165 #define last_location (cfun->emit->x_last_location)
166 #define first_label_num (cfun->emit->x_first_label_num)
168 static rtx make_call_insn_raw (rtx);
169 static rtx change_address_1 (rtx, enum machine_mode, rtx, int);
170 static void reset_used_decls (tree);
171 static void mark_label_nuses (rtx);
172 static hashval_t const_int_htab_hash (const void *);
173 static int const_int_htab_eq (const void *, const void *);
174 static hashval_t const_double_htab_hash (const void *);
175 static int const_double_htab_eq (const void *, const void *);
176 static rtx lookup_const_double (rtx);
177 static hashval_t mem_attrs_htab_hash (const void *);
178 static int mem_attrs_htab_eq (const void *, const void *);
179 static mem_attrs *get_mem_attrs (HOST_WIDE_INT, tree, rtx, rtx, unsigned int,
181 static hashval_t reg_attrs_htab_hash (const void *);
182 static int reg_attrs_htab_eq (const void *, const void *);
183 static reg_attrs *get_reg_attrs (tree, int);
184 static tree component_ref_for_mem_expr (tree);
185 static rtx gen_const_vector (enum machine_mode, int);
186 static void copy_rtx_if_shared_1 (rtx *orig);
188 /* Probability of the conditional branch currently proceeded by try_split.
189 Set to -1 otherwise. */
190 int split_branch_probability = -1;
192 /* Returns a hash code for X (which is a really a CONST_INT). */
195 const_int_htab_hash (const void *x)
197 return (hashval_t) INTVAL ((rtx) x);
200 /* Returns nonzero if the value represented by X (which is really a
201 CONST_INT) is the same as that given by Y (which is really a
205 const_int_htab_eq (const void *x, const void *y)
207 return (INTVAL ((rtx) x) == *((const HOST_WIDE_INT *) y));
210 /* Returns a hash code for X (which is really a CONST_DOUBLE). */
212 const_double_htab_hash (const void *x)
217 if (GET_MODE (value) == VOIDmode)
218 h = CONST_DOUBLE_LOW (value) ^ CONST_DOUBLE_HIGH (value);
221 h = real_hash (CONST_DOUBLE_REAL_VALUE (value));
222 /* MODE is used in the comparison, so it should be in the hash. */
223 h ^= GET_MODE (value);
228 /* Returns nonzero if the value represented by X (really a ...)
229 is the same as that represented by Y (really a ...) */
231 const_double_htab_eq (const void *x, const void *y)
233 rtx a = (rtx)x, b = (rtx)y;
235 if (GET_MODE (a) != GET_MODE (b))
237 if (GET_MODE (a) == VOIDmode)
238 return (CONST_DOUBLE_LOW (a) == CONST_DOUBLE_LOW (b)
239 && CONST_DOUBLE_HIGH (a) == CONST_DOUBLE_HIGH (b));
241 return real_identical (CONST_DOUBLE_REAL_VALUE (a),
242 CONST_DOUBLE_REAL_VALUE (b));
245 /* Returns a hash code for X (which is a really a mem_attrs *). */
248 mem_attrs_htab_hash (const void *x)
250 mem_attrs *p = (mem_attrs *) x;
252 return (p->alias ^ (p->align * 1000)
253 ^ ((p->offset ? INTVAL (p->offset) : 0) * 50000)
254 ^ ((p->size ? INTVAL (p->size) : 0) * 2500000)
255 ^ (size_t) iterative_hash_expr (p->expr, 0));
258 /* Returns nonzero if the value represented by X (which is really a
259 mem_attrs *) is the same as that given by Y (which is also really a
263 mem_attrs_htab_eq (const void *x, const void *y)
265 mem_attrs *p = (mem_attrs *) x;
266 mem_attrs *q = (mem_attrs *) y;
268 return (p->alias == q->alias && p->offset == q->offset
269 && p->size == q->size && p->align == q->align
270 && (p->expr == q->expr
271 || (p->expr != NULL_TREE && q->expr != NULL_TREE
272 && operand_equal_p (p->expr, q->expr, 0))));
275 /* Allocate a new mem_attrs structure and insert it into the hash table if
276 one identical to it is not already in the table. We are doing this for
280 get_mem_attrs (HOST_WIDE_INT alias, tree expr, rtx offset, rtx size,
281 unsigned int align, enum machine_mode mode)
286 /* If everything is the default, we can just return zero.
287 This must match what the corresponding MEM_* macros return when the
288 field is not present. */
289 if (alias == 0 && expr == 0 && offset == 0
291 || (mode != BLKmode && GET_MODE_SIZE (mode) == INTVAL (size)))
292 && (STRICT_ALIGNMENT && mode != BLKmode
293 ? align == GET_MODE_ALIGNMENT (mode) : align == BITS_PER_UNIT))
298 attrs.offset = offset;
302 slot = htab_find_slot (mem_attrs_htab, &attrs, INSERT);
305 *slot = ggc_alloc (sizeof (mem_attrs));
306 memcpy (*slot, &attrs, sizeof (mem_attrs));
312 /* Returns a hash code for X (which is a really a reg_attrs *). */
315 reg_attrs_htab_hash (const void *x)
317 reg_attrs *p = (reg_attrs *) x;
319 return ((p->offset * 1000) ^ (long) p->decl);
322 /* Returns nonzero if the value represented by X (which is really a
323 reg_attrs *) is the same as that given by Y (which is also really a
327 reg_attrs_htab_eq (const void *x, const void *y)
329 reg_attrs *p = (reg_attrs *) x;
330 reg_attrs *q = (reg_attrs *) y;
332 return (p->decl == q->decl && p->offset == q->offset);
334 /* Allocate a new reg_attrs structure and insert it into the hash table if
335 one identical to it is not already in the table. We are doing this for
339 get_reg_attrs (tree decl, int offset)
344 /* If everything is the default, we can just return zero. */
345 if (decl == 0 && offset == 0)
349 attrs.offset = offset;
351 slot = htab_find_slot (reg_attrs_htab, &attrs, INSERT);
354 *slot = ggc_alloc (sizeof (reg_attrs));
355 memcpy (*slot, &attrs, sizeof (reg_attrs));
361 /* Generate a new REG rtx. Make sure ORIGINAL_REGNO is set properly, and
362 don't attempt to share with the various global pieces of rtl (such as
363 frame_pointer_rtx). */
366 gen_raw_REG (enum machine_mode mode, int regno)
368 rtx x = gen_rtx_raw_REG (mode, regno);
369 ORIGINAL_REGNO (x) = regno;
373 /* There are some RTL codes that require special attention; the generation
374 functions do the raw handling. If you add to this list, modify
375 special_rtx in gengenrtl.c as well. */
378 gen_rtx_CONST_INT (enum machine_mode mode ATTRIBUTE_UNUSED, HOST_WIDE_INT arg)
382 if (arg >= - MAX_SAVED_CONST_INT && arg <= MAX_SAVED_CONST_INT)
383 return const_int_rtx[arg + MAX_SAVED_CONST_INT];
385 #if STORE_FLAG_VALUE != 1 && STORE_FLAG_VALUE != -1
386 if (const_true_rtx && arg == STORE_FLAG_VALUE)
387 return const_true_rtx;
390 /* Look up the CONST_INT in the hash table. */
391 slot = htab_find_slot_with_hash (const_int_htab, &arg,
392 (hashval_t) arg, INSERT);
394 *slot = gen_rtx_raw_CONST_INT (VOIDmode, arg);
400 gen_int_mode (HOST_WIDE_INT c, enum machine_mode mode)
402 return GEN_INT (trunc_int_for_mode (c, mode));
405 /* CONST_DOUBLEs might be created from pairs of integers, or from
406 REAL_VALUE_TYPEs. Also, their length is known only at run time,
407 so we cannot use gen_rtx_raw_CONST_DOUBLE. */
409 /* Determine whether REAL, a CONST_DOUBLE, already exists in the
410 hash table. If so, return its counterpart; otherwise add it
411 to the hash table and return it. */
413 lookup_const_double (rtx real)
415 void **slot = htab_find_slot (const_double_htab, real, INSERT);
422 /* Return a CONST_DOUBLE rtx for a floating-point value specified by
423 VALUE in mode MODE. */
425 const_double_from_real_value (REAL_VALUE_TYPE value, enum machine_mode mode)
427 rtx real = rtx_alloc (CONST_DOUBLE);
428 PUT_MODE (real, mode);
432 return lookup_const_double (real);
435 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair
436 of ints: I0 is the low-order word and I1 is the high-order word.
437 Do not use this routine for non-integer modes; convert to
438 REAL_VALUE_TYPE and use CONST_DOUBLE_FROM_REAL_VALUE. */
441 immed_double_const (HOST_WIDE_INT i0, HOST_WIDE_INT i1, enum machine_mode mode)
446 /* There are the following cases (note that there are no modes with
447 HOST_BITS_PER_WIDE_INT < GET_MODE_BITSIZE (mode) < 2 * HOST_BITS_PER_WIDE_INT):
449 1) If GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT, then we use
451 2) GET_MODE_BITSIZE (mode) == 2 * HOST_BITS_PER_WIDE_INT, but the value of
452 the integer fits into HOST_WIDE_INT anyway (i.e., i1 consists only
453 from copies of the sign bit, and sign of i0 and i1 are the same), then
454 we return a CONST_INT for i0.
455 3) Otherwise, we create a CONST_DOUBLE for i0 and i1. */
456 if (mode != VOIDmode)
458 gcc_assert (GET_MODE_CLASS (mode) == MODE_INT
459 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT
460 /* We can get a 0 for an error mark. */
461 || GET_MODE_CLASS (mode) == MODE_VECTOR_INT
462 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT);
464 if (GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
465 return gen_int_mode (i0, mode);
467 gcc_assert (GET_MODE_BITSIZE (mode) == 2 * HOST_BITS_PER_WIDE_INT);
470 /* If this integer fits in one word, return a CONST_INT. */
471 if ((i1 == 0 && i0 >= 0) || (i1 == ~0 && i0 < 0))
474 /* We use VOIDmode for integers. */
475 value = rtx_alloc (CONST_DOUBLE);
476 PUT_MODE (value, VOIDmode);
478 CONST_DOUBLE_LOW (value) = i0;
479 CONST_DOUBLE_HIGH (value) = i1;
481 for (i = 2; i < (sizeof CONST_DOUBLE_FORMAT - 1); i++)
482 XWINT (value, i) = 0;
484 return lookup_const_double (value);
488 gen_rtx_REG (enum machine_mode mode, unsigned int regno)
490 /* In case the MD file explicitly references the frame pointer, have
491 all such references point to the same frame pointer. This is
492 used during frame pointer elimination to distinguish the explicit
493 references to these registers from pseudos that happened to be
496 If we have eliminated the frame pointer or arg pointer, we will
497 be using it as a normal register, for example as a spill
498 register. In such cases, we might be accessing it in a mode that
499 is not Pmode and therefore cannot use the pre-allocated rtx.
501 Also don't do this when we are making new REGs in reload, since
502 we don't want to get confused with the real pointers. */
504 if (mode == Pmode && !reload_in_progress)
506 if (regno == FRAME_POINTER_REGNUM
507 && (!reload_completed || frame_pointer_needed))
508 return frame_pointer_rtx;
509 #if FRAME_POINTER_REGNUM != HARD_FRAME_POINTER_REGNUM
510 if (regno == HARD_FRAME_POINTER_REGNUM
511 && (!reload_completed || frame_pointer_needed))
512 return hard_frame_pointer_rtx;
514 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM && HARD_FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
515 if (regno == ARG_POINTER_REGNUM)
516 return arg_pointer_rtx;
518 #ifdef RETURN_ADDRESS_POINTER_REGNUM
519 if (regno == RETURN_ADDRESS_POINTER_REGNUM)
520 return return_address_pointer_rtx;
522 if (regno == (unsigned) PIC_OFFSET_TABLE_REGNUM
523 && fixed_regs[PIC_OFFSET_TABLE_REGNUM])
524 return pic_offset_table_rtx;
525 if (regno == STACK_POINTER_REGNUM)
526 return stack_pointer_rtx;
530 /* If the per-function register table has been set up, try to re-use
531 an existing entry in that table to avoid useless generation of RTL.
533 This code is disabled for now until we can fix the various backends
534 which depend on having non-shared hard registers in some cases. Long
535 term we want to re-enable this code as it can significantly cut down
536 on the amount of useless RTL that gets generated.
538 We'll also need to fix some code that runs after reload that wants to
539 set ORIGINAL_REGNO. */
544 && regno < FIRST_PSEUDO_REGISTER
545 && reg_raw_mode[regno] == mode)
546 return regno_reg_rtx[regno];
549 return gen_raw_REG (mode, regno);
553 gen_rtx_MEM (enum machine_mode mode, rtx addr)
555 rtx rt = gen_rtx_raw_MEM (mode, addr);
557 /* This field is not cleared by the mere allocation of the rtx, so
564 /* Generate a memory referring to non-trapping constant memory. */
567 gen_const_mem (enum machine_mode mode, rtx addr)
569 rtx mem = gen_rtx_MEM (mode, addr);
570 MEM_READONLY_P (mem) = 1;
571 MEM_NOTRAP_P (mem) = 1;
575 /* Generate a MEM referring to fixed portions of the frame, e.g., register
579 gen_frame_mem (enum machine_mode mode, rtx addr)
581 rtx mem = gen_rtx_MEM (mode, addr);
582 MEM_NOTRAP_P (mem) = 1;
583 set_mem_alias_set (mem, get_frame_alias_set ());
587 /* Generate a MEM referring to a temporary use of the stack, not part
588 of the fixed stack frame. For example, something which is pushed
589 by a target splitter. */
591 gen_tmp_stack_mem (enum machine_mode mode, rtx addr)
593 rtx mem = gen_rtx_MEM (mode, addr);
594 MEM_NOTRAP_P (mem) = 1;
595 if (!current_function_calls_alloca)
596 set_mem_alias_set (mem, get_frame_alias_set ());
600 /* We want to create (subreg:OMODE (obj:IMODE) OFFSET). Return true if
601 this construct would be valid, and false otherwise. */
604 validate_subreg (enum machine_mode omode, enum machine_mode imode,
605 rtx reg, unsigned int offset)
607 unsigned int isize = GET_MODE_SIZE (imode);
608 unsigned int osize = GET_MODE_SIZE (omode);
610 /* All subregs must be aligned. */
611 if (offset % osize != 0)
614 /* The subreg offset cannot be outside the inner object. */
618 /* ??? This should not be here. Temporarily continue to allow word_mode
619 subregs of anything. The most common offender is (subreg:SI (reg:DF)).
620 Generally, backends are doing something sketchy but it'll take time to
622 if (omode == word_mode)
624 /* ??? Similarly, e.g. with (subreg:DF (reg:TI)). Though store_bit_field
625 is the culprit here, and not the backends. */
626 else if (osize >= UNITS_PER_WORD && isize >= osize)
628 /* Allow component subregs of complex and vector. Though given the below
629 extraction rules, it's not always clear what that means. */
630 else if ((COMPLEX_MODE_P (imode) || VECTOR_MODE_P (imode))
631 && GET_MODE_INNER (imode) == omode)
633 /* ??? x86 sse code makes heavy use of *paradoxical* vector subregs,
634 i.e. (subreg:V4SF (reg:SF) 0). This surely isn't the cleanest way to
635 represent this. It's questionable if this ought to be represented at
636 all -- why can't this all be hidden in post-reload splitters that make
637 arbitrarily mode changes to the registers themselves. */
638 else if (VECTOR_MODE_P (omode) && GET_MODE_INNER (omode) == imode)
640 /* Subregs involving floating point modes are not allowed to
641 change size. Therefore (subreg:DI (reg:DF) 0) is fine, but
642 (subreg:SI (reg:DF) 0) isn't. */
643 else if (FLOAT_MODE_P (imode) || FLOAT_MODE_P (omode))
649 /* Paradoxical subregs must have offset zero. */
653 /* This is a normal subreg. Verify that the offset is representable. */
655 /* For hard registers, we already have most of these rules collected in
656 subreg_offset_representable_p. */
657 if (reg && REG_P (reg) && HARD_REGISTER_P (reg))
659 unsigned int regno = REGNO (reg);
661 #ifdef CANNOT_CHANGE_MODE_CLASS
662 if ((COMPLEX_MODE_P (imode) || VECTOR_MODE_P (imode))
663 && GET_MODE_INNER (imode) == omode)
665 else if (REG_CANNOT_CHANGE_MODE_P (regno, imode, omode))
669 return subreg_offset_representable_p (regno, imode, offset, omode);
672 /* For pseudo registers, we want most of the same checks. Namely:
673 If the register no larger than a word, the subreg must be lowpart.
674 If the register is larger than a word, the subreg must be the lowpart
675 of a subword. A subreg does *not* perform arbitrary bit extraction.
676 Given that we've already checked mode/offset alignment, we only have
677 to check subword subregs here. */
678 if (osize < UNITS_PER_WORD)
680 enum machine_mode wmode = isize > UNITS_PER_WORD ? word_mode : imode;
681 unsigned int low_off = subreg_lowpart_offset (omode, wmode);
682 if (offset % UNITS_PER_WORD != low_off)
689 gen_rtx_SUBREG (enum machine_mode mode, rtx reg, int offset)
691 gcc_assert (validate_subreg (mode, GET_MODE (reg), reg, offset));
692 return gen_rtx_raw_SUBREG (mode, reg, offset);
695 /* Generate a SUBREG representing the least-significant part of REG if MODE
696 is smaller than mode of REG, otherwise paradoxical SUBREG. */
699 gen_lowpart_SUBREG (enum machine_mode mode, rtx reg)
701 enum machine_mode inmode;
703 inmode = GET_MODE (reg);
704 if (inmode == VOIDmode)
706 return gen_rtx_SUBREG (mode, reg,
707 subreg_lowpart_offset (mode, inmode));
710 /* gen_rtvec (n, [rt1, ..., rtn])
712 ** This routine creates an rtvec and stores within it the
713 ** pointers to rtx's which are its arguments.
718 gen_rtvec (int n, ...)
727 return NULL_RTVEC; /* Don't allocate an empty rtvec... */
729 vector = alloca (n * sizeof (rtx));
731 for (i = 0; i < n; i++)
732 vector[i] = va_arg (p, rtx);
734 /* The definition of VA_* in K&R C causes `n' to go out of scope. */
738 return gen_rtvec_v (save_n, vector);
742 gen_rtvec_v (int n, rtx *argp)
748 return NULL_RTVEC; /* Don't allocate an empty rtvec... */
750 rt_val = rtvec_alloc (n); /* Allocate an rtvec... */
752 for (i = 0; i < n; i++)
753 rt_val->elem[i] = *argp++;
758 /* Generate a REG rtx for a new pseudo register of mode MODE.
759 This pseudo is assigned the next sequential register number. */
762 gen_reg_rtx (enum machine_mode mode)
764 struct function *f = cfun;
767 /* Don't let anything called after initial flow analysis create new
769 gcc_assert (!no_new_pseudos);
771 if (generating_concat_p
772 && (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT
773 || GET_MODE_CLASS (mode) == MODE_COMPLEX_INT))
775 /* For complex modes, don't make a single pseudo.
776 Instead, make a CONCAT of two pseudos.
777 This allows noncontiguous allocation of the real and imaginary parts,
778 which makes much better code. Besides, allocating DCmode
779 pseudos overstrains reload on some machines like the 386. */
780 rtx realpart, imagpart;
781 enum machine_mode partmode = GET_MODE_INNER (mode);
783 realpart = gen_reg_rtx (partmode);
784 imagpart = gen_reg_rtx (partmode);
785 return gen_rtx_CONCAT (mode, realpart, imagpart);
788 /* Make sure regno_pointer_align, and regno_reg_rtx are large
789 enough to have an element for this pseudo reg number. */
791 if (reg_rtx_no == f->emit->regno_pointer_align_length)
793 int old_size = f->emit->regno_pointer_align_length;
797 new = ggc_realloc (f->emit->regno_pointer_align, old_size * 2);
798 memset (new + old_size, 0, old_size);
799 f->emit->regno_pointer_align = (unsigned char *) new;
801 new1 = ggc_realloc (f->emit->x_regno_reg_rtx,
802 old_size * 2 * sizeof (rtx));
803 memset (new1 + old_size, 0, old_size * sizeof (rtx));
804 regno_reg_rtx = new1;
806 f->emit->regno_pointer_align_length = old_size * 2;
809 val = gen_raw_REG (mode, reg_rtx_no);
810 regno_reg_rtx[reg_rtx_no++] = val;
814 /* Update NEW with the same attributes as REG, but offsetted by OFFSET.
815 Do the big endian correction if needed. */
818 update_reg_offset (rtx new, rtx reg, int offset)
821 HOST_WIDE_INT var_size;
823 /* PR middle-end/14084
824 The problem appears when a variable is stored in a larger register
825 and later it is used in the original mode or some mode in between
826 or some part of variable is accessed.
828 On little endian machines there is no problem because
829 the REG_OFFSET of the start of the variable is the same when
830 accessed in any mode (it is 0).
832 However, this is not true on big endian machines.
833 The offset of the start of the variable is different when accessed
835 When we are taking a part of the REG we have to change the OFFSET
836 from offset WRT size of mode of REG to offset WRT size of variable.
838 If we would not do the big endian correction the resulting REG_OFFSET
839 would be larger than the size of the DECL.
841 Examples of correction, for BYTES_BIG_ENDIAN WORDS_BIG_ENDIAN machine:
843 REG.mode MODE DECL size old offset new offset description
844 DI SI 4 4 0 int32 in SImode
845 DI SI 1 4 0 char in SImode
846 DI QI 1 7 0 char in QImode
847 DI QI 4 5 1 1st element in QImode
849 DI HI 4 6 2 1st element in HImode
852 If the size of DECL is equal or greater than the size of REG
853 we can't do this correction because the register holds the
854 whole variable or a part of the variable and thus the REG_OFFSET
855 is already correct. */
857 decl = REG_EXPR (reg);
858 if ((BYTES_BIG_ENDIAN || WORDS_BIG_ENDIAN)
861 && GET_MODE_SIZE (GET_MODE (reg)) > GET_MODE_SIZE (GET_MODE (new))
862 && ((var_size = int_size_in_bytes (TREE_TYPE (decl))) > 0
863 && var_size < GET_MODE_SIZE (GET_MODE (reg))))
867 /* Convert machine endian to little endian WRT size of mode of REG. */
868 if (WORDS_BIG_ENDIAN)
869 offset_le = ((GET_MODE_SIZE (GET_MODE (reg)) - 1 - offset)
870 / UNITS_PER_WORD) * UNITS_PER_WORD;
872 offset_le = (offset / UNITS_PER_WORD) * UNITS_PER_WORD;
874 if (BYTES_BIG_ENDIAN)
875 offset_le += ((GET_MODE_SIZE (GET_MODE (reg)) - 1 - offset)
878 offset_le += offset % UNITS_PER_WORD;
880 if (offset_le >= var_size)
882 /* MODE is wider than the variable so the new reg will cover
883 the whole variable so the resulting OFFSET should be 0. */
888 /* Convert little endian to machine endian WRT size of variable. */
889 if (WORDS_BIG_ENDIAN)
890 offset = ((var_size - 1 - offset_le)
891 / UNITS_PER_WORD) * UNITS_PER_WORD;
893 offset = (offset_le / UNITS_PER_WORD) * UNITS_PER_WORD;
895 if (BYTES_BIG_ENDIAN)
896 offset += ((var_size - 1 - offset_le)
899 offset += offset_le % UNITS_PER_WORD;
903 REG_ATTRS (new) = get_reg_attrs (REG_EXPR (reg),
904 REG_OFFSET (reg) + offset);
907 /* Generate a register with same attributes as REG, but offsetted by
911 gen_rtx_REG_offset (rtx reg, enum machine_mode mode, unsigned int regno,
914 rtx new = gen_rtx_REG (mode, regno);
916 update_reg_offset (new, reg, offset);
920 /* Generate a new pseudo-register with the same attributes as REG, but
921 offsetted by OFFSET. */
924 gen_reg_rtx_offset (rtx reg, enum machine_mode mode, int offset)
926 rtx new = gen_reg_rtx (mode);
928 update_reg_offset (new, reg, offset);
932 /* Set the decl for MEM to DECL. */
935 set_reg_attrs_from_mem (rtx reg, rtx mem)
937 if (MEM_OFFSET (mem) && GET_CODE (MEM_OFFSET (mem)) == CONST_INT)
939 = get_reg_attrs (MEM_EXPR (mem), INTVAL (MEM_OFFSET (mem)));
942 /* Set the register attributes for registers contained in PARM_RTX.
943 Use needed values from memory attributes of MEM. */
946 set_reg_attrs_for_parm (rtx parm_rtx, rtx mem)
948 if (REG_P (parm_rtx))
949 set_reg_attrs_from_mem (parm_rtx, mem);
950 else if (GET_CODE (parm_rtx) == PARALLEL)
952 /* Check for a NULL entry in the first slot, used to indicate that the
953 parameter goes both on the stack and in registers. */
954 int i = XEXP (XVECEXP (parm_rtx, 0, 0), 0) ? 0 : 1;
955 for (; i < XVECLEN (parm_rtx, 0); i++)
957 rtx x = XVECEXP (parm_rtx, 0, i);
958 if (REG_P (XEXP (x, 0)))
959 REG_ATTRS (XEXP (x, 0))
960 = get_reg_attrs (MEM_EXPR (mem),
961 INTVAL (XEXP (x, 1)));
966 /* Assign the RTX X to declaration T. */
968 set_decl_rtl (tree t, rtx x)
970 DECL_WRTL_CHECK (t)->decl_with_rtl.rtl = x;
974 /* For register, we maintain the reverse information too. */
976 REG_ATTRS (x) = get_reg_attrs (t, 0);
977 else if (GET_CODE (x) == SUBREG)
978 REG_ATTRS (SUBREG_REG (x))
979 = get_reg_attrs (t, -SUBREG_BYTE (x));
980 if (GET_CODE (x) == CONCAT)
982 if (REG_P (XEXP (x, 0)))
983 REG_ATTRS (XEXP (x, 0)) = get_reg_attrs (t, 0);
984 if (REG_P (XEXP (x, 1)))
985 REG_ATTRS (XEXP (x, 1))
986 = get_reg_attrs (t, GET_MODE_UNIT_SIZE (GET_MODE (XEXP (x, 0))));
988 if (GET_CODE (x) == PARALLEL)
991 for (i = 0; i < XVECLEN (x, 0); i++)
993 rtx y = XVECEXP (x, 0, i);
994 if (REG_P (XEXP (y, 0)))
995 REG_ATTRS (XEXP (y, 0)) = get_reg_attrs (t, INTVAL (XEXP (y, 1)));
1000 /* Assign the RTX X to parameter declaration T. */
1002 set_decl_incoming_rtl (tree t, rtx x)
1004 DECL_INCOMING_RTL (t) = x;
1008 /* For register, we maintain the reverse information too. */
1010 REG_ATTRS (x) = get_reg_attrs (t, 0);
1011 else if (GET_CODE (x) == SUBREG)
1012 REG_ATTRS (SUBREG_REG (x))
1013 = get_reg_attrs (t, -SUBREG_BYTE (x));
1014 if (GET_CODE (x) == CONCAT)
1016 if (REG_P (XEXP (x, 0)))
1017 REG_ATTRS (XEXP (x, 0)) = get_reg_attrs (t, 0);
1018 if (REG_P (XEXP (x, 1)))
1019 REG_ATTRS (XEXP (x, 1))
1020 = get_reg_attrs (t, GET_MODE_UNIT_SIZE (GET_MODE (XEXP (x, 0))));
1022 if (GET_CODE (x) == PARALLEL)
1026 /* Check for a NULL entry, used to indicate that the parameter goes
1027 both on the stack and in registers. */
1028 if (XEXP (XVECEXP (x, 0, 0), 0))
1033 for (i = start; i < XVECLEN (x, 0); i++)
1035 rtx y = XVECEXP (x, 0, i);
1036 if (REG_P (XEXP (y, 0)))
1037 REG_ATTRS (XEXP (y, 0)) = get_reg_attrs (t, INTVAL (XEXP (y, 1)));
1042 /* Identify REG (which may be a CONCAT) as a user register. */
1045 mark_user_reg (rtx reg)
1047 if (GET_CODE (reg) == CONCAT)
1049 REG_USERVAR_P (XEXP (reg, 0)) = 1;
1050 REG_USERVAR_P (XEXP (reg, 1)) = 1;
1054 gcc_assert (REG_P (reg));
1055 REG_USERVAR_P (reg) = 1;
1059 /* Identify REG as a probable pointer register and show its alignment
1060 as ALIGN, if nonzero. */
1063 mark_reg_pointer (rtx reg, int align)
1065 if (! REG_POINTER (reg))
1067 REG_POINTER (reg) = 1;
1070 REGNO_POINTER_ALIGN (REGNO (reg)) = align;
1072 else if (align && align < REGNO_POINTER_ALIGN (REGNO (reg)))
1073 /* We can no-longer be sure just how aligned this pointer is. */
1074 REGNO_POINTER_ALIGN (REGNO (reg)) = align;
1077 /* Return 1 plus largest pseudo reg number used in the current function. */
1085 /* Return 1 + the largest label number used so far in the current function. */
1088 max_label_num (void)
1093 /* Return first label number used in this function (if any were used). */
1096 get_first_label_num (void)
1098 return first_label_num;
1101 /* If the rtx for label was created during the expansion of a nested
1102 function, then first_label_num won't include this label number.
1103 Fix this now so that array indicies work later. */
1106 maybe_set_first_label_num (rtx x)
1108 if (CODE_LABEL_NUMBER (x) < first_label_num)
1109 first_label_num = CODE_LABEL_NUMBER (x);
1112 /* Return a value representing some low-order bits of X, where the number
1113 of low-order bits is given by MODE. Note that no conversion is done
1114 between floating-point and fixed-point values, rather, the bit
1115 representation is returned.
1117 This function handles the cases in common between gen_lowpart, below,
1118 and two variants in cse.c and combine.c. These are the cases that can
1119 be safely handled at all points in the compilation.
1121 If this is not a case we can handle, return 0. */
1124 gen_lowpart_common (enum machine_mode mode, rtx x)
1126 int msize = GET_MODE_SIZE (mode);
1129 enum machine_mode innermode;
1131 /* Unfortunately, this routine doesn't take a parameter for the mode of X,
1132 so we have to make one up. Yuk. */
1133 innermode = GET_MODE (x);
1134 if (GET_CODE (x) == CONST_INT
1135 && msize * BITS_PER_UNIT <= HOST_BITS_PER_WIDE_INT)
1136 innermode = mode_for_size (HOST_BITS_PER_WIDE_INT, MODE_INT, 0);
1137 else if (innermode == VOIDmode)
1138 innermode = mode_for_size (HOST_BITS_PER_WIDE_INT * 2, MODE_INT, 0);
1140 xsize = GET_MODE_SIZE (innermode);
1142 gcc_assert (innermode != VOIDmode && innermode != BLKmode);
1144 if (innermode == mode)
1147 /* MODE must occupy no more words than the mode of X. */
1148 if ((msize + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD
1149 > ((xsize + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD))
1152 /* Don't allow generating paradoxical FLOAT_MODE subregs. */
1153 if (SCALAR_FLOAT_MODE_P (mode) && msize > xsize)
1156 offset = subreg_lowpart_offset (mode, innermode);
1158 if ((GET_CODE (x) == ZERO_EXTEND || GET_CODE (x) == SIGN_EXTEND)
1159 && (GET_MODE_CLASS (mode) == MODE_INT
1160 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT))
1162 /* If we are getting the low-order part of something that has been
1163 sign- or zero-extended, we can either just use the object being
1164 extended or make a narrower extension. If we want an even smaller
1165 piece than the size of the object being extended, call ourselves
1168 This case is used mostly by combine and cse. */
1170 if (GET_MODE (XEXP (x, 0)) == mode)
1172 else if (msize < GET_MODE_SIZE (GET_MODE (XEXP (x, 0))))
1173 return gen_lowpart_common (mode, XEXP (x, 0));
1174 else if (msize < xsize)
1175 return gen_rtx_fmt_e (GET_CODE (x), mode, XEXP (x, 0));
1177 else if (GET_CODE (x) == SUBREG || REG_P (x)
1178 || GET_CODE (x) == CONCAT || GET_CODE (x) == CONST_VECTOR
1179 || GET_CODE (x) == CONST_DOUBLE || GET_CODE (x) == CONST_INT)
1180 return simplify_gen_subreg (mode, x, innermode, offset);
1182 /* Otherwise, we can't do this. */
1187 gen_highpart (enum machine_mode mode, rtx x)
1189 unsigned int msize = GET_MODE_SIZE (mode);
1192 /* This case loses if X is a subreg. To catch bugs early,
1193 complain if an invalid MODE is used even in other cases. */
1194 gcc_assert (msize <= UNITS_PER_WORD
1195 || msize == (unsigned int) GET_MODE_UNIT_SIZE (GET_MODE (x)));
1197 result = simplify_gen_subreg (mode, x, GET_MODE (x),
1198 subreg_highpart_offset (mode, GET_MODE (x)));
1199 gcc_assert (result);
1201 /* simplify_gen_subreg is not guaranteed to return a valid operand for
1202 the target if we have a MEM. gen_highpart must return a valid operand,
1203 emitting code if necessary to do so. */
1206 result = validize_mem (result);
1207 gcc_assert (result);
1213 /* Like gen_highpart, but accept mode of EXP operand in case EXP can
1214 be VOIDmode constant. */
1216 gen_highpart_mode (enum machine_mode outermode, enum machine_mode innermode, rtx exp)
1218 if (GET_MODE (exp) != VOIDmode)
1220 gcc_assert (GET_MODE (exp) == innermode);
1221 return gen_highpart (outermode, exp);
1223 return simplify_gen_subreg (outermode, exp, innermode,
1224 subreg_highpart_offset (outermode, innermode));
1227 /* Return offset in bytes to get OUTERMODE low part
1228 of the value in mode INNERMODE stored in memory in target format. */
1231 subreg_lowpart_offset (enum machine_mode outermode, enum machine_mode innermode)
1233 unsigned int offset = 0;
1234 int difference = (GET_MODE_SIZE (innermode) - GET_MODE_SIZE (outermode));
1238 if (WORDS_BIG_ENDIAN)
1239 offset += (difference / UNITS_PER_WORD) * UNITS_PER_WORD;
1240 if (BYTES_BIG_ENDIAN)
1241 offset += difference % UNITS_PER_WORD;
1247 /* Return offset in bytes to get OUTERMODE high part
1248 of the value in mode INNERMODE stored in memory in target format. */
1250 subreg_highpart_offset (enum machine_mode outermode, enum machine_mode innermode)
1252 unsigned int offset = 0;
1253 int difference = (GET_MODE_SIZE (innermode) - GET_MODE_SIZE (outermode));
1255 gcc_assert (GET_MODE_SIZE (innermode) >= GET_MODE_SIZE (outermode));
1259 if (! WORDS_BIG_ENDIAN)
1260 offset += (difference / UNITS_PER_WORD) * UNITS_PER_WORD;
1261 if (! BYTES_BIG_ENDIAN)
1262 offset += difference % UNITS_PER_WORD;
1268 /* Return 1 iff X, assumed to be a SUBREG,
1269 refers to the least significant part of its containing reg.
1270 If X is not a SUBREG, always return 1 (it is its own low part!). */
1273 subreg_lowpart_p (rtx x)
1275 if (GET_CODE (x) != SUBREG)
1277 else if (GET_MODE (SUBREG_REG (x)) == VOIDmode)
1280 return (subreg_lowpart_offset (GET_MODE (x), GET_MODE (SUBREG_REG (x)))
1281 == SUBREG_BYTE (x));
1284 /* Return subword OFFSET of operand OP.
1285 The word number, OFFSET, is interpreted as the word number starting
1286 at the low-order address. OFFSET 0 is the low-order word if not
1287 WORDS_BIG_ENDIAN, otherwise it is the high-order word.
1289 If we cannot extract the required word, we return zero. Otherwise,
1290 an rtx corresponding to the requested word will be returned.
1292 VALIDATE_ADDRESS is nonzero if the address should be validated. Before
1293 reload has completed, a valid address will always be returned. After
1294 reload, if a valid address cannot be returned, we return zero.
1296 If VALIDATE_ADDRESS is zero, we simply form the required address; validating
1297 it is the responsibility of the caller.
1299 MODE is the mode of OP in case it is a CONST_INT.
1301 ??? This is still rather broken for some cases. The problem for the
1302 moment is that all callers of this thing provide no 'goal mode' to
1303 tell us to work with. This exists because all callers were written
1304 in a word based SUBREG world.
1305 Now use of this function can be deprecated by simplify_subreg in most
1310 operand_subword (rtx op, unsigned int offset, int validate_address, enum machine_mode mode)
1312 if (mode == VOIDmode)
1313 mode = GET_MODE (op);
1315 gcc_assert (mode != VOIDmode);
1317 /* If OP is narrower than a word, fail. */
1319 && (GET_MODE_SIZE (mode) < UNITS_PER_WORD))
1322 /* If we want a word outside OP, return zero. */
1324 && (offset + 1) * UNITS_PER_WORD > GET_MODE_SIZE (mode))
1327 /* Form a new MEM at the requested address. */
1330 rtx new = adjust_address_nv (op, word_mode, offset * UNITS_PER_WORD);
1332 if (! validate_address)
1335 else if (reload_completed)
1337 if (! strict_memory_address_p (word_mode, XEXP (new, 0)))
1341 return replace_equiv_address (new, XEXP (new, 0));
1344 /* Rest can be handled by simplify_subreg. */
1345 return simplify_gen_subreg (word_mode, op, mode, (offset * UNITS_PER_WORD));
1348 /* Similar to `operand_subword', but never return 0. If we can't
1349 extract the required subword, put OP into a register and try again.
1350 The second attempt must succeed. We always validate the address in
1353 MODE is the mode of OP, in case it is CONST_INT. */
1356 operand_subword_force (rtx op, unsigned int offset, enum machine_mode mode)
1358 rtx result = operand_subword (op, offset, 1, mode);
1363 if (mode != BLKmode && mode != VOIDmode)
1365 /* If this is a register which can not be accessed by words, copy it
1366 to a pseudo register. */
1368 op = copy_to_reg (op);
1370 op = force_reg (mode, op);
1373 result = operand_subword (op, offset, 1, mode);
1374 gcc_assert (result);
1379 /* Within a MEM_EXPR, we care about either (1) a component ref of a decl,
1380 or (2) a component ref of something variable. Represent the later with
1381 a NULL expression. */
1384 component_ref_for_mem_expr (tree ref)
1386 tree inner = TREE_OPERAND (ref, 0);
1388 if (TREE_CODE (inner) == COMPONENT_REF)
1389 inner = component_ref_for_mem_expr (inner);
1392 /* Now remove any conversions: they don't change what the underlying
1393 object is. Likewise for SAVE_EXPR. */
1394 while (TREE_CODE (inner) == NOP_EXPR || TREE_CODE (inner) == CONVERT_EXPR
1395 || TREE_CODE (inner) == NON_LVALUE_EXPR
1396 || TREE_CODE (inner) == VIEW_CONVERT_EXPR
1397 || TREE_CODE (inner) == SAVE_EXPR)
1398 inner = TREE_OPERAND (inner, 0);
1400 if (! DECL_P (inner))
1404 if (inner == TREE_OPERAND (ref, 0))
1407 return build3 (COMPONENT_REF, TREE_TYPE (ref), inner,
1408 TREE_OPERAND (ref, 1), NULL_TREE);
1411 /* Returns 1 if both MEM_EXPR can be considered equal
1415 mem_expr_equal_p (tree expr1, tree expr2)
1420 if (! expr1 || ! expr2)
1423 if (TREE_CODE (expr1) != TREE_CODE (expr2))
1426 if (TREE_CODE (expr1) == COMPONENT_REF)
1428 mem_expr_equal_p (TREE_OPERAND (expr1, 0),
1429 TREE_OPERAND (expr2, 0))
1430 && mem_expr_equal_p (TREE_OPERAND (expr1, 1), /* field decl */
1431 TREE_OPERAND (expr2, 1));
1433 if (INDIRECT_REF_P (expr1))
1434 return mem_expr_equal_p (TREE_OPERAND (expr1, 0),
1435 TREE_OPERAND (expr2, 0));
1437 /* ARRAY_REFs, ARRAY_RANGE_REFs and BIT_FIELD_REFs should already
1438 have been resolved here. */
1439 gcc_assert (DECL_P (expr1));
1441 /* Decls with different pointers can't be equal. */
1445 /* Given REF, a MEM, and T, either the type of X or the expression
1446 corresponding to REF, set the memory attributes. OBJECTP is nonzero
1447 if we are making a new object of this type. BITPOS is nonzero if
1448 there is an offset outstanding on T that will be applied later. */
1451 set_mem_attributes_minus_bitpos (rtx ref, tree t, int objectp,
1452 HOST_WIDE_INT bitpos)
1454 HOST_WIDE_INT alias = MEM_ALIAS_SET (ref);
1455 tree expr = MEM_EXPR (ref);
1456 rtx offset = MEM_OFFSET (ref);
1457 rtx size = MEM_SIZE (ref);
1458 unsigned int align = MEM_ALIGN (ref);
1459 HOST_WIDE_INT apply_bitpos = 0;
1462 /* It can happen that type_for_mode was given a mode for which there
1463 is no language-level type. In which case it returns NULL, which
1468 type = TYPE_P (t) ? t : TREE_TYPE (t);
1469 if (type == error_mark_node)
1472 /* If we have already set DECL_RTL = ref, get_alias_set will get the
1473 wrong answer, as it assumes that DECL_RTL already has the right alias
1474 info. Callers should not set DECL_RTL until after the call to
1475 set_mem_attributes. */
1476 gcc_assert (!DECL_P (t) || ref != DECL_RTL_IF_SET (t));
1478 /* Get the alias set from the expression or type (perhaps using a
1479 front-end routine) and use it. */
1480 alias = get_alias_set (t);
1482 MEM_VOLATILE_P (ref) |= TYPE_VOLATILE (type);
1483 MEM_IN_STRUCT_P (ref)
1484 = AGGREGATE_TYPE_P (type) || TREE_CODE (type) == COMPLEX_TYPE;
1485 MEM_POINTER (ref) = POINTER_TYPE_P (type);
1487 /* If we are making an object of this type, or if this is a DECL, we know
1488 that it is a scalar if the type is not an aggregate. */
1489 if ((objectp || DECL_P (t))
1490 && ! AGGREGATE_TYPE_P (type)
1491 && TREE_CODE (type) != COMPLEX_TYPE)
1492 MEM_SCALAR_P (ref) = 1;
1494 /* We can set the alignment from the type if we are making an object,
1495 this is an INDIRECT_REF, or if TYPE_ALIGN_OK. */
1496 if (objectp || TREE_CODE (t) == INDIRECT_REF
1497 || TREE_CODE (t) == ALIGN_INDIRECT_REF
1498 || TYPE_ALIGN_OK (type))
1499 align = MAX (align, TYPE_ALIGN (type));
1501 if (TREE_CODE (t) == MISALIGNED_INDIRECT_REF)
1503 if (integer_zerop (TREE_OPERAND (t, 1)))
1504 /* We don't know anything about the alignment. */
1505 align = BITS_PER_UNIT;
1507 align = tree_low_cst (TREE_OPERAND (t, 1), 1);
1510 /* If the size is known, we can set that. */
1511 if (TYPE_SIZE_UNIT (type) && host_integerp (TYPE_SIZE_UNIT (type), 1))
1512 size = GEN_INT (tree_low_cst (TYPE_SIZE_UNIT (type), 1));
1514 /* If T is not a type, we may be able to deduce some more information about
1520 if (TREE_THIS_VOLATILE (t))
1521 MEM_VOLATILE_P (ref) = 1;
1523 /* Now remove any conversions: they don't change what the underlying
1524 object is. Likewise for SAVE_EXPR. */
1525 while (TREE_CODE (t) == NOP_EXPR || TREE_CODE (t) == CONVERT_EXPR
1526 || TREE_CODE (t) == NON_LVALUE_EXPR
1527 || TREE_CODE (t) == VIEW_CONVERT_EXPR
1528 || TREE_CODE (t) == SAVE_EXPR)
1529 t = TREE_OPERAND (t, 0);
1531 /* We may look through structure-like accesses for the purposes of
1532 examining TREE_THIS_NOTRAP, but not array-like accesses. */
1534 while (TREE_CODE (base) == COMPONENT_REF
1535 || TREE_CODE (base) == REALPART_EXPR
1536 || TREE_CODE (base) == IMAGPART_EXPR
1537 || TREE_CODE (base) == BIT_FIELD_REF)
1538 base = TREE_OPERAND (base, 0);
1542 if (CODE_CONTAINS_STRUCT (TREE_CODE (base), TS_DECL_WITH_VIS))
1543 MEM_NOTRAP_P (ref) = !DECL_WEAK (base);
1545 MEM_NOTRAP_P (ref) = 1;
1548 MEM_NOTRAP_P (ref) = TREE_THIS_NOTRAP (base);
1550 base = get_base_address (base);
1551 if (base && DECL_P (base)
1552 && TREE_READONLY (base)
1553 && (TREE_STATIC (base) || DECL_EXTERNAL (base)))
1555 tree base_type = TREE_TYPE (base);
1556 gcc_assert (!(base_type && TYPE_NEEDS_CONSTRUCTING (base_type))
1557 || DECL_ARTIFICIAL (base));
1558 MEM_READONLY_P (ref) = 1;
1561 /* If this expression uses it's parent's alias set, mark it such
1562 that we won't change it. */
1563 if (component_uses_parent_alias_set (t))
1564 MEM_KEEP_ALIAS_SET_P (ref) = 1;
1566 /* If this is a decl, set the attributes of the MEM from it. */
1570 offset = const0_rtx;
1571 apply_bitpos = bitpos;
1572 size = (DECL_SIZE_UNIT (t)
1573 && host_integerp (DECL_SIZE_UNIT (t), 1)
1574 ? GEN_INT (tree_low_cst (DECL_SIZE_UNIT (t), 1)) : 0);
1575 align = DECL_ALIGN (t);
1578 /* If this is a constant, we know the alignment. */
1579 else if (CONSTANT_CLASS_P (t))
1581 align = TYPE_ALIGN (type);
1582 #ifdef CONSTANT_ALIGNMENT
1583 align = CONSTANT_ALIGNMENT (t, align);
1587 /* If this is a field reference and not a bit-field, record it. */
1588 /* ??? There is some information that can be gleened from bit-fields,
1589 such as the word offset in the structure that might be modified.
1590 But skip it for now. */
1591 else if (TREE_CODE (t) == COMPONENT_REF
1592 && ! DECL_BIT_FIELD (TREE_OPERAND (t, 1)))
1594 expr = component_ref_for_mem_expr (t);
1595 offset = const0_rtx;
1596 apply_bitpos = bitpos;
1597 /* ??? Any reason the field size would be different than
1598 the size we got from the type? */
1601 /* If this is an array reference, look for an outer field reference. */
1602 else if (TREE_CODE (t) == ARRAY_REF)
1604 tree off_tree = size_zero_node;
1605 /* We can't modify t, because we use it at the end of the
1611 tree index = TREE_OPERAND (t2, 1);
1612 tree low_bound = array_ref_low_bound (t2);
1613 tree unit_size = array_ref_element_size (t2);
1615 /* We assume all arrays have sizes that are a multiple of a byte.
1616 First subtract the lower bound, if any, in the type of the
1617 index, then convert to sizetype and multiply by the size of
1618 the array element. */
1619 if (! integer_zerop (low_bound))
1620 index = fold_build2 (MINUS_EXPR, TREE_TYPE (index),
1623 off_tree = size_binop (PLUS_EXPR,
1624 size_binop (MULT_EXPR,
1625 fold_convert (sizetype,
1629 t2 = TREE_OPERAND (t2, 0);
1631 while (TREE_CODE (t2) == ARRAY_REF);
1637 if (host_integerp (off_tree, 1))
1639 HOST_WIDE_INT ioff = tree_low_cst (off_tree, 1);
1640 HOST_WIDE_INT aoff = (ioff & -ioff) * BITS_PER_UNIT;
1641 align = DECL_ALIGN (t2);
1642 if (aoff && (unsigned HOST_WIDE_INT) aoff < align)
1644 offset = GEN_INT (ioff);
1645 apply_bitpos = bitpos;
1648 else if (TREE_CODE (t2) == COMPONENT_REF)
1650 expr = component_ref_for_mem_expr (t2);
1651 if (host_integerp (off_tree, 1))
1653 offset = GEN_INT (tree_low_cst (off_tree, 1));
1654 apply_bitpos = bitpos;
1656 /* ??? Any reason the field size would be different than
1657 the size we got from the type? */
1659 else if (flag_argument_noalias > 1
1660 && (INDIRECT_REF_P (t2))
1661 && TREE_CODE (TREE_OPERAND (t2, 0)) == PARM_DECL)
1668 /* If this is a Fortran indirect argument reference, record the
1670 else if (flag_argument_noalias > 1
1671 && (INDIRECT_REF_P (t))
1672 && TREE_CODE (TREE_OPERAND (t, 0)) == PARM_DECL)
1679 /* If we modified OFFSET based on T, then subtract the outstanding
1680 bit position offset. Similarly, increase the size of the accessed
1681 object to contain the negative offset. */
1684 offset = plus_constant (offset, -(apply_bitpos / BITS_PER_UNIT));
1686 size = plus_constant (size, apply_bitpos / BITS_PER_UNIT);
1689 if (TREE_CODE (t) == ALIGN_INDIRECT_REF)
1691 /* Force EXPR and OFFSE to NULL, since we don't know exactly what
1692 we're overlapping. */
1697 /* Now set the attributes we computed above. */
1699 = get_mem_attrs (alias, expr, offset, size, align, GET_MODE (ref));
1701 /* If this is already known to be a scalar or aggregate, we are done. */
1702 if (MEM_IN_STRUCT_P (ref) || MEM_SCALAR_P (ref))
1705 /* If it is a reference into an aggregate, this is part of an aggregate.
1706 Otherwise we don't know. */
1707 else if (TREE_CODE (t) == COMPONENT_REF || TREE_CODE (t) == ARRAY_REF
1708 || TREE_CODE (t) == ARRAY_RANGE_REF
1709 || TREE_CODE (t) == BIT_FIELD_REF)
1710 MEM_IN_STRUCT_P (ref) = 1;
1714 set_mem_attributes (rtx ref, tree t, int objectp)
1716 set_mem_attributes_minus_bitpos (ref, t, objectp, 0);
1719 /* Set the decl for MEM to DECL. */
1722 set_mem_attrs_from_reg (rtx mem, rtx reg)
1725 = get_mem_attrs (MEM_ALIAS_SET (mem), REG_EXPR (reg),
1726 GEN_INT (REG_OFFSET (reg)),
1727 MEM_SIZE (mem), MEM_ALIGN (mem), GET_MODE (mem));
1730 /* Set the alias set of MEM to SET. */
1733 set_mem_alias_set (rtx mem, HOST_WIDE_INT set)
1735 #ifdef ENABLE_CHECKING
1736 /* If the new and old alias sets don't conflict, something is wrong. */
1737 gcc_assert (alias_sets_conflict_p (set, MEM_ALIAS_SET (mem)));
1740 MEM_ATTRS (mem) = get_mem_attrs (set, MEM_EXPR (mem), MEM_OFFSET (mem),
1741 MEM_SIZE (mem), MEM_ALIGN (mem),
1745 /* Set the alignment of MEM to ALIGN bits. */
1748 set_mem_align (rtx mem, unsigned int align)
1750 MEM_ATTRS (mem) = get_mem_attrs (MEM_ALIAS_SET (mem), MEM_EXPR (mem),
1751 MEM_OFFSET (mem), MEM_SIZE (mem), align,
1755 /* Set the expr for MEM to EXPR. */
1758 set_mem_expr (rtx mem, tree expr)
1761 = get_mem_attrs (MEM_ALIAS_SET (mem), expr, MEM_OFFSET (mem),
1762 MEM_SIZE (mem), MEM_ALIGN (mem), GET_MODE (mem));
1765 /* Set the offset of MEM to OFFSET. */
1768 set_mem_offset (rtx mem, rtx offset)
1770 MEM_ATTRS (mem) = get_mem_attrs (MEM_ALIAS_SET (mem), MEM_EXPR (mem),
1771 offset, MEM_SIZE (mem), MEM_ALIGN (mem),
1775 /* Set the size of MEM to SIZE. */
1778 set_mem_size (rtx mem, rtx size)
1780 MEM_ATTRS (mem) = get_mem_attrs (MEM_ALIAS_SET (mem), MEM_EXPR (mem),
1781 MEM_OFFSET (mem), size, MEM_ALIGN (mem),
1785 /* Return a memory reference like MEMREF, but with its mode changed to MODE
1786 and its address changed to ADDR. (VOIDmode means don't change the mode.
1787 NULL for ADDR means don't change the address.) VALIDATE is nonzero if the
1788 returned memory location is required to be valid. The memory
1789 attributes are not changed. */
1792 change_address_1 (rtx memref, enum machine_mode mode, rtx addr, int validate)
1796 gcc_assert (MEM_P (memref));
1797 if (mode == VOIDmode)
1798 mode = GET_MODE (memref);
1800 addr = XEXP (memref, 0);
1801 if (mode == GET_MODE (memref) && addr == XEXP (memref, 0)
1802 && (!validate || memory_address_p (mode, addr)))
1807 if (reload_in_progress || reload_completed)
1808 gcc_assert (memory_address_p (mode, addr));
1810 addr = memory_address (mode, addr);
1813 if (rtx_equal_p (addr, XEXP (memref, 0)) && mode == GET_MODE (memref))
1816 new = gen_rtx_MEM (mode, addr);
1817 MEM_COPY_ATTRIBUTES (new, memref);
1821 /* Like change_address_1 with VALIDATE nonzero, but we are not saying in what
1822 way we are changing MEMREF, so we only preserve the alias set. */
1825 change_address (rtx memref, enum machine_mode mode, rtx addr)
1827 rtx new = change_address_1 (memref, mode, addr, 1), size;
1828 enum machine_mode mmode = GET_MODE (new);
1831 size = mmode == BLKmode ? 0 : GEN_INT (GET_MODE_SIZE (mmode));
1832 align = mmode == BLKmode ? BITS_PER_UNIT : GET_MODE_ALIGNMENT (mmode);
1834 /* If there are no changes, just return the original memory reference. */
1837 if (MEM_ATTRS (memref) == 0
1838 || (MEM_EXPR (memref) == NULL
1839 && MEM_OFFSET (memref) == NULL
1840 && MEM_SIZE (memref) == size
1841 && MEM_ALIGN (memref) == align))
1844 new = gen_rtx_MEM (mmode, XEXP (memref, 0));
1845 MEM_COPY_ATTRIBUTES (new, memref);
1849 = get_mem_attrs (MEM_ALIAS_SET (memref), 0, 0, size, align, mmode);
1854 /* Return a memory reference like MEMREF, but with its mode changed
1855 to MODE and its address offset by OFFSET bytes. If VALIDATE is
1856 nonzero, the memory address is forced to be valid.
1857 If ADJUST is zero, OFFSET is only used to update MEM_ATTRS
1858 and caller is responsible for adjusting MEMREF base register. */
1861 adjust_address_1 (rtx memref, enum machine_mode mode, HOST_WIDE_INT offset,
1862 int validate, int adjust)
1864 rtx addr = XEXP (memref, 0);
1866 rtx memoffset = MEM_OFFSET (memref);
1868 unsigned int memalign = MEM_ALIGN (memref);
1870 /* If there are no changes, just return the original memory reference. */
1871 if (mode == GET_MODE (memref) && !offset
1872 && (!validate || memory_address_p (mode, addr)))
1875 /* ??? Prefer to create garbage instead of creating shared rtl.
1876 This may happen even if offset is nonzero -- consider
1877 (plus (plus reg reg) const_int) -- so do this always. */
1878 addr = copy_rtx (addr);
1882 /* If MEMREF is a LO_SUM and the offset is within the alignment of the
1883 object, we can merge it into the LO_SUM. */
1884 if (GET_MODE (memref) != BLKmode && GET_CODE (addr) == LO_SUM
1886 && (unsigned HOST_WIDE_INT) offset
1887 < GET_MODE_ALIGNMENT (GET_MODE (memref)) / BITS_PER_UNIT)
1888 addr = gen_rtx_LO_SUM (Pmode, XEXP (addr, 0),
1889 plus_constant (XEXP (addr, 1), offset));
1891 addr = plus_constant (addr, offset);
1894 new = change_address_1 (memref, mode, addr, validate);
1896 /* Compute the new values of the memory attributes due to this adjustment.
1897 We add the offsets and update the alignment. */
1899 memoffset = GEN_INT (offset + INTVAL (memoffset));
1901 /* Compute the new alignment by taking the MIN of the alignment and the
1902 lowest-order set bit in OFFSET, but don't change the alignment if OFFSET
1907 (unsigned HOST_WIDE_INT) (offset & -offset) * BITS_PER_UNIT);
1909 /* We can compute the size in a number of ways. */
1910 if (GET_MODE (new) != BLKmode)
1911 size = GEN_INT (GET_MODE_SIZE (GET_MODE (new)));
1912 else if (MEM_SIZE (memref))
1913 size = plus_constant (MEM_SIZE (memref), -offset);
1915 MEM_ATTRS (new) = get_mem_attrs (MEM_ALIAS_SET (memref), MEM_EXPR (memref),
1916 memoffset, size, memalign, GET_MODE (new));
1918 /* At some point, we should validate that this offset is within the object,
1919 if all the appropriate values are known. */
1923 /* Return a memory reference like MEMREF, but with its mode changed
1924 to MODE and its address changed to ADDR, which is assumed to be
1925 MEMREF offseted by OFFSET bytes. If VALIDATE is
1926 nonzero, the memory address is forced to be valid. */
1929 adjust_automodify_address_1 (rtx memref, enum machine_mode mode, rtx addr,
1930 HOST_WIDE_INT offset, int validate)
1932 memref = change_address_1 (memref, VOIDmode, addr, validate);
1933 return adjust_address_1 (memref, mode, offset, validate, 0);
1936 /* Return a memory reference like MEMREF, but whose address is changed by
1937 adding OFFSET, an RTX, to it. POW2 is the highest power of two factor
1938 known to be in OFFSET (possibly 1). */
1941 offset_address (rtx memref, rtx offset, unsigned HOST_WIDE_INT pow2)
1943 rtx new, addr = XEXP (memref, 0);
1945 new = simplify_gen_binary (PLUS, Pmode, addr, offset);
1947 /* At this point we don't know _why_ the address is invalid. It
1948 could have secondary memory references, multiplies or anything.
1950 However, if we did go and rearrange things, we can wind up not
1951 being able to recognize the magic around pic_offset_table_rtx.
1952 This stuff is fragile, and is yet another example of why it is
1953 bad to expose PIC machinery too early. */
1954 if (! memory_address_p (GET_MODE (memref), new)
1955 && GET_CODE (addr) == PLUS
1956 && XEXP (addr, 0) == pic_offset_table_rtx)
1958 addr = force_reg (GET_MODE (addr), addr);
1959 new = simplify_gen_binary (PLUS, Pmode, addr, offset);
1962 update_temp_slot_address (XEXP (memref, 0), new);
1963 new = change_address_1 (memref, VOIDmode, new, 1);
1965 /* If there are no changes, just return the original memory reference. */
1969 /* Update the alignment to reflect the offset. Reset the offset, which
1972 = get_mem_attrs (MEM_ALIAS_SET (memref), MEM_EXPR (memref), 0, 0,
1973 MIN (MEM_ALIGN (memref), pow2 * BITS_PER_UNIT),
1978 /* Return a memory reference like MEMREF, but with its address changed to
1979 ADDR. The caller is asserting that the actual piece of memory pointed
1980 to is the same, just the form of the address is being changed, such as
1981 by putting something into a register. */
1984 replace_equiv_address (rtx memref, rtx addr)
1986 /* change_address_1 copies the memory attribute structure without change
1987 and that's exactly what we want here. */
1988 update_temp_slot_address (XEXP (memref, 0), addr);
1989 return change_address_1 (memref, VOIDmode, addr, 1);
1992 /* Likewise, but the reference is not required to be valid. */
1995 replace_equiv_address_nv (rtx memref, rtx addr)
1997 return change_address_1 (memref, VOIDmode, addr, 0);
2000 /* Return a memory reference like MEMREF, but with its mode widened to
2001 MODE and offset by OFFSET. This would be used by targets that e.g.
2002 cannot issue QImode memory operations and have to use SImode memory
2003 operations plus masking logic. */
2006 widen_memory_access (rtx memref, enum machine_mode mode, HOST_WIDE_INT offset)
2008 rtx new = adjust_address_1 (memref, mode, offset, 1, 1);
2009 tree expr = MEM_EXPR (new);
2010 rtx memoffset = MEM_OFFSET (new);
2011 unsigned int size = GET_MODE_SIZE (mode);
2013 /* If there are no changes, just return the original memory reference. */
2017 /* If we don't know what offset we were at within the expression, then
2018 we can't know if we've overstepped the bounds. */
2024 if (TREE_CODE (expr) == COMPONENT_REF)
2026 tree field = TREE_OPERAND (expr, 1);
2027 tree offset = component_ref_field_offset (expr);
2029 if (! DECL_SIZE_UNIT (field))
2035 /* Is the field at least as large as the access? If so, ok,
2036 otherwise strip back to the containing structure. */
2037 if (TREE_CODE (DECL_SIZE_UNIT (field)) == INTEGER_CST
2038 && compare_tree_int (DECL_SIZE_UNIT (field), size) >= 0
2039 && INTVAL (memoffset) >= 0)
2042 if (! host_integerp (offset, 1))
2048 expr = TREE_OPERAND (expr, 0);
2050 = (GEN_INT (INTVAL (memoffset)
2051 + tree_low_cst (offset, 1)
2052 + (tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 1)
2055 /* Similarly for the decl. */
2056 else if (DECL_P (expr)
2057 && DECL_SIZE_UNIT (expr)
2058 && TREE_CODE (DECL_SIZE_UNIT (expr)) == INTEGER_CST
2059 && compare_tree_int (DECL_SIZE_UNIT (expr), size) >= 0
2060 && (! memoffset || INTVAL (memoffset) >= 0))
2064 /* The widened memory access overflows the expression, which means
2065 that it could alias another expression. Zap it. */
2072 memoffset = NULL_RTX;
2074 /* The widened memory may alias other stuff, so zap the alias set. */
2075 /* ??? Maybe use get_alias_set on any remaining expression. */
2077 MEM_ATTRS (new) = get_mem_attrs (0, expr, memoffset, GEN_INT (size),
2078 MEM_ALIGN (new), mode);
2083 /* Return a newly created CODE_LABEL rtx with a unique label number. */
2086 gen_label_rtx (void)
2088 return gen_rtx_CODE_LABEL (VOIDmode, 0, NULL_RTX, NULL_RTX,
2089 NULL, label_num++, NULL);
2092 /* For procedure integration. */
2094 /* Install new pointers to the first and last insns in the chain.
2095 Also, set cur_insn_uid to one higher than the last in use.
2096 Used for an inline-procedure after copying the insn chain. */
2099 set_new_first_and_last_insn (rtx first, rtx last)
2107 for (insn = first; insn; insn = NEXT_INSN (insn))
2108 cur_insn_uid = MAX (cur_insn_uid, INSN_UID (insn));
2113 /* Go through all the RTL insn bodies and copy any invalid shared
2114 structure. This routine should only be called once. */
2117 unshare_all_rtl_1 (rtx insn)
2119 /* Unshare just about everything else. */
2120 unshare_all_rtl_in_chain (insn);
2122 /* Make sure the addresses of stack slots found outside the insn chain
2123 (such as, in DECL_RTL of a variable) are not shared
2124 with the insn chain.
2126 This special care is necessary when the stack slot MEM does not
2127 actually appear in the insn chain. If it does appear, its address
2128 is unshared from all else at that point. */
2129 stack_slot_list = copy_rtx_if_shared (stack_slot_list);
2132 /* Go through all the RTL insn bodies and copy any invalid shared
2133 structure, again. This is a fairly expensive thing to do so it
2134 should be done sparingly. */
2137 unshare_all_rtl_again (rtx insn)
2142 for (p = insn; p; p = NEXT_INSN (p))
2145 reset_used_flags (PATTERN (p));
2146 reset_used_flags (REG_NOTES (p));
2147 reset_used_flags (LOG_LINKS (p));
2150 /* Make sure that virtual stack slots are not shared. */
2151 reset_used_decls (DECL_INITIAL (cfun->decl));
2153 /* Make sure that virtual parameters are not shared. */
2154 for (decl = DECL_ARGUMENTS (cfun->decl); decl; decl = TREE_CHAIN (decl))
2155 reset_used_flags (DECL_RTL (decl));
2157 reset_used_flags (stack_slot_list);
2159 unshare_all_rtl_1 (insn);
2163 unshare_all_rtl (void)
2165 unshare_all_rtl_1 (get_insns ());
2169 struct tree_opt_pass pass_unshare_all_rtl =
2171 "unshare", /* name */
2173 unshare_all_rtl, /* execute */
2176 0, /* static_pass_number */
2178 0, /* properties_required */
2179 0, /* properties_provided */
2180 0, /* properties_destroyed */
2181 0, /* todo_flags_start */
2182 TODO_dump_func, /* todo_flags_finish */
2187 /* Check that ORIG is not marked when it should not be and mark ORIG as in use,
2188 Recursively does the same for subexpressions. */
2191 verify_rtx_sharing (rtx orig, rtx insn)
2196 const char *format_ptr;
2201 code = GET_CODE (x);
2203 /* These types may be freely shared. */
2218 /* SCRATCH must be shared because they represent distinct values. */
2220 if (REG_P (XEXP (x, 0)) && REGNO (XEXP (x, 0)) < FIRST_PSEUDO_REGISTER)
2225 /* CONST can be shared if it contains a SYMBOL_REF. If it contains
2226 a LABEL_REF, it isn't sharable. */
2227 if (GET_CODE (XEXP (x, 0)) == PLUS
2228 && GET_CODE (XEXP (XEXP (x, 0), 0)) == SYMBOL_REF
2229 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT)
2234 /* A MEM is allowed to be shared if its address is constant. */
2235 if (CONSTANT_ADDRESS_P (XEXP (x, 0))
2236 || reload_completed || reload_in_progress)
2245 /* This rtx may not be shared. If it has already been seen,
2246 replace it with a copy of itself. */
2247 #ifdef ENABLE_CHECKING
2248 if (RTX_FLAG (x, used))
2250 error ("invalid rtl sharing found in the insn");
2252 error ("shared rtx");
2254 internal_error ("internal consistency failure");
2257 gcc_assert (!RTX_FLAG (x, used));
2259 RTX_FLAG (x, used) = 1;
2261 /* Now scan the subexpressions recursively. */
2263 format_ptr = GET_RTX_FORMAT (code);
2265 for (i = 0; i < GET_RTX_LENGTH (code); i++)
2267 switch (*format_ptr++)
2270 verify_rtx_sharing (XEXP (x, i), insn);
2274 if (XVEC (x, i) != NULL)
2277 int len = XVECLEN (x, i);
2279 for (j = 0; j < len; j++)
2281 /* We allow sharing of ASM_OPERANDS inside single
2283 if (j && GET_CODE (XVECEXP (x, i, j)) == SET
2284 && (GET_CODE (SET_SRC (XVECEXP (x, i, j)))
2286 verify_rtx_sharing (SET_DEST (XVECEXP (x, i, j)), insn);
2288 verify_rtx_sharing (XVECEXP (x, i, j), insn);
2297 /* Go through all the RTL insn bodies and check that there is no unexpected
2298 sharing in between the subexpressions. */
2301 verify_rtl_sharing (void)
2305 for (p = get_insns (); p; p = NEXT_INSN (p))
2308 reset_used_flags (PATTERN (p));
2309 reset_used_flags (REG_NOTES (p));
2310 reset_used_flags (LOG_LINKS (p));
2311 if (GET_CODE (PATTERN (p)) == SEQUENCE)
2314 rtx q, sequence = PATTERN (p);
2316 for (i = 0; i < XVECLEN (sequence, 0); i++)
2318 q = XVECEXP (sequence, 0, i);
2319 gcc_assert (INSN_P (q));
2320 reset_used_flags (PATTERN (q));
2321 reset_used_flags (REG_NOTES (q));
2322 reset_used_flags (LOG_LINKS (q));
2327 for (p = get_insns (); p; p = NEXT_INSN (p))
2330 verify_rtx_sharing (PATTERN (p), p);
2331 verify_rtx_sharing (REG_NOTES (p), p);
2332 verify_rtx_sharing (LOG_LINKS (p), p);
2336 /* Go through all the RTL insn bodies and copy any invalid shared structure.
2337 Assumes the mark bits are cleared at entry. */
2340 unshare_all_rtl_in_chain (rtx insn)
2342 for (; insn; insn = NEXT_INSN (insn))
2345 PATTERN (insn) = copy_rtx_if_shared (PATTERN (insn));
2346 REG_NOTES (insn) = copy_rtx_if_shared (REG_NOTES (insn));
2347 LOG_LINKS (insn) = copy_rtx_if_shared (LOG_LINKS (insn));
2351 /* Go through all virtual stack slots of a function and mark them as
2354 reset_used_decls (tree blk)
2359 for (t = BLOCK_VARS (blk); t; t = TREE_CHAIN (t))
2360 if (DECL_RTL_SET_P (t))
2361 reset_used_flags (DECL_RTL (t));
2363 /* Now process sub-blocks. */
2364 for (t = BLOCK_SUBBLOCKS (blk); t; t = TREE_CHAIN (t))
2365 reset_used_decls (t);
2368 /* Mark ORIG as in use, and return a copy of it if it was already in use.
2369 Recursively does the same for subexpressions. Uses
2370 copy_rtx_if_shared_1 to reduce stack space. */
2373 copy_rtx_if_shared (rtx orig)
2375 copy_rtx_if_shared_1 (&orig);
2379 /* Mark *ORIG1 as in use, and set it to a copy of it if it was already in
2380 use. Recursively does the same for subexpressions. */
2383 copy_rtx_if_shared_1 (rtx *orig1)
2389 const char *format_ptr;
2393 /* Repeat is used to turn tail-recursion into iteration. */
2400 code = GET_CODE (x);
2402 /* These types may be freely shared. */
2416 /* SCRATCH must be shared because they represent distinct values. */
2419 if (REG_P (XEXP (x, 0)) && REGNO (XEXP (x, 0)) < FIRST_PSEUDO_REGISTER)
2424 /* CONST can be shared if it contains a SYMBOL_REF. If it contains
2425 a LABEL_REF, it isn't sharable. */
2426 if (GET_CODE (XEXP (x, 0)) == PLUS
2427 && GET_CODE (XEXP (XEXP (x, 0), 0)) == SYMBOL_REF
2428 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT)
2437 /* The chain of insns is not being copied. */
2444 /* This rtx may not be shared. If it has already been seen,
2445 replace it with a copy of itself. */
2447 if (RTX_FLAG (x, used))
2449 x = shallow_copy_rtx (x);
2452 RTX_FLAG (x, used) = 1;
2454 /* Now scan the subexpressions recursively.
2455 We can store any replaced subexpressions directly into X
2456 since we know X is not shared! Any vectors in X
2457 must be copied if X was copied. */
2459 format_ptr = GET_RTX_FORMAT (code);
2460 length = GET_RTX_LENGTH (code);
2463 for (i = 0; i < length; i++)
2465 switch (*format_ptr++)
2469 copy_rtx_if_shared_1 (last_ptr);
2470 last_ptr = &XEXP (x, i);
2474 if (XVEC (x, i) != NULL)
2477 int len = XVECLEN (x, i);
2479 /* Copy the vector iff I copied the rtx and the length
2481 if (copied && len > 0)
2482 XVEC (x, i) = gen_rtvec_v (len, XVEC (x, i)->elem);
2484 /* Call recursively on all inside the vector. */
2485 for (j = 0; j < len; j++)
2488 copy_rtx_if_shared_1 (last_ptr);
2489 last_ptr = &XVECEXP (x, i, j);
2504 /* Clear all the USED bits in X to allow copy_rtx_if_shared to be used
2505 to look for shared sub-parts. */
2508 reset_used_flags (rtx x)
2512 const char *format_ptr;
2515 /* Repeat is used to turn tail-recursion into iteration. */
2520 code = GET_CODE (x);
2522 /* These types may be freely shared so we needn't do any resetting
2543 /* The chain of insns is not being copied. */
2550 RTX_FLAG (x, used) = 0;
2552 format_ptr = GET_RTX_FORMAT (code);
2553 length = GET_RTX_LENGTH (code);
2555 for (i = 0; i < length; i++)
2557 switch (*format_ptr++)
2565 reset_used_flags (XEXP (x, i));
2569 for (j = 0; j < XVECLEN (x, i); j++)
2570 reset_used_flags (XVECEXP (x, i, j));
2576 /* Set all the USED bits in X to allow copy_rtx_if_shared to be used
2577 to look for shared sub-parts. */
2580 set_used_flags (rtx x)
2584 const char *format_ptr;
2589 code = GET_CODE (x);
2591 /* These types may be freely shared so we needn't do any resetting
2612 /* The chain of insns is not being copied. */
2619 RTX_FLAG (x, used) = 1;
2621 format_ptr = GET_RTX_FORMAT (code);
2622 for (i = 0; i < GET_RTX_LENGTH (code); i++)
2624 switch (*format_ptr++)
2627 set_used_flags (XEXP (x, i));
2631 for (j = 0; j < XVECLEN (x, i); j++)
2632 set_used_flags (XVECEXP (x, i, j));
2638 /* Copy X if necessary so that it won't be altered by changes in OTHER.
2639 Return X or the rtx for the pseudo reg the value of X was copied into.
2640 OTHER must be valid as a SET_DEST. */
2643 make_safe_from (rtx x, rtx other)
2646 switch (GET_CODE (other))
2649 other = SUBREG_REG (other);
2651 case STRICT_LOW_PART:
2654 other = XEXP (other, 0);
2663 && GET_CODE (x) != SUBREG)
2665 && (REGNO (other) < FIRST_PSEUDO_REGISTER
2666 || reg_mentioned_p (other, x))))
2668 rtx temp = gen_reg_rtx (GET_MODE (x));
2669 emit_move_insn (temp, x);
2675 /* Emission of insns (adding them to the doubly-linked list). */
2677 /* Return the first insn of the current sequence or current function. */
2685 /* Specify a new insn as the first in the chain. */
2688 set_first_insn (rtx insn)
2690 gcc_assert (!PREV_INSN (insn));
2694 /* Return the last insn emitted in current sequence or current function. */
2697 get_last_insn (void)
2702 /* Specify a new insn as the last in the chain. */
2705 set_last_insn (rtx insn)
2707 gcc_assert (!NEXT_INSN (insn));
2711 /* Return the last insn emitted, even if it is in a sequence now pushed. */
2714 get_last_insn_anywhere (void)
2716 struct sequence_stack *stack;
2719 for (stack = seq_stack; stack; stack = stack->next)
2720 if (stack->last != 0)
2725 /* Return the first nonnote insn emitted in current sequence or current
2726 function. This routine looks inside SEQUENCEs. */
2729 get_first_nonnote_insn (void)
2731 rtx insn = first_insn;
2736 for (insn = next_insn (insn);
2737 insn && NOTE_P (insn);
2738 insn = next_insn (insn))
2742 if (NONJUMP_INSN_P (insn)
2743 && GET_CODE (PATTERN (insn)) == SEQUENCE)
2744 insn = XVECEXP (PATTERN (insn), 0, 0);
2751 /* Return the last nonnote insn emitted in current sequence or current
2752 function. This routine looks inside SEQUENCEs. */
2755 get_last_nonnote_insn (void)
2757 rtx insn = last_insn;
2762 for (insn = previous_insn (insn);
2763 insn && NOTE_P (insn);
2764 insn = previous_insn (insn))
2768 if (NONJUMP_INSN_P (insn)
2769 && GET_CODE (PATTERN (insn)) == SEQUENCE)
2770 insn = XVECEXP (PATTERN (insn), 0,
2771 XVECLEN (PATTERN (insn), 0) - 1);
2778 /* Return a number larger than any instruction's uid in this function. */
2783 return cur_insn_uid;
2786 /* Return the next insn. If it is a SEQUENCE, return the first insn
2790 next_insn (rtx insn)
2794 insn = NEXT_INSN (insn);
2795 if (insn && NONJUMP_INSN_P (insn)
2796 && GET_CODE (PATTERN (insn)) == SEQUENCE)
2797 insn = XVECEXP (PATTERN (insn), 0, 0);
2803 /* Return the previous insn. If it is a SEQUENCE, return the last insn
2807 previous_insn (rtx insn)
2811 insn = PREV_INSN (insn);
2812 if (insn && NONJUMP_INSN_P (insn)
2813 && GET_CODE (PATTERN (insn)) == SEQUENCE)
2814 insn = XVECEXP (PATTERN (insn), 0, XVECLEN (PATTERN (insn), 0) - 1);
2820 /* Return the next insn after INSN that is not a NOTE. This routine does not
2821 look inside SEQUENCEs. */
2824 next_nonnote_insn (rtx insn)
2828 insn = NEXT_INSN (insn);
2829 if (insn == 0 || !NOTE_P (insn))
2836 /* Return the previous insn before INSN that is not a NOTE. This routine does
2837 not look inside SEQUENCEs. */
2840 prev_nonnote_insn (rtx insn)
2844 insn = PREV_INSN (insn);
2845 if (insn == 0 || !NOTE_P (insn))
2852 /* Return the next INSN, CALL_INSN or JUMP_INSN after INSN;
2853 or 0, if there is none. This routine does not look inside
2857 next_real_insn (rtx insn)
2861 insn = NEXT_INSN (insn);
2862 if (insn == 0 || INSN_P (insn))
2869 /* Return the last INSN, CALL_INSN or JUMP_INSN before INSN;
2870 or 0, if there is none. This routine does not look inside
2874 prev_real_insn (rtx insn)
2878 insn = PREV_INSN (insn);
2879 if (insn == 0 || INSN_P (insn))
2886 /* Return the last CALL_INSN in the current list, or 0 if there is none.
2887 This routine does not look inside SEQUENCEs. */
2890 last_call_insn (void)
2894 for (insn = get_last_insn ();
2895 insn && !CALL_P (insn);
2896 insn = PREV_INSN (insn))
2902 /* Find the next insn after INSN that really does something. This routine
2903 does not look inside SEQUENCEs. Until reload has completed, this is the
2904 same as next_real_insn. */
2907 active_insn_p (rtx insn)
2909 return (CALL_P (insn) || JUMP_P (insn)
2910 || (NONJUMP_INSN_P (insn)
2911 && (! reload_completed
2912 || (GET_CODE (PATTERN (insn)) != USE
2913 && GET_CODE (PATTERN (insn)) != CLOBBER))));
2917 next_active_insn (rtx insn)
2921 insn = NEXT_INSN (insn);
2922 if (insn == 0 || active_insn_p (insn))
2929 /* Find the last insn before INSN that really does something. This routine
2930 does not look inside SEQUENCEs. Until reload has completed, this is the
2931 same as prev_real_insn. */
2934 prev_active_insn (rtx insn)
2938 insn = PREV_INSN (insn);
2939 if (insn == 0 || active_insn_p (insn))
2946 /* Return the next CODE_LABEL after the insn INSN, or 0 if there is none. */
2949 next_label (rtx insn)
2953 insn = NEXT_INSN (insn);
2954 if (insn == 0 || LABEL_P (insn))
2961 /* Return the last CODE_LABEL before the insn INSN, or 0 if there is none. */
2964 prev_label (rtx insn)
2968 insn = PREV_INSN (insn);
2969 if (insn == 0 || LABEL_P (insn))
2976 /* Return the last label to mark the same position as LABEL. Return null
2977 if LABEL itself is null. */
2980 skip_consecutive_labels (rtx label)
2984 for (insn = label; insn != 0 && !INSN_P (insn); insn = NEXT_INSN (insn))
2992 /* INSN uses CC0 and is being moved into a delay slot. Set up REG_CC_SETTER
2993 and REG_CC_USER notes so we can find it. */
2996 link_cc0_insns (rtx insn)
2998 rtx user = next_nonnote_insn (insn);
3000 if (NONJUMP_INSN_P (user) && GET_CODE (PATTERN (user)) == SEQUENCE)
3001 user = XVECEXP (PATTERN (user), 0, 0);
3003 REG_NOTES (user) = gen_rtx_INSN_LIST (REG_CC_SETTER, insn,
3005 REG_NOTES (insn) = gen_rtx_INSN_LIST (REG_CC_USER, user, REG_NOTES (insn));
3008 /* Return the next insn that uses CC0 after INSN, which is assumed to
3009 set it. This is the inverse of prev_cc0_setter (i.e., prev_cc0_setter
3010 applied to the result of this function should yield INSN).
3012 Normally, this is simply the next insn. However, if a REG_CC_USER note
3013 is present, it contains the insn that uses CC0.
3015 Return 0 if we can't find the insn. */
3018 next_cc0_user (rtx insn)
3020 rtx note = find_reg_note (insn, REG_CC_USER, NULL_RTX);
3023 return XEXP (note, 0);
3025 insn = next_nonnote_insn (insn);
3026 if (insn && NONJUMP_INSN_P (insn) && GET_CODE (PATTERN (insn)) == SEQUENCE)
3027 insn = XVECEXP (PATTERN (insn), 0, 0);
3029 if (insn && INSN_P (insn) && reg_mentioned_p (cc0_rtx, PATTERN (insn)))
3035 /* Find the insn that set CC0 for INSN. Unless INSN has a REG_CC_SETTER
3036 note, it is the previous insn. */
3039 prev_cc0_setter (rtx insn)
3041 rtx note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
3044 return XEXP (note, 0);
3046 insn = prev_nonnote_insn (insn);
3047 gcc_assert (sets_cc0_p (PATTERN (insn)));
3054 /* Find a RTX_AUTOINC class rtx which matches DATA. */
3057 find_auto_inc (rtx *xp, void *data)
3062 if (GET_RTX_CLASS (GET_CODE (x)) != RTX_AUTOINC)
3065 switch (GET_CODE (x))
3073 if (rtx_equal_p (reg, XEXP (x, 0)))
3084 /* Increment the label uses for all labels present in rtx. */
3087 mark_label_nuses (rtx x)
3093 code = GET_CODE (x);
3094 if (code == LABEL_REF && LABEL_P (XEXP (x, 0)))
3095 LABEL_NUSES (XEXP (x, 0))++;
3097 fmt = GET_RTX_FORMAT (code);
3098 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
3101 mark_label_nuses (XEXP (x, i));
3102 else if (fmt[i] == 'E')
3103 for (j = XVECLEN (x, i) - 1; j >= 0; j--)
3104 mark_label_nuses (XVECEXP (x, i, j));
3109 /* Try splitting insns that can be split for better scheduling.
3110 PAT is the pattern which might split.
3111 TRIAL is the insn providing PAT.
3112 LAST is nonzero if we should return the last insn of the sequence produced.
3114 If this routine succeeds in splitting, it returns the first or last
3115 replacement insn depending on the value of LAST. Otherwise, it
3116 returns TRIAL. If the insn to be returned can be split, it will be. */
3119 try_split (rtx pat, rtx trial, int last)
3121 rtx before = PREV_INSN (trial);
3122 rtx after = NEXT_INSN (trial);
3123 int has_barrier = 0;
3127 rtx insn_last, insn;
3130 if (any_condjump_p (trial)
3131 && (note = find_reg_note (trial, REG_BR_PROB, 0)))
3132 split_branch_probability = INTVAL (XEXP (note, 0));
3133 probability = split_branch_probability;
3135 seq = split_insns (pat, trial);
3137 split_branch_probability = -1;
3139 /* If we are splitting a JUMP_INSN, it might be followed by a BARRIER.
3140 We may need to handle this specially. */
3141 if (after && BARRIER_P (after))
3144 after = NEXT_INSN (after);
3150 /* Avoid infinite loop if any insn of the result matches
3151 the original pattern. */
3155 if (INSN_P (insn_last)
3156 && rtx_equal_p (PATTERN (insn_last), pat))
3158 if (!NEXT_INSN (insn_last))
3160 insn_last = NEXT_INSN (insn_last);
3164 for (insn = insn_last; insn ; insn = PREV_INSN (insn))
3168 mark_jump_label (PATTERN (insn), insn, 0);
3170 if (probability != -1
3171 && any_condjump_p (insn)
3172 && !find_reg_note (insn, REG_BR_PROB, 0))
3174 /* We can preserve the REG_BR_PROB notes only if exactly
3175 one jump is created, otherwise the machine description
3176 is responsible for this step using
3177 split_branch_probability variable. */
3178 gcc_assert (njumps == 1);
3180 = gen_rtx_EXPR_LIST (REG_BR_PROB,
3181 GEN_INT (probability),
3187 /* If we are splitting a CALL_INSN, look for the CALL_INSN
3188 in SEQ and copy our CALL_INSN_FUNCTION_USAGE to it. */
3191 for (insn = insn_last; insn ; insn = PREV_INSN (insn))
3194 rtx *p = &CALL_INSN_FUNCTION_USAGE (insn);
3197 *p = CALL_INSN_FUNCTION_USAGE (trial);
3198 SIBLING_CALL_P (insn) = SIBLING_CALL_P (trial);
3202 /* Copy notes, particularly those related to the CFG. */
3203 for (note = REG_NOTES (trial); note; note = XEXP (note, 1))
3205 switch (REG_NOTE_KIND (note))
3208 for (insn = insn_last; insn != NULL_RTX; insn = PREV_INSN (insn))
3211 || (flag_non_call_exceptions && INSN_P (insn)
3212 && may_trap_p (PATTERN (insn))))
3214 = gen_rtx_EXPR_LIST (REG_EH_REGION,
3222 for (insn = insn_last; insn != NULL_RTX; insn = PREV_INSN (insn))
3226 = gen_rtx_EXPR_LIST (REG_NOTE_KIND (note),
3232 case REG_NON_LOCAL_GOTO:
3233 for (insn = insn_last; insn != NULL_RTX; insn = PREV_INSN (insn))
3237 = gen_rtx_EXPR_LIST (REG_NOTE_KIND (note),
3245 for (insn = insn_last; insn != NULL_RTX; insn = PREV_INSN (insn))
3247 rtx reg = XEXP (note, 0);
3248 if (!FIND_REG_INC_NOTE (insn, reg)
3249 && for_each_rtx (&PATTERN (insn), find_auto_inc, reg) > 0)
3250 REG_NOTES (insn) = gen_rtx_EXPR_LIST (REG_INC, reg,
3261 /* If there are LABELS inside the split insns increment the
3262 usage count so we don't delete the label. */
3263 if (NONJUMP_INSN_P (trial))
3266 while (insn != NULL_RTX)
3268 if (NONJUMP_INSN_P (insn))
3269 mark_label_nuses (PATTERN (insn));
3271 insn = PREV_INSN (insn);
3275 tem = emit_insn_after_setloc (seq, trial, INSN_LOCATOR (trial));
3277 delete_insn (trial);
3279 emit_barrier_after (tem);
3281 /* Recursively call try_split for each new insn created; by the
3282 time control returns here that insn will be fully split, so
3283 set LAST and continue from the insn after the one returned.
3284 We can't use next_active_insn here since AFTER may be a note.
3285 Ignore deleted insns, which can be occur if not optimizing. */
3286 for (tem = NEXT_INSN (before); tem != after; tem = NEXT_INSN (tem))
3287 if (! INSN_DELETED_P (tem) && INSN_P (tem))
3288 tem = try_split (PATTERN (tem), tem, 1);
3290 /* Return either the first or the last insn, depending on which was
3293 ? (after ? PREV_INSN (after) : last_insn)
3294 : NEXT_INSN (before);
3297 /* Make and return an INSN rtx, initializing all its slots.
3298 Store PATTERN in the pattern slots. */
3301 make_insn_raw (rtx pattern)
3305 insn = rtx_alloc (INSN);
3307 INSN_UID (insn) = cur_insn_uid++;
3308 PATTERN (insn) = pattern;
3309 INSN_CODE (insn) = -1;
3310 LOG_LINKS (insn) = NULL;
3311 REG_NOTES (insn) = NULL;
3312 INSN_LOCATOR (insn) = curr_insn_locator ();
3313 BLOCK_FOR_INSN (insn) = NULL;
3315 #ifdef ENABLE_RTL_CHECKING
3318 && (returnjump_p (insn)
3319 || (GET_CODE (insn) == SET
3320 && SET_DEST (insn) == pc_rtx)))
3322 warning (0, "ICE: emit_insn used where emit_jump_insn needed:\n");
3330 /* Like `make_insn_raw' but make a JUMP_INSN instead of an insn. */
3333 make_jump_insn_raw (rtx pattern)
3337 insn = rtx_alloc (JUMP_INSN);
3338 INSN_UID (insn) = cur_insn_uid++;
3340 PATTERN (insn) = pattern;
3341 INSN_CODE (insn) = -1;
3342 LOG_LINKS (insn) = NULL;
3343 REG_NOTES (insn) = NULL;
3344 JUMP_LABEL (insn) = NULL;
3345 INSN_LOCATOR (insn) = curr_insn_locator ();
3346 BLOCK_FOR_INSN (insn) = NULL;
3351 /* Like `make_insn_raw' but make a CALL_INSN instead of an insn. */
3354 make_call_insn_raw (rtx pattern)
3358 insn = rtx_alloc (CALL_INSN);
3359 INSN_UID (insn) = cur_insn_uid++;
3361 PATTERN (insn) = pattern;
3362 INSN_CODE (insn) = -1;
3363 LOG_LINKS (insn) = NULL;
3364 REG_NOTES (insn) = NULL;
3365 CALL_INSN_FUNCTION_USAGE (insn) = NULL;
3366 INSN_LOCATOR (insn) = curr_insn_locator ();
3367 BLOCK_FOR_INSN (insn) = NULL;
3372 /* Add INSN to the end of the doubly-linked list.
3373 INSN may be an INSN, JUMP_INSN, CALL_INSN, CODE_LABEL, BARRIER or NOTE. */
3378 PREV_INSN (insn) = last_insn;
3379 NEXT_INSN (insn) = 0;
3381 if (NULL != last_insn)
3382 NEXT_INSN (last_insn) = insn;
3384 if (NULL == first_insn)
3390 /* Add INSN into the doubly-linked list after insn AFTER. This and
3391 the next should be the only functions called to insert an insn once
3392 delay slots have been filled since only they know how to update a
3396 add_insn_after (rtx insn, rtx after)
3398 rtx next = NEXT_INSN (after);
3401 gcc_assert (!optimize || !INSN_DELETED_P (after));
3403 NEXT_INSN (insn) = next;
3404 PREV_INSN (insn) = after;
3408 PREV_INSN (next) = insn;
3409 if (NONJUMP_INSN_P (next) && GET_CODE (PATTERN (next)) == SEQUENCE)
3410 PREV_INSN (XVECEXP (PATTERN (next), 0, 0)) = insn;
3412 else if (last_insn == after)
3416 struct sequence_stack *stack = seq_stack;
3417 /* Scan all pending sequences too. */
3418 for (; stack; stack = stack->next)
3419 if (after == stack->last)
3428 if (!BARRIER_P (after)
3429 && !BARRIER_P (insn)
3430 && (bb = BLOCK_FOR_INSN (after)))
3432 set_block_for_insn (insn, bb);
3434 bb->flags |= BB_DIRTY;
3435 /* Should not happen as first in the BB is always
3436 either NOTE or LABEL. */
3437 if (BB_END (bb) == after
3438 /* Avoid clobbering of structure when creating new BB. */
3439 && !BARRIER_P (insn)
3440 && !NOTE_INSN_BASIC_BLOCK_P (insn))
3444 NEXT_INSN (after) = insn;
3445 if (NONJUMP_INSN_P (after) && GET_CODE (PATTERN (after)) == SEQUENCE)
3447 rtx sequence = PATTERN (after);
3448 NEXT_INSN (XVECEXP (sequence, 0, XVECLEN (sequence, 0) - 1)) = insn;
3452 /* Add INSN into the doubly-linked list before insn BEFORE. This and
3453 the previous should be the only functions called to insert an insn once
3454 delay slots have been filled since only they know how to update a
3458 add_insn_before (rtx insn, rtx before)
3460 rtx prev = PREV_INSN (before);
3463 gcc_assert (!optimize || !INSN_DELETED_P (before));
3465 PREV_INSN (insn) = prev;
3466 NEXT_INSN (insn) = before;
3470 NEXT_INSN (prev) = insn;
3471 if (NONJUMP_INSN_P (prev) && GET_CODE (PATTERN (prev)) == SEQUENCE)
3473 rtx sequence = PATTERN (prev);
3474 NEXT_INSN (XVECEXP (sequence, 0, XVECLEN (sequence, 0) - 1)) = insn;
3477 else if (first_insn == before)
3481 struct sequence_stack *stack = seq_stack;
3482 /* Scan all pending sequences too. */
3483 for (; stack; stack = stack->next)
3484 if (before == stack->first)
3486 stack->first = insn;
3493 if (!BARRIER_P (before)
3494 && !BARRIER_P (insn)
3495 && (bb = BLOCK_FOR_INSN (before)))
3497 set_block_for_insn (insn, bb);
3499 bb->flags |= BB_DIRTY;
3500 /* Should not happen as first in the BB is always either NOTE or
3502 gcc_assert (BB_HEAD (bb) != insn
3503 /* Avoid clobbering of structure when creating new BB. */
3505 || NOTE_INSN_BASIC_BLOCK_P (insn));
3508 PREV_INSN (before) = insn;
3509 if (NONJUMP_INSN_P (before) && GET_CODE (PATTERN (before)) == SEQUENCE)
3510 PREV_INSN (XVECEXP (PATTERN (before), 0, 0)) = insn;
3513 /* Remove an insn from its doubly-linked list. This function knows how
3514 to handle sequences. */
3516 remove_insn (rtx insn)
3518 rtx next = NEXT_INSN (insn);
3519 rtx prev = PREV_INSN (insn);
3524 NEXT_INSN (prev) = next;
3525 if (NONJUMP_INSN_P (prev) && GET_CODE (PATTERN (prev)) == SEQUENCE)
3527 rtx sequence = PATTERN (prev);
3528 NEXT_INSN (XVECEXP (sequence, 0, XVECLEN (sequence, 0) - 1)) = next;
3531 else if (first_insn == insn)
3535 struct sequence_stack *stack = seq_stack;
3536 /* Scan all pending sequences too. */
3537 for (; stack; stack = stack->next)
3538 if (insn == stack->first)
3540 stack->first = next;
3549 PREV_INSN (next) = prev;
3550 if (NONJUMP_INSN_P (next) && GET_CODE (PATTERN (next)) == SEQUENCE)
3551 PREV_INSN (XVECEXP (PATTERN (next), 0, 0)) = prev;
3553 else if (last_insn == insn)
3557 struct sequence_stack *stack = seq_stack;
3558 /* Scan all pending sequences too. */
3559 for (; stack; stack = stack->next)
3560 if (insn == stack->last)
3568 if (!BARRIER_P (insn)
3569 && (bb = BLOCK_FOR_INSN (insn)))
3572 bb->flags |= BB_DIRTY;
3573 if (BB_HEAD (bb) == insn)
3575 /* Never ever delete the basic block note without deleting whole
3577 gcc_assert (!NOTE_P (insn));
3578 BB_HEAD (bb) = next;
3580 if (BB_END (bb) == insn)
3585 /* Append CALL_FUSAGE to the CALL_INSN_FUNCTION_USAGE for CALL_INSN. */
3588 add_function_usage_to (rtx call_insn, rtx call_fusage)
3590 gcc_assert (call_insn && CALL_P (call_insn));
3592 /* Put the register usage information on the CALL. If there is already
3593 some usage information, put ours at the end. */
3594 if (CALL_INSN_FUNCTION_USAGE (call_insn))
3598 for (link = CALL_INSN_FUNCTION_USAGE (call_insn); XEXP (link, 1) != 0;
3599 link = XEXP (link, 1))
3602 XEXP (link, 1) = call_fusage;
3605 CALL_INSN_FUNCTION_USAGE (call_insn) = call_fusage;
3608 /* Delete all insns made since FROM.
3609 FROM becomes the new last instruction. */
3612 delete_insns_since (rtx from)
3617 NEXT_INSN (from) = 0;
3621 /* This function is deprecated, please use sequences instead.
3623 Move a consecutive bunch of insns to a different place in the chain.
3624 The insns to be moved are those between FROM and TO.
3625 They are moved to a new position after the insn AFTER.
3626 AFTER must not be FROM or TO or any insn in between.
3628 This function does not know about SEQUENCEs and hence should not be
3629 called after delay-slot filling has been done. */
3632 reorder_insns_nobb (rtx from, rtx to, rtx after)
3634 /* Splice this bunch out of where it is now. */
3635 if (PREV_INSN (from))
3636 NEXT_INSN (PREV_INSN (from)) = NEXT_INSN (to);
3638 PREV_INSN (NEXT_INSN (to)) = PREV_INSN (from);
3639 if (last_insn == to)
3640 last_insn = PREV_INSN (from);
3641 if (first_insn == from)
3642 first_insn = NEXT_INSN (to);
3644 /* Make the new neighbors point to it and it to them. */
3645 if (NEXT_INSN (after))
3646 PREV_INSN (NEXT_INSN (after)) = to;
3648 NEXT_INSN (to) = NEXT_INSN (after);
3649 PREV_INSN (from) = after;
3650 NEXT_INSN (after) = from;
3651 if (after == last_insn)
3655 /* Same as function above, but take care to update BB boundaries. */
3657 reorder_insns (rtx from, rtx to, rtx after)
3659 rtx prev = PREV_INSN (from);
3660 basic_block bb, bb2;
3662 reorder_insns_nobb (from, to, after);
3664 if (!BARRIER_P (after)
3665 && (bb = BLOCK_FOR_INSN (after)))
3668 bb->flags |= BB_DIRTY;
3670 if (!BARRIER_P (from)
3671 && (bb2 = BLOCK_FOR_INSN (from)))
3673 if (BB_END (bb2) == to)
3674 BB_END (bb2) = prev;
3675 bb2->flags |= BB_DIRTY;
3678 if (BB_END (bb) == after)
3681 for (x = from; x != NEXT_INSN (to); x = NEXT_INSN (x))
3683 set_block_for_insn (x, bb);
3688 /* Emit insn(s) of given code and pattern
3689 at a specified place within the doubly-linked list.
3691 All of the emit_foo global entry points accept an object
3692 X which is either an insn list or a PATTERN of a single
3695 There are thus a few canonical ways to generate code and
3696 emit it at a specific place in the instruction stream. For
3697 example, consider the instruction named SPOT and the fact that
3698 we would like to emit some instructions before SPOT. We might
3702 ... emit the new instructions ...
3703 insns_head = get_insns ();
3706 emit_insn_before (insns_head, SPOT);
3708 It used to be common to generate SEQUENCE rtl instead, but that
3709 is a relic of the past which no longer occurs. The reason is that
3710 SEQUENCE rtl results in much fragmented RTL memory since the SEQUENCE
3711 generated would almost certainly die right after it was created. */
3713 /* Make X be output before the instruction BEFORE. */
3716 emit_insn_before_noloc (rtx x, rtx before)
3721 gcc_assert (before);
3726 switch (GET_CODE (x))
3737 rtx next = NEXT_INSN (insn);
3738 add_insn_before (insn, before);
3744 #ifdef ENABLE_RTL_CHECKING
3751 last = make_insn_raw (x);
3752 add_insn_before (last, before);
3759 /* Make an instruction with body X and code JUMP_INSN
3760 and output it before the instruction BEFORE. */
3763 emit_jump_insn_before_noloc (rtx x, rtx before)
3765 rtx insn, last = NULL_RTX;
3767 gcc_assert (before);
3769 switch (GET_CODE (x))
3780 rtx next = NEXT_INSN (insn);
3781 add_insn_before (insn, before);
3787 #ifdef ENABLE_RTL_CHECKING
3794 last = make_jump_insn_raw (x);
3795 add_insn_before (last, before);
3802 /* Make an instruction with body X and code CALL_INSN
3803 and output it before the instruction BEFORE. */
3806 emit_call_insn_before_noloc (rtx x, rtx before)
3808 rtx last = NULL_RTX, insn;
3810 gcc_assert (before);
3812 switch (GET_CODE (x))
3823 rtx next = NEXT_INSN (insn);
3824 add_insn_before (insn, before);
3830 #ifdef ENABLE_RTL_CHECKING
3837 last = make_call_insn_raw (x);
3838 add_insn_before (last, before);
3845 /* Make an insn of code BARRIER
3846 and output it before the insn BEFORE. */
3849 emit_barrier_before (rtx before)
3851 rtx insn = rtx_alloc (BARRIER);
3853 INSN_UID (insn) = cur_insn_uid++;
3855 add_insn_before (insn, before);
3859 /* Emit the label LABEL before the insn BEFORE. */
3862 emit_label_before (rtx label, rtx before)
3864 /* This can be called twice for the same label as a result of the
3865 confusion that follows a syntax error! So make it harmless. */
3866 if (INSN_UID (label) == 0)
3868 INSN_UID (label) = cur_insn_uid++;
3869 add_insn_before (label, before);
3875 /* Emit a note of subtype SUBTYPE before the insn BEFORE. */
3878 emit_note_before (enum insn_note subtype, rtx before)
3880 rtx note = rtx_alloc (NOTE);
3881 INSN_UID (note) = cur_insn_uid++;
3882 NOTE_KIND (note) = subtype;
3883 BLOCK_FOR_INSN (note) = NULL;
3885 add_insn_before (note, before);
3889 /* Helper for emit_insn_after, handles lists of instructions
3892 static rtx emit_insn_after_1 (rtx, rtx);
3895 emit_insn_after_1 (rtx first, rtx after)
3901 if (!BARRIER_P (after)
3902 && (bb = BLOCK_FOR_INSN (after)))
3904 bb->flags |= BB_DIRTY;
3905 for (last = first; NEXT_INSN (last); last = NEXT_INSN (last))
3906 if (!BARRIER_P (last))
3907 set_block_for_insn (last, bb);
3908 if (!BARRIER_P (last))
3909 set_block_for_insn (last, bb);
3910 if (BB_END (bb) == after)
3914 for (last = first; NEXT_INSN (last); last = NEXT_INSN (last))
3917 after_after = NEXT_INSN (after);
3919 NEXT_INSN (after) = first;
3920 PREV_INSN (first) = after;
3921 NEXT_INSN (last) = after_after;
3923 PREV_INSN (after_after) = last;
3925 if (after == last_insn)
3930 /* Make X be output after the insn AFTER. */
3933 emit_insn_after_noloc (rtx x, rtx after)
3942 switch (GET_CODE (x))
3950 last = emit_insn_after_1 (x, after);
3953 #ifdef ENABLE_RTL_CHECKING
3960 last = make_insn_raw (x);
3961 add_insn_after (last, after);
3969 /* Make an insn of code JUMP_INSN with body X
3970 and output it after the insn AFTER. */
3973 emit_jump_insn_after_noloc (rtx x, rtx after)
3979 switch (GET_CODE (x))
3987 last = emit_insn_after_1 (x, after);
3990 #ifdef ENABLE_RTL_CHECKING
3997 last = make_jump_insn_raw (x);
3998 add_insn_after (last, after);
4005 /* Make an instruction with body X and code CALL_INSN
4006 and output it after the instruction AFTER. */
4009 emit_call_insn_after_noloc (rtx x, rtx after)
4015 switch (GET_CODE (x))
4023 last = emit_insn_after_1 (x, after);
4026 #ifdef ENABLE_RTL_CHECKING
4033 last = make_call_insn_raw (x);
4034 add_insn_after (last, after);
4041 /* Make an insn of code BARRIER
4042 and output it after the insn AFTER. */
4045 emit_barrier_after (rtx after)
4047 rtx insn = rtx_alloc (BARRIER);
4049 INSN_UID (insn) = cur_insn_uid++;
4051 add_insn_after (insn, after);
4055 /* Emit the label LABEL after the insn AFTER. */
4058 emit_label_after (rtx label, rtx after)
4060 /* This can be called twice for the same label
4061 as a result of the confusion that follows a syntax error!
4062 So make it harmless. */
4063 if (INSN_UID (label) == 0)
4065 INSN_UID (label) = cur_insn_uid++;
4066 add_insn_after (label, after);
4072 /* Emit a note of subtype SUBTYPE after the insn AFTER. */
4075 emit_note_after (enum insn_note subtype, rtx after)
4077 rtx note = rtx_alloc (NOTE);
4078 INSN_UID (note) = cur_insn_uid++;
4079 NOTE_KIND (note) = subtype;
4080 BLOCK_FOR_INSN (note) = NULL;
4081 add_insn_after (note, after);
4085 /* Like emit_insn_after_noloc, but set INSN_LOCATOR according to SCOPE. */
4087 emit_insn_after_setloc (rtx pattern, rtx after, int loc)
4089 rtx last = emit_insn_after_noloc (pattern, after);
4091 if (pattern == NULL_RTX || !loc)
4094 after = NEXT_INSN (after);
4097 if (active_insn_p (after) && !INSN_LOCATOR (after))
4098 INSN_LOCATOR (after) = loc;
4101 after = NEXT_INSN (after);
4106 /* Like emit_insn_after_noloc, but set INSN_LOCATOR according to AFTER. */
4108 emit_insn_after (rtx pattern, rtx after)
4111 return emit_insn_after_setloc (pattern, after, INSN_LOCATOR (after));
4113 return emit_insn_after_noloc (pattern, after);
4116 /* Like emit_jump_insn_after_noloc, but set INSN_LOCATOR according to SCOPE. */
4118 emit_jump_insn_after_setloc (rtx pattern, rtx after, int loc)
4120 rtx last = emit_jump_insn_after_noloc (pattern, after);
4122 if (pattern == NULL_RTX || !loc)
4125 after = NEXT_INSN (after);
4128 if (active_insn_p (after) && !INSN_LOCATOR (after))
4129 INSN_LOCATOR (after) = loc;
4132 after = NEXT_INSN (after);
4137 /* Like emit_jump_insn_after_noloc, but set INSN_LOCATOR according to AFTER. */
4139 emit_jump_insn_after (rtx pattern, rtx after)
4142 return emit_jump_insn_after_setloc (pattern, after, INSN_LOCATOR (after));
4144 return emit_jump_insn_after_noloc (pattern, after);
4147 /* Like emit_call_insn_after_noloc, but set INSN_LOCATOR according to SCOPE. */
4149 emit_call_insn_after_setloc (rtx pattern, rtx after, int loc)
4151 rtx last = emit_call_insn_after_noloc (pattern, after);
4153 if (pattern == NULL_RTX || !loc)
4156 after = NEXT_INSN (after);
4159 if (active_insn_p (after) && !INSN_LOCATOR (after))
4160 INSN_LOCATOR (after) = loc;
4163 after = NEXT_INSN (after);
4168 /* Like emit_call_insn_after_noloc, but set INSN_LOCATOR according to AFTER. */
4170 emit_call_insn_after (rtx pattern, rtx after)
4173 return emit_call_insn_after_setloc (pattern, after, INSN_LOCATOR (after));
4175 return emit_call_insn_after_noloc (pattern, after);
4178 /* Like emit_insn_before_noloc, but set INSN_LOCATOR according to SCOPE. */
4180 emit_insn_before_setloc (rtx pattern, rtx before, int loc)
4182 rtx first = PREV_INSN (before);
4183 rtx last = emit_insn_before_noloc (pattern, before);
4185 if (pattern == NULL_RTX || !loc)
4189 first = get_insns ();
4191 first = NEXT_INSN (first);
4194 if (active_insn_p (first) && !INSN_LOCATOR (first))
4195 INSN_LOCATOR (first) = loc;
4198 first = NEXT_INSN (first);
4203 /* Like emit_insn_before_noloc, but set INSN_LOCATOR according to BEFORE. */
4205 emit_insn_before (rtx pattern, rtx before)
4207 if (INSN_P (before))
4208 return emit_insn_before_setloc (pattern, before, INSN_LOCATOR (before));
4210 return emit_insn_before_noloc (pattern, before);
4213 /* like emit_insn_before_noloc, but set insn_locator according to scope. */
4215 emit_jump_insn_before_setloc (rtx pattern, rtx before, int loc)
4217 rtx first = PREV_INSN (before);
4218 rtx last = emit_jump_insn_before_noloc (pattern, before);
4220 if (pattern == NULL_RTX)
4223 first = NEXT_INSN (first);
4226 if (active_insn_p (first) && !INSN_LOCATOR (first))
4227 INSN_LOCATOR (first) = loc;
4230 first = NEXT_INSN (first);
4235 /* Like emit_jump_insn_before_noloc, but set INSN_LOCATOR according to BEFORE. */
4237 emit_jump_insn_before (rtx pattern, rtx before)
4239 if (INSN_P (before))
4240 return emit_jump_insn_before_setloc (pattern, before, INSN_LOCATOR (before));
4242 return emit_jump_insn_before_noloc (pattern, before);
4245 /* like emit_insn_before_noloc, but set insn_locator according to scope. */
4247 emit_call_insn_before_setloc (rtx pattern, rtx before, int loc)
4249 rtx first = PREV_INSN (before);
4250 rtx last = emit_call_insn_before_noloc (pattern, before);
4252 if (pattern == NULL_RTX)
4255 first = NEXT_INSN (first);
4258 if (active_insn_p (first) && !INSN_LOCATOR (first))
4259 INSN_LOCATOR (first) = loc;
4262 first = NEXT_INSN (first);
4267 /* like emit_call_insn_before_noloc,
4268 but set insn_locator according to before. */
4270 emit_call_insn_before (rtx pattern, rtx before)
4272 if (INSN_P (before))
4273 return emit_call_insn_before_setloc (pattern, before, INSN_LOCATOR (before));
4275 return emit_call_insn_before_noloc (pattern, before);
4278 /* Take X and emit it at the end of the doubly-linked
4281 Returns the last insn emitted. */
4286 rtx last = last_insn;
4292 switch (GET_CODE (x))
4303 rtx next = NEXT_INSN (insn);
4310 #ifdef ENABLE_RTL_CHECKING
4317 last = make_insn_raw (x);
4325 /* Make an insn of code JUMP_INSN with pattern X
4326 and add it to the end of the doubly-linked list. */
4329 emit_jump_insn (rtx x)
4331 rtx last = NULL_RTX, insn;
4333 switch (GET_CODE (x))
4344 rtx next = NEXT_INSN (insn);
4351 #ifdef ENABLE_RTL_CHECKING
4358 last = make_jump_insn_raw (x);
4366 /* Make an insn of code CALL_INSN with pattern X
4367 and add it to the end of the doubly-linked list. */
4370 emit_call_insn (rtx x)
4374 switch (GET_CODE (x))
4382 insn = emit_insn (x);
4385 #ifdef ENABLE_RTL_CHECKING
4392 insn = make_call_insn_raw (x);
4400 /* Add the label LABEL to the end of the doubly-linked list. */
4403 emit_label (rtx label)
4405 /* This can be called twice for the same label
4406 as a result of the confusion that follows a syntax error!
4407 So make it harmless. */
4408 if (INSN_UID (label) == 0)
4410 INSN_UID (label) = cur_insn_uid++;
4416 /* Make an insn of code BARRIER
4417 and add it to the end of the doubly-linked list. */
4422 rtx barrier = rtx_alloc (BARRIER);
4423 INSN_UID (barrier) = cur_insn_uid++;
4428 /* Emit a copy of note ORIG. */
4431 emit_note_copy (rtx orig)
4435 note = rtx_alloc (NOTE);
4437 INSN_UID (note) = cur_insn_uid++;
4438 NOTE_DATA (note) = NOTE_DATA (orig);
4439 NOTE_KIND (note) = NOTE_KIND (orig);
4440 BLOCK_FOR_INSN (note) = NULL;
4446 /* Make an insn of code NOTE or type NOTE_NO
4447 and add it to the end of the doubly-linked list. */
4450 emit_note (enum insn_note kind)
4454 note = rtx_alloc (NOTE);
4455 INSN_UID (note) = cur_insn_uid++;
4456 NOTE_KIND (note) = kind;
4457 memset (&NOTE_DATA (note), 0, sizeof (NOTE_DATA (note)));
4458 BLOCK_FOR_INSN (note) = NULL;
4463 /* Cause next statement to emit a line note even if the line number
4467 force_next_line_note (void)
4469 #ifdef USE_MAPPED_LOCATION
4472 last_location.line = -1;
4476 /* Place a note of KIND on insn INSN with DATUM as the datum. If a
4477 note of this type already exists, remove it first. */
4480 set_unique_reg_note (rtx insn, enum reg_note kind, rtx datum)
4482 rtx note = find_reg_note (insn, kind, NULL_RTX);
4488 /* Don't add REG_EQUAL/REG_EQUIV notes if the insn
4489 has multiple sets (some callers assume single_set
4490 means the insn only has one set, when in fact it
4491 means the insn only has one * useful * set). */
4492 if (GET_CODE (PATTERN (insn)) == PARALLEL && multiple_sets (insn))
4498 /* Don't add ASM_OPERAND REG_EQUAL/REG_EQUIV notes.
4499 It serves no useful purpose and breaks eliminate_regs. */
4500 if (GET_CODE (datum) == ASM_OPERANDS)
4510 XEXP (note, 0) = datum;
4514 REG_NOTES (insn) = gen_rtx_EXPR_LIST (kind, datum, REG_NOTES (insn));
4515 return REG_NOTES (insn);
4518 /* Return an indication of which type of insn should have X as a body.
4519 The value is CODE_LABEL, INSN, CALL_INSN or JUMP_INSN. */
4521 static enum rtx_code
4522 classify_insn (rtx x)
4526 if (GET_CODE (x) == CALL)
4528 if (GET_CODE (x) == RETURN)
4530 if (GET_CODE (x) == SET)
4532 if (SET_DEST (x) == pc_rtx)
4534 else if (GET_CODE (SET_SRC (x)) == CALL)
4539 if (GET_CODE (x) == PARALLEL)
4542 for (j = XVECLEN (x, 0) - 1; j >= 0; j--)
4543 if (GET_CODE (XVECEXP (x, 0, j)) == CALL)
4545 else if (GET_CODE (XVECEXP (x, 0, j)) == SET
4546 && SET_DEST (XVECEXP (x, 0, j)) == pc_rtx)
4548 else if (GET_CODE (XVECEXP (x, 0, j)) == SET
4549 && GET_CODE (SET_SRC (XVECEXP (x, 0, j))) == CALL)
4555 /* Emit the rtl pattern X as an appropriate kind of insn.
4556 If X is a label, it is simply added into the insn chain. */
4561 enum rtx_code code = classify_insn (x);
4566 return emit_label (x);
4568 return emit_insn (x);
4571 rtx insn = emit_jump_insn (x);
4572 if (any_uncondjump_p (insn) || GET_CODE (x) == RETURN)
4573 return emit_barrier ();
4577 return emit_call_insn (x);
4583 /* Space for free sequence stack entries. */
4584 static GTY ((deletable)) struct sequence_stack *free_sequence_stack;
4586 /* Begin emitting insns to a sequence. If this sequence will contain
4587 something that might cause the compiler to pop arguments to function
4588 calls (because those pops have previously been deferred; see
4589 INHIBIT_DEFER_POP for more details), use do_pending_stack_adjust
4590 before calling this function. That will ensure that the deferred
4591 pops are not accidentally emitted in the middle of this sequence. */
4594 start_sequence (void)
4596 struct sequence_stack *tem;
4598 if (free_sequence_stack != NULL)
4600 tem = free_sequence_stack;
4601 free_sequence_stack = tem->next;
4604 tem = ggc_alloc (sizeof (struct sequence_stack));
4606 tem->next = seq_stack;
4607 tem->first = first_insn;
4608 tem->last = last_insn;
4616 /* Set up the insn chain starting with FIRST as the current sequence,
4617 saving the previously current one. See the documentation for
4618 start_sequence for more information about how to use this function. */
4621 push_to_sequence (rtx first)
4627 for (last = first; last && NEXT_INSN (last); last = NEXT_INSN (last));
4633 /* Set up the outer-level insn chain
4634 as the current sequence, saving the previously current one. */
4637 push_topmost_sequence (void)
4639 struct sequence_stack *stack, *top = NULL;
4643 for (stack = seq_stack; stack; stack = stack->next)
4646 first_insn = top->first;
4647 last_insn = top->last;
4650 /* After emitting to the outer-level insn chain, update the outer-level
4651 insn chain, and restore the previous saved state. */
4654 pop_topmost_sequence (void)
4656 struct sequence_stack *stack, *top = NULL;
4658 for (stack = seq_stack; stack; stack = stack->next)
4661 top->first = first_insn;
4662 top->last = last_insn;
4667 /* After emitting to a sequence, restore previous saved state.
4669 To get the contents of the sequence just made, you must call
4670 `get_insns' *before* calling here.
4672 If the compiler might have deferred popping arguments while
4673 generating this sequence, and this sequence will not be immediately
4674 inserted into the instruction stream, use do_pending_stack_adjust
4675 before calling get_insns. That will ensure that the deferred
4676 pops are inserted into this sequence, and not into some random
4677 location in the instruction stream. See INHIBIT_DEFER_POP for more
4678 information about deferred popping of arguments. */
4683 struct sequence_stack *tem = seq_stack;
4685 first_insn = tem->first;
4686 last_insn = tem->last;
4687 seq_stack = tem->next;
4689 memset (tem, 0, sizeof (*tem));
4690 tem->next = free_sequence_stack;
4691 free_sequence_stack = tem;
4694 /* Return 1 if currently emitting into a sequence. */
4697 in_sequence_p (void)
4699 return seq_stack != 0;
4702 /* Put the various virtual registers into REGNO_REG_RTX. */
4705 init_virtual_regs (struct emit_status *es)
4707 rtx *ptr = es->x_regno_reg_rtx;
4708 ptr[VIRTUAL_INCOMING_ARGS_REGNUM] = virtual_incoming_args_rtx;
4709 ptr[VIRTUAL_STACK_VARS_REGNUM] = virtual_stack_vars_rtx;
4710 ptr[VIRTUAL_STACK_DYNAMIC_REGNUM] = virtual_stack_dynamic_rtx;
4711 ptr[VIRTUAL_OUTGOING_ARGS_REGNUM] = virtual_outgoing_args_rtx;
4712 ptr[VIRTUAL_CFA_REGNUM] = virtual_cfa_rtx;
4716 /* Used by copy_insn_1 to avoid copying SCRATCHes more than once. */
4717 static rtx copy_insn_scratch_in[MAX_RECOG_OPERANDS];
4718 static rtx copy_insn_scratch_out[MAX_RECOG_OPERANDS];
4719 static int copy_insn_n_scratches;
4721 /* When an insn is being copied by copy_insn_1, this is nonzero if we have
4722 copied an ASM_OPERANDS.
4723 In that case, it is the original input-operand vector. */
4724 static rtvec orig_asm_operands_vector;
4726 /* When an insn is being copied by copy_insn_1, this is nonzero if we have
4727 copied an ASM_OPERANDS.
4728 In that case, it is the copied input-operand vector. */
4729 static rtvec copy_asm_operands_vector;
4731 /* Likewise for the constraints vector. */
4732 static rtvec orig_asm_constraints_vector;
4733 static rtvec copy_asm_constraints_vector;
4735 /* Recursively create a new copy of an rtx for copy_insn.
4736 This function differs from copy_rtx in that it handles SCRATCHes and
4737 ASM_OPERANDs properly.
4738 Normally, this function is not used directly; use copy_insn as front end.
4739 However, you could first copy an insn pattern with copy_insn and then use
4740 this function afterwards to properly copy any REG_NOTEs containing
4744 copy_insn_1 (rtx orig)
4749 const char *format_ptr;
4751 code = GET_CODE (orig);
4765 if (REG_P (XEXP (orig, 0)) && REGNO (XEXP (orig, 0)) < FIRST_PSEUDO_REGISTER)
4770 for (i = 0; i < copy_insn_n_scratches; i++)
4771 if (copy_insn_scratch_in[i] == orig)
4772 return copy_insn_scratch_out[i];
4776 /* CONST can be shared if it contains a SYMBOL_REF. If it contains
4777 a LABEL_REF, it isn't sharable. */
4778 if (GET_CODE (XEXP (orig, 0)) == PLUS
4779 && GET_CODE (XEXP (XEXP (orig, 0), 0)) == SYMBOL_REF
4780 && GET_CODE (XEXP (XEXP (orig, 0), 1)) == CONST_INT)
4784 /* A MEM with a constant address is not sharable. The problem is that
4785 the constant address may need to be reloaded. If the mem is shared,
4786 then reloading one copy of this mem will cause all copies to appear
4787 to have been reloaded. */
4793 /* Copy the various flags, fields, and other information. We assume
4794 that all fields need copying, and then clear the fields that should
4795 not be copied. That is the sensible default behavior, and forces
4796 us to explicitly document why we are *not* copying a flag. */
4797 copy = shallow_copy_rtx (orig);
4799 /* We do not copy the USED flag, which is used as a mark bit during
4800 walks over the RTL. */
4801 RTX_FLAG (copy, used) = 0;
4803 /* We do not copy JUMP, CALL, or FRAME_RELATED for INSNs. */
4806 RTX_FLAG (copy, jump) = 0;
4807 RTX_FLAG (copy, call) = 0;
4808 RTX_FLAG (copy, frame_related) = 0;
4811 format_ptr = GET_RTX_FORMAT (GET_CODE (copy));
4813 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (copy)); i++)
4814 switch (*format_ptr++)
4817 if (XEXP (orig, i) != NULL)
4818 XEXP (copy, i) = copy_insn_1 (XEXP (orig, i));
4823 if (XVEC (orig, i) == orig_asm_constraints_vector)
4824 XVEC (copy, i) = copy_asm_constraints_vector;
4825 else if (XVEC (orig, i) == orig_asm_operands_vector)
4826 XVEC (copy, i) = copy_asm_operands_vector;
4827 else if (XVEC (orig, i) != NULL)
4829 XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i));
4830 for (j = 0; j < XVECLEN (copy, i); j++)
4831 XVECEXP (copy, i, j) = copy_insn_1 (XVECEXP (orig, i, j));
4842 /* These are left unchanged. */
4849 if (code == SCRATCH)
4851 i = copy_insn_n_scratches++;
4852 gcc_assert (i < MAX_RECOG_OPERANDS);
4853 copy_insn_scratch_in[i] = orig;
4854 copy_insn_scratch_out[i] = copy;
4856 else if (code == ASM_OPERANDS)
4858 orig_asm_operands_vector = ASM_OPERANDS_INPUT_VEC (orig);
4859 copy_asm_operands_vector = ASM_OPERANDS_INPUT_VEC (copy);
4860 orig_asm_constraints_vector = ASM_OPERANDS_INPUT_CONSTRAINT_VEC (orig);
4861 copy_asm_constraints_vector = ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy);
4867 /* Create a new copy of an rtx.
4868 This function differs from copy_rtx in that it handles SCRATCHes and
4869 ASM_OPERANDs properly.
4870 INSN doesn't really have to be a full INSN; it could be just the
4873 copy_insn (rtx insn)
4875 copy_insn_n_scratches = 0;
4876 orig_asm_operands_vector = 0;
4877 orig_asm_constraints_vector = 0;
4878 copy_asm_operands_vector = 0;
4879 copy_asm_constraints_vector = 0;
4880 return copy_insn_1 (insn);
4883 /* Initialize data structures and variables in this file
4884 before generating rtl for each function. */
4889 struct function *f = cfun;
4891 f->emit = ggc_alloc (sizeof (struct emit_status));
4895 reg_rtx_no = LAST_VIRTUAL_REGISTER + 1;
4896 last_location = UNKNOWN_LOCATION;
4897 first_label_num = label_num;
4900 /* Init the tables that describe all the pseudo regs. */
4902 f->emit->regno_pointer_align_length = LAST_VIRTUAL_REGISTER + 101;
4904 f->emit->regno_pointer_align
4905 = ggc_alloc_cleared (f->emit->regno_pointer_align_length
4906 * sizeof (unsigned char));
4909 = ggc_alloc (f->emit->regno_pointer_align_length * sizeof (rtx));
4911 /* Put copies of all the hard registers into regno_reg_rtx. */
4912 memcpy (regno_reg_rtx,
4913 static_regno_reg_rtx,
4914 FIRST_PSEUDO_REGISTER * sizeof (rtx));
4916 /* Put copies of all the virtual register rtx into regno_reg_rtx. */
4917 init_virtual_regs (f->emit);
4919 /* Indicate that the virtual registers and stack locations are
4921 REG_POINTER (stack_pointer_rtx) = 1;
4922 REG_POINTER (frame_pointer_rtx) = 1;
4923 REG_POINTER (hard_frame_pointer_rtx) = 1;
4924 REG_POINTER (arg_pointer_rtx) = 1;
4926 REG_POINTER (virtual_incoming_args_rtx) = 1;
4927 REG_POINTER (virtual_stack_vars_rtx) = 1;
4928 REG_POINTER (virtual_stack_dynamic_rtx) = 1;
4929 REG_POINTER (virtual_outgoing_args_rtx) = 1;
4930 REG_POINTER (virtual_cfa_rtx) = 1;
4932 #ifdef STACK_BOUNDARY
4933 REGNO_POINTER_ALIGN (STACK_POINTER_REGNUM) = STACK_BOUNDARY;
4934 REGNO_POINTER_ALIGN (FRAME_POINTER_REGNUM) = STACK_BOUNDARY;
4935 REGNO_POINTER_ALIGN (HARD_FRAME_POINTER_REGNUM) = STACK_BOUNDARY;
4936 REGNO_POINTER_ALIGN (ARG_POINTER_REGNUM) = STACK_BOUNDARY;
4938 REGNO_POINTER_ALIGN (VIRTUAL_INCOMING_ARGS_REGNUM) = STACK_BOUNDARY;
4939 REGNO_POINTER_ALIGN (VIRTUAL_STACK_VARS_REGNUM) = STACK_BOUNDARY;
4940 REGNO_POINTER_ALIGN (VIRTUAL_STACK_DYNAMIC_REGNUM) = STACK_BOUNDARY;
4941 REGNO_POINTER_ALIGN (VIRTUAL_OUTGOING_ARGS_REGNUM) = STACK_BOUNDARY;
4942 REGNO_POINTER_ALIGN (VIRTUAL_CFA_REGNUM) = BITS_PER_WORD;
4945 #ifdef INIT_EXPANDERS
4950 /* Generate a vector constant for mode MODE and constant value CONSTANT. */
4953 gen_const_vector (enum machine_mode mode, int constant)
4958 enum machine_mode inner;
4960 units = GET_MODE_NUNITS (mode);
4961 inner = GET_MODE_INNER (mode);
4963 gcc_assert (!DECIMAL_FLOAT_MODE_P (inner));
4965 v = rtvec_alloc (units);
4967 /* We need to call this function after we set the scalar const_tiny_rtx
4969 gcc_assert (const_tiny_rtx[constant][(int) inner]);
4971 for (i = 0; i < units; ++i)
4972 RTVEC_ELT (v, i) = const_tiny_rtx[constant][(int) inner];
4974 tem = gen_rtx_raw_CONST_VECTOR (mode, v);
4978 /* Generate a vector like gen_rtx_raw_CONST_VEC, but use the zero vector when
4979 all elements are zero, and the one vector when all elements are one. */
4981 gen_rtx_CONST_VECTOR (enum machine_mode mode, rtvec v)
4983 enum machine_mode inner = GET_MODE_INNER (mode);
4984 int nunits = GET_MODE_NUNITS (mode);
4988 /* Check to see if all of the elements have the same value. */
4989 x = RTVEC_ELT (v, nunits - 1);
4990 for (i = nunits - 2; i >= 0; i--)
4991 if (RTVEC_ELT (v, i) != x)
4994 /* If the values are all the same, check to see if we can use one of the
4995 standard constant vectors. */
4998 if (x == CONST0_RTX (inner))
4999 return CONST0_RTX (mode);
5000 else if (x == CONST1_RTX (inner))
5001 return CONST1_RTX (mode);
5004 return gen_rtx_raw_CONST_VECTOR (mode, v);
5007 /* Create some permanent unique rtl objects shared between all functions.
5008 LINE_NUMBERS is nonzero if line numbers are to be generated. */
5011 init_emit_once (int line_numbers)
5014 enum machine_mode mode;
5015 enum machine_mode double_mode;
5017 /* We need reg_raw_mode, so initialize the modes now. */
5018 init_reg_modes_once ();
5020 /* Initialize the CONST_INT, CONST_DOUBLE, and memory attribute hash
5022 const_int_htab = htab_create_ggc (37, const_int_htab_hash,
5023 const_int_htab_eq, NULL);
5025 const_double_htab = htab_create_ggc (37, const_double_htab_hash,
5026 const_double_htab_eq, NULL);
5028 mem_attrs_htab = htab_create_ggc (37, mem_attrs_htab_hash,
5029 mem_attrs_htab_eq, NULL);
5030 reg_attrs_htab = htab_create_ggc (37, reg_attrs_htab_hash,
5031 reg_attrs_htab_eq, NULL);
5033 no_line_numbers = ! line_numbers;
5035 /* Compute the word and byte modes. */
5037 byte_mode = VOIDmode;
5038 word_mode = VOIDmode;
5039 double_mode = VOIDmode;
5041 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
5043 mode = GET_MODE_WIDER_MODE (mode))
5045 if (GET_MODE_BITSIZE (mode) == BITS_PER_UNIT
5046 && byte_mode == VOIDmode)
5049 if (GET_MODE_BITSIZE (mode) == BITS_PER_WORD
5050 && word_mode == VOIDmode)
5054 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT);
5056 mode = GET_MODE_WIDER_MODE (mode))
5058 if (GET_MODE_BITSIZE (mode) == DOUBLE_TYPE_SIZE
5059 && double_mode == VOIDmode)
5063 ptr_mode = mode_for_size (POINTER_SIZE, GET_MODE_CLASS (Pmode), 0);
5065 /* Assign register numbers to the globally defined register rtx.
5066 This must be done at runtime because the register number field
5067 is in a union and some compilers can't initialize unions. */
5069 pc_rtx = gen_rtx_PC (VOIDmode);
5070 cc0_rtx = gen_rtx_CC0 (VOIDmode);
5071 stack_pointer_rtx = gen_raw_REG (Pmode, STACK_POINTER_REGNUM);
5072 frame_pointer_rtx = gen_raw_REG (Pmode, FRAME_POINTER_REGNUM);
5073 if (hard_frame_pointer_rtx == 0)
5074 hard_frame_pointer_rtx = gen_raw_REG (Pmode,
5075 HARD_FRAME_POINTER_REGNUM);
5076 if (arg_pointer_rtx == 0)
5077 arg_pointer_rtx = gen_raw_REG (Pmode, ARG_POINTER_REGNUM);
5078 virtual_incoming_args_rtx =
5079 gen_raw_REG (Pmode, VIRTUAL_INCOMING_ARGS_REGNUM);
5080 virtual_stack_vars_rtx =
5081 gen_raw_REG (Pmode, VIRTUAL_STACK_VARS_REGNUM);
5082 virtual_stack_dynamic_rtx =
5083 gen_raw_REG (Pmode, VIRTUAL_STACK_DYNAMIC_REGNUM);
5084 virtual_outgoing_args_rtx =
5085 gen_raw_REG (Pmode, VIRTUAL_OUTGOING_ARGS_REGNUM);
5086 virtual_cfa_rtx = gen_raw_REG (Pmode, VIRTUAL_CFA_REGNUM);
5088 /* Initialize RTL for commonly used hard registers. These are
5089 copied into regno_reg_rtx as we begin to compile each function. */
5090 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
5091 static_regno_reg_rtx[i] = gen_raw_REG (reg_raw_mode[i], i);
5093 #ifdef INIT_EXPANDERS
5094 /* This is to initialize {init|mark|free}_machine_status before the first
5095 call to push_function_context_to. This is needed by the Chill front
5096 end which calls push_function_context_to before the first call to
5097 init_function_start. */
5101 /* Create the unique rtx's for certain rtx codes and operand values. */
5103 /* Don't use gen_rtx_CONST_INT here since gen_rtx_CONST_INT in this case
5104 tries to use these variables. */
5105 for (i = - MAX_SAVED_CONST_INT; i <= MAX_SAVED_CONST_INT; i++)
5106 const_int_rtx[i + MAX_SAVED_CONST_INT] =
5107 gen_rtx_raw_CONST_INT (VOIDmode, (HOST_WIDE_INT) i);
5109 if (STORE_FLAG_VALUE >= - MAX_SAVED_CONST_INT
5110 && STORE_FLAG_VALUE <= MAX_SAVED_CONST_INT)
5111 const_true_rtx = const_int_rtx[STORE_FLAG_VALUE + MAX_SAVED_CONST_INT];
5113 const_true_rtx = gen_rtx_CONST_INT (VOIDmode, STORE_FLAG_VALUE);
5115 REAL_VALUE_FROM_INT (dconst0, 0, 0, double_mode);
5116 REAL_VALUE_FROM_INT (dconst1, 1, 0, double_mode);
5117 REAL_VALUE_FROM_INT (dconst2, 2, 0, double_mode);
5118 REAL_VALUE_FROM_INT (dconst3, 3, 0, double_mode);
5119 REAL_VALUE_FROM_INT (dconst10, 10, 0, double_mode);
5120 REAL_VALUE_FROM_INT (dconstm1, -1, -1, double_mode);
5121 REAL_VALUE_FROM_INT (dconstm2, -2, -1, double_mode);
5123 dconsthalf = dconst1;
5124 SET_REAL_EXP (&dconsthalf, REAL_EXP (&dconsthalf) - 1);
5126 real_arithmetic (&dconstthird, RDIV_EXPR, &dconst1, &dconst3);
5128 /* Initialize mathematical constants for constant folding builtins.
5129 These constants need to be given to at least 160 bits precision. */
5130 real_from_string (&dconstsqrt2,
5131 "1.4142135623730950488016887242096980785696718753769480731766797379907");
5132 real_from_string (&dconste,
5133 "2.7182818284590452353602874713526624977572470936999595749669676277241");
5135 for (i = 0; i < (int) ARRAY_SIZE (const_tiny_rtx); i++)
5137 REAL_VALUE_TYPE *r =
5138 (i == 0 ? &dconst0 : i == 1 ? &dconst1 : &dconst2);
5140 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT);
5142 mode = GET_MODE_WIDER_MODE (mode))
5143 const_tiny_rtx[i][(int) mode] =
5144 CONST_DOUBLE_FROM_REAL_VALUE (*r, mode);
5146 for (mode = GET_CLASS_NARROWEST_MODE (MODE_DECIMAL_FLOAT);
5148 mode = GET_MODE_WIDER_MODE (mode))
5149 const_tiny_rtx[i][(int) mode] =
5150 CONST_DOUBLE_FROM_REAL_VALUE (*r, mode);
5152 const_tiny_rtx[i][(int) VOIDmode] = GEN_INT (i);
5154 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
5156 mode = GET_MODE_WIDER_MODE (mode))
5157 const_tiny_rtx[i][(int) mode] = GEN_INT (i);
5159 for (mode = GET_CLASS_NARROWEST_MODE (MODE_PARTIAL_INT);
5161 mode = GET_MODE_WIDER_MODE (mode))
5162 const_tiny_rtx[i][(int) mode] = GEN_INT (i);
5165 for (mode = GET_CLASS_NARROWEST_MODE (MODE_VECTOR_INT);
5167 mode = GET_MODE_WIDER_MODE (mode))
5169 const_tiny_rtx[0][(int) mode] = gen_const_vector (mode, 0);
5170 const_tiny_rtx[1][(int) mode] = gen_const_vector (mode, 1);
5173 for (mode = GET_CLASS_NARROWEST_MODE (MODE_VECTOR_FLOAT);
5175 mode = GET_MODE_WIDER_MODE (mode))
5177 const_tiny_rtx[0][(int) mode] = gen_const_vector (mode, 0);
5178 const_tiny_rtx[1][(int) mode] = gen_const_vector (mode, 1);
5181 for (i = (int) CCmode; i < (int) MAX_MACHINE_MODE; ++i)
5182 if (GET_MODE_CLASS ((enum machine_mode) i) == MODE_CC)
5183 const_tiny_rtx[0][i] = const0_rtx;
5185 const_tiny_rtx[0][(int) BImode] = const0_rtx;
5186 if (STORE_FLAG_VALUE == 1)
5187 const_tiny_rtx[1][(int) BImode] = const1_rtx;
5189 #ifdef RETURN_ADDRESS_POINTER_REGNUM
5190 return_address_pointer_rtx
5191 = gen_raw_REG (Pmode, RETURN_ADDRESS_POINTER_REGNUM);
5194 #ifdef STATIC_CHAIN_REGNUM
5195 static_chain_rtx = gen_rtx_REG (Pmode, STATIC_CHAIN_REGNUM);
5197 #ifdef STATIC_CHAIN_INCOMING_REGNUM
5198 if (STATIC_CHAIN_INCOMING_REGNUM != STATIC_CHAIN_REGNUM)
5199 static_chain_incoming_rtx
5200 = gen_rtx_REG (Pmode, STATIC_CHAIN_INCOMING_REGNUM);
5203 static_chain_incoming_rtx = static_chain_rtx;
5207 static_chain_rtx = STATIC_CHAIN;
5209 #ifdef STATIC_CHAIN_INCOMING
5210 static_chain_incoming_rtx = STATIC_CHAIN_INCOMING;
5212 static_chain_incoming_rtx = static_chain_rtx;
5216 if ((unsigned) PIC_OFFSET_TABLE_REGNUM != INVALID_REGNUM)
5217 pic_offset_table_rtx = gen_raw_REG (Pmode, PIC_OFFSET_TABLE_REGNUM);
5220 /* Produce exact duplicate of insn INSN after AFTER.
5221 Care updating of libcall regions if present. */
5224 emit_copy_of_insn_after (rtx insn, rtx after)
5227 rtx note1, note2, link;
5229 switch (GET_CODE (insn))
5232 new = emit_insn_after (copy_insn (PATTERN (insn)), after);
5236 new = emit_jump_insn_after (copy_insn (PATTERN (insn)), after);
5240 new = emit_call_insn_after (copy_insn (PATTERN (insn)), after);
5241 if (CALL_INSN_FUNCTION_USAGE (insn))
5242 CALL_INSN_FUNCTION_USAGE (new)
5243 = copy_insn (CALL_INSN_FUNCTION_USAGE (insn));
5244 SIBLING_CALL_P (new) = SIBLING_CALL_P (insn);
5245 CONST_OR_PURE_CALL_P (new) = CONST_OR_PURE_CALL_P (insn);
5252 /* Update LABEL_NUSES. */
5253 mark_jump_label (PATTERN (new), new, 0);
5255 INSN_LOCATOR (new) = INSN_LOCATOR (insn);
5257 /* If the old insn is frame related, then so is the new one. This is
5258 primarily needed for IA-64 unwind info which marks epilogue insns,
5259 which may be duplicated by the basic block reordering code. */
5260 RTX_FRAME_RELATED_P (new) = RTX_FRAME_RELATED_P (insn);
5262 /* Copy all REG_NOTES except REG_LABEL since mark_jump_label will
5264 for (link = REG_NOTES (insn); link; link = XEXP (link, 1))
5265 if (REG_NOTE_KIND (link) != REG_LABEL)
5267 if (GET_CODE (link) == EXPR_LIST)
5269 = gen_rtx_EXPR_LIST (REG_NOTE_KIND (link),
5270 copy_insn_1 (XEXP (link, 0)), REG_NOTES (new));
5273 = gen_rtx_INSN_LIST (REG_NOTE_KIND (link),
5274 XEXP (link, 0), REG_NOTES (new));
5277 /* Fix the libcall sequences. */
5278 if ((note1 = find_reg_note (new, REG_RETVAL, NULL_RTX)) != NULL)
5281 while ((note2 = find_reg_note (p, REG_LIBCALL, NULL_RTX)) == NULL)
5283 XEXP (note1, 0) = p;
5284 XEXP (note2, 0) = new;
5286 INSN_CODE (new) = INSN_CODE (insn);
5290 static GTY((deletable)) rtx hard_reg_clobbers [NUM_MACHINE_MODES][FIRST_PSEUDO_REGISTER];
5292 gen_hard_reg_clobber (enum machine_mode mode, unsigned int regno)
5294 if (hard_reg_clobbers[mode][regno])
5295 return hard_reg_clobbers[mode][regno];
5297 return (hard_reg_clobbers[mode][regno] =
5298 gen_rtx_CLOBBER (VOIDmode, gen_rtx_REG (mode, regno)));
5301 #include "gt-emit-rtl.h"