Home
last modified time | relevance | path

Searched refs:Cycle (Results 1 – 25 of 44) sorted by relevance

12

/openbsd-src/gnu/llvm/llvm/include/llvm/ADT/
H A DGenericCycleImpl.h149 auto Cycle = BlockMapTopLevel.find(Block);
150 if (Cycle != BlockMapTopLevel.end())
151 return Cycle->second;
291 for (CycleT *Cycle : depth_first(SubTree)) in updateDepth()
292 Cycle->Depth = Cycle->ParentCycle ? Cycle->ParentCycle->Depth + 1 : 1; in updateDepth()
386 CycleT *Cycle = getCycle(Block); in getCycleDepth() local
387 if (!Cycle) in getCycleDepth()
389 return Cycle->getDepth(); in getCycleDepth()
415 for (const CycleT *Cycle : depth_first(TLC)) { in validateTree() local
416 if (Cycle->ParentCycle) in validateTree()
[all …]
H A DGenericUniformityImpl.h131 void computeCyclePO(const CycleInfoT &CI, const CycleT *Cycle,
135 const CycleT *Cycle,
698 for (const auto *Cycle = CI.getCycle(&DivTermBlock); Cycle; in computeJoinPoints() local
699 Cycle = Cycle->getParentCycle()) { in computeJoinPoints()
700 if (Cycle->isReducible()) { in computeJoinPoints()
706 Cycle->getExitBlocks(Exits); in computeJoinPoints()
707 auto *Header = Cycle->getHeader(); in computeJoinPoints()
992 static const CycleT *getExtDivCycle(const CycleT *Cycle, in getExtDivCycle() argument
995 assert(Cycle); in getExtDivCycle()
996 assert(Cycle->contains(JoinBlock)); in getExtDivCycle()
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/
H A DModuloSchedule.h90 DenseMap<MachineInstr *, int> Cycle; variable
108 DenseMap<MachineInstr *, int> Cycle, in ModuloSchedule() argument
110 : Loop(Loop), ScheduledInstrs(ScheduledInstrs), Cycle(std::move(Cycle)), in ModuloSchedule()
127 int getFirstCycle() { return Cycle[ScheduledInstrs.front()]; } in getFirstCycle()
131 int getFinalCycle() { return Cycle[ScheduledInstrs.back()]; } in getFinalCycle()
141 auto I = Cycle.find(MI); in getCycle()
142 return I == Cycle.end() ? -1 : I->second; in getCycle()
H A DMachineCycleAnalysis.h50 bool isCycleInvariant(const MachineCycle *Cycle, MachineInstr &I);
H A DMachinePipeliner.h475 void reserveResources(const MCSchedClassDesc *SCDesc, int Cycle);
477 void unreserveResources(const MCSchedClassDesc *SCDesc, int Cycle);
513 bool canReserveResources(SUnit &SU, int Cycle);
517 void reserveResources(SUnit &SU, int Cycle);
H A DScheduleDAG.h545 void setCurCycle(unsigned Cycle) { in setCurCycle() argument
546 CurCycle = Cycle; in setCurCycle()
H A DMachineTraceMetrics.h76 unsigned Cycle = 0; member
/openbsd-src/gnu/llvm/llvm/lib/Target/PowerPC/
H A DP9InstrResources.td461 // 5 Cycle Restricted DP operation and one 2 cycle ALU operation.
524 // Three Cycle PM operation. Only one PM unit per superslice so we use the whole
634 // 12 Cycle DFU operation. Only one DFU unit per CPU so we use a whole
658 // 23 Cycle DFU operation. Only one DFU unit per CPU so we use a whole
666 // 24 Cycle DFU operation. Only one DFU unit per CPU so we use a whole
683 // 37 Cycle DFU operation. Only one DFU unit per CPU so we use a whole
691 // 58 Cycle DFU operation. Only one DFU unit per CPU so we use a whole
700 // 76 Cycle DFU operation. Only one DFU unit per CPU so we use a whole
709 // 6 Cycle Load uses a single slice.
715 // 5 Cycle Load uses a single slice.
[all …]
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DMachineTraceMetrics.cpp791 unsigned Cycle = 0; in updateDepth() local
804 Cycle = std::max(Cycle, DepCycle); in updateDepth()
808 MICycles.Depth = Cycle; in updateDepth()
812 TBI.CriticalPath = std::max(TBI.CriticalPath, Cycle + MICycles.Height); in updateDepth()
813 LLVM_DEBUG(dbgs() << TBI.CriticalPath << '\t' << Cycle << '\t' << UseMI); in updateDepth()
815 LLVM_DEBUG(dbgs() << Cycle << '\t' << UseMI); in updateDepth()
918 unsigned DepHeight = I->Cycle; in updatePhysDepsUpwards()
937 if (LRU.Cycle <= Height && LRU.MI != &MI) { in updatePhysDepsUpwards()
938 LRU.Cycle = Height; in updatePhysDepsUpwards()
1036 RegUnits[LI.Reg].Cycle = LI.Height; in computeInstrHeights()
[all …]
H A DMachineCycleAnalysis.cpp94 bool llvm::isCycleInvariant(const MachineCycle *Cycle, MachineInstr &I) { in isCycleInvariant() argument
128 } else if (any_of(Cycle->getEntries(), in isCycleInvariant()
145 if (Cycle->contains(MRI->getVRegDef(Reg)->getParent())) in isCycleInvariant()
H A DMachineSink.cpp237 void FindCycleSinkCandidates(MachineCycle *Cycle, MachineBasicBlock *BB,
239 bool SinkIntoCycle(MachineCycle *Cycle, MachineInstr &I);
384 MachineCycle *Cycle, MachineBasicBlock *BB, in FindCycleSinkCandidates() argument
393 if (!isCycleInvariant(Cycle, MI)) { in FindCycleSinkCandidates()
472 for (auto *Cycle : Cycles) { in runOnMachineFunction() local
473 MachineBasicBlock *Preheader = Cycle->getCyclePreheader(); in runOnMachineFunction()
479 FindCycleSinkCandidates(Cycle, Preheader, Candidates); in runOnMachineFunction()
492 if (!SinkIntoCycle(Cycle, *I)) in runOnMachineFunction()
828 MachineCycle *Cycle = CI->getCycle(DefMI->getParent()); in isProfitableToSinkTo() local
833 if (Cycle != MCycle || (DefMI->isPHI() && Cycle && Cycle->isReducible() && in isProfitableToSinkTo()
[all …]
H A DMachinePipeliner.cpp634 for (int Cycle = Schedule.getFirstCycle(); Cycle <= Schedule.getFinalCycle(); in schedule() local
635 ++Cycle) { in schedule()
636 for (SUnit *SU : Schedule.getInstructions(Cycle)) { in schedule()
638 Cycles[SU->getInstr()] = Cycle; in schedule()
2931 for (int Cycle = getFirstCycle(), E = getFinalCycle(); Cycle <= E; ++Cycle) { in finalizeSchedule() local
2932 std::deque<SUnit *> &cycleInstrs = ScheduledInstrs[Cycle]; in finalizeSchedule()
3044 bool ResourceManager::canReserveResources(SUnit &SU, int Cycle) { in canReserveResources() argument
3050 return DFAResources[positiveModulo(Cycle, InitiationInterval)] in canReserveResources()
3062 reserveResources(SCDesc, Cycle); in canReserveResources()
3064 unreserveResources(SCDesc, Cycle); in canReserveResources()
[all …]
H A DModuloSchedule.cpp2157 static void parseSymbolString(StringRef S, int &Cycle, int &Stage) { in parseSymbolString() argument
2171 CycleTokenAndValue.second.drop_front().getAsInteger(10, Cycle); in parseSymbolString()
2173 dbgs() << " Stage=" << Stage << ", Cycle=" << Cycle << "\n"; in parseSymbolString()
2181 DenseMap<MachineInstr *, int> Cycle, Stage; in runOnLoop() local
2189 parseSymbolString(Sym->getName(), Cycle[&MI], Stage[&MI]); in runOnLoop()
2193 ModuloSchedule MS(MF, &L, std::move(Instrs), std::move(Cycle), in runOnLoop()
/openbsd-src/gnu/usr.bin/perl/t/lib/caller/
H A DTricycle.pm1 require Cycle; # part of a cyclic dependency chain
/openbsd-src/gnu/llvm/clang/include/clang/AST/
H A DASTImporter.h169 using Cycle = llvm::iterator_range<VecTy::const_reverse_iterator>; variable
170 Cycle getCycleAtBack() const { in getCycleAtBack()
172 return Cycle(Nodes.rbegin(), in getCycleAtBack()
/openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/
H A DCycleAnalysis.h28 using Cycle = CycleInfo::CycleT; variable
/openbsd-src/gnu/llvm/llvm/lib/Target/Hexagon/
H A DHexagonLoopIdiomRecognition.cpp596 bool findCycle(Value *Out, Value *In, ValueSeq &Cycle);
597 void classifyCycle(Instruction *DivI, ValueSeq &Cycle, ValueSeq &Early,
1132 ValueSeq &Cycle) { in findCycle() argument
1153 if (!Cycle.insert(I)) in findCycle()
1155 if (findCycle(I, In, Cycle)) in findCycle()
1157 Cycle.remove(I); in findCycle()
1159 return !Cycle.empty(); in findCycle()
1163 ValueSeq &Cycle, ValueSeq &Early, ValueSeq &Late) { in classifyCycle() argument
1169 unsigned I, N = Cycle.size(); in classifyCycle()
1171 Value *V = Cycle[I]; in classifyCycle()
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/MCA/
H A DInstruction.h398 bool contains(unsigned Cycle) const { return Cycle >= Begin && Cycle < End; } in contains() argument
/openbsd-src/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DR600InstrInfo.cpp438 unsigned Cycle = getTransSwizzle(TransSwz, i); in isLegalUpTo() local
443 if (Vector[Src.second][Cycle] < 0) in isLegalUpTo()
444 Vector[Src.second][Cycle] = Src.first; in isLegalUpTo()
445 if (Vector[Src.second][Cycle] != Src.first) in isLegalUpTo()
499 unsigned Cycle = getTransSwizzle(TransSwz, i); in isConstCompatible() local
502 if (ConstCount > 0 && Cycle == 0) in isConstCompatible()
504 if (ConstCount > 1 && Cycle == 1) in isConstCompatible()
/openbsd-src/gnu/llvm/llvm/lib/Analysis/
H A DUniformityAnalysis.cpp75 const Instruction &I, const Cycle &DefCycle) const { in usesValueFromCycle()
/openbsd-src/gnu/llvm/llvm/include/llvm/MCA/HardwareUnits/
H A DRegisterFile.h62 void notifyExecuted(unsigned Cycle);
/openbsd-src/gnu/usr.bin/gcc/gcc/f/
H A Dstr-1t.fin42 Cycle CYCLE
/openbsd-src/gnu/usr.bin/perl/cpan/Test-Simple/t/Test2/modules/Util/
H A DFacets2Legacy.t49 …qr/Cycle between Facets2Legacy and Fake::Event=HASH\(.*\)->facet_data\(\) \(Did you forget to over…
/openbsd-src/gnu/llvm/llvm/docs/CommandGuide/
H A Dllvm-mca.rst27 Per Cycle (IPC), as well as hardware resource pressure. The analysis and
440 uOps Per Cycle: 1.48
493 **IPC**, **uOps Per Cycle**, and **Block RThroughput** (Block Reciprocal
514 Field 'uOps Per Cycle' is computed dividing the total number of simulated micro
517 data dependencies, the observed 'uOps Per Cycle' should tend to a theoretical
521 Field *uOps Per Cycle* is bounded from above by the dispatch width. That is
523 and 'uOps Per Cycle' are limited by the amount of hardware parallelism. The
527 Cycle (computed by dividing the number of uOps of a single iteration by the
533 are no loop-carried dependencies, the observed `uOps Per Cycle` is expected to
/openbsd-src/gnu/llvm/llvm/lib/MCA/HardwareUnits/
H A DRegisterFile.cpp38 void WriteRef::notifyExecuted(unsigned Cycle) { in notifyExecuted() argument
40 WriteBackCycle = Cycle; in notifyExecuted()

12