| /external/chromium_org/third_party/openssl/openssl/crypto/ec/ |
| ec_oct.c | 60 * Binary polynomial ECC support in OpenSSL originally developed by
|
| ec2_smpl.c | 699 /* Wrapper to simple binary polynomial field multiplication implementation. */
706 /* Wrapper to simple binary polynomial field squaring implementation. */
713 /* Wrapper to simple binary polynomial field division implementation. */
|
| ec.h | 71 * The elliptic curve binary polynomial software is originally written by
307 * \param p BIGNUM with the polynomial defining the underlying field
317 * \param p BIGNUM for the polynomial defining the underlying field
368 * \param p BIGNUM with the polynomial defining the underlying field
[all...] |
| /external/chromium_org/third_party/opus/src/celt/ |
| mathops.h | 226 /* Atan approximation using a 4th order polynomial. Input is in Q15 format
|
| /external/compiler-rt/lib/ |
| divdf3.c | 80 // polynomial approximation: reciprocal = 3/4 + 1/sqrt(2) - b/2. This
|
| divsf3.c | 80 // polynomial approximation: reciprocal = 3/4 + 1/sqrt(2) - b/2. This
|
| /external/flac/include/FLAC/ |
| format.h | 269 FLAC__SUBFRAME_TYPE_FIXED = 2, /**< fixed polynomial prediction */
302 /**< The polynomial order. */
439 /**< CRC-8 (polynomial = x^8 + x^2 + x^1 + x^0, initialized with 0)
461 /**< CRC-16 (polynomial = x^16 + x^15 + x^2 + x^0, initialized with
[all...] |
| /external/openssl/crypto/ec/ |
| ec_cvt.c | 67 * The elliptic curve binary polynomial software is originally written by
|
| ec_oct.c | 60 * Binary polynomial ECC support in OpenSSL originally developed by
|
| ec2_smpl.c | 699 /* Wrapper to simple binary polynomial field multiplication implementation. */
706 /* Wrapper to simple binary polynomial field squaring implementation. */
713 /* Wrapper to simple binary polynomial field division implementation. */
|
| /external/webrtc/src/modules/audio_coding/codecs/isac/main/source/ |
| filter_functions.c | 165 /* Get LPC polynomial */
|
| /frameworks/native/libs/input/ |
| VelocityTracker.cpp | 392 * Solves a linear least squares problem to obtain a N degree polynomial that fits
400 * The output is a vector B with indices 0..n that describes a polynomial
409 * the polynomial. It is a good idea to choose weights that diminish the importance
592 // Calculate a least squares polynomial fit.
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/math/tools/ |
| config.hpp | 182 // The maximum order of polynomial that will be evaluated
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/internal/ |
| HermiteInterpolator.java | 141 * with the slope of the tangent m1 at p1 and m2 at p2, the polynomial of cubic Hermite curve
|
| /external/chromium_org/third_party/openssl/openssl/crypto/modes/asm/ |
| ghash-armv4.pl | 35 # Add NEON implementation featuring polynomial multiplication, i.e. no
330 vmov.i32 $mod,#0xe1 @ our irreducible polynomial
353 vmov.i32 $mod,#0xe1 @ our irreducible polynomial
|
| /external/openssl/crypto/modes/asm/ |
| ghash-armv4.pl | 35 # Add NEON implementation featuring polynomial multiplication, i.e. no
330 vmov.i32 $mod,#0xe1 @ our irreducible polynomial
353 vmov.i32 $mod,#0xe1 @ our irreducible polynomial
|
| /frameworks/av/media/libstagefright/codecs/amrnb/common/src/ |
| lsp_az.cpp | 137 f = pointer to the polynomial of type Word32 to be generated
143 buffer pointed to by f contains the polynomial generated
160 This function finds the polynomial F1(z) or F2(z) from the LSPs. If the LSP
309 f = pointer to the polynomial of type Word32 to be generated
315 buffer pointed to by f contains the polynomial generated
|
| /external/aac/libFDK/src/ |
| fixpoint_math.cpp | 131 description: Delivers the Logarithm Dualis ld(op)/LD_DATA_SCALING with polynomial approximation.
664 /* Evaluate taylor polynomial which approximates 2^x */
679 /* "+ 1" compensates fMultAddDiv2() of the polynomial evaluation above. */
|
| /external/ceres-solver/internal/ceres/ |
| line_search.h | 76 // Degree of the polynomial used to approximate the objective
|
| /external/chromium_org/third_party/openssl/openssl/crypto/bn/asm/ |
| s390x-gf2m.pl | 12 # The module implements bn_GF2m_mul_2x2 polynomial multiplication used
|
| /external/chromium_org/third_party/openssl/openssl/crypto/bn/ |
| bn_gf2m.c | 129 * result is a polynomial r with degree < 2 * BN_BITS - 1
207 * result is a polynomial r with degree < 4 * BN_BITS2 - 1
1055 /* Convert the bit-string representation of a polynomial
1094 /* Convert the coefficient array representation of a polynomial to a
|
| /external/chromium_org/third_party/openssl/openssl/include/openssl/ |
| ec.h | 71 * The elliptic curve binary polynomial software is originally written by
307 * \param p BIGNUM with the polynomial defining the underlying field
317 * \param p BIGNUM for the polynomial defining the underlying field
368 * \param p BIGNUM with the polynomial defining the underlying field
[all...] |
| /external/eigen/bench/ |
| eig33.cpp | 75 // Compute the eigenvalues by solving for the roots of the polynomial.
|
| /external/openssl/crypto/bn/asm/ |
| s390x-gf2m.pl | 12 # The module implements bn_GF2m_mul_2x2 polynomial multiplication used
|
| /external/openssl/crypto/bn/ |
| bn_gf2m.c | 129 * result is a polynomial r with degree < 2 * BN_BITS - 1
207 * result is a polynomial r with degree < 4 * BN_BITS2 - 1
1055 /* Convert the bit-string representation of a polynomial
1094 /* Convert the coefficient array representation of a polynomial to a
|
