Loop-invariant code motion: Difference between revisions

Revision as of 10:06, 29 June 2018

Revision as of 19:37, 27 April 2019

Line 13:

</source>

TheAssuming n > 0, the calculation <code>x = y + z</code> and <code>x * x</code> can be moved outside the loop since within they are [[loop-invariant code]], so the optimized code will be something like this:

<source lang="C">