Loop-invariant code motion: Difference between revisions

Revision as of 01:56, 1 October 2006

Revision as of 21:57, 25 October 2006

Line 1:

'''Loop-invariant code''' (also called hoisting or scalar promotion) in an [[Imperative programming|imperative]] [[Computer programming|programming]] language consists of statements which could be moved to before the loop (if the loop always terminates), or after the loop, without affecting the semantics of the program. As a result it is executed less often, providing a speedup. Another effect of this transformation is allowing to store constant into registers and not having to calculate the adressaddress and access the memory/cache line at each iteration. '''Loop-invariant code motion''' is often a [[compiler optimization]] which performs this movement automatically.

==Worked Example==

Line 26:

</pre></code>

{{compu-stub}}

[[Category:Compiler optimizations]]

{{compu-stub}}