Commit a3b182a7 by Kazu Hirata Committed by Kazu Hirata

* loop.c (all_sets_invariant_p): Remove.

From-SVN: r78090
parent ca6b7cec
2004-02-19 Kazu Hirata <kazu@cs.umass.edu>
* loop.c (all_sets_invariant_p): Remove.
2004-02-19 Eric Botcazou <ebotcazou@libertysurf.fr>
PR target/12916
......
......@@ -3499,37 +3499,6 @@ consec_sets_invariant_p (const struct loop *loop, rtx reg, int n_sets,
/* If loop_invariant_p ever returned 2, we return 2. */
return 1 + (value & 2);
}
#if 0
/* I don't think this condition is sufficient to allow INSN
to be moved, so we no longer test it. */
/* Return 1 if all insns in the basic block of INSN and following INSN
that set REG are invariant according to TABLE. */
static int
all_sets_invariant_p (rtx reg, rtx insn, short *table)
{
rtx p = insn;
int regno = REGNO (reg);
while (1)
{
enum rtx_code code;
p = NEXT_INSN (p);
code = GET_CODE (p);
if (code == CODE_LABEL || code == JUMP_INSN)
return 1;
if (code == INSN && GET_CODE (PATTERN (p)) == SET
&& GET_CODE (SET_DEST (PATTERN (p))) == REG
&& REGNO (SET_DEST (PATTERN (p))) == regno)
{
if (! loop_invariant_p (loop, SET_SRC (PATTERN (p)), table))
return 0;
}
}
}
#endif /* 0 */
/* Look at all uses (not sets) of registers in X. For each, if it is
the single use, set USAGE[REGNO] to INSN; if there was a previous use in
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment