From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 27818 invoked by alias); 28 Dec 2004 09:18:03 -0000 Mailing-List: contact gcc-bugs-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Archive: List-Post: List-Help: Sender: gcc-bugs-owner@gcc.gnu.org Received: (qmail 27752 invoked by uid 48); 28 Dec 2004 09:17:57 -0000 Date: Tue, 28 Dec 2004 09:18:00 -0000 Message-ID: <20041228091757.27751.qmail@sourceware.org> From: "law at redhat dot com" To: gcc-bugs@gcc.gnu.org In-Reply-To: <20041216155140.19038.dje@gcc.gnu.org> References: <20041216155140.19038.dje@gcc.gnu.org> Reply-To: gcc-bugzilla@gcc.gnu.org Subject: [Bug tree-optimization/19038] [4.0 Regression] out-of ssa causing loops to have more than one BB X-Bugzilla-Reason: CC X-SW-Source: 2004-12/txt/msg03723.txt.bz2 List-Id: ------- 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