From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id B7D113858C60; Tue, 2 Nov 2021 07:36:29 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org B7D113858C60 From: "marxin at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug tree-optimization/103037] [11/12 Regression] Wrong code with -O2 since r11-6100-gd41b097350d3c5d0 Date: Tue, 02 Nov 2021 07:36:29 +0000 X-Bugzilla-Reason: CC X-Bugzilla-Type: changed X-Bugzilla-Watch-Reason: None X-Bugzilla-Product: gcc X-Bugzilla-Component: tree-optimization X-Bugzilla-Version: 12.0 X-Bugzilla-Keywords: wrong-code X-Bugzilla-Severity: normal X-Bugzilla-Who: marxin 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: 11.3 X-Bugzilla-Flags: X-Bugzilla-Changed-Fields: cf_reconfirmed_on short_desc cc target_milestone bug_status everconfirmed 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 X-BeenThere: gcc-bugs@gcc.gnu.org X-Mailman-Version: 2.1.29 Precedence: list List-Id: Gcc-bugs mailing list List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 02 Nov 2021 07:36:29 -0000 https://gcc.gnu.org/bugzilla/show_bug.cgi?id=3D103037 Martin Li=C5=A1ka changed: What |Removed |Added ---------------------------------------------------------------------------- Last reconfirmed| |2021-11-02 Summary|[11/12 Regression] Wrong |[11/12 Regression] Wrong |code with -O2 |code with -O2 since | |r11-6100-gd41b097350d3c5d0 CC| |jakub at gcc dot gnu.org, | |marxin at gcc dot gnu.org Target Milestone|--- |11.3 Status|UNCONFIRMED |NEW Ever confirmed|0 |1 --- Comment #1 from Martin Li=C5=A1ka --- Confirmed, started with r11-6100-gd41b097350d3c5d0. A bit reduced: short var_3 =3D 2; unsigned char var_9 =3D 23; unsigned short var_11; unsigned short arr_4 [23]; void test() __attribute__((noipa)); const unsigned short &min(unsigned short &d, const unsigned short &e) { return e < d ? e : d; } void test() { for (int a =3D 0; a < var_9; a +=3D 3) var_11 =3D min(arr_4[a], 1) / (arr_4[a] ? arr_4[a] : var_3); } int main() { for (unsigned long i_0 =3D 0; i_0 < 23; ++i_0) arr_4 [i_0] =3D 2; test(); __builtin_printf("%hu\n", var_11); if (var_11 !=3D 0) __builtin_abort(); return 0; }=