| /llvm-project-15.0.7/llvm/test/Transforms/LoopInterchange/ |
| H A D | innermost-latch-uses-values-in-middle-header.ll | 9 ;; doing interchange for the (new) middle loop and the outermost loop, because of 20 br label %outermost.header 22 outermost.header: ; preds = %outermost.latch, %entry 23 %indvar.outermost = phi i32 [ 10, %entry ], [ %indvar.outermost.next, %outermost.latch ] 25 br i1 %tobool71.i, label %middle.header, label %outermost.latch 49 br i1 %tobool2.i, label %outermost.latch, label %middle.header 51 outermost.latch: ; preds = %middle.latch, %outermost.header 52 %indvar.outermost.next = add nsw i32 %indvar.outermost, -5 53 %tobool.i = icmp eq i32 %indvar.outermost.next, 0 54 br i1 %tobool.i, label %outermost.exit, label %outermost.header [all …]
|
| H A D | pr43326-ideal-access-pattern.ll | 32 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 D | outer-header-jump-to-inner-latch.ll | 124 ; CHECK: outermost.header: 155 ; CHECK: outermost.latch: 159 ; CHECK: outermost.exit: 164 br label %outermost.header 166 outermost.header: ; preds = %outermost.latch, %entry 167 %indvar.outermost = phi i32 [ 10, %entry ], [ %indvar.outermost.next, %outermost.latch ] 193 br i1 %tobool2.i, label %outermost.latch, label %middle.header 196 %indvar.outermost.next = add nsw i32 %indvar.outermost, -5 197 %tobool.i = icmp eq i32 %indvar.outermost.next, 0 198 br i1 %tobool.i, label %outermost.exit, label %outermost.header [all …]
|
| /llvm-project-15.0.7/mlir/lib/Dialect/SCF/Utils/ |
| H A D | Utils.cpp | 617 scf::ForOp outermost = loops.front(); in coalesceLoops() local 622 normalizeLoop(loop, outermost, innermost); in coalesceLoops() 626 OpBuilder builder(outermost); in coalesceLoops() 627 Location loc = outermost.getLoc(); in coalesceLoops() 628 Value upperBound = outermost.getUpperBound(); in coalesceLoops() 632 outermost.setUpperBound(upperBound); in coalesceLoops() 634 builder.setInsertionPointToStart(outermost.getBody()); in coalesceLoops() 644 Value previous = outermost.getInductionVar(); in coalesceLoops() 662 outermost.getBody()->getOperations().splice( in coalesceLoops()
|
| /llvm-project-15.0.7/llvm/docs/ |
| H A D | CycleTerminology.rst | 16 1. In a directed graph G, an *outermost cycle* is a maximal strongly 29 4. In any depth-first search starting from the entry, set of outermost 32 5. The cycles nested inside a cycle C with header H are the outermost 38 the parent of any outermost cycles nested inside C. The tree closely
|
| /llvm-project-15.0.7/clang/test/Analysis/ |
| H A D | live-variables.m | 17 // Note, due to ObjC method call, the outermost logical operator is wrapped in ExprWithCleanups.
|
| /llvm-project-15.0.7/polly/test/ScheduleOptimizer/ |
| H A D | SIMDInParallelFor.ll | 62 ; No parallel loop except the to outermost.
|
| /llvm-project-15.0.7/mlir/lib/Dialect/Affine/Utils/ |
| H A D | LoopUtils.cpp | 1720 AffineForOp outermost = loops.front(); in coalesceLoops() local 1721 AffineBound ub = outermost.getUpperBound(); in coalesceLoops() 1723 Location loc = outermost.getLoc(); in coalesceLoops() 1724 OpBuilder builder(outermost); in coalesceLoops() 1772 outermost.setUpperBound(prev, newUbMap); in coalesceLoops() 1774 builder.setInsertionPointToStart(outermost.getBody()); in coalesceLoops() 1784 Value previous = outermost.getInductionVar(); in coalesceLoops() 1822 outermost.getBody()->getOperations().splice( in coalesceLoops()
|
| /llvm-project-15.0.7/flang/docs/ |
| H A D | BijectiveInternalNameUniquing.md | 31 that symbol. After the `_Q` sigil, names are constructed from outermost to
|
| /llvm-project-15.0.7/mlir/include/mlir/Dialect/SparseTensor/IR/ |
| H A D | SparseTensorBase.td | 54 are outermost or using a 1-dimensional access pattern expansion
|
| /llvm-project-15.0.7/clang/test/SemaOpenCL/ |
| H A D | storageclass.cl | 133 …rror {{variables in the local address space can only be declared in the outermost scope of a kerne… 134 …r {{variables in the constant address space can only be declared in the outermost scope of a kerne…
|
| /llvm-project-15.0.7/polly/test/ScopDetect/ |
| H A D | only-one-affine-loop.ll | 3 ; Even if we allow non-affine loops we can only model the outermost loop, all
|
| /llvm-project-15.0.7/llvm/test/Analysis/LoopCacheAnalysis/PowerPC/ |
| H A D | single-store.ll | 79 ; as the outermost loop. This test differs from foo() since the
|
| /llvm-project-15.0.7/clang/docs/ |
| H A D | LibASTMatchers.rst | 63 #. Find the outermost class in Clang's AST you want to match.
|
| /llvm-project-15.0.7/openmp/runtime/src/ |
| H A D | kmp_itt.inl | 130 // The frame notifications are only supported for the outermost teams. 197 // The frame notifications are only supported for the outermost teams. 371 // The frame notifications are only supported for the outermost teams.
|
| /llvm-project-15.0.7/polly/lib/External/ppcg/ |
| H A D | README | 80 spaces. The sizes are specified outermost to innermost.
|
| /llvm-project-15.0.7/mlir/include/mlir/Interfaces/ |
| H A D | DataLayoutInterfaces.td | 97 "layouts, provided from the outermost (oldest) to the "
|
| /llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/ |
| H A D | smed3.ll | 163 ; + commute outermost max 372 ; + commute outermost min
|
| H A D | umed3.ll | 149 ; + commute outermost max 358 ; + commute outermost min
|
| /llvm-project-15.0.7/flang/lib/Lower/ |
| H A D | Bridge.cpp | 1488 const bool outermost = !lows.empty(); in genFIR() local 1497 if (outermost) { in genFIR() 1522 if ((!loops.empty() || !outermost) && !lp.getRegionIterArgs().empty()) in genFIR() 1529 if (outermost) in genFIR()
|
| /llvm-project-15.0.7/mlir/docs/Dialects/Linalg/ |
| H A D | OpDSL.md | 202 reduction functions can appear as the outermost function on the RHS:
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopDeletion/ |
| H A D | unreachable-loops.ll | 385 ; L2 as well. Finally, the outermost loop L1 is deleted.
|
| /llvm-project-15.0.7/llvm/test/Transforms/SimplifyCFG/X86/ |
| H A D | empty-cleanuppad.ll | 54 ; In this case, the outermost cleanup pad can be eliminated and the catch block
|
| /llvm-project-15.0.7/mlir/test/Dialect/Affine/ |
| H A D | dma-generate.mlir | 6 // otherwise always generate DMAs at the outermost level (default for fast mem
|
| /llvm-project-15.0.7/llvm/test/Transforms/SimpleLoopUnswitch/ |
| H A D | nontrivial-unswitch-freeze.ll | 911 ; another loop, we correctly attribute the cloned preheader to that outermost 1012 ; another loop, we correctly sink the preheader to the outermost loop rather
|