commit 13ec72a12aaf5bc717082fd70ebd388bac64ecaf
author Chris Lattner <sabre@nondot.org> Mon Oct 21 13:31:48 2002 +0000
committer Chris Lattner <sabre@nondot.org> Mon Oct 21 13:31:48 2002 +0000
tree b966493ee4e279f46b9515c609ab659f1b37356b
parent 756a55000be056a8c6e11adaa8c19d5a06d03291

Remove some unneccesary 'using' directives


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@4246 91177308-0d34-0410-b5e6-96231b3b80d8

lib/Analysis/DataStructure/DataStructure.cpp

diff --git a/lib/Analysis/DataStructure/DataStructure.cpp b/lib/Analysis/DataStructure/DataStructure.cpp
index b75d8dc..d40be44 100644
--- a/lib/Analysis/DataStructure/DataStructure.cpp
+++ b/lib/Analysis/DataStructure/DataStructure.cpp
@@ -386,7 +386,7 @@
 DSGraph::~DSGraph() {
   FunctionCalls.clear();
   ValueMap.clear();
-  RetNode = 0;
+  RetNode.setNode(0);
 
 #ifndef NDEBUG
   // Drop all intra-node references, so that assertions don't fail...

lib/Analysis/DataStructure/TopDownClosure.cpp

diff --git a/lib/Analysis/DataStructure/TopDownClosure.cpp b/lib/Analysis/DataStructure/TopDownClosure.cpp
index 7db811d..e8a720e 100644
--- a/lib/Analysis/DataStructure/TopDownClosure.cpp
+++ b/lib/Analysis/DataStructure/TopDownClosure.cpp
@@ -12,8 +12,6 @@
 #include "llvm/Module.h"
 #include "llvm/DerivedTypes.h"
 #include "Support/Statistic.h"
-using std::map;
-using std::vector;
 
 static RegisterAnalysis<TDDataStructures>
 Y("tddatastructure", "Top-down Data Structure Analysis Closure");
@@ -22,7 +20,7 @@
 // our memory... here...
 //
 void TDDataStructures::releaseMemory() {
-  for (map<const Function*, DSGraph*>::iterator I = DSInfo.begin(),
+  for (std::map<const Function*, DSGraph*>::iterator I = DSInfo.begin(),
          E = DSInfo.end(); I != E; ++I)
     delete I->second;
 
@@ -86,7 +84,7 @@
   DSGraph &BUGraph = BU.getDSGraph(F);
   Graph = new DSGraph(BUGraph);
 
-  const vector<DSCallSite> *CallSitesP = BU.getCallSites(F);
+  const std::vector<DSCallSite> *CallSitesP = BU.getCallSites(F);
   if (CallSitesP == 0) {
     DEBUG(std::cerr << "  [TD] No callers for: " << F.getName() << "\n");
     return *Graph;  // If no call sites, the graph is the same as the BU graph!
@@ -96,7 +94,7 @@
   // graph.
   //
   DEBUG(std::cerr << "  [TD] Inlining callers for: " << F.getName() << "\n");
-  const vector<DSCallSite> &CallSites = *CallSitesP;
+  const std::vector<DSCallSite> &CallSites = *CallSitesP;
   for (unsigned c = 0, ce = CallSites.size(); c != ce; ++c) {
     const DSCallSite &CallSite = CallSites[c];  // Copy
     Function &Caller = CallSite.getCaller();