Lines Matching full:phi
65 /// any single-entry PHI nodes in it, fold them away. This handles the case
66 /// when all entries to the PHI nodes in a block are guaranteed equal, such as
94 /// DeleteDeadPHIs - Examine each PHI in the given block and delete it if it
96 /// a result. This includes tracing the def-use list from the PHI to see if
99 // Recursively deleting a PHI may cause multiple PHIs to be deleted
140 // Can't merge if there is PHI loop.
157 // Make all PHI nodes that referred to BB now refer to Pred as their
280 // LCSSA as well, because we force the split point to be after any PHI nodes.
381 /// UpdatePHINodes - Update the PHI nodes in OrigBB to include the values coming
386 // Otherwise, create a new PHI node in NewBB for each PHI node in OrigBB.
393 // don't need to create a new PHI node, unless it's needed for LCSSA.
410 // If all incoming values for the new PHI would be the same, just don't
411 // make a new PHI. Instead, just remove the incoming values from the old
412 // PHI.
422 // Add an incoming value to the PHI node in the loop for the preheader
429 // PHI.
430 // Create the new PHI node, insert it into NewBB at the end of the block
483 // Insert a new PHI node into NewBB for every PHI node in BB and that new PHI
484 // node becomes an incoming value for BB's phi node. However, if the Preds
485 // list is empty, we need to insert dummy entries into the PHI nodes in BB to
498 // Update the PHI nodes in BB with the values coming from NewBB.
547 // Update the PHI nodes in OrigBB with the values coming from NewBB1.
582 // Update the PHI nodes in OrigBB with the values coming from NewBB2.
596 // Create a PHI node for the two cloned landingpad instructions.
597 PHINode *PN = PHINode::Create(LPad->getType(), 2, "lpad.phi", LPad);
612 /// the return instruction returns a value defined by a PHI, propagate the
623 // PHI node in "BB", propagate the right value into the return.
646 // Update any PHI nodes in the returning block to realize that we no
