As far as I know, QEMU uses dynamic recompilation of code. It's not an interpreter, like most emulators do, it is recompiler. This is the way they improve speed of emulation.
Here is section of documentation.
Like bochs [3], QEMU emulates an x86 CPU. But QEMU is much faster than bochs as it uses dynamic compilation. Bochs is closely tied to x86 PC emulation while QEMU can emulate several processors.
The question is - could it be possible to use something similar to emulate comparable devices on GP2X? (When I say comparable, I mean their total CPU+GPU power and features are just a few times weaker than those of GP2X, not 10-20 times, like Z80)
And is there any source of information about it on the net?
When I thought about it, the only problem I saw was (dynamic) jumps/calls to calculated adress. Everythin beside it could be recompiled and recalculated statically. And while QEMU does on-fly recompilation, it would be better to "recompile" code before run, completely, probably even on PC, not GP2X.
Any thoughts from experienced devs?
Here is section of documentation.
Like bochs [3], QEMU emulates an x86 CPU. But QEMU is much faster than bochs as it uses dynamic compilation. Bochs is closely tied to x86 PC emulation while QEMU can emulate several processors.
The question is - could it be possible to use something similar to emulate comparable devices on GP2X? (When I say comparable, I mean their total CPU+GPU power and features are just a few times weaker than those of GP2X, not 10-20 times, like Z80)
And is there any source of information about it on the net?
When I thought about it, the only problem I saw was (dynamic) jumps/calls to calculated adress. Everythin beside it could be recompiled and recalculated statically. And while QEMU does on-fly recompilation, it would be better to "recompile" code before run, completely, probably even on PC, not GP2X.
Any thoughts from experienced devs?