config/libbid/bid64_round_integral.c

48   int exp;			// unbiased exponent
83     exp = ((x & MASK_BINARY_EXPONENT2) >> 51) - 398;
89     exp = ((x & MASK_BINARY_EXPONENT1) >> 53) - 398;
96     if (exp < 0)
97       exp = 0;
98     res = x_sign | (((UINT64) exp + 398) << 53);
106     // return 0 if (exp <= -(p+1))
107     if (exp <= -17) {
114     // return 0 if (exp <= -p)
115     if (exp <= -16) {
126     // return 0 if (exp <= -p)
127     if (exp <= -16) {
138     // return 0 if (exp <= -p)
139     if (exp <= -16) {
163   if (exp >= 0) {	// -exp <= 0
171     if ((q + exp) >= 0) {	// exp < 0 and 1 <= -exp <= q
172       // need to shift right -exp digits from the coefficient; exp will be 0
173       ind = -exp;	// 1 <= ind <= 16; ind is a synonym for 'x'
249     } else {	// if exp < 0 and q + exp < 0
257     if ((q + exp) >= 0) {	// exp < 0 and 1 <= -exp <= q
258       // need to shift right -exp digits from the coefficient; exp will be 0
259       ind = -exp;	// 1 <= ind <= 16; ind is a synonym for 'x'
328     } else {	// if exp < 0 and q + exp < 0
336     if ((q + exp) > 0) {	// exp < 0 and 1 <= -exp < q
337       // need to shift right -exp digits from the coefficient; exp will be 0
338       ind = -exp;	// 1 <= ind <= 16; ind is a synonym for 'x'
377     } else {	// if exp < 0 and q + exp <= 0
389     if ((q + exp) > 0) {	// exp < 0 and 1 <= -exp < q
390       // need to shift right -exp digits from the coefficient; exp will be 0
391       ind = -exp;	// 1 <= ind <= 16; ind is a synonym for 'x'
430     } else {	// if exp < 0 and q + exp <= 0
442     if ((q + exp) >= 0) {	// exp < 0 and 1 <= -exp <= q
443       // need to shift right -exp digits from the coefficient; exp will be 0
444       ind = -exp;	// 1 <= ind <= 16; ind is a synonym for 'x'
479     } else {	// if exp < 0 and q + exp < 0
509   int exp;			// unbiased exponent
543     exp = ((x & MASK_BINARY_EXPONENT2) >> 51) - 398;
549     exp = ((x & MASK_BINARY_EXPONENT1) >> 53) - 398;
555     if (exp < 0)
556       exp = 0;
557     res = x_sign | (((UINT64) exp + 398) << 53);
562   // return 0 if (exp <= -(p+1))
563   if (exp <= -17) {
583   if (exp >= 0) {	// -exp <= 0
587   } else if ((q + exp) >= 0) {	// exp < 0 and 1 <= -exp <= q
588     // need to shift right -exp digits from the coefficient; the exp will be 0
589     ind = -exp;	// 1 <= ind <= 16; ind is a synonym for 'x'
633   } else {	// if exp < 0 and q + exp < 0
659   int exp;			// unbiased exponent
694     exp = ((x & MASK_BINARY_EXPONENT2) >> 51) - 398;
700     exp = ((x & MASK_BINARY_EXPONENT1) >> 53) - 398;
706     if (exp < 0)
707       exp = 0;
708     res = x_sign | (((UINT64) exp + 398) << 53);
713   // return 0 if (exp <= -p)
714   if (exp <= -16) {
738   if (exp >= 0) {	// -exp <= 0
742   } else if ((q + exp) > 0) {	// exp < 0 and 1 <= -exp < q
743     // need to shift right -exp digits from the coefficient; the exp will be 0
744     ind = -exp;	// 1 <= ind <= 16; ind is a synonym for 'x'
781   } else {	// if exp < 0 and q + exp <= 0
811   int exp;			// unbiased exponent
846     exp = ((x & MASK_BINARY_EXPONENT2) >> 51) - 398;
852     exp = ((x & MASK_BINARY_EXPONENT1) >> 53) - 398;
858     if (exp < 0)
859       exp = 0;
860     res = x_sign | (((UINT64) exp + 398) << 53);
865   // return 0 if (exp <= -p)
866   if (exp <= -16) {
890   if (exp >= 0) {	// -exp <= 0
894   } else if ((q + exp) > 0) {	// exp < 0 and 1 <= -exp < q
895     // need to shift right -exp digits from the coefficient; the exp will be 0
896     ind = -exp;	// 1 <= ind <= 16; ind is a synonym for 'x'
933   } else {	// if exp < 0 and q + exp <= 0
963   int exp;			// unbiased exponent
997     exp = ((x & MASK_BINARY_EXPONENT2) >> 51) - 398;
1003     exp = ((x & MASK_BINARY_EXPONENT1) >> 53) - 398;
1009     if (exp < 0)
1010       exp = 0;
1011     res = x_sign | (((UINT64) exp + 398) << 53);
1016   // return 0 if (exp <= -p)
1017   if (exp <= -16) {
1037   if (exp >= 0) {	// -exp <= 0
1041   } else if ((q + exp) >= 0) {	// exp < 0 and 1 <= -exp <= q
1042     // need to shift right -exp digits from the coefficient; the exp will be 0
1043     ind = -exp;	// 1 <= ind <= 16; ind is a synonym for 'x'
1078   } else {	// if exp < 0 and q + exp < 0
1104   int exp;			// unbiased exponent
1137     exp = ((x & MASK_BINARY_EXPONENT2) >> 51) - 398;
1143     exp = ((x & MASK_BINARY_EXPONENT1) >> 53) - 398;
1149     if (exp < 0)
1150       exp = 0;
1151     res = x_sign | (((UINT64) exp + 398) << 53);
1156   // return 0 if (exp <= -(p+1))
1157   if (exp <= -17) {
1177   if (exp >= 0) {	// -exp <= 0
1181   } else if ((q + exp) >= 0) {	// exp < 0 and 1 <= -exp <= q
1182     // need to shift right -exp digits from the coefficient; the exp will be 0
1183     ind = -exp;	// 1 <= ind <= 16; ind is a synonym for 'x'
1216   } else {	// if exp < 0 and q + exp < 0