mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-11-10 17:07:06 +00:00
0b8c9a80f2
into their new header subdirectory: include/llvm/IR. This matches the directory structure of lib, and begins to correct a long standing point of file layout clutter in LLVM. There are still more header files to move here, but I wanted to handle them in separate commits to make tracking what files make sense at each layer easier. The only really questionable files here are the target intrinsic tablegen files. But that's a battle I'd rather not fight today. I've updated both CMake and Makefile build systems (I think, and my tests think, but I may have missed something). I've also re-sorted the includes throughout the project. I'll be committing updates to Clang, DragonEgg, and Polly momentarily. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@171366 91177308-0d34-0410-b5e6-96231b3b80d8
135 lines
4.3 KiB
C++
135 lines
4.3 KiB
C++
//===- DCE.cpp - Code to perform dead code elimination --------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file implements dead inst elimination and dead code elimination.
|
|
//
|
|
// Dead Inst Elimination performs a single pass over the function removing
|
|
// instructions that are obviously dead. Dead Code Elimination is similar, but
|
|
// it rechecks instructions that were used by removed instructions to see if
|
|
// they are newly dead.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#define DEBUG_TYPE "dce"
|
|
#include "llvm/Transforms/Scalar.h"
|
|
#include "llvm/ADT/Statistic.h"
|
|
#include "llvm/IR/Instruction.h"
|
|
#include "llvm/Pass.h"
|
|
#include "llvm/Support/InstIterator.h"
|
|
#include "llvm/Target/TargetLibraryInfo.h"
|
|
#include "llvm/Transforms/Utils/Local.h"
|
|
using namespace llvm;
|
|
|
|
STATISTIC(DIEEliminated, "Number of insts removed by DIE pass");
|
|
STATISTIC(DCEEliminated, "Number of insts removed");
|
|
|
|
namespace {
|
|
//===--------------------------------------------------------------------===//
|
|
// DeadInstElimination pass implementation
|
|
//
|
|
struct DeadInstElimination : public BasicBlockPass {
|
|
static char ID; // Pass identification, replacement for typeid
|
|
DeadInstElimination() : BasicBlockPass(ID) {
|
|
initializeDeadInstEliminationPass(*PassRegistry::getPassRegistry());
|
|
}
|
|
virtual bool runOnBasicBlock(BasicBlock &BB) {
|
|
TargetLibraryInfo *TLI = getAnalysisIfAvailable<TargetLibraryInfo>();
|
|
bool Changed = false;
|
|
for (BasicBlock::iterator DI = BB.begin(); DI != BB.end(); ) {
|
|
Instruction *Inst = DI++;
|
|
if (isInstructionTriviallyDead(Inst, TLI)) {
|
|
Inst->eraseFromParent();
|
|
Changed = true;
|
|
++DIEEliminated;
|
|
}
|
|
}
|
|
return Changed;
|
|
}
|
|
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
|
AU.setPreservesCFG();
|
|
}
|
|
};
|
|
}
|
|
|
|
char DeadInstElimination::ID = 0;
|
|
INITIALIZE_PASS(DeadInstElimination, "die",
|
|
"Dead Instruction Elimination", false, false)
|
|
|
|
Pass *llvm::createDeadInstEliminationPass() {
|
|
return new DeadInstElimination();
|
|
}
|
|
|
|
|
|
namespace {
|
|
//===--------------------------------------------------------------------===//
|
|
// DeadCodeElimination pass implementation
|
|
//
|
|
struct DCE : public FunctionPass {
|
|
static char ID; // Pass identification, replacement for typeid
|
|
DCE() : FunctionPass(ID) {
|
|
initializeDCEPass(*PassRegistry::getPassRegistry());
|
|
}
|
|
|
|
virtual bool runOnFunction(Function &F);
|
|
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
|
AU.setPreservesCFG();
|
|
}
|
|
};
|
|
}
|
|
|
|
char DCE::ID = 0;
|
|
INITIALIZE_PASS(DCE, "dce", "Dead Code Elimination", false, false)
|
|
|
|
bool DCE::runOnFunction(Function &F) {
|
|
TargetLibraryInfo *TLI = getAnalysisIfAvailable<TargetLibraryInfo>();
|
|
|
|
// Start out with all of the instructions in the worklist...
|
|
std::vector<Instruction*> WorkList;
|
|
for (inst_iterator i = inst_begin(F), e = inst_end(F); i != e; ++i)
|
|
WorkList.push_back(&*i);
|
|
|
|
// Loop over the worklist finding instructions that are dead. If they are
|
|
// dead make them drop all of their uses, making other instructions
|
|
// potentially dead, and work until the worklist is empty.
|
|
//
|
|
bool MadeChange = false;
|
|
while (!WorkList.empty()) {
|
|
Instruction *I = WorkList.back();
|
|
WorkList.pop_back();
|
|
|
|
if (isInstructionTriviallyDead(I, TLI)) { // If the instruction is dead.
|
|
// Loop over all of the values that the instruction uses, if there are
|
|
// instructions being used, add them to the worklist, because they might
|
|
// go dead after this one is removed.
|
|
//
|
|
for (User::op_iterator OI = I->op_begin(), E = I->op_end(); OI != E; ++OI)
|
|
if (Instruction *Used = dyn_cast<Instruction>(*OI))
|
|
WorkList.push_back(Used);
|
|
|
|
// Remove the instruction.
|
|
I->eraseFromParent();
|
|
|
|
// Remove the instruction from the worklist if it still exists in it.
|
|
WorkList.erase(std::remove(WorkList.begin(), WorkList.end(), I),
|
|
WorkList.end());
|
|
|
|
MadeChange = true;
|
|
++DCEEliminated;
|
|
}
|
|
}
|
|
return MadeChange;
|
|
}
|
|
|
|
FunctionPass *llvm::createDeadCodeEliminationPass() {
|
|
return new DCE();
|
|
}
|
|
|