HomeSort by relevance Sort by last modified time
    Searched refs:hi (Results 251 - 275 of 722) sorted by null

<<11121314151617181920>>

  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
target.h 110 const char *hi; member in struct:asm_int_op
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
target.h 110 const char *hi; member in struct:asm_int_op
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
target.h 110 const char *hi; member in struct:asm_int_op
  /system/core/include/corkscrew/
ptrace.h 73 uint64_t hi; member in struct:pt_regs_mips
  /external/chromium_org/native_client_sdk/src/tests/nacl_io_test/
fake_pepper_interface_url_loader.cc 146 unsigned hi; local
147 if (sscanf(range.c_str(), "bytes=%u-%u", &lo, &hi) != 2) {
160 // Clamp the hi value to the content length.
161 if (hi >= content_length)
162 hi = content_length - 1;
164 if (lo > hi) {
173 loader->read_end = hi + 1;
177 ss << "Content-Range: " << lo << "-" << hi << "/" << content_length << "\n";
  /external/chromium_org/third_party/freetype/src/base/
md5.c 207 ctx->hi = 0;
217 ctx->hi++;
218 ctx->hi += size >> 29;
268 ctx->buffer[60] = ctx->hi;
269 ctx->buffer[61] = ctx->hi >> 8;
270 ctx->buffer[62] = ctx->hi >> 16;
271 ctx->buffer[63] = ctx->hi >> 24;
fttrigon.c 83 FT_UInt32 v1, v2, k1, k2, hi, lo1, lo2, lo3; local
95 hi = k1 * v1;
102 hi += lo1 >> 16;
104 hi += (FT_UInt32)0x10000UL;
106 val = (FT_Fixed)hi;
  /external/chromium_org/third_party/skia/src/core/
SkMath.cpp 83 int32_t hi = A + (B >> 16) + (lo < C); local
86 hi = -hi - Sk32ToBool(lo);
92 SkASSERT(((int32_t)lo >> 31) == hi);
96 return hi >> (shift - 32);
99 int32_t tmp = hi >> shift;
102 // we want (hi << (32 - shift)) | (lo >> shift) but rounded
104 return ((hi << (32 - shift)) | (lo >> shift)) + roundBit;
163 uint32_t Hi = A + (B >>16) + (Lo < C);
165 SkASSERT((Hi >> 29) == 0); // else overflo
    [all...]
  /external/freetype/src/base/
md5.c 207 ctx->hi = 0;
217 ctx->hi++;
218 ctx->hi += size >> 29;
268 ctx->buffer[60] = ctx->hi;
269 ctx->buffer[61] = ctx->hi >> 8;
270 ctx->buffer[62] = ctx->hi >> 16;
271 ctx->buffer[63] = ctx->hi >> 24;
fttrigon.c 83 FT_UInt32 v1, v2, k1, k2, hi, lo1, lo2, lo3; local
95 hi = k1 * v1;
102 hi += lo1 >> 16;
104 hi += (FT_UInt32)0x10000UL;
106 val = (FT_Fixed)hi;
  /external/llvm/lib/Support/
MD5.cpp 183 : a(0x67452301), b(0xefcdab89), c(0x98badcfe), d(0x10325476), hi(0), lo(0) {
195 hi++;
196 hi += Size >> 29;
255 buffer[60] = hi;
256 buffer[61] = hi >> 8;
257 buffer[62] = hi >> 16;
258 buffer[63] = hi >> 24;
  /external/skia/src/core/
SkMath.cpp 83 int32_t hi = A + (B >> 16) + (lo < C); local
86 hi = -hi - Sk32ToBool(lo);
92 SkASSERT(((int32_t)lo >> 31) == hi);
96 return hi >> (shift - 32);
99 int32_t tmp = hi >> shift;
102 // we want (hi << (32 - shift)) | (lo >> shift) but rounded
104 return ((hi << (32 - shift)) | (lo >> shift)) + roundBit;
163 uint32_t Hi = A + (B >>16) + (Lo < C);
165 SkASSERT((Hi >> 29) == 0); // else overflo
    [all...]
  /external/chromium_org/third_party/mozilla/
NSString+Utils.mm 281 int hi = [self length];
287 while (hi >= lo) {
288 mid = (hi + lo) / 2;
297 hi = mid - 1;
311 [self truncateTo:hi at:truncationType];
  /external/chromium_org/v8/test/mjsunit/
array-store-and-grow.js 221 f(a, 1, "hi"); // DOUBLE packed array -> tagged packed grow
229 f(new Array("hi"), 1, 3);
243 f(a, 0, "hi"); // DOUBLE packed array -> tagged packed grow
250 f(new Array("hi"), 0, 3);
253 f(new Array("hi"), 1, 3);
  /external/stlport/src/
num_get_float.cpp 42 uint32_t hi; member in struct:_ll::__anon29337
46 uint32_t hi;
302 int hi, lo; /* offsets in power of ten table */ local
304 hi = (min) (exp_hi, num_hi); /* only a few large powers of 10 */
305 exp_hi -= hi; /* could iterate in extreme case */
306 hi += thi-1;
307 _Stl_mult64(p, _Stl_tenpow[hi], prodhi, prodlo);
309 bexp += _Stl_twoexp[hi] - norm;
392 if (bexp <= -1022) { /* HI denorm or underflow */
579 v.ieee.mantissa0 = vv.i32.hi;
    [all...]
  /ndk/sources/cxx-stl/stlport/src/
num_get_float.cpp 42 uint32_t hi; member in struct:_ll::__anon35862
46 uint32_t hi;
302 int hi, lo; /* offsets in power of ten table */ local
304 hi = (min) (exp_hi, num_hi); /* only a few large powers of 10 */
305 exp_hi -= hi; /* could iterate in extreme case */
306 hi += thi-1;
307 _Stl_mult64(p, _Stl_tenpow[hi], prodhi, prodlo);
309 bexp += _Stl_twoexp[hi] - norm;
392 if (bexp <= -1022) { /* HI denorm or underflow */
579 v.ieee.mantissa0 = vv.i32.hi;
    [all...]
  /external/chromium/chrome/browser/safe_browsing/
prefix_set.cc 286 size_t hi = index_.size(); local
291 while (hi - lo > 1) {
292 const size_t i = (lo + hi) / 2;
295 DCHECK_LT(i, hi); // Always making progress.
296 hi = i;
  /external/chromium_org/net/tools/flip_server/
spdy_interface.cc 414 for (BalsaHeaders::const_header_lines_iterator hi =
416 hi != headers.header_lines_end();
417 ++hi) {
420 if (!hi->first.length() || !hi->second.length())
424 std::string key = hi->first.as_string();
428 dest[key] = hi->second.as_string();
431 std::string(hi->second.data(), hi->second.size()));
  /external/chromium_org/third_party/icu/source/i18n/
nfrs.cpp 422 int32_t hi = rules.size(); local
423 if (hi > 0) {
426 while (lo < hi) {
427 int32_t mid = (lo + hi) / 2;
432 hi = mid;
438 if (hi == 0) { // bad rule set, minimum base > 0
442 NFRule *result = rules[hi - 1];
450 if (hi == 1) { // bad rule set, no prior rule to rollback to from this base
453 result = rules[hi - 2];
  /external/icu4c/i18n/
nfrs.cpp 447 int32_t hi = rules.size(); local
448 if (hi > 0) {
451 while (lo < hi) {
452 int32_t mid = (lo + hi) / 2;
457 hi = mid;
463 if (hi == 0) { // bad rule set, minimum base > 0
467 NFRule *result = rules[hi - 1];
475 if (hi == 1) { // bad rule set, no prior rule to rollback to from this base
478 result = rules[hi - 2];
  /external/valgrind/main/VEX/priv/
guest_generic_x87.c 892 UInt ni, hi; local
898 for (hi = 0; hi < 16; hi++) {
902 UInt i = ni + hi;
906 boolRes |= (m << hi);
907 if ((validL & (1 << hi)) == 0)
1142 UInt ni, hi; local
    [all...]
  /external/chromium_org/third_party/libxml/src/
uri.c 1066 int hi = val / 0x10, lo = val % 0x10; local
1068 ret[len++] = hi + (hi > 9? 'A'-10 : '0');
1110 int hi = val / 0x10, lo = val % 0x10; local
1112 ret[len++] = hi + (hi > 9? 'A'-10 : '0');
1197 int hi = val / 0x10, lo = val % 0x10; local
1199 ret[len++] = hi + (hi > 9? 'A'-10 : '0');
1265 int hi = val / 0x10, lo = val % 0x10 local
1334 int hi = val \/ 0x10, lo = val % 0x10; local
1374 int hi = val \/ 0x10, lo = val % 0x10; local
    [all...]
  /external/libxml2/
uri.c 1066 int hi = val / 0x10, lo = val % 0x10; local
1068 ret[len++] = hi + (hi > 9? 'A'-10 : '0');
1110 int hi = val / 0x10, lo = val % 0x10; local
1112 ret[len++] = hi + (hi > 9? 'A'-10 : '0');
1197 int hi = val / 0x10, lo = val % 0x10; local
1199 ret[len++] = hi + (hi > 9? 'A'-10 : '0');
1265 int hi = val / 0x10, lo = val % 0x10 local
1334 int hi = val \/ 0x10, lo = val % 0x10; local
1374 int hi = val \/ 0x10, lo = val % 0x10; local
    [all...]
  /external/guava/guava-tests/test/com/google/common/primitives/
CharsTest.java 241 for (int hi = 0; hi < 256; hi++) {
243 char result = Chars.fromByteArray(new byte[]{(byte) hi, (byte) lo});
244 assertEquals(String.format("hi=%s, lo=%s, expected=%s, result=%s",
245 hi, lo, (int) c, (int) result), c, result);
248 assertEquals((byte) hi, bytes[0]);
  /external/libvorbis/lib/
codebook.c 285 long lo,hi; local
292 hi=book->used_entries-(entry&0x7fff);
299 hi=book->used_entries;
312 while(hi-lo>1){
313 long p=(hi-lo)>>1;
316 hi-=p&(-test);

Completed in 493 milliseconds

<<11121314151617181920>>