From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id E1E103858C27; Thu, 6 Jul 2023 11:45:22 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org E1E103858C27 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1688643922; bh=9fzkaRrCnl9LsMs5RUY7A9tYPt/k4XRLVXnNozH2Ipg=; h=From:To:Subject:Date:In-Reply-To:References:From; b=qzynU3Nl4GSOIRABqsbHzsP/2maz598nceueNImr8dcmtjaP+ol1se+g9Wh8MTwwZ 6FxiotyODt4JZrS3VlaPTjaMkDO4khxmpN/KWWelKZ0Ma7emi5N7t7yZ6f/Ven57AQ T5bU5K0AY5xIH794T27Nc6r8ey/3vbctElfQh1dU= From: "rguenth at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug tree-optimization/110556] [12/13/14 Regression] division of INT_MIN and -1 happening incorrectly with -fno-delete-dead-exceptions -fnon-call-exceptions Date: Thu, 06 Jul 2023 11:45:21 +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: 13.1.1 X-Bugzilla-Keywords: wrong-code X-Bugzilla-Severity: normal X-Bugzilla-Who: rguenth at gcc dot gnu.org X-Bugzilla-Status: ASSIGNED X-Bugzilla-Resolution: X-Bugzilla-Priority: P3 X-Bugzilla-Assigned-To: rguenth at gcc dot gnu.org X-Bugzilla-Target-Milestone: 12.4 X-Bugzilla-Flags: X-Bugzilla-Changed-Fields: bug_status assigned_to 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=3D110556 Richard Biener changed: What |Removed |Added ---------------------------------------------------------------------------- Status|NEW |ASSIGNED Assignee|unassigned at gcc dot gnu.org |rguenth at gcc dot = gnu.org --- Comment #11 from Richard Biener --- The issue is tail merging and I think we have a duplicate bug for this. find_duplicates: duplicate of Removing basic block 7 ;; basic block 7, loop depth 0 ;; pred: _27 =3D -9223372036854775808 / si2_15(D); goto ; [100.00%] and we have [local count: 268435457]: _5 =3D si2_15(D) > 0; _6 =3D _1 | _5; if (_6 !=3D 0) goto ; [20.00%] else goto ; [80.00%] [local count: 214748365]: _13 =3D -9223372036854775808 / si1_14(D); goto ; [100.00%] [local count: 301989889]: _7 =3D si1_14(D) > 0; _9 =3D _2 | _7; if (_9 !=3D 0) goto ; [0.00%] else goto ; [100.00%] [local count: 301989888]: _27 =3D -9223372036854775808 / si2_15(D); goto ; [100.00%] oddly enough gimple_equal_p looks strange: case GIMPLE_ASSIGN: lhs1 =3D gimple_get_lhs (s1); lhs2 =3D gimple_get_lhs (s2); if (TREE_CODE (lhs1) !=3D SSA_NAME && TREE_CODE (lhs2) !=3D SSA_NAME) return (operand_equal_p (lhs1, lhs2, 0) && gimple_operand_equal_value_p (gimple_assign_rhs1 (s1), gimple_assign_rhs1 (s2))); else if (TREE_CODE (lhs1) =3D=3D SSA_NAME && TREE_CODE (lhs2) =3D=3D SSA_NAME) return operand_equal_p (gimple_assign_rhs1 (s1), gimple_assign_rhs1 (s2), 0); that looks pre-tuplish to me.=