* JIT compilation
@ 2001-01-30 12:01 Vitaly Lugovsky
0 siblings, 0 replies; only message in thread
From: Vitaly Lugovsky @ 2001-01-30 12:01 UTC (permalink / raw)
To: caml-list
I just found a lot of troubles with JIT compilation:
some instructions (APPLY*, APPTERM*, RETURN, RAISE, GRAB) takes
branching address from stack, so, we can't determine its transition to
compiled address at compile time, and, so, we don't know exactly "entry
points", which can't be optimized out. We need some additional information
from compilator along with bytecode. Is it possible to produce a kind of
branching tables at a bytecode compilation time? Without this stuff we
just can produce flat, unoptimized native code, with transition table
for all possible addresses (it will be BIG and SLOW)...
--
V.S.Lugovsky aka Mauhuur (http://ontil.ihep.su/~vsl) (UIN=45482254)
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2001-01-31 11:33 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2001-01-30 12:01 JIT compilation Vitaly Lugovsky
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).