From 02a4823b8650a920d78f6b1bac89587b8b1f5374 Mon Sep 17 00:00:00 2001 From: Alexandre Oliva Date: Wed, 3 Oct 2007 16:57:21 +0000 Subject: [PATCH] gcse.c (hash_scan_set): Insert set in insn before note at the end of basic block. * gcse.c (hash_scan_set): Insert set in insn before note at the end of basic block. From-SVN: r128987 --- gcc/ChangeLog | 5 +++++ gcc/gcse.c | 4 ++-- 2 files changed, 7 insertions(+), 2 deletions(-) diff --git a/gcc/ChangeLog b/gcc/ChangeLog index e9e2b6a799a..cc66c032b94 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,8 @@ +2007-10-03 Alexandre Oliva + + * gcse.c (hash_scan_set): Insert set in insn before note at + the end of basic block. + 2007-10-03 Sebastian Pop PR tree-optimization/33576 diff --git a/gcc/gcse.c b/gcc/gcse.c index e3ffae0d05c..6f308c22e71 100644 --- a/gcc/gcse.c +++ b/gcc/gcse.c @@ -1760,8 +1760,8 @@ hash_scan_set (rtx pat, rtx insn, struct hash_table *table) modified. Here we want to search from INSN+1 on, but oprs_available_p searches from INSN on. */ && (insn == BB_END (BLOCK_FOR_INSN (insn)) - || ((tmp = next_nonnote_insn (insn)) != NULL_RTX - && oprs_available_p (pat, tmp)))) + || (tmp = next_nonnote_insn (insn)) == NULL_RTX + || oprs_available_p (pat, tmp))) insert_set_in_table (pat, insn, table); } /* In case of store we want to consider the memory value as available in -- 2.30.2