/cts/tests/tests/util/src/android/util/cts/ |
TimeUtilsTest.java | 39 TimeZone guess; local 42 guess = guessTimeZone(c, "us"); 43 assertEquals(name, guess.getID()); 46 guess = guessTimeZone(c, "us"); 47 assertEquals(name, guess.getID()); 60 TimeZone guess; local 63 guess = guessTimeZone(c, "us"); 64 assertEquals(name, guess.getID()); 76 TimeZone guess; local 79 guess = guessTimeZone(c, "us") 96 TimeZone guess; local [all...] |
/dalvik/libdex/ |
DexCatch.cpp | 59 int guess = (min + max) >> 1; local 60 const DexTry* pTry = &pTries[guess]; 64 max = guess - 1; 71 min = guess + 1;
|
DexDataMap.cpp | 104 u4 guess = offsets[guessIdx]; local 106 if (offset < guess) { 108 } else if (offset > guess) {
|
/external/chromium_org/third_party/libsrtp/srtp/crypto/replay/ |
rdbx.c | 76 * index_guess(&local, &guess, seq_from_packet). This function 77 * returns the difference of the guess and the local value. The local 78 * xtd_seq_num_t can be moved forward to the guess using the function 79 * index_advance(&guess, delta), where delta is the difference. 111 * index_guess(local, guess, s) 115 * (from a newly arrived packet), sets the contents of *guess to 116 * contain the best guess of the packet index to which s corresponds, 117 * and returns the difference between *guess and *local 125 xtd_seq_num_t *guess, 136 uint32_t guess_roc = ((high32(*guess) << 16) [all...] |
/external/chromium_org/third_party/libsrtp/srtp/crypto/include/ |
rdbx.h | 110 * rdbx_estimate_index(rdbx, guess, s) 113 * sets the contents of *guess to contain the best guess of the packet 115 * *guess and the locally stored synch info 120 xtd_seq_num_t *guess, 197 * index_guess(local, guess, s) 201 * arrived packet), sets the contents of *guess to contain the best 202 * guess of the packet index to which s corresponds, and returns the 203 * difference between *guess and *local 208 xtd_seq_num_t *guess, [all...] |
/external/chromium_org/third_party/WebKit/Source/wtf/dtoa/ |
strtod.cc | 365 // The variable guess should be a close guess that is either the correct double 373 double guess) { 374 if (guess == Double::Infinity()) { 375 return guess; 378 DiyFp upper_boundary = Double(guess).UpperBoundary(); 404 return guess; 406 return Double(guess).NextDouble(); 407 } else if ((Double(guess).Significand() & 1) == 0) { 409 return guess; [all...] |
/external/chromium_org/v8/src/ |
strtod.cc | 346 // The variable guess should be a close guess that is either the correct double 354 double guess) { 355 if (guess == V8_INFINITY) { 356 return guess; 359 DiyFp upper_boundary = Double(guess).UpperBoundary(); 385 return guess; 387 return Double(guess).NextDouble(); 388 } else if ((Double(guess).Significand() & 1) == 0) { 390 return guess; [all...] |
/external/chromium_org/third_party/tcmalloc/vendor/packages/deb/ |
rules | 14 # from having to guess our platform (since we know it already) 64 ifneq "$(wildcard /usr/share/misc/config.guess)" "" 65 cp -f /usr/share/misc/config.guess config.guess
|
/external/cmockery/cmockery_0_1_2/packages/deb/ |
rules | 14 # from having to guess our platform (since we know it already) 64 ifneq "$(wildcard /usr/share/misc/config.guess)" "" 65 cp -f /usr/share/misc/config.guess config.guess
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/ |
mfqe.c | 101 unsigned int guess; local 106 guess=0; 109 guess |= (1<<p); 110 if (x<guess*guess) 111 guess -= (1<<p); 114 /* choose between guess or guess+1 */ 115 return guess+(guess*guess+guess+1<=x) [all...] |
/external/libvpx/libvpx/vp8/common/ |
mfqe.c | 101 unsigned int guess; local 106 guess=0; 109 guess |= (1<<p); 110 if (x<guess*guess) 111 guess -= (1<<p); 114 /* choose between guess or guess+1 */ 115 return guess+(guess*guess+guess+1<=x) [all...] |
/external/chromium_org/third_party/icu/source/test/perf/collationperf/ |
collperf.cpp | 499 int guess = -1; local 502 if (newGuess == guess) 504 guess = newGuess; 506 r = (*pf)((gSortedLines[line])->name, (gSortedLines[guess])->name); 512 hi = guess; 514 lo = guess; 537 int guess = -1; local 540 if (newGuess == guess) 542 guess = newGuess; 546 ri = strcmp((gSortedLines[line])->icuSortKey, (gSortedLines[guess])->icuSortKey) 588 int guess = -1; local 639 int guess = -1; local [all...] |
/external/icu/icu4c/source/test/perf/collationperf/ |
collperf.cpp | 499 int guess = -1; local 502 if (newGuess == guess) 504 guess = newGuess; 506 r = (*pf)((gSortedLines[line])->name, (gSortedLines[guess])->name); 512 hi = guess; 514 lo = guess; 537 int guess = -1; local 540 if (newGuess == guess) 542 guess = newGuess; 546 ri = strcmp((gSortedLines[line])->icuSortKey, (gSortedLines[guess])->icuSortKey) 588 int guess = -1; local 639 int guess = -1; local [all...] |
/external/chromium_org/sdch/open-vcdiff/packages/deb/ |
rules | 14 # from having to guess our platform (since we know it already) 64 ifneq "$(wildcard /usr/share/misc/config.guess)" "" 65 cp -f /usr/share/misc/config.guess config.guess
|
/external/chromium_org/chrome/browser/devtools/device/usb/ |
android_rsa.cc | 130 uint64 guess = (from + to) / 2; 131 uint32* t = BnMul(b, static_cast<uint32>(guess)); 135 return BnGuess(a, b, guess, to); 137 return BnGuess(a, b, from, guess); 138 return guess;
|
/external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
OutputFinisher.java | 488 * opcode as a first "best guess" and then pessimizes from there 492 * @param guess {@code null-ok;} the current guess as to the best 498 private Dop findOpcodeForInsn(DalvInsn insn, Dop guess) { 500 * Note: The initial guess might be null, meaning that an 505 while (guess != null) { 506 if (guess.getFormat().isCompatible(insn)) { 510 guess = Dops.getNextOrNull(guess, dexOptions); 513 return guess; [all...] |
/dalvik/dexgen/src/com/android/dexgen/util/ |
IntList.java | 422 int guess = values[guessIdx]; local 424 if (value <= guess) {
|
/dalvik/dx/src/com/android/dx/util/ |
IntList.java | 423 int guess = values[guessIdx]; local 425 if (value <= guess) {
|
/external/dexmaker/src/dx/java/com/android/dx/util/ |
IntList.java | 423 int guess = values[guessIdx]; local 425 if (value <= guess) {
|
/external/eigen/Eigen/src/misc/ |
SparseSolve.h | 86 template<typename DecompositionType, typename Rhs, typename Guess> struct solve_retval_with_guess; 88 template<typename DecompositionType, typename Rhs, typename Guess> 89 struct traits<solve_retval_with_guess<DecompositionType, Rhs, Guess> > 100 template<typename DecompositionType, typename Rhs, typename Guess> struct solve_retval_with_guess 101 : public ReturnByValue<solve_retval_with_guess<DecompositionType, Rhs, Guess> > 105 solve_retval_with_guess(const DecompositionType& dec, const Rhs& rhs, const Guess& guess) 106 : m_dec(dec), m_rhs(rhs), m_guess(guess) 121 const typename Guess::Nested m_guess;
|
/external/chromium_org/net/tools/tld_cleanup/ |
make_dafsa.py | 344 guess = 3 * len(children) 348 offset = current + guess 370 if len(buf) == guess: 372 guess = len(buf)
|
/dalvik/dx/src/com/android/dx/dex/code/ |
OutputFinisher.java | 510 * opcode as a first "best guess" and then pessimizes from there 514 * @param guess {@code null-ok;} the current guess as to the best 520 private Dop findOpcodeForInsn(DalvInsn insn, Dop guess) { 522 * Note: The initial guess might be null, meaning that an 527 while (guess != null) { 528 if (guess.getFormat().isCompatible(insn)) { 534 guess.getOpcode() != Opcodes.CONST_STRING) { 539 guess = Dops.getNextOrNull(guess, dexOptions) [all...] |
/external/chromium_org/ui/gfx/ |
text_elider.cc | 240 size_t guess; 241 for (guess = (lo + hi) / 2; lo <= hi; guess = (lo + hi) / 2) { 246 const base::string16 cut = slicer.CutString(guess, insert_ellipsis); 251 hi = guess - 1; 252 // Move back on the loop terminating condition when the guess is too wide. 256 lo = guess + 1; 260 return slicer.CutString(guess, insert_ellipsis);
|
/external/chromium_org/chrome/common/extensions/docs/server2/ |
PRESUBMIT.py | 64 No? I guess this presubmit check doesn't work.
|
/external/dexmaker/src/main/java/com/google/dexmaker/ |
AppDataDirGuesser.java | 25 * Uses heuristics to guess the application's private data directory. 28 public File guess() { method in class:AppDataDirGuesser
|