HomeSort by relevance Sort by last modified time
    Searched refs:low (Results 1 - 25 of 926) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/dropbear/libtomcrypt/src/pk/ecc/
ecc_sizes.c 26 void ecc_sizes(int *low, int *high)
29 LTC_ARGCHKVD(low != NULL);
32 *low = INT_MAX;
35 if (ltc_ecc_sets[i].size < *low) {
36 *low = ltc_ecc_sets[i].size;
  /external/valgrind/main/none/tests/s390x/
cdsg.c 6 uint64_t low; member in struct:__anon31144
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:__anon31143
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...]
  /external/chromium_org/third_party/yasm/source/patched-yasm/modules/parsers/tasm/tests/
expr.asm 1 a db low ((1 shl 2) and (16 shr 2) or (high 0x5034))
  /external/compiler-rt/lib/
cmpti2.c 35 if (x.s.low < y.s.low)
37 if (x.s.low > y.s.low)
ucmpti2.c 35 if (x.s.low < y.s.low)
37 if (x.s.low > y.s.low)
fixunsxfdi.c 38 int e = (fb.u.high.s.low & 0x00007FFF) - 16383;
39 if (e < 0 || (fb.u.high.s.low & 0x00008000))
41 return fb.u.low.all >> (63 - e);
fixunsxfsi.c 38 int e = (fb.u.high.s.low & 0x00007FFF) - 16383;
39 if (e < 0 || (fb.u.high.s.low & 0x00008000))
41 return fb.u.low.s.high >> (31 - e);
int_types.h 35 su_int low; member in struct:__anon20024::__anon20025
39 su_int low;
50 su_int low; member in struct:__anon20026::__anon20027
54 su_int low;
70 du_int low; member in struct:__anon20028::__anon20029
74 du_int low;
85 du_int low; member in struct:__anon20030::__anon20031
89 du_int low;
97 r.s.low = l;
104 r.s.low = l
125 udwords low; member in struct:__anon20034
    [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...]
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...]
fixunsxfti.c 38 int e = (fb.u.high.s.low & 0x00007FFF) - 16383;
39 if (e < 0 || (fb.u.high.s.low & 0x00008000))
41 tu_int r = fb.u.low.all;
fixxfdi.c 35 int e = (fb.u.high.s.low & 0x00007FFF) - 16383;
38 di_int s = -(si_int)((fb.u.high.s.low & 0x00008000) >> 15);
39 di_int r = fb.u.low.all;
fixxfti.c 35 int e = (fb.u.high.s.low & 0x00007FFF) - 16383;
38 ti_int s = -(si_int)((fb.u.high.s.low & 0x00008000) >> 15);
39 ti_int r = fb.u.low.all;
cmpdi2.c 33 if (x.s.low < y.s.low)
35 if (x.s.low > y.s.low)
  /external/stlport/src/
collate.cpp 32 string collate<char>::do_transform(const char* low, const char* high) const
33 { return string(low, high); }
35 long collate<char>::do_hash(const char* low, const char* high) const {
37 for ( ; low < high; ++low)
38 result = 5 * result + *low;
52 wstring collate<wchar_t>::do_transform(const wchar_t* low, const wchar_t* high) const
53 { return wstring(low, high); }
55 long collate<wchar_t>::do_hash(const wchar_t* low, const wchar_t* high) const {
57 for ( ; low < high; ++low
    [all...]
  /ndk/sources/cxx-stl/stlport/src/
collate.cpp 32 string collate<char>::do_transform(const char* low, const char* high) const
33 { return string(low, high); }
35 long collate<char>::do_hash(const char* low, const char* high) const {
37 for ( ; low < high; ++low)
38 result = 5 * result + *low;
52 wstring collate<wchar_t>::do_transform(const wchar_t* low, const wchar_t* high) const
53 { return wstring(low, high); }
55 long collate<wchar_t>::do_hash(const wchar_t* low, const wchar_t* high) const {
57 for ( ; low < high; ++low
    [all...]
  /frameworks/rs/driver/runtime/arch/
clamp.c 20 extern T __attribute__((overloadable)) clamp(T amount, T low, T high) { \
21 return amount < low ? low : (amount > high ? high : amount); \
40 extern T##2 __attribute__((overloadable)) clamp(T##2 amount, T##2 low, T##2 high) { \
42 r.x = amount.x < low.x ? low.x : (amount.x > high.x ? high.x : amount.x); \
43 r.y = amount.y < low.y ? low.y : (amount.y > high.y ? high.y : amount.y); \
47 extern T##3 __attribute__((overloadable)) clamp(T##3 amount, T##3 low, T##3 high) { \
49 r.x = amount.x < low.x ? low.x : (amount.x > high.x ? high.x : amount.x);
    [all...]
  /external/chromium_org/third_party/WebKit/Source/platform/
PODInterval.h 84 PODInterval(const T& low, const T& high)
85 : m_low(low)
93 PODInterval(const T& low, const T& high, const UserData data)
94 : m_low(low)
101 const T& low() const { return m_low; } function in class:WebCore::PODInterval
105 bool overlaps(const T& low, const T& high) const
107 if (this->high() < low)
109 if (high < this->low())
116 return overlaps(other.low(), other.high());
120 // comparison is performed on the low endpoints of the intervals
    [all...]
  /cts/tests/tests/media/src/android/media/cts/
CameraProfileTest.java 31 private void checkQuality(int low, int mid, int high) {
32 Log.v(TAG, "low = " + low + ", mid = " + mid + ", high = " + high);
33 assertTrue(low >= 0 && low <= 100);
36 assertTrue(low <= mid && mid <= high);
40 int low = CameraProfile.getJpegEncodingQualityParameter(CameraProfile.QUALITY_LOW); local
43 checkQuality(low, mid, high);
49 int low = CameraProfile.getJpegEncodingQualityParameter(id, CameraProfile.QUALITY_LOW); local
52 checkQuality(low, mid, high)
    [all...]
  /external/chromium_org/third_party/skia/src/gpu/
GrTBSearch.h 23 int low = 0; local
24 while (high > low) {
25 int index = (low + high) >> 1;
27 low = index + 1;
  /external/compiler-rt/lib/ppc/
floatditf.c 15 doublebits low = { .d = twop52 }; local
16 low.x |= a & UINT64_C(0x00000000ffffffff); /* 0x1.0p52 + low 32 bits of a. */
21 * high_addend and low.d, and we wish to return their sum
31 result.s.hi = high_addend + low.d;
32 result.s.lo = (high_addend - result.s.hi) + low.d;

Completed in 537 milliseconds

1 2 3 4 5 6 7 8 91011>>