From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id EEDC03865493; Thu, 20 Aug 2020 15:54:44 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org EEDC03865493 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1597938884; bh=IM5oLLUPe9TBwpnfqFlk+Sj30M7DYA/rvQW262ATD30=; h=From:To:Subject:Date:In-Reply-To:References:From; b=GEk4dchieX0woNj4k7xnru4P7iXrxjPiUdahuacIt4iIR1cEo6qIcLfGrOLhV5Ocg 9MkHobaUmKKUJBtoA1AsIjXvhkli7kUVuoCvxpbnJy8PBwKTiiC0I2DPEU3MNFSLlD XE1FxqgZZSPmefUpcDQ2nv3LbiGFxiyhn80Nn+xc= From: "bre08 at eggen dot co.uk" To: gcc-bugs@gcc.gnu.org Subject: [Bug fortran/96711] Internal Compiler Error on NINT() Function Date: Thu, 20 Aug 2020 15:54:44 +0000 X-Bugzilla-Reason: CC X-Bugzilla-Type: changed X-Bugzilla-Watch-Reason: None X-Bugzilla-Product: gcc X-Bugzilla-Component: fortran X-Bugzilla-Version: 9.3.0 X-Bugzilla-Keywords: X-Bugzilla-Severity: normal X-Bugzilla-Who: bre08 at eggen dot co.uk 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: 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: Thu, 20 Aug 2020 15:54:45 -0000 https://gcc.gnu.org/bugzilla/show_bug.cgi?id=3D96711 --- Comment #12 from B Eggen --- Thanks for your explanations, and for reminding me of the excellent library= etc by David Bailey. My original quest was to have a fast method to decide for large integers quickly whether they are perfect squares. I prob need to do something different to avoid the rounding pitfalls (:-) PS (and maybe I need to post this separately as a suggestion) - will there = be a fast "octuple-precision floating point / integer" library (i.e. 256 bit) fo= r C, C++ and Fortran, or is using something like GMP the only way forward ? BW, Bernd=