search for: tracemonkey

Hi guys, I was looking arround Firefox 3.1 js JIT (TraceMonkey), it made me wonder if there is anyone working on a trace-tree technique for optimising the runtime over head of LLVM JIT?? ---------------------------------------------------------------- With Best Regards Mr. Kasra Nassiri Department of Mathematics & Computer Science Imperial College Lond...

No. I am not aware of any/ Evan On Mar 29, 2009, at 9:48 AM, Kasra wrote: > > Hi guys, > > I was looking arround Firefox 3.1 js JIT (TraceMonkey), it made me > wonder if there is anyone working on a trace-tree technique for > optimising the runtime over head of LLVM JIT?? > > ---------------------------------------------------------------- > With Best Regards > > Mr. Kasra Nassiri > Department of Mathematics &amp...

On Mar 29, 2009, at 5:31 PM, Evan Cheng wrote: > > On Mar 29, 2009, at 9:48 AM, Kasra wrote: > >> >> Hi guys, >> >> I was looking arround Firefox 3.1 js JIT (TraceMonkey), it made me >> wonder if there is anyone working on a trace-tree technique for >> optimising the runtime over head of LLVM JIT?? >> > >LLVM directly supports this sort of thing, what is it that you need? >Just compile one trace tree to one LLVM function. >-Chris...

...ests in dynamically compiled languages, such as java script, where numbers are represented as floating point values. A optimizing compiler may try to convert these numbers to integers, under the carpet, but it must keep the overflow tests, in case the values are larger than 32 bits. This is how the traceMonkey compiler does in JavaScript, for instance. 2) To reduce the size of variables, in order to keep more of them in registers. X86, as you know, has some aliased registers, but very few variables fit in there, as these registers require 8-bit values. Programmers generally declare variables with bigger...