1 /* Emit RTL for the GNU C-Compiler expander.
2 Copyright (C) 1987, 88, 92-96, 1997 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"
64 #ifdef BCDEBUG_PRINT_CODE
67 #include "bc-opname.h"
74 /* Commonly used modes. */
76 enum machine_mode byte_mode; /* Mode whose width is BITS_PER_UNIT. */
77 enum machine_mode word_mode; /* Mode whose width is BITS_PER_WORD. */
78 enum machine_mode ptr_mode; /* Mode whose width is POINTER_SIZE. */
80 /* This is reset to LAST_VIRTUAL_REGISTER + 1 at the start of each function.
81 After rtl generation, it is 1 plus the largest register number used. */
83 int reg_rtx_no = LAST_VIRTUAL_REGISTER + 1;
85 /* This is *not* reset after each function. It gives each CODE_LABEL
86 in the entire compilation a unique label number. */
88 static int label_num = 1;
90 /* Lowest label number in current function. */
92 static int first_label_num;
94 /* Highest label number in current function.
95 Zero means use the value of label_num instead.
96 This is nonzero only when belatedly compiling an inline function. */
98 static int last_label_num;
100 /* Value label_num had when set_new_first_and_last_label_number was called.
101 If label_num has not changed since then, last_label_num is valid. */
103 static int base_label_num;
105 /* Nonzero means do not generate NOTEs for source line numbers. */
107 static int no_line_numbers;
109 /* Commonly used rtx's, so that we only need space for one copy.
110 These are initialized once for the entire compilation.
111 All of these except perhaps the floating-point CONST_DOUBLEs
112 are unique; no other rtx-object will be equal to any of these. */
114 rtx pc_rtx; /* (PC) */
115 rtx cc0_rtx; /* (CC0) */
116 rtx cc1_rtx; /* (CC1) (not actually used nowadays) */
117 rtx const0_rtx; /* (CONST_INT 0) */
118 rtx const1_rtx; /* (CONST_INT 1) */
119 rtx const2_rtx; /* (CONST_INT 2) */
120 rtx constm1_rtx; /* (CONST_INT -1) */
121 rtx const_true_rtx; /* (CONST_INT STORE_FLAG_VALUE) */
123 /* We record floating-point CONST_DOUBLEs in each floating-point mode for
124 the values of 0, 1, and 2. For the integer entries and VOIDmode, we
125 record a copy of const[012]_rtx. */
127 rtx const_tiny_rtx[3][(int) MAX_MACHINE_MODE];
129 REAL_VALUE_TYPE dconst0;
130 REAL_VALUE_TYPE dconst1;
131 REAL_VALUE_TYPE dconst2;
132 REAL_VALUE_TYPE dconstm1;
134 /* All references to the following fixed hard registers go through
135 these unique rtl objects. On machines where the frame-pointer and
136 arg-pointer are the same register, they use the same unique object.
138 After register allocation, other rtl objects which used to be pseudo-regs
139 may be clobbered to refer to the frame-pointer register.
140 But references that were originally to the frame-pointer can be
141 distinguished from the others because they contain frame_pointer_rtx.
143 When to use frame_pointer_rtx and hard_frame_pointer_rtx is a little
144 tricky: until register elimination has taken place hard_frame_pointer_rtx
145 should be used if it is being set, and frame_pointer_rtx otherwise. After
146 register elimination hard_frame_pointer_rtx should always be used.
147 On machines where the two registers are same (most) then these are the
150 In an inline procedure, the stack and frame pointer rtxs may not be
151 used for anything else. */
152 rtx stack_pointer_rtx; /* (REG:Pmode STACK_POINTER_REGNUM) */
153 rtx frame_pointer_rtx; /* (REG:Pmode FRAME_POINTER_REGNUM) */
154 rtx hard_frame_pointer_rtx; /* (REG:Pmode HARD_FRAME_POINTER_REGNUM) */
155 rtx arg_pointer_rtx; /* (REG:Pmode ARG_POINTER_REGNUM) */
156 rtx struct_value_rtx; /* (REG:Pmode STRUCT_VALUE_REGNUM) */
157 rtx struct_value_incoming_rtx; /* (REG:Pmode STRUCT_VALUE_INCOMING_REGNUM) */
158 rtx static_chain_rtx; /* (REG:Pmode STATIC_CHAIN_REGNUM) */
159 rtx static_chain_incoming_rtx; /* (REG:Pmode STATIC_CHAIN_INCOMING_REGNUM) */
160 rtx pic_offset_table_rtx; /* (REG:Pmode PIC_OFFSET_TABLE_REGNUM) */
162 /* This is used to implement __builtin_return_address for some machines.
163 See for instance the MIPS port. */
164 rtx return_address_pointer_rtx; /* (REG:Pmode RETURN_ADDRESS_POINTER_REGNUM) */
166 rtx virtual_incoming_args_rtx; /* (REG:Pmode VIRTUAL_INCOMING_ARGS_REGNUM) */
167 rtx virtual_stack_vars_rtx; /* (REG:Pmode VIRTUAL_STACK_VARS_REGNUM) */
168 rtx virtual_stack_dynamic_rtx; /* (REG:Pmode VIRTUAL_STACK_DYNAMIC_REGNUM) */
169 rtx virtual_outgoing_args_rtx; /* (REG:Pmode VIRTUAL_OUTGOING_ARGS_REGNUM) */
171 /* We make one copy of (const_int C) where C is in
172 [- MAX_SAVED_CONST_INT, MAX_SAVED_CONST_INT]
173 to save space during the compilation and simplify comparisons of
176 #define MAX_SAVED_CONST_INT 64
178 static rtx const_int_rtx[MAX_SAVED_CONST_INT * 2 + 1];
180 /* The ends of the doubly-linked chain of rtl for the current function.
181 Both are reset to null at the start of rtl generation for the function.
183 start_sequence saves both of these on `sequence_stack' along with
184 `sequence_rtl_expr' and then starts a new, nested sequence of insns. */
186 static rtx first_insn = NULL;
187 static rtx last_insn = NULL;
189 /* RTL_EXPR within which the current sequence will be placed. Use to
190 prevent reuse of any temporaries within the sequence until after the
191 RTL_EXPR is emitted. */
193 tree sequence_rtl_expr = NULL;
195 /* INSN_UID for next insn emitted.
196 Reset to 1 for each function compiled. */
198 static int cur_insn_uid = 1;
200 /* Line number and source file of the last line-number NOTE emitted.
201 This is used to avoid generating duplicates. */
203 static int last_linenum = 0;
204 static char *last_filename = 0;
206 /* A vector indexed by pseudo reg number. The allocated length
207 of this vector is regno_pointer_flag_length. Since this
208 vector is needed during the expansion phase when the total
209 number of registers in the function is not yet known,
210 it is copied and made bigger when necessary. */
212 char *regno_pointer_flag;
213 int regno_pointer_flag_length;
215 /* Indexed by pseudo register number, if nonzero gives the known alignment
216 for that pseudo (if regno_pointer_flag is set).
217 Allocated in parallel with regno_pointer_flag. */
218 char *regno_pointer_align;
220 /* Indexed by pseudo register number, gives the rtx for that pseudo.
221 Allocated in parallel with regno_pointer_flag. */
225 /* Stack of pending (incomplete) sequences saved by `start_sequence'.
226 Each element describes one pending sequence.
227 The main insn-chain is saved in the last element of the chain,
228 unless the chain is empty. */
230 struct sequence_stack *sequence_stack;
232 /* start_sequence and gen_sequence can make a lot of rtx expressions which are
233 shortly thrown away. We use two mechanisms to prevent this waste:
235 First, we keep a list of the expressions used to represent the sequence
236 stack in sequence_element_free_list.
238 Second, for sizes up to 5 elements, we keep a SEQUENCE and its associated
239 rtvec for use by gen_sequence. One entry for each size is sufficient
240 because most cases are calls to gen_sequence followed by immediately
241 emitting the SEQUENCE. Reuse is safe since emitting a sequence is
242 destructive on the insn in it anyway and hence can't be redone.
244 We do not bother to save this cached data over nested function calls.
245 Instead, we just reinitialize them. */
247 #define SEQUENCE_RESULT_SIZE 5
249 static struct sequence_stack *sequence_element_free_list;
250 static rtx sequence_result[SEQUENCE_RESULT_SIZE];
252 /* During RTL generation, we also keep a list of free INSN rtl codes. */
253 static rtx free_insn;
255 extern int rtx_equal_function_value_matters;
257 /* Filename and line number of last line-number note,
258 whether we actually emitted it or not. */
259 extern char *emit_filename;
260 extern int emit_lineno;
262 /* rtx gen_rtx (code, mode, [element1, ..., elementn])
264 ** This routine generates an RTX of the size specified by
265 ** <code>, which is an RTX code. The RTX structure is initialized
266 ** from the arguments <element1> through <elementn>, which are
267 ** interpreted according to the specific RTX type's format. The
268 ** special machine mode associated with the rtx (if any) is specified
271 ** gen_rtx can be invoked in a way which resembles the lisp-like
272 ** rtx it will generate. For example, the following rtx structure:
274 ** (plus:QI (mem:QI (reg:SI 1))
275 ** (mem:QI (plusw:SI (reg:SI 2) (reg:SI 3))))
277 ** ...would be generated by the following C code:
279 ** gen_rtx (PLUS, QImode,
280 ** gen_rtx (MEM, QImode,
281 ** gen_rtx (REG, SImode, 1)),
282 ** gen_rtx (MEM, QImode,
283 ** gen_rtx (PLUS, SImode,
284 ** gen_rtx (REG, SImode, 2),
285 ** gen_rtx (REG, SImode, 3)))),
290 gen_rtx VPROTO((enum rtx_code code, enum machine_mode mode, ...))
294 enum machine_mode mode;
297 register int i; /* Array indices... */
298 register char *fmt; /* Current rtx's format... */
299 register rtx rt_val; /* RTX to return to caller... */
304 code = va_arg (p, enum rtx_code);
305 mode = va_arg (p, enum machine_mode);
308 if (code == CONST_INT)
310 HOST_WIDE_INT arg = va_arg (p, HOST_WIDE_INT);
312 if (arg >= - MAX_SAVED_CONST_INT && arg <= MAX_SAVED_CONST_INT)
313 return const_int_rtx[arg + MAX_SAVED_CONST_INT];
315 if (const_true_rtx && arg == STORE_FLAG_VALUE)
316 return const_true_rtx;
318 rt_val = rtx_alloc (code);
319 INTVAL (rt_val) = arg;
321 else if (code == REG)
323 int regno = va_arg (p, int);
325 /* In case the MD file explicitly references the frame pointer, have
326 all such references point to the same frame pointer. This is used
327 during frame pointer elimination to distinguish the explicit
328 references to these registers from pseudos that happened to be
331 If we have eliminated the frame pointer or arg pointer, we will
332 be using it as a normal register, for example as a spill register.
333 In such cases, we might be accessing it in a mode that is not
334 Pmode and therefore cannot use the pre-allocated rtx.
336 Also don't do this when we are making new REGs in reload,
337 since we don't want to get confused with the real pointers. */
339 if (frame_pointer_rtx && regno == FRAME_POINTER_REGNUM && mode == Pmode
340 && ! reload_in_progress)
341 return frame_pointer_rtx;
342 #if FRAME_POINTER_REGNUM != HARD_FRAME_POINTER_REGNUM
343 if (hard_frame_pointer_rtx && regno == HARD_FRAME_POINTER_REGNUM
344 && mode == Pmode && ! reload_in_progress)
345 return hard_frame_pointer_rtx;
347 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM && HARD_FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
348 if (arg_pointer_rtx && regno == ARG_POINTER_REGNUM && mode == Pmode
349 && ! reload_in_progress)
350 return arg_pointer_rtx;
352 #ifdef RETURN_ADDRESS_POINTER_REGNUM
353 if (return_address_pointer_rtx && regno == RETURN_ADDRESS_POINTER_REGNUM
354 && mode == Pmode && ! reload_in_progress)
355 return return_address_pointer_rtx;
357 if (stack_pointer_rtx && regno == STACK_POINTER_REGNUM && mode == Pmode
358 && ! reload_in_progress)
359 return stack_pointer_rtx;
362 rt_val = rtx_alloc (code);
364 REGNO (rt_val) = regno;
370 rt_val = rtx_alloc (code); /* Allocate the storage space. */
371 rt_val->mode = mode; /* Store the machine mode... */
373 fmt = GET_RTX_FORMAT (code); /* Find the right format... */
374 for (i = 0; i < GET_RTX_LENGTH (code); i++)
378 case '0': /* Unused field. */
381 case 'i': /* An integer? */
382 XINT (rt_val, i) = va_arg (p, int);
385 case 'w': /* A wide integer? */
386 XWINT (rt_val, i) = va_arg (p, HOST_WIDE_INT);
389 case 's': /* A string? */
390 XSTR (rt_val, i) = va_arg (p, char *);
393 case 'e': /* An expression? */
394 case 'u': /* An insn? Same except when printing. */
395 XEXP (rt_val, i) = va_arg (p, rtx);
398 case 'E': /* An RTX vector? */
399 XVEC (rt_val, i) = va_arg (p, rtvec);
408 return rt_val; /* Return the new RTX... */
411 /* gen_rtvec (n, [rt1, ..., rtn])
413 ** This routine creates an rtvec and stores within it the
414 ** pointers to rtx's which are its arguments.
419 gen_rtvec VPROTO((int n, ...))
435 return NULL_RTVEC; /* Don't allocate an empty rtvec... */
437 vector = (rtx *) alloca (n * sizeof (rtx));
439 for (i = 0; i < n; i++)
440 vector[i] = va_arg (p, rtx);
443 return gen_rtvec_v (n, vector);
447 gen_rtvec_v (n, argp)
452 register rtvec rt_val;
455 return NULL_RTVEC; /* Don't allocate an empty rtvec... */
457 rt_val = rtvec_alloc (n); /* Allocate an rtvec... */
459 for (i = 0; i < n; i++)
460 rt_val->elem[i].rtx = *argp++;
466 gen_rtvec_vv (n, argp)
471 register rtvec rt_val;
474 return NULL_RTVEC; /* Don't allocate an empty rtvec... */
476 rt_val = rtvec_alloc (n); /* Allocate an rtvec... */
478 for (i = 0; i < n; i++)
479 rt_val->elem[i].rtx = (argp++)->rtx;
484 /* Generate a REG rtx for a new pseudo register of mode MODE.
485 This pseudo is assigned the next sequential register number. */
489 enum machine_mode mode;
493 /* Don't let anything called by or after reload create new registers
494 (actually, registers can't be created after flow, but this is a good
497 if (reload_in_progress || reload_completed)
500 if (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT
501 || GET_MODE_CLASS (mode) == MODE_COMPLEX_INT)
503 /* For complex modes, don't make a single pseudo.
504 Instead, make a CONCAT of two pseudos.
505 This allows noncontiguous allocation of the real and imaginary parts,
506 which makes much better code. Besides, allocating DCmode
507 pseudos overstrains reload on some machines like the 386. */
508 rtx realpart, imagpart;
509 int size = GET_MODE_UNIT_SIZE (mode);
510 enum machine_mode partmode
511 = mode_for_size (size * BITS_PER_UNIT,
512 (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT
513 ? MODE_FLOAT : MODE_INT),
516 realpart = gen_reg_rtx (partmode);
517 imagpart = gen_reg_rtx (partmode);
518 return gen_rtx (CONCAT, mode, realpart, imagpart);
521 /* Make sure regno_pointer_flag and regno_reg_rtx are large
522 enough to have an element for this pseudo reg number. */
524 if (reg_rtx_no == regno_pointer_flag_length)
528 (char *) savealloc (regno_pointer_flag_length * 2);
529 bcopy (regno_pointer_flag, new, regno_pointer_flag_length);
530 bzero (&new[regno_pointer_flag_length], regno_pointer_flag_length);
531 regno_pointer_flag = new;
533 new = (char *) savealloc (regno_pointer_flag_length * 2);
534 bcopy (regno_pointer_align, new, regno_pointer_flag_length);
535 bzero (&new[regno_pointer_flag_length], regno_pointer_flag_length);
536 regno_pointer_align = new;
538 new1 = (rtx *) savealloc (regno_pointer_flag_length * 2 * sizeof (rtx));
539 bcopy ((char *) regno_reg_rtx, (char *) new1,
540 regno_pointer_flag_length * sizeof (rtx));
541 bzero ((char *) &new1[regno_pointer_flag_length],
542 regno_pointer_flag_length * sizeof (rtx));
543 regno_reg_rtx = new1;
545 regno_pointer_flag_length *= 2;
548 val = gen_rtx (REG, mode, reg_rtx_no);
549 regno_reg_rtx[reg_rtx_no++] = val;
553 /* Identify REG (which may be a CONCAT) as a user register. */
559 if (GET_CODE (reg) == CONCAT)
561 REG_USERVAR_P (XEXP (reg, 0)) = 1;
562 REG_USERVAR_P (XEXP (reg, 1)) = 1;
564 else if (GET_CODE (reg) == REG)
565 REG_USERVAR_P (reg) = 1;
570 /* Identify REG as a probable pointer register and show its alignment
571 as ALIGN, if nonzero. */
574 mark_reg_pointer (reg, align)
578 REGNO_POINTER_FLAG (REGNO (reg)) = 1;
581 REGNO_POINTER_ALIGN (REGNO (reg)) = align;
584 /* Return 1 plus largest pseudo reg number used in the current function. */
592 /* Return 1 + the largest label number used so far in the current function. */
597 if (last_label_num && label_num == base_label_num)
598 return last_label_num;
602 /* Return first label number used in this function (if any were used). */
605 get_first_label_num ()
607 return first_label_num;
610 /* Return a value representing some low-order bits of X, where the number
611 of low-order bits is given by MODE. Note that no conversion is done
612 between floating-point and fixed-point values, rather, the bit
613 representation is returned.
615 This function handles the cases in common between gen_lowpart, below,
616 and two variants in cse.c and combine.c. These are the cases that can
617 be safely handled at all points in the compilation.
619 If this is not a case we can handle, return 0. */
622 gen_lowpart_common (mode, x)
623 enum machine_mode mode;
628 if (GET_MODE (x) == mode)
631 /* MODE must occupy no more words than the mode of X. */
632 if (GET_MODE (x) != VOIDmode
633 && ((GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD
634 > ((GET_MODE_SIZE (GET_MODE (x)) + (UNITS_PER_WORD - 1))
638 if (WORDS_BIG_ENDIAN && GET_MODE_SIZE (GET_MODE (x)) > UNITS_PER_WORD)
639 word = ((GET_MODE_SIZE (GET_MODE (x))
640 - MAX (GET_MODE_SIZE (mode), UNITS_PER_WORD))
643 if ((GET_CODE (x) == ZERO_EXTEND || GET_CODE (x) == SIGN_EXTEND)
644 && (GET_MODE_CLASS (mode) == MODE_INT
645 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT))
647 /* If we are getting the low-order part of something that has been
648 sign- or zero-extended, we can either just use the object being
649 extended or make a narrower extension. If we want an even smaller
650 piece than the size of the object being extended, call ourselves
653 This case is used mostly by combine and cse. */
655 if (GET_MODE (XEXP (x, 0)) == mode)
657 else if (GET_MODE_SIZE (mode) < GET_MODE_SIZE (GET_MODE (XEXP (x, 0))))
658 return gen_lowpart_common (mode, XEXP (x, 0));
659 else if (GET_MODE_SIZE (mode) < GET_MODE_SIZE (GET_MODE (x)))
660 return gen_rtx (GET_CODE (x), mode, XEXP (x, 0));
662 else if (GET_CODE (x) == SUBREG
663 && (GET_MODE_SIZE (mode) <= UNITS_PER_WORD
664 || GET_MODE_SIZE (mode) == GET_MODE_UNIT_SIZE (GET_MODE (x))))
665 return (GET_MODE (SUBREG_REG (x)) == mode && SUBREG_WORD (x) == 0
667 : gen_rtx (SUBREG, mode, SUBREG_REG (x), SUBREG_WORD (x) + word));
668 else if (GET_CODE (x) == REG)
670 /* If the register is not valid for MODE, return 0. If we don't
671 do this, there is no way to fix up the resulting REG later.
672 But we do do this if the current REG is not valid for its
673 mode. This latter is a kludge, but is required due to the
674 way that parameters are passed on some machines, most
676 if (REGNO (x) < FIRST_PSEUDO_REGISTER
677 && ! HARD_REGNO_MODE_OK (REGNO (x) + word, mode)
678 && HARD_REGNO_MODE_OK (REGNO (x), GET_MODE (x)))
680 else if (REGNO (x) < FIRST_PSEUDO_REGISTER
681 /* integrate.c can't handle parts of a return value register. */
682 && (! REG_FUNCTION_VALUE_P (x)
683 || ! rtx_equal_function_value_matters)
684 /* We want to keep the stack, frame, and arg pointers
686 && x != frame_pointer_rtx
687 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
688 && x != arg_pointer_rtx
690 && x != stack_pointer_rtx)
691 return gen_rtx (REG, mode, REGNO (x) + word);
693 return gen_rtx (SUBREG, mode, x, word);
695 /* If X is a CONST_INT or a CONST_DOUBLE, extract the appropriate bits
696 from the low-order part of the constant. */
697 else if ((GET_MODE_CLASS (mode) == MODE_INT
698 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT)
699 && GET_MODE (x) == VOIDmode
700 && (GET_CODE (x) == CONST_INT || GET_CODE (x) == CONST_DOUBLE))
702 /* If MODE is twice the host word size, X is already the desired
703 representation. Otherwise, if MODE is wider than a word, we can't
704 do this. If MODE is exactly a word, return just one CONST_INT.
705 If MODE is smaller than a word, clear the bits that don't belong
706 in our mode, unless they and our sign bit are all one. So we get
707 either a reasonable negative value or a reasonable unsigned value
710 if (GET_MODE_BITSIZE (mode) >= 2 * HOST_BITS_PER_WIDE_INT)
712 else if (GET_MODE_BITSIZE (mode) > HOST_BITS_PER_WIDE_INT)
714 else if (GET_MODE_BITSIZE (mode) == HOST_BITS_PER_WIDE_INT)
715 return (GET_CODE (x) == CONST_INT ? x
716 : GEN_INT (CONST_DOUBLE_LOW (x)));
719 /* MODE must be narrower than HOST_BITS_PER_INT. */
720 int width = GET_MODE_BITSIZE (mode);
721 HOST_WIDE_INT val = (GET_CODE (x) == CONST_INT ? INTVAL (x)
722 : CONST_DOUBLE_LOW (x));
724 if (((val & ((HOST_WIDE_INT) (-1) << (width - 1)))
725 != ((HOST_WIDE_INT) (-1) << (width - 1))))
726 val &= ((HOST_WIDE_INT) 1 << width) - 1;
728 return (GET_CODE (x) == CONST_INT && INTVAL (x) == val ? x
733 /* If X is an integral constant but we want it in floating-point, it
734 must be the case that we have a union of an integer and a floating-point
735 value. If the machine-parameters allow it, simulate that union here
736 and return the result. The two-word and single-word cases are
739 else if (((HOST_FLOAT_FORMAT == TARGET_FLOAT_FORMAT
740 && HOST_BITS_PER_WIDE_INT == BITS_PER_WORD)
741 || flag_pretend_float)
742 && GET_MODE_CLASS (mode) == MODE_FLOAT
743 && GET_MODE_SIZE (mode) == UNITS_PER_WORD
744 && GET_CODE (x) == CONST_INT
745 && sizeof (float) * HOST_BITS_PER_CHAR == HOST_BITS_PER_WIDE_INT)
746 #ifdef REAL_ARITHMETIC
752 r = REAL_VALUE_FROM_TARGET_SINGLE (i);
753 return CONST_DOUBLE_FROM_REAL_VALUE (r, mode);
757 union {HOST_WIDE_INT i; float d; } u;
760 return CONST_DOUBLE_FROM_REAL_VALUE (u.d, mode);
763 else if (((HOST_FLOAT_FORMAT == TARGET_FLOAT_FORMAT
764 && HOST_BITS_PER_WIDE_INT == BITS_PER_WORD)
765 || flag_pretend_float)
766 && GET_MODE_CLASS (mode) == MODE_FLOAT
767 && GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD
768 && (GET_CODE (x) == CONST_INT || GET_CODE (x) == CONST_DOUBLE)
769 && GET_MODE (x) == VOIDmode
770 && (sizeof (double) * HOST_BITS_PER_CHAR
771 == 2 * HOST_BITS_PER_WIDE_INT))
772 #ifdef REAL_ARITHMETIC
776 HOST_WIDE_INT low, high;
778 if (GET_CODE (x) == CONST_INT)
779 low = INTVAL (x), high = low >> (HOST_BITS_PER_WIDE_INT -1);
781 low = CONST_DOUBLE_LOW (x), high = CONST_DOUBLE_HIGH (x);
783 /* REAL_VALUE_TARGET_DOUBLE takes the addressing order of the
785 if (WORDS_BIG_ENDIAN)
786 i[0] = high, i[1] = low;
788 i[0] = low, i[1] = high;
790 r = REAL_VALUE_FROM_TARGET_DOUBLE (i);
791 return CONST_DOUBLE_FROM_REAL_VALUE (r, mode);
795 union {HOST_WIDE_INT i[2]; double d; } u;
796 HOST_WIDE_INT low, high;
798 if (GET_CODE (x) == CONST_INT)
799 low = INTVAL (x), high = low >> (HOST_BITS_PER_WIDE_INT -1);
801 low = CONST_DOUBLE_LOW (x), high = CONST_DOUBLE_HIGH (x);
803 #ifdef HOST_WORDS_BIG_ENDIAN
804 u.i[0] = high, u.i[1] = low;
806 u.i[0] = low, u.i[1] = high;
809 return CONST_DOUBLE_FROM_REAL_VALUE (u.d, mode);
813 /* We need an extra case for machines where HOST_BITS_PER_WIDE_INT is the
814 same as sizeof (double), such as the alpha. We only handle the
815 REAL_ARITHMETIC case, which is easy. Testing HOST_BITS_PER_WIDE_INT
816 is not strictly necessary, but is done to restrict this code to cases
817 where it is known to work. */
818 #ifdef REAL_ARITHMETIC
819 else if (mode == SFmode
820 && GET_CODE (x) == CONST_INT
821 && GET_MODE_BITSIZE (mode) * 2 == HOST_BITS_PER_WIDE_INT)
827 r = REAL_VALUE_FROM_TARGET_SINGLE (i);
828 return CONST_DOUBLE_FROM_REAL_VALUE (r, mode);
832 /* Similarly, if this is converting a floating-point value into a
833 single-word integer. Only do this is the host and target parameters are
836 else if (((HOST_FLOAT_FORMAT == TARGET_FLOAT_FORMAT
837 && HOST_BITS_PER_WIDE_INT == BITS_PER_WORD)
838 || flag_pretend_float)
839 && (GET_MODE_CLASS (mode) == MODE_INT
840 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT)
841 && GET_CODE (x) == CONST_DOUBLE
842 && GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT
843 && GET_MODE_BITSIZE (mode) == BITS_PER_WORD)
844 return operand_subword (x, word, 0, GET_MODE (x));
846 /* Similarly, if this is converting a floating-point value into a
847 two-word integer, we can do this one word at a time and make an
848 integer. Only do this is the host and target parameters are
851 else if (((HOST_FLOAT_FORMAT == TARGET_FLOAT_FORMAT
852 && HOST_BITS_PER_WIDE_INT == BITS_PER_WORD)
853 || flag_pretend_float)
854 && (GET_MODE_CLASS (mode) == MODE_INT
855 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT)
856 && GET_CODE (x) == CONST_DOUBLE
857 && GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT
858 && GET_MODE_BITSIZE (mode) == 2 * BITS_PER_WORD)
861 = operand_subword (x, word + WORDS_BIG_ENDIAN, 0, GET_MODE (x));
863 = operand_subword (x, word + ! WORDS_BIG_ENDIAN, 0, GET_MODE (x));
865 if (lowpart && GET_CODE (lowpart) == CONST_INT
866 && highpart && GET_CODE (highpart) == CONST_INT)
867 return immed_double_const (INTVAL (lowpart), INTVAL (highpart), mode);
870 /* Otherwise, we can't do this. */
874 /* Return the real part (which has mode MODE) of a complex value X.
875 This always comes at the low address in memory. */
878 gen_realpart (mode, x)
879 enum machine_mode mode;
882 if (GET_CODE (x) == CONCAT && GET_MODE (XEXP (x, 0)) == mode)
884 else if (WORDS_BIG_ENDIAN)
885 return gen_highpart (mode, x);
887 return gen_lowpart (mode, x);
890 /* Return the imaginary part (which has mode MODE) of a complex value X.
891 This always comes at the high address in memory. */
894 gen_imagpart (mode, x)
895 enum machine_mode mode;
898 if (GET_CODE (x) == CONCAT && GET_MODE (XEXP (x, 0)) == mode)
900 else if (WORDS_BIG_ENDIAN)
901 return gen_lowpart (mode, x);
903 return gen_highpart (mode, x);
906 /* Return 1 iff X, assumed to be a SUBREG,
907 refers to the real part of the complex value in its containing reg.
908 Complex values are always stored with the real part in the first word,
909 regardless of WORDS_BIG_ENDIAN. */
912 subreg_realpart_p (x)
915 if (GET_CODE (x) != SUBREG)
918 return SUBREG_WORD (x) == 0;
921 /* Assuming that X is an rtx (e.g., MEM, REG or SUBREG) for a value,
922 return an rtx (MEM, SUBREG, or CONST_INT) that refers to the
923 least-significant part of X.
924 MODE specifies how big a part of X to return;
925 it usually should not be larger than a word.
926 If X is a MEM whose address is a QUEUED, the value may be so also. */
929 gen_lowpart (mode, x)
930 enum machine_mode mode;
933 rtx result = gen_lowpart_common (mode, x);
937 else if (GET_CODE (x) == REG)
939 /* Must be a hard reg that's not valid in MODE. */
940 result = gen_lowpart_common (mode, copy_to_reg (x));
945 else if (GET_CODE (x) == MEM)
947 /* The only additional case we can do is MEM. */
948 register int offset = 0;
949 if (WORDS_BIG_ENDIAN)
950 offset = (MAX (GET_MODE_SIZE (GET_MODE (x)), UNITS_PER_WORD)
951 - MAX (GET_MODE_SIZE (mode), UNITS_PER_WORD));
953 if (BYTES_BIG_ENDIAN)
954 /* Adjust the address so that the address-after-the-data
956 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (mode))
957 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x))));
959 return change_address (x, mode, plus_constant (XEXP (x, 0), offset));
965 /* Like `gen_lowpart', but refer to the most significant part.
966 This is used to access the imaginary part of a complex number. */
969 gen_highpart (mode, x)
970 enum machine_mode mode;
973 /* This case loses if X is a subreg. To catch bugs early,
974 complain if an invalid MODE is used even in other cases. */
975 if (GET_MODE_SIZE (mode) > UNITS_PER_WORD
976 && GET_MODE_SIZE (mode) != GET_MODE_UNIT_SIZE (GET_MODE (x)))
978 if (GET_CODE (x) == CONST_DOUBLE
979 #if !(TARGET_FLOAT_FORMAT != HOST_FLOAT_FORMAT || defined (REAL_IS_NOT_DOUBLE))
980 && GET_MODE_CLASS (GET_MODE (x)) != MODE_FLOAT
983 return gen_rtx (CONST_INT, VOIDmode,
984 CONST_DOUBLE_HIGH (x) & GET_MODE_MASK (mode));
985 else if (GET_CODE (x) == CONST_INT)
987 else if (GET_CODE (x) == MEM)
989 register int offset = 0;
990 if (! WORDS_BIG_ENDIAN)
991 offset = (MAX (GET_MODE_SIZE (GET_MODE (x)), UNITS_PER_WORD)
992 - MAX (GET_MODE_SIZE (mode), UNITS_PER_WORD));
994 if (! BYTES_BIG_ENDIAN
995 && GET_MODE_SIZE (mode) < UNITS_PER_WORD)
996 offset -= (GET_MODE_SIZE (mode)
997 - MIN (UNITS_PER_WORD,
998 GET_MODE_SIZE (GET_MODE (x))));
1000 return change_address (x, mode, plus_constant (XEXP (x, 0), offset));
1002 else if (GET_CODE (x) == SUBREG)
1004 /* The only time this should occur is when we are looking at a
1005 multi-word item with a SUBREG whose mode is the same as that of the
1006 item. It isn't clear what we would do if it wasn't. */
1007 if (SUBREG_WORD (x) != 0)
1009 return gen_highpart (mode, SUBREG_REG (x));
1011 else if (GET_CODE (x) == REG)
1015 if (! WORDS_BIG_ENDIAN
1016 && GET_MODE_SIZE (GET_MODE (x)) > UNITS_PER_WORD)
1017 word = ((GET_MODE_SIZE (GET_MODE (x))
1018 - MAX (GET_MODE_SIZE (mode), UNITS_PER_WORD))
1022 * ??? This fails miserably for complex values being passed in registers
1023 * where the sizeof the real and imaginary part are not equal to the
1024 * sizeof SImode. FIXME
1027 if (REGNO (x) < FIRST_PSEUDO_REGISTER
1028 /* integrate.c can't handle parts of a return value register. */
1029 && (! REG_FUNCTION_VALUE_P (x)
1030 || ! rtx_equal_function_value_matters)
1031 /* We want to keep the stack, frame, and arg pointers special. */
1032 && x != frame_pointer_rtx
1033 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
1034 && x != arg_pointer_rtx
1036 && x != stack_pointer_rtx)
1037 return gen_rtx (REG, mode, REGNO (x) + word);
1039 return gen_rtx (SUBREG, mode, x, word);
1045 /* Return 1 iff X, assumed to be a SUBREG,
1046 refers to the least significant part of its containing reg.
1047 If X is not a SUBREG, always return 1 (it is its own low part!). */
1050 subreg_lowpart_p (x)
1053 if (GET_CODE (x) != SUBREG)
1055 else if (GET_MODE (SUBREG_REG (x)) == VOIDmode)
1058 if (WORDS_BIG_ENDIAN
1059 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))) > UNITS_PER_WORD)
1060 return (SUBREG_WORD (x)
1061 == ((GET_MODE_SIZE (GET_MODE (SUBREG_REG (x)))
1062 - MAX (GET_MODE_SIZE (GET_MODE (x)), UNITS_PER_WORD))
1065 return SUBREG_WORD (x) == 0;
1068 /* Return subword I of operand OP.
1069 The word number, I, is interpreted as the word number starting at the
1070 low-order address. Word 0 is the low-order word if not WORDS_BIG_ENDIAN,
1071 otherwise it is the high-order word.
1073 If we cannot extract the required word, we return zero. Otherwise, an
1074 rtx corresponding to the requested word will be returned.
1076 VALIDATE_ADDRESS is nonzero if the address should be validated. Before
1077 reload has completed, a valid address will always be returned. After
1078 reload, if a valid address cannot be returned, we return zero.
1080 If VALIDATE_ADDRESS is zero, we simply form the required address; validating
1081 it is the responsibility of the caller.
1083 MODE is the mode of OP in case it is a CONST_INT. */
1086 operand_subword (op, i, validate_address, mode)
1089 int validate_address;
1090 enum machine_mode mode;
1093 int size_ratio = HOST_BITS_PER_WIDE_INT / BITS_PER_WORD;
1095 if (mode == VOIDmode)
1096 mode = GET_MODE (op);
1098 if (mode == VOIDmode)
1101 /* If OP is narrower than a word or if we want a word outside OP, fail. */
1103 && (GET_MODE_SIZE (mode) < UNITS_PER_WORD
1104 || (i + 1) * UNITS_PER_WORD > GET_MODE_SIZE (mode)))
1107 /* If OP is already an integer word, return it. */
1108 if (GET_MODE_CLASS (mode) == MODE_INT
1109 && GET_MODE_SIZE (mode) == UNITS_PER_WORD)
1112 /* If OP is a REG or SUBREG, we can handle it very simply. */
1113 if (GET_CODE (op) == REG)
1115 /* If the register is not valid for MODE, return 0. If we don't
1116 do this, there is no way to fix up the resulting REG later. */
1117 if (REGNO (op) < FIRST_PSEUDO_REGISTER
1118 && ! HARD_REGNO_MODE_OK (REGNO (op) + i, word_mode))
1120 else if (REGNO (op) >= FIRST_PSEUDO_REGISTER
1121 || (REG_FUNCTION_VALUE_P (op)
1122 && rtx_equal_function_value_matters)
1123 /* We want to keep the stack, frame, and arg pointers
1125 || op == frame_pointer_rtx
1126 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
1127 || op == arg_pointer_rtx
1129 || op == stack_pointer_rtx)
1130 return gen_rtx (SUBREG, word_mode, op, i);
1132 return gen_rtx (REG, word_mode, REGNO (op) + i);
1134 else if (GET_CODE (op) == SUBREG)
1135 return gen_rtx (SUBREG, word_mode, SUBREG_REG (op), i + SUBREG_WORD (op));
1136 else if (GET_CODE (op) == CONCAT)
1138 int partwords = GET_MODE_UNIT_SIZE (GET_MODE (op)) / UNITS_PER_WORD;
1140 return operand_subword (XEXP (op, 0), i, validate_address, mode);
1141 return operand_subword (XEXP (op, 1), i - partwords,
1142 validate_address, mode);
1145 /* Form a new MEM at the requested address. */
1146 if (GET_CODE (op) == MEM)
1148 rtx addr = plus_constant (XEXP (op, 0), i * UNITS_PER_WORD);
1151 if (validate_address)
1153 if (reload_completed)
1155 if (! strict_memory_address_p (word_mode, addr))
1159 addr = memory_address (word_mode, addr);
1162 new = gen_rtx (MEM, word_mode, addr);
1164 MEM_VOLATILE_P (new) = MEM_VOLATILE_P (op);
1165 MEM_IN_STRUCT_P (new) = MEM_IN_STRUCT_P (op);
1166 RTX_UNCHANGING_P (new) = RTX_UNCHANGING_P (op);
1171 /* The only remaining cases are when OP is a constant. If the host and
1172 target floating formats are the same, handling two-word floating
1173 constants are easy. Note that REAL_VALUE_TO_TARGET_{SINGLE,DOUBLE}
1174 are defined as returning one or two 32 bit values, respectively,
1175 and not values of BITS_PER_WORD bits. */
1176 #ifdef REAL_ARITHMETIC
1177 /* The output is some bits, the width of the target machine's word.
1178 A wider-word host can surely hold them in a CONST_INT. A narrower-word
1180 if (HOST_BITS_PER_WIDE_INT >= BITS_PER_WORD
1181 && GET_MODE_CLASS (mode) == MODE_FLOAT
1182 && GET_MODE_BITSIZE (mode) == 64
1183 && GET_CODE (op) == CONST_DOUBLE)
1188 REAL_VALUE_FROM_CONST_DOUBLE (rv, op);
1189 REAL_VALUE_TO_TARGET_DOUBLE (rv, k);
1191 /* We handle 32-bit and >= 64-bit words here. Note that the order in
1192 which the words are written depends on the word endianness.
1194 ??? This is a potential portability problem and should
1195 be fixed at some point. */
1196 if (BITS_PER_WORD == 32)
1197 return GEN_INT ((HOST_WIDE_INT) k[i]);
1198 #if HOST_BITS_PER_WIDE_INT > 32
1199 else if (BITS_PER_WORD >= 64 && i == 0)
1200 return GEN_INT ((((HOST_WIDE_INT) k[! WORDS_BIG_ENDIAN]) << 32)
1201 | (HOST_WIDE_INT) k[WORDS_BIG_ENDIAN]);
1203 else if (BITS_PER_WORD == 16)
1210 return GEN_INT ((HOST_WIDE_INT) value);
1215 else if (HOST_BITS_PER_WIDE_INT >= BITS_PER_WORD
1216 && GET_MODE_CLASS (mode) == MODE_FLOAT
1217 && GET_MODE_BITSIZE (mode) > 64
1218 && GET_CODE (op) == CONST_DOUBLE)
1223 REAL_VALUE_FROM_CONST_DOUBLE (rv, op);
1224 REAL_VALUE_TO_TARGET_LONG_DOUBLE (rv, k);
1226 if (BITS_PER_WORD == 32)
1227 return GEN_INT ((HOST_WIDE_INT) k[i]);
1229 #else /* no REAL_ARITHMETIC */
1230 if (((HOST_FLOAT_FORMAT == TARGET_FLOAT_FORMAT
1231 && HOST_BITS_PER_WIDE_INT == BITS_PER_WORD)
1232 || flag_pretend_float)
1233 && GET_MODE_CLASS (mode) == MODE_FLOAT
1234 && GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD
1235 && GET_CODE (op) == CONST_DOUBLE)
1237 /* The constant is stored in the host's word-ordering,
1238 but we want to access it in the target's word-ordering. Some
1239 compilers don't like a conditional inside macro args, so we have two
1240 copies of the return. */
1241 #ifdef HOST_WORDS_BIG_ENDIAN
1242 return GEN_INT (i == WORDS_BIG_ENDIAN
1243 ? CONST_DOUBLE_HIGH (op) : CONST_DOUBLE_LOW (op));
1245 return GEN_INT (i != WORDS_BIG_ENDIAN
1246 ? CONST_DOUBLE_HIGH (op) : CONST_DOUBLE_LOW (op));
1249 #endif /* no REAL_ARITHMETIC */
1251 /* Single word float is a little harder, since single- and double-word
1252 values often do not have the same high-order bits. We have already
1253 verified that we want the only defined word of the single-word value. */
1254 #ifdef REAL_ARITHMETIC
1255 if (GET_MODE_CLASS (mode) == MODE_FLOAT
1256 && GET_MODE_BITSIZE (mode) == 32
1257 && GET_CODE (op) == CONST_DOUBLE)
1262 REAL_VALUE_FROM_CONST_DOUBLE (rv, op);
1263 REAL_VALUE_TO_TARGET_SINGLE (rv, l);
1264 return GEN_INT ((HOST_WIDE_INT) l);
1267 if (((HOST_FLOAT_FORMAT == TARGET_FLOAT_FORMAT
1268 && HOST_BITS_PER_WIDE_INT == BITS_PER_WORD)
1269 || flag_pretend_float)
1270 && sizeof (float) * 8 == HOST_BITS_PER_WIDE_INT
1271 && GET_MODE_CLASS (mode) == MODE_FLOAT
1272 && GET_MODE_SIZE (mode) == UNITS_PER_WORD
1273 && GET_CODE (op) == CONST_DOUBLE)
1276 union {float f; HOST_WIDE_INT i; } u;
1278 REAL_VALUE_FROM_CONST_DOUBLE (d, op);
1281 return GEN_INT (u.i);
1283 if (((HOST_FLOAT_FORMAT == TARGET_FLOAT_FORMAT
1284 && HOST_BITS_PER_WIDE_INT == BITS_PER_WORD)
1285 || flag_pretend_float)
1286 && sizeof (double) * 8 == HOST_BITS_PER_WIDE_INT
1287 && GET_MODE_CLASS (mode) == MODE_FLOAT
1288 && GET_MODE_SIZE (mode) == UNITS_PER_WORD
1289 && GET_CODE (op) == CONST_DOUBLE)
1292 union {double d; HOST_WIDE_INT i; } u;
1294 REAL_VALUE_FROM_CONST_DOUBLE (d, op);
1297 return GEN_INT (u.i);
1299 #endif /* no REAL_ARITHMETIC */
1301 /* The only remaining cases that we can handle are integers.
1302 Convert to proper endianness now since these cases need it.
1303 At this point, i == 0 means the low-order word.
1305 We do not want to handle the case when BITS_PER_WORD <= HOST_BITS_PER_INT
1306 in general. However, if OP is (const_int 0), we can just return
1309 if (op == const0_rtx)
1312 if (GET_MODE_CLASS (mode) != MODE_INT
1313 || (GET_CODE (op) != CONST_INT && GET_CODE (op) != CONST_DOUBLE)
1314 || BITS_PER_WORD > HOST_BITS_PER_WIDE_INT)
1317 if (WORDS_BIG_ENDIAN)
1318 i = GET_MODE_SIZE (mode) / UNITS_PER_WORD - 1 - i;
1320 /* Find out which word on the host machine this value is in and get
1321 it from the constant. */
1322 val = (i / size_ratio == 0
1323 ? (GET_CODE (op) == CONST_INT ? INTVAL (op) : CONST_DOUBLE_LOW (op))
1324 : (GET_CODE (op) == CONST_INT
1325 ? (INTVAL (op) < 0 ? ~0 : 0) : CONST_DOUBLE_HIGH (op)));
1327 /* If BITS_PER_WORD is smaller than an int, get the appropriate bits. */
1328 if (BITS_PER_WORD < HOST_BITS_PER_WIDE_INT)
1329 val = ((val >> ((i % size_ratio) * BITS_PER_WORD))
1330 & (((HOST_WIDE_INT) 1
1331 << (BITS_PER_WORD % HOST_BITS_PER_WIDE_INT)) - 1));
1333 return GEN_INT (val);
1336 /* Similar to `operand_subword', but never return 0. If we can't extract
1337 the required subword, put OP into a register and try again. If that fails,
1338 abort. We always validate the address in this case. It is not valid
1339 to call this function after reload; it is mostly meant for RTL
1342 MODE is the mode of OP, in case it is CONST_INT. */
1345 operand_subword_force (op, i, mode)
1348 enum machine_mode mode;
1350 rtx result = operand_subword (op, i, 1, mode);
1355 if (mode != BLKmode && mode != VOIDmode)
1356 op = force_reg (mode, op);
1358 result = operand_subword (op, i, 1, mode);
1365 /* Given a compare instruction, swap the operands.
1366 A test instruction is changed into a compare of 0 against the operand. */
1369 reverse_comparison (insn)
1372 rtx body = PATTERN (insn);
1375 if (GET_CODE (body) == SET)
1376 comp = SET_SRC (body);
1378 comp = SET_SRC (XVECEXP (body, 0, 0));
1380 if (GET_CODE (comp) == COMPARE)
1382 rtx op0 = XEXP (comp, 0);
1383 rtx op1 = XEXP (comp, 1);
1384 XEXP (comp, 0) = op1;
1385 XEXP (comp, 1) = op0;
1389 rtx new = gen_rtx (COMPARE, VOIDmode,
1390 CONST0_RTX (GET_MODE (comp)), comp);
1391 if (GET_CODE (body) == SET)
1392 SET_SRC (body) = new;
1394 SET_SRC (XVECEXP (body, 0, 0)) = new;
1398 /* Return a memory reference like MEMREF, but with its mode changed
1399 to MODE and its address changed to ADDR.
1400 (VOIDmode means don't change the mode.
1401 NULL for ADDR means don't change the address.) */
1404 change_address (memref, mode, addr)
1406 enum machine_mode mode;
1411 if (GET_CODE (memref) != MEM)
1413 if (mode == VOIDmode)
1414 mode = GET_MODE (memref);
1416 addr = XEXP (memref, 0);
1418 /* If reload is in progress or has completed, ADDR must be valid.
1419 Otherwise, we can call memory_address to make it valid. */
1420 if (reload_completed || reload_in_progress)
1422 if (! memory_address_p (mode, addr))
1426 addr = memory_address (mode, addr);
1428 if (rtx_equal_p (addr, XEXP (memref, 0)) && mode == GET_MODE (memref))
1431 new = gen_rtx (MEM, mode, addr);
1432 MEM_VOLATILE_P (new) = MEM_VOLATILE_P (memref);
1433 RTX_UNCHANGING_P (new) = RTX_UNCHANGING_P (memref);
1434 MEM_IN_STRUCT_P (new) = MEM_IN_STRUCT_P (memref);
1438 /* Return a newly created CODE_LABEL rtx with a unique label number. */
1445 label = (output_bytecode
1446 ? gen_rtx (CODE_LABEL, VOIDmode, NULL, bc_get_bytecode_label ())
1447 : gen_rtx (CODE_LABEL, VOIDmode, 0, NULL_RTX,
1448 NULL_RTX, label_num++, NULL_PTR));
1450 LABEL_NUSES (label) = 0;
1454 /* For procedure integration. */
1456 /* Return a newly created INLINE_HEADER rtx. Should allocate this
1457 from a permanent obstack when the opportunity arises. */
1460 gen_inline_header_rtx (first_insn, first_parm_insn, first_labelno,
1461 last_labelno, max_parm_regnum, max_regnum, args_size,
1462 pops_args, stack_slots, forced_labels, function_flags,
1463 outgoing_args_size, original_arg_vector,
1464 original_decl_initial, regno_rtx, regno_flag,
1466 rtx first_insn, first_parm_insn;
1467 int first_labelno, last_labelno, max_parm_regnum, max_regnum, args_size;
1472 int outgoing_args_size;
1473 rtvec original_arg_vector;
1474 rtx original_decl_initial;
1479 rtx header = gen_rtx (INLINE_HEADER, VOIDmode,
1480 cur_insn_uid++, NULL_RTX,
1481 first_insn, first_parm_insn,
1482 first_labelno, last_labelno,
1483 max_parm_regnum, max_regnum, args_size, pops_args,
1484 stack_slots, forced_labels, function_flags,
1485 outgoing_args_size, original_arg_vector,
1486 original_decl_initial,
1487 regno_rtx, regno_flag, regno_align);
1491 /* Install new pointers to the first and last insns in the chain.
1492 Also, set cur_insn_uid to one higher than the last in use.
1493 Used for an inline-procedure after copying the insn chain. */
1496 set_new_first_and_last_insn (first, last)
1505 for (insn = first; insn; insn = NEXT_INSN (insn))
1506 cur_insn_uid = MAX (cur_insn_uid, INSN_UID (insn));
1511 /* Set the range of label numbers found in the current function.
1512 This is used when belatedly compiling an inline function. */
1515 set_new_first_and_last_label_num (first, last)
1518 base_label_num = label_num;
1519 first_label_num = first;
1520 last_label_num = last;
1523 /* Save all variables describing the current status into the structure *P.
1524 This is used before starting a nested function. */
1527 save_emit_status (p)
1530 p->reg_rtx_no = reg_rtx_no;
1531 p->first_label_num = first_label_num;
1532 p->first_insn = first_insn;
1533 p->last_insn = last_insn;
1534 p->sequence_rtl_expr = sequence_rtl_expr;
1535 p->sequence_stack = sequence_stack;
1536 p->cur_insn_uid = cur_insn_uid;
1537 p->last_linenum = last_linenum;
1538 p->last_filename = last_filename;
1539 p->regno_pointer_flag = regno_pointer_flag;
1540 p->regno_pointer_align = regno_pointer_align;
1541 p->regno_pointer_flag_length = regno_pointer_flag_length;
1542 p->regno_reg_rtx = regno_reg_rtx;
1545 /* Restore all variables describing the current status from the structure *P.
1546 This is used after a nested function. */
1549 restore_emit_status (p)
1554 reg_rtx_no = p->reg_rtx_no;
1555 first_label_num = p->first_label_num;
1557 first_insn = p->first_insn;
1558 last_insn = p->last_insn;
1559 sequence_rtl_expr = p->sequence_rtl_expr;
1560 sequence_stack = p->sequence_stack;
1561 cur_insn_uid = p->cur_insn_uid;
1562 last_linenum = p->last_linenum;
1563 last_filename = p->last_filename;
1564 regno_pointer_flag = p->regno_pointer_flag;
1565 regno_pointer_align = p->regno_pointer_align;
1566 regno_pointer_flag_length = p->regno_pointer_flag_length;
1567 regno_reg_rtx = p->regno_reg_rtx;
1569 /* Clear our cache of rtx expressions for start_sequence and
1571 sequence_element_free_list = 0;
1572 for (i = 0; i < SEQUENCE_RESULT_SIZE; i++)
1573 sequence_result[i] = 0;
1578 /* Go through all the RTL insn bodies and copy any invalid shared structure.
1579 It does not work to do this twice, because the mark bits set here
1580 are not cleared afterwards. */
1583 unshare_all_rtl (insn)
1586 for (; insn; insn = NEXT_INSN (insn))
1587 if (GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN
1588 || GET_CODE (insn) == CALL_INSN)
1590 PATTERN (insn) = copy_rtx_if_shared (PATTERN (insn));
1591 REG_NOTES (insn) = copy_rtx_if_shared (REG_NOTES (insn));
1592 LOG_LINKS (insn) = copy_rtx_if_shared (LOG_LINKS (insn));
1595 /* Make sure the addresses of stack slots found outside the insn chain
1596 (such as, in DECL_RTL of a variable) are not shared
1597 with the insn chain.
1599 This special care is necessary when the stack slot MEM does not
1600 actually appear in the insn chain. If it does appear, its address
1601 is unshared from all else at that point. */
1603 copy_rtx_if_shared (stack_slot_list);
1606 /* Mark ORIG as in use, and return a copy of it if it was already in use.
1607 Recursively does the same for subexpressions. */
1610 copy_rtx_if_shared (orig)
1613 register rtx x = orig;
1615 register enum rtx_code code;
1616 register char *format_ptr;
1622 code = GET_CODE (x);
1624 /* These types may be freely shared. */
1637 /* SCRATCH must be shared because they represent distinct values. */
1641 /* CONST can be shared if it contains a SYMBOL_REF. If it contains
1642 a LABEL_REF, it isn't sharable. */
1643 if (GET_CODE (XEXP (x, 0)) == PLUS
1644 && GET_CODE (XEXP (XEXP (x, 0), 0)) == SYMBOL_REF
1645 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT)
1654 /* The chain of insns is not being copied. */
1658 /* A MEM is allowed to be shared if its address is constant
1659 or is a constant plus one of the special registers. */
1660 if (CONSTANT_ADDRESS_P (XEXP (x, 0))
1661 || XEXP (x, 0) == virtual_stack_vars_rtx
1662 || XEXP (x, 0) == virtual_incoming_args_rtx)
1665 if (GET_CODE (XEXP (x, 0)) == PLUS
1666 && (XEXP (XEXP (x, 0), 0) == virtual_stack_vars_rtx
1667 || XEXP (XEXP (x, 0), 0) == virtual_incoming_args_rtx)
1668 && CONSTANT_ADDRESS_P (XEXP (XEXP (x, 0), 1)))
1670 /* This MEM can appear in more than one place,
1671 but its address better not be shared with anything else. */
1673 XEXP (x, 0) = copy_rtx_if_shared (XEXP (x, 0));
1679 /* This rtx may not be shared. If it has already been seen,
1680 replace it with a copy of itself. */
1686 copy = rtx_alloc (code);
1687 bcopy ((char *) x, (char *) copy,
1688 (sizeof (*copy) - sizeof (copy->fld)
1689 + sizeof (copy->fld[0]) * GET_RTX_LENGTH (code)));
1695 /* Now scan the subexpressions recursively.
1696 We can store any replaced subexpressions directly into X
1697 since we know X is not shared! Any vectors in X
1698 must be copied if X was copied. */
1700 format_ptr = GET_RTX_FORMAT (code);
1702 for (i = 0; i < GET_RTX_LENGTH (code); i++)
1704 switch (*format_ptr++)
1707 XEXP (x, i) = copy_rtx_if_shared (XEXP (x, i));
1711 if (XVEC (x, i) != NULL)
1714 int len = XVECLEN (x, i);
1716 if (copied && len > 0)
1717 XVEC (x, i) = gen_rtvec_vv (len, XVEC (x, i)->elem);
1718 for (j = 0; j < len; j++)
1719 XVECEXP (x, i, j) = copy_rtx_if_shared (XVECEXP (x, i, j));
1727 /* Clear all the USED bits in X to allow copy_rtx_if_shared to be used
1728 to look for shared sub-parts. */
1731 reset_used_flags (x)
1735 register enum rtx_code code;
1736 register char *format_ptr;
1741 code = GET_CODE (x);
1743 /* These types may be freely shared so we needn't do any resetting
1764 /* The chain of insns is not being copied. */
1770 format_ptr = GET_RTX_FORMAT (code);
1771 for (i = 0; i < GET_RTX_LENGTH (code); i++)
1773 switch (*format_ptr++)
1776 reset_used_flags (XEXP (x, i));
1780 for (j = 0; j < XVECLEN (x, i); j++)
1781 reset_used_flags (XVECEXP (x, i, j));
1787 /* Copy X if necessary so that it won't be altered by changes in OTHER.
1788 Return X or the rtx for the pseudo reg the value of X was copied into.
1789 OTHER must be valid as a SET_DEST. */
1792 make_safe_from (x, other)
1796 switch (GET_CODE (other))
1799 other = SUBREG_REG (other);
1801 case STRICT_LOW_PART:
1804 other = XEXP (other, 0);
1810 if ((GET_CODE (other) == MEM
1812 && GET_CODE (x) != REG
1813 && GET_CODE (x) != SUBREG)
1814 || (GET_CODE (other) == REG
1815 && (REGNO (other) < FIRST_PSEUDO_REGISTER
1816 || reg_mentioned_p (other, x))))
1818 rtx temp = gen_reg_rtx (GET_MODE (x));
1819 emit_move_insn (temp, x);
1825 /* Emission of insns (adding them to the doubly-linked list). */
1827 /* Return the first insn of the current sequence or current function. */
1835 /* Return the last insn emitted in current sequence or current function. */
1843 /* Specify a new insn as the last in the chain. */
1846 set_last_insn (insn)
1849 if (NEXT_INSN (insn) != 0)
1854 /* Return the last insn emitted, even if it is in a sequence now pushed. */
1857 get_last_insn_anywhere ()
1859 struct sequence_stack *stack;
1862 for (stack = sequence_stack; stack; stack = stack->next)
1863 if (stack->last != 0)
1868 /* Return a number larger than any instruction's uid in this function. */
1873 return cur_insn_uid;
1876 /* Return the next insn. If it is a SEQUENCE, return the first insn
1885 insn = NEXT_INSN (insn);
1886 if (insn && GET_CODE (insn) == INSN
1887 && GET_CODE (PATTERN (insn)) == SEQUENCE)
1888 insn = XVECEXP (PATTERN (insn), 0, 0);
1894 /* Return the previous insn. If it is a SEQUENCE, return the last insn
1898 previous_insn (insn)
1903 insn = PREV_INSN (insn);
1904 if (insn && GET_CODE (insn) == INSN
1905 && GET_CODE (PATTERN (insn)) == SEQUENCE)
1906 insn = XVECEXP (PATTERN (insn), 0, XVECLEN (PATTERN (insn), 0) - 1);
1912 /* Return the next insn after INSN that is not a NOTE. This routine does not
1913 look inside SEQUENCEs. */
1916 next_nonnote_insn (insn)
1921 insn = NEXT_INSN (insn);
1922 if (insn == 0 || GET_CODE (insn) != NOTE)
1929 /* Return the previous insn before INSN that is not a NOTE. This routine does
1930 not look inside SEQUENCEs. */
1933 prev_nonnote_insn (insn)
1938 insn = PREV_INSN (insn);
1939 if (insn == 0 || GET_CODE (insn) != NOTE)
1946 /* Return the next INSN, CALL_INSN or JUMP_INSN after INSN;
1947 or 0, if there is none. This routine does not look inside
1951 next_real_insn (insn)
1956 insn = NEXT_INSN (insn);
1957 if (insn == 0 || GET_CODE (insn) == INSN
1958 || GET_CODE (insn) == CALL_INSN || GET_CODE (insn) == JUMP_INSN)
1965 /* Return the last INSN, CALL_INSN or JUMP_INSN before INSN;
1966 or 0, if there is none. This routine does not look inside
1970 prev_real_insn (insn)
1975 insn = PREV_INSN (insn);
1976 if (insn == 0 || GET_CODE (insn) == INSN || GET_CODE (insn) == CALL_INSN
1977 || GET_CODE (insn) == JUMP_INSN)
1984 /* Find the next insn after INSN that really does something. This routine
1985 does not look inside SEQUENCEs. Until reload has completed, this is the
1986 same as next_real_insn. */
1989 next_active_insn (insn)
1994 insn = NEXT_INSN (insn);
1996 || GET_CODE (insn) == CALL_INSN || GET_CODE (insn) == JUMP_INSN
1997 || (GET_CODE (insn) == INSN
1998 && (! reload_completed
1999 || (GET_CODE (PATTERN (insn)) != USE
2000 && GET_CODE (PATTERN (insn)) != CLOBBER))))
2007 /* Find the last insn before INSN that really does something. This routine
2008 does not look inside SEQUENCEs. Until reload has completed, this is the
2009 same as prev_real_insn. */
2012 prev_active_insn (insn)
2017 insn = PREV_INSN (insn);
2019 || GET_CODE (insn) == CALL_INSN || GET_CODE (insn) == JUMP_INSN
2020 || (GET_CODE (insn) == INSN
2021 && (! reload_completed
2022 || (GET_CODE (PATTERN (insn)) != USE
2023 && GET_CODE (PATTERN (insn)) != CLOBBER))))
2030 /* Return the next CODE_LABEL after the insn INSN, or 0 if there is none. */
2038 insn = NEXT_INSN (insn);
2039 if (insn == 0 || GET_CODE (insn) == CODE_LABEL)
2046 /* Return the last CODE_LABEL before the insn INSN, or 0 if there is none. */
2054 insn = PREV_INSN (insn);
2055 if (insn == 0 || GET_CODE (insn) == CODE_LABEL)
2063 /* INSN uses CC0 and is being moved into a delay slot. Set up REG_CC_SETTER
2064 and REG_CC_USER notes so we can find it. */
2067 link_cc0_insns (insn)
2070 rtx user = next_nonnote_insn (insn);
2072 if (GET_CODE (user) == INSN && GET_CODE (PATTERN (user)) == SEQUENCE)
2073 user = XVECEXP (PATTERN (user), 0, 0);
2075 REG_NOTES (user) = gen_rtx (INSN_LIST, REG_CC_SETTER, insn,
2077 REG_NOTES (insn) = gen_rtx (INSN_LIST, REG_CC_USER, user, REG_NOTES (insn));
2080 /* Return the next insn that uses CC0 after INSN, which is assumed to
2081 set it. This is the inverse of prev_cc0_setter (i.e., prev_cc0_setter
2082 applied to the result of this function should yield INSN).
2084 Normally, this is simply the next insn. However, if a REG_CC_USER note
2085 is present, it contains the insn that uses CC0.
2087 Return 0 if we can't find the insn. */
2090 next_cc0_user (insn)
2093 rtx note = find_reg_note (insn, REG_CC_USER, NULL_RTX);
2096 return XEXP (note, 0);
2098 insn = next_nonnote_insn (insn);
2099 if (insn && GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
2100 insn = XVECEXP (PATTERN (insn), 0, 0);
2102 if (insn && GET_RTX_CLASS (GET_CODE (insn)) == 'i'
2103 && reg_mentioned_p (cc0_rtx, PATTERN (insn)))
2109 /* Find the insn that set CC0 for INSN. Unless INSN has a REG_CC_SETTER
2110 note, it is the previous insn. */
2113 prev_cc0_setter (insn)
2116 rtx note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
2120 return XEXP (note, 0);
2122 insn = prev_nonnote_insn (insn);
2123 if (! sets_cc0_p (PATTERN (insn)))
2130 /* Try splitting insns that can be split for better scheduling.
2131 PAT is the pattern which might split.
2132 TRIAL is the insn providing PAT.
2133 LAST is non-zero if we should return the last insn of the sequence produced.
2135 If this routine succeeds in splitting, it returns the first or last
2136 replacement insn depending on the value of LAST. Otherwise, it
2137 returns TRIAL. If the insn to be returned can be split, it will be. */
2140 try_split (pat, trial, last)
2144 rtx before = PREV_INSN (trial);
2145 rtx after = NEXT_INSN (trial);
2146 rtx seq = split_insns (pat, trial);
2147 int has_barrier = 0;
2150 /* If we are splitting a JUMP_INSN, it might be followed by a BARRIER.
2151 We may need to handle this specially. */
2152 if (after && GET_CODE (after) == BARRIER)
2155 after = NEXT_INSN (after);
2160 /* SEQ can either be a SEQUENCE or the pattern of a single insn.
2161 The latter case will normally arise only when being done so that
2162 it, in turn, will be split (SFmode on the 29k is an example). */
2163 if (GET_CODE (seq) == SEQUENCE)
2165 /* If we are splitting a JUMP_INSN, look for the JUMP_INSN in
2166 SEQ and copy our JUMP_LABEL to it. If JUMP_LABEL is non-zero,
2167 increment the usage count so we don't delete the label. */
2170 if (GET_CODE (trial) == JUMP_INSN)
2171 for (i = XVECLEN (seq, 0) - 1; i >= 0; i--)
2172 if (GET_CODE (XVECEXP (seq, 0, i)) == JUMP_INSN)
2174 JUMP_LABEL (XVECEXP (seq, 0, i)) = JUMP_LABEL (trial);
2176 if (JUMP_LABEL (trial))
2177 LABEL_NUSES (JUMP_LABEL (trial))++;
2180 tem = emit_insn_after (seq, before);
2182 delete_insn (trial);
2184 emit_barrier_after (tem);
2186 /* Recursively call try_split for each new insn created; by the
2187 time control returns here that insn will be fully split, so
2188 set LAST and continue from the insn after the one returned.
2189 We can't use next_active_insn here since AFTER may be a note.
2190 Ignore deleted insns, which can be occur if not optimizing. */
2191 for (tem = NEXT_INSN (before); tem != after;
2192 tem = NEXT_INSN (tem))
2193 if (! INSN_DELETED_P (tem))
2194 tem = try_split (PATTERN (tem), tem, 1);
2196 /* Avoid infinite loop if the result matches the original pattern. */
2197 else if (rtx_equal_p (seq, pat))
2201 PATTERN (trial) = seq;
2202 INSN_CODE (trial) = -1;
2203 try_split (seq, trial, last);
2206 /* Return either the first or the last insn, depending on which was
2208 return last ? prev_active_insn (after) : next_active_insn (before);
2214 /* Make and return an INSN rtx, initializing all its slots.
2215 Store PATTERN in the pattern slots. */
2218 make_insn_raw (pattern)
2223 /* If in RTL generation phase, see if FREE_INSN can be used. */
2224 if (free_insn != 0 && rtx_equal_function_value_matters)
2227 free_insn = NEXT_INSN (free_insn);
2228 PUT_CODE (insn, INSN);
2231 insn = rtx_alloc (INSN);
2233 INSN_UID (insn) = cur_insn_uid++;
2234 PATTERN (insn) = pattern;
2235 INSN_CODE (insn) = -1;
2236 LOG_LINKS (insn) = NULL;
2237 REG_NOTES (insn) = NULL;
2242 /* Like `make_insn' but make a JUMP_INSN instead of an insn. */
2245 make_jump_insn_raw (pattern)
2250 insn = rtx_alloc (JUMP_INSN);
2251 INSN_UID (insn) = cur_insn_uid++;
2253 PATTERN (insn) = pattern;
2254 INSN_CODE (insn) = -1;
2255 LOG_LINKS (insn) = NULL;
2256 REG_NOTES (insn) = NULL;
2257 JUMP_LABEL (insn) = NULL;
2262 /* Like `make_insn' but make a CALL_INSN instead of an insn. */
2265 make_call_insn_raw (pattern)
2270 insn = rtx_alloc (CALL_INSN);
2271 INSN_UID (insn) = cur_insn_uid++;
2273 PATTERN (insn) = pattern;
2274 INSN_CODE (insn) = -1;
2275 LOG_LINKS (insn) = NULL;
2276 REG_NOTES (insn) = NULL;
2277 CALL_INSN_FUNCTION_USAGE (insn) = NULL;
2282 /* Add INSN to the end of the doubly-linked list.
2283 INSN may be an INSN, JUMP_INSN, CALL_INSN, CODE_LABEL, BARRIER or NOTE. */
2289 PREV_INSN (insn) = last_insn;
2290 NEXT_INSN (insn) = 0;
2292 if (NULL != last_insn)
2293 NEXT_INSN (last_insn) = insn;
2295 if (NULL == first_insn)
2301 /* Add INSN into the doubly-linked list after insn AFTER. This and
2302 the next should be the only functions called to insert an insn once
2303 delay slots have been filled since only they know how to update a
2307 add_insn_after (insn, after)
2310 rtx next = NEXT_INSN (after);
2312 if (optimize && INSN_DELETED_P (after))
2315 NEXT_INSN (insn) = next;
2316 PREV_INSN (insn) = after;
2320 PREV_INSN (next) = insn;
2321 if (GET_CODE (next) == INSN && GET_CODE (PATTERN (next)) == SEQUENCE)
2322 PREV_INSN (XVECEXP (PATTERN (next), 0, 0)) = insn;
2324 else if (last_insn == after)
2328 struct sequence_stack *stack = sequence_stack;
2329 /* Scan all pending sequences too. */
2330 for (; stack; stack = stack->next)
2331 if (after == stack->last)
2341 NEXT_INSN (after) = insn;
2342 if (GET_CODE (after) == INSN && GET_CODE (PATTERN (after)) == SEQUENCE)
2344 rtx sequence = PATTERN (after);
2345 NEXT_INSN (XVECEXP (sequence, 0, XVECLEN (sequence, 0) - 1)) = insn;
2349 /* Add INSN into the doubly-linked list before insn BEFORE. This and
2350 the previous should be the only functions called to insert an insn once
2351 delay slots have been filled since only they know how to update a
2355 add_insn_before (insn, before)
2358 rtx prev = PREV_INSN (before);
2360 if (optimize && INSN_DELETED_P (before))
2363 PREV_INSN (insn) = prev;
2364 NEXT_INSN (insn) = before;
2368 NEXT_INSN (prev) = insn;
2369 if (GET_CODE (prev) == INSN && GET_CODE (PATTERN (prev)) == SEQUENCE)
2371 rtx sequence = PATTERN (prev);
2372 NEXT_INSN (XVECEXP (sequence, 0, XVECLEN (sequence, 0) - 1)) = insn;
2375 else if (first_insn == before)
2379 struct sequence_stack *stack = sequence_stack;
2380 /* Scan all pending sequences too. */
2381 for (; stack; stack = stack->next)
2382 if (before == stack->first)
2384 stack->first = insn;
2392 PREV_INSN (before) = insn;
2393 if (GET_CODE (before) == INSN && GET_CODE (PATTERN (before)) == SEQUENCE)
2394 PREV_INSN (XVECEXP (PATTERN (before), 0, 0)) = insn;
2397 /* Delete all insns made since FROM.
2398 FROM becomes the new last instruction. */
2401 delete_insns_since (from)
2407 NEXT_INSN (from) = 0;
2411 /* This function is deprecated, please use sequences instead.
2413 Move a consecutive bunch of insns to a different place in the chain.
2414 The insns to be moved are those between FROM and TO.
2415 They are moved to a new position after the insn AFTER.
2416 AFTER must not be FROM or TO or any insn in between.
2418 This function does not know about SEQUENCEs and hence should not be
2419 called after delay-slot filling has been done. */
2422 reorder_insns (from, to, after)
2423 rtx from, to, after;
2425 /* Splice this bunch out of where it is now. */
2426 if (PREV_INSN (from))
2427 NEXT_INSN (PREV_INSN (from)) = NEXT_INSN (to);
2429 PREV_INSN (NEXT_INSN (to)) = PREV_INSN (from);
2430 if (last_insn == to)
2431 last_insn = PREV_INSN (from);
2432 if (first_insn == from)
2433 first_insn = NEXT_INSN (to);
2435 /* Make the new neighbors point to it and it to them. */
2436 if (NEXT_INSN (after))
2437 PREV_INSN (NEXT_INSN (after)) = to;
2439 NEXT_INSN (to) = NEXT_INSN (after);
2440 PREV_INSN (from) = after;
2441 NEXT_INSN (after) = from;
2442 if (after == last_insn)
2446 /* Return the line note insn preceding INSN. */
2449 find_line_note (insn)
2452 if (no_line_numbers)
2455 for (; insn; insn = PREV_INSN (insn))
2456 if (GET_CODE (insn) == NOTE
2457 && NOTE_LINE_NUMBER (insn) >= 0)
2463 /* Like reorder_insns, but inserts line notes to preserve the line numbers
2464 of the moved insns when debugging. This may insert a note between AFTER
2465 and FROM, and another one after TO. */
2468 reorder_insns_with_line_notes (from, to, after)
2469 rtx from, to, after;
2471 rtx from_line = find_line_note (from);
2472 rtx after_line = find_line_note (after);
2474 reorder_insns (from, to, after);
2476 if (from_line == after_line)
2480 emit_line_note_after (NOTE_SOURCE_FILE (from_line),
2481 NOTE_LINE_NUMBER (from_line),
2484 emit_line_note_after (NOTE_SOURCE_FILE (after_line),
2485 NOTE_LINE_NUMBER (after_line),
2489 /* Emit an insn of given code and pattern
2490 at a specified place within the doubly-linked list. */
2492 /* Make an instruction with body PATTERN
2493 and output it before the instruction BEFORE. */
2496 emit_insn_before (pattern, before)
2497 register rtx pattern, before;
2499 register rtx insn = before;
2501 if (GET_CODE (pattern) == SEQUENCE)
2505 for (i = 0; i < XVECLEN (pattern, 0); i++)
2507 insn = XVECEXP (pattern, 0, i);
2508 add_insn_before (insn, before);
2510 if (XVECLEN (pattern, 0) < SEQUENCE_RESULT_SIZE)
2511 sequence_result[XVECLEN (pattern, 0)] = pattern;
2515 insn = make_insn_raw (pattern);
2516 add_insn_before (insn, before);
2522 /* Make an instruction with body PATTERN and code JUMP_INSN
2523 and output it before the instruction BEFORE. */
2526 emit_jump_insn_before (pattern, before)
2527 register rtx pattern, before;
2531 if (GET_CODE (pattern) == SEQUENCE)
2532 insn = emit_insn_before (pattern, before);
2535 insn = make_jump_insn_raw (pattern);
2536 add_insn_before (insn, before);
2542 /* Make an instruction with body PATTERN and code CALL_INSN
2543 and output it before the instruction BEFORE. */
2546 emit_call_insn_before (pattern, before)
2547 register rtx pattern, before;
2551 if (GET_CODE (pattern) == SEQUENCE)
2552 insn = emit_insn_before (pattern, before);
2555 insn = make_call_insn_raw (pattern);
2556 add_insn_before (insn, before);
2557 PUT_CODE (insn, CALL_INSN);
2563 /* Make an insn of code BARRIER
2564 and output it before the insn AFTER. */
2567 emit_barrier_before (before)
2568 register rtx before;
2570 register rtx insn = rtx_alloc (BARRIER);
2572 INSN_UID (insn) = cur_insn_uid++;
2574 add_insn_before (insn, before);
2578 /* Emit a note of subtype SUBTYPE before the insn BEFORE. */
2581 emit_note_before (subtype, before)
2585 register rtx note = rtx_alloc (NOTE);
2586 INSN_UID (note) = cur_insn_uid++;
2587 NOTE_SOURCE_FILE (note) = 0;
2588 NOTE_LINE_NUMBER (note) = subtype;
2590 add_insn_before (note, before);
2594 /* Make an insn of code INSN with body PATTERN
2595 and output it after the insn AFTER. */
2598 emit_insn_after (pattern, after)
2599 register rtx pattern, after;
2601 register rtx insn = after;
2603 if (GET_CODE (pattern) == SEQUENCE)
2607 for (i = 0; i < XVECLEN (pattern, 0); i++)
2609 insn = XVECEXP (pattern, 0, i);
2610 add_insn_after (insn, after);
2613 if (XVECLEN (pattern, 0) < SEQUENCE_RESULT_SIZE)
2614 sequence_result[XVECLEN (pattern, 0)] = pattern;
2618 insn = make_insn_raw (pattern);
2619 add_insn_after (insn, after);
2625 /* Similar to emit_insn_after, except that line notes are to be inserted so
2626 as to act as if this insn were at FROM. */
2629 emit_insn_after_with_line_notes (pattern, after, from)
2630 rtx pattern, after, from;
2632 rtx from_line = find_line_note (from);
2633 rtx after_line = find_line_note (after);
2634 rtx insn = emit_insn_after (pattern, after);
2637 emit_line_note_after (NOTE_SOURCE_FILE (from_line),
2638 NOTE_LINE_NUMBER (from_line),
2642 emit_line_note_after (NOTE_SOURCE_FILE (after_line),
2643 NOTE_LINE_NUMBER (after_line),
2647 /* Make an insn of code JUMP_INSN with body PATTERN
2648 and output it after the insn AFTER. */
2651 emit_jump_insn_after (pattern, after)
2652 register rtx pattern, after;
2656 if (GET_CODE (pattern) == SEQUENCE)
2657 insn = emit_insn_after (pattern, after);
2660 insn = make_jump_insn_raw (pattern);
2661 add_insn_after (insn, after);
2667 /* Make an insn of code BARRIER
2668 and output it after the insn AFTER. */
2671 emit_barrier_after (after)
2674 register rtx insn = rtx_alloc (BARRIER);
2676 INSN_UID (insn) = cur_insn_uid++;
2678 add_insn_after (insn, after);
2682 /* Emit the label LABEL after the insn AFTER. */
2685 emit_label_after (label, after)
2688 /* This can be called twice for the same label
2689 as a result of the confusion that follows a syntax error!
2690 So make it harmless. */
2691 if (INSN_UID (label) == 0)
2693 INSN_UID (label) = cur_insn_uid++;
2694 add_insn_after (label, after);
2700 /* Emit a note of subtype SUBTYPE after the insn AFTER. */
2703 emit_note_after (subtype, after)
2707 register rtx note = rtx_alloc (NOTE);
2708 INSN_UID (note) = cur_insn_uid++;
2709 NOTE_SOURCE_FILE (note) = 0;
2710 NOTE_LINE_NUMBER (note) = subtype;
2711 add_insn_after (note, after);
2715 /* Emit a line note for FILE and LINE after the insn AFTER. */
2718 emit_line_note_after (file, line, after)
2725 if (no_line_numbers && line > 0)
2731 note = rtx_alloc (NOTE);
2732 INSN_UID (note) = cur_insn_uid++;
2733 NOTE_SOURCE_FILE (note) = file;
2734 NOTE_LINE_NUMBER (note) = line;
2735 add_insn_after (note, after);
2739 /* Make an insn of code INSN with pattern PATTERN
2740 and add it to the end of the doubly-linked list.
2741 If PATTERN is a SEQUENCE, take the elements of it
2742 and emit an insn for each element.
2744 Returns the last insn emitted. */
2750 rtx insn = last_insn;
2752 if (GET_CODE (pattern) == SEQUENCE)
2756 for (i = 0; i < XVECLEN (pattern, 0); i++)
2758 insn = XVECEXP (pattern, 0, i);
2761 if (XVECLEN (pattern, 0) < SEQUENCE_RESULT_SIZE)
2762 sequence_result[XVECLEN (pattern, 0)] = pattern;
2766 insn = make_insn_raw (pattern);
2773 /* Emit the insns in a chain starting with INSN.
2774 Return the last insn emitted. */
2784 rtx next = NEXT_INSN (insn);
2793 /* Emit the insns in a chain starting with INSN and place them in front of
2794 the insn BEFORE. Return the last insn emitted. */
2797 emit_insns_before (insn, before)
2805 rtx next = NEXT_INSN (insn);
2806 add_insn_before (insn, before);
2814 /* Emit the insns in a chain starting with FIRST and place them in back of
2815 the insn AFTER. Return the last insn emitted. */
2818 emit_insns_after (first, after)
2823 register rtx after_after;
2831 for (last = first; NEXT_INSN (last); last = NEXT_INSN (last))
2834 after_after = NEXT_INSN (after);
2836 NEXT_INSN (after) = first;
2837 PREV_INSN (first) = after;
2838 NEXT_INSN (last) = after_after;
2840 PREV_INSN (after_after) = last;
2842 if (after == last_insn)
2847 /* Make an insn of code JUMP_INSN with pattern PATTERN
2848 and add it to the end of the doubly-linked list. */
2851 emit_jump_insn (pattern)
2854 if (GET_CODE (pattern) == SEQUENCE)
2855 return emit_insn (pattern);
2858 register rtx insn = make_jump_insn_raw (pattern);
2864 /* Make an insn of code CALL_INSN with pattern PATTERN
2865 and add it to the end of the doubly-linked list. */
2868 emit_call_insn (pattern)
2871 if (GET_CODE (pattern) == SEQUENCE)
2872 return emit_insn (pattern);
2875 register rtx insn = make_call_insn_raw (pattern);
2877 PUT_CODE (insn, CALL_INSN);
2882 /* Add the label LABEL to the end of the doubly-linked list. */
2888 /* This can be called twice for the same label
2889 as a result of the confusion that follows a syntax error!
2890 So make it harmless. */
2891 if (INSN_UID (label) == 0)
2893 INSN_UID (label) = cur_insn_uid++;
2899 /* Make an insn of code BARRIER
2900 and add it to the end of the doubly-linked list. */
2905 register rtx barrier = rtx_alloc (BARRIER);
2906 INSN_UID (barrier) = cur_insn_uid++;
2911 /* Make an insn of code NOTE
2912 with data-fields specified by FILE and LINE
2913 and add it to the end of the doubly-linked list,
2914 but only if line-numbers are desired for debugging info. */
2917 emit_line_note (file, line)
2921 if (output_bytecode)
2923 /* FIXME: for now we do nothing, but eventually we will have to deal with
2924 debugging information. */
2928 emit_filename = file;
2932 if (no_line_numbers)
2936 return emit_note (file, line);
2939 /* Make an insn of code NOTE
2940 with data-fields specified by FILE and LINE
2941 and add it to the end of the doubly-linked list.
2942 If it is a line-number NOTE, omit it if it matches the previous one. */
2945 emit_note (file, line)
2953 if (file && last_filename && !strcmp (file, last_filename)
2954 && line == last_linenum)
2956 last_filename = file;
2957 last_linenum = line;
2960 if (no_line_numbers && line > 0)
2966 note = rtx_alloc (NOTE);
2967 INSN_UID (note) = cur_insn_uid++;
2968 NOTE_SOURCE_FILE (note) = file;
2969 NOTE_LINE_NUMBER (note) = line;
2974 /* Emit a NOTE, and don't omit it even if LINE it the previous note. */
2977 emit_line_note_force (file, line)
2982 return emit_line_note (file, line);
2985 /* Cause next statement to emit a line note even if the line number
2986 has not changed. This is used at the beginning of a function. */
2989 force_next_line_note ()
2994 /* Return an indication of which type of insn should have X as a body.
2995 The value is CODE_LABEL, INSN, CALL_INSN or JUMP_INSN. */
3001 if (GET_CODE (x) == CODE_LABEL)
3003 if (GET_CODE (x) == CALL)
3005 if (GET_CODE (x) == RETURN)
3007 if (GET_CODE (x) == SET)
3009 if (SET_DEST (x) == pc_rtx)
3011 else if (GET_CODE (SET_SRC (x)) == CALL)
3016 if (GET_CODE (x) == PARALLEL)
3019 for (j = XVECLEN (x, 0) - 1; j >= 0; j--)
3020 if (GET_CODE (XVECEXP (x, 0, j)) == CALL)
3022 else if (GET_CODE (XVECEXP (x, 0, j)) == SET
3023 && SET_DEST (XVECEXP (x, 0, j)) == pc_rtx)
3025 else if (GET_CODE (XVECEXP (x, 0, j)) == SET
3026 && GET_CODE (SET_SRC (XVECEXP (x, 0, j))) == CALL)
3032 /* Emit the rtl pattern X as an appropriate kind of insn.
3033 If X is a label, it is simply added into the insn chain. */
3039 enum rtx_code code = classify_insn (x);
3041 if (code == CODE_LABEL)
3042 return emit_label (x);
3043 else if (code == INSN)
3044 return emit_insn (x);
3045 else if (code == JUMP_INSN)
3047 register rtx insn = emit_jump_insn (x);
3048 if (simplejump_p (insn) || GET_CODE (x) == RETURN)
3049 return emit_barrier ();
3052 else if (code == CALL_INSN)
3053 return emit_call_insn (x);
3058 /* Begin emitting insns to a sequence which can be packaged in an RTL_EXPR. */
3063 struct sequence_stack *tem;
3065 if (sequence_element_free_list)
3067 /* Reuse a previously-saved struct sequence_stack. */
3068 tem = sequence_element_free_list;
3069 sequence_element_free_list = tem->next;
3072 tem = (struct sequence_stack *) permalloc (sizeof (struct sequence_stack));
3074 tem->next = sequence_stack;
3075 tem->first = first_insn;
3076 tem->last = last_insn;
3077 tem->sequence_rtl_expr = sequence_rtl_expr;
3079 sequence_stack = tem;
3085 /* Similarly, but indicate that this sequence will be placed in
3089 start_sequence_for_rtl_expr (t)
3094 sequence_rtl_expr = t;
3097 /* Set up the insn chain starting with FIRST
3098 as the current sequence, saving the previously current one. */
3101 push_to_sequence (first)
3108 for (last = first; last && NEXT_INSN (last); last = NEXT_INSN (last));
3114 /* Set up the outer-level insn chain
3115 as the current sequence, saving the previously current one. */
3118 push_topmost_sequence ()
3120 struct sequence_stack *stack, *top;
3124 for (stack = sequence_stack; stack; stack = stack->next)
3127 first_insn = top->first;
3128 last_insn = top->last;
3129 sequence_rtl_expr = top->sequence_rtl_expr;
3132 /* After emitting to the outer-level insn chain, update the outer-level
3133 insn chain, and restore the previous saved state. */
3136 pop_topmost_sequence ()
3138 struct sequence_stack *stack, *top;
3140 for (stack = sequence_stack; stack; stack = stack->next)
3143 top->first = first_insn;
3144 top->last = last_insn;
3145 /* ??? Why don't we save sequence_rtl_expr here? */
3150 /* After emitting to a sequence, restore previous saved state.
3152 To get the contents of the sequence just made,
3153 you must call `gen_sequence' *before* calling here. */
3158 struct sequence_stack *tem = sequence_stack;
3160 first_insn = tem->first;
3161 last_insn = tem->last;
3162 sequence_rtl_expr = tem->sequence_rtl_expr;
3163 sequence_stack = tem->next;
3165 tem->next = sequence_element_free_list;
3166 sequence_element_free_list = tem;
3169 /* Return 1 if currently emitting into a sequence. */
3174 return sequence_stack != 0;
3177 /* Generate a SEQUENCE rtx containing the insns already emitted
3178 to the current sequence.
3180 This is how the gen_... function from a DEFINE_EXPAND
3181 constructs the SEQUENCE that it returns. */
3191 /* Count the insns in the chain. */
3193 for (tem = first_insn; tem; tem = NEXT_INSN (tem))
3196 /* If only one insn, return its pattern rather than a SEQUENCE.
3197 (Now that we cache SEQUENCE expressions, it isn't worth special-casing
3198 the case of an empty list.) */
3200 && ! RTX_FRAME_RELATED_P (first_insn)
3201 && (GET_CODE (first_insn) == INSN
3202 || GET_CODE (first_insn) == JUMP_INSN
3203 /* Don't discard the call usage field. */
3204 || (GET_CODE (first_insn) == CALL_INSN
3205 && CALL_INSN_FUNCTION_USAGE (first_insn) == NULL_RTX)))
3207 NEXT_INSN (first_insn) = free_insn;
3208 free_insn = first_insn;
3209 return PATTERN (first_insn);
3212 /* Put them in a vector. See if we already have a SEQUENCE of the
3213 appropriate length around. */
3214 if (len < SEQUENCE_RESULT_SIZE && (result = sequence_result[len]) != 0)
3215 sequence_result[len] = 0;
3218 /* Ensure that this rtl goes in saveable_obstack, since we may
3220 push_obstacks_nochange ();
3221 rtl_in_saveable_obstack ();
3222 result = gen_rtx (SEQUENCE, VOIDmode, rtvec_alloc (len));
3226 for (i = 0, tem = first_insn; tem; tem = NEXT_INSN (tem), i++)
3227 XVECEXP (result, 0, i) = tem;
3232 /* Initialize data structures and variables in this file
3233 before generating rtl for each function. */
3242 sequence_rtl_expr = NULL;
3244 reg_rtx_no = LAST_VIRTUAL_REGISTER + 1;
3247 first_label_num = label_num;
3249 sequence_stack = NULL;
3251 /* Clear the start_sequence/gen_sequence cache. */
3252 sequence_element_free_list = 0;
3253 for (i = 0; i < SEQUENCE_RESULT_SIZE; i++)
3254 sequence_result[i] = 0;
3257 /* Init the tables that describe all the pseudo regs. */
3259 regno_pointer_flag_length = LAST_VIRTUAL_REGISTER + 101;
3262 = (char *) savealloc (regno_pointer_flag_length);
3263 bzero (regno_pointer_flag, regno_pointer_flag_length);
3266 = (char *) savealloc (regno_pointer_flag_length);
3267 bzero (regno_pointer_align, regno_pointer_flag_length);
3270 = (rtx *) savealloc (regno_pointer_flag_length * sizeof (rtx));
3271 bzero ((char *) regno_reg_rtx, regno_pointer_flag_length * sizeof (rtx));
3273 /* Put copies of all the virtual register rtx into regno_reg_rtx. */
3274 regno_reg_rtx[VIRTUAL_INCOMING_ARGS_REGNUM] = virtual_incoming_args_rtx;
3275 regno_reg_rtx[VIRTUAL_STACK_VARS_REGNUM] = virtual_stack_vars_rtx;
3276 regno_reg_rtx[VIRTUAL_STACK_DYNAMIC_REGNUM] = virtual_stack_dynamic_rtx;
3277 regno_reg_rtx[VIRTUAL_OUTGOING_ARGS_REGNUM] = virtual_outgoing_args_rtx;
3279 /* Indicate that the virtual registers and stack locations are
3281 REGNO_POINTER_FLAG (STACK_POINTER_REGNUM) = 1;
3282 REGNO_POINTER_FLAG (FRAME_POINTER_REGNUM) = 1;
3283 REGNO_POINTER_FLAG (HARD_FRAME_POINTER_REGNUM) = 1;
3284 REGNO_POINTER_FLAG (ARG_POINTER_REGNUM) = 1;
3286 REGNO_POINTER_FLAG (VIRTUAL_INCOMING_ARGS_REGNUM) = 1;
3287 REGNO_POINTER_FLAG (VIRTUAL_STACK_VARS_REGNUM) = 1;
3288 REGNO_POINTER_FLAG (VIRTUAL_STACK_DYNAMIC_REGNUM) = 1;
3289 REGNO_POINTER_FLAG (VIRTUAL_OUTGOING_ARGS_REGNUM) = 1;
3291 #ifdef STACK_BOUNDARY
3292 REGNO_POINTER_ALIGN (STACK_POINTER_REGNUM) = STACK_BOUNDARY / BITS_PER_UNIT;
3293 REGNO_POINTER_ALIGN (FRAME_POINTER_REGNUM) = STACK_BOUNDARY / BITS_PER_UNIT;
3294 REGNO_POINTER_ALIGN (HARD_FRAME_POINTER_REGNUM)
3295 = STACK_BOUNDARY / BITS_PER_UNIT;
3296 REGNO_POINTER_ALIGN (ARG_POINTER_REGNUM) = STACK_BOUNDARY / BITS_PER_UNIT;
3298 REGNO_POINTER_ALIGN (VIRTUAL_INCOMING_ARGS_REGNUM)
3299 = STACK_BOUNDARY / BITS_PER_UNIT;
3300 REGNO_POINTER_ALIGN (VIRTUAL_STACK_VARS_REGNUM)
3301 = STACK_BOUNDARY / BITS_PER_UNIT;
3302 REGNO_POINTER_ALIGN (VIRTUAL_STACK_DYNAMIC_REGNUM)
3303 = STACK_BOUNDARY / BITS_PER_UNIT;
3304 REGNO_POINTER_ALIGN (VIRTUAL_OUTGOING_ARGS_REGNUM)
3305 = STACK_BOUNDARY / BITS_PER_UNIT;
3308 #ifdef INIT_EXPANDERS
3313 /* Create some permanent unique rtl objects shared between all functions.
3314 LINE_NUMBERS is nonzero if line numbers are to be generated. */
3317 init_emit_once (line_numbers)
3321 enum machine_mode mode;
3323 no_line_numbers = ! line_numbers;
3325 sequence_stack = NULL;
3327 /* Compute the word and byte modes. */
3329 byte_mode = VOIDmode;
3330 word_mode = VOIDmode;
3332 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
3333 mode = GET_MODE_WIDER_MODE (mode))
3335 if (GET_MODE_BITSIZE (mode) == BITS_PER_UNIT
3336 && byte_mode == VOIDmode)
3339 if (GET_MODE_BITSIZE (mode) == BITS_PER_WORD
3340 && word_mode == VOIDmode)
3344 ptr_mode = mode_for_size (POINTER_SIZE, GET_MODE_CLASS (Pmode), 0);
3346 /* Create the unique rtx's for certain rtx codes and operand values. */
3348 pc_rtx = gen_rtx (PC, VOIDmode);
3349 cc0_rtx = gen_rtx (CC0, VOIDmode);
3351 /* Don't use gen_rtx here since gen_rtx in this case
3352 tries to use these variables. */
3353 for (i = - MAX_SAVED_CONST_INT; i <= MAX_SAVED_CONST_INT; i++)
3355 const_int_rtx[i + MAX_SAVED_CONST_INT] = rtx_alloc (CONST_INT);
3356 PUT_MODE (const_int_rtx[i + MAX_SAVED_CONST_INT], VOIDmode);
3357 INTVAL (const_int_rtx[i + MAX_SAVED_CONST_INT]) = i;
3360 /* These four calls obtain some of the rtx expressions made above. */
3361 const0_rtx = GEN_INT (0);
3362 const1_rtx = GEN_INT (1);
3363 const2_rtx = GEN_INT (2);
3364 constm1_rtx = GEN_INT (-1);
3366 /* This will usually be one of the above constants, but may be a new rtx. */
3367 const_true_rtx = GEN_INT (STORE_FLAG_VALUE);
3369 dconst0 = REAL_VALUE_ATOF ("0", DFmode);
3370 dconst1 = REAL_VALUE_ATOF ("1", DFmode);
3371 dconst2 = REAL_VALUE_ATOF ("2", DFmode);
3372 dconstm1 = REAL_VALUE_ATOF ("-1", DFmode);
3374 for (i = 0; i <= 2; i++)
3376 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); mode != VOIDmode;
3377 mode = GET_MODE_WIDER_MODE (mode))
3379 rtx tem = rtx_alloc (CONST_DOUBLE);
3380 union real_extract u;
3382 bzero ((char *) &u, sizeof u); /* Zero any holes in a structure. */
3383 u.d = i == 0 ? dconst0 : i == 1 ? dconst1 : dconst2;
3385 bcopy ((char *) &u, (char *) &CONST_DOUBLE_LOW (tem), sizeof u);
3386 CONST_DOUBLE_MEM (tem) = cc0_rtx;
3387 PUT_MODE (tem, mode);
3389 const_tiny_rtx[i][(int) mode] = tem;
3392 const_tiny_rtx[i][(int) VOIDmode] = GEN_INT (i);
3394 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
3395 mode = GET_MODE_WIDER_MODE (mode))
3396 const_tiny_rtx[i][(int) mode] = GEN_INT (i);
3398 for (mode = GET_CLASS_NARROWEST_MODE (MODE_PARTIAL_INT);
3400 mode = GET_MODE_WIDER_MODE (mode))
3401 const_tiny_rtx[i][(int) mode] = GEN_INT (i);
3404 for (mode = GET_CLASS_NARROWEST_MODE (MODE_CC); mode != VOIDmode;
3405 mode = GET_MODE_WIDER_MODE (mode))
3406 const_tiny_rtx[0][(int) mode] = const0_rtx;
3408 stack_pointer_rtx = gen_rtx (REG, Pmode, STACK_POINTER_REGNUM);
3409 frame_pointer_rtx = gen_rtx (REG, Pmode, FRAME_POINTER_REGNUM);
3411 if (HARD_FRAME_POINTER_REGNUM == FRAME_POINTER_REGNUM)
3412 hard_frame_pointer_rtx = frame_pointer_rtx;
3414 hard_frame_pointer_rtx = gen_rtx (REG, Pmode, HARD_FRAME_POINTER_REGNUM);
3416 if (FRAME_POINTER_REGNUM == ARG_POINTER_REGNUM)
3417 arg_pointer_rtx = frame_pointer_rtx;
3418 else if (HARD_FRAME_POINTER_REGNUM == ARG_POINTER_REGNUM)
3419 arg_pointer_rtx = hard_frame_pointer_rtx;
3420 else if (STACK_POINTER_REGNUM == ARG_POINTER_REGNUM)
3421 arg_pointer_rtx = stack_pointer_rtx;
3423 arg_pointer_rtx = gen_rtx (REG, Pmode, ARG_POINTER_REGNUM);
3425 #ifdef RETURN_ADDRESS_POINTER_REGNUM
3426 return_address_pointer_rtx = gen_rtx (REG, Pmode,
3427 RETURN_ADDRESS_POINTER_REGNUM);
3430 /* Create the virtual registers. Do so here since the following objects
3431 might reference them. */
3433 virtual_incoming_args_rtx = gen_rtx (REG, Pmode,
3434 VIRTUAL_INCOMING_ARGS_REGNUM);
3435 virtual_stack_vars_rtx = gen_rtx (REG, Pmode,
3436 VIRTUAL_STACK_VARS_REGNUM);
3437 virtual_stack_dynamic_rtx = gen_rtx (REG, Pmode,
3438 VIRTUAL_STACK_DYNAMIC_REGNUM);
3439 virtual_outgoing_args_rtx = gen_rtx (REG, Pmode,
3440 VIRTUAL_OUTGOING_ARGS_REGNUM);
3443 struct_value_rtx = STRUCT_VALUE;
3445 struct_value_rtx = gen_rtx (REG, Pmode, STRUCT_VALUE_REGNUM);
3448 #ifdef STRUCT_VALUE_INCOMING
3449 struct_value_incoming_rtx = STRUCT_VALUE_INCOMING;
3451 #ifdef STRUCT_VALUE_INCOMING_REGNUM
3452 struct_value_incoming_rtx
3453 = gen_rtx (REG, Pmode, STRUCT_VALUE_INCOMING_REGNUM);
3455 struct_value_incoming_rtx = struct_value_rtx;
3459 #ifdef STATIC_CHAIN_REGNUM
3460 static_chain_rtx = gen_rtx (REG, Pmode, STATIC_CHAIN_REGNUM);
3462 #ifdef STATIC_CHAIN_INCOMING_REGNUM
3463 if (STATIC_CHAIN_INCOMING_REGNUM != STATIC_CHAIN_REGNUM)
3464 static_chain_incoming_rtx = gen_rtx (REG, Pmode, STATIC_CHAIN_INCOMING_REGNUM);
3467 static_chain_incoming_rtx = static_chain_rtx;
3471 static_chain_rtx = STATIC_CHAIN;
3473 #ifdef STATIC_CHAIN_INCOMING
3474 static_chain_incoming_rtx = STATIC_CHAIN_INCOMING;
3476 static_chain_incoming_rtx = static_chain_rtx;
3480 #ifdef PIC_OFFSET_TABLE_REGNUM
3481 pic_offset_table_rtx = gen_rtx (REG, Pmode, PIC_OFFSET_TABLE_REGNUM);