1d0244aed7
Reverts 02940d6d2202. Fixes breakage in the modules build. LLVM loops cannot represent irreducible structures in the CFG. This change introduce the concept of cycles as a generalization of loops, along with a CycleInfo analysis that discovers a nested hierarchy of such cycles. This is based on Havlak (1997), Nesting of Reducible and Irreducible Loops. The cycle analysis is implemented as a generic template and then instatiated for LLVM IR and Machine IR. The template relies on a new GenericSSAContext template which must be specialized when used for each IR. This review is a restart of an older review request: https://reviews.llvm.org/D83094 Original implementation by Nicolai Hähnle <nicolai.haehnle@amd.com>, with recent refactoring by Sameer Sahasrabuddhe <sameer.sahasrabuddhe@amd.com> Differential Revision: https://reviews.llvm.org/D112696
78 lines
2.3 KiB
C++
78 lines
2.3 KiB
C++
//===- CycleAnalysis.cpp - Compute CycleInfo for LLVM IR ------------------===//
|
|
//
|
|
// 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/CycleAnalysis.h"
|
|
#include "llvm/ADT/GenericCycleImpl.h"
|
|
#include "llvm/IR/CFG.h"
|
|
#include "llvm/InitializePasses.h"
|
|
|
|
using namespace llvm;
|
|
|
|
template class llvm::GenericCycleInfo<SSAContext>;
|
|
template class llvm::GenericCycle<SSAContext>;
|
|
|
|
CycleInfo CycleAnalysis::run(Function &F, FunctionAnalysisManager &) {
|
|
CycleInfo CI;
|
|
CI.compute(F);
|
|
return CI;
|
|
}
|
|
|
|
AnalysisKey CycleAnalysis::Key;
|
|
|
|
CycleInfoPrinterPass::CycleInfoPrinterPass(raw_ostream &OS) : OS(OS) {}
|
|
|
|
PreservedAnalyses CycleInfoPrinterPass::run(Function &F,
|
|
FunctionAnalysisManager &AM) {
|
|
OS << "CycleInfo for function: " << F.getName() << "\n";
|
|
AM.getResult<CycleAnalysis>(F).print(OS);
|
|
|
|
return PreservedAnalyses::all();
|
|
}
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// CycleInfoWrapperPass Implementation
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The implementation details of the wrapper pass that holds a CycleInfo
|
|
// suitable for use with the legacy pass manager.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
char CycleInfoWrapperPass::ID = 0;
|
|
|
|
CycleInfoWrapperPass::CycleInfoWrapperPass() : FunctionPass(ID) {
|
|
initializeCycleInfoWrapperPassPass(*PassRegistry::getPassRegistry());
|
|
}
|
|
|
|
INITIALIZE_PASS_BEGIN(CycleInfoWrapperPass, "cycles", "Cycle Info Analysis",
|
|
true, true)
|
|
INITIALIZE_PASS_END(CycleInfoWrapperPass, "cycles", "Cycle Info Analysis", true,
|
|
true)
|
|
|
|
void CycleInfoWrapperPass::getAnalysisUsage(AnalysisUsage &AU) const {
|
|
AU.setPreservesAll();
|
|
}
|
|
|
|
bool CycleInfoWrapperPass::runOnFunction(Function &Func) {
|
|
CI.clear();
|
|
|
|
F = &Func;
|
|
CI.compute(Func);
|
|
return false;
|
|
}
|
|
|
|
void CycleInfoWrapperPass::print(raw_ostream &OS, const Module *) const {
|
|
OS << "CycleInfo for function: " << F->getName() << "\n";
|
|
CI.print(OS);
|
|
}
|
|
|
|
void CycleInfoWrapperPass::releaseMemory() {
|
|
CI.clear();
|
|
F = nullptr;
|
|
}
|