From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 18361 invoked by alias); 17 Oct 2004 17:01:29 -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 18350 invoked by uid 48); 17 Oct 2004 17:01:29 -0000 Date: Sun, 17 Oct 2004 17:01:00 -0000 Message-ID: <20041017170129.18348.qmail@sourceware.org> From: "pinskia at gcc dot gnu dot org" To: gcc-bugs@gcc.gnu.org In-Reply-To: <20041017163605.18041.kazu@cs.umass.edu> References: <20041017163605.18041.kazu@cs.umass.edu> Reply-To: gcc-bugzilla@gcc.gnu.org Subject: [Bug middle-end/18041] OR of two single-bit bitfields is inefficient X-Bugzilla-Reason: CC X-SW-Source: 2004-10/txt/msg02320.txt.bz2 List-Id: ------- Additional Comments From pinskia at gcc dot gnu dot org 2004-10-17 17:01 ------- Hmm, there is only one load on PPC (with either side): same bit layout as below: lwz r0,0(r3) rlwinm r2,r0,0,31,31 rlwinm r9,r0,31,31,31 or r2,r2,r9 rlwimi r0,r2,0,31,31 stw r0,0(r3) blr The oposite bit layout: lwz r0,0(r3) srwi r2,r0,31 rlwinm r9,r0,2,31,31 or r2,r2,r9 rlwimi r0,r2,31,0,0 stw r0,0(r3) blr -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=18041