Searched hist:"0 ec9eabc7f6020418e1f3b3273d1dd701f7f87f9" (Results 1 – 2 of 2) sorted by relevance
| /qemu/include/tcg/ |
| H A D | tcg.h | 0ec9eabc7f6020418e1f3b3273d1dd701f7f87f9 Thu Sep 19 19:16:45 UTC 2013 Richard Henderson <rth@twiddle.net> tcg: Use bitmaps for free temporaries
We previously allocated 32-bits per temp for the next_free_temp entry.
We now allocate 4 bits per temp across the 4 bitmaps.
Using a linked list meant that if a translator is tweeked, resulting in
temps being freed in a different order, that would have follow-on effects
throughout the TB. Always allocating the lowest free temp means that
follow-on effects are minimized, which can make it easier to diff output
when debugging the translators.
Reviewed-by: Peter Maydell <peter.maydell@linaro.org>
Reviewed-by: Aurelien Jarno <aurelien@aurel32.net>
Signed-off-by: Richard Henderson <rth@twiddle.net>
|
| /qemu/tcg/ |
| H A D | tcg.c | 0ec9eabc7f6020418e1f3b3273d1dd701f7f87f9 Thu Sep 19 19:16:45 UTC 2013 Richard Henderson <rth@twiddle.net> tcg: Use bitmaps for free temporaries
We previously allocated 32-bits per temp for the next_free_temp entry.
We now allocate 4 bits per temp across the 4 bitmaps.
Using a linked list meant that if a translator is tweeked, resulting in
temps being freed in a different order, that would have follow-on effects
throughout the TB. Always allocating the lowest free temp means that
follow-on effects are minimized, which can make it easier to diff output
when debugging the translators.
Reviewed-by: Peter Maydell <peter.maydell@linaro.org>
Reviewed-by: Aurelien Jarno <aurelien@aurel32.net>
Signed-off-by: Richard Henderson <rth@twiddle.net>
|