[llvm-commits] CVS: llvm/lib/Analysis/DataStructure/DataStructure.cpp DataStructureOpt.cpp EquivClassGraphs.cpp Local.cpp Steensgaard.cpp
Chris Lattner
lattner at cs.uiuc.edu
Mon Mar 14 20:55:02 PST 2005
Changes in directory llvm/lib/Analysis/DataStructure:
DataStructure.cpp updated: 1.202 -> 1.203
DataStructureOpt.cpp updated: 1.9 -> 1.10
EquivClassGraphs.cpp updated: 1.26 -> 1.27
Local.cpp updated: 1.125 -> 1.126
Steensgaard.cpp updated: 1.45 -> 1.46
---
Log message:
This mega patch converts us from using Function::a{iterator|begin|end} to
using Function::arg_{iterator|begin|end}. Likewise Module::g* -> Module::global_*.
This patch is contributed by Gabor Greif, thanks!
---
Diffs of the changes: (+10 -10)
DataStructure.cpp | 8 ++++----
DataStructureOpt.cpp | 2 +-
EquivClassGraphs.cpp | 4 ++--
Local.cpp | 4 ++--
Steensgaard.cpp | 2 +-
5 files changed, 10 insertions(+), 10 deletions(-)
Index: llvm/lib/Analysis/DataStructure/DataStructure.cpp
diff -u llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.202 llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.203
--- llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.202 Mon Mar 14 22:40:24 2005
+++ llvm/lib/Analysis/DataStructure/DataStructure.cpp Mon Mar 14 22:54:18 2005
@@ -1270,7 +1270,7 @@
void DSGraph::getFunctionArgumentsForCall(Function *F,
std::vector<DSNodeHandle> &Args) const {
Args.push_back(getReturnNodeFor(*F));
- for (Function::aiterator AI = F->abegin(), E = F->aend(); AI != E; ++AI)
+ for (Function::arg_iterator AI = F->arg_begin(), E = F->arg_end(); AI != E; ++AI)
if (isPointerType(AI->getType())) {
Args.push_back(getNodeForValue(AI));
assert(!Args.back().isNull() && "Pointer argument w/o scalarmap entry!?");
@@ -1405,7 +1405,7 @@
DSCallSite DSGraph::getCallSiteForArguments(Function &F) const {
std::vector<DSNodeHandle> Args;
- for (Function::aiterator I = F.abegin(), E = F.aend(); I != E; ++I)
+ for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; ++I)
if (isPointerType(I->getType()))
Args.push_back(getNodeForValue(I));
@@ -1482,7 +1482,7 @@
for (ReturnNodesTy::iterator FI = ReturnNodes.begin(), E =ReturnNodes.end();
FI != E; ++FI) {
Function &F = *FI->first;
- for (Function::aiterator I = F.abegin(), E = F.aend(); I != E; ++I)
+ for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; ++I)
if (isPointerType(I->getType()))
markIncompleteNode(getNodeForValue(I).getNode());
markIncompleteNode(FI->second.getNode());
@@ -2038,7 +2038,7 @@
E = ReturnNodes.end();
RI != E; ++RI) {
Function &F = *RI->first;
- for (Function::aiterator AI = F.abegin(); AI != F.aend(); ++AI)
+ for (Function::arg_iterator AI = F.arg_begin(); AI != F.arg_end(); ++AI)
if (isPointerType(AI->getType()))
assert(!getNodeForValue(AI).isNull() &&
"Pointer argument must be in the scalar map!");
Index: llvm/lib/Analysis/DataStructure/DataStructureOpt.cpp
diff -u llvm/lib/Analysis/DataStructure/DataStructureOpt.cpp:1.9 llvm/lib/Analysis/DataStructure/DataStructureOpt.cpp:1.10
--- llvm/lib/Analysis/DataStructure/DataStructureOpt.cpp:1.9 Sun Jan 9 14:42:52 2005
+++ llvm/lib/Analysis/DataStructure/DataStructureOpt.cpp Mon Mar 14 22:54:18 2005
@@ -59,7 +59,7 @@
const DSGraph::ScalarMapTy &SM = GG.getScalarMap();
bool Changed = false;
- for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
+ for (Module::global_iterator I = M.global_begin(), E = M.global_end(); I != E; ++I)
if (!I->isExternal()) { // Loop over all of the non-external globals...
// Look up the node corresponding to this global, if it exists.
DSNode *GNode = 0;
Index: llvm/lib/Analysis/DataStructure/EquivClassGraphs.cpp
diff -u llvm/lib/Analysis/DataStructure/EquivClassGraphs.cpp:1.26 llvm/lib/Analysis/DataStructure/EquivClassGraphs.cpp:1.27
--- llvm/lib/Analysis/DataStructure/EquivClassGraphs.cpp:1.26 Mon Mar 14 18:58:16 2005
+++ llvm/lib/Analysis/DataStructure/EquivClassGraphs.cpp Mon Mar 14 22:54:18 2005
@@ -215,7 +215,7 @@
// Record the argument nodes for use in merging later below.
std::vector<DSNodeHandle> ArgNodes;
- for (Function::aiterator AI1 = LF->abegin(); AI1 != LF->aend(); ++AI1)
+ for (Function::arg_iterator AI1 = LF->arg_begin(); AI1 != LF->arg_end(); ++AI1)
if (DS::isPointerType(AI1->getType()))
ArgNodes.push_back(MergedG.getNodeForValue(AI1));
@@ -254,7 +254,7 @@
// Merge the function arguments with all argument nodes found so far.
// If there are extra function args, add them to the vector of argNodes
- Function::aiterator AI2 = F->abegin(), AI2end = F->aend();
+ Function::arg_iterator AI2 = F->arg_begin(), AI2end = F->arg_end();
for (unsigned arg=0, numArgs = ArgNodes.size();
arg != numArgs && AI2 != AI2end; ++AI2, ++arg)
if (DS::isPointerType(AI2->getType()))
Index: llvm/lib/Analysis/DataStructure/Local.cpp
diff -u llvm/lib/Analysis/DataStructure/Local.cpp:1.125 llvm/lib/Analysis/DataStructure/Local.cpp:1.126
--- llvm/lib/Analysis/DataStructure/Local.cpp:1.125 Sat Mar 5 13:04:31 2005
+++ llvm/lib/Analysis/DataStructure/Local.cpp Mon Mar 14 22:54:18 2005
@@ -82,7 +82,7 @@
FunctionCalls(&fc) {
// Create scalar nodes for all pointer arguments...
- for (Function::aiterator I = f.abegin(), E = f.aend(); I != E; ++I)
+ for (Function::arg_iterator I = f.arg_begin(), E = f.arg_end(); I != E; ++I)
if (isPointerType(I->getType()))
getValueDest(*I);
@@ -1076,7 +1076,7 @@
GraphBuilder GGB(*GlobalsGraph);
// Add initializers for all of the globals to the globals graph...
- for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
+ for (Module::global_iterator I = M.global_begin(), E = M.global_end(); I != E; ++I)
if (!I->isExternal())
GGB.mergeInGlobalInitializer(I);
}
Index: llvm/lib/Analysis/DataStructure/Steensgaard.cpp
diff -u llvm/lib/Analysis/DataStructure/Steensgaard.cpp:1.45 llvm/lib/Analysis/DataStructure/Steensgaard.cpp:1.46
--- llvm/lib/Analysis/DataStructure/Steensgaard.cpp:1.45 Sun Jan 30 17:51:02 2005
+++ llvm/lib/Analysis/DataStructure/Steensgaard.cpp Mon Mar 14 22:54:18 2005
@@ -94,7 +94,7 @@
// Loop over all pointer arguments, resolving them to their provided pointers
unsigned PtrArgIdx = 0;
- for (Function::aiterator AI = F->abegin(), AE = F->aend();
+ for (Function::arg_iterator AI = F->arg_begin(), AE = F->arg_end();
AI != AE && PtrArgIdx < Call.getNumPtrArgs(); ++AI) {
DSGraph::ScalarMapTy::iterator I = ValMap.find(AI);
if (I != ValMap.end()) // If its a pointer argument...
More information about the llvm-commits
mailing list