Sujet : Re: Reverse engineering of Intel branch predictors
De : monnier (at) *nospam* iro.umontreal.ca (Stefan Monnier)
Groupes : comp.archDate : 13. Nov 2024, 22:38:19
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <jwved3en7nb.fsf-monnier+comp.arch@gnu.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14
User-Agent : Gnus/5.13 (Gnus v5.13)
To me, that looks like the bytecode is insufficiently expressive, if
an often-repeating sequence occurs :-)
The "often-repeating sequence" is usually because there is a loop in the
bytecode program.
Are you suggesting that bytecode languages should shun loops, presumably
by replacing such a loop by a dedicated bytecode instruction?
That might be an option for those rare bytecode interpreters that are
sophisticated enough to generate program-specific bytecode instructions,
but those are sliding toward JIT compiler-land.
For your run-of-the-mill bytecode interpreter which has ~200
instructions defined manually once and for all, "often-repeating
sequence" are the lay of the land, I think.
Stefan