| /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...] |
| 2002-09-18-UnionProblem.c | 5 char high, low; member in struct:DWstruct
18 rr.s.high = n1;
22 rr.s.high = bm;
|
| /device/linaro/bootloader/edk2/StdLib/LibC/Math/ |
| s_fabs.c | 28 u_int32_t high;
local
29 GET_HIGH_WORD(high,x);
30 SET_HIGH_WORD(x,high&0x7fffffff);
|
| /device/linaro/bootloader/edk2/ArmPkg/Library/CompilerIntrinsicsLib/Arm/ |
| ucmpdi2.c | 73 if (x.high < y.high)
75 if (x.high > y.high)
|
| ashrdi3.c | 72 // result.high = input.high < 0 ? -1 : 0
73 result.high = input.high >> (bits_in_word - 1);
74 result.low = input.high >> (b - bits_in_word);
80 result.high = input.high >> b;
81 result.low = (input.high << (bits_in_word - b)) | (input.low >> b);
|
| lshrdi3.c | 72 result.high = 0;
73 result.low = input.high >> (b - bits_in_word);
79 result.high = input.high >> b;
80 result.low = (input.high << (bits_in_word - b)) | (input.low >> b);
|
| udivmoddi4.c | 85 if (n.high == 0)
87 if (d.high == 0)
103 // n.high != 0
106 if (d.high == 0)
112 *rem = n.high % d.low;
113 return n.high / d.low;
115 // d.high != 0
123 r.high = n.high % d.high;
[all...] |
| /external/valgrind/none/tests/s390x/ |
| cdsg.c | 5 uint64_t high; 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 | 5 uint64_t high; 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) {
66 // higher 32 bits of op2 are the lower 32 bits of op3.high
[all...] |
| /external/vboot_reference/utility/ |
| tpm-nvsize | 12 high=1500
13 try=$high
17 ## echo trying $try [ $low $high ]
24 elif [ $try -lt $high ]; then
26 try=$(( ( $high + $low ) / 2 ))
28 # special case: when try == high, expand the search
31 high=$try
47 high=$try
48 try=$(( ( $high + $low ) / 2 ))
|
| /device/google/contexthub/firmware/lib/builtins/ |
| udivmoddi4.c | 36 if (n.s.high == 0)
38 if (d.s.high == 0)
56 /* n.s.high != 0 */
59 if (d.s.high == 0)
66 *rem = n.s.high % d.s.low;
67 return n.s.high / d.s.low;
69 /* d.s.high != 0 */
78 r.s.high = n.s.high % d.s.high;
[all...] |
| aeabi_f2ulz.c | 24 su_int high = da / 4294967296.f; /* da / 0x1p32f; */ local
25 su_int low = da - (float)high * 4294967296.f; /* high * 0x1p32f; */
26 return ((du_int)high << 32) | low;
|
| /device/linaro/bootloader/arm-trusted-firmware/lib/compiler-rt/builtins/ |
| udivmoddi4.c | 36 if (n.s.high == 0)
38 if (d.s.high == 0)
56 /* n.s.high != 0 */
59 if (d.s.high == 0)
66 *rem = n.s.high % d.s.low;
67 return n.s.high / d.s.low;
69 /* d.s.high != 0 */
78 r.s.high = n.s.high % d.s.high;
[all...] |
| /external/compiler-rt/lib/builtins/ |
| udivmoddi4.c | 36 if (n.s.high == 0)
38 if (d.s.high == 0)
56 /* n.s.high != 0 */
59 if (d.s.high == 0)
66 *rem = n.s.high % d.s.low;
67 return n.s.high / d.s.low;
69 /* d.s.high != 0 */
78 r.s.high = n.s.high % d.s.high;
[all...] |
| udivmodti4.c | 38 if (n.s.high == 0)
40 if (d.s.high == 0)
58 /* n.s.high != 0 */
61 if (d.s.high == 0)
68 *rem = n.s.high % d.s.low;
69 return n.s.high / d.s.low;
71 /* d.s.high != 0 */
80 r.s.high = n.s.high % d.s.high;
[all...] |
| fixunsdfdi.c | 25 su_int high = a / 4294967296.f; /* a / 0x1p32f; */
26 su_int low = a - (double)high * 4294967296.f; /* high * 0x1p32f; */
27 return ((du_int)high << 32) | low;
|
| lshrdi3.c | 32 result.s.high = 0;
33 result.s.low = input.s.high >> (b - bits_in_word);
39 result.s.high = input.s.high >> b;
40 result.s.low = (input.s.high << (bits_in_word - b)) | (input.s.low >> b);
|
| lshrti3.c | 32 result.s.high = 0;
33 result.s.low = input.s.high >> (b - bits_in_dword);
39 result.s.high = input.s.high >> b;
40 result.s.low = (input.s.high << (bits_in_dword - b)) | (input.s.low >> b);
|
| ashrdi3.c | 32 /* result.s.high = input.s.high < 0 ? -1 : 0 */
33 result.s.high = input.s.high >> (bits_in_word - 1);
34 result.s.low = input.s.high >> (b - bits_in_word);
40 result.s.high = input.s.high >> b;
41 result.s.low = (input.s.high << (bits_in_word - b)) | (input.s.low >> b);
|
| /device/linaro/bootloader/edk2/StdLib/LibC/Main/Arm/ |
| int_types.h | 63 si_int high;
member in struct:__anon12067::__anon12068
65 si_int high;
78 su_int high;
member in struct:__anon12069::__anon12070
80 su_int high;
101 di_int high;
member in struct:__anon12071::__anon12072
103 di_int high;
116 du_int high;
member in struct:__anon12073::__anon12074
118 du_int high;
126 r.s.high = h;
133 r.s.high = h;
156 udwords high; member in struct:__anon12077
[all...] |
| /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...] |
| /prebuilts/jdk/jdk8/darwin-x86/sample/forkjoin/mergesort/ |
| MergeSort.java | 68 private final int high; field in class:MergeSort.MergeSortTask
76 * @param high the non-inclusive high element to sort to
78 protected MergeSortTask(int[] array, int low, int high) {
81 this.high = high;
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 | 68 private final int high; field in class:MergeSort.MergeSortTask
76 * @param high the non-inclusive high element to sort to
78 protected MergeSortTask(int[] array, int low, int high) {
81 this.high = high;
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...] |
