projects
/
gnulib.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
avoid some overlong lines from posix urls, etc.
[gnulib.git]
/
m4
/
isnanl.m4
diff --git
a/m4/isnanl.m4
b/m4/isnanl.m4
index
fb63ac4
..
25daeca
100644
(file)
--- a/
m4/isnanl.m4
+++ b/
m4/isnanl.m4
@@
-1,5
+1,5
@@
-# isnanl.m4 serial 1
1
-dnl Copyright (C) 2007-20
09
Free Software Foundation, Inc.
+# isnanl.m4 serial 1
2
+dnl Copyright (C) 2007-20
10
Free Software Foundation, Inc.
dnl This file is free software; the Free Software Foundation
dnl gives unlimited permission to copy and/or distribute it,
dnl with or without modifications, as long as this notice is preserved.
dnl This file is free software; the Free Software Foundation
dnl gives unlimited permission to copy and/or distribute it,
dnl with or without modifications, as long as this notice is preserved.
@@
-133,20
+133,30
@@
AC_DEFUN([gl_FUNC_ISNANL_WORKS],
((sizeof (long double) + sizeof (unsigned int) - 1) / sizeof (unsigned int))
typedef union { unsigned int word[NWORDS]; long double value; }
memory_long_double;
((sizeof (long double) + sizeof (unsigned int) - 1) / sizeof (unsigned int))
typedef union { unsigned int word[NWORDS]; long double value; }
memory_long_double;
+/* On Irix 6.5, gcc 3.4.3 can't compute compile-time NaN, and needs the
+ runtime type conversion. */
+#ifdef __sgi
+static long double NaNl ()
+{
+ double zero = 0.0;
+ return zero / zero;
+}
+#else
+# define NaNl() (0.0L / 0.0L)
+#endif
int main ()
{
memory_long_double m;
unsigned int i;
int main ()
{
memory_long_double m;
unsigned int i;
- /* gcc-3.4.3 on IRIX 6.5 appears to have a problem with this. */
- if (!isnanl (0.0L / 0.0L))
+ if (!isnanl (NaNl ()))
return 1;
/* The isnanl function should be immune against changes in the sign bit and
in the mantissa bits. The xor operation twiddles a bit that can only be
a sign bit or a mantissa bit (since the exponent never extends to
bit 31). */
return 1;
/* The isnanl function should be immune against changes in the sign bit and
in the mantissa bits. The xor operation twiddles a bit that can only be
a sign bit or a mantissa bit (since the exponent never extends to
bit 31). */
- m.value =
0.0L / 0.0L
;
+ m.value =
NaNl ()
;
m.word[NWORDS / 2] ^= (unsigned int) 1 << (sizeof (unsigned int) * CHAR_BIT - 1);
for (i = 0; i < NWORDS; i++)
m.word[i] |= 1;
m.word[NWORDS / 2] ^= (unsigned int) 1 << (sizeof (unsigned int) * CHAR_BIT - 1);
for (i = 0; i < NWORDS; i++)
m.word[i] |= 1;