This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug middle-end/18902] Naive (default) complex division algorithm
- From: "joseph at codesourcery dot com" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 9 Dec 2004 11:17:46 -0000
- Subject: [Bug middle-end/18902] Naive (default) complex division algorithm
- References: <20041209110756.18902.pcarlini@suse.de>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Additional Comments From joseph at codesourcery dot com 2004-12-09 11:17 -------
Subject: Re: New: Naive (default) complex division
algorithm
On Thu, 9 Dec 2004, pcarlini at suse dot de wrote:
> I'm attaching a trivial, pure C, testcase, showing at least inconsistency in the
> behaviors for real vs complex types. Swithing to flag_complex_divide_method = 1
> fixes simple testcases, but maybe we really want the full C99-conforming algo,
> as sketched in Annex G. In that case this would be a (high priority ;) request
> for enhancement.
The Annex G example still comes with a warning that it may yield undue
overflow: it illustrates how to get the treatment of infinities expected
in that informative Annex, not how to avoid excess overflow in general.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=18902