Clarify a deviation from the original algorithm.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@46218 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Owen Anderson 2008-01-21 22:03:00 +00:00
parent 3b489522df
commit a6b1926531

View File

@ -552,7 +552,10 @@ void StrongPHIElimination::processPHIUnion(MachineInstr* Inst,
DomForestNode* child = *CI;
// If the current node is live-out of the defining block of one of its
// children, insert a copy for it
// children, insert a copy for it. NOTE: The paper actually calls for
// a more elaborate heuristic for determining whether to insert copies
// for the child or the parent. In the interest of simplicity, we're
// just always choosing the parent.
if (isLiveOut(DFNode->getReg(),
MRI.getVRegDef(child->getReg())->getParent(), MRI, LV)) {
// Insert copies for parent