diff options
| author | Sanjay Patel <spatel@rotateright.com> | 2016-01-17 23:18:05 +0000 |
|---|---|---|
| committer | Sanjay Patel <spatel@rotateright.com> | 2016-01-17 23:18:05 +0000 |
| commit | 6435c6ede034361f1e4dfdff5b6584418c27cb51 (patch) | |
| tree | ff30c0edbe2d27b05d2069427263df14393b01cf /llvm/lib/Analysis | |
| parent | 9613b29927c53d1116a0579bced7f17cfb9e9277 (diff) | |
| download | bcm5719-llvm-6435c6ede034361f1e4dfdff5b6584418c27cb51.tar.gz bcm5719-llvm-6435c6ede034361f1e4dfdff5b6584418c27cb51.zip | |
fix variable names; NFC
llvm-svn: 258027
Diffstat (limited to 'llvm/lib/Analysis')
| -rw-r--r-- | llvm/lib/Analysis/LoopInfo.cpp | 32 |
1 files changed, 16 insertions, 16 deletions
diff --git a/llvm/lib/Analysis/LoopInfo.cpp b/llvm/lib/Analysis/LoopInfo.cpp index 1ada07c5f70..26c2d08bd7d 100644 --- a/llvm/lib/Analysis/LoopInfo.cpp +++ b/llvm/lib/Analysis/LoopInfo.cpp @@ -274,9 +274,9 @@ void Loop::setLoopID(MDNode *LoopID) const { } bool Loop::isAnnotatedParallel() const { - MDNode *desiredLoopIdMetadata = getLoopID(); + MDNode *DesiredLoopIdMetadata = getLoopID(); - if (!desiredLoopIdMetadata) + if (!DesiredLoopIdMetadata) return false; // The loop branch contains the parallel loop metadata. In order to ensure @@ -293,21 +293,21 @@ bool Loop::isAnnotatedParallel() const { // directly or indirectly through another list metadata (in case of // nested parallel loops). The loop identifier metadata refers to // itself so we can check both cases with the same routine. - MDNode *loopIdMD = + MDNode *LoopIdMD = I.getMetadata(LLVMContext::MD_mem_parallel_loop_access); - if (!loopIdMD) + if (!LoopIdMD) return false; - bool loopIdMDFound = false; - for (const MDOperand &MDOp : loopIdMD->operands()) { - if (MDOp == desiredLoopIdMetadata) { - loopIdMDFound = true; + bool LoopIdMDFound = false; + for (const MDOperand &MDOp : LoopIdMD->operands()) { + if (MDOp == DesiredLoopIdMetadata) { + LoopIdMDFound = true; break; } } - if (!loopIdMDFound) + if (!LoopIdMDFound) return false; } } @@ -332,22 +332,22 @@ Loop::getUniqueExitBlocks(SmallVectorImpl<BasicBlock *> &ExitBlocks) const { assert(hasDedicatedExits() && "getUniqueExitBlocks assumes the loop has canonical form exits!"); - SmallVector<BasicBlock *, 32> switchExitBlocks; + SmallVector<BasicBlock *, 32> SwitchExitBlocks; for (BasicBlock *BB : this->blocks()) { - switchExitBlocks.clear(); + SwitchExitBlocks.clear(); for (BasicBlock *Successor : successors(BB)) { // If block is inside the loop then it is not an exit block. if (contains(Successor)) continue; pred_iterator PI = pred_begin(Successor); - BasicBlock *firstPred = *PI; + BasicBlock *FirstPred = *PI; // If current basic block is this exit block's first predecessor // then only insert exit block in to the output ExitBlocks vector. // This ensures that same exit block is not inserted twice into // ExitBlocks vector. - if (BB != firstPred) + if (BB != FirstPred) continue; // If a terminator has more then two successors, for example SwitchInst, @@ -361,9 +361,9 @@ Loop::getUniqueExitBlocks(SmallVectorImpl<BasicBlock *> &ExitBlocks) const { // In case of multiple edges from current block to exit block, collect // only one edge in ExitBlocks. Use switchExitBlocks to keep track of // duplicate edges. - if (std::find(switchExitBlocks.begin(), switchExitBlocks.end(), Successor) - == switchExitBlocks.end()) { - switchExitBlocks.push_back(Successor); + if (std::find(SwitchExitBlocks.begin(), SwitchExitBlocks.end(), Successor) + == SwitchExitBlocks.end()) { + SwitchExitBlocks.push_back(Successor); ExitBlocks.push_back(Successor); } } |

