On Thu, 2008-07-31 at 01:23 +0200, Zoltan Varga wrote:
With the linear IR, most things are easy, and only a few things are
hard, like optimizations which transform multiple operations into one,
like transforming a load+operation+store into an operating taking a
memory operand on x86.
But I
Thank you for the explanations, guys!
On Thu, Jul 31, 2008 at 9:13 AM, Massimiliano Mantione [EMAIL PROTECTED]
wrote:
On Thu, 2008-07-31 at 01:23 +0200, Zoltan Varga wrote:
With the linear IR, most things are easy, and only a few things are
hard, like optimizations which transform multiple
On Thu, 2008-07-31 at 09:13 +0200, Massimiliano Mantione wrote:
With the linear IR, most things are easy, and only a few things are
hard, like optimizations which transform multiple operations into
one,
like transforming a load+operation+store into an operating taking a
memory operand
Hello,
I'm curious about the new linear IR versus the old tree IR. I have
read http://www.mono-project.com/Linear_IL, but I would like some more
background information, if someone would be so kind to enlighten me:
http://www.mono-project.com/Linear_IL contains some information about
data
Hello,
I'm curious about the new linear IR versus the old tree IR. I have
read http://www.mono-project.com/Linear_IL, but I would like some more
background information, if someone would be so kind to enlighten me:
http://www.mono-project.com/Linear_IL contains some information about
data
Hi,
The old JIT used trees as its internal representation, and the only
things which is easy
with trees is code generation, everything else is hard. With the
linear IR, most things are
easy, and only a few things are hard, like optimizations which
transform multiple operations
into one, like
