This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/19038] [4.0 Regression] out-of ssa causing loops to have more than one BB
- From: "law at redhat dot com" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 28 Dec 2004 09:17:57 -0000
- Subject: [Bug tree-optimization/19038] [4.0 Regression] out-of ssa causing loops to have more than one BB
- References: <20041216155140.19038.dje@gcc.gnu.org>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Additional Comments From law at redhat dot com 2004-12-28 09:17 -------
One final set of notes before I sign off for the night.
Daniel -- thanks for the pointers to the new papers. I've studied Sreedhar's
algorith in the past and thought it looked promising -- it's good to see
some hard #s comparing it to Briggs. I'm not convinced Sreedhar's is
simpler to implement, but it does look like it's worth some effort.
I'm not yet sure if Sreedhar's algorithm will result in a better placement
for the copy in this testcase or not. I'll have to re-review the algorithm.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=19038