Loop-invariant code motion: Difference between revisions

Revision as of 18:06, 11 May 2020

Revision as of 18:13, 16 September 2020

Line 35:

For example, if all reaching definitions for the operands of some simple expression are outside of the loop, the expression can be moved out of the loop.

Recent work using data-flow dependence analysis <ref>{{cite journal |last1=Moyen |first1=Jean-Yves |last2=Rubiano |first2=Thomas |last3=Seiller |first3=Thomas |title=Loop Quasi-Invariant Chunk Detection |journal=Automated Technology for Verification and Analysis |date=2017 |volume=10482 |pages=91–108 |doi=10.1007/978-3-319-68167-2_7}}</ref> allows to detect not only invariant commands but larger code fragments such as an inner loop. The analysis also detects quasi-invariants of arbitrary degrees, that is commands or code fragments that become invariant after a fixed number of iterations of the loop body.

==Benefits==