Home
last modified time | relevance | path

Searched refs:high (Results 1 – 25 of 981) sorted by relevance

12345678910>>...40

/llvm-project-15.0.7/compiler-rt/lib/builtins/
H A Dudivmoddi4.c70 r.s.high = n.s.high % d.s.high; in __udivmoddi4()
74 return n.s.high / d.s.high; in __udivmoddi4()
82 r.s.high = n.s.high & (d.s.high - 1); in __udivmoddi4()
85 return n.s.high >> ctzsi(d.s.high); in __udivmoddi4()
90 sr = clzsi(d.s.high) - clzsi(n.s.high); in __udivmoddi4()
103 r.s.high = n.s.high >> sr; in __udivmoddi4()
116 q.s.high = n.s.high >> sr; in __udivmoddi4()
135 r.s.high = n.s.high >> sr; in __udivmoddi4()
139 q.s.high = (n.s.high << (n_udword_bits - sr)) | in __udivmoddi4()
148 sr = clzsi(d.s.high) - clzsi(n.s.high); in __udivmoddi4()
[all …]
H A Dint_types.h45 si_int high; member
47 si_int high;
58 su_int high; member
60 su_int high;
87 di_int high; member
89 di_int high;
100 du_int high; member
110 r.s.high = h; in make_ti()
117 r.s.high = h; in make_tu()
147 udwords high; member
[all …]
H A Dudivmodti4.c114 if (divisor.s.high == 0) { in __udivmodti4()
115 remainder.s.high = 0; in __udivmodti4()
116 if (dividend.s.high < divisor.s.low) { in __udivmodti4()
118 quotient.s.low = udiv128by64to64(dividend.s.high, dividend.s.low, in __udivmodti4()
120 quotient.s.high = 0; 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()
135 __builtin_clzll(divisor.s.high) - __builtin_clzll(dividend.s.high); in __udivmodti4()
137 quotient.s.high = 0; in __udivmodti4()
H A Dashrti3.c28 result.s.high = input.s.high >> (bits_in_dword - 1); in __ashrti3()
29 result.s.low = input.s.high >> (b - bits_in_dword); in __ashrti3()
33 result.s.high = input.s.high >> b; in __ashrti3()
34 result.s.low = (input.s.high << (bits_in_dword - b)) | (input.s.low >> b); in __ashrti3()
H A Dashrdi3.c26 result.s.high = input.s.high >> (bits_in_word - 1); in __ashrdi3()
27 result.s.low = input.s.high >> (b - bits_in_word); in __ashrdi3()
31 result.s.high = input.s.high >> b; in __ashrdi3()
32 result.s.low = (input.s.high << (bits_in_word - b)) | (input.s.low >> b); in __ashrdi3()
H A Dlshrti3.c27 result.s.high = 0; in __lshrti3()
28 result.s.low = input.s.high >> (b - bits_in_dword); in __lshrti3()
32 result.s.high = input.s.high >> b; in __lshrti3()
33 result.s.low = (input.s.high << (bits_in_dword - b)) | (input.s.low >> b); in __lshrti3()
H A Dlshrdi3.c25 result.s.high = 0; in __lshrdi3()
26 result.s.low = input.s.high >> (b - bits_in_word); in __lshrdi3()
30 result.s.high = input.s.high >> b; in __lshrdi3()
31 result.s.low = (input.s.high << (bits_in_word - b)) | (input.s.low >> b); in __lshrdi3()
/llvm-project-15.0.7/clang/test/CodeGen/
H A Daarch64-neon-vcombine.c11 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/llvm/test/CodeGen/SystemZ/
H A Dint-mul-10.ll18 ret i64 %high
34 ret i64 %high
38 ; high and low halves.
51 %or = or i64 %high, %low
67 ret i64 %high
82 ret i64 %high
99 ret i64 %high
114 ret i64 %high
129 ret i64 %high
146 ret i64 %high
[all …]
H A Dint-mul-07.ll1 ; Test high-part i32->i64 multiplications.
17 %high = trunc i64 %highx to i32
18 ret i32 %high
30 %high = trunc i64 %highx to i32
31 ret i32 %high
35 ; high and low halves.
44 %high = trunc i64 %highx to i32
46 %or = or i32 %high, %low
51 ; high and low halves.
60 %high = trunc i64 %highx to i32
[all …]
H A Dint-mul-08.ll18 ret i64 %high
38 ret i64 %high
54 ret i64 %high
58 ; high and low halves.
98 ret i64 %high
113 ret i64 %high
130 ret i64 %high
145 ret i64 %high
160 ret i64 %high
177 ret i64 %high
[all …]
H A Dinsert-06.ll12 %high = and i64 %a, -4294967296
13 %res = or i64 %high, %low
24 %high = and i64 %a, -4294967296
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
91 %res = or i64 %high, %low
105 %res = or i64 %high, %low
[all …]
/llvm-project-15.0.7/libc/src/__support/CPP/
H A DUInt.h74 carry = high(res_lo); in add()
77 uint64_t res_hi = high(val[i]) + high(x.val[i]) + carry; in add()
78 carry = high(res_hi); in add()
116 carry = high(res_lo); in mul()
118 carry = high(res_hi) + high(p2); in mul()
136 carry = high(res_lo); in mul()
138 carry = high(res_hi) + high(p2); in mul()
374 high(val[0]) * high(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]);
[all …]
/llvm-project-15.0.7/lld/test/ELF/
H A Dppc64-long-branch.s27 ## high@localentry (high+8), .text_high+16 and .text_low+8
56 bl high # Need a thunk
57 bl high # Need a thunk
59 bl high
65 # CHECK-NEXT: <high>:
77 .globl high
78 high: label
79 addis 2, 12, .TOC.-high@ha
80 addi 2, 2, .TOC.-high@l
81 .localentry high, 8
[all …]
H A Dppc32-long-thunk.s28 ## high = 0x02002008 = 65536*512+8200
42 ## high-0x2028 = 0x02002008-0x2020 = 65536*512-24
67 bl high@local # Need a thunk
68 bl high@local # Need a thunk
69 bl high+32768@plt # Need a thunk
70 bl high
74 # PD: 02002008 <high>:
86 .globl high
87 high: label
95 # NM-NEXT: T high
/llvm-project-15.0.7/llvm/test/Transforms/ConstraintElimination/
H A Dadd.ll31 %c.1 = icmp uge i8 %add.ptr.i, %high
38 %t.0 = icmp ult i8 %start, %high
41 %t.1 = icmp ult i8 %start.1, %high
44 %t.2 = icmp ult i8 %start.2, %high
47 %t.3 = icmp ult i8 %start.3, %high
50 %c.4 = icmp ult i8 %start.4, %high
89 %t.0 = icmp slt i8 %start, %high
92 %t.1 = icmp slt i8 %start.1, %high
143 %t.0 = icmp ule i8 %start, %high
202 %f.0 = icmp ugt i8 %start, %high
[all …]
H A Dmixed-signed-unsigned-predicates.ll62 %uc.3 = icmp ugt i8 %start, %high
83 %f.0 = icmp ugt i8 %start, %high
85 %f.1 = icmp uge i8 %start.1, %high
88 %sc.1 = icmp sgt i8 %start, %high
91 %sc.2 = icmp sge i8 %start.1, %high
95 %f.2 = icmp uge i8 %start.2, %high
105 %f.3 = icmp uge i8 %start.3, %high
181 %uc.3 = icmp ugt i8 %start, %high
202 %f.0 = icmp ugt i8 %start, %high
207 %sc.1 = icmp sgt i8 %start, %high
[all …]
H A Dsub.ll31 %c.1 = icmp uge i8 %sub.ptr.i, %high
38 %t.0 = icmp ult i8 %start, %high
41 %t.1 = icmp ult i8 %start.1, %high
44 %t.2 = icmp ult i8 %start.2, %high
47 %t.3 = icmp ult i8 %start.3, %high
50 %c.4 = icmp ult i8 %start.4, %high
92 %t.0 = icmp ule i8 %start, %high
95 %t.1 = icmp ule i8 %start.1, %high
98 %t.2 = icmp ule i8 %start.2, %high
151 %f.0 = icmp ugt i8 %start, %high
[all …]
H A Dgeps-pointers-to-arrays.ll20 %c.1 = icmp ule i8* %add.ptr.i, %high
25 %c.0 = icmp ult i8* %start.0, %high
50 %c.1 = icmp ule i8* %add.ptr.i, %high
55 %c.0 = icmp ult i8* %start.0, %high
85 %c.0 = icmp ult i8* %start.0, %high
115 %c.0 = icmp ult i8* %start.0, %high
148 %c.0 = icmp ult i8* %start.0, %high
172 %c = icmp uge i8* %add.ptr.i, %high
180 %c.0 = icmp ule i8* %start.0, %high
183 %c.1 = icmp ule i8* %start.1, %high
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.clamp/
H A Dranges.clamp.pass.cpp29 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),
48 int high = 3; in test() local
49 std::same_as<const int&> decltype(auto) ret = std::ranges::clamp(val, low, high); in test()
86 auto high = S{30}; 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()
108 auto high = CheckDoubleMove{30}; 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 Dcold-profile-trimming-symbolized.test22 int partition_pivot_last(int* array, int low, int high) {
23 int pivot = array[high];
25 for (int j = low; j < high; j++)
28 swap(&array[i + 1], &array[high]);
32 int partition_pivot_first(int* array, int low, int high) {
35 for (int j = low + 1; j <= high; j++)
41 void quick_sort(int* array, int low, int high, int (*partition_func)(int *, int, int)) {
42 if (low < high) {
43 int pi = (*partition_func)(array, low, high);
45 quick_sort(array, pi + 1, high, partition_func);
H A Dcold-profile-trimming.test27 int partition_pivot_last(int* array, int low, int high) {
28 int pivot = array[high];
30 for (int j = low; j < high; j++)
33 swap(&array[i + 1], &array[high]);
37 int partition_pivot_first(int* array, int low, int high) {
40 for (int j = low + 1; j <= high; j++)
46 void quick_sort(int* array, int low, int high, int (*partition_func)(int *, int, int)) {
47 if (low < high) {
48 int pi = (*partition_func)(array, low, high);
50 quick_sort(array, pi + 1, high, partition_func);
H A Dprofile-density.test23 int partition_pivot_last(int* array, int low, int high) {
24 int pivot = array[high];
26 for (int j = low; j < high; j++)
29 swap(&array[i + 1], &array[high]);
33 int partition_pivot_first(int* array, int low, int high) {
36 for (int j = low + 1; j <= high; j++)
42 void quick_sort(int* array, int low, int high, int (*partition_func)(int *, int, int)) {
43 if (low < high) {
44 int pi = (*partition_func)(array, low, high);
46 quick_sort(array, pi + 1, high, partition_func);
H A Dfs-discriminator.test102 int partition_pivot_last(int* array, int low, int high) {
103 int pivot = array[high];
105 for (int j = low; j < high; j++)
108 swap(&array[i + 1], &array[high]);
112 int partition_pivot_first(int* array, int low, int high) {
115 for (int j = low + 1; j <= high; j++)
121 void quick_sort(int* array, int low, int high, int (*partition_func)(int *, int, int)) {
122 if (low < high) {
123 int pi = (*partition_func)(array, low, high);
125 quick_sort(array, pi + 1, high, partition_func);
/llvm-project-15.0.7/compiler-rt/test/builtins/Unit/
H A Dmuloti4_test.c34 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()

12345678910>>...40