Home
last modified time | relevance | path

Searched refs:dependence (Results 1 – 25 of 153) sorted by relevance

1234567

/llvm-project-15.0.7/mlir/test/Transforms/
H A Dmemref-dependence-check.mlir18 // expected-remark@above {{dependence from 0 to 0 at depth 1 = false}}
25 // expected-remark@above {{dependence from 1 to 1 at depth 1 = false}}
26 // expected-remark@above {{dependence from 1 to 1 at depth 2 = false}}
27 // expected-remark@above {{dependence from 1 to 0 at depth 1 = false}}
44 // expected-remark@above {{dependence from 0 to 1 at depth 1 = true}}
63 // expected-remark@above {{dependence from 0 to 0 at depth 1 = false}}
64 // expected-remark@above {{dependence from 0 to 1 at depth 1 = false}}
66 // expected-remark@above {{dependence from 1 to 0 at depth 1 = false}}
282 // For dependence from 0 to 1, we do not have a loop carried dependence
526 // *) loop-independent dependence from access 1 to 2 at depth 2.
[all …]
H A Dloop-fusion-dependence-check.mlir20 …// expected-remark@-1 {{block-level dependence preventing fusion of loop nest 0 into loop nest 2 a…
29 …// expected-remark@-1 {{block-level dependence preventing fusion of loop nest 2 into loop nest 0 a…
47 // Make dependence from 0 to 1 on '%a' read-after-read.
80 // Make dependence from 0 to 1 on unrelated memref '%d'.
110 …// expected-remark@-1 {{block-level dependence preventing fusion of loop nest 0 into loop nest 1 a…
119 …// expected-remark@-1 {{block-level dependence preventing fusion of loop nest 1 into loop nest 0 a…
135 …// expected-remark@-1 {{block-level dependence preventing fusion of loop nest 0 into loop nest 1 a…
144 …// expected-remark@-1 {{block-level dependence preventing fusion of loop nest 1 into loop nest 0 a…
161 …// expected-remark@-1 {{block-level dependence preventing fusion of loop nest 0 into loop nest 1 a…
166 // Loop nest '%i0" cannot be fused past load from '%1' due to RAW dependence.
[all …]
/llvm-project-15.0.7/polly/lib/External/isl/test_inputs/schedule/
H A Dcarry_bounded_coefficients.sc1 # Check that the dependence carrying step is not confused by
3 # In particular, force the scheduler to move to a dependence carrying
8 # On the other hand, the dependence carrying step now tries
H A Dfeautrier_compressed.sc2 # compressed nodes in a subgraph of the original dependence graph.
/llvm-project-15.0.7/mlir/lib/Dialect/Linalg/Transforms/
H A DFusion.cpp294 for (auto dependence : llvm::make_filter_range( in findFusableProducer() local
309 auto producer = cast<LinalgOp>(dependence.getDependentOp()); in findFusableProducer()
313 << "producer: " << *dependence.getDependentOp() in findFusableProducer()
314 << " view: " << dependence.getDependentValue() << "\n"); in findFusableProducer()
322 return dependence; in findFusableProducer()
324 assert(dependence.dependenceType == in findFusableProducer()
326 return dependence; in findFusableProducer()
/llvm-project-15.0.7/polly/test/IstAstInfo/
H A Ddependence_distance_minimal.ll3 ; The minimal dependence distance of the innermost loop should be 1 instead of 250.
4 ; CHECK: #pragma minimal dependence distance: 1
6 ; CHECK: #pragma minimal dependence distance: 1
H A Ddependence_distance_constant.ll5 ; CHECK: #pragma minimal dependence distance: 1
8 ; CHECK: #pragma minimal dependence distance: 8
H A Ddependence_distance_parametric.ll5 ; CHECK: #pragma minimal dependence distance: 1
8 ; CHECK: #pragma minimal dependence distance: max(-c, c)
H A Ddependence_distance_varying_in_outer_loop.ll5 ; CHECK: #pragma minimal dependence distance: 1
8 ; CHECK: #pragma minimal dependence distance: 1
H A Ddependence_distance_parametric_expr.ll5 ; CHECK: #pragma minimal dependence distance: 1
8 ; CHECK: #pragma minimal dependence distance: max(-c - v, c + v)
/llvm-project-15.0.7/mlir/lib/Dialect/Linalg/Analysis/
H A DDependenceAnalysis.cpp250 for (auto dependence : getDependencesFrom(src, dt)) { in findOperationsWithCoveringDependences() local
251 auto interimPos = linalgOpPositions.lookup(dependence.getDependentOp()); in findOperationsWithCoveringDependences()
255 Value consumerView = dependence.getIndexingValue(); in findOperationsWithCoveringDependences()
258 auto *op = dependence.getDependentOp(); in findOperationsWithCoveringDependences()
272 for (auto dependence : getDependencesInto(dstLinalgOp, dep)) in hasDependenceFrom() local
273 if (dependence.getDependentOp() == srcLinalgOp) in hasDependenceFrom()
/llvm-project-15.0.7/llvm/test/Analysis/LoopAccessAnalysis/
H A Dpr31098.ll7 ; we are currently not able to create runtime dependence checks, and therefore
8 ; if we don't resolve the dependence statically we cannot vectorize the loop.
10 ; Specifically in this example, during dependence analysis we get 6 unknown
11 ; dependence distances between the 8 real/imaginary accesses below:
H A Ddepend_diff_types_opaque_ptr.ll4 ; are done as i32 types. When doing dependence analysis the type should not
11 ; CHECK-NEXT: Memory dependences are safe with a maximum dependence distance of 800 bytes
55 ;; Store to vec[indvars.iv + n].y as i32, to verify no dependence in the case
56 ;; of unknown dependence distance.
78 ; CHECK-NEXT: Unknown data dependence.
119 ; CHECK-NEXT: Unknown data dependence.
162 ;; a forward but prevents forwarding dependence
H A Ddepend_diff_types.ll5 ; are done as i32 types. When doing dependence analysis the type should not
12 ; CHECK-NEXT: Memory dependences are safe with a maximum dependence distance of 800 bytes
58 ;; Store to vec[indvars.iv + n].y as i32, to verify no dependence in the case
59 ;; of unknown dependence distance.
81 ; CHECK-NEXT: Unknown data dependence.
124 ; CHECK-NEXT: Unknown data dependence.
169 ;; a forward but prevents forwarding dependence
H A Dforward-loop-independent.ll7 ; dependeces *outside* of the MemoryDepChecker logic (i.e. proper dependence
11 ; (i.e. the same index is used), we don't discover the forward dependence.
/llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/AArch64/
H A Dmax-vf-for-interleaved.ll8 ; Check vectorization of interleaved access groups with positive dependence
9 ; distances. In this test, the maximum safe dependence distance for
12 ; interleave factor. Here, the maximum safe dependence distance is recomputed
H A Dscalable-vectorization.ll6 ; Test that the MaxVF for the following loop, that has no dependence distances,
38 ; Test that the MaxVF for the following loop, with a dependence distance
70 ; Test that the MaxVF for the following loop, with a dependence distance
102 ; Test that the MaxVF for the following loop, with a dependence distance
135 ; to e.g. dependence distance.
/llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/
H A Dpr31098.ll8 ; we are currently not able to create runtime dependence checks, and therefore
9 ; if we don't resolve the dependence statically we cannot vectorize the loop.
11 ; Specifically in this example, during dependence analysis we get 6 unknown
12 ; dependence distances between the 8 real/imaginary accesses below:
H A Dmemdep.ll8 ; Vectorization with dependence checks.
10 ; No plausible dependence - can be vectorized.
36 ; Plausible dependence of distance 1 - can't be vectorized.
62 ; Plausible dependence of distance 2 - can be vectorized with a width of 2.
94 ; Plausible dependence of distance 1 - cannot be vectorized (without reordering
229 ;Therefore the maxVF was computed as 8 instead of 4, as the dependence distance here is 6 iteration…
/llvm-project-15.0.7/mlir/lib/TableGen/
H A DCMakeLists.txt6 # dependence on libLLVM.so) However, it must also be linkable against
8 # has a dependence on MLIRIR, which must depend on libLLVM.so). This works
/llvm-project-15.0.7/polly/test/ScheduleOptimizer/
H A Douter_coincidence.ll58 ; CHECK: #pragma minimal dependence distance: 1
60 ; CHECK-NEXT: #pragma minimal dependence distance: 1
64 ; OUTER: #pragma minimal dependence distance: 1
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Dpr36274.ll5 ; misses a dependence between the fused load and a non-fused operand
6 ; to the load causing a cycle. Here the dependence in question comes
/llvm-project-15.0.7/llvm/test/CodeGen/Hexagon/
H A Dswp-loop-carried-unknown.ll4 ; loop carried dependence. Previously, the loop carried dependence wasn't added
/llvm-project-15.0.7/polly/lib/External/isl/
H A DChangeLog53 - support kill accesses in dependence analysis
174 - support for interaction with dependence analysis
223 - add higher level interface for dependence analysis
244 - support for "may" accesses in dependence analysis
/llvm-project-15.0.7/llvm/test/CodeGen/AArch64/
H A Dtailcall_misched_graph.ll18 ; Make sure there is a dependence between the load and store to the same stack
39 ; Make sure that there is an dependence edge between fi#-2 and fi#-4.

1234567