Lines Matching refs:exp
45 int exp; // unbiased exponent
111 exp = x_exp - 398; // unbiased exponent
113 if ((q + exp) > 20) { // x >= 10^20 ~= 2^66.45... (cannot fit in 64 bits)
119 } else if ((q + exp) == 20) { // x = c(0)c(1)...c(19).c(20)...c(q-1)
124 // under '1 <= q + exp <= 20'
125 if (x_sign) { // if n < 0 and q + exp = 20 then x is much less than -1/2
131 } else { // if n > 0 and q + exp = 20
149 // to '1 <= q + exp <= 20'
163 // to '1 <= q + exp <= 20'
169 if ((q + exp) < 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
173 } else if ((q + exp) == 0) { // n = +/-0.c(0)c(1)...c(q-1)
190 } else { // if (1 <= q + exp <= 20, 1 <= q <= 16, -15 <= exp <= 19)
202 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 20
203 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
249 } else if (exp == 0) {
253 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
254 // res = +C * 10^exp (exact)
255 res = C1 * ten2k64[exp]; // the result is positive
280 int exp; // unbiased exponent
347 exp = x_exp - 398; // unbiased exponent
349 if ((q + exp) > 20) { // x >= 10^20 ~= 2^66.45... (cannot fit in 64 bits)
355 } else if ((q + exp) == 20) { // x = c(0)c(1)...c(19).c(20)...c(q-1)
360 // under '1 <= q + exp <= 20'
361 if (x_sign) { // if n < 0 and q + exp = 20 then x is much less than -1/2
367 } else { // if n > 0 and q + exp = 20
385 // to '1 <= q + exp <= 20'
399 // to '1 <= q + exp <= 20'
405 if ((q + exp) < 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
411 } else if ((q + exp) == 0) { // n = +/-0.c(0)c(1)...c(q-1)
430 } else { // if (1 <= q + exp <= 20, 1 <= q <= 16, -15 <= exp <= 19)
442 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 20
443 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
525 } else if (exp == 0) {
529 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
530 // res = +C * 10^exp (exact)
531 res = C1 * ten2k64[exp]; // the result is positive
556 int exp; // unbiased exponent
628 exp = x_exp - 398; // unbiased exponent
630 if ((q + exp) > 20) { // x >= 10^20 ~= 2^66.45... (cannot fit in 64 bits)
636 } else if ((q + exp) == 20) { // x = c(0)c(1)...c(19).c(20)...c(q-1)
641 // under '1 <= q + exp <= 20'
642 // n > 0 and q + exp = 20
660 // to '1 <= q + exp <= 20'
674 // to '1 <= q + exp <= 20'
679 if ((q + exp) <= 0) { // n = +0.[0...0]c(0)c(1)...c(q-1)
683 } else { // if (1 <= q + exp <= 20, 1 <= q <= 16, -15 <= exp <= 19)
686 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 20
687 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
710 } else if (exp == 0) {
714 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
715 // res = +C * 10^exp (exact)
716 res = C1 * ten2k64[exp]; // the result is positive
741 int exp; // unbiased exponent
814 exp = x_exp - 398; // unbiased exponent
816 if ((q + exp) > 20) { // x >= 10^20 ~= 2^66.45... (cannot fit in 64 bits)
822 } else if ((q + exp) == 20) { // x = c(0)c(1)...c(19).c(20)...c(q-1)
827 // under '1 <= q + exp <= 20'
828 // n > 0 and q + exp = 20
846 // to '1 <= q + exp <= 20'
860 // to '1 <= q + exp <= 20'
865 if ((q + exp) <= 0) { // n = +0.[0...0]c(0)c(1)...c(q-1)
871 } else { // if (1 <= q + exp <= 20, 1 <= q <= 16, -15 <= exp <= 19)
874 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 20
875 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
921 } else if (exp == 0) {
925 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
926 // res = +C * 10^exp (exact)
927 res = C1 * ten2k64[exp]; // the result is positive
952 int exp; // unbiased exponent
1018 exp = x_exp - 398; // unbiased exponent
1020 if ((q + exp) > 20) { // x >= 10^20 ~= 2^66.45... (cannot fit in 64 bits)
1026 } else if ((q + exp) == 20) { // x = c(0)c(1)...c(19).c(20)...c(q-1)
1031 // under '1 <= q + exp <= 20'
1032 if (x_sign) { // if n < 0 and q + exp = 20 then x is much less than -1
1038 } else { // if n > 0 and q + exp = 20
1056 // to '1 <= q + exp <= 20'
1070 // to '1 <= q + exp <= 20'
1076 if ((q + exp) <= 0) { // n = +/-0.[0...0]c(0)c(1)...c(q-1)
1083 } else { // if (1 <= q + exp <= 20, 1 <= q <= 16, -15 <= exp <= 19)
1095 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 20
1096 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
1140 } else if (exp == 0) {
1144 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
1145 // res = +C * 10^exp (exact)
1146 res = C1 * ten2k64[exp]; // the result is positive
1171 int exp; // unbiased exponent
1237 exp = x_exp - 398; // unbiased exponent
1239 if ((q + exp) > 20) { // x >= 10^20 ~= 2^66.45... (cannot fit in 64 bits)
1245 } else if ((q + exp) == 20) { // x = c(0)c(1)...c(19).c(20)...c(q-1)
1250 // under '1 <= q + exp <= 20'
1251 if (x_sign) { // if n < 0 and q + exp = 20 then x is much less than -1
1257 } else { // if n > 0 and q + exp = 20
1275 // to '1 <= q + exp <= 20'
1289 // to '1 <= q + exp <= 20'
1295 if ((q + exp) <= 0) { // n = +/-0.[0...0]c(0)c(1)...c(q-1)
1304 } else { // if (1 <= q + exp <= 20, 1 <= q <= 16, -15 <= exp <= 19)
1316 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 20
1317 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
1365 } else if (exp == 0) {
1369 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
1370 // res = +C * 10^exp (exact)
1371 res = C1 * ten2k64[exp]; // the result is positive
1396 int exp; // unbiased exponent
1461 exp = x_exp - 398; // unbiased exponent
1463 if ((q + exp) > 20) { // x >= 10^20 ~= 2^66.45... (cannot fit in 64 bits)
1469 } else if ((q + exp) == 20) { // x = c(0)c(1)...c(19).c(20)...c(q-1)
1474 // under '1 <= q + exp <= 20'
1475 if (x_sign) { // if n < 0 and q + exp = 20 then x is much less than -1
1481 } else { // if n > 0 and q + exp = 20
1499 // to '1 <= q + exp <= 20'
1513 // to '1 <= q + exp <= 20'
1519 if ((q + exp) <= 0) { // n = +/-0.[0...0]c(0)c(1)...c(q-1)
1523 } else { // if (1 <= q + exp <= 20, 1 <= q <= 16, -15 <= exp <= 19)
1535 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 20
1536 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
1559 } else if (exp == 0) {
1563 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
1564 // res = +C * 10^exp (exact)
1565 res = C1 * ten2k64[exp]; // the result is positive
1590 int exp; // unbiased exponent
1656 exp = x_exp - 398; // unbiased exponent
1658 if ((q + exp) > 20) { // x >= 10^20 ~= 2^66.45... (cannot fit in 64 bits)
1664 } else if ((q + exp) == 20) { // x = c(0)c(1)...c(19).c(20)...c(q-1)
1669 // under '1 <= q + exp <= 20'
1670 if (x_sign) { // if n < 0 and q + exp = 20 then x is much less than -1
1676 } else { // if n > 0 and q + exp = 20
1694 // to '1 <= q + exp <= 20'
1708 // to '1 <= q + exp <= 20'
1714 if ((q + exp) <= 0) { // n = +/-0.[0...0]c(0)c(1)...c(q-1)
1720 } else { // if (1 <= q + exp <= 20, 1 <= q <= 16, -15 <= exp <= 19)
1732 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 20
1733 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
1779 } else if (exp == 0) {
1783 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
1784 // res = +C * 10^exp (exact)
1785 res = C1 * ten2k64[exp]; // the result is positive
1810 int exp; // unbiased exponent
1875 exp = x_exp - 398; // unbiased exponent
1877 if ((q + exp) > 20) { // x >= 10^20 ~= 2^66.45... (cannot fit in 64 bits)
1883 } else if ((q + exp) == 20) { // x = c(0)c(1)...c(19).c(20)...c(q-1)
1888 // under '1 <= q + exp <= 20'
1889 if (x_sign) { // if n < 0 and q + exp = 20 then x is much less than -1/2
1895 } else { // if n > 0 and q + exp = 20
1913 // to '1 <= q + exp <= 20'
1927 // to '1 <= q + exp <= 20'
1933 if ((q + exp) < 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
1937 } else if ((q + exp) == 0) { // n = +/-0.c(0)c(1)...c(q-1)
1954 } else { // if (1 <= q + exp <= 20, 1 <= q <= 16, -15 <= exp <= 19)
1966 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 20
1967 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
1999 } else if (exp == 0) {
2003 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
2004 // res = +C * 10^exp (exact)
2005 res = C1 * ten2k64[exp]; // the result is positive
2030 int exp; // unbiased exponent
2097 exp = x_exp - 398; // unbiased exponent
2099 if ((q + exp) > 20) { // x >= 10^20 ~= 2^66.45... (cannot fit in 64 bits)
2105 } else if ((q + exp) == 20) { // x = c(0)c(1)...c(19).c(20)...c(q-1)
2110 // under '1 <= q + exp <= 20'
2111 if (x_sign) { // if n < 0 and q + exp = 20 then x is much less than -1/2
2117 } else { // if n > 0 and q + exp = 20
2135 // to '1 <= q + exp <= 20'
2149 // to '1 <= q + exp <= 20'
2155 if ((q + exp) < 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
2161 } else if ((q + exp) == 0) { // n = +/-0.c(0)c(1)...c(q-1)
2180 } else { // if (1 <= q + exp <= 20, 1 <= q <= 16, -15 <= exp <= 19)
2192 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 20
2193 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
2263 } else if (exp == 0) {
2267 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
2268 // res = +C * 10^exp (exact)
2269 res = C1 * ten2k64[exp]; // the result is positive