blob: 5348300959c0a1b9e3baee913bb98fea5e2577c0 [file] [log] [blame]
Tom Stellardf8794352012-12-19 22:10:31 +00001//===-- SIAnnotateControlFlow.cpp - ------------------===//
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/// \file
11/// Annotates the control flow with hardware specific intrinsics.
12//
13//===----------------------------------------------------------------------===//
14
15#include "AMDGPU.h"
Tom Stellardf8794352012-12-19 22:10:31 +000016#include "llvm/ADT/DepthFirstIterator.h"
Tom Stellard0f29de72015-02-05 15:32:15 +000017#include "llvm/Analysis/LoopInfo.h"
Tom Stellardb0804ec2013-06-07 20:28:43 +000018#include "llvm/IR/Constants.h"
Chandler Carruth5ad5f152014-01-13 09:26:24 +000019#include "llvm/IR/Dominators.h"
Tom Stellardb0804ec2013-06-07 20:28:43 +000020#include "llvm/IR/Instructions.h"
Chandler Carruth9fb823b2013-01-02 11:36:10 +000021#include "llvm/IR/Module.h"
Chandler Carruthbe810232013-01-02 10:22:59 +000022#include "llvm/Pass.h"
23#include "llvm/Transforms/Utils/BasicBlockUtils.h"
Tom Stellardf8794352012-12-19 22:10:31 +000024#include "llvm/Transforms/Utils/SSAUpdater.h"
25
26using namespace llvm;
27
Chandler Carruth84e68b22014-04-22 02:41:26 +000028#define DEBUG_TYPE "si-annotate-control-flow"
29
Tom Stellardf8794352012-12-19 22:10:31 +000030namespace {
31
32// Complex types used in this pass
33typedef std::pair<BasicBlock *, Value *> StackEntry;
34typedef SmallVector<StackEntry, 16> StackVector;
35
36// Intrinsic names the control flow is annotated with
Matt Arsenault7898b902016-01-22 18:42:55 +000037static const char *const IfIntrinsic = "llvm.amdgcn.if";
38static const char *const ElseIntrinsic = "llvm.amdgcn.else";
39static const char *const BreakIntrinsic = "llvm.amdgcn.break";
40static const char *const IfBreakIntrinsic = "llvm.amdgcn.if.break";
41static const char *const ElseBreakIntrinsic = "llvm.amdgcn.else.break";
42static const char *const LoopIntrinsic = "llvm.amdgcn.loop";
43static const char *const EndCfIntrinsic = "llvm.amdgcn.end.cf";
Tom Stellardf8794352012-12-19 22:10:31 +000044
45class SIAnnotateControlFlow : public FunctionPass {
46
Tom Stellardf8794352012-12-19 22:10:31 +000047 Type *Boolean;
48 Type *Void;
49 Type *Int64;
50 Type *ReturnStruct;
51
52 ConstantInt *BoolTrue;
53 ConstantInt *BoolFalse;
54 UndefValue *BoolUndef;
55 Constant *Int64Zero;
56
57 Constant *If;
58 Constant *Else;
59 Constant *Break;
60 Constant *IfBreak;
61 Constant *ElseBreak;
62 Constant *Loop;
63 Constant *EndCf;
64
65 DominatorTree *DT;
66 StackVector Stack;
Tom Stellardf8794352012-12-19 22:10:31 +000067
Tom Stellard0f29de72015-02-05 15:32:15 +000068 LoopInfo *LI;
69
Tom Stellardf8794352012-12-19 22:10:31 +000070 bool isTopOfStack(BasicBlock *BB);
71
72 Value *popSaved();
73
74 void push(BasicBlock *BB, Value *Saved);
75
76 bool isElse(PHINode *Phi);
77
78 void eraseIfUnused(PHINode *Phi);
79
80 void openIf(BranchInst *Term);
81
82 void insertElse(BranchInst *Term);
83
Tom Stellardd4a19502015-04-14 14:36:45 +000084 Value *handleLoopCondition(Value *Cond, PHINode *Broken, llvm::Loop *L);
Tom Stellardf8794352012-12-19 22:10:31 +000085
86 void handleLoop(BranchInst *Term);
87
88 void closeControlFlow(BasicBlock *BB);
89
90public:
Tom Stellard77a17772016-01-20 15:48:27 +000091 static char ID;
92
Tom Stellardf8794352012-12-19 22:10:31 +000093 SIAnnotateControlFlow():
94 FunctionPass(ID) { }
95
Craig Topper5656db42014-04-29 07:57:24 +000096 bool doInitialization(Module &M) override;
Tom Stellardf8794352012-12-19 22:10:31 +000097
Craig Topper5656db42014-04-29 07:57:24 +000098 bool runOnFunction(Function &F) override;
Tom Stellardf8794352012-12-19 22:10:31 +000099
Craig Topper5656db42014-04-29 07:57:24 +0000100 const char *getPassName() const override {
Tom Stellardf8794352012-12-19 22:10:31 +0000101 return "SI annotate control flow";
102 }
103
Craig Topper5656db42014-04-29 07:57:24 +0000104 void getAnalysisUsage(AnalysisUsage &AU) const override {
Tom Stellard0f29de72015-02-05 15:32:15 +0000105 AU.addRequired<LoopInfoWrapperPass>();
Chandler Carruth73523022014-01-13 13:07:17 +0000106 AU.addRequired<DominatorTreeWrapperPass>();
107 AU.addPreserved<DominatorTreeWrapperPass>();
Tom Stellardf8794352012-12-19 22:10:31 +0000108 FunctionPass::getAnalysisUsage(AU);
109 }
110
111};
112
113} // end anonymous namespace
114
Tom Stellard77a17772016-01-20 15:48:27 +0000115INITIALIZE_PASS_BEGIN(SIAnnotateControlFlow, DEBUG_TYPE,
116 "Annotate SI Control Flow", false, false)
117INITIALIZE_PASS_END(SIAnnotateControlFlow, DEBUG_TYPE,
118 "Annotate SI Control Flow", false, false)
119
Tom Stellardf8794352012-12-19 22:10:31 +0000120char SIAnnotateControlFlow::ID = 0;
121
122/// \brief Initialize all the types and constants used in the pass
123bool SIAnnotateControlFlow::doInitialization(Module &M) {
Tom Stellardf8794352012-12-19 22:10:31 +0000124 LLVMContext &Context = M.getContext();
125
126 Void = Type::getVoidTy(Context);
127 Boolean = Type::getInt1Ty(Context);
128 Int64 = Type::getInt64Ty(Context);
Craig Topper062a2ba2014-04-25 05:30:21 +0000129 ReturnStruct = StructType::get(Boolean, Int64, (Type *)nullptr);
Tom Stellardf8794352012-12-19 22:10:31 +0000130
131 BoolTrue = ConstantInt::getTrue(Context);
132 BoolFalse = ConstantInt::getFalse(Context);
133 BoolUndef = UndefValue::get(Boolean);
134 Int64Zero = ConstantInt::get(Int64, 0);
135
136 If = M.getOrInsertFunction(
Craig Topper062a2ba2014-04-25 05:30:21 +0000137 IfIntrinsic, ReturnStruct, Boolean, (Type *)nullptr);
Tom Stellardf8794352012-12-19 22:10:31 +0000138
139 Else = M.getOrInsertFunction(
Craig Topper062a2ba2014-04-25 05:30:21 +0000140 ElseIntrinsic, ReturnStruct, Int64, (Type *)nullptr);
Tom Stellardf8794352012-12-19 22:10:31 +0000141
142 Break = M.getOrInsertFunction(
Craig Topper062a2ba2014-04-25 05:30:21 +0000143 BreakIntrinsic, Int64, Int64, (Type *)nullptr);
Tom Stellardf8794352012-12-19 22:10:31 +0000144
145 IfBreak = M.getOrInsertFunction(
Craig Topper062a2ba2014-04-25 05:30:21 +0000146 IfBreakIntrinsic, Int64, Boolean, Int64, (Type *)nullptr);
Tom Stellardf8794352012-12-19 22:10:31 +0000147
148 ElseBreak = M.getOrInsertFunction(
Craig Topper062a2ba2014-04-25 05:30:21 +0000149 ElseBreakIntrinsic, Int64, Int64, Int64, (Type *)nullptr);
Tom Stellardf8794352012-12-19 22:10:31 +0000150
151 Loop = M.getOrInsertFunction(
Craig Topper062a2ba2014-04-25 05:30:21 +0000152 LoopIntrinsic, Boolean, Int64, (Type *)nullptr);
Tom Stellardf8794352012-12-19 22:10:31 +0000153
154 EndCf = M.getOrInsertFunction(
Craig Topper062a2ba2014-04-25 05:30:21 +0000155 EndCfIntrinsic, Void, Int64, (Type *)nullptr);
Tom Stellardf8794352012-12-19 22:10:31 +0000156
157 return false;
158}
159
160/// \brief Is BB the last block saved on the stack ?
161bool SIAnnotateControlFlow::isTopOfStack(BasicBlock *BB) {
Michel Danzerae0a4032013-02-14 08:00:33 +0000162 return !Stack.empty() && Stack.back().first == BB;
Tom Stellardf8794352012-12-19 22:10:31 +0000163}
164
165/// \brief Pop the last saved value from the control flow stack
166Value *SIAnnotateControlFlow::popSaved() {
167 return Stack.pop_back_val().second;
168}
169
170/// \brief Push a BB and saved value to the control flow stack
171void SIAnnotateControlFlow::push(BasicBlock *BB, Value *Saved) {
172 Stack.push_back(std::make_pair(BB, Saved));
173}
174
175/// \brief Can the condition represented by this PHI node treated like
176/// an "Else" block?
177bool SIAnnotateControlFlow::isElse(PHINode *Phi) {
Tom Stellardf8794352012-12-19 22:10:31 +0000178 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock();
179 for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) {
180 if (Phi->getIncomingBlock(i) == IDom) {
181
182 if (Phi->getIncomingValue(i) != BoolTrue)
183 return false;
184
185 } else {
186 if (Phi->getIncomingValue(i) != BoolFalse)
187 return false;
Tom Stellardde16a2e2014-06-20 17:06:02 +0000188
Tom Stellardf8794352012-12-19 22:10:31 +0000189 }
190 }
191 return true;
192}
193
194// \brief Erase "Phi" if it is not used any more
195void SIAnnotateControlFlow::eraseIfUnused(PHINode *Phi) {
196 if (!Phi->hasNUsesOrMore(1))
197 Phi->eraseFromParent();
198}
199
200/// \brief Open a new "If" block
201void SIAnnotateControlFlow::openIf(BranchInst *Term) {
202 Value *Ret = CallInst::Create(If, Term->getCondition(), "", Term);
203 Term->setCondition(ExtractValueInst::Create(Ret, 0, "", Term));
204 push(Term->getSuccessor(1), ExtractValueInst::Create(Ret, 1, "", Term));
205}
206
207/// \brief Close the last "If" block and open a new "Else" block
208void SIAnnotateControlFlow::insertElse(BranchInst *Term) {
209 Value *Ret = CallInst::Create(Else, popSaved(), "", Term);
210 Term->setCondition(ExtractValueInst::Create(Ret, 0, "", Term));
211 push(Term->getSuccessor(1), ExtractValueInst::Create(Ret, 1, "", Term));
212}
213
214/// \brief Recursively handle the condition leading to a loop
Tom Stellardd4a19502015-04-14 14:36:45 +0000215Value *SIAnnotateControlFlow::handleLoopCondition(Value *Cond, PHINode *Broken,
216 llvm::Loop *L) {
Tom Stellard0b7feb12015-05-01 03:44:08 +0000217
218 // Only search through PHI nodes which are inside the loop. If we try this
219 // with PHI nodes that are outside of the loop, we end up inserting new PHI
220 // nodes outside of the loop which depend on values defined inside the loop.
221 // This will break the module with
222 // 'Instruction does not dominate all users!' errors.
223 PHINode *Phi = nullptr;
224 if ((Phi = dyn_cast<PHINode>(Cond)) && L->contains(Phi)) {
225
Tom Stellardde16a2e2014-06-20 17:06:02 +0000226 BasicBlock *Parent = Phi->getParent();
227 PHINode *NewPhi = PHINode::Create(Int64, 0, "", &Parent->front());
228 Value *Ret = NewPhi;
Tom Stellardf8794352012-12-19 22:10:31 +0000229
Alp Tokerf907b892013-12-05 05:44:44 +0000230 // Handle all non-constant incoming values first
Tom Stellardf8794352012-12-19 22:10:31 +0000231 for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) {
232 Value *Incoming = Phi->getIncomingValue(i);
Tom Stellardde16a2e2014-06-20 17:06:02 +0000233 BasicBlock *From = Phi->getIncomingBlock(i);
234 if (isa<ConstantInt>(Incoming)) {
235 NewPhi->addIncoming(Broken, From);
Tom Stellardf8794352012-12-19 22:10:31 +0000236 continue;
Tom Stellardde16a2e2014-06-20 17:06:02 +0000237 }
Tom Stellardf8794352012-12-19 22:10:31 +0000238
239 Phi->setIncomingValue(i, BoolFalse);
Tom Stellardd4a19502015-04-14 14:36:45 +0000240 Value *PhiArg = handleLoopCondition(Incoming, Broken, L);
Tom Stellardde16a2e2014-06-20 17:06:02 +0000241 NewPhi->addIncoming(PhiArg, From);
Tom Stellardf8794352012-12-19 22:10:31 +0000242 }
243
Tom Stellardf8794352012-12-19 22:10:31 +0000244 BasicBlock *IDom = DT->getNode(Parent)->getIDom()->getBlock();
245
246 for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) {
247
248 Value *Incoming = Phi->getIncomingValue(i);
249 if (Incoming != BoolTrue)
250 continue;
251
252 BasicBlock *From = Phi->getIncomingBlock(i);
253 if (From == IDom) {
254 CallInst *OldEnd = dyn_cast<CallInst>(Parent->getFirstInsertionPt());
255 if (OldEnd && OldEnd->getCalledFunction() == EndCf) {
Tom Stellardde16a2e2014-06-20 17:06:02 +0000256 Value *Args[] = { OldEnd->getArgOperand(0), NewPhi };
257 Ret = CallInst::Create(ElseBreak, Args, "", OldEnd);
Tom Stellardf8794352012-12-19 22:10:31 +0000258 continue;
259 }
260 }
Tom Stellardf8794352012-12-19 22:10:31 +0000261 TerminatorInst *Insert = From->getTerminator();
Tom Stellardde16a2e2014-06-20 17:06:02 +0000262 Value *PhiArg = CallInst::Create(Break, Broken, "", Insert);
263 NewPhi->setIncomingValue(i, PhiArg);
Tom Stellardf8794352012-12-19 22:10:31 +0000264 }
265 eraseIfUnused(Phi);
Tom Stellardde16a2e2014-06-20 17:06:02 +0000266 return Ret;
Tom Stellardf8794352012-12-19 22:10:31 +0000267
268 } else if (Instruction *Inst = dyn_cast<Instruction>(Cond)) {
269 BasicBlock *Parent = Inst->getParent();
Tom Stellardd4a19502015-04-14 14:36:45 +0000270 Instruction *Insert;
271 if (L->contains(Inst)) {
272 Insert = Parent->getTerminator();
273 } else {
274 Insert = L->getHeader()->getFirstNonPHIOrDbgOrLifetime();
275 }
Tom Stellardde16a2e2014-06-20 17:06:02 +0000276 Value *Args[] = { Cond, Broken };
277 return CallInst::Create(IfBreak, Args, "", Insert);
Tom Stellardf8794352012-12-19 22:10:31 +0000278
279 } else {
Matt Arsenaulteaa3a7e2013-12-10 21:37:42 +0000280 llvm_unreachable("Unhandled loop condition!");
Tom Stellardf8794352012-12-19 22:10:31 +0000281 }
Tom Stellardde16a2e2014-06-20 17:06:02 +0000282 return 0;
Tom Stellardf8794352012-12-19 22:10:31 +0000283}
284
285/// \brief Handle a back edge (loop)
286void SIAnnotateControlFlow::handleLoop(BranchInst *Term) {
Tom Stellardd4a19502015-04-14 14:36:45 +0000287 BasicBlock *BB = Term->getParent();
288 llvm::Loop *L = LI->getLoopFor(BB);
Tom Stellardf8794352012-12-19 22:10:31 +0000289 BasicBlock *Target = Term->getSuccessor(1);
290 PHINode *Broken = PHINode::Create(Int64, 0, "", &Target->front());
291
Tom Stellardf8794352012-12-19 22:10:31 +0000292 Value *Cond = Term->getCondition();
293 Term->setCondition(BoolTrue);
Tom Stellardd4a19502015-04-14 14:36:45 +0000294 Value *Arg = handleLoopCondition(Cond, Broken, L);
Tom Stellardf8794352012-12-19 22:10:31 +0000295
Tom Stellardf8794352012-12-19 22:10:31 +0000296 for (pred_iterator PI = pred_begin(Target), PE = pred_end(Target);
297 PI != PE; ++PI) {
298
299 Broken->addIncoming(*PI == BB ? Arg : Int64Zero, *PI);
300 }
301
302 Term->setCondition(CallInst::Create(Loop, Arg, "", Term));
303 push(Term->getSuccessor(0), Arg);
Tom Stellard0f29de72015-02-05 15:32:15 +0000304}/// \brief Close the last opened control flow
Tom Stellardf8794352012-12-19 22:10:31 +0000305void SIAnnotateControlFlow::closeControlFlow(BasicBlock *BB) {
Tom Stellard0f29de72015-02-05 15:32:15 +0000306 llvm::Loop *L = LI->getLoopFor(BB);
307
308 if (L && L->getHeader() == BB) {
309 // We can't insert an EndCF call into a loop header, because it will
310 // get executed on every iteration of the loop, when it should be
311 // executed only once before the loop.
312 SmallVector <BasicBlock*, 8> Latches;
313 L->getLoopLatches(Latches);
314
315 std::vector<BasicBlock*> Preds;
316 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) {
317 if (std::find(Latches.begin(), Latches.end(), *PI) == Latches.end())
318 Preds.push_back(*PI);
319 }
Chandler Carruth96ada252015-07-22 09:52:54 +0000320 BB = llvm::SplitBlockPredecessors(BB, Preds, "endcf.split", DT, LI, false);
Tom Stellard0f29de72015-02-05 15:32:15 +0000321 }
322
Duncan P. N. Exon Smitha73371a2015-10-13 20:07:10 +0000323 CallInst::Create(EndCf, popSaved(), "", &*BB->getFirstInsertionPt());
Tom Stellardf8794352012-12-19 22:10:31 +0000324}
325
326/// \brief Annotate the control flow with intrinsics so the backend can
327/// recognize if/then/else and loops.
328bool SIAnnotateControlFlow::runOnFunction(Function &F) {
Chandler Carruth73523022014-01-13 13:07:17 +0000329 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
Tom Stellard0f29de72015-02-05 15:32:15 +0000330 LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
Tom Stellardf8794352012-12-19 22:10:31 +0000331
332 for (df_iterator<BasicBlock *> I = df_begin(&F.getEntryBlock()),
333 E = df_end(&F.getEntryBlock()); I != E; ++I) {
334
335 BranchInst *Term = dyn_cast<BranchInst>((*I)->getTerminator());
336
337 if (!Term || Term->isUnconditional()) {
338 if (isTopOfStack(*I))
339 closeControlFlow(*I);
340 continue;
341 }
342
343 if (I.nodeVisited(Term->getSuccessor(1))) {
344 if (isTopOfStack(*I))
345 closeControlFlow(*I);
346 handleLoop(Term);
347 continue;
348 }
349
350 if (isTopOfStack(*I)) {
351 PHINode *Phi = dyn_cast<PHINode>(Term->getCondition());
352 if (Phi && Phi->getParent() == *I && isElse(Phi)) {
353 insertElse(Term);
354 eraseIfUnused(Phi);
355 continue;
356 }
357 closeControlFlow(*I);
358 }
359 openIf(Term);
360 }
361
362 assert(Stack.empty());
363 return true;
364}
365
366/// \brief Create the annotation pass
367FunctionPass *llvm::createSIAnnotateControlFlowPass() {
Tom Stellardf8794352012-12-19 22:10:31 +0000368 return new SIAnnotateControlFlow();
369}