Revert r354244 "[DAGCombiner] Eliminate dead stores to stack."
[llvm-complete.git] / lib / Target / AMDGPU / R600OptimizeVectorRegisters.cpp
blobff21176a38fd78951d182c29ff4624054145d4a1
1 //===- R600MergeVectorRegisters.cpp ---------------------------------------===//
2 //
3 // 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
6 //
7 //===----------------------------------------------------------------------===//
8 //
9 /// \file
10 /// This pass merges inputs of swizzeable instructions into vector sharing
11 /// common data and/or have enough undef subreg using swizzle abilities.
12 ///
13 /// For instance let's consider the following pseudo code :
14 /// %5 = REG_SEQ %1, sub0, %2, sub1, %3, sub2, undef, sub3
15 /// ...
16 /// %7 = REG_SEQ %1, sub0, %3, sub1, undef, sub2, %4, sub3
17 /// (swizzable Inst) %7, SwizzleMask : sub0, sub1, sub2, sub3
18 ///
19 /// is turned into :
20 /// %5 = REG_SEQ %1, sub0, %2, sub1, %3, sub2, undef, sub3
21 /// ...
22 /// %7 = INSERT_SUBREG %4, sub3
23 /// (swizzable Inst) %7, SwizzleMask : sub0, sub2, sub1, sub3
24 ///
25 /// This allow regalloc to reduce register pressure for vector registers and
26 /// to reduce MOV count.
27 //===----------------------------------------------------------------------===//
29 #include "AMDGPU.h"
30 #include "AMDGPUSubtarget.h"
31 #include "R600Defines.h"
32 #include "R600InstrInfo.h"
33 #include "MCTargetDesc/AMDGPUMCTargetDesc.h"
34 #include "llvm/ADT/DenseMap.h"
35 #include "llvm/ADT/STLExtras.h"
36 #include "llvm/ADT/StringRef.h"
37 #include "llvm/CodeGen/MachineBasicBlock.h"
38 #include "llvm/CodeGen/MachineDominators.h"
39 #include "llvm/CodeGen/MachineFunction.h"
40 #include "llvm/CodeGen/MachineFunctionPass.h"
41 #include "llvm/CodeGen/MachineInstr.h"
42 #include "llvm/CodeGen/MachineInstrBuilder.h"
43 #include "llvm/CodeGen/MachineLoopInfo.h"
44 #include "llvm/CodeGen/MachineOperand.h"
45 #include "llvm/CodeGen/MachineRegisterInfo.h"
46 #include "llvm/IR/DebugLoc.h"
47 #include "llvm/Pass.h"
48 #include "llvm/Support/Debug.h"
49 #include "llvm/Support/ErrorHandling.h"
50 #include "llvm/Support/raw_ostream.h"
51 #include <cassert>
52 #include <utility>
53 #include <vector>
55 using namespace llvm;
57 #define DEBUG_TYPE "vec-merger"
59 static bool
60 isImplicitlyDef(MachineRegisterInfo &MRI, unsigned Reg) {
61 for (MachineRegisterInfo::def_instr_iterator It = MRI.def_instr_begin(Reg),
62 E = MRI.def_instr_end(); It != E; ++It) {
63 return (*It).isImplicitDef();
65 if (MRI.isReserved(Reg)) {
66 return false;
68 llvm_unreachable("Reg without a def");
69 return false;
72 namespace {
74 class RegSeqInfo {
75 public:
76 MachineInstr *Instr;
77 DenseMap<unsigned, unsigned> RegToChan;
78 std::vector<unsigned> UndefReg;
80 RegSeqInfo(MachineRegisterInfo &MRI, MachineInstr *MI) : Instr(MI) {
81 assert(MI->getOpcode() == R600::REG_SEQUENCE);
82 for (unsigned i = 1, e = Instr->getNumOperands(); i < e; i+=2) {
83 MachineOperand &MO = Instr->getOperand(i);
84 unsigned Chan = Instr->getOperand(i + 1).getImm();
85 if (isImplicitlyDef(MRI, MO.getReg()))
86 UndefReg.push_back(Chan);
87 else
88 RegToChan[MO.getReg()] = Chan;
92 RegSeqInfo() = default;
94 bool operator==(const RegSeqInfo &RSI) const {
95 return RSI.Instr == Instr;
99 class R600VectorRegMerger : public MachineFunctionPass {
100 private:
101 using InstructionSetMap = DenseMap<unsigned, std::vector<MachineInstr *>>;
103 MachineRegisterInfo *MRI;
104 const R600InstrInfo *TII = nullptr;
105 DenseMap<MachineInstr *, RegSeqInfo> PreviousRegSeq;
106 InstructionSetMap PreviousRegSeqByReg;
107 InstructionSetMap PreviousRegSeqByUndefCount;
109 bool canSwizzle(const MachineInstr &MI) const;
110 bool areAllUsesSwizzeable(unsigned Reg) const;
111 void SwizzleInput(MachineInstr &,
112 const std::vector<std::pair<unsigned, unsigned>> &RemapChan) const;
113 bool tryMergeVector(const RegSeqInfo *Untouched, RegSeqInfo *ToMerge,
114 std::vector<std::pair<unsigned, unsigned>> &Remap) const;
115 bool tryMergeUsingCommonSlot(RegSeqInfo &RSI, RegSeqInfo &CompatibleRSI,
116 std::vector<std::pair<unsigned, unsigned>> &RemapChan);
117 bool tryMergeUsingFreeSlot(RegSeqInfo &RSI, RegSeqInfo &CompatibleRSI,
118 std::vector<std::pair<unsigned, unsigned>> &RemapChan);
119 MachineInstr *RebuildVector(RegSeqInfo *MI, const RegSeqInfo *BaseVec,
120 const std::vector<std::pair<unsigned, unsigned>> &RemapChan) const;
121 void RemoveMI(MachineInstr *);
122 void trackRSI(const RegSeqInfo &RSI);
124 public:
125 static char ID;
127 R600VectorRegMerger() : MachineFunctionPass(ID) {}
129 void getAnalysisUsage(AnalysisUsage &AU) const override {
130 AU.setPreservesCFG();
131 AU.addRequired<MachineDominatorTree>();
132 AU.addPreserved<MachineDominatorTree>();
133 AU.addRequired<MachineLoopInfo>();
134 AU.addPreserved<MachineLoopInfo>();
135 MachineFunctionPass::getAnalysisUsage(AU);
138 StringRef getPassName() const override {
139 return "R600 Vector Registers Merge Pass";
142 bool runOnMachineFunction(MachineFunction &Fn) override;
145 } // end anonymous namespace
147 INITIALIZE_PASS_BEGIN(R600VectorRegMerger, DEBUG_TYPE,
148 "R600 Vector Reg Merger", false, false)
149 INITIALIZE_PASS_END(R600VectorRegMerger, DEBUG_TYPE,
150 "R600 Vector Reg Merger", false, false)
152 char R600VectorRegMerger::ID = 0;
154 char &llvm::R600VectorRegMergerID = R600VectorRegMerger::ID;
156 bool R600VectorRegMerger::canSwizzle(const MachineInstr &MI)
157 const {
158 if (TII->get(MI.getOpcode()).TSFlags & R600_InstFlag::TEX_INST)
159 return true;
160 switch (MI.getOpcode()) {
161 case R600::R600_ExportSwz:
162 case R600::EG_ExportSwz:
163 return true;
164 default:
165 return false;
169 bool R600VectorRegMerger::tryMergeVector(const RegSeqInfo *Untouched,
170 RegSeqInfo *ToMerge, std::vector< std::pair<unsigned, unsigned>> &Remap)
171 const {
172 unsigned CurrentUndexIdx = 0;
173 for (DenseMap<unsigned, unsigned>::iterator It = ToMerge->RegToChan.begin(),
174 E = ToMerge->RegToChan.end(); It != E; ++It) {
175 DenseMap<unsigned, unsigned>::const_iterator PosInUntouched =
176 Untouched->RegToChan.find((*It).first);
177 if (PosInUntouched != Untouched->RegToChan.end()) {
178 Remap.push_back(std::pair<unsigned, unsigned>
179 ((*It).second, (*PosInUntouched).second));
180 continue;
182 if (CurrentUndexIdx >= Untouched->UndefReg.size())
183 return false;
184 Remap.push_back(std::pair<unsigned, unsigned>
185 ((*It).second, Untouched->UndefReg[CurrentUndexIdx++]));
188 return true;
191 static
192 unsigned getReassignedChan(
193 const std::vector<std::pair<unsigned, unsigned>> &RemapChan,
194 unsigned Chan) {
195 for (unsigned j = 0, je = RemapChan.size(); j < je; j++) {
196 if (RemapChan[j].first == Chan)
197 return RemapChan[j].second;
199 llvm_unreachable("Chan wasn't reassigned");
202 MachineInstr *R600VectorRegMerger::RebuildVector(
203 RegSeqInfo *RSI, const RegSeqInfo *BaseRSI,
204 const std::vector<std::pair<unsigned, unsigned>> &RemapChan) const {
205 unsigned Reg = RSI->Instr->getOperand(0).getReg();
206 MachineBasicBlock::iterator Pos = RSI->Instr;
207 MachineBasicBlock &MBB = *Pos->getParent();
208 DebugLoc DL = Pos->getDebugLoc();
210 unsigned SrcVec = BaseRSI->Instr->getOperand(0).getReg();
211 DenseMap<unsigned, unsigned> UpdatedRegToChan = BaseRSI->RegToChan;
212 std::vector<unsigned> UpdatedUndef = BaseRSI->UndefReg;
213 for (DenseMap<unsigned, unsigned>::iterator It = RSI->RegToChan.begin(),
214 E = RSI->RegToChan.end(); It != E; ++It) {
215 unsigned DstReg = MRI->createVirtualRegister(&R600::R600_Reg128RegClass);
216 unsigned SubReg = (*It).first;
217 unsigned Swizzle = (*It).second;
218 unsigned Chan = getReassignedChan(RemapChan, Swizzle);
220 MachineInstr *Tmp = BuildMI(MBB, Pos, DL, TII->get(R600::INSERT_SUBREG),
221 DstReg)
222 .addReg(SrcVec)
223 .addReg(SubReg)
224 .addImm(Chan);
225 UpdatedRegToChan[SubReg] = Chan;
226 std::vector<unsigned>::iterator ChanPos = llvm::find(UpdatedUndef, Chan);
227 if (ChanPos != UpdatedUndef.end())
228 UpdatedUndef.erase(ChanPos);
229 assert(!is_contained(UpdatedUndef, Chan) &&
230 "UpdatedUndef shouldn't contain Chan more than once!");
231 LLVM_DEBUG(dbgs() << " ->"; Tmp->dump(););
232 (void)Tmp;
233 SrcVec = DstReg;
235 MachineInstr *NewMI =
236 BuildMI(MBB, Pos, DL, TII->get(R600::COPY), Reg).addReg(SrcVec);
237 LLVM_DEBUG(dbgs() << " ->"; NewMI->dump(););
239 LLVM_DEBUG(dbgs() << " Updating Swizzle:\n");
240 for (MachineRegisterInfo::use_instr_iterator It = MRI->use_instr_begin(Reg),
241 E = MRI->use_instr_end(); It != E; ++It) {
242 LLVM_DEBUG(dbgs() << " "; (*It).dump(); dbgs() << " ->");
243 SwizzleInput(*It, RemapChan);
244 LLVM_DEBUG((*It).dump());
246 RSI->Instr->eraseFromParent();
248 // Update RSI
249 RSI->Instr = NewMI;
250 RSI->RegToChan = UpdatedRegToChan;
251 RSI->UndefReg = UpdatedUndef;
253 return NewMI;
256 void R600VectorRegMerger::RemoveMI(MachineInstr *MI) {
257 for (InstructionSetMap::iterator It = PreviousRegSeqByReg.begin(),
258 E = PreviousRegSeqByReg.end(); It != E; ++It) {
259 std::vector<MachineInstr *> &MIs = (*It).second;
260 MIs.erase(llvm::find(MIs, MI), MIs.end());
262 for (InstructionSetMap::iterator It = PreviousRegSeqByUndefCount.begin(),
263 E = PreviousRegSeqByUndefCount.end(); It != E; ++It) {
264 std::vector<MachineInstr *> &MIs = (*It).second;
265 MIs.erase(llvm::find(MIs, MI), MIs.end());
269 void R600VectorRegMerger::SwizzleInput(MachineInstr &MI,
270 const std::vector<std::pair<unsigned, unsigned>> &RemapChan) const {
271 unsigned Offset;
272 if (TII->get(MI.getOpcode()).TSFlags & R600_InstFlag::TEX_INST)
273 Offset = 2;
274 else
275 Offset = 3;
276 for (unsigned i = 0; i < 4; i++) {
277 unsigned Swizzle = MI.getOperand(i + Offset).getImm() + 1;
278 for (unsigned j = 0, e = RemapChan.size(); j < e; j++) {
279 if (RemapChan[j].first == Swizzle) {
280 MI.getOperand(i + Offset).setImm(RemapChan[j].second - 1);
281 break;
287 bool R600VectorRegMerger::areAllUsesSwizzeable(unsigned Reg) const {
288 for (MachineRegisterInfo::use_instr_iterator It = MRI->use_instr_begin(Reg),
289 E = MRI->use_instr_end(); It != E; ++It) {
290 if (!canSwizzle(*It))
291 return false;
293 return true;
296 bool R600VectorRegMerger::tryMergeUsingCommonSlot(RegSeqInfo &RSI,
297 RegSeqInfo &CompatibleRSI,
298 std::vector<std::pair<unsigned, unsigned>> &RemapChan) {
299 for (MachineInstr::mop_iterator MOp = RSI.Instr->operands_begin(),
300 MOE = RSI.Instr->operands_end(); MOp != MOE; ++MOp) {
301 if (!MOp->isReg())
302 continue;
303 if (PreviousRegSeqByReg[MOp->getReg()].empty())
304 continue;
305 for (MachineInstr *MI : PreviousRegSeqByReg[MOp->getReg()]) {
306 CompatibleRSI = PreviousRegSeq[MI];
307 if (RSI == CompatibleRSI)
308 continue;
309 if (tryMergeVector(&CompatibleRSI, &RSI, RemapChan))
310 return true;
313 return false;
316 bool R600VectorRegMerger::tryMergeUsingFreeSlot(RegSeqInfo &RSI,
317 RegSeqInfo &CompatibleRSI,
318 std::vector<std::pair<unsigned, unsigned>> &RemapChan) {
319 unsigned NeededUndefs = 4 - RSI.UndefReg.size();
320 if (PreviousRegSeqByUndefCount[NeededUndefs].empty())
321 return false;
322 std::vector<MachineInstr *> &MIs =
323 PreviousRegSeqByUndefCount[NeededUndefs];
324 CompatibleRSI = PreviousRegSeq[MIs.back()];
325 tryMergeVector(&CompatibleRSI, &RSI, RemapChan);
326 return true;
329 void R600VectorRegMerger::trackRSI(const RegSeqInfo &RSI) {
330 for (DenseMap<unsigned, unsigned>::const_iterator
331 It = RSI.RegToChan.begin(), E = RSI.RegToChan.end(); It != E; ++It) {
332 PreviousRegSeqByReg[(*It).first].push_back(RSI.Instr);
334 PreviousRegSeqByUndefCount[RSI.UndefReg.size()].push_back(RSI.Instr);
335 PreviousRegSeq[RSI.Instr] = RSI;
338 bool R600VectorRegMerger::runOnMachineFunction(MachineFunction &Fn) {
339 if (skipFunction(Fn.getFunction()))
340 return false;
342 const R600Subtarget &ST = Fn.getSubtarget<R600Subtarget>();
343 TII = ST.getInstrInfo();
344 MRI = &Fn.getRegInfo();
346 for (MachineFunction::iterator MBB = Fn.begin(), MBBe = Fn.end();
347 MBB != MBBe; ++MBB) {
348 MachineBasicBlock *MB = &*MBB;
349 PreviousRegSeq.clear();
350 PreviousRegSeqByReg.clear();
351 PreviousRegSeqByUndefCount.clear();
353 for (MachineBasicBlock::iterator MII = MB->begin(), MIIE = MB->end();
354 MII != MIIE; ++MII) {
355 MachineInstr &MI = *MII;
356 if (MI.getOpcode() != R600::REG_SEQUENCE) {
357 if (TII->get(MI.getOpcode()).TSFlags & R600_InstFlag::TEX_INST) {
358 unsigned Reg = MI.getOperand(1).getReg();
359 for (MachineRegisterInfo::def_instr_iterator
360 It = MRI->def_instr_begin(Reg), E = MRI->def_instr_end();
361 It != E; ++It) {
362 RemoveMI(&(*It));
365 continue;
368 RegSeqInfo RSI(*MRI, &MI);
370 // All uses of MI are swizzeable ?
371 unsigned Reg = MI.getOperand(0).getReg();
372 if (!areAllUsesSwizzeable(Reg))
373 continue;
375 LLVM_DEBUG({
376 dbgs() << "Trying to optimize ";
377 MI.dump();
380 RegSeqInfo CandidateRSI;
381 std::vector<std::pair<unsigned, unsigned>> RemapChan;
382 LLVM_DEBUG(dbgs() << "Using common slots...\n";);
383 if (tryMergeUsingCommonSlot(RSI, CandidateRSI, RemapChan)) {
384 // Remove CandidateRSI mapping
385 RemoveMI(CandidateRSI.Instr);
386 MII = RebuildVector(&RSI, &CandidateRSI, RemapChan);
387 trackRSI(RSI);
388 continue;
390 LLVM_DEBUG(dbgs() << "Using free slots...\n";);
391 RemapChan.clear();
392 if (tryMergeUsingFreeSlot(RSI, CandidateRSI, RemapChan)) {
393 RemoveMI(CandidateRSI.Instr);
394 MII = RebuildVector(&RSI, &CandidateRSI, RemapChan);
395 trackRSI(RSI);
396 continue;
398 //Failed to merge
399 trackRSI(RSI);
402 return false;
405 llvm::FunctionPass *llvm::createR600VectorRegMerger() {
406 return new R600VectorRegMerger();