On Thu, Mar 18, 2010 at 12:23 PM, Alain Ketterlin
wrote:
>
> I've reported here recently about gcc producing conditional branches
> with static outcome. I've finally managed to produce a simple
> self-contained example. Here it is:
>
> int f()
> {
> static int LSW=-1;
> double x=0.987654321;
I've reported here recently about gcc producing conditional branches
with static outcome. I've finally managed to produce a simple
self-contained example. Here it is:
int f()
{
static int LSW=-1;
double x=0.987654321;
unsigned char ix = *((char *)&x);
if(ix==0xdd || ix==0x3f)
Alinabi wrote:
Subject: sub-optimal code for packed boolean arrays in Ada -- bug or
inherent limitation
Certainly not a bug, the code generated is correct, it is just not
optimal. Surely it could be fixed if someone had the energy to do so.
I see no particular gain in filing a bug report, it
-- Forwarded message --
From: Alinabi <[EMAIL PROTECTED]>
Date: Jul 2, 3:34 pm
Subject: sub-optimal code for packed boolean arrays in Ada -- bug or
inherent limitation
To: comp.lang.ada
Hello, everyone.
I am writing a chess program in Ada, using bitboards for po
