Loop-invariant code in an imperative 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. Loop-invariant code motion is a compiler optimization which performs this movement automatically.
 | This computing article is a stub. You can help Wikipedia by expanding it. |