Skip to content

Commit

Permalink
[MemorySSA] Port to new pass manager
Browse files Browse the repository at this point in the history
Add support for the new pass manager to MemorySSA pass.

Change MemorySSA to be computed eagerly upon construction.

Change MemorySSAWalker to be owned by the MemorySSA object that creates
it.

Reviewers: dberlin, george.burgess.iv

Subscribers: mcrosier, llvm-commits

Differential Revision: http://reviews.llvm.org/D19664

llvm-svn: 271432
  • Loading branch information
geoffberry committed Jun 1, 2016
1 parent 4753302 commit b96d3b2
Show file tree
Hide file tree
Showing 23 changed files with 132 additions and 124 deletions.
3 changes: 1 addition & 2 deletions llvm/include/llvm/InitializePasses.h
Expand Up @@ -221,8 +221,7 @@ void initializeMemCpyOptPass(PassRegistry&);
void initializeMemDepPrinterPass(PassRegistry&);
void initializeMemDerefPrinterPass(PassRegistry&);
void initializeMemoryDependenceWrapperPassPass(PassRegistry&);
void initializeMemorySSALazyPass(PassRegistry&);
void initializeMemorySSAPrinterPassPass(PassRegistry&);
void initializeMemorySSAWrapperPassPass(PassRegistry&);
void initializeMergedLoadStoreMotionPass(PassRegistry &);
void initializeMetaRenamerPass(PassRegistry&);
void initializeMergeFunctionsPass(PassRegistry&);
Expand Down
72 changes: 36 additions & 36 deletions llvm/include/llvm/Transforms/Utils/MemorySSA.h
Expand Up @@ -495,15 +495,11 @@ class MemorySSAWalker;
/// accesses.
class MemorySSA {
public:
MemorySSA(Function &);
MemorySSA(Function &, AliasAnalysis *, DominatorTree *);
MemorySSA(MemorySSA &&);
~MemorySSA();

/// \brief Build Memory SSA, and return the walker we used during building,
/// for later reuse. If MemorySSA is already built, just return the walker.
MemorySSAWalker *buildMemorySSA(AliasAnalysis *, DominatorTree *);

/// \brief Returns false if you need to call buildMemorySSA.
bool isFinishedBuilding() const { return Walker; }
MemorySSAWalker *getWalker();

/// \brief Given a memory Mod/Ref'ing instruction, get the MemorySSA
/// access associated with it. If passed a basic block gets the memory phi
Expand Down Expand Up @@ -561,7 +557,7 @@ class MemorySSA {
protected:
// Used by Memory SSA annotater, dumpers, and wrapper pass
friend class MemorySSAAnnotatedWriter;
friend class MemorySSAPrinterPass;
friend class MemorySSAPrinterLegacyPass;
void verifyDefUses(Function &F) const;
void verifyDomination(Function &F) const;

Expand Down Expand Up @@ -593,49 +589,51 @@ class MemorySSA {
std::unique_ptr<MemoryAccess> LiveOnEntryDef;

// Memory SSA building info
MemorySSAWalker *Walker;
std::unique_ptr<MemorySSAWalker> Walker;
unsigned NextID;
};

// This pass does eager building and then printing of MemorySSA. It is used by
// the tests to be able to build, dump, and verify Memory SSA.
class MemorySSAPrinterPass : public FunctionPass {
/// An analysis that produces \c MemorySSA for a function.
///
class MemorySSAAnalysis : public AnalysisInfoMixin<MemorySSAAnalysis> {
friend AnalysisInfoMixin<MemorySSAAnalysis>;
static char PassID;

public:
MemorySSAPrinterPass();
typedef MemorySSA Result;

static char ID;
bool doInitialization(Module &M) override;
bool runOnFunction(Function &) override;
void releaseMemory() override;
void getAnalysisUsage(AnalysisUsage &AU) const override;
void print(raw_ostream &OS, const Module *M) const override;
static void registerOptions();
MemorySSA &getMSSA() { return *MSSA; }
MemorySSA run(Function &F, AnalysisManager<Function> &AM);
};

private:
bool VerifyMemorySSA;
/// \brief Printer pass for \c MemorySSA.
class MemorySSAPrinterPass : public PassInfoMixin<MemorySSAPrinterPass> {
raw_ostream &OS;

std::unique_ptr<MemorySSA> MSSA;
// FIXME(gbiv): It seems that MemorySSA doesn't own the walker it returns?
std::unique_ptr<MemorySSAWalker> Walker;
Function *F;
public:
explicit MemorySSAPrinterPass(raw_ostream &OS) : OS(OS) {}
PreservedAnalyses run(Function &F, AnalysisManager<Function> &AM);
};

/// \brief Verifier pass for \c MemorySSA.
struct MemorySSAVerifierPass : PassInfoMixin<MemorySSAVerifierPass> {
PreservedAnalyses run(Function &F, AnalysisManager<Function> &AM);
};

class MemorySSALazy : public FunctionPass {
/// \brief Legacy analysis pass which computes \c MemorySSA.
class MemorySSAWrapperPass : public FunctionPass {
public:
MemorySSALazy();
MemorySSAWrapperPass();

static char ID;
bool runOnFunction(Function &) override;
void releaseMemory() override;
MemorySSA &getMSSA() {
assert(MSSA);
return *MSSA;
}
MemorySSA &getMSSA() { return *MSSA; }
const MemorySSA &getMSSA() const { return *MSSA; }

void getAnalysisUsage(AnalysisUsage &AU) const override {
AU.setPreservesAll();
}
void getAnalysisUsage(AnalysisUsage &AU) const override;

void verifyAnalysis() const override;
void print(raw_ostream &OS, const Module *M = nullptr) const override;

private:
std::unique_ptr<MemorySSA> MSSA;
Expand Down Expand Up @@ -705,6 +703,8 @@ class MemorySSAWalker {
virtual void invalidateInfo(MemoryAccess *) {}

protected:
friend class MemorySSA; // For updating MSSA pointer in MemorySSA move
// constructor.
MemorySSA *MSSA;
};

Expand Down
1 change: 1 addition & 0 deletions llvm/lib/Passes/PassBuilder.cpp
Expand Up @@ -80,6 +80,7 @@
#include "llvm/Transforms/Scalar/SROA.h"
#include "llvm/Transforms/Scalar/SimplifyCFG.h"
#include "llvm/Transforms/Scalar/Sink.h"
#include "llvm/Transforms/Utils/MemorySSA.h"
#include <type_traits>

using namespace llvm;
Expand Down
3 changes: 3 additions & 0 deletions llvm/lib/Passes/PassRegistry.def
Expand Up @@ -86,6 +86,7 @@ FUNCTION_ANALYSIS("domfrontier", DominanceFrontierAnalysis())
FUNCTION_ANALYSIS("loops", LoopAnalysis())
FUNCTION_ANALYSIS("da", DependenceAnalysis())
FUNCTION_ANALYSIS("memdep", MemoryDependenceAnalysis())
FUNCTION_ANALYSIS("memoryssa", MemorySSAAnalysis())
FUNCTION_ANALYSIS("regions", RegionInfoAnalysis())
FUNCTION_ANALYSIS("no-op-function", NoOpFunctionAnalysis())
FUNCTION_ANALYSIS("scalar-evolution", ScalarEvolutionAnalysis())
Expand Down Expand Up @@ -132,6 +133,7 @@ FUNCTION_PASS("print<postdomtree>", PostDominatorTreePrinterPass(dbgs()))
FUNCTION_PASS("print<demanded-bits>", DemandedBitsPrinterPass(dbgs()))
FUNCTION_PASS("print<domfrontier>", DominanceFrontierPrinterPass(dbgs()))
FUNCTION_PASS("print<loops>", LoopPrinterPass(dbgs()))
FUNCTION_PASS("print<memoryssa>", MemorySSAPrinterPass(dbgs()))
FUNCTION_PASS("print<regions>", RegionInfoPrinterPass(dbgs()))
FUNCTION_PASS("print<scalar-evolution>", ScalarEvolutionPrinterPass(dbgs()))
FUNCTION_PASS("reassociate", ReassociatePass())
Expand All @@ -141,6 +143,7 @@ FUNCTION_PASS("sink", SinkingPass())
FUNCTION_PASS("sroa", SROA())
FUNCTION_PASS("verify", VerifierPass())
FUNCTION_PASS("verify<domtree>", DominatorTreeVerifierPass())
FUNCTION_PASS("verify<memoryssa>", MemorySSAVerifierPass())
FUNCTION_PASS("verify<regions>", RegionInfoVerifierPass())
#undef FUNCTION_PASS

Expand Down
120 changes: 55 additions & 65 deletions llvm/lib/Transforms/Utils/MemorySSA.cpp
Expand Up @@ -46,14 +46,12 @@ using namespace llvm;
STATISTIC(NumClobberCacheLookups, "Number of Memory SSA version cache lookups");
STATISTIC(NumClobberCacheHits, "Number of Memory SSA version cache hits");
STATISTIC(NumClobberCacheInserts, "Number of MemorySSA version cache inserts");
INITIALIZE_PASS_WITH_OPTIONS_BEGIN(MemorySSAPrinterPass, "print-memoryssa",
"Memory SSA", true, true)

INITIALIZE_PASS_BEGIN(MemorySSAWrapperPass, "memoryssa", "Memory SSA", true,
true)
INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)
INITIALIZE_PASS_DEPENDENCY(AAResultsWrapperPass)
INITIALIZE_PASS_DEPENDENCY(GlobalsAAWrapperPass)
INITIALIZE_PASS_END(MemorySSAPrinterPass, "print-memoryssa", "Memory SSA", true,
true)
INITIALIZE_PASS(MemorySSALazy, "memoryssalazy", "Memory SSA", true, true)
INITIALIZE_PASS_END(MemorySSAWrapperPass, "memoryssa", "Memory SSA", true, true)

namespace llvm {

Expand Down Expand Up @@ -203,9 +201,22 @@ void MemorySSA::markUnreachableAsLiveOnEntry(BasicBlock *BB) {
}
}

MemorySSA::MemorySSA(Function &Func)
: AA(nullptr), DT(nullptr), F(Func), LiveOnEntryDef(nullptr),
Walker(nullptr), NextID(0) {}
MemorySSA::MemorySSA(Function &Func, AliasAnalysis *AA, DominatorTree *DT)
: AA(AA), DT(DT), F(Func), LiveOnEntryDef(nullptr), Walker(nullptr),
NextID(0) {
getWalker(); // Ensure MemorySSA has been built.
}

MemorySSA::MemorySSA(MemorySSA &&MSSA)
: AA(MSSA.AA), DT(MSSA.DT), F(MSSA.F),
ValueToMemoryAccess(std::move(MSSA.ValueToMemoryAccess)),
PerBlockAccesses(std::move(MSSA.PerBlockAccesses)),
LiveOnEntryDef(std::move(MSSA.LiveOnEntryDef)),
Walker(std::move(MSSA.Walker)), NextID(MSSA.NextID) {
// Update the Walker MSSA pointer so it doesn't point to the moved-from MSSA
// object any more.
Walker->MSSA = this;
}

MemorySSA::~MemorySSA() {
// Drop all our references
Expand All @@ -222,17 +233,11 @@ MemorySSA::AccessListType *MemorySSA::getOrCreateAccessList(BasicBlock *BB) {
return Res.first->second.get();
}

MemorySSAWalker *MemorySSA::buildMemorySSA(AliasAnalysis *AA,
DominatorTree *DT) {
MemorySSAWalker *MemorySSA::getWalker() {
if (Walker)
return Walker;

assert(!this->AA && !this->DT &&
"MemorySSA without a walker already has AA or DT?");
return Walker.get();

Walker = new CachingMemorySSAWalker(this, AA, DT);
this->AA = AA;
this->DT = DT;
Walker = make_unique<CachingMemorySSAWalker>(this, AA, DT);

// We create an access to represent "live on entry", for things like
// arguments or users of globals, where the memory they use is defined before
Expand Down Expand Up @@ -349,7 +354,7 @@ MemorySSAWalker *MemorySSA::buildMemorySSA(AliasAnalysis *AA,
if (!Visited.count(&BB))
markUnreachableAsLiveOnEntry(&BB);

return Walker;
return Walker.get();
}

/// \brief Helper function to create new memory accesses
Expand Down Expand Up @@ -684,69 +689,54 @@ void MemoryAccess::dump() const {
dbgs() << "\n";
}

char MemorySSAPrinterPass::ID = 0;
char MemorySSAAnalysis::PassID;

MemorySSAPrinterPass::MemorySSAPrinterPass() : FunctionPass(ID) {
initializeMemorySSAPrinterPassPass(*PassRegistry::getPassRegistry());
MemorySSA MemorySSAAnalysis::run(Function &F, AnalysisManager<Function> &AM) {
auto &DT = AM.getResult<DominatorTreeAnalysis>(F);
auto &AA = AM.getResult<AAManager>(F);
return MemorySSA(F, &AA, &DT);
}

void MemorySSAPrinterPass::releaseMemory() {
// Subtlety: Be sure to delete the walker before MSSA, because the walker's
// dtor may try to access MemorySSA.
Walker.reset();
MSSA.reset();
}
PreservedAnalyses MemorySSAPrinterPass::run(Function &F,
FunctionAnalysisManager &AM) {
OS << "MemorySSA for function: " << F.getName() << "\n";
AM.getResult<MemorySSAAnalysis>(F).print(OS);

void MemorySSAPrinterPass::getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesAll();
AU.addRequired<AAResultsWrapperPass>();
AU.addRequired<DominatorTreeWrapperPass>();
AU.addPreserved<DominatorTreeWrapperPass>();
AU.addPreserved<GlobalsAAWrapperPass>();
return PreservedAnalyses::all();
}

bool MemorySSAPrinterPass::doInitialization(Module &M) {
VerifyMemorySSA = M.getContext()
.getOption<bool, MemorySSAPrinterPass,
&MemorySSAPrinterPass::VerifyMemorySSA>();
return false;
}
PreservedAnalyses MemorySSAVerifierPass::run(Function &F,
FunctionAnalysisManager &AM) {
AM.getResult<MemorySSAAnalysis>(F).verifyMemorySSA();

void MemorySSAPrinterPass::registerOptions() {
OptionRegistry::registerOption<bool, MemorySSAPrinterPass,
&MemorySSAPrinterPass::VerifyMemorySSA>(
"verify-memoryssa", "Run the Memory SSA verifier", false);
return PreservedAnalyses::all();
}

void MemorySSAPrinterPass::print(raw_ostream &OS, const Module *M) const {
MSSA->print(OS);
}
char MemorySSAWrapperPass::ID = 0;

bool MemorySSAPrinterPass::runOnFunction(Function &F) {
this->F = &F;
MSSA.reset(new MemorySSA(F));
AliasAnalysis *AA = &getAnalysis<AAResultsWrapperPass>().getAAResults();
DominatorTree *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
Walker.reset(MSSA->buildMemorySSA(AA, DT));
MemorySSAWrapperPass::MemorySSAWrapperPass() : FunctionPass(ID) {
initializeMemorySSAWrapperPassPass(*PassRegistry::getPassRegistry());
}

if (VerifyMemorySSA) {
MSSA->verifyMemorySSA();
}
void MemorySSAWrapperPass::releaseMemory() { MSSA.reset(); }

return false;
void MemorySSAWrapperPass::getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesAll();
AU.addRequiredTransitive<DominatorTreeWrapperPass>();
AU.addRequiredTransitive<AAResultsWrapperPass>();
}

char MemorySSALazy::ID = 0;

MemorySSALazy::MemorySSALazy() : FunctionPass(ID) {
initializeMemorySSALazyPass(*PassRegistry::getPassRegistry());
bool MemorySSAWrapperPass::runOnFunction(Function &F) {
auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
auto &AA = getAnalysis<AAResultsWrapperPass>().getAAResults();
MSSA.reset(new MemorySSA(F, &AA, &DT));
return false;
}

void MemorySSALazy::releaseMemory() { MSSA.reset(); }
void MemorySSAWrapperPass::verifyAnalysis() const { MSSA->verifyMemorySSA(); }

bool MemorySSALazy::runOnFunction(Function &F) {
MSSA.reset(new MemorySSA(F));
return false;
void MemorySSAWrapperPass::print(raw_ostream &OS, const Module *M) const {
MSSA->print(OS);
}

MemorySSAWalker::MemorySSAWalker(MemorySSA *M) : MSSA(M) {}
Expand Down
3 changes: 1 addition & 2 deletions llvm/lib/Transforms/Utils/Utils.cpp
Expand Up @@ -33,8 +33,7 @@ void llvm::initializeTransformUtils(PassRegistry &Registry) {
initializeUnifyFunctionExitNodesPass(Registry);
initializeInstSimplifierPass(Registry);
initializeMetaRenamerPass(Registry);
initializeMemorySSALazyPass(Registry);
initializeMemorySSAPrinterPassPass(Registry);
initializeMemorySSAWrapperPassPass(Registry);
}

/// LLVMInitializeTransformUtils - C binding for initializeTransformUtilsPasses.
Expand Down
3 changes: 2 additions & 1 deletion llvm/test/Transforms/Util/MemorySSA/assume.ll
@@ -1,4 +1,5 @@
; RUN: opt -basicaa -print-memoryssa -verify-memoryssa -analyze < %s 2>&1 | FileCheck %s
; RUN: opt -basicaa -memoryssa -analyze < %s 2>&1 | FileCheck %s
; RUN: opt -aa-pipeline=basic-aa -passes='print<memoryssa>,verify<memoryssa>' -disable-output < %s 2>&1 | FileCheck %s
;
; Ensures that assumes are treated as not reading or writing memory.

Expand Down
3 changes: 2 additions & 1 deletion llvm/test/Transforms/Util/MemorySSA/atomic-clobber.ll
@@ -1,4 +1,5 @@
; RUN: opt -basicaa -print-memoryssa -verify-memoryssa -analyze < %s 2>&1 | FileCheck %s
; RUN: opt -basicaa -memoryssa -analyze < %s 2>&1 | FileCheck %s
; RUN: opt -aa-pipeline=basic-aa -passes='print<memoryssa>,verify<memoryssa>' -disable-output < %s 2>&1 | FileCheck %s
;
; Ensures that atomic loads count as MemoryDefs

Expand Down
3 changes: 2 additions & 1 deletion llvm/test/Transforms/Util/MemorySSA/cyclicphi.ll
@@ -1,4 +1,5 @@
; RUN: opt -basicaa -print-memoryssa -verify-memoryssa -analyze < %s 2>&1 | FileCheck %s
; RUN: opt -basicaa -memoryssa -analyze < %s 2>&1 | FileCheck %s
; RUN: opt -aa-pipeline=basic-aa -passes='print<memoryssa>,verify<memoryssa>' -disable-output < %s 2>&1 | FileCheck %s

%struct.hoge = type { i32, %struct.widget }
%struct.widget = type { i64 }
Expand Down
3 changes: 2 additions & 1 deletion llvm/test/Transforms/Util/MemorySSA/function-clobber.ll
@@ -1,4 +1,5 @@
; RUN: opt -basicaa -print-memoryssa -verify-memoryssa -analyze < %s 2>&1 | FileCheck %s
; RUN: opt -basicaa -memoryssa -analyze < %s 2>&1 | FileCheck %s
; RUN: opt -aa-pipeline=basic-aa -passes='print<memoryssa>,verify<memoryssa>' -disable-output < %s 2>&1 | FileCheck %s
;
; Ensuring that external functions without attributes are MemoryDefs

Expand Down
3 changes: 2 additions & 1 deletion llvm/test/Transforms/Util/MemorySSA/function-mem-attrs.ll
@@ -1,4 +1,5 @@
; RUN: opt -basicaa -print-memoryssa -verify-memoryssa -analyze < %s 2>&1 | FileCheck %s
; RUN: opt -basicaa -memoryssa -analyze < %s 2>&1 | FileCheck %s
; RUN: opt -aa-pipeline=basic-aa -passes='print<memoryssa>,verify<memoryssa>' -disable-output < %s 2>&1 | FileCheck %s
;
; Test that various function attributes give us sane results.

Expand Down
3 changes: 2 additions & 1 deletion llvm/test/Transforms/Util/MemorySSA/livein.ll
@@ -1,4 +1,5 @@
; RUN: opt -basicaa -print-memoryssa -verify-memoryssa -analyze < %s 2>&1 | FileCheck %s
; RUN: opt -basicaa -memoryssa -analyze < %s 2>&1 | FileCheck %s
; RUN: opt -aa-pipeline=basic-aa -passes='print<memoryssa>,verify<memoryssa>' -disable-output < %s 2>&1 | FileCheck %s
define void @F(i8*) {
br i1 true, label %left, label %right
left:
Expand Down
3 changes: 2 additions & 1 deletion llvm/test/Transforms/Util/MemorySSA/load-invariant.ll
@@ -1,5 +1,6 @@
; XFAIL: *
; RUN: opt -basicaa -print-memoryssa -verify-memoryssa -analyze < %s 2>&1 | FileCheck %s
; RUN: opt -basicaa -memoryssa -analyze < %s 2>&1 | FileCheck %s
; RUN: opt -aa-pipeline=basic-aa -passes='print<memoryssa>' -verify-memoryssa -disable-output < %s 2>&1 | FileCheck %s
;
; Invariant loads should be considered live on entry, because, once the
; location is known to be dereferenceable, the value can never change.
Expand Down

0 comments on commit b96d3b2

Please sign in to comment.