0215f6b6cf
I plan to use that to optimize mask creation in VPlan predicator by `or`ing edge masks from the post-dominance frontier instead of all predecessors in a subsequent patch. Note that it would require to use the same unmodified post-dom tree for *all* the basic blocks in a VPlan that is already limited to a particular loopnest so the algorithmic complexity concerns behind the "deprecation" notice in the beggining of `DominanceFrontier.h` (and also discussion in the https://discourse.llvm.org/t/dominance-frontiers/21755 thread) don't apply for my use case (at least to the best of my understanding). The change here is to properly use graph-traits for children traversal plus inline `ForwardDominanceFrontierBase` into `DominanceFrontierBase` now that it's used for post-dom-frontier. Since the only planned use-case is in the vectorizer, I'm adding a VPlan-base unittest along with this change. Support for multiple root nodes via using virtual root node to seed the worklist is left to a subsequent PR.
94 lines
3.0 KiB
C++
94 lines
3.0 KiB
C++
//===- DominanceFrontier.cpp - Dominance Frontier Calculation -------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/Analysis/DominanceFrontier.h"
|
|
#include "llvm/Analysis/DominanceFrontierImpl.h"
|
|
#include "llvm/Config/llvm-config.h"
|
|
#include "llvm/IR/Dominators.h"
|
|
#include "llvm/IR/Function.h"
|
|
#include "llvm/IR/PassManager.h"
|
|
#include "llvm/InitializePasses.h"
|
|
#include "llvm/Pass.h"
|
|
#include "llvm/Support/Compiler.h"
|
|
#include "llvm/Support/raw_ostream.h"
|
|
|
|
using namespace llvm;
|
|
|
|
namespace llvm {
|
|
|
|
template class DominanceFrontierBase<BasicBlock, false>;
|
|
template class DominanceFrontierBase<BasicBlock, true>;
|
|
|
|
} // end namespace llvm
|
|
|
|
char DominanceFrontierWrapperPass::ID = 0;
|
|
|
|
INITIALIZE_PASS_BEGIN(DominanceFrontierWrapperPass, "domfrontier",
|
|
"Dominance Frontier Construction", true, true)
|
|
INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)
|
|
INITIALIZE_PASS_END(DominanceFrontierWrapperPass, "domfrontier",
|
|
"Dominance Frontier Construction", true, true)
|
|
|
|
DominanceFrontierWrapperPass::DominanceFrontierWrapperPass()
|
|
: FunctionPass(ID) {}
|
|
|
|
void DominanceFrontierWrapperPass::releaseMemory() {
|
|
DF.releaseMemory();
|
|
}
|
|
|
|
bool DominanceFrontierWrapperPass::runOnFunction(Function &) {
|
|
releaseMemory();
|
|
DF.analyze(getAnalysis<DominatorTreeWrapperPass>().getDomTree());
|
|
return false;
|
|
}
|
|
|
|
void DominanceFrontierWrapperPass::getAnalysisUsage(AnalysisUsage &AU) const {
|
|
AU.setPreservesAll();
|
|
AU.addRequired<DominatorTreeWrapperPass>();
|
|
}
|
|
|
|
void DominanceFrontierWrapperPass::print(raw_ostream &OS, const Module *) const {
|
|
DF.print(OS);
|
|
}
|
|
|
|
#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
|
|
LLVM_DUMP_METHOD void DominanceFrontierWrapperPass::dump() const {
|
|
print(dbgs());
|
|
}
|
|
#endif
|
|
|
|
/// Handle invalidation explicitly.
|
|
bool DominanceFrontier::invalidate(Function &F, const PreservedAnalyses &PA,
|
|
FunctionAnalysisManager::Invalidator &) {
|
|
// Check whether the analysis, all analyses on functions, or the function's
|
|
// CFG have been preserved.
|
|
auto PAC = PA.getChecker<DominanceFrontierAnalysis>();
|
|
return !(PAC.preserved() || PAC.preservedSet<AllAnalysesOn<Function>>() ||
|
|
PAC.preservedSet<CFGAnalyses>());
|
|
}
|
|
|
|
AnalysisKey DominanceFrontierAnalysis::Key;
|
|
|
|
DominanceFrontier DominanceFrontierAnalysis::run(Function &F,
|
|
FunctionAnalysisManager &AM) {
|
|
DominanceFrontier DF;
|
|
DF.analyze(AM.getResult<DominatorTreeAnalysis>(F));
|
|
return DF;
|
|
}
|
|
|
|
DominanceFrontierPrinterPass::DominanceFrontierPrinterPass(raw_ostream &OS)
|
|
: OS(OS) {}
|
|
|
|
PreservedAnalyses
|
|
DominanceFrontierPrinterPass::run(Function &F, FunctionAnalysisManager &AM) {
|
|
OS << "DominanceFrontier for function: " << F.getName() << "\n";
|
|
AM.getResult<DominanceFrontierAnalysis>(F).print(OS);
|
|
|
|
return PreservedAnalyses::all();
|
|
}
|