Home
last modified time | relevance | path

Searched refs:ub (Results 1 – 25 of 222) sorted by relevance

123456789

/llvm-project-15.0.7/openmp/runtime/test/worksharing/for/
H A Dkmp_sch_simd_guided.c115 if (!(lb <= ub)) { in run_loop_64()
124 if (!(lb >= ub)) { in run_loop_64()
144 next_lb = ub + loop_st; in run_loop_64()
145 last_ub = ub; in run_loop_64()
270 if (!(lb <= ub)) { in run_loop_32()
279 if (!(lb >= ub)) { in run_loop_32()
300 last_ub = ub; in run_loop_32()
372 i64 st, lb, ub; in run_64() local
376 for (ub = lb; ub < lb + num_th * (chunk+1) * st; ++ ub) { in run_64()
392 int chunk, st, lb, ub; in run_32() local
[all …]
H A Dkmp_sch_simd_runtime_guided.c74 int ub; // Chunk upper bound. in run_loop() local
115 tid, chunk, (int)lb, (int)ub, (int)(ub-lb+1)); in run_loop()
121 if (!(ub <= loop_ub)) in run_loop()
124 if (!(lb <= ub)) in run_loop()
126 (int)lb, (int)ub, chunk, ++err); in run_loop()
128 if (!(ub >= loop_ub)) in run_loop()
131 if (!(lb >= ub)) in run_loop()
133 (int)lb, (int)ub, chunk, ++err); in run_loop()
139 cur = ( ub - lb ) / loop_st + 1; in run_loop()
153 last_ub = ub; in run_loop()
[all …]
H A Dkmp_sch_simd_runtime_static.c68 int ub; // Chunk upper bound. in run_loop() local
109 tid, chunk, (int)lb, (int)ub, (int)(ub-lb+1)); in run_loop()
115 if (!(ub <= loop_ub)) in run_loop()
118 if (!(lb <= ub)) in run_loop()
120 (int)lb, (int)ub, chunk, ++err); in run_loop()
122 if (!(ub >= loop_ub)) in run_loop()
125 if (!(lb >= ub)) in run_loop()
127 (int)lb, (int)ub, chunk, ++err); in run_loop()
133 cur = ( ub - lb ) / loop_st + 1; in run_loop()
150 last_ub = ub; in run_loop()
[all …]
H A Dkmp_sch_simd_runtime_api.c66 int ub; // Chunk upper bound. in run_loop() local
107 tid, chunk, (int)lb, (int)ub, (int)(ub-lb+1)); in run_loop()
113 if (!(ub <= loop_ub)) in run_loop()
116 if (!(lb <= ub)) in run_loop()
118 (int)lb, (int)ub, chunk, ++err); in run_loop()
120 if (!(ub >= loop_ub)) in run_loop()
123 if (!(lb >= ub)) in run_loop()
125 (int)lb, (int)ub, chunk, ++err); in run_loop()
131 cur = ( ub - lb ) / loop_st + 1; in run_loop()
148 last_ub = ub; in run_loop()
[all …]
H A Domp_for_dynamic_large_chunk.c14 int i, j, lb, ub, stride, nthreads, actual_nthreads, chunk; in main() local
24 ub = atoi(argv[2]); in main()
28 if (lb >= ub) { in main()
40 for (i = lb; i < ub; i += stride) in main()
52 for (i = lb; i < ub; i += stride) { in main()
H A Domp_for_static_large_chunk.c26 int i, j, lb, ub, stride, nthreads, chunk; in main() local
36 ub = atoi(argv[2]); in main()
40 if (lb >= ub) { in main()
52 for (i = lb; i < ub; i += stride) in main()
68 for (i = lb; i < ub; i += stride) { in main()
100 for (i = lb, j = 0; i < ub; i += stride, ++j) { in main()
/llvm-project-15.0.7/llvm/test/MC/Hexagon/
H A Dv60-alu.s17 #CHECK: 1cc0d012 { v18.ub = vabsdiff(v16.ub,{{ *}}v0.ub) }
18 v18.ub=vabsdiff(v16.ub,v0.ub)
24 v6.b=vnavg(v10.ub,v9.ub)
57 v22.ub=vsub(v24.ub,v7.ub):sat
93 v7.ub=vavg(v25.ub,v28.ub)
99 v15:14.ub=vsub(v27:26.ub,v7:6.ub):sat
102 v28.ub=vavg(v0.ub,v31.ub):rnd
108 v7:6.ub=vadd(v19:18.ub,v17:16.ub):sat
135 v13.ub=vadd(v2.ub,v3.ub):sat
213 v16.ub=vmax(v1.ub,v0.ub)
[all …]
H A Dv60-vmpy1.s21 v23.w=vrmpy(v26.ub,r8.b)
23 #CHECK: 1915c974 { v20.uw = vrmpy(v9.ub,{{ *}}r21.ub) }
24 v20.uw=vrmpy(v9.ub,r21.ub)
41 #CHECK: 19c8cb0a { v11:10.uh = vmpy(v11.ub,{{ *}}r8.ub) }
42 v11:10.uh=vmpy(v11.ub,r8.ub)
92 #CHECK: 1c0dc0a4 { v5:4.uh = vmpy(v0.ub,{{ *}}v13.ub) }
93 v5:4.uh=vmpy(v0.ub,v13.ub)
107 #CHECK: 1c1ac805 { v5.uw = vrmpy(v8.ub,{{ *}}v26.ub) }
108 v5.uw=vrmpy(v8.ub,v26.ub)
119 #CHECK: 1cf2c6f0 { v17:16.h = vmpa(v7:6.ub,{{ *}}v19:18.ub) }
[all …]
H A Dv60-vmpy-acc.s15 v17.h += vdmpy(v31.ub,r12.b)
18 v12.w += vrmpy(v21.ub,r0.b)
20 #CHECK: 1905fb86 { v6.uw += vrmpy(v27.ub,r5.ub) }
21 v6.uw += vrmpy(v27.ub,r5.ub)
35 #CHECK: 1987f71e { v31:30.uh += vmpy(v23.ub,r7.ub) }
36 v31:30.uh += vmpy(v23.ub,r7.ub)
114 v7.w += vrmpy(v11.ub,v21.b)
119 #CHECK: 1c0df9a8 { v9:8.uh += vmpy(v25.ub,v13.ub) }
120 v9:8.uh += vmpy(v25.ub,v13.ub)
122 #CHECK: 1c0afc15 { v21.uw += vrmpy(v28.ub,v10.ub) }
[all …]
H A Dv65_all.s66 V1:0.h=vmpa(V1:0.ub,R0.ub)
67 # CHECK: 1960c060 { v1:0.h = vmpa(v1:0.ub,r0.ub) }
86 V0.ub=vasr(V0.uh,V0.uh,R0):sat
136 V1:0.h+=vmpa(V1:0.ub,R0.ub)
137 # CHECK: 19a0e080 { v1:0.h += vmpa(v1:0.ub,r0.ub) }
174 v1:0.w+=vrmpy(v0.b, r1:0.ub)
177 V1:0.uw+=vrmpy(v0.ub,r1:0.ub)
178 # CHECK: 19a0e0e0 { v1:0.uw += vrmpy(v0.ub,r1:0.ub) }
180 v1:0.uw=vrmpy(v1.ub,r1:0.ub)
181 # CHECK: 19c0c180 { v1:0.uw = vrmpy(v1.ub,r1:0.ub) }
[all …]
H A Dv67_all.s3 # CHECK: { v3:0.w = vrmpyz(v0.b,r0.ub) }
4 V3:0.w=vrmpyz(v0.b,r0.ub)
5 # CHECK: { v3:0.w += vrmpyz(v0.b,r0.ub) }
6 V3:0.w+=vrmpyz(v0.b,r0.ub)
7 # CHECK: { v3:0.w = vrmpyz(v0.b,r0.ub++) }
8 V3:0.w=vrmpyz(v0.b,r0.ub++)
9 # CHECK: { v3:0.w += vrmpyz(v0.b,r0.ub++) }
10 V3:0.w+=vrmpyz(v0.b,r0.ub++)
H A Dv60-vcmp.s14 #CHECK: 1c80e720 { q0 &= vcmp.gt(v7.ub{{ *}},{{ *}}v0.ub) }
15 q0&=vcmp.gt(v7.ub,v0.ub)
38 #CHECK: 1c81faa0 { q0 ^= vcmp.gt(v26.ub{{ *}},{{ *}}v1.ub) }
39 q0^=vcmp.gt(v26.ub,v1.ub)
74 #CHECK: 1c80f062 { q2 |= vcmp.gt(v16.ub{{ *}},{{ *}}v0.ub) }
75 q2|=vcmp.gt(v16.ub,v0.ub)
/llvm-project-15.0.7/openmp/libomptarget/DeviceRTL/src/
H A DWorkshare.cpp79 T inputUb = ub; in ForStaticChunk()
108 T inputUb = ub; in ForStaticNoChunk()
131 T ub = *pupper; in for_static_init() local
154 T oldUb = ub; in for_static_init()
158 ub = oldUb; in for_static_init()
197 *pupper = ub; in for_static_init()
298 T oldUb = ub; in dispatch_init()
301 if (ub > oldUb) in dispatch_init()
302 ub = oldUb; in dispatch_init()
405 if (myUb > ub) in dispatch_next()
[all …]
/llvm-project-15.0.7/llvm/test/MC/Hexagon/extensions/
H A Dv67_hvx.s754 v0.ub=vabsdiff(v0.ub,v0.ub)
894 v0.ub=vadd(v0.ub,v0.ub):sat
899 v1:0.ub=vadd(v1:0.ub,v1:0.ub):sat
1179 v0.ub=vavg(v0.ub,v0.ub)
1180 # CHECK-NEXT: 1cc0c080 { v0.ub = vavg(v0.ub,v0.ub) }
1184 v0.ub=vavg(v0.ub,v0.ub):rnd
1609 v0.ub=vlsr(v0.ub,r0)
1699 v0.ub=vmax(v0.ub,v0.ub)
1724 v0.ub=vmin(v0.ub,v0.ub)
2589 v0.ub=vsub(v0.ub,v0.ub):sat
[all …]
/llvm-project-15.0.7/polly/lib/External/isl/test_inputs/codegen/omega/
H A Dlu_spmd-1.in1 …ub] -> { s1[k, i, j] -> [k, i, 1, j, 0, 0, 0, 0] : k >= 1 and j >= k and j <= n and j <= ub and i …
2 [lb, n, ub] -> { : ub <= n and lb >= 1 }
3 [n, lb, ub] -> { [i0, i1, i2, i3, i4, i5, i6, i7] -> atomic[o0] : o0 <= 6; [i0, i1, i2, i3, i4, i5,…
H A Dlu_spmd-0.in1 …ub] -> { s1[k, i, j] -> [k, i, 1, j, 0, 0, 0, 0] : k >= 1 and j >= k and j <= n and j <= ub and i …
2 [lb, n, ub] -> { : ub <= n and lb >= 1 }
3 [n, lb, ub] -> { [i0, i1, i2, i3, i4, i5, i6, i7] -> atomic[o0] : o0 <= 7; [i0, i1, i2, i3, i4, i5,…
/llvm-project-15.0.7/mlir/test/Dialect/Bufferization/Transforms/
H A Dbuffer-loop-hoisting.mlir137 %ub: index,
165 %ub: index,
197 %ub: index,
243 %ub: index,
286 %ub: index,
309 %ub: index,
330 %ub: index,
357 %ub: index,
385 %ub: index,
416 %ub: index,
[all …]
/llvm-project-15.0.7/libcxx/test/std/numerics/rand/rand.dist/rand.dist.samp/rand.dist.samp.pconst/
H A Deval.pass.cpp63 const size_t Ni = ub - lb; in test1()
126 const size_t Ni = ub - lb; in test2()
189 const size_t Ni = ub - lb; in test3()
252 const size_t Ni = ub - lb; in test4()
315 const size_t Ni = ub - lb; in test5()
378 const size_t Ni = ub - lb; in test6()
441 const size_t Ni = ub - lb; in test7()
504 const size_t Ni = ub - lb; in test8()
567 const size_t Ni = ub - lb; in test9()
630 const size_t Ni = ub - lb; in test10()
[all …]
/llvm-project-15.0.7/clang/test/CodeGenOpenCL/
H A Darm-integer-dot-product.cl7 void test_int8(uchar4 ua, uchar4 ub, char4 sa, char4 sb) {
8 uint ur = arm_dot(ua, ub);
16 void test_accumulate_int8(uchar4 ua, uchar4 ub, uint uc, char4 sa, char4 sb, int c) {
17 uint ur = arm_dot_acc(ua, ub, uc);
25 void test_accumulate_int16(ushort2 ua, ushort2 ub, uint uc, short2 sa, short2 sb, int c) {
26 uint ur = arm_dot_acc(ua, ub, uc);
34 void test_accumulate_saturate_int8(uchar4 ua, uchar4 ub, uint uc, char4 sa, char4 sb, int c) {
35 uint ur = arm_dot_acc_sat(ua, ub, uc);
/llvm-project-15.0.7/openmp/runtime/src/
H A Dkmp_dispatch.cpp318 if (ub >= lb) { in __kmp_dispatch_init_algorithm()
319 tc = ub - lb + 1; in __kmp_dispatch_init_algorithm()
324 if (lb >= ub) { in __kmp_dispatch_init_algorithm()
332 if (ub >= lb) { in __kmp_dispatch_init_algorithm()
348 pr->u.p.ub = ub; in __kmp_dispatch_init_algorithm()
479 pr->u.p.ub = (ub_tmp + st > ub ? ub : ub_tmp); in __kmp_dispatch_init_algorithm()
481 pr->u.p.ub = (ub_tmp + st < ub ? ub : ub_tmp); in __kmp_dispatch_init_algorithm()
1351 T ub; in __kmp_dispatch_next_algorithm() member
1470 KD_TRACE(10, (buff, gtid, victimId, vnew.p.ub, vold.p.ub)); in __kmp_dispatch_next_algorithm()
1475 vold.p.ub - vnew.p.ub); in __kmp_dispatch_next_algorithm()
[all …]
H A Dkmp_gsupport.cpp612 if ((str > 0) ? (lb < ub) : (lb > ub)) { \
616 (str > 0) ? (ub - 1) : (ub + 1), str, chunk_sz, \
652 if ((str > 0) ? (lb < ub) : (lb > ub)) { \
656 (str > 0) ? (ub - 1) : (ub + 1), str, chunk_sz, \
777 if ((str > 0) ? (lb < ub) : (lb > ub)) { \
779 (str > 0) ? (ub - 1) : (ub + 1), str, chunk_sz, \
824 if ((str > 0) ? (lb < ub) : (lb > ub)) { \
826 (str > 0) ? (ub - 1) : (ub + 1), str, chunk_sz, TRUE); \
904 if ((str > 0) ? (lb < ub) : (lb > ub)) { \
906 (str2 > 0) ? (ub - 1) : (ub + 1), str2, chunk_sz, \
[all …]
/llvm-project-15.0.7/mlir/test/Dialect/SCF/
H A Dfor-loop-peeling.mlir28 %s = affine.min #map(%ub, %iv)[%step]
57 %ub = arith.constant 17 : index
58 %r = scf.for %iv = %lb to %ub step %step
60 %s = affine.min #map(%ub, %iv)[%step]
97 %r = scf.for %iv = %lb to %ub step %step
99 %s = affine.min #map(%ub, %iv)[%step]
135 scf.for %iv = %lb to %ub step %step {
136 %s = affine.min #map(%ub, %iv)[%step]
204 scf.for %iv = %lb to %ub step %step {
217 // min(%ub - %iv - 1, %step) cannot be simplified because %ub - %iv - 1
[all …]
/llvm-project-15.0.7/mlir/test/Transforms/
H A Dparametric-mapping.mlir7 // CHECK-SAME: (%[[lb:.*]]: index, %[[ub:.*]]: index, %[[step:.*]]: index)
8 func.func @map1d(%lb: index, %ub: index, %step: index) {
16 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
17 scf.for %i = %lb to %ub step %step {}
22 // CHECK-SAME: (%[[lb:.*]]: index, %[[ub:.*]]: index, %[[step:.*]]: index)
23 func.func @map2d(%lb : index, %ub : index, %step : index) {
48 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
50 scf.for %i = %lb to %ub step %step {}
/llvm-project-15.0.7/mlir/test/Integration/Dialect/Async/CPU/
H A Dtest-async-parallel-for-2d.mlir57 %ub = arith.constant 8 : index
64 scf.parallel (%i, %j) = (%lb, %lb) to (%ub, %ub) step (%c1, %c1) {
69 scf.parallel (%i, %j) = (%lb, %lb) to (%ub, %ub) step (%c1, %c1) {
89 scf.parallel (%i, %j) = (%lb, %lb) to (%ub, %ub) step (%c1, %c1) {
94 scf.parallel (%i, %j) = (%lb, %lb) to (%ub, %ub) step (%c2, %c1) {
114 scf.parallel (%i, %j) = (%lb, %lb) to (%ub, %ub) step (%c1, %c1) {
119 scf.parallel (%i, %j) = (%lb, %lb) to (%ub, %ub) step (%c1, %c2) {
/llvm-project-15.0.7/flang/runtime/
H A Dcharacter.cpp98 ub[j] = xUB; in Compare()
102 elements *= ub[j]; in Compare()
156 elements *= ub[j]; in AdjustLRHelper()
212 elements *= ub[j]; in LenTrim()
389 elements *= ub[j]; in GeneralCharFunc()
501 if (accumExt != ub[j]) { in MaxMinHelper()
511 elements *= ub[j]; in MaxMinHelper()
577 if (ub[j] != fromUB) { in RTNAME()
584 ub[j] = in RTNAME()
587 elements *= ub[j]; in RTNAME()
[all …]

123456789