Tim Northover | 69fa84a | 2016-10-14 22:18:18 +0000 | [diff] [blame] | 1 | //===-- llvm/CodeGen/GlobalISel/Legalizer.cpp -----------------------------===// |
Tim Northover | 33b07d6 | 2016-07-22 20:03:43 +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 | // |
Tim Northover | 69fa84a | 2016-10-14 22:18:18 +0000 | [diff] [blame] | 10 | /// \file This file implements the LegalizerHelper class to legalize individual |
| 11 | /// instructions and the LegalizePass wrapper pass for the primary |
Tim Northover | 33b07d6 | 2016-07-22 20:03:43 +0000 | [diff] [blame] | 12 | /// legalization. |
| 13 | // |
| 14 | //===----------------------------------------------------------------------===// |
| 15 | |
Tim Northover | 69fa84a | 2016-10-14 22:18:18 +0000 | [diff] [blame] | 16 | #include "llvm/CodeGen/GlobalISel/Legalizer.h" |
Aditya Nandakumar | c6615f5 | 2017-08-30 19:32:59 +0000 | [diff] [blame^] | 17 | #include "llvm/ADT/SetVector.h" |
| 18 | #include "llvm/CodeGen/GlobalISel/LegalizerCombiner.h" |
Tim Northover | 69fa84a | 2016-10-14 22:18:18 +0000 | [diff] [blame] | 19 | #include "llvm/CodeGen/GlobalISel/LegalizerHelper.h" |
Ahmed Bougacha | ae9dade | 2017-02-23 21:05:42 +0000 | [diff] [blame] | 20 | #include "llvm/CodeGen/GlobalISel/Utils.h" |
| 21 | #include "llvm/CodeGen/MachineOptimizationRemarkEmitter.h" |
Quentin Colombet | 5e60bcd | 2016-08-27 02:38:21 +0000 | [diff] [blame] | 22 | #include "llvm/CodeGen/MachineRegisterInfo.h" |
| 23 | #include "llvm/CodeGen/TargetPassConfig.h" |
Tim Northover | 33b07d6 | 2016-07-22 20:03:43 +0000 | [diff] [blame] | 24 | #include "llvm/Support/Debug.h" |
Tim Northover | 991b12b | 2016-08-30 20:51:25 +0000 | [diff] [blame] | 25 | #include "llvm/Target/TargetInstrInfo.h" |
Tim Northover | 33b07d6 | 2016-07-22 20:03:43 +0000 | [diff] [blame] | 26 | #include "llvm/Target/TargetSubtargetInfo.h" |
| 27 | |
Daniel Sanders | 5377fb3 | 2017-04-20 15:46:12 +0000 | [diff] [blame] | 28 | #include <iterator> |
| 29 | |
Tim Northover | 69fa84a | 2016-10-14 22:18:18 +0000 | [diff] [blame] | 30 | #define DEBUG_TYPE "legalizer" |
Tim Northover | 33b07d6 | 2016-07-22 20:03:43 +0000 | [diff] [blame] | 31 | |
| 32 | using namespace llvm; |
| 33 | |
Tim Northover | 69fa84a | 2016-10-14 22:18:18 +0000 | [diff] [blame] | 34 | char Legalizer::ID = 0; |
| 35 | INITIALIZE_PASS_BEGIN(Legalizer, DEBUG_TYPE, |
Quentin Colombet | 5e60bcd | 2016-08-27 02:38:21 +0000 | [diff] [blame] | 36 | "Legalize the Machine IR a function's Machine IR", false, |
| 37 | false) |
| 38 | INITIALIZE_PASS_DEPENDENCY(TargetPassConfig) |
Tim Northover | 69fa84a | 2016-10-14 22:18:18 +0000 | [diff] [blame] | 39 | INITIALIZE_PASS_END(Legalizer, DEBUG_TYPE, |
Quentin Colombet | 5e60bcd | 2016-08-27 02:38:21 +0000 | [diff] [blame] | 40 | "Legalize the Machine IR a function's Machine IR", false, |
| 41 | false) |
Tim Northover | 33b07d6 | 2016-07-22 20:03:43 +0000 | [diff] [blame] | 42 | |
Tim Northover | 69fa84a | 2016-10-14 22:18:18 +0000 | [diff] [blame] | 43 | Legalizer::Legalizer() : MachineFunctionPass(ID) { |
| 44 | initializeLegalizerPass(*PassRegistry::getPassRegistry()); |
Tim Northover | 33b07d6 | 2016-07-22 20:03:43 +0000 | [diff] [blame] | 45 | } |
| 46 | |
Tim Northover | 69fa84a | 2016-10-14 22:18:18 +0000 | [diff] [blame] | 47 | void Legalizer::getAnalysisUsage(AnalysisUsage &AU) const { |
Quentin Colombet | 5e60bcd | 2016-08-27 02:38:21 +0000 | [diff] [blame] | 48 | AU.addRequired<TargetPassConfig>(); |
| 49 | MachineFunctionPass::getAnalysisUsage(AU); |
| 50 | } |
| 51 | |
Tim Northover | 69fa84a | 2016-10-14 22:18:18 +0000 | [diff] [blame] | 52 | void Legalizer::init(MachineFunction &MF) { |
Tim Northover | 33b07d6 | 2016-07-22 20:03:43 +0000 | [diff] [blame] | 53 | } |
| 54 | |
Tim Northover | 69fa84a | 2016-10-14 22:18:18 +0000 | [diff] [blame] | 55 | bool Legalizer::runOnMachineFunction(MachineFunction &MF) { |
Quentin Colombet | 6049524 | 2016-08-27 00:18:24 +0000 | [diff] [blame] | 56 | // If the ISel pipeline failed, do not bother running that pass. |
| 57 | if (MF.getProperties().hasProperty( |
| 58 | MachineFunctionProperties::Property::FailedISel)) |
| 59 | return false; |
Tim Northover | 33b07d6 | 2016-07-22 20:03:43 +0000 | [diff] [blame] | 60 | DEBUG(dbgs() << "Legalize Machine IR for: " << MF.getName() << '\n'); |
| 61 | init(MF); |
Quentin Colombet | 5e60bcd | 2016-08-27 02:38:21 +0000 | [diff] [blame] | 62 | const TargetPassConfig &TPC = getAnalysis<TargetPassConfig>(); |
Ahmed Bougacha | ae9dade | 2017-02-23 21:05:42 +0000 | [diff] [blame] | 63 | MachineOptimizationRemarkEmitter MORE(MF, /*MBFI=*/nullptr); |
Tim Northover | 69fa84a | 2016-10-14 22:18:18 +0000 | [diff] [blame] | 64 | LegalizerHelper Helper(MF); |
Tim Northover | 33b07d6 | 2016-07-22 20:03:43 +0000 | [diff] [blame] | 65 | |
| 66 | // FIXME: an instruction may need more than one pass before it is legal. For |
| 67 | // example on most architectures <3 x i3> is doubly-illegal. It would |
| 68 | // typically proceed along a path like: <3 x i3> -> <3 x i8> -> <8 x i8>. We |
| 69 | // probably want a worklist of instructions rather than naive iterate until |
| 70 | // convergence for performance reasons. |
| 71 | bool Changed = false; |
| 72 | MachineBasicBlock::iterator NextMI; |
Daniel Sanders | 5377fb3 | 2017-04-20 15:46:12 +0000 | [diff] [blame] | 73 | for (auto &MBB : MF) { |
Tim Northover | 33b07d6 | 2016-07-22 20:03:43 +0000 | [diff] [blame] | 74 | for (auto MI = MBB.begin(); MI != MBB.end(); MI = NextMI) { |
| 75 | // Get the next Instruction before we try to legalize, because there's a |
| 76 | // good chance MI will be deleted. |
| 77 | NextMI = std::next(MI); |
Ahmed Bougacha | faf8e9f | 2016-08-02 11:41:09 +0000 | [diff] [blame] | 78 | |
| 79 | // Only legalize pre-isel generic instructions: others don't have types |
| 80 | // and are assumed to be legal. |
| 81 | if (!isPreISelGenericOpcode(MI->getOpcode())) |
| 82 | continue; |
Daniel Sanders | 5377fb3 | 2017-04-20 15:46:12 +0000 | [diff] [blame] | 83 | unsigned NumNewInsns = 0; |
Aditya Nandakumar | c6615f5 | 2017-08-30 19:32:59 +0000 | [diff] [blame^] | 84 | using VecType = SetVector<MachineInstr *, SmallVector<MachineInstr *, 8>>; |
| 85 | VecType WorkList; |
| 86 | VecType CombineList; |
Daniel Sanders | 5377fb3 | 2017-04-20 15:46:12 +0000 | [diff] [blame] | 87 | Helper.MIRBuilder.recordInsertions([&](MachineInstr *MI) { |
Aditya Nandakumar | 21d8d31 | 2017-05-04 22:00:42 +0000 | [diff] [blame] | 88 | // Only legalize pre-isel generic instructions. |
| 89 | // Legalization process could generate Target specific pseudo |
| 90 | // instructions with generic types. Don't record them |
| 91 | if (isPreISelGenericOpcode(MI->getOpcode())) { |
| 92 | ++NumNewInsns; |
Aditya Nandakumar | c6615f5 | 2017-08-30 19:32:59 +0000 | [diff] [blame^] | 93 | WorkList.insert(MI); |
| 94 | CombineList.insert(MI); |
Aditya Nandakumar | 21d8d31 | 2017-05-04 22:00:42 +0000 | [diff] [blame] | 95 | } |
Daniel Sanders | 5377fb3 | 2017-04-20 15:46:12 +0000 | [diff] [blame] | 96 | }); |
Aditya Nandakumar | c6615f5 | 2017-08-30 19:32:59 +0000 | [diff] [blame^] | 97 | WorkList.insert(&*MI); |
| 98 | LegalizerCombiner C(Helper.MIRBuilder, MF.getRegInfo()); |
Daniel Sanders | 5377fb3 | 2017-04-20 15:46:12 +0000 | [diff] [blame] | 99 | bool Changed = false; |
Aditya Nandakumar | eb80a51 | 2017-04-07 21:49:30 +0000 | [diff] [blame] | 100 | LegalizerHelper::LegalizeResult Res; |
Aditya Nandakumar | eb80a51 | 2017-04-07 21:49:30 +0000 | [diff] [blame] | 101 | do { |
Aditya Nandakumar | c6615f5 | 2017-08-30 19:32:59 +0000 | [diff] [blame^] | 102 | assert(!WorkList.empty() && "Expecting illegal ops"); |
| 103 | while (!WorkList.empty()) { |
| 104 | NumNewInsns = 0; |
| 105 | MachineInstr *CurrInst = WorkList.pop_back_val(); |
| 106 | Res = Helper.legalizeInstrStep(*CurrInst); |
| 107 | // Error out if we couldn't legalize this instruction. We may want to |
| 108 | // fall back to DAG ISel instead in the future. |
Aditya Nandakumar | eb80a51 | 2017-04-07 21:49:30 +0000 | [diff] [blame] | 109 | if (Res == LegalizerHelper::UnableToLegalize) { |
Aditya Nandakumar | c6615f5 | 2017-08-30 19:32:59 +0000 | [diff] [blame^] | 110 | Helper.MIRBuilder.stopRecordingInsertions(); |
| 111 | if (Res == LegalizerHelper::UnableToLegalize) { |
| 112 | reportGISelFailure(MF, TPC, MORE, "gisel-legalize", |
| 113 | "unable to legalize instruction", *CurrInst); |
| 114 | return false; |
| 115 | } |
Aditya Nandakumar | eb80a51 | 2017-04-07 21:49:30 +0000 | [diff] [blame] | 116 | } |
Aditya Nandakumar | c6615f5 | 2017-08-30 19:32:59 +0000 | [diff] [blame^] | 117 | Changed |= Res == LegalizerHelper::Legalized; |
| 118 | // If CurrInst was legalized, there's a good chance that it might have |
| 119 | // been erased. So remove it from the Combine List. |
| 120 | if (Res == LegalizerHelper::Legalized) |
| 121 | CombineList.remove(CurrInst); |
Daniel Sanders | 5377fb3 | 2017-04-20 15:46:12 +0000 | [diff] [blame] | 122 | |
| 123 | #ifndef NDEBUG |
Aditya Nandakumar | c6615f5 | 2017-08-30 19:32:59 +0000 | [diff] [blame^] | 124 | if (NumNewInsns) |
| 125 | for (unsigned I = WorkList.size() - NumNewInsns, |
| 126 | E = WorkList.size(); |
| 127 | I != E; ++I) |
| 128 | DEBUG(dbgs() << ".. .. New MI: " << *WorkList[I];); |
Daniel Sanders | 5377fb3 | 2017-04-20 15:46:12 +0000 | [diff] [blame] | 129 | #endif |
Aditya Nandakumar | c6615f5 | 2017-08-30 19:32:59 +0000 | [diff] [blame^] | 130 | } |
| 131 | // Do the combines. |
| 132 | while (!CombineList.empty()) { |
| 133 | NumNewInsns = 0; |
| 134 | MachineInstr *CurrInst = CombineList.pop_back_val(); |
| 135 | SmallVector<MachineInstr *, 4> DeadInstructions; |
| 136 | Changed |= C.tryCombineInstruction(*CurrInst, DeadInstructions); |
| 137 | for (auto *DeadMI : DeadInstructions) { |
| 138 | DEBUG(dbgs() << ".. Erasing Dead Instruction " << *DeadMI); |
| 139 | CombineList.remove(DeadMI); |
| 140 | WorkList.remove(DeadMI); |
| 141 | DeadMI->eraseFromParent(); |
| 142 | } |
| 143 | #ifndef NDEBUG |
| 144 | if (NumNewInsns) |
| 145 | for (unsigned I = CombineList.size() - NumNewInsns, |
| 146 | E = CombineList.size(); |
| 147 | I != E; ++I) |
| 148 | DEBUG(dbgs() << ".. .. Combine New MI: " << *CombineList[I];); |
| 149 | #endif |
| 150 | } |
| 151 | } while (!WorkList.empty()); |
Tim Northover | 33b07d6 | 2016-07-22 20:03:43 +0000 | [diff] [blame] | 152 | |
Aditya Nandakumar | eb80a51 | 2017-04-07 21:49:30 +0000 | [diff] [blame] | 153 | Helper.MIRBuilder.stopRecordingInsertions(); |
Tim Northover | 33b07d6 | 2016-07-22 20:03:43 +0000 | [diff] [blame] | 154 | } |
Daniel Sanders | 5377fb3 | 2017-04-20 15:46:12 +0000 | [diff] [blame] | 155 | } |
Tim Northover | 991b12b | 2016-08-30 20:51:25 +0000 | [diff] [blame] | 156 | |
Tim Northover | 991b12b | 2016-08-30 20:51:25 +0000 | [diff] [blame] | 157 | MachineRegisterInfo &MRI = MF.getRegInfo(); |
Aditya Nandakumar | c6615f5 | 2017-08-30 19:32:59 +0000 | [diff] [blame^] | 158 | MachineIRBuilder MIRBuilder(MF); |
| 159 | LegalizerCombiner C(MIRBuilder, MRI); |
Tim Northover | 991b12b | 2016-08-30 20:51:25 +0000 | [diff] [blame] | 160 | for (auto &MBB : MF) { |
| 161 | for (auto MI = MBB.begin(); MI != MBB.end(); MI = NextMI) { |
| 162 | // Get the next Instruction before we try to legalize, because there's a |
| 163 | // good chance MI will be deleted. |
Aditya Nandakumar | c6615f5 | 2017-08-30 19:32:59 +0000 | [diff] [blame^] | 164 | // TOOD: Perhaps move this to a combiner pass later?. |
Tim Northover | 991b12b | 2016-08-30 20:51:25 +0000 | [diff] [blame] | 165 | NextMI = std::next(MI); |
Aditya Nandakumar | c6615f5 | 2017-08-30 19:32:59 +0000 | [diff] [blame^] | 166 | SmallVector<MachineInstr *, 4> DeadInsts; |
| 167 | Changed |= C.tryCombineMerges(*MI, DeadInsts); |
| 168 | for (auto *DeadMI : DeadInsts) |
| 169 | DeadMI->eraseFromParent(); |
Tim Northover | 991b12b | 2016-08-30 20:51:25 +0000 | [diff] [blame] | 170 | } |
| 171 | } |
| 172 | |
Tim Northover | 33b07d6 | 2016-07-22 20:03:43 +0000 | [diff] [blame] | 173 | return Changed; |
| 174 | } |