diff options
| author | Yaron Keren <yaron.keren@gmail.com> | 2015-06-20 07:12:33 +0000 | 
|---|---|---|
| committer | Yaron Keren <yaron.keren@gmail.com> | 2015-06-20 07:12:33 +0000 | 
| commit | 4c548f2dd9b2673e9bf132a6bd4092165af0e3c0 (patch) | |
| tree | 694c60a625a3ec9090111c2e0d923162f59e46ea | |
| parent | 485212f67c971584d4994daf38c70b651682ad3b (diff) | |
| download | bcm5719-llvm-4c548f2dd9b2673e9bf132a6bd4092165af0e3c0.tar.gz bcm5719-llvm-4c548f2dd9b2673e9bf132a6bd4092165af0e3c0.zip  | |
Rangify for loops in Inliner::runOnSCC(), NFC.
llvm-svn: 240215
| -rw-r--r-- | llvm/lib/Transforms/IPO/Inliner.cpp | 20 | 
1 files changed, 9 insertions, 11 deletions
diff --git a/llvm/lib/Transforms/IPO/Inliner.cpp b/llvm/lib/Transforms/IPO/Inliner.cpp index 3832f1073a2..93cdba6f5b5 100644 --- a/llvm/lib/Transforms/IPO/Inliner.cpp +++ b/llvm/lib/Transforms/IPO/Inliner.cpp @@ -438,8 +438,8 @@ bool Inliner::runOnSCC(CallGraphSCC &SCC) {    SmallPtrSet<Function*, 8> SCCFunctions;    DEBUG(dbgs() << "Inliner visiting SCC:"); -  for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { -    Function *F = (*I)->getFunction(); +  for (CallGraphNode *Node : SCC) { +    Function *F = Node->getFunction();      if (F) SCCFunctions.insert(F);      DEBUG(dbgs() << " " << (F ? F->getName() : "INDIRECTNODE"));    } @@ -455,13 +455,13 @@ bool Inliner::runOnSCC(CallGraphSCC &SCC) {    // index into the InlineHistory vector.    SmallVector<std::pair<Function*, int>, 8> InlineHistory; -  for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { -    Function *F = (*I)->getFunction(); +  for (CallGraphNode *Node : SCC) { +    Function *F = Node->getFunction();      if (!F) continue; -    for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) -      for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) { -        CallSite CS(cast<Value>(I)); +    for (BasicBlock &BB : *F) +      for (Instruction &I : BB) { +        CallSite CS(cast<Value>(&I));          // If this isn't a call, or it is a call to an intrinsic, it can          // never be inlined.          if (!CS || isa<IntrinsicInst>(I)) @@ -503,6 +503,7 @@ bool Inliner::runOnSCC(CallGraphSCC &SCC) {      LocalChange = false;      // Iterate over the outer loop because inlining functions can cause indirect      // calls to become direct calls. +    // CallSites may be modified inside so ranged for loop can not be used.      for (unsigned CSi = 0; CSi != CallSites.size(); ++CSi) {        CallSite CS = CallSites[CSi].first; @@ -573,11 +574,8 @@ bool Inliner::runOnSCC(CallGraphSCC &SCC) {            int NewHistoryID = InlineHistory.size();            InlineHistory.push_back(std::make_pair(Callee, InlineHistoryID)); -          for (unsigned i = 0, e = InlineInfo.InlinedCalls.size(); -               i != e; ++i) { -            Value *Ptr = InlineInfo.InlinedCalls[i]; +          for (Value *Ptr : InlineInfo.InlinedCalls)              CallSites.push_back(std::make_pair(CallSite(Ptr), NewHistoryID)); -          }          }        }  | 

