| /llvm-project-15.0.7/clang/test/CodeGen/ |
| H A D | aarch64-neon-vcombine.c | 11 return vcombine_s8(low, high); in test_vcombine_s8() 18 return vcombine_s16(low, high); in test_vcombine_s16() 25 return vcombine_s32(low, high); in test_vcombine_s32() 32 return vcombine_s64(low, high); in test_vcombine_s64() 39 return vcombine_u8(low, high); in test_vcombine_u8() 46 return vcombine_u16(low, high); in test_vcombine_u16() 53 return vcombine_u32(low, high); in test_vcombine_u32() 60 return vcombine_u64(low, high); in test_vcombine_u64() 67 return vcombine_p64(low, high); in test_vcombine_p64() 74 return vcombine_f16(low, high); in test_vcombine_f16() [all …]
|
| /llvm-project-15.0.7/compiler-rt/lib/builtins/ |
| H A D | udivmoddi4.c | 44 *rem = n.s.low % d.s.low; in __udivmoddi4() 45 return n.s.low / d.s.low; in __udivmoddi4() 71 r.s.low = 0; in __udivmoddi4() 81 r.s.low = n.s.low; in __udivmoddi4() 100 q.s.low = 0; in __udivmoddi4() 104 r.s.low = (n.s.high << (n_uword_bits - sr)) | (n.s.low >> sr); in __udivmoddi4() 112 *rem = n.s.low & (d.s.low - 1); in __udivmoddi4() 138 q.s.low = n.s.low << (n_udword_bits - sr); in __udivmoddi4() 158 q.s.low = 0; in __udivmoddi4() 179 r.s.low = (r.s.low << 1) | (q.s.high >> (n_uword_bits - 1)); in __udivmoddi4() [all …]
|
| H A D | multi3.c | 23 r.s.low = (a & lower_mask) * (b & lower_mask); in __mulddi3() 24 du_int t = r.s.low >> bits_in_dword_2; in __mulddi3() 25 r.s.low &= lower_mask; in __mulddi3() 27 r.s.low += (t & lower_mask) << bits_in_dword_2; in __mulddi3() 29 t = r.s.low >> bits_in_dword_2; in __mulddi3() 30 r.s.low &= lower_mask; in __mulddi3() 32 r.s.low += (t & lower_mask) << bits_in_dword_2; in __mulddi3() 46 r.all = __mulddi3(x.s.low, y.s.low); in __multi3() 47 r.s.high += x.s.high * y.s.low + x.s.low * y.s.high; in __multi3()
|
| H A D | muldi3.c | 21 r.s.low = (a & lower_mask) * (b & lower_mask); in __muldsi3() 22 su_int t = r.s.low >> bits_in_word_2; in __muldsi3() 23 r.s.low &= lower_mask; in __muldsi3() 25 r.s.low += (t & lower_mask) << bits_in_word_2; in __muldsi3() 27 t = r.s.low >> bits_in_word_2; in __muldsi3() 28 r.s.low &= lower_mask; in __muldsi3() 30 r.s.low += (t & lower_mask) << bits_in_word_2; in __muldsi3() 44 r.all = __muldsi3(x.s.low, y.s.low); in __muldi3() 45 r.s.high += x.s.high * y.s.low + x.s.low * y.s.high; in __muldi3()
|
| H A D | int_types.h | 44 su_int low; member 48 su_int low; 57 su_int low; member 61 su_int low; 86 du_int low; member 90 du_int low; 99 du_int low; member 111 r.s.low = l; in make_ti() 118 r.s.low = l; in make_tu() 146 udwords low; member [all …]
|
| H A D | udivmodti4.c | 116 if (dividend.s.high < divisor.s.low) { in __udivmodti4() 118 quotient.s.low = udiv128by64to64(dividend.s.high, dividend.s.low, in __udivmodti4() 119 divisor.s.low, &remainder.s.low); in __udivmodti4() 124 quotient.s.high = dividend.s.high / divisor.s.low; in __udivmodti4() 125 dividend.s.high = dividend.s.high % divisor.s.low; in __udivmodti4() 126 quotient.s.low = udiv128by64to64(dividend.s.high, dividend.s.low, in __udivmodti4() 127 divisor.s.low, &remainder.s.low); in __udivmodti4() 138 quotient.s.low = 0; in __udivmodti4() 140 quotient.s.low <<= 1; in __udivmodti4() 149 quotient.s.low |= s & 1; in __udivmodti4()
|
| H A D | ashlti3.c | 27 result.s.low = 0; in __ashlti3() 28 result.s.high = input.s.low << (b - bits_in_dword); in __ashlti3() 32 result.s.low = input.s.low << b; in __ashlti3() 33 result.s.high = (input.s.high << b) | (input.s.low >> (bits_in_dword - b)); in __ashlti3()
|
| H A D | ashldi3.c | 25 result.s.low = 0; in __ashldi3() 26 result.s.high = input.s.low << (b - bits_in_word); in __ashldi3() 30 result.s.low = input.s.low << b; in __ashldi3() 31 result.s.high = (input.s.high << b) | (input.s.low >> (bits_in_word - b)); in __ashldi3()
|
| H A D | ucmpti2.c | 30 if (x.s.low < y.s.low) in __ucmpti2() 32 if (x.s.low > y.s.low) in __ucmpti2()
|
| H A D | cmpti2.c | 30 if (x.s.low < y.s.low) in __cmpti2() 32 if (x.s.low > y.s.low) in __cmpti2()
|
| /llvm-project-15.0.7/llvm/test/CodeGen/SystemZ/ |
| H A D | insert-06.ll | 11 %low = zext i32 %b to i64 13 %res = or i64 %high, %low 23 %low = zext i32 %b to i64 25 %res = or i64 %low, %high 37 %res = or i64 %high, %low 49 %res = or i64 %low, %high 62 %res = or i64 %high, %low 77 %res = or i64 %low, %high 89 %low = zext i32 %b to i64 91 %res = or i64 %high, %low [all …]
|
| /llvm-project-15.0.7/libc/src/__support/CPP/ |
| H A D | UInt.h | 73 uint64_t res_lo = low(val[i]) + low(x.val[i]) + carry; in add() 75 res_lo = low(res_lo); in add() 79 res_hi = low(res_hi); in add() 104 uint64_t x_lo = low(x); in mul() 366 uint64_t temp_low = low(val[0]) * low(other[0]); 373 uint64_t temp_high = low(val[0]) * low(other[1]) + 375 low(val[1]) * low(other[0]); 378 low(val[0]) * high(other[1]) + high(val[0]) * low(other[1]) + 379 low(val[1]) * high(other[0]) + high(val[1]) * low(other[0]); 384 high(temp_low) + low(temp_middle_1) + low(temp_middle_2); [all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.clamp/ |
| H A D | ranges.clamp.pass.cpp | 29 requires(T&& val, T&& low, T&& high, Comp&& comp, Proj&& proj) { 30 std::ranges::clamp(std::forward<T>(val), std::forward<T>(low), std::forward<T>(high), 47 int low = 1; in test() local 49 std::same_as<const int&> decltype(auto) ret = std::ranges::clamp(val, low, high); in test() 85 auto low = S{20}; in test() 88 assert(&std::ranges::clamp(val, low, high, Comp{}, &S::lvalue_proj) == &low); in test() 89 assert(&std::ranges::clamp(val, high, low, Comp{}, &S::prvalue_proj) == &low); in test() 107 auto low = CheckDoubleMove{10}; in test() 112 assert(&std::ranges::clamp(val, low, high, moving_comp, prvalue_proj) == &val); in test()
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-profgen/ |
| H A D | cold-profile-trimming-symbolized.test | 22 int partition_pivot_last(int* array, int low, int high) { 24 int i = low - 1; 25 for (int j = low; j < high; j++) 32 int partition_pivot_first(int* array, int low, int high) { 33 int pivot = array[low]; 34 int i = low + 1; 35 for (int j = low + 1; j <= high; j++) 37 swap(&array[i - 1], &array[low]); 42 if (low < high) { 43 int pi = (*partition_func)(array, low, high); [all …]
|
| H A D | cold-profile-trimming.test | 27 int partition_pivot_last(int* array, int low, int high) { 29 int i = low - 1; 30 for (int j = low; j < high; j++) 37 int partition_pivot_first(int* array, int low, int high) { 38 int pivot = array[low]; 39 int i = low + 1; 40 for (int j = low + 1; j <= high; j++) 42 swap(&array[i - 1], &array[low]); 47 if (low < high) { 48 int pi = (*partition_func)(array, low, high); [all …]
|
| H A D | profile-density.test | 23 int partition_pivot_last(int* array, int low, int high) { 25 int i = low - 1; 26 for (int j = low; j < high; j++) 33 int partition_pivot_first(int* array, int low, int high) { 34 int pivot = array[low]; 35 int i = low + 1; 36 for (int j = low + 1; j <= high; j++) 38 swap(&array[i - 1], &array[low]); 43 if (low < high) { 44 int pi = (*partition_func)(array, low, high); [all …]
|
| H A D | fs-discriminator.test | 102 int partition_pivot_last(int* array, int low, int high) { 104 int i = low - 1; 105 for (int j = low; j < high; j++) 112 int partition_pivot_first(int* array, int low, int high) { 113 int pivot = array[low]; 114 int i = low + 1; 115 for (int j = low + 1; j <= high; j++) 117 swap(&array[i - 1], &array[low]); 122 if (low < high) { 123 int pi = (*partition_func)(array, low, high); [all …]
|
| H A D | inline-noprobe2.test | 118 int partition_pivot_last(int* array, int low, int high) { 120 int i = low - 1; 121 for (int j = low; j < high; j++) 128 int partition_pivot_first(int* array, int low, int high) { 129 int pivot = array[low]; 130 int i = low + 1; 131 for (int j = low + 1; j <= high; j++) 133 swap(&array[i - 1], &array[low]); 138 if (low < high) { 139 int pi = (*partition_func)(array, low, high); [all …]
|
| /llvm-project-15.0.7/llvm/test/CodeGen/WebAssembly/ |
| H A D | simd-extending.ll | 17 %extended = sext <8 x i8> %low to <8 x i16> 30 %extended = zext <8 x i8> %low to <8 x i16> 43 %extended = sext <8 x i8> %low to <8 x i16> 56 %extended = zext <8 x i8> %low to <8 x i16> 69 %extended = sext <4 x i16> %low to <4 x i32> 82 %extended = zext <4 x i16> %low to <4 x i32> 95 %extended = sext <4 x i16> %low to <4 x i32> 108 %extended = zext <4 x i16> %low to <4 x i32> 121 %extended = sext <2 x i32> %low to <2 x i64> 134 %extended = zext <2 x i32> %low to <2 x i64> [all …]
|
| /llvm-project-15.0.7/mlir/test/Dialect/Linalg/ |
| H A D | subtensor-of-padtensor.mlir | 9 %0 = tensor.pad %arg0 low[0, 0] high[7, 8] { 28 %0 = tensor.pad %arg0 low[0, 0] high[7, 8] { 47 %0 = tensor.pad %arg0 low[3, 7] high[7, 8] { 66 %0 = tensor.pad %arg0 low[3, 7] high[7, 8] { 85 %0 = tensor.pad %arg0 low[0, 0] high[7, 8] { 104 %0 = tensor.pad %arg0 low[3, 7] high[7, 8] { 122 %0 = tensor.pad %arg0 low[2, 3] high[7, 8] { 147 %0 = tensor.pad %arg0 low[0, 0] high[%h1, 8] { 172 %0 = tensor.pad %arg0 low[0, 0] high[7, 8] { 192 %0 = tensor.pad %arg0 low[0, 0] high[7, 8] { [all …]
|
| /llvm-project-15.0.7/compiler-rt/test/builtins/Unit/ |
| H A D | muloti4_test.c | 34 at.s.high, at.s.low, bt.s.high, bt.s.low, xt.s.high, xt.s.low, in test__muloti4() 35 expectedt.s.high, expectedt.s.low); in test__muloti4() 50 at.s.high, at.s.low, bt.s.high, bt.s.low, xt.s.high, xt.s.low, in test__muloti4() 51 expectedt.s.high, expectedt.s.low); in test__muloti4()
|
| H A D | divmodti4_test.c | 46 at.s.high, at.s.low, bt.s.high, bt.s.low, qt.s.high, qt.s.low, in test__divmodti4() 47 rt.s.high, rt.s.low, expected_qt.s.high, expected_qt.s.low, in test__divmodti4() 48 expected_rt.s.high, expected_rt.s.low); in test__divmodti4()
|
| /llvm-project-15.0.7/clang/lib/Lex/ |
| H A D | PPConditionalDirectiveRecord.cpp | 28 CondDirectiveLocsTy::const_iterator low = llvm::lower_bound( in rangeIntersectsConditionalDirective() local 30 if (low == CondDirectiveLocs.end()) in rangeIntersectsConditionalDirective() 33 if (SourceMgr.isBeforeInTranslationUnit(Range.getEnd(), low->getLoc())) in rangeIntersectsConditionalDirective() 37 upp = std::upper_bound(low, CondDirectiveLocs.end(), in rangeIntersectsConditionalDirective() 43 return low->getRegionLoc() != uppRegion; in rangeIntersectsConditionalDirective() 57 CondDirectiveLocsTy::const_iterator low = llvm::lower_bound( in findConditionalDirectiveRegionLoc() local 59 assert(low != CondDirectiveLocs.end()); in findConditionalDirectiveRegionLoc() 60 return low->getRegionLoc(); in findConditionalDirectiveRegionLoc()
|
| /llvm-project-15.0.7/compiler-rt/lib/builtins/ppc/ |
| H A D | floatditf.c | 15 doublebits low = {.d = twop52}; in __floatditf() local 16 low.x |= a & UINT64_C(0x00000000ffffffff); // 0x1.0p52 + low 32 bits of a. in __floatditf() 29 result.s.hi = high_addend + low.d; in __floatditf() 30 result.s.lo = (high_addend - result.s.hi) + low.d; in __floatditf()
|
| /llvm-project-15.0.7/libcxx/src/ |
| H A D | locale.cpp | 876 for (; low != high; ++low) in do_scan_is() 885 for (; low != high; ++low) in do_scan_not() 907 for (; low != high; ++low) in do_toupper() 909 *low = isascii(*low) ? _DefaultRuneLocale.__mapupper[*low] : *low; in do_toupper() 915 *low = (isascii(*low) && islower_l(*low, _LIBCPP_GET_C_LOCALE)) ? (*low-L'a'+L'A') : *low; in do_toupper() 936 for (; low != high; ++low) in do_tolower() 938 *low = isascii(*low) ? _DefaultRuneLocale.__maplower[*low] : *low; in do_tolower() 944 *low = (isascii(*low) && isupper_l(*low, _LIBCPP_GET_C_LOCALE)) ? *low-L'A'+L'a' : *low; in do_tolower() 1023 for (; low != high; ++low) in do_toupper() 1033 *low = (isascii(*low) && islower_l(*low, _LIBCPP_GET_C_LOCALE)) ? *low-'a'+'A' : *low; in do_toupper() [all …]
|