1 /* Perform instruction reorganizations for delay slot filling.
2 Copyright (C) 1992, 93, 94, 95, 96, 1997 Free Software Foundation, Inc.
3 Contributed by Richard Kenner (kenner@vlsi1.ultra.nyu.edu).
4 Hacked by Michael Tiemann (tiemann@cygnus.com).
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
23 /* Instruction reorganization pass.
25 This pass runs after register allocation and final jump
26 optimization. It should be the last pass to run before peephole.
27 It serves primarily to fill delay slots of insns, typically branch
28 and call insns. Other insns typically involve more complicated
29 interactions of data dependencies and resource constraints, and
30 are better handled by scheduling before register allocation (by the
31 function `schedule_insns').
33 The Branch Penalty is the number of extra cycles that are needed to
34 execute a branch insn. On an ideal machine, branches take a single
35 cycle, and the Branch Penalty is 0. Several RISC machines approach
36 branch delays differently:
38 The MIPS and AMD 29000 have a single branch delay slot. Most insns
39 (except other branches) can be used to fill this slot. When the
40 slot is filled, two insns execute in two cycles, reducing the
41 branch penalty to zero.
43 The Motorola 88000 conditionally exposes its branch delay slot,
44 so code is shorter when it is turned off, but will run faster
45 when useful insns are scheduled there.
47 The IBM ROMP has two forms of branch and call insns, both with and
48 without a delay slot. Much like the 88k, insns not using the delay
49 slot can be shorted (2 bytes vs. 4 bytes), but will run slowed.
51 The SPARC always has a branch delay slot, but its effects can be
52 annulled when the branch is not taken. This means that failing to
53 find other sources of insns, we can hoist an insn from the branch
54 target that would only be safe to execute knowing that the branch
57 The HP-PA always has a branch delay slot. For unconditional branches
58 its effects can be annulled when the branch is taken. The effects
59 of the delay slot in a conditional branch can be nullified for forward
60 taken branches, or for untaken backward branches. This means
61 we can hoist insns from the fall-through path for forward branches or
62 steal insns from the target of backward branches.
64 Three techniques for filling delay slots have been implemented so far:
66 (1) `fill_simple_delay_slots' is the simplest, most efficient way
67 to fill delay slots. This pass first looks for insns which come
68 from before the branch and which are safe to execute after the
69 branch. Then it searches after the insn requiring delay slots or,
70 in the case of a branch, for insns that are after the point at
71 which the branch merges into the fallthrough code, if such a point
72 exists. When such insns are found, the branch penalty decreases
73 and no code expansion takes place.
75 (2) `fill_eager_delay_slots' is more complicated: it is used for
76 scheduling conditional jumps, or for scheduling jumps which cannot
77 be filled using (1). A machine need not have annulled jumps to use
78 this strategy, but it helps (by keeping more options open).
79 `fill_eager_delay_slots' tries to guess the direction the branch
80 will go; if it guesses right 100% of the time, it can reduce the
81 branch penalty as much as `fill_simple_delay_slots' does. If it
82 guesses wrong 100% of the time, it might as well schedule nops (or
83 on the m88k, unexpose the branch slot). When
84 `fill_eager_delay_slots' takes insns from the fall-through path of
85 the jump, usually there is no code expansion; when it takes insns
86 from the branch target, there is code expansion if it is not the
87 only way to reach that target.
89 (3) `relax_delay_slots' uses a set of rules to simplify code that
90 has been reorganized by (1) and (2). It finds cases where
91 conditional test can be eliminated, jumps can be threaded, extra
92 insns can be eliminated, etc. It is the job of (1) and (2) to do a
93 good job of scheduling locally; `relax_delay_slots' takes care of
94 making the various individual schedules work well together. It is
95 especially tuned to handle the control flow interactions of branch
96 insns. It does nothing for insns with delay slots that do not
99 On machines that use CC0, we are very conservative. We will not make
100 a copy of an insn involving CC0 since we want to maintain a 1-1
101 correspondence between the insn that sets and uses CC0. The insns are
102 allowed to be separated by placing an insn that sets CC0 (but not an insn
103 that uses CC0; we could do this, but it doesn't seem worthwhile) in a
104 delay slot. In that case, we point each insn at the other with REG_CC_USER
105 and REG_CC_SETTER notes. Note that these restrictions affect very few
106 machines because most RISC machines with delay slots will not use CC0
107 (the RT is the only known exception at this point).
111 The Acorn Risc Machine can conditionally execute most insns, so
112 it is profitable to move single insns into a position to execute
113 based on the condition code of the previous insn.
115 The HP-PA can conditionally nullify insns, providing a similar
116 effect to the ARM, differing mostly in which insn is "in charge". */
121 #include "insn-config.h"
122 #include "conditions.h"
123 #include "hard-reg-set.h"
124 #include "basic-block.h"
126 #include "insn-flags.h"
131 #include "insn-attr.h"
133 /* Import list of registers used as spill regs from reload. */
134 extern HARD_REG_SET used_spill_regs;
136 /* Import highest label used in function at end of reload. */
137 extern int max_label_num_after_reload;
142 #define obstack_chunk_alloc xmalloc
143 #define obstack_chunk_free free
145 #ifndef ANNUL_IFTRUE_SLOTS
146 #define eligible_for_annul_true(INSN, SLOTS, TRIAL, FLAGS) 0
148 #ifndef ANNUL_IFFALSE_SLOTS
149 #define eligible_for_annul_false(INSN, SLOTS, TRIAL, FLAGS) 0
152 /* Insns which have delay slots that have not yet been filled. */
154 static struct obstack unfilled_slots_obstack;
155 static rtx *unfilled_firstobj;
157 /* Define macros to refer to the first and last slot containing unfilled
158 insns. These are used because the list may move and its address
159 should be recomputed at each use. */
161 #define unfilled_slots_base \
162 ((rtx *) obstack_base (&unfilled_slots_obstack))
164 #define unfilled_slots_next \
165 ((rtx *) obstack_next_free (&unfilled_slots_obstack))
167 /* This structure is used to indicate which hardware resources are set or
168 needed by insns so far. */
172 char memory; /* Insn sets or needs a memory location. */
173 char unch_memory; /* Insn sets of needs a "unchanging" MEM. */
174 char volatil; /* Insn sets or needs a volatile memory loc. */
175 char cc; /* Insn sets or needs the condition codes. */
176 HARD_REG_SET regs; /* Which registers are set or needed. */
179 /* Macro to clear all resources. */
180 #define CLEAR_RESOURCE(RES) \
181 do { (RES)->memory = (RES)->unch_memory = (RES)->volatil = (RES)->cc = 0; \
182 CLEAR_HARD_REG_SET ((RES)->regs); } while (0)
184 /* Indicates what resources are required at the beginning of the epilogue. */
185 static struct resources start_of_epilogue_needs;
187 /* Indicates what resources are required at function end. */
188 static struct resources end_of_function_needs;
190 /* Points to the label before the end of the function. */
191 static rtx end_of_function_label;
193 /* This structure is used to record liveness information at the targets or
194 fallthrough insns of branches. We will most likely need the information
195 at targets again, so save them in a hash table rather than recomputing them
200 int uid; /* INSN_UID of target. */
201 struct target_info *next; /* Next info for same hash bucket. */
202 HARD_REG_SET live_regs; /* Registers live at target. */
203 int block; /* Basic block number containing target. */
204 int bb_tick; /* Generation count of basic block info. */
207 #define TARGET_HASH_PRIME 257
209 /* Define the hash table itself. */
210 static struct target_info **target_hash_table;
212 /* For each basic block, we maintain a generation number of its basic
213 block info, which is updated each time we move an insn from the
214 target of a jump. This is the generation number indexed by block
217 static int *bb_ticks;
219 /* Mapping between INSN_UID's and position in the code since INSN_UID's do
220 not always monotonically increase. */
221 static int *uid_to_ruid;
223 /* Highest valid index in `uid_to_ruid'. */
226 static void mark_referenced_resources PROTO((rtx, struct resources *, int));
227 static void mark_set_resources PROTO((rtx, struct resources *, int, int));
228 static int stop_search_p PROTO((rtx, int));
229 static int resource_conflicts_p PROTO((struct resources *,
230 struct resources *));
231 static int insn_references_resource_p PROTO((rtx, struct resources *, int));
232 static int insn_sets_resources_p PROTO((rtx, struct resources *, int));
233 static rtx find_end_label PROTO((void));
234 static rtx emit_delay_sequence PROTO((rtx, rtx, int, int));
235 static rtx add_to_delay_list PROTO((rtx, rtx));
236 static void delete_from_delay_slot PROTO((rtx));
237 static void delete_scheduled_jump PROTO((rtx));
238 static void note_delay_statistics PROTO((int, int));
239 static rtx optimize_skip PROTO((rtx));
240 static int get_jump_flags PROTO((rtx, rtx));
241 static int rare_destination PROTO((rtx));
242 static int mostly_true_jump PROTO((rtx, rtx));
243 static rtx get_branch_condition PROTO((rtx, rtx));
244 static int condition_dominates_p PROTO((rtx, rtx));
245 static rtx steal_delay_list_from_target PROTO((rtx, rtx, rtx, rtx,
249 int, int *, int *, rtx *));
250 static rtx steal_delay_list_from_fallthrough PROTO((rtx, rtx, rtx, rtx,
255 static void try_merge_delay_insns PROTO((rtx, rtx));
256 static rtx redundant_insn PROTO((rtx, rtx, rtx));
257 static int own_thread_p PROTO((rtx, rtx, int));
258 static int find_basic_block PROTO((rtx));
259 static void update_block PROTO((rtx, rtx));
260 static int reorg_redirect_jump PROTO((rtx, rtx));
261 static void update_reg_dead_notes PROTO((rtx, rtx));
262 static void fix_reg_dead_note PROTO((rtx, rtx));
263 static void update_reg_unused_notes PROTO((rtx, rtx));
264 static void update_live_status PROTO((rtx, rtx));
265 static rtx next_insn_no_annul PROTO((rtx));
266 static void mark_target_live_regs PROTO((rtx, struct resources *));
267 static void fill_simple_delay_slots PROTO((rtx, int));
268 static rtx fill_slots_from_thread PROTO((rtx, rtx, rtx, rtx, int, int,
269 int, int, int, int *));
270 static void fill_eager_delay_slots PROTO((rtx));
271 static void relax_delay_slots PROTO((rtx));
272 static void make_return_insns PROTO((rtx));
273 static int redirect_with_delay_slots_safe_p PROTO ((rtx, rtx, rtx));
274 static int redirect_with_delay_list_safe_p PROTO ((rtx, rtx, rtx));
276 /* Given X, some rtl, and RES, a pointer to a `struct resource', mark
277 which resources are references by the insn. If INCLUDE_CALLED_ROUTINE
278 is TRUE, resources used by the called routine will be included for
282 mark_referenced_resources (x, res, include_delayed_effects)
284 register struct resources *res;
285 register int include_delayed_effects;
287 register enum rtx_code code = GET_CODE (x);
289 register char *format_ptr;
291 /* Handle leaf items for which we set resource flags. Also, special-case
292 CALL, SET and CLOBBER operators. */
304 if (GET_CODE (SUBREG_REG (x)) != REG)
305 mark_referenced_resources (SUBREG_REG (x), res, 0);
308 int regno = REGNO (SUBREG_REG (x)) + SUBREG_WORD (x);
309 int last_regno = regno + HARD_REGNO_NREGS (regno, GET_MODE (x));
310 for (i = regno; i < last_regno; i++)
311 SET_HARD_REG_BIT (res->regs, i);
316 for (i = 0; i < HARD_REGNO_NREGS (REGNO (x), GET_MODE (x)); i++)
317 SET_HARD_REG_BIT (res->regs, REGNO (x) + i);
321 /* If this memory shouldn't change, it really isn't referencing
323 if (RTX_UNCHANGING_P (x))
324 res->unch_memory = 1;
327 res->volatil = MEM_VOLATILE_P (x);
329 /* Mark registers used to access memory. */
330 mark_referenced_resources (XEXP (x, 0), res, 0);
337 case UNSPEC_VOLATILE:
340 /* Traditional asm's are always volatile. */
345 res->volatil = MEM_VOLATILE_P (x);
347 /* For all ASM_OPERANDS, we must traverse the vector of input operands.
348 We can not just fall through here since then we would be confused
349 by the ASM_INPUT rtx inside ASM_OPERANDS, which do not indicate
350 traditional asms unlike their normal usage. */
352 for (i = 0; i < ASM_OPERANDS_INPUT_LENGTH (x); i++)
353 mark_referenced_resources (ASM_OPERANDS_INPUT (x, i), res, 0);
357 /* The first operand will be a (MEM (xxx)) but doesn't really reference
358 memory. The second operand may be referenced, though. */
359 mark_referenced_resources (XEXP (XEXP (x, 0), 0), res, 0);
360 mark_referenced_resources (XEXP (x, 1), res, 0);
364 /* Usually, the first operand of SET is set, not referenced. But
365 registers used to access memory are referenced. SET_DEST is
366 also referenced if it is a ZERO_EXTRACT or SIGN_EXTRACT. */
368 mark_referenced_resources (SET_SRC (x), res, 0);
371 if (GET_CODE (x) == SIGN_EXTRACT || GET_CODE (x) == ZERO_EXTRACT)
372 mark_referenced_resources (x, res, 0);
373 else if (GET_CODE (x) == SUBREG)
375 if (GET_CODE (x) == MEM)
376 mark_referenced_resources (XEXP (x, 0), res, 0);
383 if (include_delayed_effects)
385 /* A CALL references memory, the frame pointer if it exists, the
386 stack pointer, any global registers and any registers given in
387 USE insns immediately in front of the CALL.
389 However, we may have moved some of the parameter loading insns
390 into the delay slot of this CALL. If so, the USE's for them
391 don't count and should be skipped. */
392 rtx insn = PREV_INSN (x);
395 rtx next = NEXT_INSN (x);
398 /* If we are part of a delay slot sequence, point at the SEQUENCE. */
399 if (NEXT_INSN (insn) != x)
401 next = NEXT_INSN (NEXT_INSN (insn));
402 sequence = PATTERN (NEXT_INSN (insn));
403 seq_size = XVECLEN (sequence, 0);
404 if (GET_CODE (sequence) != SEQUENCE)
409 SET_HARD_REG_BIT (res->regs, STACK_POINTER_REGNUM);
410 if (frame_pointer_needed)
412 SET_HARD_REG_BIT (res->regs, FRAME_POINTER_REGNUM);
413 #if FRAME_POINTER_REGNUM != HARD_FRAME_POINTER_REGNUM
414 SET_HARD_REG_BIT (res->regs, HARD_FRAME_POINTER_REGNUM);
418 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
420 SET_HARD_REG_BIT (res->regs, i);
422 /* Check for a NOTE_INSN_SETJMP. If it exists, then we must
423 assume that this call can need any register.
425 This is done to be more conservative about how we handle setjmp.
426 We assume that they both use and set all registers. Using all
427 registers ensures that a register will not be considered dead
428 just because it crosses a setjmp call. A register should be
429 considered dead only if the setjmp call returns non-zero. */
430 if (next && GET_CODE (next) == NOTE
431 && NOTE_LINE_NUMBER (next) == NOTE_INSN_SETJMP)
432 SET_HARD_REG_SET (res->regs);
437 for (link = CALL_INSN_FUNCTION_USAGE (x);
439 link = XEXP (link, 1))
440 if (GET_CODE (XEXP (link, 0)) == USE)
442 for (i = 1; i < seq_size; i++)
444 rtx slot_pat = PATTERN (XVECEXP (sequence, 0, i));
445 if (GET_CODE (slot_pat) == SET
446 && rtx_equal_p (SET_DEST (slot_pat),
447 SET_DEST (XEXP (link, 0))))
451 mark_referenced_resources (SET_DEST (XEXP (link, 0)),
457 /* ... fall through to other INSN processing ... */
462 #ifdef INSN_REFERENCES_ARE_DELAYED
463 if (! include_delayed_effects
464 && INSN_REFERENCES_ARE_DELAYED (x))
468 /* No special processing, just speed up. */
469 mark_referenced_resources (PATTERN (x), res, include_delayed_effects);
473 /* Process each sub-expression and flag what it needs. */
474 format_ptr = GET_RTX_FORMAT (code);
475 for (i = 0; i < GET_RTX_LENGTH (code); i++)
476 switch (*format_ptr++)
479 mark_referenced_resources (XEXP (x, i), res, include_delayed_effects);
483 for (j = 0; j < XVECLEN (x, i); j++)
484 mark_referenced_resources (XVECEXP (x, i, j), res,
485 include_delayed_effects);
490 /* Given X, a part of an insn, and a pointer to a `struct resource', RES,
491 indicate which resources are modified by the insn. If INCLUDE_CALLED_ROUTINE
492 is nonzero, also mark resources potentially set by the called routine.
494 If IN_DEST is nonzero, it means we are inside a SET. Otherwise,
495 objects are being referenced instead of set.
497 We never mark the insn as modifying the condition code unless it explicitly
498 SETs CC0 even though this is not totally correct. The reason for this is
499 that we require a SET of CC0 to immediately precede the reference to CC0.
500 So if some other insn sets CC0 as a side-effect, we know it cannot affect
501 our computation and thus may be placed in a delay slot. */
504 mark_set_resources (x, res, in_dest, include_delayed_effects)
506 register struct resources *res;
508 int include_delayed_effects;
510 register enum rtx_code code;
512 register char *format_ptr;
530 /* These don't set any resources. */
539 /* Called routine modifies the condition code, memory, any registers
540 that aren't saved across calls, global registers and anything
541 explicitly CLOBBERed immediately after the CALL_INSN. */
543 if (include_delayed_effects)
545 rtx next = NEXT_INSN (x);
546 rtx prev = PREV_INSN (x);
549 res->cc = res->memory = 1;
550 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
551 if (call_used_regs[i] || global_regs[i])
552 SET_HARD_REG_BIT (res->regs, i);
554 /* If X is part of a delay slot sequence, then NEXT should be
555 the first insn after the sequence. */
556 if (NEXT_INSN (prev) != x)
557 next = NEXT_INSN (NEXT_INSN (prev));
559 for (link = CALL_INSN_FUNCTION_USAGE (x);
560 link; link = XEXP (link, 1))
561 if (GET_CODE (XEXP (link, 0)) == CLOBBER)
562 mark_set_resources (SET_DEST (XEXP (link, 0)), res, 1, 0);
564 /* Check for a NOTE_INSN_SETJMP. If it exists, then we must
565 assume that this call can clobber any register. */
566 if (next && GET_CODE (next) == NOTE
567 && NOTE_LINE_NUMBER (next) == NOTE_INSN_SETJMP)
568 SET_HARD_REG_SET (res->regs);
571 /* ... and also what it's RTL says it modifies, if anything. */
576 /* An insn consisting of just a CLOBBER (or USE) is just for flow
577 and doesn't actually do anything, so we ignore it. */
579 #ifdef INSN_SETS_ARE_DELAYED
580 if (! include_delayed_effects
581 && INSN_SETS_ARE_DELAYED (x))
586 if (GET_CODE (x) != USE && GET_CODE (x) != CLOBBER)
591 /* If the source of a SET is a CALL, this is actually done by
592 the called routine. So only include it if we are to include the
593 effects of the calling routine. */
595 mark_set_resources (SET_DEST (x), res,
596 (include_delayed_effects
597 || GET_CODE (SET_SRC (x)) != CALL),
600 mark_set_resources (SET_SRC (x), res, 0, 0);
604 mark_set_resources (XEXP (x, 0), res, 1, 0);
608 for (i = 0; i < XVECLEN (x, 0); i++)
609 if (! (INSN_ANNULLED_BRANCH_P (XVECEXP (x, 0, 0))
610 && INSN_FROM_TARGET_P (XVECEXP (x, 0, i))))
611 mark_set_resources (XVECEXP (x, 0, i), res, 0,
612 include_delayed_effects);
619 mark_set_resources (XEXP (x, 0), res, 1, 0);
623 mark_set_resources (XEXP (x, 0), res, in_dest, 0);
624 mark_set_resources (XEXP (x, 1), res, 0, 0);
625 mark_set_resources (XEXP (x, 2), res, 0, 0);
632 res->unch_memory = RTX_UNCHANGING_P (x);
633 res->volatil = MEM_VOLATILE_P (x);
636 mark_set_resources (XEXP (x, 0), res, 0, 0);
642 if (GET_CODE (SUBREG_REG (x)) != REG)
643 mark_set_resources (SUBREG_REG (x), res,
644 in_dest, include_delayed_effects);
647 int regno = REGNO (SUBREG_REG (x)) + SUBREG_WORD (x);
648 int last_regno = regno + HARD_REGNO_NREGS (regno, GET_MODE (x));
649 for (i = regno; i < last_regno; i++)
650 SET_HARD_REG_BIT (res->regs, i);
657 for (i = 0; i < HARD_REGNO_NREGS (REGNO (x), GET_MODE (x)); i++)
658 SET_HARD_REG_BIT (res->regs, REGNO (x) + i);
662 /* Process each sub-expression and flag what it needs. */
663 format_ptr = GET_RTX_FORMAT (code);
664 for (i = 0; i < GET_RTX_LENGTH (code); i++)
665 switch (*format_ptr++)
668 mark_set_resources (XEXP (x, i), res, in_dest, include_delayed_effects);
672 for (j = 0; j < XVECLEN (x, i); j++)
673 mark_set_resources (XVECEXP (x, i, j), res, in_dest,
674 include_delayed_effects);
679 /* Return TRUE if this insn should stop the search for insn to fill delay
680 slots. LABELS_P indicates that labels should terminate the search.
681 In all cases, jumps terminate the search. */
684 stop_search_p (insn, labels_p)
691 switch (GET_CODE (insn))
705 /* OK unless it contains a delay slot or is an `asm' insn of some type.
706 We don't know anything about these. */
707 return (GET_CODE (PATTERN (insn)) == SEQUENCE
708 || GET_CODE (PATTERN (insn)) == ASM_INPUT
709 || asm_noperands (PATTERN (insn)) >= 0);
716 /* Return TRUE if any resources are marked in both RES1 and RES2 or if either
717 resource set contains a volatile memory reference. Otherwise, return FALSE. */
720 resource_conflicts_p (res1, res2)
721 struct resources *res1, *res2;
723 if ((res1->cc && res2->cc) || (res1->memory && res2->memory)
724 || (res1->unch_memory && res2->unch_memory)
725 || res1->volatil || res2->volatil)
729 return (res1->regs & res2->regs) != HARD_CONST (0);
734 for (i = 0; i < HARD_REG_SET_LONGS; i++)
735 if ((res1->regs[i] & res2->regs[i]) != 0)
742 /* Return TRUE if any resource marked in RES, a `struct resources', is
743 referenced by INSN. If INCLUDE_CALLED_ROUTINE is set, return if the called
744 routine is using those resources.
746 We compute this by computing all the resources referenced by INSN and
747 seeing if this conflicts with RES. It might be faster to directly check
748 ourselves, and this is the way it used to work, but it means duplicating
749 a large block of complex code. */
752 insn_references_resource_p (insn, res, include_delayed_effects)
754 register struct resources *res;
755 int include_delayed_effects;
757 struct resources insn_res;
759 CLEAR_RESOURCE (&insn_res);
760 mark_referenced_resources (insn, &insn_res, include_delayed_effects);
761 return resource_conflicts_p (&insn_res, res);
764 /* Return TRUE if INSN modifies resources that are marked in RES.
765 INCLUDE_CALLED_ROUTINE is set if the actions of that routine should be
766 included. CC0 is only modified if it is explicitly set; see comments
767 in front of mark_set_resources for details. */
770 insn_sets_resource_p (insn, res, include_delayed_effects)
772 register struct resources *res;
773 int include_delayed_effects;
775 struct resources insn_sets;
777 CLEAR_RESOURCE (&insn_sets);
778 mark_set_resources (insn, &insn_sets, 0, include_delayed_effects);
779 return resource_conflicts_p (&insn_sets, res);
782 /* Find a label at the end of the function or before a RETURN. If there is
790 /* If we found one previously, return it. */
791 if (end_of_function_label)
792 return end_of_function_label;
794 /* Otherwise, see if there is a label at the end of the function. If there
795 is, it must be that RETURN insns aren't needed, so that is our return
796 label and we don't have to do anything else. */
798 insn = get_last_insn ();
799 while (GET_CODE (insn) == NOTE
800 || (GET_CODE (insn) == INSN
801 && (GET_CODE (PATTERN (insn)) == USE
802 || GET_CODE (PATTERN (insn)) == CLOBBER)))
803 insn = PREV_INSN (insn);
805 /* When a target threads its epilogue we might already have a
806 suitable return insn. If so put a label before it for the
807 end_of_function_label. */
808 if (GET_CODE (insn) == BARRIER
809 && GET_CODE (PREV_INSN (insn)) == JUMP_INSN
810 && GET_CODE (PATTERN (PREV_INSN (insn))) == RETURN)
812 rtx temp = PREV_INSN (PREV_INSN (insn));
813 end_of_function_label = gen_label_rtx ();
814 LABEL_NUSES (end_of_function_label) = 0;
816 /* Put the label before an USE insns that may proceed the RETURN insn. */
817 while (GET_CODE (temp) == USE)
818 temp = PREV_INSN (temp);
820 emit_label_after (end_of_function_label, temp);
823 else if (GET_CODE (insn) == CODE_LABEL)
824 end_of_function_label = insn;
827 /* Otherwise, make a new label and emit a RETURN and BARRIER,
829 end_of_function_label = gen_label_rtx ();
830 LABEL_NUSES (end_of_function_label) = 0;
831 emit_label (end_of_function_label);
835 /* The return we make may have delay slots too. */
836 rtx insn = gen_return ();
837 insn = emit_jump_insn (insn);
839 if (num_delay_slots (insn) > 0)
840 obstack_ptr_grow (&unfilled_slots_obstack, insn);
845 /* Show one additional use for this label so it won't go away until
847 ++LABEL_NUSES (end_of_function_label);
849 return end_of_function_label;
852 /* Put INSN and LIST together in a SEQUENCE rtx of LENGTH, and replace
853 the pattern of INSN with the SEQUENCE.
855 Chain the insns so that NEXT_INSN of each insn in the sequence points to
856 the next and NEXT_INSN of the last insn in the sequence points to
857 the first insn after the sequence. Similarly for PREV_INSN. This makes
858 it easier to scan all insns.
860 Returns the SEQUENCE that replaces INSN. */
863 emit_delay_sequence (insn, list, length, avail)
873 /* Allocate the the rtvec to hold the insns and the SEQUENCE. */
874 rtvec seqv = rtvec_alloc (length + 1);
875 rtx seq = gen_rtx (SEQUENCE, VOIDmode, seqv);
876 rtx seq_insn = make_insn_raw (seq);
877 rtx first = get_insns ();
878 rtx last = get_last_insn ();
880 /* Make a copy of the insn having delay slots. */
881 rtx delay_insn = copy_rtx (insn);
883 /* If INSN is followed by a BARRIER, delete the BARRIER since it will only
884 confuse further processing. Update LAST in case it was the last insn.
885 We will put the BARRIER back in later. */
886 if (NEXT_INSN (insn) && GET_CODE (NEXT_INSN (insn)) == BARRIER)
888 delete_insn (NEXT_INSN (insn));
889 last = get_last_insn ();
893 /* Splice our SEQUENCE into the insn stream where INSN used to be. */
894 NEXT_INSN (seq_insn) = NEXT_INSN (insn);
895 PREV_INSN (seq_insn) = PREV_INSN (insn);
898 PREV_INSN (NEXT_INSN (seq_insn)) = seq_insn;
901 NEXT_INSN (PREV_INSN (seq_insn)) = seq_insn;
903 /* Note the calls to set_new_first_and_last_insn must occur after
904 SEQ_INSN has been completely spliced into the insn stream.
906 Otherwise CUR_INSN_UID will get set to an incorrect value because
907 set_new_first_and_last_insn will not find SEQ_INSN in the chain. */
909 set_new_first_and_last_insn (first, seq_insn);
912 set_new_first_and_last_insn (seq_insn, last);
914 /* Build our SEQUENCE and rebuild the insn chain. */
915 XVECEXP (seq, 0, 0) = delay_insn;
916 INSN_DELETED_P (delay_insn) = 0;
917 PREV_INSN (delay_insn) = PREV_INSN (seq_insn);
919 for (li = list; li; li = XEXP (li, 1), i++)
921 rtx tem = XEXP (li, 0);
924 /* Show that this copy of the insn isn't deleted. */
925 INSN_DELETED_P (tem) = 0;
927 XVECEXP (seq, 0, i) = tem;
928 PREV_INSN (tem) = XVECEXP (seq, 0, i - 1);
929 NEXT_INSN (XVECEXP (seq, 0, i - 1)) = tem;
931 /* Remove any REG_DEAD notes because we can't rely on them now
932 that the insn has been moved. */
933 for (note = REG_NOTES (tem); note; note = XEXP (note, 1))
934 if (REG_NOTE_KIND (note) == REG_DEAD)
935 XEXP (note, 0) = const0_rtx;
938 NEXT_INSN (XVECEXP (seq, 0, length)) = NEXT_INSN (seq_insn);
940 /* If the previous insn is a SEQUENCE, update the NEXT_INSN pointer on the
941 last insn in that SEQUENCE to point to us. Similarly for the first
942 insn in the following insn if it is a SEQUENCE. */
944 if (PREV_INSN (seq_insn) && GET_CODE (PREV_INSN (seq_insn)) == INSN
945 && GET_CODE (PATTERN (PREV_INSN (seq_insn))) == SEQUENCE)
946 NEXT_INSN (XVECEXP (PATTERN (PREV_INSN (seq_insn)), 0,
947 XVECLEN (PATTERN (PREV_INSN (seq_insn)), 0) - 1))
950 if (NEXT_INSN (seq_insn) && GET_CODE (NEXT_INSN (seq_insn)) == INSN
951 && GET_CODE (PATTERN (NEXT_INSN (seq_insn))) == SEQUENCE)
952 PREV_INSN (XVECEXP (PATTERN (NEXT_INSN (seq_insn)), 0, 0)) = seq_insn;
954 /* If there used to be a BARRIER, put it back. */
956 emit_barrier_after (seq_insn);
964 /* Add INSN to DELAY_LIST and return the head of the new list. The list must
965 be in the order in which the insns are to be executed. */
968 add_to_delay_list (insn, delay_list)
972 /* If we have an empty list, just make a new list element. If
973 INSN has it's block number recorded, clear it since we may
974 be moving the insn to a new block. */
978 struct target_info *tinfo;
980 for (tinfo = target_hash_table[INSN_UID (insn) % TARGET_HASH_PRIME];
981 tinfo; tinfo = tinfo->next)
982 if (tinfo->uid == INSN_UID (insn))
988 return gen_rtx (INSN_LIST, VOIDmode, insn, NULL_RTX);
991 /* Otherwise this must be an INSN_LIST. Add INSN to the end of the
993 XEXP (delay_list, 1) = add_to_delay_list (insn, XEXP (delay_list, 1));
998 /* Delete INSN from the the delay slot of the insn that it is in. This may
999 produce an insn without anything in its delay slots. */
1002 delete_from_delay_slot (insn)
1005 rtx trial, seq_insn, seq, prev;
1009 /* We first must find the insn containing the SEQUENCE with INSN in its
1010 delay slot. Do this by finding an insn, TRIAL, where
1011 PREV_INSN (NEXT_INSN (TRIAL)) != TRIAL. */
1014 PREV_INSN (NEXT_INSN (trial)) == trial;
1015 trial = NEXT_INSN (trial))
1018 seq_insn = PREV_INSN (NEXT_INSN (trial));
1019 seq = PATTERN (seq_insn);
1021 /* Create a delay list consisting of all the insns other than the one
1022 we are deleting (unless we were the only one). */
1023 if (XVECLEN (seq, 0) > 2)
1024 for (i = 1; i < XVECLEN (seq, 0); i++)
1025 if (XVECEXP (seq, 0, i) != insn)
1026 delay_list = add_to_delay_list (XVECEXP (seq, 0, i), delay_list);
1028 /* Delete the old SEQUENCE, re-emit the insn that used to have the delay
1029 list, and rebuild the delay list if non-empty. */
1030 prev = PREV_INSN (seq_insn);
1031 trial = XVECEXP (seq, 0, 0);
1032 delete_insn (seq_insn);
1033 add_insn_after (trial, prev);
1035 if (GET_CODE (trial) == JUMP_INSN
1036 && (simplejump_p (trial) || GET_CODE (PATTERN (trial)) == RETURN))
1037 emit_barrier_after (trial);
1039 /* If there are any delay insns, remit them. Otherwise clear the
1042 trial = emit_delay_sequence (trial, delay_list, XVECLEN (seq, 0) - 2, 0);
1044 INSN_ANNULLED_BRANCH_P (trial) = 0;
1046 INSN_FROM_TARGET_P (insn) = 0;
1048 /* Show we need to fill this insn again. */
1049 obstack_ptr_grow (&unfilled_slots_obstack, trial);
1052 /* Delete INSN, a JUMP_INSN. If it is a conditional jump, we must track down
1053 the insn that sets CC0 for it and delete it too. */
1056 delete_scheduled_jump (insn)
1059 /* Delete the insn that sets cc0 for us. On machines without cc0, we could
1060 delete the insn that sets the condition code, but it is hard to find it.
1061 Since this case is rare anyway, don't bother trying; there would likely
1062 be other insns that became dead anyway, which we wouldn't know to
1066 if (reg_mentioned_p (cc0_rtx, insn))
1068 rtx note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
1070 /* If a reg-note was found, it points to an insn to set CC0. This
1071 insn is in the delay list of some other insn. So delete it from
1072 the delay list it was in. */
1075 if (! FIND_REG_INC_NOTE (XEXP (note, 0), NULL_RTX)
1076 && sets_cc0_p (PATTERN (XEXP (note, 0))) == 1)
1077 delete_from_delay_slot (XEXP (note, 0));
1081 /* The insn setting CC0 is our previous insn, but it may be in
1082 a delay slot. It will be the last insn in the delay slot, if
1084 rtx trial = previous_insn (insn);
1085 if (GET_CODE (trial) == NOTE)
1086 trial = prev_nonnote_insn (trial);
1087 if (sets_cc0_p (PATTERN (trial)) != 1
1088 || FIND_REG_INC_NOTE (trial, 0))
1090 if (PREV_INSN (NEXT_INSN (trial)) == trial)
1091 delete_insn (trial);
1093 delete_from_delay_slot (trial);
1101 /* Counters for delay-slot filling. */
1103 #define NUM_REORG_FUNCTIONS 2
1104 #define MAX_DELAY_HISTOGRAM 3
1105 #define MAX_REORG_PASSES 2
1107 static int num_insns_needing_delays[NUM_REORG_FUNCTIONS][MAX_REORG_PASSES];
1109 static int num_filled_delays[NUM_REORG_FUNCTIONS][MAX_DELAY_HISTOGRAM+1][MAX_REORG_PASSES];
1111 static int reorg_pass_number;
1114 note_delay_statistics (slots_filled, index)
1115 int slots_filled, index;
1117 num_insns_needing_delays[index][reorg_pass_number]++;
1118 if (slots_filled > MAX_DELAY_HISTOGRAM)
1119 slots_filled = MAX_DELAY_HISTOGRAM;
1120 num_filled_delays[index][slots_filled][reorg_pass_number]++;
1123 #if defined(ANNUL_IFFALSE_SLOTS) || defined(ANNUL_IFTRUE_SLOTS)
1125 /* Optimize the following cases:
1127 1. When a conditional branch skips over only one instruction,
1128 use an annulling branch and put that insn in the delay slot.
1129 Use either a branch that annuls when the condition if true or
1130 invert the test with a branch that annuls when the condition is
1131 false. This saves insns, since otherwise we must copy an insn
1134 (orig) (skip) (otherwise)
1135 Bcc.n L1 Bcc',a L1 Bcc,a L1'
1142 2. When a conditional branch skips over only one instruction,
1143 and after that, it unconditionally branches somewhere else,
1144 perform the similar optimization. This saves executing the
1145 second branch in the case where the inverted condition is true.
1152 INSN is a JUMP_INSN.
1154 This should be expanded to skip over N insns, where N is the number
1155 of delay slots required. */
1158 optimize_skip (insn)
1161 register rtx trial = next_nonnote_insn (insn);
1162 rtx next_trial = next_active_insn (trial);
1167 flags = get_jump_flags (insn, JUMP_LABEL (insn));
1170 || GET_CODE (trial) != INSN
1171 || GET_CODE (PATTERN (trial)) == SEQUENCE
1172 || recog_memoized (trial) < 0
1173 || (! eligible_for_annul_false (insn, 0, trial, flags)
1174 && ! eligible_for_annul_true (insn, 0, trial, flags)))
1177 /* There are two cases where we are just executing one insn (we assume
1178 here that a branch requires only one insn; this should be generalized
1179 at some point): Where the branch goes around a single insn or where
1180 we have one insn followed by a branch to the same label we branch to.
1181 In both of these cases, inverting the jump and annulling the delay
1182 slot give the same effect in fewer insns. */
1183 if ((next_trial == next_active_insn (JUMP_LABEL (insn)))
1185 && GET_CODE (next_trial) == JUMP_INSN
1186 && JUMP_LABEL (insn) == JUMP_LABEL (next_trial)
1187 && (simplejump_p (next_trial)
1188 || GET_CODE (PATTERN (next_trial)) == RETURN)))
1190 if (eligible_for_annul_false (insn, 0, trial, flags))
1192 if (invert_jump (insn, JUMP_LABEL (insn)))
1193 INSN_FROM_TARGET_P (trial) = 1;
1194 else if (! eligible_for_annul_true (insn, 0, trial, flags))
1198 delay_list = add_to_delay_list (trial, NULL_RTX);
1199 next_trial = next_active_insn (trial);
1200 update_block (trial, trial);
1201 delete_insn (trial);
1203 /* Also, if we are targeting an unconditional
1204 branch, thread our jump to the target of that branch. Don't
1205 change this into a RETURN here, because it may not accept what
1206 we have in the delay slot. We'll fix this up later. */
1207 if (next_trial && GET_CODE (next_trial) == JUMP_INSN
1208 && (simplejump_p (next_trial)
1209 || GET_CODE (PATTERN (next_trial)) == RETURN))
1211 target_label = JUMP_LABEL (next_trial);
1212 if (target_label == 0)
1213 target_label = find_end_label ();
1215 /* Recompute the flags based on TARGET_LABEL since threading
1216 the jump to TARGET_LABEL may change the direction of the
1217 jump (which may change the circumstances in which the
1218 delay slot is nullified). */
1219 flags = get_jump_flags (insn, target_label);
1220 if (eligible_for_annul_true (insn, 0, trial, flags))
1221 reorg_redirect_jump (insn, target_label);
1224 INSN_ANNULLED_BRANCH_P (insn) = 1;
1232 /* Encode and return branch direction and prediction information for
1233 INSN assuming it will jump to LABEL.
1235 Non conditional branches return no direction information and
1236 are predicted as very likely taken. */
1239 get_jump_flags (insn, label)
1244 /* get_jump_flags can be passed any insn with delay slots, these may
1245 be INSNs, CALL_INSNs, or JUMP_INSNs. Only JUMP_INSNs have branch
1246 direction information, and only if they are conditional jumps.
1248 If LABEL is zero, then there is no way to determine the branch
1250 if (GET_CODE (insn) == JUMP_INSN
1251 && (condjump_p (insn) || condjump_in_parallel_p (insn))
1252 && INSN_UID (insn) <= max_uid
1254 && INSN_UID (label) <= max_uid)
1256 = (uid_to_ruid[INSN_UID (label)] > uid_to_ruid[INSN_UID (insn)])
1257 ? ATTR_FLAG_forward : ATTR_FLAG_backward;
1258 /* No valid direction information. */
1262 /* If insn is a conditional branch call mostly_true_jump to get
1263 determine the branch prediction.
1265 Non conditional branches are predicted as very likely taken. */
1266 if (GET_CODE (insn) == JUMP_INSN
1267 && (condjump_p (insn) || condjump_in_parallel_p (insn)))
1271 prediction = mostly_true_jump (insn, get_branch_condition (insn, label));
1275 flags |= (ATTR_FLAG_very_likely | ATTR_FLAG_likely);
1278 flags |= ATTR_FLAG_likely;
1281 flags |= ATTR_FLAG_unlikely;
1284 flags |= (ATTR_FLAG_very_unlikely | ATTR_FLAG_unlikely);
1292 flags |= (ATTR_FLAG_very_likely | ATTR_FLAG_likely);
1297 /* Return 1 if INSN is a destination that will be branched to rarely (the
1298 return point of a function); return 2 if DEST will be branched to very
1299 rarely (a call to a function that doesn't return). Otherwise,
1303 rare_destination (insn)
1309 for (; insn; insn = next)
1311 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
1312 insn = XVECEXP (PATTERN (insn), 0, 0);
1314 next = NEXT_INSN (insn);
1316 switch (GET_CODE (insn))
1321 /* A BARRIER can either be after a JUMP_INSN or a CALL_INSN. We
1322 don't scan past JUMP_INSNs, so any barrier we find here must
1323 have been after a CALL_INSN and hence mean the call doesn't
1327 if (GET_CODE (PATTERN (insn)) == RETURN)
1329 else if (simplejump_p (insn)
1330 && jump_count++ < 10)
1331 next = JUMP_LABEL (insn);
1337 /* If we got here it means we hit the end of the function. So this
1338 is an unlikely destination. */
1343 /* Return truth value of the statement that this branch
1344 is mostly taken. If we think that the branch is extremely likely
1345 to be taken, we return 2. If the branch is slightly more likely to be
1346 taken, return 1. If the branch is slightly less likely to be taken,
1347 return 0 and if the branch is highly unlikely to be taken, return -1.
1349 CONDITION, if non-zero, is the condition that JUMP_INSN is testing. */
1352 mostly_true_jump (jump_insn, condition)
1353 rtx jump_insn, condition;
1355 rtx target_label = JUMP_LABEL (jump_insn);
1357 int rare_dest = rare_destination (target_label);
1358 int rare_fallthrough = rare_destination (NEXT_INSN (jump_insn));
1360 /* If branch probabilities are available, then use that number since it
1361 always gives a correct answer. */
1362 if (flag_branch_probabilities)
1364 rtx note = find_reg_note (jump_insn, REG_BR_PROB, 0);;
1367 int prob = XINT (note, 0);
1369 if (prob >= REG_BR_PROB_BASE * 9 / 10)
1371 else if (prob >= REG_BR_PROB_BASE / 2)
1373 else if (prob >= REG_BR_PROB_BASE / 10)
1380 /* If this is a branch outside a loop, it is highly unlikely. */
1381 if (GET_CODE (PATTERN (jump_insn)) == SET
1382 && GET_CODE (SET_SRC (PATTERN (jump_insn))) == IF_THEN_ELSE
1383 && ((GET_CODE (XEXP (SET_SRC (PATTERN (jump_insn)), 1)) == LABEL_REF
1384 && LABEL_OUTSIDE_LOOP_P (XEXP (SET_SRC (PATTERN (jump_insn)), 1)))
1385 || (GET_CODE (XEXP (SET_SRC (PATTERN (jump_insn)), 2)) == LABEL_REF
1386 && LABEL_OUTSIDE_LOOP_P (XEXP (SET_SRC (PATTERN (jump_insn)), 2)))))
1391 /* If this is the test of a loop, it is very likely true. We scan
1392 backwards from the target label. If we find a NOTE_INSN_LOOP_BEG
1393 before the next real insn, we assume the branch is to the top of
1395 for (insn = PREV_INSN (target_label);
1396 insn && GET_CODE (insn) == NOTE;
1397 insn = PREV_INSN (insn))
1398 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
1401 /* If this is a jump to the test of a loop, it is likely true. We scan
1402 forwards from the target label. If we find a NOTE_INSN_LOOP_VTOP
1403 before the next real insn, we assume the branch is to the loop branch
1405 for (insn = NEXT_INSN (target_label);
1406 insn && GET_CODE (insn) == NOTE;
1407 insn = PREV_INSN (insn))
1408 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_VTOP)
1412 /* Look at the relative rarities of the fallthrough and destination. If
1413 they differ, we can predict the branch that way. */
1415 switch (rare_fallthrough - rare_dest)
1429 /* If we couldn't figure out what this jump was, assume it won't be
1430 taken. This should be rare. */
1434 /* EQ tests are usually false and NE tests are usually true. Also,
1435 most quantities are positive, so we can make the appropriate guesses
1436 about signed comparisons against zero. */
1437 switch (GET_CODE (condition))
1440 /* Unconditional branch. */
1448 if (XEXP (condition, 1) == const0_rtx)
1453 if (XEXP (condition, 1) == const0_rtx)
1458 /* Predict backward branches usually take, forward branches usually not. If
1459 we don't know whether this is forward or backward, assume the branch
1460 will be taken, since most are. */
1461 return (target_label == 0 || INSN_UID (jump_insn) > max_uid
1462 || INSN_UID (target_label) > max_uid
1463 || (uid_to_ruid[INSN_UID (jump_insn)]
1464 > uid_to_ruid[INSN_UID (target_label)]));;
1467 /* Return the condition under which INSN will branch to TARGET. If TARGET
1468 is zero, return the condition under which INSN will return. If INSN is
1469 an unconditional branch, return const_true_rtx. If INSN isn't a simple
1470 type of jump, or it doesn't go to TARGET, return 0. */
1473 get_branch_condition (insn, target)
1477 rtx pat = PATTERN (insn);
1480 if (condjump_in_parallel_p (insn))
1481 pat = XVECEXP (pat, 0, 0);
1483 if (GET_CODE (pat) == RETURN)
1484 return target == 0 ? const_true_rtx : 0;
1486 else if (GET_CODE (pat) != SET || SET_DEST (pat) != pc_rtx)
1489 src = SET_SRC (pat);
1490 if (GET_CODE (src) == LABEL_REF && XEXP (src, 0) == target)
1491 return const_true_rtx;
1493 else if (GET_CODE (src) == IF_THEN_ELSE
1494 && ((target == 0 && GET_CODE (XEXP (src, 1)) == RETURN)
1495 || (GET_CODE (XEXP (src, 1)) == LABEL_REF
1496 && XEXP (XEXP (src, 1), 0) == target))
1497 && XEXP (src, 2) == pc_rtx)
1498 return XEXP (src, 0);
1500 else if (GET_CODE (src) == IF_THEN_ELSE
1501 && ((target == 0 && GET_CODE (XEXP (src, 2)) == RETURN)
1502 || (GET_CODE (XEXP (src, 2)) == LABEL_REF
1503 && XEXP (XEXP (src, 2), 0) == target))
1504 && XEXP (src, 1) == pc_rtx)
1505 return gen_rtx (reverse_condition (GET_CODE (XEXP (src, 0))),
1506 GET_MODE (XEXP (src, 0)),
1507 XEXP (XEXP (src, 0), 0), XEXP (XEXP (src, 0), 1));
1512 /* Return non-zero if CONDITION is more strict than the condition of
1513 INSN, i.e., if INSN will always branch if CONDITION is true. */
1516 condition_dominates_p (condition, insn)
1520 rtx other_condition = get_branch_condition (insn, JUMP_LABEL (insn));
1521 enum rtx_code code = GET_CODE (condition);
1522 enum rtx_code other_code;
1524 if (rtx_equal_p (condition, other_condition)
1525 || other_condition == const_true_rtx)
1528 else if (condition == const_true_rtx || other_condition == 0)
1531 other_code = GET_CODE (other_condition);
1532 if (GET_RTX_LENGTH (code) != 2 || GET_RTX_LENGTH (other_code) != 2
1533 || ! rtx_equal_p (XEXP (condition, 0), XEXP (other_condition, 0))
1534 || ! rtx_equal_p (XEXP (condition, 1), XEXP (other_condition, 1)))
1537 return comparison_dominates_p (code, other_code);
1540 /* Return non-zero if redirecting JUMP to NEWLABEL does not invalidate
1541 any insns already in the delay slot of JUMP. */
1544 redirect_with_delay_slots_safe_p (jump, newlabel, seq)
1545 rtx jump, newlabel, seq;
1547 int flags, slots, i;
1548 rtx pat = PATTERN (seq);
1550 /* Make sure all the delay slots of this jump would still
1551 be valid after threading the jump. If they are still
1552 valid, then return non-zero. */
1554 flags = get_jump_flags (jump, newlabel);
1555 for (i = 1; i < XVECLEN (pat, 0); i++)
1557 #ifdef ANNUL_IFFALSE_SLOTS
1558 (INSN_ANNULLED_BRANCH_P (jump)
1559 && INSN_FROM_TARGET_P (XVECEXP (pat, 0, i)))
1560 ? eligible_for_annul_false (jump, i - 1,
1561 XVECEXP (pat, 0, i), flags) :
1563 #ifdef ANNUL_IFTRUE_SLOTS
1564 (INSN_ANNULLED_BRANCH_P (jump)
1565 && ! INSN_FROM_TARGET_P (XVECEXP (pat, 0, i)))
1566 ? eligible_for_annul_true (jump, i - 1,
1567 XVECEXP (pat, 0, i), flags) :
1569 eligible_for_delay (jump, i -1, XVECEXP (pat, 0, i), flags)))
1572 return (i == XVECLEN (pat, 0));
1575 /* Return non-zero if redirecting JUMP to NEWLABEL does not invalidate
1576 any insns we wish to place in the delay slot of JUMP. */
1579 redirect_with_delay_list_safe_p (jump, newlabel, delay_list)
1580 rtx jump, newlabel, delay_list;
1585 /* Make sure all the insns in DELAY_LIST would still be
1586 valid after threading the jump. If they are still
1587 valid, then return non-zero. */
1589 flags = get_jump_flags (jump, newlabel);
1590 for (li = delay_list, i = 0; li; li = XEXP (li, 1), i++)
1592 #ifdef ANNUL_IFFALSE_SLOTS
1593 (INSN_ANNULLED_BRANCH_P (jump)
1594 && INSN_FROM_TARGET_P (XEXP (li, 0)))
1595 ? eligible_for_annul_false (jump, i, XEXP (li, 0), flags) :
1597 #ifdef ANNUL_IFTRUE_SLOTS
1598 (INSN_ANNULLED_BRANCH_P (jump)
1599 && ! INSN_FROM_TARGET_P (XEXP (li, 0)))
1600 ? eligible_for_annul_true (jump, i, XEXP (li, 0), flags) :
1602 eligible_for_delay (jump, i, XEXP (li, 0), flags)))
1605 return (li == NULL);
1609 /* INSN branches to an insn whose pattern SEQ is a SEQUENCE. Given that
1610 the condition tested by INSN is CONDITION and the resources shown in
1611 OTHER_NEEDED are needed after INSN, see whether INSN can take all the insns
1612 from SEQ's delay list, in addition to whatever insns it may execute
1613 (in DELAY_LIST). SETS and NEEDED are denote resources already set and
1614 needed while searching for delay slot insns. Return the concatenated
1615 delay list if possible, otherwise, return 0.
1617 SLOTS_TO_FILL is the total number of slots required by INSN, and
1618 PSLOTS_FILLED points to the number filled so far (also the number of
1619 insns in DELAY_LIST). It is updated with the number that have been
1620 filled from the SEQUENCE, if any.
1622 PANNUL_P points to a non-zero value if we already know that we need
1623 to annul INSN. If this routine determines that annulling is needed,
1624 it may set that value non-zero.
1626 PNEW_THREAD points to a location that is to receive the place at which
1627 execution should continue. */
1630 steal_delay_list_from_target (insn, condition, seq, delay_list,
1631 sets, needed, other_needed,
1632 slots_to_fill, pslots_filled, pannul_p,
1634 rtx insn, condition;
1637 struct resources *sets, *needed, *other_needed;
1644 int slots_remaining = slots_to_fill - *pslots_filled;
1645 int total_slots_filled = *pslots_filled;
1646 rtx new_delay_list = 0;
1647 int must_annul = *pannul_p;
1650 /* We can't do anything if there are more delay slots in SEQ than we
1651 can handle, or if we don't know that it will be a taken branch.
1652 We know that it will be a taken branch if it is either an unconditional
1653 branch or a conditional branch with a stricter branch condition.
1655 Also, exit if the branch has more than one set, since then it is computing
1656 other results that can't be ignored, e.g. the HPPA mov&branch instruction.
1657 ??? It may be possible to move other sets into INSN in addition to
1658 moving the instructions in the delay slots. */
1660 if (XVECLEN (seq, 0) - 1 > slots_remaining
1661 || ! condition_dominates_p (condition, XVECEXP (seq, 0, 0))
1662 || ! single_set (XVECEXP (seq, 0, 0)))
1665 for (i = 1; i < XVECLEN (seq, 0); i++)
1667 rtx trial = XVECEXP (seq, 0, i);
1670 if (insn_references_resource_p (trial, sets, 0)
1671 || insn_sets_resource_p (trial, needed, 0)
1672 || insn_sets_resource_p (trial, sets, 0)
1674 /* If TRIAL sets CC0, we can't copy it, so we can't steal this
1676 || find_reg_note (trial, REG_CC_USER, NULL_RTX)
1678 /* If TRIAL is from the fallthrough code of an annulled branch insn
1679 in SEQ, we cannot use it. */
1680 || (INSN_ANNULLED_BRANCH_P (XVECEXP (seq, 0, 0))
1681 && ! INSN_FROM_TARGET_P (trial)))
1684 /* If this insn was already done (usually in a previous delay slot),
1685 pretend we put it in our delay slot. */
1686 if (redundant_insn (trial, insn, new_delay_list))
1689 /* We will end up re-vectoring this branch, so compute flags
1690 based on jumping to the new label. */
1691 flags = get_jump_flags (insn, JUMP_LABEL (XVECEXP (seq, 0, 0)));
1694 && ((condition == const_true_rtx
1695 || (! insn_sets_resource_p (trial, other_needed, 0)
1696 && ! may_trap_p (PATTERN (trial)))))
1697 ? eligible_for_delay (insn, total_slots_filled, trial, flags)
1699 eligible_for_annul_false (insn, total_slots_filled, trial, flags)))
1701 temp = copy_rtx (trial);
1702 INSN_FROM_TARGET_P (temp) = 1;
1703 new_delay_list = add_to_delay_list (temp, new_delay_list);
1704 total_slots_filled++;
1706 if (--slots_remaining == 0)
1713 /* Show the place to which we will be branching. */
1714 *pnew_thread = next_active_insn (JUMP_LABEL (XVECEXP (seq, 0, 0)));
1716 /* Add any new insns to the delay list and update the count of the
1717 number of slots filled. */
1718 *pslots_filled = total_slots_filled;
1719 *pannul_p = must_annul;
1721 if (delay_list == 0)
1722 return new_delay_list;
1724 for (temp = new_delay_list; temp; temp = XEXP (temp, 1))
1725 delay_list = add_to_delay_list (XEXP (temp, 0), delay_list);
1730 /* Similar to steal_delay_list_from_target except that SEQ is on the
1731 fallthrough path of INSN. Here we only do something if the delay insn
1732 of SEQ is an unconditional branch. In that case we steal its delay slot
1733 for INSN since unconditional branches are much easier to fill. */
1736 steal_delay_list_from_fallthrough (insn, condition, seq,
1737 delay_list, sets, needed, other_needed,
1738 slots_to_fill, pslots_filled, pannul_p)
1739 rtx insn, condition;
1742 struct resources *sets, *needed, *other_needed;
1750 flags = get_jump_flags (insn, JUMP_LABEL (insn));
1752 /* We can't do anything if SEQ's delay insn isn't an
1753 unconditional branch. */
1755 if (! simplejump_p (XVECEXP (seq, 0, 0))
1756 && GET_CODE (PATTERN (XVECEXP (seq, 0, 0))) != RETURN)
1759 for (i = 1; i < XVECLEN (seq, 0); i++)
1761 rtx trial = XVECEXP (seq, 0, i);
1763 /* If TRIAL sets CC0, stealing it will move it too far from the use
1765 if (insn_references_resource_p (trial, sets, 0)
1766 || insn_sets_resource_p (trial, needed, 0)
1767 || insn_sets_resource_p (trial, sets, 0)
1769 || sets_cc0_p (PATTERN (trial))
1775 /* If this insn was already done, we don't need it. */
1776 if (redundant_insn (trial, insn, delay_list))
1778 delete_from_delay_slot (trial);
1783 && ((condition == const_true_rtx
1784 || (! insn_sets_resource_p (trial, other_needed, 0)
1785 && ! may_trap_p (PATTERN (trial)))))
1786 ? eligible_for_delay (insn, *pslots_filled, trial, flags)
1788 eligible_for_annul_true (insn, *pslots_filled, trial, flags)))
1790 delete_from_delay_slot (trial);
1791 delay_list = add_to_delay_list (trial, delay_list);
1793 if (++(*pslots_filled) == slots_to_fill)
1803 /* Try merging insns starting at THREAD which match exactly the insns in
1806 If all insns were matched and the insn was previously annulling, the
1807 annul bit will be cleared.
1809 For each insn that is merged, if the branch is or will be non-annulling,
1810 we delete the merged insn. */
1813 try_merge_delay_insns (insn, thread)
1816 rtx trial, next_trial;
1817 rtx delay_insn = XVECEXP (PATTERN (insn), 0, 0);
1818 int annul_p = INSN_ANNULLED_BRANCH_P (delay_insn);
1819 int slot_number = 1;
1820 int num_slots = XVECLEN (PATTERN (insn), 0);
1821 rtx next_to_match = XVECEXP (PATTERN (insn), 0, slot_number);
1822 struct resources set, needed;
1823 rtx merged_insns = 0;
1827 flags = get_jump_flags (delay_insn, JUMP_LABEL (delay_insn));
1829 CLEAR_RESOURCE (&needed);
1830 CLEAR_RESOURCE (&set);
1832 /* If this is not an annulling branch, take into account anything needed in
1833 NEXT_TO_MATCH. This prevents two increments from being incorrectly
1834 folded into one. If we are annulling, this would be the correct
1835 thing to do. (The alternative, looking at things set in NEXT_TO_MATCH
1836 will essentially disable this optimization. This method is somewhat of
1837 a kludge, but I don't see a better way.) */
1839 mark_referenced_resources (next_to_match, &needed, 1);
1841 for (trial = thread; !stop_search_p (trial, 1); trial = next_trial)
1843 rtx pat = PATTERN (trial);
1844 rtx oldtrial = trial;
1846 next_trial = next_nonnote_insn (trial);
1848 /* TRIAL must be a CALL_INSN or INSN. Skip USE and CLOBBER. */
1849 if (GET_CODE (trial) == INSN
1850 && (GET_CODE (pat) == USE || GET_CODE (pat) == CLOBBER))
1853 if (GET_CODE (next_to_match) == GET_CODE (trial)
1855 /* We can't share an insn that sets cc0. */
1856 && ! sets_cc0_p (pat)
1858 && ! insn_references_resource_p (trial, &set, 1)
1859 && ! insn_sets_resource_p (trial, &set, 1)
1860 && ! insn_sets_resource_p (trial, &needed, 1)
1861 && (trial = try_split (pat, trial, 0)) != 0
1862 /* Update next_trial, in case try_split succeeded. */
1863 && (next_trial = next_nonnote_insn (trial))
1864 /* Likewise THREAD. */
1865 && (thread = oldtrial == thread ? trial : thread)
1866 && rtx_equal_p (PATTERN (next_to_match), PATTERN (trial))
1867 /* Have to test this condition if annul condition is different
1868 from (and less restrictive than) non-annulling one. */
1869 && eligible_for_delay (delay_insn, slot_number - 1, trial, flags))
1874 update_block (trial, thread);
1875 if (trial == thread)
1876 thread = next_active_insn (thread);
1878 delete_insn (trial);
1879 INSN_FROM_TARGET_P (next_to_match) = 0;
1882 merged_insns = gen_rtx (INSN_LIST, VOIDmode, trial, merged_insns);
1884 if (++slot_number == num_slots)
1887 next_to_match = XVECEXP (PATTERN (insn), 0, slot_number);
1889 mark_referenced_resources (next_to_match, &needed, 1);
1892 mark_set_resources (trial, &set, 0, 1);
1893 mark_referenced_resources (trial, &needed, 1);
1896 /* See if we stopped on a filled insn. If we did, try to see if its
1897 delay slots match. */
1898 if (slot_number != num_slots
1899 && trial && GET_CODE (trial) == INSN
1900 && GET_CODE (PATTERN (trial)) == SEQUENCE
1901 && ! INSN_ANNULLED_BRANCH_P (XVECEXP (PATTERN (trial), 0, 0)))
1903 rtx pat = PATTERN (trial);
1904 rtx filled_insn = XVECEXP (pat, 0, 0);
1906 /* Account for resources set/needed by the filled insn. */
1907 mark_set_resources (filled_insn, &set, 0, 1);
1908 mark_referenced_resources (filled_insn, &needed, 1);
1910 for (i = 1; i < XVECLEN (pat, 0); i++)
1912 rtx dtrial = XVECEXP (pat, 0, i);
1914 if (! insn_references_resource_p (dtrial, &set, 1)
1915 && ! insn_sets_resource_p (dtrial, &set, 1)
1916 && ! insn_sets_resource_p (dtrial, &needed, 1)
1918 && ! sets_cc0_p (PATTERN (dtrial))
1920 && rtx_equal_p (PATTERN (next_to_match), PATTERN (dtrial))
1921 && eligible_for_delay (delay_insn, slot_number - 1, dtrial, flags))
1925 update_block (dtrial, thread);
1926 delete_from_delay_slot (dtrial);
1927 INSN_FROM_TARGET_P (next_to_match) = 0;
1930 merged_insns = gen_rtx (INSN_LIST, SImode, dtrial,
1933 if (++slot_number == num_slots)
1936 next_to_match = XVECEXP (PATTERN (insn), 0, slot_number);
1941 /* If all insns in the delay slot have been matched and we were previously
1942 annulling the branch, we need not any more. In that case delete all the
1943 merged insns. Also clear the INSN_FROM_TARGET_P bit of each insn the
1944 the delay list so that we know that it isn't only being used at the
1946 if (slot_number == num_slots && annul_p)
1948 for (; merged_insns; merged_insns = XEXP (merged_insns, 1))
1950 if (GET_MODE (merged_insns) == SImode)
1952 update_block (XEXP (merged_insns, 0), thread);
1953 delete_from_delay_slot (XEXP (merged_insns, 0));
1957 update_block (XEXP (merged_insns, 0), thread);
1958 delete_insn (XEXP (merged_insns, 0));
1962 INSN_ANNULLED_BRANCH_P (delay_insn) = 0;
1964 for (i = 0; i < XVECLEN (PATTERN (insn), 0); i++)
1965 INSN_FROM_TARGET_P (XVECEXP (PATTERN (insn), 0, i)) = 0;
1969 /* See if INSN is redundant with an insn in front of TARGET. Often this
1970 is called when INSN is a candidate for a delay slot of TARGET.
1971 DELAY_LIST are insns that will be placed in delay slots of TARGET in front
1972 of INSN. Often INSN will be redundant with an insn in a delay slot of
1973 some previous insn. This happens when we have a series of branches to the
1974 same label; in that case the first insn at the target might want to go
1975 into each of the delay slots.
1977 If we are not careful, this routine can take up a significant fraction
1978 of the total compilation time (4%), but only wins rarely. Hence we
1979 speed this routine up by making two passes. The first pass goes back
1980 until it hits a label and sees if it find an insn with an identical
1981 pattern. Only in this (relatively rare) event does it check for
1984 We do not split insns we encounter. This could cause us not to find a
1985 redundant insn, but the cost of splitting seems greater than the possible
1986 gain in rare cases. */
1989 redundant_insn (insn, target, delay_list)
1994 rtx target_main = target;
1995 rtx ipat = PATTERN (insn);
1997 struct resources needed, set;
2000 /* Scan backwards looking for a match. */
2001 for (trial = PREV_INSN (target); trial; trial = PREV_INSN (trial))
2003 if (GET_CODE (trial) == CODE_LABEL)
2006 if (GET_RTX_CLASS (GET_CODE (trial)) != 'i')
2009 pat = PATTERN (trial);
2010 if (GET_CODE (pat) == USE || GET_CODE (pat) == CLOBBER)
2013 if (GET_CODE (pat) == SEQUENCE)
2015 /* Stop for a CALL and its delay slots because it is difficult to
2016 track its resource needs correctly. */
2017 if (GET_CODE (XVECEXP (pat, 0, 0)) == CALL_INSN)
2020 /* Stop for an INSN or JUMP_INSN with delayed effects and its delay
2021 slots because it is difficult to track its resource needs
2024 #ifdef INSN_SETS_ARE_DELAYED
2025 if (INSN_SETS_ARE_DELAYED (XVECEXP (pat, 0, 0)))
2029 #ifdef INSN_REFERENCES_ARE_DELAYED
2030 if (INSN_REFERENCES_ARE_DELAYED (XVECEXP (pat, 0, 0)))
2034 /* See if any of the insns in the delay slot match, updating
2035 resource requirements as we go. */
2036 for (i = XVECLEN (pat, 0) - 1; i > 0; i--)
2037 if (GET_CODE (XVECEXP (pat, 0, i)) == GET_CODE (insn)
2038 && rtx_equal_p (PATTERN (XVECEXP (pat, 0, i)), ipat))
2041 /* If found a match, exit this loop early. */
2046 else if (GET_CODE (trial) == GET_CODE (insn) && rtx_equal_p (pat, ipat))
2050 /* If we didn't find an insn that matches, return 0. */
2054 /* See what resources this insn sets and needs. If they overlap, or
2055 if this insn references CC0, it can't be redundant. */
2057 CLEAR_RESOURCE (&needed);
2058 CLEAR_RESOURCE (&set);
2059 mark_set_resources (insn, &set, 0, 1);
2060 mark_referenced_resources (insn, &needed, 1);
2062 /* If TARGET is a SEQUENCE, get the main insn. */
2063 if (GET_CODE (target) == INSN && GET_CODE (PATTERN (target)) == SEQUENCE)
2064 target_main = XVECEXP (PATTERN (target), 0, 0);
2066 if (resource_conflicts_p (&needed, &set)
2068 || reg_mentioned_p (cc0_rtx, ipat)
2070 /* The insn requiring the delay may not set anything needed or set by
2072 || insn_sets_resource_p (target_main, &needed, 1)
2073 || insn_sets_resource_p (target_main, &set, 1))
2076 /* Insns we pass may not set either NEEDED or SET, so merge them for
2078 needed.memory |= set.memory;
2079 needed.unch_memory |= set.unch_memory;
2080 IOR_HARD_REG_SET (needed.regs, set.regs);
2082 /* This insn isn't redundant if it conflicts with an insn that either is
2083 or will be in a delay slot of TARGET. */
2087 if (insn_sets_resource_p (XEXP (delay_list, 0), &needed, 1))
2089 delay_list = XEXP (delay_list, 1);
2092 if (GET_CODE (target) == INSN && GET_CODE (PATTERN (target)) == SEQUENCE)
2093 for (i = 1; i < XVECLEN (PATTERN (target), 0); i++)
2094 if (insn_sets_resource_p (XVECEXP (PATTERN (target), 0, i), &needed, 1))
2097 /* Scan backwards until we reach a label or an insn that uses something
2098 INSN sets or sets something insn uses or sets. */
2100 for (trial = PREV_INSN (target);
2101 trial && GET_CODE (trial) != CODE_LABEL;
2102 trial = PREV_INSN (trial))
2104 if (GET_CODE (trial) != INSN && GET_CODE (trial) != CALL_INSN
2105 && GET_CODE (trial) != JUMP_INSN)
2108 pat = PATTERN (trial);
2109 if (GET_CODE (pat) == USE || GET_CODE (pat) == CLOBBER)
2112 if (GET_CODE (pat) == SEQUENCE)
2114 /* If this is a CALL_INSN and its delay slots, it is hard to track
2115 the resource needs properly, so give up. */
2116 if (GET_CODE (XVECEXP (pat, 0, 0)) == CALL_INSN)
2119 /* If this this is an INSN or JUMP_INSN with delayed effects, it
2120 is hard to track the resource needs properly, so give up. */
2122 #ifdef INSN_SETS_ARE_DELAYED
2123 if (INSN_SETS_ARE_DELAYED (XVECEXP (pat, 0, 0)))
2127 #ifdef INSN_REFERENCES_ARE_DELAYED
2128 if (INSN_REFERENCES_ARE_DELAYED (XVECEXP (pat, 0, 0)))
2132 /* See if any of the insns in the delay slot match, updating
2133 resource requirements as we go. */
2134 for (i = XVECLEN (pat, 0) - 1; i > 0; i--)
2136 rtx candidate = XVECEXP (pat, 0, i);
2138 /* If an insn will be annulled if the branch is false, it isn't
2139 considered as a possible duplicate insn. */
2140 if (rtx_equal_p (PATTERN (candidate), ipat)
2141 && ! (INSN_ANNULLED_BRANCH_P (XVECEXP (pat, 0, 0))
2142 && INSN_FROM_TARGET_P (candidate)))
2144 /* Show that this insn will be used in the sequel. */
2145 INSN_FROM_TARGET_P (candidate) = 0;
2149 /* Unless this is an annulled insn from the target of a branch,
2150 we must stop if it sets anything needed or set by INSN. */
2151 if ((! INSN_ANNULLED_BRANCH_P (XVECEXP (pat, 0, 0))
2152 || ! INSN_FROM_TARGET_P (candidate))
2153 && insn_sets_resource_p (candidate, &needed, 1))
2158 /* If the insn requiring the delay slot conflicts with INSN, we
2160 if (insn_sets_resource_p (XVECEXP (pat, 0, 0), &needed, 1))
2165 /* See if TRIAL is the same as INSN. */
2166 pat = PATTERN (trial);
2167 if (rtx_equal_p (pat, ipat))
2170 /* Can't go any further if TRIAL conflicts with INSN. */
2171 if (insn_sets_resource_p (trial, &needed, 1))
2179 /* Return 1 if THREAD can only be executed in one way. If LABEL is non-zero,
2180 it is the target of the branch insn being scanned. If ALLOW_FALLTHROUGH
2181 is non-zero, we are allowed to fall into this thread; otherwise, we are
2184 If LABEL is used more than one or we pass a label other than LABEL before
2185 finding an active insn, we do not own this thread. */
2188 own_thread_p (thread, label, allow_fallthrough)
2191 int allow_fallthrough;
2196 /* We don't own the function end. */
2200 /* Get the first active insn, or THREAD, if it is an active insn. */
2201 active_insn = next_active_insn (PREV_INSN (thread));
2203 for (insn = thread; insn != active_insn; insn = NEXT_INSN (insn))
2204 if (GET_CODE (insn) == CODE_LABEL
2205 && (insn != label || LABEL_NUSES (insn) != 1))
2208 if (allow_fallthrough)
2211 /* Ensure that we reach a BARRIER before any insn or label. */
2212 for (insn = prev_nonnote_insn (thread);
2213 insn == 0 || GET_CODE (insn) != BARRIER;
2214 insn = prev_nonnote_insn (insn))
2216 || GET_CODE (insn) == CODE_LABEL
2217 || (GET_CODE (insn) == INSN
2218 && GET_CODE (PATTERN (insn)) != USE
2219 && GET_CODE (PATTERN (insn)) != CLOBBER))
2225 /* Find the number of the basic block that starts closest to INSN. Return -1
2226 if we couldn't find such a basic block. */
2229 find_basic_block (insn)
2234 /* Scan backwards to the previous BARRIER. Then see if we can find a
2235 label that starts a basic block. Return the basic block number. */
2237 for (insn = prev_nonnote_insn (insn);
2238 insn && GET_CODE (insn) != BARRIER;
2239 insn = prev_nonnote_insn (insn))
2242 /* The start of the function is basic block zero. */
2246 /* See if any of the upcoming CODE_LABELs start a basic block. If we reach
2247 anything other than a CODE_LABEL or note, we can't find this code. */
2248 for (insn = next_nonnote_insn (insn);
2249 insn && GET_CODE (insn) == CODE_LABEL;
2250 insn = next_nonnote_insn (insn))
2252 for (i = 0; i < n_basic_blocks; i++)
2253 if (insn == basic_block_head[i])
2260 /* Called when INSN is being moved from a location near the target of a jump.
2261 We leave a marker of the form (use (INSN)) immediately in front
2262 of WHERE for mark_target_live_regs. These markers will be deleted when
2265 We used to try to update the live status of registers if WHERE is at
2266 the start of a basic block, but that can't work since we may remove a
2267 BARRIER in relax_delay_slots. */
2270 update_block (insn, where)
2276 /* Ignore if this was in a delay slot and it came from the target of
2278 if (INSN_FROM_TARGET_P (insn))
2281 emit_insn_before (gen_rtx (USE, VOIDmode, insn), where);
2283 /* INSN might be making a value live in a block where it didn't use to
2284 be. So recompute liveness information for this block. */
2286 b = find_basic_block (insn);
2291 /* Similar to REDIRECT_JUMP except that we update the BB_TICKS entry for
2292 the basic block containing the jump. */
2295 reorg_redirect_jump (jump, nlabel)
2299 int b = find_basic_block (jump);
2304 return redirect_jump (jump, nlabel);
2307 /* Called when INSN is being moved forward into a delay slot of DELAYED_INSN.
2308 We check every instruction between INSN and DELAYED_INSN for REG_DEAD notes
2309 that reference values used in INSN. If we find one, then we move the
2310 REG_DEAD note to INSN.
2312 This is needed to handle the case where an later insn (after INSN) has a
2313 REG_DEAD note for a register used by INSN, and this later insn subsequently
2314 gets moved before a CODE_LABEL because it is a redundant insn. In this
2315 case, mark_target_live_regs may be confused into thinking the register
2316 is dead because it sees a REG_DEAD note immediately before a CODE_LABEL. */
2319 update_reg_dead_notes (insn, delayed_insn)
2320 rtx insn, delayed_insn;
2324 for (p = next_nonnote_insn (insn); p != delayed_insn;
2325 p = next_nonnote_insn (p))
2326 for (link = REG_NOTES (p); link; link = next)
2328 next = XEXP (link, 1);
2330 if (REG_NOTE_KIND (link) != REG_DEAD
2331 || GET_CODE (XEXP (link, 0)) != REG)
2334 if (reg_referenced_p (XEXP (link, 0), PATTERN (insn)))
2336 /* Move the REG_DEAD note from P to INSN. */
2337 remove_note (p, link);
2338 XEXP (link, 1) = REG_NOTES (insn);
2339 REG_NOTES (insn) = link;
2344 /* Called when an insn redundant with start_insn is deleted. If there
2345 is a REG_DEAD note for the target of start_insn between start_insn
2346 and stop_insn, then the REG_DEAD note needs to be deleted since the
2347 value no longer dies there.
2349 If the REG_DEAD note isn't deleted, then mark_target_live_regs may be
2350 confused into thinking the register is dead. */
2353 fix_reg_dead_note (start_insn, stop_insn)
2354 rtx start_insn, stop_insn;
2358 for (p = next_nonnote_insn (start_insn); p != stop_insn;
2359 p = next_nonnote_insn (p))
2360 for (link = REG_NOTES (p); link; link = next)
2362 next = XEXP (link, 1);
2364 if (REG_NOTE_KIND (link) != REG_DEAD
2365 || GET_CODE (XEXP (link, 0)) != REG)
2368 if (reg_set_p (XEXP (link, 0), PATTERN (start_insn)))
2370 remove_note (p, link);
2376 /* Delete any REG_UNUSED notes that exist on INSN but not on REDUNDANT_INSN.
2378 This handles the case of udivmodXi4 instructions which optimize their
2379 output depending on whether any REG_UNUSED notes are present.
2380 we must make sure that INSN calculates as many results as REDUNDANT_INSN
2384 update_reg_unused_notes (insn, redundant_insn)
2385 rtx insn, redundant_insn;
2389 for (link = REG_NOTES (insn); link; link = next)
2391 next = XEXP (link, 1);
2393 if (REG_NOTE_KIND (link) != REG_UNUSED
2394 || GET_CODE (XEXP (link, 0)) != REG)
2397 if (! find_regno_note (redundant_insn, REG_UNUSED,
2398 REGNO (XEXP (link, 0))))
2399 remove_note (insn, link);
2403 /* Marks registers possibly live at the current place being scanned by
2404 mark_target_live_regs. Used only by next two function. */
2406 static HARD_REG_SET current_live_regs;
2408 /* Marks registers for which we have seen a REG_DEAD note but no assignment.
2409 Also only used by the next two functions. */
2411 static HARD_REG_SET pending_dead_regs;
2413 /* Utility function called from mark_target_live_regs via note_stores.
2414 It deadens any CLOBBERed registers and livens any SET registers. */
2417 update_live_status (dest, x)
2421 int first_regno, last_regno;
2424 if (GET_CODE (dest) != REG
2425 && (GET_CODE (dest) != SUBREG || GET_CODE (SUBREG_REG (dest)) != REG))
2428 if (GET_CODE (dest) == SUBREG)
2429 first_regno = REGNO (SUBREG_REG (dest)) + SUBREG_WORD (dest);
2431 first_regno = REGNO (dest);
2433 last_regno = first_regno + HARD_REGNO_NREGS (first_regno, GET_MODE (dest));
2435 if (GET_CODE (x) == CLOBBER)
2436 for (i = first_regno; i < last_regno; i++)
2437 CLEAR_HARD_REG_BIT (current_live_regs, i);
2439 for (i = first_regno; i < last_regno; i++)
2441 SET_HARD_REG_BIT (current_live_regs, i);
2442 CLEAR_HARD_REG_BIT (pending_dead_regs, i);
2446 /* Similar to next_insn, but ignores insns in the delay slots of
2447 an annulled branch. */
2450 next_insn_no_annul (insn)
2455 /* If INSN is an annulled branch, skip any insns from the target
2457 if (INSN_ANNULLED_BRANCH_P (insn)
2458 && NEXT_INSN (PREV_INSN (insn)) != insn)
2459 while (INSN_FROM_TARGET_P (NEXT_INSN (insn)))
2460 insn = NEXT_INSN (insn);
2462 insn = NEXT_INSN (insn);
2463 if (insn && GET_CODE (insn) == INSN
2464 && GET_CODE (PATTERN (insn)) == SEQUENCE)
2465 insn = XVECEXP (PATTERN (insn), 0, 0);
2471 /* A subroutine of mark_target_live_regs. Search forward from TARGET
2472 looking for registers that are set before they are used. These are dead.
2473 Stop after passing a few conditional jumps, and/or a small
2474 number of unconditional branches. */
2477 find_dead_or_set_registers (target, res, jump_target, jump_count, set, needed)
2479 struct resources *res;
2482 struct resources set, needed;
2484 HARD_REG_SET scratch;
2489 for (insn = target; insn; insn = next)
2491 rtx this_jump_insn = insn;
2493 next = NEXT_INSN (insn);
2494 switch (GET_CODE (insn))
2497 /* After a label, any pending dead registers that weren't yet
2498 used can be made dead. */
2499 AND_COMPL_HARD_REG_SET (pending_dead_regs, needed.regs);
2500 AND_COMPL_HARD_REG_SET (res->regs, pending_dead_regs);
2501 CLEAR_HARD_REG_SET (pending_dead_regs);
2503 if (CODE_LABEL_NUMBER (insn) < max_label_num_after_reload)
2505 /* All spill registers are dead at a label, so kill all of the
2506 ones that aren't needed also. */
2507 COPY_HARD_REG_SET (scratch, used_spill_regs);
2508 AND_COMPL_HARD_REG_SET (scratch, needed.regs);
2509 AND_COMPL_HARD_REG_SET (res->regs, scratch);
2518 if (GET_CODE (PATTERN (insn)) == USE)
2520 /* If INSN is a USE made by update_block, we care about the
2521 underlying insn. Any registers set by the underlying insn
2522 are live since the insn is being done somewhere else. */
2523 if (GET_RTX_CLASS (GET_CODE (XEXP (PATTERN (insn), 0))) == 'i')
2524 mark_set_resources (XEXP (PATTERN (insn), 0), res, 0, 1);
2526 /* All other USE insns are to be ignored. */
2529 else if (GET_CODE (PATTERN (insn)) == CLOBBER)
2531 else if (GET_CODE (PATTERN (insn)) == SEQUENCE)
2533 /* An unconditional jump can be used to fill the delay slot
2534 of a call, so search for a JUMP_INSN in any position. */
2535 for (i = 0; i < XVECLEN (PATTERN (insn), 0); i++)
2537 this_jump_insn = XVECEXP (PATTERN (insn), 0, i);
2538 if (GET_CODE (this_jump_insn) == JUMP_INSN)
2544 if (GET_CODE (this_jump_insn) == JUMP_INSN)
2546 if (jump_count++ < 10)
2548 if (simplejump_p (this_jump_insn)
2549 || GET_CODE (PATTERN (this_jump_insn)) == RETURN)
2551 next = JUMP_LABEL (this_jump_insn);
2556 *jump_target = JUMP_LABEL (this_jump_insn);
2559 else if (condjump_p (this_jump_insn)
2560 || condjump_in_parallel_p (this_jump_insn))
2562 struct resources target_set, target_res;
2563 struct resources fallthrough_res;
2565 /* We can handle conditional branches here by following
2566 both paths, and then IOR the results of the two paths
2567 together, which will give us registers that are dead
2568 on both paths. Since this is expensive, we give it
2569 a much higher cost than unconditional branches. The
2570 cost was chosen so that we will follow at most 1
2571 conditional branch. */
2574 if (jump_count >= 10)
2577 mark_referenced_resources (insn, &needed, 1);
2579 /* For an annulled branch, mark_set_resources ignores slots
2580 filled by instructions from the target. This is correct
2581 if the branch is not taken. Since we are following both
2582 paths from the branch, we must also compute correct info
2583 if the branch is taken. We do this by inverting all of
2584 the INSN_FROM_TARGET_P bits, calling mark_set_resources,
2585 and then inverting the INSN_FROM_TARGET_P bits again. */
2587 if (GET_CODE (PATTERN (insn)) == SEQUENCE
2588 && INSN_ANNULLED_BRANCH_P (this_jump_insn))
2590 for (i = 1; i < XVECLEN (PATTERN (insn), 0); i++)
2591 INSN_FROM_TARGET_P (XVECEXP (PATTERN (insn), 0, i))
2592 = ! INSN_FROM_TARGET_P (XVECEXP (PATTERN (insn), 0, i));
2595 mark_set_resources (insn, &target_set, 0, 1);
2597 for (i = 1; i < XVECLEN (PATTERN (insn), 0); i++)
2598 INSN_FROM_TARGET_P (XVECEXP (PATTERN (insn), 0, i))
2599 = ! INSN_FROM_TARGET_P (XVECEXP (PATTERN (insn), 0, i));
2601 mark_set_resources (insn, &set, 0, 1);
2605 mark_set_resources (insn, &set, 0, 1);
2610 COPY_HARD_REG_SET (scratch, target_set.regs);
2611 AND_COMPL_HARD_REG_SET (scratch, needed.regs);
2612 AND_COMPL_HARD_REG_SET (target_res.regs, scratch);
2614 fallthrough_res = *res;
2615 COPY_HARD_REG_SET (scratch, set.regs);
2616 AND_COMPL_HARD_REG_SET (scratch, needed.regs);
2617 AND_COMPL_HARD_REG_SET (fallthrough_res.regs, scratch);
2619 find_dead_or_set_registers (JUMP_LABEL (this_jump_insn),
2620 &target_res, 0, jump_count,
2621 target_set, needed);
2622 find_dead_or_set_registers (next,
2623 &fallthrough_res, 0, jump_count,
2625 IOR_HARD_REG_SET (fallthrough_res.regs, target_res.regs);
2626 AND_HARD_REG_SET (res->regs, fallthrough_res.regs);
2634 /* Don't try this optimization if we expired our jump count
2635 above, since that would mean there may be an infinite loop
2636 in the function being compiled. */
2642 mark_referenced_resources (insn, &needed, 1);
2643 mark_set_resources (insn, &set, 0, 1);
2645 COPY_HARD_REG_SET (scratch, set.regs);
2646 AND_COMPL_HARD_REG_SET (scratch, needed.regs);
2647 AND_COMPL_HARD_REG_SET (res->regs, scratch);
2653 /* Set the resources that are live at TARGET.
2655 If TARGET is zero, we refer to the end of the current function and can
2656 return our precomputed value.
2658 Otherwise, we try to find out what is live by consulting the basic block
2659 information. This is tricky, because we must consider the actions of
2660 reload and jump optimization, which occur after the basic block information
2663 Accordingly, we proceed as follows::
2665 We find the previous BARRIER and look at all immediately following labels
2666 (with no intervening active insns) to see if any of them start a basic
2667 block. If we hit the start of the function first, we use block 0.
2669 Once we have found a basic block and a corresponding first insns, we can
2670 accurately compute the live status from basic_block_live_regs and
2671 reg_renumber. (By starting at a label following a BARRIER, we are immune
2672 to actions taken by reload and jump.) Then we scan all insns between
2673 that point and our target. For each CLOBBER (or for call-clobbered regs
2674 when we pass a CALL_INSN), mark the appropriate registers are dead. For
2675 a SET, mark them as live.
2677 We have to be careful when using REG_DEAD notes because they are not
2678 updated by such things as find_equiv_reg. So keep track of registers
2679 marked as dead that haven't been assigned to, and mark them dead at the
2680 next CODE_LABEL since reload and jump won't propagate values across labels.
2682 If we cannot find the start of a basic block (should be a very rare
2683 case, if it can happen at all), mark everything as potentially live.
2685 Next, scan forward from TARGET looking for things set or clobbered
2686 before they are used. These are not live.
2688 Because we can be called many times on the same target, save our results
2689 in a hash table indexed by INSN_UID. */
2692 mark_target_live_regs (target, res)
2694 struct resources *res;
2698 struct target_info *tinfo;
2702 HARD_REG_SET scratch;
2703 struct resources set, needed;
2706 /* Handle end of function. */
2709 *res = end_of_function_needs;
2713 /* We have to assume memory is needed, but the CC isn't. */
2715 res->volatil = res->unch_memory = 0;
2718 /* See if we have computed this value already. */
2719 for (tinfo = target_hash_table[INSN_UID (target) % TARGET_HASH_PRIME];
2720 tinfo; tinfo = tinfo->next)
2721 if (tinfo->uid == INSN_UID (target))
2724 /* Start by getting the basic block number. If we have saved information,
2725 we can get it from there unless the insn at the start of the basic block
2726 has been deleted. */
2727 if (tinfo && tinfo->block != -1
2728 && ! INSN_DELETED_P (basic_block_head[tinfo->block]))
2732 b = find_basic_block (target);
2736 /* If the information is up-to-date, use it. Otherwise, we will
2738 if (b == tinfo->block && b != -1 && tinfo->bb_tick == bb_ticks[b])
2740 COPY_HARD_REG_SET (res->regs, tinfo->live_regs);
2746 /* Allocate a place to put our results and chain it into the
2748 tinfo = (struct target_info *) oballoc (sizeof (struct target_info));
2749 tinfo->uid = INSN_UID (target);
2751 tinfo->next = target_hash_table[INSN_UID (target) % TARGET_HASH_PRIME];
2752 target_hash_table[INSN_UID (target) % TARGET_HASH_PRIME] = tinfo;
2755 CLEAR_HARD_REG_SET (pending_dead_regs);
2757 /* If we found a basic block, get the live registers from it and update
2758 them with anything set or killed between its start and the insn before
2759 TARGET. Otherwise, we must assume everything is live. */
2762 regset regs_live = basic_block_live_at_start[b];
2764 REGSET_ELT_TYPE bit;
2766 rtx start_insn, stop_insn;
2768 /* Compute hard regs live at start of block -- this is the real hard regs
2769 marked live, plus live pseudo regs that have been renumbered to
2772 REG_SET_TO_HARD_REG_SET (current_live_regs, regs_live);
2774 EXECUTE_IF_SET_IN_REG_SET (regs_live, 0, i,
2776 if ((regno = reg_renumber[i]) >= 0)
2778 j < regno + HARD_REGNO_NREGS (regno,
2779 PSEUDO_REGNO_MODE (i));
2781 SET_HARD_REG_BIT (current_live_regs, j);
2784 /* Get starting and ending insn, handling the case where each might
2786 start_insn = (b == 0 ? get_insns () : basic_block_head[b]);
2789 if (GET_CODE (start_insn) == INSN
2790 && GET_CODE (PATTERN (start_insn)) == SEQUENCE)
2791 start_insn = XVECEXP (PATTERN (start_insn), 0, 0);
2793 if (GET_CODE (stop_insn) == INSN
2794 && GET_CODE (PATTERN (stop_insn)) == SEQUENCE)
2795 stop_insn = next_insn (PREV_INSN (stop_insn));
2797 for (insn = start_insn; insn != stop_insn;
2798 insn = next_insn_no_annul (insn))
2801 rtx real_insn = insn;
2803 /* If this insn is from the target of a branch, it isn't going to
2804 be used in the sequel. If it is used in both cases, this
2805 test will not be true. */
2806 if (INSN_FROM_TARGET_P (insn))
2809 /* If this insn is a USE made by update_block, we care about the
2811 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == USE
2812 && GET_RTX_CLASS (GET_CODE (XEXP (PATTERN (insn), 0))) == 'i')
2813 real_insn = XEXP (PATTERN (insn), 0);
2815 if (GET_CODE (real_insn) == CALL_INSN)
2817 /* CALL clobbers all call-used regs that aren't fixed except
2818 sp, ap, and fp. Do this before setting the result of the
2820 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
2821 if (call_used_regs[i]
2822 && i != STACK_POINTER_REGNUM && i != FRAME_POINTER_REGNUM
2823 && i != ARG_POINTER_REGNUM
2824 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
2825 && i != HARD_FRAME_POINTER_REGNUM
2827 #if ARG_POINTER_REGNUM != FRAME_POINTER_REGNUM
2828 && ! (i == ARG_POINTER_REGNUM && fixed_regs[i])
2830 #ifdef PIC_OFFSET_TABLE_REGNUM
2831 && ! (i == PIC_OFFSET_TABLE_REGNUM && flag_pic)
2834 CLEAR_HARD_REG_BIT (current_live_regs, i);
2836 /* A CALL_INSN sets any global register live, since it may
2837 have been modified by the call. */
2838 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
2840 SET_HARD_REG_BIT (current_live_regs, i);
2843 /* Mark anything killed in an insn to be deadened at the next
2844 label. Ignore USE insns; the only REG_DEAD notes will be for
2845 parameters. But they might be early. A CALL_INSN will usually
2846 clobber registers used for parameters. It isn't worth bothering
2847 with the unlikely case when it won't. */
2848 if ((GET_CODE (real_insn) == INSN
2849 && GET_CODE (PATTERN (real_insn)) != USE
2850 && GET_CODE (PATTERN (real_insn)) != CLOBBER)
2851 || GET_CODE (real_insn) == JUMP_INSN
2852 || GET_CODE (real_insn) == CALL_INSN)
2854 for (link = REG_NOTES (real_insn); link; link = XEXP (link, 1))
2855 if (REG_NOTE_KIND (link) == REG_DEAD
2856 && GET_CODE (XEXP (link, 0)) == REG
2857 && REGNO (XEXP (link, 0)) < FIRST_PSEUDO_REGISTER)
2859 int first_regno = REGNO (XEXP (link, 0));
2862 + HARD_REGNO_NREGS (first_regno,
2863 GET_MODE (XEXP (link, 0))));
2865 for (i = first_regno; i < last_regno; i++)
2866 SET_HARD_REG_BIT (pending_dead_regs, i);
2869 note_stores (PATTERN (real_insn), update_live_status);
2871 /* If any registers were unused after this insn, kill them.
2872 These notes will always be accurate. */
2873 for (link = REG_NOTES (real_insn); link; link = XEXP (link, 1))
2874 if (REG_NOTE_KIND (link) == REG_UNUSED
2875 && GET_CODE (XEXP (link, 0)) == REG
2876 && REGNO (XEXP (link, 0)) < FIRST_PSEUDO_REGISTER)
2878 int first_regno = REGNO (XEXP (link, 0));
2881 + HARD_REGNO_NREGS (first_regno,
2882 GET_MODE (XEXP (link, 0))));
2884 for (i = first_regno; i < last_regno; i++)
2885 CLEAR_HARD_REG_BIT (current_live_regs, i);
2889 else if (GET_CODE (real_insn) == CODE_LABEL)
2891 /* A label clobbers the pending dead registers since neither
2892 reload nor jump will propagate a value across a label. */
2893 AND_COMPL_HARD_REG_SET (current_live_regs, pending_dead_regs);
2894 CLEAR_HARD_REG_SET (pending_dead_regs);
2897 /* The beginning of the epilogue corresponds to the end of the
2898 RTL chain when there are no epilogue insns. Certain resources
2899 are implicitly required at that point. */
2900 else if (GET_CODE (real_insn) == NOTE
2901 && NOTE_LINE_NUMBER (real_insn) == NOTE_INSN_EPILOGUE_BEG)
2902 IOR_HARD_REG_SET (current_live_regs, start_of_epilogue_needs.regs);
2905 COPY_HARD_REG_SET (res->regs, current_live_regs);
2907 tinfo->bb_tick = bb_ticks[b];
2910 /* We didn't find the start of a basic block. Assume everything
2911 in use. This should happen only extremely rarely. */
2912 SET_HARD_REG_SET (res->regs);
2914 CLEAR_RESOURCE (&set);
2915 CLEAR_RESOURCE (&needed);
2917 jump_insn = find_dead_or_set_registers (target, res, &jump_target, 0,
2920 /* If we hit an unconditional branch, we have another way of finding out
2921 what is live: we can see what is live at the branch target and include
2922 anything used but not set before the branch. The only things that are
2923 live are those that are live using the above test and the test below. */
2927 struct resources new_resources;
2928 rtx stop_insn = next_active_insn (jump_insn);
2930 mark_target_live_regs (next_active_insn (jump_target), &new_resources);
2931 CLEAR_RESOURCE (&set);
2932 CLEAR_RESOURCE (&needed);
2934 /* Include JUMP_INSN in the needed registers. */
2935 for (insn = target; insn != stop_insn; insn = next_active_insn (insn))
2937 mark_referenced_resources (insn, &needed, 1);
2939 COPY_HARD_REG_SET (scratch, needed.regs);
2940 AND_COMPL_HARD_REG_SET (scratch, set.regs);
2941 IOR_HARD_REG_SET (new_resources.regs, scratch);
2943 mark_set_resources (insn, &set, 0, 1);
2946 AND_HARD_REG_SET (res->regs, new_resources.regs);
2949 COPY_HARD_REG_SET (tinfo->live_regs, res->regs);
2952 /* Scan a function looking for insns that need a delay slot and find insns to
2953 put into the delay slot.
2955 NON_JUMPS_P is non-zero if we are to only try to fill non-jump insns (such
2956 as calls). We do these first since we don't want jump insns (that are
2957 easier to fill) to get the only insns that could be used for non-jump insns.
2958 When it is zero, only try to fill JUMP_INSNs.
2960 When slots are filled in this manner, the insns (including the
2961 delay_insn) are put together in a SEQUENCE rtx. In this fashion,
2962 it is possible to tell whether a delay slot has really been filled
2963 or not. `final' knows how to deal with this, by communicating
2964 through FINAL_SEQUENCE. */
2967 fill_simple_delay_slots (first, non_jumps_p)
2971 register rtx insn, pat, trial, next_trial;
2973 int num_unfilled_slots = unfilled_slots_next - unfilled_slots_base;
2974 struct resources needed, set;
2975 int slots_to_fill, slots_filled;
2978 for (i = 0; i < num_unfilled_slots; i++)
2981 /* Get the next insn to fill. If it has already had any slots assigned,
2982 we can't do anything with it. Maybe we'll improve this later. */
2984 insn = unfilled_slots_base[i];
2986 || INSN_DELETED_P (insn)
2987 || (GET_CODE (insn) == INSN
2988 && GET_CODE (PATTERN (insn)) == SEQUENCE)
2989 || (GET_CODE (insn) == JUMP_INSN && non_jumps_p)
2990 || (GET_CODE (insn) != JUMP_INSN && ! non_jumps_p))
2993 if (GET_CODE (insn) == JUMP_INSN)
2994 flags = get_jump_flags (insn, JUMP_LABEL (insn));
2996 flags = get_jump_flags (insn, NULL_RTX);
2997 slots_to_fill = num_delay_slots (insn);
2998 if (slots_to_fill == 0)
3001 /* This insn needs, or can use, some delay slots. SLOTS_TO_FILL
3002 says how many. After initialization, first try optimizing
3005 nop add %o7,.-L1,%o7
3009 If this case applies, the delay slot of the call is filled with
3010 the unconditional jump. This is done first to avoid having the
3011 delay slot of the call filled in the backward scan. Also, since
3012 the unconditional jump is likely to also have a delay slot, that
3013 insn must exist when it is subsequently scanned.
3015 This is tried on each insn with delay slots as some machines
3016 have insns which perform calls, but are not represented as
3022 if ((trial = next_active_insn (insn))
3023 && GET_CODE (trial) == JUMP_INSN
3024 && simplejump_p (trial)
3025 && eligible_for_delay (insn, slots_filled, trial, flags)
3026 && no_labels_between_p (insn, trial))
3030 delay_list = add_to_delay_list (trial, delay_list);
3032 /* TRIAL may have had its delay slot filled, then unfilled. When
3033 the delay slot is unfilled, TRIAL is placed back on the unfilled
3034 slots obstack. Unfortunately, it is placed on the end of the
3035 obstack, not in its original location. Therefore, we must search
3036 from entry i + 1 to the end of the unfilled slots obstack to
3037 try and find TRIAL. */
3038 tmp = &unfilled_slots_base[i + 1];
3039 while (*tmp != trial && tmp != unfilled_slots_next)
3042 /* Remove the unconditional jump from consideration for delay slot
3043 filling and unthread it. */
3047 rtx next = NEXT_INSN (trial);
3048 rtx prev = PREV_INSN (trial);
3050 NEXT_INSN (prev) = next;
3052 PREV_INSN (next) = prev;
3056 /* Now, scan backwards from the insn to search for a potential
3057 delay-slot candidate. Stop searching when a label or jump is hit.
3059 For each candidate, if it is to go into the delay slot (moved
3060 forward in execution sequence), it must not need or set any resources
3061 that were set by later insns and must not set any resources that
3062 are needed for those insns.
3064 The delay slot insn itself sets resources unless it is a call
3065 (in which case the called routine, not the insn itself, is doing
3068 if (slots_filled < slots_to_fill)
3070 CLEAR_RESOURCE (&needed);
3071 CLEAR_RESOURCE (&set);
3072 mark_set_resources (insn, &set, 0, 0);
3073 mark_referenced_resources (insn, &needed, 0);
3075 for (trial = prev_nonnote_insn (insn); ! stop_search_p (trial, 1);
3078 next_trial = prev_nonnote_insn (trial);
3080 /* This must be an INSN or CALL_INSN. */
3081 pat = PATTERN (trial);
3083 /* USE and CLOBBER at this level was just for flow; ignore it. */
3084 if (GET_CODE (pat) == USE || GET_CODE (pat) == CLOBBER)
3087 /* Check for resource conflict first, to avoid unnecessary
3089 if (! insn_references_resource_p (trial, &set, 1)
3090 && ! insn_sets_resource_p (trial, &set, 1)
3091 && ! insn_sets_resource_p (trial, &needed, 1)
3093 /* Can't separate set of cc0 from its use. */
3094 && ! (reg_mentioned_p (cc0_rtx, pat)
3095 && ! sets_cc0_p (cc0_rtx, pat))
3099 trial = try_split (pat, trial, 1);
3100 next_trial = prev_nonnote_insn (trial);
3101 if (eligible_for_delay (insn, slots_filled, trial, flags))
3103 /* In this case, we are searching backward, so if we
3104 find insns to put on the delay list, we want
3105 to put them at the head, rather than the
3106 tail, of the list. */
3108 update_reg_dead_notes (trial, insn);
3109 delay_list = gen_rtx (INSN_LIST, VOIDmode,
3111 update_block (trial, trial);
3112 delete_insn (trial);
3113 if (slots_to_fill == ++slots_filled)
3119 mark_set_resources (trial, &set, 0, 1);
3120 mark_referenced_resources (trial, &needed, 1);
3124 /* If all needed slots haven't been filled, we come here. */
3126 /* Try to optimize case of jumping around a single insn. */
3127 #if defined(ANNUL_IFFALSE_SLOTS) || defined(ANNUL_IFTRUE_SLOTS)
3128 if (slots_filled != slots_to_fill
3130 && GET_CODE (insn) == JUMP_INSN
3131 && (condjump_p (insn) || condjump_in_parallel_p (insn)))
3133 delay_list = optimize_skip (insn);
3139 /* Try to get insns from beyond the insn needing the delay slot.
3140 These insns can neither set or reference resources set in insns being
3141 skipped, cannot set resources in the insn being skipped, and, if this
3142 is a CALL_INSN (or a CALL_INSN is passed), cannot trap (because the
3143 call might not return).
3145 There used to be code which continued past the target label if
3146 we saw all uses of the target label. This code did not work,
3147 because it failed to account for some instructions which were
3148 both annulled and marked as from the target. This can happen as a
3149 result of optimize_skip. Since this code was redundant with
3150 fill_eager_delay_slots anyways, it was just deleted. */
3152 if (slots_filled != slots_to_fill
3153 && (GET_CODE (insn) != JUMP_INSN
3154 || ((condjump_p (insn) || condjump_in_parallel_p (insn))
3155 && ! simplejump_p (insn)
3156 && JUMP_LABEL (insn) != 0)))
3159 int maybe_never = 0;
3160 struct resources needed_at_jump;
3162 CLEAR_RESOURCE (&needed);
3163 CLEAR_RESOURCE (&set);
3165 if (GET_CODE (insn) == CALL_INSN)
3167 mark_set_resources (insn, &set, 0, 1);
3168 mark_referenced_resources (insn, &needed, 1);
3173 mark_set_resources (insn, &set, 0, 1);
3174 mark_referenced_resources (insn, &needed, 1);
3175 if (GET_CODE (insn) == JUMP_INSN)
3176 target = JUMP_LABEL (insn);
3179 for (trial = next_nonnote_insn (insn); trial; trial = next_trial)
3181 rtx pat, trial_delay;
3183 next_trial = next_nonnote_insn (trial);
3185 if (GET_CODE (trial) == CODE_LABEL
3186 || GET_CODE (trial) == BARRIER)
3189 /* We must have an INSN, JUMP_INSN, or CALL_INSN. */
3190 pat = PATTERN (trial);
3192 /* Stand-alone USE and CLOBBER are just for flow. */
3193 if (GET_CODE (pat) == USE || GET_CODE (pat) == CLOBBER)
3196 /* If this already has filled delay slots, get the insn needing
3198 if (GET_CODE (pat) == SEQUENCE)
3199 trial_delay = XVECEXP (pat, 0, 0);
3201 trial_delay = trial;
3203 /* If this is a jump insn to our target, indicate that we have
3204 seen another jump to it. If we aren't handling a conditional
3205 jump, stop our search. Otherwise, compute the needs at its
3206 target and add them to NEEDED. */
3207 if (GET_CODE (trial_delay) == JUMP_INSN)
3211 else if (JUMP_LABEL (trial_delay) != target)
3213 mark_target_live_regs
3214 (next_active_insn (JUMP_LABEL (trial_delay)),
3216 needed.memory |= needed_at_jump.memory;
3217 needed.unch_memory |= needed_at_jump.unch_memory;
3218 IOR_HARD_REG_SET (needed.regs, needed_at_jump.regs);
3222 /* See if we have a resource problem before we try to
3225 && GET_CODE (pat) != SEQUENCE
3226 && ! insn_references_resource_p (trial, &set, 1)
3227 && ! insn_sets_resource_p (trial, &set, 1)
3228 && ! insn_sets_resource_p (trial, &needed, 1)
3230 && ! (reg_mentioned_p (cc0_rtx, pat) && ! sets_cc0_p (pat))
3232 && ! (maybe_never && may_trap_p (pat))
3233 && (trial = try_split (pat, trial, 0))
3234 && eligible_for_delay (insn, slots_filled, trial, flags))
3236 next_trial = next_nonnote_insn (trial);
3237 delay_list = add_to_delay_list (trial, delay_list);
3240 if (reg_mentioned_p (cc0_rtx, pat))
3241 link_cc0_insns (trial);
3244 delete_insn (trial);
3245 if (slots_to_fill == ++slots_filled)
3250 mark_set_resources (trial, &set, 0, 1);
3251 mark_referenced_resources (trial, &needed, 1);
3253 /* Ensure we don't put insns between the setting of cc and the
3254 comparison by moving a setting of cc into an earlier delay
3255 slot since these insns could clobber the condition code. */
3258 /* If this is a call or jump, we might not get here. */
3259 if (GET_CODE (trial_delay) == CALL_INSN
3260 || GET_CODE (trial_delay) == JUMP_INSN)
3264 /* If there are slots left to fill and our search was stopped by an
3265 unconditional branch, try the insn at the branch target. We can
3266 redirect the branch if it works.
3268 Don't do this if the insn at the branch target is a branch. */
3269 if (slots_to_fill != slots_filled
3271 && GET_CODE (trial) == JUMP_INSN
3272 && simplejump_p (trial)
3273 && (target == 0 || JUMP_LABEL (trial) == target)
3274 && (next_trial = next_active_insn (JUMP_LABEL (trial))) != 0
3275 && ! (GET_CODE (next_trial) == INSN
3276 && GET_CODE (PATTERN (next_trial)) == SEQUENCE)
3277 && GET_CODE (next_trial) != JUMP_INSN
3278 && ! insn_references_resource_p (next_trial, &set, 1)
3279 && ! insn_sets_resource_p (next_trial, &set, 1)
3280 && ! insn_sets_resource_p (next_trial, &needed, 1)
3282 && ! reg_mentioned_p (cc0_rtx, PATTERN (next_trial))
3284 && ! (maybe_never && may_trap_p (PATTERN (next_trial)))
3285 && (next_trial = try_split (PATTERN (next_trial), next_trial, 0))
3286 && eligible_for_delay (insn, slots_filled, next_trial, flags))
3288 rtx new_label = next_active_insn (next_trial);
3291 new_label = get_label_before (new_label);
3293 new_label = find_end_label ();
3296 = add_to_delay_list (copy_rtx (next_trial), delay_list);
3298 reorg_redirect_jump (trial, new_label);
3300 /* If we merged because we both jumped to the same place,
3301 redirect the original insn also. */
3303 reorg_redirect_jump (insn, new_label);
3307 /* If this is an unconditional jump, then try to get insns from the
3308 target of the jump. */
3309 if (GET_CODE (insn) == JUMP_INSN
3310 && simplejump_p (insn)
3311 && slots_filled != slots_to_fill)
3313 = fill_slots_from_thread (insn, const_true_rtx,
3314 next_active_insn (JUMP_LABEL (insn)),
3316 own_thread_p (JUMP_LABEL (insn),
3317 JUMP_LABEL (insn), 0),
3318 0, slots_to_fill, &slots_filled);
3321 unfilled_slots_base[i]
3322 = emit_delay_sequence (insn, delay_list,
3323 slots_filled, slots_to_fill);
3325 if (slots_to_fill == slots_filled)
3326 unfilled_slots_base[i] = 0;
3328 note_delay_statistics (slots_filled, 0);
3331 #ifdef DELAY_SLOTS_FOR_EPILOGUE
3332 /* See if the epilogue needs any delay slots. Try to fill them if so.
3333 The only thing we can do is scan backwards from the end of the
3334 function. If we did this in a previous pass, it is incorrect to do it
3336 if (current_function_epilogue_delay_list)
3339 slots_to_fill = DELAY_SLOTS_FOR_EPILOGUE;
3340 if (slots_to_fill == 0)
3344 CLEAR_RESOURCE (&set);
3346 /* The frame pointer and stack pointer are needed at the beginning of
3347 the epilogue, so instructions setting them can not be put in the
3348 epilogue delay slot. However, everything else needed at function
3349 end is safe, so we don't want to use end_of_function_needs here. */
3350 CLEAR_RESOURCE (&needed);
3351 if (frame_pointer_needed)
3353 SET_HARD_REG_BIT (needed.regs, FRAME_POINTER_REGNUM);
3354 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
3355 SET_HARD_REG_BIT (needed.regs, HARD_FRAME_POINTER_REGNUM);
3357 #ifdef EXIT_IGNORE_STACK
3358 if (! EXIT_IGNORE_STACK)
3360 SET_HARD_REG_BIT (needed.regs, STACK_POINTER_REGNUM);
3363 SET_HARD_REG_BIT (needed.regs, STACK_POINTER_REGNUM);
3365 #ifdef EPILOGUE_USES
3366 for (i = 0; i <FIRST_PSEUDO_REGISTER; i++)
3368 if (EPILOGUE_USES (i))
3369 SET_HARD_REG_BIT (needed.regs, i);
3373 for (trial = get_last_insn (); ! stop_search_p (trial, 1);
3374 trial = PREV_INSN (trial))
3376 if (GET_CODE (trial) == NOTE)
3378 pat = PATTERN (trial);
3379 if (GET_CODE (pat) == USE || GET_CODE (pat) == CLOBBER)
3382 if (! insn_references_resource_p (trial, &set, 1)
3383 && ! insn_sets_resource_p (trial, &needed, 1)
3384 && ! insn_sets_resource_p (trial, &set, 1)
3386 /* Don't want to mess with cc0 here. */
3387 && ! reg_mentioned_p (cc0_rtx, pat)
3391 trial = try_split (pat, trial, 1);
3392 if (ELIGIBLE_FOR_EPILOGUE_DELAY (trial, slots_filled))
3394 /* Here as well we are searching backward, so put the
3395 insns we find on the head of the list. */
3397 current_function_epilogue_delay_list
3398 = gen_rtx (INSN_LIST, VOIDmode, trial,
3399 current_function_epilogue_delay_list);
3400 mark_referenced_resources (trial, &end_of_function_needs, 1);
3401 update_block (trial, trial);
3402 delete_insn (trial);
3404 /* Clear deleted bit so final.c will output the insn. */
3405 INSN_DELETED_P (trial) = 0;
3407 if (slots_to_fill == ++slots_filled)
3413 mark_set_resources (trial, &set, 0, 1);
3414 mark_referenced_resources (trial, &needed, 1);
3417 note_delay_statistics (slots_filled, 0);
3421 /* Try to find insns to place in delay slots.
3423 INSN is the jump needing SLOTS_TO_FILL delay slots. It tests CONDITION
3424 or is an unconditional branch if CONDITION is const_true_rtx.
3425 *PSLOTS_FILLED is updated with the number of slots that we have filled.
3427 THREAD is a flow-of-control, either the insns to be executed if the
3428 branch is true or if the branch is false, THREAD_IF_TRUE says which.
3430 OPPOSITE_THREAD is the thread in the opposite direction. It is used
3431 to see if any potential delay slot insns set things needed there.
3433 LIKELY is non-zero if it is extremely likely that the branch will be
3434 taken and THREAD_IF_TRUE is set. This is used for the branch at the
3435 end of a loop back up to the top.
3437 OWN_THREAD and OWN_OPPOSITE_THREAD are true if we are the only user of the
3438 thread. I.e., it is the fallthrough code of our jump or the target of the
3439 jump when we are the only jump going there.
3441 If OWN_THREAD is false, it must be the "true" thread of a jump. In that
3442 case, we can only take insns from the head of the thread for our delay
3443 slot. We then adjust the jump to point after the insns we have taken. */
3446 fill_slots_from_thread (insn, condition, thread, opposite_thread, likely,
3447 thread_if_true, own_thread, own_opposite_thread,
3448 slots_to_fill, pslots_filled)
3451 rtx thread, opposite_thread;
3454 int own_thread, own_opposite_thread;
3455 int slots_to_fill, *pslots_filled;
3459 struct resources opposite_needed, set, needed;
3465 /* Validate our arguments. */
3466 if ((condition == const_true_rtx && ! thread_if_true)
3467 || (! own_thread && ! thread_if_true))
3470 flags = get_jump_flags (insn, JUMP_LABEL (insn));
3472 /* If our thread is the end of subroutine, we can't get any delay
3477 /* If this is an unconditional branch, nothing is needed at the
3478 opposite thread. Otherwise, compute what is needed there. */
3479 if (condition == const_true_rtx)
3480 CLEAR_RESOURCE (&opposite_needed);
3482 mark_target_live_regs (opposite_thread, &opposite_needed);
3484 /* If the insn at THREAD can be split, do it here to avoid having to
3485 update THREAD and NEW_THREAD if it is done in the loop below. Also
3486 initialize NEW_THREAD. */
3488 new_thread = thread = try_split (PATTERN (thread), thread, 0);
3490 /* Scan insns at THREAD. We are looking for an insn that can be removed
3491 from THREAD (it neither sets nor references resources that were set
3492 ahead of it and it doesn't set anything needs by the insns ahead of
3493 it) and that either can be placed in an annulling insn or aren't
3494 needed at OPPOSITE_THREAD. */
3496 CLEAR_RESOURCE (&needed);
3497 CLEAR_RESOURCE (&set);
3499 /* If we do not own this thread, we must stop as soon as we find
3500 something that we can't put in a delay slot, since all we can do
3501 is branch into THREAD at a later point. Therefore, labels stop
3502 the search if this is not the `true' thread. */
3504 for (trial = thread;
3505 ! stop_search_p (trial, ! thread_if_true) && (! lose || own_thread);
3506 trial = next_nonnote_insn (trial))
3510 /* If we have passed a label, we no longer own this thread. */
3511 if (GET_CODE (trial) == CODE_LABEL)
3517 pat = PATTERN (trial);
3518 if (GET_CODE (pat) == USE || GET_CODE (pat) == CLOBBER)
3521 /* If TRIAL conflicts with the insns ahead of it, we lose. Also,
3522 don't separate or copy insns that set and use CC0. */
3523 if (! insn_references_resource_p (trial, &set, 1)
3524 && ! insn_sets_resource_p (trial, &set, 1)
3525 && ! insn_sets_resource_p (trial, &needed, 1)
3527 && ! (reg_mentioned_p (cc0_rtx, pat)
3528 && (! own_thread || ! sets_cc0_p (pat)))
3534 /* If TRIAL is redundant with some insn before INSN, we don't
3535 actually need to add it to the delay list; we can merely pretend
3537 if (prior_insn = redundant_insn (trial, insn, delay_list))
3539 fix_reg_dead_note (prior_insn, insn);
3542 update_block (trial, thread);
3543 if (trial == thread)
3545 thread = next_active_insn (thread);
3546 if (new_thread == trial)
3547 new_thread = thread;
3550 delete_insn (trial);
3554 update_reg_unused_notes (prior_insn, trial);
3555 new_thread = next_active_insn (trial);
3561 /* There are two ways we can win: If TRIAL doesn't set anything
3562 needed at the opposite thread and can't trap, or if it can
3563 go into an annulled delay slot. */
3564 if (condition == const_true_rtx
3565 || (! insn_sets_resource_p (trial, &opposite_needed, 1)
3566 && ! may_trap_p (pat)))
3569 trial = try_split (pat, trial, 0);
3570 if (new_thread == old_trial)
3572 if (thread == old_trial)
3574 pat = PATTERN (trial);
3575 if (eligible_for_delay (insn, *pslots_filled, trial, flags))
3579 #ifdef ANNUL_IFTRUE_SLOTS
3582 #ifdef ANNUL_IFFALSE_SLOTS
3588 trial = try_split (pat, trial, 0);
3589 if (new_thread == old_trial)
3591 if (thread == old_trial)
3593 pat = PATTERN (trial);
3595 ? eligible_for_annul_false (insn, *pslots_filled, trial, flags)
3596 : eligible_for_annul_true (insn, *pslots_filled, trial, flags)))
3604 if (reg_mentioned_p (cc0_rtx, pat))
3605 link_cc0_insns (trial);
3608 /* If we own this thread, delete the insn. If this is the
3609 destination of a branch, show that a basic block status
3610 may have been updated. In any case, mark the new
3611 starting point of this thread. */
3614 update_block (trial, thread);
3615 if (trial == thread)
3617 thread = next_active_insn (thread);
3618 if (new_thread == trial)
3619 new_thread = thread;
3621 delete_insn (trial);
3624 new_thread = next_active_insn (trial);
3626 temp = own_thread ? trial : copy_rtx (trial);
3628 INSN_FROM_TARGET_P (temp) = 1;
3630 delay_list = add_to_delay_list (temp, delay_list);
3632 if (slots_to_fill == ++(*pslots_filled))
3634 /* Even though we have filled all the slots, we
3635 may be branching to a location that has a
3636 redundant insn. Skip any if so. */
3637 while (new_thread && ! own_thread
3638 && ! insn_sets_resource_p (new_thread, &set, 1)
3639 && ! insn_sets_resource_p (new_thread, &needed, 1)
3640 && ! insn_references_resource_p (new_thread,
3642 && redundant_insn (new_thread, insn, delay_list))
3643 new_thread = next_active_insn (new_thread);
3652 /* This insn can't go into a delay slot. */
3654 mark_set_resources (trial, &set, 0, 1);
3655 mark_referenced_resources (trial, &needed, 1);
3657 /* Ensure we don't put insns between the setting of cc and the comparison
3658 by moving a setting of cc into an earlier delay slot since these insns
3659 could clobber the condition code. */
3662 /* If this insn is a register-register copy and the next insn has
3663 a use of our destination, change it to use our source. That way,
3664 it will become a candidate for our delay slot the next time
3665 through this loop. This case occurs commonly in loops that
3668 We could check for more complex cases than those tested below,
3669 but it doesn't seem worth it. It might also be a good idea to try
3670 to swap the two insns. That might do better.
3672 We can't do this if the next insn modifies our destination, because
3673 that would make the replacement into the insn invalid. We also can't
3674 do this if it modifies our source, because it might be an earlyclobber
3675 operand. This latter test also prevents updating the contents of
3678 if (GET_CODE (trial) == INSN && GET_CODE (pat) == SET
3679 && GET_CODE (SET_SRC (pat)) == REG
3680 && GET_CODE (SET_DEST (pat)) == REG)
3682 rtx next = next_nonnote_insn (trial);
3684 if (next && GET_CODE (next) == INSN
3685 && GET_CODE (PATTERN (next)) != USE
3686 && ! reg_set_p (SET_DEST (pat), next)
3687 && ! reg_set_p (SET_SRC (pat), next)
3688 && reg_referenced_p (SET_DEST (pat), PATTERN (next)))
3689 validate_replace_rtx (SET_DEST (pat), SET_SRC (pat), next);
3693 /* If we stopped on a branch insn that has delay slots, see if we can
3694 steal some of the insns in those slots. */
3695 if (trial && GET_CODE (trial) == INSN
3696 && GET_CODE (PATTERN (trial)) == SEQUENCE
3697 && GET_CODE (XVECEXP (PATTERN (trial), 0, 0)) == JUMP_INSN)
3699 /* If this is the `true' thread, we will want to follow the jump,
3700 so we can only do this if we have taken everything up to here. */
3701 if (thread_if_true && trial == new_thread)
3703 = steal_delay_list_from_target (insn, condition, PATTERN (trial),
3704 delay_list, &set, &needed,
3705 &opposite_needed, slots_to_fill,
3706 pslots_filled, &must_annul,
3708 else if (! thread_if_true)
3710 = steal_delay_list_from_fallthrough (insn, condition,
3712 delay_list, &set, &needed,
3713 &opposite_needed, slots_to_fill,
3714 pslots_filled, &must_annul);
3717 /* If we haven't found anything for this delay slot and it is very
3718 likely that the branch will be taken, see if the insn at our target
3719 increments or decrements a register with an increment that does not
3720 depend on the destination register. If so, try to place the opposite
3721 arithmetic insn after the jump insn and put the arithmetic insn in the
3722 delay slot. If we can't do this, return. */
3723 if (delay_list == 0 && likely && new_thread
3724 && GET_CODE (new_thread) == INSN
3725 && GET_CODE (PATTERN (new_thread)) != ASM_INPUT
3726 && asm_noperands (PATTERN (new_thread)) < 0)
3728 rtx pat = PATTERN (new_thread);
3733 pat = PATTERN (trial);
3735 if (GET_CODE (trial) != INSN || GET_CODE (pat) != SET
3736 || ! eligible_for_delay (insn, 0, trial, flags))
3739 dest = SET_DEST (pat), src = SET_SRC (pat);
3740 if ((GET_CODE (src) == PLUS || GET_CODE (src) == MINUS)
3741 && rtx_equal_p (XEXP (src, 0), dest)
3742 && ! reg_overlap_mentioned_p (dest, XEXP (src, 1)))
3744 rtx other = XEXP (src, 1);
3748 /* If this is a constant adjustment, use the same code with
3749 the negated constant. Otherwise, reverse the sense of the
3751 if (GET_CODE (other) == CONST_INT)
3752 new_arith = gen_rtx (GET_CODE (src), GET_MODE (src), dest,
3753 negate_rtx (GET_MODE (src), other));
3755 new_arith = gen_rtx (GET_CODE (src) == PLUS ? MINUS : PLUS,
3756 GET_MODE (src), dest, other);
3758 ninsn = emit_insn_after (gen_rtx (SET, VOIDmode, dest, new_arith),
3761 if (recog_memoized (ninsn) < 0
3762 || (insn_extract (ninsn),
3763 ! constrain_operands (INSN_CODE (ninsn), 1)))
3765 delete_insn (ninsn);
3771 update_block (trial, thread);
3772 if (trial == thread)
3774 thread = next_active_insn (thread);
3775 if (new_thread == trial)
3776 new_thread = thread;
3778 delete_insn (trial);
3781 new_thread = next_active_insn (trial);
3783 ninsn = own_thread ? trial : copy_rtx (trial);
3785 INSN_FROM_TARGET_P (ninsn) = 1;
3787 delay_list = add_to_delay_list (ninsn, NULL_RTX);
3792 if (delay_list && must_annul)
3793 INSN_ANNULLED_BRANCH_P (insn) = 1;
3795 /* If we are to branch into the middle of this thread, find an appropriate
3796 label or make a new one if none, and redirect INSN to it. If we hit the
3797 end of the function, use the end-of-function label. */
3798 if (new_thread != thread)
3802 if (! thread_if_true)
3805 if (new_thread && GET_CODE (new_thread) == JUMP_INSN
3806 && (simplejump_p (new_thread)
3807 || GET_CODE (PATTERN (new_thread)) == RETURN)
3808 && redirect_with_delay_list_safe_p (insn,
3809 JUMP_LABEL (new_thread),
3811 new_thread = follow_jumps (JUMP_LABEL (new_thread));
3813 if (new_thread == 0)
3814 label = find_end_label ();
3815 else if (GET_CODE (new_thread) == CODE_LABEL)
3818 label = get_label_before (new_thread);
3820 reorg_redirect_jump (insn, label);
3826 /* Make another attempt to find insns to place in delay slots.
3828 We previously looked for insns located in front of the delay insn
3829 and, for non-jump delay insns, located behind the delay insn.
3831 Here only try to schedule jump insns and try to move insns from either
3832 the target or the following insns into the delay slot. If annulling is
3833 supported, we will be likely to do this. Otherwise, we can do this only
3837 fill_eager_delay_slots (first)
3842 int num_unfilled_slots = unfilled_slots_next - unfilled_slots_base;
3844 for (i = 0; i < num_unfilled_slots; i++)
3847 rtx target_label, insn_at_target, fallthrough_insn;
3850 int own_fallthrough;
3851 int prediction, slots_to_fill, slots_filled;
3853 insn = unfilled_slots_base[i];
3855 || INSN_DELETED_P (insn)
3856 || GET_CODE (insn) != JUMP_INSN
3857 || ! (condjump_p (insn) || condjump_in_parallel_p (insn)))
3860 slots_to_fill = num_delay_slots (insn);
3861 if (slots_to_fill == 0)
3865 target_label = JUMP_LABEL (insn);
3866 condition = get_branch_condition (insn, target_label);
3871 /* Get the next active fallthrough and target insns and see if we own
3872 them. Then see whether the branch is likely true. We don't need
3873 to do a lot of this for unconditional branches. */
3875 insn_at_target = next_active_insn (target_label);
3876 own_target = own_thread_p (target_label, target_label, 0);
3878 if (condition == const_true_rtx)
3880 own_fallthrough = 0;
3881 fallthrough_insn = 0;
3886 fallthrough_insn = next_active_insn (insn);
3887 own_fallthrough = own_thread_p (NEXT_INSN (insn), NULL_RTX, 1);
3888 prediction = mostly_true_jump (insn, condition);
3891 /* If this insn is expected to branch, first try to get insns from our
3892 target, then our fallthrough insns. If it is not, expected to branch,
3893 try the other order. */
3898 = fill_slots_from_thread (insn, condition, insn_at_target,
3899 fallthrough_insn, prediction == 2, 1,
3900 own_target, own_fallthrough,
3901 slots_to_fill, &slots_filled);
3903 if (delay_list == 0 && own_fallthrough)
3905 /* Even though we didn't find anything for delay slots,
3906 we might have found a redundant insn which we deleted
3907 from the thread that was filled. So we have to recompute
3908 the next insn at the target. */
3909 target_label = JUMP_LABEL (insn);
3910 insn_at_target = next_active_insn (target_label);
3913 = fill_slots_from_thread (insn, condition, fallthrough_insn,
3914 insn_at_target, 0, 0,
3915 own_fallthrough, own_target,
3916 slots_to_fill, &slots_filled);
3921 if (own_fallthrough)
3923 = fill_slots_from_thread (insn, condition, fallthrough_insn,
3924 insn_at_target, 0, 0,
3925 own_fallthrough, own_target,
3926 slots_to_fill, &slots_filled);
3928 if (delay_list == 0)
3930 = fill_slots_from_thread (insn, condition, insn_at_target,
3931 next_active_insn (insn), 0, 1,
3932 own_target, own_fallthrough,
3933 slots_to_fill, &slots_filled);
3937 unfilled_slots_base[i]
3938 = emit_delay_sequence (insn, delay_list,
3939 slots_filled, slots_to_fill);
3941 if (slots_to_fill == slots_filled)
3942 unfilled_slots_base[i] = 0;
3944 note_delay_statistics (slots_filled, 1);
3948 /* Once we have tried two ways to fill a delay slot, make a pass over the
3949 code to try to improve the results and to do such things as more jump
3953 relax_delay_slots (first)
3956 register rtx insn, next, pat;
3957 register rtx trial, delay_insn, target_label;
3959 /* Look at every JUMP_INSN and see if we can improve it. */
3960 for (insn = first; insn; insn = next)
3964 next = next_active_insn (insn);
3966 /* If this is a jump insn, see if it now jumps to a jump, jumps to
3967 the next insn, or jumps to a label that is not the last of a
3968 group of consecutive labels. */
3969 if (GET_CODE (insn) == JUMP_INSN
3970 && (condjump_p (insn) || condjump_in_parallel_p (insn))
3971 && (target_label = JUMP_LABEL (insn)) != 0)
3973 target_label = follow_jumps (target_label);
3974 target_label = prev_label (next_active_insn (target_label));
3976 if (target_label == 0)
3977 target_label = find_end_label ();
3979 if (next_active_insn (target_label) == next
3980 && ! condjump_in_parallel_p (insn))
3986 if (target_label != JUMP_LABEL (insn))
3987 reorg_redirect_jump (insn, target_label);
3989 /* See if this jump branches around a unconditional jump.
3990 If so, invert this jump and point it to the target of the
3992 if (next && GET_CODE (next) == JUMP_INSN
3993 && (simplejump_p (next) || GET_CODE (PATTERN (next)) == RETURN)
3994 && next_active_insn (target_label) == next_active_insn (next)
3995 && no_labels_between_p (insn, next))
3997 rtx label = JUMP_LABEL (next);
3999 /* Be careful how we do this to avoid deleting code or
4000 labels that are momentarily dead. See similar optimization
4003 We also need to ensure we properly handle the case when
4004 invert_jump fails. */
4006 ++LABEL_NUSES (target_label);
4008 ++LABEL_NUSES (label);
4010 if (invert_jump (insn, label))
4017 --LABEL_NUSES (label);
4019 if (--LABEL_NUSES (target_label) == 0)
4020 delete_insn (target_label);
4026 /* If this is an unconditional jump and the previous insn is a
4027 conditional jump, try reversing the condition of the previous
4028 insn and swapping our targets. The next pass might be able to
4031 Don't do this if we expect the conditional branch to be true, because
4032 we would then be making the more common case longer. */
4034 if (GET_CODE (insn) == JUMP_INSN
4035 && (simplejump_p (insn) || GET_CODE (PATTERN (insn)) == RETURN)
4036 && (other = prev_active_insn (insn)) != 0
4037 && (condjump_p (other) || condjump_in_parallel_p (other))
4038 && no_labels_between_p (other, insn)
4039 && 0 < mostly_true_jump (other,
4040 get_branch_condition (other,
4041 JUMP_LABEL (other))))
4043 rtx other_target = JUMP_LABEL (other);
4044 target_label = JUMP_LABEL (insn);
4046 /* Increment the count of OTHER_TARGET, so it doesn't get deleted
4047 as we move the label. */
4049 ++LABEL_NUSES (other_target);
4051 if (invert_jump (other, target_label))
4052 reorg_redirect_jump (insn, other_target);
4055 --LABEL_NUSES (other_target);
4058 /* Now look only at cases where we have filled a delay slot. */
4059 if (GET_CODE (insn) != INSN
4060 || GET_CODE (PATTERN (insn)) != SEQUENCE)
4063 pat = PATTERN (insn);
4064 delay_insn = XVECEXP (pat, 0, 0);
4066 /* See if the first insn in the delay slot is redundant with some
4067 previous insn. Remove it from the delay slot if so; then set up
4068 to reprocess this insn. */
4069 if (redundant_insn (XVECEXP (pat, 0, 1), delay_insn, 0))
4071 delete_from_delay_slot (XVECEXP (pat, 0, 1));
4072 next = prev_active_insn (next);
4076 /* Now look only at the cases where we have a filled JUMP_INSN. */
4077 if (GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) != JUMP_INSN
4078 || ! (condjump_p (XVECEXP (PATTERN (insn), 0, 0))
4079 || condjump_in_parallel_p (XVECEXP (PATTERN (insn), 0, 0))))
4082 target_label = JUMP_LABEL (delay_insn);
4086 /* If this jump goes to another unconditional jump, thread it, but
4087 don't convert a jump into a RETURN here. */
4088 trial = follow_jumps (target_label);
4089 /* We use next_real_insn instead of next_active_insn, so that
4090 the special USE insns emitted by reorg won't be ignored.
4091 If they are ignored, then they will get deleted if target_label
4092 is now unreachable, and that would cause mark_target_live_regs
4094 trial = prev_label (next_real_insn (trial));
4095 if (trial == 0 && target_label != 0)
4096 trial = find_end_label ();
4098 if (trial != target_label
4099 && redirect_with_delay_slots_safe_p (delay_insn, trial, insn))
4101 reorg_redirect_jump (delay_insn, trial);
4102 target_label = trial;
4105 /* If the first insn at TARGET_LABEL is redundant with a previous
4106 insn, redirect the jump to the following insn process again. */
4107 trial = next_active_insn (target_label);
4108 if (trial && GET_CODE (PATTERN (trial)) != SEQUENCE
4109 && redundant_insn (trial, insn, 0))
4113 /* Figure out where to emit the special USE insn so we don't
4114 later incorrectly compute register live/death info. */
4115 tmp = next_active_insn (trial);
4117 tmp = find_end_label ();
4119 /* Insert the special USE insn and update dataflow info. */
4120 update_block (trial, tmp);
4122 /* Now emit a label before the special USE insn, and
4123 redirect our jump to the new label. */
4124 target_label = get_label_before (PREV_INSN (tmp));
4125 reorg_redirect_jump (delay_insn, target_label);
4130 /* Similarly, if it is an unconditional jump with one insn in its
4131 delay list and that insn is redundant, thread the jump. */
4132 if (trial && GET_CODE (PATTERN (trial)) == SEQUENCE
4133 && XVECLEN (PATTERN (trial), 0) == 2
4134 && GET_CODE (XVECEXP (PATTERN (trial), 0, 0)) == JUMP_INSN
4135 && (simplejump_p (XVECEXP (PATTERN (trial), 0, 0))
4136 || GET_CODE (PATTERN (XVECEXP (PATTERN (trial), 0, 0))) == RETURN)
4137 && redundant_insn (XVECEXP (PATTERN (trial), 0, 1), insn, 0))
4139 target_label = JUMP_LABEL (XVECEXP (PATTERN (trial), 0, 0));
4140 if (target_label == 0)
4141 target_label = find_end_label ();
4143 if (redirect_with_delay_slots_safe_p (delay_insn, target_label,
4146 reorg_redirect_jump (delay_insn, target_label);
4153 if (! INSN_ANNULLED_BRANCH_P (delay_insn)
4154 && prev_active_insn (target_label) == insn
4155 && ! condjump_in_parallel_p (delay_insn)
4157 /* If the last insn in the delay slot sets CC0 for some insn,
4158 various code assumes that it is in a delay slot. We could
4159 put it back where it belonged and delete the register notes,
4160 but it doesn't seem worthwhile in this uncommon case. */
4161 && ! find_reg_note (XVECEXP (pat, 0, XVECLEN (pat, 0) - 1),
4162 REG_CC_USER, NULL_RTX)
4168 /* All this insn does is execute its delay list and jump to the
4169 following insn. So delete the jump and just execute the delay
4172 We do this by deleting the INSN containing the SEQUENCE, then
4173 re-emitting the insns separately, and then deleting the jump.
4174 This allows the count of the jump target to be properly
4177 /* Clear the from target bit, since these insns are no longer
4179 for (i = 0; i < XVECLEN (pat, 0); i++)
4180 INSN_FROM_TARGET_P (XVECEXP (pat, 0, i)) = 0;
4182 trial = PREV_INSN (insn);
4184 emit_insn_after (pat, trial);
4185 delete_scheduled_jump (delay_insn);
4189 /* See if this is an unconditional jump around a single insn which is
4190 identical to the one in its delay slot. In this case, we can just
4191 delete the branch and the insn in its delay slot. */
4192 if (next && GET_CODE (next) == INSN
4193 && prev_label (next_active_insn (next)) == target_label
4194 && simplejump_p (insn)
4195 && XVECLEN (pat, 0) == 2
4196 && rtx_equal_p (PATTERN (next), PATTERN (XVECEXP (pat, 0, 1))))
4202 /* See if this jump (with its delay slots) branches around another
4203 jump (without delay slots). If so, invert this jump and point
4204 it to the target of the second jump. We cannot do this for
4205 annulled jumps, though. Again, don't convert a jump to a RETURN
4207 if (! INSN_ANNULLED_BRANCH_P (delay_insn)
4208 && next && GET_CODE (next) == JUMP_INSN
4209 && (simplejump_p (next) || GET_CODE (PATTERN (next)) == RETURN)
4210 && next_active_insn (target_label) == next_active_insn (next)
4211 && no_labels_between_p (insn, next))
4213 rtx label = JUMP_LABEL (next);
4214 rtx old_label = JUMP_LABEL (delay_insn);
4217 label = find_end_label ();
4219 if (redirect_with_delay_slots_safe_p (delay_insn, label, insn))
4221 /* Be careful how we do this to avoid deleting code or labels
4222 that are momentarily dead. See similar optimization in
4225 ++LABEL_NUSES (old_label);
4227 if (invert_jump (delay_insn, label))
4231 /* Must update the INSN_FROM_TARGET_P bits now that
4232 the branch is reversed, so that mark_target_live_regs
4233 will handle the delay slot insn correctly. */
4234 for (i = 1; i < XVECLEN (PATTERN (insn), 0); i++)
4236 rtx slot = XVECEXP (PATTERN (insn), 0, i);
4237 INSN_FROM_TARGET_P (slot) = ! INSN_FROM_TARGET_P (slot);
4244 if (old_label && --LABEL_NUSES (old_label) == 0)
4245 delete_insn (old_label);
4250 /* If we own the thread opposite the way this insn branches, see if we
4251 can merge its delay slots with following insns. */
4252 if (INSN_FROM_TARGET_P (XVECEXP (pat, 0, 1))
4253 && own_thread_p (NEXT_INSN (insn), 0, 1))
4254 try_merge_delay_insns (insn, next);
4255 else if (! INSN_FROM_TARGET_P (XVECEXP (pat, 0, 1))
4256 && own_thread_p (target_label, target_label, 0))
4257 try_merge_delay_insns (insn, next_active_insn (target_label));
4259 /* If we get here, we haven't deleted INSN. But we may have deleted
4260 NEXT, so recompute it. */
4261 next = next_active_insn (insn);
4267 /* Look for filled jumps to the end of function label. We can try to convert
4268 them into RETURN insns if the insns in the delay slot are valid for the
4272 make_return_insns (first)
4275 rtx insn, jump_insn, pat;
4276 rtx real_return_label = end_of_function_label;
4279 /* See if there is a RETURN insn in the function other than the one we
4280 made for END_OF_FUNCTION_LABEL. If so, set up anything we can't change
4281 into a RETURN to jump to it. */
4282 for (insn = first; insn; insn = NEXT_INSN (insn))
4283 if (GET_CODE (insn) == JUMP_INSN && GET_CODE (PATTERN (insn)) == RETURN)
4285 real_return_label = get_label_before (insn);
4289 /* Show an extra usage of REAL_RETURN_LABEL so it won't go away if it
4290 was equal to END_OF_FUNCTION_LABEL. */
4291 LABEL_NUSES (real_return_label)++;
4293 /* Clear the list of insns to fill so we can use it. */
4294 obstack_free (&unfilled_slots_obstack, unfilled_firstobj);
4296 for (insn = first; insn; insn = NEXT_INSN (insn))
4300 /* Only look at filled JUMP_INSNs that go to the end of function
4302 if (GET_CODE (insn) != INSN
4303 || GET_CODE (PATTERN (insn)) != SEQUENCE
4304 || GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) != JUMP_INSN
4305 || JUMP_LABEL (XVECEXP (PATTERN (insn), 0, 0)) != end_of_function_label)
4308 pat = PATTERN (insn);
4309 jump_insn = XVECEXP (pat, 0, 0);
4311 /* If we can't make the jump into a RETURN, try to redirect it to the best
4312 RETURN and go on to the next insn. */
4313 if (! reorg_redirect_jump (jump_insn, NULL_RTX))
4315 /* Make sure redirecting the jump will not invalidate the delay
4317 if (redirect_with_delay_slots_safe_p (jump_insn,
4320 reorg_redirect_jump (jump_insn, real_return_label);
4324 /* See if this RETURN can accept the insns current in its delay slot.
4325 It can if it has more or an equal number of slots and the contents
4326 of each is valid. */
4328 flags = get_jump_flags (jump_insn, JUMP_LABEL (jump_insn));
4329 slots = num_delay_slots (jump_insn);
4330 if (slots >= XVECLEN (pat, 0) - 1)
4332 for (i = 1; i < XVECLEN (pat, 0); i++)
4334 #ifdef ANNUL_IFFALSE_SLOTS
4335 (INSN_ANNULLED_BRANCH_P (jump_insn)
4336 && INSN_FROM_TARGET_P (XVECEXP (pat, 0, i)))
4337 ? eligible_for_annul_false (jump_insn, i - 1,
4338 XVECEXP (pat, 0, i), flags) :
4340 #ifdef ANNUL_IFTRUE_SLOTS
4341 (INSN_ANNULLED_BRANCH_P (jump_insn)
4342 && ! INSN_FROM_TARGET_P (XVECEXP (pat, 0, i)))
4343 ? eligible_for_annul_true (jump_insn, i - 1,
4344 XVECEXP (pat, 0, i), flags) :
4346 eligible_for_delay (jump_insn, i -1, XVECEXP (pat, 0, i), flags)))
4352 if (i == XVECLEN (pat, 0))
4355 /* We have to do something with this insn. If it is an unconditional
4356 RETURN, delete the SEQUENCE and output the individual insns,
4357 followed by the RETURN. Then set things up so we try to find
4358 insns for its delay slots, if it needs some. */
4359 if (GET_CODE (PATTERN (jump_insn)) == RETURN)
4361 rtx prev = PREV_INSN (insn);
4364 for (i = 1; i < XVECLEN (pat, 0); i++)
4365 prev = emit_insn_after (PATTERN (XVECEXP (pat, 0, i)), prev);
4367 insn = emit_jump_insn_after (PATTERN (jump_insn), prev);
4368 emit_barrier_after (insn);
4371 obstack_ptr_grow (&unfilled_slots_obstack, insn);
4374 /* It is probably more efficient to keep this with its current
4375 delay slot as a branch to a RETURN. */
4376 reorg_redirect_jump (jump_insn, real_return_label);
4379 /* Now delete REAL_RETURN_LABEL if we never used it. Then try to fill any
4380 new delay slots we have created. */
4381 if (--LABEL_NUSES (real_return_label) == 0)
4382 delete_insn (real_return_label);
4384 fill_simple_delay_slots (first, 1);
4385 fill_simple_delay_slots (first, 0);
4389 /* Try to find insns to place in delay slots. */
4392 dbr_schedule (first, file)
4396 rtx insn, next, epilogue_insn = 0;
4399 int old_flag_no_peephole = flag_no_peephole;
4401 /* Execute `final' once in prescan mode to delete any insns that won't be
4402 used. Don't let final try to do any peephole optimization--it will
4403 ruin dataflow information for this pass. */
4405 flag_no_peephole = 1;
4406 final (first, 0, NO_DEBUG, 1, 1);
4407 flag_no_peephole = old_flag_no_peephole;
4410 /* If the current function has no insns other than the prologue and
4411 epilogue, then do not try to fill any delay slots. */
4412 if (n_basic_blocks == 0)
4415 /* Find the highest INSN_UID and allocate and initialize our map from
4416 INSN_UID's to position in code. */
4417 for (max_uid = 0, insn = first; insn; insn = NEXT_INSN (insn))
4419 if (INSN_UID (insn) > max_uid)
4420 max_uid = INSN_UID (insn);
4421 if (GET_CODE (insn) == NOTE
4422 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
4423 epilogue_insn = insn;
4426 uid_to_ruid = (int *) alloca ((max_uid + 1) * sizeof (int *));
4427 for (i = 0, insn = first; insn; i++, insn = NEXT_INSN (insn))
4428 uid_to_ruid[INSN_UID (insn)] = i;
4430 /* Initialize the list of insns that need filling. */
4431 if (unfilled_firstobj == 0)
4433 gcc_obstack_init (&unfilled_slots_obstack);
4434 unfilled_firstobj = (rtx *) obstack_alloc (&unfilled_slots_obstack, 0);
4437 for (insn = next_active_insn (first); insn; insn = next_active_insn (insn))
4441 INSN_ANNULLED_BRANCH_P (insn) = 0;
4442 INSN_FROM_TARGET_P (insn) = 0;
4444 /* Skip vector tables. We can't get attributes for them. */
4445 if (GET_CODE (insn) == JUMP_INSN
4446 && (GET_CODE (PATTERN (insn)) == ADDR_VEC
4447 || GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC))
4450 if (num_delay_slots (insn) > 0)
4451 obstack_ptr_grow (&unfilled_slots_obstack, insn);
4453 /* Ensure all jumps go to the last of a set of consecutive labels. */
4454 if (GET_CODE (insn) == JUMP_INSN
4455 && (condjump_p (insn) || condjump_in_parallel_p (insn))
4456 && JUMP_LABEL (insn) != 0
4457 && ((target = prev_label (next_active_insn (JUMP_LABEL (insn))))
4458 != JUMP_LABEL (insn)))
4459 redirect_jump (insn, target);
4462 /* Indicate what resources are required to be valid at the end of the current
4463 function. The condition code never is and memory always is. If the
4464 frame pointer is needed, it is and so is the stack pointer unless
4465 EXIT_IGNORE_STACK is non-zero. If the frame pointer is not needed, the
4466 stack pointer is. Registers used to return the function value are
4467 needed. Registers holding global variables are needed. */
4469 end_of_function_needs.cc = 0;
4470 end_of_function_needs.memory = 1;
4471 end_of_function_needs.unch_memory = 0;
4472 CLEAR_HARD_REG_SET (end_of_function_needs.regs);
4474 if (frame_pointer_needed)
4476 SET_HARD_REG_BIT (end_of_function_needs.regs, FRAME_POINTER_REGNUM);
4477 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
4478 SET_HARD_REG_BIT (end_of_function_needs.regs, HARD_FRAME_POINTER_REGNUM);
4480 #ifdef EXIT_IGNORE_STACK
4481 if (! EXIT_IGNORE_STACK)
4483 SET_HARD_REG_BIT (end_of_function_needs.regs, STACK_POINTER_REGNUM);
4486 SET_HARD_REG_BIT (end_of_function_needs.regs, STACK_POINTER_REGNUM);
4488 if (current_function_return_rtx != 0
4489 && GET_CODE (current_function_return_rtx) == REG)
4490 mark_referenced_resources (current_function_return_rtx,
4491 &end_of_function_needs, 1);
4493 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4495 #ifdef EPILOGUE_USES
4496 || EPILOGUE_USES (i)
4499 SET_HARD_REG_BIT (end_of_function_needs.regs, i);
4501 /* The registers required to be live at the end of the function are
4502 represented in the flow information as being dead just prior to
4503 reaching the end of the function. For example, the return of a value
4504 might be represented by a USE of the return register immediately
4505 followed by an unconditional jump to the return label where the
4506 return label is the end of the RTL chain. The end of the RTL chain
4507 is then taken to mean that the return register is live.
4509 This sequence is no longer maintained when epilogue instructions are
4510 added to the RTL chain. To reconstruct the original meaning, the
4511 start of the epilogue (NOTE_INSN_EPILOGUE_BEG) is regarded as the
4512 point where these registers become live (start_of_epilogue_needs).
4513 If epilogue instructions are present, the registers set by those
4514 instructions won't have been processed by flow. Thus, those
4515 registers are additionally required at the end of the RTL chain
4516 (end_of_function_needs). */
4518 start_of_epilogue_needs = end_of_function_needs;
4520 while (epilogue_insn = next_nonnote_insn (epilogue_insn))
4521 mark_set_resources (epilogue_insn, &end_of_function_needs, 0, 1);
4523 /* Show we haven't computed an end-of-function label yet. */
4524 end_of_function_label = 0;
4526 /* Allocate and initialize the tables used by mark_target_live_regs. */
4528 = (struct target_info **) alloca ((TARGET_HASH_PRIME
4529 * sizeof (struct target_info *)));
4530 bzero ((char *) target_hash_table,
4531 TARGET_HASH_PRIME * sizeof (struct target_info *));
4533 bb_ticks = (int *) alloca (n_basic_blocks * sizeof (int));
4534 bzero ((char *) bb_ticks, n_basic_blocks * sizeof (int));
4536 /* Initialize the statistics for this function. */
4537 bzero ((char *) num_insns_needing_delays, sizeof num_insns_needing_delays);
4538 bzero ((char *) num_filled_delays, sizeof num_filled_delays);
4540 /* Now do the delay slot filling. Try everything twice in case earlier
4541 changes make more slots fillable. */
4543 for (reorg_pass_number = 0;
4544 reorg_pass_number < MAX_REORG_PASSES;
4545 reorg_pass_number++)
4547 fill_simple_delay_slots (first, 1);
4548 fill_simple_delay_slots (first, 0);
4549 fill_eager_delay_slots (first);
4550 relax_delay_slots (first);
4553 /* Delete any USE insns made by update_block; subsequent passes don't need
4554 them or know how to deal with them. */
4555 for (insn = first; insn; insn = next)
4557 next = NEXT_INSN (insn);
4559 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == USE
4560 && GET_RTX_CLASS (GET_CODE (XEXP (PATTERN (insn), 0))) == 'i')
4561 next = delete_insn (insn);
4564 /* If we made an end of function label, indicate that it is now
4565 safe to delete it by undoing our prior adjustment to LABEL_NUSES.
4566 If it is now unused, delete it. */
4567 if (end_of_function_label && --LABEL_NUSES (end_of_function_label) == 0)
4568 delete_insn (end_of_function_label);
4571 if (HAVE_return && end_of_function_label != 0)
4572 make_return_insns (first);
4575 obstack_free (&unfilled_slots_obstack, unfilled_firstobj);
4577 /* It is not clear why the line below is needed, but it does seem to be. */
4578 unfilled_firstobj = (rtx *) obstack_alloc (&unfilled_slots_obstack, 0);
4580 /* Reposition the prologue and epilogue notes in case we moved the
4581 prologue/epilogue insns. */
4582 reposition_prologue_and_epilogue_notes (first);
4586 register int i, j, need_comma;
4588 for (reorg_pass_number = 0;
4589 reorg_pass_number < MAX_REORG_PASSES;
4590 reorg_pass_number++)
4592 fprintf (file, ";; Reorg pass #%d:\n", reorg_pass_number + 1);
4593 for (i = 0; i < NUM_REORG_FUNCTIONS; i++)
4596 fprintf (file, ";; Reorg function #%d\n", i);
4598 fprintf (file, ";; %d insns needing delay slots\n;; ",
4599 num_insns_needing_delays[i][reorg_pass_number]);
4601 for (j = 0; j < MAX_DELAY_HISTOGRAM; j++)
4602 if (num_filled_delays[i][j][reorg_pass_number])
4605 fprintf (file, ", ");
4607 fprintf (file, "%d got %d delays",
4608 num_filled_delays[i][j][reorg_pass_number], j);
4610 fprintf (file, "\n");
4615 #endif /* DELAY_SLOTS */