=cut
Not documented yet because experimental is C<PERL_SCAN_SILENT_NON_PORTABLE
-which suppresses any message for non-portable numbers that are still valid
+which suppresses any message for non-portable numbers, but which are valid
on this platform.
*/
return x;
}
+static char*
+S_my_atof_infnan(const char* s, bool negative, const char* send, NV* value)
+{
+ const char *p0 = negative ? s - 1 : s;
+ const char *p = p0;
+ int infnan = grok_infnan(&p, send);
+ if (infnan && p != p0) {
+ /* If we can generate inf/nan directly, let's do so. */
+#ifdef NV_INF
+ if ((infnan & IS_NUMBER_INFINITY)) {
+ *value = (infnan & IS_NUMBER_NEG) ? -NV_INF: NV_INF;
+ return (char*)p;
+ }
+#endif
+#ifdef NV_NAN
+ if ((infnan & IS_NUMBER_NAN)) {
+ *value = NV_NAN;
+ return (char*)p;
+ }
+#endif
+#ifdef Perl_strtod
+ /* If still here, we didn't have either NV_INF or NV_NAN,
+ * and can try falling back to native strtod/strtold.
+ *
+ * (Though, are our NV_INF or NV_NAN ever not defined?)
+ *
+ * The native interface might not recognize all the possible
+ * inf/nan strings Perl recognizes. What we can try
+ * is to try faking the input. We will try inf/-inf/nan
+ * as the most promising/portable input. */
+ {
+ const char* fake = NULL;
+ char* endp;
+ NV nv;
+ if ((infnan & IS_NUMBER_INFINITY)) {
+ fake = ((infnan & IS_NUMBER_NEG)) ? "-inf" : "inf";
+ }
+ else if ((infnan & IS_NUMBER_NAN)) {
+ fake = "nan";
+ }
+ assert(fake);
+ nv = Perl_strtod(fake, &endp);
+ if (fake != endp) {
+ if ((infnan & IS_NUMBER_INFINITY)) {
+#ifdef Perl_isinf
+ if (Perl_isinf(nv))
+ *value = nv;
+#else
+ /* last resort, may generate SIGFPE */
+ *value = Perl_exp((NV)1e9);
+ if ((infnan & IS_NUMBER_NEG))
+ *value = -*value;
+#endif
+ return (char*)p; /* p, not endp */
+ }
+ else if ((infnan & IS_NUMBER_NAN)) {
+#ifdef Perl_isnan
+ if (Perl_isnan(nv))
+ *value = nv;
+#else
+ /* last resort, may generate SIGFPE */
+ *value = Perl_log((NV)-1.0);
+#endif
+ return (char*)p; /* p, not endp */
+ }
+ }
+ }
+#endif /* #ifdef Perl_strtod */
+ }
+ return NULL;
+}
+
char*
Perl_my_atof2(pTHX_ const char* orig, NV* value)
{
}
{
- const char *p0 = negative ? s - 1 : s;
- const char *p = p0;
- int infnan = grok_infnan(&p, send);
- if (infnan && p != p0) {
- /* If we can generate inf/nan directly, let's do so. */
-#ifdef NV_INF
- if ((infnan & IS_NUMBER_INFINITY)) {
- *value = (infnan & IS_NUMBER_NEG) ? -NV_INF: NV_INF;
- return (char*)p;
- }
-#endif
-#ifdef NV_NAN
- if ((infnan & IS_NUMBER_NAN)) {
- *value = NV_NAN;
- return (char*)p;
- }
-#endif
-#ifdef Perl_strtod
- /* If still here, we didn't have either NV_INF or INV_NAN,
- * and can try falling back to native strtod/strtold.
- *
- * The native interface might not recognize all the possible
- * inf/nan strings Perl recognizes. What we can try
- * is to try faking the input. We will try inf/-inf/nan
- * as the most promising/portable input. */
- {
- const char* fake = NULL;
- char* endp;
- NV nv;
- if ((infnan & IS_NUMBER_INFINITY)) {
- fake = ((infnan & IS_NUMBER_NEG)) ? "-inf" : "inf";
- }
- else if ((infnan & IS_NUMBER_NAN)) {
- fake = "nan";
- }
- assert(fake);
- nv = Perl_strtod(fake, &endp);
- if (fake != endp) {
- if ((infnan & IS_NUMBER_INFINITY)) {
-#ifdef Perl_isinf
- if (Perl_isinf(nv))
- *value = nv;
-#else
- /* last resort, may generate SIGFPE */
- *value = Perl_exp((NV)1e9);
- if ((infnan & IS_NUMBER_NEG))
- *value = -*value;
-#endif
- return (char*)p; /* p, not endp */
- }
- else if ((infnan & IS_NUMBER_NAN)) {
-#ifdef Perl_isnan
- if (Perl_isnan(nv))
- *value = nv;
-#else
- /* last resort, may generate SIGFPE */
- *value = Perl_log((NV)-1.0);
-#endif
- return (char*)p; /* p, not endp */
- }
- }
- }
-#endif /* #ifdef Perl_strtod */
- }
+ const char* endp;
+ if ((endp = S_my_atof_infnan(s, negative, send, value)))
+ return (char*)endp;
}
/* we accumulate digits into an integer; when this becomes too
argument is either an infinity or a NaN, false otherwise. To test
in more detail, use Perl_isinf() and Perl_isnan().
+This is also the logical inverse of Perl_isfinite().
+
=cut
*/
bool
return FALSE;
}
-#if ! defined(HAS_MODFL) && defined(HAS_AINTL) && defined(HAS_COPYSIGNL)
+#ifndef HAS_MODFL
+/* C99 has truncl, pre-C99 Solaris had aintl. We can use either with
+ * copysignl to emulate modfl, which is in some platforms missing or
+ * broken. */
+# if defined(HAS_TRUNCL) && defined(HAS_COPYSIGNL)
long double
Perl_my_modfl(long double x, long double *ip)
{
- *ip = aintl(x);
- return (x == *ip ? copysignl(0.0L, x) : x - *ip);
+ *ip = truncl(x);
+ return (x == *ip ? copysignl(0.0L, x) : x - *ip);
}
+# elif defined(HAS_AINTL) && defined(HAS_COPYSIGNL)
+long double
+Perl_my_modfl(long double x, long double *ip)
+{
+ *ip = aintl(x);
+ return (x == *ip ? copysignl(0.0L, x) : x - *ip);
+}
+# endif
#endif
+/* Similarly, with ilobl and scalbnl we can emulate frexpl. */
#if ! defined(HAS_FREXPL) && defined(HAS_ILOGBL) && defined(HAS_SCALBNL)
long double
Perl_my_frexpl(long double x, int *e) {
- *e = x == 0.0L ? 0 : ilogbl(x) + 1;
- return (scalbnl(x, -*e));
+ *e = x == 0.0L ? 0 : ilogbl(x) + 1;
+ return (scalbnl(x, -*e));
}
#endif