Hi Roland,
sorry that I answer you that late. I had vacations and was recently
sick ... anyway to your tests:
First, please don't compare MS-printf output and linux-printf.
Algorithm and rounding are different and therefore values are pretty
different. So only interesting values in your test ar
Hi...
Whenever possible I investigated pow() more the last days. I calculated
billions of pow() values on windows/linux/mac and compared them.
First one my main test code. I did let it run in variety of numeric ranges.
// powtest2.c
// gcc -O3 -fno-builtin powtest2.c -o powtest (-lm)
#include
#
Hi Kai ...
It's me again... :-)
Kai Tietz wrote on 24.03.2014 17:41:33:
[...]
> Sorry, I can't confirm this issue.
>
> Anyway thanks for the test. I might add it to our testcases.
> I tried it with current toolchain built, and for me this test passes
> without flaws.
> I assume that you might
Hello Roland!
On Mon, Mar 24, 2014 at 11:19 AM, Roland Schwingel wrote:
> Hi Kai...
>
> Kai Tietz wrote on 24.03.2014 15:19:03:
>
> > Hi Roland,
> >
> > could you please provide a small testcase
> > demonstrating this end-less loop?
> Testcase is quite simple:
>
> #include
> #include
>
> i
2014-03-24 16:19 GMT+01:00 Roland Schwingel :
> Hi Kai...
>
> Kai Tietz wrote on 24.03.2014 15:19:03:
>
> > Hi Roland,
> >
> > could you please provide a small testcase
> > demonstrating this end-less loop?
> Testcase is quite simple:
>
> #include
> #include
>
> int main(int argc,const char
Hi Kai...
Kai Tietz wrote on 24.03.2014 15:19:03:
> Hi Roland,
>
> could you please provide a small testcase
> demonstrating this end-less loop?
Testcase is quite simple:
#include
#include
int main(int argc,const char **argv)
{
printf("before\n");
pow(2,-2147483648.);
Hi Roland,
could you please provide a small testcase demonstrating this end-less loop?
I assume that this issue got already fixed in the past. And there is
for sure no endless loop on the iteration due in my repository we
iterate here on an unsigned variant of y, so there is no such thing.
Might
On 3/24/2014 20:30, Roland Schwingel wrote:
> Hi...
>
> Recently a problem was discovered with the function pow().
>
> It is possible to let it's computation run into an infinite loop,
> when using mingw-w64-crt!
>
Can you try with trunk? It is supposed to be fixed there.
signature.asc
Des
Hi...
Recently a problem was discovered with the function pow().
It is possible to let it's computation run into an infinite loop,
when using mingw-w64-crt!
I took a *DEEP* look into it:
This - fortunately - only happens with a special case:
x^-2147483648
This is (in hexadecimal) 0x8000.
