6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-08-18 12:29:21 +00:00
Code Issues Projects Releases Wiki Activity

Final cleanup: remove dead code

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8291 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2003-09-01 18:01:36 +00:00
parent 273328e8e0
commit 758fefc0f0
2 changed files with 0 additions and 78 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

39
lib/Analysis/DataStructure/Parallelize.cpp
View File

@ -33,12 +33,10 @@
#include "llvm/Transforms/Utils/DemoteRegToStack.h"
#include "llvm/Analysis/PgmDependenceGraph.h"
#include "llvm/Analysis/Dominators.h"
#include "llvm/Analysis/DataStructure.h"
#include "llvm/Analysis/DSGraph.h"
#include "llvm/Module.h"
#include "llvm/Instructions.h"
#include "llvm/iTerminators.h"
#include "llvm/DerivedTypes.h"
#include "llvm/Support/InstVisitor.h"
#include "Support/Statistic.h"
@ -48,43 +46,6 @@
#include <functional>
#include <algorithm>
#if 0
void AddToDomSet(vector<BasicBlock*>& domSet, BasicBlock* bb,
const DominatorTree& domTree)
{
DominatorTreeBase::Node* bbNode = domTree.getNode(bb);
const std::vector<Node*>& domKids = bbNode.getChildren();
domSet.insert(domSet.end(), domKids.begin(), domKids.end());
for (unsigned i = 0; i < domKids.size(); ++i)
AddToDomSet(domSet, domKids[i]->getNode(), domTree);
}
bool CheckDominance(Function& func,
const CallInst& callInst1,
const CallInst& callInst2)
{
if (callInst1 == callInst2) // makes sense if this is in a loop but
return false; // we're not handling loops yet
// Check first if one call dominates the other
DominatorSet& domSet = getAnalysis<DominatorSet>(func);
if (domSet.dominates(callInst2, callInst1))
{ // swap callInst1 and callInst2
const CallInst& tmp = callInst2; callInst2 = callInst1; callInst1 = tmp;
}
else if (! domSet.dominates(callInst1, callInst2))
return false; // neither dominates the other:
//
if (! AreIndependent(func, callInst1, callInst2))
return false;
}
#endif
//----------------------------------------------------------------------------
// Global constants used in marking Cilk functions and function calls.
//----------------------------------------------------------------------------

39
lib/Transforms/IPO/Parallelize.cpp
View File

@ -33,12 +33,10 @@
#include "llvm/Transforms/Utils/DemoteRegToStack.h"
#include "llvm/Analysis/PgmDependenceGraph.h"
#include "llvm/Analysis/Dominators.h"
#include "llvm/Analysis/DataStructure.h"
#include "llvm/Analysis/DSGraph.h"
#include "llvm/Module.h"
#include "llvm/Instructions.h"
#include "llvm/iTerminators.h"
#include "llvm/DerivedTypes.h"
#include "llvm/Support/InstVisitor.h"
#include "Support/Statistic.h"
@ -48,43 +46,6 @@
#include <functional>
#include <algorithm>
#if 0
void AddToDomSet(vector<BasicBlock*>& domSet, BasicBlock* bb,
const DominatorTree& domTree)
{
DominatorTreeBase::Node* bbNode = domTree.getNode(bb);
const std::vector<Node*>& domKids = bbNode.getChildren();
domSet.insert(domSet.end(), domKids.begin(), domKids.end());
for (unsigned i = 0; i < domKids.size(); ++i)
AddToDomSet(domSet, domKids[i]->getNode(), domTree);
}
bool CheckDominance(Function& func,
const CallInst& callInst1,
const CallInst& callInst2)
{
if (callInst1 == callInst2) // makes sense if this is in a loop but
return false; // we're not handling loops yet
// Check first if one call dominates the other
DominatorSet& domSet = getAnalysis<DominatorSet>(func);
if (domSet.dominates(callInst2, callInst1))
{ // swap callInst1 and callInst2
const CallInst& tmp = callInst2; callInst2 = callInst1; callInst1 = tmp;
}
else if (! domSet.dominates(callInst1, callInst2))
return false; // neither dominates the other:
//
if (! AreIndependent(func, callInst1, callInst2))
return false;
}
#endif
//----------------------------------------------------------------------------
// Global constants used in marking Cilk functions and function calls.
//----------------------------------------------------------------------------