summaryrefslogtreecommitdiffstats
path: root/tools
diff options
context:
space:
mode:
authordas <das@FreeBSD.org>2007-12-15 09:16:26 +0000
committerdas <das@FreeBSD.org>2007-12-15 09:16:26 +0000
commit9a8df6cba78483c7a0813bbdd0de92eed7272231 (patch)
tree51426d7b2c96082075f399742661ad703480d114 /tools
parent53fc314c85e10d346c45d3552db14e1d5137656c (diff)
downloadFreeBSD-src-9a8df6cba78483c7a0813bbdd0de92eed7272231.zip
FreeBSD-src-9a8df6cba78483c7a0813bbdd0de92eed7272231.tar.gz
Regression tests for csqrt(3).
Diffstat (limited to 'tools')
-rw-r--r--tools/regression/lib/msun/Makefile3
-rw-r--r--tools/regression/lib/msun/test-csqrt.c294
-rw-r--r--tools/regression/lib/msun/test-csqrt.t10
3 files changed, 306 insertions, 1 deletions
diff --git a/tools/regression/lib/msun/Makefile b/tools/regression/lib/msun/Makefile
index 696cf30..eb26878 100644
--- a/tools/regression/lib/msun/Makefile
+++ b/tools/regression/lib/msun/Makefile
@@ -1,6 +1,7 @@
# $FreeBSD$
-TESTS= test-fenv test-ilogb test-lrint test-lround test-next test-rem
+TESTS= test-csqrt test-fenv test-ilogb test-lrint \
+ test-lround test-next test-rem
CFLAGS+= -O0 -lm
ARCH!= uname -m
diff --git a/tools/regression/lib/msun/test-csqrt.c b/tools/regression/lib/msun/test-csqrt.c
new file mode 100644
index 0000000..b5bc241
--- /dev/null
+++ b/tools/regression/lib/msun/test-csqrt.c
@@ -0,0 +1,294 @@
+/*-
+ * Copyright (c) 2007 David Schultz <das@FreeBSD.org>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ * notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ * notice, this list of conditions and the following disclaimer in the
+ * documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ */
+
+/*
+ * Tests for csqrt{,f}()
+ */
+
+#include <sys/cdefs.h>
+__FBSDID("$FreeBSD$");
+
+#include <assert.h>
+#include <complex.h>
+#include <float.h>
+#include <math.h>
+#include <stdio.h>
+
+#define N(i) (sizeof(i) / sizeof((i)[0]))
+
+/*
+ * This is a test hook that can point to csqrt(), or to _csqrtf(),
+ * which converts to float and tests csqrtf() with the same arguments.
+ */
+double complex (*t_csqrt)(double complex);
+
+static double complex
+_csqrtf(double complex d)
+{
+
+ return (csqrtf((float complex)d));
+}
+
+#pragma STDC CX_LIMITED_RANGE off
+
+/*
+ * XXX gcc implements complex multiplication incorrectly. In
+ * particular, it implements it as if the CX_LIMITED_RANGE pragma
+ * were ON. Consequently, we need this function to form numbers
+ * such as x + INFINITY * I, since gcc evalutes INFINITY * I as
+ * NaN + INFINITY * I.
+ */
+static inline double complex
+cpack(double x, double y)
+{
+ double complex z;
+
+ __real__ z = x;
+ __imag__ z = y;
+ return (z);
+}
+
+/*
+ * Compare d1 and d2 using special rules: NaN == NaN and +0 != -0.
+ * Fail an assertion if they differ.
+ */
+static void
+assert_equal(double complex d1, double complex d2)
+{
+
+ if (isnan(creal(d1))) {
+ assert(isnan(creal(d2)));
+ } else {
+ assert(creal(d1) == creal(d2));
+ assert(copysign(1.0, creal(d1)) == copysign(1.0, creal(d2)));
+ }
+ if (isnan(cimag(d1))) {
+ assert(isnan(cimag(d2)));
+ } else {
+ assert(cimag(d1) == cimag(d2));
+ assert(copysign(1.0, cimag(d1)) == copysign(1.0, cimag(d2)));
+ }
+}
+
+/*
+ * Test csqrt for some finite arguments where the answer is exact.
+ * (We do not test if it produces correctly rounded answers when the
+ * result is inexact, nor do we check whether it throws spurious
+ * exceptions.)
+ */
+static void
+test_finite()
+{
+ static const double tests[] = {
+ /* csqrt(a + bI) = x + yI */
+ /* a b x y */
+ 0, 8, 2, 2,
+ 0, -8, 2, -2,
+ 4, 0, 2, 0,
+ -4, 0, 0, 2,
+ 3, 4, 2, 1,
+ 3, -4, 2, -1,
+ -3, 4, 1, 2,
+ -3, -4, 1, -2,
+ 5, 12, 3, 2,
+ 7, 24, 4, 3,
+ 9, 40, 5, 4,
+ 11, 60, 6, 5,
+ 13, 84, 7, 6,
+ 33, 56, 7, 4,
+ 39, 80, 8, 5,
+ 65, 72, 9, 4,
+ 987, 9916, 74, 67,
+ 5289, 6640, 83, 40,
+ 460766389075.0, 16762287900.0, 678910, 12345
+ };
+ /*
+ * We also test some multiples of the above arguments. This
+ * array defines which multiples we use. Note that these have
+ * to be small enough to not cause overflow for float precision
+ * with all of the constants in the above table.
+ */
+ static const double mults[] = {
+ 1,
+ 2,
+ 3,
+ 13,
+ 16,
+ 0x1.p30,
+ 0x1.p-30,
+ };
+
+ double a, b;
+ double x, y;
+ int i, j;
+
+ for (i = 0; i < N(tests); i += 4) {
+ for (j = 0; j < N(mults); j++) {
+ a = tests[i] * mults[j] * mults[j];
+ b = tests[i + 1] * mults[j] * mults[j];
+ x = tests[i + 2] * mults[j];
+ y = tests[i + 3] * mults[j];
+ assert(t_csqrt(cpack(a, b)) == cpack(x, y));
+ }
+ }
+
+}
+
+/*
+ * Test the handling of +/- 0.
+ */
+static void
+test_zeros()
+{
+
+ assert_equal(t_csqrt(cpack(0.0, 0.0)), cpack(0.0, 0.0));
+ assert_equal(t_csqrt(cpack(-0.0, 0.0)), cpack(0.0, 0.0));
+ assert_equal(t_csqrt(cpack(0.0, -0.0)), cpack(0.0, -0.0));
+ assert_equal(t_csqrt(cpack(-0.0, -0.0)), cpack(0.0, -0.0));
+}
+
+/*
+ * Test the handling of infinities when the other argument is not NaN.
+ */
+static void
+test_infinities()
+{
+ static const double vals[] = {
+ 0.0,
+ -0.0,
+ 42.0,
+ -42.0,
+ INFINITY,
+ -INFINITY,
+ };
+
+ int i;
+
+ for (i = 0; i < N(vals); i++) {
+ if (isfinite(vals[i])) {
+ assert_equal(t_csqrt(cpack(-INFINITY, vals[i])),
+ cpack(0.0, copysign(INFINITY, vals[i])));
+ assert_equal(t_csqrt(cpack(INFINITY, vals[i])),
+ cpack(INFINITY, copysign(0.0, vals[i])));
+ }
+ assert_equal(t_csqrt(cpack(vals[i], INFINITY)),
+ cpack(INFINITY, INFINITY));
+ assert_equal(t_csqrt(cpack(vals[i], -INFINITY)),
+ cpack(INFINITY, -INFINITY));
+ }
+}
+
+/*
+ * Test the handling of NaNs.
+ */
+static void
+test_nans()
+{
+
+ assert(creal(t_csqrt(cpack(INFINITY, NAN))) == INFINITY);
+ assert(isnan(cimag(t_csqrt(cpack(INFINITY, NAN)))));
+
+ assert(isnan(creal(t_csqrt(cpack(-INFINITY, NAN)))));
+ assert(isinf(cimag(t_csqrt(cpack(-INFINITY, NAN)))));
+
+ assert_equal(t_csqrt(cpack(NAN, INFINITY)), cpack(INFINITY, INFINITY));
+ assert_equal(t_csqrt(cpack(NAN, -INFINITY)),
+ cpack(INFINITY, -INFINITY));
+
+ assert_equal(t_csqrt(cpack(0.0, NAN)), cpack(NAN, NAN));
+ assert_equal(t_csqrt(cpack(-0.0, NAN)), cpack(NAN, NAN));
+ assert_equal(t_csqrt(cpack(42.0, NAN)), cpack(NAN, NAN));
+ assert_equal(t_csqrt(cpack(-42.0, NAN)), cpack(NAN, NAN));
+ assert_equal(t_csqrt(cpack(NAN, 0.0)), cpack(NAN, NAN));
+ assert_equal(t_csqrt(cpack(NAN, -0.0)), cpack(NAN, NAN));
+ assert_equal(t_csqrt(cpack(NAN, 42.0)), cpack(NAN, NAN));
+ assert_equal(t_csqrt(cpack(NAN, -42.0)), cpack(NAN, NAN));
+ assert_equal(t_csqrt(cpack(NAN, NAN)), cpack(NAN, NAN));
+}
+
+/*
+ * Test whether csqrt(a + bi) works for inputs that are large enough to
+ * cause overflow in hypot(a, b) + a. In this case we are using
+ * csqrt(115 + 252*I) == 14 + 9*I
+ * scaled up to near MAX_EXP.
+ */
+static void
+test_overflow(int maxexp)
+{
+ double a, b;
+ double complex result;
+
+ a = ldexp(115 * 0x1p-8, maxexp);
+ b = ldexp(252 * 0x1p-8, maxexp);
+ result = t_csqrt(cpack(a, b));
+ assert(creal(result) == ldexp(14 * 0x1p-4, maxexp / 2));
+ assert(cimag(result) == ldexp(9 * 0x1p-4, maxexp / 2));
+}
+
+int
+main(int argc, char *argv[])
+{
+
+ printf("1..10\n");
+
+ /* Test csqrt() */
+ t_csqrt = csqrt;
+
+ test_finite();
+ printf("ok 1 - csqrt\n");
+
+ test_zeros();
+ printf("ok 2 - csqrt\n");
+
+ test_infinities();
+ printf("ok 3 - csqrt\n");
+
+ test_nans();
+ printf("ok 4 - csqrt\n");
+
+ test_overflow(DBL_MAX_EXP);
+ printf("ok 5 - csqrt\n");
+
+ /* Now test csqrtf() */
+ t_csqrt = _csqrtf;
+
+ test_finite();
+ printf("ok 6 - csqrt\n");
+
+ test_zeros();
+ printf("ok 7 - csqrt\n");
+
+ test_infinities();
+ printf("ok 8 - csqrt\n");
+
+ test_nans();
+ printf("ok 9 - csqrt\n");
+
+ test_overflow(FLT_MAX_EXP);
+ printf("ok 10 - csqrt\n");
+
+ return (0);
+}
diff --git a/tools/regression/lib/msun/test-csqrt.t b/tools/regression/lib/msun/test-csqrt.t
new file mode 100644
index 0000000..8bdfd03
--- /dev/null
+++ b/tools/regression/lib/msun/test-csqrt.t
@@ -0,0 +1,10 @@
+#!/bin/sh
+# $FreeBSD$
+
+cd `dirname $0`
+
+executable=`basename $0 .t`
+
+make $executable 2>&1 > /dev/null
+
+exec ./$executable
OpenPOWER on IntegriCloud