Home
last modified time | relevance | path

Searched refs:iteration (Results 1 – 25 of 908) sorted by relevance

12345678910>>...37

/llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/bugprone/
H A Dinfinite-loop.mm53 // No warning. Array count is updated on every iteration.
61 // No warning. Array count is updated on every iteration.
70 // No warning. Array count is updated on every iteration.
78 // No warning. Array count is updated on every iteration.
97 // No warning. Array count is updated on every iteration.
104 // No warning. Array count is updated on every iteration.
114 // No warning. Array count is updated on every iteration.
122 // No warning. Array count is updated on every iteration.
/llvm-project-15.0.7/llvm/test/Transforms/LoopUnroll/
H A Dfull-unroll-heuristics.ll20 ; RUN: opt < %s -S -loop-unroll -unroll-max-iteration-count-to-analyze=1000 -unroll-threshold=10 -u…
21 ; RUN: opt < %s -S -loop-unroll -unroll-max-iteration-count-to-analyze=1000 -unroll-threshold=20 -u…
22 ; RUN: opt < %s -S -loop-unroll -unroll-max-iteration-count-to-analyze=1000 -unroll-threshold=20 -u…
24 ; RUN: opt < %s -S -passes='require<opt-remark-emit>,loop(loop-unroll-full)' -unroll-max-iteration-…
25 ; RUN: opt < %s -S -passes='require<opt-remark-emit>,loop(loop-unroll-full)' -unroll-max-iteration-…
26 ; RUN: opt < %s -S -passes='require<opt-remark-emit>,loop(loop-unroll-full)' -unroll-max-iteration-…
29 ; RUN: opt < %s -S -passes='require<opt-remark-emit>,loop-unroll' -unroll-max-iteration-count-to-an…
30 ; RUN: opt < %s -S -passes='require<opt-remark-emit>,loop-unroll' -unroll-max-iteration-count-to-an…
31 ; RUN: opt < %s -S -passes='require<opt-remark-emit>,loop-unroll' -unroll-max-iteration-count-to-an…
43 ; RUN: opt < %s -loop-unroll -unroll-max-iteration-count-to-analyze=0 -disable-output
[all …]
H A Dfull-unroll-heuristics-dce.ll1 ; RUN: opt < %s -S -loop-unroll -unroll-max-iteration-count-to-analyze=100 -unroll-threshold=12 -un…
2 ; RUN: opt < %s -S -passes='require<opt-remark-emit>,loop(loop-unroll-full)' -unroll-max-iteration-…
14 ; A[i] is 0 almost at every iteration, so there is no need in loading B[i] at
H A Dfull-unroll-heuristics-phi-prop.ll1 ; RUN: opt < %s -S -loop-unroll -unroll-max-iteration-count-to-analyze=100 -unroll-threshold=10 -un…
2 ; RUN: opt < %s -S -passes='require<opt-remark-emit>,loop(loop-unroll-full)' -unroll-max-iteration-…
H A Dpeel-loop-conditions-pgo-1.ll13 ; CHECK: PEELING loop %for.body with iteration count 2!
14 ; CHECK: PEELING loop %for.body with iteration count 5!
H A Dfull-unroll-heuristics-geps.ll1 ; RUN: opt < %s -S -loop-unroll -unroll-max-iteration-count-to-analyze=100 -unroll-threshold=10 -un…
2 ; RUN: opt < %s -S -passes='require<opt-remark-emit>,loop(loop-unroll-full)' -unroll-max-iteration-…
H A Dfull-unroll-heuristics-cmp.ll1 ; RUN: opt < %s -S -loop-unroll -unroll-max-iteration-count-to-analyze=100 -unroll-threshold=10 -un…
2 ; RUN: opt < %s -S -passes='require<opt-remark-emit>,loop(loop-unroll-full)' -unroll-max-iteration-…
7 ; If we can figure out result of comparison on each iteration, we can resolve
/llvm-project-15.0.7/mlir/include/mlir/Dialect/SparseTensor/IR/
H A DSparseTensorBase.td34 The MLIR implementation closely follows the "sparse iteration theory"
41 iteration graph, reflecting the required order on indices with respect
43 are visited in natural index order. Next, iteration lattices are
45 order. Each iteration lattice point consists of a conjunction of tensor
47 for that conjunction. Within the lattice, iteration points are ordered
48 according to the way indices are exhausted. As such these iteration
50 relatively straightforward one-to-one mapping from iteration lattices
/llvm-project-15.0.7/llvm/test/tools/llvm-mca/X86/BtVer2/
H A Dint-to-fpu-forwarding-2.s67 # CHECK: Resource pressure per iteration:
114 # CHECK: Resource pressure per iteration:
161 # CHECK: Resource pressure per iteration:
208 # CHECK: Resource pressure per iteration:
255 # CHECK: Resource pressure per iteration:
302 # CHECK: Resource pressure per iteration:
H A Dint-to-fpu-forwarding-1.s66 # CHECK: Resource pressure per iteration:
115 # CHECK: Resource pressure per iteration:
164 # CHECK: Resource pressure per iteration:
213 # CHECK: Resource pressure per iteration:
/llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/tests/
H A Dsanitizer_posix_test.cpp42 static void SpawnThread(uptr iteration) { in SpawnThread() argument
46 reinterpret_cast<void *>(iteration))); in SpawnThread()
/llvm-project-15.0.7/llvm/test/tools/llvm-mca/X86/Barcelona/
H A Dint-to-fpu-forwarding-2.s53 # CHECK: Resource pressure per iteration:
94 # CHECK: Resource pressure per iteration:
135 # CHECK: Resource pressure per iteration:
176 # CHECK: Resource pressure per iteration:
H A Dint-to-fpu-forwarding-1.s58 # CHECK: Resource pressure per iteration:
101 # CHECK: Resource pressure per iteration:
144 # CHECK: Resource pressure per iteration:
187 # CHECK: Resource pressure per iteration:
/llvm-project-15.0.7/mlir/include/mlir/Interfaces/
H A DTilingInterface.td71 The iteration space of the operation is returned by
73 tile within this iteration space whose implementation the
80 iteration space
133 iteration space. This method generates a tiled
145 iteration space
/llvm-project-15.0.7/mlir/include/mlir/Dialect/SCF/TransformOps/
H A DSCFTransformOps.td68 let summary = "Peels the last iteration of the loop";
71 the remaining iteration into a separate loop or a conditional.
116 after the loop, and updates each iteration to read the data for a following
117 iteration rather than the current one.
121 The values read and about to be stored are transferred as loop iteration
155 number of loop body copies per iteration. If the unroll factor is larger
/llvm-project-15.0.7/llvm/test/tools/llvm-mca/X86/BdVer2/
H A Dint-to-fpu-forwarding-2.s76 # CHECK: Resource pressure per iteration:
132 # CHECK: Resource pressure per iteration:
188 # CHECK: Resource pressure per iteration:
244 # CHECK: Resource pressure per iteration:
300 # CHECK: Resource pressure per iteration:
356 # CHECK: Resource pressure per iteration:
H A Dint-to-fpu-forwarding-1.s73 # CHECK: Resource pressure per iteration:
131 # CHECK: Resource pressure per iteration:
189 # CHECK: Resource pressure per iteration:
247 # CHECK: Resource pressure per iteration:
/llvm-project-15.0.7/llvm/test/Analysis/ScalarEvolution/
H A Dpr48225.ll7 ; - %cond.false.on.first.iter is false on 1st iteration;
8 ; - %cond.false.on.second.iter is false on 2nd iteration;
54 ; - %cond.true.on.first.iter is true on 1st iteration;
55 ; - %cond.true.on.second.iter is true on 2nd iteration;
/llvm-project-15.0.7/compiler-rt/lib/builtins/
H A Dfp_div_impl.inc19 // every iteration, the two modes are supported: N full-width iterations (as
20 // it is done for float32 by default) and (N-1) half-width iteration plus one
21 // final full-width iteration. It is expected that half-width integer
32 #error At least one full iteration is required
112 // Newton-Raphson iteration:
206 // approximation after last iteration.
229 // once after the final iteration. On the other hand, an effective value of
244 // We need at least one such iteration.
253 #error Only a single emulated full iteration is supported
256 // Cannot normally reach here: only one full-width iteration is requested and
[all …]
/llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/performance/
H A Dfor-range-copy.rst6 Finds C++11 for ranges where the loop variable is copied in each iteration but
32 iteration. Regular expressions are accepted, e.g. `[Rr]ef(erence)?$` matches
/llvm-project-15.0.7/llvm/test/CodeGen/Hexagon/
H A Dswp-loop-carried-unknown.ll5 ; and the load from iteration n was scheduled prior to the store from iteration
/llvm-project-15.0.7/llvm/test/Transforms/LowerConstantIntrinsics/
H A Dstale-worklist-phi.ll4 ; to process a PHI node that was removed in a preceding worklist iteration. The
7 ; will be left with one predecessor and will thus be removed in that iteration.
/llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/
H A Dvplan-widen-select-instruction.ll7 ; * Select condition depending on outer loop iteration variable.
8 ; * Select condidition depending on inner loop iteration variable.
9 ; * Select conditition depending on both outer and inner loop iteration
88 ; Select condition only depends on outer loop iteration variable.
135 ; Select condition only depends on inner loop iteration variable.
184 ; Select condition depends on both inner and outer loop iteration variables.
/llvm-project-15.0.7/mlir/include/mlir/Dialect/Linalg/IR/
H A DLinalgOps.td154 The `linalg.index` operation returns the iteration index of the immediately
155 enclosing linalg structured operation for the iteration dimension `dim`. The
167 // Access the outer iteration dimension i
169 // Access the inner iteration dimension j
/llvm-project-15.0.7/mlir/test/Dialect/Affine/
H A Dunroll-jam.mlir40 // Cleanup loop (single iteration).
86 // The cleanup loop is a single iteration one and is promoted.
120 // The inner loop trip count changes each iteration of outer loop.
168 // Cleanup loop (single iteration).
215 // Cleanup loop (single iteration).
256 // Cleanup loop (single iteration).
302 // Cleanup loop (single iteration).
362 // Cleanup loop (single iteration).
428 // Cleanup loop (single iteration).
477 // Cleanup loop (single iteration).
[all …]

12345678910>>...37