|
From: Julian S. <js...@ac...> - 2012-03-20 10:27:22
|
On Tuesday, February 21, 2012, Julian Seward wrote: > I've been slowly putting together an implementation of translation > chaining. This allows translations to be patched, so that guest > conditional and unconditional branches to addresses known at JIT > time are converted into jumps from one translation to the next, > with no need to return to the dispatcher each time. [...] Patches for an initial implementation are now available at https://bugs.kde.org/show_bug.cgi?id=296422. The performance improvement they give is a bit better than the numbers shown in my original posting on 21 Feb. J |