Eugene Zelenko | 59e1282 | 2017-08-08 00:47:13 +0000 | [diff] [blame] | 1 | //===- SILoadStoreOptimizer.cpp -------------------------------------------===// |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This pass tries to fuse DS instructions with close by immediate offsets. |
| 11 | // This will fuse operations such as |
| 12 | // ds_read_b32 v0, v2 offset:16 |
| 13 | // ds_read_b32 v1, v2 offset:32 |
| 14 | // ==> |
| 15 | // ds_read2_b32 v[0:1], v2, offset0:4 offset1:8 |
| 16 | // |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 17 | // The same is done for certain SMEM opcodes, e.g.: |
| 18 | // s_buffer_load_dword s4, s[0:3], 4 |
| 19 | // s_buffer_load_dword s5, s[0:3], 8 |
| 20 | // ==> |
| 21 | // s_buffer_load_dwordx2 s[4:5], s[0:3], 4 |
| 22 | // |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 23 | // |
| 24 | // Future improvements: |
| 25 | // |
| 26 | // - This currently relies on the scheduler to place loads and stores next to |
| 27 | // each other, and then only merges adjacent pairs of instructions. It would |
| 28 | // be good to be more flexible with interleaved instructions, and possibly run |
| 29 | // before scheduling. It currently missing stores of constants because loading |
| 30 | // the constant into the data register is placed between the stores, although |
| 31 | // this is arguably a scheduling problem. |
| 32 | // |
| 33 | // - Live interval recomputing seems inefficient. This currently only matches |
| 34 | // one pair, and recomputes live intervals and moves on to the next pair. It |
Konstantin Zhuravlyov | ecc7cbf | 2016-03-29 15:15:44 +0000 | [diff] [blame] | 35 | // would be better to compute a list of all merges that need to occur. |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 36 | // |
| 37 | // - With a list of instructions to process, we can also merge more. If a |
| 38 | // cluster of loads have offsets that are too large to fit in the 8-bit |
| 39 | // offsets, but are close enough to fit in the 8 bits, we can add to the base |
| 40 | // pointer and use the new reduced offsets. |
| 41 | // |
| 42 | //===----------------------------------------------------------------------===// |
| 43 | |
| 44 | #include "AMDGPU.h" |
Matt Arsenault | 43e92fe | 2016-06-24 06:30:11 +0000 | [diff] [blame] | 45 | #include "AMDGPUSubtarget.h" |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 46 | #include "SIInstrInfo.h" |
| 47 | #include "SIRegisterInfo.h" |
Eugene Zelenko | 6620376 | 2017-01-21 00:53:49 +0000 | [diff] [blame] | 48 | #include "Utils/AMDGPUBaseInfo.h" |
| 49 | #include "llvm/ADT/ArrayRef.h" |
| 50 | #include "llvm/ADT/SmallVector.h" |
| 51 | #include "llvm/ADT/StringRef.h" |
| 52 | #include "llvm/Analysis/AliasAnalysis.h" |
| 53 | #include "llvm/CodeGen/MachineBasicBlock.h" |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 54 | #include "llvm/CodeGen/MachineFunction.h" |
| 55 | #include "llvm/CodeGen/MachineFunctionPass.h" |
Eugene Zelenko | 6620376 | 2017-01-21 00:53:49 +0000 | [diff] [blame] | 56 | #include "llvm/CodeGen/MachineInstr.h" |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 57 | #include "llvm/CodeGen/MachineInstrBuilder.h" |
Eugene Zelenko | 6620376 | 2017-01-21 00:53:49 +0000 | [diff] [blame] | 58 | #include "llvm/CodeGen/MachineOperand.h" |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 59 | #include "llvm/CodeGen/MachineRegisterInfo.h" |
Eugene Zelenko | 6620376 | 2017-01-21 00:53:49 +0000 | [diff] [blame] | 60 | #include "llvm/IR/DebugLoc.h" |
| 61 | #include "llvm/Pass.h" |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 62 | #include "llvm/Support/Debug.h" |
Eugene Zelenko | 6620376 | 2017-01-21 00:53:49 +0000 | [diff] [blame] | 63 | #include "llvm/Support/MathExtras.h" |
Benjamin Kramer | 799003b | 2015-03-23 19:32:43 +0000 | [diff] [blame] | 64 | #include "llvm/Support/raw_ostream.h" |
Eugene Zelenko | 59e1282 | 2017-08-08 00:47:13 +0000 | [diff] [blame] | 65 | #include <algorithm> |
Eugene Zelenko | 6620376 | 2017-01-21 00:53:49 +0000 | [diff] [blame] | 66 | #include <cassert> |
Eugene Zelenko | 59e1282 | 2017-08-08 00:47:13 +0000 | [diff] [blame] | 67 | #include <cstdlib> |
Eugene Zelenko | 6620376 | 2017-01-21 00:53:49 +0000 | [diff] [blame] | 68 | #include <iterator> |
| 69 | #include <utility> |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 70 | |
| 71 | using namespace llvm; |
| 72 | |
| 73 | #define DEBUG_TYPE "si-load-store-opt" |
| 74 | |
| 75 | namespace { |
| 76 | |
| 77 | class SILoadStoreOptimizer : public MachineFunctionPass { |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 78 | enum InstClassEnum { |
| 79 | DS_READ_WRITE, |
| 80 | S_BUFFER_LOAD_IMM, |
| 81 | BUFFER_LOAD_OFFEN, |
Marek Olsak | 4c421a2d | 2017-11-09 01:52:36 +0000 | [diff] [blame] | 82 | BUFFER_LOAD_OFFSET, |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 83 | }; |
| 84 | |
NAKAMURA Takumi | aba2b3d | 2017-10-10 08:30:53 +0000 | [diff] [blame] | 85 | struct CombineInfo { |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 86 | MachineBasicBlock::iterator I; |
| 87 | MachineBasicBlock::iterator Paired; |
| 88 | unsigned EltSize; |
| 89 | unsigned Offset0; |
| 90 | unsigned Offset1; |
| 91 | unsigned BaseOff; |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 92 | InstClassEnum InstClass; |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 93 | bool GLC0; |
| 94 | bool GLC1; |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 95 | bool SLC0; |
| 96 | bool SLC1; |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 97 | bool UseST64; |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 98 | bool IsX2; |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 99 | SmallVector<MachineInstr*, 8> InstsToMove; |
Eugene Zelenko | 59e1282 | 2017-08-08 00:47:13 +0000 | [diff] [blame] | 100 | }; |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 101 | |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 102 | private: |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 103 | const SISubtarget *STM = nullptr; |
Eugene Zelenko | 6620376 | 2017-01-21 00:53:49 +0000 | [diff] [blame] | 104 | const SIInstrInfo *TII = nullptr; |
| 105 | const SIRegisterInfo *TRI = nullptr; |
| 106 | MachineRegisterInfo *MRI = nullptr; |
| 107 | AliasAnalysis *AA = nullptr; |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 108 | unsigned CreatedX2; |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 109 | |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 110 | static bool offsetsCanBeCombined(CombineInfo &CI); |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 111 | |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 112 | bool findMatchingInst(CombineInfo &CI); |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 113 | MachineBasicBlock::iterator mergeRead2Pair(CombineInfo &CI); |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 114 | MachineBasicBlock::iterator mergeWrite2Pair(CombineInfo &CI); |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 115 | MachineBasicBlock::iterator mergeSBufferLoadImmPair(CombineInfo &CI); |
Marek Olsak | 4c421a2d | 2017-11-09 01:52:36 +0000 | [diff] [blame] | 116 | MachineBasicBlock::iterator mergeBufferLoadPair(CombineInfo &CI); |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 117 | |
| 118 | public: |
| 119 | static char ID; |
| 120 | |
Francis Visoiu Mistrih | 8b61764 | 2017-05-18 17:21:13 +0000 | [diff] [blame] | 121 | SILoadStoreOptimizer() : MachineFunctionPass(ID) { |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 122 | initializeSILoadStoreOptimizerPass(*PassRegistry::getPassRegistry()); |
| 123 | } |
| 124 | |
| 125 | bool optimizeBlock(MachineBasicBlock &MBB); |
| 126 | |
| 127 | bool runOnMachineFunction(MachineFunction &MF) override; |
| 128 | |
Mehdi Amini | 117296c | 2016-10-01 02:56:57 +0000 | [diff] [blame] | 129 | StringRef getPassName() const override { return "SI Load / Store Optimizer"; } |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 130 | |
| 131 | void getAnalysisUsage(AnalysisUsage &AU) const override { |
| 132 | AU.setPreservesCFG(); |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 133 | AU.addRequired<AAResultsWrapperPass>(); |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 134 | |
| 135 | MachineFunctionPass::getAnalysisUsage(AU); |
| 136 | } |
| 137 | }; |
| 138 | |
Eugene Zelenko | 6620376 | 2017-01-21 00:53:49 +0000 | [diff] [blame] | 139 | } // end anonymous namespace. |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 140 | |
| 141 | INITIALIZE_PASS_BEGIN(SILoadStoreOptimizer, DEBUG_TYPE, |
| 142 | "SI Load / Store Optimizer", false, false) |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 143 | INITIALIZE_PASS_DEPENDENCY(AAResultsWrapperPass) |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 144 | INITIALIZE_PASS_END(SILoadStoreOptimizer, DEBUG_TYPE, |
| 145 | "SI Load / Store Optimizer", false, false) |
| 146 | |
| 147 | char SILoadStoreOptimizer::ID = 0; |
| 148 | |
| 149 | char &llvm::SILoadStoreOptimizerID = SILoadStoreOptimizer::ID; |
| 150 | |
Francis Visoiu Mistrih | 8b61764 | 2017-05-18 17:21:13 +0000 | [diff] [blame] | 151 | FunctionPass *llvm::createSILoadStoreOptimizerPass() { |
| 152 | return new SILoadStoreOptimizer(); |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 153 | } |
| 154 | |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 155 | static void moveInstsAfter(MachineBasicBlock::iterator I, |
| 156 | ArrayRef<MachineInstr*> InstsToMove) { |
| 157 | MachineBasicBlock *MBB = I->getParent(); |
| 158 | ++I; |
| 159 | for (MachineInstr *MI : InstsToMove) { |
| 160 | MI->removeFromParent(); |
| 161 | MBB->insert(I, MI); |
| 162 | } |
| 163 | } |
| 164 | |
Matt Arsenault | 67e72de | 2017-08-31 01:53:09 +0000 | [diff] [blame] | 165 | static void addDefsToList(const MachineInstr &MI, DenseSet<unsigned> &Defs) { |
| 166 | // XXX: Should this be looking for implicit defs? |
| 167 | for (const MachineOperand &Def : MI.defs()) |
| 168 | Defs.insert(Def.getReg()); |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 169 | } |
| 170 | |
Eugene Zelenko | 6620376 | 2017-01-21 00:53:49 +0000 | [diff] [blame] | 171 | static bool memAccessesCanBeReordered(MachineBasicBlock::iterator A, |
| 172 | MachineBasicBlock::iterator B, |
| 173 | const SIInstrInfo *TII, |
| 174 | AliasAnalysis * AA) { |
Matt Arsenault | 67e72de | 2017-08-31 01:53:09 +0000 | [diff] [blame] | 175 | // RAW or WAR - cannot reorder |
| 176 | // WAW - cannot reorder |
| 177 | // RAR - safe to reorder |
| 178 | return !(A->mayStore() || B->mayStore()) || |
| 179 | TII->areMemAccessesTriviallyDisjoint(*A, *B, AA); |
Alexander Timofeev | f867a40 | 2016-11-03 14:37:13 +0000 | [diff] [blame] | 180 | } |
| 181 | |
Nicolai Haehnle | 7b0e25b | 2016-10-27 08:15:07 +0000 | [diff] [blame] | 182 | // Add MI and its defs to the lists if MI reads one of the defs that are |
| 183 | // already in the list. Returns true in that case. |
| 184 | static bool |
| 185 | addToListsIfDependent(MachineInstr &MI, |
Matt Arsenault | 67e72de | 2017-08-31 01:53:09 +0000 | [diff] [blame] | 186 | DenseSet<unsigned> &Defs, |
Nicolai Haehnle | 7b0e25b | 2016-10-27 08:15:07 +0000 | [diff] [blame] | 187 | SmallVectorImpl<MachineInstr*> &Insts) { |
Matt Arsenault | 67e72de | 2017-08-31 01:53:09 +0000 | [diff] [blame] | 188 | for (MachineOperand &Use : MI.operands()) { |
| 189 | // If one of the defs is read, then there is a use of Def between I and the |
| 190 | // instruction that I will potentially be merged with. We will need to move |
| 191 | // this instruction after the merged instructions. |
| 192 | |
| 193 | if (Use.isReg() && Use.readsReg() && Defs.count(Use.getReg())) { |
Nicolai Haehnle | 7b0e25b | 2016-10-27 08:15:07 +0000 | [diff] [blame] | 194 | Insts.push_back(&MI); |
| 195 | addDefsToList(MI, Defs); |
| 196 | return true; |
| 197 | } |
| 198 | } |
| 199 | |
| 200 | return false; |
| 201 | } |
| 202 | |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 203 | static bool |
| 204 | canMoveInstsAcrossMemOp(MachineInstr &MemOp, |
| 205 | ArrayRef<MachineInstr*> InstsToMove, |
| 206 | const SIInstrInfo *TII, |
| 207 | AliasAnalysis *AA) { |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 208 | assert(MemOp.mayLoadOrStore()); |
| 209 | |
| 210 | for (MachineInstr *InstToMove : InstsToMove) { |
| 211 | if (!InstToMove->mayLoadOrStore()) |
| 212 | continue; |
Alexander Timofeev | f867a40 | 2016-11-03 14:37:13 +0000 | [diff] [blame] | 213 | if (!memAccessesCanBeReordered(MemOp, *InstToMove, TII, AA)) |
| 214 | return false; |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 215 | } |
| 216 | return true; |
| 217 | } |
| 218 | |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 219 | bool SILoadStoreOptimizer::offsetsCanBeCombined(CombineInfo &CI) { |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 220 | // XXX - Would the same offset be OK? Is there any reason this would happen or |
| 221 | // be useful? |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 222 | if (CI.Offset0 == CI.Offset1) |
Matt Arsenault | fe0a2e6 | 2014-10-10 22:12:32 +0000 | [diff] [blame] | 223 | return false; |
| 224 | |
| 225 | // This won't be valid if the offset isn't aligned. |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 226 | if ((CI.Offset0 % CI.EltSize != 0) || (CI.Offset1 % CI.EltSize != 0)) |
Matt Arsenault | fe0a2e6 | 2014-10-10 22:12:32 +0000 | [diff] [blame] | 227 | return false; |
| 228 | |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 229 | unsigned EltOffset0 = CI.Offset0 / CI.EltSize; |
| 230 | unsigned EltOffset1 = CI.Offset1 / CI.EltSize; |
| 231 | CI.UseST64 = false; |
| 232 | CI.BaseOff = 0; |
Matt Arsenault | fe0a2e6 | 2014-10-10 22:12:32 +0000 | [diff] [blame] | 233 | |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 234 | // SMEM offsets must be consecutive. |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 235 | if (CI.InstClass == S_BUFFER_LOAD_IMM || |
Marek Olsak | 4c421a2d | 2017-11-09 01:52:36 +0000 | [diff] [blame] | 236 | CI.InstClass == BUFFER_LOAD_OFFEN || |
| 237 | CI.InstClass == BUFFER_LOAD_OFFSET) { |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 238 | unsigned Diff = CI.IsX2 ? 2 : 1; |
| 239 | return (EltOffset0 + Diff == EltOffset1 || |
| 240 | EltOffset1 + Diff == EltOffset0) && |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 241 | CI.GLC0 == CI.GLC1 && |
| 242 | (CI.InstClass == S_BUFFER_LOAD_IMM || CI.SLC0 == CI.SLC1); |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 243 | } |
| 244 | |
Matt Arsenault | fe0a2e6 | 2014-10-10 22:12:32 +0000 | [diff] [blame] | 245 | // If the offset in elements doesn't fit in 8-bits, we might be able to use |
| 246 | // the stride 64 versions. |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 247 | if ((EltOffset0 % 64 == 0) && (EltOffset1 % 64) == 0 && |
| 248 | isUInt<8>(EltOffset0 / 64) && isUInt<8>(EltOffset1 / 64)) { |
| 249 | CI.Offset0 = EltOffset0 / 64; |
| 250 | CI.Offset1 = EltOffset1 / 64; |
| 251 | CI.UseST64 = true; |
| 252 | return true; |
| 253 | } |
Matt Arsenault | fe0a2e6 | 2014-10-10 22:12:32 +0000 | [diff] [blame] | 254 | |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 255 | // Check if the new offsets fit in the reduced 8-bit range. |
| 256 | if (isUInt<8>(EltOffset0) && isUInt<8>(EltOffset1)) { |
| 257 | CI.Offset0 = EltOffset0; |
| 258 | CI.Offset1 = EltOffset1; |
| 259 | return true; |
| 260 | } |
| 261 | |
| 262 | // Try to shift base address to decrease offsets. |
| 263 | unsigned OffsetDiff = std::abs((int)EltOffset1 - (int)EltOffset0); |
| 264 | CI.BaseOff = std::min(CI.Offset0, CI.Offset1); |
| 265 | |
| 266 | if ((OffsetDiff % 64 == 0) && isUInt<8>(OffsetDiff / 64)) { |
| 267 | CI.Offset0 = (EltOffset0 - CI.BaseOff / CI.EltSize) / 64; |
| 268 | CI.Offset1 = (EltOffset1 - CI.BaseOff / CI.EltSize) / 64; |
| 269 | CI.UseST64 = true; |
| 270 | return true; |
| 271 | } |
| 272 | |
| 273 | if (isUInt<8>(OffsetDiff)) { |
| 274 | CI.Offset0 = EltOffset0 - CI.BaseOff / CI.EltSize; |
| 275 | CI.Offset1 = EltOffset1 - CI.BaseOff / CI.EltSize; |
| 276 | return true; |
| 277 | } |
| 278 | |
| 279 | return false; |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 280 | } |
| 281 | |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 282 | bool SILoadStoreOptimizer::findMatchingInst(CombineInfo &CI) { |
Matt Arsenault | 67e72de | 2017-08-31 01:53:09 +0000 | [diff] [blame] | 283 | MachineBasicBlock *MBB = CI.I->getParent(); |
| 284 | MachineBasicBlock::iterator E = MBB->end(); |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 285 | MachineBasicBlock::iterator MBBI = CI.I; |
Matt Arsenault | 3cb6163 | 2017-08-30 03:26:18 +0000 | [diff] [blame] | 286 | |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 287 | unsigned AddrOpName[3] = {0}; |
| 288 | int AddrIdx[3]; |
| 289 | const MachineOperand *AddrReg[3]; |
| 290 | unsigned NumAddresses = 0; |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 291 | |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 292 | switch (CI.InstClass) { |
| 293 | case DS_READ_WRITE: |
| 294 | AddrOpName[NumAddresses++] = AMDGPU::OpName::addr; |
| 295 | break; |
| 296 | case S_BUFFER_LOAD_IMM: |
| 297 | AddrOpName[NumAddresses++] = AMDGPU::OpName::sbase; |
| 298 | break; |
| 299 | case BUFFER_LOAD_OFFEN: |
| 300 | AddrOpName[NumAddresses++] = AMDGPU::OpName::srsrc; |
| 301 | AddrOpName[NumAddresses++] = AMDGPU::OpName::vaddr; |
| 302 | AddrOpName[NumAddresses++] = AMDGPU::OpName::soffset; |
| 303 | break; |
Marek Olsak | 4c421a2d | 2017-11-09 01:52:36 +0000 | [diff] [blame] | 304 | case BUFFER_LOAD_OFFSET: |
| 305 | AddrOpName[NumAddresses++] = AMDGPU::OpName::srsrc; |
| 306 | AddrOpName[NumAddresses++] = AMDGPU::OpName::soffset; |
| 307 | break; |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 308 | default: |
| 309 | llvm_unreachable("invalid InstClass"); |
| 310 | } |
Matt Arsenault | 3cb6163 | 2017-08-30 03:26:18 +0000 | [diff] [blame] | 311 | |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 312 | for (unsigned i = 0; i < NumAddresses; i++) { |
| 313 | AddrIdx[i] = AMDGPU::getNamedOperandIdx(CI.I->getOpcode(), AddrOpName[i]); |
| 314 | AddrReg[i] = &CI.I->getOperand(AddrIdx[i]); |
| 315 | |
| 316 | // We only ever merge operations with the same base address register, so don't |
| 317 | // bother scanning forward if there are no other uses. |
| 318 | if (AddrReg[i]->isReg() && |
| 319 | (TargetRegisterInfo::isPhysicalRegister(AddrReg[i]->getReg()) || |
| 320 | MRI->hasOneNonDBGUse(AddrReg[i]->getReg()))) |
| 321 | return false; |
| 322 | } |
Matt Arsenault | 3cb6163 | 2017-08-30 03:26:18 +0000 | [diff] [blame] | 323 | |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 324 | ++MBBI; |
| 325 | |
Matt Arsenault | 67e72de | 2017-08-31 01:53:09 +0000 | [diff] [blame] | 326 | DenseSet<unsigned> DefsToMove; |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 327 | addDefsToList(*CI.I, DefsToMove); |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 328 | |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 329 | for ( ; MBBI != E; ++MBBI) { |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 330 | if (MBBI->getOpcode() != CI.I->getOpcode()) { |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 331 | // This is not a matching DS instruction, but we can keep looking as |
| 332 | // long as one of these conditions are met: |
| 333 | // 1. It is safe to move I down past MBBI. |
| 334 | // 2. It is safe to move MBBI down past the instruction that I will |
| 335 | // be merged into. |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 336 | |
Matt Arsenault | 2d69c92 | 2017-08-29 21:25:51 +0000 | [diff] [blame] | 337 | if (MBBI->hasUnmodeledSideEffects()) { |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 338 | // We can't re-order this instruction with respect to other memory |
Matt Arsenault | 2d69c92 | 2017-08-29 21:25:51 +0000 | [diff] [blame] | 339 | // operations, so we fail both conditions mentioned above. |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 340 | return false; |
Matt Arsenault | 2d69c92 | 2017-08-29 21:25:51 +0000 | [diff] [blame] | 341 | } |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 342 | |
| 343 | if (MBBI->mayLoadOrStore() && |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 344 | !memAccessesCanBeReordered(*CI.I, *MBBI, TII, AA)) { |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 345 | // We fail condition #1, but we may still be able to satisfy condition |
| 346 | // #2. Add this instruction to the move list and then we will check |
| 347 | // if condition #2 holds once we have selected the matching instruction. |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 348 | CI.InstsToMove.push_back(&*MBBI); |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 349 | addDefsToList(*MBBI, DefsToMove); |
| 350 | continue; |
| 351 | } |
| 352 | |
| 353 | // When we match I with another DS instruction we will be moving I down |
| 354 | // to the location of the matched instruction any uses of I will need to |
| 355 | // be moved down as well. |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 356 | addToListsIfDependent(*MBBI, DefsToMove, CI.InstsToMove); |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 357 | continue; |
| 358 | } |
| 359 | |
| 360 | // Don't merge volatiles. |
| 361 | if (MBBI->hasOrderedMemoryRef()) |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 362 | return false; |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 363 | |
Nicolai Haehnle | 7b0e25b | 2016-10-27 08:15:07 +0000 | [diff] [blame] | 364 | // Handle a case like |
| 365 | // DS_WRITE_B32 addr, v, idx0 |
| 366 | // w = DS_READ_B32 addr, idx0 |
| 367 | // DS_WRITE_B32 addr, f(w), idx1 |
| 368 | // where the DS_READ_B32 ends up in InstsToMove and therefore prevents |
| 369 | // merging of the two writes. |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 370 | if (addToListsIfDependent(*MBBI, DefsToMove, CI.InstsToMove)) |
Nicolai Haehnle | 7b0e25b | 2016-10-27 08:15:07 +0000 | [diff] [blame] | 371 | continue; |
| 372 | |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 373 | bool Match = true; |
| 374 | for (unsigned i = 0; i < NumAddresses; i++) { |
| 375 | const MachineOperand &AddrRegNext = MBBI->getOperand(AddrIdx[i]); |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 376 | |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 377 | if (AddrReg[i]->isImm() || AddrRegNext.isImm()) { |
| 378 | if (AddrReg[i]->isImm() != AddrRegNext.isImm() || |
| 379 | AddrReg[i]->getImm() != AddrRegNext.getImm()) { |
| 380 | Match = false; |
| 381 | break; |
| 382 | } |
| 383 | continue; |
| 384 | } |
| 385 | |
| 386 | // Check same base pointer. Be careful of subregisters, which can occur with |
| 387 | // vectors of pointers. |
| 388 | if (AddrReg[i]->getReg() != AddrRegNext.getReg() || |
| 389 | AddrReg[i]->getSubReg() != AddrRegNext.getSubReg()) { |
| 390 | Match = false; |
| 391 | break; |
| 392 | } |
| 393 | } |
| 394 | |
| 395 | if (Match) { |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 396 | int OffsetIdx = AMDGPU::getNamedOperandIdx(CI.I->getOpcode(), |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 397 | AMDGPU::OpName::offset); |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 398 | CI.Offset0 = CI.I->getOperand(OffsetIdx).getImm(); |
| 399 | CI.Offset1 = MBBI->getOperand(OffsetIdx).getImm(); |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 400 | CI.Paired = MBBI; |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 401 | |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 402 | if (CI.InstClass == DS_READ_WRITE) { |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 403 | CI.Offset0 &= 0xffff; |
| 404 | CI.Offset1 &= 0xffff; |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 405 | } else { |
| 406 | CI.GLC0 = TII->getNamedOperand(*CI.I, AMDGPU::OpName::glc)->getImm(); |
| 407 | CI.GLC1 = TII->getNamedOperand(*MBBI, AMDGPU::OpName::glc)->getImm(); |
Marek Olsak | 4c421a2d | 2017-11-09 01:52:36 +0000 | [diff] [blame] | 408 | if (CI.InstClass != S_BUFFER_LOAD_IMM) { |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 409 | CI.SLC0 = TII->getNamedOperand(*CI.I, AMDGPU::OpName::slc)->getImm(); |
| 410 | CI.SLC1 = TII->getNamedOperand(*MBBI, AMDGPU::OpName::slc)->getImm(); |
| 411 | } |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 412 | } |
| 413 | |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 414 | // Check both offsets fit in the reduced range. |
| 415 | // We also need to go through the list of instructions that we plan to |
| 416 | // move and make sure they are all safe to move down past the merged |
| 417 | // instruction. |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 418 | if (offsetsCanBeCombined(CI)) |
| 419 | if (canMoveInstsAcrossMemOp(*MBBI, CI.InstsToMove, TII, AA)) |
| 420 | return true; |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 421 | } |
| 422 | |
| 423 | // We've found a load/store that we couldn't merge for some reason. |
| 424 | // We could potentially keep looking, but we'd need to make sure that |
| 425 | // it was safe to move I and also all the instruction in InstsToMove |
| 426 | // down past this instruction. |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 427 | // check if we can move I across MBBI and if we can move all I's users |
| 428 | if (!memAccessesCanBeReordered(*CI.I, *MBBI, TII, AA) || |
| 429 | !canMoveInstsAcrossMemOp(*MBBI, CI.InstsToMove, TII, AA)) |
Alexander Timofeev | f867a40 | 2016-11-03 14:37:13 +0000 | [diff] [blame] | 430 | break; |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 431 | } |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 432 | return false; |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 433 | } |
| 434 | |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 435 | MachineBasicBlock::iterator SILoadStoreOptimizer::mergeRead2Pair( |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 436 | CombineInfo &CI) { |
| 437 | MachineBasicBlock *MBB = CI.I->getParent(); |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 438 | |
| 439 | // Be careful, since the addresses could be subregisters themselves in weird |
| 440 | // cases, like vectors of pointers. |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 441 | const auto *AddrReg = TII->getNamedOperand(*CI.I, AMDGPU::OpName::addr); |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 442 | |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 443 | const auto *Dest0 = TII->getNamedOperand(*CI.I, AMDGPU::OpName::vdst); |
| 444 | const auto *Dest1 = TII->getNamedOperand(*CI.Paired, AMDGPU::OpName::vdst); |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 445 | |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 446 | unsigned NewOffset0 = CI.Offset0; |
| 447 | unsigned NewOffset1 = CI.Offset1; |
| 448 | unsigned Opc = (CI.EltSize == 4) ? AMDGPU::DS_READ2_B32 |
| 449 | : AMDGPU::DS_READ2_B64; |
Matt Arsenault | fe0a2e6 | 2014-10-10 22:12:32 +0000 | [diff] [blame] | 450 | |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 451 | if (CI.UseST64) |
| 452 | Opc = (CI.EltSize == 4) ? AMDGPU::DS_READ2ST64_B32 |
| 453 | : AMDGPU::DS_READ2ST64_B64; |
Matt Arsenault | fe0a2e6 | 2014-10-10 22:12:32 +0000 | [diff] [blame] | 454 | |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 455 | unsigned SubRegIdx0 = (CI.EltSize == 4) ? AMDGPU::sub0 : AMDGPU::sub0_sub1; |
| 456 | unsigned SubRegIdx1 = (CI.EltSize == 4) ? AMDGPU::sub1 : AMDGPU::sub2_sub3; |
Tom Stellard | e175d8a | 2016-08-26 21:36:47 +0000 | [diff] [blame] | 457 | |
| 458 | if (NewOffset0 > NewOffset1) { |
| 459 | // Canonicalize the merged instruction so the smaller offset comes first. |
| 460 | std::swap(NewOffset0, NewOffset1); |
| 461 | std::swap(SubRegIdx0, SubRegIdx1); |
| 462 | } |
| 463 | |
Matt Arsenault | fe0a2e6 | 2014-10-10 22:12:32 +0000 | [diff] [blame] | 464 | assert((isUInt<8>(NewOffset0) && isUInt<8>(NewOffset1)) && |
| 465 | (NewOffset0 != NewOffset1) && |
| 466 | "Computed offset doesn't fit"); |
| 467 | |
| 468 | const MCInstrDesc &Read2Desc = TII->get(Opc); |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 469 | |
| 470 | const TargetRegisterClass *SuperRC |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 471 | = (CI.EltSize == 4) ? &AMDGPU::VReg_64RegClass : &AMDGPU::VReg_128RegClass; |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 472 | unsigned DestReg = MRI->createVirtualRegister(SuperRC); |
| 473 | |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 474 | DebugLoc DL = CI.I->getDebugLoc(); |
| 475 | |
| 476 | unsigned BaseReg = AddrReg->getReg(); |
| 477 | unsigned BaseRegFlags = 0; |
| 478 | if (CI.BaseOff) { |
| 479 | BaseReg = MRI->createVirtualRegister(&AMDGPU::VGPR_32RegClass); |
| 480 | BaseRegFlags = RegState::Kill; |
Reid Kleckner | dbc9ba3 | 2017-04-13 20:32:58 +0000 | [diff] [blame] | 481 | BuildMI(*MBB, CI.Paired, DL, TII->get(AMDGPU::V_ADD_I32_e32), BaseReg) |
Stanislav Mekhanoshin | 86b0a54 | 2017-04-14 00:33:44 +0000 | [diff] [blame] | 482 | .addImm(CI.BaseOff) |
| 483 | .addReg(AddrReg->getReg()); |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 484 | } |
| 485 | |
Stanislav Mekhanoshin | 86b0a54 | 2017-04-14 00:33:44 +0000 | [diff] [blame] | 486 | MachineInstrBuilder Read2 = |
| 487 | BuildMI(*MBB, CI.Paired, DL, Read2Desc, DestReg) |
| 488 | .addReg(BaseReg, BaseRegFlags) // addr |
| 489 | .addImm(NewOffset0) // offset0 |
| 490 | .addImm(NewOffset1) // offset1 |
| 491 | .addImm(0) // gds |
| 492 | .setMemRefs(CI.I->mergeMemRefsWith(*CI.Paired)); |
| 493 | |
NAKAMURA Takumi | 9720f57 | 2016-08-30 11:50:21 +0000 | [diff] [blame] | 494 | (void)Read2; |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 495 | |
Matt Arsenault | 84db5d9 | 2015-07-14 17:57:36 +0000 | [diff] [blame] | 496 | const MCInstrDesc &CopyDesc = TII->get(TargetOpcode::COPY); |
| 497 | |
| 498 | // Copy to the old destination registers. |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 499 | BuildMI(*MBB, CI.Paired, DL, CopyDesc) |
Diana Picus | 116bbab | 2017-01-13 09:58:52 +0000 | [diff] [blame] | 500 | .add(*Dest0) // Copy to same destination including flags and sub reg. |
| 501 | .addReg(DestReg, 0, SubRegIdx0); |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 502 | MachineInstr *Copy1 = BuildMI(*MBB, CI.Paired, DL, CopyDesc) |
Diana Picus | 116bbab | 2017-01-13 09:58:52 +0000 | [diff] [blame] | 503 | .add(*Dest1) |
| 504 | .addReg(DestReg, RegState::Kill, SubRegIdx1); |
Matt Arsenault | 84db5d9 | 2015-07-14 17:57:36 +0000 | [diff] [blame] | 505 | |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 506 | moveInstsAfter(Copy1, CI.InstsToMove); |
Matt Arsenault | 84db5d9 | 2015-07-14 17:57:36 +0000 | [diff] [blame] | 507 | |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 508 | MachineBasicBlock::iterator Next = std::next(CI.I); |
| 509 | CI.I->eraseFromParent(); |
| 510 | CI.Paired->eraseFromParent(); |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 511 | |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 512 | DEBUG(dbgs() << "Inserted read2: " << *Read2 << '\n'); |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 513 | return Next; |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 514 | } |
| 515 | |
| 516 | MachineBasicBlock::iterator SILoadStoreOptimizer::mergeWrite2Pair( |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 517 | CombineInfo &CI) { |
| 518 | MachineBasicBlock *MBB = CI.I->getParent(); |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 519 | |
| 520 | // Be sure to use .addOperand(), and not .addReg() with these. We want to be |
| 521 | // sure we preserve the subregister index and any register flags set on them. |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 522 | const MachineOperand *Addr = TII->getNamedOperand(*CI.I, AMDGPU::OpName::addr); |
| 523 | const MachineOperand *Data0 = TII->getNamedOperand(*CI.I, AMDGPU::OpName::data0); |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 524 | const MachineOperand *Data1 |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 525 | = TII->getNamedOperand(*CI.Paired, AMDGPU::OpName::data0); |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 526 | |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 527 | unsigned NewOffset0 = CI.Offset0; |
| 528 | unsigned NewOffset1 = CI.Offset1; |
| 529 | unsigned Opc = (CI.EltSize == 4) ? AMDGPU::DS_WRITE2_B32 |
| 530 | : AMDGPU::DS_WRITE2_B64; |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 531 | |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 532 | if (CI.UseST64) |
| 533 | Opc = (CI.EltSize == 4) ? AMDGPU::DS_WRITE2ST64_B32 |
| 534 | : AMDGPU::DS_WRITE2ST64_B64; |
Matt Arsenault | fe0a2e6 | 2014-10-10 22:12:32 +0000 | [diff] [blame] | 535 | |
Tom Stellard | e175d8a | 2016-08-26 21:36:47 +0000 | [diff] [blame] | 536 | if (NewOffset0 > NewOffset1) { |
| 537 | // Canonicalize the merged instruction so the smaller offset comes first. |
| 538 | std::swap(NewOffset0, NewOffset1); |
| 539 | std::swap(Data0, Data1); |
| 540 | } |
| 541 | |
Matt Arsenault | fe0a2e6 | 2014-10-10 22:12:32 +0000 | [diff] [blame] | 542 | assert((isUInt<8>(NewOffset0) && isUInt<8>(NewOffset1)) && |
| 543 | (NewOffset0 != NewOffset1) && |
| 544 | "Computed offset doesn't fit"); |
| 545 | |
| 546 | const MCInstrDesc &Write2Desc = TII->get(Opc); |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 547 | DebugLoc DL = CI.I->getDebugLoc(); |
Matt Arsenault | fe0a2e6 | 2014-10-10 22:12:32 +0000 | [diff] [blame] | 548 | |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 549 | unsigned BaseReg = Addr->getReg(); |
| 550 | unsigned BaseRegFlags = 0; |
| 551 | if (CI.BaseOff) { |
| 552 | BaseReg = MRI->createVirtualRegister(&AMDGPU::VGPR_32RegClass); |
| 553 | BaseRegFlags = RegState::Kill; |
Reid Kleckner | dbc9ba3 | 2017-04-13 20:32:58 +0000 | [diff] [blame] | 554 | BuildMI(*MBB, CI.Paired, DL, TII->get(AMDGPU::V_ADD_I32_e32), BaseReg) |
Stanislav Mekhanoshin | 86b0a54 | 2017-04-14 00:33:44 +0000 | [diff] [blame] | 555 | .addImm(CI.BaseOff) |
| 556 | .addReg(Addr->getReg()); |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 557 | } |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 558 | |
Stanislav Mekhanoshin | 86b0a54 | 2017-04-14 00:33:44 +0000 | [diff] [blame] | 559 | MachineInstrBuilder Write2 = |
| 560 | BuildMI(*MBB, CI.Paired, DL, Write2Desc) |
| 561 | .addReg(BaseReg, BaseRegFlags) // addr |
| 562 | .add(*Data0) // data0 |
| 563 | .add(*Data1) // data1 |
| 564 | .addImm(NewOffset0) // offset0 |
| 565 | .addImm(NewOffset1) // offset1 |
| 566 | .addImm(0) // gds |
| 567 | .setMemRefs(CI.I->mergeMemRefsWith(*CI.Paired)); |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 568 | |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 569 | moveInstsAfter(Write2, CI.InstsToMove); |
| 570 | |
| 571 | MachineBasicBlock::iterator Next = std::next(CI.I); |
| 572 | CI.I->eraseFromParent(); |
| 573 | CI.Paired->eraseFromParent(); |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 574 | |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 575 | DEBUG(dbgs() << "Inserted write2 inst: " << *Write2 << '\n'); |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 576 | return Next; |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 577 | } |
| 578 | |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 579 | MachineBasicBlock::iterator SILoadStoreOptimizer::mergeSBufferLoadImmPair( |
| 580 | CombineInfo &CI) { |
| 581 | MachineBasicBlock *MBB = CI.I->getParent(); |
| 582 | DebugLoc DL = CI.I->getDebugLoc(); |
| 583 | unsigned Opcode = CI.IsX2 ? AMDGPU::S_BUFFER_LOAD_DWORDX4_IMM : |
| 584 | AMDGPU::S_BUFFER_LOAD_DWORDX2_IMM; |
| 585 | |
| 586 | const TargetRegisterClass *SuperRC = |
| 587 | CI.IsX2 ? &AMDGPU::SReg_128RegClass : &AMDGPU::SReg_64_XEXECRegClass; |
| 588 | unsigned DestReg = MRI->createVirtualRegister(SuperRC); |
| 589 | unsigned MergedOffset = std::min(CI.Offset0, CI.Offset1); |
| 590 | |
| 591 | BuildMI(*MBB, CI.Paired, DL, TII->get(Opcode), DestReg) |
| 592 | .add(*TII->getNamedOperand(*CI.I, AMDGPU::OpName::sbase)) |
| 593 | .addImm(MergedOffset) // offset |
| 594 | .addImm(CI.GLC0) // glc |
| 595 | .setMemRefs(CI.I->mergeMemRefsWith(*CI.Paired)); |
| 596 | |
| 597 | unsigned SubRegIdx0 = CI.IsX2 ? AMDGPU::sub0_sub1 : AMDGPU::sub0; |
| 598 | unsigned SubRegIdx1 = CI.IsX2 ? AMDGPU::sub2_sub3 : AMDGPU::sub1; |
| 599 | |
| 600 | // Handle descending offsets |
| 601 | if (CI.Offset0 > CI.Offset1) |
| 602 | std::swap(SubRegIdx0, SubRegIdx1); |
| 603 | |
| 604 | // Copy to the old destination registers. |
| 605 | const MCInstrDesc &CopyDesc = TII->get(TargetOpcode::COPY); |
| 606 | const auto *Dest0 = TII->getNamedOperand(*CI.I, AMDGPU::OpName::sdst); |
| 607 | const auto *Dest1 = TII->getNamedOperand(*CI.Paired, AMDGPU::OpName::sdst); |
| 608 | |
| 609 | BuildMI(*MBB, CI.Paired, DL, CopyDesc) |
| 610 | .add(*Dest0) // Copy to same destination including flags and sub reg. |
| 611 | .addReg(DestReg, 0, SubRegIdx0); |
| 612 | MachineInstr *Copy1 = BuildMI(*MBB, CI.Paired, DL, CopyDesc) |
| 613 | .add(*Dest1) |
| 614 | .addReg(DestReg, RegState::Kill, SubRegIdx1); |
| 615 | |
| 616 | moveInstsAfter(Copy1, CI.InstsToMove); |
| 617 | |
| 618 | MachineBasicBlock::iterator Next = std::next(CI.I); |
| 619 | CI.I->eraseFromParent(); |
| 620 | CI.Paired->eraseFromParent(); |
| 621 | return Next; |
| 622 | } |
| 623 | |
Marek Olsak | 4c421a2d | 2017-11-09 01:52:36 +0000 | [diff] [blame] | 624 | MachineBasicBlock::iterator SILoadStoreOptimizer::mergeBufferLoadPair( |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 625 | CombineInfo &CI) { |
| 626 | MachineBasicBlock *MBB = CI.I->getParent(); |
| 627 | DebugLoc DL = CI.I->getDebugLoc(); |
Marek Olsak | 4c421a2d | 2017-11-09 01:52:36 +0000 | [diff] [blame] | 628 | unsigned Opcode; |
| 629 | |
| 630 | if (CI.InstClass == BUFFER_LOAD_OFFEN) { |
| 631 | Opcode = CI.IsX2 ? AMDGPU::BUFFER_LOAD_DWORDX4_OFFEN : |
| 632 | AMDGPU::BUFFER_LOAD_DWORDX2_OFFEN; |
| 633 | } else { |
| 634 | Opcode = CI.IsX2 ? AMDGPU::BUFFER_LOAD_DWORDX4_OFFSET : |
| 635 | AMDGPU::BUFFER_LOAD_DWORDX2_OFFSET; |
| 636 | } |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 637 | |
| 638 | const TargetRegisterClass *SuperRC = |
| 639 | CI.IsX2 ? &AMDGPU::VReg_128RegClass : &AMDGPU::VReg_64RegClass; |
| 640 | unsigned DestReg = MRI->createVirtualRegister(SuperRC); |
| 641 | unsigned MergedOffset = std::min(CI.Offset0, CI.Offset1); |
| 642 | |
Marek Olsak | 4c421a2d | 2017-11-09 01:52:36 +0000 | [diff] [blame] | 643 | auto MIB = BuildMI(*MBB, CI.Paired, DL, TII->get(Opcode), DestReg); |
| 644 | |
| 645 | if (CI.InstClass == BUFFER_LOAD_OFFEN) |
| 646 | MIB.add(*TII->getNamedOperand(*CI.I, AMDGPU::OpName::vaddr)); |
| 647 | |
| 648 | MIB.add(*TII->getNamedOperand(*CI.I, AMDGPU::OpName::srsrc)) |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 649 | .add(*TII->getNamedOperand(*CI.I, AMDGPU::OpName::soffset)) |
| 650 | .addImm(MergedOffset) // offset |
| 651 | .addImm(CI.GLC0) // glc |
| 652 | .addImm(CI.SLC0) // slc |
| 653 | .addImm(0) // tfe |
| 654 | .setMemRefs(CI.I->mergeMemRefsWith(*CI.Paired)); |
| 655 | |
| 656 | unsigned SubRegIdx0 = CI.IsX2 ? AMDGPU::sub0_sub1 : AMDGPU::sub0; |
| 657 | unsigned SubRegIdx1 = CI.IsX2 ? AMDGPU::sub2_sub3 : AMDGPU::sub1; |
| 658 | |
| 659 | // Handle descending offsets |
| 660 | if (CI.Offset0 > CI.Offset1) |
| 661 | std::swap(SubRegIdx0, SubRegIdx1); |
| 662 | |
| 663 | // Copy to the old destination registers. |
| 664 | const MCInstrDesc &CopyDesc = TII->get(TargetOpcode::COPY); |
| 665 | const auto *Dest0 = TII->getNamedOperand(*CI.I, AMDGPU::OpName::vdata); |
| 666 | const auto *Dest1 = TII->getNamedOperand(*CI.Paired, AMDGPU::OpName::vdata); |
| 667 | |
| 668 | BuildMI(*MBB, CI.Paired, DL, CopyDesc) |
| 669 | .add(*Dest0) // Copy to same destination including flags and sub reg. |
| 670 | .addReg(DestReg, 0, SubRegIdx0); |
| 671 | MachineInstr *Copy1 = BuildMI(*MBB, CI.Paired, DL, CopyDesc) |
| 672 | .add(*Dest1) |
| 673 | .addReg(DestReg, RegState::Kill, SubRegIdx1); |
| 674 | |
| 675 | moveInstsAfter(Copy1, CI.InstsToMove); |
| 676 | |
| 677 | MachineBasicBlock::iterator Next = std::next(CI.I); |
| 678 | CI.I->eraseFromParent(); |
| 679 | CI.Paired->eraseFromParent(); |
| 680 | return Next; |
| 681 | } |
| 682 | |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 683 | // Scan through looking for adjacent LDS operations with constant offsets from |
| 684 | // the same base register. We rely on the scheduler to do the hard work of |
| 685 | // clustering nearby loads, and assume these are all adjacent. |
| 686 | bool SILoadStoreOptimizer::optimizeBlock(MachineBasicBlock &MBB) { |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 687 | bool Modified = false; |
| 688 | |
| 689 | for (MachineBasicBlock::iterator I = MBB.begin(), E = MBB.end(); I != E;) { |
| 690 | MachineInstr &MI = *I; |
| 691 | |
| 692 | // Don't combine if volatile. |
| 693 | if (MI.hasOrderedMemoryRef()) { |
| 694 | ++I; |
| 695 | continue; |
| 696 | } |
| 697 | |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 698 | CombineInfo CI; |
| 699 | CI.I = I; |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 700 | unsigned Opc = MI.getOpcode(); |
| 701 | if (Opc == AMDGPU::DS_READ_B32 || Opc == AMDGPU::DS_READ_B64) { |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 702 | CI.InstClass = DS_READ_WRITE; |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 703 | CI.EltSize = (Opc == AMDGPU::DS_READ_B64) ? 8 : 4; |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 704 | if (findMatchingInst(CI)) { |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 705 | Modified = true; |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 706 | I = mergeRead2Pair(CI); |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 707 | } else { |
| 708 | ++I; |
| 709 | } |
| 710 | |
| 711 | continue; |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 712 | } |
| 713 | if (Opc == AMDGPU::DS_WRITE_B32 || Opc == AMDGPU::DS_WRITE_B64) { |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 714 | CI.InstClass = DS_READ_WRITE; |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 715 | CI.EltSize = (Opc == AMDGPU::DS_WRITE_B64) ? 8 : 4; |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 716 | if (findMatchingInst(CI)) { |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 717 | Modified = true; |
Stanislav Mekhanoshin | d026f79 | 2017-04-13 17:53:07 +0000 | [diff] [blame] | 718 | I = mergeWrite2Pair(CI); |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 719 | } else { |
| 720 | ++I; |
| 721 | } |
| 722 | |
| 723 | continue; |
| 724 | } |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 725 | if (STM->hasSBufferLoadStoreAtomicDwordxN() && |
| 726 | (Opc == AMDGPU::S_BUFFER_LOAD_DWORD_IMM || |
| 727 | Opc == AMDGPU::S_BUFFER_LOAD_DWORDX2_IMM)) { |
| 728 | // EltSize is in units of the offset encoding. |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 729 | CI.InstClass = S_BUFFER_LOAD_IMM; |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 730 | CI.EltSize = AMDGPU::getSMRDEncodedOffset(*STM, 4); |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 731 | CI.IsX2 = Opc == AMDGPU::S_BUFFER_LOAD_DWORDX2_IMM; |
| 732 | if (findMatchingInst(CI)) { |
| 733 | Modified = true; |
| 734 | I = mergeSBufferLoadImmPair(CI); |
| 735 | if (!CI.IsX2) |
| 736 | CreatedX2++; |
| 737 | } else { |
| 738 | ++I; |
| 739 | } |
| 740 | continue; |
| 741 | } |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 742 | if (Opc == AMDGPU::BUFFER_LOAD_DWORD_OFFEN || |
Marek Olsak | 4c421a2d | 2017-11-09 01:52:36 +0000 | [diff] [blame] | 743 | Opc == AMDGPU::BUFFER_LOAD_DWORDX2_OFFEN || |
| 744 | Opc == AMDGPU::BUFFER_LOAD_DWORD_OFFSET || |
| 745 | Opc == AMDGPU::BUFFER_LOAD_DWORDX2_OFFSET) { |
| 746 | if (Opc == AMDGPU::BUFFER_LOAD_DWORD_OFFEN || |
| 747 | Opc == AMDGPU::BUFFER_LOAD_DWORDX2_OFFEN) |
| 748 | CI.InstClass = BUFFER_LOAD_OFFEN; |
| 749 | else |
| 750 | CI.InstClass = BUFFER_LOAD_OFFSET; |
| 751 | |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 752 | CI.EltSize = 4; |
Marek Olsak | 4c421a2d | 2017-11-09 01:52:36 +0000 | [diff] [blame] | 753 | CI.IsX2 = Opc == AMDGPU::BUFFER_LOAD_DWORDX2_OFFEN || |
| 754 | Opc == AMDGPU::BUFFER_LOAD_DWORDX2_OFFSET; |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 755 | if (findMatchingInst(CI)) { |
| 756 | Modified = true; |
Marek Olsak | 4c421a2d | 2017-11-09 01:52:36 +0000 | [diff] [blame] | 757 | I = mergeBufferLoadPair(CI); |
Marek Olsak | 6a0548a | 2017-11-09 01:52:30 +0000 | [diff] [blame] | 758 | if (!CI.IsX2) |
| 759 | CreatedX2++; |
| 760 | } else { |
| 761 | ++I; |
| 762 | } |
| 763 | continue; |
| 764 | } |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 765 | |
| 766 | ++I; |
| 767 | } |
| 768 | |
| 769 | return Modified; |
| 770 | } |
| 771 | |
| 772 | bool SILoadStoreOptimizer::runOnMachineFunction(MachineFunction &MF) { |
Andrew Kaylor | 7de74af | 2016-04-25 22:23:44 +0000 | [diff] [blame] | 773 | if (skipFunction(*MF.getFunction())) |
| 774 | return false; |
| 775 | |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 776 | STM = &MF.getSubtarget<SISubtarget>(); |
| 777 | if (!STM->loadStoreOptEnabled()) |
Matt Arsenault | 03d8584 | 2016-06-27 20:32:13 +0000 | [diff] [blame] | 778 | return false; |
| 779 | |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 780 | TII = STM->getInstrInfo(); |
Matt Arsenault | 43e92fe | 2016-06-24 06:30:11 +0000 | [diff] [blame] | 781 | TRI = &TII->getRegisterInfo(); |
| 782 | |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 783 | MRI = &MF.getRegInfo(); |
Tom Stellard | c2ff0eb | 2016-08-29 19:15:22 +0000 | [diff] [blame] | 784 | AA = &getAnalysis<AAResultsWrapperPass>().getAAResults(); |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 785 | |
Matt Arsenault | 67e72de | 2017-08-31 01:53:09 +0000 | [diff] [blame] | 786 | assert(MRI->isSSA() && "Must be run on SSA"); |
| 787 | |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 788 | DEBUG(dbgs() << "Running SILoadStoreOptimizer\n"); |
| 789 | |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 790 | bool Modified = false; |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 791 | CreatedX2 = 0; |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 792 | |
| 793 | for (MachineBasicBlock &MBB : MF) |
| 794 | Modified |= optimizeBlock(MBB); |
| 795 | |
Marek Olsak | b953cc3 | 2017-11-09 01:52:23 +0000 | [diff] [blame] | 796 | // Run again to convert x2 to x4. |
| 797 | if (CreatedX2 >= 1) { |
| 798 | for (MachineBasicBlock &MBB : MF) |
| 799 | Modified |= optimizeBlock(MBB); |
| 800 | } |
| 801 | |
Matt Arsenault | 4103328 | 2014-10-10 22:01:59 +0000 | [diff] [blame] | 802 | return Modified; |
| 803 | } |