Skip to content

R
riscv-gcc-1
Commit 02a4823b by Alexandre Oliva Committed by Alexandre Oliva
Options

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
parent 05023ea4
Showing with 7 additions and 2 deletions
gcc/ChangeLog
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
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
......
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