/external/opencore/codecs_v2/audio/gsm_amr/amr_nb/common/src/ |
az_lsp.cpp | 359 The roots of F1(z) and F2(z) are found using Chebyshev polynomial evaluation. 364 If less than 10 roots are found, the LSPs from the past frame are used. 382 Word16 old_lsp[] // (i) : old lsp[] (in case not found 10 roots) (M) 524 // Check if M roots found 563 Word16 old_lsp[], /* (i) : old lsp[] (in case not found 10 roots) (M) */ 720 /* Check if M roots found */
|
/frameworks/base/media/libstagefright/codecs/amrnb/common/src/ |
az_lsp.cpp | 359 The roots of F1(z) and F2(z) are found using Chebyshev polynomial evaluation. 364 If less than 10 roots are found, the LSPs from the past frame are used. 382 Word16 old_lsp[] // (i) : old lsp[] (in case not found 10 roots) (M) 524 // Check if M roots found 563 Word16 old_lsp[], /* (i) : old lsp[] (in case not found 10 roots) (M) */ 720 /* Check if M roots found */
|
/external/freetype/src/base/ |
ftbbox.c | 88 /* doesn't need square roots. */ 198 /* don't want to use square roots and extra accuracy. */
|
/bootable/recovery/ |
install.c | 33 #include "roots.h"
|
roots.c | 27 #include "roots.h"
|
/dalvik/dx/src/com/android/dx/ssa/ |
Dominators.java | 181 * numbering the dfs tree roots.
|
/dalvik/hit/src/com/android/hit/ |
Queries.java | 56 * the roots.
|
/dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/digests/ |
SHA224Digest.java | 277 * cube roots of the first sixty-four prime numbers)
|
LongDigest.java | 351 * cube roots of the first sixty-four prime numbers)
|
/dalvik/libcore/xml/src/main/java/org/apache/xalan/transformer/ |
KeyTable.java | 49 * whose Document roots match this key.
|
/external/skia/src/core/ |
SkStrokerPriv.cpp | 200 /* Before we enter the world of square-roots and divides,
|
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
ExpandableDictionary.java | 231 * @param roots node whose children have to be search for matches 244 protected void getWordsRec(NodeArray roots, final WordComposer codes, final char[] word, 247 final int count = roots.length; 261 final Node node = roots.data[i];
|
/external/speex/libspeex/ |
sb_celp.c | 307 int i, roots, sub; local 411 roots=lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA1, stack); 412 if (roots!=st->lpcSize) 414 roots = lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA2, stack); 415 if (roots!=st->lpcSize) { [all...] |
/external/v8/src/ |
mark-compact.cc | 201 // overflow) traversal of the graph of objects reachable from the roots. It 335 // Visitor class for marking heap roots. 542 // Mark the heap roots including global variables, stack variables, 695 // The objects reachable from the roots are marked, yet unreachable 701 // The objects reachable from the roots or object groups are marked, 716 // weak roots. [all...] |
mark-compact.h | 171 // Marking operations for objects reachable from roots. 199 // Mark the heap roots and all objects reachable from them.
|
/external/webkit/JavaScriptCore/runtime/ |
Collector.cpp | 1113 // Mark stack roots. [all...] |
/build/tools/releasetools/ |
amend_generator.py | 114 # no-op; amend uses it's 'roots' system to automatically mount
|
/dalvik/libcore/json/src/main/java/org/json/ |
JSONStringer.java | 176 throw new JSONException("Nesting problem: multiple top-level roots");
|
/device/htc/common/updater/ |
bootloader.c | 20 #include "roots.h"
|
/external/openssl/crypto/bn/ |
expspeed.c | 68 * modular inverse, or modular square roots */
|
/external/webkit/WebKitTools/Scripts/webkitpy/layout_tests/port/ |
apache_http_server.py | 129 Cygwin root paths to what it thinks the correct roots are. So paths
|
http_server.py | 246 help='Absolute path to DocumentRoot (overrides layout test roots)')
|
websocket_server.py | 267 '(overrides layout test roots)')
|
/external/qemu/distrib/sdl-1.2.12/src/hermes/ |
COPYING.LIB | 173 (For example, a function in a library to compute square roots has 178 root function must still compute square roots.)
|
/external/v8/src/arm/ |
macro-assembler-arm.h | 47 const Register roots = { 10 }; // Roots array pointer. member in namespace:v8::internal
|