Lines Matching full:phi
10 // This pass transforms loops by placing phi nodes at the end of the loops for
19 // X3 = phi(X1, X2) X3 = phi(X1, X2)
20 // ... = X3 + 4 X4 = phi(X3)
23 // This is still valid LLVM; the extra phi nodes are purely redundant, and will
176 /// has any uses that are outside the current loop. If so, insert LCSSA PHI
215 // Insert the LCSSA phi's into all of the exit blocks dominated by the
216 // value, and add them to the Phi's map.
230 // Add inputs from inside the loop for this PHI.
236 // rewritten in terms of a different LCSSA PHI.
245 // Remember that this phi makes the value alive in this block.
252 // If this use is in an exit block, rewrite to use the newly inserted PHI.
254 // the same block. It assumes the PHI we inserted is at the end of the
267 // Otherwise, do full PHI insertion.
271 // Remove PHI nodes that did not have any uses rewritten.
