/macosx-10.10.1/CPANInternal-159.1/Time-HiRes-Value-0.07/lib/Time/HiRes/ |
H A D | Value.pm | 289 object; it is an error for a time to be used as a divisor.
|
/macosx-10.10.1/Heimdal-398.1.2/lib/hcrypto/libtommath/ |
H A D | bn.tex | 1790 This will compute the greatest common divisor of $a$ and $b$ and store it in $c$.
|
H A D | tommath.tex | 3652 The precision of the division is proportional to the value of $q$. If the divisor $b$ is used frequently as is the case with 3707 Note that the original divisor $2^q$ has been replaced with $\beta^{m+1}$ where in this case $q$ is a multiple of $lg(\beta)$. Also note that the 3708 exponent on the divisor when added to the amount $q_0$ was shifted by equals $2m$. If the optimization had not been performed the divisor 5258 will be used. Let $x$ represent the divisor and $y$ represent the dividend. Let $q$ represent the integer quotient $\lfloor y / x \rfloor$ and 5286 their reason of existing are never explained. For this example let $y = 5471$ represent the dividend and $x = 23$ represent the divisor. 5302 As alluded to earlier the quotient digit $k$ can be estimated from only the leading digits of both the divisor and dividend. When $p$ leading 5303 digits are used from both the divisor and dividend to form an estimation the accuracy of the estimation rises as $p$ grows. Technically 5305 dividend and divisor are zero. 5308 of the estimation technique is to use $t + 1$ digits of the dividend and $t$ digits of the divisor, i [all...] |
/macosx-10.10.1/Heimdal-398.1.2/lib/roken/ |
H A D | parse_units.c | 203 int divisor; local 205 divisor = num / u->mult; 206 if (divisor) { 208 tmp = (*print) (s, len, divisor, u->name, num); 225 print_unit (char *s, size_t len, int divisor, const char *name, int rem) argument 228 divisor, name, 229 divisor == 1 ? "" : "s", 300 print_flag (char *s, size_t len, int divisor, const char *name, int rem) argument
|
/macosx-10.10.1/ICU-531.30/icuSources/i18n/ |
H A D | compactdecimalformat.cpp | 750 double divisor = power10; local 752 divisor /= 10.0; 754 result->divisors[log10Value] = divisor; 844 // a divisor for each log10 value. 850 // For each log10 value not defined in CLDR, it uses the divisor for
|
H A D | gregoimp.cpp | 40 double ClockMath::floorDivide(double dividend, double divisor, argument 43 U_ASSERT(divisor > 0); 44 double quotient = floorDivide(dividend, divisor); 45 remainder = dividend - (quotient * divisor); 49 if (remainder < 0 || remainder >= divisor) { 67 remainder = dividend - (quotient * divisor); 70 U_ASSERT(0 <= remainder && remainder < divisor);
|
H A D | gregoimp.h | 36 * @param denominator a divisor which must be != 0 47 * @param denominator a divisor which must be != 0 60 * @param denominator a divisor which must be != 0 71 * For a positive divisor, return the quotient and remainder 72 * such that dividend = quotient*divisor + remainder and 73 * 0 <= remainder < divisor. 76 * (divident >> divisor) reasonably. 78 * Calling with a divisor <= 0 is disallowed. 80 static double floorDivide(double dividend, double divisor,
|
H A D | nfsubs.cpp | 70 double divisor; member in class:MultiplierSubstitution 80 : NFSubstitution(_pos, _ruleSet, formatter, description, status), divisor(_divisor) 82 ldivisor = util64_fromDouble(divisor); 83 if (divisor == 0) { 90 divisor = uprv_pow(radix, exponent); 91 ldivisor = util64_fromDouble(divisor); 93 if(divisor == 0) { 106 return uprv_floor(number / divisor); 108 return number/divisor; 113 return newRuleValue * divisor; 128 double divisor; member in class:ModulusSubstitution [all...] |
/macosx-10.10.1/ICU-531.30/icuSources/test/perf/collperf2/ |
H A D | collperf2.cpp | 86 int32_t divisor = source->count / maxTestStrings; 90 if (i % divisor) continue; 94 if (j % divisor) continue; 198 int32_t divisor = source->count / maxTestStrings; 202 if (i % divisor) continue; 206 if (j % divisor) continue; 497 int32_t divisor = source->count / maxTestStrings; 501 if (i % divisor) continue; 505 if (j % divisor) continue; 607 int32_t divisor [all...] |
/macosx-10.10.1/IOFWDVComponents-207.4.1/ |
H A D | DVIsochComponent.c | 1859 elapsed_msecs = (int)(((double)(stop - start)) / divisor);
|
/macosx-10.10.1/IOKitUser-1050.1.21/ |
H A D | Tests.c | 103 #define divisor 1000 macro 104 printf("elapsed %d us\n", (int)((end - start) / (clock_freq / divisor / 4 ) * numer ));
|
/macosx-10.10.1/IOKitUser-1050.1.21/graphics.subproj/ |
H A D | WSTests.c | 103 #define divisor 1000 macro 104 printf("elapsed %d us\n", (int)((end - start) / (clock_freq / divisor / 4 ) * numer ));
|
/macosx-10.10.1/JavaScriptCore-7600.1.17/dfg/ |
H A D | DFGSpeculativeJIT.cpp | 3279 // (in case of |dividend| < |divisor|), so we speculate it as strict int32. 3283 int32_t divisor = valueOfInt32Constant(node->child2().node()); local 3284 if (divisor > 1 && hasOneBitSet(divisor)) { 3285 unsigned logarithm = WTF::fastLog2(divisor); 3293 // First, compute either divisor - 1, or 0, depending on whether 3296 // If dividend < 0: resultGPR = divisor - 1 3304 // If dividend < 0: resultGPR = dividend + divisor - 1 3310 // of divisor, so that: 3312 // If dividend < 0: resultGPR = floor((dividend + divisor 3345 int32_t divisor = valueOfInt32Constant(node->child2().node()); local [all...] |
/macosx-10.10.1/JavaScriptCore-7600.1.17/jit/ |
H A D | ExecutableAllocatorFixedVMPool.cpp | 156 size_t divisor = statistics.bytesReserved - bytesAllocated; local 157 if (divisor) 158 result = static_cast<double>(statistics.bytesReserved) / divisor;
|
/macosx-10.10.1/JavaScriptCore-7600.1.17/runtime/ |
H A D | BigInteger.h | 79 uint32_t divide(uint32_t divisor) argument 87 uint64_t result = dividend / static_cast<uint64_t>(divisor); 89 uint64_t remainder = dividend % static_cast<uint64_t>(divisor);
|
/macosx-10.10.1/Libc-1044.1.2/gen/ |
H A D | nanosleep.c | 203 /* calculate (x * y / divisor), using 128-bit internal calculations */ 205 muldiv128(uint64_t x, uint64_t y, uint64_t divisor, uint64_t *res) argument 208 uint128_t divisor128 = {0, divisor}; 215 * Now divide by the divisor. We use floating point to calculate an 219 recip = 1.0 / ((double)divisor); 220 while(temp.high || temp.low >= divisor) { 228 mul64x64(uapprox, divisor, &backmul);
|
/macosx-10.10.1/OpenSSH-189/osslshim/heimdal-asn1/ |
H A D | parse_units.c | 231 int divisor; local 233 divisor = num / u->mult; 234 if (divisor) { 236 tmp = (*print) (s, len, divisor, u->name, num); 253 print_unit (char *s, size_t len, int divisor, const char *name, int rem) argument 256 divisor, name, 257 divisor == 1 ? "" : "s", 328 print_flag (char *s, size_t len, int divisor, const char *name, int rem) argument
|
/macosx-10.10.1/OpenSSL098-52/src/crypto/bn/ |
H A D | bn_div.c | 172 /* BN_div[_no_branch] computes dv := num / divisor, rounding towards 173 * zero, and sets up rm such that dv*divisor + rm = num holds. 175 * dv->neg == num->neg ^ divisor->neg (unless the result is zero) 180 const BIGNUM *divisor, BN_CTX *ctx); 181 int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor, argument 201 if ((BN_get_flags(num, BN_FLG_CONSTTIME) != 0) || (BN_get_flags(divisor, BN_FLG_CONSTTIME) != 0)) 203 return BN_div_no_branch(dv, rm, num, divisor, ctx); 209 bn_check_top(divisor); 211 if (BN_is_zero(divisor)) 217 if (BN_ucmp(num,divisor) < 426 BN_div_no_branch(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor, BN_CTX *ctx) argument [all...] |
/macosx-10.10.1/Security-57031.1.35/Security/include/security_cryptkit/CurveParamDocs/ |
H A D | giants.c | 543 int divisor, 546 /* Divides giant of arbitrary base by divisor. 555 if (divisor == 0) 564 *digitpointer = (unsigned short)(num/divisor); 572 rem = num % divisor; 577 if ((divisor<0) ^ (thegiant->sign<0)) 1895 int divisor, 1899 /* theg becomes theg/divisor. Returns remainder. */ 1903 n = radixdiv(base,divisor,theg); 541 radixdiv( int base, int divisor, giant thegiant ) argument 1894 idivg( int divisor, giant theg ) argument
|
/macosx-10.10.1/Security-57031.1.35/Security/libsecurity_apple_csp/open_ssl/bn/ |
H A D | bn_div.c | 173 int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor, argument 183 bn_check_top(divisor); 185 if (BN_is_zero(divisor)) 191 if (BN_ucmp(num,divisor) < 0) 210 norm_shift=BN_BITS2-((BN_num_bits(divisor))%BN_BITS2); 211 BN_lshift(sdiv,divisor,norm_shift); 237 res->neg= (num->neg^divisor->neg);
|
/macosx-10.10.1/Security-57031.1.35/Security/libsecurity_cryptkit/lib/CurveParamDocs/ |
H A D | giants.c | 543 int divisor, 546 /* Divides giant of arbitrary base by divisor. 555 if (divisor == 0) 564 *digitpointer = (unsigned short)(num/divisor); 572 rem = num % divisor; 577 if ((divisor<0) ^ (thegiant->sign<0)) 1895 int divisor, 1899 /* theg becomes theg/divisor. Returns remainder. */ 1903 n = radixdiv(base,divisor,theg); 541 radixdiv( int base, int divisor, giant thegiant ) argument 1894 idivg( int divisor, giant theg ) argument
|
/macosx-10.10.1/Security-57031.1.35/Security/utilities/src/ |
H A D | der_date.c | 127 uint64_t divisor = 1; local 136 if (divisor < UINT64_MAX / 10) { 137 divisor *= 10; 153 *fraction = (double)value / divisor;
|
/macosx-10.10.1/Security-57031.1.35/Security/utilities/utilities/ |
H A D | der_date.c | 127 uint64_t divisor = 1; local 136 if (divisor < UINT64_MAX / 10) { 137 divisor *= 10; 153 *fraction = (double)value / divisor;
|
/macosx-10.10.1/WTF-7600.1.24/wtf/ |
H A D | StdLibExtras.h | 189 inline size_t roundUpToMultipleOf(size_t divisor, size_t x) argument 191 ASSERT(divisor && !(divisor & (divisor - 1))); 192 size_t remainderMask = divisor - 1; 196 template<size_t divisor> inline size_t roundUpToMultipleOf(size_t x) 198 static_assert(divisor && !(divisor & (divisor - 1)), "divisor mus [all...] |
/macosx-10.10.1/WTF-7600.1.24/wtf/dtoa/ |
H A D | fast-dtoa.cc | 434 uint32_t divisor; 437 &divisor, &divisor_exponent); 442 // with the divisor exponent + 1. And the divisor is the biggest power of ten 445 int digit = integrals / divisor; 448 integrals %= divisor; 450 // Note that kappa now equals the exponent of the divisor and that the 461 static_cast<uint64_t>(divisor) << -one.e(), unit); 463 divisor /= 10; 542 uint32_t divisor; [all...] |