This is an archive of the discontinued LLVM Phabricator instance.

Differential D17571

Introduce RegionInfoAnalysis, which compute Region Tree in the new PassManager. NFC
ClosedPublic

Authored by etherzhhb on Feb 24 2016, 6:51 AM.

Details

Reviewers
chandlerc
grosser
jdoerfert
Commits
rGbc53977a0dec: Introduce RegionInfoAnalysis, which compute Region Tree in the new PassManager.
rG2fa386fd6c29: Introduce RegionInfoAnalysis, which compute Region Tree in the new PassManager.
rL261904: Introduce RegionInfoAnalysis, which compute Region Tree in the new…
rL261884: Introduce RegionInfoAnalysis, which compute Region Tree in the new…
Summary

I am going to introduce the analysis passes to compute PostDominators, DominanceFrontier and RegionInfo in the new pass manager, such that later we can rewrite passes in Polly in new pass manager style and make interprocedural analysis in Polly become easier.

This is the RegionInfo part.

Diff Detail

Repository
rL LLVM

Event Timeline

etherzhhb updated this revision to Diff 48928.Feb 24 2016, 6:51 AM
etherzhhb retitled this revision from to Introduce RegionInfoAnalysis, which compute Region Tree in the new PassManager. NFC.
etherzhhb updated this object.
etherzhhb added reviewers: chandlerc, grosser, jdoerfert.
etherzhhb set the repository for this revision to rL LLVM.
etherzhhb added a project: Restricted Project.
etherzhhb added parent revisions: D17570: Introduce DominanceFrontierAnalysis to the new PassManager to compute DominanceFrontier. NFC, D17537: Introduce analysis pass to compute PostDominators in the new pass manager. NFC.
etherzhhb added a subscriber: llvm-commits.
grosser accepted this revision.Feb 25 2016, 5:18 AM
grosser edited edge metadata.

This seems to be straightforward as well. Thanks for contributing these self-contained patches.

include/llvm/Analysis/RegionInfo.h
690 ↗(On Diff #48928)

Newline between functions.

This revision is now accepted and ready to land.Feb 25 2016, 5:18 AM
Closed by commit rL261884: Introduce RegionInfoAnalysis, which compute Region Tree in the new… (authored by ether). · Explain WhyFeb 25 2016, 8:38 AM
This revision was automatically updated to reflect the committed changes.

Revision Contents

Diff 49072

llvm/trunk/include/llvm/Analysis/RegionInfo.h

Show First 20 Lines • Show All 41 Lines • ▼ Show 20 Lines
#include "llvm/IR/CFG.h" #include "llvm/IR/CFG.h"
#include "llvm/IR/Dominators.h" #include "llvm/IR/Dominators.h"
#include <map> #include <map>
#include <memory> #include <memory>
#include <set> #include <set>
namespace llvm { namespace llvm {
// FIXME: Replace this brittle forward declaration with the include of the new
// PassManager.h when doing so doesn't break the PassManagerBuilder.
template <typename IRUnitT> class AnalysisManager;
class PreservedAnalyses;
// Class to be specialized for different users of RegionInfo // Class to be specialized for different users of RegionInfo
// (i.e. BasicBlocks or MachineBasicBlocks). This is only to avoid needing to // (i.e. BasicBlocks or MachineBasicBlocks). This is only to avoid needing to
// pass around an unreasonable number of template parameters. // pass around an unreasonable number of template parameters.
template <class FuncT_> template <class FuncT_>
struct RegionTraits { struct RegionTraits {
// FuncT // FuncT
// BlockT // BlockT
// RegionT // RegionT
▲ Show 20 Lines • Show All 613 Lines • ▼ Show 20 Linesclass RegionInfoBase {
typedef SmallPtrSet<RegionT *, 4> RegionSet; typedef SmallPtrSet<RegionT *, 4> RegionSet;
RegionInfoBase(); RegionInfoBase();
virtual ~RegionInfoBase(); virtual ~RegionInfoBase();
RegionInfoBase(const RegionInfoBase &) = delete; RegionInfoBase(const RegionInfoBase &) = delete;
const RegionInfoBase &operator=(const RegionInfoBase &) = delete; const RegionInfoBase &operator=(const RegionInfoBase &) = delete;
RegionInfoBase(RegionInfoBase &&Arg)
: DT(std::move(Arg.DT)), PDT(std::move(Arg.PDT)), DF(std::move(Arg.DF)),
TopLevelRegion(std::move(Arg.TopLevelRegion)),
BBtoRegion(std::move(Arg.BBtoRegion)) {
Arg.wipe();
}
RegionInfoBase &operator=(RegionInfoBase &&RHS) {
DT = std::move(RHS.DT);
PDT = std::move(RHS.PDT);
DF = std::move(RHS.DF);
TopLevelRegion = std::move(RHS.TopLevelRegion);
BBtoRegion = std::move(RHS.BBtoRegion);
RHS.wipe();
return *this;
}
DomTreeT *DT; DomTreeT *DT;
PostDomTreeT *PDT; PostDomTreeT *PDT;
DomFrontierT *DF; DomFrontierT *DF;
/// The top level region. /// The top level region.
RegionT *TopLevelRegion; RegionT *TopLevelRegion;
private: private:
/// Map every BB to the smallest region, that contains BB. /// Map every BB to the smallest region, that contains BB.
BBtoRegionMap BBtoRegion; BBtoRegionMap BBtoRegion;
/// \brief Wipe this region tree's state without releasing any resources.
///
/// This is essentially a post-move helper only. It leaves the object in an
/// assignable and destroyable state, but otherwise invalid.
void wipe() {
DT = nullptr;
PDT = nullptr;
DF = nullptr;
TopLevelRegion = nullptr;
BBtoRegion.clear();
}
// Check whether the entries of BBtoRegion for the BBs of region // Check whether the entries of BBtoRegion for the BBs of region
// SR are correct. Triggers an assertion if not. Calls itself recursively for // SR are correct. Triggers an assertion if not. Calls itself recursively for
// subregions. // subregions.
void verifyBBMap(const RegionT *SR) const; void verifyBBMap(const RegionT *SR) const;
// Returns true if BB is in the dominance frontier of // Returns true if BB is in the dominance frontier of
// entry, because it was inherited from exit. In the other case there is an // entry, because it was inherited from exit. In the other case there is an
// edge going from entry to BB without passing exit. // edge going from entry to BB without passing exit.
▲ Show 20 Lines • Show All 133 Lines • ▼ Show 20 Linespublic:
bool operator==(const RegionNode &RN) const { bool operator==(const RegionNode &RN) const {
return &RN == reinterpret_cast<const RegionNode *>(this); return &RN == reinterpret_cast<const RegionNode *>(this);
} }
}; };
class RegionInfo : public RegionInfoBase<RegionTraits<Function>> { class RegionInfo : public RegionInfoBase<RegionTraits<Function>> {
public: public:
typedef RegionInfoBase<RegionTraits<Function>> Base;
explicit RegionInfo(); explicit RegionInfo();
~RegionInfo() override; ~RegionInfo() override;
RegionInfo(RegionInfo &&Arg)
: Base(std::move(static_cast<Base &>(Arg))) {}
RegionInfo &operator=(RegionInfo &&RHS) {
Base::operator=(std::move(static_cast<Base &>(RHS)));
return *this;
}
// updateStatistics - Update statistic about created regions. // updateStatistics - Update statistic about created regions.
void updateStatistics(Region *R) final; void updateStatistics(Region *R) final;
void recalculate(Function &F, DominatorTree *DT, PostDominatorTree *PDT, void recalculate(Function &F, DominatorTree *DT, PostDominatorTree *PDT,
DominanceFrontier *DF); DominanceFrontier *DF);
#ifndef NDEBUG #ifndef NDEBUG
/// @brief Opens a viewer to show the GraphViz visualization of the regions. /// @brief Opens a viewer to show the GraphViz visualization of the regions.
Show All 28 Linespublic:
void releaseMemory() override; void releaseMemory() override;
void verifyAnalysis() const override; void verifyAnalysis() const override;
void getAnalysisUsage(AnalysisUsage &AU) const override; void getAnalysisUsage(AnalysisUsage &AU) const override;
void print(raw_ostream &OS, const Module *) const override; void print(raw_ostream &OS, const Module *) const override;
void dump() const; void dump() const;
//@} //@}
}; };
/// \brief Analysis pass that exposes the \c RegionInfo for a function.
class RegionInfoAnalysis {
static char PassID;
public:
typedef RegionInfo Result;
/// \brief Opaque, unique identifier for this analysis pass.
static void *ID() { return (void *)&PassID; }
/// \brief Provide a name for the analysis for debugging and logging.
static StringRef name() { return "RegionInfoAnalysis"; }
RegionInfo run(Function &F, AnalysisManager<Function> *AM);
};
/// \brief Printer pass for the \c RegionInfo.
class RegionInfoPrinterPass {
raw_ostream &OS;
public:
explicit RegionInfoPrinterPass(raw_ostream &OS);
PreservedAnalyses run(Function &F, AnalysisManager<Function> *AM);
static StringRef name() { return "RegionInfoPrinterPass"; }
};
/// \brief Verifier pass for the \c RegionInfo.
struct RegionInfoVerifierPass {
PreservedAnalyses run(Function &F, AnalysisManager<Function> *AM);
static StringRef name() { return "RegionInfoVerifierPass"; }
};
template <> template <>
template <> template <>
inline BasicBlock * inline BasicBlock *
RegionNodeBase<RegionTraits<Function>>::getNodeAs<BasicBlock>() const { RegionNodeBase<RegionTraits<Function>>::getNodeAs<BasicBlock>() const {
assert(!isSubRegion() && "This is not a BasicBlock RegionNode!"); assert(!isSubRegion() && "This is not a BasicBlock RegionNode!");
return getEntry(); return getEntry();
} }
Show All 27 Lines

llvm/trunk/lib/Analysis/RegionInfo.cpp

Show All 9 Lines
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
#include "llvm/Analysis/RegionInfo.h" #include "llvm/Analysis/RegionInfo.h"
#include "llvm/ADT/PostOrderIterator.h" #include "llvm/ADT/PostOrderIterator.h"
#include "llvm/ADT/Statistic.h" #include "llvm/ADT/Statistic.h"
#include "llvm/Analysis/LoopInfo.h" #include "llvm/Analysis/LoopInfo.h"
#include "llvm/Analysis/RegionInfoImpl.h" #include "llvm/Analysis/RegionInfoImpl.h"
#include "llvm/Analysis/RegionIterator.h" #include "llvm/Analysis/RegionIterator.h"
#include "llvm/IR/PassManager.h"
#include "llvm/Support/CommandLine.h" #include "llvm/Support/CommandLine.h"
#include "llvm/Support/Debug.h" #include "llvm/Support/Debug.h"
#include "llvm/Support/ErrorHandling.h" #include "llvm/Support/ErrorHandling.h"
#include <algorithm> #include <algorithm>
#include <iterator> #include <iterator>
#include <set> #include <set>
#ifndef NDEBUG #ifndef NDEBUG
#include "llvm/Analysis/RegionPrinter.h" #include "llvm/Analysis/RegionPrinter.h"
▲ Show 20 Lines • Show All 149 Lines • ▼ Show 20 Lines
// the link time optimization. // the link time optimization.
namespace llvm { namespace llvm {
FunctionPass *createRegionInfoPass() { FunctionPass *createRegionInfoPass() {
return new RegionInfoPass(); return new RegionInfoPass();
} }
} }
//===----------------------------------------------------------------------===//
// RegionInfoAnalysis implementation
//
char RegionInfoAnalysis::PassID;
RegionInfo RegionInfoAnalysis::run(Function &F, AnalysisManager<Function> *AM) {
RegionInfo RI;
auto *DT = &AM->getResult<DominatorTreeAnalysis>(F);
auto *PDT = &AM->getResult<PostDominatorTreeAnalysis>(F);
auto *DF = &AM->getResult<DominanceFrontierAnalysis>(F);
RI.recalculate(F, DT, PDT, DF);
return RI;
}
RegionInfoPrinterPass::RegionInfoPrinterPass(raw_ostream &OS)
: OS(OS) {}
PreservedAnalyses
RegionInfoPrinterPass::run(Function &F, FunctionAnalysisManager *AM) {
OS << "Region Tree for function: " << F.getName() << "\n";
AM->getResult<RegionInfoAnalysis>(F).print(OS);
return PreservedAnalyses::all();
}
PreservedAnalyses RegionInfoVerifierPass::run(Function &F,
AnalysisManager<Function> *AM) {
AM->getResult<RegionInfoAnalysis>(F).verifyAnalysis();
return PreservedAnalyses::all();
}

llvm/trunk/lib/Passes/PassBuilder.cpp

Show All 20 Lines
#include "llvm/Analysis/AssumptionCache.h" #include "llvm/Analysis/AssumptionCache.h"
#include "llvm/Analysis/BasicAliasAnalysis.h" #include "llvm/Analysis/BasicAliasAnalysis.h"
#include "llvm/Analysis/CFLAliasAnalysis.h" #include "llvm/Analysis/CFLAliasAnalysis.h"
#include "llvm/Analysis/CGSCCPassManager.h" #include "llvm/Analysis/CGSCCPassManager.h"
#include "llvm/Analysis/DominanceFrontier.h" #include "llvm/Analysis/DominanceFrontier.h"
#include "llvm/Analysis/LazyCallGraph.h" #include "llvm/Analysis/LazyCallGraph.h"
#include "llvm/Analysis/LoopInfo.h" #include "llvm/Analysis/LoopInfo.h"
#include "llvm/Analysis/PostDominators.h" #include "llvm/Analysis/PostDominators.h"
#include "llvm/Analysis/RegionInfo.h"
#include "llvm/Analysis/ScalarEvolution.h" #include "llvm/Analysis/ScalarEvolution.h"
#include "llvm/Analysis/ScalarEvolutionAliasAnalysis.h" #include "llvm/Analysis/ScalarEvolutionAliasAnalysis.h"
#include "llvm/Analysis/ScopedNoAliasAA.h" #include "llvm/Analysis/ScopedNoAliasAA.h"
#include "llvm/Analysis/TargetLibraryInfo.h" #include "llvm/Analysis/TargetLibraryInfo.h"
#include "llvm/Analysis/TargetTransformInfo.h" #include "llvm/Analysis/TargetTransformInfo.h"
#include "llvm/Analysis/TypeBasedAliasAnalysis.h" #include "llvm/Analysis/TypeBasedAliasAnalysis.h"
#include "llvm/IR/Dominators.h" #include "llvm/IR/Dominators.h"
#include "llvm/IR/IRPrintingPasses.h" #include "llvm/IR/IRPrintingPasses.h"
▲ Show 20 Lines • Show All 536 Lines • Show Last 20 Lines

llvm/trunk/lib/Passes/PassRegistry.def

Show First 20 Lines • Show All 54 Lines • ▼ Show 20 Lines
#define FUNCTION_ANALYSIS(NAME, CREATE_PASS) #define FUNCTION_ANALYSIS(NAME, CREATE_PASS)
#endif #endif
FUNCTION_ANALYSIS("aa", AAManager()) FUNCTION_ANALYSIS("aa", AAManager())
FUNCTION_ANALYSIS("assumptions", AssumptionAnalysis()) FUNCTION_ANALYSIS("assumptions", AssumptionAnalysis())
FUNCTION_ANALYSIS("domtree", DominatorTreeAnalysis()) FUNCTION_ANALYSIS("domtree", DominatorTreeAnalysis())
FUNCTION_ANALYSIS("postdomtree", PostDominatorTreeAnalysis()) FUNCTION_ANALYSIS("postdomtree", PostDominatorTreeAnalysis())
FUNCTION_ANALYSIS("domfrontier", DominanceFrontierAnalysis()) FUNCTION_ANALYSIS("domfrontier", DominanceFrontierAnalysis())
FUNCTION_ANALYSIS("loops", LoopAnalysis()) FUNCTION_ANALYSIS("loops", LoopAnalysis())
FUNCTION_ANALYSIS("regions", RegionInfoAnalysis())
FUNCTION_ANALYSIS("no-op-function", NoOpFunctionAnalysis()) FUNCTION_ANALYSIS("no-op-function", NoOpFunctionAnalysis())
FUNCTION_ANALYSIS("scalar-evolution", ScalarEvolutionAnalysis()) FUNCTION_ANALYSIS("scalar-evolution", ScalarEvolutionAnalysis())
FUNCTION_ANALYSIS("targetlibinfo", TargetLibraryAnalysis()) FUNCTION_ANALYSIS("targetlibinfo", TargetLibraryAnalysis())
FUNCTION_ANALYSIS("targetir", FUNCTION_ANALYSIS("targetir",
TM ? TM->getTargetIRAnalysis() : TargetIRAnalysis()) TM ? TM->getTargetIRAnalysis() : TargetIRAnalysis())
#ifndef FUNCTION_ALIAS_ANALYSIS #ifndef FUNCTION_ALIAS_ANALYSIS
#define FUNCTION_ALIAS_ANALYSIS(NAME, CREATE_PASS) \ #define FUNCTION_ALIAS_ANALYSIS(NAME, CREATE_PASS) \
Show All 18 Lines
FUNCTION_PASS("no-op-function", NoOpFunctionPass()) FUNCTION_PASS("no-op-function", NoOpFunctionPass())
FUNCTION_PASS("lower-expect", LowerExpectIntrinsicPass()) FUNCTION_PASS("lower-expect", LowerExpectIntrinsicPass())
FUNCTION_PASS("print", PrintFunctionPass(dbgs())) FUNCTION_PASS("print", PrintFunctionPass(dbgs()))
FUNCTION_PASS("print<assumptions>", AssumptionPrinterPass(dbgs())) FUNCTION_PASS("print<assumptions>", AssumptionPrinterPass(dbgs()))
FUNCTION_PASS("print<domtree>", DominatorTreePrinterPass(dbgs())) FUNCTION_PASS("print<domtree>", DominatorTreePrinterPass(dbgs()))
FUNCTION_PASS("print<postdomtree>", PostDominatorTreePrinterPass(dbgs())) FUNCTION_PASS("print<postdomtree>", PostDominatorTreePrinterPass(dbgs()))
FUNCTION_PASS("print<domfrontier>", DominanceFrontierPrinterPass(dbgs())) FUNCTION_PASS("print<domfrontier>", DominanceFrontierPrinterPass(dbgs()))
FUNCTION_PASS("print<loops>", LoopPrinterPass(dbgs())) FUNCTION_PASS("print<loops>", LoopPrinterPass(dbgs()))
FUNCTION_PASS("print<regions>", RegionInfoPrinterPass(dbgs()))
FUNCTION_PASS("print<scalar-evolution>", ScalarEvolutionPrinterPass(dbgs())) FUNCTION_PASS("print<scalar-evolution>", ScalarEvolutionPrinterPass(dbgs()))
FUNCTION_PASS("simplify-cfg", SimplifyCFGPass()) FUNCTION_PASS("simplify-cfg", SimplifyCFGPass())
FUNCTION_PASS("sroa", SROA()) FUNCTION_PASS("sroa", SROA())
FUNCTION_PASS("verify", VerifierPass()) FUNCTION_PASS("verify", VerifierPass())
FUNCTION_PASS("verify<domtree>", DominatorTreeVerifierPass()) FUNCTION_PASS("verify<domtree>", DominatorTreeVerifierPass())
FUNCTION_PASS("verify<regions>", RegionInfoVerifierPass())
#undef FUNCTION_PASS #undef FUNCTION_PASS
#ifndef LOOP_ANALYSIS #ifndef LOOP_ANALYSIS
#define LOOP_ANALYSIS(NAME, CREATE_PASS) #define LOOP_ANALYSIS(NAME, CREATE_PASS)
#endif #endif
LOOP_ANALYSIS("no-op-loop", NoOpLoopAnalysis()) LOOP_ANALYSIS("no-op-loop", NoOpLoopAnalysis())
#undef LOOP_ANALYSIS #undef LOOP_ANALYSIS
#ifndef LOOP_PASS #ifndef LOOP_PASS
#define LOOP_PASS(NAME, CREATE_PASS) #define LOOP_PASS(NAME, CREATE_PASS)
#endif #endif
LOOP_PASS("invalidate<all>", InvalidateAllAnalysesPass()) LOOP_PASS("invalidate<all>", InvalidateAllAnalysesPass())
LOOP_PASS("no-op-loop", NoOpLoopPass()) LOOP_PASS("no-op-loop", NoOpLoopPass())
LOOP_PASS("print", PrintLoopPass(dbgs())) LOOP_PASS("print", PrintLoopPass(dbgs()))
#undef LOOP_PASS #undef LOOP_PASS

llvm/trunk/test/Analysis/RegionInfo/20100809_bb_not_in_domtree.ll

; RUN: opt -regions < %s ; RUN: opt -regions < %s
; RUN: opt < %s -passes='print<regions>'
define i32 @main() nounwind { define i32 @main() nounwind {
entry: entry:
br label %for.cond br label %for.cond
test: test:
br label %for.cond br label %for.cond
for.cond: ; preds = %for.inc, %entry for.cond: ; preds = %for.inc, %entry
Show All 11 Lines

llvm/trunk/test/Analysis/RegionInfo/block_sort.ll

; REQUIRES: asserts ; REQUIRES: asserts
; RUN: opt -regions -analyze < %s | FileCheck %s ; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt -regions -stats -analyze < %s 2>&1 | FileCheck -check-prefix=STAT %s ; RUN: opt -regions -stats -analyze < %s 2>&1 | FileCheck -check-prefix=STAT %s
; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s ; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s
; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s ; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s
define void @BZ2_blockSort() nounwind { define void @BZ2_blockSort() nounwind {
start: start:
br label %while br label %while
while: while:
br label %while.body134.i.i br label %while.body134.i.i
while.body134.i.i: while.body134.i.i:
Show All 29 Lines

llvm/trunk/test/Analysis/RegionInfo/cond_loop.ll

; REQUIRES: asserts ; REQUIRES: asserts
; RUN: opt -regions -analyze < %s | FileCheck %s ; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s ; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s
; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s ; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s
; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s ; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s
define void @normal_condition() nounwind { define void @normal_condition() nounwind {
5: 5:
br label %"0" br label %"0"
0: 0:
br label %"1" br label %"1"
1: 1:
br i1 1, label %"2", label %"3" br i1 1, label %"2", label %"3"
Show All 20 Lines

llvm/trunk/test/Analysis/RegionInfo/condition_complicated.ll

; REQUIRES: asserts ; REQUIRES: asserts
; RUN: opt -regions -analyze < %s | FileCheck %s ; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s ; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s
; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s ; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s
; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s ; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s
define internal fastcc zeroext i8 @handle_compress() nounwind { define internal fastcc zeroext i8 @handle_compress() nounwind {
end165: end165:
br i1 1, label %false239, label %true181 br i1 1, label %false239, label %true181
true181: true181:
br i1 1, label %then187, label %else232 br i1 1, label %then187, label %else232
then187: then187:
▲ Show 20 Lines • Show All 47 Lines • Show Last 20 Lines

llvm/trunk/test/Analysis/RegionInfo/condition_complicated_2.ll

; REQUIRES: asserts ; REQUIRES: asserts
; RUN: opt -regions -analyze < %s | FileCheck %s ; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s ; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s
; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s ; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s
; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s ; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s
define internal fastcc void @compress() nounwind { define internal fastcc void @compress() nounwind {
end33: end33:
br i1 1, label %end124, label %lor.lhs.false95 br i1 1, label %end124, label %lor.lhs.false95
lor.lhs.false95: lor.lhs.false95:
br i1 1, label %then107, label %end172 br i1 1, label %then107, label %end172
then107: then107:
Show All 31 Lines

llvm/trunk/test/Analysis/RegionInfo/condition_forward_edge.ll

; REQUIRES: asserts ; REQUIRES: asserts
; RUN: opt -regions -analyze < %s | FileCheck %s ; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s ; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s
; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s ; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s
; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s ; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s
define void @normal_condition() nounwind { define void @normal_condition() nounwind {
0: 0:
br label %"1" br label %"1"
1: 1:
br i1 1, label %"2", label %"3" br i1 1, label %"2", label %"3"
2: 2:
br label %"3" br label %"3"
3: 3:
Show All 13 Lines

llvm/trunk/test/Analysis/RegionInfo/condition_same_exit.ll

; REQUIRES: asserts ; REQUIRES: asserts
; RUN: opt -regions -analyze < %s | FileCheck %s ; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s ; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s
; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s ; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s
; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s ; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s
define void @normal_condition() nounwind { define void @normal_condition() nounwind {
0: 0:
br i1 1, label %"1", label %"4" br i1 1, label %"1", label %"4"
1: 1:
br i1 1, label %"2", label %"3" br i1 1, label %"2", label %"3"
2: 2:
br label %"4" br label %"4"
Show All 18 Lines

llvm/trunk/test/Analysis/RegionInfo/condition_simple.ll

; REQUIRES: asserts ; REQUIRES: asserts
; RUN: opt -regions -analyze < %s | FileCheck %s ; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s ; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s
; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s ; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s
; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s ; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s
define void @normal_condition() nounwind { define void @normal_condition() nounwind {
0: 0:
br label %"1" br label %"1"
1: 1:
br i1 1, label %"2", label %"3" br i1 1, label %"2", label %"3"
2: 2:
br label %"4" br label %"4"
3: 3:
Show All 15 Lines

llvm/trunk/test/Analysis/RegionInfo/exit_in_condition.ll

; REQUIRES: asserts ; REQUIRES: asserts
; RUN: opt -regions -analyze < %s | FileCheck %s ; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s ; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s
; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s ; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s
; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s ; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s
define internal fastcc zeroext i8 @handle_compress() nounwind { define internal fastcc zeroext i8 @handle_compress() nounwind {
entry: entry:
br label %outer br label %outer
outer: outer:
br label %body br label %body
body: body:
Show All 25 Lines

llvm/trunk/test/Analysis/RegionInfo/loop_with_condition.ll

; REQUIRES: asserts ; REQUIRES: asserts
; RUN: opt -regions -analyze < %s | FileCheck %s ; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s ; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s
; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s ; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s
; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s ; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s
define void @normal_condition() nounwind { define void @normal_condition() nounwind {
0: 0:
br label %"1" br label %"1"
1: 1:
br i1 1, label %"6", label %"2" br i1 1, label %"6", label %"2"
2: 2:
br i1 1, label %"3", label %"4" br i1 1, label %"3", label %"4"
3: 3:
Show All 32 Lines

llvm/trunk/test/Analysis/RegionInfo/loops_1.ll

; REQUIRES: asserts ; REQUIRES: asserts
; RUN: opt -regions -analyze < %s | FileCheck %s ; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s ; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s
; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s ; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s
; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s ; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s
define internal fastcc zeroext i8 @loops_1() nounwind { define internal fastcc zeroext i8 @loops_1() nounwind {
entry: entry:
br i1 1, label %outer , label %a br i1 1, label %outer , label %a
a: a:
br label %body br label %body
outer: outer:
Show All 27 Lines

llvm/trunk/test/Analysis/RegionInfo/loops_2.ll

; REQUIRES: asserts ; REQUIRES: asserts
; RUN: opt -regions -analyze < %s | FileCheck %s ; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s ; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s
; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s ; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s
; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s ; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s
define void @meread_() nounwind { define void @meread_() nounwind {
entry: entry:
br label %bb23 br label %bb23
bb23: bb23:
br label %bb.i br label %bb.i
bb.i: ; preds = %bb.i, %bb54 bb.i: ; preds = %bb.i, %bb54
Show All 36 Lines

llvm/trunk/test/Analysis/RegionInfo/mix_1.ll

; REQUIRES: asserts ; REQUIRES: asserts
; RUN: opt -regions -analyze < %s | FileCheck %s ; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s ; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s
; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s ; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s
; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s ; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s
define void @a_linear_impl_fig_1() nounwind { define void @a_linear_impl_fig_1() nounwind {
0: 0:
br i1 1, label %"1", label %"15" br i1 1, label %"1", label %"15"
1: 1:
switch i32 0, label %"2" [ i32 0, label %"3" switch i32 0, label %"2" [ i32 0, label %"3"
i32 1, label %"7"] i32 1, label %"7"]
2: 2:
▲ Show 20 Lines • Show All 55 Lines • Show Last 20 Lines

llvm/trunk/test/Analysis/RegionInfo/nested_loops.ll

; REQUIRES: asserts ; REQUIRES: asserts
; RUN: opt -regions -analyze < %s | FileCheck %s ; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s ; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s
; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s ; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s
; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s ; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s
define internal fastcc zeroext i8 @handle_compress() nounwind { define internal fastcc zeroext i8 @handle_compress() nounwind {
entry: entry:
br label %outer br label %outer
outer: outer:
br label %body br label %body
body: body:
Show All 19 Lines

llvm/trunk/test/Analysis/RegionInfo/next.ll

; REQUIRES: asserts ; REQUIRES: asserts
; RUN: opt -regions -analyze < %s | FileCheck %s ; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s ; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s
; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s ; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s
; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s ; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s
define void @MAIN__() nounwind { define void @MAIN__() nounwind {
entry: entry:
br label %__label_002001.outer br label %__label_002001.outer
__label_002001.outer: ; preds = %bb236, %bb92 __label_002001.outer: ; preds = %bb236, %bb92
br label %__label_002001 br label %__label_002001
__label_002001: ; preds = %bb229, %__label_002001.outer __label_002001: ; preds = %bb229, %__label_002001.outer
Show All 36 Lines

llvm/trunk/test/Analysis/RegionInfo/paper.ll

; REQUIRES: asserts ; REQUIRES: asserts
; RUN: opt -regions -analyze < %s | FileCheck %s ; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s ; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s
; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s ; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s
; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s ; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s
define void @a_linear_impl_fig_1() nounwind { define void @a_linear_impl_fig_1() nounwind {
0: 0:
br label %"1" br label %"1"
1: 1:
br label %"2" br label %"2"
2: 2:
br label %"3" br label %"3"
3: 3:
▲ Show 20 Lines • Show All 42 Lines • Show Last 20 Lines

llvm/trunk/test/Analysis/RegionInfo/two_loops_same_header.ll

; REQUIRES: asserts ; REQUIRES: asserts
; RUN: opt -regions -analyze < %s | FileCheck %s ; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s ; RUN: opt -regions -stats < %s 2>&1 | FileCheck -check-prefix=STAT %s
; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s ; RUN: opt -regions -print-region-style=bb -analyze < %s 2>&1 | FileCheck -check-prefix=BBIT %s
; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s ; RUN: opt -regions -print-region-style=rn -analyze < %s 2>&1 | FileCheck -check-prefix=RNIT %s
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s
define internal fastcc zeroext i8 @handle_compress() nounwind { define internal fastcc zeroext i8 @handle_compress() nounwind {
entry: entry:
br label %outer br label %outer
outer: outer:
br label %body br label %body
body: body:
Show All 33 Lines

llvm/trunk/test/Analysis/RegionInfo/unreachable_bb.ll

; RUN: opt -regions -analyze < %s | FileCheck %s ; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s
; We should not crash if there are some bbs that are not reachable. ; We should not crash if there are some bbs that are not reachable.
define void @f() { define void @f() {
entry: entry:
br label %for.pre br label %for.pre
notintree: ; No predecessors! notintree: ; No predecessors!
br label %ret br label %ret
Show All 20 Lines