/frameworks/av/media/libstagefright/codecs/amrnb/enc/src/ |
qgain475.cpp | 551 cod_gain_exp = optimum codebook gain (exponent)(Word16) 552 cod_gain_frac = optimum codebook gain (fraction) (Word16) 570 This module uses the optimum codebook gain and updates the "unquantized" 591 Word16 cod_gain_exp, // i : optimum codebook gain (exponent), Q0 592 Word16 cod_gain_frac // i : optimum codebook gain (fraction), Q15 599 // calculate prediction error factor (given optimum CB gain gcu): 697 Word16 cod_gain_exp, /* i : optimum codebook gain (exponent), Q0 */ 698 Word16 cod_gain_frac, /* i : optimum codebook gain (fraction), Q15 */ 709 /* calculate prediction error factor (given optimum CB gain gcu): [all...] |
gain_q.cpp | 550 /* store optimum codebook gain (Q1) */ 569 /* calculate optimum codebook gain and update
|
/frameworks/base/core/java/android/net/ |
LinkSocket.java | 243 * @deprecated LinkSocket will automatically pick the optimum interface
|
/external/chromium_org/third_party/freetype/src/cff/ |
cf2hints.c | 61 CF2_Fixed moveUp; /* adjustment to optimum position */ 452 move = ( -moveDown < moveUp ) ? moveDown : moveUp; /* optimum */ 465 saveEdge = moveUp < -moveDown; /* true if non-optimum move */ [all...] |
/external/freetype/src/cff/ |
cf2hints.c | 61 CF2_Fixed moveUp; /* adjustment to optimum position */ 452 move = ( -moveDown < moveUp ) ? moveDown : moveUp; /* optimum */ 465 saveEdge = moveUp < -moveDown; /* true if non-optimum move */ [all...] |
/external/ceres-solver/internal/ceres/ |
trust_region_minimizer_test.cc | 260 // not find the optimum. This should not affect the correctness of
|
dogleg_strategy.cc | 284 // The optimum lies on the boundary of the trust region. The above problem
|
/external/chromium/third_party/libevent/compat/sys/ |
queue.h | 48 * macro for this purpose for optimum efficiency. A singly-linked list may
|
/external/chromium_org/chrome/browser/resources/web_dev_style/ |
css_checker.py | 186 'meter-optimum-value',
|
/external/chromium_org/third_party/libevent/compat/sys/ |
queue.h | 48 * macro for this purpose for optimum efficiency. A singly-linked list may
|
/system/extras/tests/memtest/ |
bandwidth.cpp | 239 printf("Calculating optimum run time...\n");
|
/external/grub/stage2/ |
gunzip.c | 424 than five bits, flat. The optimum values for speed end up being 426 The optimum values may differ though from machine to machine, and [all...] |
/bionic/libc/include/sys/ |
queue.h | 44 * should use the explicit macro for this purpose for optimum
|
/development/ndk/platforms/android-3/include/sys/ |
queue.h | 44 * should use the explicit macro for this purpose for optimum
|
/external/chromium_org/third_party/skia/src/opts/ |
SkBitmapProcState_opts_SSSE3.cpp | 369 // optimum location only once per loop, instead of twice per loop.
|
/external/chromium_org/third_party/sqlite/src/test/ |
fts3near.test | 420 oomphs openly ophthalmoscope opposites optimum orangutans
|
/external/clang/lib/StaticAnalyzer/Core/ |
ProgramState.cpp | 99 // for optimum performance.
|
/external/grub/netboot/ |
natsemi.c | 460 /* On page 78 of the spec, they recommend some settings for "optimum
|
/external/libogg/doc/ |
ogg-multiplex.html | 195 discontinuous data arrives in time) and no more, resulting in optimum
|
/external/openssh/openbsd-compat/ |
sys-queue.h | 133 * macro for this purpose for optimum efficiency. A singly-linked list may
|
/external/skia/src/opts/ |
SkBitmapProcState_opts_SSSE3.cpp | 369 // optimum location only once per loop, instead of twice per loop.
|
/external/valgrind/main/docs/lib/ |
vg-fo.xsl | 74 <xsl:attribute name="space-before.optimum">
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/sys/ |
queue.h | 44 * should use the explicit macro for this purpose for optimum
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/sys/ |
queue.h | 44 * should use the explicit macro for this purpose for optimum
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/sys/ |
queue.h | 44 * should use the explicit macro for this purpose for optimum
|