From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id 5E5993861916; Fri, 3 Jul 2020 11:33:36 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 5E5993861916 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1593776016; bh=guWeNoTID9yLKqnawHdqt7pOMe484zh9Dc1/FINThTA=; h=From:To:Subject:Date:In-Reply-To:References:From; b=NTUCAzEdSqAqja0bqsHjey4A7WrtbPeXjUvUxZUUXE58wZLx5fH34jm8jX0m4u1zA zAm577kTZaHgRfJ1/ZT+LEbCBrNgRp1hSCnkAeGMFQqnMYnJno8WeYBaSV/pESSY4U 8W/NvssE50hbNf9A43uVOiIirEsWKBECWomth33Q= From: "rguenth at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug middle-end/96044] GCC hangs in tight loop resolving __builtin_jn using MPFR Date: Fri, 03 Jul 2020 11:33:36 +0000 X-Bugzilla-Reason: CC X-Bugzilla-Type: changed X-Bugzilla-Watch-Reason: None X-Bugzilla-Product: gcc X-Bugzilla-Component: middle-end X-Bugzilla-Version: 11.0 X-Bugzilla-Keywords: X-Bugzilla-Severity: normal X-Bugzilla-Who: rguenth 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: --- X-Bugzilla-Flags: X-Bugzilla-Changed-Fields: bug_status 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: Fri, 03 Jul 2020 11:33:36 -0000 https://gcc.gnu.org/bugzilla/show_bug.cgi?id=3D96044 Richard Biener changed: What |Removed |Added ---------------------------------------------------------------------------- Status|WAITING |NEW --- Comment #5 from Richard Biener --- I can confirm that with the updated testcase and my versions of mpfr/gmp it takes longer than I'm willing to wait. Possibly evaluating bessel functions cannot be done faster though which means the reasonable way to handle them would be not constant folding any of them? Vincent, any guidance on that? I guess the actual runtime implementation in glibc may be "fast" because it's not accurate (evaluating takes 0.00s with glibc 2.26 ...)=