/external/elfutils/libdw/ |
D | cfi.c | 74 Dwarf_Frame *bigger = realloc (*pfs, size); in enough_registers() local 75 if (unlikely (bigger == NULL)) in enough_registers() 83 memset (bigger->regs + bigger->nregs, 0, in enough_registers() 84 (reg + 1 - bigger->nregs) * sizeof bigger->regs[0]); in enough_registers() 85 bigger->nregs = reg + 1; in enough_registers() 86 *pfs = bigger; in enough_registers()
|
/external/protobuf/src/google/protobuf/stubs/ |
D | bytestream.cc | 123 char* bigger = new char[new_capacity]; in Expand() local 124 memcpy(bigger, buf_, size_); in Expand() 126 buf_ = bigger; in Expand()
|
/external/antlr/tool/src/main/java/org/antlr/misc/ |
D | IntervalSet.java | 115 Interval bigger = addition.union(r); in add() local 116 iter.set(bigger); in add() 121 if ( !bigger.adjacent(next) && bigger.disjoint(next) ) { in add() 128 iter.set(bigger.union(next)); // set to 3 merged ones in add()
|
/external/skqp/src/codec/ |
D | SkAndroidCodec.cpp | 281 auto bigger = this->getSampledDimensions(sampleSize - 1); in computeSampleSize() local 282 if (bigger == *desiredSize || !smaller_than(bigger, *desiredSize)) { in computeSampleSize() 283 *desiredSize = bigger; in computeSampleSize()
|
/external/skia/src/codec/ |
D | SkAndroidCodec.cpp | 277 auto bigger = this->getSampledDimensions(sampleSize - 1); in computeSampleSize() local 278 if (bigger == *desiredSize || !smaller_than(bigger, *desiredSize)) { in computeSampleSize() 279 *desiredSize = bigger; in computeSampleSize()
|
/external/curl/tests/data/ |
D | test1089 | 31 bigger monster 81 bigger monster
|
D | test1090 | 33 bigger 88 bigger monster
|
/external/webrtc/webrtc/modules/audio_processing/aec/ |
D | aec_core_neon.c | 152 const uint32x4_t bigger = vcgtq_f32(absEf, kThresh); in ScaleErrorSignalNEON() local 157 uint32x4_t ef_re_u32 = vandq_u32(vmvnq_u32(bigger), in ScaleErrorSignalNEON() 159 uint32x4_t ef_im_u32 = vandq_u32(vmvnq_u32(bigger), in ScaleErrorSignalNEON() 161 ef_re_if = vandq_u32(bigger, ef_re_if); in ScaleErrorSignalNEON() 162 ef_im_if = vandq_u32(bigger, ef_im_if); in ScaleErrorSignalNEON() 397 const uint32x4_t bigger = vcgtq_f32(vec_hNl, vec_hNlFb); in OverdriveAndSuppressNEON() local 403 const uint32x4_t vec_if0 = vandq_u32(vmvnq_u32(bigger), in OverdriveAndSuppressNEON() 408 vandq_u32(bigger, vreinterpretq_u32_f32(vec_one_weightCurve_add)); in OverdriveAndSuppressNEON()
|
D | aec_core_sse2.c | 108 const __m128 bigger = _mm_cmpgt_ps(absEf, kThresh); in ScaleErrorSignalSSE2() local 113 ef_re_if = _mm_and_ps(bigger, ef_re_if); in ScaleErrorSignalSSE2() 114 ef_im_if = _mm_and_ps(bigger, ef_im_if); in ScaleErrorSignalSSE2() 115 ef_re = _mm_andnot_ps(bigger, ef_re); in ScaleErrorSignalSSE2() 116 ef_im = _mm_andnot_ps(bigger, ef_im); in ScaleErrorSignalSSE2() 383 const __m128 bigger = _mm_cmpgt_ps(vec_hNl, vec_hNlFb); in OverdriveAndSuppressSSE2() local 388 const __m128 vec_if0 = _mm_andnot_ps(bigger, vec_hNl); in OverdriveAndSuppressSSE2() 390 bigger, _mm_add_ps(vec_weightCurve_hNlFb, vec_one_weightCurve_hNl)); in OverdriveAndSuppressSSE2()
|
/external/brotli/c/tools/ |
D | brotli.md | 59 compression level (0-9); bigger values cause denser, but slower compression 77 compression level (0-11); bigger values cause denser, but slower compression 84 `(2**NUM - 16)`; 0 lets compressor decide over the optimal value; bigger
|
/external/python/cpython2/Modules/ |
D | _randommodule.c | 291 unsigned long bigger = keymax << 1; in random_seed() local 292 if ((bigger >> 1) != keymax) { in random_seed() 297 bigger * sizeof(*key)); in random_seed() 300 keymax = bigger; in random_seed()
|
/external/skia/src/gpu/effects/ |
D | GrRectBlurEffect.fp | 27 // in OpenGL ES, mediump floats have a minimum range of 2^14. If we have coordinates bigger than 30 // minimum range but the actual range can be bigger, we might end up switching to highp sooner than 31 // strictly necessary, but most devices that have a bigger range for mediump also have mediump being
|
/external/skqp/src/gpu/effects/ |
D | GrRectBlurEffect.fp | 26 // in OpenGL ES, mediump floats have a minimum range of 2^14. If we have coordinates bigger than 29 // minimum range but the actual range can be bigger, we might end up switching to highp sooner than 30 // strictly necessary, but most devices that have a bigger range for mediump also have mediump being
|
/external/elfutils/libelf/ |
D | elf_compress.c | 180 void *bigger = realloc (out_buf, out_size + block); in __libelf_compress() local 181 if (bigger == NULL) in __libelf_compress() 186 out_buf = bigger; in __libelf_compress()
|
/external/skqp/site/dev/design/conical/ |
D | index.md | 37 there are multiple (at most 2) solutions of $t$, choose the bigger one. 56 smaller one (so $t$ could be the bigger one). 67 find the bigger one if $1 - f > 0$, and smaller one if $1 - f < 0$, so the corresponding $t$ is 68 always the bigger one (note that $f \neq 1$, otherwise we'll swap $C_0, r_0$ with $C_1, r_1$). 90 2. we still need to handle cases of choosing the bigger/smaller $x_t$; 113 positive $x_t > 0$ and bigger $t$, we have our final algorithm: 137 In step 7, we try to select either the smaller or bigger $\hat x_t$ based on whether the final $t$
|
/external/skia/site/dev/design/conical/ |
D | index.md | 37 there are multiple (at most 2) solutions of $t$, choose the bigger one. 56 smaller one (so $t$ could be the bigger one). 67 find the bigger one if $1 - f > 0$, and smaller one if $1 - f < 0$, so the corresponding $t$ is 68 always the bigger one (note that $f \neq 1$, otherwise we'll swap $C_0, r_0$ with $C_1, r_1$). 90 2. we still need to handle cases of choosing the bigger/smaller $x_t$; 113 positive $x_t > 0$ and bigger $t$, we have our final algorithm: 137 In step 7, we try to select either the smaller or bigger $\hat x_t$ based on whether the final $t$
|
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
D | ListsTest.java | 114 ArrayList<Integer> bigger = Lists.newArrayListWithCapacity(256); in testNewArrayListWithCapacity() local 115 assertEquals(Collections.emptyList(), bigger); in testNewArrayListWithCapacity() local 130 ArrayList<Integer> bigger = Lists.newArrayListWithExpectedSize(256); in testNewArrayListWithExpectedSize() local 131 assertEquals(Collections.emptyList(), bigger); in testNewArrayListWithExpectedSize() local
|
/external/autotest/server/site_tests/platform_TotalMemory/ |
D | control | 23 or free memory diff is bigger than 1/4 of total memory.
|
/external/llvm/test/Transforms/InstCombine/ |
D | bit-tracking.ll | 15 ; Finally, a bigger case where we chain things together. This corresponds to
|
/external/swiftshader/third_party/LLVM/test/CodeGen/XCore/ |
D | bigstructret.ll | 22 ; Structs bigger than 4 words are returned via a hidden hidden sret-parameter
|
/external/swiftshader/third_party/LLVM/test/Transforms/InstCombine/ |
D | bit-tracking.ll | 15 ; Finally, a bigger case where we chain things together. This corresponds to
|
/external/tensorflow/tensorflow/lite/tools/pip_package/ |
D | README.md | 27 bigger host will be supported.
|
/external/tensorflow/tensorflow/contrib/eager/python/examples/workshop/ |
D | 1_basic.ipynb | 133 " print(\"T is bigger\")\n", 142 "T is bigger\n"
|
/external/tensorflow/tensorflow/lite/schema/ |
D | BUILD | 69 # Generic schema for inference on device (but with reflections makes bigger).
|
/external/swiftshader/third_party/LLVM/test/CodeGen/X86/ |
D | 2009-08-06-inlineasm.ll | 9 ; so I've disabled it with a bigger stick.
|