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
142 // to '1 <= q + exp <= 10'
143 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
157 // to '1 <= q + exp <= 10'
159 } else { // if n > 0 and q + exp = 10
176 // to '1 <= q + exp <= 10'
177 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
191 // to '1 <= q + exp <= 10'
197 if ((q + exp) < 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
201 } else if ((q + exp) == 0) { // n = +/-0.c(0)c(1)...c(q-1)
214 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
217 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
218 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
267 } else if (exp == 0) {
274 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
275 // res = +/-C * 10^exp (exact)
277 res = -C1 * ten2k64[exp];
279 res = C1 * ten2k64[exp];
304 int exp; // unbiased exponent
370 exp = x_exp - 398; // unbiased exponent
372 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
378 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
383 // under '1 <= q + exp <= 10'
384 if (x_sign) { // if n < 0 and q + exp = 10
401 // to '1 <= q + exp <= 10'
402 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
416 // to '1 <= q + exp <= 10'
418 } else { // if n > 0 and q + exp = 10
435 // to '1 <= q + exp <= 10'
436 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
450 // to '1 <= q + exp <= 10'
456 if ((q + exp) < 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
462 } else if ((q + exp) == 0) { // n = +/-0.c(0)c(1)...c(q-1)
477 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
480 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
481 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
566 } else if (exp == 0) {
573 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
574 // res = +/-C * 10^exp (exact)
576 res = -C1 * ten2k64[exp];
578 res = C1 * ten2k64[exp];
603 int exp; // unbiased exponent
669 exp = x_exp - 398; // unbiased exponent
671 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
677 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
682 // under '1 <= q + exp <= 10'
683 if (x_sign) { // if n < 0 and q + exp = 10
700 // to '1 <= q + exp <= 10'
701 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
715 // to '1 <= q + exp <= 10'
717 } else { // if n > 0 and q + exp = 10
734 // to '1 <= q + exp <= 10'
735 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
749 // to '1 <= q + exp <= 10'
755 if ((q + exp) <= 0) { // n = +/-0.[0...0]c(0)c(1)...c(q-1)
762 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
765 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
766 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
817 } else if (exp == 0) {
824 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
825 // res = +/-C * 10^exp (exact)
827 res = -C1 * ten2k64[exp];
829 res = C1 * ten2k64[exp];
854 int exp; // unbiased exponent
920 exp = x_exp - 398; // unbiased exponent
922 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
928 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
933 // under '1 <= q + exp <= 10'
934 if (x_sign) { // if n < 0 and q + exp = 10
951 // to '1 <= q + exp <= 10'
952 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
966 // to '1 <= q + exp <= 10'
968 } else { // if n > 0 and q + exp = 10
985 // to '1 <= q + exp <= 10'
986 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
1000 // to '1 <= q + exp <= 10'
1006 if ((q + exp) <= 0) { // n = +/-0.[0...0]c(0)c(1)...c(q-1)
1015 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
1018 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
1019 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
1074 } else if (exp == 0) {
1081 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
1082 // res = +/-C * 10^exp (exact)
1084 res = -C1 * ten2k64[exp];
1086 res = C1 * ten2k64[exp];
1111 int exp; // unbiased exponent
1177 exp = x_exp - 398; // unbiased exponent
1179 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
1185 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
1190 // under '1 <= q + exp <= 10'
1191 if (x_sign) { // if n < 0 and q + exp = 10
1208 // to '1 <= q + exp <= 10'
1209 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
1223 // to '1 <= q + exp <= 10'
1225 } else { // if n > 0 and q + exp = 10
1242 // to '1 <= q + exp <= 10'
1243 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
1257 // to '1 <= q + exp <= 10'
1263 if ((q + exp) <= 0) { // n = +/-0.[0...0]c(0)c(1)...c(q-1)
1270 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
1273 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
1274 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
1325 } else if (exp == 0) {
1332 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
1333 // res = +/-C * 10^exp (exact)
1335 res = -C1 * ten2k64[exp];
1337 res = C1 * ten2k64[exp];
1362 int exp; // unbiased exponent
1428 exp = x_exp - 398; // unbiased exponent
1430 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
1436 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
1441 // under '1 <= q + exp <= 10'
1442 if (x_sign) { // if n < 0 and q + exp = 10
1459 // to '1 <= q + exp <= 10'
1460 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
1474 // to '1 <= q + exp <= 10'
1476 } else { // if n > 0 and q + exp = 10
1493 // to '1 <= q + exp <= 10'
1494 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
1508 // to '1 <= q + exp <= 10'
1514 if ((q + exp) <= 0) { // n = +/-0.[0...0]c(0)c(1)...c(q-1)
1523 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
1526 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
1527 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
1582 } else if (exp == 0) {
1589 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
1590 // res = +/-C * 10^exp (exact)
1592 res = -C1 * ten2k64[exp];
1594 res = C1 * ten2k64[exp];
1619 int exp; // unbiased exponent
1684 exp = x_exp - 398; // unbiased exponent
1686 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
1692 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
1697 // under '1 <= q + exp <= 10'
1698 if (x_sign) { // if n < 0 and q + exp = 10
1715 // to '1 <= q + exp <= 10'
1716 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
1730 // to '1 <= q + exp <= 10'
1732 } else { // if n > 0 and q + exp = 10
1749 // to '1 <= q + exp <= 10'
1750 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
1764 // to '1 <= q + exp <= 10'
1770 if ((q + exp) <= 0) { // n = +/-0.[0...0]c(0)c(1)...c(q-1)
1774 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
1777 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
1778 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
1804 } else if (exp == 0) {
1811 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
1812 // res = +/-C * 10^exp (exact)
1814 res = -C1 * ten2k64[exp];
1816 res = C1 * ten2k64[exp];
1841 int exp; // unbiased exponent
1907 exp = x_exp - 398; // unbiased exponent
1909 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
1915 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
1920 // under '1 <= q + exp <= 10'
1921 if (x_sign) { // if n < 0 and q + exp = 10
1938 // to '1 <= q + exp <= 10'
1939 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
1953 // to '1 <= q + exp <= 10'
1955 } else { // if n > 0 and q + exp = 10
1972 // to '1 <= q + exp <= 10'
1973 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
1987 // to '1 <= q + exp <= 10'
1993 if ((q + exp) <= 0) { // n = +/-0.[0...0]c(0)c(1)...c(q-1)
1999 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
2002 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
2003 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
2052 } else if (exp == 0) {
2059 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
2060 // res = +/-C * 10^exp (exact)
2062 res = -C1 * ten2k64[exp];
2064 res = C1 * ten2k64[exp];
2089 int exp; // unbiased exponent
2154 exp = x_exp - 398; // unbiased exponent
2156 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
2162 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
2167 // under '1 <= q + exp <= 10'
2168 if (x_sign) { // if n < 0 and q + exp = 10
2185 // to '1 <= q + exp <= 10'
2186 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
2200 // to '1 <= q + exp <= 10'
2202 } else { // if n > 0 and q + exp = 10
2219 // to '1 <= q + exp <= 10'
2220 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
2234 // to '1 <= q + exp <= 10'
2240 if ((q + exp) < 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
2244 } else if ((q + exp) == 0) { // n = +/-0.c(0)c(1)...c(q-1)
2257 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
2260 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
2261 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
2290 } else if (exp == 0) {
2297 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
2298 // res = +/-C * 10^exp (exact)
2300 res = -C1 * ten2k64[exp];
2302 res = C1 * ten2k64[exp];
2327 int exp; // unbiased exponent
2393 exp = x_exp - 398; // unbiased exponent
2395 if ((q + exp) > 10) { // x >= 10^10 ~= 2^33.2... (cannot fit in 32 bits)
2401 } else if ((q + exp) == 10) { // x = c(0)c(1)...c(9).c(10)...c(q-1)
2406 // under '1 <= q + exp <= 10'
2407 if (x_sign) { // if n < 0 and q + exp = 10
2424 // to '1 <= q + exp <= 10'
2425 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
2439 // to '1 <= q + exp <= 10'
2441 } else { // if n > 0 and q + exp = 10
2458 // to '1 <= q + exp <= 10'
2459 } else { // if (q > 11), i.e. 12 <= q <= 16 and so -15 <= exp <= -2
2473 // to '1 <= q + exp <= 10'
2479 if ((q + exp) < 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
2485 } else if ((q + exp) == 0) { // n = +/-0.c(0)c(1)...c(q-1)
2500 } else { // if (1 <= q + exp <= 10, 1 <= q <= 16, -15 <= exp <= 9)
2503 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 10
2504 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
2571 } else if (exp == 0) {
2578 } else { // if (exp > 0) => 1 <= exp <= 9, 1 <= q < 9, 2 <= q + exp <= 10
2579 // res = +/-C * 10^exp (exact)
2581 res = -C1 * ten2k64[exp];
2583 res = C1 * ten2k64[exp];