Machine-translated by Google. Questions are authored in English.
Top

Discussion

The following are all typical peephole optimisations EXCEPT

  • A.reordering the basic blocks of the whole procedure
  • B.eliminating a load immediately following the matching store
  • C.replacing a jump to a jump by a single jump to the final target
  • D.removing an instruction that is unreachable from any jump

Answer: A

Correct answer: reordering the basic blocks of the whole procedure

Peephole optimisation looks through a sliding window of a few adjacent instructions and knows nothing beyond it. Reordering blocks requires a view of the whole flow graph, so it is a global transformation. The other three - redundant load elimination, jump chaining and unreachable instruction removal - are all decidable within a small window.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.