| /external/smali/util/src/main/java/org/jf/util/ |
| D | LinearSearch.java | 49 int guess = initialGuess; in linearSearch() local
50 if (guess >= list.size()) { in linearSearch()
51 guess = list.size()-1; in linearSearch()
53 int comparison = comparator.compare(list.get(guess), key); in linearSearch()
55 return guess; in linearSearch()
58 guess++; in linearSearch()
59 while (guess < list.size()) { in linearSearch()
60 comparison = comparator.compare(list.get(guess), key); in linearSearch()
62 return guess; in linearSearch()
65 return -(guess+1); in linearSearch()
[all …]
|
| D | SparseIntArray.java | 246 int high = start + len, low = start - 1, guess; in binarySearch() local
249 guess = (high + low) / 2; in binarySearch()
251 if (a[guess] < key) in binarySearch()
252 low = guess; in binarySearch()
254 high = guess; in binarySearch()
|
| D | SparseArray.java | 343 int high = start + len, low = start - 1, guess; in binarySearch() local
346 guess = (high + low) / 2; in binarySearch()
348 if (a[guess] < key) in binarySearch()
349 low = guess; in binarySearch()
351 high = guess; in binarySearch()
|
| /external/srtp/crypto/replay/ |
| D | rdbx.c | 125 xtd_seq_num_t *guess, in index_guess() argument
136 uint32_t guess_roc = ((high32(*guess) << 16) | in index_guess()
137 (low32(*guess) >> 16)); in index_guess()
138 uint16_t guess_seq = (uint16_t) (low32(*guess)); in index_guess()
140 uint32_t guess_roc = (uint32_t)(*guess >> 16); in index_guess()
141 uint16_t guess_seq = (uint16_t) *guess; in index_guess()
175 *guess = make64(guess_roc >> 16, in index_guess()
178 *guess = (((uint64_t) guess_roc) << 16) | guess_seq; in index_guess()
330 xtd_seq_num_t *guess, in rdbx_estimate_index() argument
348 return index_guess(&rdbx->index, guess, s); in rdbx_estimate_index()
[all …]
|
| /external/chromium_org/third_party/libsrtp/srtp/crypto/replay/ |
| D | rdbx.c | 125 xtd_seq_num_t *guess, in index_guess() argument
136 uint32_t guess_roc = ((high32(*guess) << 16) | in index_guess()
137 (low32(*guess) >> 16)); in index_guess()
138 uint16_t guess_seq = (uint16_t) (low32(*guess)); in index_guess()
140 uint32_t guess_roc = (uint32_t)(*guess >> 16); in index_guess()
141 uint16_t guess_seq = (uint16_t) *guess; in index_guess()
166 *guess = make64(guess_roc >> 16, in index_guess()
169 *guess = (((uint64_t) guess_roc) << 16) | guess_seq; in index_guess()
321 xtd_seq_num_t *guess, in rdbx_estimate_index() argument
339 return index_guess(&rdbx->index, guess, s); in rdbx_estimate_index()
[all …]
|
| /external/chromium_org/third_party/WebKit/Source/wtf/dtoa/ |
| D | strtod.cc | 373 double guess) { in BignumStrtod() argument
374 if (guess == Double::Infinity()) { in BignumStrtod()
375 return guess; in BignumStrtod()
378 DiyFp upper_boundary = Double(guess).UpperBoundary(); in BignumStrtod()
404 return guess; in BignumStrtod()
406 return Double(guess).NextDouble(); in BignumStrtod()
407 } else if ((Double(guess).Significand() & 1) == 0) { in BignumStrtod()
409 return guess; in BignumStrtod()
411 return Double(guess).NextDouble(); in BignumStrtod()
437 double guess; in Strtod() local
[all …]
|
| /external/chromium_org/v8/src/ |
| D | strtod.cc | 354 double guess) { in BignumStrtod() argument
355 if (guess == V8_INFINITY) { in BignumStrtod()
356 return guess; in BignumStrtod()
359 DiyFp upper_boundary = Double(guess).UpperBoundary(); in BignumStrtod()
385 return guess; in BignumStrtod()
387 return Double(guess).NextDouble(); in BignumStrtod()
388 } else if ((Double(guess).Significand() & 1) == 0) { in BignumStrtod()
390 return guess; in BignumStrtod()
392 return Double(guess).NextDouble(); in BignumStrtod()
414 double guess; in Strtod() local
[all …]
|
| /external/chromium_org/third_party/icu/source/test/perf/collationperf/ |
| D | collperf.cpp | 499 int guess = -1; in doBinarySearch() local
502 if (newGuess == guess) in doBinarySearch()
504 guess = newGuess; in doBinarySearch()
506 r = (*pf)((gSortedLines[line])->name, (gSortedLines[guess])->name); in doBinarySearch()
512 hi = guess; in doBinarySearch()
514 lo = guess; in doBinarySearch()
537 int guess = -1; in doBinarySearch() local
540 if (newGuess == guess) in doBinarySearch()
542 guess = newGuess; in doBinarySearch()
546 … ri = strcmp((gSortedLines[line])->icuSortKey, (gSortedLines[guess])->icuSortKey); in doBinarySearch()
[all …]
|
| /external/icu/icu4c/source/test/perf/collationperf/ |
| D | collperf.cpp | 499 int guess = -1; in doBinarySearch() local
502 if (newGuess == guess) in doBinarySearch()
504 guess = newGuess; in doBinarySearch()
506 r = (*pf)((gSortedLines[line])->name, (gSortedLines[guess])->name); in doBinarySearch()
512 hi = guess; in doBinarySearch()
514 lo = guess; in doBinarySearch()
537 int guess = -1; in doBinarySearch() local
540 if (newGuess == guess) in doBinarySearch()
542 guess = newGuess; in doBinarySearch()
546 … ri = strcmp((gSortedLines[line])->icuSortKey, (gSortedLines[guess])->icuSortKey); in doBinarySearch()
[all …]
|
| /external/libvpx/libvpx/vp8/common/ |
| D | mfqe.c | 101 unsigned int guess; in int_sqrt() local
106 guess=0; in int_sqrt()
109 guess |= (1<<p); in int_sqrt()
110 if (x<guess*guess) in int_sqrt()
111 guess -= (1<<p); in int_sqrt()
115 return guess+(guess*guess+guess+1<=x); in int_sqrt()
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/ |
| D | mfqe.c | 101 unsigned int guess; in int_sqrt() local
106 guess=0; in int_sqrt()
109 guess |= (1<<p); in int_sqrt()
110 if (x<guess*guess) in int_sqrt()
111 guess -= (1<<p); in int_sqrt()
115 return guess+(guess*guess+guess+1<=x); in int_sqrt()
|
| /external/llvm/test/CodeGen/AArch64/ |
| D | atomic-ops.ll | 24 ; w0 below is a reasonable guess but could change: it certainly comes into the
44 ; w0 below is a reasonable guess but could change: it certainly comes into the
64 ; w0 below is a reasonable guess but could change: it certainly comes into the
84 ; x0 below is a reasonable guess but could change: it certainly comes into the
104 ; w0 below is a reasonable guess but could change: it certainly comes into the
124 ; w0 below is a reasonable guess but could change: it certainly comes into the
144 ; w0 below is a reasonable guess but could change: it certainly comes into the
164 ; x0 below is a reasonable guess but could change: it certainly comes into the
184 ; w0 below is a reasonable guess but could change: it certainly comes into the
204 ; w0 below is a reasonable guess but could change: it certainly comes into the
[all …]
|
| /external/ipsec-tools/src/racoon/ |
| D | TODO | 28 how to guess a reasonable phase 1 SA lifetime
29 (hardcoded default? guess from phase 2 lifetime?)
30 guess what kind of ID payload to use
31 guess what kind of authentication to be used
32 guess phase 1 DH group (for aggressive mode, we cannot negotiate it)
33 guess if we need phase 2 PFS or not (we cannot negotiate it. so
35 guess how we should negotiate lifetime
37 guess which mode to use for phase 1 negotiation (is main mode useful?
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| D | 2005-12-03-IncorrectPHIFold.ll | 36 %guess = alloca %struct.anon* ; <%struct.anon**> [#uses=7]
74 call void @init_num( %struct.anon** %guess )
85 store %struct.anon* %tmp42, %struct.anon** %guess
88 call void @int2num( %struct.anon** %guess, i32 10 )
99 %tmp53 = load %struct.anon** %guess ; <%struct.anon*> [#uses=1]
101 call void @bc_raise( %struct.anon* %tmp53, %struct.anon* %tmp54, %struct.anon** %guess, i32 %max )
116 %tmp88 = load %struct.anon** %guess ; <%struct.anon*> [#uses=1]
119 call void @free_num( %struct.anon** %guess )
|
| /external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
| D | ShadowSparseArray.java | 338 int high = start + len, low = start - 1, guess; in binarySearch() local
341 guess = (high + low) / 2; in binarySearch()
343 if (a[guess] < key) in binarySearch()
344 low = guess; in binarySearch()
346 high = guess; in binarySearch()
|
| /external/llvm/test/CodeGen/ARM/ |
| D | atomic-ops-v8.ll | 21 ; r0 below is a reasonable guess but could change: it certainly comes into the
44 ; r0 below is a reasonable guess but could change: it certainly comes into the
67 ; r0 below is a reasonable guess but could change: it certainly comes into the
90 ; r0, r1 below is a reasonable guess but could change: it certainly comes into the
117 ; r0 below is a reasonable guess but could change: it certainly comes into the
140 ; r0 below is a reasonable guess but could change: it certainly comes into the
163 ; r0 below is a reasonable guess but could change: it certainly comes into the
186 ; r0, r1 below is a reasonable guess but could change: it certainly comes into the
213 ; r0 below is a reasonable guess but could change: it certainly comes into the
236 ; r0 below is a reasonable guess but could change: it certainly comes into the
[all …]
|
| /external/chromium_org/third_party/libsrtp/srtp/crypto/include/ |
| D | rdbx.h | 120 xtd_seq_num_t *guess,
208 xtd_seq_num_t *guess,
|
| /external/srtp/crypto/include/ |
| D | rdbx.h | 85 xtd_seq_num_t *guess,
173 xtd_seq_num_t *guess,
|
| /external/llvm/cmake/modules/ |
| D | GetHostTriple.cmake | 2 # Invokes config.guess
18 set(config_guess ${LLVM_MAIN_SRC_DIR}/autoconf/config.guess)
|
| /external/chromium_org/chrome/browser/devtools/device/usb/ |
| D | android_rsa.cc | 130 uint64 guess = (from + to) / 2; in BnGuess() local
131 uint32* t = BnMul(b, static_cast<uint32>(guess)); in BnGuess()
135 return BnGuess(a, b, guess, to); in BnGuess()
137 return BnGuess(a, b, from, guess); in BnGuess()
138 return guess; in BnGuess()
|
| /external/chromium_org/net/tools/tld_cleanup/ |
| D | make_dafsa.py | 344 guess = 3 * len(children)
348 offset = current + guess
370 if len(buf) == guess:
372 guess = len(buf)
|
| /external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
| D | OutputFinisher.java | 498 private Dop findOpcodeForInsn(DalvInsn insn, Dop guess) { in findOpcodeForInsn() argument
505 while (guess != null) { in findOpcodeForInsn()
506 if (guess.getFormat().isCompatible(insn)) { in findOpcodeForInsn()
510 guess = Dops.getNextOrNull(guess, dexOptions); in findOpcodeForInsn()
513 return guess; in findOpcodeForInsn()
|
| /external/smali/util/src/test/java/org/jf/util/ |
| D | LinearSearchTest.java | 96 private void doTest(List<Integer> list, int key, int guess) { in doTest() argument
99 …ertEquals(expectedIndex, LinearSearch.linearSearch(list, Ordering.<Integer>natural(), key, guess)); in doTest()
|
| /external/cmockery/cmockery_0_1_2/packages/deb/ |
| D | rules | 65 cp -f /usr/share/misc/config.guess config.guess
|
| /external/chromium_org/third_party/tcmalloc/vendor/packages/deb/ |
| D | rules | 65 cp -f /usr/share/misc/config.guess config.guess
|