1 /* Emit RTL for the GNU C-Compiler expander.
2 Copyright (C) 1987, 88, 92, 93, 94, 95, 1996 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* Middle-to-low level generation of rtx code and insns.
24 This file contains the functions `gen_rtx', `gen_reg_rtx'
25 and `gen_label_rtx' that are the usual ways of creating rtl
26 expressions for most purposes.
28 It also has the functions for creating insns and linking
29 them in the doubly-linked chain.
31 The patterns of the insns are created by machine-dependent
32 routines in insn-emit.c, which is generated automatically from
33 the machine description. These routines use `gen_rtx' to make
34 the individual rtx's of the pattern; what is machine dependent
35 is the kind of rtx's they make and what arguments they use. */
50 #include "insn-config.h"
56 #include "bc-opcode.h"
57 #include "bc-typecd.h"
65 #ifdef BCDEBUG_PRINT_CODE
68 #include "bc-opname.h"
75 /* Commonly used modes. */
77 enum machine_mode byte_mode; /* Mode whose width is BITS_PER_UNIT. */
78 enum machine_mode word_mode; /* Mode whose width is BITS_PER_WORD. */
79 enum machine_mode ptr_mode; /* Mode whose width is POINTER_SIZE. */
81 /* This is reset to LAST_VIRTUAL_REGISTER + 1 at the start of each function.
82 After rtl generation, it is 1 plus the largest register number used. */
84 int reg_rtx_no = LAST_VIRTUAL_REGISTER + 1;
86 /* This is *not* reset after each function. It gives each CODE_LABEL
87 in the entire compilation a unique label number. */
89 static int label_num = 1;
91 /* Lowest label number in current function. */
93 static int first_label_num;
95 /* Highest label number in current function.
96 Zero means use the value of label_num instead.
97 This is nonzero only when belatedly compiling an inline function. */
99 static int last_label_num;
101 /* Value label_num had when set_new_first_and_last_label_number was called.
102 If label_num has not changed since then, last_label_num is valid. */
104 static int base_label_num;
106 /* Nonzero means do not generate NOTEs for source line numbers. */
108 static int no_line_numbers;
110 /* Commonly used rtx's, so that we only need space for one copy.
111 These are initialized once for the entire compilation.
112 All of these except perhaps the floating-point CONST_DOUBLEs
113 are unique; no other rtx-object will be equal to any of these. */
115 rtx pc_rtx; /* (PC) */
116 rtx cc0_rtx; /* (CC0) */
117 rtx cc1_rtx; /* (CC1) (not actually used nowadays) */
118 rtx const0_rtx; /* (CONST_INT 0) */
119 rtx const1_rtx; /* (CONST_INT 1) */
120 rtx const2_rtx; /* (CONST_INT 2) */
121 rtx constm1_rtx; /* (CONST_INT -1) */
122 rtx const_true_rtx; /* (CONST_INT STORE_FLAG_VALUE) */
124 /* We record floating-point CONST_DOUBLEs in each floating-point mode for
125 the values of 0, 1, and 2. For the integer entries and VOIDmode, we
126 record a copy of const[012]_rtx. */
128 rtx const_tiny_rtx[3][(int) MAX_MACHINE_MODE];
130 REAL_VALUE_TYPE dconst0;
131 REAL_VALUE_TYPE dconst1;
132 REAL_VALUE_TYPE dconst2;
133 REAL_VALUE_TYPE dconstm1;
135 /* All references to the following fixed hard registers go through
136 these unique rtl objects. On machines where the frame-pointer and
137 arg-pointer are the same register, they use the same unique object.
139 After register allocation, other rtl objects which used to be pseudo-regs
140 may be clobbered to refer to the frame-pointer register.
141 But references that were originally to the frame-pointer can be
142 distinguished from the others because they contain frame_pointer_rtx.
144 When to use frame_pointer_rtx and hard_frame_pointer_rtx is a little
145 tricky: until register elimination has taken place hard_frame_pointer_rtx
146 should be used if it is being set, and frame_pointer_rtx otherwise. After
147 register elimination hard_frame_pointer_rtx should always be used.
148 On machines where the two registers are same (most) then these are the
151 In an inline procedure, the stack and frame pointer rtxs may not be
152 used for anything else. */
153 rtx stack_pointer_rtx; /* (REG:Pmode STACK_POINTER_REGNUM) */
154 rtx frame_pointer_rtx; /* (REG:Pmode FRAME_POINTER_REGNUM) */
155 rtx hard_frame_pointer_rtx; /* (REG:Pmode HARD_FRAME_POINTER_REGNUM) */
156 rtx arg_pointer_rtx; /* (REG:Pmode ARG_POINTER_REGNUM) */
157 rtx struct_value_rtx; /* (REG:Pmode STRUCT_VALUE_REGNUM) */
158 rtx struct_value_incoming_rtx; /* (REG:Pmode STRUCT_VALUE_INCOMING_REGNUM) */
159 rtx static_chain_rtx; /* (REG:Pmode STATIC_CHAIN_REGNUM) */
160 rtx static_chain_incoming_rtx; /* (REG:Pmode STATIC_CHAIN_INCOMING_REGNUM) */
161 rtx pic_offset_table_rtx; /* (REG:Pmode PIC_OFFSET_TABLE_REGNUM) */
163 /* This is used to implement __builtin_return_address for some machines.
164 See for instance the MIPS port. */
165 rtx return_address_pointer_rtx; /* (REG:Pmode RETURN_ADDRESS_POINTER_REGNUM) */
167 rtx virtual_incoming_args_rtx; /* (REG:Pmode VIRTUAL_INCOMING_ARGS_REGNUM) */
168 rtx virtual_stack_vars_rtx; /* (REG:Pmode VIRTUAL_STACK_VARS_REGNUM) */
169 rtx virtual_stack_dynamic_rtx; /* (REG:Pmode VIRTUAL_STACK_DYNAMIC_REGNUM) */
170 rtx virtual_outgoing_args_rtx; /* (REG:Pmode VIRTUAL_OUTGOING_ARGS_REGNUM) */
172 /* We make one copy of (const_int C) where C is in
173 [- MAX_SAVED_CONST_INT, MAX_SAVED_CONST_INT]
174 to save space during the compilation and simplify comparisons of
177 #define MAX_SAVED_CONST_INT 64
179 static rtx const_int_rtx[MAX_SAVED_CONST_INT * 2 + 1];
181 /* The ends of the doubly-linked chain of rtl for the current function.
182 Both are reset to null at the start of rtl generation for the function.
184 start_sequence saves both of these on `sequence_stack' along with
185 `sequence_rtl_expr' and then starts a new, nested sequence of insns. */
187 static rtx first_insn = NULL;
188 static rtx last_insn = NULL;
190 /* RTL_EXPR within which the current sequence will be placed. Use to
191 prevent reuse of any temporaries within the sequence until after the
192 RTL_EXPR is emitted. */
194 tree sequence_rtl_expr = NULL;
196 /* INSN_UID for next insn emitted.
197 Reset to 1 for each function compiled. */
199 static int cur_insn_uid = 1;
201 /* Line number and source file of the last line-number NOTE emitted.
202 This is used to avoid generating duplicates. */
204 static int last_linenum = 0;
205 static char *last_filename = 0;
207 /* A vector indexed by pseudo reg number. The allocated length
208 of this vector is regno_pointer_flag_length. Since this
209 vector is needed during the expansion phase when the total
210 number of registers in the function is not yet known,
211 it is copied and made bigger when necessary. */
213 char *regno_pointer_flag;
214 int regno_pointer_flag_length;
216 /* Indexed by pseudo register number, if nonzero gives the known alignment
217 for that pseudo (if regno_pointer_flag is set).
218 Allocated in parallel with regno_pointer_flag. */
219 char *regno_pointer_align;
221 /* Indexed by pseudo register number, gives the rtx for that pseudo.
222 Allocated in parallel with regno_pointer_flag. */
226 /* Stack of pending (incomplete) sequences saved by `start_sequence'.
227 Each element describes one pending sequence.
228 The main insn-chain is saved in the last element of the chain,
229 unless the chain is empty. */
231 struct sequence_stack *sequence_stack;
233 /* start_sequence and gen_sequence can make a lot of rtx expressions which are
234 shortly thrown away. We use two mechanisms to prevent this waste:
236 First, we keep a list of the expressions used to represent the sequence
237 stack in sequence_element_free_list.
239 Second, for sizes up to 5 elements, we keep a SEQUENCE and its associated
240 rtvec for use by gen_sequence. One entry for each size is sufficient
241 because most cases are calls to gen_sequence followed by immediately
242 emitting the SEQUENCE. Reuse is safe since emitting a sequence is
243 destructive on the insn in it anyway and hence can't be redone.
245 We do not bother to save this cached data over nested function calls.
246 Instead, we just reinitialize them. */
248 #define SEQUENCE_RESULT_SIZE 5
250 static struct sequence_stack *sequence_element_free_list;
251 static rtx sequence_result[SEQUENCE_RESULT_SIZE];
253 /* During RTL generation, we also keep a list of free INSN rtl codes. */
254 static rtx free_insn;
256 extern int rtx_equal_function_value_matters;
258 /* Filename and line number of last line-number note,
259 whether we actually emitted it or not. */
260 extern char *emit_filename;
261 extern int emit_lineno;
263 rtx change_address ();
266 extern struct obstack *rtl_obstack;
268 extern int stack_depth;
269 extern int max_stack_depth;
271 /* rtx gen_rtx (code, mode, [element1, ..., elementn])
273 ** This routine generates an RTX of the size specified by
274 ** <code>, which is an RTX code. The RTX structure is initialized
275 ** from the arguments <element1> through <elementn>, which are
276 ** interpreted according to the specific RTX type's format. The
277 ** special machine mode associated with the rtx (if any) is specified
280 ** gen_rtx can be invoked in a way which resembles the lisp-like
281 ** rtx it will generate. For example, the following rtx structure:
283 ** (plus:QI (mem:QI (reg:SI 1))
284 ** (mem:QI (plusw:SI (reg:SI 2) (reg:SI 3))))
286 ** ...would be generated by the following C code:
288 ** gen_rtx (PLUS, QImode,
289 ** gen_rtx (MEM, QImode,
290 ** gen_rtx (REG, SImode, 1)),
291 ** gen_rtx (MEM, QImode,
292 ** gen_rtx (PLUS, SImode,
293 ** gen_rtx (REG, SImode, 2),
294 ** gen_rtx (REG, SImode, 3)))),
299 gen_rtx VPROTO((enum rtx_code code, enum machine_mode mode, ...))
303 enum machine_mode mode;
306 register int i; /* Array indices... */
307 register char *fmt; /* Current rtx's format... */
308 register rtx rt_val; /* RTX to return to caller... */
313 code = va_arg (p, enum rtx_code);
314 mode = va_arg (p, enum machine_mode);
317 if (code == CONST_INT)
319 HOST_WIDE_INT arg = va_arg (p, HOST_WIDE_INT);
321 if (arg >= - MAX_SAVED_CONST_INT && arg <= MAX_SAVED_CONST_INT)
322 return const_int_rtx[arg + MAX_SAVED_CONST_INT];
324 if (const_true_rtx && arg == STORE_FLAG_VALUE)
325 return const_true_rtx;
327 rt_val = rtx_alloc (code);
328 INTVAL (rt_val) = arg;
330 else if (code == REG)
332 int regno = va_arg (p, int);
334 /* In case the MD file explicitly references the frame pointer, have
335 all such references point to the same frame pointer. This is used
336 during frame pointer elimination to distinguish the explicit
337 references to these registers from pseudos that happened to be
340 If we have eliminated the frame pointer or arg pointer, we will
341 be using it as a normal register, for example as a spill register.
342 In such cases, we might be accessing it in a mode that is not
343 Pmode and therefore cannot use the pre-allocated rtx.
345 Also don't do this when we are making new REGs in reload,
346 since we don't want to get confused with the real pointers. */
348 if (frame_pointer_rtx && regno == FRAME_POINTER_REGNUM && mode == Pmode
349 && ! reload_in_progress)
350 return frame_pointer_rtx;
351 #if FRAME_POINTER_REGNUM != HARD_FRAME_POINTER_REGNUM
352 if (hard_frame_pointer_rtx && regno == HARD_FRAME_POINTER_REGNUM
353 && mode == Pmode && ! reload_in_progress)
354 return hard_frame_pointer_rtx;
356 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM && HARD_FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
357 if (arg_pointer_rtx && regno == ARG_POINTER_REGNUM && mode == Pmode
358 && ! reload_in_progress)
359 return arg_pointer_rtx;
361 #ifdef RETURN_ADDRESS_POINTER_REGNUM
362 if (return_address_pointer_rtx && regno == RETURN_ADDRESS_POINTER_REGNUM
363 && mode == Pmode && ! reload_in_progress)
364 return return_address_pointer_rtx;
366 if (stack_pointer_rtx && regno == STACK_POINTER_REGNUM && mode == Pmode
367 && ! reload_in_progress)
368 return stack_pointer_rtx;
371 rt_val = rtx_alloc (code);
373 REGNO (rt_val) = regno;
379 rt_val = rtx_alloc (code); /* Allocate the storage space. */
380 rt_val->mode = mode; /* Store the machine mode... */
382 fmt = GET_RTX_FORMAT (code); /* Find the right format... */
383 for (i = 0; i < GET_RTX_LENGTH (code); i++)
387 case '0': /* Unused field. */
390 case 'i': /* An integer? */
391 XINT (rt_val, i) = va_arg (p, int);
394 case 'w': /* A wide integer? */
395 XWINT (rt_val, i) = va_arg (p, HOST_WIDE_INT);
398 case 's': /* A string? */
399 XSTR (rt_val, i) = va_arg (p, char *);
402 case 'e': /* An expression? */
403 case 'u': /* An insn? Same except when printing. */
404 XEXP (rt_val, i) = va_arg (p, rtx);
407 case 'E': /* An RTX vector? */
408 XVEC (rt_val, i) = va_arg (p, rtvec);
417 return rt_val; /* Return the new RTX... */
420 /* gen_rtvec (n, [rt1, ..., rtn])
422 ** This routine creates an rtvec and stores within it the
423 ** pointers to rtx's which are its arguments.
428 gen_rtvec VPROTO((int n, ...))
444 return NULL_RTVEC; /* Don't allocate an empty rtvec... */
446 vector = (rtx *) alloca (n * sizeof (rtx));
448 for (i = 0; i < n; i++)
449 vector[i] = va_arg (p, rtx);
452 return gen_rtvec_v (n, vector);
456 gen_rtvec_v (n, argp)
461 register rtvec rt_val;
464 return NULL_RTVEC; /* Don't allocate an empty rtvec... */
466 rt_val = rtvec_alloc (n); /* Allocate an rtvec... */
468 for (i = 0; i < n; i++)
469 rt_val->elem[i].rtx = *argp++;
475 gen_rtvec_vv (n, argp)
480 register rtvec rt_val;
483 return NULL_RTVEC; /* Don't allocate an empty rtvec... */
485 rt_val = rtvec_alloc (n); /* Allocate an rtvec... */
487 for (i = 0; i < n; i++)
488 rt_val->elem[i].rtx = (argp++)->rtx;
493 /* Generate a REG rtx for a new pseudo register of mode MODE.
494 This pseudo is assigned the next sequential register number. */
498 enum machine_mode mode;
502 /* Don't let anything called by or after reload create new registers
503 (actually, registers can't be created after flow, but this is a good
506 if (reload_in_progress || reload_completed)
509 if (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT
510 || GET_MODE_CLASS (mode) == MODE_COMPLEX_INT)
512 /* For complex modes, don't make a single pseudo.
513 Instead, make a CONCAT of two pseudos.
514 This allows noncontiguous allocation of the real and imaginary parts,
515 which makes much better code. Besides, allocating DCmode
516 pseudos overstrains reload on some machines like the 386. */
517 rtx realpart, imagpart;
518 int size = GET_MODE_UNIT_SIZE (mode);
519 enum machine_mode partmode
520 = mode_for_size (size * BITS_PER_UNIT,
521 (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT
522 ? MODE_FLOAT : MODE_INT),
525 realpart = gen_reg_rtx (partmode);
526 imagpart = gen_reg_rtx (partmode);
527 return gen_rtx (CONCAT, mode, realpart, imagpart);
530 /* Make sure regno_pointer_flag and regno_reg_rtx are large
531 enough to have an element for this pseudo reg number. */
533 if (reg_rtx_no == regno_pointer_flag_length)
537 (char *) savealloc (regno_pointer_flag_length * 2);
538 bcopy (regno_pointer_flag, new, regno_pointer_flag_length);
539 bzero (&new[regno_pointer_flag_length], regno_pointer_flag_length);
540 regno_pointer_flag = new;
542 new = (char *) savealloc (regno_pointer_flag_length * 2);
543 bcopy (regno_pointer_align, new, regno_pointer_flag_length);
544 bzero (&new[regno_pointer_flag_length], regno_pointer_flag_length);
545 regno_pointer_align = new;
547 new1 = (rtx *) savealloc (regno_pointer_flag_length * 2 * sizeof (rtx));
548 bcopy ((char *) regno_reg_rtx, (char *) new1,
549 regno_pointer_flag_length * sizeof (rtx));
550 bzero ((char *) &new1[regno_pointer_flag_length],
551 regno_pointer_flag_length * sizeof (rtx));
552 regno_reg_rtx = new1;
554 regno_pointer_flag_length *= 2;
557 val = gen_rtx (REG, mode, reg_rtx_no);
558 regno_reg_rtx[reg_rtx_no++] = val;
562 /* Identify REG (which may be a CONCAT) as a user register. */
568 if (GET_CODE (reg) == CONCAT)
570 REG_USERVAR_P (XEXP (reg, 0)) = 1;
571 REG_USERVAR_P (XEXP (reg, 1)) = 1;
573 else if (GET_CODE (reg) == REG)
574 REG_USERVAR_P (reg) = 1;
579 /* Identify REG as a probable pointer register and show its alignment
580 as ALIGN, if nonzero. */
583 mark_reg_pointer (reg, align)
587 REGNO_POINTER_FLAG (REGNO (reg)) = 1;
590 REGNO_POINTER_ALIGN (REGNO (reg)) = align;
593 /* Return 1 plus largest pseudo reg number used in the current function. */
601 /* Return 1 + the largest label number used so far in the current function. */
606 if (last_label_num && label_num == base_label_num)
607 return last_label_num;
611 /* Return first label number used in this function (if any were used). */
614 get_first_label_num ()
616 return first_label_num;
619 /* Return a value representing some low-order bits of X, where the number
620 of low-order bits is given by MODE. Note that no conversion is done
621 between floating-point and fixed-point values, rather, the bit
622 representation is returned.
624 This function handles the cases in common between gen_lowpart, below,
625 and two variants in cse.c and combine.c. These are the cases that can
626 be safely handled at all points in the compilation.
628 If this is not a case we can handle, return 0. */
631 gen_lowpart_common (mode, x)
632 enum machine_mode mode;
637 if (GET_MODE (x) == mode)
640 /* MODE must occupy no more words than the mode of X. */
641 if (GET_MODE (x) != VOIDmode
642 && ((GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD
643 > ((GET_MODE_SIZE (GET_MODE (x)) + (UNITS_PER_WORD - 1))
647 if (WORDS_BIG_ENDIAN && GET_MODE_SIZE (GET_MODE (x)) > UNITS_PER_WORD)
648 word = ((GET_MODE_SIZE (GET_MODE (x))
649 - MAX (GET_MODE_SIZE (mode), UNITS_PER_WORD))
652 if ((GET_CODE (x) == ZERO_EXTEND || GET_CODE (x) == SIGN_EXTEND)
653 && (GET_MODE_CLASS (mode) == MODE_INT
654 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT))
656 /* If we are getting the low-order part of something that has been
657 sign- or zero-extended, we can either just use the object being
658 extended or make a narrower extension. If we want an even smaller
659 piece than the size of the object being extended, call ourselves
662 This case is used mostly by combine and cse. */
664 if (GET_MODE (XEXP (x, 0)) == mode)
666 else if (GET_MODE_SIZE (mode) < GET_MODE_SIZE (GET_MODE (XEXP (x, 0))))
667 return gen_lowpart_common (mode, XEXP (x, 0));
668 else if (GET_MODE_SIZE (mode) < GET_MODE_SIZE (GET_MODE (x)))
669 return gen_rtx (GET_CODE (x), mode, XEXP (x, 0));
671 else if (GET_CODE (x) == SUBREG
672 && (GET_MODE_SIZE (mode) <= UNITS_PER_WORD
673 || GET_MODE_SIZE (mode) == GET_MODE_UNIT_SIZE (GET_MODE (x))))
674 return (GET_MODE (SUBREG_REG (x)) == mode && SUBREG_WORD (x) == 0
676 : gen_rtx (SUBREG, mode, SUBREG_REG (x), SUBREG_WORD (x)));
677 else if (GET_CODE (x) == REG)
679 /* If the register is not valid for MODE, return 0. If we don't
680 do this, there is no way to fix up the resulting REG later.
681 But we do do this if the current REG is not valid for its
682 mode. This latter is a kludge, but is required due to the
683 way that parameters are passed on some machines, most
685 if (REGNO (x) < FIRST_PSEUDO_REGISTER
686 && ! HARD_REGNO_MODE_OK (REGNO (x) + word, mode)
687 && HARD_REGNO_MODE_OK (REGNO (x), GET_MODE (x)))
689 else if (REGNO (x) < FIRST_PSEUDO_REGISTER
690 /* integrate.c can't handle parts of a return value register. */
691 && (! REG_FUNCTION_VALUE_P (x)
692 || ! rtx_equal_function_value_matters)
693 /* We want to keep the stack, frame, and arg pointers
695 && x != frame_pointer_rtx
696 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
697 && x != arg_pointer_rtx
699 && x != stack_pointer_rtx)
700 return gen_rtx (REG, mode, REGNO (x) + word);
702 return gen_rtx (SUBREG, mode, x, word);
704 /* If X is a CONST_INT or a CONST_DOUBLE, extract the appropriate bits
705 from the low-order part of the constant. */
706 else if ((GET_MODE_CLASS (mode) == MODE_INT
707 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT)
708 && GET_MODE (x) == VOIDmode
709 && (GET_CODE (x) == CONST_INT || GET_CODE (x) == CONST_DOUBLE))
711 /* If MODE is twice the host word size, X is already the desired
712 representation. Otherwise, if MODE is wider than a word, we can't
713 do this. If MODE is exactly a word, return just one CONST_INT.
714 If MODE is smaller than a word, clear the bits that don't belong
715 in our mode, unless they and our sign bit are all one. So we get
716 either a reasonable negative value or a reasonable unsigned value
719 if (GET_MODE_BITSIZE (mode) >= 2 * HOST_BITS_PER_WIDE_INT)
721 else if (GET_MODE_BITSIZE (mode) > HOST_BITS_PER_WIDE_INT)
723 else if (GET_MODE_BITSIZE (mode) == HOST_BITS_PER_WIDE_INT)
724 return (GET_CODE (x) == CONST_INT ? x
725 : GEN_INT (CONST_DOUBLE_LOW (x)));
728 /* MODE must be narrower than HOST_BITS_PER_INT. */
729 int width = GET_MODE_BITSIZE (mode);
730 HOST_WIDE_INT val = (GET_CODE (x) == CONST_INT ? INTVAL (x)
731 : CONST_DOUBLE_LOW (x));
733 if (((val & ((HOST_WIDE_INT) (-1) << (width - 1)))
734 != ((HOST_WIDE_INT) (-1) << (width - 1))))
735 val &= ((HOST_WIDE_INT) 1 << width) - 1;
737 return (GET_CODE (x) == CONST_INT && INTVAL (x) == val ? x
742 /* If X is an integral constant but we want it in floating-point, it
743 must be the case that we have a union of an integer and a floating-point
744 value. If the machine-parameters allow it, simulate that union here
745 and return the result. The two-word and single-word cases are
748 else if (((HOST_FLOAT_FORMAT == TARGET_FLOAT_FORMAT
749 && HOST_BITS_PER_WIDE_INT == BITS_PER_WORD)
750 || flag_pretend_float)
751 && GET_MODE_CLASS (mode) == MODE_FLOAT
752 && GET_MODE_SIZE (mode) == UNITS_PER_WORD
753 && GET_CODE (x) == CONST_INT
754 && sizeof (float) * HOST_BITS_PER_CHAR == HOST_BITS_PER_WIDE_INT)
755 #ifdef REAL_ARITHMETIC
761 r = REAL_VALUE_FROM_TARGET_SINGLE (i);
762 return CONST_DOUBLE_FROM_REAL_VALUE (r, mode);
766 union {HOST_WIDE_INT i; float d; } u;
769 return CONST_DOUBLE_FROM_REAL_VALUE (u.d, mode);
772 else if (((HOST_FLOAT_FORMAT == TARGET_FLOAT_FORMAT
773 && HOST_BITS_PER_WIDE_INT == BITS_PER_WORD)
774 || flag_pretend_float)
775 && GET_MODE_CLASS (mode) == MODE_FLOAT
776 && GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD
777 && (GET_CODE (x) == CONST_INT || GET_CODE (x) == CONST_DOUBLE)
778 && GET_MODE (x) == VOIDmode
779 && (sizeof (double) * HOST_BITS_PER_CHAR
780 == 2 * HOST_BITS_PER_WIDE_INT))
781 #ifdef REAL_ARITHMETIC
785 HOST_WIDE_INT low, high;
787 if (GET_CODE (x) == CONST_INT)
788 low = INTVAL (x), high = low >> (HOST_BITS_PER_WIDE_INT -1);
790 low = CONST_DOUBLE_LOW (x), high = CONST_DOUBLE_HIGH (x);
792 /* REAL_VALUE_TARGET_DOUBLE takes the addressing order of the
794 if (WORDS_BIG_ENDIAN)
795 i[0] = high, i[1] = low;
797 i[0] = low, i[1] = high;
799 r = REAL_VALUE_FROM_TARGET_DOUBLE (i);
800 return CONST_DOUBLE_FROM_REAL_VALUE (r, mode);
804 union {HOST_WIDE_INT i[2]; double d; } u;
805 HOST_WIDE_INT low, high;
807 if (GET_CODE (x) == CONST_INT)
808 low = INTVAL (x), high = low >> (HOST_BITS_PER_WIDE_INT -1);
810 low = CONST_DOUBLE_LOW (x), high = CONST_DOUBLE_HIGH (x);
812 #ifdef HOST_WORDS_BIG_ENDIAN
813 u.i[0] = high, u.i[1] = low;
815 u.i[0] = low, u.i[1] = high;
818 return CONST_DOUBLE_FROM_REAL_VALUE (u.d, mode);
821 /* Similarly, if this is converting a floating-point value into a
822 single-word integer. Only do this is the host and target parameters are
825 else if (((HOST_FLOAT_FORMAT == TARGET_FLOAT_FORMAT
826 && HOST_BITS_PER_WIDE_INT == BITS_PER_WORD)
827 || flag_pretend_float)
828 && (GET_MODE_CLASS (mode) == MODE_INT
829 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT)
830 && GET_CODE (x) == CONST_DOUBLE
831 && GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT
832 && GET_MODE_BITSIZE (mode) == BITS_PER_WORD)
833 return operand_subword (x, word, 0, GET_MODE (x));
835 /* Similarly, if this is converting a floating-point value into a
836 two-word integer, we can do this one word at a time and make an
837 integer. Only do this is the host and target parameters are
840 else if (((HOST_FLOAT_FORMAT == TARGET_FLOAT_FORMAT
841 && HOST_BITS_PER_WIDE_INT == BITS_PER_WORD)
842 || flag_pretend_float)
843 && (GET_MODE_CLASS (mode) == MODE_INT
844 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT)
845 && GET_CODE (x) == CONST_DOUBLE
846 && GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT
847 && GET_MODE_BITSIZE (mode) == 2 * BITS_PER_WORD)
850 = operand_subword (x, word + WORDS_BIG_ENDIAN, 0, GET_MODE (x));
852 = operand_subword (x, word + ! WORDS_BIG_ENDIAN, 0, GET_MODE (x));
854 if (lowpart && GET_CODE (lowpart) == CONST_INT
855 && highpart && GET_CODE (highpart) == CONST_INT)
856 return immed_double_const (INTVAL (lowpart), INTVAL (highpart), mode);
859 /* Otherwise, we can't do this. */
863 /* Return the real part (which has mode MODE) of a complex value X.
864 This always comes at the low address in memory. */
867 gen_realpart (mode, x)
868 enum machine_mode mode;
871 if (GET_CODE (x) == CONCAT && GET_MODE (XEXP (x, 0)) == mode)
873 else if (WORDS_BIG_ENDIAN)
874 return gen_highpart (mode, x);
876 return gen_lowpart (mode, x);
879 /* Return the imaginary part (which has mode MODE) of a complex value X.
880 This always comes at the high address in memory. */
883 gen_imagpart (mode, x)
884 enum machine_mode mode;
887 if (GET_CODE (x) == CONCAT && GET_MODE (XEXP (x, 0)) == mode)
889 else if (WORDS_BIG_ENDIAN)
890 return gen_lowpart (mode, x);
892 return gen_highpart (mode, x);
895 /* Return 1 iff X, assumed to be a SUBREG,
896 refers to the real part of the complex value in its containing reg.
897 Complex values are always stored with the real part in the first word,
898 regardless of WORDS_BIG_ENDIAN. */
901 subreg_realpart_p (x)
904 if (GET_CODE (x) != SUBREG)
907 return SUBREG_WORD (x) == 0;
910 /* Assuming that X is an rtx (e.g., MEM, REG or SUBREG) for a value,
911 return an rtx (MEM, SUBREG, or CONST_INT) that refers to the
912 least-significant part of X.
913 MODE specifies how big a part of X to return;
914 it usually should not be larger than a word.
915 If X is a MEM whose address is a QUEUED, the value may be so also. */
918 gen_lowpart (mode, x)
919 enum machine_mode mode;
922 rtx result = gen_lowpart_common (mode, x);
926 else if (GET_CODE (x) == REG)
928 /* Must be a hard reg that's not valid in MODE. */
929 result = gen_lowpart_common (mode, copy_to_reg (x));
934 else if (GET_CODE (x) == MEM)
936 /* The only additional case we can do is MEM. */
937 register int offset = 0;
938 if (WORDS_BIG_ENDIAN)
939 offset = (MAX (GET_MODE_SIZE (GET_MODE (x)), UNITS_PER_WORD)
940 - MAX (GET_MODE_SIZE (mode), UNITS_PER_WORD));
942 if (BYTES_BIG_ENDIAN)
943 /* Adjust the address so that the address-after-the-data
945 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (mode))
946 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x))));
948 return change_address (x, mode, plus_constant (XEXP (x, 0), offset));
954 /* Like `gen_lowpart', but refer to the most significant part.
955 This is used to access the imaginary part of a complex number. */
958 gen_highpart (mode, x)
959 enum machine_mode mode;
962 /* This case loses if X is a subreg. To catch bugs early,
963 complain if an invalid MODE is used even in other cases. */
964 if (GET_MODE_SIZE (mode) > UNITS_PER_WORD
965 && GET_MODE_SIZE (mode) != GET_MODE_UNIT_SIZE (GET_MODE (x)))
967 if (GET_CODE (x) == CONST_DOUBLE
968 #if !(TARGET_FLOAT_FORMAT != HOST_FLOAT_FORMAT || defined (REAL_IS_NOT_DOUBLE))
969 && GET_MODE_CLASS (GET_MODE (x)) != MODE_FLOAT
972 return gen_rtx (CONST_INT, VOIDmode,
973 CONST_DOUBLE_HIGH (x) & GET_MODE_MASK (mode));
974 else if (GET_CODE (x) == CONST_INT)
976 else if (GET_CODE (x) == MEM)
978 register int offset = 0;
979 if (! WORDS_BIG_ENDIAN)
980 offset = (MAX (GET_MODE_SIZE (GET_MODE (x)), UNITS_PER_WORD)
981 - MAX (GET_MODE_SIZE (mode), UNITS_PER_WORD));
983 if (! BYTES_BIG_ENDIAN
984 && GET_MODE_SIZE (mode) < UNITS_PER_WORD)
985 offset -= (GET_MODE_SIZE (mode)
986 - MIN (UNITS_PER_WORD,
987 GET_MODE_SIZE (GET_MODE (x))));
989 return change_address (x, mode, plus_constant (XEXP (x, 0), offset));
991 else if (GET_CODE (x) == SUBREG)
993 /* The only time this should occur is when we are looking at a
994 multi-word item with a SUBREG whose mode is the same as that of the
995 item. It isn't clear what we would do if it wasn't. */
996 if (SUBREG_WORD (x) != 0)
998 return gen_highpart (mode, SUBREG_REG (x));
1000 else if (GET_CODE (x) == REG)
1004 if (! WORDS_BIG_ENDIAN
1005 && GET_MODE_SIZE (GET_MODE (x)) > UNITS_PER_WORD)
1006 word = ((GET_MODE_SIZE (GET_MODE (x))
1007 - MAX (GET_MODE_SIZE (mode), UNITS_PER_WORD))
1011 * ??? This fails miserably for complex values being passed in registers
1012 * where the sizeof the real and imaginary part are not equal to the
1013 * sizeof SImode. FIXME
1016 if (REGNO (x) < FIRST_PSEUDO_REGISTER
1017 /* integrate.c can't handle parts of a return value register. */
1018 && (! REG_FUNCTION_VALUE_P (x)
1019 || ! rtx_equal_function_value_matters)
1020 /* We want to keep the stack, frame, and arg pointers special. */
1021 && x != frame_pointer_rtx
1022 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
1023 && x != arg_pointer_rtx
1025 && x != stack_pointer_rtx)
1026 return gen_rtx (REG, mode, REGNO (x) + word);
1028 return gen_rtx (SUBREG, mode, x, word);
1034 /* Return 1 iff X, assumed to be a SUBREG,
1035 refers to the least significant part of its containing reg.
1036 If X is not a SUBREG, always return 1 (it is its own low part!). */
1039 subreg_lowpart_p (x)
1042 if (GET_CODE (x) != SUBREG)
1045 if (WORDS_BIG_ENDIAN
1046 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))) > UNITS_PER_WORD)
1047 return (SUBREG_WORD (x)
1048 == ((GET_MODE_SIZE (GET_MODE (SUBREG_REG (x)))
1049 - MAX (GET_MODE_SIZE (GET_MODE (x)), UNITS_PER_WORD))
1052 return SUBREG_WORD (x) == 0;
1055 /* Return subword I of operand OP.
1056 The word number, I, is interpreted as the word number starting at the
1057 low-order address. Word 0 is the low-order word if not WORDS_BIG_ENDIAN,
1058 otherwise it is the high-order word.
1060 If we cannot extract the required word, we return zero. Otherwise, an
1061 rtx corresponding to the requested word will be returned.
1063 VALIDATE_ADDRESS is nonzero if the address should be validated. Before
1064 reload has completed, a valid address will always be returned. After
1065 reload, if a valid address cannot be returned, we return zero.
1067 If VALIDATE_ADDRESS is zero, we simply form the required address; validating
1068 it is the responsibility of the caller.
1070 MODE is the mode of OP in case it is a CONST_INT. */
1073 operand_subword (op, i, validate_address, mode)
1076 int validate_address;
1077 enum machine_mode mode;
1080 int size_ratio = HOST_BITS_PER_WIDE_INT / BITS_PER_WORD;
1082 if (mode == VOIDmode)
1083 mode = GET_MODE (op);
1085 if (mode == VOIDmode)
1088 /* If OP is narrower than a word or if we want a word outside OP, fail. */
1090 && (GET_MODE_SIZE (mode) < UNITS_PER_WORD
1091 || (i + 1) * UNITS_PER_WORD > GET_MODE_SIZE (mode)))
1094 /* If OP is already an integer word, return it. */
1095 if (GET_MODE_CLASS (mode) == MODE_INT
1096 && GET_MODE_SIZE (mode) == UNITS_PER_WORD)
1099 /* If OP is a REG or SUBREG, we can handle it very simply. */
1100 if (GET_CODE (op) == REG)
1102 /* If the register is not valid for MODE, return 0. If we don't
1103 do this, there is no way to fix up the resulting REG later. */
1104 if (REGNO (op) < FIRST_PSEUDO_REGISTER
1105 && ! HARD_REGNO_MODE_OK (REGNO (op) + i, word_mode))
1107 else if (REGNO (op) >= FIRST_PSEUDO_REGISTER
1108 || (REG_FUNCTION_VALUE_P (op)
1109 && rtx_equal_function_value_matters)
1110 /* We want to keep the stack, frame, and arg pointers
1112 || op == frame_pointer_rtx
1113 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
1114 || op == arg_pointer_rtx
1116 || op == stack_pointer_rtx)
1117 return gen_rtx (SUBREG, word_mode, op, i);
1119 return gen_rtx (REG, word_mode, REGNO (op) + i);
1121 else if (GET_CODE (op) == SUBREG)
1122 return gen_rtx (SUBREG, word_mode, SUBREG_REG (op), i + SUBREG_WORD (op));
1123 else if (GET_CODE (op) == CONCAT)
1125 int partwords = GET_MODE_UNIT_SIZE (GET_MODE (op)) / UNITS_PER_WORD;
1127 return operand_subword (XEXP (op, 0), i, validate_address, mode);
1128 return operand_subword (XEXP (op, 1), i - partwords,
1129 validate_address, mode);
1132 /* Form a new MEM at the requested address. */
1133 if (GET_CODE (op) == MEM)
1135 rtx addr = plus_constant (XEXP (op, 0), i * UNITS_PER_WORD);
1138 if (validate_address)
1140 if (reload_completed)
1142 if (! strict_memory_address_p (word_mode, addr))
1146 addr = memory_address (word_mode, addr);
1149 new = gen_rtx (MEM, word_mode, addr);
1151 MEM_VOLATILE_P (new) = MEM_VOLATILE_P (op);
1152 MEM_IN_STRUCT_P (new) = MEM_IN_STRUCT_P (op);
1153 RTX_UNCHANGING_P (new) = RTX_UNCHANGING_P (op);
1158 /* The only remaining cases are when OP is a constant. If the host and
1159 target floating formats are the same, handling two-word floating
1160 constants are easy. Note that REAL_VALUE_TO_TARGET_{SINGLE,DOUBLE}
1161 are defined as returning one or two 32 bit values, respectively,
1162 and not values of BITS_PER_WORD bits. */
1163 #ifdef REAL_ARITHMETIC
1164 /* The output is some bits, the width of the target machine's word.
1165 A wider-word host can surely hold them in a CONST_INT. A narrower-word
1167 if (HOST_BITS_PER_WIDE_INT >= BITS_PER_WORD
1168 && GET_MODE_CLASS (mode) == MODE_FLOAT
1169 && GET_MODE_BITSIZE (mode) == 64
1170 && GET_CODE (op) == CONST_DOUBLE)
1175 REAL_VALUE_FROM_CONST_DOUBLE (rv, op);
1176 REAL_VALUE_TO_TARGET_DOUBLE (rv, k);
1178 /* We handle 32-bit and >= 64-bit words here. Note that the order in
1179 which the words are written depends on the word endianness.
1181 ??? This is a potential portability problem and should
1182 be fixed at some point. */
1183 if (BITS_PER_WORD == 32)
1184 return GEN_INT ((HOST_WIDE_INT) k[i]);
1185 #if HOST_BITS_PER_WIDE_INT > 32
1186 else if (BITS_PER_WORD >= 64 && i == 0)
1187 return GEN_INT ((((HOST_WIDE_INT) k[! WORDS_BIG_ENDIAN]) << 32)
1188 | (HOST_WIDE_INT) k[WORDS_BIG_ENDIAN]);
1190 else if (BITS_PER_WORD == 16)
1197 return GEN_INT ((HOST_WIDE_INT) value);
1202 else if (HOST_BITS_PER_WIDE_INT >= BITS_PER_WORD
1203 && GET_MODE_CLASS (mode) == MODE_FLOAT
1204 && GET_MODE_BITSIZE (mode) > 64
1205 && GET_CODE (op) == CONST_DOUBLE)
1210 REAL_VALUE_FROM_CONST_DOUBLE (rv, op);
1211 REAL_VALUE_TO_TARGET_LONG_DOUBLE (rv, k);
1213 if (BITS_PER_WORD == 32)
1214 return GEN_INT ((HOST_WIDE_INT) k[i]);
1216 #else /* no REAL_ARITHMETIC */
1217 if (((HOST_FLOAT_FORMAT == TARGET_FLOAT_FORMAT
1218 && HOST_BITS_PER_WIDE_INT == BITS_PER_WORD)
1219 || flag_pretend_float)
1220 && GET_MODE_CLASS (mode) == MODE_FLOAT
1221 && GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD
1222 && GET_CODE (op) == CONST_DOUBLE)
1224 /* The constant is stored in the host's word-ordering,
1225 but we want to access it in the target's word-ordering. Some
1226 compilers don't like a conditional inside macro args, so we have two
1227 copies of the return. */
1228 #ifdef HOST_WORDS_BIG_ENDIAN
1229 return GEN_INT (i == WORDS_BIG_ENDIAN
1230 ? CONST_DOUBLE_HIGH (op) : CONST_DOUBLE_LOW (op));
1232 return GEN_INT (i != WORDS_BIG_ENDIAN
1233 ? CONST_DOUBLE_HIGH (op) : CONST_DOUBLE_LOW (op));
1236 #endif /* no REAL_ARITHMETIC */
1238 /* Single word float is a little harder, since single- and double-word
1239 values often do not have the same high-order bits. We have already
1240 verified that we want the only defined word of the single-word value. */
1241 #ifdef REAL_ARITHMETIC
1242 if (GET_MODE_CLASS (mode) == MODE_FLOAT
1243 && GET_MODE_BITSIZE (mode) == 32
1244 && GET_CODE (op) == CONST_DOUBLE)
1249 REAL_VALUE_FROM_CONST_DOUBLE (rv, op);
1250 REAL_VALUE_TO_TARGET_SINGLE (rv, l);
1251 return GEN_INT ((HOST_WIDE_INT) l);
1254 if (((HOST_FLOAT_FORMAT == TARGET_FLOAT_FORMAT
1255 && HOST_BITS_PER_WIDE_INT == BITS_PER_WORD)
1256 || flag_pretend_float)
1257 && GET_MODE_CLASS (mode) == MODE_FLOAT
1258 && GET_MODE_SIZE (mode) == UNITS_PER_WORD
1259 && GET_CODE (op) == CONST_DOUBLE)
1262 union {float f; HOST_WIDE_INT i; } u;
1264 REAL_VALUE_FROM_CONST_DOUBLE (d, op);
1267 return GEN_INT (u.i);
1269 #endif /* no REAL_ARITHMETIC */
1271 /* The only remaining cases that we can handle are integers.
1272 Convert to proper endianness now since these cases need it.
1273 At this point, i == 0 means the low-order word.
1275 We do not want to handle the case when BITS_PER_WORD <= HOST_BITS_PER_INT
1276 in general. However, if OP is (const_int 0), we can just return
1279 if (op == const0_rtx)
1282 if (GET_MODE_CLASS (mode) != MODE_INT
1283 || (GET_CODE (op) != CONST_INT && GET_CODE (op) != CONST_DOUBLE)
1284 || BITS_PER_WORD > HOST_BITS_PER_WIDE_INT)
1287 if (WORDS_BIG_ENDIAN)
1288 i = GET_MODE_SIZE (mode) / UNITS_PER_WORD - 1 - i;
1290 /* Find out which word on the host machine this value is in and get
1291 it from the constant. */
1292 val = (i / size_ratio == 0
1293 ? (GET_CODE (op) == CONST_INT ? INTVAL (op) : CONST_DOUBLE_LOW (op))
1294 : (GET_CODE (op) == CONST_INT
1295 ? (INTVAL (op) < 0 ? ~0 : 0) : CONST_DOUBLE_HIGH (op)));
1297 /* If BITS_PER_WORD is smaller than an int, get the appropriate bits. */
1298 if (BITS_PER_WORD < HOST_BITS_PER_WIDE_INT)
1299 val = ((val >> ((i % size_ratio) * BITS_PER_WORD))
1300 & (((HOST_WIDE_INT) 1
1301 << (BITS_PER_WORD % HOST_BITS_PER_WIDE_INT)) - 1));
1303 return GEN_INT (val);
1306 /* Similar to `operand_subword', but never return 0. If we can't extract
1307 the required subword, put OP into a register and try again. If that fails,
1308 abort. We always validate the address in this case. It is not valid
1309 to call this function after reload; it is mostly meant for RTL
1312 MODE is the mode of OP, in case it is CONST_INT. */
1315 operand_subword_force (op, i, mode)
1318 enum machine_mode mode;
1320 rtx result = operand_subword (op, i, 1, mode);
1325 if (mode != BLKmode && mode != VOIDmode)
1326 op = force_reg (mode, op);
1328 result = operand_subword (op, i, 1, mode);
1335 /* Given a compare instruction, swap the operands.
1336 A test instruction is changed into a compare of 0 against the operand. */
1339 reverse_comparison (insn)
1342 rtx body = PATTERN (insn);
1345 if (GET_CODE (body) == SET)
1346 comp = SET_SRC (body);
1348 comp = SET_SRC (XVECEXP (body, 0, 0));
1350 if (GET_CODE (comp) == COMPARE)
1352 rtx op0 = XEXP (comp, 0);
1353 rtx op1 = XEXP (comp, 1);
1354 XEXP (comp, 0) = op1;
1355 XEXP (comp, 1) = op0;
1359 rtx new = gen_rtx (COMPARE, VOIDmode,
1360 CONST0_RTX (GET_MODE (comp)), comp);
1361 if (GET_CODE (body) == SET)
1362 SET_SRC (body) = new;
1364 SET_SRC (XVECEXP (body, 0, 0)) = new;
1368 /* Return a memory reference like MEMREF, but with its mode changed
1369 to MODE and its address changed to ADDR.
1370 (VOIDmode means don't change the mode.
1371 NULL for ADDR means don't change the address.) */
1374 change_address (memref, mode, addr)
1376 enum machine_mode mode;
1381 if (GET_CODE (memref) != MEM)
1383 if (mode == VOIDmode)
1384 mode = GET_MODE (memref);
1386 addr = XEXP (memref, 0);
1388 /* If reload is in progress or has completed, ADDR must be valid.
1389 Otherwise, we can call memory_address to make it valid. */
1390 if (reload_completed || reload_in_progress)
1392 if (! memory_address_p (mode, addr))
1396 addr = memory_address (mode, addr);
1398 if (rtx_equal_p (addr, XEXP (memref, 0)) && mode == GET_MODE (memref))
1401 new = gen_rtx (MEM, mode, addr);
1402 MEM_VOLATILE_P (new) = MEM_VOLATILE_P (memref);
1403 RTX_UNCHANGING_P (new) = RTX_UNCHANGING_P (memref);
1404 MEM_IN_STRUCT_P (new) = MEM_IN_STRUCT_P (memref);
1408 /* Return a newly created CODE_LABEL rtx with a unique label number. */
1415 label = (output_bytecode
1416 ? gen_rtx (CODE_LABEL, VOIDmode, NULL, bc_get_bytecode_label ())
1417 : gen_rtx (CODE_LABEL, VOIDmode, 0, 0, 0, label_num++, NULL_PTR));
1419 LABEL_NUSES (label) = 0;
1423 /* For procedure integration. */
1425 /* Return a newly created INLINE_HEADER rtx. Should allocate this
1426 from a permanent obstack when the opportunity arises. */
1429 gen_inline_header_rtx (first_insn, first_parm_insn, first_labelno,
1430 last_labelno, max_parm_regnum, max_regnum, args_size,
1431 pops_args, stack_slots, forced_labels, function_flags,
1432 outgoing_args_size, original_arg_vector,
1433 original_decl_initial, regno_rtx, regno_flag,
1435 rtx first_insn, first_parm_insn;
1436 int first_labelno, last_labelno, max_parm_regnum, max_regnum, args_size;
1441 int outgoing_args_size;
1442 rtvec original_arg_vector;
1443 rtx original_decl_initial;
1448 rtx header = gen_rtx (INLINE_HEADER, VOIDmode,
1449 cur_insn_uid++, NULL_RTX,
1450 first_insn, first_parm_insn,
1451 first_labelno, last_labelno,
1452 max_parm_regnum, max_regnum, args_size, pops_args,
1453 stack_slots, forced_labels, function_flags,
1454 outgoing_args_size, original_arg_vector,
1455 original_decl_initial,
1456 regno_rtx, regno_flag, regno_align);
1460 /* Install new pointers to the first and last insns in the chain.
1461 Also, set cur_insn_uid to one higher than the last in use.
1462 Used for an inline-procedure after copying the insn chain. */
1465 set_new_first_and_last_insn (first, last)
1474 for (insn = first; insn; insn = NEXT_INSN (insn))
1475 cur_insn_uid = MAX (cur_insn_uid, INSN_UID (insn));
1480 /* Set the range of label numbers found in the current function.
1481 This is used when belatedly compiling an inline function. */
1484 set_new_first_and_last_label_num (first, last)
1487 base_label_num = label_num;
1488 first_label_num = first;
1489 last_label_num = last;
1492 /* Save all variables describing the current status into the structure *P.
1493 This is used before starting a nested function. */
1496 save_emit_status (p)
1499 p->reg_rtx_no = reg_rtx_no;
1500 p->first_label_num = first_label_num;
1501 p->first_insn = first_insn;
1502 p->last_insn = last_insn;
1503 p->sequence_rtl_expr = sequence_rtl_expr;
1504 p->sequence_stack = sequence_stack;
1505 p->cur_insn_uid = cur_insn_uid;
1506 p->last_linenum = last_linenum;
1507 p->last_filename = last_filename;
1508 p->regno_pointer_flag = regno_pointer_flag;
1509 p->regno_pointer_align = regno_pointer_align;
1510 p->regno_pointer_flag_length = regno_pointer_flag_length;
1511 p->regno_reg_rtx = regno_reg_rtx;
1514 /* Restore all variables describing the current status from the structure *P.
1515 This is used after a nested function. */
1518 restore_emit_status (p)
1523 reg_rtx_no = p->reg_rtx_no;
1524 first_label_num = p->first_label_num;
1526 first_insn = p->first_insn;
1527 last_insn = p->last_insn;
1528 sequence_rtl_expr = p->sequence_rtl_expr;
1529 sequence_stack = p->sequence_stack;
1530 cur_insn_uid = p->cur_insn_uid;
1531 last_linenum = p->last_linenum;
1532 last_filename = p->last_filename;
1533 regno_pointer_flag = p->regno_pointer_flag;
1534 regno_pointer_align = p->regno_pointer_align;
1535 regno_pointer_flag_length = p->regno_pointer_flag_length;
1536 regno_reg_rtx = p->regno_reg_rtx;
1538 /* Clear our cache of rtx expressions for start_sequence and
1540 sequence_element_free_list = 0;
1541 for (i = 0; i < SEQUENCE_RESULT_SIZE; i++)
1542 sequence_result[i] = 0;
1547 /* Go through all the RTL insn bodies and copy any invalid shared structure.
1548 It does not work to do this twice, because the mark bits set here
1549 are not cleared afterwards. */
1552 unshare_all_rtl (insn)
1555 for (; insn; insn = NEXT_INSN (insn))
1556 if (GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN
1557 || GET_CODE (insn) == CALL_INSN)
1559 PATTERN (insn) = copy_rtx_if_shared (PATTERN (insn));
1560 REG_NOTES (insn) = copy_rtx_if_shared (REG_NOTES (insn));
1561 LOG_LINKS (insn) = copy_rtx_if_shared (LOG_LINKS (insn));
1564 /* Make sure the addresses of stack slots found outside the insn chain
1565 (such as, in DECL_RTL of a variable) are not shared
1566 with the insn chain.
1568 This special care is necessary when the stack slot MEM does not
1569 actually appear in the insn chain. If it does appear, its address
1570 is unshared from all else at that point. */
1572 copy_rtx_if_shared (stack_slot_list);
1575 /* Mark ORIG as in use, and return a copy of it if it was already in use.
1576 Recursively does the same for subexpressions. */
1579 copy_rtx_if_shared (orig)
1582 register rtx x = orig;
1584 register enum rtx_code code;
1585 register char *format_ptr;
1591 code = GET_CODE (x);
1593 /* These types may be freely shared. */
1606 /* SCRATCH must be shared because they represent distinct values. */
1610 /* CONST can be shared if it contains a SYMBOL_REF. If it contains
1611 a LABEL_REF, it isn't sharable. */
1612 if (GET_CODE (XEXP (x, 0)) == PLUS
1613 && GET_CODE (XEXP (XEXP (x, 0), 0)) == SYMBOL_REF
1614 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT)
1623 /* The chain of insns is not being copied. */
1627 /* A MEM is allowed to be shared if its address is constant
1628 or is a constant plus one of the special registers. */
1629 if (CONSTANT_ADDRESS_P (XEXP (x, 0))
1630 || XEXP (x, 0) == virtual_stack_vars_rtx
1631 || XEXP (x, 0) == virtual_incoming_args_rtx)
1634 if (GET_CODE (XEXP (x, 0)) == PLUS
1635 && (XEXP (XEXP (x, 0), 0) == virtual_stack_vars_rtx
1636 || XEXP (XEXP (x, 0), 0) == virtual_incoming_args_rtx)
1637 && CONSTANT_ADDRESS_P (XEXP (XEXP (x, 0), 1)))
1639 /* This MEM can appear in more than one place,
1640 but its address better not be shared with anything else. */
1642 XEXP (x, 0) = copy_rtx_if_shared (XEXP (x, 0));
1648 /* This rtx may not be shared. If it has already been seen,
1649 replace it with a copy of itself. */
1655 copy = rtx_alloc (code);
1656 bcopy ((char *) x, (char *) copy,
1657 (sizeof (*copy) - sizeof (copy->fld)
1658 + sizeof (copy->fld[0]) * GET_RTX_LENGTH (code)));
1664 /* Now scan the subexpressions recursively.
1665 We can store any replaced subexpressions directly into X
1666 since we know X is not shared! Any vectors in X
1667 must be copied if X was copied. */
1669 format_ptr = GET_RTX_FORMAT (code);
1671 for (i = 0; i < GET_RTX_LENGTH (code); i++)
1673 switch (*format_ptr++)
1676 XEXP (x, i) = copy_rtx_if_shared (XEXP (x, i));
1680 if (XVEC (x, i) != NULL)
1683 int len = XVECLEN (x, i);
1685 if (copied && len > 0)
1686 XVEC (x, i) = gen_rtvec_vv (len, XVEC (x, i)->elem);
1687 for (j = 0; j < len; j++)
1688 XVECEXP (x, i, j) = copy_rtx_if_shared (XVECEXP (x, i, j));
1696 /* Clear all the USED bits in X to allow copy_rtx_if_shared to be used
1697 to look for shared sub-parts. */
1700 reset_used_flags (x)
1704 register enum rtx_code code;
1705 register char *format_ptr;
1710 code = GET_CODE (x);
1712 /* These types may be freely shared so we needn't do any resetting
1733 /* The chain of insns is not being copied. */
1739 format_ptr = GET_RTX_FORMAT (code);
1740 for (i = 0; i < GET_RTX_LENGTH (code); i++)
1742 switch (*format_ptr++)
1745 reset_used_flags (XEXP (x, i));
1749 for (j = 0; j < XVECLEN (x, i); j++)
1750 reset_used_flags (XVECEXP (x, i, j));
1756 /* Copy X if necessary so that it won't be altered by changes in OTHER.
1757 Return X or the rtx for the pseudo reg the value of X was copied into.
1758 OTHER must be valid as a SET_DEST. */
1761 make_safe_from (x, other)
1765 switch (GET_CODE (other))
1768 other = SUBREG_REG (other);
1770 case STRICT_LOW_PART:
1773 other = XEXP (other, 0);
1779 if ((GET_CODE (other) == MEM
1781 && GET_CODE (x) != REG
1782 && GET_CODE (x) != SUBREG)
1783 || (GET_CODE (other) == REG
1784 && (REGNO (other) < FIRST_PSEUDO_REGISTER
1785 || reg_mentioned_p (other, x))))
1787 rtx temp = gen_reg_rtx (GET_MODE (x));
1788 emit_move_insn (temp, x);
1794 /* Emission of insns (adding them to the doubly-linked list). */
1796 /* Return the first insn of the current sequence or current function. */
1804 /* Return the last insn emitted in current sequence or current function. */
1812 /* Specify a new insn as the last in the chain. */
1815 set_last_insn (insn)
1818 if (NEXT_INSN (insn) != 0)
1823 /* Return the last insn emitted, even if it is in a sequence now pushed. */
1826 get_last_insn_anywhere ()
1828 struct sequence_stack *stack;
1831 for (stack = sequence_stack; stack; stack = stack->next)
1832 if (stack->last != 0)
1837 /* Return a number larger than any instruction's uid in this function. */
1842 return cur_insn_uid;
1845 /* Return the next insn. If it is a SEQUENCE, return the first insn
1854 insn = NEXT_INSN (insn);
1855 if (insn && GET_CODE (insn) == INSN
1856 && GET_CODE (PATTERN (insn)) == SEQUENCE)
1857 insn = XVECEXP (PATTERN (insn), 0, 0);
1863 /* Return the previous insn. If it is a SEQUENCE, return the last insn
1867 previous_insn (insn)
1872 insn = PREV_INSN (insn);
1873 if (insn && GET_CODE (insn) == INSN
1874 && GET_CODE (PATTERN (insn)) == SEQUENCE)
1875 insn = XVECEXP (PATTERN (insn), 0, XVECLEN (PATTERN (insn), 0) - 1);
1881 /* Return the next insn after INSN that is not a NOTE. This routine does not
1882 look inside SEQUENCEs. */
1885 next_nonnote_insn (insn)
1890 insn = NEXT_INSN (insn);
1891 if (insn == 0 || GET_CODE (insn) != NOTE)
1898 /* Return the previous insn before INSN that is not a NOTE. This routine does
1899 not look inside SEQUENCEs. */
1902 prev_nonnote_insn (insn)
1907 insn = PREV_INSN (insn);
1908 if (insn == 0 || GET_CODE (insn) != NOTE)
1915 /* Return the next INSN, CALL_INSN or JUMP_INSN after INSN;
1916 or 0, if there is none. This routine does not look inside
1920 next_real_insn (insn)
1925 insn = NEXT_INSN (insn);
1926 if (insn == 0 || GET_CODE (insn) == INSN
1927 || GET_CODE (insn) == CALL_INSN || GET_CODE (insn) == JUMP_INSN)
1934 /* Return the last INSN, CALL_INSN or JUMP_INSN before INSN;
1935 or 0, if there is none. This routine does not look inside
1939 prev_real_insn (insn)
1944 insn = PREV_INSN (insn);
1945 if (insn == 0 || GET_CODE (insn) == INSN || GET_CODE (insn) == CALL_INSN
1946 || GET_CODE (insn) == JUMP_INSN)
1953 /* Find the next insn after INSN that really does something. This routine
1954 does not look inside SEQUENCEs. Until reload has completed, this is the
1955 same as next_real_insn. */
1958 next_active_insn (insn)
1963 insn = NEXT_INSN (insn);
1965 || GET_CODE (insn) == CALL_INSN || GET_CODE (insn) == JUMP_INSN
1966 || (GET_CODE (insn) == INSN
1967 && (! reload_completed
1968 || (GET_CODE (PATTERN (insn)) != USE
1969 && GET_CODE (PATTERN (insn)) != CLOBBER))))
1976 /* Find the last insn before INSN that really does something. This routine
1977 does not look inside SEQUENCEs. Until reload has completed, this is the
1978 same as prev_real_insn. */
1981 prev_active_insn (insn)
1986 insn = PREV_INSN (insn);
1988 || GET_CODE (insn) == CALL_INSN || GET_CODE (insn) == JUMP_INSN
1989 || (GET_CODE (insn) == INSN
1990 && (! reload_completed
1991 || (GET_CODE (PATTERN (insn)) != USE
1992 && GET_CODE (PATTERN (insn)) != CLOBBER))))
1999 /* Return the next CODE_LABEL after the insn INSN, or 0 if there is none. */
2007 insn = NEXT_INSN (insn);
2008 if (insn == 0 || GET_CODE (insn) == CODE_LABEL)
2015 /* Return the last CODE_LABEL before the insn INSN, or 0 if there is none. */
2023 insn = PREV_INSN (insn);
2024 if (insn == 0 || GET_CODE (insn) == CODE_LABEL)
2032 /* INSN uses CC0 and is being moved into a delay slot. Set up REG_CC_SETTER
2033 and REG_CC_USER notes so we can find it. */
2036 link_cc0_insns (insn)
2039 rtx user = next_nonnote_insn (insn);
2041 if (GET_CODE (user) == INSN && GET_CODE (PATTERN (user)) == SEQUENCE)
2042 user = XVECEXP (PATTERN (user), 0, 0);
2044 REG_NOTES (user) = gen_rtx (INSN_LIST, REG_CC_SETTER, insn,
2046 REG_NOTES (insn) = gen_rtx (INSN_LIST, REG_CC_USER, user, REG_NOTES (insn));
2049 /* Return the next insn that uses CC0 after INSN, which is assumed to
2050 set it. This is the inverse of prev_cc0_setter (i.e., prev_cc0_setter
2051 applied to the result of this function should yield INSN).
2053 Normally, this is simply the next insn. However, if a REG_CC_USER note
2054 is present, it contains the insn that uses CC0.
2056 Return 0 if we can't find the insn. */
2059 next_cc0_user (insn)
2062 rtx note = find_reg_note (insn, REG_CC_USER, NULL_RTX);
2065 return XEXP (note, 0);
2067 insn = next_nonnote_insn (insn);
2068 if (insn && GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
2069 insn = XVECEXP (PATTERN (insn), 0, 0);
2071 if (insn && GET_RTX_CLASS (GET_CODE (insn)) == 'i'
2072 && reg_mentioned_p (cc0_rtx, PATTERN (insn)))
2078 /* Find the insn that set CC0 for INSN. Unless INSN has a REG_CC_SETTER
2079 note, it is the previous insn. */
2082 prev_cc0_setter (insn)
2085 rtx note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
2089 return XEXP (note, 0);
2091 insn = prev_nonnote_insn (insn);
2092 if (! sets_cc0_p (PATTERN (insn)))
2099 /* Try splitting insns that can be split for better scheduling.
2100 PAT is the pattern which might split.
2101 TRIAL is the insn providing PAT.
2102 LAST is non-zero if we should return the last insn of the sequence produced.
2104 If this routine succeeds in splitting, it returns the first or last
2105 replacement insn depending on the value of LAST. Otherwise, it
2106 returns TRIAL. If the insn to be returned can be split, it will be. */
2109 try_split (pat, trial, last)
2113 rtx before = PREV_INSN (trial);
2114 rtx after = NEXT_INSN (trial);
2115 rtx seq = split_insns (pat, trial);
2116 int has_barrier = 0;
2119 /* If we are splitting a JUMP_INSN, it might be followed by a BARRIER.
2120 We may need to handle this specially. */
2121 if (after && GET_CODE (after) == BARRIER)
2124 after = NEXT_INSN (after);
2129 /* SEQ can either be a SEQUENCE or the pattern of a single insn.
2130 The latter case will normally arise only when being done so that
2131 it, in turn, will be split (SFmode on the 29k is an example). */
2132 if (GET_CODE (seq) == SEQUENCE)
2134 /* If we are splitting a JUMP_INSN, look for the JUMP_INSN in
2135 SEQ and copy our JUMP_LABEL to it. If JUMP_LABEL is non-zero,
2136 increment the usage count so we don't delete the label. */
2139 if (GET_CODE (trial) == JUMP_INSN)
2140 for (i = XVECLEN (seq, 0) - 1; i >= 0; i--)
2141 if (GET_CODE (XVECEXP (seq, 0, i)) == JUMP_INSN)
2143 JUMP_LABEL (XVECEXP (seq, 0, i)) = JUMP_LABEL (trial);
2145 if (JUMP_LABEL (trial))
2146 LABEL_NUSES (JUMP_LABEL (trial))++;
2149 tem = emit_insn_after (seq, before);
2151 delete_insn (trial);
2153 emit_barrier_after (tem);
2155 /* Recursively call try_split for each new insn created; by the
2156 time control returns here that insn will be fully split, so
2157 set LAST and continue from the insn after the one returned.
2158 We can't use next_active_insn here since AFTER may be a note.
2159 Ignore deleted insns, which can be occur if not optimizing. */
2160 for (tem = NEXT_INSN (before); tem != after;
2161 tem = NEXT_INSN (tem))
2162 if (! INSN_DELETED_P (tem))
2163 tem = try_split (PATTERN (tem), tem, 1);
2165 /* Avoid infinite loop if the result matches the original pattern. */
2166 else if (rtx_equal_p (seq, pat))
2170 PATTERN (trial) = seq;
2171 INSN_CODE (trial) = -1;
2172 try_split (seq, trial, last);
2175 /* Return either the first or the last insn, depending on which was
2177 return last ? prev_active_insn (after) : next_active_insn (before);
2183 /* Make and return an INSN rtx, initializing all its slots.
2184 Store PATTERN in the pattern slots. */
2187 make_insn_raw (pattern)
2192 /* If in RTL generation phase, see if FREE_INSN can be used. */
2193 if (free_insn != 0 && rtx_equal_function_value_matters)
2196 free_insn = NEXT_INSN (free_insn);
2197 PUT_CODE (insn, INSN);
2200 insn = rtx_alloc (INSN);
2202 INSN_UID (insn) = cur_insn_uid++;
2203 PATTERN (insn) = pattern;
2204 INSN_CODE (insn) = -1;
2205 LOG_LINKS (insn) = NULL;
2206 REG_NOTES (insn) = NULL;
2211 /* Like `make_insn' but make a JUMP_INSN instead of an insn. */
2214 make_jump_insn_raw (pattern)
2219 insn = rtx_alloc (JUMP_INSN);
2220 INSN_UID (insn) = cur_insn_uid++;
2222 PATTERN (insn) = pattern;
2223 INSN_CODE (insn) = -1;
2224 LOG_LINKS (insn) = NULL;
2225 REG_NOTES (insn) = NULL;
2226 JUMP_LABEL (insn) = NULL;
2231 /* Like `make_insn' but make a CALL_INSN instead of an insn. */
2234 make_call_insn_raw (pattern)
2239 insn = rtx_alloc (CALL_INSN);
2240 INSN_UID (insn) = cur_insn_uid++;
2242 PATTERN (insn) = pattern;
2243 INSN_CODE (insn) = -1;
2244 LOG_LINKS (insn) = NULL;
2245 REG_NOTES (insn) = NULL;
2246 CALL_INSN_FUNCTION_USAGE (insn) = NULL;
2251 /* Add INSN to the end of the doubly-linked list.
2252 INSN may be an INSN, JUMP_INSN, CALL_INSN, CODE_LABEL, BARRIER or NOTE. */
2258 PREV_INSN (insn) = last_insn;
2259 NEXT_INSN (insn) = 0;
2261 if (NULL != last_insn)
2262 NEXT_INSN (last_insn) = insn;
2264 if (NULL == first_insn)
2270 /* Add INSN into the doubly-linked list after insn AFTER. This and
2271 the next should be the only functions called to insert an insn once
2272 delay slots have been filled since only they know how to update a
2276 add_insn_after (insn, after)
2279 rtx next = NEXT_INSN (after);
2281 if (optimize && INSN_DELETED_P (after))
2284 NEXT_INSN (insn) = next;
2285 PREV_INSN (insn) = after;
2289 PREV_INSN (next) = insn;
2290 if (GET_CODE (next) == INSN && GET_CODE (PATTERN (next)) == SEQUENCE)
2291 PREV_INSN (XVECEXP (PATTERN (next), 0, 0)) = insn;
2293 else if (last_insn == after)
2297 struct sequence_stack *stack = sequence_stack;
2298 /* Scan all pending sequences too. */
2299 for (; stack; stack = stack->next)
2300 if (after == stack->last)
2310 NEXT_INSN (after) = insn;
2311 if (GET_CODE (after) == INSN && GET_CODE (PATTERN (after)) == SEQUENCE)
2313 rtx sequence = PATTERN (after);
2314 NEXT_INSN (XVECEXP (sequence, 0, XVECLEN (sequence, 0) - 1)) = insn;
2318 /* Add INSN into the doubly-linked list before insn BEFORE. This and
2319 the previous should be the only functions called to insert an insn once
2320 delay slots have been filled since only they know how to update a
2324 add_insn_before (insn, before)
2327 rtx prev = PREV_INSN (before);
2329 if (optimize && INSN_DELETED_P (before))
2332 PREV_INSN (insn) = prev;
2333 NEXT_INSN (insn) = before;
2337 NEXT_INSN (prev) = insn;
2338 if (GET_CODE (prev) == INSN && GET_CODE (PATTERN (prev)) == SEQUENCE)
2340 rtx sequence = PATTERN (prev);
2341 NEXT_INSN (XVECEXP (sequence, 0, XVECLEN (sequence, 0) - 1)) = insn;
2344 else if (first_insn == before)
2348 struct sequence_stack *stack = sequence_stack;
2349 /* Scan all pending sequences too. */
2350 for (; stack; stack = stack->next)
2351 if (before == stack->first)
2353 stack->first = insn;
2361 PREV_INSN (before) = insn;
2362 if (GET_CODE (before) == INSN && GET_CODE (PATTERN (before)) == SEQUENCE)
2363 PREV_INSN (XVECEXP (PATTERN (before), 0, 0)) = insn;
2366 /* Delete all insns made since FROM.
2367 FROM becomes the new last instruction. */
2370 delete_insns_since (from)
2376 NEXT_INSN (from) = 0;
2380 /* This function is deprecated, please use sequences instead.
2382 Move a consecutive bunch of insns to a different place in the chain.
2383 The insns to be moved are those between FROM and TO.
2384 They are moved to a new position after the insn AFTER.
2385 AFTER must not be FROM or TO or any insn in between.
2387 This function does not know about SEQUENCEs and hence should not be
2388 called after delay-slot filling has been done. */
2391 reorder_insns (from, to, after)
2392 rtx from, to, after;
2394 /* Splice this bunch out of where it is now. */
2395 if (PREV_INSN (from))
2396 NEXT_INSN (PREV_INSN (from)) = NEXT_INSN (to);
2398 PREV_INSN (NEXT_INSN (to)) = PREV_INSN (from);
2399 if (last_insn == to)
2400 last_insn = PREV_INSN (from);
2401 if (first_insn == from)
2402 first_insn = NEXT_INSN (to);
2404 /* Make the new neighbors point to it and it to them. */
2405 if (NEXT_INSN (after))
2406 PREV_INSN (NEXT_INSN (after)) = to;
2408 NEXT_INSN (to) = NEXT_INSN (after);
2409 PREV_INSN (from) = after;
2410 NEXT_INSN (after) = from;
2411 if (after == last_insn)
2415 /* Return the line note insn preceding INSN. */
2418 find_line_note (insn)
2421 if (no_line_numbers)
2424 for (; insn; insn = PREV_INSN (insn))
2425 if (GET_CODE (insn) == NOTE
2426 && NOTE_LINE_NUMBER (insn) >= 0)
2432 /* Like reorder_insns, but inserts line notes to preserve the line numbers
2433 of the moved insns when debugging. This may insert a note between AFTER
2434 and FROM, and another one after TO. */
2437 reorder_insns_with_line_notes (from, to, after)
2438 rtx from, to, after;
2440 rtx from_line = find_line_note (from);
2441 rtx after_line = find_line_note (after);
2443 reorder_insns (from, to, after);
2445 if (from_line == after_line)
2449 emit_line_note_after (NOTE_SOURCE_FILE (from_line),
2450 NOTE_LINE_NUMBER (from_line),
2453 emit_line_note_after (NOTE_SOURCE_FILE (after_line),
2454 NOTE_LINE_NUMBER (after_line),
2458 /* Emit an insn of given code and pattern
2459 at a specified place within the doubly-linked list. */
2461 /* Make an instruction with body PATTERN
2462 and output it before the instruction BEFORE. */
2465 emit_insn_before (pattern, before)
2466 register rtx pattern, before;
2468 register rtx insn = before;
2470 if (GET_CODE (pattern) == SEQUENCE)
2474 for (i = 0; i < XVECLEN (pattern, 0); i++)
2476 insn = XVECEXP (pattern, 0, i);
2477 add_insn_before (insn, before);
2479 if (XVECLEN (pattern, 0) < SEQUENCE_RESULT_SIZE)
2480 sequence_result[XVECLEN (pattern, 0)] = pattern;
2484 insn = make_insn_raw (pattern);
2485 add_insn_before (insn, before);
2491 /* Make an instruction with body PATTERN and code JUMP_INSN
2492 and output it before the instruction BEFORE. */
2495 emit_jump_insn_before (pattern, before)
2496 register rtx pattern, before;
2500 if (GET_CODE (pattern) == SEQUENCE)
2501 insn = emit_insn_before (pattern, before);
2504 insn = make_jump_insn_raw (pattern);
2505 add_insn_before (insn, before);
2511 /* Make an instruction with body PATTERN and code CALL_INSN
2512 and output it before the instruction BEFORE. */
2515 emit_call_insn_before (pattern, before)
2516 register rtx pattern, before;
2520 if (GET_CODE (pattern) == SEQUENCE)
2521 insn = emit_insn_before (pattern, before);
2524 insn = make_call_insn_raw (pattern);
2525 add_insn_before (insn, before);
2526 PUT_CODE (insn, CALL_INSN);
2532 /* Make an insn of code BARRIER
2533 and output it before the insn AFTER. */
2536 emit_barrier_before (before)
2537 register rtx before;
2539 register rtx insn = rtx_alloc (BARRIER);
2541 INSN_UID (insn) = cur_insn_uid++;
2543 add_insn_before (insn, before);
2547 /* Emit a note of subtype SUBTYPE before the insn BEFORE. */
2550 emit_note_before (subtype, before)
2554 register rtx note = rtx_alloc (NOTE);
2555 INSN_UID (note) = cur_insn_uid++;
2556 NOTE_SOURCE_FILE (note) = 0;
2557 NOTE_LINE_NUMBER (note) = subtype;
2559 add_insn_before (note, before);
2563 /* Make an insn of code INSN with body PATTERN
2564 and output it after the insn AFTER. */
2567 emit_insn_after (pattern, after)
2568 register rtx pattern, after;
2570 register rtx insn = after;
2572 if (GET_CODE (pattern) == SEQUENCE)
2576 for (i = 0; i < XVECLEN (pattern, 0); i++)
2578 insn = XVECEXP (pattern, 0, i);
2579 add_insn_after (insn, after);
2582 if (XVECLEN (pattern, 0) < SEQUENCE_RESULT_SIZE)
2583 sequence_result[XVECLEN (pattern, 0)] = pattern;
2587 insn = make_insn_raw (pattern);
2588 add_insn_after (insn, after);
2594 /* Similar to emit_insn_after, except that line notes are to be inserted so
2595 as to act as if this insn were at FROM. */
2598 emit_insn_after_with_line_notes (pattern, after, from)
2599 rtx pattern, after, from;
2601 rtx from_line = find_line_note (from);
2602 rtx after_line = find_line_note (after);
2603 rtx insn = emit_insn_after (pattern, after);
2606 emit_line_note_after (NOTE_SOURCE_FILE (from_line),
2607 NOTE_LINE_NUMBER (from_line),
2611 emit_line_note_after (NOTE_SOURCE_FILE (after_line),
2612 NOTE_LINE_NUMBER (after_line),
2616 /* Make an insn of code JUMP_INSN with body PATTERN
2617 and output it after the insn AFTER. */
2620 emit_jump_insn_after (pattern, after)
2621 register rtx pattern, after;
2625 if (GET_CODE (pattern) == SEQUENCE)
2626 insn = emit_insn_after (pattern, after);
2629 insn = make_jump_insn_raw (pattern);
2630 add_insn_after (insn, after);
2636 /* Make an insn of code BARRIER
2637 and output it after the insn AFTER. */
2640 emit_barrier_after (after)
2643 register rtx insn = rtx_alloc (BARRIER);
2645 INSN_UID (insn) = cur_insn_uid++;
2647 add_insn_after (insn, after);
2651 /* Emit the label LABEL after the insn AFTER. */
2654 emit_label_after (label, after)
2657 /* This can be called twice for the same label
2658 as a result of the confusion that follows a syntax error!
2659 So make it harmless. */
2660 if (INSN_UID (label) == 0)
2662 INSN_UID (label) = cur_insn_uid++;
2663 add_insn_after (label, after);
2669 /* Emit a note of subtype SUBTYPE after the insn AFTER. */
2672 emit_note_after (subtype, after)
2676 register rtx note = rtx_alloc (NOTE);
2677 INSN_UID (note) = cur_insn_uid++;
2678 NOTE_SOURCE_FILE (note) = 0;
2679 NOTE_LINE_NUMBER (note) = subtype;
2680 add_insn_after (note, after);
2684 /* Emit a line note for FILE and LINE after the insn AFTER. */
2687 emit_line_note_after (file, line, after)
2694 if (no_line_numbers && line > 0)
2700 note = rtx_alloc (NOTE);
2701 INSN_UID (note) = cur_insn_uid++;
2702 NOTE_SOURCE_FILE (note) = file;
2703 NOTE_LINE_NUMBER (note) = line;
2704 add_insn_after (note, after);
2708 /* Make an insn of code INSN with pattern PATTERN
2709 and add it to the end of the doubly-linked list.
2710 If PATTERN is a SEQUENCE, take the elements of it
2711 and emit an insn for each element.
2713 Returns the last insn emitted. */
2719 rtx insn = last_insn;
2721 if (GET_CODE (pattern) == SEQUENCE)
2725 for (i = 0; i < XVECLEN (pattern, 0); i++)
2727 insn = XVECEXP (pattern, 0, i);
2730 if (XVECLEN (pattern, 0) < SEQUENCE_RESULT_SIZE)
2731 sequence_result[XVECLEN (pattern, 0)] = pattern;
2735 insn = make_insn_raw (pattern);
2742 /* Emit the insns in a chain starting with INSN.
2743 Return the last insn emitted. */
2753 rtx next = NEXT_INSN (insn);
2762 /* Emit the insns in a chain starting with INSN and place them in front of
2763 the insn BEFORE. Return the last insn emitted. */
2766 emit_insns_before (insn, before)
2774 rtx next = NEXT_INSN (insn);
2775 add_insn_before (insn, before);
2783 /* Emit the insns in a chain starting with FIRST and place them in back of
2784 the insn AFTER. Return the last insn emitted. */
2787 emit_insns_after (first, after)
2792 register rtx after_after;
2800 for (last = first; NEXT_INSN (last); last = NEXT_INSN (last))
2803 after_after = NEXT_INSN (after);
2805 NEXT_INSN (after) = first;
2806 PREV_INSN (first) = after;
2807 NEXT_INSN (last) = after_after;
2809 PREV_INSN (after_after) = last;
2811 if (after == last_insn)
2816 /* Make an insn of code JUMP_INSN with pattern PATTERN
2817 and add it to the end of the doubly-linked list. */
2820 emit_jump_insn (pattern)
2823 if (GET_CODE (pattern) == SEQUENCE)
2824 return emit_insn (pattern);
2827 register rtx insn = make_jump_insn_raw (pattern);
2833 /* Make an insn of code CALL_INSN with pattern PATTERN
2834 and add it to the end of the doubly-linked list. */
2837 emit_call_insn (pattern)
2840 if (GET_CODE (pattern) == SEQUENCE)
2841 return emit_insn (pattern);
2844 register rtx insn = make_call_insn_raw (pattern);
2846 PUT_CODE (insn, CALL_INSN);
2851 /* Add the label LABEL to the end of the doubly-linked list. */
2857 /* This can be called twice for the same label
2858 as a result of the confusion that follows a syntax error!
2859 So make it harmless. */
2860 if (INSN_UID (label) == 0)
2862 INSN_UID (label) = cur_insn_uid++;
2868 /* Make an insn of code BARRIER
2869 and add it to the end of the doubly-linked list. */
2874 register rtx barrier = rtx_alloc (BARRIER);
2875 INSN_UID (barrier) = cur_insn_uid++;
2880 /* Make an insn of code NOTE
2881 with data-fields specified by FILE and LINE
2882 and add it to the end of the doubly-linked list,
2883 but only if line-numbers are desired for debugging info. */
2886 emit_line_note (file, line)
2890 if (output_bytecode)
2892 /* FIXME: for now we do nothing, but eventually we will have to deal with
2893 debugging information. */
2897 emit_filename = file;
2901 if (no_line_numbers)
2905 return emit_note (file, line);
2908 /* Make an insn of code NOTE
2909 with data-fields specified by FILE and LINE
2910 and add it to the end of the doubly-linked list.
2911 If it is a line-number NOTE, omit it if it matches the previous one. */
2914 emit_note (file, line)
2922 if (file && last_filename && !strcmp (file, last_filename)
2923 && line == last_linenum)
2925 last_filename = file;
2926 last_linenum = line;
2929 if (no_line_numbers && line > 0)
2935 note = rtx_alloc (NOTE);
2936 INSN_UID (note) = cur_insn_uid++;
2937 NOTE_SOURCE_FILE (note) = file;
2938 NOTE_LINE_NUMBER (note) = line;
2943 /* Emit a NOTE, and don't omit it even if LINE it the previous note. */
2946 emit_line_note_force (file, line)
2951 return emit_line_note (file, line);
2954 /* Cause next statement to emit a line note even if the line number
2955 has not changed. This is used at the beginning of a function. */
2958 force_next_line_note ()
2963 /* Return an indication of which type of insn should have X as a body.
2964 The value is CODE_LABEL, INSN, CALL_INSN or JUMP_INSN. */
2970 if (GET_CODE (x) == CODE_LABEL)
2972 if (GET_CODE (x) == CALL)
2974 if (GET_CODE (x) == RETURN)
2976 if (GET_CODE (x) == SET)
2978 if (SET_DEST (x) == pc_rtx)
2980 else if (GET_CODE (SET_SRC (x)) == CALL)
2985 if (GET_CODE (x) == PARALLEL)
2988 for (j = XVECLEN (x, 0) - 1; j >= 0; j--)
2989 if (GET_CODE (XVECEXP (x, 0, j)) == CALL)
2991 else if (GET_CODE (XVECEXP (x, 0, j)) == SET
2992 && SET_DEST (XVECEXP (x, 0, j)) == pc_rtx)
2994 else if (GET_CODE (XVECEXP (x, 0, j)) == SET
2995 && GET_CODE (SET_SRC (XVECEXP (x, 0, j))) == CALL)
3001 /* Emit the rtl pattern X as an appropriate kind of insn.
3002 If X is a label, it is simply added into the insn chain. */
3008 enum rtx_code code = classify_insn (x);
3010 if (code == CODE_LABEL)
3011 return emit_label (x);
3012 else if (code == INSN)
3013 return emit_insn (x);
3014 else if (code == JUMP_INSN)
3016 register rtx insn = emit_jump_insn (x);
3017 if (simplejump_p (insn) || GET_CODE (x) == RETURN)
3018 return emit_barrier ();
3021 else if (code == CALL_INSN)
3022 return emit_call_insn (x);
3027 /* Begin emitting insns to a sequence which can be packaged in an RTL_EXPR. */
3032 struct sequence_stack *tem;
3034 if (sequence_element_free_list)
3036 /* Reuse a previously-saved struct sequence_stack. */
3037 tem = sequence_element_free_list;
3038 sequence_element_free_list = tem->next;
3041 tem = (struct sequence_stack *) permalloc (sizeof (struct sequence_stack));
3043 tem->next = sequence_stack;
3044 tem->first = first_insn;
3045 tem->last = last_insn;
3046 tem->sequence_rtl_expr = sequence_rtl_expr;
3048 sequence_stack = tem;
3054 /* Similarly, but indicate that this sequence will be placed in
3058 start_sequence_for_rtl_expr (t)
3063 sequence_rtl_expr = t;
3066 /* Set up the insn chain starting with FIRST
3067 as the current sequence, saving the previously current one. */
3070 push_to_sequence (first)
3077 for (last = first; last && NEXT_INSN (last); last = NEXT_INSN (last));
3083 /* Set up the outer-level insn chain
3084 as the current sequence, saving the previously current one. */
3087 push_topmost_sequence ()
3089 struct sequence_stack *stack, *top;
3093 for (stack = sequence_stack; stack; stack = stack->next)
3096 first_insn = top->first;
3097 last_insn = top->last;
3098 sequence_rtl_expr = top->sequence_rtl_expr;
3101 /* After emitting to the outer-level insn chain, update the outer-level
3102 insn chain, and restore the previous saved state. */
3105 pop_topmost_sequence ()
3107 struct sequence_stack *stack, *top;
3109 for (stack = sequence_stack; stack; stack = stack->next)
3112 top->first = first_insn;
3113 top->last = last_insn;
3114 /* ??? Why don't we save sequence_rtl_expr here? */
3119 /* After emitting to a sequence, restore previous saved state.
3121 To get the contents of the sequence just made,
3122 you must call `gen_sequence' *before* calling here. */
3127 struct sequence_stack *tem = sequence_stack;
3129 first_insn = tem->first;
3130 last_insn = tem->last;
3131 sequence_rtl_expr = tem->sequence_rtl_expr;
3132 sequence_stack = tem->next;
3134 tem->next = sequence_element_free_list;
3135 sequence_element_free_list = tem;
3138 /* Return 1 if currently emitting into a sequence. */
3143 return sequence_stack != 0;
3146 /* Generate a SEQUENCE rtx containing the insns already emitted
3147 to the current sequence.
3149 This is how the gen_... function from a DEFINE_EXPAND
3150 constructs the SEQUENCE that it returns. */
3160 /* Count the insns in the chain. */
3162 for (tem = first_insn; tem; tem = NEXT_INSN (tem))
3165 /* If only one insn, return its pattern rather than a SEQUENCE.
3166 (Now that we cache SEQUENCE expressions, it isn't worth special-casing
3167 the case of an empty list.) */
3169 && (GET_CODE (first_insn) == INSN
3170 || GET_CODE (first_insn) == JUMP_INSN
3171 /* Don't discard the call usage field. */
3172 || (GET_CODE (first_insn) == CALL_INSN
3173 && CALL_INSN_FUNCTION_USAGE (first_insn) == NULL_RTX)))
3175 NEXT_INSN (first_insn) = free_insn;
3176 free_insn = first_insn;
3177 return PATTERN (first_insn);
3180 /* Put them in a vector. See if we already have a SEQUENCE of the
3181 appropriate length around. */
3182 if (len < SEQUENCE_RESULT_SIZE && (result = sequence_result[len]) != 0)
3183 sequence_result[len] = 0;
3186 /* Ensure that this rtl goes in saveable_obstack, since we may
3188 push_obstacks_nochange ();
3189 rtl_in_saveable_obstack ();
3190 result = gen_rtx (SEQUENCE, VOIDmode, rtvec_alloc (len));
3194 for (i = 0, tem = first_insn; tem; tem = NEXT_INSN (tem), i++)
3195 XVECEXP (result, 0, i) = tem;
3200 /* Initialize data structures and variables in this file
3201 before generating rtl for each function. */
3210 sequence_rtl_expr = NULL;
3212 reg_rtx_no = LAST_VIRTUAL_REGISTER + 1;
3215 first_label_num = label_num;
3217 sequence_stack = NULL;
3219 /* Clear the start_sequence/gen_sequence cache. */
3220 sequence_element_free_list = 0;
3221 for (i = 0; i < SEQUENCE_RESULT_SIZE; i++)
3222 sequence_result[i] = 0;
3225 /* Init the tables that describe all the pseudo regs. */
3227 regno_pointer_flag_length = LAST_VIRTUAL_REGISTER + 101;
3230 = (char *) savealloc (regno_pointer_flag_length);
3231 bzero (regno_pointer_flag, regno_pointer_flag_length);
3234 = (char *) savealloc (regno_pointer_flag_length);
3235 bzero (regno_pointer_align, regno_pointer_flag_length);
3238 = (rtx *) savealloc (regno_pointer_flag_length * sizeof (rtx));
3239 bzero ((char *) regno_reg_rtx, regno_pointer_flag_length * sizeof (rtx));
3241 /* Put copies of all the virtual register rtx into regno_reg_rtx. */
3242 regno_reg_rtx[VIRTUAL_INCOMING_ARGS_REGNUM] = virtual_incoming_args_rtx;
3243 regno_reg_rtx[VIRTUAL_STACK_VARS_REGNUM] = virtual_stack_vars_rtx;
3244 regno_reg_rtx[VIRTUAL_STACK_DYNAMIC_REGNUM] = virtual_stack_dynamic_rtx;
3245 regno_reg_rtx[VIRTUAL_OUTGOING_ARGS_REGNUM] = virtual_outgoing_args_rtx;
3247 /* Indicate that the virtual registers and stack locations are
3249 REGNO_POINTER_FLAG (STACK_POINTER_REGNUM) = 1;
3250 REGNO_POINTER_FLAG (FRAME_POINTER_REGNUM) = 1;
3251 REGNO_POINTER_FLAG (HARD_FRAME_POINTER_REGNUM) = 1;
3252 REGNO_POINTER_FLAG (ARG_POINTER_REGNUM) = 1;
3254 REGNO_POINTER_FLAG (VIRTUAL_INCOMING_ARGS_REGNUM) = 1;
3255 REGNO_POINTER_FLAG (VIRTUAL_STACK_VARS_REGNUM) = 1;
3256 REGNO_POINTER_FLAG (VIRTUAL_STACK_DYNAMIC_REGNUM) = 1;
3257 REGNO_POINTER_FLAG (VIRTUAL_OUTGOING_ARGS_REGNUM) = 1;
3259 #ifdef STACK_BOUNDARY
3260 REGNO_POINTER_ALIGN (STACK_POINTER_REGNUM) = STACK_BOUNDARY / BITS_PER_UNIT;
3261 REGNO_POINTER_ALIGN (FRAME_POINTER_REGNUM) = STACK_BOUNDARY / BITS_PER_UNIT;
3262 REGNO_POINTER_ALIGN (HARD_FRAME_POINTER_REGNUM)
3263 = STACK_BOUNDARY / BITS_PER_UNIT;
3264 REGNO_POINTER_ALIGN (ARG_POINTER_REGNUM) = STACK_BOUNDARY / BITS_PER_UNIT;
3266 REGNO_POINTER_ALIGN (VIRTUAL_INCOMING_ARGS_REGNUM)
3267 = STACK_BOUNDARY / BITS_PER_UNIT;
3268 REGNO_POINTER_ALIGN (VIRTUAL_STACK_VARS_REGNUM)
3269 = STACK_BOUNDARY / BITS_PER_UNIT;
3270 REGNO_POINTER_ALIGN (VIRTUAL_STACK_DYNAMIC_REGNUM)
3271 = STACK_BOUNDARY / BITS_PER_UNIT;
3272 REGNO_POINTER_ALIGN (VIRTUAL_OUTGOING_ARGS_REGNUM)
3273 = STACK_BOUNDARY / BITS_PER_UNIT;
3276 #ifdef INIT_EXPANDERS
3281 /* Create some permanent unique rtl objects shared between all functions.
3282 LINE_NUMBERS is nonzero if line numbers are to be generated. */
3285 init_emit_once (line_numbers)
3289 enum machine_mode mode;
3291 no_line_numbers = ! line_numbers;
3293 sequence_stack = NULL;
3295 /* Compute the word and byte modes. */
3297 byte_mode = VOIDmode;
3298 word_mode = VOIDmode;
3300 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
3301 mode = GET_MODE_WIDER_MODE (mode))
3303 if (GET_MODE_BITSIZE (mode) == BITS_PER_UNIT
3304 && byte_mode == VOIDmode)
3307 if (GET_MODE_BITSIZE (mode) == BITS_PER_WORD
3308 && word_mode == VOIDmode)
3312 ptr_mode = mode_for_size (POINTER_SIZE, GET_MODE_CLASS (Pmode), 0);
3314 /* Create the unique rtx's for certain rtx codes and operand values. */
3316 pc_rtx = gen_rtx (PC, VOIDmode);
3317 cc0_rtx = gen_rtx (CC0, VOIDmode);
3319 /* Don't use gen_rtx here since gen_rtx in this case
3320 tries to use these variables. */
3321 for (i = - MAX_SAVED_CONST_INT; i <= MAX_SAVED_CONST_INT; i++)
3323 const_int_rtx[i + MAX_SAVED_CONST_INT] = rtx_alloc (CONST_INT);
3324 PUT_MODE (const_int_rtx[i + MAX_SAVED_CONST_INT], VOIDmode);
3325 INTVAL (const_int_rtx[i + MAX_SAVED_CONST_INT]) = i;
3328 /* These four calls obtain some of the rtx expressions made above. */
3329 const0_rtx = GEN_INT (0);
3330 const1_rtx = GEN_INT (1);
3331 const2_rtx = GEN_INT (2);
3332 constm1_rtx = GEN_INT (-1);
3334 /* This will usually be one of the above constants, but may be a new rtx. */
3335 const_true_rtx = GEN_INT (STORE_FLAG_VALUE);
3337 dconst0 = REAL_VALUE_ATOF ("0", DFmode);
3338 dconst1 = REAL_VALUE_ATOF ("1", DFmode);
3339 dconst2 = REAL_VALUE_ATOF ("2", DFmode);
3340 dconstm1 = REAL_VALUE_ATOF ("-1", DFmode);
3342 for (i = 0; i <= 2; i++)
3344 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); mode != VOIDmode;
3345 mode = GET_MODE_WIDER_MODE (mode))
3347 rtx tem = rtx_alloc (CONST_DOUBLE);
3348 union real_extract u;
3350 bzero ((char *) &u, sizeof u); /* Zero any holes in a structure. */
3351 u.d = i == 0 ? dconst0 : i == 1 ? dconst1 : dconst2;
3353 bcopy ((char *) &u, (char *) &CONST_DOUBLE_LOW (tem), sizeof u);
3354 CONST_DOUBLE_MEM (tem) = cc0_rtx;
3355 PUT_MODE (tem, mode);
3357 const_tiny_rtx[i][(int) mode] = tem;
3360 const_tiny_rtx[i][(int) VOIDmode] = GEN_INT (i);
3362 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
3363 mode = GET_MODE_WIDER_MODE (mode))
3364 const_tiny_rtx[i][(int) mode] = GEN_INT (i);
3366 for (mode = GET_CLASS_NARROWEST_MODE (MODE_PARTIAL_INT);
3368 mode = GET_MODE_WIDER_MODE (mode))
3369 const_tiny_rtx[i][(int) mode] = GEN_INT (i);
3372 for (mode = GET_CLASS_NARROWEST_MODE (MODE_CC); mode != VOIDmode;
3373 mode = GET_MODE_WIDER_MODE (mode))
3374 const_tiny_rtx[0][(int) mode] = const0_rtx;
3376 stack_pointer_rtx = gen_rtx (REG, Pmode, STACK_POINTER_REGNUM);
3377 frame_pointer_rtx = gen_rtx (REG, Pmode, FRAME_POINTER_REGNUM);
3379 if (HARD_FRAME_POINTER_REGNUM == FRAME_POINTER_REGNUM)
3380 hard_frame_pointer_rtx = frame_pointer_rtx;
3382 hard_frame_pointer_rtx = gen_rtx (REG, Pmode, HARD_FRAME_POINTER_REGNUM);
3384 if (FRAME_POINTER_REGNUM == ARG_POINTER_REGNUM)
3385 arg_pointer_rtx = frame_pointer_rtx;
3386 else if (HARD_FRAME_POINTER_REGNUM == ARG_POINTER_REGNUM)
3387 arg_pointer_rtx = hard_frame_pointer_rtx;
3388 else if (STACK_POINTER_REGNUM == ARG_POINTER_REGNUM)
3389 arg_pointer_rtx = stack_pointer_rtx;
3391 arg_pointer_rtx = gen_rtx (REG, Pmode, ARG_POINTER_REGNUM);
3393 #ifdef RETURN_ADDRESS_POINTER_REGNUM
3394 return_address_pointer_rtx = gen_rtx (REG, Pmode,
3395 RETURN_ADDRESS_POINTER_REGNUM);
3398 /* Create the virtual registers. Do so here since the following objects
3399 might reference them. */
3401 virtual_incoming_args_rtx = gen_rtx (REG, Pmode,
3402 VIRTUAL_INCOMING_ARGS_REGNUM);
3403 virtual_stack_vars_rtx = gen_rtx (REG, Pmode,
3404 VIRTUAL_STACK_VARS_REGNUM);
3405 virtual_stack_dynamic_rtx = gen_rtx (REG, Pmode,
3406 VIRTUAL_STACK_DYNAMIC_REGNUM);
3407 virtual_outgoing_args_rtx = gen_rtx (REG, Pmode,
3408 VIRTUAL_OUTGOING_ARGS_REGNUM);
3411 struct_value_rtx = STRUCT_VALUE;
3413 struct_value_rtx = gen_rtx (REG, Pmode, STRUCT_VALUE_REGNUM);
3416 #ifdef STRUCT_VALUE_INCOMING
3417 struct_value_incoming_rtx = STRUCT_VALUE_INCOMING;
3419 #ifdef STRUCT_VALUE_INCOMING_REGNUM
3420 struct_value_incoming_rtx
3421 = gen_rtx (REG, Pmode, STRUCT_VALUE_INCOMING_REGNUM);
3423 struct_value_incoming_rtx = struct_value_rtx;
3427 #ifdef STATIC_CHAIN_REGNUM
3428 static_chain_rtx = gen_rtx (REG, Pmode, STATIC_CHAIN_REGNUM);
3430 #ifdef STATIC_CHAIN_INCOMING_REGNUM
3431 if (STATIC_CHAIN_INCOMING_REGNUM != STATIC_CHAIN_REGNUM)
3432 static_chain_incoming_rtx = gen_rtx (REG, Pmode, STATIC_CHAIN_INCOMING_REGNUM);
3435 static_chain_incoming_rtx = static_chain_rtx;
3439 static_chain_rtx = STATIC_CHAIN;
3441 #ifdef STATIC_CHAIN_INCOMING
3442 static_chain_incoming_rtx = STATIC_CHAIN_INCOMING;
3444 static_chain_incoming_rtx = static_chain_rtx;
3448 #ifdef PIC_OFFSET_TABLE_REGNUM
3449 pic_offset_table_rtx = gen_rtx (REG, Pmode, PIC_OFFSET_TABLE_REGNUM);