Lines Matching refs:exp
45 int exp; // unbiased exponent
111 exp = x_exp - 398; // unbiased exponent
113 if ((q + exp) > 19) { // x >= 10^19 ~= 2^63.11... (cannot fit in SINT64)
119 } else if ((q + exp) == 19) { // x = c(0)c(1)...c(18).c(19)...c(q-1)
124 // under '1 <= q + exp <= 19'
125 if (x_sign) { // if n < 0 and q + exp = 19
142 // to '1 <= q + exp <= 19'
143 } else { // if n > 0 and q + exp = 19
162 // to '1 <= q + exp <= 19'
163 } // end else if n > 0 and q + exp = 19
164 } // end else if ((q + exp) == 19)
168 if ((q + exp) < 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
172 } else if ((q + exp) == 0) { // n = +/-0.c(0)c(1)...c(q-1)
185 } else { // if (1 <= q + exp <= 19, 1 <= q <= 16, -15 <= exp <= 18)
188 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 19
189 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
238 } else if (exp == 0) {
245 } else { // if (exp > 0) => 1 <= exp <= 18, 1 <= q <= 16, 2 <= q + exp <= 20
246 // (the upper limit of 20 on q + exp is due to the fact that
247 // +/-C * 10^exp is guaranteed to fit in 64 bits)
248 // res = +/-C * 10^exp (exact)
250 res = -C1 * ten2k64[exp];
252 res = C1 * ten2k64[exp];
277 int exp; // unbiased exponent
344 exp = x_exp - 398; // unbiased exponent
346 if ((q + exp) > 19) { // x >= 10^19 ~= 2^63.11... (cannot fit in SINT64)
352 } else if ((q + exp) == 19) { // x = c(0)c(1)...c(18).c(19)...c(q-1)
357 // under '1 <= q + exp <= 19'
358 if (x_sign) { // if n < 0 and q + exp = 19
375 // to '1 <= q + exp <= 19'
376 } else { // if n > 0 and q + exp = 19
395 // to '1 <= q + exp <= 19'
396 } // end else if n > 0 and q + exp = 19
397 } // end else if ((q + exp) == 19)
401 if ((q + exp) < 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
407 } else if ((q + exp) == 0) { // n = +/-0.c(0)c(1)...c(q-1)
422 } else { // if (1 <= q + exp <= 19, 1 <= q <= 16, -15 <= exp <= 18)
425 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 19
426 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
511 } else if (exp == 0) {
518 } else { // if (exp > 0) => 1 <= exp <= 18, 1 <= q <= 16, 2 <= q + exp <= 20
519 // (the upper limit of 20 on q + exp is due to the fact that
520 // +/-C * 10^exp is guaranteed to fit in 64 bits)
521 // res = +/-C * 10^exp (exact)
523 res = -C1 * ten2k64[exp];
525 res = C1 * ten2k64[exp];
550 int exp; // unbiased exponent
616 exp = x_exp - 398; // unbiased exponent
618 if ((q + exp) > 19) { // x >= 10^19 ~= 2^63.11... (cannot fit in SINT64)
624 } else if ((q + exp) == 19) { // x = c(0)c(1)...c(18).c(19)...c(q-1)
629 // under '1 <= q + exp <= 19'
630 if (x_sign) { // if n < 0 and q + exp = 19
647 // to '1 <= q + exp <= 19'
648 } else { // if n > 0 and q + exp = 19
667 // to '1 <= q + exp <= 19'
668 } // end else if n > 0 and q + exp = 19
669 } // end else if ((q + exp) == 19)
673 if ((q + exp) <= 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
680 } else { // if (1 <= q + exp <= 19, 1 <= q <= 16, -15 <= exp <= 18)
683 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 19
684 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
735 } else if (exp == 0) {
742 } else { // if (exp > 0) => 1 <= exp <= 18, 1 <= q <= 16, 2 <= q + exp <= 20
743 // (the upper limit of 20 on q + exp is due to the fact that
744 // +/-C * 10^exp is guaranteed to fit in 64 bits)
745 // res = +/-C * 10^exp (exact)
747 res = -C1 * ten2k64[exp];
749 res = C1 * ten2k64[exp];
774 int exp; // unbiased exponent
840 exp = x_exp - 398; // unbiased exponent
842 if ((q + exp) > 19) { // x >= 10^19 ~= 2^63.11... (cannot fit in SINT64)
848 } else if ((q + exp) == 19) { // x = c(0)c(1)...c(18).c(19)...c(q-1)
853 // under '1 <= q + exp <= 19'
854 if (x_sign) { // if n < 0 and q + exp = 19
871 // to '1 <= q + exp <= 19'
872 } else { // if n > 0 and q + exp = 19
891 // to '1 <= q + exp <= 19'
892 } // end else if n > 0 and q + exp = 19
893 } // end else if ((q + exp) == 19)
897 if ((q + exp) <= 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
906 } else { // if (1 <= q + exp <= 19, 1 <= q <= 16, -15 <= exp <= 18)
909 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 19
910 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
965 } else if (exp == 0) {
972 } else { // if (exp > 0) => 1 <= exp <= 18, 1 <= q <= 16, 2 <= q + exp <= 20
973 // (the upper limit of 20 on q + exp is due to the fact that
974 // +/-C * 10^exp is guaranteed to fit in 64 bits)
975 // res = +/-C * 10^exp (exact)
977 res = -C1 * ten2k64[exp];
979 res = C1 * ten2k64[exp];
1004 int exp; // unbiased exponent
1070 exp = x_exp - 398; // unbiased exponent
1072 if ((q + exp) > 19) { // x >= 10^19 ~= 2^63.11... (cannot fit in SINT64)
1078 } else if ((q + exp) == 19) { // x = c(0)c(1)...c(18).c(19)...c(q-1)
1083 // under '1 <= q + exp <= 19'
1084 if (x_sign) { // if n < 0 and q + exp = 19
1101 // to '1 <= q + exp <= 19'
1102 } else { // if n > 0 and q + exp = 19
1121 // to '1 <= q + exp <= 19'
1122 } // end else if n > 0 and q + exp = 19
1123 } // end else if ((q + exp) == 19)
1127 if ((q + exp) <= 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
1134 } else { // if (1 <= q + exp <= 19, 1 <= q <= 16, -15 <= exp <= 18)
1137 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 19
1138 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
1189 } else if (exp == 0) {
1196 } else { // if (exp > 0) => 1 <= exp <= 18, 1 <= q <= 16, 2 <= q + exp <= 20
1197 // (the upper limit of 20 on q + exp is due to the fact that
1198 // +/-C * 10^exp is guaranteed to fit in 64 bits)
1199 // res = +/-C * 10^exp (exact)
1201 res = -C1 * ten2k64[exp];
1203 res = C1 * ten2k64[exp];
1228 int exp; // unbiased exponent
1294 exp = x_exp - 398; // unbiased exponent
1296 if ((q + exp) > 19) { // x >= 10^19 ~= 2^63.11... (cannot fit in SINT64)
1302 } else if ((q + exp) == 19) { // x = c(0)c(1)...c(18).c(19)...c(q-1)
1307 // under '1 <= q + exp <= 19'
1308 if (x_sign) { // if n < 0 and q + exp = 19
1325 // to '1 <= q + exp <= 19'
1326 } else { // if n > 0 and q + exp = 19
1345 // to '1 <= q + exp <= 19'
1346 } // end else if n > 0 and q + exp = 19
1347 } // end else if ((q + exp) == 19)
1351 if ((q + exp) <= 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
1360 } else { // if (1 <= q + exp <= 19, 1 <= q <= 16, -15 <= exp <= 18)
1363 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 19
1364 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
1419 } else if (exp == 0) {
1426 } else { // if (exp > 0) => 1 <= exp <= 18, 1 <= q <= 16, 2 <= q + exp <= 20
1427 // (the upper limit of 20 on q + exp is due to the fact that
1428 // +/-C * 10^exp is guaranteed to fit in 64 bits)
1429 // res = +/-C * 10^exp (exact)
1431 res = -C1 * ten2k64[exp];
1433 res = C1 * ten2k64[exp];
1456 int exp; // unbiased exponent
1521 exp = x_exp - 398; // unbiased exponent
1523 if ((q + exp) > 19) { // x >= 10^19 ~= 2^63.11... (cannot fit in SINT64)
1529 } else if ((q + exp) == 19) { // x = c(0)c(1)...c(18).c(19)...c(q-1)
1534 // under '1 <= q + exp <= 19'
1535 if (x_sign) { // if n < 0 and q + exp = 19
1552 // to '1 <= q + exp <= 19'
1553 } else { // if n > 0 and q + exp = 19
1572 // to '1 <= q + exp <= 19'
1573 } // end else if n > 0 and q + exp = 19
1574 } // end else if ((q + exp) == 19)
1578 if ((q + exp) <= 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
1582 } else { // if (1 <= q + exp <= 19, 1 <= q <= 16, -15 <= exp <= 18)
1585 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 19
1586 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
1613 } else if (exp == 0) {
1620 } else { // if (exp > 0) => 1 <= exp <= 18, 1 <= q <= 16, 2 <= q + exp <= 20
1621 // (the upper limit of 20 on q + exp is due to the fact that
1622 // +/-C * 10^exp is guaranteed to fit in 64 bits)
1623 // res = +/-C * 10^exp (exact)
1625 res = -C1 * ten2k64[exp];
1627 res = C1 * ten2k64[exp];
1652 int exp; // unbiased exponent
1718 exp = x_exp - 398; // unbiased exponent
1720 if ((q + exp) > 19) { // x >= 10^19 ~= 2^63.11... (cannot fit in SINT64)
1726 } else if ((q + exp) == 19) { // x = c(0)c(1)...c(18).c(19)...c(q-1)
1731 // under '1 <= q + exp <= 19'
1732 if (x_sign) { // if n < 0 and q + exp = 19
1749 // to '1 <= q + exp <= 19'
1750 } else { // if n > 0 and q + exp = 19
1769 // to '1 <= q + exp <= 19'
1770 } // end else if n > 0 and q + exp = 19
1771 } // end else if ((q + exp) == 19)
1775 if ((q + exp) <= 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
1781 } else { // if (1 <= q + exp <= 19, 1 <= q <= 16, -15 <= exp <= 18)
1784 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 19
1785 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
1833 } else if (exp == 0) {
1840 } else { // if (exp > 0) => 1 <= exp <= 18, 1 <= q <= 16, 2 <= q + exp <= 20
1841 // (the upper limit of 20 on q + exp is due to the fact that
1842 // +/-C * 10^exp is guaranteed to fit in 64 bits)
1843 // res = +/-C * 10^exp (exact)
1845 res = -C1 * ten2k64[exp];
1847 res = C1 * ten2k64[exp];
1872 int exp; // unbiased exponent
1937 exp = x_exp - 398; // unbiased exponent
1939 if ((q + exp) > 19) { // x >= 10^19 ~= 2^63.11... (cannot fit in SINT64)
1945 } else if ((q + exp) == 19) { // x = c(0)c(1)...c(18).c(19)...c(q-1)
1950 // under '1 <= q + exp <= 19'
1951 if (x_sign) { // if n < 0 and q + exp = 19
1968 // to '1 <= q + exp <= 19'
1969 } else { // if n > 0 and q + exp = 19
1988 // to '1 <= q + exp <= 19'
1989 } // end else if n > 0 and q + exp = 19
1990 } // end else if ((q + exp) == 19)
1994 if ((q + exp) < 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
1998 } else if ((q + exp) == 0) { // n = +/-0.c(0)c(1)...c(q-1)
2011 } else { // if (1 <= q + exp <= 19, 1 <= q <= 16, -15 <= exp <= 18)
2014 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 19
2015 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
2050 } else if (exp == 0) {
2057 } else { // if (exp > 0) => 1 <= exp <= 18, 1 <= q <= 16, 2 <= q + exp <= 20
2058 // (the upper limit of 20 on q + exp is due to the fact that
2059 // +/-C * 10^exp is guaranteed to fit in 64 bits)
2060 // res = +/-C * 10^exp (exact)
2062 res = -C1 * ten2k64[exp];
2064 res = C1 * ten2k64[exp];
2089 int exp; // unbiased exponent
2156 exp = x_exp - 398; // unbiased exponent
2158 if ((q + exp) > 19) { // x >= 10^19 ~= 2^63.11... (cannot fit in SINT64)
2164 } else if ((q + exp) == 19) { // x = c(0)c(1)...c(18).c(19)...c(q-1)
2169 // under '1 <= q + exp <= 19'
2170 if (x_sign) { // if n < 0 and q + exp = 19
2187 // to '1 <= q + exp <= 19'
2188 } else { // if n > 0 and q + exp = 19
2207 // to '1 <= q + exp <= 19'
2208 } // end else if n > 0 and q + exp = 19
2209 } // end else if ((q + exp) == 19)
2213 if ((q + exp) < 0) { // n = +/-0.0...c(0)c(1)...c(q-1)
2219 } else if ((q + exp) == 0) { // n = +/-0.c(0)c(1)...c(q-1)
2234 } else { // if (1 <= q + exp <= 19, 1 <= q <= 16, -15 <= exp <= 18)
2237 if (exp < 0) { // 2 <= q <= 16, -15 <= exp <= -1, 1 <= q + exp <= 19
2238 ind = -exp; // 1 <= ind <= 15; ind is a synonym for 'x'
2311 } else if (exp == 0) {
2318 } else { // if (exp > 0) => 1 <= exp <= 18, 1 <= q <= 16, 2 <= q + exp <= 20
2319 // (the upper limit of 20 on q + exp is due to the fact that
2320 // +/-C * 10^exp is guaranteed to fit in 64 bits)
2321 // res = +/-C * 10^exp (exact)
2323 res = -C1 * ten2k64[exp];
2325 res = C1 * ten2k64[exp];