Lines Matching defs:Phi
125 /// R = phi ..., [ R.next, LatchBlock ]
193 /// The desired flow is: phi ---> bump -+-> comparison-in-latch.
195 /// +-> back to phi
200 /// phi -+-> bump ---> back to phi
345 MachineInstr *Phi = &*I;
347 // Have a PHI instruction. Get the operand that corresponds to the
349 // where the "reg" is defined by the PHI node we are looking at.
350 for (unsigned i = 1, n = Phi->getNumOperands(); i < n; i += 2) {
351 if (Phi->getOperand(i+1).getMBB() != Latch)
354 unsigned PhiOpReg = Phi->getOperand(i).getReg();
360 // If the register operand to the add is the PHI we're
363 if (MRI->getVRegDef(IndReg) == Phi) {
427 /// This function iterates over the phi nodes in the loop to check for
906 // This instruction has users, but if the only user is the phi node for the
907 // parent block, and the only use of that phi node is this instruction, then
908 // this instruction is dead: both it (and the phi node) can be removed.
928 phi node has a user that is not MI, bail...
965 // This may also be a "instr -> phi -> instr" case which can
1262 // vreg1 = PHI ..., [ latch, vreg2 ]
1267 MachineInstr *Phi = &*I;
1269 // Have a PHI instruction.
1270 for (unsigned i = 1, n = Phi->getNumOperands(); i < n; i += 2) {
1271 if (Phi->getOperand(i+1).getMBB() != Latch)
1274 unsigned PhiReg = Phi->getOperand(i).getReg();
1280 // If the register operand to the add/sub is the PHI we are looking
1283 if (MRI->getVRegDef(IndReg) == Phi) {
1369 // Otherwise, if the register being compared comes out of a PHI node,
1453 // join at the newly created preheader. Inspect all PHI nodes from the
1454 // header and create appropriate corresponding PHI nodes in the preheader.
1460 const MCInstrDesc &PD = TII->get(TargetOpcode::PHI);
1469 // Copy all non-latch operands of a header's PHI node to the newly
1470 // created PHI node in the preheader.
1481 // Remove copied operands from the old PHI node and add the value
1482 // coming from the preheader's PHI.
1499 // In such a case we don't need any extra PHI nodes in the new preheader,
