Home
last modified time | relevance | path

Searched defs:cycle (Results 1 – 8 of 8) sorted by relevance

/llvm-project/mlir/lib/Conversion/PDLToPDLInterp/
H A DRootOrdering.cpp29 SmallVector<Value> cycle; in getCycle() local
48 static void contract(RootOrderingGraph &graph, ArrayRef<Value> cycle, in contract()
170 SmallVector<Value> cycle = getCycle(parents, node); in solve() local
/llvm-project/llvm/lib/CodeGen/
H A DScoreboardHazardRecognizer.cpp117 int cycle = Stalls; in getHazardType() local
184 unsigned cycle = 0; in EmitInstruction() local
H A DMachinePipeliner.cpp2912 for (int cycle = getFirstCycle(); cycle <= LastCycle; ++cycle) { computeStart() local
3416 for (int cycle = getFirstCycle(); cycle <= getFinalCycle(); ++cycle) { finalizeSchedule() local
3428 for (int cycle = getFinalCycle() + 1; cycle <= LastCycle; ++cycle) finalizeSchedule() local
3459 for (int cycle = getFirstCycle(); cycle <= getFinalCycle(); ++cycle) { print() local
[all...]
/llvm-project/libc/benchmarks/
H A DLibcBenchmark.h307 CircularArrayRef<T> cycle(llvm::ArrayRef<T> Array, size_t Size) { in cycle() function
318 CircularArrayRef<T> cycle(const std::array<T, N> &Container, size_t Size) { in cycle() function
/llvm-project/llvm/include/llvm/ADT/
H A DGenericUniformityImpl.h1171 for (const CycleT *cycle : AssumedDivergent) { in print() local
1178 for (const CycleT *cycle : DivergentExitCycles) { in print() local
/llvm-project/mlir/lib/Dialect/SCF/TransformOps/
H A DSCFTransformOps.cpp290 unsigned cycle = opCycles[op]; loopScheduling() local
/llvm-project/llvm/include/llvm/CodeGen/
H A DMachinePipeliner.h639 getInstructions(int cycle) getInstructions() argument
[all...]
/llvm-project/mlir/lib/Dialect/SCF/Transforms/
H A DLoopPipelining.cpp224 for (int64_t cycle = 0; cycle < numCylesPerIter; cycle++) { verifySchedule() local