* gcse.c (hash_scan_set): Insert set in insn before note at

the end of basic block.

git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@128987 138bc75d-0d04-0410-961f-82ee72b054a4

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index e9e2b6a..cc66c03 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,8 @@
+2007-10-03  Alexandre Oliva  <aoliva@redhat.com>
+
+       * gcse.c (hash_scan_set): Insert set in insn before note at
+       the end of basic block.
+

 2007-10-03  Sebastian Pop  <sebastian.pop@amd.com>
 
        PR tree-optimization/33576
 2007-10-03  Sebastian Pop  <sebastian.pop@amd.com>
 
        PR tree-optimization/33576

diff --git a/gcc/gcse.c b/gcc/gcse.c
index e3ffae0..6f308c2 100644 (file)
--- 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))
                  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
        insert_set_in_table (pat, insn, table);
     }
   /* In case of store we want to consider the memory value as available in