Searched refs:divisor (Results 51 - 57 of 57) sorted by relevance
123
/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/vim-55/src/ |
H A D | gui_mac.c | 443 int divisor = 0; local 447 if (*str == '.' && divisor == 0) 449 /* Start keeping a divisor, for later */ 450 divisor = 1; 459 divisor *= 10; 464 if (divisor == 0) 465 divisor = 1; 467 pixels = points/divisor;
|
/macosx-10.10.1/mDNSResponder-561.1.1/mDNSCore/ |
H A D | DNSCommon.c | 1305 mDNSu32 divisor = 1, chars = 2; // Shortest possible RFC1034 name suffix is 2 characters ("-2") local 1311 while (divisor < 0xFFFFFFFFUL/10 && val >= divisor * 10) { divisor *= 10; chars++; } 1318 while (divisor) 1320 name->c[++name->c[0]] = (mDNSu8)('0' + val / divisor); 1321 val %= divisor; 1322 divisor /= 10;
|
/macosx-10.10.1/Heimdal-398.1.2/lib/hcrypto/libtommath/ |
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...] |
H A D | bn.tex | 1790 This will compute the greatest common divisor of $a$ and $b$ and store it in $c$.
|
/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/IOFWDVComponents-207.4.1/ |
H A D | DVIsochComponent.c | 1859 elapsed_msecs = (int)(((double)(stop - start)) / divisor);
|
Completed in 238 milliseconds
123