| /llvm-project/llvm/include/llvm/ADT/ |
| H A D | GenericCycleImpl.h | 203 addBlockToCycle(BlockT * Block,CycleT * Cycle) addBlockToCycle() argument
404 CycleT *Cycle = getSmallestCommonCycle(getCycle(Pred), getCycle(Succ)); splitCriticalEdge() local
457 CycleT *Cycle = getCycle(Block); getCycleDepth() local
486 for (const CycleT *Cycle : depth_first(TLC)) { validateTree() local
519 for (const CycleT *Cycle = Entry.second; Cycle; validateTree() local
535 for (const CycleT *Cycle : depth_first(TLC)) { print() local
[all...] |
| H A D | GenericUniformityImpl.h | 703 for (const auto *Cycle = CI.getCycle(&DivTermBlock); Cycle; in computeJoinPoints() local
940 static const CycleT *getExtDivCycle(const CycleT *Cycle, in getExtDivCycle()
978 getIntDivCycle(const CycleT *Cycle, const BlockT *DivTermBlock, in getIntDivCycle()
1016 getOutermostDivergentCycle(const CycleT *Cycle, const BlockT *DivTermBlock, in getOutermostDivergentCycle()
1038 for (const CycleT *Cycle = CI.getCycle(DefBlock); in isTemporalDivergent() local
1065 const auto *Cycle = CI.getCycle(JoinBlock); in analyzeControlDivergence() local
1254 const CycleT *Cycle, SmallPtrSetImpl<const BlockT *> &Finalized) { in computeStackPO()
1322 const CycleInfoT &CI, const CycleT *Cycle, in computeCyclePO()
|
| H A D | GenericCycleInfo.h | 285 print(const CycleT * Cycle) print() argument
|
| /llvm-project/llvm/docs/ |
| H A D | ConvergenceAndUniformity.rst | 536 .. _convergence-diverged-entry:
643 .. _convergence-diverged-outside:
691 .. _convergence-reducible-cycle:
|
| /llvm-project/llvm/include/llvm/IR/ |
| H A D | CycleInfo.h | 24 using Cycle = CycleInfo::CycleT; variable
|
| /llvm-project/llvm/unittests/ADT/ |
| H A D | BreadthFirstIteratorTest.cpp | 42 TEST(BreadthFristIteratorTest,Cycle) TEST() argument
|
| /llvm-project/libc/benchmarks/ |
| H A D | LibcBenchmarkTest.cpp | 148 TEST(ArrayRefLoop, Cycle) { in TEST() argument
170 TEST(ByteConstrainedArray, Cycle) { in TEST() argument
|
| /llvm-project/llvm/lib/CodeGen/ |
| H A D | MachineCycleAnalysis.cpp | 94 bool llvm::isCycleInvariant(const MachineCycle *Cycle, MachineInstr &I) { in isCycleInvariant()
|
| H A D | WindowScheduler.cpp | 538 int Cycle = getOriCycle(SuccMI); schedulePhi() local
576 for (int Cycle = 0; Cycle < (int)II; ++Cycle) { getIssueOrder() local
|
| H A D | MachineSink.cpp | 665 FindCycleSinkCandidates(MachineCycle * Cycle,MachineBasicBlock * BB,SmallVectorImpl<MachineInstr * > & Candidates) FindCycleSinkCandidates() argument
757 for (auto *Cycle : Cycles) { runOnMachineFunction() local
1114 MachineCycle *Cycle = CI->getCycle(DefMI->getParent()); isProfitableToSinkTo() local
1518 SinkIntoCycle(MachineCycle * Cycle,MachineInstr & I) SinkIntoCycle() argument
[all...] |
| H A D | MachinePipeliner.cpp | 697 for (int Cycle = Schedule.getFirstCycle(); Cycle <= Schedule.getFinalCycle(); schedule() local
1080 for (int Cycle = Schedule.getFirstCycle(); Cycle <= Schedule.getFinalCycle(); computeScheduledInsts() local
1091 for (int Cycle = Schedule.getFirstCycle(); Cycle <= Schedule.getFinalCycle(); computeScheduledInsts() local
3438 for (int Cycle = getFirstCycle(), E = getFinalCycle(); Cycle <= E; ++Cycle) { finalizeSchedule() local
3539 canReserveResources(SUnit & SU,int Cycle) canReserveResources() argument
3565 reserveResources(SUnit & SU,int Cycle) reserveResources() argument
3594 reserveResources(const MCSchedClassDesc * SCDesc,int Cycle) reserveResources() argument
3606 unreserveResources(const MCSchedClassDesc * SCDesc,int Cycle) unreserveResources() argument
[all...] |
| H A D | MachineTraceMetrics.cpp | 805 unsigned Cycle = 0; updateDepth() local
1103 unsigned Cycle = 0; computeInstrHeights() local
[all...] |
| H A D | ModuloSchedule.cpp | 2793 parseSymbolString(StringRef S,int & Cycle,int & Stage) parseSymbolString() argument
2817 DenseMap<MachineInstr *, int> Cycle, Stage; runOnLoop() local
|
| H A D | IfConversion.cpp | 283 MeetIfcvtSizeLimit(MachineBasicBlock & BB,unsigned Cycle,unsigned Extra,BranchProbability Prediction) const MeetIfcvtSizeLimit() argument
|
| /llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | ModuloSchedule.h | 91 DenseMap<MachineInstr *, int> Cycle; variable
109 ModuloSchedule(MachineFunction & MF,MachineLoop * Loop,std::vector<MachineInstr * > ScheduledInstrs,DenseMap<MachineInstr *,int> Cycle,DenseMap<MachineInstr *,int> Stage) ModuloSchedule() argument
[all...] |
| H A D | MachineTraceMetrics.h | 76 unsigned Cycle = 0; global() member
|
| H A D | ScheduleDAG.h | 563 void setCurCycle(unsigned Cycle) { in setCurCycle() argument
|
| /llvm-project/clang/include/clang/AST/ |
| H A D | ASTImporter.h | 169 using Cycle = llvm::iterator_range<VecTy::const_reverse_iterator>; global() variable
|
| /llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | R600InstrInfo.cpp | 438 unsigned Cycle = getTransSwizzle(TransSwz, i); isLegalUpTo() local
499 unsigned Cycle = getTransSwizzle(TransSwz, i); isConstCompatible() local
|
| /llvm-project/llvm/lib/MCA/HardwareUnits/ |
| H A D | RegisterFile.cpp | 38 notifyExecuted(unsigned Cycle) notifyExecuted() argument
|
| /llvm-project/llvm/include/llvm/MCA/ |
| H A D | Instruction.h | 398 bool contains(unsigned Cycle) const { return Cycle >= Begin && Cycle < End; } in contains()
|
| /llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonLoopIdiomRecognition.cpp | 1126 findCycle(Value * Out,Value * In,ValueSeq & Cycle) findCycle() argument
1157 classifyCycle(Instruction * DivI,ValueSeq & Cycle,ValueSeq & Early,ValueSeq & Late) classifyCycle() argument
[all...] |
| /llvm-project/clang/unittests/AST/ |
| H A D | StructuralEquivalenceTest.cpp | 1969 TEST_F(StructuralEquivalenceCacheTest,Cycle) TEST_F() argument
|
| /llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCInstrInfo.cpp | 158 std::optional<unsigned> Cycle = ItinData->getOperandCycle(DefClass, i); getInstrLatency() local
|
| /llvm-project/llvm/lib/Target/ARM/ |
| H A D | ARMBaseInstrInfo.cpp | 6885 for (int Cycle = SMS.getFinalCycle(); Cycle >= SMS.getFirstCycle(); --Cycle) tooMuchRegisterPressure() local
|