mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-07-23 16:30:00 +00:00
36b699f2b1
This requires a number of steps. 1) Move value_use_iterator into the Value class as an implementation detail 2) Change it to actually be a *Use* iterator rather than a *User* iterator. 3) Add an adaptor which is a User iterator that always looks through the Use to the User. 4) Wrap these in Value::use_iterator and Value::user_iterator typedefs. 5) Add the range adaptors as Value::uses() and Value::users(). 6) Update *all* of the callers to correctly distinguish between whether they wanted a use_iterator (and to explicitly dig out the User when needed), or a user_iterator which makes the Use itself totally opaque. Because #6 requires churning essentially everything that walked the Use-Def chains, I went ahead and added all of the range adaptors and switched them to range-based loops where appropriate. Also because the renaming requires at least churning every line of code, it didn't make any sense to split these up into multiple commits -- all of which would touch all of the same lies of code. The result is still not quite optimal. The Value::use_iterator is a nice regular iterator, but Value::user_iterator is an iterator over User*s rather than over the User objects themselves. As a consequence, it fits a bit awkwardly into the range-based world and it has the weird extra-dereferencing 'operator->' that so many of our iterators have. I think this could be fixed by providing something which transforms a range of T&s into a range of T*s, but that *can* be separated into another patch, and it isn't yet 100% clear whether this is the right move. However, this change gets us most of the benefit and cleans up a substantial amount of code around Use and User. =] git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@203364 91177308-0d34-0410-b5e6-96231b3b80d8
99 lines
3.3 KiB
C++
99 lines
3.3 KiB
C++
//===- ConstantProp.cpp - Code to perform Simple Constant Propagation -----===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file implements constant propagation and merging:
|
|
//
|
|
// Specifically, this:
|
|
// * Converts instructions like "add int 1, 2" into 3
|
|
//
|
|
// Notice that:
|
|
// * This pass has a habit of making definitions be dead. It is a good idea
|
|
// to run a DIE pass sometime after running this pass.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#define DEBUG_TYPE "constprop"
|
|
#include "llvm/Transforms/Scalar.h"
|
|
#include "llvm/ADT/Statistic.h"
|
|
#include "llvm/Analysis/ConstantFolding.h"
|
|
#include "llvm/IR/Constant.h"
|
|
#include "llvm/IR/DataLayout.h"
|
|
#include "llvm/IR/InstIterator.h"
|
|
#include "llvm/IR/Instruction.h"
|
|
#include "llvm/Pass.h"
|
|
#include "llvm/Target/TargetLibraryInfo.h"
|
|
#include <set>
|
|
using namespace llvm;
|
|
|
|
STATISTIC(NumInstKilled, "Number of instructions killed");
|
|
|
|
namespace {
|
|
struct ConstantPropagation : public FunctionPass {
|
|
static char ID; // Pass identification, replacement for typeid
|
|
ConstantPropagation() : FunctionPass(ID) {
|
|
initializeConstantPropagationPass(*PassRegistry::getPassRegistry());
|
|
}
|
|
|
|
bool runOnFunction(Function &F) override;
|
|
|
|
void getAnalysisUsage(AnalysisUsage &AU) const override {
|
|
AU.setPreservesCFG();
|
|
AU.addRequired<TargetLibraryInfo>();
|
|
}
|
|
};
|
|
}
|
|
|
|
char ConstantPropagation::ID = 0;
|
|
INITIALIZE_PASS_BEGIN(ConstantPropagation, "constprop",
|
|
"Simple constant propagation", false, false)
|
|
INITIALIZE_PASS_DEPENDENCY(TargetLibraryInfo)
|
|
INITIALIZE_PASS_END(ConstantPropagation, "constprop",
|
|
"Simple constant propagation", false, false)
|
|
|
|
FunctionPass *llvm::createConstantPropagationPass() {
|
|
return new ConstantPropagation();
|
|
}
|
|
|
|
bool ConstantPropagation::runOnFunction(Function &F) {
|
|
// Initialize the worklist to all of the instructions ready to process...
|
|
std::set<Instruction*> WorkList;
|
|
for(inst_iterator i = inst_begin(F), e = inst_end(F); i != e; ++i) {
|
|
WorkList.insert(&*i);
|
|
}
|
|
bool Changed = false;
|
|
DataLayoutPass *DLP = getAnalysisIfAvailable<DataLayoutPass>();
|
|
const DataLayout *DL = DLP ? &DLP->getDataLayout() : 0;
|
|
TargetLibraryInfo *TLI = &getAnalysis<TargetLibraryInfo>();
|
|
|
|
while (!WorkList.empty()) {
|
|
Instruction *I = *WorkList.begin();
|
|
WorkList.erase(WorkList.begin()); // Get an element from the worklist...
|
|
|
|
if (!I->use_empty()) // Don't muck with dead instructions...
|
|
if (Constant *C = ConstantFoldInstruction(I, DL, TLI)) {
|
|
// Add all of the users of this instruction to the worklist, they might
|
|
// be constant propagatable now...
|
|
for (User *U : I->users())
|
|
WorkList.insert(cast<Instruction>(U));
|
|
|
|
// Replace all of the uses of a variable with uses of the constant.
|
|
I->replaceAllUsesWith(C);
|
|
|
|
// Remove the dead instruction.
|
|
WorkList.erase(I);
|
|
I->eraseFromParent();
|
|
|
|
// We made a change to the function...
|
|
Changed = true;
|
|
++NumInstKilled;
|
|
}
|
|
}
|
|
return Changed;
|
|
}
|