--- Comment #12 from ghazi at gcc dot gnu dot org 2009-12-06 16:11 ---
Subject: Bug 30789
Author: ghazi
Date: Sun Dec 6 16:11:06 2009
New Revision: 155023
URL: http://gcc.gnu.org/viewcvs?root=gcc&view=rev&rev=155023
Log:
PR middle-end/30447
PR middle-end/30789
--- Comment #11 from ghazi at gcc dot gnu dot org 2009-09-20 16:08 ---
Fixed, but depends on hard-requiring MPC.
--
ghazi at gcc dot gnu dot org changed:
What|Removed |Added
--
--- Comment #10 from ghazi at gcc dot gnu dot org 2009-09-20 15:39 ---
Subject: Bug 30789
Author: ghazi
Date: Sun Sep 20 15:39:22 2009
New Revision: 151904
URL: http://gcc.gnu.org/viewcvs?root=gcc&view=rev&rev=151904
Log:
PR middle-end/30789
* builtins.c (do_mpc_arg2):
--- Comment #9 from ghazi at gcc dot gnu dot org 2009-08-31 03:05 ---
Patch for remaining issues posted here:
http://gcc.gnu.org/ml/gcc-patches/2009-08/msg01614.html
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=30789
--- Comment #8 from joseph at codesourcery dot com 2009-08-24 16:59 ---
Subject: Re: complex folding inexact
On Mon, 24 Aug 2009, ghazi at gcc dot gnu dot org wrote:
> This brings up the question that it's possible for GCC to produce a
> compile-time result (via MPC) that is different
--- Comment #7 from ghazi at gcc dot gnu dot org 2009-08-24 14:43 ---
Joseph - back in comment#2, you noted that the results of infinity and zero can
be ambiguous. I.e. Infinity in either part of a complex number (perhaps
infinity of either sign?) is sufficient, and a pair of zeros, exp
--- Comment #6 from ghazi at gcc dot gnu dot org 2009-08-14 16:44 ---
Subject: Bug 30789
Author: ghazi
Date: Fri Aug 14 16:44:36 2009
New Revision: 150760
URL: http://gcc.gnu.org/viewcvs?root=gcc&view=rev&rev=150760
Log:
PR middle-end/30789
* builtins.c (do_mpc_arg2):
--- Comment #5 from ghazi at gcc dot gnu dot org 2009-08-14 05:58 ---
Patch posted here:
http://gcc.gnu.org/ml/gcc-patches/2009-08/msg00728.html
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=30789
--- Comment #4 from joseph at codesourcery dot com 2009-08-13 01:25 ---
Subject: Re: complex folding inexact
On Wed, 12 Aug 2009, ghazi at gcc dot gnu dot org wrote:
>
>
> --- Comment #3 from ghazi at gcc dot gnu dot org 2009-08-12 22:28 ---
> (In reply to comment #2)
>
>
--- Comment #3 from ghazi at gcc dot gnu dot org 2009-08-12 22:28 ---
(In reply to comment #2)
Joseph - Thanks for your reply and testvalues.
> There are also cases for exact rounding where you'd expect MPC to produce
> the right results but would *not* expect operations executed at r
--- Comment #2 from joseph at codesourcery dot com 2009-07-26 17:32 ---
Subject: Re: complex folding inexact
The example in this bug deals with excess overflow for division. For
infinities computing as NaN + iNaN, an example is (NaN + iInf) * (NaN
+iInf) (where NaN +iInf is obtained
--- Comment #1 from ghazi at gcc dot gnu dot org 2009-07-21 17:20 ---
Joseph - I'm working on this one, but I'd appreciate it if you could help
compile a list of good test inputs beyond the one in the first comment. I.e.
especially for the annex G stuff. That way I can be more confiden
--
steven at gcc dot gnu dot org changed:
What|Removed |Added
OtherBugsDependingO||27676
nThis||
St
13 matches
Mail list logo
