| /external/clang/test/CodeGen/ |
| aarch64-neon-vcombine.c | 7 // CHECK-LABEL: define <16 x i8> @test_vcombine_s8(<8 x i8> %low, <8 x i8> %high) #0 {
8 // CHECK: [[SHUFFLE_I:%.*]] = shufflevector <8 x i8> %low, <8 x i8> %high, <16 x i32> <i32 0, i32 1, i32 2, i32 3, i32 4, i32 5, i32 6, i32 7, i32 8, i32 9, i32 10, i32 11, i32 12, i32 13, i32 14, i32 15>
10 int8x16_t test_vcombine_s8(int8x8_t low, int8x8_t high) {
11 return vcombine_s8(low, high);
14 // CHECK-LABEL: define <8 x i16> @test_vcombine_s16(<4 x i16> %low, <4 x i16> %high) #0 {
15 // CHECK: [[SHUFFLE_I:%.*]] = shufflevector <4 x i16> %low, <4 x i16> %high, <8 x i32> <i32 0, i32 1, i32 2, i32 3, i32 4, i32 5, i32 6, i32 7>
17 int16x8_t test_vcombine_s16(int16x4_t low, int16x4_t high) {
18 return vcombine_s16(low, high);
21 // CHECK-LABEL: define <4 x i32> @test_vcombine_s32(<2 x i32> %low, <2 x i32> %high) #0 {
22 // CHECK: [[SHUFFLE_I:%.*]] = shufflevector <2 x i32> %low, <2 x i32> %high, <4 x i32> <i32 0, i32 1, i32 2, i32 3
[all...] |
| /toolchain/binutils/binutils-2.27/gas/ |
| flonum-copy.c | 30 in_length = in->leader - in->low;
32 if (in->leader < in->low)
34 out->leader = out->low - 1; /* 0.0 case */
38 out_length = out->high - out->low;
49 memset ((char *) (out->low + in_length + 1), '\0',
53 memcpy ((void *) (out->low), (void *) (in->low),
56 out->leader = in->leader - in->low + out->low;
64 memcpy ((void *) (out->low), (void *) (in->low + shorten)
[all...] |
| /device/linaro/bootloader/edk2/ArmPkg/Library/CompilerIntrinsicsLib/Arm/ |
| ucmpdi2.c | 77 if (x.low < y.low)
79 if (x.low > y.low)
|
| ashldi3.c | 72 result.low = 0;
73 result.high = input.low << (b - bits_in_word);
79 result.low = input.low << b;
80 result.high = (input.high << b) | (input.low >> (bits_in_word - b));
|
| muldi3.c | 70 r.low = (a & lower_mask) * (b & lower_mask);
71 UINT32 t = r.low >> bits_in_word_2;
72 r.low &= lower_mask;
74 r.low += (t & lower_mask) << bits_in_word_2;
76 t = r.low >> bits_in_word_2;
77 r.low &= lower_mask;
79 r.low += (t & lower_mask) << bits_in_word_2;
95 r.all = __muldsi3(x.low, y.low);
96 r.high += x.high * y.low + x.low * y.high;
[all...] |
| udivmoddi4.c | 93 *rem = n.low % d.low;
94 return n.low / d.low;
100 *rem = n.low;
104 if (d.low == 0)
112 *rem = n.high % d.low;
113 return n.high / d.low;
116 if (n.low == 0)
124 r.low = 0;
[all...] |
| /external/vboot_reference/utility/ |
| tpm-nvsize | 11 low=1
17 ## echo trying $try [ $low $high ]
21 if [ $try -eq $low ]; then
22 echo $low
25 low=$try
26 try=$(( ( $high + $low ) / 2 ))
29 low=$try
43 if [ $try -eq $low ]; then
48 try=$(( ( $high + $low ) / 2 ))
|
| /external/valgrind/none/tests/s390x/ |
| cdsg.c | 6 uint64_t low; member in struct:__anon43122
28 printf("before op1 = (%#lx, %#lx)\n", _op1.high, _op1.low);
29 printf("before op2 = (%#lx, %#lx)\n", _op2.high, _op2.low);
30 printf("before op3 = (%#lx, %#lx)\n", _op3.high, _op3.low);
44 printf("after op1 = (%#lx, %#lx)\n", _op1.high, _op1.low);
45 printf("after op2 = (%#lx, %#lx)\n", _op2.high, _op2.low);
46 printf("after op3 = (%#lx, %#lx)\n", _op3.high, _op3.low);
54 if (_op3.low != op3_before.low || _op3.high != op3_before.high) {
62 if (_op1.low != op1_before.low || _op1.high != op1_before.high)
[all...] |
| cds.c | 6 uint64_t low; member in struct:__anon43121
23 printf("before op1 = (%#lx, %#lx)\n", op1.high, op1.low);
25 printf("before op3 = (%#lx, %#lx)\n", op3.high, op3.low);
39 printf("after op1 = (%#lx, %#lx)\n", op1.high, op1.low);
41 printf("after op3 = (%#lx, %#lx)\n", op3.high, op3.low);
50 if (op3.low != op3_before.low || op3.high != op3_before.high) {
58 if (op1.low != op1_before.low || op1.high != op1_before.high) {
62 // lower 32 bits of op2 are the lower 32 bits of op3.low
[all...] |
| /prebuilts/jdk/jdk8/darwin-x86/sample/forkjoin/mergesort/ |
| MergeSort.java | 67 private final int low; field in class:MergeSort.MergeSortTask
75 * @param low the lower element to start sorting at
78 protected MergeSortTask(int[] array, int low, int high) {
80 this.low = low;
86 if (high - low <= THRESHOLD) {
87 Arrays.sort(array, low, high);
89 int middle = low + ((high - low) >> 1);
91 invokeAll(new MergeSortTask(array, low, middle), new MergeSortTask(array, middle, high))
[all...] |
| /prebuilts/jdk/jdk8/linux-x86/sample/forkjoin/mergesort/ |
| MergeSort.java | 67 private final int low; field in class:MergeSort.MergeSortTask
75 * @param low the lower element to start sorting at
78 protected MergeSortTask(int[] array, int low, int high) {
80 this.low = low;
86 if (high - low <= THRESHOLD) {
87 Arrays.sort(array, low, high);
89 int middle = low + ((high - low) >> 1);
91 invokeAll(new MergeSortTask(array, low, middle), new MergeSortTask(array, middle, high))
[all...] |
| /device/google/contexthub/firmware/lib/builtins/ |
| udivmoddi4.c | 45 *rem = n.s.low % d.s.low;
46 return n.s.low / d.s.low;
53 *rem = n.s.low;
57 if (d.s.low == 0)
66 *rem = n.s.high % d.s.low;
67 return n.s.high / d.s.low;
70 if (n.s.low == 0)
79 r.s.low = 0
[all...] |
| /device/linaro/bootloader/arm-trusted-firmware/lib/compiler-rt/builtins/ |
| udivmoddi4.c | 45 *rem = n.s.low % d.s.low;
46 return n.s.low / d.s.low;
53 *rem = n.s.low;
57 if (d.s.low == 0)
66 *rem = n.s.high % d.s.low;
67 return n.s.high / d.s.low;
70 if (n.s.low == 0)
79 r.s.low = 0
[all...] |
| /device/linaro/bootloader/edk2/StdLib/LibC/Main/Arm/ |
| int_types.h | 62 su_int low;
member in struct:__anon12067::__anon12068
66 su_int low;
77 su_int low;
member in struct:__anon12069::__anon12070
81 su_int low;
100 du_int low;
member in struct:__anon12071::__anon12072
104 du_int low;
115 du_int low;
member in struct:__anon12073::__anon12074
119 du_int low;
127 r.s.low = l;
134 r.s.low = l;
155 udwords low; member in struct:__anon12077
[all...] |
| /external/compiler-rt/lib/builtins/ |
| udivmoddi4.c | 45 *rem = n.s.low % d.s.low;
46 return n.s.low / d.s.low;
53 *rem = n.s.low;
57 if (d.s.low == 0)
66 *rem = n.s.high % d.s.low;
67 return n.s.high / d.s.low;
70 if (n.s.low == 0)
79 r.s.low = 0
[all...] |
| udivmodti4.c | 47 *rem = n.s.low % d.s.low;
48 return n.s.low / d.s.low;
55 *rem = n.s.low;
59 if (d.s.low == 0)
68 *rem = n.s.high % d.s.low;
69 return n.s.high / d.s.low;
72 if (n.s.low == 0)
81 r.s.low = 0
[all...] |
| ashldi3.c | 32 result.s.low = 0;
33 result.s.high = input.s.low << (b - bits_in_word);
39 result.s.low = input.s.low << b;
40 result.s.high = (input.s.high << b) | (input.s.low >> (bits_in_word - b));
|
| ashlti3.c | 32 result.s.low = 0;
33 result.s.high = input.s.low << (b - bits_in_dword);
39 result.s.low = input.s.low << b;
40 result.s.high = (input.s.high << b) | (input.s.low >> (bits_in_dword - b));
|
| multi3.c | 28 r.s.low = (a & lower_mask) * (b & lower_mask);
29 du_int t = r.s.low >> bits_in_dword_2;
30 r.s.low &= lower_mask;
32 r.s.low += (t & lower_mask) << bits_in_dword_2;
34 t = r.s.low >> bits_in_dword_2;
35 r.s.low &= lower_mask;
37 r.s.low += (t & lower_mask) << bits_in_dword_2;
53 r.all = __mulddi3(x.s.low, y.s.low);
54 r.s.high += x.s.high * y.s.low + x.s.low * y.s.high
[all...] |
| fixunsxfdi.c | 38 int e = (fb.u.high.s.low & 0x00007FFF) - 16383;
39 if (e < 0 || (fb.u.high.s.low & 0x00008000))
43 return fb.u.low.all >> (63 - e);
|
| fixunsxfsi.c | 37 int e = (fb.u.high.s.low & 0x00007FFF) - 16383;
38 if (e < 0 || (fb.u.high.s.low & 0x00008000))
42 return fb.u.low.s.high >> (31 - e);
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setools/ |
| util.py | 118 obj An object with attributes named "low" and "high", representing the range.
119 criteria An object with attributes named "low" and "high", representing the criteria.
128 return ((obj.low <= criteria.low <= obj.high) or (
129 obj.low <= criteria.high <= obj.high) or (
130 criteria.low <= obj.low and obj.high <= criteria.high))
133 return ((obj.low < criteria.low and criteria.high <= obj.high) or (
134 obj.low <= criteria.low and criteria.high < obj.high)
[all...] |
| /external/libmojo/base/ |
| unguessable_token.cc | 13 UnguessableToken::UnguessableToken(uint64_t high, uint64_t low)
14 : high_(high), low_(low) {}
30 UnguessableToken UnguessableToken::Deserialize(uint64_t high, uint64_t low) {
33 DCHECK(!(high == 0 && low == 0));
34 return UnguessableToken(high, low);
|
| /frameworks/rs/driver/runtime/arch/ |
| clamp.c | 25 extern T __attribute__((overloadable)) clamp(T amount, T low, T high) { \
26 return amount < low ? low : (amount > high ? high : amount); \
46 extern T##2 __attribute__((overloadable)) clamp(T##2 amount, T##2 low, T##2 high) { \
48 r.x = amount.x < low.x ? low.x : (amount.x > high.x ? high.x : amount.x); \
49 r.y = amount.y < low.y ? low.y : (amount.y > high.y ? high.y : amount.y); \
53 extern T##3 __attribute__((overloadable)) clamp(T##3 amount, T##3 low, T##3 high) { \
55 r.x = amount.x < low.x ? low.x : (amount.x > high.x ? high.x : amount.x);
[all...] |
| /libcore/luni/src/test/java/libcore/java/lang/ |
| StringBufferTest.java | 34 char high = '\uD83D', low = '\uDE02'; local
35 StringBuffer surrogateCP = new StringBuffer().append(new char[]{high, low, low});
36 assertTrue(Arrays.equals(new int[]{high, low, low}, surrogateCP.chars().toArray()));
48 char high = '\uD83D', low = '\uDE02'; local
49 StringBuffer surrogateCP = new StringBuffer().append(new char[]{high, low, low, '0'});
50 assertEquals(Character.toCodePoint(high, low), surrogateCP.codePoints().toArray()[0]);
51 assertEquals((int) low, surrogateCP.codePoints().toArray()[1]); // Unmatched surrogate
[all...] |
