config/libbid/bid64_minmax.c

49   int exp_x, exp_y;
158     exp_y = (y & MASK_BINARY_EXPONENT2) >> 51;
161     exp_y = (y & MASK_BINARY_EXPONENT1) >> 53;
202   if (sig_x > sig_y && exp_x >= exp_y) {
206   if (sig_x < sig_y && exp_x <= exp_y) {
210   // if exp_x is 15 greater than exp_y, no need for compensation
211   if (exp_x - exp_y > 15) {
215   // if exp_x is 15 less than exp_y, no need for compensation
216   if (exp_y - exp_x > 15) {
220   // if |exp_x - exp_y| < 15, it comes down to the compensated significand
221   if (exp_x > exp_y) {	// to simplify the loop below,
225 			    mult_factor[exp_x - exp_y]);
240 			  mult_factor[exp_y - exp_x]);
269   int exp_x, exp_y;
371     exp_y = (y & MASK_BINARY_EXPONENT2) >> 51;
374     exp_y = (y & MASK_BINARY_EXPONENT1) >> 53;
396   if (sig_x > sig_y && exp_x >= exp_y) {
400   if (sig_x < sig_y && exp_x <= exp_y) {
404   // if exp_x is 15 greater than exp_y, no need for compensation
405   if (exp_x - exp_y > 15) {
409   // if exp_x is 15 less than exp_y, no need for compensation
410   if (exp_y - exp_x > 15) {
414   // if |exp_x - exp_y| < 15, it comes down to the compensated significand
415   if (exp_x > exp_y) {	// to simplify the loop below,
418 			    mult_factor[exp_x - exp_y]);
419     // now, sig_n_prime has: sig_x * 10^(exp_x-exp_y), this is
431   // exp_y must be greater than exp_x, thus adjust the y significand upwards
433 			  mult_factor[exp_y - exp_x]);
460   int exp_x, exp_y;
570     exp_y = (y & MASK_BINARY_EXPONENT2) >> 51;
573     exp_y = (y & MASK_BINARY_EXPONENT1) >> 53;
614   if (sig_x > sig_y && exp_x >= exp_y) {
618   if (sig_x < sig_y && exp_x <= exp_y) {
622   // if exp_x is 15 greater than exp_y, no need for compensation
623   if (exp_x - exp_y > 15) {
628   // if exp_x is 15 less than exp_y, no need for compensation
629   if (exp_y - exp_x > 15) {
633   // if |exp_x - exp_y| < 15, it comes down to the compensated significand
634   if (exp_x > exp_y) {	// to simplify the loop below,
637 			    mult_factor[exp_x - exp_y]);
651 			  mult_factor[exp_y - exp_x]);
680   int exp_x, exp_y;
782     exp_y = (y & MASK_BINARY_EXPONENT2) >> 51;
785     exp_y = (y & MASK_BINARY_EXPONENT1) >> 53;
807   if (sig_x > sig_y && exp_x >= exp_y) {
811   if (sig_x < sig_y && exp_x <= exp_y) {
815   // if exp_x is 15 greater than exp_y, no need for compensation
816   if (exp_x - exp_y > 15) {
820   // if exp_x is 15 less than exp_y, no need for compensation
821   if (exp_y - exp_x > 15) {
825   // if |exp_x - exp_y| < 15, it comes down to the compensated significand
826   if (exp_x > exp_y) {	// to simplify the loop below,
829 			    mult_factor[exp_x - exp_y]);
830     // now, sig_n_prime has: sig_x * 10^(exp_x-exp_y),
842   // exp_y must be greater than exp_x, thus adjust the y significand upwards
844 			  mult_factor[exp_y - exp_x]);