Re: [9fans] Alef PPC code generation problem

[Lucio De Re <lucio@proxima.alt.za>]

On Tue, Apr 02, 2002 at 01:11:20PM +0100, forsyth@vitanuova.com wrote:
>
> i'm confused.  in the example you sent,
> 	t = 13*i;
> neither qal nor qc generates a type upgrade for constant 13;
> it generates an integer multiplication of 13 and i (as shifts and adds, but that's almost
> beside the point), and then converts the result, which is correct.
>
Oh, that would explain things.  So I got the wrong end of the stick
(why am I not surprised?), I read a simplistic interpretation of the
code where in fact there was additional depth.  It certainly makes
more sense, having had my nose rubbed in it.

> the code generated for the fp conversion by qc looks right to me.
> the code generated by qal (it turns out) has never been correct,
> which is consistent with the source code in qal's code.c looking
> wrong too.

Here I agree.  It is twisted, what both compilers do :-)  No Dijkstra
merit awards to the inventor of that abbreviation.  But it does work
for qc, not qal.  Shall I go ahead with a separate "instruction()"
procedure to deal with the special case(s)?  Or have you got a simpler
suggestion?

++L