| /llvm-project-15.0.7/llvm/test/Transforms/LoopInterchange/ |
| H A D | innermost-latch-uses-values-in-middle-header.ll | 8 ;; After interchanging the innermost and the middle loop, we should not continue
30 br label %innermost.header
32 innermost.header: ; preds = %middle.header, %innermost.latch
33 %indvar.innermost = phi i64 [ %indvar.innermost.next, %innermost.latch ], [ 4, %middle.header ]
34 br label %innermost.body
36 innermost.body: ; preds = %innermost.header
39 br label %innermost.latch
41 innermost.latch: ; preds = %innermost.body
42 %indvar.innermost.next = add nsw i64 %indvar.innermost, 1
43 …%tobool5.i = icmp eq i64 %indvar.innermost.next, %indvar.middle.wide ; corresponding use in the in…
[all …]
|
| H A D | pr43326-ideal-access-pattern.ll | 43 br label %for.innermost
50 for.middle.latch: ; preds = %for.innermost
55 for.innermost: ; preds = %for.middle.header, %for.innermost
56 …%indvars.innermost = phi i64 [ 0, %for.middle.header ], [ %indvars.innermost.next, %for.innermost ]
57 …mentptr inbounds [10 x [10 x i32]], [10 x [10 x i32]]* %e, i64 %indvars.innermost, i64 %indvars.mi…
59 …mentptr inbounds [10 x [10 x i32]], [10 x [10 x i32]]* %f, i64 %indvars.innermost, i64 %indvars.mi…
61 %indvars.innermost.next = add nuw nsw i64 %indvars.innermost, 1
62 %exitcond.innermost = icmp ne i64 %indvars.innermost.next, 10
63 br i1 %exitcond.innermost, label %for.innermost, label %for.middle.latch
|
| H A D | outer-header-jump-to-inner-latch.ll | 134 ; CHECK: innermost.preheader:
136 ; CHECK: innermost.body:
139 ; CHECK: innermost.body.split1:
145 ; CHECK: innermost.body.split:
149 ; CHECK: innermost.loopexit:
177 br label %innermost.body
179 innermost.body: ; preds = %innermost.preheader, %innermost.…
180 …%indvar.innermost = phi i64 [ %indvar.innermost.next, %innermost.body ], [ 4, %innermost.preheader…
183 %indvar.innermost.next = add nsw i64 %indvar.innermost, -1
185 br i1 %tobool5.i, label %innermost.loopexit, label %innermost.body
[all …]
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopUnroll/ |
| H A D | invalidate_right_loop.ll | 29 br label %innermost.loop
31 store.block: ; preds = %innermost.loop
40 innermost.loop: ; preds = %innermost.loop, %inner.loop
41 %tmp17 = phi i64 [ 0, %inner.loop ], [ %tmp20, %innermost.loop ]
42 %local_6_51 = phi i32 [ 1, %inner.loop ], [ %tmp21, %innermost.loop ]
47 br i1 %tmp22, label %store.block, label %innermost.loop
|
| /llvm-project-15.0.7/llvm/test/CodeGen/PowerPC/ |
| H A D | loop-align.ll | 8 ; Test the loop alignment and the option -disable-ppc-innermost-loop-align32.
9 ; RUN: llc -verify-machineinstrs -mcpu=a2 -disable-ppc-innermost-loop-align32 -mtriple powerpc64le-…
10 ; RUN: llc -verify-machineinstrs -mcpu=pwr8 -disable-ppc-innermost-loop-align32 -mtriple powerpc64l…
11 ; RUN: llc -verify-machineinstrs -mcpu=pwr9 -disable-ppc-innermost-loop-align32 -mtriple powerpc64l…
12 ; RUN: llc -verify-machineinstrs -mcpu=pwr8 -disable-ppc-innermost-loop-align32 -mtriple powerpc64-…
13 ; RUN: llc -verify-machineinstrs -mcpu=pwr9 -disable-ppc-innermost-loop-align32 -mtriple powerpc64-…
18 ; Test the loop alignment when the innermost hot loop has more than 8 instructions.
76 ; Test the loop alignment when the innermost hot loop has 5-8 instructions.
122 ; Test the small loop alignment when the innermost hot loop has less than 4 instructions.
155 ; Test the loop alignment when the innermost cold loop has more than 8 instructions.
|
| /llvm-project-15.0.7/polly/lib/External/isl/test_inputs/codegen/ |
| H A D | disjuncts.in | 1 # Check that conditions are hoisted up from the innermost loop
|
| /llvm-project-15.0.7/clang/test/CodeGenObjC/ |
| H A D | debug-info-nested-blocks.m | 22 // innermost block.
|
| H A D | encode-test.m | 14 struct Innermost *innermost; field
|
| /llvm-project-15.0.7/polly/test/IstAstInfo/ |
| H A D | dependence_distance_minimal.ll | 3 ; The minimal dependence distance of the innermost loop should be 1 instead of 250.
|
| /llvm-project-15.0.7/clang/test/SemaObjC/ |
| H A D | nullability.m | 38 // expected-note@-1{{use nullability type specifier '_Nonnull' to affect the innermost pointer type…
44 // expected-note@-1{{use nullability type specifier '_Nullable' to affect the innermost pointer typ…
55 // expected-note@-1{{use nullability type specifier '_Nullable' to affect the innermost pointer typ…
283 …expected-note {{use nullability type specifier '_Nonnull' to affect the innermost pointer type of …
|
| /llvm-project-15.0.7/llvm/test/CodeGen/X86/ |
| H A D | innermost-loop-alignment.ll | 3 ; RUN: llc < %s -mtriple=i686-pc-linux-gnu -x86-experimental-pref-innermost-loop-alignment=5 | File…
4 ; RUN: llc < %s -mtriple=i686-pc-linux-gnu -align-loops=32 -x86-experimental-pref-innermost-loop-al…
|
| /llvm-project-15.0.7/polly/test/ScopInfo/NonAffine/ |
| H A D | non-affine-loop-condition-dependent-access_2.ll | 7 ; innermost loop as a SCoP of depth 1, we can overapproximate the
8 ; innermost loop in the whole loop nest and model A[k] as a non-affine
|
| H A D | non-affine-loop-condition-dependent-access_3.ll | 7 ; innermost loop as a SCoP of depth 1, we can overapproximate the
8 ; innermost loop in the whole loop nest and model A[k] as a non-affine
|
| /llvm-project-15.0.7/llvm/test/DebugInfo/MIR/X86/ |
| H A D | livedebugvalues_many_loop_heads.mir | 16 ; from entry, or from bb.14 where $rsi is def'd. While the innermost four
30 ; that value is live-through the innermost four loops. If we
|
| /llvm-project-15.0.7/mlir/lib/Dialect/SCF/Utils/ |
| H A D | Utils.cpp | 616 scf::ForOp innermost = loops.back(); in coalesceLoops() local
622 normalizeLoop(loop, outermost, innermost); in coalesceLoops()
661 innermost.getBody()->back().erase(); in coalesceLoops()
664 innermost.getBody()->getOperations()); in coalesceLoops()
|
| /llvm-project-15.0.7/polly/test/ScopDetect/ |
| H A D | non-affine-loop-condition-dependent-access_2.ll | 7 ; innermost loop as a SCoP of depth 1, we have to reject the loop nest if not
|
| H A D | non-affine-loop-condition-dependent-access_3.ll | 7 ; innermost loop as a SCoP of depth 1, we have to reject the loop nest if not
|
| /llvm-project-15.0.7/polly/test/ScheduleOptimizer/ |
| H A D | pattern-matching-based-opts_6.ll | 24 ; tile prefixes that have exactly Mr x Nr iterations of the two innermost
31 ; the conditional expressions of the unrolled innermost loops, which
|
| H A D | pattern-matching-based-opts_9.ll | 18 ; nest, the innermost loop body). This test checks the form of
|
| H A D | pattern-matching-based-opts_8.ll | 17 ; nest, the innermost loop body). This test checks the form of
|
| /llvm-project-15.0.7/flang/docs/ |
| H A D | BijectiveInternalNameUniquing.md | 32 innermost scope as
|
| /llvm-project-15.0.7/polly/test/CodeGen/ |
| H A D | loop_with_condition_2.ll | 3 ; Verify that we actually detect this loop as the innermost loop even though
|
| /llvm-project-15.0.7/mlir/test/Dialect/SparseTensor/ |
| H A D | dense.mlir | 114 // The missing innermost "k" index (due to a reduction) is accounted
|
| /llvm-project-15.0.7/llvm/test/Analysis/DependenceAnalysis/ |
| H A D | MismatchingNestLevels.ll | 119 ;; A[s] = 0; // Invariant in innermost loop
|
| /llvm-project-15.0.7/llvm/docs/ |
| H A D | Vectorizers.rst | 223 control flow in the innermost loop. The innermost loop may contain complex
|