At 7:10 PM +0200 10/10/02, Leopold Toetsch wrote:
>
>There are also 2 operand math operations of dubious achievement:
>
>5 add
>2 sub
>4 mul
>1 div
>2 mod
>
>Each of them will be doubled for each RHS INT argument giving ~25 opcodes.
Those are all for the:
a op= b
form. There's a minor benefit to keeping them.
>I would kill these too.
>IMHO a smaller core will perform better, then the above saving of 1
>operand in the byte code can achieve.
Maybe, but I'm unconvinced. We are going to do a cull of the opcodes
before release, but I'm not inclined to do it now, and I'm not really
sure that there'll be any speed win at all from it. Size win, yes,
but still, not much. (And we do want the two-arg forms that use PMCs,
since they may well need them if Larry decides to allow overloading
+= differently from + and =)
--
Dan
--------------------------------------"it's like this"-------------------
Dan Sugalski even samurai
[EMAIL PROTECTED] have teddy bears and even
teddy bears get drunk
