summaryrefslogtreecommitdiff
path: root/lib/Analysis/LazyCallGraph.cpp
diff options
context:
space:
mode:
authorChandler Carruth <chandlerc@gmail.com>2014-03-03 10:42:58 +0000
committerChandler Carruth <chandlerc@gmail.com>2014-03-03 10:42:58 +0000
commit3dfabcb249ec77bc9d2cd76e4d64bb0c59527f09 (patch)
treef5f249ec59210cff108db3c467ddc8ad86a1effc /lib/Analysis/LazyCallGraph.cpp
parent26abef7b5a3f239204a1ad605a88b99a1ef878c3 (diff)
downloadllvm-3dfabcb249ec77bc9d2cd76e4d64bb0c59527f09.tar.gz
llvm-3dfabcb249ec77bc9d2cd76e4d64bb0c59527f09.tar.bz2
llvm-3dfabcb249ec77bc9d2cd76e4d64bb0c59527f09.tar.xz
[C++11] Add two range adaptor views to User: operands and
operand_values. The first provides a range view over operand Use objects, and the second provides a range view over the Value*s being used by those operands. The naming is "STL-style" rather than "LLVM-style" because we have historically named iterator methods STL-style, and range methods seem to have far more in common with their iterator counterparts than with "normal" APIs. Feel free to bikeshed on this one if you want, I'm happy to change these around if people feel strongly. I've switched code in SROA and LCG to exercise these mostly to ensure they work correctly -- we don't really have an easy way to unittest this and they're trivial. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@202687 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/LazyCallGraph.cpp')
-rw-r--r--lib/Analysis/LazyCallGraph.cpp14
1 files changed, 5 insertions, 9 deletions
diff --git a/lib/Analysis/LazyCallGraph.cpp b/lib/Analysis/LazyCallGraph.cpp
index 9e0559829d..74eef7b68f 100644
--- a/lib/Analysis/LazyCallGraph.cpp
+++ b/lib/Analysis/LazyCallGraph.cpp
@@ -40,11 +40,9 @@ static void findCallees(
continue;
}
- for (User::value_op_iterator OI = C->value_op_begin(),
- OE = C->value_op_end();
- OI != OE; ++OI)
- if (Visited.insert(cast<Constant>(*OI)))
- Worklist.push_back(cast<Constant>(*OI));
+ for (Value *Op : C->operand_values())
+ if (Visited.insert(cast<Constant>(Op)))
+ Worklist.push_back(cast<Constant>(Op));
}
}
@@ -56,10 +54,8 @@ LazyCallGraph::Node::Node(LazyCallGraph &G, Function &F) : G(G), F(F) {
for (Function::iterator BBI = F.begin(), BBE = F.end(); BBI != BBE; ++BBI)
for (BasicBlock::iterator II = BBI->begin(), IE = BBI->end(); II != IE;
++II)
- for (User::value_op_iterator OI = II->value_op_begin(),
- OE = II->value_op_end();
- OI != OE; ++OI)
- if (Constant *C = dyn_cast<Constant>(*OI))
+ for (Value *Op : II->operand_values())
+ if (Constant *C = dyn_cast<Constant>(Op))
if (Visited.insert(C))
Worklist.push_back(C);