6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-11-02 07:17:36 +00:00
Code Issues Projects Releases Wiki Activity

revert r83814 for now, it is making the llvm-gcc bootstrap unhappy.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@83817 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner
2009-10-11 23:56:08 +00:00
parent 330f6aa2ad
commit b152a87b10
1 changed files with 1 additions and 26 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
lib/Transforms/Scalar/InstructionCombining.cpp
View File

@@ -101,20 +101,6 @@ namespace {
Add(I); Add(I);
} }
/// AddInitialGroup - Add the specified batch of stuff in reverse order.
/// which should only be done when the worklist is empty and when the group
/// has no duplicates.
void AddInitialGroup(Instruction *const *List, unsigned NumEntries) {
assert(Worklist.empty() && "Worklist must be empty to add initial group");
Worklist.reserve(NumEntries+16);
DEBUG(errs() << "IC: ADDING: " << NumEntries << " instrs to worklist\n");
for (; NumEntries; --NumEntries) {
Instruction *I = List[NumEntries-1];
WorklistMap.insert(std::make_pair(I, Worklist.size()));
Worklist.push_back(I);
}
}
// Remove - remove I from the worklist if it exists. // Remove - remove I from the worklist if it exists.
void Remove(Instruction *I) { void Remove(Instruction *I) {
DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I); DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
@@ -12678,9 +12664,6 @@ static void AddReachableCodeToWorklist(BasicBlock *BB,
SmallVector<BasicBlock*, 256> Worklist; SmallVector<BasicBlock*, 256> Worklist;
Worklist.push_back(BB); Worklist.push_back(BB);
std::vector<Instruction*> InstrsForInstCombineWorklist;
InstrsForInstCombineWorklist.reserve(128);
while (!Worklist.empty()) { while (!Worklist.empty()) {
BB = Worklist.back(); BB = Worklist.back();
Worklist.pop_back(); Worklist.pop_back();
@@ -12726,7 +12709,7 @@ static void AddReachableCodeToWorklist(BasicBlock *BB,
DBI_Prev = 0; DBI_Prev = 0;
} }
InstrsForInstCombineWorklist.push_back(Inst); IC.Worklist.Add(Inst);
} }
// Recursively visit successors. If this is a branch or switch on a // Recursively visit successors. If this is a branch or switch on a
@@ -12758,14 +12741,6 @@ static void AddReachableCodeToWorklist(BasicBlock *BB,
for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
Worklist.push_back(TI->getSuccessor(i)); Worklist.push_back(TI->getSuccessor(i));
} }
// Once we've found all of the instructions to add to instcombine's worklist,
// add them in reverse order. This way instcombine will visit from the top
// of the function down. This jives well with the way that it adds all uses
// of instructions to the worklist after doing a transformation, thus avoiding
// some N^2 behavior in pathological cases.
IC.Worklist.AddInitialGroup(&InstrsForInstCombineWorklist[0],
InstrsForInstCombineWorklist.size());
} }
bool InstCombiner::DoOneIteration(Function &F, unsigned Iteration) { bool InstCombiner::DoOneIteration(Function &F, unsigned Iteration) {