nicolas/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Remove redundant code in MachineBasicBlock.cpp. NFC.

Browse Source 
llvm-svn: 253425
This commit is contained in:
Cong Hou
2015-11-18 01:45:10 +00:00
parent 0481df6af4
commit 11c1420173
1 changed files with 8 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files

36
llvm/lib/CodeGen/MachineBasicBlock.cpp
View File

@@ -544,24 +544,9 @@ void MachineBasicBlock::addSuccessorWithoutProb(MachineBasicBlock *Succ) {
}
void MachineBasicBlock::removeSuccessor(MachineBasicBlock *Succ) {
Succ->removePredecessor(this);
succ_iterator I = std::find(Successors.begin(), Successors.end(), Succ);
assert(I != Successors.end() && "Not a current successor!");
// If Weight list is empty it means we don't use it (disabled optimization).
if (!Weights.empty()) {
weight_iterator WI = getWeightIterator(I);
Weights.erase(WI);
}
// If probability list is empty it means we don't use it (disabled
// optimization).
if (!Probs.empty()) {
probability_iterator WI = getProbabilityIterator(I);
Probs.erase(WI);
}
Successors.erase(I);
removeSuccessor(I);
}
MachineBasicBlock::succ_iterator
@@ -606,10 +591,10 @@ void MachineBasicBlock::replaceSuccessor(MachineBasicBlock *Old,
}
}
assert(OldI != E && "Old is not a successor of this block");
Old->removePredecessor(this);
// If New isn't already a successor, let it take Old's place.
if (NewI == E) {
Old->removePredecessor(this);
New->addPredecessor(this);
*OldI = New;
return;
@@ -617,18 +602,13 @@ void MachineBasicBlock::replaceSuccessor(MachineBasicBlock *Old,
// New is already a successor.
// Update its weight instead of adding a duplicate edge.
if (!Weights.empty()) {
weight_iterator OldWI = getWeightIterator(OldI);
*getWeightIterator(NewI) += *OldWI;
Weights.erase(OldWI);
}
if (!Weights.empty())
*getWeightIterator(NewI) += *getWeightIterator(OldI);
// Update its probability instead of adding a duplicate edge.
if (!Probs.empty()) {
probability_iterator OldPI = getProbabilityIterator(OldI);
*getProbabilityIterator(NewI) += *OldPI;
Probs.erase(OldPI);
}
Successors.erase(OldI);
if (!Probs.empty())
*getProbabilityIterator(NewI) += *getProbabilityIterator(OldI);
removeSuccessor(OldI);
}
void MachineBasicBlock::addPredecessor(MachineBasicBlock *Pred) {