RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-25 04:02:41 +01:00
Code Issues Projects Releases Wiki Activity

Remove some unneccesary 'using' directives

Browse Source 
llvm-svn: 4246
This commit is contained in:
Chris Lattner 2002-10-21 13:31:48 +00:00
parent eed53d4b81
commit 01fc78de5f
2 changed files with 4 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
lib/Analysis/DataStructure/DataStructure.cpp
View File

@ -386,7 +386,7 @@ DSGraph::DSGraph(const DSGraph &G) : Func(G.Func) {
DSGraph::~DSGraph() { DSGraph::~DSGraph() {
FunctionCalls.clear(); FunctionCalls.clear();
ValueMap.clear(); ValueMap.clear();
RetNode = 0; RetNode.setNode(0);
#ifndef NDEBUG #ifndef NDEBUG
// Drop all intra-node references, so that assertions don't fail... // Drop all intra-node references, so that assertions don't fail...

8
lib/Analysis/DataStructure/TopDownClosure.cpp
View File

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