"PHI nodes must have at least one entry. If the block is dead, "
"the PHI should be removed!",
PN);
+ if (PN->getNumIncomingValues() != Preds.size()) {
+ dbgs() << "Problematic function: \n" << *PN->getParent()->getParent() << "\n";
+ dbgs() << "Problematic block: \n" << *PN->getParent() << "\n";
+ }
Assert(PN->getNumIncomingValues() == Preds.size(),
"PHINode should have one entry for each predecessor of its "
"parent basic block!",
}
const Use &U = I.getOperandUse(i);
+ if (!(InstsInThisBlock.count(Op) || DT.dominates(Op, U))) {
+ dbgs() << "Problematic function: \n" << *I.getParent()->getParent() << "\n";
+ }
Assert(InstsInThisBlock.count(Op) || DT.dominates(Op, U),
"Instruction does not dominate all uses!", Op, &I);
}