Searched refs:dividend (Results 1 - 12 of 12) sorted by relevance
/macosx-10.9.5/JavaScriptCore-7537.78.1/runtime/ |
H A D | BigInteger.h | 85 uint64_t dividend = (static_cast<uint64_t>(carry) << 32) + static_cast<uint64_t>(m_values[i]); local 87 uint64_t result = dividend / static_cast<uint64_t>(divisor); 89 uint64_t remainder = dividend % static_cast<uint64_t>(divisor);
|
/macosx-10.9.5/CF-855.17/ |
H A D | CFBasicHash.c | 755 static uintptr_t __CFBasicHashFold(uintptr_t dividend, uint8_t idx) { argument 757 case 1: return dividend % 3; 758 case 2: return dividend % 7; 759 case 3: return dividend % 13; 760 case 4: return dividend % 23; 761 case 5: return dividend % 41; 762 case 6: return dividend % 71; 763 case 7: return dividend % 127; 764 case 8: return dividend % 191; 765 case 9: return dividend [all...] |
/macosx-10.9.5/ICU-511.35/icuSources/i18n/ |
H A D | gregoimp.cpp | 40 double ClockMath::floorDivide(double dividend, double divisor, argument 44 double quotient = floorDivide(dividend, divisor); 45 remainder = dividend - (quotient * divisor); 67 remainder = dividend - (quotient * divisor);
|
H A D | gregoimp.h | 72 * such that dividend = quotient*divisor + remainder and 80 static double floorDivide(double dividend, double divisor,
|
/macosx-10.9.5/emacs-92/emacs/lisp/obsolete/ |
H A D | float.el | 209 (dividend (car (fabs a1))) 213 (if (< (- dividend divisor) 0) 216 dividend (- dividend divisor))) 217 (setq dividend (ash dividend 1)
|
/macosx-10.9.5/CommonCrypto-60049/include/ |
H A D | CommonBigNum.h | 498 @param dividend The BigNum to divide. 505 CCBigNumMod(CCBigNumRef result, CCBigNumRef dividend, CCBigNumRef modulus) 515 @param dividend The BigNum to divide. 522 CCBigNumModI(uint32_t *result, CCBigNumRef dividend, uint32_t modulus)
|
/macosx-10.9.5/CommonCrypto-60049/lib/ |
H A D | CommonBigNum.c | 378 CCBigNumMod(CCBigNumRef res, CCBigNumRef dividend, CCBigNumRef modulus) argument 381 ccz_mod((ccz *)res, (ccz *)dividend, (ccz *)modulus); 386 CCBigNumModI(uint32_t *res, CCBigNumRef dividend, uint32_t modulus) argument 395 ccz_mod((ccz *)r, (ccz *) dividend, (ccz *)mod);
|
/macosx-10.9.5/llvmCore-3425.0.33/lib/Support/ |
H A D | APFloat.cpp | 972 integerPart *lhsSignificand, *dividend, *divisor; 983 dividend = new integerPart[partsCount * 2]; 985 dividend = scratch; 987 divisor = dividend + partsCount; 989 /* Copy the dividend and divisor as they will be modified in-place. */ 991 dividend[i] = lhsSignificand[i]; 1007 /* Normalize the dividend. */ 1008 bit = precision - APInt::tcMSB(dividend, partsCount) - 1; 1011 APInt::tcShiftLeft(dividend, partsCount, bit); 1014 /* Ensure the dividend > [all...] |
H A D | APInt.cpp | 1489 assert(u && "Must provide dividend"); 1551 uint64_t dividend = ((uint64_t(u[j+n]) << 32) + u[j+n-1]); 1552 DEBUG(dbgs() << "KnuthDiv: dividend == " << dividend << '\n'); 1553 uint64_t qp = dividend / v[n-1]; 1554 uint64_t rp = dividend % v[n-1]; 1704 // Initialize the dividend 1727 // the divisor. m is the number of words by which the dividend exceeds the 1728 // divisor (i.e. m+n is the length of the dividend). These sizes must not 1918 // Get some size facts about the dividend an [all...] |
/macosx-10.9.5/WebCore-7537.78.1/platform/ |
H A D | Decimal.cpp | 163 uint32_t dividend[4]; local 164 dividend[0] = lowUInt32(m_low); 165 dividend[1] = highUInt32(m_low); 166 dividend[2] = lowUInt32(m_high); 167 dividend[3] = highUInt32(m_high); 172 const uint64_t work = makeUInt64(dividend[i], remainder);
|
/macosx-10.9.5/dtrace-118.1/libdtrace/ |
H A D | dt_consume.c | 203 * loop, comparing subtrahend to dividend: if subtrahend is smaller, we 208 dt_divide_128(uint64_t *dividend, uint64_t divisor, uint64_t *quotient) argument 222 remainder[0] = dividend[0]; 223 remainder[1] = dividend[1];
|
/macosx-10.9.5/Heimdal-323.92.1/lib/hcrypto/libtommath/ |
H A D | tommath.tex | 264 discuss how to handle sign or handle the dividend's decreasing magnitude in the main loop (\textit{step \#3}). 3659 larger than the dividend. In effect if $a$ is the dividend then $q$ should allow $0 \le \lfloor a/2^q \rfloor \le 1$ in order for this approach 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, in particularly when $t = 1$. The estimate 5310 represent the most significant digits of the dividend an [all...] |
Completed in 232 milliseconds