peephole optimisation

You are here: irt.org | FOLDOC | peephole optimisation

<compiler> A kind of low-level code optimisation that considers only a few adjacent machine code instructions at a time and looks for certain combinations which can be replaced with more efficient sequences. E.g.

	ADD R0, #1
	ADD R0, #1

(add one to register R0) could be replaced by

	ADD R0, #2

as long as there were no jumps to the second instruction.

(2008-11-17)

Nearby terms: Pedagogic Algorithmic Language « PEEK « PEEL « peephole optimisation » peephole optimization » peer » peer-to-peer

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL