1 /* Register to Stack convert for GNU compiler.
2 Copyright (C) 1992, 93-97, 1998 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. */
21 /* This pass converts stack-like registers from the "flat register
22 file" model that gcc uses, to a stack convention that the 387 uses.
24 * The form of the input:
26 On input, the function consists of insn that have had their
27 registers fully allocated to a set of "virtual" registers. Note that
28 the word "virtual" is used differently here than elsewhere in gcc: for
29 each virtual stack reg, there is a hard reg, but the mapping between
30 them is not known until this pass is run. On output, hard register
31 numbers have been substituted, and various pop and exchange insns have
32 been emitted. The hard register numbers and the virtual register
33 numbers completely overlap - before this pass, all stack register
34 numbers are virtual, and afterward they are all hard.
36 The virtual registers can be manipulated normally by gcc, and their
37 semantics are the same as for normal registers. After the hard
38 register numbers are substituted, the semantics of an insn containing
39 stack-like regs are not the same as for an insn with normal regs: for
40 instance, it is not safe to delete an insn that appears to be a no-op
41 move. In general, no insn containing hard regs should be changed
42 after this pass is done.
44 * The form of the output:
46 After this pass, hard register numbers represent the distance from
47 the current top of stack to the desired register. A reference to
48 FIRST_STACK_REG references the top of stack, FIRST_STACK_REG + 1,
49 represents the register just below that, and so forth. Also, REG_DEAD
50 notes indicate whether or not a stack register should be popped.
52 A "swap" insn looks like a parallel of two patterns, where each
53 pattern is a SET: one sets A to B, the other B to A.
55 A "push" or "load" insn is a SET whose SET_DEST is FIRST_STACK_REG
56 and whose SET_DEST is REG or MEM. Any other SET_DEST, such as PLUS,
57 will replace the existing stack top, not push a new value.
59 A store insn is a SET whose SET_DEST is FIRST_STACK_REG, and whose
60 SET_SRC is REG or MEM.
62 The case where the SET_SRC and SET_DEST are both FIRST_STACK_REG
63 appears ambiguous. As a special case, the presence of a REG_DEAD note
64 for FIRST_STACK_REG differentiates between a load insn and a pop.
66 If a REG_DEAD is present, the insn represents a "pop" that discards
67 the top of the register stack. If there is no REG_DEAD note, then the
68 insn represents a "dup" or a push of the current top of stack onto the
73 Existing REG_DEAD and REG_UNUSED notes for stack registers are
74 deleted and recreated from scratch. REG_DEAD is never created for a
75 SET_DEST, only REG_UNUSED.
77 Before life analysis, the mode of each insn is set based on whether
78 or not any stack registers are mentioned within that insn. VOIDmode
79 means that no regs are mentioned anyway, and QImode means that at
80 least one pattern within the insn mentions stack registers. This
81 information is valid until after reg_to_stack returns, and is used
86 There are several rules on the usage of stack-like regs in
87 asm_operands insns. These rules apply only to the operands that are
90 1. Given a set of input regs that die in an asm_operands, it is
91 necessary to know which are implicitly popped by the asm, and
92 which must be explicitly popped by gcc.
94 An input reg that is implicitly popped by the asm must be
95 explicitly clobbered, unless it is constrained to match an
98 2. For any input reg that is implicitly popped by an asm, it is
99 necessary to know how to adjust the stack to compensate for the pop.
100 If any non-popped input is closer to the top of the reg-stack than
101 the implicitly popped reg, it would not be possible to know what the
102 stack looked like - it's not clear how the rest of the stack "slides
105 All implicitly popped input regs must be closer to the top of
106 the reg-stack than any input that is not implicitly popped.
108 3. It is possible that if an input dies in an insn, reload might
109 use the input reg for an output reload. Consider this example:
111 asm ("foo" : "=t" (a) : "f" (b));
113 This asm says that input B is not popped by the asm, and that
114 the asm pushes a result onto the reg-stack, ie, the stack is one
115 deeper after the asm than it was before. But, it is possible that
116 reload will think that it can use the same reg for both the input and
117 the output, if input B dies in this insn.
119 If any input operand uses the "f" constraint, all output reg
120 constraints must use the "&" earlyclobber.
122 The asm above would be written as
124 asm ("foo" : "=&t" (a) : "f" (b));
126 4. Some operands need to be in particular places on the stack. All
127 output operands fall in this category - there is no other way to
128 know which regs the outputs appear in unless the user indicates
129 this in the constraints.
131 Output operands must specifically indicate which reg an output
132 appears in after an asm. "=f" is not allowed: the operand
133 constraints must select a class with a single reg.
135 5. Output operands may not be "inserted" between existing stack regs.
136 Since no 387 opcode uses a read/write operand, all output operands
137 are dead before the asm_operands, and are pushed by the asm_operands.
138 It makes no sense to push anywhere but the top of the reg-stack.
140 Output operands must start at the top of the reg-stack: output
141 operands may not "skip" a reg.
143 6. Some asm statements may need extra stack space for internal
144 calculations. This can be guaranteed by clobbering stack registers
145 unrelated to the inputs and outputs.
147 Here are a couple of reasonable asms to want to write. This asm
148 takes one input, which is internally popped, and produces two outputs.
150 asm ("fsincos" : "=t" (cos), "=u" (sin) : "0" (inp));
152 This asm takes two inputs, which are popped by the fyl2xp1 opcode,
153 and replaces them with one output. The user must code the "st(1)"
154 clobber for reg-stack.c to know that fyl2xp1 pops both inputs.
156 asm ("fyl2xp1" : "=t" (result) : "0" (x), "u" (y) : "st(1)");
164 #include "insn-config.h"
166 #include "hard-reg-set.h"
168 #include "insn-flags.h"
172 #define REG_STACK_SIZE (LAST_STACK_REG - FIRST_STACK_REG + 1)
174 /* This is the basic stack record. TOP is an index into REG[] such
175 that REG[TOP] is the top of stack. If TOP is -1 the stack is empty.
177 If TOP is -2, REG[] is not yet initialized. Stack initialization
178 consists of placing each live reg in array `reg' and setting `top'
181 REG_SET indicates which registers are live. */
183 typedef struct stack_def
185 int top
; /* index to top stack element */
186 HARD_REG_SET reg_set
; /* set of live registers */
187 char reg
[REG_STACK_SIZE
]; /* register - stack mapping */
190 /* highest instruction uid */
191 static int max_uid
= 0;
193 /* Number of basic blocks in the current function. */
196 /* Element N is first insn in basic block N.
197 This info lasts until we finish compiling the function. */
198 static rtx
*block_begin
;
200 /* Element N is last insn in basic block N.
201 This info lasts until we finish compiling the function. */
202 static rtx
*block_end
;
204 /* Element N is nonzero if control can drop into basic block N */
205 static char *block_drops_in
;
207 /* Element N says all about the stack at entry block N */
208 static stack block_stack_in
;
210 /* Element N says all about the stack life at the end of block N */
211 static HARD_REG_SET
*block_out_reg_set
;
213 /* This is where the BLOCK_NUM values are really stored. This is set
214 up by find_blocks and used there and in life_analysis. It can be used
215 later, but only to look up an insn that is the head or tail of some
216 block. life_analysis and the stack register conversion process can
217 add insns within a block. */
218 static int *block_number
;
220 /* This is the register file for all register after conversion */
222 FP_mode_reg
[LAST_STACK_REG
+1-FIRST_STACK_REG
][(int) MAX_MACHINE_MODE
];
224 #define FP_MODE_REG(regno,mode) \
225 (FP_mode_reg[(regno)-FIRST_STACK_REG][(int)(mode)])
227 /* Get the basic block number of an insn. See note at block_number
228 definition are validity of this information. */
230 #define BLOCK_NUM(INSN) \
231 ((INSN_UID (INSN) > max_uid) \
232 ? (abort() , -1) : block_number[INSN_UID (INSN)])
234 extern rtx forced_labels
;
236 /* Forward declarations */
238 static void mark_regs_pat
PROTO((rtx
, HARD_REG_SET
*));
239 static void straighten_stack
PROTO((rtx
, stack
));
240 static void record_label_references
PROTO((rtx
, rtx
));
241 static rtx
*get_true_reg
PROTO((rtx
*));
242 static int constrain_asm_operands
PROTO((int, rtx
*, char **, int *,
245 static void record_asm_reg_life
PROTO((rtx
,stack
, rtx
*, char **,
247 static void record_reg_life_pat
PROTO((rtx
, HARD_REG_SET
*,
248 HARD_REG_SET
*, int));
249 static void get_asm_operand_lengths
PROTO((rtx
, int, int *, int *));
250 static void record_reg_life
PROTO((rtx
, int, stack
));
251 static void find_blocks
PROTO((rtx
));
252 static rtx stack_result
PROTO((tree
));
253 static void stack_reg_life_analysis
PROTO((rtx
, HARD_REG_SET
*));
254 static void replace_reg
PROTO((rtx
*, int));
255 static void remove_regno_note
PROTO((rtx
, enum reg_note
, int));
256 static int get_hard_regnum
PROTO((stack
, rtx
));
257 static void delete_insn_for_stacker
PROTO((rtx
));
258 static rtx emit_pop_insn
PROTO((rtx
, stack
, rtx
, rtx (*) ()));
259 static void emit_swap_insn
PROTO((rtx
, stack
, rtx
));
260 static void move_for_stack_reg
PROTO((rtx
, stack
, rtx
));
261 static void swap_rtx_condition
PROTO((rtx
));
262 static void compare_for_stack_reg
PROTO((rtx
, stack
, rtx
));
263 static void subst_stack_regs_pat
PROTO((rtx
, stack
, rtx
));
264 static void subst_asm_stack_regs
PROTO((rtx
, stack
, rtx
*, rtx
**,
266 static void subst_stack_regs
PROTO((rtx
, stack
));
267 static void change_stack
PROTO((rtx
, stack
, stack
, rtx (*) ()));
269 static void goto_block_pat
PROTO((rtx
, stack
, rtx
));
270 static void convert_regs
PROTO((void));
271 static void print_blocks
PROTO((FILE *, rtx
, rtx
));
272 static void dump_stack_info
PROTO((FILE *));
274 /* Mark all registers needed for this pattern. */
277 mark_regs_pat (pat
, set
)
281 enum machine_mode mode
;
285 if (GET_CODE (pat
) == SUBREG
)
287 mode
= GET_MODE (pat
);
288 regno
= SUBREG_WORD (pat
);
289 regno
+= REGNO (SUBREG_REG (pat
));
292 regno
= REGNO (pat
), mode
= GET_MODE (pat
);
294 for (count
= HARD_REGNO_NREGS (regno
, mode
);
295 count
; count
--, regno
++)
296 SET_HARD_REG_BIT (*set
, regno
);
299 /* Reorganise the stack into ascending numbers,
303 straighten_stack (insn
, regstack
)
307 struct stack_def temp_stack
;
310 temp_stack
.reg_set
= regstack
->reg_set
;
312 for (top
= temp_stack
.top
= regstack
->top
; top
>= 0; top
--)
313 temp_stack
.reg
[top
] = FIRST_STACK_REG
+ temp_stack
.top
- top
;
315 change_stack (insn
, regstack
, &temp_stack
, emit_insn_after
);
318 /* Pop a register from the stack */
321 pop_stack (regstack
, regno
)
325 int top
= regstack
->top
;
327 CLEAR_HARD_REG_BIT (regstack
->reg_set
, regno
);
329 /* If regno was not at the top of stack then adjust stack */
330 if (regstack
->reg
[top
] != regno
)
333 for (i
= regstack
->top
; i
>= 0; i
--)
334 if (regstack
->reg
[i
] == regno
)
337 for (j
= i
; j
< top
; j
++)
338 regstack
->reg
[j
] = regstack
->reg
[j
+ 1];
344 /* Return non-zero if any stack register is mentioned somewhere within PAT. */
347 stack_regs_mentioned_p (pat
)
353 if (STACK_REG_P (pat
))
356 fmt
= GET_RTX_FORMAT (GET_CODE (pat
));
357 for (i
= GET_RTX_LENGTH (GET_CODE (pat
)) - 1; i
>= 0; i
--)
363 for (j
= XVECLEN (pat
, i
) - 1; j
>= 0; j
--)
364 if (stack_regs_mentioned_p (XVECEXP (pat
, i
, j
)))
367 else if (fmt
[i
] == 'e' && stack_regs_mentioned_p (XEXP (pat
, i
)))
374 /* Convert register usage from "flat" register file usage to a "stack
375 register file. FIRST is the first insn in the function, FILE is the
378 First compute the beginning and end of each basic block. Do a
379 register life analysis on the stack registers, recording the result
380 for the head and tail of each basic block. The convert each insn one
381 by one. Run a last jump_optimize() pass, if optimizing, to eliminate
382 any cross-jumping created when the converter inserts pop insns.*/
385 reg_to_stack (first
, file
)
391 int stack_reg_seen
= 0;
392 enum machine_mode mode
;
393 HARD_REG_SET stackentry
;
395 CLEAR_HARD_REG_SET (stackentry
);
398 static int initialised
;
402 initialised
= 1; /* This array can not have been previously
403 initialised, because the rtx's are
404 thrown away between compilations of
407 for (i
= FIRST_STACK_REG
; i
<= LAST_STACK_REG
; i
++)
409 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_FLOAT
); mode
!= VOIDmode
;
410 mode
= GET_MODE_WIDER_MODE (mode
))
411 FP_MODE_REG (i
, mode
) = gen_rtx_REG (mode
, i
);
412 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_COMPLEX_FLOAT
); mode
!= VOIDmode
;
413 mode
= GET_MODE_WIDER_MODE (mode
))
414 FP_MODE_REG (i
, mode
) = gen_rtx_REG (mode
, i
);
419 /* Count the basic blocks. Also find maximum insn uid. */
421 register RTX_CODE prev_code
= BARRIER
;
422 register RTX_CODE code
;
423 register int before_function_beg
= 1;
427 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
429 /* Note that this loop must select the same block boundaries
430 as code in find_blocks. Also note that this code is not the
431 same as that used in flow.c. */
433 if (INSN_UID (insn
) > max_uid
)
434 max_uid
= INSN_UID (insn
);
436 code
= GET_CODE (insn
);
438 if (code
== CODE_LABEL
439 || (prev_code
!= INSN
440 && prev_code
!= CALL_INSN
441 && prev_code
!= CODE_LABEL
442 && GET_RTX_CLASS (code
) == 'i'))
445 if (code
== NOTE
&& NOTE_LINE_NUMBER (insn
) == NOTE_INSN_FUNCTION_BEG
)
446 before_function_beg
= 0;
448 /* Remember whether or not this insn mentions an FP regs.
449 Check JUMP_INSNs too, in case someone creates a funny PARALLEL. */
451 if (GET_RTX_CLASS (code
) == 'i'
452 && stack_regs_mentioned_p (PATTERN (insn
)))
455 PUT_MODE (insn
, QImode
);
457 /* Note any register passing parameters. */
459 if (before_function_beg
&& code
== INSN
460 && GET_CODE (PATTERN (insn
)) == USE
)
461 record_reg_life_pat (PATTERN (insn
), (HARD_REG_SET
*) 0,
465 PUT_MODE (insn
, VOIDmode
);
467 if (code
== CODE_LABEL
)
468 LABEL_REFS (insn
) = insn
; /* delete old chain */
475 /* If no stack register reference exists in this insn, there isn't
476 anything to convert. */
478 if (! stack_reg_seen
)
481 /* If there are stack registers, there must be at least one block. */
486 /* Allocate some tables that last till end of compiling this function
487 and some needed only in find_blocks and life_analysis. */
489 block_begin
= (rtx
*) alloca (blocks
* sizeof (rtx
));
490 block_end
= (rtx
*) alloca (blocks
* sizeof (rtx
));
491 block_drops_in
= (char *) alloca (blocks
);
493 block_stack_in
= (stack
) alloca (blocks
* sizeof (struct stack_def
));
494 block_out_reg_set
= (HARD_REG_SET
*) alloca (blocks
* sizeof (HARD_REG_SET
));
495 bzero ((char *) block_stack_in
, blocks
* sizeof (struct stack_def
));
496 bzero ((char *) block_out_reg_set
, blocks
* sizeof (HARD_REG_SET
));
498 block_number
= (int *) alloca ((max_uid
+ 1) * sizeof (int));
501 stack_reg_life_analysis (first
, &stackentry
);
503 /* Dump the life analysis debug information before jump
504 optimization, as that will destroy the LABEL_REFS we keep the
508 dump_stack_info (file
);
513 jump_optimize (first
, 2, 0, 0);
516 /* Check PAT, which is in INSN, for LABEL_REFs. Add INSN to the
517 label's chain of references, and note which insn contains each
521 record_label_references (insn
, pat
)
524 register enum rtx_code code
= GET_CODE (pat
);
528 if (code
== LABEL_REF
)
530 register rtx label
= XEXP (pat
, 0);
533 if (GET_CODE (label
) != CODE_LABEL
)
536 /* If this is an undefined label, LABEL_REFS (label) contains
538 if (INSN_UID (label
) == 0)
541 /* Don't make a duplicate in the code_label's chain. */
543 for (ref
= LABEL_REFS (label
);
545 ref
= LABEL_NEXTREF (ref
))
546 if (CONTAINING_INSN (ref
) == insn
)
549 CONTAINING_INSN (pat
) = insn
;
550 LABEL_NEXTREF (pat
) = LABEL_REFS (label
);
551 LABEL_REFS (label
) = pat
;
556 fmt
= GET_RTX_FORMAT (code
);
557 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
560 record_label_references (insn
, XEXP (pat
, i
));
564 for (j
= 0; j
< XVECLEN (pat
, i
); j
++)
565 record_label_references (insn
, XVECEXP (pat
, i
, j
));
570 /* Return a pointer to the REG expression within PAT. If PAT is not a
571 REG, possible enclosed by a conversion rtx, return the inner part of
572 PAT that stopped the search. */
579 switch (GET_CODE (*pat
))
582 /* eliminate FP subregister accesses in favour of the
583 actual FP register in use. */
586 if (FP_REG_P (subreg
= SUBREG_REG (*pat
)))
588 *pat
= FP_MODE_REG (REGNO (subreg
) + SUBREG_WORD (*pat
),
597 pat
= & XEXP (*pat
, 0);
601 /* Scan the OPERANDS and OPERAND_CONSTRAINTS of an asm_operands.
602 N_OPERANDS is the total number of operands. Return which alternative
603 matched, or -1 is no alternative matches.
605 OPERAND_MATCHES is an array which indicates which operand this
606 operand matches due to the constraints, or -1 if no match is required.
607 If two operands match by coincidence, but are not required to match by
608 the constraints, -1 is returned.
610 OPERAND_CLASS is an array which indicates the smallest class
611 required by the constraints. If the alternative that matches calls
612 for some class `class', and the operand matches a subclass of `class',
613 OPERAND_CLASS is set to `class' as required by the constraints, not to
614 the subclass. If an alternative allows more than one class,
615 OPERAND_CLASS is set to the smallest class that is a union of the
619 constrain_asm_operands (n_operands
, operands
, operand_constraints
,
620 operand_matches
, operand_class
)
623 char **operand_constraints
;
624 int *operand_matches
;
625 enum reg_class
*operand_class
;
627 char **constraints
= (char **) alloca (n_operands
* sizeof (char *));
629 int this_alternative
, this_operand
;
633 for (j
= 0; j
< n_operands
; j
++)
634 constraints
[j
] = operand_constraints
[j
];
636 /* Compute the number of alternatives in the operands. reload has
637 already guaranteed that all operands have the same number of
641 for (q
= constraints
[0]; *q
; q
++)
642 n_alternatives
+= (*q
== ',');
644 this_alternative
= 0;
645 while (this_alternative
< n_alternatives
)
650 /* No operands match, no narrow class requirements yet. */
651 for (i
= 0; i
< n_operands
; i
++)
653 operand_matches
[i
] = -1;
654 operand_class
[i
] = NO_REGS
;
657 for (this_operand
= 0; this_operand
< n_operands
; this_operand
++)
659 rtx op
= operands
[this_operand
];
660 enum machine_mode mode
= GET_MODE (op
);
661 char *p
= constraints
[this_operand
];
666 if (GET_CODE (op
) == SUBREG
)
668 if (GET_CODE (SUBREG_REG (op
)) == REG
669 && REGNO (SUBREG_REG (op
)) < FIRST_PSEUDO_REGISTER
)
670 offset
= SUBREG_WORD (op
);
671 op
= SUBREG_REG (op
);
674 /* An empty constraint or empty alternative
675 allows anything which matched the pattern. */
676 if (*p
== 0 || *p
== ',')
679 while (*p
&& (c
= *p
++) != ',')
693 /* Ignore rest of this alternative. */
694 while (*p
&& *p
!= ',') p
++;
703 /* This operand must be the same as a previous one.
704 This kind of constraint is used for instructions such
705 as add when they take only two operands.
707 Note that the lower-numbered operand is passed first. */
709 if (operands_match_p (operands
[c
- '0'],
710 operands
[this_operand
]))
712 operand_matches
[this_operand
] = c
- '0';
718 /* p is used for address_operands. Since this is an asm,
719 just to make sure that the operand is valid for Pmode. */
721 if (strict_memory_address_p (Pmode
, op
))
726 /* Anything goes unless it is a REG and really has a hard reg
727 but the hard reg is not in the class GENERAL_REGS. */
728 if (GENERAL_REGS
== ALL_REGS
729 || GET_CODE (op
) != REG
730 || reg_fits_class_p (op
, GENERAL_REGS
, offset
, mode
))
732 if (GET_CODE (op
) == REG
)
733 operand_class
[this_operand
]
734 = reg_class_subunion
[(int) operand_class
[this_operand
]][(int) GENERAL_REGS
];
740 if (GET_CODE (op
) == REG
741 && (GENERAL_REGS
== ALL_REGS
742 || reg_fits_class_p (op
, GENERAL_REGS
, offset
, mode
)))
744 operand_class
[this_operand
]
745 = reg_class_subunion
[(int) operand_class
[this_operand
]][(int) GENERAL_REGS
];
751 /* This is used for a MATCH_SCRATCH in the cases when we
752 don't actually need anything. So anything goes any time. */
757 if (GET_CODE (op
) == MEM
)
762 if (GET_CODE (op
) == MEM
763 && (GET_CODE (XEXP (op
, 0)) == PRE_DEC
764 || GET_CODE (XEXP (op
, 0)) == POST_DEC
))
769 if (GET_CODE (op
) == MEM
770 && (GET_CODE (XEXP (op
, 0)) == PRE_INC
771 || GET_CODE (XEXP (op
, 0)) == POST_INC
))
776 /* Match any CONST_DOUBLE, but only if
777 we can examine the bits of it reliably. */
778 if ((HOST_FLOAT_FORMAT
!= TARGET_FLOAT_FORMAT
779 || HOST_BITS_PER_WIDE_INT
!= BITS_PER_WORD
)
780 && GET_CODE (op
) != VOIDmode
&& ! flag_pretend_float
)
782 if (GET_CODE (op
) == CONST_DOUBLE
)
787 if (GET_CODE (op
) == CONST_DOUBLE
)
793 if (GET_CODE (op
) == CONST_DOUBLE
794 && CONST_DOUBLE_OK_FOR_LETTER_P (op
, c
))
799 if (GET_CODE (op
) == CONST_INT
800 || (GET_CODE (op
) == CONST_DOUBLE
801 && GET_MODE (op
) == VOIDmode
))
810 if (GET_CODE (op
) == CONST_INT
811 || (GET_CODE (op
) == CONST_DOUBLE
812 && GET_MODE (op
) == VOIDmode
))
824 if (GET_CODE (op
) == CONST_INT
825 && CONST_OK_FOR_LETTER_P (INTVAL (op
), c
))
829 #ifdef EXTRA_CONSTRAINT
835 if (EXTRA_CONSTRAINT (op
, c
))
841 if (GET_CODE (op
) == MEM
&& ! offsettable_memref_p (op
))
846 if (offsettable_memref_p (op
))
851 if (GET_CODE (op
) == REG
852 && reg_fits_class_p (op
, REG_CLASS_FROM_LETTER (c
),
855 operand_class
[this_operand
]
856 = reg_class_subunion
[(int)operand_class
[this_operand
]][(int) REG_CLASS_FROM_LETTER (c
)];
861 constraints
[this_operand
] = p
;
862 /* If this operand did not win somehow,
863 this alternative loses. */
867 /* This alternative won; the operands are ok.
868 Change whichever operands this alternative says to change. */
875 /* For operands constrained to match another operand, copy the other
876 operand's class to this operand's class. */
877 for (j
= 0; j
< n_operands
; j
++)
878 if (operand_matches
[j
] >= 0)
879 operand_class
[j
] = operand_class
[operand_matches
[j
]];
881 return this_alternative
== n_alternatives
? -1 : this_alternative
;
884 /* Record the life info of each stack reg in INSN, updating REGSTACK.
885 N_INPUTS is the number of inputs; N_OUTPUTS the outputs. CONSTRAINTS
886 is an array of the constraint strings used in the asm statement.
887 OPERANDS is an array of all operands for the insn, and is assumed to
888 contain all output operands, then all inputs operands.
890 There are many rules that an asm statement for stack-like regs must
891 follow. Those rules are explained at the top of this file: the rule
892 numbers below refer to that explanation. */
895 record_asm_reg_life (insn
, regstack
, operands
, constraints
,
901 int n_inputs
, n_outputs
;
904 int n_operands
= n_inputs
+ n_outputs
;
905 int first_input
= n_outputs
;
907 int malformed_asm
= 0;
908 rtx body
= PATTERN (insn
);
910 int *operand_matches
= (int *) alloca (n_operands
* sizeof (int *));
912 enum reg_class
*operand_class
913 = (enum reg_class
*) alloca (n_operands
* sizeof (enum reg_class
*));
915 int reg_used_as_output
[FIRST_PSEUDO_REGISTER
];
916 int implicitly_dies
[FIRST_PSEUDO_REGISTER
];
920 /* Find out what the constraints require. If no constraint
921 alternative matches, this asm is malformed. */
922 i
= constrain_asm_operands (n_operands
, operands
, constraints
,
923 operand_matches
, operand_class
);
927 /* Strip SUBREGs here to make the following code simpler. */
928 for (i
= 0; i
< n_operands
; i
++)
929 if (GET_CODE (operands
[i
]) == SUBREG
930 && GET_CODE (SUBREG_REG (operands
[i
])) == REG
)
931 operands
[i
] = SUBREG_REG (operands
[i
]);
933 /* Set up CLOBBER_REG. */
937 if (GET_CODE (body
) == PARALLEL
)
939 clobber_reg
= (rtx
*) alloca (XVECLEN (body
, 0) * sizeof (rtx
*));
941 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
942 if (GET_CODE (XVECEXP (body
, 0, i
)) == CLOBBER
)
944 rtx clobber
= XVECEXP (body
, 0, i
);
945 rtx reg
= XEXP (clobber
, 0);
947 if (GET_CODE (reg
) == SUBREG
&& GET_CODE (SUBREG_REG (reg
)) == REG
)
948 reg
= SUBREG_REG (reg
);
950 if (STACK_REG_P (reg
))
952 clobber_reg
[n_clobbers
] = reg
;
958 /* Enforce rule #4: Output operands must specifically indicate which
959 reg an output appears in after an asm. "=f" is not allowed: the
960 operand constraints must select a class with a single reg.
962 Also enforce rule #5: Output operands must start at the top of
963 the reg-stack: output operands may not "skip" a reg. */
965 bzero ((char *) reg_used_as_output
, sizeof (reg_used_as_output
));
966 for (i
= 0; i
< n_outputs
; i
++)
967 if (STACK_REG_P (operands
[i
]))
969 if (reg_class_size
[(int) operand_class
[i
]] != 1)
971 error_for_asm (insn
, "Output constraint %d must specify a single register", i
);
975 reg_used_as_output
[REGNO (operands
[i
])] = 1;
979 /* Search for first non-popped reg. */
980 for (i
= FIRST_STACK_REG
; i
< LAST_STACK_REG
+ 1; i
++)
981 if (! reg_used_as_output
[i
])
984 /* If there are any other popped regs, that's an error. */
985 for (; i
< LAST_STACK_REG
+ 1; i
++)
986 if (reg_used_as_output
[i
])
989 if (i
!= LAST_STACK_REG
+ 1)
991 error_for_asm (insn
, "Output regs must be grouped at top of stack");
995 /* Enforce rule #2: All implicitly popped input regs must be closer
996 to the top of the reg-stack than any input that is not implicitly
999 bzero ((char *) implicitly_dies
, sizeof (implicitly_dies
));
1000 for (i
= first_input
; i
< first_input
+ n_inputs
; i
++)
1001 if (STACK_REG_P (operands
[i
]))
1003 /* An input reg is implicitly popped if it is tied to an
1004 output, or if there is a CLOBBER for it. */
1007 for (j
= 0; j
< n_clobbers
; j
++)
1008 if (operands_match_p (clobber_reg
[j
], operands
[i
]))
1011 if (j
< n_clobbers
|| operand_matches
[i
] >= 0)
1012 implicitly_dies
[REGNO (operands
[i
])] = 1;
1015 /* Search for first non-popped reg. */
1016 for (i
= FIRST_STACK_REG
; i
< LAST_STACK_REG
+ 1; i
++)
1017 if (! implicitly_dies
[i
])
1020 /* If there are any other popped regs, that's an error. */
1021 for (; i
< LAST_STACK_REG
+ 1; i
++)
1022 if (implicitly_dies
[i
])
1025 if (i
!= LAST_STACK_REG
+ 1)
1027 error_for_asm (insn
,
1028 "Implicitly popped regs must be grouped at top of stack");
1032 /* Enfore rule #3: If any input operand uses the "f" constraint, all
1033 output constraints must use the "&" earlyclobber.
1035 ??? Detect this more deterministically by having constraint_asm_operands
1036 record any earlyclobber. */
1038 for (i
= first_input
; i
< first_input
+ n_inputs
; i
++)
1039 if (operand_matches
[i
] == -1)
1043 for (j
= 0; j
< n_outputs
; j
++)
1044 if (operands_match_p (operands
[j
], operands
[i
]))
1046 error_for_asm (insn
,
1047 "Output operand %d must use `&' constraint", j
);
1054 /* Avoid further trouble with this insn. */
1055 PATTERN (insn
) = gen_rtx_USE (VOIDmode
, const0_rtx
);
1056 PUT_MODE (insn
, VOIDmode
);
1060 /* Process all outputs */
1061 for (i
= 0; i
< n_outputs
; i
++)
1063 rtx op
= operands
[i
];
1065 if (! STACK_REG_P (op
))
1067 if (stack_regs_mentioned_p (op
))
1073 /* Each destination is dead before this insn. If the
1074 destination is not used after this insn, record this with
1077 if (! TEST_HARD_REG_BIT (regstack
->reg_set
, REGNO (op
)))
1078 REG_NOTES (insn
) = gen_rtx_EXPR_LIST (REG_UNUSED
, op
,
1081 CLEAR_HARD_REG_BIT (regstack
->reg_set
, REGNO (op
));
1084 /* Process all inputs */
1085 for (i
= first_input
; i
< first_input
+ n_inputs
; i
++)
1087 if (! STACK_REG_P (operands
[i
]))
1089 if (stack_regs_mentioned_p (operands
[i
]))
1095 /* If an input is dead after the insn, record a death note.
1096 But don't record a death note if there is already a death note,
1097 or if the input is also an output. */
1099 if (! TEST_HARD_REG_BIT (regstack
->reg_set
, REGNO (operands
[i
]))
1100 && operand_matches
[i
] == -1
1101 && find_regno_note (insn
, REG_DEAD
, REGNO (operands
[i
])) == NULL_RTX
)
1102 REG_NOTES (insn
) = gen_rtx_EXPR_LIST (REG_DEAD
, operands
[i
],
1105 SET_HARD_REG_BIT (regstack
->reg_set
, REGNO (operands
[i
]));
1109 /* Scan PAT, which is part of INSN, and record registers appearing in
1110 a SET_DEST in DEST, and other registers in SRC.
1112 This function does not know about SET_DESTs that are both input and
1113 output (such as ZERO_EXTRACT) - this cannot happen on a 387. */
1116 record_reg_life_pat (pat
, src
, dest
, douse
)
1118 HARD_REG_SET
*src
, *dest
;
1124 if (STACK_REG_P (pat
)
1125 || (GET_CODE (pat
) == SUBREG
&& STACK_REG_P (SUBREG_REG (pat
))))
1128 mark_regs_pat (pat
, src
);
1131 mark_regs_pat (pat
, dest
);
1136 if (GET_CODE (pat
) == SET
)
1138 record_reg_life_pat (XEXP (pat
, 0), NULL_PTR
, dest
, 0);
1139 record_reg_life_pat (XEXP (pat
, 1), src
, NULL_PTR
, 0);
1143 /* We don't need to consider either of these cases. */
1144 if ((GET_CODE (pat
) == USE
&& !douse
) || GET_CODE (pat
) == CLOBBER
)
1147 fmt
= GET_RTX_FORMAT (GET_CODE (pat
));
1148 for (i
= GET_RTX_LENGTH (GET_CODE (pat
)) - 1; i
>= 0; i
--)
1154 for (j
= XVECLEN (pat
, i
) - 1; j
>= 0; j
--)
1155 record_reg_life_pat (XVECEXP (pat
, i
, j
), src
, dest
, 0);
1157 else if (fmt
[i
] == 'e')
1158 record_reg_life_pat (XEXP (pat
, i
), src
, dest
, 0);
1162 /* Calculate the number of inputs and outputs in BODY, an
1163 asm_operands. N_OPERANDS is the total number of operands, and
1164 N_INPUTS and N_OUTPUTS are pointers to ints into which the results are
1168 get_asm_operand_lengths (body
, n_operands
, n_inputs
, n_outputs
)
1171 int *n_inputs
, *n_outputs
;
1173 if (GET_CODE (body
) == SET
&& GET_CODE (SET_SRC (body
)) == ASM_OPERANDS
)
1174 *n_inputs
= ASM_OPERANDS_INPUT_LENGTH (SET_SRC (body
));
1176 else if (GET_CODE (body
) == ASM_OPERANDS
)
1177 *n_inputs
= ASM_OPERANDS_INPUT_LENGTH (body
);
1179 else if (GET_CODE (body
) == PARALLEL
1180 && GET_CODE (XVECEXP (body
, 0, 0)) == SET
)
1181 *n_inputs
= ASM_OPERANDS_INPUT_LENGTH (SET_SRC (XVECEXP (body
, 0, 0)));
1183 else if (GET_CODE (body
) == PARALLEL
1184 && GET_CODE (XVECEXP (body
, 0, 0)) == ASM_OPERANDS
)
1185 *n_inputs
= ASM_OPERANDS_INPUT_LENGTH (XVECEXP (body
, 0, 0));
1189 *n_outputs
= n_operands
- *n_inputs
;
1192 /* Scan INSN, which is in BLOCK, and record the life & death of stack
1193 registers in REGSTACK. This function is called to process insns from
1194 the last insn in a block to the first. The actual scanning is done in
1195 record_reg_life_pat.
1197 If a register is live after a CALL_INSN, but is not a value return
1198 register for that CALL_INSN, then code is emitted to initialize that
1199 register. The block_end[] data is kept accurate.
1201 Existing death and unset notes for stack registers are deleted
1202 before processing the insn. */
1205 record_reg_life (insn
, block
, regstack
)
1210 rtx note
, *note_link
;
1213 if ((GET_CODE (insn
) != INSN
&& GET_CODE (insn
) != CALL_INSN
)
1214 || INSN_DELETED_P (insn
))
1217 /* Strip death notes for stack regs from this insn */
1219 note_link
= ®_NOTES(insn
);
1220 for (note
= *note_link
; note
; note
= XEXP (note
, 1))
1221 if (STACK_REG_P (XEXP (note
, 0))
1222 && (REG_NOTE_KIND (note
) == REG_DEAD
1223 || REG_NOTE_KIND (note
) == REG_UNUSED
))
1224 *note_link
= XEXP (note
, 1);
1226 note_link
= &XEXP (note
, 1);
1228 /* Process all patterns in the insn. */
1230 n_operands
= asm_noperands (PATTERN (insn
));
1231 if (n_operands
>= 0)
1233 /* This insn is an `asm' with operands. Decode the operands,
1234 decide how many are inputs, and record the life information. */
1236 rtx operands
[MAX_RECOG_OPERANDS
];
1237 rtx body
= PATTERN (insn
);
1238 int n_inputs
, n_outputs
;
1239 char **constraints
= (char **) alloca (n_operands
* sizeof (char *));
1241 decode_asm_operands (body
, operands
, NULL_PTR
, constraints
, NULL_PTR
);
1242 get_asm_operand_lengths (body
, n_operands
, &n_inputs
, &n_outputs
);
1243 record_asm_reg_life (insn
, regstack
, operands
, constraints
,
1244 n_inputs
, n_outputs
);
1249 HARD_REG_SET src
, dest
;
1252 CLEAR_HARD_REG_SET (src
);
1253 CLEAR_HARD_REG_SET (dest
);
1255 if (GET_CODE (insn
) == CALL_INSN
)
1256 for (note
= CALL_INSN_FUNCTION_USAGE (insn
);
1258 note
= XEXP (note
, 1))
1259 if (GET_CODE (XEXP (note
, 0)) == USE
)
1260 record_reg_life_pat (SET_DEST (XEXP (note
, 0)), &src
, NULL_PTR
, 0);
1262 record_reg_life_pat (PATTERN (insn
), &src
, &dest
, 0);
1263 for (regno
= FIRST_STACK_REG
; regno
<= LAST_STACK_REG
; regno
++)
1264 if (! TEST_HARD_REG_BIT (regstack
->reg_set
, regno
))
1266 if (TEST_HARD_REG_BIT (src
, regno
)
1267 && ! TEST_HARD_REG_BIT (dest
, regno
))
1268 REG_NOTES (insn
) = gen_rtx_EXPR_LIST (REG_DEAD
,
1269 FP_MODE_REG (regno
, DFmode
),
1271 else if (TEST_HARD_REG_BIT (dest
, regno
))
1272 REG_NOTES (insn
) = gen_rtx_EXPR_LIST (REG_UNUSED
,
1273 FP_MODE_REG (regno
, DFmode
),
1277 if (GET_CODE (insn
) == CALL_INSN
)
1281 /* There might be a reg that is live after a function call.
1282 Initialize it to zero so that the program does not crash. See
1283 comment towards the end of stack_reg_life_analysis(). */
1285 for (reg
= FIRST_STACK_REG
; reg
<= LAST_STACK_REG
; reg
++)
1286 if (! TEST_HARD_REG_BIT (dest
, reg
)
1287 && TEST_HARD_REG_BIT (regstack
->reg_set
, reg
))
1291 /* The insn will use virtual register numbers, and so
1292 convert_regs is expected to process these. But BLOCK_NUM
1293 cannot be used on these insns, because they do not appear in
1296 pat
= gen_rtx_SET (VOIDmode
, FP_MODE_REG (reg
, DFmode
),
1297 CONST0_RTX (DFmode
));
1298 init
= emit_insn_after (pat
, insn
);
1299 PUT_MODE (init
, QImode
);
1301 CLEAR_HARD_REG_BIT (regstack
->reg_set
, reg
);
1303 /* If the CALL_INSN was the end of a block, move the
1304 block_end to point to the new insn. */
1306 if (block_end
[block
] == insn
)
1307 block_end
[block
] = init
;
1310 /* Some regs do not survive a CALL */
1311 AND_COMPL_HARD_REG_SET (regstack
->reg_set
, call_used_reg_set
);
1314 AND_COMPL_HARD_REG_SET (regstack
->reg_set
, dest
);
1315 IOR_HARD_REG_SET (regstack
->reg_set
, src
);
1319 /* Find all basic blocks of the function, which starts with FIRST.
1320 For each JUMP_INSN, build the chain of LABEL_REFS on each CODE_LABEL. */
1328 register RTX_CODE prev_code
= BARRIER
;
1329 register RTX_CODE code
;
1330 rtx label_value_list
= 0;
1332 /* Record where all the blocks start and end.
1333 Record which basic blocks control can drop in to. */
1336 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1338 /* Note that this loop must select the same block boundaries
1339 as code in reg_to_stack, but that these are not the same
1340 as those selected in flow.c. */
1342 code
= GET_CODE (insn
);
1344 if (code
== CODE_LABEL
1345 || (prev_code
!= INSN
1346 && prev_code
!= CALL_INSN
1347 && prev_code
!= CODE_LABEL
1348 && GET_RTX_CLASS (code
) == 'i'))
1350 block_begin
[++block
] = insn
;
1351 block_end
[block
] = insn
;
1352 block_drops_in
[block
] = prev_code
!= BARRIER
;
1354 else if (GET_RTX_CLASS (code
) == 'i')
1355 block_end
[block
] = insn
;
1357 if (GET_RTX_CLASS (code
) == 'i')
1361 /* Make a list of all labels referred to other than by jumps. */
1362 for (note
= REG_NOTES (insn
); note
; note
= XEXP (note
, 1))
1363 if (REG_NOTE_KIND (note
) == REG_LABEL
)
1364 label_value_list
= gen_rtx_EXPR_LIST (VOIDmode
, XEXP (note
, 0),
1368 block_number
[INSN_UID (insn
)] = block
;
1374 if (block
+ 1 != blocks
)
1377 /* generate all label references to the corresponding jump insn */
1378 for (block
= 0; block
< blocks
; block
++)
1380 insn
= block_end
[block
];
1382 if (GET_CODE (insn
) == JUMP_INSN
)
1384 rtx pat
= PATTERN (insn
);
1387 if (computed_jump_p (insn
))
1389 for (x
= label_value_list
; x
; x
= XEXP (x
, 1))
1390 record_label_references (insn
,
1391 gen_rtx_LABEL_REF (VOIDmode
,
1394 for (x
= forced_labels
; x
; x
= XEXP (x
, 1))
1395 record_label_references (insn
,
1396 gen_rtx_LABEL_REF (VOIDmode
,
1400 record_label_references (insn
, pat
);
1405 /* If current function returns its result in an fp stack register,
1406 return the REG. Otherwise, return 0. */
1412 rtx result
= DECL_RTL (DECL_RESULT (decl
));
1415 && ! (GET_CODE (result
) == REG
1416 && REGNO (result
) < FIRST_PSEUDO_REGISTER
))
1418 #ifdef FUNCTION_OUTGOING_VALUE
1420 = FUNCTION_OUTGOING_VALUE (TREE_TYPE (DECL_RESULT (decl
)), decl
);
1422 result
= FUNCTION_VALUE (TREE_TYPE (DECL_RESULT (decl
)), decl
);
1426 return result
!= 0 && STACK_REG_P (result
) ? result
: 0;
1429 /* Determine the which registers are live at the start of each basic
1430 block of the function whose first insn is FIRST.
1432 First, if the function returns a real_type, mark the function
1433 return type as live at each return point, as the RTL may not give any
1434 hint that the register is live.
1436 Then, start with the last block and work back to the first block.
1437 Similarly, work backwards within each block, insn by insn, recording
1438 which regs are dead and which are used (and therefore live) in the
1439 hard reg set of block_stack_in[].
1441 After processing each basic block, if there is a label at the start
1442 of the block, propagate the live registers to all jumps to this block.
1444 As a special case, if there are regs live in this block, that are
1445 not live in a block containing a jump to this label, and the block
1446 containing the jump has already been processed, we must propagate this
1447 block's entry register life back to the block containing the jump, and
1448 restart life analysis from there.
1450 In the worst case, this function may traverse the insns
1451 REG_STACK_SIZE times. This is necessary, since a jump towards the end
1452 of the insns may not know that a reg is live at a target that is early
1453 in the insns. So we back up and start over with the new reg live.
1455 If there are registers that are live at the start of the function,
1456 insns are emitted to initialize these registers. Something similar is
1457 done after CALL_INSNs in record_reg_life. */
1460 stack_reg_life_analysis (first
, stackentry
)
1462 HARD_REG_SET
*stackentry
;
1465 struct stack_def regstack
;
1470 if ((retvalue
= stack_result (current_function_decl
)))
1472 /* Find all RETURN insns and mark them. */
1474 for (block
= blocks
- 1; --block
>= 0;)
1475 if (GET_CODE (block_end
[block
]) == JUMP_INSN
1476 && GET_CODE (PATTERN (block_end
[block
])) == RETURN
)
1477 mark_regs_pat (retvalue
, block_out_reg_set
+block
);
1479 /* Mark off the end of last block if we "fall off" the end of the
1480 function into the epilogue. */
1482 if (GET_CODE (block_end
[blocks
-1]) != JUMP_INSN
1483 || GET_CODE (PATTERN (block_end
[blocks
-1])) == RETURN
)
1484 mark_regs_pat (retvalue
, block_out_reg_set
+blocks
-1);
1488 /* now scan all blocks backward for stack register use */
1493 register rtx insn
, prev
;
1495 /* current register status at last instruction */
1497 COPY_HARD_REG_SET (regstack
.reg_set
, block_out_reg_set
[block
]);
1499 prev
= block_end
[block
];
1503 prev
= PREV_INSN (insn
);
1505 /* If the insn is a CALL_INSN, we need to ensure that
1506 everything dies. But otherwise don't process unless there
1507 are some stack regs present. */
1509 if (GET_MODE (insn
) == QImode
|| GET_CODE (insn
) == CALL_INSN
)
1510 record_reg_life (insn
, block
, ®stack
);
1512 } while (insn
!= block_begin
[block
]);
1514 /* Set the state at the start of the block. Mark that no
1515 register mapping information known yet. */
1517 COPY_HARD_REG_SET (block_stack_in
[block
].reg_set
, regstack
.reg_set
);
1518 block_stack_in
[block
].top
= -2;
1520 /* If there is a label, propagate our register life to all jumps
1523 if (GET_CODE (insn
) == CODE_LABEL
)
1526 int must_restart
= 0;
1528 for (label
= LABEL_REFS (insn
); label
!= insn
;
1529 label
= LABEL_NEXTREF (label
))
1531 int jump_block
= BLOCK_NUM (CONTAINING_INSN (label
));
1533 if (jump_block
< block
)
1534 IOR_HARD_REG_SET (block_out_reg_set
[jump_block
],
1535 block_stack_in
[block
].reg_set
);
1538 /* The block containing the jump has already been
1539 processed. If there are registers that were not known
1540 to be live then, but are live now, we must back up
1541 and restart life analysis from that point with the new
1542 life information. */
1544 GO_IF_HARD_REG_SUBSET (block_stack_in
[block
].reg_set
,
1545 block_out_reg_set
[jump_block
],
1548 IOR_HARD_REG_SET (block_out_reg_set
[jump_block
],
1549 block_stack_in
[block
].reg_set
);
1563 if (block_drops_in
[block
])
1564 IOR_HARD_REG_SET (block_out_reg_set
[block
-1],
1565 block_stack_in
[block
].reg_set
);
1570 /* If any reg is live at the start of the first block of a
1571 function, then we must guarantee that the reg holds some value by
1572 generating our own "load" of that register. Otherwise a 387 would
1573 fault trying to access an empty register. */
1575 /* Load zero into each live register. The fact that a register
1576 appears live at the function start necessarily implies an error
1577 in the user program: it means that (unless the offending code is *never*
1578 executed) this program is using uninitialised floating point
1579 variables. In order to keep broken code like this happy, we initialise
1580 those variables with zero.
1582 Note that we are inserting virtual register references here:
1583 these insns must be processed by convert_regs later. Also, these
1584 insns will not be in block_number, so BLOCK_NUM() will fail for them. */
1586 for (reg
= LAST_STACK_REG
; reg
>= FIRST_STACK_REG
; reg
--)
1587 if (TEST_HARD_REG_BIT (block_stack_in
[0].reg_set
, reg
)
1588 && ! TEST_HARD_REG_BIT (*stackentry
, reg
))
1592 init_rtx
= gen_rtx_SET (VOIDmode
, FP_MODE_REG(reg
, DFmode
),
1593 CONST0_RTX (DFmode
));
1594 block_begin
[0] = emit_insn_after (init_rtx
, first
);
1595 PUT_MODE (block_begin
[0], QImode
);
1597 CLEAR_HARD_REG_BIT (block_stack_in
[0].reg_set
, reg
);
1601 /*****************************************************************************
1602 This section deals with stack register substitution, and forms the second
1604 *****************************************************************************/
1606 /* Replace REG, which is a pointer to a stack reg RTX, with an RTX for
1607 the desired hard REGNO. */
1610 replace_reg (reg
, regno
)
1614 if (regno
< FIRST_STACK_REG
|| regno
> LAST_STACK_REG
1615 || ! STACK_REG_P (*reg
))
1618 switch (GET_MODE_CLASS (GET_MODE (*reg
)))
1622 case MODE_COMPLEX_FLOAT
:;
1625 *reg
= FP_MODE_REG (regno
, GET_MODE (*reg
));
1628 /* Remove a note of type NOTE, which must be found, for register
1629 number REGNO from INSN. Remove only one such note. */
1632 remove_regno_note (insn
, note
, regno
)
1637 register rtx
*note_link
, this;
1639 note_link
= ®_NOTES(insn
);
1640 for (this = *note_link
; this; this = XEXP (this, 1))
1641 if (REG_NOTE_KIND (this) == note
1642 && REG_P (XEXP (this, 0)) && REGNO (XEXP (this, 0)) == regno
)
1644 *note_link
= XEXP (this, 1);
1648 note_link
= &XEXP (this, 1);
1653 /* Find the hard register number of virtual register REG in REGSTACK.
1654 The hard register number is relative to the top of the stack. -1 is
1655 returned if the register is not found. */
1658 get_hard_regnum (regstack
, reg
)
1664 if (! STACK_REG_P (reg
))
1667 for (i
= regstack
->top
; i
>= 0; i
--)
1668 if (regstack
->reg
[i
] == REGNO (reg
))
1671 return i
>= 0 ? (FIRST_STACK_REG
+ regstack
->top
- i
) : -1;
1674 /* Delete INSN from the RTL. Mark the insn, but don't remove it from
1675 the chain of insns. Doing so could confuse block_begin and block_end
1676 if this were the only insn in the block. */
1679 delete_insn_for_stacker (insn
)
1682 PUT_CODE (insn
, NOTE
);
1683 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
1684 NOTE_SOURCE_FILE (insn
) = 0;
1687 /* Emit an insn to pop virtual register REG before or after INSN.
1688 REGSTACK is the stack state after INSN and is updated to reflect this
1689 pop. WHEN is either emit_insn_before or emit_insn_after. A pop insn
1690 is represented as a SET whose destination is the register to be popped
1691 and source is the top of stack. A death note for the top of stack
1692 cases the movdf pattern to pop. */
1695 emit_pop_insn (insn
, regstack
, reg
, when
)
1701 rtx pop_insn
, pop_rtx
;
1704 hard_regno
= get_hard_regnum (regstack
, reg
);
1706 if (hard_regno
< FIRST_STACK_REG
)
1709 pop_rtx
= gen_rtx_SET (VOIDmode
, FP_MODE_REG (hard_regno
, DFmode
),
1710 FP_MODE_REG (FIRST_STACK_REG
, DFmode
));
1712 pop_insn
= (*when
) (pop_rtx
, insn
);
1713 /* ??? This used to be VOIDmode, but that seems wrong. */
1714 PUT_MODE (pop_insn
, QImode
);
1716 REG_NOTES (pop_insn
) = gen_rtx_EXPR_LIST (REG_DEAD
,
1717 FP_MODE_REG (FIRST_STACK_REG
, DFmode
),
1718 REG_NOTES (pop_insn
));
1720 regstack
->reg
[regstack
->top
- (hard_regno
- FIRST_STACK_REG
)]
1721 = regstack
->reg
[regstack
->top
];
1723 CLEAR_HARD_REG_BIT (regstack
->reg_set
, REGNO (reg
));
1728 /* Emit an insn before or after INSN to swap virtual register REG with the
1729 top of stack. WHEN should be `emit_insn_before' or `emit_insn_before'
1730 REGSTACK is the stack state before the swap, and is updated to reflect
1731 the swap. A swap insn is represented as a PARALLEL of two patterns:
1732 each pattern moves one reg to the other.
1734 If REG is already at the top of the stack, no insn is emitted. */
1737 emit_swap_insn (insn
, regstack
, reg
)
1744 rtx swap_rtx
, swap_insn
;
1745 int tmp
, other_reg
; /* swap regno temps */
1746 rtx i1
; /* the stack-reg insn prior to INSN */
1747 rtx i1set
= NULL_RTX
; /* the SET rtx within I1 */
1749 hard_regno
= get_hard_regnum (regstack
, reg
);
1751 if (hard_regno
< FIRST_STACK_REG
)
1753 if (hard_regno
== FIRST_STACK_REG
)
1756 other_reg
= regstack
->top
- (hard_regno
- FIRST_STACK_REG
);
1758 tmp
= regstack
->reg
[other_reg
];
1759 regstack
->reg
[other_reg
] = regstack
->reg
[regstack
->top
];
1760 regstack
->reg
[regstack
->top
] = tmp
;
1762 /* Find the previous insn involving stack regs, but don't go past
1763 any labels, calls or jumps. */
1764 i1
= prev_nonnote_insn (insn
);
1765 while (i1
&& GET_CODE (i1
) == INSN
&& GET_MODE (i1
) != QImode
)
1766 i1
= prev_nonnote_insn (i1
);
1769 i1set
= single_set (i1
);
1773 rtx i1src
= *get_true_reg (&SET_SRC (i1set
));
1774 rtx i1dest
= *get_true_reg (&SET_DEST (i1set
));
1776 /* If the previous register stack push was from the reg we are to
1777 swap with, omit the swap. */
1779 if (GET_CODE (i1dest
) == REG
&& REGNO (i1dest
) == FIRST_STACK_REG
1780 && GET_CODE (i1src
) == REG
&& REGNO (i1src
) == hard_regno
- 1
1781 && find_regno_note (i1
, REG_DEAD
, FIRST_STACK_REG
) == NULL_RTX
)
1784 /* If the previous insn wrote to the reg we are to swap with,
1787 if (GET_CODE (i1dest
) == REG
&& REGNO (i1dest
) == hard_regno
1788 && GET_CODE (i1src
) == REG
&& REGNO (i1src
) == FIRST_STACK_REG
1789 && find_regno_note (i1
, REG_DEAD
, FIRST_STACK_REG
) == NULL_RTX
)
1793 if (GET_RTX_CLASS (GET_CODE (i1
)) == 'i' && sets_cc0_p (PATTERN (i1
)))
1795 i1
= next_nonnote_insn (i1
);
1800 swap_rtx
= gen_swapdf (FP_MODE_REG (hard_regno
, DFmode
),
1801 FP_MODE_REG (FIRST_STACK_REG
, DFmode
));
1802 swap_insn
= emit_insn_after (swap_rtx
, i1
);
1803 /* ??? This used to be VOIDmode, but that seems wrong. */
1804 PUT_MODE (swap_insn
, QImode
);
1807 /* Handle a move to or from a stack register in PAT, which is in INSN.
1808 REGSTACK is the current stack. */
1811 move_for_stack_reg (insn
, regstack
, pat
)
1816 rtx
*psrc
= get_true_reg (&SET_SRC (pat
));
1817 rtx
*pdest
= get_true_reg (&SET_DEST (pat
));
1821 src
= *psrc
; dest
= *pdest
;
1823 if (STACK_REG_P (src
) && STACK_REG_P (dest
))
1825 /* Write from one stack reg to another. If SRC dies here, then
1826 just change the register mapping and delete the insn. */
1828 note
= find_regno_note (insn
, REG_DEAD
, REGNO (src
));
1833 /* If this is a no-op move, there must not be a REG_DEAD note. */
1834 if (REGNO (src
) == REGNO (dest
))
1837 for (i
= regstack
->top
; i
>= 0; i
--)
1838 if (regstack
->reg
[i
] == REGNO (src
))
1841 /* The source must be live, and the dest must be dead. */
1842 if (i
< 0 || get_hard_regnum (regstack
, dest
) >= FIRST_STACK_REG
)
1845 /* It is possible that the dest is unused after this insn.
1846 If so, just pop the src. */
1848 if (find_regno_note (insn
, REG_UNUSED
, REGNO (dest
)))
1850 emit_pop_insn (insn
, regstack
, src
, emit_insn_after
);
1852 delete_insn_for_stacker (insn
);
1856 regstack
->reg
[i
] = REGNO (dest
);
1858 SET_HARD_REG_BIT (regstack
->reg_set
, REGNO (dest
));
1859 CLEAR_HARD_REG_BIT (regstack
->reg_set
, REGNO (src
));
1861 delete_insn_for_stacker (insn
);
1866 /* The source reg does not die. */
1868 /* If this appears to be a no-op move, delete it, or else it
1869 will confuse the machine description output patterns. But if
1870 it is REG_UNUSED, we must pop the reg now, as per-insn processing
1871 for REG_UNUSED will not work for deleted insns. */
1873 if (REGNO (src
) == REGNO (dest
))
1875 if (find_regno_note (insn
, REG_UNUSED
, REGNO (dest
)))
1876 emit_pop_insn (insn
, regstack
, dest
, emit_insn_after
);
1878 delete_insn_for_stacker (insn
);
1882 /* The destination ought to be dead */
1883 if (get_hard_regnum (regstack
, dest
) >= FIRST_STACK_REG
)
1886 replace_reg (psrc
, get_hard_regnum (regstack
, src
));
1888 regstack
->reg
[++regstack
->top
] = REGNO (dest
);
1889 SET_HARD_REG_BIT (regstack
->reg_set
, REGNO (dest
));
1890 replace_reg (pdest
, FIRST_STACK_REG
);
1892 else if (STACK_REG_P (src
))
1894 /* Save from a stack reg to MEM, or possibly integer reg. Since
1895 only top of stack may be saved, emit an exchange first if
1898 emit_swap_insn (insn
, regstack
, src
);
1900 note
= find_regno_note (insn
, REG_DEAD
, REGNO (src
));
1903 replace_reg (&XEXP (note
, 0), FIRST_STACK_REG
);
1905 CLEAR_HARD_REG_BIT (regstack
->reg_set
, REGNO (src
));
1907 else if (GET_MODE (src
) == XFmode
&& regstack
->top
< REG_STACK_SIZE
- 1)
1909 /* A 387 cannot write an XFmode value to a MEM without
1910 clobbering the source reg. The output code can handle
1911 this by reading back the value from the MEM.
1912 But it is more efficient to use a temp register if one is
1913 available. Push the source value here if the register
1914 stack is not full, and then write the value to memory via
1916 rtx push_rtx
, push_insn
;
1917 rtx top_stack_reg
= FP_MODE_REG (FIRST_STACK_REG
, XFmode
);
1919 push_rtx
= gen_movxf (top_stack_reg
, top_stack_reg
);
1920 push_insn
= emit_insn_before (push_rtx
, insn
);
1921 PUT_MODE (push_insn
, QImode
);
1922 REG_NOTES (insn
) = gen_rtx_EXPR_LIST (REG_DEAD
, top_stack_reg
,
1926 replace_reg (psrc
, FIRST_STACK_REG
);
1928 else if (STACK_REG_P (dest
))
1930 /* Load from MEM, or possibly integer REG or constant, into the
1931 stack regs. The actual target is always the top of the
1932 stack. The stack mapping is changed to reflect that DEST is
1933 now at top of stack. */
1935 /* The destination ought to be dead */
1936 if (get_hard_regnum (regstack
, dest
) >= FIRST_STACK_REG
)
1939 if (regstack
->top
>= REG_STACK_SIZE
)
1942 regstack
->reg
[++regstack
->top
] = REGNO (dest
);
1943 SET_HARD_REG_BIT (regstack
->reg_set
, REGNO (dest
));
1944 replace_reg (pdest
, FIRST_STACK_REG
);
1951 swap_rtx_condition (pat
)
1957 if (GET_RTX_CLASS (GET_CODE (pat
)) == '<')
1959 PUT_CODE (pat
, swap_condition (GET_CODE (pat
)));
1963 fmt
= GET_RTX_FORMAT (GET_CODE (pat
));
1964 for (i
= GET_RTX_LENGTH (GET_CODE (pat
)) - 1; i
>= 0; i
--)
1970 for (j
= XVECLEN (pat
, i
) - 1; j
>= 0; j
--)
1971 swap_rtx_condition (XVECEXP (pat
, i
, j
));
1973 else if (fmt
[i
] == 'e')
1974 swap_rtx_condition (XEXP (pat
, i
));
1978 /* Handle a comparison. Special care needs to be taken to avoid
1979 causing comparisons that a 387 cannot do correctly, such as EQ.
1981 Also, a pop insn may need to be emitted. The 387 does have an
1982 `fcompp' insn that can pop two regs, but it is sometimes too expensive
1983 to do this - a `fcomp' followed by a `fstpl %st(0)' may be easier to
1987 compare_for_stack_reg (insn
, regstack
, pat
)
1993 rtx src1_note
, src2_note
;
1997 src1
= get_true_reg (&XEXP (SET_SRC (pat
), 0));
1998 src2
= get_true_reg (&XEXP (SET_SRC (pat
), 1));
1999 cc0_user
= next_cc0_user (insn
);
2001 /* If the insn that uses cc0 is a conditional move, then the destination
2002 must be the top of stack */
2003 if (GET_CODE (PATTERN (cc0_user
)) == SET
2004 && SET_DEST (PATTERN (cc0_user
)) != pc_rtx
2005 && GET_CODE (SET_SRC (PATTERN (cc0_user
))) == IF_THEN_ELSE
)
2009 dest
= get_true_reg (&SET_DEST (PATTERN (cc0_user
)));
2012 if (get_hard_regnum (regstack
, *dest
) >= FIRST_STACK_REG
2013 && REGNO (*dest
) != regstack
->reg
[regstack
->top
])
2015 emit_swap_insn (insn
, regstack
, *dest
);
2021 /* ??? If fxch turns out to be cheaper than fstp, give priority to
2022 registers that die in this insn - move those to stack top first. */
2023 if (! STACK_REG_P (*src1
)
2024 || (STACK_REG_P (*src2
)
2025 && get_hard_regnum (regstack
, *src2
) == FIRST_STACK_REG
))
2029 temp
= XEXP (SET_SRC (pat
), 0);
2030 XEXP (SET_SRC (pat
), 0) = XEXP (SET_SRC (pat
), 1);
2031 XEXP (SET_SRC (pat
), 1) = temp
;
2033 src1
= get_true_reg (&XEXP (SET_SRC (pat
), 0));
2034 src2
= get_true_reg (&XEXP (SET_SRC (pat
), 1));
2036 next
= next_cc0_user (insn
);
2037 if (next
== NULL_RTX
)
2040 swap_rtx_condition (PATTERN (next
));
2041 INSN_CODE (next
) = -1;
2042 INSN_CODE (insn
) = -1;
2045 /* We will fix any death note later. */
2047 src1_note
= find_regno_note (insn
, REG_DEAD
, REGNO (*src1
));
2049 if (STACK_REG_P (*src2
))
2050 src2_note
= find_regno_note (insn
, REG_DEAD
, REGNO (*src2
));
2052 src2_note
= NULL_RTX
;
2055 emit_swap_insn (insn
, regstack
, *src1
);
2057 replace_reg (src1
, FIRST_STACK_REG
);
2059 if (STACK_REG_P (*src2
))
2060 replace_reg (src2
, get_hard_regnum (regstack
, *src2
));
2064 pop_stack (regstack
, REGNO (XEXP (src1_note
, 0)));
2065 replace_reg (&XEXP (src1_note
, 0), FIRST_STACK_REG
);
2068 /* If the second operand dies, handle that. But if the operands are
2069 the same stack register, don't bother, because only one death is
2070 needed, and it was just handled. */
2073 && ! (STACK_REG_P (*src1
) && STACK_REG_P (*src2
)
2074 && REGNO (*src1
) == REGNO (*src2
)))
2076 /* As a special case, two regs may die in this insn if src2 is
2077 next to top of stack and the top of stack also dies. Since
2078 we have already popped src1, "next to top of stack" is really
2079 at top (FIRST_STACK_REG) now. */
2081 if (get_hard_regnum (regstack
, XEXP (src2_note
, 0)) == FIRST_STACK_REG
2084 pop_stack (regstack
, REGNO (XEXP (src2_note
, 0)));
2085 replace_reg (&XEXP (src2_note
, 0), FIRST_STACK_REG
+ 1);
2089 /* The 386 can only represent death of the first operand in
2090 the case handled above. In all other cases, emit a separate
2091 pop and remove the death note from here. */
2093 link_cc0_insns (insn
);
2095 remove_regno_note (insn
, REG_DEAD
, REGNO (XEXP (src2_note
, 0)));
2097 emit_pop_insn (insn
, regstack
, XEXP (src2_note
, 0),
2103 /* Substitute new registers in PAT, which is part of INSN. REGSTACK
2104 is the current register layout. */
2107 subst_stack_regs_pat (insn
, regstack
, pat
)
2113 rtx
*src1
= (rtx
*) NULL_PTR
, *src2
;
2114 rtx src1_note
, src2_note
;
2116 if (GET_CODE (pat
) != SET
)
2119 dest
= get_true_reg (&SET_DEST (pat
));
2120 src
= get_true_reg (&SET_SRC (pat
));
2122 /* See if this is a `movM' pattern, and handle elsewhere if so. */
2124 if (*dest
!= cc0_rtx
2125 && (STACK_REG_P (*src
)
2126 || (STACK_REG_P (*dest
)
2127 && (GET_CODE (*src
) == REG
|| GET_CODE (*src
) == MEM
2128 || GET_CODE (*src
) == CONST_DOUBLE
))))
2129 move_for_stack_reg (insn
, regstack
, pat
);
2131 switch (GET_CODE (SET_SRC (pat
)))
2134 compare_for_stack_reg (insn
, regstack
, pat
);
2140 for (count
= HARD_REGNO_NREGS (REGNO (*dest
), GET_MODE (*dest
));
2143 regstack
->reg
[++regstack
->top
] = REGNO (*dest
) + count
;
2144 SET_HARD_REG_BIT (regstack
->reg_set
, REGNO (*dest
) + count
);
2147 replace_reg (dest
, FIRST_STACK_REG
);
2151 /* This is a `tstM2' case. */
2152 if (*dest
!= cc0_rtx
)
2159 case FLOAT_TRUNCATE
:
2163 /* These insns only operate on the top of the stack. DEST might
2164 be cc0_rtx if we're processing a tstM pattern. Also, it's
2165 possible that the tstM case results in a REG_DEAD note on the
2169 src1
= get_true_reg (&XEXP (SET_SRC (pat
), 0));
2171 emit_swap_insn (insn
, regstack
, *src1
);
2173 src1_note
= find_regno_note (insn
, REG_DEAD
, REGNO (*src1
));
2175 if (STACK_REG_P (*dest
))
2176 replace_reg (dest
, FIRST_STACK_REG
);
2180 replace_reg (&XEXP (src1_note
, 0), FIRST_STACK_REG
);
2182 CLEAR_HARD_REG_BIT (regstack
->reg_set
, REGNO (*src1
));
2185 replace_reg (src1
, FIRST_STACK_REG
);
2191 /* On i386, reversed forms of subM3 and divM3 exist for
2192 MODE_FLOAT, so the same code that works for addM3 and mulM3
2196 /* These insns can accept the top of stack as a destination
2197 from a stack reg or mem, or can use the top of stack as a
2198 source and some other stack register (possibly top of stack)
2199 as a destination. */
2201 src1
= get_true_reg (&XEXP (SET_SRC (pat
), 0));
2202 src2
= get_true_reg (&XEXP (SET_SRC (pat
), 1));
2204 /* We will fix any death note later. */
2206 if (STACK_REG_P (*src1
))
2207 src1_note
= find_regno_note (insn
, REG_DEAD
, REGNO (*src1
));
2209 src1_note
= NULL_RTX
;
2210 if (STACK_REG_P (*src2
))
2211 src2_note
= find_regno_note (insn
, REG_DEAD
, REGNO (*src2
));
2213 src2_note
= NULL_RTX
;
2215 /* If either operand is not a stack register, then the dest
2216 must be top of stack. */
2218 if (! STACK_REG_P (*src1
) || ! STACK_REG_P (*src2
))
2219 emit_swap_insn (insn
, regstack
, *dest
);
2222 /* Both operands are REG. If neither operand is already
2223 at the top of stack, choose to make the one that is the dest
2224 the new top of stack. */
2226 int src1_hard_regnum
, src2_hard_regnum
;
2228 src1_hard_regnum
= get_hard_regnum (regstack
, *src1
);
2229 src2_hard_regnum
= get_hard_regnum (regstack
, *src2
);
2230 if (src1_hard_regnum
== -1 || src2_hard_regnum
== -1)
2233 if (src1_hard_regnum
!= FIRST_STACK_REG
2234 && src2_hard_regnum
!= FIRST_STACK_REG
)
2235 emit_swap_insn (insn
, regstack
, *dest
);
2238 if (STACK_REG_P (*src1
))
2239 replace_reg (src1
, get_hard_regnum (regstack
, *src1
));
2240 if (STACK_REG_P (*src2
))
2241 replace_reg (src2
, get_hard_regnum (regstack
, *src2
));
2245 /* If the register that dies is at the top of stack, then
2246 the destination is somewhere else - merely substitute it.
2247 But if the reg that dies is not at top of stack, then
2248 move the top of stack to the dead reg, as though we had
2249 done the insn and then a store-with-pop. */
2251 if (REGNO (XEXP (src1_note
, 0)) == regstack
->reg
[regstack
->top
])
2253 SET_HARD_REG_BIT (regstack
->reg_set
, REGNO (*dest
));
2254 replace_reg (dest
, get_hard_regnum (regstack
, *dest
));
2258 int regno
= get_hard_regnum (regstack
, XEXP (src1_note
, 0));
2260 SET_HARD_REG_BIT (regstack
->reg_set
, REGNO (*dest
));
2261 replace_reg (dest
, regno
);
2263 regstack
->reg
[regstack
->top
- (regno
- FIRST_STACK_REG
)]
2264 = regstack
->reg
[regstack
->top
];
2267 CLEAR_HARD_REG_BIT (regstack
->reg_set
,
2268 REGNO (XEXP (src1_note
, 0)));
2269 replace_reg (&XEXP (src1_note
, 0), FIRST_STACK_REG
);
2274 if (REGNO (XEXP (src2_note
, 0)) == regstack
->reg
[regstack
->top
])
2276 SET_HARD_REG_BIT (regstack
->reg_set
, REGNO (*dest
));
2277 replace_reg (dest
, get_hard_regnum (regstack
, *dest
));
2281 int regno
= get_hard_regnum (regstack
, XEXP (src2_note
, 0));
2283 SET_HARD_REG_BIT (regstack
->reg_set
, REGNO (*dest
));
2284 replace_reg (dest
, regno
);
2286 regstack
->reg
[regstack
->top
- (regno
- FIRST_STACK_REG
)]
2287 = regstack
->reg
[regstack
->top
];
2290 CLEAR_HARD_REG_BIT (regstack
->reg_set
,
2291 REGNO (XEXP (src2_note
, 0)));
2292 replace_reg (&XEXP (src2_note
, 0), FIRST_STACK_REG
);
2297 SET_HARD_REG_BIT (regstack
->reg_set
, REGNO (*dest
));
2298 replace_reg (dest
, get_hard_regnum (regstack
, *dest
));
2304 switch (XINT (SET_SRC (pat
), 1))
2308 /* These insns only operate on the top of the stack. */
2310 src1
= get_true_reg (&XVECEXP (SET_SRC (pat
), 0, 0));
2312 emit_swap_insn (insn
, regstack
, *src1
);
2314 src1_note
= find_regno_note (insn
, REG_DEAD
, REGNO (*src1
));
2316 if (STACK_REG_P (*dest
))
2317 replace_reg (dest
, FIRST_STACK_REG
);
2321 replace_reg (&XEXP (src1_note
, 0), FIRST_STACK_REG
);
2323 CLEAR_HARD_REG_BIT (regstack
->reg_set
, REGNO (*src1
));
2326 replace_reg (src1
, FIRST_STACK_REG
);
2336 /* This insn requires the top of stack to be the destination. */
2338 src1
= get_true_reg (&XEXP (SET_SRC (pat
), 1));
2339 src2
= get_true_reg (&XEXP (SET_SRC (pat
), 2));
2341 src1_note
= find_regno_note (insn
, REG_DEAD
, REGNO (*src1
));
2342 src2_note
= find_regno_note (insn
, REG_DEAD
, REGNO (*src2
));
2349 src_note
[1] = src1_note
;
2350 src_note
[2] = src2_note
;
2352 if (STACK_REG_P (*src1
))
2353 replace_reg (src1
, get_hard_regnum (regstack
, *src1
));
2354 if (STACK_REG_P (*src2
))
2355 replace_reg (src2
, get_hard_regnum (regstack
, *src2
));
2357 for (i
= 1; i
<= 2; i
++)
2360 /* If the register that dies is not at the top of stack, then
2361 move the top of stack to the dead reg */
2362 if (REGNO (XEXP (src_note
[i
], 0))
2363 != regstack
->reg
[regstack
->top
])
2365 remove_regno_note (insn
, REG_DEAD
,
2366 REGNO (XEXP (src_note
[i
], 0)));
2367 emit_pop_insn (insn
, regstack
, XEXP (src_note
[i
], 0),
2372 CLEAR_HARD_REG_BIT (regstack
->reg_set
,
2373 REGNO (XEXP (src_note
[i
], 0)));
2374 replace_reg (&XEXP (src_note
[i
], 0), FIRST_STACK_REG
);
2380 /* Make dest the top of stack. Add dest to regstack if not present. */
2381 if (get_hard_regnum (regstack
, *dest
) < FIRST_STACK_REG
)
2382 regstack
->reg
[++regstack
->top
] = REGNO (*dest
);
2383 SET_HARD_REG_BIT (regstack
->reg_set
, REGNO (*dest
));
2384 replace_reg (dest
, FIRST_STACK_REG
);
2393 /* Substitute hard regnums for any stack regs in INSN, which has
2394 N_INPUTS inputs and N_OUTPUTS outputs. REGSTACK is the stack info
2395 before the insn, and is updated with changes made here. CONSTRAINTS is
2396 an array of the constraint strings used in the asm statement.
2398 OPERANDS is an array of the operands, and OPERANDS_LOC is a
2399 parallel array of where the operands were found. The output operands
2400 all precede the input operands.
2402 There are several requirements and assumptions about the use of
2403 stack-like regs in asm statements. These rules are enforced by
2404 record_asm_stack_regs; see comments there for details. Any
2405 asm_operands left in the RTL at this point may be assume to meet the
2406 requirements, since record_asm_stack_regs removes any problem asm. */
2409 subst_asm_stack_regs (insn
, regstack
, operands
, operands_loc
, constraints
,
2410 n_inputs
, n_outputs
)
2413 rtx
*operands
, **operands_loc
;
2415 int n_inputs
, n_outputs
;
2417 int n_operands
= n_inputs
+ n_outputs
;
2418 int first_input
= n_outputs
;
2419 rtx body
= PATTERN (insn
);
2421 int *operand_matches
= (int *) alloca (n_operands
* sizeof (int *));
2422 enum reg_class
*operand_class
2423 = (enum reg_class
*) alloca (n_operands
* sizeof (enum reg_class
*));
2425 rtx
*note_reg
; /* Array of note contents */
2426 rtx
**note_loc
; /* Address of REG field of each note */
2427 enum reg_note
*note_kind
; /* The type of each note */
2432 struct stack_def temp_stack
;
2438 /* Find out what the constraints required. If no constraint
2439 alternative matches, that is a compiler bug: we should have caught
2440 such an insn during the life analysis pass (and reload should have
2441 caught it regardless). */
2443 i
= constrain_asm_operands (n_operands
, operands
, constraints
,
2444 operand_matches
, operand_class
);
2448 /* Strip SUBREGs here to make the following code simpler. */
2449 for (i
= 0; i
< n_operands
; i
++)
2450 if (GET_CODE (operands
[i
]) == SUBREG
2451 && GET_CODE (SUBREG_REG (operands
[i
])) == REG
)
2453 operands_loc
[i
] = & SUBREG_REG (operands
[i
]);
2454 operands
[i
] = SUBREG_REG (operands
[i
]);
2457 /* Set up NOTE_REG, NOTE_LOC and NOTE_KIND. */
2459 for (i
= 0, note
= REG_NOTES (insn
); note
; note
= XEXP (note
, 1))
2462 note_reg
= (rtx
*) alloca (i
* sizeof (rtx
));
2463 note_loc
= (rtx
**) alloca (i
* sizeof (rtx
*));
2464 note_kind
= (enum reg_note
*) alloca (i
* sizeof (enum reg_note
));
2467 for (note
= REG_NOTES (insn
); note
; note
= XEXP (note
, 1))
2469 rtx reg
= XEXP (note
, 0);
2470 rtx
*loc
= & XEXP (note
, 0);
2472 if (GET_CODE (reg
) == SUBREG
&& GET_CODE (SUBREG_REG (reg
)) == REG
)
2474 loc
= & SUBREG_REG (reg
);
2475 reg
= SUBREG_REG (reg
);
2478 if (STACK_REG_P (reg
)
2479 && (REG_NOTE_KIND (note
) == REG_DEAD
2480 || REG_NOTE_KIND (note
) == REG_UNUSED
))
2482 note_reg
[n_notes
] = reg
;
2483 note_loc
[n_notes
] = loc
;
2484 note_kind
[n_notes
] = REG_NOTE_KIND (note
);
2489 /* Set up CLOBBER_REG and CLOBBER_LOC. */
2493 if (GET_CODE (body
) == PARALLEL
)
2495 clobber_reg
= (rtx
*) alloca (XVECLEN (body
, 0) * sizeof (rtx
*));
2496 clobber_loc
= (rtx
**) alloca (XVECLEN (body
, 0) * sizeof (rtx
**));
2498 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
2499 if (GET_CODE (XVECEXP (body
, 0, i
)) == CLOBBER
)
2501 rtx clobber
= XVECEXP (body
, 0, i
);
2502 rtx reg
= XEXP (clobber
, 0);
2503 rtx
*loc
= & XEXP (clobber
, 0);
2505 if (GET_CODE (reg
) == SUBREG
&& GET_CODE (SUBREG_REG (reg
)) == REG
)
2507 loc
= & SUBREG_REG (reg
);
2508 reg
= SUBREG_REG (reg
);
2511 if (STACK_REG_P (reg
))
2513 clobber_reg
[n_clobbers
] = reg
;
2514 clobber_loc
[n_clobbers
] = loc
;
2520 bcopy ((char *) regstack
, (char *) &temp_stack
, sizeof (temp_stack
));
2522 /* Put the input regs into the desired place in TEMP_STACK. */
2524 for (i
= first_input
; i
< first_input
+ n_inputs
; i
++)
2525 if (STACK_REG_P (operands
[i
])
2526 && reg_class_subset_p (operand_class
[i
], FLOAT_REGS
)
2527 && operand_class
[i
] != FLOAT_REGS
)
2529 /* If an operand needs to be in a particular reg in
2530 FLOAT_REGS, the constraint was either 't' or 'u'. Since
2531 these constraints are for single register classes, and reload
2532 guaranteed that operand[i] is already in that class, we can
2533 just use REGNO (operands[i]) to know which actual reg this
2534 operand needs to be in. */
2536 int regno
= get_hard_regnum (&temp_stack
, operands
[i
]);
2541 if (regno
!= REGNO (operands
[i
]))
2543 /* operands[i] is not in the right place. Find it
2544 and swap it with whatever is already in I's place.
2545 K is where operands[i] is now. J is where it should
2549 k
= temp_stack
.top
- (regno
- FIRST_STACK_REG
);
2551 - (REGNO (operands
[i
]) - FIRST_STACK_REG
));
2553 temp
= temp_stack
.reg
[k
];
2554 temp_stack
.reg
[k
] = temp_stack
.reg
[j
];
2555 temp_stack
.reg
[j
] = temp
;
2559 /* emit insns before INSN to make sure the reg-stack is in the right
2562 change_stack (insn
, regstack
, &temp_stack
, emit_insn_before
);
2564 /* Make the needed input register substitutions. Do death notes and
2565 clobbers too, because these are for inputs, not outputs. */
2567 for (i
= first_input
; i
< first_input
+ n_inputs
; i
++)
2568 if (STACK_REG_P (operands
[i
]))
2570 int regnum
= get_hard_regnum (regstack
, operands
[i
]);
2575 replace_reg (operands_loc
[i
], regnum
);
2578 for (i
= 0; i
< n_notes
; i
++)
2579 if (note_kind
[i
] == REG_DEAD
)
2581 int regnum
= get_hard_regnum (regstack
, note_reg
[i
]);
2586 replace_reg (note_loc
[i
], regnum
);
2589 for (i
= 0; i
< n_clobbers
; i
++)
2591 /* It's OK for a CLOBBER to reference a reg that is not live.
2592 Don't try to replace it in that case. */
2593 int regnum
= get_hard_regnum (regstack
, clobber_reg
[i
]);
2597 /* Sigh - clobbers always have QImode. But replace_reg knows
2598 that these regs can't be MODE_INT and will abort. Just put
2599 the right reg there without calling replace_reg. */
2601 *clobber_loc
[i
] = FP_MODE_REG (regnum
, DFmode
);
2605 /* Now remove from REGSTACK any inputs that the asm implicitly popped. */
2607 for (i
= first_input
; i
< first_input
+ n_inputs
; i
++)
2608 if (STACK_REG_P (operands
[i
]))
2610 /* An input reg is implicitly popped if it is tied to an
2611 output, or if there is a CLOBBER for it. */
2614 for (j
= 0; j
< n_clobbers
; j
++)
2615 if (operands_match_p (clobber_reg
[j
], operands
[i
]))
2618 if (j
< n_clobbers
|| operand_matches
[i
] >= 0)
2620 /* operands[i] might not be at the top of stack. But that's OK,
2621 because all we need to do is pop the right number of regs
2622 off of the top of the reg-stack. record_asm_stack_regs
2623 guaranteed that all implicitly popped regs were grouped
2624 at the top of the reg-stack. */
2626 CLEAR_HARD_REG_BIT (regstack
->reg_set
,
2627 regstack
->reg
[regstack
->top
]);
2632 /* Now add to REGSTACK any outputs that the asm implicitly pushed.
2633 Note that there isn't any need to substitute register numbers.
2634 ??? Explain why this is true. */
2636 for (i
= LAST_STACK_REG
; i
>= FIRST_STACK_REG
; i
--)
2638 /* See if there is an output for this hard reg. */
2641 for (j
= 0; j
< n_outputs
; j
++)
2642 if (STACK_REG_P (operands
[j
]) && REGNO (operands
[j
]) == i
)
2644 regstack
->reg
[++regstack
->top
] = i
;
2645 SET_HARD_REG_BIT (regstack
->reg_set
, i
);
2650 /* Now emit a pop insn for any REG_UNUSED output, or any REG_DEAD
2651 input that the asm didn't implicitly pop. If the asm didn't
2652 implicitly pop an input reg, that reg will still be live.
2654 Note that we can't use find_regno_note here: the register numbers
2655 in the death notes have already been substituted. */
2657 for (i
= 0; i
< n_outputs
; i
++)
2658 if (STACK_REG_P (operands
[i
]))
2662 for (j
= 0; j
< n_notes
; j
++)
2663 if (REGNO (operands
[i
]) == REGNO (note_reg
[j
])
2664 && note_kind
[j
] == REG_UNUSED
)
2666 insn
= emit_pop_insn (insn
, regstack
, operands
[i
],
2672 for (i
= first_input
; i
< first_input
+ n_inputs
; i
++)
2673 if (STACK_REG_P (operands
[i
]))
2677 for (j
= 0; j
< n_notes
; j
++)
2678 if (REGNO (operands
[i
]) == REGNO (note_reg
[j
])
2679 && note_kind
[j
] == REG_DEAD
2680 && TEST_HARD_REG_BIT (regstack
->reg_set
, REGNO (operands
[i
])))
2682 insn
= emit_pop_insn (insn
, regstack
, operands
[i
],
2689 /* Substitute stack hard reg numbers for stack virtual registers in
2690 INSN. Non-stack register numbers are not changed. REGSTACK is the
2691 current stack content. Insns may be emitted as needed to arrange the
2692 stack for the 387 based on the contents of the insn. */
2695 subst_stack_regs (insn
, regstack
)
2699 register rtx
*note_link
, note
;
2703 if (GET_CODE (insn
) == CALL_INSN
)
2705 int top
= regstack
->top
;
2707 /* If there are any floating point parameters to be passed in
2708 registers for this call, make sure they are in the right
2713 straighten_stack (PREV_INSN (insn
), regstack
);
2715 /* Now mark the arguments as dead after the call. */
2717 while (regstack
->top
>= 0)
2719 CLEAR_HARD_REG_BIT (regstack
->reg_set
, FIRST_STACK_REG
+ regstack
->top
);
2725 /* Do the actual substitution if any stack regs are mentioned.
2726 Since we only record whether entire insn mentions stack regs, and
2727 subst_stack_regs_pat only works for patterns that contain stack regs,
2728 we must check each pattern in a parallel here. A call_value_pop could
2731 if (GET_MODE (insn
) == QImode
)
2733 n_operands
= asm_noperands (PATTERN (insn
));
2734 if (n_operands
>= 0)
2736 /* This insn is an `asm' with operands. Decode the operands,
2737 decide how many are inputs, and do register substitution.
2738 Any REG_UNUSED notes will be handled by subst_asm_stack_regs. */
2740 rtx operands
[MAX_RECOG_OPERANDS
];
2741 rtx
*operands_loc
[MAX_RECOG_OPERANDS
];
2742 rtx body
= PATTERN (insn
);
2743 int n_inputs
, n_outputs
;
2745 = (char **) alloca (n_operands
* sizeof (char *));
2747 decode_asm_operands (body
, operands
, operands_loc
,
2748 constraints
, NULL_PTR
);
2749 get_asm_operand_lengths (body
, n_operands
, &n_inputs
, &n_outputs
);
2750 subst_asm_stack_regs (insn
, regstack
, operands
, operands_loc
,
2751 constraints
, n_inputs
, n_outputs
);
2755 if (GET_CODE (PATTERN (insn
)) == PARALLEL
)
2756 for (i
= 0; i
< XVECLEN (PATTERN (insn
), 0); i
++)
2758 if (stack_regs_mentioned_p (XVECEXP (PATTERN (insn
), 0, i
)))
2759 subst_stack_regs_pat (insn
, regstack
,
2760 XVECEXP (PATTERN (insn
), 0, i
));
2763 subst_stack_regs_pat (insn
, regstack
, PATTERN (insn
));
2766 /* subst_stack_regs_pat may have deleted a no-op insn. If so, any
2767 REG_UNUSED will already have been dealt with, so just return. */
2769 if (GET_CODE (insn
) == NOTE
)
2772 /* If there is a REG_UNUSED note on a stack register on this insn,
2773 the indicated reg must be popped. The REG_UNUSED note is removed,
2774 since the form of the newly emitted pop insn references the reg,
2775 making it no longer `unset'. */
2777 note_link
= ®_NOTES(insn
);
2778 for (note
= *note_link
; note
; note
= XEXP (note
, 1))
2779 if (REG_NOTE_KIND (note
) == REG_UNUSED
&& STACK_REG_P (XEXP (note
, 0)))
2781 *note_link
= XEXP (note
, 1);
2782 insn
= emit_pop_insn (insn
, regstack
, XEXP (note
, 0), emit_insn_after
);
2785 note_link
= &XEXP (note
, 1);
2788 /* Change the organization of the stack so that it fits a new basic
2789 block. Some registers might have to be popped, but there can never be
2790 a register live in the new block that is not now live.
2792 Insert any needed insns before or after INSN. WHEN is emit_insn_before
2793 or emit_insn_after. OLD is the original stack layout, and NEW is
2794 the desired form. OLD is updated to reflect the code emitted, ie, it
2795 will be the same as NEW upon return.
2797 This function will not preserve block_end[]. But that information
2798 is no longer needed once this has executed. */
2801 change_stack (insn
, old
, new, when
)
2809 /* We will be inserting new insns "backwards", by calling emit_insn_before.
2810 If we are to insert after INSN, find the next insn, and insert before
2813 if (when
== emit_insn_after
)
2814 insn
= NEXT_INSN (insn
);
2816 /* Pop any registers that are not needed in the new block. */
2818 for (reg
= old
->top
; reg
>= 0; reg
--)
2819 if (! TEST_HARD_REG_BIT (new->reg_set
, old
->reg
[reg
]))
2820 emit_pop_insn (insn
, old
, FP_MODE_REG (old
->reg
[reg
], DFmode
),
2825 /* If the new block has never been processed, then it can inherit
2826 the old stack order. */
2828 new->top
= old
->top
;
2829 bcopy (old
->reg
, new->reg
, sizeof (new->reg
));
2833 /* This block has been entered before, and we must match the
2834 previously selected stack order. */
2836 /* By now, the only difference should be the order of the stack,
2837 not their depth or liveliness. */
2839 GO_IF_HARD_REG_EQUAL (old
->reg_set
, new->reg_set
, win
);
2845 if (old
->top
!= new->top
)
2848 /* Loop here emitting swaps until the stack is correct. The
2849 worst case number of swaps emitted is N + 2, where N is the
2850 depth of the stack. In some cases, the reg at the top of
2851 stack may be correct, but swapped anyway in order to fix
2852 other regs. But since we never swap any other reg away from
2853 its correct slot, this algorithm will converge. */
2857 /* Swap the reg at top of stack into the position it is
2858 supposed to be in, until the correct top of stack appears. */
2860 while (old
->reg
[old
->top
] != new->reg
[new->top
])
2862 for (reg
= new->top
; reg
>= 0; reg
--)
2863 if (new->reg
[reg
] == old
->reg
[old
->top
])
2869 emit_swap_insn (insn
, old
,
2870 FP_MODE_REG (old
->reg
[reg
], DFmode
));
2873 /* See if any regs remain incorrect. If so, bring an
2874 incorrect reg to the top of stack, and let the while loop
2877 for (reg
= new->top
; reg
>= 0; reg
--)
2878 if (new->reg
[reg
] != old
->reg
[reg
])
2880 emit_swap_insn (insn
, old
,
2881 FP_MODE_REG (old
->reg
[reg
], DFmode
));
2886 /* At this point there must be no differences. */
2888 for (reg
= old
->top
; reg
>= 0; reg
--)
2889 if (old
->reg
[reg
] != new->reg
[reg
])
2894 /* Check PAT, which points to RTL in INSN, for a LABEL_REF. If it is
2895 found, ensure that a jump from INSN to the code_label to which the
2896 label_ref points ends up with the same stack as that at the
2897 code_label. Do this by inserting insns just before the code_label to
2898 pop and rotate the stack until it is in the correct order. REGSTACK
2899 is the order of the register stack in INSN.
2901 Any code that is emitted here must not be later processed as part
2902 of any block, as it will already contain hard register numbers. */
2905 goto_block_pat (insn
, regstack
, pat
)
2911 rtx new_jump
, new_label
, new_barrier
;
2914 struct stack_def temp_stack
;
2917 switch (GET_CODE (pat
))
2920 straighten_stack (PREV_INSN (insn
), regstack
);
2925 char *fmt
= GET_RTX_FORMAT (GET_CODE (pat
));
2927 for (i
= GET_RTX_LENGTH (GET_CODE (pat
)) - 1; i
>= 0; i
--)
2930 goto_block_pat (insn
, regstack
, XEXP (pat
, i
));
2932 for (j
= 0; j
< XVECLEN (pat
, i
); j
++)
2933 goto_block_pat (insn
, regstack
, XVECEXP (pat
, i
, j
));
2940 label
= XEXP (pat
, 0);
2941 if (GET_CODE (label
) != CODE_LABEL
)
2944 /* First, see if in fact anything needs to be done to the stack at all. */
2945 if (INSN_UID (label
) <= 0)
2948 label_stack
= &block_stack_in
[BLOCK_NUM (label
)];
2950 if (label_stack
->top
== -2)
2952 /* If the target block hasn't had a stack order selected, then
2953 we need merely ensure that no pops are needed. */
2955 for (reg
= regstack
->top
; reg
>= 0; reg
--)
2956 if (! TEST_HARD_REG_BIT (label_stack
->reg_set
, regstack
->reg
[reg
]))
2961 /* change_stack will not emit any code in this case. */
2963 change_stack (label
, regstack
, label_stack
, emit_insn_after
);
2967 else if (label_stack
->top
== regstack
->top
)
2969 for (reg
= label_stack
->top
; reg
>= 0; reg
--)
2970 if (label_stack
->reg
[reg
] != regstack
->reg
[reg
])
2977 /* At least one insn will need to be inserted before label. Insert
2978 a jump around the code we are about to emit. Emit a label for the new
2979 code, and point the original insn at this new label. We can't use
2980 redirect_jump here, because we're using fld[4] of the code labels as
2981 LABEL_REF chains, no NUSES counters. */
2983 new_jump
= emit_jump_insn_before (gen_jump (label
), label
);
2984 record_label_references (new_jump
, PATTERN (new_jump
));
2985 JUMP_LABEL (new_jump
) = label
;
2987 new_barrier
= emit_barrier_after (new_jump
);
2989 new_label
= gen_label_rtx ();
2990 emit_label_after (new_label
, new_barrier
);
2991 LABEL_REFS (new_label
) = new_label
;
2993 /* The old label_ref will no longer point to the code_label if now uses,
2994 so strip the label_ref from the code_label's chain of references. */
2996 for (ref
= &LABEL_REFS (label
); *ref
!= label
; ref
= &LABEL_NEXTREF (*ref
))
3003 *ref
= LABEL_NEXTREF (*ref
);
3005 XEXP (pat
, 0) = new_label
;
3006 record_label_references (insn
, PATTERN (insn
));
3008 if (JUMP_LABEL (insn
) == label
)
3009 JUMP_LABEL (insn
) = new_label
;
3011 /* Now emit the needed code. */
3013 temp_stack
= *regstack
;
3015 change_stack (new_label
, &temp_stack
, label_stack
, emit_insn_after
);
3018 /* Traverse all basic blocks in a function, converting the register
3019 references in each insn from the "flat" register file that gcc uses, to
3020 the stack-like registers the 387 uses. */
3025 register int block
, reg
;
3026 register rtx insn
, next
;
3027 struct stack_def regstack
;
3029 for (block
= 0; block
< blocks
; block
++)
3031 if (block_stack_in
[block
].top
== -2)
3033 /* This block has not been previously encountered. Choose a
3034 default mapping for any stack regs live on entry */
3036 block_stack_in
[block
].top
= -1;
3038 for (reg
= LAST_STACK_REG
; reg
>= FIRST_STACK_REG
; reg
--)
3039 if (TEST_HARD_REG_BIT (block_stack_in
[block
].reg_set
, reg
))
3040 block_stack_in
[block
].reg
[++block_stack_in
[block
].top
] = reg
;
3043 /* Process all insns in this block. Keep track of `next' here,
3044 so that we don't process any insns emitted while making
3045 substitutions in INSN. */
3047 next
= block_begin
[block
];
3048 regstack
= block_stack_in
[block
];
3052 next
= NEXT_INSN (insn
);
3054 /* Don't bother processing unless there is a stack reg
3055 mentioned or if it's a CALL_INSN (register passing of
3056 floating point values). */
3058 if (GET_MODE (insn
) == QImode
|| GET_CODE (insn
) == CALL_INSN
)
3059 subst_stack_regs (insn
, ®stack
);
3061 } while (insn
!= block_end
[block
]);
3063 /* Something failed if the stack life doesn't match. */
3065 GO_IF_HARD_REG_EQUAL (regstack
.reg_set
, block_out_reg_set
[block
], win
);
3071 /* Adjust the stack of this block on exit to match the stack of
3072 the target block, or copy stack information into stack of
3073 jump target if the target block's stack order hasn't been set
3076 if (GET_CODE (insn
) == JUMP_INSN
)
3077 goto_block_pat (insn
, ®stack
, PATTERN (insn
));
3079 /* Likewise handle the case where we fall into the next block. */
3081 if ((block
< blocks
- 1) && block_drops_in
[block
+1])
3082 change_stack (insn
, ®stack
, &block_stack_in
[block
+1],
3086 /* If the last basic block is the end of a loop, and that loop has
3087 regs live at its start, then the last basic block will have regs live
3088 at its end that need to be popped before the function returns. */
3091 int value_reg_low
, value_reg_high
;
3092 value_reg_low
= value_reg_high
= -1;
3095 if ((retvalue
= stack_result (current_function_decl
)))
3097 value_reg_low
= REGNO (retvalue
);
3098 value_reg_high
= value_reg_low
+
3099 HARD_REGNO_NREGS (value_reg_low
, GET_MODE (retvalue
)) - 1;
3103 for (reg
= regstack
.top
; reg
>= 0; reg
--)
3104 if (regstack
.reg
[reg
] < value_reg_low
3105 || regstack
.reg
[reg
] > value_reg_high
)
3106 insn
= emit_pop_insn (insn
, ®stack
,
3107 FP_MODE_REG (regstack
.reg
[reg
], DFmode
),
3110 straighten_stack (insn
, ®stack
);
3113 /* Check expression PAT, which is in INSN, for label references. if
3114 one is found, print the block number of destination to FILE. */
3117 print_blocks (file
, insn
, pat
)
3121 register RTX_CODE code
= GET_CODE (pat
);
3125 if (code
== LABEL_REF
)
3127 register rtx label
= XEXP (pat
, 0);
3129 if (GET_CODE (label
) != CODE_LABEL
)
3132 fprintf (file
, " %d", BLOCK_NUM (label
));
3137 fmt
= GET_RTX_FORMAT (code
);
3138 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
3141 print_blocks (file
, insn
, XEXP (pat
, i
));
3145 for (j
= 0; j
< XVECLEN (pat
, i
); j
++)
3146 print_blocks (file
, insn
, XVECEXP (pat
, i
, j
));
3151 /* Write information about stack registers and stack blocks into FILE.
3152 This is part of making a debugging dump. */
3155 dump_stack_info (file
)
3160 fprintf (file
, "\n%d stack blocks.\n", blocks
);
3161 for (block
= 0; block
< blocks
; block
++)
3163 register rtx head
, jump
, end
;
3166 fprintf (file
, "\nStack block %d: first insn %d, last %d.\n",
3167 block
, INSN_UID (block_begin
[block
]),
3168 INSN_UID (block_end
[block
]));
3170 head
= block_begin
[block
];
3172 fprintf (file
, "Reached from blocks: ");
3173 if (GET_CODE (head
) == CODE_LABEL
)
3174 for (jump
= LABEL_REFS (head
);
3176 jump
= LABEL_NEXTREF (jump
))
3178 register int from_block
= BLOCK_NUM (CONTAINING_INSN (jump
));
3179 fprintf (file
, " %d", from_block
);
3181 if (block_drops_in
[block
])
3182 fprintf (file
, " previous");
3184 fprintf (file
, "\nlive stack registers on block entry: ");
3185 for (regno
= FIRST_STACK_REG
; regno
<= LAST_STACK_REG
; regno
++)
3187 if (TEST_HARD_REG_BIT (block_stack_in
[block
].reg_set
, regno
))
3188 fprintf (file
, "%d ", regno
);
3191 fprintf (file
, "\nlive stack registers on block exit: ");
3192 for (regno
= FIRST_STACK_REG
; regno
<= LAST_STACK_REG
; regno
++)
3194 if (TEST_HARD_REG_BIT (block_out_reg_set
[block
], regno
))
3195 fprintf (file
, "%d ", regno
);
3198 end
= block_end
[block
];
3200 fprintf (file
, "\nJumps to blocks: ");
3201 if (GET_CODE (end
) == JUMP_INSN
)
3202 print_blocks (file
, end
, PATTERN (end
));
3204 if (block
+ 1 < blocks
&& block_drops_in
[block
+1])
3205 fprintf (file
, " next");
3206 else if (block
+ 1 == blocks
3207 || (GET_CODE (end
) == JUMP_INSN
3208 && GET_CODE (PATTERN (end
)) == RETURN
))
3209 fprintf (file
, " return");
3211 fprintf (file
, "\n");
3214 #endif /* STACK_REGS */