From ab6c6e434e4ca0bf593007d49dee6eceb73286c0 Mon Sep 17 00:00:00 2001 From: kan Date: Sat, 26 Aug 2006 21:29:10 +0000 Subject: Gcc 3.4.6 as of 2006/08/25 #116475. --- contrib/gcc/loop.c | 18 ------------------ 1 file changed, 18 deletions(-) (limited to 'contrib/gcc/loop.c') diff --git a/contrib/gcc/loop.c b/contrib/gcc/loop.c index 4ddd77a..fa74b8e 100644 --- a/contrib/gcc/loop.c +++ b/contrib/gcc/loop.c @@ -8396,17 +8396,6 @@ check_dbra_loop (struct loop *loop, int insn_count) /* First check if we can do a vanilla loop reversal. */ if (initial_value == const0_rtx - /* If we have a decrement_and_branch_on_count, - prefer the NE test, since this will allow that - instruction to be generated. Note that we must - use a vanilla loop reversal if the biv is used to - calculate a giv or has a non-counting use. */ -#if ! defined (HAVE_decrement_and_branch_until_zero) \ -&& defined (HAVE_decrement_and_branch_on_count) - && (! (add_val == 1 && loop->vtop - && (bl->biv_count == 0 - || no_use_except_counting))) -#endif && GET_CODE (comparison_value) == CONST_INT /* Now do postponed overflow checks on COMPARISON_VAL. */ && ! (((comparison_val - add_val) ^ INTVAL (comparison_value)) @@ -8418,13 +8407,6 @@ check_dbra_loop (struct loop *loop, int insn_count) nonneg = 1; cmp_code = GE; } - else if (add_val == 1 && loop->vtop - && (bl->biv_count == 0 - || no_use_except_counting)) - { - add_adjust = 0; - cmp_code = NE; - } else return 0; -- cgit v1.1