[llvm-commits] CVS: llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp DSCallSiteIterator.h DataStructure.cpp DataStructureAA.cpp DataStructureOpt.cpp DataStructureStats.cpp GraphChecker.cpp Local.cpp Printer.cpp Steensgaard.cpp TopDownClosure.cpp
Brian Gaeke
gaeke at cs.uiuc.edu
Tue Nov 11 16:45:02 PST 2003
Changes in directory llvm/lib/Analysis/DataStructure:
BottomUpClosure.cpp updated: 1.67 -> 1.68
DSCallSiteIterator.h updated: 1.7 -> 1.8
DataStructure.cpp updated: 1.127 -> 1.128
DataStructureAA.cpp updated: 1.11 -> 1.12
DataStructureOpt.cpp updated: 1.3 -> 1.4
DataStructureStats.cpp updated: 1.8 -> 1.9
GraphChecker.cpp updated: 1.8 -> 1.9
Local.cpp updated: 1.69 -> 1.70
Printer.cpp updated: 1.58 -> 1.59
Steensgaard.cpp updated: 1.33 -> 1.34
TopDownClosure.cpp updated: 1.58 -> 1.59
---
Log message:
Put all LLVM code into the llvm namespace, as per bug 109.
---
Diffs of the changes: (+46 -6)
Index: llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp
diff -u llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp:1.67 llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp:1.68
--- llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp:1.67 Mon Oct 20 14:43:06 2003
+++ llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp Tue Nov 11 16:41:31 2003
@@ -20,6 +20,8 @@
#include "Support/Debug.h"
#include "DSCallSiteIterator.h"
+namespace llvm {
+
namespace {
Statistic<> MaxSCC("budatastructure", "Maximum SCC Size in Call Graph");
Statistic<> NumBUInlines("budatastructures", "Number of graphs inlined");
@@ -316,3 +318,4 @@
//Graph.writeGraphToFile(std::cerr, "bu_" + F.getName());
}
+} // End llvm namespace
Index: llvm/lib/Analysis/DataStructure/DSCallSiteIterator.h
diff -u llvm/lib/Analysis/DataStructure/DSCallSiteIterator.h:1.7 llvm/lib/Analysis/DataStructure/DSCallSiteIterator.h:1.8
--- llvm/lib/Analysis/DataStructure/DSCallSiteIterator.h:1.7 Sat Nov 8 15:55:50 2003
+++ llvm/lib/Analysis/DataStructure/DSCallSiteIterator.h Tue Nov 11 16:41:32 2003
@@ -19,6 +19,8 @@
#include "llvm/Analysis/DSGraph.h"
#include "llvm/Function.h"
+namespace llvm {
+
struct DSCallSiteIterator {
// FCs are the edges out of the current node are the call site targets...
const std::vector<DSCallSite> *FCs;
@@ -128,5 +130,7 @@
DSCallSiteIterator tmp = *this; ++*this; return tmp;
}
};
+
+} // End llvm namespace
#endif
Index: llvm/lib/Analysis/DataStructure/DataStructure.cpp
diff -u llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.127 llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.128
--- llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.127 Tue Nov 11 14:12:32 2003
+++ llvm/lib/Analysis/DataStructure/DataStructure.cpp Tue Nov 11 16:41:32 2003
@@ -23,6 +23,8 @@
#include "Support/Timer.h"
#include <algorithm>
+namespace llvm {
+
namespace {
Statistic<> NumFolds ("dsnode", "Number of nodes completely folded");
Statistic<> NumCallNodesMerged("dsnode", "Number of call nodes merged");
@@ -161,7 +163,6 @@
return getSize() == 1 && Ty == Type::VoidTy && isArray();
}
-
namespace {
/// TypeElementWalker Class - Used for implementation of physical subtyping...
///
@@ -252,7 +253,7 @@
}
}
};
-}
+} // end anonymous namespace
/// ElementTypesAreCompatible - Check to see if the specified types are
/// "physically" compatible. If so, return true, else return false. We only
@@ -1639,6 +1640,7 @@
removeTriviallyDeadNodes();
}
+
/// computeNodeMapping - Given roots in two different DSGraphs, traverse the
/// nodes reachable from the two graphs, computing the mapping of nodes from
/// the first to the second graph.
@@ -1669,3 +1671,4 @@
computeNodeMapping(N1->getLink(i), N2->getLink(N2Idx+i), NodeMap);
}
+} // End llvm namespace
Index: llvm/lib/Analysis/DataStructure/DataStructureAA.cpp
diff -u llvm/lib/Analysis/DataStructure/DataStructureAA.cpp:1.11 llvm/lib/Analysis/DataStructure/DataStructureAA.cpp:1.12
--- llvm/lib/Analysis/DataStructure/DataStructureAA.cpp:1.11 Mon Oct 20 14:43:06 2003
+++ llvm/lib/Analysis/DataStructure/DataStructureAA.cpp Tue Nov 11 16:41:32 2003
@@ -17,6 +17,8 @@
#include "llvm/Analysis/AliasAnalysis.h"
#include "llvm/Module.h"
+namespace llvm {
+
namespace {
class DSAA : public Pass, public AliasAnalysis {
TDDataStructures *TD;
@@ -176,3 +178,5 @@
#endif
return getAnalysis<AliasAnalysis>().getMustAliases(P, RetVals);
}
+
+} // End llvm namespace
Index: llvm/lib/Analysis/DataStructure/DataStructureOpt.cpp
diff -u llvm/lib/Analysis/DataStructure/DataStructureOpt.cpp:1.3 llvm/lib/Analysis/DataStructure/DataStructureOpt.cpp:1.4
--- llvm/lib/Analysis/DataStructure/DataStructureOpt.cpp:1.3 Mon Oct 20 14:43:06 2003
+++ llvm/lib/Analysis/DataStructure/DataStructureOpt.cpp Tue Nov 11 16:41:32 2003
@@ -18,6 +18,8 @@
#include "llvm/Constant.h"
#include "Support/Statistic.h"
+namespace llvm {
+
namespace {
Statistic<>
NumGlobalsConstanted("ds-opt", "Number of globals marked constant");
@@ -47,7 +49,6 @@
RegisterOpt<DSOpt> X("ds-opt", "DSA-based simple optimizations");
}
-
/// OptimizeGlobals - This method uses information taken from DSA to optimize
/// global variables.
///
@@ -96,3 +97,5 @@
}
return Changed;
}
+
+} // End llvm namespace
Index: llvm/lib/Analysis/DataStructure/DataStructureStats.cpp
diff -u llvm/lib/Analysis/DataStructure/DataStructureStats.cpp:1.8 llvm/lib/Analysis/DataStructure/DataStructureStats.cpp:1.9
--- llvm/lib/Analysis/DataStructure/DataStructureStats.cpp:1.8 Mon Oct 20 14:43:06 2003
+++ llvm/lib/Analysis/DataStructure/DataStructureStats.cpp Tue Nov 11 16:41:32 2003
@@ -19,6 +19,8 @@
#include "Support/Statistic.h"
#include <vector>
+namespace llvm {
+
namespace {
Statistic<> TotalNumCallees("totalcallees",
"Total number of callee functions at all indirect call sites");
@@ -139,3 +141,5 @@
visit(F);
return true;
}
+
+} // End llvm namespace
Index: llvm/lib/Analysis/DataStructure/GraphChecker.cpp
diff -u llvm/lib/Analysis/DataStructure/GraphChecker.cpp:1.8 llvm/lib/Analysis/DataStructure/GraphChecker.cpp:1.9
--- llvm/lib/Analysis/DataStructure/GraphChecker.cpp:1.8 Mon Oct 20 14:43:06 2003
+++ llvm/lib/Analysis/DataStructure/GraphChecker.cpp Tue Nov 11 16:41:32 2003
@@ -29,6 +29,8 @@
#include "llvm/Value.h"
#include <set>
+namespace llvm {
+
namespace {
enum DSPass { local, bu, td };
cl::opt<DSPass>
@@ -193,3 +195,5 @@
}
}
}
+
+} // End llvm namespace
Index: llvm/lib/Analysis/DataStructure/Local.cpp
diff -u llvm/lib/Analysis/DataStructure/Local.cpp:1.69 llvm/lib/Analysis/DataStructure/Local.cpp:1.70
--- llvm/lib/Analysis/DataStructure/Local.cpp:1.69 Sat Nov 8 21:32:52 2003
+++ llvm/lib/Analysis/DataStructure/Local.cpp Tue Nov 11 16:41:32 2003
@@ -28,6 +28,8 @@
//
#include "llvm/Module.h"
+namespace llvm {
+
static RegisterAnalysis<LocalDataStructures>
X("datastructure", "Local Data Structure Analysis");
@@ -41,8 +43,8 @@
return false;
}
}
-using namespace DS;
+using namespace DS;
namespace {
cl::opt<bool>
@@ -144,6 +146,8 @@
};
}
+using namespace DS;
+
//===----------------------------------------------------------------------===//
// DSGraph constructor - Simply use the GraphBuilder to construct the local
// graph.
@@ -617,3 +621,5 @@
delete GlobalsGraph;
GlobalsGraph = 0;
}
+
+} // End llvm namespace
Index: llvm/lib/Analysis/DataStructure/Printer.cpp
diff -u llvm/lib/Analysis/DataStructure/Printer.cpp:1.58 llvm/lib/Analysis/DataStructure/Printer.cpp:1.59
--- llvm/lib/Analysis/DataStructure/Printer.cpp:1.58 Mon Oct 20 14:43:06 2003
+++ llvm/lib/Analysis/DataStructure/Printer.cpp Tue Nov 11 16:41:32 2003
@@ -23,6 +23,8 @@
#include <fstream>
#include <sstream>
+namespace llvm {
+
// OnlyPrintMain - The DataStructure printer exposes this option to allow
// printing of only the graph for "main".
//
@@ -32,7 +34,6 @@
Statistic<> NumFoldedNodes ("dsnode", "Number of folded nodes (in final graph)");
}
-
void DSNode::dump() const { print(std::cerr, 0); }
static std::string getCaption(const DSNode *N, const DSGraph *G) {
@@ -280,3 +281,5 @@
void TDDataStructures::print(std::ostream &O, const Module *M) const {
printCollection(*this, O, M, "td.");
}
+
+} // End llvm namespace
Index: llvm/lib/Analysis/DataStructure/Steensgaard.cpp
diff -u llvm/lib/Analysis/DataStructure/Steensgaard.cpp:1.33 llvm/lib/Analysis/DataStructure/Steensgaard.cpp:1.34
--- llvm/lib/Analysis/DataStructure/Steensgaard.cpp:1.33 Sun Nov 2 16:27:28 2003
+++ llvm/lib/Analysis/DataStructure/Steensgaard.cpp Tue Nov 11 16:41:32 2003
@@ -20,6 +20,8 @@
#include "llvm/Module.h"
#include "Support/Debug.h"
+namespace llvm {
+
namespace {
class Steens : public Pass, public AliasAnalysis {
DSGraph *ResultGraph;
@@ -76,7 +78,6 @@
RegisterAnalysisGroup<AliasAnalysis, Steens> Y;
}
-
/// ResolveFunctionCall - Resolve the actual arguments of a call to function F
/// with the specified call site descriptor. This function links the arguments
/// and the return value for the call site context-insensitively.
@@ -235,3 +236,5 @@
//
return getAnalysis<AliasAnalysis>().alias(V1, V1Size, V2, V2Size);
}
+
+} // End llvm namespace
Index: llvm/lib/Analysis/DataStructure/TopDownClosure.cpp
diff -u llvm/lib/Analysis/DataStructure/TopDownClosure.cpp:1.58 llvm/lib/Analysis/DataStructure/TopDownClosure.cpp:1.59
--- llvm/lib/Analysis/DataStructure/TopDownClosure.cpp:1.58 Sat Nov 8 15:17:37 2003
+++ llvm/lib/Analysis/DataStructure/TopDownClosure.cpp Tue Nov 11 16:41:32 2003
@@ -21,6 +21,8 @@
#include "Support/Debug.h"
#include "Support/Statistic.h"
+namespace llvm {
+
namespace {
RegisterAnalysis<TDDataStructures> // Register the pass
Y("tddatastructure", "Top-down Data Structure Analysis");
@@ -310,3 +312,4 @@
<< Graph.getFunctionCalls().size() << "]\n");
}
+} // End llvm namespace
More information about the llvm-commits
mailing list