Home
last modified time | relevance | path

Searched refs:amount (Results 1 – 25 of 330) sorted by relevance

12345678910>>...14

/llvm-project-15.0.7/lldb/source/Plugins/Process/Utility/
H A DARMUtils.h91 if (amount == 0) { in LSL_C()
96 carry_out = amount <= 32 ? Bit32(value, 32 - amount) : 0; in LSL_C()
103 if (amount == 0) in LSL()
115 if (amount == 0) { in LSR_C()
120 carry_out = amount <= 32 ? Bit32(value, amount - 1) : 0; in LSR_C()
127 if (amount == 0) in LSR()
139 if (amount == 0 || amount > 32) { in ASR_C()
148 return UnsignedBits(extended, amount + 31, amount); in ASR_C()
158 if (amount == 0) in ASR()
170 if (amount == 0) { in ROR_C()
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/AVR/
H A Dshift-expand.ll5 ; amount to a loop. These loops avoid generating a (non-existing) builtin such
11 define i32 @shl(i32 %value, i32 %amount) addrspace(1) {
27 %result = shl i32 %value, %amount
31 define i32 @lshr(i32 %value, i32 %amount) addrspace(1) {
47 %result = lshr i32 %value, %amount
72 define i40 @shl40(i40 %value, i40 %amount) addrspace(1) {
77 %result = shl i40 %value, %amount
82 define i24 @shl24(i24 %value, i24 %amount) addrspace(1) {
87 %result = shl i24 %value, %amount
/llvm-project-15.0.7/lldb/source/Core/
H A DProgress.cpp39 void Progress::Increment(uint64_t amount) { in Increment() argument
40 if (amount > 0) { in Increment()
44 if (amount > (m_total - m_completed)) in Increment()
47 m_completed += amount; in Increment()
/llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/GlobalISel/
H A Dshl.ll35 %result = shl i8 %value, %amount
91 %result = shl i8 %value, %amount
138 %result = shl i24 %value, %amount
169 %result = shl i24 %value, %amount
200 %result = shl i32 %value, %amount
231 %result = shl i32 %value, %amount
269 %result = shl i32 %value, %amount
284 %result = shl i32 %value, %amount
617 %result = shl i16 %value, %amount
659 %result = shl i16 %value, %amount
[all …]
H A Dashr.ll38 %result = ashr i8 %value, %amount
102 %result = ashr i8 %value, %amount
140 %result = ashr i24 %value, %amount
175 %result = ashr i24 %value, %amount
208 %result = ashr i32 %value, %amount
239 %result = ashr i32 %value, %amount
277 %result = ashr i32 %value, %amount
292 %result = ashr i32 %value, %amount
626 %result = ashr i16 %value, %amount
672 %result = ashr i16 %value, %amount
[all …]
H A Dlshr.ll37 %result = lshr i8 %value, %amount
85 %result = lshr i8 %value, %amount
121 %result = lshr i24 %value, %amount
154 %result = lshr i24 %value, %amount
185 %result = lshr i32 %value, %amount
216 %result = lshr i32 %value, %amount
254 %result = lshr i32 %value, %amount
269 %result = lshr i32 %value, %amount
603 %result = lshr i16 %value, %amount
634 %result = lshr i16 %value, %amount
[all …]
/llvm-project-15.0.7/lldb/source/Plugins/UnwindAssembly/x86/
H A Dx86AssemblyInspectionEngine.h103 bool sub_rsp_pattern_p(int &amount);
104 bool add_rsp_pattern_p(int &amount);
105 bool lea_rsp_pattern_p(int &amount);
106 bool lea_rbp_rsp_pattern_p(int &amount);
107 bool lea_rbx_rsp_pattern_p(int &amount);
H A Dx86AssemblyInspectionEngine.cpp440 amount = (int8_t) * (p + 2); in sub_rsp_pattern_p()
445 amount = (int32_t)extract_4(p + 2); in sub_rsp_pattern_p()
458 amount = (int8_t) * (p + 2); in add_rsp_pattern_p()
463 amount = (int32_t)extract_4(p + 2); in add_rsp_pattern_p()
482 amount = (int8_t) * (p + 3); in lea_rsp_pattern_p()
488 amount = (int32_t)extract_4(p + 3); in lea_rsp_pattern_p()
509 amount = (int8_t)p[1]; in lea_rbp_rsp_pattern_p()
515 amount = (int32_t)extract_4(p + 1); in lea_rbp_rsp_pattern_p()
536 amount = (int8_t)p[1]; in lea_rbx_rsp_pattern_p()
542 amount = (int32_t)extract_4(p + 1); in lea_rbx_rsp_pattern_p()
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/SystemZ/
H A Dvec-perm-07.ll5 ; Test a v16i8 shift with the lowest useful shift amount.
18 ; Test a v16i8 shift with the highest shift amount.
83 ; Test a v8i16 shift with the lowest useful shift amount.
94 ; Test a v8i16 shift with the highest useful shift amount.
105 ; Test a v4i32 shift with the lowest useful shift amount.
115 ; Test a v4i32 shift with the highest useful shift amount.
125 ; Test a v4f32 shift with the lowest useful shift amount.
135 ; Test a v4f32 shift with the highest useful shift amount.
H A Dshift-05.ll56 ; ...and again with a sign-extended 32-bit shift amount.
68 ; ...and now with a zero-extended 32-bit shift amount.
81 ; mask the amount instead.
105 ; Check cases where 1 is subtracted from the shift amount.
116 ; Check the lowest value that can be subtracted from the shift amount.
117 ; Again, we could mask the shift amount instead.
153 ; Check that the shift amount uses an address register. It cannot be in %r0.
H A Dshift-07.ll56 ; ...and again with a sign-extended 32-bit shift amount.
68 ; ...and now with a zero-extended 32-bit shift amount.
81 ; mask the amount instead.
105 ; Check cases where 1 is subtracted from the shift amount.
116 ; Check the lowest value that can be subtracted from the shift amount.
117 ; Again, we could mask the shift amount instead.
153 ; Check that the shift amount uses an address register. It cannot be in %r0.
H A Dshift-06.ll56 ; ...and again with a sign-extended 32-bit shift amount.
68 ; ...and now with a zero-extended 32-bit shift amount.
81 ; mask the amount instead.
105 ; Check cases where 1 is subtracted from the shift amount.
116 ; Check the lowest value that can be subtracted from the shift amount.
117 ; Again, we could mask the shift amount instead.
153 ; Check that the shift amount uses an address register. It cannot be in %r0.
H A Dshift-08.ll69 ; ...and again with a sign-extended 32-bit shift amount.
85 ; ...and now with a zero-extended 32-bit shift amount.
102 ; mask the amount.
132 ; Check cases where 1 is subtracted from the shift amount.
146 ; Check the lowest value that can be subtracted from the shift amount.
147 ; Again, we could mask the shift amount instead.
161 ; Check the next value down, masking the amount removes the addition.
190 ; Check that the shift amount uses an address register. It cannot be in %r0.
H A Dshift-03.ll68 ; ...and again with a truncated 64-bit shift amount.
81 ; mask the amount instead.
92 ; Check the next value up. Again, we could mask the amount instead.
116 ; Check that the shift amount uses an address register. It cannot be in %r0.
H A Dshift-02.ll68 ; ...and again with a truncated 64-bit shift amount.
81 ; mask the amount instead.
92 ; Check the next value up. Again, we could mask the amount instead.
116 ; Check that the shift amount uses an address register. It cannot be in %r0.
H A Dshift-01.ll68 ; ...and again with a truncated 64-bit shift amount.
81 ; mask the amount instead.
92 ; Check the next value up. Again, we could mask the amount instead.
116 ; Check that the shift amount uses an address register. It cannot be in %r0.
H A Dshift-04.ll69 ; ...and again with a truncated 64-bit shift amount.
101 ; mask the amount.
131 ; Check cases where 1 is subtracted from the shift amount.
145 ; Check the lowest value that can be subtracted from the shift amount.
146 ; Again, we could mask the shift amount instead.
160 ; Check the next value down, masking the amount removes the addition.
189 ; Check that the shift amount uses an address register. It cannot be in %r0.
/llvm-project-15.0.7/compiler-rt/test/ubsan/TestCases/Integer/
H A Dunsigned-shift.cpp4 #define shift(val, amount) ({ \ argument
6 volatile unsigned _a = (amount); \
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Drotate4.ll373 define i8 @rotate_left_8(i8 %x, i32 %amount) {
389 %amt = trunc i32 %amount to i8
399 define i8 @rotate_right_8(i8 %x, i32 %amount) {
415 %amt = trunc i32 %amount to i8
425 define i16 @rotate_left_16(i16 %x, i32 %amount) {
441 %amt = trunc i32 %amount to i16
467 %amt = trunc i32 %amount to i16
492 %amt = trunc i32 %amount to i8
518 %amt = trunc i32 %amount to i8
544 %amt = trunc i32 %amount to i16
[all …]
/llvm-project-15.0.7/lldb/source/Utility/
H A DStream.cpp168 void Stream::IndentMore(unsigned amount) { m_indent_level += amount; } in IndentMore() argument
171 void Stream::IndentLess(unsigned amount) { in IndentLess() argument
172 if (m_indent_level >= amount) in IndentLess()
173 m_indent_level -= amount; in IndentLess()
/llvm-project-15.0.7/llvm/test/Transforms/InstCombine/
H A Dshift-amount-reassociation-in-bittest-with-truncation-lshr.ll42 ; New shift amount would be 16, %x has 16 leading zeros - can fold.
76 ; New shift amount would be 16, %x has 15 leading zeros - can not fold.
100 ; New shift amount would be 16, %y has 47 leading zeros - can fold.
134 ; New shift amount would be 16, %y has 48 leading zeros - can not fold.
165 ; New shift amount would be 16, minimal count of leading zeros in %x is 16. Ok.
183 ; New shift amount would be 16, minimal count of leading zeros in %x is 15, not ok to fold.
207 ; New shift amount would be 16, minimal count of leading zeros in %x is 47. Ok.
250 ; Ok if the final shift amount is exactly one less than widest bit width.
293 ; Ok if the final shift amount is zero.
450 ; shift-amount-reassociation-in-bittest-with-truncation-shl.ll and
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/NVPTX/
H A Darithmetic-int.ll108 ; PTX requires 32-bit shift amount
116 ; PTX requires 32-bit shift amount
124 ; PTX requires 32-bit shift amount
298 ; PTX requires 32-bit shift amount
306 ; PTX requires 32-bit shift amount
314 ; PTX requires 32-bit shift amount
/llvm-project-15.0.7/llvm/test/CodeGen/PowerPC/
H A Dcombine-to-mulh-shift-amount.ll6 ; a single multiply-high is only valid when the shift amount is the same as
10 ; amount is 32.
12 ; amount is 64.
/llvm-project-15.0.7/llvm/test/Transforms/InstSimplify/
H A Dshift-knownbits.ll5 ; If any bits of the shift amount are known to make it exceed or equal
38 ; If all valid bits of the shift amount are known 0, there's no shift.
139 ; That should be ok. Either the shift amount is 0 or invalid (1), so we can always return %a.
227 ; The shift amount is 0 on either of high/low bytes. The middle byte doesn't matter.
240 ; The shift amount is 0 on low byte of big-endian and unknown on little-endian.
259 ; The shift amount is 0 on low byte of little-endian and unknown on big-endian.
278 ; The shift amount is known 24 on little-endian and known 24<<16 on big-endian
292 ; The shift amount is known 23 on little-endian and known 23<<16 on big-endian
312 ; The shift amount is known 23 on big-endian and known 23<<16 on little-endian
332 ; Negative test - the shift amount is known 24 or 24<<16 on only 2 out of 3 elements.
/llvm-project-15.0.7/lldb/include/lldb/Core/
H A DProgress.h89 void Increment(uint64_t amount = 1);

12345678910>>...14