HomeSort by relevance Sort by last modified time
    Searched refs:quotient (Results 1 - 25 of 36) sorted by null

1 2

  /frameworks/base/media/libstagefright/codecs/aacdec/
pv_div.h 62 Int32 quotient; member in struct:intg_div
65 typedef struct intg_div Quotient;
68 void pv_div(Int32 x, Int32 y, Quotient *quotient);
pv_div.cpp 34 Quotient *result structure that hold result and shift factor
40 Implement division of two Int32 numbers, provides back quotient and a
104 void pv_div(Int32 x, Int32 y, Quotient *result)
109 Int32 quotient; local
167 quotient = (0x40000000 / (y >> 15));
169 y_ov_y_hi = fxp_mul32_Q15(y, quotient); /* y*(1/y_hi) */
172 y_ov_y_hi = fxp_mul32_Q14(quotient, y_ov_y_hi);
175 result->quotient = flag ? -i : i;
179 result->quotient = 0;
sbr_generate_high_freq.cpp 489 struct intg_div quotient; local
513 pv_div(ac.r01r, ac.r11r, &quotient);
515 fac = -(quotient.quotient >> 2); /* Q28 */
517 if (quotient.shift_factor > 0)
519 fac >>= quotient.shift_factor; /* Q28 */
521 else if (quotient.shift_factor < 0)
523 if (quotient.shift_factor > -4) /* |fac| < 8 */
525 fac <<= (-quotient.shift_factor); /* Q28 */
536 if (quotient.shift_factor > 0
810 struct intg_div quotient; local
    [all...]
sbr_aliasing_reduction.cpp 169 struct intg_div quotient; local
265 pv_div(ref_total_man, est_total, &quotient);
267 tmp_q2 += - tmp_q1 - quotient.shift_factor - 2;
292 tmp_q3 = fxp_mul32_Q30(alpha, quotient.quotient);
336 pv_div(ref_total_man, bst_man, &quotient);
337 bst_exp = ref_total_exp - bst_exp - quotient.shift_factor - 30;
338 bst_man = quotient.quotient; /* Q30 */
calc_sbr_envelope.cpp 262 struct intg_div quotient; local
503 pv_div(nL_man[aux1], nL_man[aux1] + (0x3FFFFFFF >> tmp_q1), &quotient);
508 pv_div(tmp_q1, tmp_q1 + 0x3FFFFFFF, &quotient);
515 tmp_q1 = fxp_mul32_Q30(quotient.quotient >> quotient.shift_factor, nrg_ref_man[c]);
526 pv_div(tmp_q1, nrg_est_man[c] + 1, &quotient);
528 * nrg_est_man[c] is an integer number, while tmp_q1 and quotient.quotient
532 tmp_q2 = nrg_ref_exp[c] - nrg_est_exp[c] - quotient.shift_factor - 30
    [all...]
ps_pwr_transient_detection.cpp 193 Quotient result;
330 *(aPower++) = (result.quotient >> (result.shift_factor)) << 1; /* in Q31 */
  /libcore/luni/src/main/java/java/math/
Division.java 49 static int divideArrayByInt(int[] quotient, int[] dividend, final int dividendLength,
64 * get the quotient an remainder and correct them properly
87 quotient[i] = (int) (quot & 0xffffffffL);
BigInt.java 339 BigInt quotient, BigInt remainder) {
341 if (quotient != null) {
342 quotient.makeValid();
343 quot = quotient.bignum;
BigInteger.java 888 BigInt quotient = new BigInt(); local
890 BigInt.division(getBigInt(), divisorBigInt, quotient, remainder); local
891 return new BigInteger[] {new BigInteger(quotient), new BigInteger(remainder) };
903 BigInt quotient = new BigInt(); local
904 BigInt.division(getBigInt(), divisor.getBigInt(), quotient, null); local
905 return new BigInteger(quotient);
    [all...]
BigDecimal.java 1111 BigInteger quotient = quotAndRem[0]; local
1144 long quotient = scaledDividend \/ scaledDivisor; local
    [all...]
  /external/icu4c/i18n/
gregoimp.cpp 34 double quotient; local
35 quotient = uprv_floor(numerator / denominator);
36 remainder = (int32_t) (numerator - (quotient * denominator));
37 return (int32_t) quotient;
44 double quotient = floorDivide(dividend, divisor); local
45 remainder = dividend - (quotient * divisor);
47 // is a bug such that the quotient is off by one. If you doubt
53 double q = quotient;
54 quotient += (remainder < 0) ? -1 : +1;
55 if (q == quotient) {
    [all...]
  /libcore/luni/src/main/java/java/util/
Grego.java 194 long quotient = ((numerator + 1) / denominator) - 1; local
195 remainder[0] = numerator - (quotient * denominator);
196 return quotient;
  /dalvik/vm/mterp/x86-atom/
binopD.S 20 * returns the quotient, else it returns the remainder.
48 SET_VREG %eax rINST # vAA<- %eax (quotient)
binopD2addr.S 20 * is set, the code returns the quotient, else it returns
50 SET_VREG %eax rINST # vAA<- %eax (quotient)
binopDLit16.S 20 * returns the quotient, else it returns the remainder.
51 SET_VREG %eax rINST # vA<- %eax (quotient)
binopDLit8.S 20 * returns the quotient, else it returns the remainder.
50 SET_VREG %eax rINST # vAA<- %eax (quotient)
  /external/v8/src/
fixed-dtoa.cc 335 // The quotient delivers the first digits, and the remainder fits into a 64
342 uint32_t quotient; local
345 // Then need q (quotient) and r (remainder) as follows:
356 quotient = static_cast<uint32_t>(dividend / divisor);
360 quotient = static_cast<uint32_t>(dividend / divisor);
363 FillDigits32(quotient, buffer, length);
bignum.cc 527 int quotient = this_bigit / other_bigit;
528 bigits_[used_digits_ - 1] = this_bigit - other_bigit * quotient;
529 result += quotient;
  /external/quake/quake/src/QW/client/
mathlib.h 64 void FloorDivMod (double numer, double denom, int *quotient,
mathlib.c 492 Returns mathematically correct (floor-based) quotient and remainder for
494 quotient must fit in 32 bits.
498 void FloorDivMod (double numer, double denom, int *quotient,
535 *quotient = q;
d_polyse.c 97 int quotient; member in struct:__anon10194
508 ubasestep = ptemp->quotient;
  /external/quake/quake/src/WinQuake/
mathlib.h 64 void FloorDivMod (double numer, double denom, int *quotient,
mathlib.cpp 494 Returns mathematically correct (floor-based) quotient and remainder for
496 quotient must fit in 32 bits.
500 void FloorDivMod (double numer, double denom, int *quotient,
537 *quotient = q;
  /external/v8/test/mjsunit/
top-level-assignments.js 90 Calculator.prototype.quotient = function() { return this.x / this.y; };
96 assertEquals(2, calc.quotient());
  /external/valgrind/main/exp-bbv/tests/arm-linux/
ll.S 407 @ r7=quotient r8=remainder
411 mov r7,#0 @ zero out quotient
414 add r7,r7,#1 @ increment quotient

Completed in 600 milliseconds

1 2