blob: 3f31d8efeb42c12b7ba282fe89b26c7724f09575 [file] [log] [blame]
Fiona Glaserb417d462016-01-29 22:35:36 +00001//===--------- LoopSimplifyCFG.cpp - Loop CFG Simplification Pass ---------===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file implements the Loop SimplifyCFG Pass. This pass is responsible for
11// basic loop CFG cleanup, primarily to assist other loop passes. If you
12// encounter a noncanonical CFG construct that causes another loop pass to
13// perform suboptimally, this is the place to fix it up.
14//
15//===----------------------------------------------------------------------===//
16
Justin Bognerab6a5132016-05-03 21:47:32 +000017#include "llvm/Transforms/Scalar/LoopSimplifyCFG.h"
Fiona Glaserb417d462016-01-29 22:35:36 +000018#include "llvm/ADT/SmallVector.h"
19#include "llvm/ADT/Statistic.h"
20#include "llvm/Analysis/AliasAnalysis.h"
Daniel Jasperaec2fa32016-12-19 08:22:17 +000021#include "llvm/Analysis/AssumptionCache.h"
Chandler Carruth3bab7e12017-01-11 09:43:56 +000022#include "llvm/Analysis/BasicAliasAnalysis.h"
Fiona Glaserb417d462016-01-29 22:35:36 +000023#include "llvm/Analysis/DependenceAnalysis.h"
24#include "llvm/Analysis/GlobalsModRef.h"
25#include "llvm/Analysis/LoopInfo.h"
26#include "llvm/Analysis/LoopPass.h"
27#include "llvm/Analysis/ScalarEvolution.h"
28#include "llvm/Analysis/ScalarEvolutionAliasAnalysis.h"
29#include "llvm/Analysis/TargetTransformInfo.h"
Chijun Sima21a8b602018-08-03 05:08:17 +000030#include "llvm/IR/DomTreeUpdater.h"
Fiona Glaserb417d462016-01-29 22:35:36 +000031#include "llvm/IR/Dominators.h"
Justin Bognerab6a5132016-05-03 21:47:32 +000032#include "llvm/Transforms/Scalar.h"
Chandler Carruth3bab7e12017-01-11 09:43:56 +000033#include "llvm/Transforms/Scalar/LoopPassManager.h"
David Blaikiea373d182018-03-28 17:44:36 +000034#include "llvm/Transforms/Utils.h"
Alina Sbirleadfd14ad2018-06-20 22:01:04 +000035#include "llvm/Transforms/Utils/BasicBlockUtils.h"
36#include "llvm/Transforms/Utils/Local.h"
Chandler Carruth31088a92016-02-19 10:45:18 +000037#include "llvm/Transforms/Utils/LoopUtils.h"
Fiona Glaserb417d462016-01-29 22:35:36 +000038using namespace llvm;
39
40#define DEBUG_TYPE "loop-simplifycfg"
41
David Greene6a9c242018-06-19 09:43:36 +000042static bool simplifyLoopCFG(Loop &L, DominatorTree &DT, LoopInfo &LI,
43 ScalarEvolution &SE) {
Fiona Glaserb417d462016-01-29 22:35:36 +000044 bool Changed = false;
Chijun Sima21a8b602018-08-03 05:08:17 +000045 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager);
Fiona Glaserb417d462016-01-29 22:35:36 +000046 // Copy blocks into a temporary array to avoid iterator invalidation issues
47 // as we remove them.
Sanjoy Dase6bca0e2017-05-01 17:07:49 +000048 SmallVector<WeakTrackingVH, 16> Blocks(L.blocks());
Fiona Glaserb417d462016-01-29 22:35:36 +000049
50 for (auto &Block : Blocks) {
51 // Attempt to merge blocks in the trivial case. Don't modify blocks which
52 // belong to other loops.
Fiona Glaser36e82302016-01-29 23:12:52 +000053 BasicBlock *Succ = cast_or_null<BasicBlock>(Block);
Fiona Glaserb417d462016-01-29 22:35:36 +000054 if (!Succ)
55 continue;
56
57 BasicBlock *Pred = Succ->getSinglePredecessor();
Justin Bognerab6a5132016-05-03 21:47:32 +000058 if (!Pred || !Pred->getSingleSuccessor() || LI.getLoopFor(Pred) != &L)
Fiona Glaserb417d462016-01-29 22:35:36 +000059 continue;
60
Alina Sbirleadfd14ad2018-06-20 22:01:04 +000061 // Merge Succ into Pred and delete it.
Chijun Sima21a8b602018-08-03 05:08:17 +000062 MergeBlockIntoPredecessor(Succ, &DTU, &LI);
David Greene6a9c242018-06-19 09:43:36 +000063
64 SE.forgetLoop(&L);
Fiona Glaserb417d462016-01-29 22:35:36 +000065 Changed = true;
66 }
67
68 return Changed;
69}
70
Chandler Carruth410eaeb2017-01-11 06:23:21 +000071PreservedAnalyses LoopSimplifyCFGPass::run(Loop &L, LoopAnalysisManager &AM,
72 LoopStandardAnalysisResults &AR,
73 LPMUpdater &) {
David Greene6a9c242018-06-19 09:43:36 +000074 if (!simplifyLoopCFG(L, AR.DT, AR.LI, AR.SE))
Justin Bognerab6a5132016-05-03 21:47:32 +000075 return PreservedAnalyses::all();
Chandler Carruthca68a3e2017-01-15 06:32:49 +000076
Justin Bognerab6a5132016-05-03 21:47:32 +000077 return getLoopPassPreservedAnalyses();
78}
79
80namespace {
81class LoopSimplifyCFGLegacyPass : public LoopPass {
82public:
83 static char ID; // Pass ID, replacement for typeid
84 LoopSimplifyCFGLegacyPass() : LoopPass(ID) {
85 initializeLoopSimplifyCFGLegacyPassPass(*PassRegistry::getPassRegistry());
86 }
87
88 bool runOnLoop(Loop *L, LPPassManager &) override {
89 if (skipLoop(L))
90 return false;
91
92 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
93 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
David Greene6a9c242018-06-19 09:43:36 +000094 ScalarEvolution &SE = getAnalysis<ScalarEvolutionWrapperPass>().getSE();
95 return simplifyLoopCFG(*L, DT, LI, SE);
Justin Bognerab6a5132016-05-03 21:47:32 +000096 }
97
98 void getAnalysisUsage(AnalysisUsage &AU) const override {
Chandler Carruth49c22192016-05-12 22:19:39 +000099 AU.addPreserved<DependenceAnalysisWrapperPass>();
Justin Bognerab6a5132016-05-03 21:47:32 +0000100 getLoopAnalysisUsage(AU);
101 }
102};
103}
104
105char LoopSimplifyCFGLegacyPass::ID = 0;
106INITIALIZE_PASS_BEGIN(LoopSimplifyCFGLegacyPass, "loop-simplifycfg",
107 "Simplify loop CFG", false, false)
108INITIALIZE_PASS_DEPENDENCY(LoopPass)
109INITIALIZE_PASS_END(LoopSimplifyCFGLegacyPass, "loop-simplifycfg",
110 "Simplify loop CFG", false, false)
111
112Pass *llvm::createLoopSimplifyCFGPass() {
113 return new LoopSimplifyCFGLegacyPass();
Fiona Glaserb417d462016-01-29 22:35:36 +0000114}