Searched refs:NewCycle (Results 1 – 2 of 2) sorted by relevance
213 NewCycle->appendEntry(HeaderCandidate); in run()214 NewCycle->appendBlock(HeaderCandidate); in run()215 Info.BlockMap.try_emplace(HeaderCandidate, NewCycle.get()); in run()233 assert(!NewCycle->isEntry(Block)); in run()235 NewCycle->appendEntry(Block); in run()252 if (BlockParent != NewCycle.get()) { in run()267 Info.BlockMap.try_emplace(Block, NewCycle.get()); in run()268 assert(!is_contained(NewCycle->Blocks, Block)); in run()269 NewCycle->Blocks.push_back(Block); in run()271 Info.BlockMapTopLevel.try_emplace(Block, NewCycle.get()); in run()[all …]
2751 int NewCycle = getFirstCycle(); in normalizeNonPipelinedInstructions() local2753 NewCycle = std::max(InstrToCycle[Dep.getSUnit()], NewCycle); in normalizeNonPipelinedInstructions()2756 if (OldCycle != NewCycle) { in normalizeNonPipelinedInstructions()2757 InstrToCycle[&SU] = NewCycle; in normalizeNonPipelinedInstructions()2760 getInstructions(NewCycle).emplace_back(&SU); in normalizeNonPipelinedInstructions()2763 << " to " << NewCycle << " Instr:" << *SU.getInstr()); in normalizeNonPipelinedInstructions()2765 NewLastCycle = std::max(NewLastCycle, NewCycle); in normalizeNonPipelinedInstructions()