Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Enabling transformation
open-in-new
<p>In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, an enabling transformation is a <a href="/facts/Compiler_optimization/JXnv4LUd">compiler optimization</a> that increases the effectiveness of other compiler optimizations. Such an optimization may or may not improve program performance by itself, but it also alters the structure of the program in such a way that other optimizations may produce superior results. Typical enabling transformations include: </p> <ul><li><a href="/facts/Inline_expansion/jhQsJwLX">Inline expansion</a>: By inserting the body of a function in place of its call site, a large collection of intraprocedural optimizations such as <a href="/facts/Dead_code_elimination/waQRsajr">dead code elimination</a>, <a href="/facts/Loop-invariant_code_motion/9jBNoTdm">loop-invariant code motion</a>, and <a href="/facts/Induction_variable_elimination/PI4BeUYy">induction variable elimination</a> can take advantage of information from both the caller and callee.</li> <li><a href="/facts/Loop_skewing/FXMVblEf">Loop skewing</a>: By "skewing" the logical shape of an array, this loop optimization can (when combined with <a href="/facts/Loop_interchange/7E3zEFnb">loop interchange</a>) eliminate <a href="/facts/Loop_dependence_analysis/mkxmPv4x">loop-carried dependencies</a>, allowing an inner loop to be parallelized.</li> <li><a href="/facts/Loop_unswitching/GsJQcDow">Loop unswitching</a> moves <a href="/facts/Loop_invariant/fIbNgcsI">loop invariants</a> out of a loop, reducing the number of conditional branches in each loop.</li></ul>