changeset 8590:ebe4e154c5db

Tests for module 'ldexpl'.
author Bruno Haible <bruno@clisp.org>
date Fri, 30 Mar 2007 00:21:34 +0000
parents 3334000e84a6
children 5cba81876885
files ChangeLog modules/ldexpl-tests tests/test-ldexpl.c
diffstat 3 files changed, 133 insertions(+), 0 deletions(-) [+]
line wrap: on
line diff
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,3 +1,8 @@
+2007-03-29  Bruno Haible  <bruno@clisp.org>
+
+	* modules/ldexpl-tests: New file.
+	* tests/test-ldexpl.c: New file.
+
 2007-03-29  Bruno Haible  <bruno@clisp.org>
 
 	* lib/ldexpl.c: Include fpucw.h.
new file mode 100644
--- /dev/null
+++ b/modules/ldexpl-tests
@@ -0,0 +1,15 @@
+Files:
+tests/test-ldexpl.c
+
+Depends-on:
+fpucw
+isnanl-nolibm
+
+configure.ac:
+
+Makefile.am:
+TESTS += test-ldexpl
+check_PROGRAMS += test-ldexpl
+
+License:
+LGPL
new file mode 100644
--- /dev/null
+++ b/tests/test-ldexpl.c
@@ -0,0 +1,113 @@
+/* Test of multiplying a 'long double' by a power of 2.
+   Copyright (C) 2007 Free Software Foundation, Inc.
+
+   This program is free software; you can redistribute it and/or modify
+   it under the terms of the GNU General Public License as published by
+   the Free Software Foundation; either version 2, or (at your option)
+   any later version.
+
+   This program is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, write to the Free Software Foundation,
+   Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.  */
+
+/* Written by Bruno Haible <bruno@clisp.org>, 2007.  */
+
+#include <config.h>
+
+#include <math.h>
+
+#include <float.h>
+#include <stdlib.h>
+
+#include "fpucw.h"
+#include "isnanl-nolibm.h"
+
+#define ASSERT(expr) if (!(expr)) abort ();
+
+int
+main ()
+{
+  int i;
+  long double x;
+  long double y;
+  DECL_LONG_DOUBLE_ROUNDING
+
+  BEGIN_LONG_DOUBLE_ROUNDING ();
+
+  { /* NaN.  */
+    x = 0.0L / 0.0L;
+    y = ldexpl (x, 0); ASSERT (isnanl (y));
+    y = ldexpl (x, 5); ASSERT (isnanl (y));
+    y = ldexpl (x, -5); ASSERT (isnanl (y));
+  }
+
+  { /* Positive infinity.  */
+    x = 1.0L / 0.0L;
+    y = ldexpl (x, 0); ASSERT (y == x);
+    y = ldexpl (x, 5); ASSERT (y == x);
+    y = ldexpl (x, -5); ASSERT (y == x);
+  }
+
+  { /* Negative infinity.  */
+    x = -1.0L / 0.0L;
+    y = ldexpl (x, 0); ASSERT (y == x);
+    y = ldexpl (x, 5); ASSERT (y == x);
+    y = ldexpl (x, -5); ASSERT (y == x);
+  }
+
+  { /* Positive zero.  */
+    x = 0.0L;
+    y = ldexpl (x, 0); ASSERT (y == x);
+    y = ldexpl (x, 5); ASSERT (y == x);
+    y = ldexpl (x, -5); ASSERT (y == x);
+  }
+
+  { /* Negative zero.  */
+    x = -0.0L;
+    y = ldexpl (x, 0); ASSERT (y == x);
+    y = ldexpl (x, 5); ASSERT (y == x);
+    y = ldexpl (x, -5); ASSERT (y == x);
+  }
+
+  { /* Positive finite number.  */
+    x = 1.73205L;
+    y = ldexpl (x, 0); ASSERT (y == x);
+    y = ldexpl (x, 5); ASSERT (y == x * 32.0L);
+    y = ldexpl (x, -5); ASSERT (y == x * 0.03125L);
+  }
+
+  { /* Negative finite number.  */
+    x = -20.085536923187667742L;
+    y = ldexpl (x, 0); ASSERT (y == x);
+    y = ldexpl (x, 5); ASSERT (y == x * 32.0L);
+    y = ldexpl (x, -5); ASSERT (y == x * 0.03125L);
+  }
+
+  for (i = 1, x = 1.73205L; i <= LDBL_MAX_EXP; i++, x *= 2.0L)
+    {
+      y = ldexpl (x, 0); ASSERT (y == x);
+      y = ldexpl (x, 5); ASSERT (y == x * 32.0L);
+      y = ldexpl (x, -5); ASSERT (y == x * 0.03125L);
+    }
+  for (i = 1, x = 1.73205L; i >= LDBL_MIN_EXP; i--, x *= 0.5L)
+    {
+      y = ldexpl (x, 0); ASSERT (y == x);
+      y = ldexpl (x, 5); ASSERT (y == x * 32.0L);
+      if (i - 5 >= LDBL_MIN_EXP)
+	{
+	  y = ldexpl (x, -5); ASSERT (y == x * 0.03125L);
+	}
+    }
+  for (; i >= LDBL_MIN_EXP - 100 && x > 0.0L; i--, x *= 0.5L)
+    {
+      y = ldexpl (x, 0); ASSERT (y == x);
+      y = ldexpl (x, 5); ASSERT (y == x * 32.0L);
+    }
+
+  return 0;
+}