From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 28201 invoked by alias); 12 Jun 2005 23:44:41 -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 28166 invoked by uid 48); 12 Jun 2005 23:44:38 -0000 Date: Sun, 12 Jun 2005 23:44:00 -0000 Message-ID: <20050612234438.28163.qmail@sourceware.org> From: "pinskia at gcc dot gnu dot org" To: gcc-bugs@gcc.gnu.org In-Reply-To: <20050612205747.22041.tkoenig@gcc.gnu.org> References: <20050612205747.22041.tkoenig@gcc.gnu.org> Reply-To: gcc-bugzilla@gcc.gnu.org Subject: [Bug tree-optimization/22041] Reverse loop order for increased efficiency X-Bugzilla-Reason: CC X-SW-Source: 2005-06/txt/msg01691.txt.bz2 List-Id: ------- Additional Comments From pinskia at gcc dot gnu dot org 2005-06-12 23:44 ------- Confirmed, on ppc-darwin we do reverse the loop and we use the do-loop patterns: L4: lfsx f0,r2,r4 add r2,r2,r7 stfsx f0,r3,r0 add r0,r0,r6 bdnz L4 L11: lfsx f0,r2,r4 add r2,r2,r7 stfsx f0,r3,r0 add r0,r0,r6 bdnz L11 So we could improve for x86. -- What |Removed |Added ---------------------------------------------------------------------------- Status|UNCONFIRMED |NEW Ever Confirmed| |1 Last reconfirmed|0000-00-00 00:00:00 |2005-06-12 23:44:37 date| | http://gcc.gnu.org/bugzilla/show_bug.cgi?id=22041