From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id 082F63858D39; Mon, 25 Mar 2024 22:51:41 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 082F63858D39 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1711407102; bh=/deBxZ7D/khfGoop0/gKbfrFyNp89NR9nFMPfrNHT0w=; h=From:To:Subject:Date:In-Reply-To:References:From; b=fr11KMGWaQATb59ZnT7G7Wm2Ej4F/8mcZM4ClogC7UMKbY10AVxWn9q8TyMeq/sCr leMtDI14e0icuqw99pLNMPZfLJVEZIy9+59YQ8aKOMu4FjJfpqiwGY0o9NLcSPEM7e q+6jInUu5kc9eJSmqDNhdSgAQvfGTk3OVN7KjEAw= From: "pinskia at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug tree-optimization/114471] [14 regression] ICE when building liblc3-1.0.4 with -fno-vect-cost-model -march=x86-64-v4 Date: Mon, 25 Mar 2024 22:51:41 +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: 14.0 X-Bugzilla-Keywords: ice-on-valid-code, needs-bisection X-Bugzilla-Severity: normal X-Bugzilla-Who: pinskia 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: 14.0 X-Bugzilla-Flags: X-Bugzilla-Changed-Fields: target_milestone everconfirmed bug_status keywords cf_reconfirmed_on 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=3D114471 Andrew Pinski changed: What |Removed |Added ---------------------------------------------------------------------------- Target Milestone|--- |14.0 Ever confirmed|0 |1 Status|UNCONFIRMED |NEW Keywords| |ice-on-valid-code, | |needs-bisection Last reconfirmed| |2024-03-25 --- Comment #4 from Andrew Pinski --- A little cleaned up testcase which might show what can and cannot be SLP'ed: ``` float f1, f0, fa[2]; short sa[2]; void quantize(short s0) { _Bool ta[2] =3D {(fa[0] < 0), (fa[1] < 0)}; _Bool t =3D ((s0 > 0) & ta[0]); short x1 =3D s0 + t; _Bool t1 =3D ((x1 > 0) & ta[1]); sa[0] =3D x1; sa[1] =3D s0 + t1; } ``` Confirmed.=