1 | //===- HexagonSplitDouble.cpp ---------------------------------------------===// |
2 | // |
3 | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
4 | // See https://llvm.org/LICENSE.txt for license information. |
5 | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
6 | // |
7 | //===----------------------------------------------------------------------===// |
8 | |
9 | #include "Hexagon.h" |
10 | #include "HexagonInstrInfo.h" |
11 | #include "HexagonRegisterInfo.h" |
12 | #include "HexagonSubtarget.h" |
13 | #include "llvm/ADT/BitVector.h" |
14 | #include "llvm/ADT/STLExtras.h" |
15 | #include "llvm/ADT/SmallVector.h" |
16 | #include "llvm/ADT/StringRef.h" |
17 | #include "llvm/CodeGen/MachineBasicBlock.h" |
18 | #include "llvm/CodeGen/MachineFunction.h" |
19 | #include "llvm/CodeGen/MachineFunctionPass.h" |
20 | #include "llvm/CodeGen/MachineInstr.h" |
21 | #include "llvm/CodeGen/MachineInstrBuilder.h" |
22 | #include "llvm/CodeGen/MachineLoopInfo.h" |
23 | #include "llvm/CodeGen/MachineMemOperand.h" |
24 | #include "llvm/CodeGen/MachineOperand.h" |
25 | #include "llvm/CodeGen/MachineRegisterInfo.h" |
26 | #include "llvm/CodeGen/TargetRegisterInfo.h" |
27 | #include "llvm/Config/llvm-config.h" |
28 | #include "llvm/IR/DebugLoc.h" |
29 | #include "llvm/Pass.h" |
30 | #include "llvm/Support/CommandLine.h" |
31 | #include "llvm/Support/Compiler.h" |
32 | #include "llvm/Support/Debug.h" |
33 | #include "llvm/Support/ErrorHandling.h" |
34 | #include "llvm/Support/raw_ostream.h" |
35 | #include <algorithm> |
36 | #include <cassert> |
37 | #include <cstdint> |
38 | #include <limits> |
39 | #include <map> |
40 | #include <set> |
41 | #include <utility> |
42 | #include <vector> |
43 | |
44 | #define DEBUG_TYPE "hsdr" |
45 | |
46 | using namespace llvm; |
47 | |
48 | static cl::opt<int> MaxHSDR("max-hsdr" , cl::Hidden, cl::init(Val: -1), |
49 | cl::desc("Maximum number of split partitions" )); |
50 | static cl::opt<bool> MemRefsFixed("hsdr-no-mem" , cl::Hidden, cl::init(Val: true), |
51 | cl::desc("Do not split loads or stores" )); |
52 | static cl::opt<bool> SplitAll("hsdr-split-all" , cl::Hidden, cl::init(Val: false), |
53 | cl::desc("Split all partitions" )); |
54 | |
55 | namespace { |
56 | |
57 | class HexagonSplitDoubleRegs : public MachineFunctionPass { |
58 | public: |
59 | static char ID; |
60 | |
61 | HexagonSplitDoubleRegs() : MachineFunctionPass(ID) {} |
62 | |
63 | StringRef getPassName() const override { |
64 | return "Hexagon Split Double Registers" ; |
65 | } |
66 | |
67 | void getAnalysisUsage(AnalysisUsage &AU) const override { |
68 | AU.addRequired<MachineLoopInfoWrapperPass>(); |
69 | AU.addPreserved<MachineLoopInfoWrapperPass>(); |
70 | MachineFunctionPass::getAnalysisUsage(AU); |
71 | } |
72 | |
73 | bool runOnMachineFunction(MachineFunction &MF) override; |
74 | |
75 | private: |
76 | static const TargetRegisterClass *const DoubleRC; |
77 | |
78 | const HexagonRegisterInfo *TRI = nullptr; |
79 | const HexagonInstrInfo *TII = nullptr; |
80 | const MachineLoopInfo *MLI; |
81 | MachineRegisterInfo *MRI; |
82 | |
83 | using USet = std::set<unsigned>; |
84 | using UUSetMap = std::map<unsigned, USet>; |
85 | using UUPair = std::pair<unsigned, unsigned>; |
86 | using UUPairMap = std::map<unsigned, UUPair>; |
87 | using LoopRegMap = std::map<const MachineLoop *, USet>; |
88 | |
89 | bool isInduction(unsigned Reg, LoopRegMap &IRM) const; |
90 | bool isVolatileInstr(const MachineInstr *MI) const; |
91 | bool isFixedInstr(const MachineInstr *MI) const; |
92 | void partitionRegisters(UUSetMap &P2Rs); |
93 | int32_t profit(const MachineInstr *MI) const; |
94 | int32_t profit(Register Reg) const; |
95 | bool isProfitable(const USet &Part, LoopRegMap &IRM) const; |
96 | |
97 | void collectIndRegsForLoop(const MachineLoop *L, USet &Rs); |
98 | void collectIndRegs(LoopRegMap &IRM); |
99 | |
100 | void createHalfInstr(unsigned Opc, MachineInstr *MI, |
101 | const UUPairMap &PairMap, unsigned SubR); |
102 | void splitMemRef(MachineInstr *MI, const UUPairMap &PairMap); |
103 | void splitImmediate(MachineInstr *MI, const UUPairMap &PairMap); |
104 | void splitCombine(MachineInstr *MI, const UUPairMap &PairMap); |
105 | void splitExt(MachineInstr *MI, const UUPairMap &PairMap); |
106 | void splitShift(MachineInstr *MI, const UUPairMap &PairMap); |
107 | void splitAslOr(MachineInstr *MI, const UUPairMap &PairMap); |
108 | bool splitInstr(MachineInstr *MI, const UUPairMap &PairMap); |
109 | void replaceSubregUses(MachineInstr *MI, const UUPairMap &PairMap); |
110 | void collapseRegPairs(MachineInstr *MI, const UUPairMap &PairMap); |
111 | bool splitPartition(const USet &Part); |
112 | |
113 | static int Counter; |
114 | |
115 | static void dump_partition(raw_ostream&, const USet&, |
116 | const TargetRegisterInfo&); |
117 | }; |
118 | |
119 | } // end anonymous namespace |
120 | |
121 | char HexagonSplitDoubleRegs::ID; |
122 | int HexagonSplitDoubleRegs::Counter = 0; |
123 | const TargetRegisterClass *const HexagonSplitDoubleRegs::DoubleRC = |
124 | &Hexagon::DoubleRegsRegClass; |
125 | |
126 | INITIALIZE_PASS(HexagonSplitDoubleRegs, "hexagon-split-double" , |
127 | "Hexagon Split Double Registers" , false, false) |
128 | |
129 | #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP) |
130 | LLVM_DUMP_METHOD void HexagonSplitDoubleRegs::dump_partition(raw_ostream &os, |
131 | const USet &Part, const TargetRegisterInfo &TRI) { |
132 | dbgs() << '{'; |
133 | for (auto I : Part) |
134 | dbgs() << ' ' << printReg(I, &TRI); |
135 | dbgs() << " }" ; |
136 | } |
137 | #endif |
138 | |
139 | bool HexagonSplitDoubleRegs::isInduction(unsigned Reg, LoopRegMap &IRM) const { |
140 | for (auto I : IRM) { |
141 | const USet &Rs = I.second; |
142 | if (Rs.find(x: Reg) != Rs.end()) |
143 | return true; |
144 | } |
145 | return false; |
146 | } |
147 | |
148 | bool HexagonSplitDoubleRegs::isVolatileInstr(const MachineInstr *MI) const { |
149 | for (auto &MO : MI->memoperands()) |
150 | if (MO->isVolatile() || MO->isAtomic()) |
151 | return true; |
152 | return false; |
153 | } |
154 | |
155 | bool HexagonSplitDoubleRegs::isFixedInstr(const MachineInstr *MI) const { |
156 | if (MI->mayLoadOrStore()) |
157 | if (MemRefsFixed || isVolatileInstr(MI)) |
158 | return true; |
159 | if (MI->isDebugInstr()) |
160 | return false; |
161 | |
162 | unsigned Opc = MI->getOpcode(); |
163 | switch (Opc) { |
164 | default: |
165 | return true; |
166 | |
167 | case TargetOpcode::PHI: |
168 | case TargetOpcode::COPY: |
169 | break; |
170 | |
171 | case Hexagon::L2_loadrd_io: |
172 | // Not handling stack stores (only reg-based addresses). |
173 | if (MI->getOperand(i: 1).isReg()) |
174 | break; |
175 | return true; |
176 | case Hexagon::S2_storerd_io: |
177 | // Not handling stack stores (only reg-based addresses). |
178 | if (MI->getOperand(i: 0).isReg()) |
179 | break; |
180 | return true; |
181 | case Hexagon::L2_loadrd_pi: |
182 | case Hexagon::S2_storerd_pi: |
183 | |
184 | case Hexagon::A2_tfrpi: |
185 | case Hexagon::A2_combineii: |
186 | case Hexagon::A4_combineir: |
187 | case Hexagon::A4_combineii: |
188 | case Hexagon::A4_combineri: |
189 | case Hexagon::A2_combinew: |
190 | case Hexagon::CONST64: |
191 | |
192 | case Hexagon::A2_sxtw: |
193 | |
194 | case Hexagon::A2_andp: |
195 | case Hexagon::A2_orp: |
196 | case Hexagon::A2_xorp: |
197 | case Hexagon::S2_asl_i_p_or: |
198 | case Hexagon::S2_asl_i_p: |
199 | case Hexagon::S2_asr_i_p: |
200 | case Hexagon::S2_lsr_i_p: |
201 | break; |
202 | } |
203 | |
204 | for (auto &Op : MI->operands()) { |
205 | if (!Op.isReg()) |
206 | continue; |
207 | Register R = Op.getReg(); |
208 | if (!R.isVirtual()) |
209 | return true; |
210 | } |
211 | return false; |
212 | } |
213 | |
214 | void HexagonSplitDoubleRegs::partitionRegisters(UUSetMap &P2Rs) { |
215 | using UUMap = std::map<unsigned, unsigned>; |
216 | using UVect = std::vector<unsigned>; |
217 | |
218 | unsigned NumRegs = MRI->getNumVirtRegs(); |
219 | BitVector DoubleRegs(NumRegs); |
220 | for (unsigned i = 0; i < NumRegs; ++i) { |
221 | Register R = Register::index2VirtReg(Index: i); |
222 | if (MRI->getRegClass(Reg: R) == DoubleRC) |
223 | DoubleRegs.set(i); |
224 | } |
225 | |
226 | BitVector FixedRegs(NumRegs); |
227 | for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(Prev: x)) { |
228 | Register R = Register::index2VirtReg(Index: x); |
229 | MachineInstr *DefI = MRI->getVRegDef(Reg: R); |
230 | // In some cases a register may exist, but never be defined or used. |
231 | // It should never appear anywhere, but mark it as "fixed", just to be |
232 | // safe. |
233 | if (!DefI || isFixedInstr(MI: DefI)) |
234 | FixedRegs.set(x); |
235 | } |
236 | |
237 | UUSetMap AssocMap; |
238 | for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(Prev: x)) { |
239 | if (FixedRegs[x]) |
240 | continue; |
241 | Register R = Register::index2VirtReg(Index: x); |
242 | LLVM_DEBUG(dbgs() << printReg(R, TRI) << " ~~" ); |
243 | USet &Asc = AssocMap[R]; |
244 | for (auto U = MRI->use_nodbg_begin(RegNo: R), Z = MRI->use_nodbg_end(); |
245 | U != Z; ++U) { |
246 | MachineOperand &Op = *U; |
247 | MachineInstr *UseI = Op.getParent(); |
248 | if (isFixedInstr(MI: UseI)) |
249 | continue; |
250 | for (MachineOperand &MO : UseI->operands()) { |
251 | // Skip non-registers or registers with subregisters. |
252 | if (&MO == &Op || !MO.isReg() || MO.getSubReg()) |
253 | continue; |
254 | Register T = MO.getReg(); |
255 | if (!T.isVirtual()) { |
256 | FixedRegs.set(x); |
257 | continue; |
258 | } |
259 | if (MRI->getRegClass(Reg: T) != DoubleRC) |
260 | continue; |
261 | unsigned u = T.virtRegIndex(); |
262 | if (FixedRegs[u]) |
263 | continue; |
264 | LLVM_DEBUG(dbgs() << ' ' << printReg(T, TRI)); |
265 | Asc.insert(x: T); |
266 | // Make it symmetric. |
267 | AssocMap[T].insert(x: R); |
268 | } |
269 | } |
270 | LLVM_DEBUG(dbgs() << '\n'); |
271 | } |
272 | |
273 | UUMap R2P; |
274 | unsigned NextP = 1; |
275 | USet Visited; |
276 | for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(Prev: x)) { |
277 | Register R = Register::index2VirtReg(Index: x); |
278 | if (Visited.count(x: R)) |
279 | continue; |
280 | // Create a new partition for R. |
281 | unsigned ThisP = FixedRegs[x] ? 0 : NextP++; |
282 | UVect WorkQ; |
283 | WorkQ.push_back(x: R); |
284 | for (unsigned i = 0; i < WorkQ.size(); ++i) { |
285 | unsigned T = WorkQ[i]; |
286 | if (Visited.count(x: T)) |
287 | continue; |
288 | R2P[T] = ThisP; |
289 | Visited.insert(x: T); |
290 | // Add all registers associated with T. |
291 | USet &Asc = AssocMap[T]; |
292 | append_range(C&: WorkQ, R&: Asc); |
293 | } |
294 | } |
295 | |
296 | for (auto I : R2P) |
297 | P2Rs[I.second].insert(x: I.first); |
298 | } |
299 | |
300 | static inline int32_t profitImm(unsigned Imm) { |
301 | int32_t P = 0; |
302 | if (Imm == 0 || Imm == 0xFFFFFFFF) |
303 | P += 10; |
304 | return P; |
305 | } |
306 | |
307 | int32_t HexagonSplitDoubleRegs::profit(const MachineInstr *MI) const { |
308 | unsigned ImmX = 0; |
309 | unsigned Opc = MI->getOpcode(); |
310 | switch (Opc) { |
311 | case TargetOpcode::PHI: |
312 | for (const auto &Op : MI->operands()) |
313 | if (!Op.getSubReg()) |
314 | return 0; |
315 | return 10; |
316 | case TargetOpcode::COPY: |
317 | if (MI->getOperand(i: 1).getSubReg() != 0) |
318 | return 10; |
319 | return 0; |
320 | |
321 | case Hexagon::L2_loadrd_io: |
322 | case Hexagon::S2_storerd_io: |
323 | return -1; |
324 | case Hexagon::L2_loadrd_pi: |
325 | case Hexagon::S2_storerd_pi: |
326 | return 2; |
327 | |
328 | case Hexagon::A2_tfrpi: |
329 | case Hexagon::CONST64: { |
330 | uint64_t D = MI->getOperand(i: 1).getImm(); |
331 | unsigned Lo = D & 0xFFFFFFFFULL; |
332 | unsigned Hi = D >> 32; |
333 | return profitImm(Imm: Lo) + profitImm(Imm: Hi); |
334 | } |
335 | case Hexagon::A2_combineii: |
336 | case Hexagon::A4_combineii: { |
337 | const MachineOperand &Op1 = MI->getOperand(i: 1); |
338 | const MachineOperand &Op2 = MI->getOperand(i: 2); |
339 | int32_t Prof1 = Op1.isImm() ? profitImm(Imm: Op1.getImm()) : 0; |
340 | int32_t Prof2 = Op2.isImm() ? profitImm(Imm: Op2.getImm()) : 0; |
341 | return Prof1 + Prof2; |
342 | } |
343 | case Hexagon::A4_combineri: |
344 | ImmX++; |
345 | // Fall through into A4_combineir. |
346 | [[fallthrough]]; |
347 | case Hexagon::A4_combineir: { |
348 | ImmX++; |
349 | const MachineOperand &OpX = MI->getOperand(i: ImmX); |
350 | if (OpX.isImm()) { |
351 | int64_t V = OpX.getImm(); |
352 | if (V == 0 || V == -1) |
353 | return 10; |
354 | } |
355 | // Fall through into A2_combinew. |
356 | [[fallthrough]]; |
357 | } |
358 | case Hexagon::A2_combinew: |
359 | return 2; |
360 | |
361 | case Hexagon::A2_sxtw: |
362 | return 3; |
363 | |
364 | case Hexagon::A2_andp: |
365 | case Hexagon::A2_orp: |
366 | case Hexagon::A2_xorp: { |
367 | Register Rs = MI->getOperand(i: 1).getReg(); |
368 | Register Rt = MI->getOperand(i: 2).getReg(); |
369 | return profit(Reg: Rs) + profit(Reg: Rt); |
370 | } |
371 | |
372 | case Hexagon::S2_asl_i_p_or: { |
373 | unsigned S = MI->getOperand(i: 3).getImm(); |
374 | if (S == 0 || S == 32) |
375 | return 10; |
376 | return -1; |
377 | } |
378 | case Hexagon::S2_asl_i_p: |
379 | case Hexagon::S2_asr_i_p: |
380 | case Hexagon::S2_lsr_i_p: |
381 | unsigned S = MI->getOperand(i: 2).getImm(); |
382 | if (S == 0 || S == 32) |
383 | return 10; |
384 | if (S == 16) |
385 | return 5; |
386 | if (S == 48) |
387 | return 7; |
388 | return -10; |
389 | } |
390 | |
391 | return 0; |
392 | } |
393 | |
394 | int32_t HexagonSplitDoubleRegs::profit(Register Reg) const { |
395 | assert(Reg.isVirtual()); |
396 | |
397 | const MachineInstr *DefI = MRI->getVRegDef(Reg); |
398 | switch (DefI->getOpcode()) { |
399 | case Hexagon::A2_tfrpi: |
400 | case Hexagon::CONST64: |
401 | case Hexagon::A2_combineii: |
402 | case Hexagon::A4_combineii: |
403 | case Hexagon::A4_combineri: |
404 | case Hexagon::A4_combineir: |
405 | case Hexagon::A2_combinew: |
406 | return profit(MI: DefI); |
407 | default: |
408 | break; |
409 | } |
410 | return 0; |
411 | } |
412 | |
413 | bool HexagonSplitDoubleRegs::isProfitable(const USet &Part, LoopRegMap &IRM) |
414 | const { |
415 | unsigned FixedNum = 0, LoopPhiNum = 0; |
416 | int32_t TotalP = 0; |
417 | |
418 | for (unsigned DR : Part) { |
419 | MachineInstr *DefI = MRI->getVRegDef(Reg: DR); |
420 | int32_t P = profit(MI: DefI); |
421 | if (P == std::numeric_limits<int>::min()) |
422 | return false; |
423 | TotalP += P; |
424 | // Reduce the profitability of splitting induction registers. |
425 | if (isInduction(Reg: DR, IRM)) |
426 | TotalP -= 30; |
427 | |
428 | for (auto U = MRI->use_nodbg_begin(RegNo: DR), W = MRI->use_nodbg_end(); |
429 | U != W; ++U) { |
430 | MachineInstr *UseI = U->getParent(); |
431 | if (isFixedInstr(MI: UseI)) { |
432 | FixedNum++; |
433 | // Calculate the cost of generating REG_SEQUENCE instructions. |
434 | for (auto &Op : UseI->operands()) { |
435 | if (Op.isReg() && Part.count(x: Op.getReg())) |
436 | if (Op.getSubReg()) |
437 | TotalP -= 2; |
438 | } |
439 | continue; |
440 | } |
441 | // If a register from this partition is used in a fixed instruction, |
442 | // and there is also a register in this partition that is used in |
443 | // a loop phi node, then decrease the splitting profit as this can |
444 | // confuse the modulo scheduler. |
445 | if (UseI->isPHI()) { |
446 | const MachineBasicBlock *PB = UseI->getParent(); |
447 | const MachineLoop *L = MLI->getLoopFor(BB: PB); |
448 | if (L && L->getHeader() == PB) |
449 | LoopPhiNum++; |
450 | } |
451 | // Splittable instruction. |
452 | int32_t P = profit(MI: UseI); |
453 | if (P == std::numeric_limits<int>::min()) |
454 | return false; |
455 | TotalP += P; |
456 | } |
457 | } |
458 | |
459 | if (FixedNum > 0 && LoopPhiNum > 0) |
460 | TotalP -= 20*LoopPhiNum; |
461 | |
462 | LLVM_DEBUG(dbgs() << "Partition profit: " << TotalP << '\n'); |
463 | if (SplitAll) |
464 | return true; |
465 | return TotalP > 0; |
466 | } |
467 | |
468 | void HexagonSplitDoubleRegs::collectIndRegsForLoop(const MachineLoop *L, |
469 | USet &Rs) { |
470 | const MachineBasicBlock *HB = L->getHeader(); |
471 | const MachineBasicBlock *LB = L->getLoopLatch(); |
472 | if (!HB || !LB) |
473 | return; |
474 | |
475 | // Examine the latch branch. Expect it to be a conditional branch to |
476 | // the header (either "br-cond header" or "br-cond exit; br header"). |
477 | MachineBasicBlock *TB = nullptr, *FB = nullptr; |
478 | MachineBasicBlock *TmpLB = const_cast<MachineBasicBlock*>(LB); |
479 | SmallVector<MachineOperand,2> Cond; |
480 | bool BadLB = TII->analyzeBranch(MBB&: *TmpLB, TBB&: TB, FBB&: FB, Cond, AllowModify: false); |
481 | // Only analyzable conditional branches. HII::analyzeBranch will put |
482 | // the branch opcode as the first element of Cond, and the predicate |
483 | // operand as the second. |
484 | if (BadLB || Cond.size() != 2) |
485 | return; |
486 | // Only simple jump-conditional (with or without negation). |
487 | if (!TII->PredOpcodeHasJMP_c(Opcode: Cond[0].getImm())) |
488 | return; |
489 | // Must go to the header. |
490 | if (TB != HB && FB != HB) |
491 | return; |
492 | assert(Cond[1].isReg() && "Unexpected Cond vector from analyzeBranch" ); |
493 | // Expect a predicate register. |
494 | Register PR = Cond[1].getReg(); |
495 | assert(MRI->getRegClass(PR) == &Hexagon::PredRegsRegClass); |
496 | |
497 | // Get the registers on which the loop controlling compare instruction |
498 | // depends. |
499 | Register CmpR1, CmpR2; |
500 | const MachineInstr *CmpI = MRI->getVRegDef(Reg: PR); |
501 | while (CmpI->getOpcode() == Hexagon::C2_not) |
502 | CmpI = MRI->getVRegDef(Reg: CmpI->getOperand(i: 1).getReg()); |
503 | |
504 | int64_t Mask = 0, Val = 0; |
505 | bool OkCI = TII->analyzeCompare(MI: *CmpI, SrcReg&: CmpR1, SrcReg2&: CmpR2, Mask, Value&: Val); |
506 | if (!OkCI) |
507 | return; |
508 | // Eliminate non-double input registers. |
509 | if (CmpR1 && MRI->getRegClass(Reg: CmpR1) != DoubleRC) |
510 | CmpR1 = 0; |
511 | if (CmpR2 && MRI->getRegClass(Reg: CmpR2) != DoubleRC) |
512 | CmpR2 = 0; |
513 | if (!CmpR1 && !CmpR2) |
514 | return; |
515 | |
516 | // Now examine the top of the loop: the phi nodes that could poten- |
517 | // tially define loop induction registers. The registers defined by |
518 | // such a phi node would be used in a 64-bit add, which then would |
519 | // be used in the loop compare instruction. |
520 | |
521 | // Get the set of all double registers defined by phi nodes in the |
522 | // loop header. |
523 | using UVect = std::vector<unsigned>; |
524 | |
525 | UVect DP; |
526 | for (auto &MI : *HB) { |
527 | if (!MI.isPHI()) |
528 | break; |
529 | const MachineOperand &MD = MI.getOperand(i: 0); |
530 | Register R = MD.getReg(); |
531 | if (MRI->getRegClass(Reg: R) == DoubleRC) |
532 | DP.push_back(x: R); |
533 | } |
534 | if (DP.empty()) |
535 | return; |
536 | |
537 | auto NoIndOp = [this, CmpR1, CmpR2] (unsigned R) -> bool { |
538 | for (auto I = MRI->use_nodbg_begin(RegNo: R), E = MRI->use_nodbg_end(); |
539 | I != E; ++I) { |
540 | const MachineInstr *UseI = I->getParent(); |
541 | if (UseI->getOpcode() != Hexagon::A2_addp) |
542 | continue; |
543 | // Get the output from the add. If it is one of the inputs to the |
544 | // loop-controlling compare instruction, then R is likely an induc- |
545 | // tion register. |
546 | Register T = UseI->getOperand(i: 0).getReg(); |
547 | if (T == CmpR1 || T == CmpR2) |
548 | return false; |
549 | } |
550 | return true; |
551 | }; |
552 | UVect::iterator End = llvm::remove_if(Range&: DP, P: NoIndOp); |
553 | Rs.insert(first: DP.begin(), last: End); |
554 | Rs.insert(x: CmpR1); |
555 | Rs.insert(x: CmpR2); |
556 | |
557 | LLVM_DEBUG({ |
558 | dbgs() << "For loop at " << printMBBReference(*HB) << " ind regs: " ; |
559 | dump_partition(dbgs(), Rs, *TRI); |
560 | dbgs() << '\n'; |
561 | }); |
562 | } |
563 | |
564 | void HexagonSplitDoubleRegs::collectIndRegs(LoopRegMap &IRM) { |
565 | using LoopVector = std::vector<MachineLoop *>; |
566 | |
567 | LoopVector WorkQ; |
568 | |
569 | append_range(C&: WorkQ, R: *MLI); |
570 | for (unsigned i = 0; i < WorkQ.size(); ++i) |
571 | append_range(C&: WorkQ, R&: *WorkQ[i]); |
572 | |
573 | USet Rs; |
574 | for (MachineLoop *L : WorkQ) { |
575 | Rs.clear(); |
576 | collectIndRegsForLoop(L, Rs); |
577 | if (!Rs.empty()) |
578 | IRM.insert(x: std::make_pair(x&: L, y&: Rs)); |
579 | } |
580 | } |
581 | |
582 | void HexagonSplitDoubleRegs::createHalfInstr(unsigned Opc, MachineInstr *MI, |
583 | const UUPairMap &PairMap, unsigned SubR) { |
584 | MachineBasicBlock &B = *MI->getParent(); |
585 | DebugLoc DL = MI->getDebugLoc(); |
586 | MachineInstr *NewI = BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: Opc)); |
587 | |
588 | for (auto &Op : MI->operands()) { |
589 | if (!Op.isReg()) { |
590 | NewI->addOperand(Op); |
591 | continue; |
592 | } |
593 | // For register operands, set the subregister. |
594 | Register R = Op.getReg(); |
595 | unsigned SR = Op.getSubReg(); |
596 | bool isVirtReg = R.isVirtual(); |
597 | bool isKill = Op.isKill(); |
598 | if (isVirtReg && MRI->getRegClass(Reg: R) == DoubleRC) { |
599 | isKill = false; |
600 | UUPairMap::const_iterator F = PairMap.find(x: R); |
601 | if (F == PairMap.end()) { |
602 | SR = SubR; |
603 | } else { |
604 | const UUPair &P = F->second; |
605 | R = (SubR == Hexagon::isub_lo) ? P.first : P.second; |
606 | SR = 0; |
607 | } |
608 | } |
609 | auto CO = MachineOperand::CreateReg(Reg: R, isDef: Op.isDef(), isImp: Op.isImplicit(), isKill, |
610 | isDead: Op.isDead(), isUndef: Op.isUndef(), isEarlyClobber: Op.isEarlyClobber(), SubReg: SR, isDebug: Op.isDebug(), |
611 | isInternalRead: Op.isInternalRead()); |
612 | NewI->addOperand(Op: CO); |
613 | } |
614 | } |
615 | |
616 | void HexagonSplitDoubleRegs::splitMemRef(MachineInstr *MI, |
617 | const UUPairMap &PairMap) { |
618 | bool Load = MI->mayLoad(); |
619 | unsigned OrigOpc = MI->getOpcode(); |
620 | bool PostInc = (OrigOpc == Hexagon::L2_loadrd_pi || |
621 | OrigOpc == Hexagon::S2_storerd_pi); |
622 | MachineInstr *LowI, *HighI; |
623 | MachineBasicBlock &B = *MI->getParent(); |
624 | DebugLoc DL = MI->getDebugLoc(); |
625 | |
626 | // Index of the base-address-register operand. |
627 | unsigned AdrX = PostInc ? (Load ? 2 : 1) |
628 | : (Load ? 1 : 0); |
629 | MachineOperand &AdrOp = MI->getOperand(i: AdrX); |
630 | unsigned RSA = getRegState(RegOp: AdrOp); |
631 | MachineOperand &ValOp = Load ? MI->getOperand(i: 0) |
632 | : (PostInc ? MI->getOperand(i: 3) |
633 | : MI->getOperand(i: 2)); |
634 | UUPairMap::const_iterator F = PairMap.find(x: ValOp.getReg()); |
635 | assert(F != PairMap.end()); |
636 | |
637 | if (Load) { |
638 | const UUPair &P = F->second; |
639 | int64_t Off = PostInc ? 0 : MI->getOperand(i: 2).getImm(); |
640 | LowI = BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: Hexagon::L2_loadri_io), DestReg: P.first) |
641 | .addReg(RegNo: AdrOp.getReg(), flags: RSA & ~RegState::Kill, SubReg: AdrOp.getSubReg()) |
642 | .addImm(Val: Off); |
643 | HighI = BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: Hexagon::L2_loadri_io), DestReg: P.second) |
644 | .addReg(RegNo: AdrOp.getReg(), flags: RSA & ~RegState::Kill, SubReg: AdrOp.getSubReg()) |
645 | .addImm(Val: Off+4); |
646 | } else { |
647 | const UUPair &P = F->second; |
648 | int64_t Off = PostInc ? 0 : MI->getOperand(i: 1).getImm(); |
649 | LowI = BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: Hexagon::S2_storeri_io)) |
650 | .addReg(RegNo: AdrOp.getReg(), flags: RSA & ~RegState::Kill, SubReg: AdrOp.getSubReg()) |
651 | .addImm(Val: Off) |
652 | .addReg(RegNo: P.first); |
653 | HighI = BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: Hexagon::S2_storeri_io)) |
654 | .addReg(RegNo: AdrOp.getReg(), flags: RSA & ~RegState::Kill, SubReg: AdrOp.getSubReg()) |
655 | .addImm(Val: Off+4) |
656 | .addReg(RegNo: P.second); |
657 | } |
658 | |
659 | if (PostInc) { |
660 | // Create the increment of the address register. |
661 | int64_t Inc = Load ? MI->getOperand(i: 3).getImm() |
662 | : MI->getOperand(i: 2).getImm(); |
663 | MachineOperand &UpdOp = Load ? MI->getOperand(i: 1) : MI->getOperand(i: 0); |
664 | const TargetRegisterClass *RC = MRI->getRegClass(Reg: UpdOp.getReg()); |
665 | Register NewR = MRI->createVirtualRegister(RegClass: RC); |
666 | assert(!UpdOp.getSubReg() && "Def operand with subreg" ); |
667 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: Hexagon::A2_addi), DestReg: NewR) |
668 | .addReg(RegNo: AdrOp.getReg(), flags: RSA) |
669 | .addImm(Val: Inc); |
670 | MRI->replaceRegWith(FromReg: UpdOp.getReg(), ToReg: NewR); |
671 | // The original instruction will be deleted later. |
672 | } |
673 | |
674 | // Generate a new pair of memory-operands. |
675 | MachineFunction &MF = *B.getParent(); |
676 | for (auto &MO : MI->memoperands()) { |
677 | const MachinePointerInfo &Ptr = MO->getPointerInfo(); |
678 | MachineMemOperand::Flags F = MO->getFlags(); |
679 | Align A = MO->getAlign(); |
680 | |
681 | auto *Tmp1 = MF.getMachineMemOperand(PtrInfo: Ptr, F, Size: 4 /*size*/, BaseAlignment: A); |
682 | LowI->addMemOperand(MF, MO: Tmp1); |
683 | auto *Tmp2 = |
684 | MF.getMachineMemOperand(PtrInfo: Ptr, F, Size: 4 /*size*/, BaseAlignment: std::min(a: A, b: Align(4))); |
685 | HighI->addMemOperand(MF, MO: Tmp2); |
686 | } |
687 | } |
688 | |
689 | void HexagonSplitDoubleRegs::splitImmediate(MachineInstr *MI, |
690 | const UUPairMap &PairMap) { |
691 | MachineOperand &Op0 = MI->getOperand(i: 0); |
692 | MachineOperand &Op1 = MI->getOperand(i: 1); |
693 | assert(Op0.isReg() && Op1.isImm()); |
694 | uint64_t V = Op1.getImm(); |
695 | |
696 | MachineBasicBlock &B = *MI->getParent(); |
697 | DebugLoc DL = MI->getDebugLoc(); |
698 | UUPairMap::const_iterator F = PairMap.find(x: Op0.getReg()); |
699 | assert(F != PairMap.end()); |
700 | const UUPair &P = F->second; |
701 | |
702 | // The operand to A2_tfrsi can only have 32 significant bits. Immediate |
703 | // values in MachineOperand are stored as 64-bit integers, and so the |
704 | // value -1 may be represented either as 64-bit -1, or 4294967295. Both |
705 | // will have the 32 higher bits truncated in the end, but -1 will remain |
706 | // as -1, while the latter may appear to be a large unsigned value |
707 | // requiring a constant extender. The casting to int32_t will select the |
708 | // former representation. (The same reasoning applies to all 32-bit |
709 | // values.) |
710 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: Hexagon::A2_tfrsi), DestReg: P.first) |
711 | .addImm(Val: int32_t(V & 0xFFFFFFFFULL)); |
712 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: Hexagon::A2_tfrsi), DestReg: P.second) |
713 | .addImm(Val: int32_t(V >> 32)); |
714 | } |
715 | |
716 | void HexagonSplitDoubleRegs::splitCombine(MachineInstr *MI, |
717 | const UUPairMap &PairMap) { |
718 | MachineOperand &Op0 = MI->getOperand(i: 0); |
719 | MachineOperand &Op1 = MI->getOperand(i: 1); |
720 | MachineOperand &Op2 = MI->getOperand(i: 2); |
721 | assert(Op0.isReg()); |
722 | |
723 | MachineBasicBlock &B = *MI->getParent(); |
724 | DebugLoc DL = MI->getDebugLoc(); |
725 | UUPairMap::const_iterator F = PairMap.find(x: Op0.getReg()); |
726 | assert(F != PairMap.end()); |
727 | const UUPair &P = F->second; |
728 | |
729 | if (!Op1.isReg()) { |
730 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: Hexagon::A2_tfrsi), DestReg: P.second) |
731 | .add(MO: Op1); |
732 | } else { |
733 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: TargetOpcode::COPY), DestReg: P.second) |
734 | .addReg(RegNo: Op1.getReg(), flags: getRegState(RegOp: Op1), SubReg: Op1.getSubReg()); |
735 | } |
736 | |
737 | if (!Op2.isReg()) { |
738 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: Hexagon::A2_tfrsi), DestReg: P.first) |
739 | .add(MO: Op2); |
740 | } else { |
741 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: TargetOpcode::COPY), DestReg: P.first) |
742 | .addReg(RegNo: Op2.getReg(), flags: getRegState(RegOp: Op2), SubReg: Op2.getSubReg()); |
743 | } |
744 | } |
745 | |
746 | void HexagonSplitDoubleRegs::splitExt(MachineInstr *MI, |
747 | const UUPairMap &PairMap) { |
748 | MachineOperand &Op0 = MI->getOperand(i: 0); |
749 | MachineOperand &Op1 = MI->getOperand(i: 1); |
750 | assert(Op0.isReg() && Op1.isReg()); |
751 | |
752 | MachineBasicBlock &B = *MI->getParent(); |
753 | DebugLoc DL = MI->getDebugLoc(); |
754 | UUPairMap::const_iterator F = PairMap.find(x: Op0.getReg()); |
755 | assert(F != PairMap.end()); |
756 | const UUPair &P = F->second; |
757 | unsigned RS = getRegState(RegOp: Op1); |
758 | |
759 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: TargetOpcode::COPY), DestReg: P.first) |
760 | .addReg(RegNo: Op1.getReg(), flags: RS & ~RegState::Kill, SubReg: Op1.getSubReg()); |
761 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: Hexagon::S2_asr_i_r), DestReg: P.second) |
762 | .addReg(RegNo: Op1.getReg(), flags: RS, SubReg: Op1.getSubReg()) |
763 | .addImm(Val: 31); |
764 | } |
765 | |
766 | void HexagonSplitDoubleRegs::splitShift(MachineInstr *MI, |
767 | const UUPairMap &PairMap) { |
768 | using namespace Hexagon; |
769 | |
770 | MachineOperand &Op0 = MI->getOperand(i: 0); |
771 | MachineOperand &Op1 = MI->getOperand(i: 1); |
772 | MachineOperand &Op2 = MI->getOperand(i: 2); |
773 | assert(Op0.isReg() && Op1.isReg() && Op2.isImm()); |
774 | int64_t Sh64 = Op2.getImm(); |
775 | assert(Sh64 >= 0 && Sh64 < 64); |
776 | unsigned S = Sh64; |
777 | |
778 | UUPairMap::const_iterator F = PairMap.find(x: Op0.getReg()); |
779 | assert(F != PairMap.end()); |
780 | const UUPair &P = F->second; |
781 | Register LoR = P.first; |
782 | Register HiR = P.second; |
783 | |
784 | unsigned Opc = MI->getOpcode(); |
785 | bool Right = (Opc == S2_lsr_i_p || Opc == S2_asr_i_p); |
786 | bool Left = !Right; |
787 | bool Signed = (Opc == S2_asr_i_p); |
788 | |
789 | MachineBasicBlock &B = *MI->getParent(); |
790 | DebugLoc DL = MI->getDebugLoc(); |
791 | unsigned RS = getRegState(RegOp: Op1); |
792 | unsigned ShiftOpc = Left ? S2_asl_i_r |
793 | : (Signed ? S2_asr_i_r : S2_lsr_i_r); |
794 | unsigned LoSR = isub_lo; |
795 | unsigned HiSR = isub_hi; |
796 | |
797 | if (S == 0) { |
798 | // No shift, subregister copy. |
799 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: TargetOpcode::COPY), DestReg: LoR) |
800 | .addReg(RegNo: Op1.getReg(), flags: RS & ~RegState::Kill, SubReg: LoSR); |
801 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: TargetOpcode::COPY), DestReg: HiR) |
802 | .addReg(RegNo: Op1.getReg(), flags: RS, SubReg: HiSR); |
803 | } else if (S < 32) { |
804 | const TargetRegisterClass *IntRC = &IntRegsRegClass; |
805 | Register TmpR = MRI->createVirtualRegister(RegClass: IntRC); |
806 | // Expansion: |
807 | // Shift left: DR = shl R, #s |
808 | // LoR = shl R.lo, #s |
809 | // TmpR = extractu R.lo, #s, #32-s |
810 | // HiR = or (TmpR, asl(R.hi, #s)) |
811 | // Shift right: DR = shr R, #s |
812 | // HiR = shr R.hi, #s |
813 | // TmpR = shr R.lo, #s |
814 | // LoR = insert TmpR, R.hi, #s, #32-s |
815 | |
816 | // Shift left: |
817 | // LoR = shl R.lo, #s |
818 | // Shift right: |
819 | // TmpR = shr R.lo, #s |
820 | |
821 | // Make a special case for A2_aslh and A2_asrh (they are predicable as |
822 | // opposed to S2_asl_i_r/S2_asr_i_r). |
823 | if (S == 16 && Left) |
824 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: A2_aslh), DestReg: LoR) |
825 | .addReg(RegNo: Op1.getReg(), flags: RS & ~RegState::Kill, SubReg: LoSR); |
826 | else if (S == 16 && Signed) |
827 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: A2_asrh), DestReg: TmpR) |
828 | .addReg(RegNo: Op1.getReg(), flags: RS & ~RegState::Kill, SubReg: LoSR); |
829 | else |
830 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: ShiftOpc), DestReg: (Left ? LoR : TmpR)) |
831 | .addReg(RegNo: Op1.getReg(), flags: RS & ~RegState::Kill, SubReg: LoSR) |
832 | .addImm(Val: S); |
833 | |
834 | if (Left) { |
835 | // TmpR = extractu R.lo, #s, #32-s |
836 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: S2_extractu), DestReg: TmpR) |
837 | .addReg(RegNo: Op1.getReg(), flags: RS & ~RegState::Kill, SubReg: LoSR) |
838 | .addImm(Val: S) |
839 | .addImm(Val: 32-S); |
840 | // HiR = or (TmpR, asl(R.hi, #s)) |
841 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: S2_asl_i_r_or), DestReg: HiR) |
842 | .addReg(RegNo: TmpR) |
843 | .addReg(RegNo: Op1.getReg(), flags: RS, SubReg: HiSR) |
844 | .addImm(Val: S); |
845 | } else { |
846 | // HiR = shr R.hi, #s |
847 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: ShiftOpc), DestReg: HiR) |
848 | .addReg(RegNo: Op1.getReg(), flags: RS & ~RegState::Kill, SubReg: HiSR) |
849 | .addImm(Val: S); |
850 | // LoR = insert TmpR, R.hi, #s, #32-s |
851 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: S2_insert), DestReg: LoR) |
852 | .addReg(RegNo: TmpR) |
853 | .addReg(RegNo: Op1.getReg(), flags: RS, SubReg: HiSR) |
854 | .addImm(Val: S) |
855 | .addImm(Val: 32-S); |
856 | } |
857 | } else if (S == 32) { |
858 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: TargetOpcode::COPY), DestReg: (Left ? HiR : LoR)) |
859 | .addReg(RegNo: Op1.getReg(), flags: RS & ~RegState::Kill, SubReg: (Left ? LoSR : HiSR)); |
860 | if (!Signed) |
861 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: A2_tfrsi), DestReg: (Left ? LoR : HiR)) |
862 | .addImm(Val: 0); |
863 | else // Must be right shift. |
864 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: S2_asr_i_r), DestReg: HiR) |
865 | .addReg(RegNo: Op1.getReg(), flags: RS, SubReg: HiSR) |
866 | .addImm(Val: 31); |
867 | } else if (S < 64) { |
868 | S -= 32; |
869 | if (S == 16 && Left) |
870 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: A2_aslh), DestReg: HiR) |
871 | .addReg(RegNo: Op1.getReg(), flags: RS & ~RegState::Kill, SubReg: LoSR); |
872 | else if (S == 16 && Signed) |
873 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: A2_asrh), DestReg: LoR) |
874 | .addReg(RegNo: Op1.getReg(), flags: RS & ~RegState::Kill, SubReg: HiSR); |
875 | else |
876 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: ShiftOpc), DestReg: (Left ? HiR : LoR)) |
877 | .addReg(RegNo: Op1.getReg(), flags: RS & ~RegState::Kill, SubReg: (Left ? LoSR : HiSR)) |
878 | .addImm(Val: S); |
879 | |
880 | if (Signed) |
881 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: S2_asr_i_r), DestReg: HiR) |
882 | .addReg(RegNo: Op1.getReg(), flags: RS, SubReg: HiSR) |
883 | .addImm(Val: 31); |
884 | else |
885 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: A2_tfrsi), DestReg: (Left ? LoR : HiR)) |
886 | .addImm(Val: 0); |
887 | } |
888 | } |
889 | |
890 | void HexagonSplitDoubleRegs::splitAslOr(MachineInstr *MI, |
891 | const UUPairMap &PairMap) { |
892 | using namespace Hexagon; |
893 | |
894 | MachineOperand &Op0 = MI->getOperand(i: 0); |
895 | MachineOperand &Op1 = MI->getOperand(i: 1); |
896 | MachineOperand &Op2 = MI->getOperand(i: 2); |
897 | MachineOperand &Op3 = MI->getOperand(i: 3); |
898 | assert(Op0.isReg() && Op1.isReg() && Op2.isReg() && Op3.isImm()); |
899 | int64_t Sh64 = Op3.getImm(); |
900 | assert(Sh64 >= 0 && Sh64 < 64); |
901 | unsigned S = Sh64; |
902 | |
903 | UUPairMap::const_iterator F = PairMap.find(x: Op0.getReg()); |
904 | assert(F != PairMap.end()); |
905 | const UUPair &P = F->second; |
906 | unsigned LoR = P.first; |
907 | unsigned HiR = P.second; |
908 | |
909 | MachineBasicBlock &B = *MI->getParent(); |
910 | DebugLoc DL = MI->getDebugLoc(); |
911 | unsigned RS1 = getRegState(RegOp: Op1); |
912 | unsigned RS2 = getRegState(RegOp: Op2); |
913 | const TargetRegisterClass *IntRC = &IntRegsRegClass; |
914 | |
915 | unsigned LoSR = isub_lo; |
916 | unsigned HiSR = isub_hi; |
917 | |
918 | // Op0 = S2_asl_i_p_or Op1, Op2, Op3 |
919 | // means: Op0 = or (Op1, asl(Op2, Op3)) |
920 | |
921 | // Expansion of |
922 | // DR = or (R1, asl(R2, #s)) |
923 | // |
924 | // LoR = or (R1.lo, asl(R2.lo, #s)) |
925 | // Tmp1 = extractu R2.lo, #s, #32-s |
926 | // Tmp2 = or R1.hi, Tmp1 |
927 | // HiR = or (Tmp2, asl(R2.hi, #s)) |
928 | |
929 | if (S == 0) { |
930 | // DR = or (R1, asl(R2, #0)) |
931 | // -> or (R1, R2) |
932 | // i.e. LoR = or R1.lo, R2.lo |
933 | // HiR = or R1.hi, R2.hi |
934 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: A2_or), DestReg: LoR) |
935 | .addReg(RegNo: Op1.getReg(), flags: RS1 & ~RegState::Kill, SubReg: LoSR) |
936 | .addReg(RegNo: Op2.getReg(), flags: RS2 & ~RegState::Kill, SubReg: LoSR); |
937 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: A2_or), DestReg: HiR) |
938 | .addReg(RegNo: Op1.getReg(), flags: RS1, SubReg: HiSR) |
939 | .addReg(RegNo: Op2.getReg(), flags: RS2, SubReg: HiSR); |
940 | } else if (S < 32) { |
941 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: S2_asl_i_r_or), DestReg: LoR) |
942 | .addReg(RegNo: Op1.getReg(), flags: RS1 & ~RegState::Kill, SubReg: LoSR) |
943 | .addReg(RegNo: Op2.getReg(), flags: RS2 & ~RegState::Kill, SubReg: LoSR) |
944 | .addImm(Val: S); |
945 | Register TmpR1 = MRI->createVirtualRegister(RegClass: IntRC); |
946 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: S2_extractu), DestReg: TmpR1) |
947 | .addReg(RegNo: Op2.getReg(), flags: RS2 & ~RegState::Kill, SubReg: LoSR) |
948 | .addImm(Val: S) |
949 | .addImm(Val: 32-S); |
950 | Register TmpR2 = MRI->createVirtualRegister(RegClass: IntRC); |
951 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: A2_or), DestReg: TmpR2) |
952 | .addReg(RegNo: Op1.getReg(), flags: RS1, SubReg: HiSR) |
953 | .addReg(RegNo: TmpR1); |
954 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: S2_asl_i_r_or), DestReg: HiR) |
955 | .addReg(RegNo: TmpR2) |
956 | .addReg(RegNo: Op2.getReg(), flags: RS2, SubReg: HiSR) |
957 | .addImm(Val: S); |
958 | } else if (S == 32) { |
959 | // DR = or (R1, asl(R2, #32)) |
960 | // -> or R1, R2.lo |
961 | // LoR = R1.lo |
962 | // HiR = or R1.hi, R2.lo |
963 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: TargetOpcode::COPY), DestReg: LoR) |
964 | .addReg(RegNo: Op1.getReg(), flags: RS1 & ~RegState::Kill, SubReg: LoSR); |
965 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: A2_or), DestReg: HiR) |
966 | .addReg(RegNo: Op1.getReg(), flags: RS1, SubReg: HiSR) |
967 | .addReg(RegNo: Op2.getReg(), flags: RS2, SubReg: LoSR); |
968 | } else if (S < 64) { |
969 | // DR = or (R1, asl(R2, #s)) |
970 | // |
971 | // LoR = R1:lo |
972 | // HiR = or (R1:hi, asl(R2:lo, #s-32)) |
973 | S -= 32; |
974 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: TargetOpcode::COPY), DestReg: LoR) |
975 | .addReg(RegNo: Op1.getReg(), flags: RS1 & ~RegState::Kill, SubReg: LoSR); |
976 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: S2_asl_i_r_or), DestReg: HiR) |
977 | .addReg(RegNo: Op1.getReg(), flags: RS1, SubReg: HiSR) |
978 | .addReg(RegNo: Op2.getReg(), flags: RS2, SubReg: LoSR) |
979 | .addImm(Val: S); |
980 | } |
981 | } |
982 | |
983 | bool HexagonSplitDoubleRegs::splitInstr(MachineInstr *MI, |
984 | const UUPairMap &PairMap) { |
985 | using namespace Hexagon; |
986 | |
987 | LLVM_DEBUG(dbgs() << "Splitting: " << *MI); |
988 | bool Split = false; |
989 | unsigned Opc = MI->getOpcode(); |
990 | |
991 | switch (Opc) { |
992 | case TargetOpcode::PHI: |
993 | case TargetOpcode::COPY: { |
994 | Register DstR = MI->getOperand(i: 0).getReg(); |
995 | if (MRI->getRegClass(Reg: DstR) == DoubleRC) { |
996 | createHalfInstr(Opc, MI, PairMap, SubR: isub_lo); |
997 | createHalfInstr(Opc, MI, PairMap, SubR: isub_hi); |
998 | Split = true; |
999 | } |
1000 | break; |
1001 | } |
1002 | case A2_andp: |
1003 | createHalfInstr(Opc: A2_and, MI, PairMap, SubR: isub_lo); |
1004 | createHalfInstr(Opc: A2_and, MI, PairMap, SubR: isub_hi); |
1005 | Split = true; |
1006 | break; |
1007 | case A2_orp: |
1008 | createHalfInstr(Opc: A2_or, MI, PairMap, SubR: isub_lo); |
1009 | createHalfInstr(Opc: A2_or, MI, PairMap, SubR: isub_hi); |
1010 | Split = true; |
1011 | break; |
1012 | case A2_xorp: |
1013 | createHalfInstr(Opc: A2_xor, MI, PairMap, SubR: isub_lo); |
1014 | createHalfInstr(Opc: A2_xor, MI, PairMap, SubR: isub_hi); |
1015 | Split = true; |
1016 | break; |
1017 | |
1018 | case L2_loadrd_io: |
1019 | case L2_loadrd_pi: |
1020 | case S2_storerd_io: |
1021 | case S2_storerd_pi: |
1022 | splitMemRef(MI, PairMap); |
1023 | Split = true; |
1024 | break; |
1025 | |
1026 | case A2_tfrpi: |
1027 | case CONST64: |
1028 | splitImmediate(MI, PairMap); |
1029 | Split = true; |
1030 | break; |
1031 | |
1032 | case A2_combineii: |
1033 | case A4_combineir: |
1034 | case A4_combineii: |
1035 | case A4_combineri: |
1036 | case A2_combinew: |
1037 | splitCombine(MI, PairMap); |
1038 | Split = true; |
1039 | break; |
1040 | |
1041 | case A2_sxtw: |
1042 | splitExt(MI, PairMap); |
1043 | Split = true; |
1044 | break; |
1045 | |
1046 | case S2_asl_i_p: |
1047 | case S2_asr_i_p: |
1048 | case S2_lsr_i_p: |
1049 | splitShift(MI, PairMap); |
1050 | Split = true; |
1051 | break; |
1052 | |
1053 | case S2_asl_i_p_or: |
1054 | splitAslOr(MI, PairMap); |
1055 | Split = true; |
1056 | break; |
1057 | |
1058 | default: |
1059 | llvm_unreachable("Instruction not splitable" ); |
1060 | return false; |
1061 | } |
1062 | |
1063 | return Split; |
1064 | } |
1065 | |
1066 | void HexagonSplitDoubleRegs::replaceSubregUses(MachineInstr *MI, |
1067 | const UUPairMap &PairMap) { |
1068 | for (auto &Op : MI->operands()) { |
1069 | if (!Op.isReg() || !Op.isUse() || !Op.getSubReg()) |
1070 | continue; |
1071 | Register R = Op.getReg(); |
1072 | UUPairMap::const_iterator F = PairMap.find(x: R); |
1073 | if (F == PairMap.end()) |
1074 | continue; |
1075 | const UUPair &P = F->second; |
1076 | switch (Op.getSubReg()) { |
1077 | case Hexagon::isub_lo: |
1078 | Op.setReg(P.first); |
1079 | break; |
1080 | case Hexagon::isub_hi: |
1081 | Op.setReg(P.second); |
1082 | break; |
1083 | } |
1084 | Op.setSubReg(0); |
1085 | } |
1086 | } |
1087 | |
1088 | void HexagonSplitDoubleRegs::collapseRegPairs(MachineInstr *MI, |
1089 | const UUPairMap &PairMap) { |
1090 | MachineBasicBlock &B = *MI->getParent(); |
1091 | DebugLoc DL = MI->getDebugLoc(); |
1092 | |
1093 | for (auto &Op : MI->operands()) { |
1094 | if (!Op.isReg() || !Op.isUse()) |
1095 | continue; |
1096 | Register R = Op.getReg(); |
1097 | if (!R.isVirtual()) |
1098 | continue; |
1099 | if (MRI->getRegClass(Reg: R) != DoubleRC || Op.getSubReg()) |
1100 | continue; |
1101 | UUPairMap::const_iterator F = PairMap.find(x: R); |
1102 | if (F == PairMap.end()) |
1103 | continue; |
1104 | const UUPair &Pr = F->second; |
1105 | Register NewDR = MRI->createVirtualRegister(RegClass: DoubleRC); |
1106 | BuildMI(BB&: B, I: MI, MIMD: DL, MCID: TII->get(Opcode: TargetOpcode::REG_SEQUENCE), DestReg: NewDR) |
1107 | .addReg(RegNo: Pr.first) |
1108 | .addImm(Val: Hexagon::isub_lo) |
1109 | .addReg(RegNo: Pr.second) |
1110 | .addImm(Val: Hexagon::isub_hi); |
1111 | Op.setReg(NewDR); |
1112 | } |
1113 | } |
1114 | |
1115 | bool HexagonSplitDoubleRegs::splitPartition(const USet &Part) { |
1116 | using MISet = std::set<MachineInstr *>; |
1117 | |
1118 | const TargetRegisterClass *IntRC = &Hexagon::IntRegsRegClass; |
1119 | bool Changed = false; |
1120 | |
1121 | LLVM_DEBUG(dbgs() << "Splitting partition: " ; |
1122 | dump_partition(dbgs(), Part, *TRI); dbgs() << '\n'); |
1123 | |
1124 | UUPairMap PairMap; |
1125 | |
1126 | MISet SplitIns; |
1127 | for (unsigned DR : Part) { |
1128 | MachineInstr *DefI = MRI->getVRegDef(Reg: DR); |
1129 | SplitIns.insert(x: DefI); |
1130 | |
1131 | // Collect all instructions, including fixed ones. We won't split them, |
1132 | // but we need to visit them again to insert the REG_SEQUENCE instructions. |
1133 | for (auto U = MRI->use_nodbg_begin(RegNo: DR), W = MRI->use_nodbg_end(); |
1134 | U != W; ++U) |
1135 | SplitIns.insert(x: U->getParent()); |
1136 | |
1137 | Register LoR = MRI->createVirtualRegister(RegClass: IntRC); |
1138 | Register HiR = MRI->createVirtualRegister(RegClass: IntRC); |
1139 | LLVM_DEBUG(dbgs() << "Created mapping: " << printReg(DR, TRI) << " -> " |
1140 | << printReg(HiR, TRI) << ':' << printReg(LoR, TRI) |
1141 | << '\n'); |
1142 | PairMap.insert(x: std::make_pair(x&: DR, y: UUPair(LoR, HiR))); |
1143 | } |
1144 | |
1145 | MISet Erase; |
1146 | for (auto *MI : SplitIns) { |
1147 | if (isFixedInstr(MI)) { |
1148 | collapseRegPairs(MI, PairMap); |
1149 | } else { |
1150 | bool Done = splitInstr(MI, PairMap); |
1151 | if (Done) |
1152 | Erase.insert(x: MI); |
1153 | Changed |= Done; |
1154 | } |
1155 | } |
1156 | |
1157 | for (unsigned DR : Part) { |
1158 | // Before erasing "double" instructions, revisit all uses of the double |
1159 | // registers in this partition, and replace all uses of them with subre- |
1160 | // gisters, with the corresponding single registers. |
1161 | MISet Uses; |
1162 | for (auto U = MRI->use_nodbg_begin(RegNo: DR), W = MRI->use_nodbg_end(); |
1163 | U != W; ++U) |
1164 | Uses.insert(x: U->getParent()); |
1165 | for (auto *M : Uses) |
1166 | replaceSubregUses(MI: M, PairMap); |
1167 | } |
1168 | |
1169 | for (auto *MI : Erase) { |
1170 | MachineBasicBlock *B = MI->getParent(); |
1171 | B->erase(I: MI); |
1172 | } |
1173 | |
1174 | return Changed; |
1175 | } |
1176 | |
1177 | bool HexagonSplitDoubleRegs::runOnMachineFunction(MachineFunction &MF) { |
1178 | if (skipFunction(F: MF.getFunction())) |
1179 | return false; |
1180 | |
1181 | LLVM_DEBUG(dbgs() << "Splitting double registers in function: " |
1182 | << MF.getName() << '\n'); |
1183 | |
1184 | auto &ST = MF.getSubtarget<HexagonSubtarget>(); |
1185 | TRI = ST.getRegisterInfo(); |
1186 | TII = ST.getInstrInfo(); |
1187 | MRI = &MF.getRegInfo(); |
1188 | MLI = &getAnalysis<MachineLoopInfoWrapperPass>().getLI(); |
1189 | |
1190 | UUSetMap P2Rs; |
1191 | LoopRegMap IRM; |
1192 | |
1193 | collectIndRegs(IRM); |
1194 | partitionRegisters(P2Rs); |
1195 | |
1196 | LLVM_DEBUG({ |
1197 | dbgs() << "Register partitioning: (partition #0 is fixed)\n" ; |
1198 | for (UUSetMap::iterator I = P2Rs.begin(), E = P2Rs.end(); I != E; ++I) { |
1199 | dbgs() << '#' << I->first << " -> " ; |
1200 | dump_partition(dbgs(), I->second, *TRI); |
1201 | dbgs() << '\n'; |
1202 | } |
1203 | }); |
1204 | |
1205 | bool Changed = false; |
1206 | int Limit = MaxHSDR; |
1207 | |
1208 | for (UUSetMap::iterator I = P2Rs.begin(), E = P2Rs.end(); I != E; ++I) { |
1209 | if (I->first == 0) |
1210 | continue; |
1211 | if (Limit >= 0 && Counter >= Limit) |
1212 | break; |
1213 | USet &Part = I->second; |
1214 | LLVM_DEBUG(dbgs() << "Calculating profit for partition #" << I->first |
1215 | << '\n'); |
1216 | if (!isProfitable(Part, IRM)) |
1217 | continue; |
1218 | Counter++; |
1219 | Changed |= splitPartition(Part); |
1220 | } |
1221 | |
1222 | return Changed; |
1223 | } |
1224 | |
1225 | FunctionPass *llvm::createHexagonSplitDoubleRegs() { |
1226 | return new HexagonSplitDoubleRegs(); |
1227 | } |
1228 | |