Hal Finkel | 089b8ec | 2015-02-01 21:51:22 +0000 | [diff] [blame] | 1 | //===--------------- PPCVSXFMAMutate.cpp - VSX FMA Mutation ---------------===// |
| 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 mutates the form of VSX FMA instructions to avoid unnecessary |
| 11 | // copies. |
| 12 | // |
| 13 | //===----------------------------------------------------------------------===// |
| 14 | |
| 15 | #include "PPCInstrInfo.h" |
| 16 | #include "MCTargetDesc/PPCPredicates.h" |
| 17 | #include "PPC.h" |
| 18 | #include "PPCInstrBuilder.h" |
| 19 | #include "PPCMachineFunctionInfo.h" |
| 20 | #include "PPCTargetMachine.h" |
| 21 | #include "llvm/ADT/STLExtras.h" |
| 22 | #include "llvm/ADT/Statistic.h" |
| 23 | #include "llvm/CodeGen/LiveIntervalAnalysis.h" |
| 24 | #include "llvm/CodeGen/MachineFrameInfo.h" |
| 25 | #include "llvm/CodeGen/MachineFunctionPass.h" |
| 26 | #include "llvm/CodeGen/MachineInstrBuilder.h" |
| 27 | #include "llvm/CodeGen/MachineMemOperand.h" |
| 28 | #include "llvm/CodeGen/MachineRegisterInfo.h" |
| 29 | #include "llvm/CodeGen/PseudoSourceValue.h" |
| 30 | #include "llvm/CodeGen/ScheduleDAG.h" |
| 31 | #include "llvm/CodeGen/SlotIndexes.h" |
Hal Finkel | 089b8ec | 2015-02-01 21:51:22 +0000 | [diff] [blame] | 32 | #include "llvm/MC/MCAsmInfo.h" |
| 33 | #include "llvm/Support/CommandLine.h" |
| 34 | #include "llvm/Support/Debug.h" |
| 35 | #include "llvm/Support/ErrorHandling.h" |
| 36 | #include "llvm/Support/TargetRegistry.h" |
| 37 | #include "llvm/Support/raw_ostream.h" |
| 38 | |
| 39 | using namespace llvm; |
| 40 | |
| 41 | static cl::opt<bool> DisableVSXFMAMutate("disable-ppc-vsx-fma-mutation", |
| 42 | cl::desc("Disable VSX FMA instruction mutation"), cl::Hidden); |
| 43 | |
| 44 | #define DEBUG_TYPE "ppc-vsx-fma-mutate" |
| 45 | |
| 46 | namespace llvm { namespace PPC { |
| 47 | int getAltVSXFMAOpcode(uint16_t Opcode); |
| 48 | } } |
| 49 | |
| 50 | namespace { |
| 51 | // PPCVSXFMAMutate pass - For copies between VSX registers and non-VSX registers |
| 52 | // (Altivec and scalar floating-point registers), we need to transform the |
| 53 | // copies into subregister copies with other restrictions. |
| 54 | struct PPCVSXFMAMutate : public MachineFunctionPass { |
| 55 | static char ID; |
| 56 | PPCVSXFMAMutate() : MachineFunctionPass(ID) { |
| 57 | initializePPCVSXFMAMutatePass(*PassRegistry::getPassRegistry()); |
| 58 | } |
| 59 | |
| 60 | LiveIntervals *LIS; |
| 61 | const PPCInstrInfo *TII; |
| 62 | |
| 63 | protected: |
| 64 | bool processBlock(MachineBasicBlock &MBB) { |
| 65 | bool Changed = false; |
| 66 | |
| 67 | MachineRegisterInfo &MRI = MBB.getParent()->getRegInfo(); |
| 68 | const TargetRegisterInfo *TRI = &TII->getRegisterInfo(); |
| 69 | for (MachineBasicBlock::iterator I = MBB.begin(), IE = MBB.end(); |
| 70 | I != IE; ++I) { |
| 71 | MachineInstr *MI = I; |
| 72 | |
| 73 | // The default (A-type) VSX FMA form kills the addend (it is taken from |
| 74 | // the target register, which is then updated to reflect the result of |
| 75 | // the FMA). If the instruction, however, kills one of the registers |
| 76 | // used for the product, then we can use the M-form instruction (which |
| 77 | // will take that value from the to-be-defined register). |
| 78 | |
| 79 | int AltOpc = PPC::getAltVSXFMAOpcode(MI->getOpcode()); |
| 80 | if (AltOpc == -1) |
| 81 | continue; |
| 82 | |
| 83 | // This pass is run after register coalescing, and so we're looking for |
| 84 | // a situation like this: |
| 85 | // ... |
| 86 | // %vreg5<def> = COPY %vreg9; VSLRC:%vreg5,%vreg9 |
| 87 | // %vreg5<def,tied1> = XSMADDADP %vreg5<tied0>, %vreg17, %vreg16, |
| 88 | // %RM<imp-use>; VSLRC:%vreg5,%vreg17,%vreg16 |
| 89 | // ... |
| 90 | // %vreg9<def,tied1> = XSMADDADP %vreg9<tied0>, %vreg17, %vreg19, |
| 91 | // %RM<imp-use>; VSLRC:%vreg9,%vreg17,%vreg19 |
| 92 | // ... |
| 93 | // Where we can eliminate the copy by changing from the A-type to the |
| 94 | // M-type instruction. Specifically, for this example, this means: |
| 95 | // %vreg5<def,tied1> = XSMADDADP %vreg5<tied0>, %vreg17, %vreg16, |
| 96 | // %RM<imp-use>; VSLRC:%vreg5,%vreg17,%vreg16 |
| 97 | // is replaced by: |
| 98 | // %vreg16<def,tied1> = XSMADDMDP %vreg16<tied0>, %vreg18, %vreg9, |
| 99 | // %RM<imp-use>; VSLRC:%vreg16,%vreg18,%vreg9 |
| 100 | // and we remove: %vreg5<def> = COPY %vreg9; VSLRC:%vreg5,%vreg9 |
| 101 | |
| 102 | SlotIndex FMAIdx = LIS->getInstructionIndex(MI); |
| 103 | |
| 104 | VNInfo *AddendValNo = |
| 105 | LIS->getInterval(MI->getOperand(1).getReg()).Query(FMAIdx).valueIn(); |
Hal Finkel | 7ffe55a | 2015-08-26 23:41:53 +0000 | [diff] [blame^] | 106 | |
| 107 | // This can be null if the register is undef. |
| 108 | if (!AddendValNo) |
Hal Finkel | ff9639d | 2015-08-21 21:34:24 +0000 | [diff] [blame] | 109 | continue; |
Hal Finkel | ff9639d | 2015-08-21 21:34:24 +0000 | [diff] [blame] | 110 | |
Hal Finkel | 089b8ec | 2015-02-01 21:51:22 +0000 | [diff] [blame] | 111 | MachineInstr *AddendMI = LIS->getInstructionFromIndex(AddendValNo->def); |
| 112 | |
| 113 | // The addend and this instruction must be in the same block. |
| 114 | |
| 115 | if (!AddendMI || AddendMI->getParent() != MI->getParent()) |
| 116 | continue; |
| 117 | |
| 118 | // The addend must be a full copy within the same register class. |
| 119 | |
| 120 | if (!AddendMI->isFullCopy()) |
| 121 | continue; |
| 122 | |
| 123 | unsigned AddendSrcReg = AddendMI->getOperand(1).getReg(); |
| 124 | if (TargetRegisterInfo::isVirtualRegister(AddendSrcReg)) { |
| 125 | if (MRI.getRegClass(AddendMI->getOperand(0).getReg()) != |
| 126 | MRI.getRegClass(AddendSrcReg)) |
| 127 | continue; |
| 128 | } else { |
| 129 | // If AddendSrcReg is a physical register, make sure the destination |
| 130 | // register class contains it. |
| 131 | if (!MRI.getRegClass(AddendMI->getOperand(0).getReg()) |
| 132 | ->contains(AddendSrcReg)) |
| 133 | continue; |
| 134 | } |
| 135 | |
| 136 | // In theory, there could be other uses of the addend copy before this |
| 137 | // fma. We could deal with this, but that would require additional |
| 138 | // logic below and I suspect it will not occur in any relevant |
| 139 | // situations. Additionally, check whether the copy source is killed |
| 140 | // prior to the fma. In order to replace the addend here with the |
| 141 | // source of the copy, it must still be live here. We can't use |
| 142 | // interval testing for a physical register, so as long as we're |
| 143 | // walking the MIs we may as well test liveness here. |
Hal Finkel | 8acae52 | 2015-07-14 20:02:02 +0000 | [diff] [blame] | 144 | // |
| 145 | // FIXME: There is a case that occurs in practice, like this: |
| 146 | // %vreg9<def> = COPY %F1; VSSRC:%vreg9 |
| 147 | // ... |
| 148 | // %vreg6<def> = COPY %vreg9; VSSRC:%vreg6,%vreg9 |
| 149 | // %vreg7<def> = COPY %vreg9; VSSRC:%vreg7,%vreg9 |
| 150 | // %vreg9<def,tied1> = XSMADDASP %vreg9<tied0>, %vreg1, %vreg4; VSSRC: |
| 151 | // %vreg6<def,tied1> = XSMADDASP %vreg6<tied0>, %vreg1, %vreg2; VSSRC: |
| 152 | // %vreg7<def,tied1> = XSMADDASP %vreg7<tied0>, %vreg1, %vreg3; VSSRC: |
| 153 | // which prevents an otherwise-profitable transformation. |
Hal Finkel | 089b8ec | 2015-02-01 21:51:22 +0000 | [diff] [blame] | 154 | bool OtherUsers = false, KillsAddendSrc = false; |
| 155 | for (auto J = std::prev(I), JE = MachineBasicBlock::iterator(AddendMI); |
| 156 | J != JE; --J) { |
| 157 | if (J->readsVirtualRegister(AddendMI->getOperand(0).getReg())) { |
| 158 | OtherUsers = true; |
| 159 | break; |
| 160 | } |
| 161 | if (J->modifiesRegister(AddendSrcReg, TRI) || |
| 162 | J->killsRegister(AddendSrcReg, TRI)) { |
| 163 | KillsAddendSrc = true; |
| 164 | break; |
| 165 | } |
| 166 | } |
| 167 | |
| 168 | if (OtherUsers || KillsAddendSrc) |
| 169 | continue; |
| 170 | |
| 171 | // Find one of the product operands that is killed by this instruction. |
| 172 | |
| 173 | unsigned KilledProdOp = 0, OtherProdOp = 0; |
| 174 | if (LIS->getInterval(MI->getOperand(2).getReg()) |
| 175 | .Query(FMAIdx).isKill()) { |
| 176 | KilledProdOp = 2; |
| 177 | OtherProdOp = 3; |
| 178 | } else if (LIS->getInterval(MI->getOperand(3).getReg()) |
| 179 | .Query(FMAIdx).isKill()) { |
| 180 | KilledProdOp = 3; |
| 181 | OtherProdOp = 2; |
| 182 | } |
| 183 | |
| 184 | // If there are no killed product operands, then this transformation is |
| 185 | // likely not profitable. |
| 186 | if (!KilledProdOp) |
| 187 | continue; |
| 188 | |
Hal Finkel | 0f2ddcb | 2015-08-24 23:48:28 +0000 | [diff] [blame] | 189 | // If the addend copy is used only by this MI, then the addend source |
| 190 | // register is likely not live here. This could be fixed (based on the |
| 191 | // legality checks above, the live range for the addend source register |
| 192 | // could be extended), but it seems likely that such a trivial copy can |
| 193 | // be coalesced away later, and thus is not worth the effort. |
| 194 | if (TargetRegisterInfo::isVirtualRegister(AddendSrcReg) && |
| 195 | !LIS->getInterval(AddendSrcReg).liveAt(FMAIdx)) |
| 196 | continue; |
Hal Finkel | 089b8ec | 2015-02-01 21:51:22 +0000 | [diff] [blame] | 197 | |
| 198 | // Transform: (O2 * O3) + O1 -> (O2 * O1) + O3. |
| 199 | |
Hal Finkel | 089b8ec | 2015-02-01 21:51:22 +0000 | [diff] [blame] | 200 | unsigned KilledProdReg = MI->getOperand(KilledProdOp).getReg(); |
| 201 | unsigned OtherProdReg = MI->getOperand(OtherProdOp).getReg(); |
| 202 | |
| 203 | unsigned AddSubReg = AddendMI->getOperand(1).getSubReg(); |
| 204 | unsigned KilledProdSubReg = MI->getOperand(KilledProdOp).getSubReg(); |
| 205 | unsigned OtherProdSubReg = MI->getOperand(OtherProdOp).getSubReg(); |
| 206 | |
| 207 | bool AddRegKill = AddendMI->getOperand(1).isKill(); |
| 208 | bool KilledProdRegKill = MI->getOperand(KilledProdOp).isKill(); |
| 209 | bool OtherProdRegKill = MI->getOperand(OtherProdOp).isKill(); |
| 210 | |
| 211 | bool AddRegUndef = AddendMI->getOperand(1).isUndef(); |
| 212 | bool KilledProdRegUndef = MI->getOperand(KilledProdOp).isUndef(); |
| 213 | bool OtherProdRegUndef = MI->getOperand(OtherProdOp).isUndef(); |
| 214 | |
| 215 | unsigned OldFMAReg = MI->getOperand(0).getReg(); |
| 216 | |
| 217 | // The transformation doesn't work well with things like: |
| 218 | // %vreg5 = A-form-op %vreg5, %vreg11, %vreg5; |
| 219 | // so leave such things alone. |
| 220 | if (OldFMAReg == KilledProdReg) |
| 221 | continue; |
| 222 | |
| 223 | assert(OldFMAReg == AddendMI->getOperand(0).getReg() && |
| 224 | "Addend copy not tied to old FMA output!"); |
| 225 | |
| 226 | DEBUG(dbgs() << "VSX FMA Mutation:\n " << *MI;); |
| 227 | |
| 228 | MI->getOperand(0).setReg(KilledProdReg); |
| 229 | MI->getOperand(1).setReg(KilledProdReg); |
Hal Finkel | 673b493 | 2015-07-15 08:23:03 +0000 | [diff] [blame] | 230 | MI->getOperand(3).setReg(AddendSrcReg); |
Hal Finkel | 089b8ec | 2015-02-01 21:51:22 +0000 | [diff] [blame] | 231 | MI->getOperand(2).setReg(OtherProdReg); |
| 232 | |
| 233 | MI->getOperand(0).setSubReg(KilledProdSubReg); |
| 234 | MI->getOperand(1).setSubReg(KilledProdSubReg); |
| 235 | MI->getOperand(3).setSubReg(AddSubReg); |
| 236 | MI->getOperand(2).setSubReg(OtherProdSubReg); |
| 237 | |
| 238 | MI->getOperand(1).setIsKill(KilledProdRegKill); |
| 239 | MI->getOperand(3).setIsKill(AddRegKill); |
| 240 | MI->getOperand(2).setIsKill(OtherProdRegKill); |
| 241 | |
| 242 | MI->getOperand(1).setIsUndef(KilledProdRegUndef); |
| 243 | MI->getOperand(3).setIsUndef(AddRegUndef); |
| 244 | MI->getOperand(2).setIsUndef(OtherProdRegUndef); |
| 245 | |
| 246 | MI->setDesc(TII->get(AltOpc)); |
| 247 | |
| 248 | DEBUG(dbgs() << " -> " << *MI); |
| 249 | |
| 250 | // The killed product operand was killed here, so we can reuse it now |
| 251 | // for the result of the fma. |
| 252 | |
| 253 | LiveInterval &FMAInt = LIS->getInterval(OldFMAReg); |
| 254 | VNInfo *FMAValNo = FMAInt.getVNInfoAt(FMAIdx.getRegSlot()); |
| 255 | for (auto UI = MRI.reg_nodbg_begin(OldFMAReg), UE = MRI.reg_nodbg_end(); |
| 256 | UI != UE;) { |
| 257 | MachineOperand &UseMO = *UI; |
| 258 | MachineInstr *UseMI = UseMO.getParent(); |
| 259 | ++UI; |
| 260 | |
| 261 | // Don't replace the result register of the copy we're about to erase. |
| 262 | if (UseMI == AddendMI) |
| 263 | continue; |
| 264 | |
| 265 | UseMO.setReg(KilledProdReg); |
| 266 | UseMO.setSubReg(KilledProdSubReg); |
| 267 | } |
| 268 | |
| 269 | // Extend the live intervals of the killed product operand to hold the |
| 270 | // fma result. |
| 271 | |
| 272 | LiveInterval &NewFMAInt = LIS->getInterval(KilledProdReg); |
| 273 | for (LiveInterval::iterator AI = FMAInt.begin(), AE = FMAInt.end(); |
| 274 | AI != AE; ++AI) { |
| 275 | // Don't add the segment that corresponds to the original copy. |
| 276 | if (AI->valno == AddendValNo) |
| 277 | continue; |
| 278 | |
| 279 | VNInfo *NewFMAValNo = |
| 280 | NewFMAInt.getNextValue(AI->start, |
| 281 | LIS->getVNInfoAllocator()); |
| 282 | |
| 283 | NewFMAInt.addSegment(LiveInterval::Segment(AI->start, AI->end, |
| 284 | NewFMAValNo)); |
| 285 | } |
| 286 | DEBUG(dbgs() << " extended: " << NewFMAInt << '\n'); |
| 287 | |
Hal Finkel | 673b493 | 2015-07-15 08:23:03 +0000 | [diff] [blame] | 288 | // Extend the live interval of the addend source (it might end at the |
| 289 | // copy to be removed, or somewhere in between there and here). This |
| 290 | // is necessary only if it is a physical register. |
| 291 | if (!TargetRegisterInfo::isVirtualRegister(AddendSrcReg)) |
| 292 | for (MCRegUnitIterator Units(AddendSrcReg, TRI); Units.isValid(); |
| 293 | ++Units) { |
| 294 | unsigned Unit = *Units; |
| 295 | |
| 296 | LiveRange &AddendSrcRange = LIS->getRegUnit(Unit); |
| 297 | AddendSrcRange.extendInBlock(LIS->getMBBStartIdx(&MBB), |
| 298 | FMAIdx.getRegSlot()); |
| 299 | DEBUG(dbgs() << " extended: " << AddendSrcRange << '\n'); |
| 300 | } |
| 301 | |
Hal Finkel | 089b8ec | 2015-02-01 21:51:22 +0000 | [diff] [blame] | 302 | FMAInt.removeValNo(FMAValNo); |
| 303 | DEBUG(dbgs() << " trimmed: " << FMAInt << '\n'); |
| 304 | |
| 305 | // Remove the (now unused) copy. |
| 306 | |
| 307 | DEBUG(dbgs() << " removing: " << *AddendMI << '\n'); |
| 308 | LIS->RemoveMachineInstrFromMaps(AddendMI); |
| 309 | AddendMI->eraseFromParent(); |
| 310 | |
| 311 | Changed = true; |
| 312 | } |
| 313 | |
| 314 | return Changed; |
| 315 | } |
| 316 | |
| 317 | public: |
| 318 | bool runOnMachineFunction(MachineFunction &MF) override { |
| 319 | // If we don't have VSX then go ahead and return without doing |
| 320 | // anything. |
| 321 | const PPCSubtarget &STI = MF.getSubtarget<PPCSubtarget>(); |
| 322 | if (!STI.hasVSX()) |
| 323 | return false; |
| 324 | |
| 325 | LIS = &getAnalysis<LiveIntervals>(); |
| 326 | |
| 327 | TII = STI.getInstrInfo(); |
| 328 | |
| 329 | bool Changed = false; |
| 330 | |
| 331 | if (DisableVSXFMAMutate) |
| 332 | return Changed; |
| 333 | |
| 334 | for (MachineFunction::iterator I = MF.begin(); I != MF.end();) { |
| 335 | MachineBasicBlock &B = *I++; |
| 336 | if (processBlock(B)) |
| 337 | Changed = true; |
| 338 | } |
| 339 | |
| 340 | return Changed; |
| 341 | } |
| 342 | |
| 343 | void getAnalysisUsage(AnalysisUsage &AU) const override { |
| 344 | AU.addRequired<LiveIntervals>(); |
| 345 | AU.addPreserved<LiveIntervals>(); |
| 346 | AU.addRequired<SlotIndexes>(); |
| 347 | AU.addPreserved<SlotIndexes>(); |
| 348 | MachineFunctionPass::getAnalysisUsage(AU); |
| 349 | } |
| 350 | }; |
Alexander Kornienko | f00654e | 2015-06-23 09:49:53 +0000 | [diff] [blame] | 351 | } |
Hal Finkel | 089b8ec | 2015-02-01 21:51:22 +0000 | [diff] [blame] | 352 | |
| 353 | INITIALIZE_PASS_BEGIN(PPCVSXFMAMutate, DEBUG_TYPE, |
| 354 | "PowerPC VSX FMA Mutation", false, false) |
| 355 | INITIALIZE_PASS_DEPENDENCY(LiveIntervals) |
| 356 | INITIALIZE_PASS_DEPENDENCY(SlotIndexes) |
| 357 | INITIALIZE_PASS_END(PPCVSXFMAMutate, DEBUG_TYPE, |
| 358 | "PowerPC VSX FMA Mutation", false, false) |
| 359 | |
| 360 | char &llvm::PPCVSXFMAMutateID = PPCVSXFMAMutate::ID; |
| 361 | |
| 362 | char PPCVSXFMAMutate::ID = 0; |
| 363 | FunctionPass* |
| 364 | llvm::createPPCVSXFMAMutatePass() { return new PPCVSXFMAMutate(); } |
| 365 | |
| 366 | |