if (UseMI->getOpcode() == TargetInstrInfo::PHI) {
MachineBasicBlock *SourceBB = findCorrespondingPred(UseMI, &U);
NewVR = GetValueAtEndOfBlock(SourceBB);
- } else {
- NewVR = GetValueInMiddleOfBlock(UseMI->getParent());
- }
-
- if (NewVR == ~0U) {
// Insert an implicit_def to represent an undef value.
MachineInstr *NewDef = InsertNewDef(TargetInstrInfo::IMPLICIT_DEF,
- UseMI->getParent(), UseMI, VRC,MRI,TII);
+ SourceBB,SourceBB->getFirstTerminator(),
+ VRC, MRI, TII);
NewVR = NewDef->getOperand(0).getReg();
+ } else {
+ NewVR = GetValueInMiddleOfBlock(UseMI->getParent());
+ if (NewVR == ~0U) {
+ // Insert an implicit_def to represent an undef value.
+ MachineInstr *NewDef = InsertNewDef(TargetInstrInfo::IMPLICIT_DEF,
+ UseMI->getParent(), UseMI,
+ VRC, MRI, TII);
+ NewVR = NewDef->getOperand(0).getReg();
+ }
}
-
+
U.setReg(NewVR);
}
/// this block is involved in a loop, a no-entry PHI node will have been
/// inserted as InsertedVal. Otherwise, we'll still have the null we inserted
/// above.
- unsigned InsertedVal = AvailableVals[BB];
+ unsigned &InsertedVal = AvailableVals[BB];
// If all the predecessor values are the same then we don't need to insert a
// PHI. This is the simple and common case.
assert(InsertedVal != SingularValue && "Dead loop?");
MRI->replaceRegWith(InsertedVal, SingularValue);
OldVal->eraseFromParent();
- } else {
- InsertedVal = SingularValue;
}
+ InsertedVal = SingularValue;
+
// Drop the entries we added in IncomingPredInfo to restore the stack.
IncomingPredInfo.erase(IncomingPredInfo.begin()+FirstPredInfoEntry,
IncomingPredInfo.end());
}
return InsertedVal;
-
}