Home
last modified time | relevance | path

Searched full:outermost (Results 1 – 25 of 274) sorted by relevance

1234567891011

/llvm-project/llvm/test/Transforms/LoopInterchange/
H A Dinnermost-latch-uses-values-in-middle-header.ll16 ; doing interchange for the (new) middle loop and the outermost loop, because of
46 br label %outermost.header
48 outermost.header: ; preds = %outermost.latch, %entry
49 %indvar.outermost = phi i32 [ 10, %entry ], [ %indvar.outermost.next, %outermost.latch ]
51 br i1 %tobool71.i, label %middle.header, label %outermost.latch
53 middle.header: ; preds = %middle.latch, %outermost.header
54 %indvar.middle = phi i64 [ 4, %outermost
[all...]
H A Dpr43326-ideal-access-pattern.ll32 br label %for.outermost.header
34 for.outermost.header: ; preds = %entry, %for.outermost.latch
35 %indvars.outermost = phi i64 [ 0, %entry ], [ %indvars.outermost.next, %for.outermost.latch ]
38 for.cond.cleanup: ; preds = %for.outermost.latch
41 for.middle.header: ; preds = %for.outermost.header, %for.middle.latch
42 …%indvars.middle = phi i64 [ 0, %for.outermost.header ], [ %indvars.middle.next, %for.middle.latch ]
45 for.outermost.latch: ; preds = %for.middle.latch
46 %indvars.outermost.next = add nuw nsw i64 %indvars.outermost, 1
47 %exitcond.outermost = icmp ne i64 %indvars.outermost.next, 10
48 br i1 %exitcond.outermost, label %for.outermost.header, label %for.cond.cleanup
[all …]
H A Douter-header-jump-to-inner-latch.ll109 br label %outermost.header
111 outermost.header: ; preds = %outermost.latch, %entry
112 %indvar.outermost = phi i32 [ 10, %entry ], [ %indvar.outermost.next, %outermost.latch ]
117 middle.header: ; preds = %middle.latch, %outermost.header
118 %indvar.middle = phi i64 [ 4, %outermost.header ], [ %indvar.middle.next, %middle.latch ]
138 br i1 %tobool2.i, label %outermost.latch, label %middle.header
140 outermost
[all...]
H A Dinterchanged-loop-nest-4.ll11 ; the outermost loop. This test case runs loop interchange twice. In the loop pass
13 ; the original outermost loop becomes a inner loop hence the loop nest constructed
H A Dmultilevel-partial-reduction.ll8 ; Check that the outermost and the middle loops are not interchanged since
10 ; that loop interchange can handle. Interchanging the outermost and the
/llvm-project/llvm/test/Transforms/LoopVectorize/
H A Douter_loop_hcfg_construction.ll16 ; Make sure VPlan HCFG is constructed when we try to vectorize non-outermost loop
23 ; CHECK: outermost.loop:
81 ; CHECK: outermost.loop.latch:
85 ; CHECK: outermost.loop.postexit:
91 br label %outermost.loop
93 outermost.loop:
94 %k = phi i64 [ 0, %entry ], [ %k.next, %outermost.loop.latch ]
103 %i = phi i64 [ %i.next, %middle.loop.latch ], [ 0, %outermost.loop ]
119 br i1 %exitcond41.not, label %outermost.loop.latch, label %middle.loop, !llvm.loop !3
121 outermost
[all...]
/llvm-project/clang/include/clang/Sema/
H A DTemplate.h90 /// argument list (first) to the outermost template argument list (last).
143 /// Determine how many of the \p OldDepth outermost template parameter
254 /// Add an outermost level that we are not substituting. We have no
268 /// Retrieve the outermost template argument list.
464 /// outermost scope. in cloneScopes()
465 LocalInstantiationScope *cloneScopes(LocalInstantiationScope *Outermost) { in cloneScopes()
466 if (this == Outermost) return this; in cloneScopes()
477 newScope->Outer = Outer->cloneScopes(Outermost); in cloneScopes()
504 /// given outermost scope. in deleteScopes()
506 LocalInstantiationScope *Outermost) {
458 cloneScopes(LocalInstantiationScope * Outermost) cloneScopes() argument
499 deleteScopes(LocalInstantiationScope * Scope,LocalInstantiationScope * Outermost) deleteScopes() argument
[all...]
/llvm-project/clang/include/clang/Basic/
H A DOpenMPKinds.h292 /// directive in the outermost nest. For example
295 /// \return true - the directive has teams on the outermost nest, otherwise -
319 /// distribute directive in the outermost nest. For example,
322 /// \return true - the directive has distribute on the outermost nest.
327 /// outermost nest. For example, 'omp teams loop' or 'omp loop'.
329 /// \return true - the directive has loop on the outermost nest.
/llvm-project/clang/test/Sema/
H A Dstatic-array.c50 [static 42]); // expected-error {{'static' used in non-outermost array type derivation}}
53 [const 42]); // expected-error {{type qualifier used in non-outermost array type derivation}}
55 void k(int (*x)[static 10]); // expected-error {{'static' used in non-outermost array type derivati…
/llvm-project/mlir/include/mlir/Dialect/Affine/
H A DLoopUtils.h63 /// in it from outermost to innermost.
103 /// Returns all maximal outermost perfect loop nests to tile.
135 /// 'loopPermMap[i]', where positions 0, 1, ... are from the outermost position
137 /// becomes the new outermost loop of this nest. This method always succeeds,
144 // outermost (while again preserving relative order among them).
233 /// `loops` contains a list of perfectly nested loops outermost to innermost
/llvm-project/clang-tools-extra/test/clang-tidy/checkers/llvmlibc/
H A Dimplementation-in-namespace.cpp17 // CHECK-MESSAGES: :[[@LINE-1]]:11: warning: the outermost namespace should be the 'LIBC_NAMESPACE_DECL' macro
28 // CHECK-MESSAGES: :[[@LINE-1]]:11: warning: the outermost namespace should be the 'LIBC_NAMESPACE_DECL' macro
/llvm-project/libcxx/test/std/utilities/allocator.adaptor/allocator.adaptor.members/
H A Dconstruct_type.pass.cpp33 // OUTERMOST (*this), p, std::forward<Args>(args)...).
64 // true, calls OUTERMOST_ALLOC_TRAITS(*this)::construct(OUTERMOST (*this), p,
102 // OUTERMOST_ALLOC_TRAITS(*this)::construct(OUTERMOST (*this), p,
/llvm-project/clang-tools-extra/clang-tidy/llvmlibc/
H A DCalleeNamespaceCheck.cpp21 // Gets the outermost namespace of a DeclContext, right under the Translation
50 // If the outermost namespace of the function is a macro that starts with in check()
/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanHCFGBuilder.h15 /// and/or VPRegionBlocks (i.e., other H-CFGs). The outermost H-CFG of a VPlan
42 // The outermost loop of the input loop nest considered for vectorization.
H A DVPlanHCFGBuilder.cpp36 // The outermost loop of the input loop nest considered for vectorization.
220 // i.e., is not part of: a) the loop nest, b) outermost loop PH and, c)
221 // outermost loop exits.
237 // Instruction definition is in outermost loop PH. in isExternalDef()
244 // Instruction definition is in outermost loop exit. in isExternalDef()
/llvm-project/mlir/include/mlir/Dialect/Vector/Transforms/
H A DLoweringPatterns.h66 /// either innermost or outermost, by adding the proper vector.transpose
70 /// Once in innermost or outermost reduction
76 /// Once in 2-D vector.multi_reduction form, with an **outermost** reduction
249 /// outermost dimension.
/llvm-project/llvm/unittests/Analysis/
H A DLoopNestTest.cpp97 // Ensure that we can identify the outermost loop in the nest. in TEST()
184 // Skip the first basic block (entry), get to the outermost loop header. in TEST()
195 // Ensure that we can identify the outermost loop in the nest. in TEST()
279 // Ensure that we can identify the outermost loop in the nest. in TEST()
/llvm-project/mlir/test/lib/Dialect/Affine/
H A DTestVectorizationUtils.cpp84 "vectorizing the outermost loops found")};
236 // We vectorize the outermost loop found with VF=4. in testVecAffineLoopNest()
245 outs << "Outermost loop cannot be parallel\n"; in testVecAffineLoopNest()
/llvm-project/flang/include/flang/Lower/
H A DIterationSpace.h80 /// outermost loop in the loop nest. The output value is threaded through the
393 /// Reset the outermost `array_load` arguments to the loop nest.
396 /// Capture the current outermost loop.
455 /// Return the outermost loop in this FORALL nest.
461 /// Return the statement context for the entire, outermost FORALL construct.
/llvm-project/mlir/lib/Dialect/Affine/Utils/
H A DLoopUtils.cpp428 // The outermost among the loops as we add more.. in constructTiledLoopNest()
872 /// Returns all maximal outermost perfect loop nests to tile. in getTileableBands()
1364 /// in it from outermost to innermost. in isPerfectlyNested()
1387 // `input` that becomes the new outermost loop. in permuteLoops()
1425 // If this has to become the outermost loop after permutation, add it to the in permuteLoops()
1431 // Make input[i] the new outermost loop moving it into parentBlock. in permuteLoops()
1457 // outermost (while again preserving relative order among them). in sinkSequentialLoops()
1617 AffineForOp outermost = loops.front(); in coalesceLoops()
1618 AffineBound ub = outermost.getUpperBound(); in coalesceLoops()
1620 Location loc = outermost in coalesceLoops()
1613 AffineForOp outermost = loops.front(); coalesceLoops() local
[all...]
/llvm-project/mlir/test/Dialect/Affine/SuperVectorize/
H A Dvectorize_unsupported.mlir4 // CHECK: Outermost loop cannot be parallel
/llvm-project/clang/test/OpenMP/
H A Dtarget_update_messages.cpp160 …[1:2:2][1:2]) // ge50-error {{array section does not specify length for outermost dimension}} lt50…
162 …[1:2:2][1:2]) // ge50-error {{array section does not specify length for outermost dimension}} lt50…
188 // ge50-error@+4 {{array section does not specify length for outermost dimension}}
195 // ge50-error@+4 {{array section does not specify length for outermost dimension}}
/llvm-project/clang/test/Analysis/
H A Dlive-variables.m17 // Note, due to ObjC method call, the outermost logical operator is wrapped in ExprWithCleanups.
/llvm-project/polly/include/polly/CodeGen/
H A DIslAst.h88 /// Flag to mark outermost parallel loops.
139 /// Is this loop an outermost parallel loop?
/llvm-project/mlir/include/mlir/Dialect/Affine/Analysis/
H A DUtils.h215 /// from the outermost 'affine.for' operation to the innermost one while not
220 /// ops ordered from the outermost one to the innermost while not traversing
224 /// Populates 'ops' with affine operations enclosing `op` ordered from outermost
260 // List of sliced loop IVs (ordered from outermost to innermost).
529 /// order (major to minor / outermost to innermost). There may be additional

1234567891011