121
|
1 //===- HexagonExpandCondsets.cpp ------------------------------------------===//
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
2 //
|
147
|
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
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
6 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
7 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
8
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
9 // Replace mux instructions with the corresponding legal instructions.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
10 // It is meant to work post-SSA, but still on virtual registers. It was
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
11 // originally placed between register coalescing and machine instruction
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
12 // scheduler.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
13 // In this place in the optimization sequence, live interval analysis had
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
14 // been performed, and the live intervals should be preserved. A large part
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
15 // of the code deals with preserving the liveness information.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
16 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
17 // Liveness tracking aside, the main functionality of this pass is divided
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
18 // into two steps. The first step is to replace an instruction
|
134
|
19 // %0 = C2_mux %1, %2, %3
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
20 // with a pair of conditional transfers
|
134
|
21 // %0 = A2_tfrt %1, %2
|
|
22 // %0 = A2_tfrf %1, %3
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
23 // It is the intention that the execution of this pass could be terminated
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
24 // after this step, and the code generated would be functionally correct.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
25 //
|
134
|
26 // If the uses of the source values %1 and %2 are kills, and their
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
27 // definitions are predicable, then in the second step, the conditional
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
28 // transfers will then be rewritten as predicated instructions. E.g.
|
134
|
29 // %0 = A2_or %1, %2
|
|
30 // %3 = A2_tfrt %99, killed %0
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
31 // will be rewritten as
|
134
|
32 // %3 = A2_port %99, %1, %2
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
33 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
34 // This replacement has two variants: "up" and "down". Consider this case:
|
134
|
35 // %0 = A2_or %1, %2
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
36 // ... [intervening instructions] ...
|
134
|
37 // %3 = A2_tfrt %99, killed %0
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
38 // variant "up":
|
134
|
39 // %3 = A2_port %99, %1, %2
|
|
40 // ... [intervening instructions, %0->vreg3] ...
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
41 // [deleted]
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
42 // variant "down":
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
43 // [deleted]
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
44 // ... [intervening instructions] ...
|
134
|
45 // %3 = A2_port %99, %1, %2
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
46 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
47 // Both, one or none of these variants may be valid, and checks are made
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
48 // to rule out inapplicable variants.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
49 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
50 // As an additional optimization, before either of the two steps above is
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
51 // executed, the pass attempts to coalesce the target register with one of
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
52 // the source registers, e.g. given an instruction
|
134
|
53 // %3 = C2_mux %0, %1, %2
|
|
54 // %3 will be coalesced with either %1 or %2. If this succeeds,
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
55 // the instruction would then be (for example)
|
134
|
56 // %3 = C2_mux %0, %3, %2
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
57 // and, under certain circumstances, this could result in only one predicated
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
58 // instruction:
|
134
|
59 // %3 = A2_tfrf %0, %2
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
60 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
61
|
120
|
62 // Splitting a definition of a register into two predicated transfers
|
|
63 // creates a complication in liveness tracking. Live interval computation
|
|
64 // will see both instructions as actual definitions, and will mark the
|
|
65 // first one as dead. The definition is not actually dead, and this
|
|
66 // situation will need to be fixed. For example:
|
134
|
67 // dead %1 = A2_tfrt ... ; marked as dead
|
|
68 // %1 = A2_tfrf ...
|
120
|
69 //
|
|
70 // Since any of the individual predicated transfers may end up getting
|
|
71 // removed (in case it is an identity copy), some pre-existing def may
|
|
72 // be marked as dead after live interval recomputation:
|
134
|
73 // dead %1 = ... ; marked as dead
|
120
|
74 // ...
|
134
|
75 // %1 = A2_tfrf ... ; if A2_tfrt is removed
|
|
76 // This case happens if %1 was used as a source in A2_tfrt, which means
|
120
|
77 // that is it actually live at the A2_tfrf, and so the now dead definition
|
134
|
78 // of %1 will need to be updated to non-dead at some point.
|
120
|
79 //
|
|
80 // This issue could be remedied by adding implicit uses to the predicated
|
|
81 // transfers, but this will create a problem with subsequent predication,
|
|
82 // since the transfers will no longer be possible to reorder. To avoid
|
|
83 // that, the initial splitting will not add any implicit uses. These
|
|
84 // implicit uses will be added later, after predication. The extra price,
|
|
85 // however, is that finding the locations where the implicit uses need
|
|
86 // to be added, and updating the live ranges will be more involved.
|
|
87
|
121
|
88 #include "HexagonInstrInfo.h"
|
|
89 #include "HexagonRegisterInfo.h"
|
|
90 #include "llvm/ADT/DenseMap.h"
|
120
|
91 #include "llvm/ADT/SetVector.h"
|
121
|
92 #include "llvm/ADT/SmallVector.h"
|
|
93 #include "llvm/ADT/StringRef.h"
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
94 #include "llvm/CodeGen/LiveInterval.h"
|
134
|
95 #include "llvm/CodeGen/LiveIntervals.h"
|
121
|
96 #include "llvm/CodeGen/MachineBasicBlock.h"
|
120
|
97 #include "llvm/CodeGen/MachineDominators.h"
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
98 #include "llvm/CodeGen/MachineFunction.h"
|
121
|
99 #include "llvm/CodeGen/MachineFunctionPass.h"
|
|
100 #include "llvm/CodeGen/MachineInstr.h"
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
101 #include "llvm/CodeGen/MachineInstrBuilder.h"
|
121
|
102 #include "llvm/CodeGen/MachineOperand.h"
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
103 #include "llvm/CodeGen/MachineRegisterInfo.h"
|
121
|
104 #include "llvm/CodeGen/SlotIndexes.h"
|
134
|
105 #include "llvm/CodeGen/TargetRegisterInfo.h"
|
|
106 #include "llvm/CodeGen/TargetSubtargetInfo.h"
|
121
|
107 #include "llvm/IR/DebugLoc.h"
|
|
108 #include "llvm/IR/Function.h"
|
|
109 #include "llvm/MC/LaneBitmask.h"
|
|
110 #include "llvm/Pass.h"
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
111 #include "llvm/Support/CommandLine.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
112 #include "llvm/Support/Debug.h"
|
121
|
113 #include "llvm/Support/ErrorHandling.h"
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
114 #include "llvm/Support/raw_ostream.h"
|
121
|
115 #include <cassert>
|
120
|
116 #include <iterator>
|
|
117 #include <set>
|
|
118 #include <utility>
|
|
119
|
121
|
120 #define DEBUG_TYPE "expand-condsets"
|
|
121
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
122 using namespace llvm;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
123
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
124 static cl::opt<unsigned> OptTfrLimit("expand-condsets-tfr-limit",
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
125 cl::init(~0U), cl::Hidden, cl::desc("Max number of mux expansions"));
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
126 static cl::opt<unsigned> OptCoaLimit("expand-condsets-coa-limit",
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
127 cl::init(~0U), cl::Hidden, cl::desc("Max number of segment coalescings"));
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
128
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
129 namespace llvm {
|
121
|
130
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
131 void initializeHexagonExpandCondsetsPass(PassRegistry&);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
132 FunctionPass *createHexagonExpandCondsets();
|
121
|
133
|
|
134 } // end namespace llvm
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
135
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
136 namespace {
|
121
|
137
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
138 class HexagonExpandCondsets : public MachineFunctionPass {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
139 public:
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
140 static char ID;
|
121
|
141
|
|
142 HexagonExpandCondsets() : MachineFunctionPass(ID) {
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
143 if (OptCoaLimit.getPosition())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
144 CoaLimitActive = true, CoaLimit = OptCoaLimit;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
145 if (OptTfrLimit.getPosition())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
146 TfrLimitActive = true, TfrLimit = OptTfrLimit;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
147 initializeHexagonExpandCondsetsPass(*PassRegistry::getPassRegistry());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
148 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
149
|
120
|
150 StringRef getPassName() const override { return "Hexagon Expand Condsets"; }
|
121
|
151
|
120
|
152 void getAnalysisUsage(AnalysisUsage &AU) const override {
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
153 AU.addRequired<LiveIntervals>();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
154 AU.addPreserved<LiveIntervals>();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
155 AU.addPreserved<SlotIndexes>();
|
120
|
156 AU.addRequired<MachineDominatorTree>();
|
|
157 AU.addPreserved<MachineDominatorTree>();
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
158 MachineFunctionPass::getAnalysisUsage(AU);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
159 }
|
121
|
160
|
120
|
161 bool runOnMachineFunction(MachineFunction &MF) override;
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
162
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
163 private:
|
121
|
164 const HexagonInstrInfo *HII = nullptr;
|
|
165 const TargetRegisterInfo *TRI = nullptr;
|
120
|
166 MachineDominatorTree *MDT;
|
121
|
167 MachineRegisterInfo *MRI = nullptr;
|
|
168 LiveIntervals *LIS = nullptr;
|
|
169 bool CoaLimitActive = false;
|
|
170 bool TfrLimitActive = false;
|
|
171 unsigned CoaLimit;
|
|
172 unsigned TfrLimit;
|
|
173 unsigned CoaCounter = 0;
|
|
174 unsigned TfrCounter = 0;
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
175
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
176 struct RegisterRef {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
177 RegisterRef(const MachineOperand &Op) : Reg(Op.getReg()),
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
178 Sub(Op.getSubReg()) {}
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
179 RegisterRef(unsigned R = 0, unsigned S = 0) : Reg(R), Sub(S) {}
|
121
|
180
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
181 bool operator== (RegisterRef RR) const {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
182 return Reg == RR.Reg && Sub == RR.Sub;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
183 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
184 bool operator!= (RegisterRef RR) const { return !operator==(RR); }
|
120
|
185 bool operator< (RegisterRef RR) const {
|
|
186 return Reg < RR.Reg || (Reg == RR.Reg && Sub < RR.Sub);
|
|
187 }
|
121
|
188
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
189 unsigned Reg, Sub;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
190 };
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
191
|
121
|
192 using ReferenceMap = DenseMap<unsigned, unsigned>;
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
193 enum { Sub_Low = 0x1, Sub_High = 0x2, Sub_None = (Sub_Low | Sub_High) };
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
194 enum { Exec_Then = 0x10, Exec_Else = 0x20 };
|
121
|
195
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
196 unsigned getMaskForSub(unsigned Sub);
|
120
|
197 bool isCondset(const MachineInstr &MI);
|
|
198 LaneBitmask getLaneMask(unsigned Reg, unsigned Sub);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
199
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
200 void addRefToMap(RegisterRef RR, ReferenceMap &Map, unsigned Exec);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
201 bool isRefInMap(RegisterRef, ReferenceMap &Map, unsigned Exec);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
202
|
120
|
203 void updateDeadsInRange(unsigned Reg, LaneBitmask LM, LiveRange &Range);
|
|
204 void updateKillFlags(unsigned Reg);
|
|
205 void updateDeadFlags(unsigned Reg);
|
|
206 void recalculateLiveInterval(unsigned Reg);
|
|
207 void removeInstr(MachineInstr &MI);
|
|
208 void updateLiveness(std::set<unsigned> &RegSet, bool Recalc,
|
|
209 bool UpdateKills, bool UpdateDeads);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
210
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
211 unsigned getCondTfrOpcode(const MachineOperand &SO, bool Cond);
|
120
|
212 MachineInstr *genCondTfrFor(MachineOperand &SrcOp,
|
|
213 MachineBasicBlock::iterator At, unsigned DstR,
|
|
214 unsigned DstSR, const MachineOperand &PredOp, bool PredSense,
|
|
215 bool ReadUndef, bool ImpUse);
|
|
216 bool split(MachineInstr &MI, std::set<unsigned> &UpdRegs);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
217
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
218 bool isPredicable(MachineInstr *MI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
219 MachineInstr *getReachingDefForPred(RegisterRef RD,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
220 MachineBasicBlock::iterator UseIt, unsigned PredR, bool Cond);
|
120
|
221 bool canMoveOver(MachineInstr &MI, ReferenceMap &Defs, ReferenceMap &Uses);
|
|
222 bool canMoveMemTo(MachineInstr &MI, MachineInstr &ToI, bool IsDown);
|
|
223 void predicateAt(const MachineOperand &DefOp, MachineInstr &MI,
|
|
224 MachineBasicBlock::iterator Where,
|
|
225 const MachineOperand &PredOp, bool Cond,
|
|
226 std::set<unsigned> &UpdRegs);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
227 void renameInRange(RegisterRef RO, RegisterRef RN, unsigned PredR,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
228 bool Cond, MachineBasicBlock::iterator First,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
229 MachineBasicBlock::iterator Last);
|
120
|
230 bool predicate(MachineInstr &TfrI, bool Cond, std::set<unsigned> &UpdRegs);
|
|
231 bool predicateInBlock(MachineBasicBlock &B,
|
|
232 std::set<unsigned> &UpdRegs);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
233
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
234 bool isIntReg(RegisterRef RR, unsigned &BW);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
235 bool isIntraBlocks(LiveInterval &LI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
236 bool coalesceRegisters(RegisterRef R1, RegisterRef R2);
|
120
|
237 bool coalesceSegments(const SmallVectorImpl<MachineInstr*> &Condsets,
|
|
238 std::set<unsigned> &UpdRegs);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
239 };
|
121
|
240
|
|
241 } // end anonymous namespace
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
242
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
243 char HexagonExpandCondsets::ID = 0;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
244
|
120
|
245 namespace llvm {
|
121
|
246
|
120
|
247 char &HexagonExpandCondsetsID = HexagonExpandCondsets::ID;
|
121
|
248
|
|
249 } // end namespace llvm
|
120
|
250
|
|
251 INITIALIZE_PASS_BEGIN(HexagonExpandCondsets, "expand-condsets",
|
|
252 "Hexagon Expand Condsets", false, false)
|
|
253 INITIALIZE_PASS_DEPENDENCY(MachineDominatorTree)
|
|
254 INITIALIZE_PASS_DEPENDENCY(SlotIndexes)
|
|
255 INITIALIZE_PASS_DEPENDENCY(LiveIntervals)
|
|
256 INITIALIZE_PASS_END(HexagonExpandCondsets, "expand-condsets",
|
|
257 "Hexagon Expand Condsets", false, false)
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
258
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
259 unsigned HexagonExpandCondsets::getMaskForSub(unsigned Sub) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
260 switch (Sub) {
|
120
|
261 case Hexagon::isub_lo:
|
|
262 case Hexagon::vsub_lo:
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
263 return Sub_Low;
|
120
|
264 case Hexagon::isub_hi:
|
|
265 case Hexagon::vsub_hi:
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
266 return Sub_High;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
267 case Hexagon::NoSubRegister:
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
268 return Sub_None;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
269 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
270 llvm_unreachable("Invalid subregister");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
271 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
272
|
120
|
273 bool HexagonExpandCondsets::isCondset(const MachineInstr &MI) {
|
|
274 unsigned Opc = MI.getOpcode();
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
275 switch (Opc) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
276 case Hexagon::C2_mux:
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
277 case Hexagon::C2_muxii:
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
278 case Hexagon::C2_muxir:
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
279 case Hexagon::C2_muxri:
|
120
|
280 case Hexagon::PS_pselect:
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
281 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
282 break;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
283 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
284 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
285 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
286
|
120
|
287 LaneBitmask HexagonExpandCondsets::getLaneMask(unsigned Reg, unsigned Sub) {
|
147
|
288 assert(Register::isVirtualRegister(Reg));
|
120
|
289 return Sub != 0 ? TRI->getSubRegIndexLaneMask(Sub)
|
|
290 : MRI->getMaxLaneMaskForVReg(Reg);
|
|
291 }
|
|
292
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
293 void HexagonExpandCondsets::addRefToMap(RegisterRef RR, ReferenceMap &Map,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
294 unsigned Exec) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
295 unsigned Mask = getMaskForSub(RR.Sub) | Exec;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
296 ReferenceMap::iterator F = Map.find(RR.Reg);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
297 if (F == Map.end())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
298 Map.insert(std::make_pair(RR.Reg, Mask));
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
299 else
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
300 F->second |= Mask;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
301 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
302
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
303 bool HexagonExpandCondsets::isRefInMap(RegisterRef RR, ReferenceMap &Map,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
304 unsigned Exec) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
305 ReferenceMap::iterator F = Map.find(RR.Reg);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
306 if (F == Map.end())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
307 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
308 unsigned Mask = getMaskForSub(RR.Sub) | Exec;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
309 if (Mask & F->second)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
310 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
311 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
312 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
313
|
120
|
314 void HexagonExpandCondsets::updateKillFlags(unsigned Reg) {
|
|
315 auto KillAt = [this,Reg] (SlotIndex K, LaneBitmask LM) -> void {
|
|
316 // Set the <kill> flag on a use of Reg whose lane mask is contained in LM.
|
|
317 MachineInstr *MI = LIS->getInstructionFromIndex(K);
|
147
|
318 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
|
|
319 MachineOperand &Op = MI->getOperand(i);
|
|
320 if (!Op.isReg() || !Op.isUse() || Op.getReg() != Reg ||
|
|
321 MI->isRegTiedToDefOperand(i))
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
322 continue;
|
120
|
323 LaneBitmask SLM = getLaneMask(Reg, Op.getSubReg());
|
|
324 if ((SLM & LM) == SLM) {
|
|
325 // Only set the kill flag on the first encountered use of Reg in this
|
|
326 // instruction.
|
|
327 Op.setIsKill(true);
|
|
328 break;
|
|
329 }
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
330 }
|
120
|
331 };
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
332
|
120
|
333 LiveInterval &LI = LIS->getInterval(Reg);
|
|
334 for (auto I = LI.begin(), E = LI.end(); I != E; ++I) {
|
|
335 if (!I->end.isRegister())
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
336 continue;
|
120
|
337 // Do not mark the end of the segment as <kill>, if the next segment
|
|
338 // starts with a predicated instruction.
|
|
339 auto NextI = std::next(I);
|
|
340 if (NextI != E && NextI->start.isRegister()) {
|
|
341 MachineInstr *DefI = LIS->getInstructionFromIndex(NextI->start);
|
|
342 if (HII->isPredicated(*DefI))
|
|
343 continue;
|
|
344 }
|
|
345 bool WholeReg = true;
|
|
346 if (LI.hasSubRanges()) {
|
|
347 auto EndsAtI = [I] (LiveInterval::SubRange &S) -> bool {
|
|
348 LiveRange::iterator F = S.find(I->end);
|
|
349 return F != S.end() && I->end == F->end;
|
|
350 };
|
|
351 // Check if all subranges end at I->end. If so, make sure to kill
|
|
352 // the whole register.
|
|
353 for (LiveInterval::SubRange &S : LI.subranges()) {
|
|
354 if (EndsAtI(S))
|
|
355 KillAt(I->end, S.LaneMask);
|
|
356 else
|
|
357 WholeReg = false;
|
|
358 }
|
|
359 }
|
|
360 if (WholeReg)
|
|
361 KillAt(I->end, MRI->getMaxLaneMaskForVReg(Reg));
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
362 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
363 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
364
|
120
|
365 void HexagonExpandCondsets::updateDeadsInRange(unsigned Reg, LaneBitmask LM,
|
|
366 LiveRange &Range) {
|
147
|
367 assert(Register::isVirtualRegister(Reg));
|
120
|
368 if (Range.empty())
|
|
369 return;
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
370
|
121
|
371 // Return two booleans: { def-modifes-reg, def-covers-reg }.
|
|
372 auto IsRegDef = [this,Reg,LM] (MachineOperand &Op) -> std::pair<bool,bool> {
|
120
|
373 if (!Op.isReg() || !Op.isDef())
|
121
|
374 return { false, false };
|
120
|
375 unsigned DR = Op.getReg(), DSR = Op.getSubReg();
|
147
|
376 if (!Register::isVirtualRegister(DR) || DR != Reg)
|
121
|
377 return { false, false };
|
120
|
378 LaneBitmask SLM = getLaneMask(DR, DSR);
|
121
|
379 LaneBitmask A = SLM & LM;
|
|
380 return { A.any(), A == SLM };
|
120
|
381 };
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
382
|
120
|
383 // The splitting step will create pairs of predicated definitions without
|
|
384 // any implicit uses (since implicit uses would interfere with predication).
|
|
385 // This can cause the reaching defs to become dead after live range
|
|
386 // recomputation, even though they are not really dead.
|
|
387 // We need to identify predicated defs that need implicit uses, and
|
|
388 // dead defs that are not really dead, and correct both problems.
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
389
|
120
|
390 auto Dominate = [this] (SetVector<MachineBasicBlock*> &Defs,
|
|
391 MachineBasicBlock *Dest) -> bool {
|
|
392 for (MachineBasicBlock *D : Defs)
|
|
393 if (D != Dest && MDT->dominates(D, Dest))
|
|
394 return true;
|
|
395
|
|
396 MachineBasicBlock *Entry = &Dest->getParent()->front();
|
|
397 SetVector<MachineBasicBlock*> Work(Dest->pred_begin(), Dest->pred_end());
|
|
398 for (unsigned i = 0; i < Work.size(); ++i) {
|
|
399 MachineBasicBlock *B = Work[i];
|
|
400 if (Defs.count(B))
|
|
401 continue;
|
|
402 if (B == Entry)
|
|
403 return false;
|
|
404 for (auto *P : B->predecessors())
|
|
405 Work.insert(P);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
406 }
|
120
|
407 return true;
|
|
408 };
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
409
|
120
|
410 // First, try to extend live range within individual basic blocks. This
|
|
411 // will leave us only with dead defs that do not reach any predicated
|
|
412 // defs in the same block.
|
|
413 SetVector<MachineBasicBlock*> Defs;
|
|
414 SmallVector<SlotIndex,4> PredDefs;
|
|
415 for (auto &Seg : Range) {
|
|
416 if (!Seg.start.isRegister())
|
|
417 continue;
|
|
418 MachineInstr *DefI = LIS->getInstructionFromIndex(Seg.start);
|
|
419 Defs.insert(DefI->getParent());
|
|
420 if (HII->isPredicated(*DefI))
|
|
421 PredDefs.push_back(Seg.start);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
422 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
423
|
120
|
424 SmallVector<SlotIndex,8> Undefs;
|
|
425 LiveInterval &LI = LIS->getInterval(Reg);
|
|
426 LI.computeSubRangeUndefs(Undefs, LM, *MRI, *LIS->getSlotIndexes());
|
|
427
|
|
428 for (auto &SI : PredDefs) {
|
|
429 MachineBasicBlock *BB = LIS->getMBBFromIndex(SI);
|
|
430 auto P = Range.extendInBlock(Undefs, LIS->getMBBStartIdx(BB), SI);
|
|
431 if (P.first != nullptr || P.second)
|
|
432 SI = SlotIndex();
|
|
433 }
|
|
434
|
|
435 // Calculate reachability for those predicated defs that were not handled
|
|
436 // by the in-block extension.
|
|
437 SmallVector<SlotIndex,4> ExtTo;
|
|
438 for (auto &SI : PredDefs) {
|
|
439 if (!SI.isValid())
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
440 continue;
|
120
|
441 MachineBasicBlock *BB = LIS->getMBBFromIndex(SI);
|
|
442 if (BB->pred_empty())
|
|
443 continue;
|
|
444 // If the defs from this range reach SI via all predecessors, it is live.
|
|
445 // It can happen that SI is reached by the defs through some paths, but
|
|
446 // not all. In the IR coming into this optimization, SI would not be
|
|
447 // considered live, since the defs would then not jointly dominate SI.
|
|
448 // That means that SI is an overwriting def, and no implicit use is
|
|
449 // needed at this point. Do not add SI to the extension points, since
|
|
450 // extendToIndices will abort if there is no joint dominance.
|
|
451 // If the abort was avoided by adding extra undefs added to Undefs,
|
|
452 // extendToIndices could actually indicate that SI is live, contrary
|
|
453 // to the original IR.
|
|
454 if (Dominate(Defs, BB))
|
|
455 ExtTo.push_back(SI);
|
|
456 }
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
457
|
120
|
458 if (!ExtTo.empty())
|
|
459 LIS->extendToIndices(Range, ExtTo, Undefs);
|
|
460
|
|
461 // Remove <dead> flags from all defs that are not dead after live range
|
|
462 // extension, and collect all def operands. They will be used to generate
|
|
463 // the necessary implicit uses.
|
121
|
464 // At the same time, add <dead> flag to all defs that are actually dead.
|
|
465 // This can happen, for example, when a mux with identical inputs is
|
|
466 // replaced with a COPY: the use of the predicate register disappears and
|
|
467 // the dead can become dead.
|
120
|
468 std::set<RegisterRef> DefRegs;
|
|
469 for (auto &Seg : Range) {
|
|
470 if (!Seg.start.isRegister())
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
471 continue;
|
120
|
472 MachineInstr *DefI = LIS->getInstructionFromIndex(Seg.start);
|
|
473 for (auto &Op : DefI->operands()) {
|
121
|
474 auto P = IsRegDef(Op);
|
|
475 if (P.second && Seg.end.isDead()) {
|
|
476 Op.setIsDead(true);
|
|
477 } else if (P.first) {
|
|
478 DefRegs.insert(Op);
|
|
479 Op.setIsDead(false);
|
|
480 }
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
481 }
|
120
|
482 }
|
|
483
|
121
|
484 // Now, add implicit uses to each predicated def that is reached
|
120
|
485 // by other defs.
|
|
486 for (auto &Seg : Range) {
|
|
487 if (!Seg.start.isRegister() || !Range.liveAt(Seg.start.getPrevSlot()))
|
|
488 continue;
|
|
489 MachineInstr *DefI = LIS->getInstructionFromIndex(Seg.start);
|
|
490 if (!HII->isPredicated(*DefI))
|
|
491 continue;
|
|
492 // Construct the set of all necessary implicit uses, based on the def
|
121
|
493 // operands in the instruction. We need to tie the implicit uses to
|
|
494 // the corresponding defs.
|
|
495 std::map<RegisterRef,unsigned> ImpUses;
|
|
496 for (unsigned i = 0, e = DefI->getNumOperands(); i != e; ++i) {
|
|
497 MachineOperand &Op = DefI->getOperand(i);
|
|
498 if (!Op.isReg() || !DefRegs.count(Op))
|
|
499 continue;
|
|
500 if (Op.isDef()) {
|
147
|
501 // Tied defs will always have corresponding uses, so no extra
|
|
502 // implicit uses are needed.
|
|
503 if (!Op.isTied())
|
|
504 ImpUses.insert({Op, i});
|
121
|
505 } else {
|
|
506 // This function can be called for the same register with different
|
|
507 // lane masks. If the def in this instruction was for the whole
|
|
508 // register, we can get here more than once. Avoid adding multiple
|
|
509 // implicit uses (or adding an implicit use when an explicit one is
|
|
510 // present).
|
147
|
511 if (Op.isTied())
|
|
512 ImpUses.erase(Op);
|
121
|
513 }
|
|
514 }
|
120
|
515 if (ImpUses.empty())
|
|
516 continue;
|
|
517 MachineFunction &MF = *DefI->getParent()->getParent();
|
121
|
518 for (std::pair<RegisterRef, unsigned> P : ImpUses) {
|
|
519 RegisterRef R = P.first;
|
120
|
520 MachineInstrBuilder(MF, DefI).addReg(R.Reg, RegState::Implicit, R.Sub);
|
121
|
521 DefI->tieOperands(P.second, DefI->getNumOperands()-1);
|
|
522 }
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
523 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
524 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
525
|
120
|
526 void HexagonExpandCondsets::updateDeadFlags(unsigned Reg) {
|
|
527 LiveInterval &LI = LIS->getInterval(Reg);
|
|
528 if (LI.hasSubRanges()) {
|
|
529 for (LiveInterval::SubRange &S : LI.subranges()) {
|
|
530 updateDeadsInRange(Reg, S.LaneMask, S);
|
|
531 LIS->shrinkToUses(S, Reg);
|
|
532 }
|
|
533 LI.clear();
|
|
534 LIS->constructMainRangeFromSubranges(LI);
|
|
535 } else {
|
|
536 updateDeadsInRange(Reg, MRI->getMaxLaneMaskForVReg(Reg), LI);
|
|
537 }
|
|
538 }
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
539
|
120
|
540 void HexagonExpandCondsets::recalculateLiveInterval(unsigned Reg) {
|
|
541 LIS->removeInterval(Reg);
|
|
542 LIS->createAndComputeVirtRegInterval(Reg);
|
|
543 }
|
|
544
|
|
545 void HexagonExpandCondsets::removeInstr(MachineInstr &MI) {
|
|
546 LIS->RemoveMachineInstrFromMaps(MI);
|
|
547 MI.eraseFromParent();
|
|
548 }
|
|
549
|
|
550 void HexagonExpandCondsets::updateLiveness(std::set<unsigned> &RegSet,
|
|
551 bool Recalc, bool UpdateKills, bool UpdateDeads) {
|
|
552 UpdateKills |= UpdateDeads;
|
147
|
553 for (unsigned R : RegSet) {
|
|
554 if (!Register::isVirtualRegister(R)) {
|
|
555 assert(Register::isPhysicalRegister(R));
|
|
556 // There shouldn't be any physical registers as operands, except
|
|
557 // possibly reserved registers.
|
|
558 assert(MRI->isReserved(R));
|
|
559 continue;
|
|
560 }
|
120
|
561 if (Recalc)
|
|
562 recalculateLiveInterval(R);
|
|
563 if (UpdateKills)
|
|
564 MRI->clearKillFlags(R);
|
|
565 if (UpdateDeads)
|
|
566 updateDeadFlags(R);
|
|
567 // Fixing <dead> flags may extend live ranges, so reset <kill> flags
|
|
568 // after that.
|
|
569 if (UpdateKills)
|
|
570 updateKillFlags(R);
|
|
571 LIS->getInterval(R).verify();
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
572 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
573 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
574
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
575 /// Get the opcode for a conditional transfer of the value in SO (source
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
576 /// operand). The condition (true/false) is given in Cond.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
577 unsigned HexagonExpandCondsets::getCondTfrOpcode(const MachineOperand &SO,
|
120
|
578 bool IfTrue) {
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
579 using namespace Hexagon;
|
121
|
580
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
581 if (SO.isReg()) {
|
147
|
582 Register PhysR;
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
583 RegisterRef RS = SO;
|
147
|
584 if (Register::isVirtualRegister(RS.Reg)) {
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
585 const TargetRegisterClass *VC = MRI->getRegClass(RS.Reg);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
586 assert(VC->begin() != VC->end() && "Empty register class");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
587 PhysR = *VC->begin();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
588 } else {
|
147
|
589 assert(Register::isPhysicalRegister(RS.Reg));
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
590 PhysR = RS.Reg;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
591 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
592 unsigned PhysS = (RS.Sub == 0) ? PhysR : TRI->getSubReg(PhysR, RS.Sub);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
593 const TargetRegisterClass *RC = TRI->getMinimalPhysRegClass(PhysS);
|
121
|
594 switch (TRI->getRegSizeInBits(*RC)) {
|
|
595 case 32:
|
120
|
596 return IfTrue ? A2_tfrt : A2_tfrf;
|
121
|
597 case 64:
|
120
|
598 return IfTrue ? A2_tfrpt : A2_tfrpf;
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
599 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
600 llvm_unreachable("Invalid register operand");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
601 }
|
121
|
602 switch (SO.getType()) {
|
|
603 case MachineOperand::MO_Immediate:
|
|
604 case MachineOperand::MO_FPImmediate:
|
|
605 case MachineOperand::MO_ConstantPoolIndex:
|
|
606 case MachineOperand::MO_TargetIndex:
|
|
607 case MachineOperand::MO_JumpTableIndex:
|
|
608 case MachineOperand::MO_ExternalSymbol:
|
|
609 case MachineOperand::MO_GlobalAddress:
|
|
610 case MachineOperand::MO_BlockAddress:
|
|
611 return IfTrue ? C2_cmoveit : C2_cmoveif;
|
|
612 default:
|
|
613 break;
|
|
614 }
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
615 llvm_unreachable("Unexpected source operand");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
616 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
617
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
618 /// Generate a conditional transfer, copying the value SrcOp to the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
619 /// destination register DstR:DstSR, and using the predicate register from
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
620 /// PredOp. The Cond argument specifies whether the predicate is to be
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
621 /// if(PredOp), or if(!PredOp).
|
120
|
622 MachineInstr *HexagonExpandCondsets::genCondTfrFor(MachineOperand &SrcOp,
|
|
623 MachineBasicBlock::iterator At,
|
|
624 unsigned DstR, unsigned DstSR, const MachineOperand &PredOp,
|
|
625 bool PredSense, bool ReadUndef, bool ImpUse) {
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
626 MachineInstr *MI = SrcOp.getParent();
|
120
|
627 MachineBasicBlock &B = *At->getParent();
|
|
628 const DebugLoc &DL = MI->getDebugLoc();
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
629
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
630 // Don't avoid identity copies here (i.e. if the source and the destination
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
631 // are the same registers). It is actually better to generate them here,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
632 // since this would cause the copy to potentially be predicated in the next
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
633 // step. The predication will remove such a copy if it is unable to
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
634 /// predicate.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
635
|
120
|
636 unsigned Opc = getCondTfrOpcode(SrcOp, PredSense);
|
|
637 unsigned DstState = RegState::Define | (ReadUndef ? RegState::Undef : 0);
|
|
638 unsigned PredState = getRegState(PredOp) & ~RegState::Kill;
|
|
639 MachineInstrBuilder MIB;
|
|
640
|
|
641 if (SrcOp.isReg()) {
|
|
642 unsigned SrcState = getRegState(SrcOp);
|
|
643 if (RegisterRef(SrcOp) == RegisterRef(DstR, DstSR))
|
|
644 SrcState &= ~RegState::Kill;
|
|
645 MIB = BuildMI(B, At, DL, HII->get(Opc))
|
|
646 .addReg(DstR, DstState, DstSR)
|
|
647 .addReg(PredOp.getReg(), PredState, PredOp.getSubReg())
|
|
648 .addReg(SrcOp.getReg(), SrcState, SrcOp.getSubReg());
|
|
649 } else {
|
|
650 MIB = BuildMI(B, At, DL, HII->get(Opc))
|
121
|
651 .addReg(DstR, DstState, DstSR)
|
|
652 .addReg(PredOp.getReg(), PredState, PredOp.getSubReg())
|
|
653 .add(SrcOp);
|
120
|
654 }
|
|
655
|
147
|
656 LLVM_DEBUG(dbgs() << "created an initial copy: " << *MIB);
|
120
|
657 return &*MIB;
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
658 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
659
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
660 /// Replace a MUX instruction MI with a pair A2_tfrt/A2_tfrf. This function
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
661 /// performs all necessary changes to complete the replacement.
|
120
|
662 bool HexagonExpandCondsets::split(MachineInstr &MI,
|
|
663 std::set<unsigned> &UpdRegs) {
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
664 if (TfrLimitActive) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
665 if (TfrCounter >= TfrLimit)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
666 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
667 TfrCounter++;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
668 }
|
147
|
669 LLVM_DEBUG(dbgs() << "\nsplitting " << printMBBReference(*MI.getParent())
|
|
670 << ": " << MI);
|
120
|
671 MachineOperand &MD = MI.getOperand(0); // Definition
|
|
672 MachineOperand &MP = MI.getOperand(1); // Predicate register
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
673 assert(MD.isDef());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
674 unsigned DR = MD.getReg(), DSR = MD.getSubReg();
|
120
|
675 bool ReadUndef = MD.isUndef();
|
|
676 MachineBasicBlock::iterator At = MI;
|
|
677
|
121
|
678 auto updateRegs = [&UpdRegs] (const MachineInstr &MI) -> void {
|
|
679 for (auto &Op : MI.operands())
|
|
680 if (Op.isReg())
|
|
681 UpdRegs.insert(Op.getReg());
|
|
682 };
|
|
683
|
120
|
684 // If this is a mux of the same register, just replace it with COPY.
|
|
685 // Ideally, this would happen earlier, so that register coalescing would
|
|
686 // see it.
|
|
687 MachineOperand &ST = MI.getOperand(2);
|
|
688 MachineOperand &SF = MI.getOperand(3);
|
|
689 if (ST.isReg() && SF.isReg()) {
|
|
690 RegisterRef RT(ST);
|
|
691 if (RT == RegisterRef(SF)) {
|
121
|
692 // Copy regs to update first.
|
|
693 updateRegs(MI);
|
120
|
694 MI.setDesc(HII->get(TargetOpcode::COPY));
|
|
695 unsigned S = getRegState(ST);
|
|
696 while (MI.getNumOperands() > 1)
|
|
697 MI.RemoveOperand(MI.getNumOperands()-1);
|
|
698 MachineFunction &MF = *MI.getParent()->getParent();
|
|
699 MachineInstrBuilder(MF, MI).addReg(RT.Reg, S, RT.Sub);
|
|
700 return true;
|
|
701 }
|
|
702 }
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
703
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
704 // First, create the two invididual conditional transfers, and add each
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
705 // of them to the live intervals information. Do that first and then remove
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
706 // the old instruction from live intervals.
|
120
|
707 MachineInstr *TfrT =
|
|
708 genCondTfrFor(ST, At, DR, DSR, MP, true, ReadUndef, false);
|
|
709 MachineInstr *TfrF =
|
|
710 genCondTfrFor(SF, At, DR, DSR, MP, false, ReadUndef, true);
|
|
711 LIS->InsertMachineInstrInMaps(*TfrT);
|
|
712 LIS->InsertMachineInstrInMaps(*TfrF);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
713
|
120
|
714 // Will need to recalculate live intervals for all registers in MI.
|
121
|
715 updateRegs(MI);
|
120
|
716
|
|
717 removeInstr(MI);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
718 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
719 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
720
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
721 bool HexagonExpandCondsets::isPredicable(MachineInstr *MI) {
|
120
|
722 if (HII->isPredicated(*MI) || !HII->isPredicable(*MI))
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
723 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
724 if (MI->hasUnmodeledSideEffects() || MI->mayStore())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
725 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
726 // Reject instructions with multiple defs (e.g. post-increment loads).
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
727 bool HasDef = false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
728 for (auto &Op : MI->operands()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
729 if (!Op.isReg() || !Op.isDef())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
730 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
731 if (HasDef)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
732 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
733 HasDef = true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
734 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
735 for (auto &Mo : MI->memoperands())
|
147
|
736 if (Mo->isVolatile() || Mo->isAtomic())
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
737 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
738 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
739 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
740
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
741 /// Find the reaching definition for a predicated use of RD. The RD is used
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
742 /// under the conditions given by PredR and Cond, and this function will ignore
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
743 /// definitions that set RD under the opposite conditions.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
744 MachineInstr *HexagonExpandCondsets::getReachingDefForPred(RegisterRef RD,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
745 MachineBasicBlock::iterator UseIt, unsigned PredR, bool Cond) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
746 MachineBasicBlock &B = *UseIt->getParent();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
747 MachineBasicBlock::iterator I = UseIt, S = B.begin();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
748 if (I == S)
|
121
|
749 return nullptr;
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
750
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
751 bool PredValid = true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
752 do {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
753 --I;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
754 MachineInstr *MI = &*I;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
755 // Check if this instruction can be ignored, i.e. if it is predicated
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
756 // on the complementary condition.
|
120
|
757 if (PredValid && HII->isPredicated(*MI)) {
|
|
758 if (MI->readsRegister(PredR) && (Cond != HII->isPredicatedTrue(*MI)))
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
759 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
760 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
761
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
762 // Check the defs. If the PredR is defined, invalidate it. If RD is
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
763 // defined, return the instruction or 0, depending on the circumstances.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
764 for (auto &Op : MI->operands()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
765 if (!Op.isReg() || !Op.isDef())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
766 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
767 RegisterRef RR = Op;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
768 if (RR.Reg == PredR) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
769 PredValid = false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
770 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
771 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
772 if (RR.Reg != RD.Reg)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
773 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
774 // If the "Reg" part agrees, there is still the subregister to check.
|
134
|
775 // If we are looking for %1:loreg, we can skip %1:hireg, but
|
|
776 // not %1 (w/o subregisters).
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
777 if (RR.Sub == RD.Sub)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
778 return MI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
779 if (RR.Sub == 0 || RD.Sub == 0)
|
121
|
780 return nullptr;
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
781 // We have different subregisters, so we can continue looking.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
782 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
783 } while (I != S);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
784
|
121
|
785 return nullptr;
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
786 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
787
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
788 /// Check if the instruction MI can be safely moved over a set of instructions
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
789 /// whose side-effects (in terms of register defs and uses) are expressed in
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
790 /// the maps Defs and Uses. These maps reflect the conditional defs and uses
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
791 /// that depend on the same predicate register to allow moving instructions
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
792 /// over instructions predicated on the opposite condition.
|
120
|
793 bool HexagonExpandCondsets::canMoveOver(MachineInstr &MI, ReferenceMap &Defs,
|
|
794 ReferenceMap &Uses) {
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
795 // In order to be able to safely move MI over instructions that define
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
796 // "Defs" and use "Uses", no def operand from MI can be defined or used
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
797 // and no use operand can be defined.
|
120
|
798 for (auto &Op : MI.operands()) {
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
799 if (!Op.isReg())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
800 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
801 RegisterRef RR = Op;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
802 // For physical register we would need to check register aliases, etc.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
803 // and we don't want to bother with that. It would be of little value
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
804 // before the actual register rewriting (from virtual to physical).
|
147
|
805 if (!Register::isVirtualRegister(RR.Reg))
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
806 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
807 // No redefs for any operand.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
808 if (isRefInMap(RR, Defs, Exec_Then))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
809 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
810 // For defs, there cannot be uses.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
811 if (Op.isDef() && isRefInMap(RR, Uses, Exec_Then))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
812 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
813 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
814 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
815 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
816
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
817 /// Check if the instruction accessing memory (TheI) can be moved to the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
818 /// location ToI.
|
120
|
819 bool HexagonExpandCondsets::canMoveMemTo(MachineInstr &TheI, MachineInstr &ToI,
|
|
820 bool IsDown) {
|
|
821 bool IsLoad = TheI.mayLoad(), IsStore = TheI.mayStore();
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
822 if (!IsLoad && !IsStore)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
823 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
824 if (HII->areMemAccessesTriviallyDisjoint(TheI, ToI))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
825 return true;
|
120
|
826 if (TheI.hasUnmodeledSideEffects())
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
827 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
828
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
829 MachineBasicBlock::iterator StartI = IsDown ? TheI : ToI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
830 MachineBasicBlock::iterator EndI = IsDown ? ToI : TheI;
|
120
|
831 bool Ordered = TheI.hasOrderedMemoryRef();
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
832
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
833 // Search for aliased memory reference in (StartI, EndI).
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
834 for (MachineBasicBlock::iterator I = std::next(StartI); I != EndI; ++I) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
835 MachineInstr *MI = &*I;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
836 if (MI->hasUnmodeledSideEffects())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
837 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
838 bool L = MI->mayLoad(), S = MI->mayStore();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
839 if (!L && !S)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
840 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
841 if (Ordered && MI->hasOrderedMemoryRef())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
842 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
843
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
844 bool Conflict = (L && IsStore) || S;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
845 if (Conflict)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
846 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
847 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
848 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
849 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
850
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
851 /// Generate a predicated version of MI (where the condition is given via
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
852 /// PredR and Cond) at the point indicated by Where.
|
120
|
853 void HexagonExpandCondsets::predicateAt(const MachineOperand &DefOp,
|
|
854 MachineInstr &MI,
|
|
855 MachineBasicBlock::iterator Where,
|
|
856 const MachineOperand &PredOp, bool Cond,
|
|
857 std::set<unsigned> &UpdRegs) {
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
858 // The problem with updating live intervals is that we can move one def
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
859 // past another def. In particular, this can happen when moving an A2_tfrt
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
860 // over an A2_tfrf defining the same register. From the point of view of
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
861 // live intervals, these two instructions are two separate definitions,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
862 // and each one starts another live segment. LiveIntervals's "handleMove"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
863 // does not allow such moves, so we need to handle it ourselves. To avoid
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
864 // invalidating liveness data while we are using it, the move will be
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
865 // implemented in 4 steps: (1) add a clone of the instruction MI at the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
866 // target location, (2) update liveness, (3) delete the old instruction,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
867 // and (4) update liveness again.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
868
|
120
|
869 MachineBasicBlock &B = *MI.getParent();
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
870 DebugLoc DL = Where->getDebugLoc(); // "Where" points to an instruction.
|
120
|
871 unsigned Opc = MI.getOpcode();
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
872 unsigned PredOpc = HII->getCondOpcode(Opc, !Cond);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
873 MachineInstrBuilder MB = BuildMI(B, Where, DL, HII->get(PredOpc));
|
120
|
874 unsigned Ox = 0, NP = MI.getNumOperands();
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
875 // Skip all defs from MI first.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
876 while (Ox < NP) {
|
120
|
877 MachineOperand &MO = MI.getOperand(Ox);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
878 if (!MO.isReg() || !MO.isDef())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
879 break;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
880 Ox++;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
881 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
882 // Add the new def, then the predicate register, then the rest of the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
883 // operands.
|
120
|
884 MB.addReg(DefOp.getReg(), getRegState(DefOp), DefOp.getSubReg());
|
|
885 MB.addReg(PredOp.getReg(), PredOp.isUndef() ? RegState::Undef : 0,
|
|
886 PredOp.getSubReg());
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
887 while (Ox < NP) {
|
120
|
888 MachineOperand &MO = MI.getOperand(Ox);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
889 if (!MO.isReg() || !MO.isImplicit())
|
121
|
890 MB.add(MO);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
891 Ox++;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
892 }
|
147
|
893 MB.cloneMemRefs(MI);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
894
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
895 MachineInstr *NewI = MB;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
896 NewI->clearKillInfo();
|
120
|
897 LIS->InsertMachineInstrInMaps(*NewI);
|
|
898
|
|
899 for (auto &Op : NewI->operands())
|
|
900 if (Op.isReg())
|
|
901 UpdRegs.insert(Op.getReg());
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
902 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
903
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
904 /// In the range [First, Last], rename all references to the "old" register RO
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
905 /// to the "new" register RN, but only in instructions predicated on the given
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
906 /// condition.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
907 void HexagonExpandCondsets::renameInRange(RegisterRef RO, RegisterRef RN,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
908 unsigned PredR, bool Cond, MachineBasicBlock::iterator First,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
909 MachineBasicBlock::iterator Last) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
910 MachineBasicBlock::iterator End = std::next(Last);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
911 for (MachineBasicBlock::iterator I = First; I != End; ++I) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
912 MachineInstr *MI = &*I;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
913 // Do not touch instructions that are not predicated, or are predicated
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
914 // on the opposite condition.
|
120
|
915 if (!HII->isPredicated(*MI))
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
916 continue;
|
120
|
917 if (!MI->readsRegister(PredR) || (Cond != HII->isPredicatedTrue(*MI)))
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
918 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
919
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
920 for (auto &Op : MI->operands()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
921 if (!Op.isReg() || RO != RegisterRef(Op))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
922 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
923 Op.setReg(RN.Reg);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
924 Op.setSubReg(RN.Sub);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
925 // In practice, this isn't supposed to see any defs.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
926 assert(!Op.isDef() && "Not expecting a def");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
927 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
928 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
929 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
930
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
931 /// For a given conditional copy, predicate the definition of the source of
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
932 /// the copy under the given condition (using the same predicate register as
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
933 /// the copy).
|
120
|
934 bool HexagonExpandCondsets::predicate(MachineInstr &TfrI, bool Cond,
|
|
935 std::set<unsigned> &UpdRegs) {
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
936 // TfrI - A2_tfr[tf] Instruction (not A2_tfrsi).
|
120
|
937 unsigned Opc = TfrI.getOpcode();
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
938 (void)Opc;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
939 assert(Opc == Hexagon::A2_tfrt || Opc == Hexagon::A2_tfrf);
|
147
|
940 LLVM_DEBUG(dbgs() << "\nattempt to predicate if-" << (Cond ? "true" : "false")
|
|
941 << ": " << TfrI);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
942
|
120
|
943 MachineOperand &MD = TfrI.getOperand(0);
|
|
944 MachineOperand &MP = TfrI.getOperand(1);
|
|
945 MachineOperand &MS = TfrI.getOperand(2);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
946 // The source operand should be a <kill>. This is not strictly necessary,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
947 // but it makes things a lot simpler. Otherwise, we would need to rename
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
948 // some registers, which would complicate the transformation considerably.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
949 if (!MS.isKill())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
950 return false;
|
120
|
951 // Avoid predicating instructions that define a subregister if subregister
|
|
952 // liveness tracking is not enabled.
|
|
953 if (MD.getSubReg() && !MRI->shouldTrackSubRegLiveness(MD.getReg()))
|
|
954 return false;
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
955
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
956 RegisterRef RT(MS);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
957 unsigned PredR = MP.getReg();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
958 MachineInstr *DefI = getReachingDefForPred(RT, TfrI, PredR, Cond);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
959 if (!DefI || !isPredicable(DefI))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
960 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
961
|
147
|
962 LLVM_DEBUG(dbgs() << "Source def: " << *DefI);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
963
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
964 // Collect the information about registers defined and used between the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
965 // DefI and the TfrI.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
966 // Map: reg -> bitmask of subregs
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
967 ReferenceMap Uses, Defs;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
968 MachineBasicBlock::iterator DefIt = DefI, TfrIt = TfrI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
969
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
970 // Check if the predicate register is valid between DefI and TfrI.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
971 // If it is, we can then ignore instructions predicated on the negated
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
972 // conditions when collecting def and use information.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
973 bool PredValid = true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
974 for (MachineBasicBlock::iterator I = std::next(DefIt); I != TfrIt; ++I) {
|
121
|
975 if (!I->modifiesRegister(PredR, nullptr))
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
976 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
977 PredValid = false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
978 break;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
979 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
980
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
981 for (MachineBasicBlock::iterator I = std::next(DefIt); I != TfrIt; ++I) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
982 MachineInstr *MI = &*I;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
983 // If this instruction is predicated on the same register, it could
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
984 // potentially be ignored.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
985 // By default assume that the instruction executes on the same condition
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
986 // as TfrI (Exec_Then), and also on the opposite one (Exec_Else).
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
987 unsigned Exec = Exec_Then | Exec_Else;
|
120
|
988 if (PredValid && HII->isPredicated(*MI) && MI->readsRegister(PredR))
|
|
989 Exec = (Cond == HII->isPredicatedTrue(*MI)) ? Exec_Then : Exec_Else;
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
990
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
991 for (auto &Op : MI->operands()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
992 if (!Op.isReg())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
993 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
994 // We don't want to deal with physical registers. The reason is that
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
995 // they can be aliased with other physical registers. Aliased virtual
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
996 // registers must share the same register number, and can only differ
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
997 // in the subregisters, which we are keeping track of. Physical
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
998 // registers ters no longer have subregisters---their super- and
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
999 // subregisters are other physical registers, and we are not checking
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1000 // that.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1001 RegisterRef RR = Op;
|
147
|
1002 if (!Register::isVirtualRegister(RR.Reg))
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1003 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1004
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1005 ReferenceMap &Map = Op.isDef() ? Defs : Uses;
|
120
|
1006 if (Op.isDef() && Op.isUndef()) {
|
|
1007 assert(RR.Sub && "Expecting a subregister on <def,read-undef>");
|
|
1008 // If this is a <def,read-undef>, then it invalidates the non-written
|
|
1009 // part of the register. For the purpose of checking the validity of
|
|
1010 // the move, assume that it modifies the whole register.
|
|
1011 RR.Sub = 0;
|
|
1012 }
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1013 addRefToMap(RR, Map, Exec);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1014 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1015 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1016
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1017 // The situation:
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1018 // RT = DefI
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1019 // ...
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1020 // RD = TfrI ..., RT
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1021
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1022 // If the register-in-the-middle (RT) is used or redefined between
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1023 // DefI and TfrI, we may not be able proceed with this transformation.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1024 // We can ignore a def that will not execute together with TfrI, and a
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1025 // use that will. If there is such a use (that does execute together with
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1026 // TfrI), we will not be able to move DefI down. If there is a use that
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1027 // executed if TfrI's condition is false, then RT must be available
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1028 // unconditionally (cannot be predicated).
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1029 // Essentially, we need to be able to rename RT to RD in this segment.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1030 if (isRefInMap(RT, Defs, Exec_Then) || isRefInMap(RT, Uses, Exec_Else))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1031 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1032 RegisterRef RD = MD;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1033 // If the predicate register is defined between DefI and TfrI, the only
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1034 // potential thing to do would be to move the DefI down to TfrI, and then
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1035 // predicate. The reaching def (DefI) must be movable down to the location
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1036 // of the TfrI.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1037 // If the target register of the TfrI (RD) is not used or defined between
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1038 // DefI and TfrI, consider moving TfrI up to DefI.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1039 bool CanUp = canMoveOver(TfrI, Defs, Uses);
|
120
|
1040 bool CanDown = canMoveOver(*DefI, Defs, Uses);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1041 // The TfrI does not access memory, but DefI could. Check if it's safe
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1042 // to move DefI down to TfrI.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1043 if (DefI->mayLoad() || DefI->mayStore())
|
120
|
1044 if (!canMoveMemTo(*DefI, TfrI, true))
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1045 CanDown = false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1046
|
147
|
1047 LLVM_DEBUG(dbgs() << "Can move up: " << (CanUp ? "yes" : "no")
|
|
1048 << ", can move down: " << (CanDown ? "yes\n" : "no\n"));
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1049 MachineBasicBlock::iterator PastDefIt = std::next(DefIt);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1050 if (CanUp)
|
120
|
1051 predicateAt(MD, *DefI, PastDefIt, MP, Cond, UpdRegs);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1052 else if (CanDown)
|
120
|
1053 predicateAt(MD, *DefI, TfrIt, MP, Cond, UpdRegs);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1054 else
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1055 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1056
|
120
|
1057 if (RT != RD) {
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1058 renameInRange(RT, RD, PredR, Cond, PastDefIt, TfrIt);
|
120
|
1059 UpdRegs.insert(RT.Reg);
|
|
1060 }
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1061
|
120
|
1062 removeInstr(TfrI);
|
|
1063 removeInstr(*DefI);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1064 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1065 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1066
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1067 /// Predicate all cases of conditional copies in the specified block.
|
120
|
1068 bool HexagonExpandCondsets::predicateInBlock(MachineBasicBlock &B,
|
|
1069 std::set<unsigned> &UpdRegs) {
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1070 bool Changed = false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1071 MachineBasicBlock::iterator I, E, NextI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1072 for (I = B.begin(), E = B.end(); I != E; I = NextI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1073 NextI = std::next(I);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1074 unsigned Opc = I->getOpcode();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1075 if (Opc == Hexagon::A2_tfrt || Opc == Hexagon::A2_tfrf) {
|
120
|
1076 bool Done = predicate(*I, (Opc == Hexagon::A2_tfrt), UpdRegs);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1077 if (!Done) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1078 // If we didn't predicate I, we may need to remove it in case it is
|
134
|
1079 // an "identity" copy, e.g. %1 = A2_tfrt %2, %1.
|
120
|
1080 if (RegisterRef(I->getOperand(0)) == RegisterRef(I->getOperand(2))) {
|
|
1081 for (auto &Op : I->operands())
|
|
1082 if (Op.isReg())
|
|
1083 UpdRegs.insert(Op.getReg());
|
|
1084 removeInstr(*I);
|
|
1085 }
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1086 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1087 Changed |= Done;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1088 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1089 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1090 return Changed;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1091 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1092
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1093 bool HexagonExpandCondsets::isIntReg(RegisterRef RR, unsigned &BW) {
|
147
|
1094 if (!Register::isVirtualRegister(RR.Reg))
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1095 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1096 const TargetRegisterClass *RC = MRI->getRegClass(RR.Reg);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1097 if (RC == &Hexagon::IntRegsRegClass) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1098 BW = 32;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1099 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1100 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1101 if (RC == &Hexagon::DoubleRegsRegClass) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1102 BW = (RR.Sub != 0) ? 32 : 64;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1103 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1104 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1105 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1106 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1107
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1108 bool HexagonExpandCondsets::isIntraBlocks(LiveInterval &LI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1109 for (LiveInterval::iterator I = LI.begin(), E = LI.end(); I != E; ++I) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1110 LiveRange::Segment &LR = *I;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1111 // Range must start at a register...
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1112 if (!LR.start.isRegister())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1113 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1114 // ...and end in a register or in a dead slot.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1115 if (!LR.end.isRegister() && !LR.end.isDead())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1116 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1117 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1118 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1119 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1120
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1121 bool HexagonExpandCondsets::coalesceRegisters(RegisterRef R1, RegisterRef R2) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1122 if (CoaLimitActive) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1123 if (CoaCounter >= CoaLimit)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1124 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1125 CoaCounter++;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1126 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1127 unsigned BW1, BW2;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1128 if (!isIntReg(R1, BW1) || !isIntReg(R2, BW2) || BW1 != BW2)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1129 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1130 if (MRI->isLiveIn(R1.Reg))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1131 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1132 if (MRI->isLiveIn(R2.Reg))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1133 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1134
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1135 LiveInterval &L1 = LIS->getInterval(R1.Reg);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1136 LiveInterval &L2 = LIS->getInterval(R2.Reg);
|
120
|
1137 if (L2.empty())
|
|
1138 return false;
|
|
1139 if (L1.hasSubRanges() || L2.hasSubRanges())
|
|
1140 return false;
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1141 bool Overlap = L1.overlaps(L2);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1142
|
147
|
1143 LLVM_DEBUG(dbgs() << "compatible registers: ("
|
|
1144 << (Overlap ? "overlap" : "disjoint") << ")\n "
|
|
1145 << printReg(R1.Reg, TRI, R1.Sub) << " " << L1 << "\n "
|
|
1146 << printReg(R2.Reg, TRI, R2.Sub) << " " << L2 << "\n");
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1147 if (R1.Sub || R2.Sub)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1148 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1149 if (Overlap)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1150 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1151
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1152 // Coalescing could have a negative impact on scheduling, so try to limit
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1153 // to some reasonable extent. Only consider coalescing segments, when one
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1154 // of them does not cross basic block boundaries.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1155 if (!isIntraBlocks(L1) && !isIntraBlocks(L2))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1156 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1157
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1158 MRI->replaceRegWith(R2.Reg, R1.Reg);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1159
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1160 // Move all live segments from L2 to L1.
|
121
|
1161 using ValueInfoMap = DenseMap<VNInfo *, VNInfo *>;
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1162 ValueInfoMap VM;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1163 for (LiveInterval::iterator I = L2.begin(), E = L2.end(); I != E; ++I) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1164 VNInfo *NewVN, *OldVN = I->valno;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1165 ValueInfoMap::iterator F = VM.find(OldVN);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1166 if (F == VM.end()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1167 NewVN = L1.getNextValue(I->valno->def, LIS->getVNInfoAllocator());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1168 VM.insert(std::make_pair(OldVN, NewVN));
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1169 } else {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1170 NewVN = F->second;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1171 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1172 L1.addSegment(LiveRange::Segment(I->start, I->end, NewVN));
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1173 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1174 while (L2.begin() != L2.end())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1175 L2.removeSegment(*L2.begin());
|
120
|
1176 LIS->removeInterval(R2.Reg);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1177
|
120
|
1178 updateKillFlags(R1.Reg);
|
147
|
1179 LLVM_DEBUG(dbgs() << "coalesced: " << L1 << "\n");
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1180 L1.verify();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1181
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1182 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1183 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1184
|
120
|
1185 /// Attempt to coalesce one of the source registers to a MUX instruction with
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1186 /// the destination register. This could lead to having only one predicated
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1187 /// instruction in the end instead of two.
|
120
|
1188 bool HexagonExpandCondsets::coalesceSegments(
|
|
1189 const SmallVectorImpl<MachineInstr*> &Condsets,
|
|
1190 std::set<unsigned> &UpdRegs) {
|
|
1191 SmallVector<MachineInstr*,16> TwoRegs;
|
|
1192 for (MachineInstr *MI : Condsets) {
|
|
1193 MachineOperand &S1 = MI->getOperand(2), &S2 = MI->getOperand(3);
|
|
1194 if (!S1.isReg() && !S2.isReg())
|
|
1195 continue;
|
|
1196 TwoRegs.push_back(MI);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1197 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1198
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1199 bool Changed = false;
|
120
|
1200 for (MachineInstr *CI : TwoRegs) {
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1201 RegisterRef RD = CI->getOperand(0);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1202 RegisterRef RP = CI->getOperand(1);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1203 MachineOperand &S1 = CI->getOperand(2), &S2 = CI->getOperand(3);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1204 bool Done = false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1205 // Consider this case:
|
134
|
1206 // %1 = instr1 ...
|
|
1207 // %2 = instr2 ...
|
|
1208 // %0 = C2_mux ..., %1, %2
|
|
1209 // If %0 was coalesced with %1, we could end up with the following
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1210 // code:
|
134
|
1211 // %0 = instr1 ...
|
|
1212 // %2 = instr2 ...
|
|
1213 // %0 = A2_tfrf ..., %2
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1214 // which will later become:
|
134
|
1215 // %0 = instr1 ...
|
|
1216 // %0 = instr2_cNotPt ...
|
|
1217 // i.e. there will be an unconditional definition (instr1) of %0
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1218 // followed by a conditional one. The output dependency was there before
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1219 // and it unavoidable, but if instr1 is predicable, we will no longer be
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1220 // able to predicate it here.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1221 // To avoid this scenario, don't coalesce the destination register with
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1222 // a source register that is defined by a predicable instruction.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1223 if (S1.isReg()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1224 RegisterRef RS = S1;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1225 MachineInstr *RDef = getReachingDefForPred(RS, CI, RP.Reg, true);
|
120
|
1226 if (!RDef || !HII->isPredicable(*RDef)) {
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1227 Done = coalesceRegisters(RD, RegisterRef(S1));
|
120
|
1228 if (Done) {
|
|
1229 UpdRegs.insert(RD.Reg);
|
|
1230 UpdRegs.insert(S1.getReg());
|
|
1231 }
|
|
1232 }
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1233 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1234 if (!Done && S2.isReg()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1235 RegisterRef RS = S2;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1236 MachineInstr *RDef = getReachingDefForPred(RS, CI, RP.Reg, false);
|
120
|
1237 if (!RDef || !HII->isPredicable(*RDef)) {
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1238 Done = coalesceRegisters(RD, RegisterRef(S2));
|
120
|
1239 if (Done) {
|
|
1240 UpdRegs.insert(RD.Reg);
|
|
1241 UpdRegs.insert(S2.getReg());
|
|
1242 }
|
|
1243 }
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1244 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1245 Changed |= Done;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1246 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1247 return Changed;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1248 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1249
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1250 bool HexagonExpandCondsets::runOnMachineFunction(MachineFunction &MF) {
|
134
|
1251 if (skipFunction(MF.getFunction()))
|
120
|
1252 return false;
|
|
1253
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1254 HII = static_cast<const HexagonInstrInfo*>(MF.getSubtarget().getInstrInfo());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1255 TRI = MF.getSubtarget().getRegisterInfo();
|
120
|
1256 MDT = &getAnalysis<MachineDominatorTree>();
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1257 LIS = &getAnalysis<LiveIntervals>();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1258 MRI = &MF.getRegInfo();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1259
|
147
|
1260 LLVM_DEBUG(LIS->print(dbgs() << "Before expand-condsets\n",
|
|
1261 MF.getFunction().getParent()));
|
120
|
1262
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1263 bool Changed = false;
|
120
|
1264 std::set<unsigned> CoalUpd, PredUpd;
|
|
1265
|
|
1266 SmallVector<MachineInstr*,16> Condsets;
|
|
1267 for (auto &B : MF)
|
|
1268 for (auto &I : B)
|
|
1269 if (isCondset(I))
|
|
1270 Condsets.push_back(&I);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1271
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1272 // Try to coalesce the target of a mux with one of its sources.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1273 // This could eliminate a register copy in some circumstances.
|
120
|
1274 Changed |= coalesceSegments(Condsets, CoalUpd);
|
|
1275
|
|
1276 // Update kill flags on all source operands. This is done here because
|
|
1277 // at this moment (when expand-condsets runs), there are no kill flags
|
|
1278 // in the IR (they have been removed by live range analysis).
|
|
1279 // Updating them right before we split is the easiest, because splitting
|
|
1280 // adds definitions which would interfere with updating kills afterwards.
|
|
1281 std::set<unsigned> KillUpd;
|
|
1282 for (MachineInstr *MI : Condsets)
|
|
1283 for (MachineOperand &Op : MI->operands())
|
|
1284 if (Op.isReg() && Op.isUse())
|
|
1285 if (!CoalUpd.count(Op.getReg()))
|
|
1286 KillUpd.insert(Op.getReg());
|
|
1287 updateLiveness(KillUpd, false, true, false);
|
147
|
1288 LLVM_DEBUG(
|
|
1289 LIS->print(dbgs() << "After coalescing\n", MF.getFunction().getParent()));
|
120
|
1290
|
|
1291 // First, simply split all muxes into a pair of conditional transfers
|
|
1292 // and update the live intervals to reflect the new arrangement. The
|
|
1293 // goal is to update the kill flags, since predication will rely on
|
|
1294 // them.
|
|
1295 for (MachineInstr *MI : Condsets)
|
|
1296 Changed |= split(*MI, PredUpd);
|
|
1297 Condsets.clear(); // The contents of Condsets are invalid here anyway.
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1298
|
120
|
1299 // Do not update live ranges after splitting. Recalculation of live
|
|
1300 // intervals removes kill flags, which were preserved by splitting on
|
|
1301 // the source operands of condsets. These kill flags are needed by
|
|
1302 // predication, and after splitting they are difficult to recalculate
|
|
1303 // (because of predicated defs), so make sure they are left untouched.
|
|
1304 // Predication does not use live intervals.
|
147
|
1305 LLVM_DEBUG(
|
|
1306 LIS->print(dbgs() << "After splitting\n", MF.getFunction().getParent()));
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1307
|
120
|
1308 // Traverse all blocks and collapse predicable instructions feeding
|
|
1309 // conditional transfers into predicated instructions.
|
|
1310 // Walk over all the instructions again, so we may catch pre-existing
|
|
1311 // cases that were not created in the previous step.
|
|
1312 for (auto &B : MF)
|
|
1313 Changed |= predicateInBlock(B, PredUpd);
|
147
|
1314 LLVM_DEBUG(LIS->print(dbgs() << "After predicating\n",
|
|
1315 MF.getFunction().getParent()));
|
120
|
1316
|
|
1317 PredUpd.insert(CoalUpd.begin(), CoalUpd.end());
|
|
1318 updateLiveness(PredUpd, true, true, true);
|
|
1319
|
147
|
1320 LLVM_DEBUG({
|
120
|
1321 if (Changed)
|
|
1322 LIS->print(dbgs() << "After expand-condsets\n",
|
134
|
1323 MF.getFunction().getParent());
|
120
|
1324 });
|
|
1325
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1326 return Changed;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1327 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1328
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1329 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1330 // Public Constructor Functions
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1331 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1332 FunctionPass *llvm::createHexagonExpandCondsets() {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1333 return new HexagonExpandCondsets();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1334 }
|