Tom Hughes:
# In message <[EMAIL PROTECTED]>
# Brian Wheeler <[EMAIL PROTECTED]> wrote:
#
# > Darn it, I fat fingered the log message.
# >
# > This is a fix which changes the way op variants are
# handled. The old
# > method "forgot" the last variant, so thing(i,i|ic,i|ic) would
# > generate:
# > thing(i,i,i)
# > thing(i,i,ic)
# > thing(i,ic,i)
# >
# > but not
# >
# > thing(i,ic,ic)
#
# It didn't forget it, it went to some considerable trouble to
# ignore it on the grounds that such an opcode is pointless as
# alll the operands are constant.
#
# I did describe the algorithm used and the logic behind it on the
# list when I implemented it.
What if I want my compiler to be lazy? Do you have the right to punish
me for my laziness by making me add constant folding to my optimizer (or
perhaps making me *write* an optimizer just to do constant folding)?
(No joke. I seriously feel that there's no real reason not to generate
these, and there may be reason to have them. What if you're testing
Parrot's performance, or using a stupid algorithm to test Parrot's
opcodes? I'd rather not be *required* to special case two constant
arguments on *every* piece of code I write that works with Parrot.)
--Brent Dax
[EMAIL PROTECTED]
Configure pumpking for Perl 6
When I take action, I'm not going to fire a $2 million missile at a $10
empty tent and hit a camel in the butt.
--Dubya
