blob: b9e5788cf01876e3eef082a1f1da28e2afd012b9 [file] [log] [blame]
Jonas Paulsson8010b632016-10-20 08:27:16 +00001//=-- SystemZHazardRecognizer.h - SystemZ Hazard Recognizer -----*- 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// This file defines a hazard recognizer for the SystemZ scheduler.
11//
12// This class is used by the SystemZ scheduling strategy to maintain
13// the state during scheduling, and provide cost functions for
14// scheduling candidates. This includes:
15//
16// * Decoder grouping. A decoder group can maximally hold 3 uops, and
17// instructions that always begin a new group should be scheduled when
18// the current decoder group is empty.
19// * Processor resources usage. It is beneficial to balance the use of
20// resources.
21//
Jonas Paulsson57a705d2017-08-17 08:33:44 +000022// A goal is to consider all instructions, also those outside of any
23// scheduling region. Such instructions are "advanced" past and include
24// single instructions before a scheduling region, branches etc.
25//
26// A block that has only one predecessor continues scheduling with the state
27// of it (which may be updated by emitting branches).
28//
Jonas Paulsson8010b632016-10-20 08:27:16 +000029// ===---------------------------------------------------------------------===//
30
31#include "SystemZHazardRecognizer.h"
32#include "llvm/ADT/Statistic.h"
33
34using namespace llvm;
35
Evandro Menezes0cd23f562017-07-11 22:08:28 +000036#define DEBUG_TYPE "machine-scheduler"
Jonas Paulsson8010b632016-10-20 08:27:16 +000037
38// This is the limit of processor resource usage at which the
39// scheduler should try to look for other instructions (not using the
40// critical resource).
Benjamin Kramerffd37152016-11-19 20:44:26 +000041static cl::opt<int> ProcResCostLim("procres-cost-lim", cl::Hidden,
42 cl::desc("The OOO window for processor "
43 "resources during scheduling."),
44 cl::init(8));
Jonas Paulsson8010b632016-10-20 08:27:16 +000045
Jonas Paulsson8010b632016-10-20 08:27:16 +000046unsigned SystemZHazardRecognizer::
47getNumDecoderSlots(SUnit *SU) const {
Jonas Paulsson57a705d2017-08-17 08:33:44 +000048 const MCSchedClassDesc *SC = getSchedClass(SU);
Jonas Paulsson8010b632016-10-20 08:27:16 +000049 if (!SC->isValid())
50 return 0; // IMPLICIT_DEF / KILL -- will not make impact in output.
51
52 if (SC->BeginGroup) {
53 if (!SC->EndGroup)
54 return 2; // Cracked instruction
55 else
56 return 3; // Expanded/group-alone instruction
57 }
Fangrui Songf78650a2018-07-30 19:41:25 +000058
Jonas Paulsson8010b632016-10-20 08:27:16 +000059 return 1; // Normal instruction
60}
61
Jonas Paulsson9b0f28f2018-03-07 08:54:32 +000062unsigned SystemZHazardRecognizer::getCurrCycleIdx(SUnit *SU) const {
Jonas Paulsson8010b632016-10-20 08:27:16 +000063 unsigned Idx = CurrGroupSize;
64 if (GrpCount % 2)
65 Idx += 3;
Jonas Paulsson9b0f28f2018-03-07 08:54:32 +000066
67 if (SU != nullptr && !fitsIntoCurrentGroup(SU)) {
68 if (Idx == 1 || Idx == 2)
69 Idx = 3;
70 else if (Idx == 4 || Idx == 5)
71 Idx = 0;
72 }
73
Jonas Paulsson8010b632016-10-20 08:27:16 +000074 return Idx;
75}
76
77ScheduleHazardRecognizer::HazardType SystemZHazardRecognizer::
78getHazardType(SUnit *m, int Stalls) {
79 return (fitsIntoCurrentGroup(m) ? NoHazard : Hazard);
80}
81
82void SystemZHazardRecognizer::Reset() {
83 CurrGroupSize = 0;
Jonas Paulsson2f12e452018-07-31 13:00:42 +000084 CurrGroupHas4RegOps = false;
Jonas Paulsson8010b632016-10-20 08:27:16 +000085 clearProcResCounters();
86 GrpCount = 0;
87 LastFPdOpCycleIdx = UINT_MAX;
Jonas Paulsson57a705d2017-08-17 08:33:44 +000088 LastEmittedMI = nullptr;
Nicola Zaghend34e60c2018-05-14 12:53:11 +000089 LLVM_DEBUG(CurGroupDbg = "";);
Jonas Paulsson8010b632016-10-20 08:27:16 +000090}
91
92bool
93SystemZHazardRecognizer::fitsIntoCurrentGroup(SUnit *SU) const {
Jonas Paulsson57a705d2017-08-17 08:33:44 +000094 const MCSchedClassDesc *SC = getSchedClass(SU);
Jonas Paulsson8010b632016-10-20 08:27:16 +000095 if (!SC->isValid())
96 return true;
97
98 // A cracked instruction only fits into schedule if the current
99 // group is empty.
100 if (SC->BeginGroup)
101 return (CurrGroupSize == 0);
102
Jonas Paulsson2f12e452018-07-31 13:00:42 +0000103 // An instruction with 4 register operands will not fit in last slot.
Jonas Paulsson590b1fc2018-07-31 19:58:42 +0000104 assert ((CurrGroupSize < 2 || !CurrGroupHas4RegOps) &&
Jonas Paulsson2f12e452018-07-31 13:00:42 +0000105 "Current decoder group is already full!");
106 if (CurrGroupSize == 2 && has4RegOps(SU->getInstr()))
107 return false;
108
Jonas Paulsson8010b632016-10-20 08:27:16 +0000109 // Since a full group is handled immediately in EmitInstruction(),
110 // SU should fit into current group. NumSlots should be 1 or 0,
111 // since it is not a cracked or expanded instruction.
112 assert ((getNumDecoderSlots(SU) <= 1) && (CurrGroupSize < 3) &&
113 "Expected normal instruction to fit in non-full group!");
114
115 return true;
116}
117
Jonas Paulsson2f12e452018-07-31 13:00:42 +0000118bool SystemZHazardRecognizer::has4RegOps(const MachineInstr *MI) const {
119 const MachineFunction &MF = *MI->getParent()->getParent();
120 const TargetRegisterInfo *TRI = &TII->getRegisterInfo();
121 const MCInstrDesc &MID = MI->getDesc();
122 unsigned Count = 0;
123 for (unsigned OpIdx = 0; OpIdx < MID.getNumOperands(); OpIdx++) {
124 const TargetRegisterClass *RC = TII->getRegClass(MID, OpIdx, TRI, MF);
125 if (RC == nullptr)
126 continue;
127 if (OpIdx >= MID.getNumDefs() &&
128 MID.getOperandConstraint(OpIdx, MCOI::TIED_TO) != -1)
129 continue;
130 Count++;
131 }
132 return Count >= 4;
133}
134
Jonas Paulsson61fbcf52018-03-07 08:39:00 +0000135void SystemZHazardRecognizer::nextGroup() {
136 if (CurrGroupSize == 0)
137 return;
Jonas Paulsson8010b632016-10-20 08:27:16 +0000138
Nicola Zaghend34e60c2018-05-14 12:53:11 +0000139 LLVM_DEBUG(dumpCurrGroup("Completed decode group"));
140 LLVM_DEBUG(CurGroupDbg = "";);
Jonas Paulsson8010b632016-10-20 08:27:16 +0000141
Jonas Paulsson61fbcf52018-03-07 08:39:00 +0000142 GrpCount++;
Jonas Paulsson8010b632016-10-20 08:27:16 +0000143
Jonas Paulsson61fbcf52018-03-07 08:39:00 +0000144 // Reset counter for next group.
145 CurrGroupSize = 0;
Jonas Paulsson2f12e452018-07-31 13:00:42 +0000146 CurrGroupHas4RegOps = false;
Jonas Paulsson8010b632016-10-20 08:27:16 +0000147
Jonas Paulsson61fbcf52018-03-07 08:39:00 +0000148 // Decrease counters for execution units by one.
149 for (unsigned i = 0; i < SchedModel->getNumProcResourceKinds(); ++i)
150 if (ProcResourceCounters[i] > 0)
151 ProcResourceCounters[i]--;
Jonas Paulsson8010b632016-10-20 08:27:16 +0000152
Jonas Paulsson61fbcf52018-03-07 08:39:00 +0000153 // Clear CriticalResourceIdx if it is now below the threshold.
154 if (CriticalResourceIdx != UINT_MAX &&
155 (ProcResourceCounters[CriticalResourceIdx] <=
156 ProcResCostLim))
157 CriticalResourceIdx = UINT_MAX;
158
Nicola Zaghend34e60c2018-05-14 12:53:11 +0000159 LLVM_DEBUG(dumpState(););
Jonas Paulsson8010b632016-10-20 08:27:16 +0000160}
161
162#ifndef NDEBUG // Debug output
163void SystemZHazardRecognizer::dumpSU(SUnit *SU, raw_ostream &OS) const {
164 OS << "SU(" << SU->NodeNum << "):";
Jonas Paulsson57a705d2017-08-17 08:33:44 +0000165 OS << TII->getName(SU->getInstr()->getOpcode());
Jonas Paulsson8010b632016-10-20 08:27:16 +0000166
Jonas Paulsson57a705d2017-08-17 08:33:44 +0000167 const MCSchedClassDesc *SC = getSchedClass(SU);
Jonas Paulsson8010b632016-10-20 08:27:16 +0000168 if (!SC->isValid())
169 return;
Fangrui Songf78650a2018-07-30 19:41:25 +0000170
Jonas Paulsson8010b632016-10-20 08:27:16 +0000171 for (TargetSchedModel::ProcResIter
172 PI = SchedModel->getWriteProcResBegin(SC),
173 PE = SchedModel->getWriteProcResEnd(SC); PI != PE; ++PI) {
174 const MCProcResourceDesc &PRD =
175 *SchedModel->getProcResource(PI->ProcResourceIdx);
176 std::string FU(PRD.Name);
177 // trim e.g. Z13_FXaUnit -> FXa
178 FU = FU.substr(FU.find("_") + 1);
Jonas Paulsson59c94be2018-07-23 15:08:35 +0000179 size_t Pos = FU.find("Unit");
180 if (Pos != std::string::npos)
181 FU.resize(Pos);
182 if (FU == "LS") // LSUnit -> LSU
183 FU = "LSU";
Jonas Paulsson8010b632016-10-20 08:27:16 +0000184 OS << "/" << FU;
185
186 if (PI->Cycles > 1)
187 OS << "(" << PI->Cycles << "cyc)";
188 }
189
190 if (SC->NumMicroOps > 1)
191 OS << "/" << SC->NumMicroOps << "uops";
192 if (SC->BeginGroup && SC->EndGroup)
193 OS << "/GroupsAlone";
194 else if (SC->BeginGroup)
195 OS << "/BeginsGroup";
196 else if (SC->EndGroup)
197 OS << "/EndsGroup";
198 if (SU->isUnbuffered)
199 OS << "/Unbuffered";
Jonas Paulsson2f12e452018-07-31 13:00:42 +0000200 if (has4RegOps(SU->getInstr()))
201 OS << "/4RegOps";
Jonas Paulsson8010b632016-10-20 08:27:16 +0000202}
203
204void SystemZHazardRecognizer::dumpCurrGroup(std::string Msg) const {
Jonas Paulsson61fbcf52018-03-07 08:39:00 +0000205 dbgs() << "++ " << Msg;
Jonas Paulsson8010b632016-10-20 08:27:16 +0000206 dbgs() << ": ";
207
208 if (CurGroupDbg.empty())
209 dbgs() << " <empty>\n";
210 else {
211 dbgs() << "{ " << CurGroupDbg << " }";
212 dbgs() << " (" << CurrGroupSize << " decoder slot"
213 << (CurrGroupSize > 1 ? "s":"")
Jonas Paulsson2f12e452018-07-31 13:00:42 +0000214 << (CurrGroupHas4RegOps ? ", 4RegOps" : "")
Jonas Paulsson8010b632016-10-20 08:27:16 +0000215 << ")\n";
216 }
217}
218
219void SystemZHazardRecognizer::dumpProcResourceCounters() const {
220 bool any = false;
221
222 for (unsigned i = 0; i < SchedModel->getNumProcResourceKinds(); ++i)
223 if (ProcResourceCounters[i] > 0) {
224 any = true;
225 break;
226 }
227
228 if (!any)
229 return;
230
Jonas Paulsson61fbcf52018-03-07 08:39:00 +0000231 dbgs() << "++ | Resource counters: ";
Jonas Paulsson8010b632016-10-20 08:27:16 +0000232 for (unsigned i = 0; i < SchedModel->getNumProcResourceKinds(); ++i)
Jonas Paulsson61fbcf52018-03-07 08:39:00 +0000233 if (ProcResourceCounters[i] > 0)
234 dbgs() << SchedModel->getProcResource(i)->Name
235 << ":" << ProcResourceCounters[i] << " ";
236 dbgs() << "\n";
237
238 if (CriticalResourceIdx != UINT_MAX)
239 dbgs() << "++ | Critical resource: "
240 << SchedModel->getProcResource(CriticalResourceIdx)->Name
241 << "\n";
Jonas Paulsson8010b632016-10-20 08:27:16 +0000242}
Jonas Paulsson61fbcf52018-03-07 08:39:00 +0000243
244void SystemZHazardRecognizer::dumpState() const {
245 dumpCurrGroup("| Current decoder group");
246 dbgs() << "++ | Current cycle index: "
247 << getCurrCycleIdx() << "\n";
248 dumpProcResourceCounters();
249 if (LastFPdOpCycleIdx != UINT_MAX)
250 dbgs() << "++ | Last FPd cycle index: " << LastFPdOpCycleIdx << "\n";
251}
252
Jonas Paulsson8010b632016-10-20 08:27:16 +0000253#endif //NDEBUG
254
255void SystemZHazardRecognizer::clearProcResCounters() {
256 ProcResourceCounters.assign(SchedModel->getNumProcResourceKinds(), 0);
257 CriticalResourceIdx = UINT_MAX;
258}
259
Jonas Paulsson57a705d2017-08-17 08:33:44 +0000260static inline bool isBranchRetTrap(MachineInstr *MI) {
261 return (MI->isBranch() || MI->isReturn() ||
262 MI->getOpcode() == SystemZ::CondTrap);
263}
264
Jonas Paulsson8010b632016-10-20 08:27:16 +0000265// Update state with SU as the next scheduled unit.
266void SystemZHazardRecognizer::
267EmitInstruction(SUnit *SU) {
Jonas Paulsson57a705d2017-08-17 08:33:44 +0000268 const MCSchedClassDesc *SC = getSchedClass(SU);
Nicola Zaghend34e60c2018-05-14 12:53:11 +0000269 LLVM_DEBUG(dbgs() << "++ HazardRecognizer emitting "; dumpSU(SU, dbgs());
270 dbgs() << "\n";);
271 LLVM_DEBUG(dumpCurrGroup("Decode group before emission"););
Jonas Paulsson8010b632016-10-20 08:27:16 +0000272
273 // If scheduling an SU that must begin a new decoder group, move on
274 // to next group.
275 if (!fitsIntoCurrentGroup(SU))
276 nextGroup();
277
Nicola Zaghend34e60c2018-05-14 12:53:11 +0000278 LLVM_DEBUG(raw_string_ostream cgd(CurGroupDbg);
279 if (CurGroupDbg.length()) cgd << ", "; dumpSU(SU, cgd););
Jonas Paulsson8010b632016-10-20 08:27:16 +0000280
Jonas Paulsson57a705d2017-08-17 08:33:44 +0000281 LastEmittedMI = SU->getInstr();
282
Jonas Paulsson8010b632016-10-20 08:27:16 +0000283 // After returning from a call, we don't know much about the state.
Jonas Paulsson57a705d2017-08-17 08:33:44 +0000284 if (SU->isCall) {
Nicola Zaghend34e60c2018-05-14 12:53:11 +0000285 LLVM_DEBUG(dbgs() << "++ Clearing state after call.\n";);
Jonas Paulsson91c853a2018-03-07 08:57:09 +0000286 Reset();
287 LastEmittedMI = SU->getInstr();
Jonas Paulsson8010b632016-10-20 08:27:16 +0000288 return;
289 }
290
291 // Increase counter for execution unit(s).
292 for (TargetSchedModel::ProcResIter
293 PI = SchedModel->getWriteProcResBegin(SC),
294 PE = SchedModel->getWriteProcResEnd(SC); PI != PE; ++PI) {
295 // Don't handle FPd together with the other resources.
296 if (SchedModel->getProcResource(PI->ProcResourceIdx)->BufferSize == 1)
297 continue;
298 int &CurrCounter =
299 ProcResourceCounters[PI->ProcResourceIdx];
300 CurrCounter += PI->Cycles;
301 // Check if this is now the new critical resource.
302 if ((CurrCounter > ProcResCostLim) &&
303 (CriticalResourceIdx == UINT_MAX ||
304 (PI->ProcResourceIdx != CriticalResourceIdx &&
305 CurrCounter >
306 ProcResourceCounters[CriticalResourceIdx]))) {
Nicola Zaghend34e60c2018-05-14 12:53:11 +0000307 LLVM_DEBUG(
308 dbgs() << "++ New critical resource: "
309 << SchedModel->getProcResource(PI->ProcResourceIdx)->Name
310 << "\n";);
Jonas Paulsson8010b632016-10-20 08:27:16 +0000311 CriticalResourceIdx = PI->ProcResourceIdx;
312 }
313 }
314
315 // Make note of an instruction that uses a blocking resource (FPd).
316 if (SU->isUnbuffered) {
Jonas Paulsson9b0f28f2018-03-07 08:54:32 +0000317 LastFPdOpCycleIdx = getCurrCycleIdx(SU);
Nicola Zaghend34e60c2018-05-14 12:53:11 +0000318 LLVM_DEBUG(dbgs() << "++ Last FPd cycle index: " << LastFPdOpCycleIdx
319 << "\n";);
Jonas Paulsson8010b632016-10-20 08:27:16 +0000320 }
321
322 // Insert SU into current group by increasing number of slots used
323 // in current group.
324 CurrGroupSize += getNumDecoderSlots(SU);
Jonas Paulsson2f12e452018-07-31 13:00:42 +0000325 CurrGroupHas4RegOps |= has4RegOps(SU->getInstr());
326 unsigned GroupLim =
327 ((CurrGroupHas4RegOps && getNumDecoderSlots(SU) < 3) ? 2 : 3);
328 assert (CurrGroupSize <= GroupLim && "SU does not fit into decoder group!");
Jonas Paulsson8010b632016-10-20 08:27:16 +0000329
330 // Check if current group is now full/ended. If so, move on to next
331 // group to be ready to evaluate more candidates.
Jonas Paulsson2f12e452018-07-31 13:00:42 +0000332 if (CurrGroupSize == GroupLim || SC->EndGroup)
Jonas Paulsson8010b632016-10-20 08:27:16 +0000333 nextGroup();
334}
335
336int SystemZHazardRecognizer::groupingCost(SUnit *SU) const {
Jonas Paulsson57a705d2017-08-17 08:33:44 +0000337 const MCSchedClassDesc *SC = getSchedClass(SU);
Jonas Paulsson8010b632016-10-20 08:27:16 +0000338 if (!SC->isValid())
339 return 0;
Fangrui Songf78650a2018-07-30 19:41:25 +0000340
Jonas Paulsson8010b632016-10-20 08:27:16 +0000341 // If SU begins new group, it can either break a current group early
342 // or fit naturally if current group is empty (negative cost).
343 if (SC->BeginGroup) {
344 if (CurrGroupSize)
345 return 3 - CurrGroupSize;
346 return -1;
347 }
348
349 // Similarly, a group-ending SU may either fit well (last in group), or
350 // end the group prematurely.
351 if (SC->EndGroup) {
352 unsigned resultingGroupSize =
353 (CurrGroupSize + getNumDecoderSlots(SU));
354 if (resultingGroupSize < 3)
355 return (3 - resultingGroupSize);
356 return -1;
357 }
358
Jonas Paulsson2f12e452018-07-31 13:00:42 +0000359 // An instruction with 4 register operands will not fit in last slot.
360 if (CurrGroupSize == 2 && has4RegOps(SU->getInstr()))
361 return 1;
362
Jonas Paulsson8010b632016-10-20 08:27:16 +0000363 // Most instructions can be placed in any decoder slot.
364 return 0;
365}
366
Jonas Paulsson9b0f28f2018-03-07 08:54:32 +0000367bool SystemZHazardRecognizer::isFPdOpPreferred_distance(SUnit *SU) const {
Jonas Paulsson8010b632016-10-20 08:27:16 +0000368 assert (SU->isUnbuffered);
369 // If this is the first FPd op, it should be scheduled high.
370 if (LastFPdOpCycleIdx == UINT_MAX)
371 return true;
372 // If this is not the first PFd op, it should go into the other side
373 // of the processor to use the other FPd unit there. This should
374 // generally happen if two FPd ops are placed with 2 other
375 // instructions between them (modulo 6).
Jonas Paulsson9b0f28f2018-03-07 08:54:32 +0000376 unsigned SUCycleIdx = getCurrCycleIdx(SU);
377 if (LastFPdOpCycleIdx > SUCycleIdx)
378 return ((LastFPdOpCycleIdx - SUCycleIdx) == 3);
379 return ((SUCycleIdx - LastFPdOpCycleIdx) == 3);
Jonas Paulsson8010b632016-10-20 08:27:16 +0000380}
381
382int SystemZHazardRecognizer::
383resourcesCost(SUnit *SU) {
384 int Cost = 0;
385
Jonas Paulsson57a705d2017-08-17 08:33:44 +0000386 const MCSchedClassDesc *SC = getSchedClass(SU);
Jonas Paulsson8010b632016-10-20 08:27:16 +0000387 if (!SC->isValid())
388 return 0;
389
390 // For a FPd op, either return min or max value as indicated by the
391 // distance to any prior FPd op.
392 if (SU->isUnbuffered)
393 Cost = (isFPdOpPreferred_distance(SU) ? INT_MIN : INT_MAX);
394 // For other instructions, give a cost to the use of the critical resource.
395 else if (CriticalResourceIdx != UINT_MAX) {
396 for (TargetSchedModel::ProcResIter
397 PI = SchedModel->getWriteProcResBegin(SC),
398 PE = SchedModel->getWriteProcResEnd(SC); PI != PE; ++PI)
399 if (PI->ProcResourceIdx == CriticalResourceIdx)
400 Cost = PI->Cycles;
401 }
402
403 return Cost;
404}
405
Jonas Paulsson57a705d2017-08-17 08:33:44 +0000406void SystemZHazardRecognizer::emitInstruction(MachineInstr *MI,
407 bool TakenBranch) {
408 // Make a temporary SUnit.
409 SUnit SU(MI, 0);
410
411 // Set interesting flags.
412 SU.isCall = MI->isCall();
413
414 const MCSchedClassDesc *SC = SchedModel->resolveSchedClass(MI);
415 for (const MCWriteProcResEntry &PRE :
416 make_range(SchedModel->getWriteProcResBegin(SC),
417 SchedModel->getWriteProcResEnd(SC))) {
418 switch (SchedModel->getProcResource(PRE.ProcResourceIdx)->BufferSize) {
419 case 0:
420 SU.hasReservedResource = true;
421 break;
422 case 1:
423 SU.isUnbuffered = true;
424 break;
425 default:
426 break;
427 }
428 }
429
Jonas Paulssone18dbeb2018-03-07 08:45:09 +0000430 unsigned GroupSizeBeforeEmit = CurrGroupSize;
Jonas Paulsson57a705d2017-08-17 08:33:44 +0000431 EmitInstruction(&SU);
432
Jonas Paulssone18dbeb2018-03-07 08:45:09 +0000433 if (!TakenBranch && isBranchRetTrap(MI)) {
434 // NT Branch on second slot ends group.
435 if (GroupSizeBeforeEmit == 1)
436 nextGroup();
437 }
438
Jonas Paulsson57a705d2017-08-17 08:33:44 +0000439 if (TakenBranch && CurrGroupSize > 0)
Jonas Paulsson61fbcf52018-03-07 08:39:00 +0000440 nextGroup();
Jonas Paulsson57a705d2017-08-17 08:33:44 +0000441
442 assert ((!MI->isTerminator() || isBranchRetTrap(MI)) &&
443 "Scheduler: unhandled terminator!");
444}
445
446void SystemZHazardRecognizer::
447copyState(SystemZHazardRecognizer *Incoming) {
448 // Current decoder group
449 CurrGroupSize = Incoming->CurrGroupSize;
Nicola Zaghend34e60c2018-05-14 12:53:11 +0000450 LLVM_DEBUG(CurGroupDbg = Incoming->CurGroupDbg;);
Jonas Paulsson57a705d2017-08-17 08:33:44 +0000451
452 // Processor resources
453 ProcResourceCounters = Incoming->ProcResourceCounters;
454 CriticalResourceIdx = Incoming->CriticalResourceIdx;
455
456 // FPd
457 LastFPdOpCycleIdx = Incoming->LastFPdOpCycleIdx;
458 GrpCount = Incoming->GrpCount;
459}