Skip site navigation (1)Skip section navigation (2)
Date:      Sun, 20 Dec 2015 05:06:44 +0000 (UTC)
From:      Garrett Cooper <ngie@FreeBSD.org>
To:        src-committers@freebsd.org, svn-src-all@freebsd.org, svn-src-head@freebsd.org
Subject:   svn commit: r292497 - in head: lib/msun/tests tools/regression/lib/msun
Message-ID:  <201512200506.tBK56ik1092460@repo.freebsd.org>

next in thread | raw e-mail | index | archive | help
Author: ngie
Date: Sun Dec 20 05:06:44 2015
New Revision: 292497
URL: https://svnweb.freebsd.org/changeset/base/292497

Log:
  Integrate the remaining tools/regression/lib/msun testcases into the
  FreeBSD test suite under lib/msun/tests
  
  MFC after: 3 weeks
  X-MFC with: r292328
  Sponsored by: EMC / Isilon Storage Division

Added:
  head/lib/msun/tests/ctrig_test.c
     - copied unchanged from r292496, head/tools/regression/lib/msun/test-ctrig.c
  head/lib/msun/tests/exponential_test.c
     - copied unchanged from r292496, head/tools/regression/lib/msun/test-exponential.c
  head/lib/msun/tests/fma_test.c
     - copied unchanged from r292496, head/tools/regression/lib/msun/test-fma.c
  head/lib/msun/tests/invtrig_test.c
     - copied unchanged from r292496, head/tools/regression/lib/msun/test-invtrig.c
  head/lib/msun/tests/lround_test.c
     - copied unchanged from r292496, head/tools/regression/lib/msun/test-lround.c
  head/lib/msun/tests/lround_test.t
     - copied unchanged from r292496, head/tools/regression/lib/msun/test-lround.t
  head/lib/msun/tests/test-utils.h
     - copied unchanged from r292496, head/tools/regression/lib/msun/test-utils.h
Deleted:
  head/tools/regression/lib/msun/
Modified:
  head/lib/msun/tests/Makefile

Modified: head/lib/msun/tests/Makefile
==============================================================================
--- head/lib/msun/tests/Makefile	Sun Dec 20 04:52:53 2015	(r292496)
+++ head/lib/msun/tests/Makefile	Sun Dec 20 05:06:44 2015	(r292497)
@@ -39,12 +39,19 @@ NETBSD_ATF_TESTS_C+=	tanh_test
 TAP_TESTS_C+=	cexp_test
 TAP_TESTS_C+=	conj_test
 TAP_TESTS_C+=	csqrt_test
+TAP_TESTS_C+=	ctrig_test
+TAP_TESTS_C+=	exponential_test
 TAP_TESTS_C+=	fenv_test
+TAP_TESTS_C+=	fma_test
 TAP_TESTS_C+=	fmaxmin_test
 TAP_TESTS_C+=	ilogb_test
+TAP_TESTS_C+=	invtrig_test
 TAP_TESTS_C+=	invctrig_test
 TAP_TESTS_C+=	logarithm_test
 TAP_TESTS_C+=	lrint_test
+# XXX: the testcase crashes on all platforms, but only on head
+# (bug 205451)
+#TAP_TESTS_C+=	lround_test
 TAP_TESTS_C+=	nan_test
 TAP_TESTS_C+=	nearbyint_test
 TAP_TESTS_C+=	next_test
@@ -53,7 +60,6 @@ TAP_TESTS_C+=	trig_test
 
 .for t in ${TAP_TESTS_C}
 CFLAGS.$t+=	-O0
-CFLAGS.$t+=	-I${SRCTOP}/tools/regression/lib/msun
 .endfor
 
 CSTD=		c99

Copied: head/lib/msun/tests/ctrig_test.c (from r292496, head/tools/regression/lib/msun/test-ctrig.c)
==============================================================================
--- /dev/null	00:00:00 1970	(empty, because file is newly added)
+++ head/lib/msun/tests/ctrig_test.c	Sun Dec 20 05:06:44 2015	(r292497, copy of r292496, head/tools/regression/lib/msun/test-ctrig.c)
@@ -0,0 +1,482 @@
+/*-
+ * Copyright (c) 2008-2011 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 csin[h](), ccos[h](), and ctan[h]().
+ */
+
+#include <sys/cdefs.h>
+__FBSDID("$FreeBSD$");
+
+#include <assert.h>
+#include <complex.h>
+#include <fenv.h>
+#include <float.h>
+#include <math.h>
+#include <stdio.h>
+
+#include "test-utils.h"
+
+#pragma STDC FENV_ACCESS	ON
+#pragma	STDC CX_LIMITED_RANGE	OFF
+
+/*
+ * Test that a function returns the correct value and sets the
+ * exception flags correctly. The exceptmask specifies which
+ * exceptions we should check. We need to be lenient for several
+ * reasons, but mainly because on some architectures it's impossible
+ * to raise FE_OVERFLOW without raising FE_INEXACT.
+ *
+ * These are macros instead of functions so that assert provides more
+ * meaningful error messages.
+ *
+ * XXX The volatile here is to avoid gcc's bogus constant folding and work
+ *     around the lack of support for the FENV_ACCESS pragma.
+ */
+#define	test_p(func, z, result, exceptmask, excepts, checksign)	do {	\
+	volatile long double complex _d = z;				\
+	debug("  testing %s(%Lg + %Lg I) == %Lg + %Lg I\n", #func,	\
+	    creall(_d), cimagl(_d), creall(result), cimagl(result));	\
+	assert(feclearexcept(FE_ALL_EXCEPT) == 0);			\
+	assert(cfpequal_cs((func)(_d), (result), (checksign)));		\
+	assert(((void)(func), fetestexcept(exceptmask) == (excepts)));	\
+} while (0)
+
+/*
+ * Test within a given tolerance.  The tolerance indicates relative error
+ * in ulps.  If result is 0, however, it measures absolute error in units
+ * of <format>_EPSILON.
+ */
+#define	test_p_tol(func, z, result, tol)			do {	\
+	volatile long double complex _d = z;				\
+	debug("  testing %s(%Lg + %Lg I) ~= %Lg + %Lg I\n", #func,	\
+	    creall(_d), cimagl(_d), creall(result), cimagl(result));	\
+	assert(cfpequal_tol((func)(_d), (result), (tol), FPE_ABS_ZERO)); \
+} while (0)
+
+/* These wrappers apply the identities f(conj(z)) = conj(f(z)). */
+#define	test(func, z, result, exceptmask, excepts, checksign)	do {	\
+	test_p(func, z, result, exceptmask, excepts, checksign);	\
+	test_p(func, conjl(z), conjl(result), exceptmask, excepts, checksign); \
+} while (0)
+#define	test_tol(func, z, result, tol)				do {	\
+	test_p_tol(func, z, result, tol);				\
+	test_p_tol(func, conjl(z), conjl(result), tol);			\
+} while (0)
+#define	test_odd_tol(func, z, result, tol)			do {	\
+	test_tol(func, z, result, tol);					\
+	test_tol(func, -(z), -(result), tol);				\
+} while (0)
+#define	test_even_tol(func, z, result, tol)			do {	\
+	test_tol(func, z, result, tol);					\
+	test_tol(func, -(z), result, tol);				\
+} while (0)
+
+/* Test the given function in all precisions. */
+#define	testall(func, x, result, exceptmask, excepts, checksign) do {	\
+	test(func, x, result, exceptmask, excepts, checksign);		\
+	test(func##f, x, result, exceptmask, excepts, checksign);	\
+} while (0)
+#define	testall_odd(func, x, result, exceptmask, excepts, checksign) do { \
+	testall(func, x, result, exceptmask, excepts, checksign);	\
+	testall(func, -x, -result, exceptmask, excepts, checksign);	\
+} while (0)
+#define	testall_even(func, x, result, exceptmask, excepts, checksign) do { \
+	testall(func, x, result, exceptmask, excepts, checksign);	\
+	testall(func, -x, result, exceptmask, excepts, checksign);	\
+} while (0)
+
+/*
+ * Test the given function in all precisions, within a given tolerance.
+ * The tolerance is specified in ulps.
+ */
+#define	testall_tol(func, x, result, tol)	       		   do { \
+	test_tol(func, x, result, tol * DBL_ULP());			\
+	test_tol(func##f, x, result, tol * FLT_ULP());			\
+} while (0)
+#define	testall_odd_tol(func, x, result, tol)	       		   do { \
+	test_odd_tol(func, x, result, tol * DBL_ULP());			\
+	test_odd_tol(func##f, x, result, tol * FLT_ULP());		\
+} while (0)
+#define	testall_even_tol(func, x, result, tol)	       		   do { \
+	test_even_tol(func, x, result, tol * DBL_ULP());		\
+	test_even_tol(func##f, x, result, tol * FLT_ULP());		\
+} while (0)
+
+
+/* Tests for 0 */
+void
+test_zero(void)
+{
+	long double complex zero = CMPLXL(0.0, 0.0);
+
+	/* csinh(0) = ctanh(0) = 0; ccosh(0) = 1 (no exceptions raised) */
+	testall_odd(csinh, zero, zero, ALL_STD_EXCEPT, 0, CS_BOTH);
+	testall_odd(csin, zero, zero, ALL_STD_EXCEPT, 0, CS_BOTH);
+	testall_even(ccosh, zero, 1.0, ALL_STD_EXCEPT, 0, CS_BOTH);
+	testall_even(ccos, zero, CMPLXL(1.0, -0.0), ALL_STD_EXCEPT, 0, CS_BOTH);
+	testall_odd(ctanh, zero, zero, ALL_STD_EXCEPT, 0, CS_BOTH);
+	testall_odd(ctan, zero, zero, ALL_STD_EXCEPT, 0, CS_BOTH);
+}
+
+/*
+ * Tests for NaN inputs.
+ */
+void
+test_nan()
+{
+	long double complex nan_nan = CMPLXL(NAN, NAN);
+	long double complex z;
+
+	/*
+	 * IN		CSINH		CCOSH		CTANH
+	 * NaN,NaN	NaN,NaN		NaN,NaN		NaN,NaN
+	 * finite,NaN	NaN,NaN [inval]	NaN,NaN [inval]	NaN,NaN [inval]
+	 * NaN,finite	NaN,NaN [inval]	NaN,NaN [inval]	NaN,NaN [inval]
+	 * NaN,Inf	NaN,NaN [inval]	NaN,NaN	[inval]	NaN,NaN [inval]
+	 * Inf,NaN	+-Inf,NaN	Inf,NaN		1,+-0
+	 * 0,NaN	+-0,NaN		NaN,+-0		NaN,NaN	[inval]
+	 * NaN,0	NaN,0		NaN,+-0		NaN,0
+	 */
+	z = nan_nan;
+	testall_odd(csinh, z, nan_nan, ALL_STD_EXCEPT, 0, 0);
+	testall_even(ccosh, z, nan_nan, ALL_STD_EXCEPT, 0, 0);
+	testall_odd(ctanh, z, nan_nan, ALL_STD_EXCEPT, 0, 0);
+	testall_odd(csin, z, nan_nan, ALL_STD_EXCEPT, 0, 0);
+	testall_even(ccos, z, nan_nan, ALL_STD_EXCEPT, 0, 0);
+	testall_odd(ctan, z, nan_nan, ALL_STD_EXCEPT, 0, 0);
+
+	z = CMPLXL(42, NAN);
+	testall_odd(csinh, z, nan_nan, OPT_INVALID, 0, 0);
+	testall_even(ccosh, z, nan_nan, OPT_INVALID, 0, 0);
+	/* XXX We allow a spurious inexact exception here. */
+	testall_odd(ctanh, z, nan_nan, OPT_INVALID & ~FE_INEXACT, 0, 0);
+	testall_odd(csin, z, nan_nan, OPT_INVALID, 0, 0);
+	testall_even(ccos, z, nan_nan, OPT_INVALID, 0, 0);
+	testall_odd(ctan, z, nan_nan, OPT_INVALID, 0, 0);
+
+	z = CMPLXL(NAN, 42);
+	testall_odd(csinh, z, nan_nan, OPT_INVALID, 0, 0);
+	testall_even(ccosh, z, nan_nan, OPT_INVALID, 0, 0);
+	testall_odd(ctanh, z, nan_nan, OPT_INVALID, 0, 0);
+	testall_odd(csin, z, nan_nan, OPT_INVALID, 0, 0);
+	testall_even(ccos, z, nan_nan, OPT_INVALID, 0, 0);
+	/* XXX We allow a spurious inexact exception here. */
+	testall_odd(ctan, z, nan_nan, OPT_INVALID & ~FE_INEXACT, 0, 0);
+
+	z = CMPLXL(NAN, INFINITY);
+	testall_odd(csinh, z, nan_nan, OPT_INVALID, 0, 0);
+	testall_even(ccosh, z, nan_nan, OPT_INVALID, 0, 0);
+	testall_odd(ctanh, z, nan_nan, OPT_INVALID, 0, 0);
+	testall_odd(csin, z, CMPLXL(NAN, INFINITY), ALL_STD_EXCEPT, 0, 0);
+	testall_even(ccos, z, CMPLXL(INFINITY, NAN), ALL_STD_EXCEPT, 0,
+	    CS_IMAG);
+	testall_odd(ctan, z, CMPLXL(0, 1), ALL_STD_EXCEPT, 0, CS_IMAG);
+
+	z = CMPLXL(INFINITY, NAN);
+	testall_odd(csinh, z, CMPLXL(INFINITY, NAN), ALL_STD_EXCEPT, 0, 0);
+	testall_even(ccosh, z, CMPLXL(INFINITY, NAN), ALL_STD_EXCEPT, 0,
+		     CS_REAL);
+	testall_odd(ctanh, z, CMPLXL(1, 0), ALL_STD_EXCEPT, 0, CS_REAL);
+	testall_odd(csin, z, nan_nan, OPT_INVALID, 0, 0);
+	testall_even(ccos, z, nan_nan, OPT_INVALID, 0, 0);
+	testall_odd(ctan, z, nan_nan, OPT_INVALID, 0, 0);
+
+	z = CMPLXL(0, NAN);
+	testall_odd(csinh, z, CMPLXL(0, NAN), ALL_STD_EXCEPT, 0, 0);
+	testall_even(ccosh, z, CMPLXL(NAN, 0), ALL_STD_EXCEPT, 0, 0);
+	testall_odd(ctanh, z, nan_nan, OPT_INVALID, 0, 0);
+	testall_odd(csin, z, CMPLXL(0, NAN), ALL_STD_EXCEPT, 0, CS_REAL);
+	testall_even(ccos, z, CMPLXL(NAN, 0), ALL_STD_EXCEPT, 0, 0);
+	testall_odd(ctan, z, CMPLXL(0, NAN), ALL_STD_EXCEPT, 0, CS_REAL);
+
+	z = CMPLXL(NAN, 0);
+	testall_odd(csinh, z, CMPLXL(NAN, 0), ALL_STD_EXCEPT, 0, CS_IMAG);
+	testall_even(ccosh, z, CMPLXL(NAN, 0), ALL_STD_EXCEPT, 0, 0);
+	testall_odd(ctanh, z, CMPLXL(NAN, 0), ALL_STD_EXCEPT, 0, CS_IMAG);
+	testall_odd(csin, z, CMPLXL(NAN, 0), ALL_STD_EXCEPT, 0, 0);
+	testall_even(ccos, z, CMPLXL(NAN, 0), ALL_STD_EXCEPT, 0, 0);
+	testall_odd(ctan, z, nan_nan, OPT_INVALID, 0, 0);
+}
+
+void
+test_inf(void)
+{
+	static const long double finites[] = {
+	    0, M_PI / 4, 3 * M_PI / 4, 5 * M_PI / 4,
+	};
+	long double complex z, c, s;
+	int i;
+
+	/*
+	 * IN		CSINH		CCOSH		CTANH
+	 * Inf,Inf	+-Inf,NaN inval	+-Inf,NaN inval	1,+-0
+	 * Inf,finite	Inf cis(finite)	Inf cis(finite)	1,0 sin(2 finite)
+	 * 0,Inf	+-0,NaN	inval	NaN,+-0 inval	NaN,NaN	inval
+	 * finite,Inf	NaN,NaN inval	NaN,NaN inval	NaN,NaN inval
+	 */
+	z = CMPLXL(INFINITY, INFINITY);
+	testall_odd(csinh, z, CMPLXL(INFINITY, NAN),
+		    ALL_STD_EXCEPT, FE_INVALID, 0);
+	testall_even(ccosh, z, CMPLXL(INFINITY, NAN),
+		     ALL_STD_EXCEPT, FE_INVALID, 0);
+	testall_odd(ctanh, z, CMPLXL(1, 0), ALL_STD_EXCEPT, 0, CS_REAL);
+	testall_odd(csin, z, CMPLXL(NAN, INFINITY),
+		    ALL_STD_EXCEPT, FE_INVALID, 0);
+	testall_even(ccos, z, CMPLXL(INFINITY, NAN),
+		     ALL_STD_EXCEPT, FE_INVALID, 0);
+	testall_odd(ctan, z, CMPLXL(0, 1), ALL_STD_EXCEPT, 0, CS_REAL);
+
+	/* XXX We allow spurious inexact exceptions here (hard to avoid). */
+	for (i = 0; i < sizeof(finites) / sizeof(finites[0]); i++) {
+		z = CMPLXL(INFINITY, finites[i]);
+		c = INFINITY * cosl(finites[i]);
+		s = finites[i] == 0 ? finites[i] : INFINITY * sinl(finites[i]);
+		testall_odd(csinh, z, CMPLXL(c, s), OPT_INEXACT, 0, CS_BOTH);
+		testall_even(ccosh, z, CMPLXL(c, s), OPT_INEXACT, 0, CS_BOTH);
+		testall_odd(ctanh, z, CMPLXL(1, 0 * sin(finites[i] * 2)),
+			    OPT_INEXACT, 0, CS_BOTH);
+		z = CMPLXL(finites[i], INFINITY);
+		testall_odd(csin, z, CMPLXL(s, c), OPT_INEXACT, 0, CS_BOTH);
+		testall_even(ccos, z, CMPLXL(c, -s), OPT_INEXACT, 0, CS_BOTH);
+		testall_odd(ctan, z, CMPLXL(0 * sin(finites[i] * 2), 1),
+			    OPT_INEXACT, 0, CS_BOTH);
+	}
+
+	z = CMPLXL(0, INFINITY);
+	testall_odd(csinh, z, CMPLXL(0, NAN), ALL_STD_EXCEPT, FE_INVALID, 0);
+	testall_even(ccosh, z, CMPLXL(NAN, 0), ALL_STD_EXCEPT, FE_INVALID, 0);
+	testall_odd(ctanh, z, CMPLXL(NAN, NAN), ALL_STD_EXCEPT, FE_INVALID, 0);
+	z = CMPLXL(INFINITY, 0);
+	testall_odd(csin, z, CMPLXL(NAN, 0), ALL_STD_EXCEPT, FE_INVALID, 0);
+	testall_even(ccos, z, CMPLXL(NAN, 0), ALL_STD_EXCEPT, FE_INVALID, 0);
+	testall_odd(ctan, z, CMPLXL(NAN, NAN), ALL_STD_EXCEPT, FE_INVALID, 0);
+
+	z = CMPLXL(42, INFINITY);
+	testall_odd(csinh, z, CMPLXL(NAN, NAN), ALL_STD_EXCEPT, FE_INVALID, 0);
+	testall_even(ccosh, z, CMPLXL(NAN, NAN), ALL_STD_EXCEPT, FE_INVALID, 0);
+	/* XXX We allow a spurious inexact exception here. */
+	testall_odd(ctanh, z, CMPLXL(NAN, NAN), OPT_INEXACT, FE_INVALID, 0);
+	z = CMPLXL(INFINITY, 42);
+	testall_odd(csin, z, CMPLXL(NAN, NAN), ALL_STD_EXCEPT, FE_INVALID, 0);
+	testall_even(ccos, z, CMPLXL(NAN, NAN), ALL_STD_EXCEPT, FE_INVALID, 0);
+	/* XXX We allow a spurious inexact exception here. */
+	testall_odd(ctan, z, CMPLXL(NAN, NAN), OPT_INEXACT, FE_INVALID, 0);
+}
+
+/* Tests along the real and imaginary axes. */
+void
+test_axes(void)
+{
+	static const long double nums[] = {
+	    M_PI / 4, M_PI / 2, 3 * M_PI / 4,
+	    5 * M_PI / 4, 3 * M_PI / 2, 7 * M_PI / 4,
+	};
+	long double complex z;
+	int i;
+
+	for (i = 0; i < sizeof(nums) / sizeof(nums[0]); i++) {
+		/* Real axis */
+		z = CMPLXL(nums[i], 0.0);
+		test_odd_tol(csinh, z, CMPLXL(sinh(nums[i]), 0), DBL_ULP());
+		test_even_tol(ccosh, z, CMPLXL(cosh(nums[i]), 0), DBL_ULP());
+		test_odd_tol(ctanh, z, CMPLXL(tanh(nums[i]), 0), DBL_ULP());
+		test_odd_tol(csin, z, CMPLXL(sin(nums[i]),
+		    copysign(0, cos(nums[i]))), DBL_ULP());
+		test_even_tol(ccos, z, CMPLXL(cos(nums[i]),
+		    -copysign(0, sin(nums[i]))), DBL_ULP());
+		test_odd_tol(ctan, z, CMPLXL(tan(nums[i]), 0), DBL_ULP());
+
+		test_odd_tol(csinhf, z, CMPLXL(sinhf(nums[i]), 0), FLT_ULP());
+		test_even_tol(ccoshf, z, CMPLXL(coshf(nums[i]), 0), FLT_ULP());
+		printf("%a %a\n", creal(z), cimag(z));
+		printf("%a %a\n", creal(ctanhf(z)), cimag(ctanhf(z)));
+		printf("%a\n", nextafterf(tanhf(nums[i]), INFINITY));
+		test_odd_tol(ctanhf, z, CMPLXL(tanhf(nums[i]), 0),
+			     1.3 * FLT_ULP());
+		test_odd_tol(csinf, z, CMPLXL(sinf(nums[i]),
+		    copysign(0, cosf(nums[i]))), FLT_ULP());
+		test_even_tol(ccosf, z, CMPLXL(cosf(nums[i]),
+		    -copysign(0, sinf(nums[i]))), 2 * FLT_ULP());
+		test_odd_tol(ctanf, z, CMPLXL(tanf(nums[i]), 0), FLT_ULP());
+
+		/* Imaginary axis */
+		z = CMPLXL(0.0, nums[i]);
+		test_odd_tol(csinh, z, CMPLXL(copysign(0, cos(nums[i])),
+						 sin(nums[i])), DBL_ULP());
+		test_even_tol(ccosh, z, CMPLXL(cos(nums[i]),
+		    copysign(0, sin(nums[i]))), DBL_ULP());
+		test_odd_tol(ctanh, z, CMPLXL(0, tan(nums[i])), DBL_ULP());
+		test_odd_tol(csin, z, CMPLXL(0, sinh(nums[i])), DBL_ULP());
+		test_even_tol(ccos, z, CMPLXL(cosh(nums[i]), -0.0), DBL_ULP());
+		test_odd_tol(ctan, z, CMPLXL(0, tanh(nums[i])), DBL_ULP());
+
+		test_odd_tol(csinhf, z, CMPLXL(copysign(0, cosf(nums[i])),
+						 sinf(nums[i])), FLT_ULP());
+		test_even_tol(ccoshf, z, CMPLXL(cosf(nums[i]),
+		    copysign(0, sinf(nums[i]))), FLT_ULP());
+		test_odd_tol(ctanhf, z, CMPLXL(0, tanf(nums[i])), FLT_ULP());
+		test_odd_tol(csinf, z, CMPLXL(0, sinhf(nums[i])), FLT_ULP());
+		test_even_tol(ccosf, z, CMPLXL(coshf(nums[i]), -0.0),
+			      FLT_ULP());
+		test_odd_tol(ctanf, z, CMPLXL(0, tanhf(nums[i])),
+			     1.3 * FLT_ULP());
+	}
+}
+
+void
+test_small(void)
+{
+	/*
+	 * z =  0.5 + i Pi/4
+	 *     sinh(z) = (sinh(0.5) + i cosh(0.5)) * sqrt(2)/2
+	 *     cosh(z) = (cosh(0.5) + i sinh(0.5)) * sqrt(2)/2
+	 *     tanh(z) = (2cosh(0.5)sinh(0.5) + i) / (2 cosh(0.5)**2 - 1)
+	 * z = -0.5 + i Pi/2
+	 *     sinh(z) = cosh(0.5)
+	 *     cosh(z) = -i sinh(0.5)
+	 *     tanh(z) = -coth(0.5)
+	 * z =  1.0 + i 3Pi/4
+	 *     sinh(z) = (-sinh(1) + i cosh(1)) * sqrt(2)/2
+	 *     cosh(z) = (-cosh(1) + i sinh(1)) * sqrt(2)/2
+	 *     tanh(z) = (2cosh(1)sinh(1) - i) / (2cosh(1)**2 - 1)
+	 */
+	static const struct {
+		long double a, b;
+		long double sinh_a, sinh_b;
+		long double cosh_a, cosh_b;
+		long double tanh_a, tanh_b;
+	} tests[] = {
+		{  0.5L,
+		   0.78539816339744830961566084581987572L,
+		   0.36847002415910435172083660522240710L,
+		   0.79735196663945774996093142586179334L,
+		   0.79735196663945774996093142586179334L,
+		   0.36847002415910435172083660522240710L,
+		   0.76159415595576488811945828260479359L,
+		   0.64805427366388539957497735322615032L },
+		{ -0.5L,
+		   1.57079632679489661923132169163975144L,
+		   0.0L,
+		   1.12762596520638078522622516140267201L,
+		   0.0L,
+		  -0.52109530549374736162242562641149156L,
+		  -2.16395341373865284877000401021802312L,
+		   0.0L },
+		{  1.0L,
+		   2.35619449019234492884698253745962716L,
+		  -0.83099273328405698212637979852748608L,
+		   1.09112278079550143030545602018565236L,
+		  -1.09112278079550143030545602018565236L,
+		   0.83099273328405698212637979852748609L,
+		   0.96402758007581688394641372410092315L,
+		  -0.26580222883407969212086273981988897L }
+	};
+	long double complex z;
+	int i;
+
+	for (i = 0; i < sizeof(tests) / sizeof(tests[0]); i++) {
+		z = CMPLXL(tests[i].a, tests[i].b);
+		testall_odd_tol(csinh, z,
+		    CMPLXL(tests[i].sinh_a, tests[i].sinh_b), 1.1);
+		testall_even_tol(ccosh, z,
+		    CMPLXL(tests[i].cosh_a, tests[i].cosh_b), 1.1);
+		testall_odd_tol(ctanh, z,
+		    CMPLXL(tests[i].tanh_a, tests[i].tanh_b), 1.4);
+        }
+}
+
+/* Test inputs that might cause overflow in a sloppy implementation. */
+void
+test_large(void)
+{
+	long double complex z;
+
+	/* tanh() uses a threshold around x=22, so check both sides. */
+	z = CMPLXL(21, 0.78539816339744830961566084581987572L);
+	testall_odd_tol(ctanh, z,
+	    CMPLXL(1.0, 1.14990445285871196133287617611468468e-18L), 1.2);
+	z++;
+	testall_odd_tol(ctanh, z,
+	    CMPLXL(1.0, 1.55622644822675930314266334585597964e-19L), 1);
+
+	z = CMPLXL(355, 0.78539816339744830961566084581987572L);
+	test_odd_tol(ctanh, z,
+		     CMPLXL(1.0, 8.95257245135025991216632140458264468e-309L),
+		     DBL_ULP());
+#if !defined(__i386__)
+	z = CMPLXL(30, 0x1p1023L);
+	test_odd_tol(ctanh, z,
+		     CMPLXL(1.0, -1.62994325413993477997492170229268382e-26L),
+		     DBL_ULP());
+	z = CMPLXL(1, 0x1p1023L);
+	test_odd_tol(ctanh, z,
+		     CMPLXL(0.878606311888306869546254022621986509L,
+			    -0.225462792499754505792678258169527424L),
+		     DBL_ULP());
+#endif
+
+	z = CMPLXL(710.6, 0.78539816339744830961566084581987572L);
+	test_odd_tol(csinh, z,
+	    CMPLXL(1.43917579766621073533185387499658944e308L,
+		   1.43917579766621073533185387499658944e308L), DBL_ULP());
+	test_even_tol(ccosh, z,
+	    CMPLXL(1.43917579766621073533185387499658944e308L,
+		   1.43917579766621073533185387499658944e308L), DBL_ULP());
+
+	z = CMPLXL(1500, 0.78539816339744830961566084581987572L);
+	testall_odd(csinh, z, CMPLXL(INFINITY, INFINITY), OPT_INEXACT,
+	    FE_OVERFLOW, CS_BOTH);
+	testall_even(ccosh, z, CMPLXL(INFINITY, INFINITY), OPT_INEXACT,
+	    FE_OVERFLOW, CS_BOTH);
+}
+
+int
+main(int argc, char *argv[])
+{
+
+	printf("1..6\n");
+
+	test_zero();
+	printf("ok 1 - ctrig zero\n");
+
+	test_nan();
+	printf("ok 2 - ctrig nan\n");
+
+	test_inf();
+	printf("ok 3 - ctrig inf\n");
+
+	test_axes();
+	printf("ok 4 - ctrig axes\n");
+
+	test_small();
+	printf("ok 5 - ctrig small\n");
+
+	test_large();
+	printf("ok 6 - ctrig large\n");
+
+	return (0);
+}

Copied: head/lib/msun/tests/exponential_test.c (from r292496, head/tools/regression/lib/msun/test-exponential.c)
==============================================================================
--- /dev/null	00:00:00 1970	(empty, because file is newly added)
+++ head/lib/msun/tests/exponential_test.c	Sun Dec 20 05:06:44 2015	(r292497, copy of r292496, head/tools/regression/lib/msun/test-exponential.c)
@@ -0,0 +1,169 @@
+/*-
+ * Copyright (c) 2008 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 corner cases in exp*().
+ */
+
+#include <sys/cdefs.h>
+__FBSDID("$FreeBSD$");
+
+#include <assert.h>
+#include <fenv.h>
+#include <float.h>
+#include <math.h>
+#include <stdio.h>
+
+#ifdef __i386__
+#include <ieeefp.h>
+#endif
+
+#include "test-utils.h"
+
+#pragma STDC FENV_ACCESS ON
+
+/*
+ * Test that a function returns the correct value and sets the
+ * exception flags correctly. The exceptmask specifies which
+ * exceptions we should check. We need to be lenient for several
+ * reasoons, but mainly because on some architectures it's impossible
+ * to raise FE_OVERFLOW without raising FE_INEXACT.
+ *
+ * These are macros instead of functions so that assert provides more
+ * meaningful error messages.
+ *
+ * XXX The volatile here is to avoid gcc's bogus constant folding and work
+ *     around the lack of support for the FENV_ACCESS pragma.
+ */
+#define	test(func, x, result, exceptmask, excepts)	do {		\
+	volatile long double _d = x;					\
+	assert(feclearexcept(FE_ALL_EXCEPT) == 0);			\
+	assert(fpequal((func)(_d), (result)));				 \
+	assert(((void)(func), fetestexcept(exceptmask) == (excepts)));	\
+} while (0)
+
+/* Test all the functions that compute b^x. */
+#define	_testall0(x, result, exceptmask, excepts)	do {		\
+	test(exp, x, result, exceptmask, excepts);			\
+	test(expf, x, result, exceptmask, excepts);			\
+	test(exp2, x, result, exceptmask, excepts);			\
+	test(exp2f, x, result, exceptmask, excepts);			\
+} while (0)
+
+/* Skip over exp2l on platforms that don't support it. */
+#if LDBL_PREC == 53
+#define	testall0	_testall0
+#else
+#define	testall0(x, result, exceptmask, excepts)	do {		\
+	_testall0(x, result, exceptmask, excepts); 			\
+	test(exp2l, x, result, exceptmask, excepts);			\
+} while (0)
+#endif
+
+/* Test all the functions that compute b^x - 1. */
+#define	testall1(x, result, exceptmask, excepts)	do {		\
+	test(expm1, x, result, exceptmask, excepts);			\
+	test(expm1f, x, result, exceptmask, excepts);			\
+} while (0)
+
+void
+run_generic_tests(void)
+{
+
+	/* exp(0) == 1, no exceptions raised */
+	testall0(0.0, 1.0, ALL_STD_EXCEPT, 0);
+	testall1(0.0, 0.0, ALL_STD_EXCEPT, 0);
+	testall0(-0.0, 1.0, ALL_STD_EXCEPT, 0);
+	testall1(-0.0, -0.0, ALL_STD_EXCEPT, 0);
+
+	/* exp(NaN) == NaN, no exceptions raised */
+	testall0(NAN, NAN, ALL_STD_EXCEPT, 0);
+	testall1(NAN, NAN, ALL_STD_EXCEPT, 0);
+
+	/* exp(Inf) == Inf, no exceptions raised */
+	testall0(INFINITY, INFINITY, ALL_STD_EXCEPT, 0);
+	testall1(INFINITY, INFINITY, ALL_STD_EXCEPT, 0);
+
+	/* exp(-Inf) == 0, no exceptions raised */
+	testall0(-INFINITY, 0.0, ALL_STD_EXCEPT, 0);
+	testall1(-INFINITY, -1.0, ALL_STD_EXCEPT, 0);
+
+#if !defined(__i386__)
+	/* exp(big) == Inf, overflow exception */
+	testall0(50000.0, INFINITY, ALL_STD_EXCEPT & ~FE_INEXACT, FE_OVERFLOW);
+	testall1(50000.0, INFINITY, ALL_STD_EXCEPT & ~FE_INEXACT, FE_OVERFLOW);
+
+	/* exp(small) == 0, underflow and inexact exceptions */
+	testall0(-50000.0, 0.0, ALL_STD_EXCEPT, FE_UNDERFLOW | FE_INEXACT);
+#endif
+	testall1(-50000.0, -1.0, ALL_STD_EXCEPT, FE_INEXACT);
+}
+
+void
+run_exp2_tests(void)
+{
+	int i;
+
+	/*
+	 * We should insist that exp2() return exactly the correct
+	 * result and not raise an inexact exception for integer
+	 * arguments.
+	 */
+	feclearexcept(FE_ALL_EXCEPT);
+	for (i = FLT_MIN_EXP - FLT_MANT_DIG; i < FLT_MAX_EXP; i++) {
+		assert(exp2f(i) == ldexpf(1.0, i));
+		assert(fetestexcept(ALL_STD_EXCEPT) == 0);
+	}
+	for (i = DBL_MIN_EXP - DBL_MANT_DIG; i < DBL_MAX_EXP; i++) {
+		assert(exp2(i) == ldexp(1.0, i));
+		assert(fetestexcept(ALL_STD_EXCEPT) == 0);
+	}
+	for (i = LDBL_MIN_EXP - LDBL_MANT_DIG; i < LDBL_MAX_EXP; i++) {
+		assert(exp2l(i) == ldexpl(1.0, i));
+		assert(fetestexcept(ALL_STD_EXCEPT) == 0);
+	}
+}
+
+int
+main(int argc, char *argv[])
+{
+
+	printf("1..3\n");
+
+	run_generic_tests();
+	printf("ok 1 - exponential\n");
+
+#ifdef __i386__
+	fpsetprec(FP_PE);
+	run_generic_tests();
+#endif
+	printf("ok 2 - exponential\n");
+
+	run_exp2_tests();
+	printf("ok 3 - exponential\n");
+
+	return (0);
+}

Copied: head/lib/msun/tests/fma_test.c (from r292496, head/tools/regression/lib/msun/test-fma.c)
==============================================================================
--- /dev/null	00:00:00 1970	(empty, because file is newly added)
+++ head/lib/msun/tests/fma_test.c	Sun Dec 20 05:06:44 2015	(r292497, copy of r292496, head/tools/regression/lib/msun/test-fma.c)
@@ -0,0 +1,542 @@
+/*-
+ * Copyright (c) 2008 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 fma{,f,l}().
+ */
+
+#include <sys/cdefs.h>
+__FBSDID("$FreeBSD$");
+
+#include <sys/param.h>
+#include <assert.h>
+#include <fenv.h>
+#include <float.h>
+#include <math.h>
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "test-utils.h"
+
+#pragma STDC FENV_ACCESS ON
+
+/*
+ * Test that a function returns the correct value and sets the
+ * exception flags correctly. The exceptmask specifies which
+ * exceptions we should check. We need to be lenient for several
+ * reasons, but mainly because on some architectures it's impossible
+ * to raise FE_OVERFLOW without raising FE_INEXACT.
+ *
+ * These are macros instead of functions so that assert provides more
+ * meaningful error messages.
+ */
+#define	test(func, x, y, z, result, exceptmask, excepts) do {		\
+	volatile long double _vx = (x), _vy = (y), _vz = (z);		\
+	assert(feclearexcept(FE_ALL_EXCEPT) == 0);			\
+	assert(fpequal((func)(_vx, _vy, _vz), (result)));		\
+	assert(((void)(func), fetestexcept(exceptmask) == (excepts)));	\
+} while (0)
+
+#define	testall(x, y, z, result, exceptmask, excepts)	do {		\
+	test(fma, (double)(x), (double)(y), (double)(z),		\
+		(double)(result), (exceptmask), (excepts));		\
+	test(fmaf, (float)(x), (float)(y), (float)(z),			\
+		(float)(result), (exceptmask), (excepts));		\
+	test(fmal, (x), (y), (z), (result), (exceptmask), (excepts));	\
+} while (0)
+
+/* Test in all rounding modes. */
+#define	testrnd(func, x, y, z, rn, ru, rd, rz, exceptmask, excepts)	do { \
+	fesetround(FE_TONEAREST);					\
+	test((func), (x), (y), (z), (rn), (exceptmask), (excepts));	\
+	fesetround(FE_UPWARD);						\
+	test((func), (x), (y), (z), (ru), (exceptmask), (excepts));	\
+	fesetround(FE_DOWNWARD);					\
+	test((func), (x), (y), (z), (rd), (exceptmask), (excepts));	\
+	fesetround(FE_TOWARDZERO);					\
+	test((func), (x), (y), (z), (rz), (exceptmask), (excepts));	\
+} while (0)
+
+/*
+ * This is needed because clang constant-folds fma in ways that are incorrect
+ * in rounding modes other than FE_TONEAREST.
+ */
+volatile double one = 1.0;
+
+static void
+test_zeroes(void)
+{
+	const int rd = (fegetround() == FE_DOWNWARD);
+
+	testall(0.0, 0.0, 0.0, 0.0, ALL_STD_EXCEPT, 0);
+	testall(1.0, 0.0, 0.0, 0.0, ALL_STD_EXCEPT, 0);
+	testall(0.0, 1.0, 0.0, 0.0, ALL_STD_EXCEPT, 0);
+	testall(0.0, 0.0, 1.0, 1.0, ALL_STD_EXCEPT, 0);
+
+	testall(-0.0, 0.0, 0.0, rd ? -0.0 : 0.0, ALL_STD_EXCEPT, 0);
+	testall(0.0, -0.0, 0.0, rd ? -0.0 : 0.0, ALL_STD_EXCEPT, 0);
+	testall(-0.0, -0.0, 0.0, 0.0, ALL_STD_EXCEPT, 0);
+	testall(0.0, 0.0, -0.0, rd ? -0.0 : 0.0, ALL_STD_EXCEPT, 0);
+	testall(-0.0, -0.0, -0.0, rd ? -0.0 : 0.0, ALL_STD_EXCEPT, 0);
+
+	testall(-0.0, 0.0, -0.0, -0.0, ALL_STD_EXCEPT, 0);
+	testall(0.0, -0.0, -0.0, -0.0, ALL_STD_EXCEPT, 0);
+
+	testall(-one, one, one, rd ? -0.0 : 0.0, ALL_STD_EXCEPT, 0);
+	testall(one, -one, one, rd ? -0.0 : 0.0, ALL_STD_EXCEPT, 0);
+	testall(-one, -one, -one, rd ? -0.0 : 0.0, ALL_STD_EXCEPT, 0);
+
+	switch (fegetround()) {
+	case FE_TONEAREST:
+	case FE_TOWARDZERO:
+		test(fmaf, -FLT_MIN, FLT_MIN, 0.0, -0.0,
+		     ALL_STD_EXCEPT, FE_INEXACT | FE_UNDERFLOW);
+		test(fma, -DBL_MIN, DBL_MIN, 0.0, -0.0,
+		     ALL_STD_EXCEPT, FE_INEXACT | FE_UNDERFLOW);
+		test(fmal, -LDBL_MIN, LDBL_MIN, 0.0, -0.0,
+		     ALL_STD_EXCEPT, FE_INEXACT | FE_UNDERFLOW);
+	}
+}
+
+static void
+test_infinities(void)
+{
+
+	testall(INFINITY, 1.0, -1.0, INFINITY, ALL_STD_EXCEPT, 0);
+	testall(-1.0, INFINITY, 0.0, -INFINITY, ALL_STD_EXCEPT, 0);
+	testall(0.0, 0.0, INFINITY, INFINITY, ALL_STD_EXCEPT, 0);
+	testall(1.0, 1.0, INFINITY, INFINITY, ALL_STD_EXCEPT, 0);
+	testall(1.0, 1.0, -INFINITY, -INFINITY, ALL_STD_EXCEPT, 0);
+
+	testall(INFINITY, -INFINITY, 1.0, -INFINITY, ALL_STD_EXCEPT, 0);
+	testall(INFINITY, INFINITY, 1.0, INFINITY, ALL_STD_EXCEPT, 0);
+	testall(-INFINITY, -INFINITY, INFINITY, INFINITY, ALL_STD_EXCEPT, 0);
+
+	testall(0.0, INFINITY, 1.0, NAN, ALL_STD_EXCEPT, FE_INVALID);
+	testall(INFINITY, 0.0, -0.0, NAN, ALL_STD_EXCEPT, FE_INVALID);
+
+	/* The invalid exception is optional in this case. */
+	testall(INFINITY, 0.0, NAN, NAN, ALL_STD_EXCEPT & ~FE_INVALID, 0);
+
+	testall(INFINITY, INFINITY, -INFINITY, NAN,
+		ALL_STD_EXCEPT, FE_INVALID);
+	testall(-INFINITY, INFINITY, INFINITY, NAN,
+		ALL_STD_EXCEPT, FE_INVALID);
+	testall(INFINITY, -1.0, INFINITY, NAN,
+		ALL_STD_EXCEPT, FE_INVALID);
+
+	test(fmaf, FLT_MAX, FLT_MAX, -INFINITY, -INFINITY, ALL_STD_EXCEPT, 0);
+	test(fma, DBL_MAX, DBL_MAX, -INFINITY, -INFINITY, ALL_STD_EXCEPT, 0);
+	test(fmal, LDBL_MAX, LDBL_MAX, -INFINITY, -INFINITY,
+	     ALL_STD_EXCEPT, 0);
+	test(fmaf, FLT_MAX, -FLT_MAX, INFINITY, INFINITY, ALL_STD_EXCEPT, 0);
+	test(fma, DBL_MAX, -DBL_MAX, INFINITY, INFINITY, ALL_STD_EXCEPT, 0);
+	test(fmal, LDBL_MAX, -LDBL_MAX, INFINITY, INFINITY,
+	     ALL_STD_EXCEPT, 0);
+}
+
+static void
+test_nans(void)
+{
+
+	testall(NAN, 0.0, 0.0, NAN, ALL_STD_EXCEPT, 0);
+	testall(1.0, NAN, 1.0, NAN, ALL_STD_EXCEPT, 0);
+	testall(1.0, -1.0, NAN, NAN, ALL_STD_EXCEPT, 0);
+	testall(0.0, 0.0, NAN, NAN, ALL_STD_EXCEPT, 0);
+	testall(NAN, NAN, NAN, NAN, ALL_STD_EXCEPT, 0);
+
+	/* x*y should not raise an inexact/overflow/underflow if z is NaN. */
+	testall(M_PI, M_PI, NAN, NAN, ALL_STD_EXCEPT, 0);
+	test(fmaf, FLT_MIN, FLT_MIN, NAN, NAN, ALL_STD_EXCEPT, 0);
+	test(fma, DBL_MIN, DBL_MIN, NAN, NAN, ALL_STD_EXCEPT, 0);
+	test(fmal, LDBL_MIN, LDBL_MIN, NAN, NAN, ALL_STD_EXCEPT, 0);
+	test(fmaf, FLT_MAX, FLT_MAX, NAN, NAN, ALL_STD_EXCEPT, 0);
+	test(fma, DBL_MAX, DBL_MAX, NAN, NAN, ALL_STD_EXCEPT, 0);
+	test(fmal, LDBL_MAX, LDBL_MAX, NAN, NAN, ALL_STD_EXCEPT, 0);
+}
+
+/*
+ * Tests for cases where z is very small compared to x*y.
+ */
+static void
+test_small_z(void)
+{
+
+	/* x*y positive, z positive */
+	if (fegetround() == FE_UPWARD) {
+		test(fmaf, one, one, 0x1.0p-100, 1.0 + FLT_EPSILON,
+		     ALL_STD_EXCEPT, FE_INEXACT);
+		test(fma, one, one, 0x1.0p-200, 1.0 + DBL_EPSILON,
+		     ALL_STD_EXCEPT, FE_INEXACT);
+		test(fmal, one, one, 0x1.0p-200, 1.0 + LDBL_EPSILON,
+		     ALL_STD_EXCEPT, FE_INEXACT);
+	} else {
+		testall(0x1.0p100, one, 0x1.0p-100, 0x1.0p100,
+			ALL_STD_EXCEPT, FE_INEXACT);
+	}
+
+	/* x*y negative, z negative */
+	if (fegetround() == FE_DOWNWARD) {
+		test(fmaf, -one, one, -0x1.0p-100, -(1.0 + FLT_EPSILON),
+		     ALL_STD_EXCEPT, FE_INEXACT);
+		test(fma, -one, one, -0x1.0p-200, -(1.0 + DBL_EPSILON),
+		     ALL_STD_EXCEPT, FE_INEXACT);
+		test(fmal, -one, one, -0x1.0p-200, -(1.0 + LDBL_EPSILON),
+		     ALL_STD_EXCEPT, FE_INEXACT);
+	} else {
+		testall(0x1.0p100, -one, -0x1.0p-100, -0x1.0p100,
+			ALL_STD_EXCEPT, FE_INEXACT);
+	}
+
+	/* x*y positive, z negative */
+	if (fegetround() == FE_DOWNWARD || fegetround() == FE_TOWARDZERO) {
+		test(fmaf, one, one, -0x1.0p-100, 1.0 - FLT_EPSILON / 2,
+		     ALL_STD_EXCEPT, FE_INEXACT);
+		test(fma, one, one, -0x1.0p-200, 1.0 - DBL_EPSILON / 2,
+		     ALL_STD_EXCEPT, FE_INEXACT);
+		test(fmal, one, one, -0x1.0p-200, 1.0 - LDBL_EPSILON / 2,
+		     ALL_STD_EXCEPT, FE_INEXACT);
+	} else {
+		testall(0x1.0p100, one, -0x1.0p-100, 0x1.0p100,
+			ALL_STD_EXCEPT, FE_INEXACT);
+	}
+
+	/* x*y negative, z positive */
+	if (fegetround() == FE_UPWARD || fegetround() == FE_TOWARDZERO) {
+		test(fmaf, -one, one, 0x1.0p-100, -1.0 + FLT_EPSILON / 2,
+		     ALL_STD_EXCEPT, FE_INEXACT);
+		test(fma, -one, one, 0x1.0p-200, -1.0 + DBL_EPSILON / 2,
+		     ALL_STD_EXCEPT, FE_INEXACT);
+		test(fmal, -one, one, 0x1.0p-200, -1.0 + LDBL_EPSILON / 2,
+		     ALL_STD_EXCEPT, FE_INEXACT);
+	} else {
+		testall(-0x1.0p100, one, 0x1.0p-100, -0x1.0p100,
+			ALL_STD_EXCEPT, FE_INEXACT);
+	}
+}
+
+/*
+ * Tests for cases where z is very large compared to x*y.
+ */
+static void
+test_big_z(void)
+{
+
+	/* z positive, x*y positive */
+	if (fegetround() == FE_UPWARD) {
+		test(fmaf, 0x1.0p-50, 0x1.0p-50, 1.0, 1.0 + FLT_EPSILON,
+		     ALL_STD_EXCEPT, FE_INEXACT);
+		test(fma, 0x1.0p-100, 0x1.0p-100, 1.0, 1.0 + DBL_EPSILON,
+		     ALL_STD_EXCEPT, FE_INEXACT);
+		test(fmal, 0x1.0p-100, 0x1.0p-100, 1.0, 1.0 + LDBL_EPSILON,
+		     ALL_STD_EXCEPT, FE_INEXACT);
+	} else {
+		testall(-0x1.0p-50, -0x1.0p-50, 0x1.0p100, 0x1.0p100,
+			ALL_STD_EXCEPT, FE_INEXACT);
+	}
+
+	/* z negative, x*y negative */
+	if (fegetround() == FE_DOWNWARD) {
+		test(fmaf, -0x1.0p-50, 0x1.0p-50, -1.0, -(1.0 + FLT_EPSILON),
+		     ALL_STD_EXCEPT, FE_INEXACT);
+		test(fma, -0x1.0p-100, 0x1.0p-100, -1.0, -(1.0 + DBL_EPSILON),
+		     ALL_STD_EXCEPT, FE_INEXACT);
+		test(fmal, -0x1.0p-100, 0x1.0p-100, -1.0, -(1.0 + LDBL_EPSILON),
+		     ALL_STD_EXCEPT, FE_INEXACT);
+	} else {
+		testall(0x1.0p-50, -0x1.0p-50, -0x1.0p100, -0x1.0p100,
+			ALL_STD_EXCEPT, FE_INEXACT);
+	}
+
+	/* z negative, x*y positive */
+	if (fegetround() == FE_UPWARD || fegetround() == FE_TOWARDZERO) {
+		test(fmaf, -0x1.0p-50, -0x1.0p-50, -1.0,
+		     -1.0 + FLT_EPSILON / 2, ALL_STD_EXCEPT, FE_INEXACT);
+		test(fma, -0x1.0p-100, -0x1.0p-100, -1.0,
+		     -1.0 + DBL_EPSILON / 2, ALL_STD_EXCEPT, FE_INEXACT);
+		test(fmal, -0x1.0p-100, -0x1.0p-100, -1.0,
+		     -1.0 + LDBL_EPSILON / 2, ALL_STD_EXCEPT, FE_INEXACT);
+	} else {
+		testall(0x1.0p-50, 0x1.0p-50, -0x1.0p100, -0x1.0p100,
+			ALL_STD_EXCEPT, FE_INEXACT);
+	}
+
+	/* z positive, x*y negative */
+	if (fegetround() == FE_DOWNWARD || fegetround() == FE_TOWARDZERO) {
+		test(fmaf, 0x1.0p-50, -0x1.0p-50, 1.0, 1.0 - FLT_EPSILON / 2,
+		     ALL_STD_EXCEPT, FE_INEXACT);
+		test(fma, 0x1.0p-100, -0x1.0p-100, 1.0, 1.0 - DBL_EPSILON / 2,
+		     ALL_STD_EXCEPT, FE_INEXACT);
+		test(fmal, 0x1.0p-100, -0x1.0p-100, 1.0, 1.0 - LDBL_EPSILON / 2,
+		     ALL_STD_EXCEPT, FE_INEXACT);
+	} else {
+		testall(-0x1.0p-50, 0x1.0p-50, 0x1.0p100, 0x1.0p100,
+			ALL_STD_EXCEPT, FE_INEXACT);
+	}
+}
+
+static void
+test_accuracy(void)
+{
+
+	/* ilogb(x*y) - ilogb(z) = 20 */
+	testrnd(fmaf, -0x1.c139d8p-51, -0x1.600e7ap32, 0x1.26558cp-38,
+		0x1.34e48ap-18, 0x1.34e48cp-18, 0x1.34e48ap-18, 0x1.34e48ap-18,
+		ALL_STD_EXCEPT, FE_INEXACT);
+	testrnd(fma, -0x1.c139d7b84f1a3p-51, -0x1.600e7a2a16484p32,
+		0x1.26558cac31580p-38, 0x1.34e48a78aae97p-18,

*** DIFF OUTPUT TRUNCATED AT 1000 LINES ***



Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?201512200506.tBK56ik1092460>