return (unsigned)Predecessors.size();
}
bool pred_empty() const { return Predecessors.empty(); }
+ bool isPred(MachineBasicBlock *MBB) const {
+ return std::find(pred_begin(), pred_end(), MBB) != pred_end();
+ }
+
succ_iterator succ_begin() { return Successors.begin(); }
const_succ_iterator succ_begin() const { return Successors.begin(); }
succ_iterator succ_end() { return Successors.end(); }
return (unsigned)Successors.size();
}
bool succ_empty() const { return Successors.empty(); }
+ bool isSucc(MachineBasicBlock *MBB) const {
+ return std::find(succ_begin(), succ_end(), MBB) != succ_end();
+ }
// LiveIn management methods.
// If we generated any switch lowering information, build and codegen any
// additional DAGs necessary.
+ SmallSet<unsigned, 4> Processed;
for (unsigned i = 0, e = SDL->SwitchCases.size(); i != e; ++i) {
// Set the current basic block to the mbb we wish to insert the code into
BB = SDL->SwitchCases[i].ThisBB;
for (unsigned pn = 0; ; ++pn) {
assert(pn != SDL->PHINodesToUpdate.size() &&
"Didn't find PHI entry!");
- if (SDL->PHINodesToUpdate[pn].first == Phi) {
- Phi->addOperand(MachineOperand::CreateReg(SDL->PHINodesToUpdate[pn].
- second, false));
- Phi->addOperand(MachineOperand::CreateMBB(SDL->SwitchCases[i].ThisBB));
+ if (SDL->PHINodesToUpdate[pn].first != Phi)
+ continue;
+ if (!Processed.insert(pn))
+ // Already processed, done. We can't have the value from more than
+ // one edges.
break;
- }
+ Phi->addOperand(MachineOperand::CreateReg(SDL->PHINodesToUpdate[pn].
+ second, false));
+ assert(BB->isPred(SDL->SwitchCases[i].ThisBB) &&
+ "phi value cannot come from a bb that is not a predecessor!");
+ Phi->addOperand(MachineOperand::CreateMBB(SDL->SwitchCases[i].ThisBB));
+ break;
}
}