xref: /freebsd/lib/msun/src/s_csqrtf.c (revision d0b2dbfa0ecf2bbc9709efc5e20baf8e4b44bbbf)
1 /*-
2  * SPDX-License-Identifier: BSD-2-Clause
3  *
4  * Copyright (c) 2007 David Schultz <das@FreeBSD.ORG>
5  * All rights reserved.
6  *
7  * Redistribution and use in source and binary forms, with or without
8  * modification, are permitted provided that the following conditions
9  * are met:
10  * 1. Redistributions of source code must retain the above copyright
11  *    notice, this list of conditions and the following disclaimer.
12  * 2. Redistributions in binary form must reproduce the above copyright
13  *    notice, this list of conditions and the following disclaimer in the
14  *    documentation and/or other materials provided with the distribution.
15  *
16  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26  * SUCH DAMAGE.
27  */
28 
29 #include <sys/cdefs.h>
30 #include <complex.h>
31 #include <math.h>
32 
33 #include "math_private.h"
34 
35 float complex
36 csqrtf(float complex z)
37 {
38 	double t;
39 	float a, b;
40 
41 	a = creal(z);
42 	b = cimag(z);
43 
44 	/* Handle special cases. */
45 	if (z == 0)
46 		return (CMPLXF(0, b));
47 	if (isinf(b))
48 		return (CMPLXF(INFINITY, b));
49 	if (isnan(a)) {
50 		t = (b - b) / (b - b);	/* raise invalid if b is not a NaN */
51 		return (CMPLXF(a + 0.0L + t, a + 0.0L + t)); /* NaN + NaN i */
52 	}
53 	if (isinf(a)) {
54 		/*
55 		 * csqrtf(inf + NaN i)  = inf +  NaN i
56 		 * csqrtf(inf + y i)    = inf +  0 i
57 		 * csqrtf(-inf + NaN i) = NaN +- inf i
58 		 * csqrtf(-inf + y i)   = 0   +  inf i
59 		 */
60 		if (signbit(a))
61 			return (CMPLXF(fabsf(b - b), copysignf(a, b)));
62 		else
63 			return (CMPLXF(a, copysignf(b - b, b)));
64 	}
65 	if (isnan(b)) {
66 		t = (a - a) / (a - a);	/* raise invalid */
67 		return (CMPLXF(b + 0.0L + t, b + 0.0L + t)); /* NaN + NaN i */
68 	}
69 
70 	/*
71 	 * We compute t in double precision to avoid overflow and to
72 	 * provide correct rounding in nearly all cases.
73 	 * This is Algorithm 312, CACM vol 10, Oct 1967.
74 	 */
75 	if (a >= 0) {
76 		t = sqrt((a + hypot(a, b)) * 0.5);
77 		return (CMPLXF(t, b / (2 * t)));
78 	} else {
79 		t = sqrt((-a + hypot(a, b)) * 0.5);
80 		return (CMPLXF(fabsf(b) / (2 * t), copysignf(t, b)));
81 	}
82 }
83