/src/llvm-project/llvm/lib/Target/SystemZ/SystemZElimCompare.cpp
Line | Count | Source (jump to first uncovered line) |
1 | | //===-- SystemZElimCompare.cpp - Eliminate comparison instructions --------===// |
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 | | // This pass: |
10 | | // (1) tries to remove compares if CC already contains the required information |
11 | | // (2) fuses compares and branches into COMPARE AND BRANCH instructions |
12 | | // |
13 | | //===----------------------------------------------------------------------===// |
14 | | |
15 | | #include "SystemZ.h" |
16 | | #include "SystemZInstrInfo.h" |
17 | | #include "SystemZTargetMachine.h" |
18 | | #include "llvm/ADT/SmallVector.h" |
19 | | #include "llvm/ADT/Statistic.h" |
20 | | #include "llvm/ADT/StringRef.h" |
21 | | #include "llvm/CodeGen/LivePhysRegs.h" |
22 | | #include "llvm/CodeGen/MachineBasicBlock.h" |
23 | | #include "llvm/CodeGen/MachineFunction.h" |
24 | | #include "llvm/CodeGen/MachineFunctionPass.h" |
25 | | #include "llvm/CodeGen/MachineInstr.h" |
26 | | #include "llvm/CodeGen/MachineInstrBuilder.h" |
27 | | #include "llvm/CodeGen/MachineOperand.h" |
28 | | #include "llvm/CodeGen/TargetRegisterInfo.h" |
29 | | #include "llvm/CodeGen/TargetSubtargetInfo.h" |
30 | | #include "llvm/MC/MCInstrDesc.h" |
31 | | #include <cassert> |
32 | | #include <cstdint> |
33 | | |
34 | | using namespace llvm; |
35 | | |
36 | | #define DEBUG_TYPE "systemz-elim-compare" |
37 | | |
38 | | STATISTIC(BranchOnCounts, "Number of branch-on-count instructions"); |
39 | | STATISTIC(LoadAndTraps, "Number of load-and-trap instructions"); |
40 | | STATISTIC(EliminatedComparisons, "Number of eliminated comparisons"); |
41 | | STATISTIC(FusedComparisons, "Number of fused compare-and-branch instructions"); |
42 | | |
43 | | namespace { |
44 | | |
45 | | // Represents the references to a particular register in one or more |
46 | | // instructions. |
47 | | struct Reference { |
48 | 0 | Reference() = default; |
49 | | |
50 | 0 | Reference &operator|=(const Reference &Other) { |
51 | 0 | Def |= Other.Def; |
52 | 0 | Use |= Other.Use; |
53 | 0 | return *this; |
54 | 0 | } |
55 | | |
56 | 0 | explicit operator bool() const { return Def || Use; } |
57 | | |
58 | | // True if the register is defined or used in some form, either directly or |
59 | | // via a sub- or super-register. |
60 | | bool Def = false; |
61 | | bool Use = false; |
62 | | }; |
63 | | |
64 | | class SystemZElimCompare : public MachineFunctionPass { |
65 | | public: |
66 | | static char ID; |
67 | | |
68 | 0 | SystemZElimCompare() : MachineFunctionPass(ID) { |
69 | 0 | initializeSystemZElimComparePass(*PassRegistry::getPassRegistry()); |
70 | 0 | } |
71 | | |
72 | | bool processBlock(MachineBasicBlock &MBB); |
73 | | bool runOnMachineFunction(MachineFunction &F) override; |
74 | | |
75 | 0 | MachineFunctionProperties getRequiredProperties() const override { |
76 | 0 | return MachineFunctionProperties().set( |
77 | 0 | MachineFunctionProperties::Property::NoVRegs); |
78 | 0 | } |
79 | | |
80 | | private: |
81 | | Reference getRegReferences(MachineInstr &MI, unsigned Reg); |
82 | | bool convertToBRCT(MachineInstr &MI, MachineInstr &Compare, |
83 | | SmallVectorImpl<MachineInstr *> &CCUsers); |
84 | | bool convertToLoadAndTrap(MachineInstr &MI, MachineInstr &Compare, |
85 | | SmallVectorImpl<MachineInstr *> &CCUsers); |
86 | | bool convertToLoadAndTest(MachineInstr &MI, MachineInstr &Compare, |
87 | | SmallVectorImpl<MachineInstr *> &CCUsers); |
88 | | bool convertToLogical(MachineInstr &MI, MachineInstr &Compare, |
89 | | SmallVectorImpl<MachineInstr *> &CCUsers); |
90 | | bool adjustCCMasksForInstr(MachineInstr &MI, MachineInstr &Compare, |
91 | | SmallVectorImpl<MachineInstr *> &CCUsers, |
92 | | unsigned ConvOpc = 0); |
93 | | bool optimizeCompareZero(MachineInstr &Compare, |
94 | | SmallVectorImpl<MachineInstr *> &CCUsers); |
95 | | bool fuseCompareOperations(MachineInstr &Compare, |
96 | | SmallVectorImpl<MachineInstr *> &CCUsers); |
97 | | |
98 | | const SystemZInstrInfo *TII = nullptr; |
99 | | const TargetRegisterInfo *TRI = nullptr; |
100 | | }; |
101 | | |
102 | | char SystemZElimCompare::ID = 0; |
103 | | |
104 | | } // end anonymous namespace |
105 | | |
106 | | INITIALIZE_PASS(SystemZElimCompare, DEBUG_TYPE, |
107 | | "SystemZ Comparison Elimination", false, false) |
108 | | |
109 | | // Returns true if MI is an instruction whose output equals the value in Reg. |
110 | 0 | static bool preservesValueOf(MachineInstr &MI, unsigned Reg) { |
111 | 0 | switch (MI.getOpcode()) { |
112 | 0 | case SystemZ::LR: |
113 | 0 | case SystemZ::LGR: |
114 | 0 | case SystemZ::LGFR: |
115 | 0 | case SystemZ::LTR: |
116 | 0 | case SystemZ::LTGR: |
117 | 0 | case SystemZ::LTGFR: |
118 | 0 | if (MI.getOperand(1).getReg() == Reg) |
119 | 0 | return true; |
120 | 0 | } |
121 | | |
122 | 0 | return false; |
123 | 0 | } |
124 | | |
125 | | // Return true if any CC result of MI would (perhaps after conversion) |
126 | | // reflect the value of Reg. |
127 | 0 | static bool resultTests(MachineInstr &MI, unsigned Reg) { |
128 | 0 | if (MI.getNumOperands() > 0 && MI.getOperand(0).isReg() && |
129 | 0 | MI.getOperand(0).isDef() && MI.getOperand(0).getReg() == Reg) |
130 | 0 | return true; |
131 | | |
132 | 0 | return (preservesValueOf(MI, Reg)); |
133 | 0 | } |
134 | | |
135 | | // Describe the references to Reg or any of its aliases in MI. |
136 | 0 | Reference SystemZElimCompare::getRegReferences(MachineInstr &MI, unsigned Reg) { |
137 | 0 | Reference Ref; |
138 | 0 | if (MI.isDebugInstr()) |
139 | 0 | return Ref; |
140 | | |
141 | 0 | for (const MachineOperand &MO : MI.operands()) { |
142 | 0 | if (MO.isReg()) { |
143 | 0 | if (Register MOReg = MO.getReg()) { |
144 | 0 | if (TRI->regsOverlap(MOReg, Reg)) { |
145 | 0 | if (MO.isUse()) |
146 | 0 | Ref.Use = true; |
147 | 0 | else if (MO.isDef()) |
148 | 0 | Ref.Def = true; |
149 | 0 | } |
150 | 0 | } |
151 | 0 | } |
152 | 0 | } |
153 | 0 | return Ref; |
154 | 0 | } |
155 | | |
156 | | // Return true if this is a load and test which can be optimized the |
157 | | // same way as compare instruction. |
158 | 0 | static bool isLoadAndTestAsCmp(MachineInstr &MI) { |
159 | | // If we during isel used a load-and-test as a compare with 0, the |
160 | | // def operand is dead. |
161 | 0 | return (MI.getOpcode() == SystemZ::LTEBR || |
162 | 0 | MI.getOpcode() == SystemZ::LTDBR || |
163 | 0 | MI.getOpcode() == SystemZ::LTXBR) && |
164 | 0 | MI.getOperand(0).isDead(); |
165 | 0 | } |
166 | | |
167 | | // Return the source register of Compare, which is the unknown value |
168 | | // being tested. |
169 | 0 | static unsigned getCompareSourceReg(MachineInstr &Compare) { |
170 | 0 | unsigned reg = 0; |
171 | 0 | if (Compare.isCompare()) |
172 | 0 | reg = Compare.getOperand(0).getReg(); |
173 | 0 | else if (isLoadAndTestAsCmp(Compare)) |
174 | 0 | reg = Compare.getOperand(1).getReg(); |
175 | 0 | assert(reg); |
176 | | |
177 | 0 | return reg; |
178 | 0 | } |
179 | | |
180 | | // Compare compares the result of MI against zero. If MI is an addition |
181 | | // of -1 and if CCUsers is a single branch on nonzero, eliminate the addition |
182 | | // and convert the branch to a BRCT(G) or BRCTH. Return true on success. |
183 | | bool SystemZElimCompare::convertToBRCT( |
184 | | MachineInstr &MI, MachineInstr &Compare, |
185 | 0 | SmallVectorImpl<MachineInstr *> &CCUsers) { |
186 | | // Check whether we have an addition of -1. |
187 | 0 | unsigned Opcode = MI.getOpcode(); |
188 | 0 | unsigned BRCT; |
189 | 0 | if (Opcode == SystemZ::AHI) |
190 | 0 | BRCT = SystemZ::BRCT; |
191 | 0 | else if (Opcode == SystemZ::AGHI) |
192 | 0 | BRCT = SystemZ::BRCTG; |
193 | 0 | else if (Opcode == SystemZ::AIH) |
194 | 0 | BRCT = SystemZ::BRCTH; |
195 | 0 | else |
196 | 0 | return false; |
197 | 0 | if (MI.getOperand(2).getImm() != -1) |
198 | 0 | return false; |
199 | | |
200 | | // Check whether we have a single JLH. |
201 | 0 | if (CCUsers.size() != 1) |
202 | 0 | return false; |
203 | 0 | MachineInstr *Branch = CCUsers[0]; |
204 | 0 | if (Branch->getOpcode() != SystemZ::BRC || |
205 | 0 | Branch->getOperand(0).getImm() != SystemZ::CCMASK_ICMP || |
206 | 0 | Branch->getOperand(1).getImm() != SystemZ::CCMASK_CMP_NE) |
207 | 0 | return false; |
208 | | |
209 | | // We already know that there are no references to the register between |
210 | | // MI and Compare. Make sure that there are also no references between |
211 | | // Compare and Branch. |
212 | 0 | unsigned SrcReg = getCompareSourceReg(Compare); |
213 | 0 | MachineBasicBlock::iterator MBBI = Compare, MBBE = Branch; |
214 | 0 | for (++MBBI; MBBI != MBBE; ++MBBI) |
215 | 0 | if (getRegReferences(*MBBI, SrcReg)) |
216 | 0 | return false; |
217 | | |
218 | | // The transformation is OK. Rebuild Branch as a BRCT(G) or BRCTH. |
219 | 0 | MachineOperand Target(Branch->getOperand(2)); |
220 | 0 | while (Branch->getNumOperands()) |
221 | 0 | Branch->removeOperand(0); |
222 | 0 | Branch->setDesc(TII->get(BRCT)); |
223 | 0 | MachineInstrBuilder MIB(*Branch->getParent()->getParent(), Branch); |
224 | 0 | MIB.add(MI.getOperand(0)).add(MI.getOperand(1)).add(Target); |
225 | | // Add a CC def to BRCT(G), since we may have to split them again if the |
226 | | // branch displacement overflows. BRCTH has a 32-bit displacement, so |
227 | | // this is not necessary there. |
228 | 0 | if (BRCT != SystemZ::BRCTH) |
229 | 0 | MIB.addReg(SystemZ::CC, RegState::ImplicitDefine | RegState::Dead); |
230 | 0 | MI.eraseFromParent(); |
231 | 0 | return true; |
232 | 0 | } |
233 | | |
234 | | // Compare compares the result of MI against zero. If MI is a suitable load |
235 | | // instruction and if CCUsers is a single conditional trap on zero, eliminate |
236 | | // the load and convert the branch to a load-and-trap. Return true on success. |
237 | | bool SystemZElimCompare::convertToLoadAndTrap( |
238 | | MachineInstr &MI, MachineInstr &Compare, |
239 | 0 | SmallVectorImpl<MachineInstr *> &CCUsers) { |
240 | 0 | unsigned LATOpcode = TII->getLoadAndTrap(MI.getOpcode()); |
241 | 0 | if (!LATOpcode) |
242 | 0 | return false; |
243 | | |
244 | | // Check whether we have a single CondTrap that traps on zero. |
245 | 0 | if (CCUsers.size() != 1) |
246 | 0 | return false; |
247 | 0 | MachineInstr *Branch = CCUsers[0]; |
248 | 0 | if (Branch->getOpcode() != SystemZ::CondTrap || |
249 | 0 | Branch->getOperand(0).getImm() != SystemZ::CCMASK_ICMP || |
250 | 0 | Branch->getOperand(1).getImm() != SystemZ::CCMASK_CMP_EQ) |
251 | 0 | return false; |
252 | | |
253 | | // We already know that there are no references to the register between |
254 | | // MI and Compare. Make sure that there are also no references between |
255 | | // Compare and Branch. |
256 | 0 | unsigned SrcReg = getCompareSourceReg(Compare); |
257 | 0 | MachineBasicBlock::iterator MBBI = Compare, MBBE = Branch; |
258 | 0 | for (++MBBI; MBBI != MBBE; ++MBBI) |
259 | 0 | if (getRegReferences(*MBBI, SrcReg)) |
260 | 0 | return false; |
261 | | |
262 | | // The transformation is OK. Rebuild Branch as a load-and-trap. |
263 | 0 | while (Branch->getNumOperands()) |
264 | 0 | Branch->removeOperand(0); |
265 | 0 | Branch->setDesc(TII->get(LATOpcode)); |
266 | 0 | MachineInstrBuilder(*Branch->getParent()->getParent(), Branch) |
267 | 0 | .add(MI.getOperand(0)) |
268 | 0 | .add(MI.getOperand(1)) |
269 | 0 | .add(MI.getOperand(2)) |
270 | 0 | .add(MI.getOperand(3)); |
271 | 0 | MI.eraseFromParent(); |
272 | 0 | return true; |
273 | 0 | } |
274 | | |
275 | | // If MI is a load instruction, try to convert it into a LOAD AND TEST. |
276 | | // Return true on success. |
277 | | bool SystemZElimCompare::convertToLoadAndTest( |
278 | | MachineInstr &MI, MachineInstr &Compare, |
279 | 0 | SmallVectorImpl<MachineInstr *> &CCUsers) { |
280 | | |
281 | | // Try to adjust CC masks for the LOAD AND TEST opcode that could replace MI. |
282 | 0 | unsigned Opcode = TII->getLoadAndTest(MI.getOpcode()); |
283 | 0 | if (!Opcode || !adjustCCMasksForInstr(MI, Compare, CCUsers, Opcode)) |
284 | 0 | return false; |
285 | | |
286 | | // Rebuild to get the CC operand in the right place. |
287 | 0 | auto MIB = BuildMI(*MI.getParent(), MI, MI.getDebugLoc(), TII->get(Opcode)); |
288 | 0 | for (const auto &MO : MI.operands()) |
289 | 0 | MIB.add(MO); |
290 | 0 | MIB.setMemRefs(MI.memoperands()); |
291 | 0 | MI.eraseFromParent(); |
292 | | |
293 | | // Mark instruction as not raising an FP exception if applicable. We already |
294 | | // verified earlier that this move is valid. |
295 | 0 | if (!Compare.mayRaiseFPException()) |
296 | 0 | MIB.setMIFlag(MachineInstr::MIFlag::NoFPExcept); |
297 | |
|
298 | 0 | return true; |
299 | 0 | } |
300 | | |
301 | | // See if MI is an instruction with an equivalent "logical" opcode that can |
302 | | // be used and replace MI. This is useful for EQ/NE comparisons where the |
303 | | // "nsw" flag is missing since the "logical" opcode always sets CC to reflect |
304 | | // the result being zero or non-zero. |
305 | | bool SystemZElimCompare::convertToLogical( |
306 | | MachineInstr &MI, MachineInstr &Compare, |
307 | 0 | SmallVectorImpl<MachineInstr *> &CCUsers) { |
308 | |
|
309 | 0 | unsigned ConvOpc = 0; |
310 | 0 | switch (MI.getOpcode()) { |
311 | 0 | case SystemZ::AR: ConvOpc = SystemZ::ALR; break; |
312 | 0 | case SystemZ::ARK: ConvOpc = SystemZ::ALRK; break; |
313 | 0 | case SystemZ::AGR: ConvOpc = SystemZ::ALGR; break; |
314 | 0 | case SystemZ::AGRK: ConvOpc = SystemZ::ALGRK; break; |
315 | 0 | case SystemZ::A: ConvOpc = SystemZ::AL; break; |
316 | 0 | case SystemZ::AY: ConvOpc = SystemZ::ALY; break; |
317 | 0 | case SystemZ::AG: ConvOpc = SystemZ::ALG; break; |
318 | 0 | default: break; |
319 | 0 | } |
320 | 0 | if (!ConvOpc || !adjustCCMasksForInstr(MI, Compare, CCUsers, ConvOpc)) |
321 | 0 | return false; |
322 | | |
323 | | // Operands should be identical, so just change the opcode and remove the |
324 | | // dead flag on CC. |
325 | 0 | MI.setDesc(TII->get(ConvOpc)); |
326 | 0 | MI.clearRegisterDeads(SystemZ::CC); |
327 | 0 | return true; |
328 | 0 | } |
329 | | |
330 | | #ifndef NDEBUG |
331 | 0 | static bool isAddWithImmediate(unsigned Opcode) { |
332 | 0 | switch(Opcode) { |
333 | 0 | case SystemZ::AHI: |
334 | 0 | case SystemZ::AHIK: |
335 | 0 | case SystemZ::AGHI: |
336 | 0 | case SystemZ::AGHIK: |
337 | 0 | case SystemZ::AFI: |
338 | 0 | case SystemZ::AIH: |
339 | 0 | case SystemZ::AGFI: |
340 | 0 | return true; |
341 | 0 | default: break; |
342 | 0 | } |
343 | 0 | return false; |
344 | 0 | } |
345 | | #endif |
346 | | |
347 | | // The CC users in CCUsers are testing the result of a comparison of some |
348 | | // value X against zero and we know that any CC value produced by MI would |
349 | | // also reflect the value of X. ConvOpc may be used to pass the transfomed |
350 | | // opcode MI will have if this succeeds. Try to adjust CCUsers so that they |
351 | | // test the result of MI directly, returning true on success. Leave |
352 | | // everything unchanged on failure. |
353 | | bool SystemZElimCompare::adjustCCMasksForInstr( |
354 | | MachineInstr &MI, MachineInstr &Compare, |
355 | | SmallVectorImpl<MachineInstr *> &CCUsers, |
356 | 0 | unsigned ConvOpc) { |
357 | 0 | unsigned CompareFlags = Compare.getDesc().TSFlags; |
358 | 0 | unsigned CompareCCValues = SystemZII::getCCValues(CompareFlags); |
359 | 0 | int Opcode = (ConvOpc ? ConvOpc : MI.getOpcode()); |
360 | 0 | const MCInstrDesc &Desc = TII->get(Opcode); |
361 | 0 | unsigned MIFlags = Desc.TSFlags; |
362 | | |
363 | | // If Compare may raise an FP exception, we can only eliminate it |
364 | | // if MI itself would have already raised the exception. |
365 | 0 | if (Compare.mayRaiseFPException()) { |
366 | | // If the caller will change MI to use ConvOpc, only test whether |
367 | | // ConvOpc is suitable; it is on the caller to set the MI flag. |
368 | 0 | if (ConvOpc && !Desc.mayRaiseFPException()) |
369 | 0 | return false; |
370 | | // If the caller will not change MI, we test the MI flag here. |
371 | 0 | if (!ConvOpc && !MI.mayRaiseFPException()) |
372 | 0 | return false; |
373 | 0 | } |
374 | | |
375 | | // See which compare-style condition codes are available. |
376 | 0 | unsigned CCValues = SystemZII::getCCValues(MIFlags); |
377 | 0 | unsigned ReusableCCMask = CCValues; |
378 | | // For unsigned comparisons with zero, only equality makes sense. |
379 | 0 | if (CompareFlags & SystemZII::IsLogical) |
380 | 0 | ReusableCCMask &= SystemZ::CCMASK_CMP_EQ; |
381 | 0 | unsigned OFImplies = 0; |
382 | 0 | bool LogicalMI = false; |
383 | 0 | bool MIEquivalentToCmp = false; |
384 | 0 | if (MI.getFlag(MachineInstr::NoSWrap) && |
385 | 0 | (MIFlags & SystemZII::CCIfNoSignedWrap)) { |
386 | | // If MI has the NSW flag set in combination with the |
387 | | // SystemZII::CCIfNoSignedWrap flag, all CCValues are valid. |
388 | 0 | } |
389 | 0 | else if ((MIFlags & SystemZII::CCIfNoSignedWrap) && |
390 | 0 | MI.getOperand(2).isImm()) { |
391 | | // Signed addition of immediate. If adding a positive immediate |
392 | | // overflows, the result must be less than zero. If adding a negative |
393 | | // immediate overflows, the result must be larger than zero (except in |
394 | | // the special case of adding the minimum value of the result range, in |
395 | | // which case we cannot predict whether the result is larger than or |
396 | | // equal to zero). |
397 | 0 | assert(isAddWithImmediate(Opcode) && "Expected an add with immediate."); |
398 | 0 | assert(!MI.mayLoadOrStore() && "Expected an immediate term."); |
399 | 0 | int64_t RHS = MI.getOperand(2).getImm(); |
400 | 0 | if (SystemZ::GRX32BitRegClass.contains(MI.getOperand(0).getReg()) && |
401 | 0 | RHS == INT32_MIN) |
402 | 0 | return false; |
403 | 0 | OFImplies = (RHS > 0 ? SystemZ::CCMASK_CMP_LT : SystemZ::CCMASK_CMP_GT); |
404 | 0 | } |
405 | 0 | else if ((MIFlags & SystemZII::IsLogical) && CCValues) { |
406 | | // Use CCMASK_CMP_EQ to match with CCUsers. On success CCMask:s will be |
407 | | // converted to CCMASK_LOGICAL_ZERO or CCMASK_LOGICAL_NONZERO. |
408 | 0 | LogicalMI = true; |
409 | 0 | ReusableCCMask = SystemZ::CCMASK_CMP_EQ; |
410 | 0 | } |
411 | 0 | else { |
412 | 0 | ReusableCCMask &= SystemZII::getCompareZeroCCMask(MIFlags); |
413 | 0 | assert((ReusableCCMask & ~CCValues) == 0 && "Invalid CCValues"); |
414 | 0 | MIEquivalentToCmp = |
415 | 0 | ReusableCCMask == CCValues && CCValues == CompareCCValues; |
416 | 0 | } |
417 | 0 | if (ReusableCCMask == 0) |
418 | 0 | return false; |
419 | | |
420 | 0 | if (!MIEquivalentToCmp) { |
421 | | // Now check whether these flags are enough for all users. |
422 | 0 | SmallVector<MachineOperand *, 4> AlterMasks; |
423 | 0 | for (unsigned int I = 0, E = CCUsers.size(); I != E; ++I) { |
424 | 0 | MachineInstr *CCUserMI = CCUsers[I]; |
425 | | |
426 | | // Fail if this isn't a use of CC that we understand. |
427 | 0 | unsigned Flags = CCUserMI->getDesc().TSFlags; |
428 | 0 | unsigned FirstOpNum; |
429 | 0 | if (Flags & SystemZII::CCMaskFirst) |
430 | 0 | FirstOpNum = 0; |
431 | 0 | else if (Flags & SystemZII::CCMaskLast) |
432 | 0 | FirstOpNum = CCUserMI->getNumExplicitOperands() - 2; |
433 | 0 | else |
434 | 0 | return false; |
435 | | |
436 | | // Check whether the instruction predicate treats all CC values |
437 | | // outside of ReusableCCMask in the same way. In that case it |
438 | | // doesn't matter what those CC values mean. |
439 | 0 | unsigned CCValid = CCUserMI->getOperand(FirstOpNum).getImm(); |
440 | 0 | unsigned CCMask = CCUserMI->getOperand(FirstOpNum + 1).getImm(); |
441 | 0 | assert(CCValid == CompareCCValues && (CCMask & ~CCValid) == 0 && |
442 | 0 | "Corrupt CC operands of CCUser."); |
443 | 0 | unsigned OutValid = ~ReusableCCMask & CCValid; |
444 | 0 | unsigned OutMask = ~ReusableCCMask & CCMask; |
445 | 0 | if (OutMask != 0 && OutMask != OutValid) |
446 | 0 | return false; |
447 | | |
448 | 0 | AlterMasks.push_back(&CCUserMI->getOperand(FirstOpNum)); |
449 | 0 | AlterMasks.push_back(&CCUserMI->getOperand(FirstOpNum + 1)); |
450 | 0 | } |
451 | | |
452 | | // All users are OK. Adjust the masks for MI. |
453 | 0 | for (unsigned I = 0, E = AlterMasks.size(); I != E; I += 2) { |
454 | 0 | AlterMasks[I]->setImm(CCValues); |
455 | 0 | unsigned CCMask = AlterMasks[I + 1]->getImm(); |
456 | 0 | if (LogicalMI) { |
457 | | // Translate the CCMask into its "logical" value. |
458 | 0 | CCMask = (CCMask == SystemZ::CCMASK_CMP_EQ ? |
459 | 0 | SystemZ::CCMASK_LOGICAL_ZERO : SystemZ::CCMASK_LOGICAL_NONZERO); |
460 | 0 | CCMask &= CCValues; // Logical subtracts never set CC=0. |
461 | 0 | } else { |
462 | 0 | if (CCMask & ~ReusableCCMask) |
463 | 0 | CCMask = (CCMask & ReusableCCMask) | (CCValues & ~ReusableCCMask); |
464 | 0 | CCMask |= (CCMask & OFImplies) ? SystemZ::CCMASK_ARITH_OVERFLOW : 0; |
465 | 0 | } |
466 | 0 | AlterMasks[I + 1]->setImm(CCMask); |
467 | 0 | } |
468 | 0 | } |
469 | | |
470 | | // CC is now live after MI. |
471 | 0 | if (!ConvOpc) |
472 | 0 | MI.clearRegisterDeads(SystemZ::CC); |
473 | | |
474 | | // Check if MI lies before Compare. |
475 | 0 | bool BeforeCmp = false; |
476 | 0 | MachineBasicBlock::iterator MBBI = MI, MBBE = MI.getParent()->end(); |
477 | 0 | for (++MBBI; MBBI != MBBE; ++MBBI) |
478 | 0 | if (MBBI == Compare) { |
479 | 0 | BeforeCmp = true; |
480 | 0 | break; |
481 | 0 | } |
482 | | |
483 | | // Clear any intervening kills of CC. |
484 | 0 | if (BeforeCmp) { |
485 | 0 | MachineBasicBlock::iterator MBBI = MI, MBBE = Compare; |
486 | 0 | for (++MBBI; MBBI != MBBE; ++MBBI) |
487 | 0 | MBBI->clearRegisterKills(SystemZ::CC, TRI); |
488 | 0 | } |
489 | |
|
490 | 0 | return true; |
491 | 0 | } |
492 | | |
493 | | // Return true if Compare is a comparison against zero. |
494 | 0 | static bool isCompareZero(MachineInstr &Compare) { |
495 | 0 | if (isLoadAndTestAsCmp(Compare)) |
496 | 0 | return true; |
497 | 0 | return Compare.getNumExplicitOperands() == 2 && |
498 | 0 | Compare.getOperand(1).isImm() && Compare.getOperand(1).getImm() == 0; |
499 | 0 | } |
500 | | |
501 | | // Try to optimize cases where comparison instruction Compare is testing |
502 | | // a value against zero. Return true on success and if Compare should be |
503 | | // deleted as dead. CCUsers is the list of instructions that use the CC |
504 | | // value produced by Compare. |
505 | | bool SystemZElimCompare::optimizeCompareZero( |
506 | 0 | MachineInstr &Compare, SmallVectorImpl<MachineInstr *> &CCUsers) { |
507 | 0 | if (!isCompareZero(Compare)) |
508 | 0 | return false; |
509 | | |
510 | | // Search back for CC results that are based on the first operand. |
511 | 0 | unsigned SrcReg = getCompareSourceReg(Compare); |
512 | 0 | MachineBasicBlock &MBB = *Compare.getParent(); |
513 | 0 | Reference CCRefs; |
514 | 0 | Reference SrcRefs; |
515 | 0 | for (MachineBasicBlock::reverse_iterator MBBI = |
516 | 0 | std::next(MachineBasicBlock::reverse_iterator(&Compare)), |
517 | 0 | MBBE = MBB.rend(); MBBI != MBBE;) { |
518 | 0 | MachineInstr &MI = *MBBI++; |
519 | 0 | if (resultTests(MI, SrcReg)) { |
520 | | // Try to remove both MI and Compare by converting a branch to BRCT(G). |
521 | | // or a load-and-trap instruction. We don't care in this case whether |
522 | | // CC is modified between MI and Compare. |
523 | 0 | if (!CCRefs.Use && !SrcRefs) { |
524 | 0 | if (convertToBRCT(MI, Compare, CCUsers)) { |
525 | 0 | BranchOnCounts += 1; |
526 | 0 | return true; |
527 | 0 | } |
528 | 0 | if (convertToLoadAndTrap(MI, Compare, CCUsers)) { |
529 | 0 | LoadAndTraps += 1; |
530 | 0 | return true; |
531 | 0 | } |
532 | 0 | } |
533 | | // Try to eliminate Compare by reusing a CC result from MI. |
534 | 0 | if ((!CCRefs && convertToLoadAndTest(MI, Compare, CCUsers)) || |
535 | 0 | (!CCRefs.Def && |
536 | 0 | (adjustCCMasksForInstr(MI, Compare, CCUsers) || |
537 | 0 | convertToLogical(MI, Compare, CCUsers)))) { |
538 | 0 | EliminatedComparisons += 1; |
539 | 0 | return true; |
540 | 0 | } |
541 | 0 | } |
542 | 0 | SrcRefs |= getRegReferences(MI, SrcReg); |
543 | 0 | if (SrcRefs.Def) |
544 | 0 | break; |
545 | 0 | CCRefs |= getRegReferences(MI, SystemZ::CC); |
546 | 0 | if (CCRefs.Use && CCRefs.Def) |
547 | 0 | break; |
548 | | // Eliminating a Compare that may raise an FP exception will move |
549 | | // raising the exception to some earlier MI. We cannot do this if |
550 | | // there is anything in between that might change exception flags. |
551 | 0 | if (Compare.mayRaiseFPException() && |
552 | 0 | (MI.isCall() || MI.hasUnmodeledSideEffects())) |
553 | 0 | break; |
554 | 0 | } |
555 | | |
556 | | // Also do a forward search to handle cases where an instruction after the |
557 | | // compare can be converted, like |
558 | | // CGHI %r0d, 0; %r1d = LGR %r0d => LTGR %r1d, %r0d |
559 | 0 | auto MIRange = llvm::make_range( |
560 | 0 | std::next(MachineBasicBlock::iterator(&Compare)), MBB.end()); |
561 | 0 | for (MachineInstr &MI : llvm::make_early_inc_range(MIRange)) { |
562 | 0 | if (preservesValueOf(MI, SrcReg)) { |
563 | | // Try to eliminate Compare by reusing a CC result from MI. |
564 | 0 | if (convertToLoadAndTest(MI, Compare, CCUsers)) { |
565 | 0 | EliminatedComparisons += 1; |
566 | 0 | return true; |
567 | 0 | } |
568 | 0 | } |
569 | 0 | if (getRegReferences(MI, SrcReg).Def) |
570 | 0 | return false; |
571 | 0 | if (getRegReferences(MI, SystemZ::CC)) |
572 | 0 | return false; |
573 | 0 | } |
574 | | |
575 | 0 | return false; |
576 | 0 | } |
577 | | |
578 | | // Try to fuse comparison instruction Compare into a later branch. |
579 | | // Return true on success and if Compare is therefore redundant. |
580 | | bool SystemZElimCompare::fuseCompareOperations( |
581 | 0 | MachineInstr &Compare, SmallVectorImpl<MachineInstr *> &CCUsers) { |
582 | | // See whether we have a single branch with which to fuse. |
583 | 0 | if (CCUsers.size() != 1) |
584 | 0 | return false; |
585 | 0 | MachineInstr *Branch = CCUsers[0]; |
586 | 0 | SystemZII::FusedCompareType Type; |
587 | 0 | switch (Branch->getOpcode()) { |
588 | 0 | case SystemZ::BRC: |
589 | 0 | Type = SystemZII::CompareAndBranch; |
590 | 0 | break; |
591 | 0 | case SystemZ::CondReturn: |
592 | 0 | Type = SystemZII::CompareAndReturn; |
593 | 0 | break; |
594 | 0 | case SystemZ::CallBCR: |
595 | 0 | Type = SystemZII::CompareAndSibcall; |
596 | 0 | break; |
597 | 0 | case SystemZ::CondTrap: |
598 | 0 | Type = SystemZII::CompareAndTrap; |
599 | 0 | break; |
600 | 0 | default: |
601 | 0 | return false; |
602 | 0 | } |
603 | | |
604 | | // See whether we have a comparison that can be fused. |
605 | 0 | unsigned FusedOpcode = |
606 | 0 | TII->getFusedCompare(Compare.getOpcode(), Type, &Compare); |
607 | 0 | if (!FusedOpcode) |
608 | 0 | return false; |
609 | | |
610 | | // Make sure that the operands are available at the branch. |
611 | | // SrcReg2 is the register if the source operand is a register, |
612 | | // 0 if the source operand is immediate, and the base register |
613 | | // if the source operand is memory (index is not supported). |
614 | 0 | Register SrcReg = Compare.getOperand(0).getReg(); |
615 | 0 | Register SrcReg2 = |
616 | 0 | Compare.getOperand(1).isReg() ? Compare.getOperand(1).getReg() : Register(); |
617 | 0 | MachineBasicBlock::iterator MBBI = Compare, MBBE = Branch; |
618 | 0 | for (++MBBI; MBBI != MBBE; ++MBBI) |
619 | 0 | if (MBBI->modifiesRegister(SrcReg, TRI) || |
620 | 0 | (SrcReg2 && MBBI->modifiesRegister(SrcReg2, TRI))) |
621 | 0 | return false; |
622 | | |
623 | | // Read the branch mask, target (if applicable), regmask (if applicable). |
624 | 0 | MachineOperand CCMask(MBBI->getOperand(1)); |
625 | 0 | assert((CCMask.getImm() & ~SystemZ::CCMASK_ICMP) == 0 && |
626 | 0 | "Invalid condition-code mask for integer comparison"); |
627 | | // This is only valid for CompareAndBranch and CompareAndSibcall. |
628 | 0 | MachineOperand Target(MBBI->getOperand( |
629 | 0 | (Type == SystemZII::CompareAndBranch || |
630 | 0 | Type == SystemZII::CompareAndSibcall) ? 2 : 0)); |
631 | 0 | const uint32_t *RegMask; |
632 | 0 | if (Type == SystemZII::CompareAndSibcall) |
633 | 0 | RegMask = MBBI->getOperand(3).getRegMask(); |
634 | | |
635 | | // Clear out all current operands. |
636 | 0 | int CCUse = MBBI->findRegisterUseOperandIdx(SystemZ::CC, false, TRI); |
637 | 0 | assert(CCUse >= 0 && "BRC/BCR must use CC"); |
638 | 0 | Branch->removeOperand(CCUse); |
639 | | // Remove regmask (sibcall). |
640 | 0 | if (Type == SystemZII::CompareAndSibcall) |
641 | 0 | Branch->removeOperand(3); |
642 | | // Remove target (branch or sibcall). |
643 | 0 | if (Type == SystemZII::CompareAndBranch || |
644 | 0 | Type == SystemZII::CompareAndSibcall) |
645 | 0 | Branch->removeOperand(2); |
646 | 0 | Branch->removeOperand(1); |
647 | 0 | Branch->removeOperand(0); |
648 | | |
649 | | // Rebuild Branch as a fused compare and branch. |
650 | | // SrcNOps is the number of MI operands of the compare instruction |
651 | | // that we need to copy over. |
652 | 0 | unsigned SrcNOps = 2; |
653 | 0 | if (FusedOpcode == SystemZ::CLT || FusedOpcode == SystemZ::CLGT) |
654 | 0 | SrcNOps = 3; |
655 | 0 | Branch->setDesc(TII->get(FusedOpcode)); |
656 | 0 | MachineInstrBuilder MIB(*Branch->getParent()->getParent(), Branch); |
657 | 0 | for (unsigned I = 0; I < SrcNOps; I++) |
658 | 0 | MIB.add(Compare.getOperand(I)); |
659 | 0 | MIB.add(CCMask); |
660 | |
|
661 | 0 | if (Type == SystemZII::CompareAndBranch) { |
662 | | // Only conditional branches define CC, as they may be converted back |
663 | | // to a non-fused branch because of a long displacement. Conditional |
664 | | // returns don't have that problem. |
665 | 0 | MIB.add(Target).addReg(SystemZ::CC, |
666 | 0 | RegState::ImplicitDefine | RegState::Dead); |
667 | 0 | } |
668 | |
|
669 | 0 | if (Type == SystemZII::CompareAndSibcall) { |
670 | 0 | MIB.add(Target); |
671 | 0 | MIB.addRegMask(RegMask); |
672 | 0 | } |
673 | | |
674 | | // Clear any intervening kills of SrcReg and SrcReg2. |
675 | 0 | MBBI = Compare; |
676 | 0 | for (++MBBI; MBBI != MBBE; ++MBBI) { |
677 | 0 | MBBI->clearRegisterKills(SrcReg, TRI); |
678 | 0 | if (SrcReg2) |
679 | 0 | MBBI->clearRegisterKills(SrcReg2, TRI); |
680 | 0 | } |
681 | 0 | FusedComparisons += 1; |
682 | 0 | return true; |
683 | 0 | } |
684 | | |
685 | | // Process all comparison instructions in MBB. Return true if something |
686 | | // changed. |
687 | 0 | bool SystemZElimCompare::processBlock(MachineBasicBlock &MBB) { |
688 | 0 | bool Changed = false; |
689 | | |
690 | | // Walk backwards through the block looking for comparisons, recording |
691 | | // all CC users as we go. The subroutines can delete Compare and |
692 | | // instructions before it. |
693 | 0 | LivePhysRegs LiveRegs(*TRI); |
694 | 0 | LiveRegs.addLiveOuts(MBB); |
695 | 0 | bool CompleteCCUsers = !LiveRegs.contains(SystemZ::CC); |
696 | 0 | SmallVector<MachineInstr *, 4> CCUsers; |
697 | 0 | MachineBasicBlock::iterator MBBI = MBB.end(); |
698 | 0 | while (MBBI != MBB.begin()) { |
699 | 0 | MachineInstr &MI = *--MBBI; |
700 | 0 | if (CompleteCCUsers && (MI.isCompare() || isLoadAndTestAsCmp(MI)) && |
701 | 0 | (optimizeCompareZero(MI, CCUsers) || |
702 | 0 | fuseCompareOperations(MI, CCUsers))) { |
703 | 0 | ++MBBI; |
704 | 0 | MI.eraseFromParent(); |
705 | 0 | Changed = true; |
706 | 0 | CCUsers.clear(); |
707 | 0 | continue; |
708 | 0 | } |
709 | | |
710 | 0 | if (MI.definesRegister(SystemZ::CC)) { |
711 | 0 | CCUsers.clear(); |
712 | 0 | CompleteCCUsers = true; |
713 | 0 | } |
714 | 0 | if (MI.readsRegister(SystemZ::CC) && CompleteCCUsers) |
715 | 0 | CCUsers.push_back(&MI); |
716 | 0 | } |
717 | 0 | return Changed; |
718 | 0 | } |
719 | | |
720 | 0 | bool SystemZElimCompare::runOnMachineFunction(MachineFunction &F) { |
721 | 0 | if (skipFunction(F.getFunction())) |
722 | 0 | return false; |
723 | | |
724 | 0 | TII = F.getSubtarget<SystemZSubtarget>().getInstrInfo(); |
725 | 0 | TRI = &TII->getRegisterInfo(); |
726 | |
|
727 | 0 | bool Changed = false; |
728 | 0 | for (auto &MBB : F) |
729 | 0 | Changed |= processBlock(MBB); |
730 | |
|
731 | 0 | return Changed; |
732 | 0 | } |
733 | | |
734 | 0 | FunctionPass *llvm::createSystemZElimComparePass(SystemZTargetMachine &TM) { |
735 | 0 | return new SystemZElimCompare(); |
736 | 0 | } |