Lines Matching refs:exp
45 int exp; // unbiased exponent
111 exp = x_exp - 398; // unbiased exponent
113 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
119 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
124 // under '1 <= q + exp <= 10'
125 if (x_sign) { // if n < 0 and q + exp = 10 then x is much less than -1/2
131 } else { // if n > 0 and q + exp = 10
148 // to '1 <= q + exp <= 10'
149 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
163 // to '1 <= q + exp <= 10'
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)
192 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
204 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
205 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
251 } else if (exp == 0) {
255 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
256 // res = +C * 10^exp (exact)
257 res = C1 * ten2k64[exp]; // the result is positive
282 int exp; // unbiased exponent
348 exp = x_exp - 398; // unbiased exponent
350 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
356 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
361 // under '1 <= q + exp <= 10'
362 if (x_sign) { // if n < 0 and q + exp = 10 then x is much less than -1/2
368 } else { // if n > 0 and q + exp = 10
385 // to '1 <= q + exp <= 10'
386 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
400 // to '1 <= q + exp <= 10'
406 if ((q + exp) < 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
412 } else if ((q + exp) == 0) { // n = +/-0.c(0)c(1)...c(q-1)
433 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
445 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
446 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
528 } else if (exp == 0) {
532 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
533 // res = +C * 10^exp (exact)
534 res = C1 * ten2k64[exp]; // the result is positive
559 int exp; // unbiased exponent
631 exp = x_exp - 398; // unbiased exponent
633 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
639 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
644 // under '1 <= q + exp <= 10'
645 // n > 0 and q + exp = 10
662 // to '1 <= q + exp <= 10'
663 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
677 // to '1 <= q + exp <= 10'
682 if ((q + exp) <= 0) { // n = +0.[0...0]c(0)c(1)...c(q-1)
686 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
689 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
690 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
714 } else if (exp == 0) {
718 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
719 // res = +C * 10^exp (exact)
720 res = C1 * ten2k64[exp]; // the result is positive
745 int exp; // unbiased exponent
818 exp = x_exp - 398; // unbiased exponent
820 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
826 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
831 // under '1 <= q + exp <= 10'
832 // if n > 0 and q + exp = 10
849 // to '1 <= q + exp <= 10'
850 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
864 // to '1 <= q + exp <= 10'
869 if ((q + exp) <= 0) { // n = +/-0.[0...0]c(0)c(1)...c(q-1)
875 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
878 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
879 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
925 } else if (exp == 0) {
929 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
930 // res = +C * 10^exp (exact)
931 res = C1 * ten2k64[exp]; // the result is positive
956 int exp; // unbiased exponent
1022 exp = x_exp - 398; // unbiased exponent
1024 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
1030 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
1035 // under '1 <= q + exp <= 10'
1036 if (x_sign) { // if n < 0 and q + exp = 10 then x is much less than -1
1042 } else { // if n > 0 and q + exp = 10
1059 // to '1 <= q + exp <= 10'
1060 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
1074 // to '1 <= q + exp <= 10'
1080 if ((q + exp) <= 0) { // n = +/-0.[0...0]c(0)c(1)...c(q-1)
1087 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
1099 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
1100 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
1144 } else if (exp == 0) {
1148 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
1149 // res = +C * 10^exp (exact)
1150 res = C1 * ten2k64[exp]; // the result is positive
1175 int exp; // unbiased exponent
1241 exp = x_exp - 398; // unbiased exponent
1243 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
1249 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
1254 // under '1 <= q + exp <= 10'
1255 if (x_sign) { // if n < 0 and q + exp = 10 then x is much less than -1
1261 } else { // if n > 0 and q + exp = 10
1278 // to '1 <= q + exp <= 10'
1279 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
1293 // to '1 <= q + exp <= 10'
1299 if ((q + exp) <= 0) { // n = +/-0.[0...0]c(0)c(1)...c(q-1)
1308 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
1320 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
1321 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
1369 } else if (exp == 0) {
1373 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
1374 // res = +C * 10^exp (exact)
1375 res = C1 * ten2k64[exp]; // the result is positive
1400 int exp; // unbiased exponent
1465 exp = x_exp - 398; // unbiased exponent
1467 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
1473 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
1478 // under '1 <= q + exp <= 10'
1479 if (x_sign) { // if n < 0 and q + exp = 10 then x is much less than -1
1485 } else { // if n > 0 and q + exp = 10
1502 // to '1 <= q + exp <= 10'
1503 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
1517 // to '1 <= q + exp <= 10'
1523 if ((q + exp) <= 0) { // n = +/-0.[0...0]c(0)c(1)...c(q-1)
1527 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
1539 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
1540 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
1564 } else if (exp == 0) {
1568 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
1569 // res = +C * 10^exp (exact)
1570 res = C1 * ten2k64[exp]; // the result is positive
1595 int exp; // unbiased exponent
1661 exp = x_exp - 398; // unbiased exponent
1663 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
1669 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
1674 // under '1 <= q + exp <= 10'
1675 if (x_sign) { // if n < 0 and q + exp = 10 then x is much less than -1
1681 } else { // if n > 0 and q + exp = 10
1698 // to '1 <= q + exp <= 10'
1699 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
1713 // to '1 <= q + exp <= 10'
1719 if ((q + exp) <= 0) { // n = +/-0.[0...0]c(0)c(1)...c(q-1)
1725 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
1737 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
1738 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
1784 } else if (exp == 0) {
1788 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
1789 // res = +C * 10^exp (exact)
1790 res = C1 * ten2k64[exp]; // the result is positive
1815 int exp; // unbiased exponent
1880 exp = x_exp - 398; // unbiased exponent
1882 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
1888 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
1893 // under '1 <= q + exp <= 10'
1894 if (x_sign) { // if n < 0 and q + exp = 10 then x is much less than -1/2
1900 } else { // if n > 0 and q + exp = 10
1917 // to '1 <= q + exp <= 10'
1918 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
1932 // to '1 <= q + exp <= 10'
1938 if ((q + exp) < 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
1942 } else if ((q + exp) == 0) { // n = +/-0.c(0)c(1)...c(q-1)
1961 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
1973 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
1974 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
2000 } else if (exp == 0) {
2004 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
2005 // res = +C * 10^exp (exact)
2006 res = C1 * ten2k64[exp]; // the result is positive
2031 int exp; // unbiased exponent
2097 exp = x_exp - 398; // unbiased exponent
2099 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
2105 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
2110 // under '1 <= q + exp <= 10'
2111 if (x_sign) { // if n < 0 and q + exp = 10 then x is much less than -1/2
2117 } else { // if n > 0 and q + exp = 10
2134 // to '1 <= q + exp <= 10'
2135 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
2149 // to '1 <= q + exp <= 10'
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)
2182 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
2194 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
2195 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
2260 } else if (exp == 0) {
2264 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
2265 // res = +C * 10^exp (exact)
2266 res = C1 * ten2k64[exp]; // the result is positive