Home
last modified time | relevance | path

Searched refs:UB (Results 1 – 25 of 134) sorted by relevance

123456

/llvm-project-15.0.7/polly/test/ScopInfo/
H A Dinvariant_loads_complicated_dependences.ll5 ; CHECK-NEXT: [LB, UB] -> { Stmt_for_body[i0] -> MemRef_LBptr[0] };
6 ; CHECK-NEXT: Execution Context: [LB, UB] -> { : }
8 ; CHECK-NEXT: [LB, UB] -> { Stmt_do_cond[i0, i1] -> MemRef_UBptr[0] };
9 ; CHECK-NEXT: Execution Context: [LB, UB] -> { : }
11 ; CHECK-NEXT: [LB, UB] -> { Stmt_if_then[i0, i1] -> MemRef_V[0] };
12 ; CHECK-NEXT: Execution Context: [LB, UB] -> { : LB >= 6 or (UB > LB and UB >= 6) }
14 ; CHECK-NEXT: [LB, UB] -> { Stmt_if_else[i0, i1] -> MemRef_U[0] };
15 ; CHECK-NEXT: Execution Context: [LB, UB] -> { : LB <= 5 }
27 ; } while (j++ < /* invariant load */ *UB);
72 %UB = load i32, i32* %UBptr, align 4
[all …]
H A Dinvariant_loads_cyclic_dependences.ll3 ; Negative test. If we assume UB[*V] to be invariant we get a cyclic
6 ; that the access happened. However, at the moment we assume UB[*V]
12 ; void f(int *restrict V, int *restrict UB, int *restrict A) {
17 ; x = /* invariant load dependent on UB[*V] */ *V;
19 ; } while (j++ < /* invariant load dependent on *V */ UB[x]);
25 define void @f(i32* noalias %V, i32* noalias %UB, i32* noalias %A) {
49 %arrayidx3 = getelementptr inbounds i32, i32* %UB, i32 %tmp
H A Dinvariant_load_loop_ub.ll8 ; void f(int *A, int *UB) {
9 ; for (int i = 0; i < *UB; i++)
15 define void @f(i32* %A, i32* %UB) {
21 %tmp = load i32, i32* %UB, align 4
/llvm-project-15.0.7/polly/lib/CodeGen/
H A DLoopGeneratorsKMP.cpp56 UB, in createCallSpawnThreads()
75 createCallSpawnThreads(SubFn, SubFnParam, LB, UB, Stride); in deployParallelExecution()
172 Value *UB = &*AI; in createSubFn() local
189 Builder.CreateAlignedStore(UB, UBPtr, Alignment); in createSubFn()
210 UB = AdjustedUB; in createSubFn()
211 createCallDispatchInit(ID, LB, UB, Stride, ChunkSize); in createSubFn()
229 UB = Builder.CreateAlignedLoad(LongType, UBPtr, Alignment, in createSubFn()
251 UB = Builder.CreateSelect(UBInRange, UB, AdjustedUB, "polly.indvar.UB"); in createSubFn()
252 Builder.CreateAlignedStore(UB, UBPtr, Alignment); in createSubFn()
271 Value *NextUB = Builder.CreateAdd(UB, ChunkedStride); in createSubFn()
[all …]
H A DLoopGeneratorsGOMP.cpp22 Value *LB, Value *UB, in createCallSpawnThreads() argument
45 LB, UB, Stride}; in createCallSpawnThreads()
53 Value *LB, Value *UB, in deployParallelExecution() argument
56 createCallSpawnThreads(SubFn, SubFnParam, LB, UB, Stride); in deployParallelExecution()
148 Value *UB = Builder.CreateLoad(LongType, UBPtr, "polly.par.UB"); in createSubFn() local
152 UB = Builder.CreateSub(UB, ConstantInt::get(LongType, 1), in createSubFn()
159 createLoop(LB, UB, Stride, Builder, LI, DT, AfterBB, ICmpInst::ICMP_SLE, in createSubFn()
H A DLoopGenerators.cpp83 Value *polly::createLoop(Value *LB, Value *UB, Value *Stride, in createLoop() argument
92 assert(LB->getType() == UB->getType() && "Types of loop bounds do not match"); in createLoop()
93 IntegerType *LoopIVType = dyn_cast<IntegerType>(UB->getType()); in createLoop()
137 LoopGuard = Builder.CreateICmp(Predicate, LB, UB); in createLoop()
158 Builder.CreateICmp(Predicate, IncrementedIV, UB, "polly.loop_cond"); in createLoop()
177 Value *LB, Value *UB, Value *Stride, SetVector<Value *> &UsedValues, in createParallelLoop() argument
194 UB = Builder.CreateAdd(UB, ConstantInt::get(LongType, 1)); in createParallelLoop()
197 deployParallelExecution(SubFn, SubFnParam, LB, UB, Stride); in createParallelLoop()
/llvm-project-15.0.7/mlir/test/Dialect/SCF/
H A Dfor-loop-peeling.mlir7 // CHECK-SAME: %[[LB:.*]]: index, %[[UB:.*]]: index, %[[STEP:.*]]: index
16 // CHECK: %[[RESULT:.*]] = scf.for %[[IV2:.*]] = %[[NEW_UB]] to %[[UB]]
18 // CHECK: %[[REM:.*]] = affine.apply #[[MAP1]](%[[IV2]])[%[[UB]]]
73 // CHECK-SAME: %[[UB:.*]]: index
78 // CHECK: %[[NEW_UB:.*]] = affine.apply #[[MAP0]]()[%[[UB]]]
86 // CHECK: %[[REM:.*]] = affine.apply #[[MAP1]](%[[IV2]])[%[[UB]]]
112 // CHECK-SAME: %[[UB:.*]]: index, %[[MEMREF:.*]]: memref<i32>
116 // CHECK: %[[NEW_UB:.*]] = affine.apply #[[MAP0]]()[%[[UB]]]
122 // CHECK: scf.for %[[IV2:.*]] = %[[NEW_UB]] to %[[UB]] step %[[C4]] {
123 // CHECK: %[[REM:.*]] = affine.apply #[[MAP1]](%[[IV2]])[%[[UB]]]
[all …]
/llvm-project-15.0.7/polly/test/CodeGen/
H A Dinvariant_load_loop_ub.ll5 ; void f(int *A, int *UB) {
6 ; for (int i = 0; i < *UB; i++)
12 define void @f(i32* %A, i32* %UB) {
18 %tmp = load i32, i32* %UB, align 4
/llvm-project-15.0.7/openmp/runtime/test/tasking/
H A Dkmp_taskloop_5.c10 #define UB 118 macro
111 task->ub = UB; in task_loop()
133 tc = UB - LB + 1; in task_loop()
135 tc = (LB - UB) / (-ST) + 1; in task_loop()
137 tc = (UB - LB) / ST + 1; in task_loop()
/llvm-project-15.0.7/libcxx/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.ctor/
H A Dmove_convert.runtime.pass.cpp53 using UB = std::unique_ptr<B[]>; in test_sfinae() typedef
54 static_assert(!std::is_constructible<UA, UB&&>::value, ""); in test_sfinae()
58 using UB = std::unique_ptr<B[], GenericConvertingDeleter<1> >; in test_sfinae() typedef
59 static_assert(!std::is_constructible<UA, UB&&>::value, ""); in test_sfinae()
H A Dmove_convert.single.pass.cpp98 using UB = std::unique_ptr<B>; in test_sfinae() typedef
102 static_assert(std::is_constructible<UA, UB&&>::value, ""); in test_sfinae()
103 static_assert(!std::is_constructible<UA, UB&>::value, ""); in test_sfinae()
104 static_assert(!std::is_constructible<UA, const UB&>::value, ""); in test_sfinae()
108 static_assert(!std::is_constructible<UAD, UB&&>::value, ""); in test_sfinae()
/llvm-project-15.0.7/libcxx/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.asgn/
H A Dmove_convert.single.pass.cpp78 using UB = std::unique_ptr<B>; in test_sfinae() typedef
82 static_assert(std::is_assignable<UA, UB&&>::value, ""); in test_sfinae()
83 static_assert(!std::is_assignable<UA, UB&>::value, ""); in test_sfinae()
84 static_assert(!std::is_assignable<UA, const UB&>::value, ""); in test_sfinae()
88 static_assert(!std::is_assignable<UAD, UB&&>::value, ""); in test_sfinae()
/llvm-project-15.0.7/polly/include/polly/CodeGen/
H A DLoopGeneratorsKMP.h71 Value *UB, Value *Stride);
74 Value *UB, Value *Stride) override;
102 void createCallDispatchInit(Value *GlobalThreadID, Value *LB, Value *UB,
H A DLoopGeneratorsGOMP.h45 Value *UB, Value *Stride);
48 Value *UB, Value *Stride) override;
H A DLoopGenerators.h159 Value *createParallelLoop(Value *LB, Value *UB, Value *Stride,
218 Value *LB, Value *UB, Value *Stride) = 0;
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/
H A DSIInsertWaitcnts.cpp309 if (ScoreLBs[T] < UB && UB < ScoreUBs[T]) in setScoreUB()
310 ScoreLBs[T] = UB; in setScoreUB()
687 unsigned UB = getScoreUB(T); in print() local
707 if (LB < UB) { in print()
748 const unsigned UB = getScoreUB(T); in simplifyWaitcnt() local
753 if (Count >= UB - LB) in simplifyWaitcnt()
762 const unsigned UB = getScoreUB(T); in determineWait() local
794 if (Count >= UB) in applyWaitcnt()
801 setScoreLB(T, UB); in applyWaitcnt()
1222 if (UB - LB != 0) in generateWaitcntInstBefore()
[all …]
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DObjCARCAliasAnalysis.cpp56 const Value *UB = GetUnderlyingObjCPtr(SB); in alias() local
57 if (UA != SA || UB != SB) { in alias()
59 MemoryLocation::getBeforeOrAfter(UB), AAQI); in alias()
/llvm-project-15.0.7/polly/test/CodeGen/OpenMP/
H A Dsingle_loop.ll64 ; IR-NEXT: %polly.par.UB = load i64, i64* %polly.par.UBPtr
65 ; IR-NEXT: %polly.par.UBAdjusted = sub i64 %polly.par.UB, 1
120 ; LIBOMP-IR-STATIC-CHUNKED-NEXT: %polly.indvar.UB.temp = load i64, i64* %polly.par.UBPtr
121 ; LIBOMP-IR-STATIC-CHUNKED-NEXT: %polly.indvar.UB.inRange = icmp sle i64 %polly.indvar.UB.temp, %…
122 …IBOMP-IR-STATIC-CHUNKED-NEXT: %polly.indvar.UB = select i1 %polly.indvar.UB.inRange, i64 %polly.…
123 ; LIBOMP-IR-STATIC-CHUNKED-NEXT: store i64 %polly.indvar.UB, i64* %polly.par.UBPtr, align 8
124 …OMP-IR-STATIC-CHUNKED-NEXT: %polly.hasIteration = icmp sle i64 %polly.indvar.LB, %polly.indvar.UB
133 ; LIBOMP-IR-STATIC-CHUNKED-NEXT: %{{[0-9]+}} = add i64 %polly.indvar.UB.entry, %polly.kmpc.stride
143 ; LIBOMP-IR-STATIC-CHUNKED-NEXT: %polly.indvar.UB.entry = load i64, i64* %polly.par.UBPtr, align 8
191 ; LIBOMP-IR-STATIC-NEXT: %polly.loop_cond = icmp sle i64 %polly.indvar_next, %polly.indvar.UB
[all …]
/llvm-project-15.0.7/mlir/test/Conversion/SCFToSPIRV/
H A Dfor.mlir11 // CHECK: %[[UB:.*]] = spv.Constant 42 : i32
18 // CHECK: %[[CMP:.*]] = spv.SLessThan %[[INDVAR]], %[[UB]] : i32
49 // CHECK: %[[UB:.*]] = spv.Constant 42 : i32
62 // CHECK: %[[CMP:.*]] = spv.SLessThan %[[INDVAR]], %[[UB]] : i32
/llvm-project-15.0.7/llvm/lib/DebugInfo/DWARF/
H A DDWARFTypePrinter.cpp24 Optional<uint64_t> UB; in appendArrayType() local
31 UB = UpperV->getAsUnsignedConstant(); in appendArrayType()
39 if (!LB && !Count && !UB) in appendArrayType()
41 else if (!LB && (Count || UB) && DefaultLB) in appendArrayType()
42 OS << '[' << (Count ? *Count : *UB - *DefaultLB + 1) << ']'; in appendArrayType()
55 else if (UB) in appendArrayType()
56 OS << *UB + 1; in appendArrayType()
/llvm-project-15.0.7/mlir/test/Transforms/
H A Dscf-loop-unroll.mlir39 // CHECK-NEXT: %[[UB:.*]] = arith.subi %[[N]], %[[REM]]
40 // CHECK-NEXT: %[[SUM:.*]]:2 = scf.for {{.*}} = %[[C0]] to %[[UB]] step %[[C3]] iter_args
42 …// CHECK-NEXT: %[[SUM1:.*]]:2 = scf.for {{.*}} = %[[UB]] to %[[N]] step %[[C1]] iter_args(%[[V1:.*…
/llvm-project-15.0.7/clang/lib/AST/
H A DStmtOpenMP.cpp352 Dir->setUpperBoundVariable(Exprs.UB); in Create()
467 Dir->setUpperBoundVariable(Exprs.UB); in Create()
597 Dir->setUpperBoundVariable(Exprs.UB); in Create()
642 Dir->setUpperBoundVariable(Exprs.UB); in Create()
959 Dir->setUpperBoundVariable(Exprs.UB); in Create()
1063 Dir->setUpperBoundVariable(Exprs.UB); in Create()
1108 Dir->setUpperBoundVariable(Exprs.UB); in Create()
1151 Dir->setUpperBoundVariable(Exprs.UB); in Create()
1196 Dir->setUpperBoundVariable(Exprs.UB); in Create()
1241 Dir->setUpperBoundVariable(Exprs.UB); in Create()
[all …]
/llvm-project-15.0.7/mlir/test/Dialect/Affine/
H A Dloop-tiling-validity.mlir8 // CHECK-DAG: [[$UB:#map[0-9]+]] = affine_map<(d0) -> (d0 + 32)>
24 // CHECK-NEXT: affine.for %{{.*}} = [[$LB]](%{{.*}}) to [[$UB]](%{{.*}}) {
/llvm-project-15.0.7/clang/test/CodeGen/
H A Dxcore-stringtype.c164 union UB{int:4; int:2; int N4:4; int N2:2; unsigned int:4; signed int:4; union
167 int unionTypeB(union UB ub) {return UnionAnon.A;} in unionTypeB()
/llvm-project-15.0.7/llvm/lib/IR/
H A DDebugInfoMetadata.cpp421 Metadata *UB = getRawUpperBound(); in getUpperBound() local
422 if (!UB) in getUpperBound()
425 assert((isa<ConstantAsMetadata>(UB) || isa<DIVariable>(UB) || in getUpperBound()
426 isa<DIExpression>(UB)) && in getUpperBound()
432 if (auto *MD = dyn_cast<DIVariable>(UB)) in getUpperBound()
435 if (auto *MD = dyn_cast<DIExpression>(UB)) in getUpperBound()
511 Metadata *UB = getRawUpperBound(); in getUpperBound() local
512 if (!UB) in getUpperBound()
515 assert((isa<DIVariable>(UB) || isa<DIExpression>(UB)) && in getUpperBound()
518 if (auto *MD = dyn_cast<DIVariable>(UB)) in getUpperBound()
[all …]

123456