R600MachineScheduler.cpp revision e3d4cbc7d25061441adafa47450a31571c87bf85 
1//===-- R600MachineScheduler.cpp - R600 Scheduler Interface -*- C++ -*-----===//
2//
3//                     The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10/// \file
11/// \brief R600 Machine Scheduler interface
12// TODO: Scheduling is optimised for VLIW4 arch, modify it to support TRANS slot
13//
14//===----------------------------------------------------------------------===//
15
16#define DEBUG_TYPE "misched"
17
18#include "R600MachineScheduler.h"
19#include "llvm/CodeGen/LiveIntervalAnalysis.h"
20#include "llvm/CodeGen/MachineRegisterInfo.h"
21#include "llvm/Pass.h"
22#include "llvm/PassManager.h"
23#include "llvm/Support/raw_ostream.h"
24
25using namespace llvm;
26
27void R600SchedStrategy::initialize(ScheduleDAGMI *dag) {
28
29  DAG = dag;
30  TII = static_cast<const R600InstrInfo*>(DAG->TII);
31  TRI = static_cast<const R600RegisterInfo*>(DAG->TRI);
32  MRI = &DAG->MRI;
33  CurInstKind = IDOther;
34  CurEmitted = 0;
35  OccupedSlotsMask = 15;
36  InstKindLimit[IDAlu] = TII->getMaxAlusPerClause();
37  InstKindLimit[IDOther] = 32;
38
39  const AMDGPUSubtarget &ST = DAG->TM.getSubtarget<AMDGPUSubtarget>();
40  InstKindLimit[IDFetch] = ST.getTexVTXClauseSize();
41  AluInstCount = 0;
42  FetchInstCount = 0;
43}
44
45void R600SchedStrategy::MoveUnits(std::vector<SUnit *> &QSrc,
46                                  std::vector<SUnit *> &QDst)
47{
48  QDst.insert(QDst.end(), QSrc.begin(), QSrc.end());
49  QSrc.clear();
50}
51
52static
53unsigned getWFCountLimitedByGPR(unsigned GPRCount) {
54  assert (GPRCount && "GPRCount cannot be 0");
55  return 248 / GPRCount;
56}
57
58SUnit* R600SchedStrategy::pickNode(bool &IsTopNode) {
59  SUnit *SU = 0;
60  NextInstKind = IDOther;
61
62  IsTopNode = false;
63
64  // check if we might want to switch current clause type
65  bool AllowSwitchToAlu = (CurEmitted >= InstKindLimit[CurInstKind]) ||
66      (Available[CurInstKind].empty());
67  bool AllowSwitchFromAlu = (CurEmitted >= InstKindLimit[CurInstKind]) &&
68      (!Available[IDFetch].empty() || !Available[IDOther].empty());
69
70  if (CurInstKind == IDAlu && !Available[IDFetch].empty()) {
71    // We use the heuristic provided by AMD Accelerated Parallel Processing
72    // OpenCL Programming Guide :
73    // The approx. number of WF that allows TEX inst to hide ALU inst is :
74    // 500 (cycles for TEX) / (AluFetchRatio * 8 (cycles for ALU))
75    float ALUFetchRationEstimate =
76        (AluInstCount + AvailablesAluCount() + Pending[IDAlu].size()) /
77        (FetchInstCount + Available[IDFetch].size());
78    unsigned NeededWF = 62.5f / ALUFetchRationEstimate;
79    DEBUG( dbgs() << NeededWF << " approx. Wavefronts Required\n" );
80    // We assume the local GPR requirements to be "dominated" by the requirement
81    // of the TEX clause (which consumes 128 bits regs) ; ALU inst before and
82    // after TEX are indeed likely to consume or generate values from/for the
83    // TEX clause.
84    // Available[IDFetch].size() * 2 : GPRs required in the Fetch clause
85    // We assume that fetch instructions are either TnXYZW = TEX TnXYZW (need
86    // one GPR) or TmXYZW = TnXYZW (need 2 GPR).
87    // (TODO : use RegisterPressure)
88    // If we are going too use too many GPR, we flush Fetch instruction to lower
89    // register pressure on 128 bits regs.
90    unsigned NearRegisterRequirement = 2 * Available[IDFetch].size();
91    if (NeededWF > getWFCountLimitedByGPR(NearRegisterRequirement))
92      AllowSwitchFromAlu = true;
93  }
94
95
96  // We want to scheduled AR defs as soon as possible to make sure they aren't
97  // put in a different ALU clause from their uses.
98  if (!SU && !UnscheduledARDefs.empty()) {
99      SU = UnscheduledARDefs[0];
100      UnscheduledARDefs.erase(UnscheduledARDefs.begin());
101      NextInstKind = IDAlu;
102  }
103
104  if (!SU && ((AllowSwitchToAlu && CurInstKind != IDAlu) ||
105      (!AllowSwitchFromAlu && CurInstKind == IDAlu))) {
106    // try to pick ALU
107    SU = pickAlu();
108    if (!SU && !PhysicalRegCopy.empty()) {
109      SU = PhysicalRegCopy.front();
110      PhysicalRegCopy.erase(PhysicalRegCopy.begin());
111    }
112    if (SU) {
113      if (CurEmitted >= InstKindLimit[IDAlu])
114        CurEmitted = 0;
115      NextInstKind = IDAlu;
116    }
117  }
118
119  if (!SU) {
120    // try to pick FETCH
121    SU = pickOther(IDFetch);
122    if (SU)
123      NextInstKind = IDFetch;
124  }
125
126  // try to pick other
127  if (!SU) {
128    SU = pickOther(IDOther);
129    if (SU)
130      NextInstKind = IDOther;
131  }
132
133  // We want to schedule the AR uses as late as possible to make sure that
134  // the AR defs have been released.
135  if (!SU && !UnscheduledARUses.empty()) {
136      SU = UnscheduledARUses[0];
137      UnscheduledARUses.erase(UnscheduledARUses.begin());
138      NextInstKind = IDAlu;
139  }
140
141
142  DEBUG(
143      if (SU) {
144        dbgs() << " ** Pick node **\n";
145        SU->dump(DAG);
146      } else {
147        dbgs() << "NO NODE \n";
148        for (unsigned i = 0; i < DAG->SUnits.size(); i++) {
149          const SUnit &S = DAG->SUnits[i];
150          if (!S.isScheduled)
151            S.dump(DAG);
152        }
153      }
154  );
155
156  return SU;
157}
158
159void R600SchedStrategy::schedNode(SUnit *SU, bool IsTopNode) {
160  if (NextInstKind != CurInstKind) {
161    DEBUG(dbgs() << "Instruction Type Switch\n");
162    if (NextInstKind != IDAlu)
163      OccupedSlotsMask = 15;
164    CurEmitted = 0;
165    CurInstKind = NextInstKind;
166  }
167
168  if (CurInstKind == IDAlu) {
169    AluInstCount ++;
170    switch (getAluKind(SU)) {
171    case AluT_XYZW:
172      CurEmitted += 4;
173      break;
174    case AluDiscarded:
175      break;
176    default: {
177      ++CurEmitted;
178      for (MachineInstr::mop_iterator It = SU->getInstr()->operands_begin(),
179          E = SU->getInstr()->operands_end(); It != E; ++It) {
180        MachineOperand &MO = *It;
181        if (MO.isReg() && MO.getReg() == AMDGPU::ALU_LITERAL_X)
182          ++CurEmitted;
183      }
184    }
185    }
186  } else {
187    ++CurEmitted;
188  }
189
190
191  DEBUG(dbgs() << CurEmitted << " Instructions Emitted in this clause\n");
192
193  if (CurInstKind != IDFetch) {
194    MoveUnits(Pending[IDFetch], Available[IDFetch]);
195  } else
196    FetchInstCount++;
197}
198
199static bool
200isPhysicalRegCopy(MachineInstr *MI) {
201  if (MI->getOpcode() != AMDGPU::COPY)
202    return false;
203
204  return !TargetRegisterInfo::isVirtualRegister(MI->getOperand(1).getReg());
205}
206
207void R600SchedStrategy::releaseTopNode(SUnit *SU) {
208  DEBUG(dbgs() << "Top Releasing ";SU->dump(DAG););
209}
210
211void R600SchedStrategy::releaseBottomNode(SUnit *SU) {
212  DEBUG(dbgs() << "Bottom Releasing ";SU->dump(DAG););
213  if (isPhysicalRegCopy(SU->getInstr())) {
214    PhysicalRegCopy.push_back(SU);
215    return;
216  }
217
218  int IK = getInstKind(SU);
219
220  // Check for AR register defines
221  for (MachineInstr::const_mop_iterator I = SU->getInstr()->operands_begin(),
222                                        E = SU->getInstr()->operands_end();
223                                        I != E; ++I) {
224    if (I->isReg() && I->getReg() == AMDGPU::AR_X) {
225      if (I->isDef()) {
226        UnscheduledARDefs.push_back(SU);
227      } else {
228        UnscheduledARUses.push_back(SU);
229      }
230      return;
231    }
232  }
233
234  // There is no export clause, we can schedule one as soon as its ready
235  if (IK == IDOther)
236    Available[IDOther].push_back(SU);
237  else
238    Pending[IK].push_back(SU);
239
240}
241
242bool R600SchedStrategy::regBelongsToClass(unsigned Reg,
243                                          const TargetRegisterClass *RC) const {
244  if (!TargetRegisterInfo::isVirtualRegister(Reg)) {
245    return RC->contains(Reg);
246  } else {
247    return MRI->getRegClass(Reg) == RC;
248  }
249}
250
251R600SchedStrategy::AluKind R600SchedStrategy::getAluKind(SUnit *SU) const {
252  MachineInstr *MI = SU->getInstr();
253
254    switch (MI->getOpcode()) {
255    case AMDGPU::PRED_X:
256      return AluPredX;
257    case AMDGPU::INTERP_PAIR_XY:
258    case AMDGPU::INTERP_PAIR_ZW:
259    case AMDGPU::INTERP_VEC_LOAD:
260    case AMDGPU::DOT_4:
261      return AluT_XYZW;
262    case AMDGPU::COPY:
263      if (MI->getOperand(1).isUndef()) {
264        // MI will become a KILL, don't considers it in scheduling
265        return AluDiscarded;
266      }
267    default:
268      break;
269    }
270
271    // Does the instruction take a whole IG ?
272    // XXX: Is it possible to add a helper function in R600InstrInfo that can
273    // be used here and in R600PacketizerList::isSoloInstruction() ?
274    if(TII->isVector(*MI) ||
275        TII->isCubeOp(MI->getOpcode()) ||
276        TII->isReductionOp(MI->getOpcode()) ||
277        MI->getOpcode() == AMDGPU::GROUP_BARRIER) {
278      return AluT_XYZW;
279    }
280
281    if (TII->isLDSInstr(MI->getOpcode())) {
282      return AluT_X;
283    }
284
285    // Is the result already assigned to a channel ?
286    unsigned DestSubReg = MI->getOperand(0).getSubReg();
287    switch (DestSubReg) {
288    case AMDGPU::sub0:
289      return AluT_X;
290    case AMDGPU::sub1:
291      return AluT_Y;
292    case AMDGPU::sub2:
293      return AluT_Z;
294    case AMDGPU::sub3:
295      return AluT_W;
296    default:
297      break;
298    }
299
300    // Is the result already member of a X/Y/Z/W class ?
301    unsigned DestReg = MI->getOperand(0).getReg();
302    if (regBelongsToClass(DestReg, &AMDGPU::R600_TReg32_XRegClass) ||
303        regBelongsToClass(DestReg, &AMDGPU::R600_AddrRegClass))
304      return AluT_X;
305    if (regBelongsToClass(DestReg, &AMDGPU::R600_TReg32_YRegClass))
306      return AluT_Y;
307    if (regBelongsToClass(DestReg, &AMDGPU::R600_TReg32_ZRegClass))
308      return AluT_Z;
309    if (regBelongsToClass(DestReg, &AMDGPU::R600_TReg32_WRegClass))
310      return AluT_W;
311    if (regBelongsToClass(DestReg, &AMDGPU::R600_Reg128RegClass))
312      return AluT_XYZW;
313
314    return AluAny;
315
316}
317
318int R600SchedStrategy::getInstKind(SUnit* SU) {
319  int Opcode = SU->getInstr()->getOpcode();
320
321  if (TII->usesTextureCache(Opcode) || TII->usesVertexCache(Opcode))
322    return IDFetch;
323
324  if (TII->isALUInstr(Opcode)) {
325    return IDAlu;
326  }
327
328  switch (Opcode) {
329  case AMDGPU::PRED_X:
330  case AMDGPU::COPY:
331  case AMDGPU::CONST_COPY:
332  case AMDGPU::INTERP_PAIR_XY:
333  case AMDGPU::INTERP_PAIR_ZW:
334  case AMDGPU::INTERP_VEC_LOAD:
335  case AMDGPU::DOT_4:
336    return IDAlu;
337  default:
338    return IDOther;
339  }
340}
341
342SUnit *R600SchedStrategy::PopInst(std::vector<SUnit *> &Q) {
343  if (Q.empty())
344    return NULL;
345  for (std::vector<SUnit *>::reverse_iterator It = Q.rbegin(), E = Q.rend();
346      It != E; ++It) {
347    SUnit *SU = *It;
348    InstructionsGroupCandidate.push_back(SU->getInstr());
349    if (TII->canBundle(InstructionsGroupCandidate)) {
350      InstructionsGroupCandidate.pop_back();
351      Q.erase((It + 1).base());
352      return SU;
353    } else {
354      InstructionsGroupCandidate.pop_back();
355    }
356  }
357  return NULL;
358}
359
360void R600SchedStrategy::LoadAlu() {
361  std::vector<SUnit *> &QSrc = Pending[IDAlu];
362  for (unsigned i = 0, e = QSrc.size(); i < e; ++i) {
363    AluKind AK = getAluKind(QSrc[i]);
364    AvailableAlus[AK].push_back(QSrc[i]);
365  }
366  QSrc.clear();
367}
368
369void R600SchedStrategy::PrepareNextSlot() {
370  DEBUG(dbgs() << "New Slot\n");
371  assert (OccupedSlotsMask && "Slot wasn't filled");
372  OccupedSlotsMask = 0;
373  InstructionsGroupCandidate.clear();
374  LoadAlu();
375}
376
377void R600SchedStrategy::AssignSlot(MachineInstr* MI, unsigned Slot) {
378  int DstIndex = TII->getOperandIdx(MI->getOpcode(), AMDGPU::OpName::dst);
379  if (DstIndex == -1) {
380    return;
381  }
382  unsigned DestReg = MI->getOperand(DstIndex).getReg();
383  // PressureRegister crashes if an operand is def and used in the same inst
384  // and we try to constraint its regclass
385  for (MachineInstr::mop_iterator It = MI->operands_begin(),
386      E = MI->operands_end(); It != E; ++It) {
387    MachineOperand &MO = *It;
388    if (MO.isReg() && !MO.isDef() &&
389        MO.getReg() == DestReg)
390      return;
391  }
392  // Constrains the regclass of DestReg to assign it to Slot
393  switch (Slot) {
394  case 0:
395    MRI->constrainRegClass(DestReg, &AMDGPU::R600_TReg32_XRegClass);
396    break;
397  case 1:
398    MRI->constrainRegClass(DestReg, &AMDGPU::R600_TReg32_YRegClass);
399    break;
400  case 2:
401    MRI->constrainRegClass(DestReg, &AMDGPU::R600_TReg32_ZRegClass);
402    break;
403  case 3:
404    MRI->constrainRegClass(DestReg, &AMDGPU::R600_TReg32_WRegClass);
405    break;
406  }
407}
408
409SUnit *R600SchedStrategy::AttemptFillSlot(unsigned Slot) {
410  static const AluKind IndexToID[] = {AluT_X, AluT_Y, AluT_Z, AluT_W};
411  SUnit *SlotedSU = PopInst(AvailableAlus[IndexToID[Slot]]);
412  if (SlotedSU)
413    return SlotedSU;
414  SUnit *UnslotedSU = PopInst(AvailableAlus[AluAny]);
415  if (UnslotedSU)
416    AssignSlot(UnslotedSU->getInstr(), Slot);
417  return UnslotedSU;
418}
419
420unsigned R600SchedStrategy::AvailablesAluCount() const {
421  return AvailableAlus[AluAny].size() + AvailableAlus[AluT_XYZW].size() +
422      AvailableAlus[AluT_X].size() + AvailableAlus[AluT_Y].size() +
423      AvailableAlus[AluT_Z].size() + AvailableAlus[AluT_W].size() +
424      AvailableAlus[AluDiscarded].size() + AvailableAlus[AluPredX].size();
425}
426
427SUnit* R600SchedStrategy::pickAlu() {
428  while (AvailablesAluCount() || !Pending[IDAlu].empty()) {
429    if (!OccupedSlotsMask) {
430      // Bottom up scheduling : predX must comes first
431      if (!AvailableAlus[AluPredX].empty()) {
432        OccupedSlotsMask = 15;
433        return PopInst(AvailableAlus[AluPredX]);
434      }
435      // Flush physical reg copies (RA will discard them)
436      if (!AvailableAlus[AluDiscarded].empty()) {
437        OccupedSlotsMask = 15;
438        return PopInst(AvailableAlus[AluDiscarded]);
439      }
440      // If there is a T_XYZW alu available, use it
441      if (!AvailableAlus[AluT_XYZW].empty()) {
442        OccupedSlotsMask = 15;
443        return PopInst(AvailableAlus[AluT_XYZW]);
444      }
445    }
446    for (int Chan = 3; Chan > -1; --Chan) {
447      bool isOccupied = OccupedSlotsMask & (1 << Chan);
448      if (!isOccupied) {
449        SUnit *SU = AttemptFillSlot(Chan);
450        if (SU) {
451          OccupedSlotsMask |= (1 << Chan);
452          InstructionsGroupCandidate.push_back(SU->getInstr());
453          return SU;
454        }
455      }
456    }
457    PrepareNextSlot();
458  }
459  return NULL;
460}
461
462SUnit* R600SchedStrategy::pickOther(int QID) {
463  SUnit *SU = 0;
464  std::vector<SUnit *> &AQ = Available[QID];
465
466  if (AQ.empty()) {
467    MoveUnits(Pending[QID], AQ);
468  }
469  if (!AQ.empty()) {
470    SU = AQ.back();
471    AQ.resize(AQ.size() - 1);
472  }
473  return SU;
474}
475
476