Lines Matching full:division

10  * Calendar algorithms thrive on the division operation, which is one of
23  * Furthermore, we need floor division in many places. C either leaves
24  * the division behaviour undefined (< C99) or demands truncation to
38  * two's complement: Floor division on negative dividents can be
454  * where 'MOD' denotes the modulo operator for FLOOR DIVISION, which
455  * is not the same as the '%' operator in C: C requires division to be
456  * a truncated division, where remainder and dividend have the same
457  * sign if the remainder is not zero, whereas floor division requires
480  * to the floor division convention.
484  * division routine for 64bit ops on a platform that can only do
671  * division. This function happily accepts negative time values as
698 	 * the 64bit-by-32bit division will never outperform the exact
699 	 * division by a substantial factor....)
716 	 * So we discard the lowest 7 bit and do an exact division by
723 	 * with a 'true' division step. This yields the modulus of the
769  * division. This function happily accepts negative time values as
879 	 * centuries and years in a century with one division each. This
880 	 * reduces the number of division operations to two, but is
891 	 * division rules in the first step. Well, actually we want to
908 	 * limits. We solve this by doing an exact division (mod 2^32)
913 	 * by scaling, and do one full division step to get the true
970 	 * the smallest power-of-two divider to avoid any true division.
1290 	 * complement division trick for negative numbers. The chained
1291 	 * division sequence by 4/25/4 gives the compiler the chance to
1292 	 * get away with only one true division and doing shifts otherwise.
1359 	/* Possibly normalise by floor division. This does not hapen for
1762  * smallest possible powers of two, so the division can be implemented
1789 	/* split off centuries, using floor division */
1799 	 * Needs floor division by 4, which is done with masking and
1806 	/* Get weeks in century. Can use plain division here as all ops
1837 	 * execute '(weeks * 4 + 2) /% 20871' under floor division rules
1841 	 * coded directly in 32bit. And again we use 64bit division on
1842 	 * a 64bit target and exact division after calculating the
1848 	/* Full floor division with 64bit values. */
1857 	/* Exact division after calculating the remainder via partial
1918 	/* split days into days and weeks, using floor division in unsigned */
2169 	 * 7), we have to make this an exact division by multiplication
2195 	 * 3(mod 7). (Exact division, see to comment)