Home
last modified time | relevance | path

Searched refs:lo (Results 1 – 25 of 1027) sorted by relevance

12345678910>>...42

/llvm-project-15.0.7/libclc/generic/lib/integer/
H A Dupsample.cl4 _CLC_OVERLOAD _CLC_DEF BGENTYPE upsample(GENTYPE hi, UGENTYPE lo){ \
5 return ((BGENTYPE)hi << GENSIZE) | lo; \
7 _CLC_OVERLOAD _CLC_DEF BGENTYPE##2 upsample(GENTYPE##2 hi, UGENTYPE##2 lo){ \
8 return (BGENTYPE##2){upsample(hi.s0, lo.s0), upsample(hi.s1, lo.s1)}; \
10 _CLC_OVERLOAD _CLC_DEF BGENTYPE##3 upsample(GENTYPE##3 hi, UGENTYPE##3 lo){ \
11 … return (BGENTYPE##3){upsample(hi.s0, lo.s0), upsample(hi.s1, lo.s1), upsample(hi.s2, lo.s2)}; \
13 _CLC_OVERLOAD _CLC_DEF BGENTYPE##4 upsample(GENTYPE##4 hi, UGENTYPE##4 lo){ \
14 return (BGENTYPE##4){upsample(hi.lo, lo.lo), upsample(hi.hi, lo.hi)}; \
16 _CLC_OVERLOAD _CLC_DEF BGENTYPE##8 upsample(GENTYPE##8 hi, UGENTYPE##8 lo){ \
17 return (BGENTYPE##8){upsample(hi.lo, lo.lo), upsample(hi.hi, lo.hi)}; \
[all …]
/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_sort.c30 #define MID(lo, hi) (lo + ((hi - lo) >> 1)) argument
73 lo = al; in msort()
77 ls = lo; in msort()
82 lo += size; in msort()
85 while (lo < am && compare (lo, hi, arg) <= 0) in msort()
86 lo += size; in msort()
88 if (lo < am) { in msort()
91 a1 = lo; in msort()
92 ls = lo; in msort()
124 if (lo < am) { in msort()
[all …]
/llvm-project-15.0.7/llvm/test/MC/Mips/
H A Dexpr1.s10 # 32R2-EL: lw $4, %lo(foo)($4) # encoding: [A,A,0x84,0x8c]
16 # 32R2-EL: lw $4, %lo(foo+(%lo(8)))($1) # encoding: [A,A,0x24,0x8c]
17 # 32R2-EL: # fixup A - offset: 0, value: %lo(foo+(%lo(8))), kind: …
18 # 32R2-EL: lw $4, %lo(12+foo)($4) # encoding: [A,A,0x84,0x8c]
38 # MM-32R2-EL: lw $4, %lo(foo+(%lo(8)))($1) # encoding: [0x81'A',0xfc'A',0x00,0x00]
39 # MM-32R2-EL: # fixup A - offset: 0, value: %lo(foo+(%lo(8))), kind:…
54 lw $4,%lo(foo)($4)
56 lw $4,%lo (2 * 4) + foo($4)
57 lw $4,%lo((3 * 4) + foo)($4)
58 lw $4,(((%lo ((4 * 4) + foo))))($4)
[all …]
/llvm-project-15.0.7/libcxx/test/std/containers/sequences/vector/vector.cons/
H A Dassign_move.pass.cpp30 lo.push_back(i); in tests()
33 assert(is_contiguous_container_asan_correct(lo)); in tests()
36 assert(l2 == lo); in tests()
38 assert(l2.get_allocator() == lo.get_allocator()); in tests()
45 assert(is_contiguous_container_asan_correct(lo)); in tests()
49 lo.push_back(i); in tests()
55 assert(l2 == lo); in tests()
68 lo.push_back(i); in tests()
74 assert(l2 == lo); in tests()
87 lo.push_back(i); in tests()
[all …]
H A Dmove_alloc.pass.cpp29 assert(is_contiguous_container_asan_correct(lo)); in tests()
33 lo.push_back(i); in tests()
36 assert(is_contiguous_container_asan_correct(lo)); in tests()
38 assert(l2 == lo); in tests()
47 assert(is_contiguous_container_asan_correct(lo)); in tests()
51 lo.push_back(i); in tests()
56 assert(l2 == lo); in tests()
69 lo.push_back(i); in tests()
74 assert(l2 == lo); in tests()
87 lo.push_back(i); in tests()
[all …]
H A Dmove.pass.cpp31 assert(is_contiguous_container_asan_correct(lo)); in tests()
35 lo.push_back(i); in tests()
38 assert(is_contiguous_container_asan_correct(lo)); in tests()
40 assert(l2 == lo); in tests()
42 assert(l2.get_allocator() == lo.get_allocator()); in tests()
49 assert(is_contiguous_container_asan_correct(lo)); in tests()
53 lo.push_back(i); in tests()
56 assert(is_contiguous_container_asan_correct(lo)); in tests()
58 assert(l2 == lo); in tests()
82 lo.push_back(i); in tests()
[all …]
/llvm-project-15.0.7/libclc/clspv/lib/math/
H A Dfma.cl84 st_mul.mantissa.hi = mul_hi(st_a.mantissa.lo, st_b.mantissa.lo);
85 st_mul.mantissa.lo = st_a.mantissa.lo * st_b.mantissa.lo;
142 uint carry = (hadd(st_mul.mantissa.lo, st_c.mantissa.lo) >> 31) & 0x1;
152 if (st_c.mantissa.lo > st_mul.mantissa.lo) {
156 } else if ((st_c.mantissa.lo + cutoff_borrow) > st_mul.mantissa.lo) {
160 st_fma.mantissa.lo = st_mul.mantissa.lo - st_c.mantissa.lo - cutoff_borrow;
211 trunc_bits.lo |= (cutoff_bits.hi != 0 || cutoff_bits.lo != 0) ? 1 : 0;
213 last_bit.lo = 0;
217 grs_bits.lo = 0;
222 (trunc_bits.hi == grs_bits.hi && trunc_bits.lo > grs_bits.lo)) ||
[all …]
/llvm-project-15.0.7/libcxx/test/std/containers/sequences/vector.bool/
H A Dassign_move.pass.cpp29 lo.push_back(i); in tests()
33 assert(l2 == lo); in tests()
35 assert(l2.get_allocator() == lo.get_allocator()); in tests()
43 lo.push_back(i); in tests()
47 assert(l2 == lo); in tests()
57 lo.push_back(i); in tests()
61 assert(l2 == lo); in tests()
63 assert(l2.get_allocator() == lo.get_allocator()); in tests()
71 lo.push_back(i); in tests()
75 assert(l2 == lo); in tests()
[all …]
H A Dmove_alloc.pass.cpp25 std::vector<bool, test_allocator<bool> > lo(test_allocator<bool>(5)); in tests()
29 lo.push_back(i); in tests()
32 assert(l2 == lo); in tests()
38 std::vector<bool, test_allocator<bool> > lo(test_allocator<bool>(5)); in tests()
42 lo.push_back(i); in tests()
45 assert(l2 == lo); in tests()
55 lo.push_back(i); in tests()
58 assert(l2 == lo); in tests()
64 std::vector<bool, min_allocator<bool> > lo(min_allocator<bool>{}); in tests()
68 lo.push_back(i); in tests()
[all …]
H A Dmove.pass.cpp30 lo.push_back(true); in tests()
33 assert(l2 == lo); in tests()
35 assert(l2.get_allocator() == lo.get_allocator()); in tests()
39 std::vector<bool, other_allocator<bool> > lo(other_allocator<bool>(5)); in tests()
43 lo.push_back(true); in tests()
46 assert(l2 == lo); in tests()
48 assert(l2.get_allocator() == lo.get_allocator()); in tests()
52 std::vector<bool, min_allocator<bool> > lo(min_allocator<bool>{}); in tests()
56 lo.push_back(true); in tests()
59 assert(l2 == lo); in tests()
[all …]
/llvm-project-15.0.7/third-party/benchmark/src/
H A Dbenchmark_register.h17 BM_CHECK_GE(lo, 0); in AddPowers()
18 BM_CHECK_GE(hi, lo); in AddPowers()
27 if (i >= lo) { in AddPowers()
41 BM_CHECK_GT(lo, std::numeric_limits<T>::min()); in AddNegatedPowers()
43 BM_CHECK_GE(hi, lo); in AddNegatedPowers()
63 BM_CHECK_GE(hi, lo); in AddRange()
67 dst->push_back(lo); in AddRange()
72 if (lo == hi) return; in AddRange()
75 if (lo + 1 == hi) { in AddRange()
81 const auto lo_inner = static_cast<T>(lo + 1); in AddRange()
[all …]
/llvm-project-15.0.7/libclc/generic/lib/
H A Dclcmacro.h11 return (RET_TYPE##4)(FUNCTION(x.lo), FUNCTION(x.hi)); \
15 return (RET_TYPE##8)(FUNCTION(x.lo), FUNCTION(x.hi)); \
33 return (RET_TYPE##4)(FUNCTION(x.lo, y.lo), FUNCTION(x.hi, y.hi)); \
37 return (RET_TYPE##8)(FUNCTION(x.lo, y.lo), FUNCTION(x.hi, y.hi)); \
41 return (RET_TYPE##16)(FUNCTION(x.lo, y.lo), FUNCTION(x.hi, y.hi)); \
78 return (RET_TYPE##4)(FUNCTION(x.lo, y.lo, z.lo), FUNCTION(x.hi, y.hi, z.hi)); \
82 return (RET_TYPE##8)(FUNCTION(x.lo, y.lo, z.lo), FUNCTION(x.hi, y.hi, z.hi)); \
86 return (RET_TYPE##16)(FUNCTION(x.lo, y.lo, z.lo), FUNCTION(x.hi, y.hi, z.hi)); \
130 FUNCTION(x.lo, (ARG2_TYPE##2*)y), \
137 FUNCTION(x.lo, (ARG2_TYPE##4*)y), \
[all …]
/llvm-project-15.0.7/flang/include/flang/Lower/
H A DIntervalSet.h30 assert(lo <= up); in merge()
32 m.insert({lo, up}); in merge()
35 auto i = m.lower_bound(lo); in merge()
40 m.insert({lo, up}); in merge()
46 fuse(lo, up, i); in merge()
50 if (i == end() || i->first > lo) in merge()
58 if (i->second < lo) { in merge()
61 m.insert({lo, up}); in merge()
68 lo = i->first; in merge()
70 fuse(lo, up, i); in merge()
[all …]
/llvm-project-15.0.7/libcxx/test/std/containers/sequences/list/list.cons/
H A Dassign_move.pass.cpp30 lo.push_back(i); in main()
35 assert(l2 == lo); in main()
37 assert(l2.get_allocator() == lo.get_allocator()); in main()
46 lo.push_back(i); in main()
50 assert(l2 == lo); in main()
60 lo.push_back(i); in main()
65 assert(l2 == lo); in main()
67 assert(l2.get_allocator() == lo.get_allocator()); in main()
76 lo.push_back(i); in main()
81 assert(l2 == lo); in main()
[all …]
H A Dmove.pass.cpp26 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); in main() local
30 lo.push_back(i); in main()
34 assert(l2 == lo); in main()
36 assert(l2.get_allocator() == lo.get_allocator()); in main()
45 lo.push_back(i); in main()
49 assert(l2 == lo); in main()
51 assert(l2.get_allocator() == lo.get_allocator()); in main()
56 std::list<MoveOnly, min_allocator<MoveOnly> > lo(min_allocator<MoveOnly>{}); in main() local
60 lo.push_back(i); in main()
64 assert(l2 == lo); in main()
[all …]
H A Dmove_alloc.pass.cpp26 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); in main() local
30 lo.push_back(i); in main()
33 assert(l2 == lo); in main()
39 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); in main() local
43 lo.push_back(i); in main()
46 assert(l2 == lo); in main()
56 lo.push_back(i); in main()
59 assert(l2 == lo); in main()
65 std::list<MoveOnly, min_allocator<MoveOnly> > lo(min_allocator<MoveOnly>{}); in main() local
69 lo.push_back(i); in main()
[all …]
/llvm-project-15.0.7/libc/AOR_v20.02/math/test/
H A Dmathbench.c221 double lo; member
235 #define D(func, lo, hi) {#func, 'd', 0, lo, hi, {.d = func}}, argument
236 #define F(func, lo, hi) {#func, 'f', 0, lo, hi, {.f = func}}, argument
237 #define VD(func, lo, hi) {#func, 'd', 'v', lo, hi, {.vd = func}}, argument
238 #define VF(func, lo, hi) {#func, 'f', 'v', lo, hi, {.vf = func}}, argument
239 #define VND(func, lo, hi) {#func, 'd', 'n', lo, hi, {.vnd = func}}, argument
240 #define VNF(func, lo, hi) {#func, 'f', 'n', lo, hi, {.vnf = func}}, argument
379 return lo + (hi - lo) * (asdouble (seed >> 12 | 0x3ffULL << 52) - 1.0); in frand()
622 lo = i / N; in bench()
746 lo = hi = 0; in main()
[all …]
/llvm-project-15.0.7/compiler-rt/test/builtins/Unit/ppc/
H A Dqsub_test.c113 a.lo = edgeCases[i].xlo; in testEdgeCases()
115 b.lo = edgeCases[i].ylo; in testEdgeCases()
117 r.lo = edgeCases[i].rlo; in testEdgeCases()
128 else if (c.lo != 0.0) in testEdgeCases()
138 error = ((c.hi != r.hi) || (c.lo != r.lo)); in testEdgeCases()
141 …ror on edge case %a - %a: expected (%a, %a), got (%a, %a).\n", a.hi, b.hi, r.hi, r.lo, c.hi, c.lo); in testEdgeCases()
1824 a.lo = accuracyTests[i].xlo; in testAccuracy()
1826 b.lo = -accuracyTests[i].ylo; in testAccuracy()
1828 r.lo = accuracyTests[i].rlo; in testAccuracy()
1832 double error = __builtin_fabs(((r.hi - c.hi) + r.lo) - c.lo); in testAccuracy()
[all …]
H A Dqadd_test.c113 a.lo = edgeCases[i].xlo; in testEdgeCases()
115 b.lo = edgeCases[i].ylo; in testEdgeCases()
117 r.lo = edgeCases[i].rlo; in testEdgeCases()
126 else if (c.lo != 0.0) in testEdgeCases()
136 error = ((c.hi != r.hi) || (c.lo != r.lo)); in testEdgeCases()
139 …ror on edge case %a + %a: expected (%a, %a), got (%a, %a).\n", a.hi, b.hi, r.hi, r.lo, c.hi, c.lo); in testEdgeCases()
1822 a.lo = accuracyTests[i].xlo; in testAccuracy()
1824 b.lo = accuracyTests[i].ylo; in testAccuracy()
1826 r.lo = accuracyTests[i].rlo; in testAccuracy()
1830 double error = __builtin_fabs(((r.hi - c.hi) + r.lo) - c.lo); in testAccuracy()
[all …]
H A Dqdiv_test.c113 a.lo = edgeCases[i].xlo; in testEdgeCases()
115 b.lo = edgeCases[i].ylo; in testEdgeCases()
117 r.lo = edgeCases[i].rlo; in testEdgeCases()
126 else if (c.lo != 0.0) in testEdgeCases()
136 error = ((c.hi != r.hi) || (c.lo != r.lo)); in testEdgeCases()
139 …ror on edge case %a / %a: expected (%a, %a), got (%a, %a).\n", a.hi, b.hi, r.hi, r.lo, c.hi, c.lo); in testEdgeCases()
745 a.lo = accuracyTests[i].xlo; in testAccuracy()
747 b.lo = accuracyTests[i].ylo; in testAccuracy()
749 r.lo = accuracyTests[i].rlo; in testAccuracy()
753 double error = __builtin_fabs(((r.hi - c.hi) + r.lo) - c.lo); in testAccuracy()
[all …]
/llvm-project-15.0.7/compiler-rt/lib/builtins/ppc/
H A Ddivtc3.c20 (x).s.lo = 0.0; \
37 cDD.s.lo = __compiler_rt_scalbn(cDD.s.lo, -ilogbw); in __divtc3()
39 dDD.s.lo = __compiler_rt_scalbn(dDD.s.lo, -ilogbw); in __divtc3()
53 real.s.lo = __compiler_rt_scalbn(real.s.lo, -ilogbw); in __divtc3()
55 imag.s.lo = __compiler_rt_scalbn(imag.s.lo, -ilogbw); in __divtc3()
64 real.s.lo = 0.0; in __divtc3()
66 imag.s.lo = 0.0; in __divtc3()
74 real.s.lo = 0.0; in __divtc3()
76 imag.s.lo = 0.0; in __divtc3()
85 real.s.lo = 0.0; in __divtc3()
[all …]
/llvm-project-15.0.7/clang/test/CodeGen/X86/
H A Davx-shuffle-builtins.c167 __m256 test_mm256_set_m128(__m128 hi, __m128 lo) { in test_mm256_set_m128() argument
170 return _mm256_set_m128(hi, lo); in test_mm256_set_m128()
173 __m256d test_mm256_set_m128d(__m128d hi, __m128d lo) { in test_mm256_set_m128d() argument
176 return _mm256_set_m128d(hi, lo); in test_mm256_set_m128d()
179 __m256i test_mm256_set_m128i(__m128i hi, __m128i lo) { in test_mm256_set_m128i() argument
182 return _mm256_set_m128i(hi, lo); in test_mm256_set_m128i()
185 __m256 test_mm256_setr_m128(__m128 hi, __m128 lo) { in test_mm256_setr_m128() argument
188 return _mm256_setr_m128(lo, hi); in test_mm256_setr_m128()
191 __m256d test_mm256_setr_m128d(__m128d hi, __m128d lo) { in test_mm256_setr_m128d() argument
194 return _mm256_setr_m128d(lo, hi); in test_mm256_setr_m128d()
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/Mips/llvm-ir/
H A Dstore.ll35 ; MIPS32-NEXT: # <MCOperand Expr:(%lo(a))>>
47 ; MMR3-NEXT: # <MCOperand Expr:(%lo(a))>>
70 ; MMR6-NEXT: # <MCOperand Expr:(%lo(a))>>
100 ; MIPS4-NEXT: # <MCOperand Expr:(%lo(a))>>
181 ; MMR3-NEXT: # <MCOperand Expr:(%lo(b))>>
204 ; MMR6-NEXT: # <MCOperand Expr:(%lo(b))>>
234 ; MIPS4-NEXT: # <MCOperand Expr:(%lo(b))>>
315 ; MMR3-NEXT: # <MCOperand Expr:(%lo(c))>>
338 ; MMR6-NEXT: # <MCOperand Expr:(%lo(c))>>
455 ; MMR3-NEXT: # <MCOperand Expr:(%lo(d))>>
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/
H A Dllvm.amdgcn.mbcnt.ll10 %lo = call i32 @llvm.amdgcn.mbcnt.lo(i32 -1, i32 0) #0
11 %hi = call i32 @llvm.amdgcn.mbcnt.hi(i32 -1, i32 %lo) #0
21 %lo = call i32 @llvm.amdgcn.mbcnt.lo(i32 %x, i32 %y)
22 %mask = and i32 %lo, 63
30 %lo = call i32 @llvm.amdgcn.mbcnt.lo(i32 %x, i32 0)
31 %mask = and i32 %lo, 63
39 %lo = call i32 @llvm.amdgcn.mbcnt.lo(i32 %x, i32 15)
40 %mask = and i32 %lo, 127
48 %lo = call i32 @llvm.amdgcn.mbcnt.lo(i32 %x, i32 15)
49 %mask = and i32 %lo, 63
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/RISCV/
H A Dghccc-rv32.ll40 ; CHECK-NEXT: fld fs9, %lo(d4)(a0)
42 ; CHECK-NEXT: fld fs8, %lo(d3)(a0)
62 ; CHECK-NEXT: lw s10, %lo(r7)(a0)
64 ; CHECK-NEXT: lw s9, %lo(r6)(a0)
66 ; CHECK-NEXT: lw s8, %lo(r5)(a0)
68 ; CHECK-NEXT: lw s7, %lo(r4)(a0)
70 ; CHECK-NEXT: lw s6, %lo(r3)(a0)
72 ; CHECK-NEXT: lw s5, %lo(r2)(a0)
74 ; CHECK-NEXT: lw s4, %lo(r1)(a0)
76 ; CHECK-NEXT: lw s3, %lo(hp)(a0)
[all …]

12345678910>>...42