HomeSort by: relevance | last modified time | path
    Searched defs:quotient (Results 1 - 25 of 41) sorted by relevancy

1 2

  /src/external/gpl3/gcc/dist/libgcc/config/arm/
bpabi.c 36 long long quotient; local
38 quotient = __divdi3 (a, b);
39 *remainder = a - b * quotient;
40 return quotient;
  /src/external/gpl3/gcc.old/dist/libgcc/config/arm/
bpabi.c 36 long long quotient; local
38 quotient = __divdi3 (a, b);
39 *remainder = a - b * quotient;
40 return quotient;
  /src/external/bsd/jemalloc/dist/test/unit/
div.c 15 size_t quotient = div_compute( local
17 expect_zu_eq(dividend, quotient * divisor,
19 "got quotient %zu", divisor, dividend, quotient);
  /src/external/bsd/jemalloc.old/dist/test/unit/
div.c 15 size_t quotient = div_compute( local
17 assert_zu_eq(dividend, quotient * divisor,
19 "got quotient %zu", divisor, dividend, quotient);
  /src/sys/external/bsd/compiler_rt/dist/lib/builtins/
divsf3.c 119 rep_t quotient = (uint64_t)reciprocal*(aSignificand << 1) >> 32; local
121 // Two cases: quotient is in [0.5, 1.0) or quotient is in [1.0, 2.0).
132 // We also take this time to right shift quotient if it falls in the [1,2)
135 if (quotient < (implicitBit << 1)) {
136 residual = (aSignificand << 24) - quotient * bSignificand;
139 quotient >>= 1;
140 residual = (aSignificand << 23) - quotient * bSignificand;
159 rep_t absResult = quotient & significandMask;
divdf3.c 133 rep_t quotient, quotientLo; local
134 wideMultiply(aSignificand << 2, reciprocal, &quotient, &quotientLo);
136 // Two cases: quotient is in [0.5, 1.0) or quotient is in [1.0, 2.0).
147 // We also take this time to right shift quotient if it falls in the [1,2)
150 if (quotient < (implicitBit << 1)) {
151 residual = (aSignificand << 53) - quotient * bSignificand;
154 quotient >>= 1;
155 residual = (aSignificand << 52) - quotient * bSignificand;
174 rep_t absResult = quotient & significandMask
    [all...]
divtf3.c 149 rep_t quotient, quotientLo; local
150 wideMultiply(aSignificand << 2, reciprocal, &quotient, &quotientLo);
152 // Two cases: quotient is in [0.5, 1.0) or quotient is in [1.0, 2.0).
163 // We also take this time to right shift quotient if it falls in the [1,2)
168 if (quotient < (implicitBit << 1)) {
169 wideMultiply(quotient, bSignificand, &dummy, &qb);
173 quotient >>= 1;
174 wideMultiply(quotient, bSignificand, &dummy, &qb);
192 rep_t absResult = quotient & significandMask
    [all...]
  /src/external/lgpl3/gmp/dist/tests/mpz/
t-fdiv.c 34 mpz_t quotient, remainder; local
54 mpz_init (quotient);
86 mpz_fdiv_qr (quotient, remainder, dividend, divisor);
92 if (mpz_cmp (quotient, quotient2) != 0)
97 /* Check if the sign of the quotient is correct. */
98 if (mpz_cmp_ui (quotient, 0) != 0)
99 if ((mpz_cmp_ui (quotient, 0) < 0)
104 (quotient rounded towards minus infinity). */
109 mpz_mul (temp, quotient, divisor);
123 mpz_clear (quotient);
    [all...]
t-tdiv.c 34 mpz_t quotient, remainder; local
53 mpz_init (quotient);
85 mpz_tdiv_qr (quotient, remainder, dividend, divisor);
91 if (mpz_cmp (quotient, quotient2) != 0)
96 /* Check if the sign of the quotient is correct. */
97 if (mpz_cmp_ui (quotient, 0) != 0)
98 if ((mpz_cmp_ui (quotient, 0) < 0)
103 (quotient rounded towards 0). */
108 mpz_mul (temp, quotient, divisor);
122 mpz_clear (quotient);
    [all...]
t-cdiv_ui.c 34 mpz_t quotient, remainder; local
55 mpz_init (quotient);
84 r_rq = mpz_cdiv_qr_ui (quotient, remainder, dividend, divisor);
91 if (mpz_cmp (quotient, quotient2) != 0)
98 /* Check if the sign of the quotient is correct. */
99 if (mpz_cmp_ui (quotient, 0) != 0)
100 if ((mpz_cmp_ui (quotient, 0) < 0)
102 dump_abort ("quotient sign wrong", dividend, divisor);
105 (quotient rounded towards minus infinity). */
110 mpz_mul_ui (temp, quotient, divisor)
    [all...]
t-fdiv_ui.c 34 mpz_t quotient, remainder; local
55 mpz_init (quotient);
84 r_rq = mpz_fdiv_qr_ui (quotient, remainder, dividend, divisor);
91 if (mpz_cmp (quotient, quotient2) != 0)
98 /* Check if the sign of the quotient is correct. */
99 if (mpz_cmp_ui (quotient, 0) != 0)
100 if ((mpz_cmp_ui (quotient, 0) < 0)
102 dump_abort ("quotient sign wrong", dividend, divisor);
105 (quotient rounded towards minus infinity). */
110 mpz_mul_ui (temp, quotient, divisor)
    [all...]
t-tdiv_ui.c 34 mpz_t quotient, remainder; local
55 mpz_init (quotient);
84 r_rq = mpz_tdiv_qr_ui (quotient, remainder, dividend, divisor);
91 if (mpz_cmp (quotient, quotient2) != 0)
98 /* Check if the sign of the quotient is correct. */
99 if (mpz_cmp_ui (quotient, 0) != 0)
100 if ((mpz_cmp_ui (quotient, 0) < 0)
102 dump_abort ("quotient sign wrong", dividend, divisor);
105 (quotient rounded towards 0). */
110 mpz_mul_ui (temp, quotient, divisor)
    [all...]
  /src/lib/libutil/
strpct.c 170 uintmax_t quotient = numerator / denominator; local
171 uintmax_t remainder = numerator - (quotient * denominator);
172 size_t nw = snprintf(p, n, "%ju", quotient);
199 (void)snprintf(p, n, "%ju", quotient + 1);
  /src/external/gpl3/gdb/dist/gdb/
gmp-utils.c 184 /* Convert our rational number into a quotient and remainder,
188 gdb_mpz quotient, remainder; local
189 mpz_fdiv_qr (quotient.m_val, remainder.m_val,
197 mpz_add_ui (quotient.m_val, quotient.m_val, 1);
201 mpz_neg (quotient.m_val, quotient.m_val);
203 return quotient;
  /src/external/gpl3/gdb.old/dist/gdb/
gmp-utils.c 184 /* Convert our rational number into a quotient and remainder,
188 gdb_mpz quotient, remainder; local
189 mpz_fdiv_qr (quotient.m_val, remainder.m_val,
197 mpz_add_ui (quotient.m_val, quotient.m_val, 1);
201 mpz_neg (quotient.m_val, quotient.m_val);
203 return quotient;
  /src/external/gpl3/gcc.old/dist/libgcc/config/tilepro/
softdivide.c 62 quotient, subtract (b << N) from a, and keep going. Think of this as
81 uint32_t quotient = 0; local
94 quotient |= quotient_bit;
96 return quotient;
137 uint64_t quotient = 0; local
150 quotient |= quotient_bit;
152 return quotient;
  /src/sys/dev/i2c/
sensirion_voc_algorithm.c 138 uint32_t quotient = 0; local
156 quotient |= bit;
166 quotient |= bit;
176 quotient++;
180 fix16_t result = (fix16_t)quotient;
  /src/external/gpl3/gdb/dist/sim/mips/
dv-tx3904tmr.c 502 signed_8 quotient, remainder; local
568 quotient = warp / divisor;
571 /* NOTE: If the event rescheduling code works properly, the quotient
575 accumulate, with the quotient == 0. Once in a while, quotient
580 while(quotient > 0) /* Is it time to increment counter? */
584 quotient --;
686 } /* end quotient loop */
  /src/external/gpl3/gdb.old/dist/sim/mips/
dv-tx3904tmr.c 502 signed_8 quotient, remainder; local
568 quotient = warp / divisor;
571 /* NOTE: If the event rescheduling code works properly, the quotient
575 accumulate, with the quotient == 0. Once in a while, quotient
580 while(quotient > 0) /* Is it time to increment counter? */
584 quotient --;
686 } /* end quotient loop */
  /src/external/bsd/bc/dist/
number.c 964 /* Calculate the number of quotient digits. */
979 /* Allocate and zero the storage for the quotient. */
1008 /* Calculate the quotient digit guess. */
1071 /* We now know the quotient digit. */
1101 bc_num quotient = NULL; local
1115 quotient = bc_copy_num (temp);
1123 *quot = quotient;
  /src/external/gpl3/gcc/dist/gcc/
double-int.cc 337 for a quotient (stored in *LQUO, *HQUO) and remainder (in *LREM, *HREM).
341 It controls how the quotient is rounded to an integer.
372 /* Calculate quotient sign and convert operands to unsigned. */
442 This is required by the quotient digit estimation algorithm. */
471 /* Guess the next quotient digit, quo_est, by dividing the first
472 two remaining dividend digits by the high order quotient digit.
490 /* Try QUO_EST as the quotient digit, by multiplying the
520 /* Store the quotient digit. */
581 /* If abs(rem) >= abs(den) - abs(rem), adjust the quotient. */
1044 double_int quotient = this->divmod (factor, unsigned_p local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
double-int.cc 337 for a quotient (stored in *LQUO, *HQUO) and remainder (in *LREM, *HREM).
341 It controls how the quotient is rounded to an integer.
372 /* Calculate quotient sign and convert operands to unsigned. */
442 This is required by the quotient digit estimation algorithm. */
471 /* Guess the next quotient digit, quo_est, by dividing the first
472 two remaining dividend digits by the high order quotient digit.
490 /* Try QUO_EST as the quotient digit, by multiplying the
520 /* Store the quotient digit. */
581 /* If abs(rem) >= abs(den) - abs(rem), adjust the quotient. */
1044 double_int quotient = this->divmod (factor, unsigned_p local
    [all...]
  /src/external/gpl3/gdb/dist/sim/ppc/
dp-bit.c 839 fractype quotient; local
876 /* quotient =
891 quotient = 0;
897 quotient |= bit;
904 if ((quotient & GARDMASK) == GARDMSB)
906 if (quotient & (1 << NGARDS))
909 quotient += GARDROUND + 1;
914 quotient += GARDROUND + 1;
918 a->fraction.ll = quotient;
  /src/external/gpl3/gdb.old/dist/sim/ppc/
dp-bit.c 839 fractype quotient; local
876 /* quotient =
891 quotient = 0;
897 quotient |= bit;
904 if ((quotient & GARDMASK) == GARDMSB)
906 if (quotient & (1 << NGARDS))
909 quotient += GARDROUND + 1;
914 quotient += GARDROUND + 1;
918 a->fraction.ll = quotient;
  /src/crypto/external/apache2/openssl/dist/crypto/ml_kem/
ml_kem.c 809 uint32_t quotient = (uint32_t)(product >> kBarrettShift); local
810 uint32_t remainder = x - quotient * kPrime;
1127 * remainder (for rounding) and the quotient (as the result), we cannot use
1134 uint32_t quotient = (uint32_t)(product >> kBarrettShift); local
1135 uint32_t remainder = shifted - quotient * kPrime;
1138 * Adjust the quotient to round correctly:
1143 quotient += 1 & constant_time_lt_32(kHalfPrime, remainder);
1144 quotient += 1 & constant_time_lt_32(kPrime + kHalfPrime, remainder);
1145 return quotient & ((1 << bits) - 1);

Completed in 44 milliseconds

1 2