da61c865e7
This is a reboot of the original design and implementation by Nicolai Haehnle <nicolai.haehnle@amd.com>: https://reviews.llvm.org/D85603 This change also obsoletes an earlier attempt at restarting the work on convergence tokens: https://reviews.llvm.org/D104504 Changes relative to D85603: 1. Clean up the definition of a "convergent operation", a convergent call and convergent function. 2. Clean up the relationship between dynamic instances, sets of threads and convergence tokens. 3. Redistribute the formal rules into the definitions of the convergence intrinsics. 4. Expand on the semantics of entering a function from outside LLVM, and the environment-defined outcome of the entry intrinsic. 5. Replace the term "cycle" with "closed path". The static rules are defined in terms of closed paths, and then a relation is established with cycles. 6. Specify that if a function contains a controlled convergent operation, then all convergent operations in that function must be controlled. 7. Describe an optional procedure to infer tokens for uncontrolled convergent operations. 8. Introduce controlled maximal convergence-before and controlled m-converged property as an update to the original properties in UniformityAnalysis. 9. Additional constraint that a cycle heart can only occur in the header of a reducible cycle (natural loop). Reviewed By: nhaehnle Differential Revision: https://reviews.llvm.org/D147116
79 lines
2.3 KiB
C++
79 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" // for successors found by ADL in GenericCycleImpl.h
|
|
#include "llvm/InitializePasses.h"
|
|
|
|
using namespace llvm;
|
|
|
|
namespace llvm {
|
|
class Module;
|
|
}
|
|
|
|
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;
|
|
}
|