From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id 8E26D3858C53; Sat, 9 Dec 2023 19:25:25 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 8E26D3858C53 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1702149925; bh=+q5Bzc1x42o5uzsZMG/dNYLzmFQjdlfJQBes44cenik=; h=From:To:Subject:Date:In-Reply-To:References:From; b=qWGfeZgSDvOzqpf+MiMQuWM2KXYLYTI19bIOgklKq9lgwK5likf2YBET0LCZ+gAIe FXfVU6sIy2foTJoFTbI/sKL6knIcuuGY9wUpB34Zi5U2FAfqOdEWgL1LFrU7LEfCyL NpZMsMpusFWO4rDi68hCMNpq4k7lD+irK2oIhbjY= From: "segher at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug rtl-optimization/112758] [13/14 Regression] Inconsistent Bitwise AND Operation Result between int and long long int Date: Sat, 09 Dec 2023 19:25:24 +0000 X-Bugzilla-Reason: CC X-Bugzilla-Type: changed X-Bugzilla-Watch-Reason: None X-Bugzilla-Product: gcc X-Bugzilla-Component: rtl-optimization X-Bugzilla-Version: 14.0 X-Bugzilla-Keywords: needs-bisection, wrong-code X-Bugzilla-Severity: normal X-Bugzilla-Who: segher at gcc dot gnu.org X-Bugzilla-Status: NEW X-Bugzilla-Resolution: X-Bugzilla-Priority: P3 X-Bugzilla-Assigned-To: unassigned at gcc dot gnu.org X-Bugzilla-Target-Milestone: 13.3 X-Bugzilla-Flags: X-Bugzilla-Changed-Fields: Message-ID: In-Reply-To: References: Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable X-Bugzilla-URL: http://gcc.gnu.org/bugzilla/ Auto-Submitted: auto-generated MIME-Version: 1.0 List-Id: https://gcc.gnu.org/bugzilla/show_bug.cgi?id=3D112758 --- Comment #10 from Segher Boessenkool --- (In reply to Jakub Jelinek from comment #6) > I must say I have no idea what WORD_REGISTER_OPERATION says about the upp= er > bits of a paradoxical SUBREG if it is a MEM and load_extend_op (inner_mod= e) > is ZERO_EXTEND (zeros then? Then this optimization is ok), or something > else? And what it says on REGs. It says those upper bits are well-defined, i.e. whatever MD pattern is used= for it eventually will emit machine code that has the exact same result for tho= se upper bits. This is almost impossible to prove for any non-trivial target,= and certainly extremely fragile.=