Lines Matching defs:VRMap
119 ValueMapTy *VRMap = new ValueMapTy[(MaxStageCount + 1) * 2];
131 generateProlog(MaxStageCount, KernelBB, VRMap, PrologBBs);
142 updateInstruction(NewMI, false, MaxStageCount, StageNum, VRMap);
151 updateInstruction(NewMI, false, MaxStageCount, 0, VRMap);
160 generateExistingPhis(KernelBB, PrologBBs.back(), KernelBB, KernelBB, VRMap,
162 generatePhis(KernelBB, PrologBBs.back(), KernelBB, KernelBB, VRMap, VRMapPhi,
169 generateEpilog(MaxStageCount, KernelBB, BB, VRMap, VRMapPhi, EpilogBBs,
180 addBranches(*Preheader, PrologBBs, KernelBB, EpilogBBs, VRMap);
182 delete[] VRMap;
197 ValueMapTy *VRMap,
227 updateInstruction(NewMI, false, i, (unsigned)StageNum, VRMap);
233 rewritePhiValues(NewBB, i, VRMap, InstrMap);
256 ValueMapTy *VRMap, ValueMapTy *VRMapPhi, MBBVectorTy &EpilogBBs,
304 updateInstruction(NewMI, i == 1, EpilogStage, 0, VRMap);
310 generateExistingPhis(NewBB, PrologBBs[i - 1], PredBB, KernelBB, VRMap,
312 generatePhis(NewBB, PrologBBs[i - 1], PredBB, KernelBB, VRMap, VRMapPhi,
371 MachineBasicBlock *KernelBB, ValueMapTy *VRMap, InstrMapTy &InstrMap,
400 if (auto It = VRMap[LastStageNum].find(LoopVal);
401 It != VRMap[LastStageNum].end())
410 unsigned NewReg = VRMap[PrevStage][LoopVal];
413 if (VRMap[CurStageNum].count(LoopVal))
414 VRMap[CurStageNum][Def] = VRMap[CurStageNum][LoopVal];
448 VRMap[PrologStage - StageDiff - np].count(LoopVal) != 0)
449 PhiOp1 = VRMap[PrologStage - StageDiff - np][LoopVal];
468 VRMap[PrologStage - StageAdj - Indirects - np].count(PhiOp1)) {
469 PhiOp1 = VRMap[PrologStage - StageAdj - Indirects - np][PhiOp1];
495 VRMap[PrevStage - StageDiffAdj].count(LoopVal))
496 PhiOp2 = VRMap[PrevStage - StageDiffAdj][LoopVal];
500 VRMap[PrevStage - np + 1].count(Def))
501 PhiOp2 = VRMap[PrevStage - np + 1][Def];
504 VRMap[PrevStage - StageDiffAdj - np].count(LoopVal))
505 PhiOp2 = VRMap[PrevStage - StageDiffAdj - np][LoopVal];
508 else if (VRMap[PrevStage - np].count(Def) &&
511 PhiOp2 = VRMap[PrevStage - np][Def];
524 if (LVNumStages > (int)np && VRMap[CurStageNum].count(LoopVal)) {
531 if (VRMap[ReuseStage - np].count(LoopVal)) {
532 NewReg = VRMap[ReuseStage - np][LoopVal];
537 VRMap[CurStageNum - np][Def] = NewReg;
539 if (VRMap[LastStageNum - np - 1].count(LoopVal))
540 PhiOp2 = VRMap[LastStageNum - np - 1][LoopVal];
549 VRMap[CurStageNum - StageDiff - np].count(LoopVal))
550 PhiOp2 = VRMap[CurStageNum - StageDiff - np][LoopVal];
568 if (InKernel && VRMap[PrevStage - np].count(LoopVal))
569 PrevReg = VRMap[PrevStage - np][LoopVal];
573 if (VRMap[CurStageNum - np].count(Def)) {
574 unsigned R = VRMap[CurStageNum - np][Def];
590 VRMap[CurStageNum - np][Def] = NewReg;
600 if (NumStages == 0 && IsLast && VRMap[CurStageNum].count(LoopVal))
601 replaceRegUsesAfterLoop(Def, VRMap[CurStageNum][LoopVal], BB, MRI, LIS);
610 MachineBasicBlock *KernelBB, ValueMapTy *VRMap, ValueMapTy *VRMapPhi,
650 PhiOp2 = VRMap[PrevStage][Def];
678 // VRMap = {0: %Clone0, 1: %Clone1, 2: %Clone2}
682 unsigned PhiOp1 = VRMap[PrologStage][Def];
684 PhiOp1 = VRMap[PrologStage - np][Def];
687 PhiOp2 = VRMap[LastStageNum][Def];
869 ValueMapTy *VRMap) {
917 updateInstruction(&*I, false, j, 0, VRMap);
1035 ValueMapTy *VRMap) {
1045 VRMap[CurStageNum][reg] = NewReg;
1059 if (auto It = VRMap[StageNum].find(reg); It != VRMap[StageNum].end())
1086 ValueMapTy *VRMap, MachineBasicBlock *BB) {
1090 if (PhiStage == LoopStage && VRMap[StageNum - 1].count(LoopVal))
1092 PrevVal = VRMap[StageNum - 1][LoopVal];
1093 else if (VRMap[StageNum].count(LoopVal))
1096 PrevVal = VRMap[StageNum][LoopVal];
1107 LoopStage, VRMap, BB);
1118 ValueMapTy *VRMap,
1133 getPrevMapVal(StageNum - np, PhiStage, LoopVal, LoopStage, VRMap, BB);
2669 ValueMapTy &VRMap,
2678 VRMap[Reg] = NewReg;