blob: fae556a35df51e2da76dbbe25a5ab3ba27fb2eca [file] [log] [blame]
Eugene Zelenko59e12822017-08-08 00:47:13 +00001//===- SIInsertWaitcnts.cpp - Insert Wait Instructions --------------------===//
Kannan Narayananacb089e2017-04-12 03:25:12 +00002//
Chandler Carruth2946cd72019-01-19 08:50:56 +00003// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
Kannan Narayananacb089e2017-04-12 03:25:12 +00006//
7//===----------------------------------------------------------------------===//
8//
9/// \file
Adrian Prantl5f8f34e42018-05-01 15:54:18 +000010/// Insert wait instructions for memory reads and writes.
Kannan Narayananacb089e2017-04-12 03:25:12 +000011///
12/// Memory reads and writes are issued asynchronously, so we need to insert
13/// S_WAITCNT instructions when we want to access any of their results or
14/// overwrite any register that's used asynchronously.
Nicolai Haehnled1f45da2018-11-29 11:06:14 +000015///
16/// TODO: This pass currently keeps one timeline per hardware counter. A more
17/// finely-grained approach that keeps one timeline per event type could
18/// sometimes get away with generating weaker s_waitcnt instructions. For
19/// example, when both SMEM and LDS are in flight and we need to wait for
20/// the i-th-last LDS instruction, then an lgkmcnt(i) is actually sufficient,
21/// but the pass will currently generate a conservative lgkmcnt(0) because
22/// multiple event types are in flight.
Kannan Narayananacb089e2017-04-12 03:25:12 +000023//
24//===----------------------------------------------------------------------===//
25
26#include "AMDGPU.h"
27#include "AMDGPUSubtarget.h"
28#include "SIDefines.h"
29#include "SIInstrInfo.h"
30#include "SIMachineFunctionInfo.h"
Eugene Zelenko59e12822017-08-08 00:47:13 +000031#include "SIRegisterInfo.h"
Kannan Narayananacb089e2017-04-12 03:25:12 +000032#include "Utils/AMDGPUBaseInfo.h"
Eugene Zelenko59e12822017-08-08 00:47:13 +000033#include "llvm/ADT/DenseMap.h"
34#include "llvm/ADT/DenseSet.h"
Kannan Narayananacb089e2017-04-12 03:25:12 +000035#include "llvm/ADT/PostOrderIterator.h"
Eugene Zelenko59e12822017-08-08 00:47:13 +000036#include "llvm/ADT/STLExtras.h"
37#include "llvm/ADT/SmallVector.h"
38#include "llvm/CodeGen/MachineBasicBlock.h"
Kannan Narayananacb089e2017-04-12 03:25:12 +000039#include "llvm/CodeGen/MachineFunction.h"
40#include "llvm/CodeGen/MachineFunctionPass.h"
Eugene Zelenko59e12822017-08-08 00:47:13 +000041#include "llvm/CodeGen/MachineInstr.h"
Kannan Narayananacb089e2017-04-12 03:25:12 +000042#include "llvm/CodeGen/MachineInstrBuilder.h"
Eugene Zelenko59e12822017-08-08 00:47:13 +000043#include "llvm/CodeGen/MachineMemOperand.h"
44#include "llvm/CodeGen/MachineOperand.h"
Kannan Narayananacb089e2017-04-12 03:25:12 +000045#include "llvm/CodeGen/MachineRegisterInfo.h"
Eugene Zelenko59e12822017-08-08 00:47:13 +000046#include "llvm/IR/DebugLoc.h"
47#include "llvm/Pass.h"
48#include "llvm/Support/Debug.h"
Mark Searlesec581832018-04-25 19:21:26 +000049#include "llvm/Support/DebugCounter.h"
Eugene Zelenko59e12822017-08-08 00:47:13 +000050#include "llvm/Support/ErrorHandling.h"
51#include "llvm/Support/raw_ostream.h"
52#include <algorithm>
53#include <cassert>
54#include <cstdint>
55#include <cstring>
56#include <memory>
57#include <utility>
58#include <vector>
Kannan Narayananacb089e2017-04-12 03:25:12 +000059
Mark Searlesec581832018-04-25 19:21:26 +000060using namespace llvm;
61
Kannan Narayananacb089e2017-04-12 03:25:12 +000062#define DEBUG_TYPE "si-insert-waitcnts"
63
Mark Searlesec581832018-04-25 19:21:26 +000064DEBUG_COUNTER(ForceExpCounter, DEBUG_TYPE"-forceexp",
65 "Force emit s_waitcnt expcnt(0) instrs");
66DEBUG_COUNTER(ForceLgkmCounter, DEBUG_TYPE"-forcelgkm",
67 "Force emit s_waitcnt lgkmcnt(0) instrs");
68DEBUG_COUNTER(ForceVMCounter, DEBUG_TYPE"-forcevm",
69 "Force emit s_waitcnt vmcnt(0) instrs");
70
Matt Arsenault0b31b242019-03-14 21:23:59 +000071static cl::opt<bool> ForceEmitZeroFlag(
Mark Searlesec581832018-04-25 19:21:26 +000072 "amdgpu-waitcnt-forcezero",
73 cl::desc("Force all waitcnt instrs to be emitted as s_waitcnt vmcnt(0) expcnt(0) lgkmcnt(0)"),
Matt Arsenault0b31b242019-03-14 21:23:59 +000074 cl::init(false), cl::Hidden);
Kannan Narayananacb089e2017-04-12 03:25:12 +000075
76namespace {
77
Nicolai Haehnleae369d72018-11-29 11:06:11 +000078template <typename EnumT>
79class enum_iterator
80 : public iterator_facade_base<enum_iterator<EnumT>,
81 std::forward_iterator_tag, const EnumT> {
82 EnumT Value;
83public:
84 enum_iterator() = default;
85 enum_iterator(EnumT Value) : Value(Value) {}
86
87 enum_iterator &operator++() {
88 Value = static_cast<EnumT>(Value + 1);
89 return *this;
90 }
91
92 bool operator==(const enum_iterator &RHS) const { return Value == RHS.Value; }
93
94 EnumT operator*() const { return Value; }
95};
96
Kannan Narayananacb089e2017-04-12 03:25:12 +000097// Class of object that encapsulates latest instruction counter score
98// associated with the operand. Used for determining whether
99// s_waitcnt instruction needs to be emited.
100
101#define CNT_MASK(t) (1u << (t))
102
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +0000103enum InstCounterType { VM_CNT = 0, LGKM_CNT, EXP_CNT, VS_CNT, NUM_INST_CNTS };
Kannan Narayananacb089e2017-04-12 03:25:12 +0000104
Nicolai Haehnleae369d72018-11-29 11:06:11 +0000105iterator_range<enum_iterator<InstCounterType>> inst_counter_types() {
106 return make_range(enum_iterator<InstCounterType>(VM_CNT),
107 enum_iterator<InstCounterType>(NUM_INST_CNTS));
108}
109
Eugene Zelenko59e12822017-08-08 00:47:13 +0000110using RegInterval = std::pair<signed, signed>;
Kannan Narayananacb089e2017-04-12 03:25:12 +0000111
112struct {
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000113 uint32_t VmcntMax;
114 uint32_t ExpcntMax;
115 uint32_t LgkmcntMax;
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +0000116 uint32_t VscntMax;
Kannan Narayananacb089e2017-04-12 03:25:12 +0000117 int32_t NumVGPRsMax;
118 int32_t NumSGPRsMax;
119} HardwareLimits;
120
121struct {
122 unsigned VGPR0;
123 unsigned VGPRL;
124 unsigned SGPR0;
125 unsigned SGPRL;
126} RegisterEncoding;
127
128enum WaitEventType {
129 VMEM_ACCESS, // vector-memory read & write
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +0000130 VMEM_READ_ACCESS, // vector-memory read
131 VMEM_WRITE_ACCESS,// vector-memory write
Kannan Narayananacb089e2017-04-12 03:25:12 +0000132 LDS_ACCESS, // lds read & write
133 GDS_ACCESS, // gds read & write
134 SQ_MESSAGE, // send message
135 SMEM_ACCESS, // scalar-memory read & write
136 EXP_GPR_LOCK, // export holding on its data src
137 GDS_GPR_LOCK, // GDS holding on its data and addr src
138 EXP_POS_ACCESS, // write to export position
139 EXP_PARAM_ACCESS, // write to export parameter
140 VMW_GPR_LOCK, // vector-memory write holding on its data src
141 NUM_WAIT_EVENTS,
142};
143
Nicolai Haehnled1f45da2018-11-29 11:06:14 +0000144static const uint32_t WaitEventMaskForInst[NUM_INST_CNTS] = {
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +0000145 (1 << VMEM_ACCESS) | (1 << VMEM_READ_ACCESS),
Nicolai Haehnled1f45da2018-11-29 11:06:14 +0000146 (1 << SMEM_ACCESS) | (1 << LDS_ACCESS) | (1 << GDS_ACCESS) |
147 (1 << SQ_MESSAGE),
148 (1 << EXP_GPR_LOCK) | (1 << GDS_GPR_LOCK) | (1 << VMW_GPR_LOCK) |
149 (1 << EXP_PARAM_ACCESS) | (1 << EXP_POS_ACCESS),
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +0000150 (1 << VMEM_WRITE_ACCESS)
Nicolai Haehnled1f45da2018-11-29 11:06:14 +0000151};
Nicolai Haehnleae369d72018-11-29 11:06:11 +0000152
Kannan Narayananacb089e2017-04-12 03:25:12 +0000153// The mapping is:
154// 0 .. SQ_MAX_PGM_VGPRS-1 real VGPRs
155// SQ_MAX_PGM_VGPRS .. NUM_ALL_VGPRS-1 extra VGPR-like slots
156// NUM_ALL_VGPRS .. NUM_ALL_VGPRS+SQ_MAX_PGM_SGPRS-1 real SGPRs
157// We reserve a fixed number of VGPR slots in the scoring tables for
158// special tokens like SCMEM_LDS (needed for buffer load to LDS).
159enum RegisterMapping {
160 SQ_MAX_PGM_VGPRS = 256, // Maximum programmable VGPRs across all targets.
161 SQ_MAX_PGM_SGPRS = 256, // Maximum programmable SGPRs across all targets.
162 NUM_EXTRA_VGPRS = 1, // A reserved slot for DS.
163 EXTRA_VGPR_LDS = 0, // This is a placeholder the Shader algorithm uses.
164 NUM_ALL_VGPRS = SQ_MAX_PGM_VGPRS + NUM_EXTRA_VGPRS, // Where SGPR starts.
165};
166
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000167void addWait(AMDGPU::Waitcnt &Wait, InstCounterType T, unsigned Count) {
168 switch (T) {
169 case VM_CNT:
170 Wait.VmCnt = std::min(Wait.VmCnt, Count);
171 break;
172 case EXP_CNT:
173 Wait.ExpCnt = std::min(Wait.ExpCnt, Count);
174 break;
175 case LGKM_CNT:
176 Wait.LgkmCnt = std::min(Wait.LgkmCnt, Count);
177 break;
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +0000178 case VS_CNT:
179 Wait.VsCnt = std::min(Wait.VsCnt, Count);
180 break;
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000181 default:
182 llvm_unreachable("bad InstCounterType");
183 }
184}
185
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000186// This objects maintains the current score brackets of each wait counter, and
187// a per-register scoreboard for each wait counter.
188//
Kannan Narayananacb089e2017-04-12 03:25:12 +0000189// We also maintain the latest score for every event type that can change the
190// waitcnt in order to know if there are multiple types of events within
191// the brackets. When multiple types of event happen in the bracket,
Mark Searlesc3c02bd2018-03-14 22:04:32 +0000192// wait count may get decreased out of order, therefore we need to put in
Kannan Narayananacb089e2017-04-12 03:25:12 +0000193// "s_waitcnt 0" before use.
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000194class WaitcntBrackets {
Kannan Narayananacb089e2017-04-12 03:25:12 +0000195public:
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000196 WaitcntBrackets(const GCNSubtarget *SubTarget) : ST(SubTarget) {
Nicolai Haehnleae369d72018-11-29 11:06:11 +0000197 for (auto T : inst_counter_types())
Eugene Zelenko59e12822017-08-08 00:47:13 +0000198 memset(VgprScores[T], 0, sizeof(VgprScores[T]));
Eugene Zelenko59e12822017-08-08 00:47:13 +0000199 }
200
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000201 static uint32_t getWaitCountMax(InstCounterType T) {
Kannan Narayananacb089e2017-04-12 03:25:12 +0000202 switch (T) {
203 case VM_CNT:
204 return HardwareLimits.VmcntMax;
205 case LGKM_CNT:
206 return HardwareLimits.LgkmcntMax;
207 case EXP_CNT:
208 return HardwareLimits.ExpcntMax;
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +0000209 case VS_CNT:
210 return HardwareLimits.VscntMax;
Kannan Narayananacb089e2017-04-12 03:25:12 +0000211 default:
212 break;
213 }
214 return 0;
Eugene Zelenko59e12822017-08-08 00:47:13 +0000215 }
Kannan Narayananacb089e2017-04-12 03:25:12 +0000216
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000217 uint32_t getScoreLB(InstCounterType T) const {
Kannan Narayananacb089e2017-04-12 03:25:12 +0000218 assert(T < NUM_INST_CNTS);
219 if (T >= NUM_INST_CNTS)
220 return 0;
221 return ScoreLBs[T];
Eugene Zelenko59e12822017-08-08 00:47:13 +0000222 }
Kannan Narayananacb089e2017-04-12 03:25:12 +0000223
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000224 uint32_t getScoreUB(InstCounterType T) const {
Kannan Narayananacb089e2017-04-12 03:25:12 +0000225 assert(T < NUM_INST_CNTS);
226 if (T >= NUM_INST_CNTS)
227 return 0;
228 return ScoreUBs[T];
Eugene Zelenko59e12822017-08-08 00:47:13 +0000229 }
Kannan Narayananacb089e2017-04-12 03:25:12 +0000230
231 // Mapping from event to counter.
232 InstCounterType eventCounter(WaitEventType E) {
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +0000233 if (WaitEventMaskForInst[VM_CNT] & (1 << E))
Kannan Narayananacb089e2017-04-12 03:25:12 +0000234 return VM_CNT;
Nicolai Haehnled1f45da2018-11-29 11:06:14 +0000235 if (WaitEventMaskForInst[LGKM_CNT] & (1 << E))
Kannan Narayananacb089e2017-04-12 03:25:12 +0000236 return LGKM_CNT;
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +0000237 if (WaitEventMaskForInst[VS_CNT] & (1 << E))
238 return VS_CNT;
Nicolai Haehnled1f45da2018-11-29 11:06:14 +0000239 assert(WaitEventMaskForInst[EXP_CNT] & (1 << E));
240 return EXP_CNT;
Kannan Narayananacb089e2017-04-12 03:25:12 +0000241 }
242
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000243 uint32_t getRegScore(int GprNo, InstCounterType T) {
Kannan Narayananacb089e2017-04-12 03:25:12 +0000244 if (GprNo < NUM_ALL_VGPRS) {
245 return VgprScores[T][GprNo];
246 }
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000247 assert(T == LGKM_CNT);
Kannan Narayananacb089e2017-04-12 03:25:12 +0000248 return SgprScores[GprNo - NUM_ALL_VGPRS];
249 }
250
251 void clear() {
252 memset(ScoreLBs, 0, sizeof(ScoreLBs));
253 memset(ScoreUBs, 0, sizeof(ScoreUBs));
Nicolai Haehnled1f45da2018-11-29 11:06:14 +0000254 PendingEvents = 0;
255 memset(MixedPendingEvents, 0, sizeof(MixedPendingEvents));
Nicolai Haehnleae369d72018-11-29 11:06:11 +0000256 for (auto T : inst_counter_types())
Kannan Narayananacb089e2017-04-12 03:25:12 +0000257 memset(VgprScores[T], 0, sizeof(VgprScores[T]));
Kannan Narayananacb089e2017-04-12 03:25:12 +0000258 memset(SgprScores, 0, sizeof(SgprScores));
259 }
260
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000261 bool merge(const WaitcntBrackets &Other);
262
Kannan Narayananacb089e2017-04-12 03:25:12 +0000263 RegInterval getRegInterval(const MachineInstr *MI, const SIInstrInfo *TII,
264 const MachineRegisterInfo *MRI,
265 const SIRegisterInfo *TRI, unsigned OpNo,
266 bool Def) const;
267
Kannan Narayananacb089e2017-04-12 03:25:12 +0000268 int32_t getMaxVGPR() const { return VgprUB; }
269 int32_t getMaxSGPR() const { return SgprUB; }
Eugene Zelenko59e12822017-08-08 00:47:13 +0000270
Nicolai Haehnlec548d912018-11-19 12:03:11 +0000271 bool counterOutOfOrder(InstCounterType T) const;
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000272 bool simplifyWaitcnt(AMDGPU::Waitcnt &Wait) const;
273 bool simplifyWaitcnt(InstCounterType T, unsigned &Count) const;
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000274 void determineWait(InstCounterType T, uint32_t ScoreToWait,
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000275 AMDGPU::Waitcnt &Wait) const;
276 void applyWaitcnt(const AMDGPU::Waitcnt &Wait);
277 void applyWaitcnt(InstCounterType T, unsigned Count);
Kannan Narayananacb089e2017-04-12 03:25:12 +0000278 void updateByEvent(const SIInstrInfo *TII, const SIRegisterInfo *TRI,
279 const MachineRegisterInfo *MRI, WaitEventType E,
280 MachineInstr &MI);
281
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000282 bool hasPending() const { return PendingEvents != 0; }
Nicolai Haehnled1f45da2018-11-29 11:06:14 +0000283 bool hasPendingEvent(WaitEventType E) const {
284 return PendingEvents & (1 << E);
Kannan Narayananacb089e2017-04-12 03:25:12 +0000285 }
286
287 bool hasPendingFlat() const {
288 return ((LastFlat[LGKM_CNT] > ScoreLBs[LGKM_CNT] &&
289 LastFlat[LGKM_CNT] <= ScoreUBs[LGKM_CNT]) ||
290 (LastFlat[VM_CNT] > ScoreLBs[VM_CNT] &&
291 LastFlat[VM_CNT] <= ScoreUBs[VM_CNT]));
292 }
293
294 void setPendingFlat() {
295 LastFlat[VM_CNT] = ScoreUBs[VM_CNT];
296 LastFlat[LGKM_CNT] = ScoreUBs[LGKM_CNT];
297 }
298
Kannan Narayananacb089e2017-04-12 03:25:12 +0000299 void print(raw_ostream &);
300 void dump() { print(dbgs()); }
301
302private:
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000303 struct MergeInfo {
304 uint32_t OldLB;
305 uint32_t OtherLB;
306 uint32_t MyShift;
307 uint32_t OtherShift;
308 };
309 static bool mergeScore(const MergeInfo &M, uint32_t &Score,
310 uint32_t OtherScore);
311
312 void setScoreLB(InstCounterType T, uint32_t Val) {
313 assert(T < NUM_INST_CNTS);
314 if (T >= NUM_INST_CNTS)
315 return;
316 ScoreLBs[T] = Val;
317 }
318
319 void setScoreUB(InstCounterType T, uint32_t Val) {
320 assert(T < NUM_INST_CNTS);
321 if (T >= NUM_INST_CNTS)
322 return;
323 ScoreUBs[T] = Val;
324 if (T == EXP_CNT) {
325 uint32_t UB = ScoreUBs[T] - getWaitCountMax(EXP_CNT);
326 if (ScoreLBs[T] < UB && UB < ScoreUBs[T])
327 ScoreLBs[T] = UB;
328 }
329 }
330
331 void setRegScore(int GprNo, InstCounterType T, uint32_t Val) {
332 if (GprNo < NUM_ALL_VGPRS) {
333 if (GprNo > VgprUB) {
334 VgprUB = GprNo;
335 }
336 VgprScores[T][GprNo] = Val;
337 } else {
338 assert(T == LGKM_CNT);
339 if (GprNo - NUM_ALL_VGPRS > SgprUB) {
340 SgprUB = GprNo - NUM_ALL_VGPRS;
341 }
342 SgprScores[GprNo - NUM_ALL_VGPRS] = Val;
343 }
344 }
345
346 void setExpScore(const MachineInstr *MI, const SIInstrInfo *TII,
347 const SIRegisterInfo *TRI, const MachineRegisterInfo *MRI,
348 unsigned OpNo, uint32_t Val);
349
Tom Stellard5bfbae52018-07-11 20:59:01 +0000350 const GCNSubtarget *ST = nullptr;
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000351 uint32_t ScoreLBs[NUM_INST_CNTS] = {0};
352 uint32_t ScoreUBs[NUM_INST_CNTS] = {0};
Nicolai Haehnled1f45da2018-11-29 11:06:14 +0000353 uint32_t PendingEvents = 0;
354 bool MixedPendingEvents[NUM_INST_CNTS] = {false};
Kannan Narayananacb089e2017-04-12 03:25:12 +0000355 // Remember the last flat memory operation.
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000356 uint32_t LastFlat[NUM_INST_CNTS] = {0};
Kannan Narayananacb089e2017-04-12 03:25:12 +0000357 // wait_cnt scores for every vgpr.
358 // Keep track of the VgprUB and SgprUB to make merge at join efficient.
Eugene Zelenko59e12822017-08-08 00:47:13 +0000359 int32_t VgprUB = 0;
360 int32_t SgprUB = 0;
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000361 uint32_t VgprScores[NUM_INST_CNTS][NUM_ALL_VGPRS];
Kannan Narayananacb089e2017-04-12 03:25:12 +0000362 // Wait cnt scores for every sgpr, only lgkmcnt is relevant.
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000363 uint32_t SgprScores[SQ_MAX_PGM_SGPRS] = {0};
Kannan Narayananacb089e2017-04-12 03:25:12 +0000364};
365
Kannan Narayananacb089e2017-04-12 03:25:12 +0000366class SIInsertWaitcnts : public MachineFunctionPass {
Kannan Narayananacb089e2017-04-12 03:25:12 +0000367private:
Tom Stellard5bfbae52018-07-11 20:59:01 +0000368 const GCNSubtarget *ST = nullptr;
Eugene Zelenko59e12822017-08-08 00:47:13 +0000369 const SIInstrInfo *TII = nullptr;
370 const SIRegisterInfo *TRI = nullptr;
371 const MachineRegisterInfo *MRI = nullptr;
Konstantin Zhuravlyov71e43ee2018-09-12 18:50:47 +0000372 AMDGPU::IsaVersion IV;
Kannan Narayananacb089e2017-04-12 03:25:12 +0000373
Mark Searles24c92ee2018-02-07 02:21:21 +0000374 DenseSet<MachineInstr *> TrackedWaitcntSet;
Kannan Narayananacb089e2017-04-12 03:25:12 +0000375
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000376 struct BlockInfo {
377 MachineBasicBlock *MBB;
378 std::unique_ptr<WaitcntBrackets> Incoming;
379 bool Dirty = true;
Kannan Narayananacb089e2017-04-12 03:25:12 +0000380
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000381 explicit BlockInfo(MachineBasicBlock *MBB) : MBB(MBB) {}
382 };
Kannan Narayananacb089e2017-04-12 03:25:12 +0000383
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000384 std::vector<BlockInfo> BlockInfos; // by reverse post-order traversal index
385 DenseMap<MachineBasicBlock *, unsigned> RpotIdxMap;
Kannan Narayananacb089e2017-04-12 03:25:12 +0000386
Mark Searles4a0f2c52018-05-07 14:43:28 +0000387 // ForceEmitZeroWaitcnts: force all waitcnts insts to be s_waitcnt 0
388 // because of amdgpu-waitcnt-forcezero flag
389 bool ForceEmitZeroWaitcnts;
Mark Searlesec581832018-04-25 19:21:26 +0000390 bool ForceEmitWaitcnt[NUM_INST_CNTS];
391
Kannan Narayananacb089e2017-04-12 03:25:12 +0000392public:
393 static char ID;
394
Konstantin Zhuravlyov77747772018-06-26 21:33:38 +0000395 SIInsertWaitcnts() : MachineFunctionPass(ID) {
396 (void)ForceExpCounter;
397 (void)ForceLgkmCounter;
398 (void)ForceVMCounter;
399 }
Kannan Narayananacb089e2017-04-12 03:25:12 +0000400
401 bool runOnMachineFunction(MachineFunction &MF) override;
402
403 StringRef getPassName() const override {
404 return "SI insert wait instructions";
405 }
406
407 void getAnalysisUsage(AnalysisUsage &AU) const override {
408 AU.setPreservesCFG();
Kannan Narayananacb089e2017-04-12 03:25:12 +0000409 MachineFunctionPass::getAnalysisUsage(AU);
410 }
411
Mark Searlesec581832018-04-25 19:21:26 +0000412 bool isForceEmitWaitcnt() const {
Nicolai Haehnleae369d72018-11-29 11:06:11 +0000413 for (auto T : inst_counter_types())
Mark Searlesec581832018-04-25 19:21:26 +0000414 if (ForceEmitWaitcnt[T])
415 return true;
416 return false;
417 }
418
419 void setForceEmitWaitcnt() {
420// For non-debug builds, ForceEmitWaitcnt has been initialized to false;
421// For debug builds, get the debug counter info and adjust if need be
422#ifndef NDEBUG
423 if (DebugCounter::isCounterSet(ForceExpCounter) &&
424 DebugCounter::shouldExecute(ForceExpCounter)) {
425 ForceEmitWaitcnt[EXP_CNT] = true;
426 } else {
427 ForceEmitWaitcnt[EXP_CNT] = false;
428 }
429
430 if (DebugCounter::isCounterSet(ForceLgkmCounter) &&
431 DebugCounter::shouldExecute(ForceLgkmCounter)) {
432 ForceEmitWaitcnt[LGKM_CNT] = true;
433 } else {
434 ForceEmitWaitcnt[LGKM_CNT] = false;
435 }
436
437 if (DebugCounter::isCounterSet(ForceVMCounter) &&
438 DebugCounter::shouldExecute(ForceVMCounter)) {
439 ForceEmitWaitcnt[VM_CNT] = true;
440 } else {
441 ForceEmitWaitcnt[VM_CNT] = false;
442 }
443#endif // NDEBUG
444 }
445
Matt Arsenault0ed39d32017-07-21 18:54:54 +0000446 bool mayAccessLDSThroughFlat(const MachineInstr &MI) const;
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000447 bool generateWaitcntInstBefore(MachineInstr &MI,
448 WaitcntBrackets &ScoreBrackets,
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000449 MachineInstr *OldWaitcntInstr);
Mark Searles70901b92018-04-24 15:59:59 +0000450 void updateEventWaitcntAfter(MachineInstr &Inst,
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000451 WaitcntBrackets *ScoreBrackets);
452 bool insertWaitcntInBlock(MachineFunction &MF, MachineBasicBlock &Block,
453 WaitcntBrackets &ScoreBrackets);
Kannan Narayananacb089e2017-04-12 03:25:12 +0000454};
455
Eugene Zelenko59e12822017-08-08 00:47:13 +0000456} // end anonymous namespace
Kannan Narayananacb089e2017-04-12 03:25:12 +0000457
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000458RegInterval WaitcntBrackets::getRegInterval(const MachineInstr *MI,
459 const SIInstrInfo *TII,
460 const MachineRegisterInfo *MRI,
461 const SIRegisterInfo *TRI,
462 unsigned OpNo, bool Def) const {
Kannan Narayananacb089e2017-04-12 03:25:12 +0000463 const MachineOperand &Op = MI->getOperand(OpNo);
464 if (!Op.isReg() || !TRI->isInAllocatableClass(Op.getReg()) ||
Stanislav Mekhanoshine67cc382019-07-11 21:19:33 +0000465 (Def && !Op.isDef()) || TRI->isAGPR(*MRI, Op.getReg()))
Kannan Narayananacb089e2017-04-12 03:25:12 +0000466 return {-1, -1};
467
468 // A use via a PW operand does not need a waitcnt.
469 // A partial write is not a WAW.
470 assert(!Op.getSubReg() || !Op.isUndef());
471
472 RegInterval Result;
473 const MachineRegisterInfo &MRIA = *MRI;
474
475 unsigned Reg = TRI->getEncodingValue(Op.getReg());
476
477 if (TRI->isVGPR(MRIA, Op.getReg())) {
478 assert(Reg >= RegisterEncoding.VGPR0 && Reg <= RegisterEncoding.VGPRL);
479 Result.first = Reg - RegisterEncoding.VGPR0;
480 assert(Result.first >= 0 && Result.first < SQ_MAX_PGM_VGPRS);
481 } else if (TRI->isSGPRReg(MRIA, Op.getReg())) {
482 assert(Reg >= RegisterEncoding.SGPR0 && Reg < SQ_MAX_PGM_SGPRS);
483 Result.first = Reg - RegisterEncoding.SGPR0 + NUM_ALL_VGPRS;
484 assert(Result.first >= NUM_ALL_VGPRS &&
485 Result.first < SQ_MAX_PGM_SGPRS + NUM_ALL_VGPRS);
486 }
487 // TODO: Handle TTMP
488 // else if (TRI->isTTMP(MRIA, Reg.getReg())) ...
489 else
490 return {-1, -1};
491
492 const MachineInstr &MIA = *MI;
493 const TargetRegisterClass *RC = TII->getOpRegClass(MIA, OpNo);
Krzysztof Parzyszek44e25f32017-04-24 18:55:33 +0000494 unsigned Size = TRI->getRegSizeInBits(*RC);
495 Result.second = Result.first + (Size / 32);
Kannan Narayananacb089e2017-04-12 03:25:12 +0000496
497 return Result;
498}
499
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000500void WaitcntBrackets::setExpScore(const MachineInstr *MI,
501 const SIInstrInfo *TII,
502 const SIRegisterInfo *TRI,
503 const MachineRegisterInfo *MRI, unsigned OpNo,
504 uint32_t Val) {
Kannan Narayananacb089e2017-04-12 03:25:12 +0000505 RegInterval Interval = getRegInterval(MI, TII, MRI, TRI, OpNo, false);
Nicola Zaghend34e60c2018-05-14 12:53:11 +0000506 LLVM_DEBUG({
Kannan Narayananacb089e2017-04-12 03:25:12 +0000507 const MachineOperand &Opnd = MI->getOperand(OpNo);
508 assert(TRI->isVGPR(*MRI, Opnd.getReg()));
509 });
510 for (signed RegNo = Interval.first; RegNo < Interval.second; ++RegNo) {
511 setRegScore(RegNo, EXP_CNT, Val);
512 }
513}
514
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000515void WaitcntBrackets::updateByEvent(const SIInstrInfo *TII,
516 const SIRegisterInfo *TRI,
517 const MachineRegisterInfo *MRI,
518 WaitEventType E, MachineInstr &Inst) {
Kannan Narayananacb089e2017-04-12 03:25:12 +0000519 const MachineRegisterInfo &MRIA = *MRI;
520 InstCounterType T = eventCounter(E);
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000521 uint32_t CurrScore = getScoreUB(T) + 1;
522 if (CurrScore == 0)
523 report_fatal_error("InsertWaitcnt score wraparound");
Nicolai Haehnled1f45da2018-11-29 11:06:14 +0000524 // PendingEvents and ScoreUB need to be update regardless if this event
525 // changes the score of a register or not.
Kannan Narayananacb089e2017-04-12 03:25:12 +0000526 // Examples including vm_cnt when buffer-store or lgkm_cnt when send-message.
Nicolai Haehnled1f45da2018-11-29 11:06:14 +0000527 if (!hasPendingEvent(E)) {
528 if (PendingEvents & WaitEventMaskForInst[T])
529 MixedPendingEvents[T] = true;
530 PendingEvents |= 1 << E;
531 }
Kannan Narayananacb089e2017-04-12 03:25:12 +0000532 setScoreUB(T, CurrScore);
533
534 if (T == EXP_CNT) {
Kannan Narayananacb089e2017-04-12 03:25:12 +0000535 // Put score on the source vgprs. If this is a store, just use those
536 // specific register(s).
537 if (TII->isDS(Inst) && (Inst.mayStore() || Inst.mayLoad())) {
Matt Arsenault4d55d022019-06-19 19:55:27 +0000538 int AddrOpIdx =
539 AMDGPU::getNamedOperandIdx(Inst.getOpcode(), AMDGPU::OpName::addr);
Kannan Narayananacb089e2017-04-12 03:25:12 +0000540 // All GDS operations must protect their address register (same as
541 // export.)
Matt Arsenault4d55d022019-06-19 19:55:27 +0000542 if (AddrOpIdx != -1) {
543 setExpScore(&Inst, TII, TRI, MRI, AddrOpIdx, CurrScore);
Kannan Narayananacb089e2017-04-12 03:25:12 +0000544 }
Matt Arsenault4d55d022019-06-19 19:55:27 +0000545
Kannan Narayananacb089e2017-04-12 03:25:12 +0000546 if (Inst.mayStore()) {
Marek Olsakc5cec5e2019-01-16 15:43:53 +0000547 if (AMDGPU::getNamedOperandIdx(Inst.getOpcode(),
548 AMDGPU::OpName::data0) != -1) {
549 setExpScore(
550 &Inst, TII, TRI, MRI,
551 AMDGPU::getNamedOperandIdx(Inst.getOpcode(), AMDGPU::OpName::data0),
552 CurrScore);
553 }
Kannan Narayananacb089e2017-04-12 03:25:12 +0000554 if (AMDGPU::getNamedOperandIdx(Inst.getOpcode(),
555 AMDGPU::OpName::data1) != -1) {
556 setExpScore(&Inst, TII, TRI, MRI,
557 AMDGPU::getNamedOperandIdx(Inst.getOpcode(),
558 AMDGPU::OpName::data1),
559 CurrScore);
560 }
561 } else if (AMDGPU::getAtomicNoRetOp(Inst.getOpcode()) != -1 &&
562 Inst.getOpcode() != AMDGPU::DS_GWS_INIT &&
563 Inst.getOpcode() != AMDGPU::DS_GWS_SEMA_V &&
564 Inst.getOpcode() != AMDGPU::DS_GWS_SEMA_BR &&
565 Inst.getOpcode() != AMDGPU::DS_GWS_SEMA_P &&
566 Inst.getOpcode() != AMDGPU::DS_GWS_BARRIER &&
567 Inst.getOpcode() != AMDGPU::DS_APPEND &&
568 Inst.getOpcode() != AMDGPU::DS_CONSUME &&
569 Inst.getOpcode() != AMDGPU::DS_ORDERED_COUNT) {
570 for (unsigned I = 0, E = Inst.getNumOperands(); I != E; ++I) {
571 const MachineOperand &Op = Inst.getOperand(I);
572 if (Op.isReg() && !Op.isDef() && TRI->isVGPR(MRIA, Op.getReg())) {
573 setExpScore(&Inst, TII, TRI, MRI, I, CurrScore);
574 }
575 }
576 }
577 } else if (TII->isFLAT(Inst)) {
578 if (Inst.mayStore()) {
579 setExpScore(
580 &Inst, TII, TRI, MRI,
581 AMDGPU::getNamedOperandIdx(Inst.getOpcode(), AMDGPU::OpName::data),
582 CurrScore);
583 } else if (AMDGPU::getAtomicNoRetOp(Inst.getOpcode()) != -1) {
584 setExpScore(
585 &Inst, TII, TRI, MRI,
586 AMDGPU::getNamedOperandIdx(Inst.getOpcode(), AMDGPU::OpName::data),
587 CurrScore);
588 }
589 } else if (TII->isMIMG(Inst)) {
590 if (Inst.mayStore()) {
591 setExpScore(&Inst, TII, TRI, MRI, 0, CurrScore);
592 } else if (AMDGPU::getAtomicNoRetOp(Inst.getOpcode()) != -1) {
593 setExpScore(
594 &Inst, TII, TRI, MRI,
595 AMDGPU::getNamedOperandIdx(Inst.getOpcode(), AMDGPU::OpName::data),
596 CurrScore);
597 }
598 } else if (TII->isMTBUF(Inst)) {
599 if (Inst.mayStore()) {
600 setExpScore(&Inst, TII, TRI, MRI, 0, CurrScore);
601 }
602 } else if (TII->isMUBUF(Inst)) {
603 if (Inst.mayStore()) {
604 setExpScore(&Inst, TII, TRI, MRI, 0, CurrScore);
605 } else if (AMDGPU::getAtomicNoRetOp(Inst.getOpcode()) != -1) {
606 setExpScore(
607 &Inst, TII, TRI, MRI,
608 AMDGPU::getNamedOperandIdx(Inst.getOpcode(), AMDGPU::OpName::data),
609 CurrScore);
610 }
611 } else {
612 if (TII->isEXP(Inst)) {
613 // For export the destination registers are really temps that
614 // can be used as the actual source after export patching, so
615 // we need to treat them like sources and set the EXP_CNT
616 // score.
617 for (unsigned I = 0, E = Inst.getNumOperands(); I != E; ++I) {
618 MachineOperand &DefMO = Inst.getOperand(I);
619 if (DefMO.isReg() && DefMO.isDef() &&
620 TRI->isVGPR(MRIA, DefMO.getReg())) {
621 setRegScore(TRI->getEncodingValue(DefMO.getReg()), EXP_CNT,
622 CurrScore);
623 }
624 }
625 }
626 for (unsigned I = 0, E = Inst.getNumOperands(); I != E; ++I) {
627 MachineOperand &MO = Inst.getOperand(I);
628 if (MO.isReg() && !MO.isDef() && TRI->isVGPR(MRIA, MO.getReg())) {
629 setExpScore(&Inst, TII, TRI, MRI, I, CurrScore);
630 }
631 }
632 }
633#if 0 // TODO: check if this is handled by MUBUF code above.
634 } else if (Inst.getOpcode() == AMDGPU::BUFFER_STORE_DWORD ||
Evgeny Mankovbf975172017-08-16 16:47:29 +0000635 Inst.getOpcode() == AMDGPU::BUFFER_STORE_DWORDX2 ||
636 Inst.getOpcode() == AMDGPU::BUFFER_STORE_DWORDX4) {
Kannan Narayananacb089e2017-04-12 03:25:12 +0000637 MachineOperand *MO = TII->getNamedOperand(Inst, AMDGPU::OpName::data);
638 unsigned OpNo;//TODO: find the OpNo for this operand;
639 RegInterval Interval = getRegInterval(&Inst, TII, MRI, TRI, OpNo, false);
640 for (signed RegNo = Interval.first; RegNo < Interval.second;
Evgeny Mankovbf975172017-08-16 16:47:29 +0000641 ++RegNo) {
Kannan Narayananacb089e2017-04-12 03:25:12 +0000642 setRegScore(RegNo + NUM_ALL_VGPRS, t, CurrScore);
643 }
644#endif
645 } else {
646 // Match the score to the destination registers.
647 for (unsigned I = 0, E = Inst.getNumOperands(); I != E; ++I) {
648 RegInterval Interval = getRegInterval(&Inst, TII, MRI, TRI, I, true);
649 if (T == VM_CNT && Interval.first >= NUM_ALL_VGPRS)
650 continue;
651 for (signed RegNo = Interval.first; RegNo < Interval.second; ++RegNo) {
652 setRegScore(RegNo, T, CurrScore);
653 }
654 }
655 if (TII->isDS(Inst) && Inst.mayStore()) {
656 setRegScore(SQ_MAX_PGM_VGPRS + EXTRA_VGPR_LDS, T, CurrScore);
657 }
658 }
659}
660
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000661void WaitcntBrackets::print(raw_ostream &OS) {
Kannan Narayananacb089e2017-04-12 03:25:12 +0000662 OS << '\n';
Nicolai Haehnleae369d72018-11-29 11:06:11 +0000663 for (auto T : inst_counter_types()) {
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000664 uint32_t LB = getScoreLB(T);
665 uint32_t UB = getScoreUB(T);
Kannan Narayananacb089e2017-04-12 03:25:12 +0000666
667 switch (T) {
668 case VM_CNT:
669 OS << " VM_CNT(" << UB - LB << "): ";
670 break;
671 case LGKM_CNT:
672 OS << " LGKM_CNT(" << UB - LB << "): ";
673 break;
674 case EXP_CNT:
675 OS << " EXP_CNT(" << UB - LB << "): ";
676 break;
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +0000677 case VS_CNT:
678 OS << " VS_CNT(" << UB - LB << "): ";
679 break;
Kannan Narayananacb089e2017-04-12 03:25:12 +0000680 default:
681 OS << " UNKNOWN(" << UB - LB << "): ";
682 break;
683 }
684
685 if (LB < UB) {
686 // Print vgpr scores.
687 for (int J = 0; J <= getMaxVGPR(); J++) {
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000688 uint32_t RegScore = getRegScore(J, T);
Kannan Narayananacb089e2017-04-12 03:25:12 +0000689 if (RegScore <= LB)
690 continue;
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000691 uint32_t RelScore = RegScore - LB - 1;
Kannan Narayananacb089e2017-04-12 03:25:12 +0000692 if (J < SQ_MAX_PGM_VGPRS + EXTRA_VGPR_LDS) {
693 OS << RelScore << ":v" << J << " ";
694 } else {
695 OS << RelScore << ":ds ";
696 }
697 }
698 // Also need to print sgpr scores for lgkm_cnt.
699 if (T == LGKM_CNT) {
700 for (int J = 0; J <= getMaxSGPR(); J++) {
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000701 uint32_t RegScore = getRegScore(J + NUM_ALL_VGPRS, LGKM_CNT);
Kannan Narayananacb089e2017-04-12 03:25:12 +0000702 if (RegScore <= LB)
703 continue;
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000704 uint32_t RelScore = RegScore - LB - 1;
Kannan Narayananacb089e2017-04-12 03:25:12 +0000705 OS << RelScore << ":s" << J << " ";
706 }
707 }
708 }
709 OS << '\n';
710 }
711 OS << '\n';
Kannan Narayananacb089e2017-04-12 03:25:12 +0000712}
713
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000714/// Simplify the waitcnt, in the sense of removing redundant counts, and return
715/// whether a waitcnt instruction is needed at all.
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000716bool WaitcntBrackets::simplifyWaitcnt(AMDGPU::Waitcnt &Wait) const {
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000717 return simplifyWaitcnt(VM_CNT, Wait.VmCnt) |
718 simplifyWaitcnt(EXP_CNT, Wait.ExpCnt) |
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +0000719 simplifyWaitcnt(LGKM_CNT, Wait.LgkmCnt) |
720 simplifyWaitcnt(VS_CNT, Wait.VsCnt);
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000721}
722
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000723bool WaitcntBrackets::simplifyWaitcnt(InstCounterType T,
724 unsigned &Count) const {
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000725 const uint32_t LB = getScoreLB(T);
726 const uint32_t UB = getScoreUB(T);
727 if (Count < UB && UB - Count > LB)
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000728 return true;
729
730 Count = ~0u;
731 return false;
732}
733
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000734void WaitcntBrackets::determineWait(InstCounterType T, uint32_t ScoreToWait,
735 AMDGPU::Waitcnt &Wait) const {
Kannan Narayananacb089e2017-04-12 03:25:12 +0000736 // If the score of src_operand falls within the bracket, we need an
737 // s_waitcnt instruction.
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000738 const uint32_t LB = getScoreLB(T);
739 const uint32_t UB = getScoreUB(T);
Kannan Narayananacb089e2017-04-12 03:25:12 +0000740 if ((UB >= ScoreToWait) && (ScoreToWait > LB)) {
Mark Searlesf0b93f12018-06-04 16:51:59 +0000741 if ((T == VM_CNT || T == LGKM_CNT) &&
742 hasPendingFlat() &&
743 !ST->hasFlatLgkmVMemCountInOrder()) {
744 // If there is a pending FLAT operation, and this is a VMem or LGKM
745 // waitcnt and the target can report early completion, then we need
746 // to force a waitcnt 0.
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000747 addWait(Wait, T, 0);
Kannan Narayananacb089e2017-04-12 03:25:12 +0000748 } else if (counterOutOfOrder(T)) {
749 // Counter can get decremented out-of-order when there
Mark Searlesc3c02bd2018-03-14 22:04:32 +0000750 // are multiple types event in the bracket. Also emit an s_wait counter
Kannan Narayananacb089e2017-04-12 03:25:12 +0000751 // with a conservative value of 0 for the counter.
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000752 addWait(Wait, T, 0);
Kannan Narayananacb089e2017-04-12 03:25:12 +0000753 } else {
Austin Kerbowfef69702019-11-02 14:48:40 -0700754 // If a counter has been maxed out avoid overflow by waiting for
755 // MAX(CounterType) - 1 instead.
756 uint32_t NeededWait = std::min(UB - ScoreToWait, getWaitCountMax(T) - 1);
757 addWait(Wait, T, NeededWait);
Kannan Narayananacb089e2017-04-12 03:25:12 +0000758 }
759 }
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000760}
Kannan Narayananacb089e2017-04-12 03:25:12 +0000761
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000762void WaitcntBrackets::applyWaitcnt(const AMDGPU::Waitcnt &Wait) {
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000763 applyWaitcnt(VM_CNT, Wait.VmCnt);
764 applyWaitcnt(EXP_CNT, Wait.ExpCnt);
765 applyWaitcnt(LGKM_CNT, Wait.LgkmCnt);
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +0000766 applyWaitcnt(VS_CNT, Wait.VsCnt);
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000767}
768
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000769void WaitcntBrackets::applyWaitcnt(InstCounterType T, unsigned Count) {
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000770 const uint32_t UB = getScoreUB(T);
771 if (Count >= UB)
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000772 return;
773 if (Count != 0) {
774 if (counterOutOfOrder(T))
775 return;
Nicolai Haehnleab43bf62018-11-29 11:06:21 +0000776 setScoreLB(T, std::max(getScoreLB(T), UB - Count));
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000777 } else {
778 setScoreLB(T, UB);
Nicolai Haehnled1f45da2018-11-29 11:06:14 +0000779 MixedPendingEvents[T] = false;
780 PendingEvents &= ~WaitEventMaskForInst[T];
781 }
782}
783
Kannan Narayananacb089e2017-04-12 03:25:12 +0000784// Where there are multiple types of event in the bracket of a counter,
785// the decrement may go out of order.
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000786bool WaitcntBrackets::counterOutOfOrder(InstCounterType T) const {
Nicolai Haehnled1f45da2018-11-29 11:06:14 +0000787 // Scalar memory read always can go out of order.
788 if (T == LGKM_CNT && hasPendingEvent(SMEM_ACCESS))
789 return true;
790 return MixedPendingEvents[T];
Kannan Narayananacb089e2017-04-12 03:25:12 +0000791}
792
793INITIALIZE_PASS_BEGIN(SIInsertWaitcnts, DEBUG_TYPE, "SI Insert Waitcnts", false,
794 false)
795INITIALIZE_PASS_END(SIInsertWaitcnts, DEBUG_TYPE, "SI Insert Waitcnts", false,
796 false)
797
798char SIInsertWaitcnts::ID = 0;
799
800char &llvm::SIInsertWaitcntsID = SIInsertWaitcnts::ID;
801
802FunctionPass *llvm::createSIInsertWaitcntsPass() {
803 return new SIInsertWaitcnts();
804}
805
806static bool readsVCCZ(const MachineInstr &MI) {
807 unsigned Opc = MI.getOpcode();
808 return (Opc == AMDGPU::S_CBRANCH_VCCNZ || Opc == AMDGPU::S_CBRANCH_VCCZ) &&
809 !MI.getOperand(1).isUndef();
810}
811
Matt Arsenaultaa41e922019-06-14 21:52:26 +0000812/// \returns true if the callee inserts an s_waitcnt 0 on function entry.
813static bool callWaitsOnFunctionEntry(const MachineInstr &MI) {
814 // Currently all conventions wait, but this may not always be the case.
815 //
816 // TODO: If IPRA is enabled, and the callee is isSafeForNoCSROpt, it may make
817 // senses to omit the wait and do it in the caller.
818 return true;
819}
820
821/// \returns true if the callee is expected to wait for any outstanding waits
822/// before returning.
823static bool callWaitsOnFunctionReturn(const MachineInstr &MI) {
824 return true;
825}
826
Adrian Prantl5f8f34e42018-05-01 15:54:18 +0000827/// Generate s_waitcnt instruction to be placed before cur_Inst.
Kannan Narayananacb089e2017-04-12 03:25:12 +0000828/// Instructions of a given type are returned in order,
829/// but instructions of different types can complete out of order.
830/// We rely on this in-order completion
831/// and simply assign a score to the memory access instructions.
832/// We keep track of the active "score bracket" to determine
833/// if an access of a memory read requires an s_waitcnt
834/// and if so what the value of each counter is.
835/// The "score bracket" is bound by the lower bound and upper bound
836/// scores (*_score_LB and *_score_ub respectively).
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000837bool SIInsertWaitcnts::generateWaitcntInstBefore(
838 MachineInstr &MI, WaitcntBrackets &ScoreBrackets,
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000839 MachineInstr *OldWaitcntInstr) {
Mark Searles4a0f2c52018-05-07 14:43:28 +0000840 setForceEmitWaitcnt();
Mark Searlesec581832018-04-25 19:21:26 +0000841 bool IsForceEmitWaitcnt = isForceEmitWaitcnt();
842
Nicolai Haehnle61396ff2018-11-07 21:53:36 +0000843 if (MI.isDebugInstr())
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000844 return false;
Kannan Narayananacb089e2017-04-12 03:25:12 +0000845
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000846 AMDGPU::Waitcnt Wait;
847
Kannan Narayananacb089e2017-04-12 03:25:12 +0000848 // See if this instruction has a forced S_WAITCNT VM.
849 // TODO: Handle other cases of NeedsWaitcntVmBefore()
Nicolai Haehnlef96456c2018-11-29 11:06:18 +0000850 if (MI.getOpcode() == AMDGPU::BUFFER_WBINVL1 ||
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000851 MI.getOpcode() == AMDGPU::BUFFER_WBINVL1_SC ||
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +0000852 MI.getOpcode() == AMDGPU::BUFFER_WBINVL1_VOL ||
853 MI.getOpcode() == AMDGPU::BUFFER_GL0_INV ||
854 MI.getOpcode() == AMDGPU::BUFFER_GL1_INV) {
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000855 Wait.VmCnt = 0;
Kannan Narayananacb089e2017-04-12 03:25:12 +0000856 }
857
858 // All waits must be resolved at call return.
859 // NOTE: this could be improved with knowledge of all call sites or
860 // with knowledge of the called routines.
Tom Stellardc5a154d2018-06-28 23:47:12 +0000861 if (MI.getOpcode() == AMDGPU::SI_RETURN_TO_EPILOG ||
Matt Arsenaultaa41e922019-06-14 21:52:26 +0000862 MI.getOpcode() == AMDGPU::S_SETPC_B64_return ||
863 (MI.isReturn() && MI.isCall() && !callWaitsOnFunctionEntry(MI))) {
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +0000864 Wait = Wait.combined(AMDGPU::Waitcnt::allZero(IV));
Kannan Narayananacb089e2017-04-12 03:25:12 +0000865 }
866 // Resolve vm waits before gs-done.
867 else if ((MI.getOpcode() == AMDGPU::S_SENDMSG ||
868 MI.getOpcode() == AMDGPU::S_SENDMSGHALT) &&
869 ((MI.getOperand(0).getImm() & AMDGPU::SendMsg::ID_MASK_) ==
870 AMDGPU::SendMsg::ID_GS_DONE)) {
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +0000871 Wait.VmCnt = 0;
Kannan Narayananacb089e2017-04-12 03:25:12 +0000872 }
873#if 0 // TODO: the following blocks of logic when we have fence.
874 else if (MI.getOpcode() == SC_FENCE) {
875 const unsigned int group_size =
876 context->shader_info->GetMaxThreadGroupSize();
877 // group_size == 0 means thread group size is unknown at compile time
878 const bool group_is_multi_wave =
879 (group_size == 0 || group_size > target_info->GetWaveFrontSize());
880 const bool fence_is_global = !((SCInstInternalMisc*)Inst)->IsGroupFence();
881
882 for (unsigned int i = 0; i < Inst->NumSrcOperands(); i++) {
883 SCRegType src_type = Inst->GetSrcType(i);
884 switch (src_type) {
885 case SCMEM_LDS:
886 if (group_is_multi_wave ||
Evgeny Mankovbf975172017-08-16 16:47:29 +0000887 context->OptFlagIsOn(OPT_R1100_LDSMEM_FENCE_CHICKEN_BIT)) {
Mark Searles70901b92018-04-24 15:59:59 +0000888 EmitWaitcnt |= ScoreBrackets->updateByWait(LGKM_CNT,
Kannan Narayananacb089e2017-04-12 03:25:12 +0000889 ScoreBrackets->getScoreUB(LGKM_CNT));
890 // LDS may have to wait for VM_CNT after buffer load to LDS
891 if (target_info->HasBufferLoadToLDS()) {
Mark Searles70901b92018-04-24 15:59:59 +0000892 EmitWaitcnt |= ScoreBrackets->updateByWait(VM_CNT,
Kannan Narayananacb089e2017-04-12 03:25:12 +0000893 ScoreBrackets->getScoreUB(VM_CNT));
894 }
895 }
896 break;
897
898 case SCMEM_GDS:
899 if (group_is_multi_wave || fence_is_global) {
Mark Searles70901b92018-04-24 15:59:59 +0000900 EmitWaitcnt |= ScoreBrackets->updateByWait(EXP_CNT,
Evgeny Mankovbf975172017-08-16 16:47:29 +0000901 ScoreBrackets->getScoreUB(EXP_CNT));
Mark Searles70901b92018-04-24 15:59:59 +0000902 EmitWaitcnt |= ScoreBrackets->updateByWait(LGKM_CNT,
Evgeny Mankovbf975172017-08-16 16:47:29 +0000903 ScoreBrackets->getScoreUB(LGKM_CNT));
Kannan Narayananacb089e2017-04-12 03:25:12 +0000904 }
905 break;
906
907 case SCMEM_UAV:
908 case SCMEM_TFBUF:
909 case SCMEM_RING:
910 case SCMEM_SCATTER:
911 if (group_is_multi_wave || fence_is_global) {
Mark Searles70901b92018-04-24 15:59:59 +0000912 EmitWaitcnt |= ScoreBrackets->updateByWait(EXP_CNT,
Evgeny Mankovbf975172017-08-16 16:47:29 +0000913 ScoreBrackets->getScoreUB(EXP_CNT));
Mark Searles70901b92018-04-24 15:59:59 +0000914 EmitWaitcnt |= ScoreBrackets->updateByWait(VM_CNT,
Evgeny Mankovbf975172017-08-16 16:47:29 +0000915 ScoreBrackets->getScoreUB(VM_CNT));
Kannan Narayananacb089e2017-04-12 03:25:12 +0000916 }
917 break;
918
919 case SCMEM_SCRATCH:
920 default:
921 break;
922 }
923 }
924 }
925#endif
926
927 // Export & GDS instructions do not read the EXEC mask until after the export
928 // is granted (which can occur well after the instruction is issued).
929 // The shader program must flush all EXP operations on the export-count
930 // before overwriting the EXEC mask.
931 else {
932 if (MI.modifiesRegister(AMDGPU::EXEC, TRI)) {
933 // Export and GDS are tracked individually, either may trigger a waitcnt
934 // for EXEC.
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000935 if (ScoreBrackets.hasPendingEvent(EXP_GPR_LOCK) ||
936 ScoreBrackets.hasPendingEvent(EXP_PARAM_ACCESS) ||
937 ScoreBrackets.hasPendingEvent(EXP_POS_ACCESS) ||
938 ScoreBrackets.hasPendingEvent(GDS_GPR_LOCK)) {
Nicolai Haehnled1f45da2018-11-29 11:06:14 +0000939 Wait.ExpCnt = 0;
940 }
Kannan Narayananacb089e2017-04-12 03:25:12 +0000941 }
942
Matt Arsenaultaa41e922019-06-14 21:52:26 +0000943 if (MI.isCall() && callWaitsOnFunctionEntry(MI)) {
Austin Kerbowd11b93e2019-10-28 09:39:20 -0700944 // The function is going to insert a wait on everything in its prolog.
945 // This still needs to be careful if the call target is a load (e.g. a GOT
946 // load). We also need to check WAW depenancy with saved PC.
Matt Arsenaultaa41e922019-06-14 21:52:26 +0000947 Wait = AMDGPU::Waitcnt();
Kannan Narayananacb089e2017-04-12 03:25:12 +0000948
Matt Arsenaultaa41e922019-06-14 21:52:26 +0000949 int CallAddrOpIdx =
950 AMDGPU::getNamedOperandIdx(MI.getOpcode(), AMDGPU::OpName::src0);
Austin Kerbowd11b93e2019-10-28 09:39:20 -0700951 RegInterval CallAddrOpInterval = ScoreBrackets.getRegInterval(
952 &MI, TII, MRI, TRI, CallAddrOpIdx, false);
953
954 for (signed RegNo = CallAddrOpInterval.first;
955 RegNo < CallAddrOpInterval.second; ++RegNo)
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000956 ScoreBrackets.determineWait(
957 LGKM_CNT, ScoreBrackets.getRegScore(RegNo, LGKM_CNT), Wait);
Austin Kerbowd11b93e2019-10-28 09:39:20 -0700958
959 int RtnAddrOpIdx =
960 AMDGPU::getNamedOperandIdx(MI.getOpcode(), AMDGPU::OpName::dst);
961 if (RtnAddrOpIdx != -1) {
962 RegInterval RtnAddrOpInterval = ScoreBrackets.getRegInterval(
963 &MI, TII, MRI, TRI, RtnAddrOpIdx, false);
964
965 for (signed RegNo = RtnAddrOpInterval.first;
966 RegNo < RtnAddrOpInterval.second; ++RegNo)
967 ScoreBrackets.determineWait(
968 LGKM_CNT, ScoreBrackets.getRegScore(RegNo, LGKM_CNT), Wait);
Kannan Narayananacb089e2017-04-12 03:25:12 +0000969 }
Austin Kerbowd11b93e2019-10-28 09:39:20 -0700970
Matt Arsenaultaa41e922019-06-14 21:52:26 +0000971 } else {
Matt Arsenault0ed39d32017-07-21 18:54:54 +0000972 // FIXME: Should not be relying on memoperands.
Matt Arsenaultaa41e922019-06-14 21:52:26 +0000973 // Look at the source operands of every instruction to see if
974 // any of them results from a previous memory operation that affects
975 // its current usage. If so, an s_waitcnt instruction needs to be
976 // emitted.
977 // If the source operand was defined by a load, add the s_waitcnt
978 // instruction.
Kannan Narayananacb089e2017-04-12 03:25:12 +0000979 for (const MachineMemOperand *Memop : MI.memoperands()) {
980 unsigned AS = Memop->getAddrSpace();
Matt Arsenault0da63502018-08-31 05:49:54 +0000981 if (AS != AMDGPUAS::LOCAL_ADDRESS)
Kannan Narayananacb089e2017-04-12 03:25:12 +0000982 continue;
983 unsigned RegNo = SQ_MAX_PGM_VGPRS + EXTRA_VGPR_LDS;
Matt Arsenaultaa41e922019-06-14 21:52:26 +0000984 // VM_CNT is only relevant to vgpr or LDS.
Nicolai Haehnle7bed6962018-11-29 11:06:26 +0000985 ScoreBrackets.determineWait(
986 VM_CNT, ScoreBrackets.getRegScore(RegNo, VM_CNT), Wait);
Kannan Narayananacb089e2017-04-12 03:25:12 +0000987 }
Matt Arsenaultaa41e922019-06-14 21:52:26 +0000988
989 for (unsigned I = 0, E = MI.getNumOperands(); I != E; ++I) {
990 const MachineOperand &Op = MI.getOperand(I);
991 const MachineRegisterInfo &MRIA = *MRI;
992 RegInterval Interval =
993 ScoreBrackets.getRegInterval(&MI, TII, MRI, TRI, I, false);
994 for (signed RegNo = Interval.first; RegNo < Interval.second; ++RegNo) {
995 if (TRI->isVGPR(MRIA, Op.getReg())) {
996 // VM_CNT is only relevant to vgpr or LDS.
997 ScoreBrackets.determineWait(
998 VM_CNT, ScoreBrackets.getRegScore(RegNo, VM_CNT), Wait);
999 }
1000 ScoreBrackets.determineWait(
1001 LGKM_CNT, ScoreBrackets.getRegScore(RegNo, LGKM_CNT), Wait);
1002 }
1003 }
1004 // End of for loop that looks at all source operands to decide vm_wait_cnt
1005 // and lgk_wait_cnt.
1006
1007 // Two cases are handled for destination operands:
1008 // 1) If the destination operand was defined by a load, add the s_waitcnt
1009 // instruction to guarantee the right WAW order.
1010 // 2) If a destination operand that was used by a recent export/store ins,
1011 // add s_waitcnt on exp_cnt to guarantee the WAR order.
1012 if (MI.mayStore()) {
1013 // FIXME: Should not be relying on memoperands.
1014 for (const MachineMemOperand *Memop : MI.memoperands()) {
1015 unsigned AS = Memop->getAddrSpace();
1016 if (AS != AMDGPUAS::LOCAL_ADDRESS)
1017 continue;
1018 unsigned RegNo = SQ_MAX_PGM_VGPRS + EXTRA_VGPR_LDS;
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001019 ScoreBrackets.determineWait(
1020 VM_CNT, ScoreBrackets.getRegScore(RegNo, VM_CNT), Wait);
1021 ScoreBrackets.determineWait(
1022 EXP_CNT, ScoreBrackets.getRegScore(RegNo, EXP_CNT), Wait);
Kannan Narayananacb089e2017-04-12 03:25:12 +00001023 }
Kannan Narayananacb089e2017-04-12 03:25:12 +00001024 }
Matt Arsenaultaa41e922019-06-14 21:52:26 +00001025 for (unsigned I = 0, E = MI.getNumOperands(); I != E; ++I) {
1026 MachineOperand &Def = MI.getOperand(I);
1027 const MachineRegisterInfo &MRIA = *MRI;
1028 RegInterval Interval =
1029 ScoreBrackets.getRegInterval(&MI, TII, MRI, TRI, I, true);
1030 for (signed RegNo = Interval.first; RegNo < Interval.second; ++RegNo) {
1031 if (TRI->isVGPR(MRIA, Def.getReg())) {
1032 ScoreBrackets.determineWait(
1033 VM_CNT, ScoreBrackets.getRegScore(RegNo, VM_CNT), Wait);
1034 ScoreBrackets.determineWait(
1035 EXP_CNT, ScoreBrackets.getRegScore(RegNo, EXP_CNT), Wait);
1036 }
1037 ScoreBrackets.determineWait(
1038 LGKM_CNT, ScoreBrackets.getRegScore(RegNo, LGKM_CNT), Wait);
1039 }
1040 } // End of for loop that looks at all dest operands.
1041 }
Kannan Narayananacb089e2017-04-12 03:25:12 +00001042 }
1043
Kannan Narayananacb089e2017-04-12 03:25:12 +00001044 // Check to see if this is an S_BARRIER, and if an implicit S_WAITCNT 0
1045 // occurs before the instruction. Doing it here prevents any additional
1046 // S_WAITCNTs from being emitted if the instruction was marked as
1047 // requiring a WAITCNT beforehand.
Konstantin Zhuravlyovbe6c0ca2017-06-02 17:40:26 +00001048 if (MI.getOpcode() == AMDGPU::S_BARRIER &&
1049 !ST->hasAutoWaitcntBeforeBarrier()) {
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +00001050 Wait = Wait.combined(AMDGPU::Waitcnt::allZero(IV));
Kannan Narayananacb089e2017-04-12 03:25:12 +00001051 }
1052
1053 // TODO: Remove this work-around, enable the assert for Bug 457939
1054 // after fixing the scheduler. Also, the Shader Compiler code is
1055 // independent of target.
Matt Arsenaulte4c2e9b2019-06-19 23:54:58 +00001056 if (readsVCCZ(MI) && ST->hasReadVCCZBug()) {
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001057 if (ScoreBrackets.getScoreLB(LGKM_CNT) <
1058 ScoreBrackets.getScoreUB(LGKM_CNT) &&
1059 ScoreBrackets.hasPendingEvent(SMEM_ACCESS)) {
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +00001060 Wait.LgkmCnt = 0;
Kannan Narayananacb089e2017-04-12 03:25:12 +00001061 }
1062 }
1063
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +00001064 // Early-out if no wait is indicated.
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001065 if (!ScoreBrackets.simplifyWaitcnt(Wait) && !IsForceEmitWaitcnt) {
1066 bool Modified = false;
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +00001067 if (OldWaitcntInstr) {
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +00001068 for (auto II = OldWaitcntInstr->getIterator(), NextI = std::next(II);
1069 &*II != &MI; II = NextI, ++NextI) {
1070 if (II->isDebugInstr())
1071 continue;
1072
1073 if (TrackedWaitcntSet.count(&*II)) {
1074 TrackedWaitcntSet.erase(&*II);
1075 II->eraseFromParent();
1076 Modified = true;
1077 } else if (II->getOpcode() == AMDGPU::S_WAITCNT) {
1078 int64_t Imm = II->getOperand(0).getImm();
1079 ScoreBrackets.applyWaitcnt(AMDGPU::decodeWaitcnt(IV, Imm));
1080 } else {
1081 assert(II->getOpcode() == AMDGPU::S_WAITCNT_VSCNT);
1082 assert(II->getOperand(0).getReg() == AMDGPU::SGPR_NULL);
1083 ScoreBrackets.applyWaitcnt(
1084 AMDGPU::Waitcnt(0, 0, 0, II->getOperand(1).getImm()));
1085 }
Stanislav Mekhanoshindb39b4b2018-02-08 00:18:35 +00001086 }
Nicolai Haehnle61396ff2018-11-07 21:53:36 +00001087 }
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001088 return Modified;
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +00001089 }
Kannan Narayananacb089e2017-04-12 03:25:12 +00001090
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +00001091 if (ForceEmitZeroWaitcnts)
Stanislav Mekhanoshin956b0be2019-04-25 18:53:41 +00001092 Wait = AMDGPU::Waitcnt::allZero(IV);
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +00001093
1094 if (ForceEmitWaitcnt[VM_CNT])
1095 Wait.VmCnt = 0;
1096 if (ForceEmitWaitcnt[EXP_CNT])
1097 Wait.ExpCnt = 0;
1098 if (ForceEmitWaitcnt[LGKM_CNT])
1099 Wait.LgkmCnt = 0;
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +00001100 if (ForceEmitWaitcnt[VS_CNT])
1101 Wait.VsCnt = 0;
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +00001102
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001103 ScoreBrackets.applyWaitcnt(Wait);
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +00001104
1105 AMDGPU::Waitcnt OldWait;
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +00001106 bool Modified = false;
1107
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +00001108 if (OldWaitcntInstr) {
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +00001109 for (auto II = OldWaitcntInstr->getIterator(), NextI = std::next(II);
1110 &*II != &MI; II = NextI, NextI++) {
1111 if (II->isDebugInstr())
1112 continue;
1113
1114 if (II->getOpcode() == AMDGPU::S_WAITCNT) {
1115 unsigned IEnc = II->getOperand(0).getImm();
1116 AMDGPU::Waitcnt IWait = AMDGPU::decodeWaitcnt(IV, IEnc);
1117 OldWait = OldWait.combined(IWait);
1118 if (!TrackedWaitcntSet.count(&*II))
1119 Wait = Wait.combined(IWait);
1120 unsigned NewEnc = AMDGPU::encodeWaitcnt(IV, Wait);
1121 if (IEnc != NewEnc) {
1122 II->getOperand(0).setImm(NewEnc);
1123 Modified = true;
1124 }
1125 Wait.VmCnt = ~0u;
1126 Wait.LgkmCnt = ~0u;
1127 Wait.ExpCnt = ~0u;
1128 } else {
1129 assert(II->getOpcode() == AMDGPU::S_WAITCNT_VSCNT);
1130 assert(II->getOperand(0).getReg() == AMDGPU::SGPR_NULL);
1131
1132 unsigned ICnt = II->getOperand(1).getImm();
1133 OldWait.VsCnt = std::min(OldWait.VsCnt, ICnt);
1134 if (!TrackedWaitcntSet.count(&*II))
1135 Wait.VsCnt = std::min(Wait.VsCnt, ICnt);
1136 if (Wait.VsCnt != ICnt) {
1137 II->getOperand(1).setImm(Wait.VsCnt);
1138 Modified = true;
1139 }
1140 Wait.VsCnt = ~0u;
1141 }
1142
Jay Foad357bd912019-11-25 15:21:18 +00001143 LLVM_DEBUG(dbgs() << "generateWaitcntInstBefore\n"
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +00001144 << "Old Instr: " << MI << '\n'
1145 << "New Instr: " << *II << '\n');
1146
1147 if (!Wait.hasWait())
1148 return Modified;
1149 }
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +00001150 }
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +00001151
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +00001152 if (Wait.VmCnt != ~0u || Wait.LgkmCnt != ~0u || Wait.ExpCnt != ~0u) {
1153 unsigned Enc = AMDGPU::encodeWaitcnt(IV, Wait);
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +00001154 auto SWaitInst = BuildMI(*MI.getParent(), MI.getIterator(),
1155 MI.getDebugLoc(), TII->get(AMDGPU::S_WAITCNT))
1156 .addImm(Enc);
1157 TrackedWaitcntSet.insert(SWaitInst);
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +00001158 Modified = true;
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +00001159
Jay Foad357bd912019-11-25 15:21:18 +00001160 LLVM_DEBUG(dbgs() << "generateWaitcntInstBefore\n"
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +00001161 << "Old Instr: " << MI << '\n'
1162 << "New Instr: " << *SWaitInst << '\n');
Kannan Narayananacb089e2017-04-12 03:25:12 +00001163 }
Kannan Narayananacb089e2017-04-12 03:25:12 +00001164
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +00001165 if (Wait.VsCnt != ~0u) {
1166 assert(ST->hasVscnt());
1167
1168 auto SWaitInst =
1169 BuildMI(*MI.getParent(), MI.getIterator(), MI.getDebugLoc(),
1170 TII->get(AMDGPU::S_WAITCNT_VSCNT))
1171 .addReg(AMDGPU::SGPR_NULL, RegState::Undef)
1172 .addImm(Wait.VsCnt);
1173 TrackedWaitcntSet.insert(SWaitInst);
1174 Modified = true;
1175
Jay Foad357bd912019-11-25 15:21:18 +00001176 LLVM_DEBUG(dbgs() << "generateWaitcntInstBefore\n"
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +00001177 << "Old Instr: " << MI << '\n'
1178 << "New Instr: " << *SWaitInst << '\n');
1179 }
1180
1181 return Modified;
Kannan Narayananacb089e2017-04-12 03:25:12 +00001182}
1183
Matt Arsenault0ed39d32017-07-21 18:54:54 +00001184// This is a flat memory operation. Check to see if it has memory
1185// tokens for both LDS and Memory, and if so mark it as a flat.
1186bool SIInsertWaitcnts::mayAccessLDSThroughFlat(const MachineInstr &MI) const {
1187 if (MI.memoperands_empty())
1188 return true;
1189
1190 for (const MachineMemOperand *Memop : MI.memoperands()) {
1191 unsigned AS = Memop->getAddrSpace();
Matt Arsenault0da63502018-08-31 05:49:54 +00001192 if (AS == AMDGPUAS::LOCAL_ADDRESS || AS == AMDGPUAS::FLAT_ADDRESS)
Matt Arsenault0ed39d32017-07-21 18:54:54 +00001193 return true;
1194 }
1195
1196 return false;
1197}
1198
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001199void SIInsertWaitcnts::updateEventWaitcntAfter(MachineInstr &Inst,
1200 WaitcntBrackets *ScoreBrackets) {
Kannan Narayananacb089e2017-04-12 03:25:12 +00001201 // Now look at the instruction opcode. If it is a memory access
1202 // instruction, update the upper-bound of the appropriate counter's
1203 // bracket and the destination operand scores.
1204 // TODO: Use the (TSFlags & SIInstrFlags::LGKM_CNT) property everywhere.
Matt Arsenault6ab9ea92017-07-21 18:34:51 +00001205 if (TII->isDS(Inst) && TII->usesLGKM_CNT(Inst)) {
Marek Olsakc5cec5e2019-01-16 15:43:53 +00001206 if (TII->isAlwaysGDS(Inst.getOpcode()) ||
1207 TII->hasModifiersSet(Inst, AMDGPU::OpName::gds)) {
Kannan Narayananacb089e2017-04-12 03:25:12 +00001208 ScoreBrackets->updateByEvent(TII, TRI, MRI, GDS_ACCESS, Inst);
1209 ScoreBrackets->updateByEvent(TII, TRI, MRI, GDS_GPR_LOCK, Inst);
1210 } else {
1211 ScoreBrackets->updateByEvent(TII, TRI, MRI, LDS_ACCESS, Inst);
1212 }
1213 } else if (TII->isFLAT(Inst)) {
1214 assert(Inst.mayLoad() || Inst.mayStore());
Matt Arsenault6ab9ea92017-07-21 18:34:51 +00001215
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +00001216 if (TII->usesVM_CNT(Inst)) {
1217 if (!ST->hasVscnt())
1218 ScoreBrackets->updateByEvent(TII, TRI, MRI, VMEM_ACCESS, Inst);
1219 else if (Inst.mayLoad() &&
1220 AMDGPU::getAtomicRetOp(Inst.getOpcode()) == -1)
1221 ScoreBrackets->updateByEvent(TII, TRI, MRI, VMEM_READ_ACCESS, Inst);
1222 else
1223 ScoreBrackets->updateByEvent(TII, TRI, MRI, VMEM_WRITE_ACCESS, Inst);
1224 }
Matt Arsenault6ab9ea92017-07-21 18:34:51 +00001225
Matt Arsenault0ed39d32017-07-21 18:54:54 +00001226 if (TII->usesLGKM_CNT(Inst)) {
Matt Arsenault6ab9ea92017-07-21 18:34:51 +00001227 ScoreBrackets->updateByEvent(TII, TRI, MRI, LDS_ACCESS, Inst);
Kannan Narayananacb089e2017-04-12 03:25:12 +00001228
Matt Arsenault0ed39d32017-07-21 18:54:54 +00001229 // This is a flat memory operation, so note it - it will require
1230 // that both the VM and LGKM be flushed to zero if it is pending when
1231 // a VM or LGKM dependency occurs.
1232 if (mayAccessLDSThroughFlat(Inst))
1233 ScoreBrackets->setPendingFlat();
Kannan Narayananacb089e2017-04-12 03:25:12 +00001234 }
1235 } else if (SIInstrInfo::isVMEM(Inst) &&
1236 // TODO: get a better carve out.
1237 Inst.getOpcode() != AMDGPU::BUFFER_WBINVL1 &&
1238 Inst.getOpcode() != AMDGPU::BUFFER_WBINVL1_SC &&
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +00001239 Inst.getOpcode() != AMDGPU::BUFFER_WBINVL1_VOL &&
1240 Inst.getOpcode() != AMDGPU::BUFFER_GL0_INV &&
1241 Inst.getOpcode() != AMDGPU::BUFFER_GL1_INV) {
1242 if (!ST->hasVscnt())
1243 ScoreBrackets->updateByEvent(TII, TRI, MRI, VMEM_ACCESS, Inst);
1244 else if ((Inst.mayLoad() &&
1245 AMDGPU::getAtomicRetOp(Inst.getOpcode()) == -1) ||
1246 /* IMAGE_GET_RESINFO / IMAGE_GET_LOD */
1247 (TII->isMIMG(Inst) && !Inst.mayLoad() && !Inst.mayStore()))
1248 ScoreBrackets->updateByEvent(TII, TRI, MRI, VMEM_READ_ACCESS, Inst);
1249 else if (Inst.mayStore())
1250 ScoreBrackets->updateByEvent(TII, TRI, MRI, VMEM_WRITE_ACCESS, Inst);
1251
Mark Searles2a19af62018-04-26 16:11:19 +00001252 if (ST->vmemWriteNeedsExpWaitcnt() &&
Mark Searles11d0a042017-05-31 16:44:23 +00001253 (Inst.mayStore() || AMDGPU::getAtomicNoRetOp(Inst.getOpcode()) != -1)) {
Kannan Narayananacb089e2017-04-12 03:25:12 +00001254 ScoreBrackets->updateByEvent(TII, TRI, MRI, VMW_GPR_LOCK, Inst);
1255 }
1256 } else if (TII->isSMRD(Inst)) {
1257 ScoreBrackets->updateByEvent(TII, TRI, MRI, SMEM_ACCESS, Inst);
Matt Arsenaultaa41e922019-06-14 21:52:26 +00001258 } else if (Inst.isCall()) {
1259 if (callWaitsOnFunctionReturn(Inst)) {
1260 // Act as a wait on everything
1261 ScoreBrackets->applyWaitcnt(AMDGPU::Waitcnt::allZero(IV));
1262 } else {
1263 // May need to way wait for anything.
1264 ScoreBrackets->applyWaitcnt(AMDGPU::Waitcnt());
1265 }
Kannan Narayananacb089e2017-04-12 03:25:12 +00001266 } else {
1267 switch (Inst.getOpcode()) {
1268 case AMDGPU::S_SENDMSG:
1269 case AMDGPU::S_SENDMSGHALT:
1270 ScoreBrackets->updateByEvent(TII, TRI, MRI, SQ_MESSAGE, Inst);
1271 break;
1272 case AMDGPU::EXP:
1273 case AMDGPU::EXP_DONE: {
1274 int Imm = TII->getNamedOperand(Inst, AMDGPU::OpName::tgt)->getImm();
1275 if (Imm >= 32 && Imm <= 63)
1276 ScoreBrackets->updateByEvent(TII, TRI, MRI, EXP_PARAM_ACCESS, Inst);
1277 else if (Imm >= 12 && Imm <= 15)
1278 ScoreBrackets->updateByEvent(TII, TRI, MRI, EXP_POS_ACCESS, Inst);
1279 else
1280 ScoreBrackets->updateByEvent(TII, TRI, MRI, EXP_GPR_LOCK, Inst);
1281 break;
1282 }
1283 case AMDGPU::S_MEMTIME:
1284 case AMDGPU::S_MEMREALTIME:
1285 ScoreBrackets->updateByEvent(TII, TRI, MRI, SMEM_ACCESS, Inst);
1286 break;
1287 default:
1288 break;
1289 }
1290 }
1291}
1292
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001293bool WaitcntBrackets::mergeScore(const MergeInfo &M, uint32_t &Score,
1294 uint32_t OtherScore) {
1295 uint32_t MyShifted = Score <= M.OldLB ? 0 : Score + M.MyShift;
1296 uint32_t OtherShifted =
1297 OtherScore <= M.OtherLB ? 0 : OtherScore + M.OtherShift;
1298 Score = std::max(MyShifted, OtherShifted);
1299 return OtherShifted > MyShifted;
1300}
Kannan Narayananacb089e2017-04-12 03:25:12 +00001301
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001302/// Merge the pending events and associater score brackets of \p Other into
1303/// this brackets status.
1304///
1305/// Returns whether the merge resulted in a change that requires tighter waits
1306/// (i.e. the merged brackets strictly dominate the original brackets).
1307bool WaitcntBrackets::merge(const WaitcntBrackets &Other) {
1308 bool StrictDom = false;
Mark Searlesc3c02bd2018-03-14 22:04:32 +00001309
Nicolai Haehnleae369d72018-11-29 11:06:11 +00001310 for (auto T : inst_counter_types()) {
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001311 // Merge event flags for this counter
1312 const bool OldOutOfOrder = counterOutOfOrder(T);
1313 const uint32_t OldEvents = PendingEvents & WaitEventMaskForInst[T];
1314 const uint32_t OtherEvents = Other.PendingEvents & WaitEventMaskForInst[T];
1315 if (OtherEvents & ~OldEvents)
1316 StrictDom = true;
1317 if (Other.MixedPendingEvents[T] ||
1318 (OldEvents && OtherEvents && OldEvents != OtherEvents))
1319 MixedPendingEvents[T] = true;
1320 PendingEvents |= OtherEvents;
Kannan Narayananacb089e2017-04-12 03:25:12 +00001321
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001322 // Merge scores for this counter
1323 const uint32_t MyPending = ScoreUBs[T] - ScoreLBs[T];
1324 const uint32_t OtherPending = Other.ScoreUBs[T] - Other.ScoreLBs[T];
1325 MergeInfo M;
1326 M.OldLB = ScoreLBs[T];
1327 M.OtherLB = Other.ScoreLBs[T];
1328 M.MyShift = OtherPending > MyPending ? OtherPending - MyPending : 0;
1329 M.OtherShift = ScoreUBs[T] - Other.ScoreUBs[T] + M.MyShift;
1330
1331 const uint32_t NewUB = ScoreUBs[T] + M.MyShift;
1332 if (NewUB < ScoreUBs[T])
1333 report_fatal_error("waitcnt score overflow");
1334 ScoreUBs[T] = NewUB;
1335 ScoreLBs[T] = std::min(M.OldLB + M.MyShift, M.OtherLB + M.OtherShift);
1336
1337 StrictDom |= mergeScore(M, LastFlat[T], Other.LastFlat[T]);
1338
1339 bool RegStrictDom = false;
1340 for (int J = 0, E = std::max(getMaxVGPR(), Other.getMaxVGPR()) + 1; J != E;
1341 J++) {
1342 RegStrictDom |= mergeScore(M, VgprScores[T][J], Other.VgprScores[T][J]);
Kannan Narayananacb089e2017-04-12 03:25:12 +00001343 }
1344
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001345 if (T == LGKM_CNT) {
1346 for (int J = 0, E = std::max(getMaxSGPR(), Other.getMaxSGPR()) + 1;
1347 J != E; J++) {
1348 RegStrictDom |= mergeScore(M, SgprScores[J], Other.SgprScores[J]);
Kannan Narayananacb089e2017-04-12 03:25:12 +00001349 }
1350 }
1351
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001352 if (RegStrictDom && !OldOutOfOrder)
1353 StrictDom = true;
Kannan Narayananacb089e2017-04-12 03:25:12 +00001354 }
Mark Searlesc3c02bd2018-03-14 22:04:32 +00001355
Carl Ritsonc521ac32018-12-19 10:17:49 +00001356 VgprUB = std::max(getMaxVGPR(), Other.getMaxVGPR());
1357 SgprUB = std::max(getMaxSGPR(), Other.getMaxSGPR());
1358
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001359 return StrictDom;
Kannan Narayananacb089e2017-04-12 03:25:12 +00001360}
1361
1362// Generate s_waitcnt instructions where needed.
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001363bool SIInsertWaitcnts::insertWaitcntInBlock(MachineFunction &MF,
1364 MachineBasicBlock &Block,
1365 WaitcntBrackets &ScoreBrackets) {
1366 bool Modified = false;
Kannan Narayananacb089e2017-04-12 03:25:12 +00001367
Nicola Zaghend34e60c2018-05-14 12:53:11 +00001368 LLVM_DEBUG({
Mark Searlesec581832018-04-25 19:21:26 +00001369 dbgs() << "*** Block" << Block.getNumber() << " ***";
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001370 ScoreBrackets.dump();
Kannan Narayananacb089e2017-04-12 03:25:12 +00001371 });
1372
Kannan Narayananacb089e2017-04-12 03:25:12 +00001373 // Walk over the instructions.
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +00001374 MachineInstr *OldWaitcntInstr = nullptr;
1375
Matt Arsenaultc04aab92019-07-03 00:30:44 +00001376 for (MachineBasicBlock::instr_iterator Iter = Block.instr_begin(),
1377 E = Block.instr_end();
Kannan Narayananacb089e2017-04-12 03:25:12 +00001378 Iter != E;) {
1379 MachineInstr &Inst = *Iter;
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +00001380
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +00001381 // Track pre-existing waitcnts from earlier iterations.
1382 if (Inst.getOpcode() == AMDGPU::S_WAITCNT ||
1383 (Inst.getOpcode() == AMDGPU::S_WAITCNT_VSCNT &&
1384 Inst.getOperand(0).isReg() &&
1385 Inst.getOperand(0).getReg() == AMDGPU::SGPR_NULL)) {
1386 if (!OldWaitcntInstr)
1387 OldWaitcntInstr = &Inst;
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +00001388 ++Iter;
Kannan Narayananacb089e2017-04-12 03:25:12 +00001389 continue;
1390 }
1391
Kannan Narayananacb089e2017-04-12 03:25:12 +00001392 bool VCCZBugWorkAround = false;
Jay Foade5972f22019-10-30 13:47:32 +00001393 if (readsVCCZ(Inst)) {
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001394 if (ScoreBrackets.getScoreLB(LGKM_CNT) <
1395 ScoreBrackets.getScoreUB(LGKM_CNT) &&
1396 ScoreBrackets.hasPendingEvent(SMEM_ACCESS)) {
Jay Foadb5922532019-10-29 17:11:21 +00001397 if (ST->hasReadVCCZBug())
Kannan Narayananacb089e2017-04-12 03:25:12 +00001398 VCCZBugWorkAround = true;
1399 }
1400 }
1401
1402 // Generate an s_waitcnt instruction to be placed before
1403 // cur_Inst, if needed.
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001404 Modified |= generateWaitcntInstBefore(Inst, ScoreBrackets, OldWaitcntInstr);
Nicolai Haehnle1a94cbb2018-11-29 11:06:06 +00001405 OldWaitcntInstr = nullptr;
Kannan Narayananacb089e2017-04-12 03:25:12 +00001406
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001407 updateEventWaitcntAfter(Inst, &ScoreBrackets);
Kannan Narayananacb089e2017-04-12 03:25:12 +00001408
1409#if 0 // TODO: implement resource type check controlled by options with ub = LB.
1410 // If this instruction generates a S_SETVSKIP because it is an
1411 // indexed resource, and we are on Tahiti, then it will also force
1412 // an S_WAITCNT vmcnt(0)
1413 if (RequireCheckResourceType(Inst, context)) {
1414 // Force the score to as if an S_WAITCNT vmcnt(0) is emitted.
1415 ScoreBrackets->setScoreLB(VM_CNT,
Evgeny Mankovbf975172017-08-16 16:47:29 +00001416 ScoreBrackets->getScoreUB(VM_CNT));
Kannan Narayananacb089e2017-04-12 03:25:12 +00001417 }
1418#endif
1419
Nicola Zaghend34e60c2018-05-14 12:53:11 +00001420 LLVM_DEBUG({
Mark Searles94ae3b22018-01-30 17:17:06 +00001421 Inst.print(dbgs());
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001422 ScoreBrackets.dump();
Kannan Narayananacb089e2017-04-12 03:25:12 +00001423 });
1424
Kannan Narayananacb089e2017-04-12 03:25:12 +00001425 // TODO: Remove this work-around after fixing the scheduler and enable the
1426 // assert above.
1427 if (VCCZBugWorkAround) {
1428 // Restore the vccz bit. Any time a value is written to vcc, the vcc
1429 // bit is updated, so we can restore the bit by reading the value of
1430 // vcc and then writing it back to the register.
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +00001431 BuildMI(Block, Inst, Inst.getDebugLoc(),
Stanislav Mekhanoshin52500212019-06-16 17:13:09 +00001432 TII->get(ST->isWave32() ? AMDGPU::S_MOV_B32 : AMDGPU::S_MOV_B64),
1433 TRI->getVCC())
1434 .addReg(TRI->getVCC());
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001435 Modified = true;
Kannan Narayananacb089e2017-04-12 03:25:12 +00001436 }
1437
Kannan Narayananacb089e2017-04-12 03:25:12 +00001438 ++Iter;
1439 }
1440
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001441 return Modified;
Kannan Narayananacb089e2017-04-12 03:25:12 +00001442}
1443
1444bool SIInsertWaitcnts::runOnMachineFunction(MachineFunction &MF) {
Tom Stellard5bfbae52018-07-11 20:59:01 +00001445 ST = &MF.getSubtarget<GCNSubtarget>();
Kannan Narayananacb089e2017-04-12 03:25:12 +00001446 TII = ST->getInstrInfo();
1447 TRI = &TII->getRegisterInfo();
1448 MRI = &MF.getRegInfo();
Konstantin Zhuravlyov71e43ee2018-09-12 18:50:47 +00001449 IV = AMDGPU::getIsaVersion(ST->getCPU());
Mark Searles11d0a042017-05-31 16:44:23 +00001450 const SIMachineFunctionInfo *MFI = MF.getInfo<SIMachineFunctionInfo>();
Kannan Narayananacb089e2017-04-12 03:25:12 +00001451
Mark Searles4a0f2c52018-05-07 14:43:28 +00001452 ForceEmitZeroWaitcnts = ForceEmitZeroFlag;
Nicolai Haehnleae369d72018-11-29 11:06:11 +00001453 for (auto T : inst_counter_types())
Mark Searlesec581832018-04-25 19:21:26 +00001454 ForceEmitWaitcnt[T] = false;
1455
Kannan Narayananacb089e2017-04-12 03:25:12 +00001456 HardwareLimits.VmcntMax = AMDGPU::getVmcntBitMask(IV);
1457 HardwareLimits.ExpcntMax = AMDGPU::getExpcntBitMask(IV);
1458 HardwareLimits.LgkmcntMax = AMDGPU::getLgkmcntBitMask(IV);
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +00001459 HardwareLimits.VscntMax = ST->hasVscnt() ? 63 : 0;
Kannan Narayananacb089e2017-04-12 03:25:12 +00001460
1461 HardwareLimits.NumVGPRsMax = ST->getAddressableNumVGPRs();
1462 HardwareLimits.NumSGPRsMax = ST->getAddressableNumSGPRs();
1463 assert(HardwareLimits.NumVGPRsMax <= SQ_MAX_PGM_VGPRS);
1464 assert(HardwareLimits.NumSGPRsMax <= SQ_MAX_PGM_SGPRS);
1465
1466 RegisterEncoding.VGPR0 = TRI->getEncodingValue(AMDGPU::VGPR0);
1467 RegisterEncoding.VGPRL =
1468 RegisterEncoding.VGPR0 + HardwareLimits.NumVGPRsMax - 1;
1469 RegisterEncoding.SGPR0 = TRI->getEncodingValue(AMDGPU::SGPR0);
1470 RegisterEncoding.SGPRL =
1471 RegisterEncoding.SGPR0 + HardwareLimits.NumSGPRsMax - 1;
1472
Mark Searles24c92ee2018-02-07 02:21:21 +00001473 TrackedWaitcntSet.clear();
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001474 RpotIdxMap.clear();
1475 BlockInfos.clear();
Mark Searles24c92ee2018-02-07 02:21:21 +00001476
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001477 // Keep iterating over the blocks in reverse post order, inserting and
1478 // updating s_waitcnt where needed, until a fix point is reached.
1479 for (MachineBasicBlock *MBB :
1480 ReversePostOrderTraversal<MachineFunction *>(&MF)) {
1481 RpotIdxMap[MBB] = BlockInfos.size();
1482 BlockInfos.emplace_back(MBB);
1483 }
1484
1485 std::unique_ptr<WaitcntBrackets> Brackets;
Kannan Narayananacb089e2017-04-12 03:25:12 +00001486 bool Modified = false;
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001487 bool Repeat;
1488 do {
1489 Repeat = false;
Kannan Narayananacb089e2017-04-12 03:25:12 +00001490
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001491 for (BlockInfo &BI : BlockInfos) {
1492 if (!BI.Dirty)
1493 continue;
Kannan Narayananacb089e2017-04-12 03:25:12 +00001494
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001495 unsigned Idx = std::distance(&*BlockInfos.begin(), &BI);
Kannan Narayananacb089e2017-04-12 03:25:12 +00001496
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001497 if (BI.Incoming) {
1498 if (!Brackets)
Jonas Devlieghere0eaee542019-08-15 15:54:37 +00001499 Brackets = std::make_unique<WaitcntBrackets>(*BI.Incoming);
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001500 else
1501 *Brackets = *BI.Incoming;
1502 } else {
1503 if (!Brackets)
Jonas Devlieghere0eaee542019-08-15 15:54:37 +00001504 Brackets = std::make_unique<WaitcntBrackets>(ST);
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001505 else
1506 Brackets->clear();
Mark Searles1bc6e712018-04-19 15:42:30 +00001507 }
Kannan Narayananacb089e2017-04-12 03:25:12 +00001508
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001509 Modified |= insertWaitcntInBlock(MF, *BI.MBB, *Brackets);
1510 BI.Dirty = false;
Kannan Narayananacb089e2017-04-12 03:25:12 +00001511
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001512 if (Brackets->hasPending()) {
1513 BlockInfo *MoveBracketsToSucc = nullptr;
1514 for (MachineBasicBlock *Succ : BI.MBB->successors()) {
1515 unsigned SuccIdx = RpotIdxMap[Succ];
1516 BlockInfo &SuccBI = BlockInfos[SuccIdx];
1517 if (!SuccBI.Incoming) {
1518 SuccBI.Dirty = true;
1519 if (SuccIdx <= Idx)
1520 Repeat = true;
1521 if (!MoveBracketsToSucc) {
1522 MoveBracketsToSucc = &SuccBI;
1523 } else {
Jonas Devlieghere0eaee542019-08-15 15:54:37 +00001524 SuccBI.Incoming = std::make_unique<WaitcntBrackets>(*Brackets);
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001525 }
1526 } else if (SuccBI.Incoming->merge(*Brackets)) {
1527 SuccBI.Dirty = true;
1528 if (SuccIdx <= Idx)
1529 Repeat = true;
Kannan Narayananacb089e2017-04-12 03:25:12 +00001530 }
1531 }
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001532 if (MoveBracketsToSucc)
1533 MoveBracketsToSucc->Incoming = std::move(Brackets);
Kannan Narayananacb089e2017-04-12 03:25:12 +00001534 }
1535 }
Nicolai Haehnle7bed6962018-11-29 11:06:26 +00001536 } while (Repeat);
Kannan Narayananacb089e2017-04-12 03:25:12 +00001537
1538 SmallVector<MachineBasicBlock *, 4> EndPgmBlocks;
1539
1540 bool HaveScalarStores = false;
1541
1542 for (MachineFunction::iterator BI = MF.begin(), BE = MF.end(); BI != BE;
1543 ++BI) {
Kannan Narayananacb089e2017-04-12 03:25:12 +00001544 MachineBasicBlock &MBB = *BI;
1545
1546 for (MachineBasicBlock::iterator I = MBB.begin(), E = MBB.end(); I != E;
1547 ++I) {
Kannan Narayananacb089e2017-04-12 03:25:12 +00001548 if (!HaveScalarStores && TII->isScalarStore(*I))
1549 HaveScalarStores = true;
1550
1551 if (I->getOpcode() == AMDGPU::S_ENDPGM ||
1552 I->getOpcode() == AMDGPU::SI_RETURN_TO_EPILOG)
1553 EndPgmBlocks.push_back(&MBB);
1554 }
1555 }
1556
1557 if (HaveScalarStores) {
1558 // If scalar writes are used, the cache must be flushed or else the next
1559 // wave to reuse the same scratch memory can be clobbered.
1560 //
1561 // Insert s_dcache_wb at wave termination points if there were any scalar
1562 // stores, and only if the cache hasn't already been flushed. This could be
1563 // improved by looking across blocks for flushes in postdominating blocks
1564 // from the stores but an explicitly requested flush is probably very rare.
1565 for (MachineBasicBlock *MBB : EndPgmBlocks) {
1566 bool SeenDCacheWB = false;
1567
1568 for (MachineBasicBlock::iterator I = MBB->begin(), E = MBB->end(); I != E;
1569 ++I) {
Kannan Narayananacb089e2017-04-12 03:25:12 +00001570 if (I->getOpcode() == AMDGPU::S_DCACHE_WB)
1571 SeenDCacheWB = true;
1572 else if (TII->isScalarStore(*I))
1573 SeenDCacheWB = false;
1574
1575 // FIXME: It would be better to insert this before a waitcnt if any.
1576 if ((I->getOpcode() == AMDGPU::S_ENDPGM ||
1577 I->getOpcode() == AMDGPU::SI_RETURN_TO_EPILOG) &&
1578 !SeenDCacheWB) {
1579 Modified = true;
1580 BuildMI(*MBB, I, I->getDebugLoc(), TII->get(AMDGPU::S_DCACHE_WB));
1581 }
1582 }
1583 }
1584 }
1585
Mark Searles11d0a042017-05-31 16:44:23 +00001586 if (!MFI->isEntryFunction()) {
1587 // Wait for any outstanding memory operations that the input registers may
Hiroshi Inouec8e92452018-01-29 05:17:03 +00001588 // depend on. We can't track them and it's better to the wait after the
Mark Searles11d0a042017-05-31 16:44:23 +00001589 // costly call sequence.
1590
1591 // TODO: Could insert earlier and schedule more liberally with operations
1592 // that only use caller preserved registers.
1593 MachineBasicBlock &EntryBB = MF.front();
Stanislav Mekhanoshind9dcf392019-05-03 21:53:53 +00001594 if (ST->hasVscnt())
1595 BuildMI(EntryBB, EntryBB.getFirstNonPHI(), DebugLoc(),
1596 TII->get(AMDGPU::S_WAITCNT_VSCNT))
1597 .addReg(AMDGPU::SGPR_NULL, RegState::Undef)
1598 .addImm(0);
Mark Searlesed54ff12018-05-30 16:27:57 +00001599 BuildMI(EntryBB, EntryBB.getFirstNonPHI(), DebugLoc(), TII->get(AMDGPU::S_WAITCNT))
1600 .addImm(0);
Mark Searles11d0a042017-05-31 16:44:23 +00001601
1602 Modified = true;
1603 }
1604
Kannan Narayananacb089e2017-04-12 03:25:12 +00001605 return Modified;
1606}