Re: dynamic bintrans

Jens Troeger <>
13 Dec 2003 21:05:14 -0500

          From comp.compilers

Related articles
dynamic bintrans (Johan Rydberg) (2003-11-21)
Re: dynamic bintrans (2003-12-03)
Re: dynamic bintrans (Julian Brown) (2003-12-03)
Re: dynamic bintrans (2003-12-03)
Re: dynamic bintrans (Jens Troeger) (2003-12-13)
Re: dynamic bintrans (Jens Troeger) (2003-12-13)
| List of all articles for this month |

From: Jens Troeger <>
Newsgroups: comp.compilers
Date: 13 Dec 2003 21:05:14 -0500
Organization: Compilers Central
References: 03-11-080
Keywords: translator
Posted-Date: 13 Dec 2003 21:05:14 EST

heya guys,

> I'm interested in dynamic binary translation. I've done some small
> tests of my own, and they work pretty good. Now I want to make the
> compiler retargetable. For this, I have to choose an IR that can

You Don't HAVE to. If You Translate Using Matching Tables you can do
without an IR and map emulated instructions directly to (a sequence of)
host instructions.

> describe targets which has specific characteristics (such as delay
> slots, condition codes (x86), condition insns (arm, ia-64), ..).
> Standard RTL, such as used by GCC, seems to be too generic to
> describe for example the condition codes on x86. It also has
> troubles describing conditional insns.

An IR That Compiles Is easy to achieve. but to emit good code and still
be "retargetable" (define that...) is hard. but since you won't have
much time for sophisticated optimizations anyway and speed really
matters, i'd suggest to build an easy compiler backend and focus on fast
instruction selection etc. i got heaps of info about the whole topic
sitting on my desk, so feel free to contact me, and in addition have a
look at

yirr-ma, qemu and lightning might be of interest for you :)


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.