| /external/chromium_org/third_party/icu/source/i18n/ |
| digitlst.h | 96 * 10 exponent associated with it. The value represented by a DigitList
99 * decimal point, by 10^exponent.
114 * digitList exponent = decNumber exponent + digit count
174 * inefficient, and the interaction with the exponent value is confusing.
286 /** Reduce, or normalize. Removes trailing zeroes, adjusts exponent appropriately. */
289 /** Remove trailing fraction zeros, adjust exponent accordingly. */
361 * don't allow denormalized numbers because our exponent is effectively of
|
| /external/chromium_org/v8/src/ |
| bignum-dtoa.h | 43 // Return a fixed number of digits, no matter what the exponent is.
56 // (together with the correct exponent) then reading this number will give
|
| /external/compiler-rt/lib/ |
| floatdisf.c | 36 int e = sd - 1; /* exponent */
77 ((e + 127) << 23) | /* exponent */
|
| floattidf.c | 38 int e = sd - 1; /* exponent */
79 ((e + 1023) << 20) | /* exponent */
|
| floattisf.c | 38 int e = sd - 1; /* exponent */
79 ((e + 127) << 23) | /* exponent */
|
| floattixf.c | 40 int e = sd - 1; /* exponent */
81 (e + 16383); /* exponent */
|
| floatundisf.c | 34 int e = sd - 1; /* 8 exponent */
74 fb.u = ((e + 127) << 23) | /* exponent */
|
| floatuntidf.c | 36 int e = sd - 1; /* exponent */
76 fb.u.s.high = ((e + 1023) << 20) | /* exponent */
|
| floatuntisf.c | 36 int e = sd - 1; /* exponent */
76 fb.u = ((e + 127) << 23) | /* exponent */
|
| floatuntixf.c | 38 int e = sd - 1; /* exponent */
78 fb.u.high.s.low = (e + 16383); /* exponent */
|
| /external/compiler-rt/lib/ubsan/lit_tests/Integer/ |
| shift.cpp | 28 // CHECK-TOO_LOW: shift.cpp:29:5: runtime error: shift exponent -3 is negative
34 // CHECK-TOO_HIGH: shift.cpp:35:5: runtime error: shift exponent 32 is too large for 32-bit type 'int'
|
| /external/dropbear/libtomcrypt/notes/ |
| tech0002.txt | 15 of 1 bits in the exponent 'x'. To a large extent there will be the same number of squaring operations. "1" bits in
16 the exponent require the sender to perform a multiplication. This means to a certain extent an attacker can
|
| /external/dropbear/libtomcrypt/src/pk/katja/ |
| katja_exptmod.c | 26 @param which Which exponent to use, e.g. PK_PRIVATE or PK_PUBLIC
63 /* are we using the private exponent and is the key optimized? */
|
| /external/dropbear/libtomcrypt/src/pk/rsa/ |
| rsa_exptmod.c | 26 @param which Which exponent to use, e.g. PK_PRIVATE or PK_PUBLIC
63 /* are we using the private exponent and is the key optimized? */
|
| /external/eigen/Eigen/src/Core/ |
| GlobalFunctions.h | 54 pow(const Eigen::ArrayBase<Derived>& x, const typename Derived::Scalar& exponent) {
55 return x.derived().pow(exponent);
|
| /external/icu4c/i18n/ |
| digitlst.h | 100 * 10 exponent associated with it. The value represented by a DigitList
103 * decimal point, by 10^exponent.
118 * digitList exponent = decNumber exponent + digit count
178 * inefficient, and the interaction with the exponent value is confusing.
300 /** Reduce, or normalize. Removes trailing zeroes, adjusts exponent appropriately. */
303 /** Remove trailing fraction zeros, adjust exponent accordingly. */
375 * don't allow denormalized numbers because our exponent is effectively of
|
| /external/kernel-headers/original/asm-x86/ |
| sigcontext.h | 24 unsigned short exponent; member in struct:_fpreg
29 unsigned short exponent; member in struct:_fpxreg
|
| /external/v8/src/ |
| bignum-dtoa.h | 43 // Return a fixed number of digits, no matter what the exponent is.
56 // (together with the correct exponent) then reading this number will give
|
| /external/webrtc/src/common_audio/vad/ |
| vad_gmm.c | 59 // Calculate the exponent |tmp32| = (x - m)^2 / (2 * s^2), in Q10. Replacing
64 // If the exponent is small enough to give a non-zero probability we calculate
|
| /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/ |
| qgain475.h | 125 Word16 exp_gcode0, /* i : predicted CB gain (exponent), Q0 */
127 Word16 cod_gain_exp, /* i : optimum codebook gain (exponent), Q0 */
146 Word16 sf0_exp_gcode0, /* i : predicted CB gain (exponent), Q0 */
148 Word16 sf0_exp_coeff[], /* i : energy coeff. (5), exponent part, Q0 */
152 Word16 sf0_exp_target_en, /* i : exponent of target energy, Q0 */
158 Word16 sf1_exp_gcode0, /* i : predicted CB gain (exponent), Q0 */
160 Word16 sf1_exp_coeff[], /* i : energy coeff. (5), exponent part, Q0 */
164 Word16 sf1_exp_target_en, /* i : exponent of target energy, Q0 */
|
| /libcore/luni/src/main/java/java/lang/ |
| Double.java | 80 * Maximum base-2 exponent that a finite value of the {@code double} type may have.
88 * Minimum base-2 exponent that a normal value of the {@code double} type may have.
418 // mask exponent bits and shift down
419 long exponent = (bitValue & 0x7FF0000000000000L) >>> 52; local
423 if (exponent == 0 && significand == 0) {
434 if (exponent == 0) { // denormal (subnormal) value
479 // remove exponent's 'bias' and convert to a string
480 hexString.append(Long.toString(exponent - 1023));
|
| Float.java | 77 * Maximum base-2 exponent that a finite value of the {@code float} type may have.
85 * Minimum base-2 exponent that a normal value of the {@code float} type may have.
425 // mask exponent bits and shift down
426 int exponent = (bitValue & 0x7f800000) >>> 23; local
431 if (exponent == 0 && significand == 0) {
442 if (exponent == 0) { // denormal (subnormal) value
486 // remove exponent's 'bias' and convert to a string
487 hexString.append(exponent - 127);
|
| /prebuilts/gcc/darwin-x86/host/i686-apple-darwin-4.2.1/lib/gcc/i686-apple-darwin10/4.2.1/include/ |
| decfloat.h | 43 /* Minimum exponent. */
51 /* Maximum exponent. */
|
| /prebuilts/gcc/darwin-x86/host/i686-apple-darwin-4.2.1/lib/gcc/i686-apple-darwin11/4.2.1/include/ |
| decfloat.h | 43 /* Minimum exponent. */
51 /* Maximum exponent. */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/asm/ |
| sigcontext.h | 23 unsigned short exponent; member in struct:_fpreg
28 unsigned short exponent; member in struct:_fpxreg
|
