]> CyberLeo.Net >> Repos - FreeBSD/releng/10.0.git/blob - tools/regression/lib/msun/test-conj.c
- Copy stable/10 (r259064) to releng/10.0 as part of the
[FreeBSD/releng/10.0.git] / tools / regression / lib / msun / test-conj.c
1 /*-
2  * Copyright (c) 2008 David Schultz <das@FreeBSD.org>
3  * All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions
7  * are met:
8  * 1. Redistributions of source code must retain the above copyright
9  *    notice, this list of conditions and the following disclaimer.
10  * 2. Redistributions in binary form must reproduce the above copyright
11  *    notice, this list of conditions and the following disclaimer in the
12  *    documentation and/or other materials provided with the distribution.
13  *
14  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24  * SUCH DAMAGE.
25  */
26
27 /*
28  * Tests for conj{,f,l}()
29  */
30
31 #include <sys/cdefs.h>
32 __FBSDID("$FreeBSD$");
33
34 #include <assert.h>
35 #include <complex.h>
36 #include <fenv.h>
37 #include <math.h>
38 #include <stdio.h>
39
40 #include "test-utils.h"
41
42 #pragma STDC CX_LIMITED_RANGE   off
43
44 /* Make sure gcc doesn't use builtin versions of these or honor __pure2. */
45 static float complex (*libconjf)(float complex) = conjf;
46 static double complex (*libconj)(double complex) = conj;
47 static long double complex (*libconjl)(long double complex) = conjl;
48 static float (*libcrealf)(float complex) = crealf;
49 static double (*libcreal)(double complex) = creal;
50 static long double (*libcreall)(long double complex) = creall;
51 static float (*libcimagf)(float complex) = cimagf;
52 static double (*libcimag)(double complex) = cimag;
53 static long double (*libcimagl)(long double complex) = cimagl;
54
55 static const double tests[] = {
56         /* a +  bI */
57         0.0,    0.0,
58         0.0,    1.0,
59         1.0,    0.0,
60         -1.0,   0.0,
61         1.0,    -0.0,
62         0.0,    -1.0,
63         2.0,    4.0,
64         0.0,    INFINITY,
65         0.0,    -INFINITY,
66         INFINITY, 0.0,
67         NAN,    1.0,
68         1.0,    NAN,
69         NAN,    NAN,
70         -INFINITY, INFINITY,
71 };
72
73 int
74 main(int argc, char *argv[])
75 {
76         static const int ntests = sizeof(tests) / sizeof(tests[0]) / 2;
77         complex float in;
78         complex long double expected;
79         int i;
80
81         printf("1..%d\n", ntests * 3);
82
83         for (i = 0; i < ntests; i++) {
84                 __real__ expected = __real__ in = tests[2 * i];
85                 __imag__ in = tests[2 * i + 1];
86                 __imag__ expected = -cimag(in);
87
88                 assert(fpequal(libcrealf(in), __real__ in));
89                 assert(fpequal(libcreal(in), __real__ in));
90                 assert(fpequal(libcreall(in), __real__ in));
91                 assert(fpequal(libcimagf(in), __imag__ in));
92                 assert(fpequal(libcimag(in), __imag__ in));
93                 assert(fpequal(libcimagl(in), __imag__ in));            
94
95                 feclearexcept(FE_ALL_EXCEPT);
96                 if (!cfpequal(libconjf(in), expected)) {
97                         printf("not ok %d\t# conjf(%#.2g + %#.2gI): "
98                                "wrong value\n",
99                                3 * i + 1, creal(in), cimag(in));
100                 } else if (fetestexcept(FE_ALL_EXCEPT)) {
101                         printf("not ok %d\t# conjf(%#.2g + %#.2gI): "
102                                "threw an exception\n",
103                                3 * i + 1, creal(in), cimag(in));
104                 } else {
105                         printf("ok %d\t\t# conjf(%#.2g + %#.2gI)\n",
106                                3 * i + 1, creal(in), cimag(in));
107                 }
108
109                 feclearexcept(FE_ALL_EXCEPT);
110                 if (!cfpequal(libconj(in), expected)) {
111                         printf("not ok %d\t# conj(%#.2g + %#.2gI): "
112                                "wrong value\n",
113                                3 * i + 2, creal(in), cimag(in));
114                 } else if (fetestexcept(FE_ALL_EXCEPT)) {
115                         printf("not ok %d\t# conj(%#.2g + %#.2gI): "
116                                "threw an exception\n",
117                                3 * i + 2, creal(in), cimag(in));
118                 } else {
119                         printf("ok %d\t\t# conj(%#.2g + %#.2gI)\n",
120                                3 * i + 2, creal(in), cimag(in));
121                 }
122
123                 feclearexcept(FE_ALL_EXCEPT);
124                 if (!cfpequal(libconjl(in), expected)) {
125                         printf("not ok %d\t# conjl(%#.2g + %#.2gI): "
126                                "wrong value\n",
127                                3 * i + 3, creal(in), cimag(in));
128                 } else if (fetestexcept(FE_ALL_EXCEPT)) {
129                         printf("not ok %d\t# conjl(%#.2g + %#.2gI): "
130                                "threw an exception\n",
131                                3 * i + 3, creal(in), cimag(in));
132                 } else {
133                         printf("ok %d\t\t# conjl(%#.2g + %#.2gI)\n",
134                                3 * i + 3, creal(in), cimag(in));
135                 }
136         }
137
138         return (0);
139 }