Home
last modified time | relevance | path

Searched refs:NewCycle (Results 1 – 2 of 2) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGenericCycleImpl.h356 std::unique_ptr<CycleT> NewCycle = std::make_unique<CycleT>(); in run() local
357 NewCycle->appendEntry(HeaderCandidate); in run()
358 NewCycle->appendBlock(HeaderCandidate); in run()
359 Info.BlockMap.try_emplace(HeaderCandidate, NewCycle.get()); in run()
381 assert(!NewCycle->isEntry(Block)); in run()
383 NewCycle->appendEntry(Block); in run()
400 if (BlockParent != NewCycle.get()) { in run()
405 Info.moveTopLevelCycleToNewParent(NewCycle.get(), BlockParent); in run()
415 Info.BlockMap.try_emplace(Block, NewCycle.get()); in run()
416 assert(!is_contained(NewCycle->Blocks, Block)); in run()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachinePipeliner.cpp3538 int NewCycle = getFirstCycle(); in normalizeNonPipelinedInstructions() local
3541 NewCycle = std::max(InstrToCycle[IE.getSrc()], NewCycle); in normalizeNonPipelinedInstructions()
3547 NewCycle = std::max(InstrToCycle[OE.getDst()], NewCycle); in normalizeNonPipelinedInstructions()
3550 if (OldCycle != NewCycle) { in normalizeNonPipelinedInstructions()
3551 InstrToCycle[&SU] = NewCycle; in normalizeNonPipelinedInstructions()
3554 getInstructions(NewCycle).emplace_back(&SU); in normalizeNonPipelinedInstructions()
3557 << " to " << NewCycle << " Instr:" << *SU.getInstr()); in normalizeNonPipelinedInstructions()
3582 if (FirstCycle + InitiationInterval <= NewCycle) in normalizeNonPipelinedInstructions()
3585 NewLastCycle = std::max(NewLastCycle, NewCycle); in normalizeNonPipelinedInstructions()