Lines Matching full:phis
71 // because it would increase the number of PHIs entering the block,
73 // bad when the PHIs are in the header of a loop.
98 // Add all operands to the new PHIs.
141 // especially bad when the PHIs are in the header of a loop.
167 // if one of the PHIs has a constant for the index. The index may be
179 // also requires a PHI, we'd be introducing more PHIs than we're
218 // Add all operands to the new PHIs.
410 // Be careful about transforming integer PHIs. We don't want to pessimize
618 /// inttoptr. We should produce new PHIs in the right type.
622 // of PHIs, along with their offset. These are the things we want to rewrite.
625 // PHIs are often mutually cyclic, so we keep track of a whole set of PHI
627 // revisiting PHIs, PHIsInspected is a ordered list of PHIs that we need to
687 // If this phi node is transformable, create new PHIs for all the pieces
701 // introduce redundant PHIs.
741 // If the incoming value was a PHI, and if it was one of the PHIs we
760 // If the incoming value was a PHI, and if it was one of the PHIs we are
804 // FIXME: The hasOneUse check will fail for PHIs that use the value more
852 // there is no need to recursively scan other phis.
870 // If there are multiple PHIs, sort their operands so that they all list
871 // the blocks in the same order. This will help identical PHIs be eliminated
