Home
last modified time | relevance | path

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

12345678910

/external/llvm-project/mlir/test/Transforms/
Dmemref-dependence-check.mlir1 // RUN: mlir-opt %s -test-memref-dependence-check -split-input-file -verify-diagnostics | FileChec…
12 // There is no dependence from store 0 to load 1 at depth if we take into account
18 // expected-remark@above {{dependence from 0 to 0 at depth 1 = false}}
19 // expected-remark@above {{dependence from 0 to 0 at depth 2 = false}}
20 // expected-remark@above {{dependence from 0 to 1 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}}
38 // There is a dependence from 0 to 1 at depth 1 (common surrounding loops 0)
42 // expected-remark@above {{dependence from 0 to 0 at depth 1 = false}}
[all …]
Dloop-fusion-dependence-check.mlir1 // RUN: mlir-opt -allow-unregistered-dialect %s -test-loop-fusion -test-loop-fusion-dependence-chec…
20 …// 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…
[all …]
/external/llvm-project/polly/lib/External/isl/test_inputs/schedule/
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
Dfeautrier_compressed.sc2 # compressed nodes in a subgraph of the original dependence graph.
/external/llvm-project/mlir/lib/Dialect/Linalg/Analysis/
DDependenceAnalysis.cpp246 for (auto dependence : getDependencesFrom(src, dt)) { in findOperationsWithCoveringDependences() local
247 auto interimPos = linalgOpPositions.lookup(dependence.dependentOpView.op); in findOperationsWithCoveringDependences()
252 cast<linalg::LinalgOp>(dependence.indexingOpView.op); in findOperationsWithCoveringDependences()
254 consumer.getShapedOperand(dependence.indexingOpView.operandIndex); in findOperationsWithCoveringDependences()
257 auto *op = dependence.dependentOpView.op; in findOperationsWithCoveringDependences()
271 for (auto dependence : getDependencesInto(dstLinalgOp, dep)) { in hasDependenceFrom() local
272 if (dependence.dependentOpView.op == srcLinalgOp) in hasDependenceFrom()
/external/llvm-project/mlir/lib/Dialect/Linalg/Transforms/
DFusion.cpp388 for (auto dependence : llvm::make_filter_range( in findFusableProducer() local
394 auto producer = cast<LinalgOp>(dependence.dependentOpView.op); in findFusableProducer()
398 consumer.getBuffer(dependence.indexingOpView.operandIndex); in findFusableProducer()
405 producer.getBuffer(dependence.dependentOpView.operandIndex); in findFusableProducer()
411 << dependence.dependentOpView.operandIndex - in findFusableProducer()
420 return dependence; in findFusableProducer()
549 LinalgDependenceGraph::LinalgDependenceGraphElem dependence) { in getConsumerLoopToProducerLoopMap() argument
550 auto producer = cast<LinalgOp>(dependence.dependentOpView.op); in getConsumerLoopToProducerLoopMap()
552 producer.getIndexingMap(dependence.dependentOpView.operandIndex); in getConsumerLoopToProducerLoopMap()
553 auto consumer = cast<LinalgOp>(dependence.indexingOpView.op); in getConsumerLoopToProducerLoopMap()
[all …]
/external/llvm-project/polly/test/Isl/Ast/
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
Ddependence_distance_constant.ll5 ; CHECK: #pragma minimal dependence distance: 1
8 ; CHECK: #pragma minimal dependence distance: 8
Ddependence_distance_varying_in_outer_loop.ll5 ; CHECK: #pragma minimal dependence distance: 1
8 ; CHECK: #pragma minimal dependence distance: 1
Ddependence_distance_parametric_expr.ll5 ; CHECK: #pragma minimal dependence distance: 1
8 ; CHECK: #pragma minimal dependence distance: max(-c - v, c + v)
Ddependence_distance_parametric.ll5 ; CHECK: #pragma minimal dependence distance: 1
8 ; CHECK: #pragma minimal dependence distance: max(-c, c)
/external/llvm/test/Transforms/LoopVectorize/AArch64/
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
/external/llvm-project/llvm/test/Transforms/LoopVectorize/AArch64/
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
/external/llvm-project/llvm/test/Transforms/LoopVectorize/
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:
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…
/external/llvm-project/llvm/test/Analysis/LoopAccessAnalysis/
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:
/external/llvm-project/mlir/lib/TableGen/
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
/external/llvm-project/polly/test/ScheduleOptimizer/
Douter_coincidence.ll58 ; CHECK: #pragma minimal dependence distance: 1
60 ; CHECK-NEXT: #pragma minimal dependence distance: 1
64 ; OUTER: #pragma minimal dependence distance: 1
Dfull_partial_tile_separation.ll8 ; CHECK-NEXT: #pragma minimal dependence distance: 1
13 ; CHECK-NEXT: #pragma minimal dependence distance: 1
21 ; CHECK-NEXT: #pragma minimal dependence distance: 1
/external/llvm-project/llvm/test/CodeGen/X86/
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
/external/llvm/test/Transforms/LoopVectorize/
Dmemdep.ll6 ; Vectorization with dependence checks.
8 ; No plausible dependence - can be vectorized.
34 ; Plausible dependence of distance 1 - can't be vectorized.
60 ; Plausible dependence of distance 2 - can be vectorized with a width of 2.
92 ; Plausible dependence of distance 1 - cannot be vectorized (without reordering
/external/llvm-project/llvm/test/CodeGen/Hexagon/
Dswp-loop-carried-unknown.ll4 ; loop carried dependence. Previously, the loop carried dependence wasn't added
/external/llvm/test/CodeGen/AArch64/
Dtailcall_misched_graph.ll17 ; Make sure there is a dependence between the load and store to the same stack
34 ; Make sure that there is an dependence edge between fi#-2 and fi#-4.
/external/llvm-project/polly/lib/External/isl/
DChangeLog37 - support kill accesses in dependence analysis
158 - support for interaction with dependence analysis
207 - add higher level interface for dependence analysis
228 - support for "may" accesses in dependence analysis
/external/llvm-project/llvm/test/CodeGen/AArch64/
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.

12345678910