mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-12-23 20:15:35 +00:00
Use array_pod_sort instead of std::sort for improved code size.
Use SmallVector instead of std::vector for better speed when indirectbr has few successors. llvm-svn: 95879
This commit is contained in:
parent
2e0201ee18
commit
3aca1b0249
@ -2063,11 +2063,11 @@ void SelectionDAGBuilder::visitSwitch(SwitchInst &SI) {
|
||||
|
||||
void SelectionDAGBuilder::visitIndirectBr(IndirectBrInst &I) {
|
||||
// Update machine-CFG edges with unique successors.
|
||||
std::vector<BasicBlock*> succs;
|
||||
SmallVector<BasicBlock*, 32> succs;
|
||||
succs.reserve(I.getNumSuccessors());
|
||||
for (unsigned i = 0, e = I.getNumSuccessors(); i != e; ++i)
|
||||
succs.push_back(I.getSuccessor(i));
|
||||
std::sort(succs.begin(), succs.end());
|
||||
array_pod_sort(succs.begin(), succs.end());
|
||||
succs.erase(std::unique(succs.begin(), succs.end()), succs.end());
|
||||
for (unsigned i = 0, e = succs.size(); i != e; ++i)
|
||||
CurMBB->addSuccessor(FuncInfo.MBBMap[succs[i]]);
|
||||
|
Loading…
Reference in New Issue
Block a user