xref: /illumos-gate/usr/src/lib/libc/sparc/fp/_F_cplx_mul.c (revision 7c478bd95313f5f23a4c958a745db2134aa03244)
1*7c478bd9Sstevel@tonic-gate /*
2*7c478bd9Sstevel@tonic-gate  * CDDL HEADER START
3*7c478bd9Sstevel@tonic-gate  *
4*7c478bd9Sstevel@tonic-gate  * The contents of this file are subject to the terms of the
5*7c478bd9Sstevel@tonic-gate  * Common Development and Distribution License, Version 1.0 only
6*7c478bd9Sstevel@tonic-gate  * (the "License").  You may not use this file except in compliance
7*7c478bd9Sstevel@tonic-gate  * with the License.
8*7c478bd9Sstevel@tonic-gate  *
9*7c478bd9Sstevel@tonic-gate  * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10*7c478bd9Sstevel@tonic-gate  * or http://www.opensolaris.org/os/licensing.
11*7c478bd9Sstevel@tonic-gate  * See the License for the specific language governing permissions
12*7c478bd9Sstevel@tonic-gate  * and limitations under the License.
13*7c478bd9Sstevel@tonic-gate  *
14*7c478bd9Sstevel@tonic-gate  * When distributing Covered Code, include this CDDL HEADER in each
15*7c478bd9Sstevel@tonic-gate  * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16*7c478bd9Sstevel@tonic-gate  * If applicable, add the following below this CDDL HEADER, with the
17*7c478bd9Sstevel@tonic-gate  * fields enclosed by brackets "[]" replaced with your own identifying
18*7c478bd9Sstevel@tonic-gate  * information: Portions Copyright [yyyy] [name of copyright owner]
19*7c478bd9Sstevel@tonic-gate  *
20*7c478bd9Sstevel@tonic-gate  * CDDL HEADER END
21*7c478bd9Sstevel@tonic-gate  */
22*7c478bd9Sstevel@tonic-gate /*
23*7c478bd9Sstevel@tonic-gate  * Copyright 2003 Sun Microsystems, Inc.  All rights reserved.
24*7c478bd9Sstevel@tonic-gate  * Use is subject to license terms.
25*7c478bd9Sstevel@tonic-gate  */
26*7c478bd9Sstevel@tonic-gate 
27*7c478bd9Sstevel@tonic-gate #pragma ident	"%Z%%M%	%I%	%E% SMI"
28*7c478bd9Sstevel@tonic-gate 
29*7c478bd9Sstevel@tonic-gate /*
30*7c478bd9Sstevel@tonic-gate  * _F_cplx_mul(z, w) returns z * w with infinities handled according
31*7c478bd9Sstevel@tonic-gate  * to C99.
32*7c478bd9Sstevel@tonic-gate  *
33*7c478bd9Sstevel@tonic-gate  * If z and w are both finite, _F_cplx_mul(z, w) delivers the complex
34*7c478bd9Sstevel@tonic-gate  * product according to the usual formula: let a = Re(z), b = Im(z),
35*7c478bd9Sstevel@tonic-gate  * c = Re(w), and d = Im(w); then _F_cplx_mul(z, w) delivers x + I * y
36*7c478bd9Sstevel@tonic-gate  * where x = a * c - b * d and y = a * d + b * c.  This implementation
37*7c478bd9Sstevel@tonic-gate  * uses double precision to form these expressions, so none of the
38*7c478bd9Sstevel@tonic-gate  * intermediate products can overflow.
39*7c478bd9Sstevel@tonic-gate  *
40*7c478bd9Sstevel@tonic-gate  * If one of z or w is infinite and the other is either finite nonzero
41*7c478bd9Sstevel@tonic-gate  * or infinite, _F_cplx_mul delivers an infinite result.  If one factor
42*7c478bd9Sstevel@tonic-gate  * is infinite and the other is zero, _F_cplx_mul delivers NaN + I * NaN.
43*7c478bd9Sstevel@tonic-gate  * C99 doesn't specify the latter case.
44*7c478bd9Sstevel@tonic-gate  *
45*7c478bd9Sstevel@tonic-gate  * C99 also doesn't specify what should happen if either z or w is a
46*7c478bd9Sstevel@tonic-gate  * complex NaN (i.e., neither finite nor infinite).  This implementation
47*7c478bd9Sstevel@tonic-gate  * delivers NaN + I * NaN in this case.
48*7c478bd9Sstevel@tonic-gate  *
49*7c478bd9Sstevel@tonic-gate  * This implementation can raise spurious invalid operation and inexact
50*7c478bd9Sstevel@tonic-gate  * exceptions.  C99 allows this.
51*7c478bd9Sstevel@tonic-gate  */
52*7c478bd9Sstevel@tonic-gate 
53*7c478bd9Sstevel@tonic-gate #if !defined(sparc) && !defined(__sparc)
54*7c478bd9Sstevel@tonic-gate #error This code is for SPARC only
55*7c478bd9Sstevel@tonic-gate #endif
56*7c478bd9Sstevel@tonic-gate 
57*7c478bd9Sstevel@tonic-gate static union {
58*7c478bd9Sstevel@tonic-gate 	int	i[2];
59*7c478bd9Sstevel@tonic-gate 	double	d;
60*7c478bd9Sstevel@tonic-gate } inf = {
61*7c478bd9Sstevel@tonic-gate 	0x7ff00000, 0
62*7c478bd9Sstevel@tonic-gate };
63*7c478bd9Sstevel@tonic-gate 
64*7c478bd9Sstevel@tonic-gate /*
65*7c478bd9Sstevel@tonic-gate  * Return +1 if x is +Inf, -1 if x is -Inf, and 0 otherwise
66*7c478bd9Sstevel@tonic-gate  */
67*7c478bd9Sstevel@tonic-gate static int
68*7c478bd9Sstevel@tonic-gate testinff(float x)
69*7c478bd9Sstevel@tonic-gate {
70*7c478bd9Sstevel@tonic-gate 	union {
71*7c478bd9Sstevel@tonic-gate 		int	i;
72*7c478bd9Sstevel@tonic-gate 		float	f;
73*7c478bd9Sstevel@tonic-gate 	} xx;
74*7c478bd9Sstevel@tonic-gate 
75*7c478bd9Sstevel@tonic-gate 	xx.f = x;
76*7c478bd9Sstevel@tonic-gate 	return ((((xx.i << 1) - 0xff000000) == 0)? (1 | (xx.i >> 31)) : 0);
77*7c478bd9Sstevel@tonic-gate }
78*7c478bd9Sstevel@tonic-gate 
79*7c478bd9Sstevel@tonic-gate float _Complex
80*7c478bd9Sstevel@tonic-gate _F_cplx_mul(float _Complex z, float _Complex w)
81*7c478bd9Sstevel@tonic-gate {
82*7c478bd9Sstevel@tonic-gate 	float _Complex	v;
83*7c478bd9Sstevel@tonic-gate 	float		a, b, c, d;
84*7c478bd9Sstevel@tonic-gate 	double		x, y;
85*7c478bd9Sstevel@tonic-gate 	int		recalc, i, j;
86*7c478bd9Sstevel@tonic-gate 
87*7c478bd9Sstevel@tonic-gate 	/*
88*7c478bd9Sstevel@tonic-gate 	 * The following is equivalent to
89*7c478bd9Sstevel@tonic-gate 	 *
90*7c478bd9Sstevel@tonic-gate 	 *  a = crealf(z); b = cimagf(z);
91*7c478bd9Sstevel@tonic-gate 	 *  c = crealf(w); d = cimagf(w);
92*7c478bd9Sstevel@tonic-gate 	 */
93*7c478bd9Sstevel@tonic-gate 	a = ((float *)&z)[0];
94*7c478bd9Sstevel@tonic-gate 	b = ((float *)&z)[1];
95*7c478bd9Sstevel@tonic-gate 	c = ((float *)&w)[0];
96*7c478bd9Sstevel@tonic-gate 	d = ((float *)&w)[1];
97*7c478bd9Sstevel@tonic-gate 
98*7c478bd9Sstevel@tonic-gate 	x = (double)a * c - (double)b * d;
99*7c478bd9Sstevel@tonic-gate 	y = (double)a * d + (double)b * c;
100*7c478bd9Sstevel@tonic-gate 
101*7c478bd9Sstevel@tonic-gate 	if (x != x && y != y) {
102*7c478bd9Sstevel@tonic-gate 		/*
103*7c478bd9Sstevel@tonic-gate 		 * Both x and y are NaN, so z and w can't both be finite.
104*7c478bd9Sstevel@tonic-gate 		 * If at least one of z or w is a complex NaN, and neither
105*7c478bd9Sstevel@tonic-gate 		 * is infinite, then we might as well deliver NaN + I * NaN.
106*7c478bd9Sstevel@tonic-gate 		 * So the only cases to check are when one of z or w is
107*7c478bd9Sstevel@tonic-gate 		 * infinite.
108*7c478bd9Sstevel@tonic-gate 		 */
109*7c478bd9Sstevel@tonic-gate 		recalc = 0;
110*7c478bd9Sstevel@tonic-gate 		i = testinff(a);
111*7c478bd9Sstevel@tonic-gate 		j = testinff(b);
112*7c478bd9Sstevel@tonic-gate 		if (i | j) { /* z is infinite */
113*7c478bd9Sstevel@tonic-gate 			/* "factor out" infinity */
114*7c478bd9Sstevel@tonic-gate 			a = i;
115*7c478bd9Sstevel@tonic-gate 			b = j;
116*7c478bd9Sstevel@tonic-gate 			recalc = 1;
117*7c478bd9Sstevel@tonic-gate 		}
118*7c478bd9Sstevel@tonic-gate 		i = testinff(c);
119*7c478bd9Sstevel@tonic-gate 		j = testinff(d);
120*7c478bd9Sstevel@tonic-gate 		if (i | j) { /* w is infinite */
121*7c478bd9Sstevel@tonic-gate 			/* "factor out" infinity */
122*7c478bd9Sstevel@tonic-gate 			c = i;
123*7c478bd9Sstevel@tonic-gate 			d = j;
124*7c478bd9Sstevel@tonic-gate 			recalc = 1;
125*7c478bd9Sstevel@tonic-gate 		}
126*7c478bd9Sstevel@tonic-gate 		if (recalc) {
127*7c478bd9Sstevel@tonic-gate 			x = inf.d * ((double)a * c - (double)b * d);
128*7c478bd9Sstevel@tonic-gate 			y = inf.d * ((double)a * d + (double)b * c);
129*7c478bd9Sstevel@tonic-gate 		}
130*7c478bd9Sstevel@tonic-gate 	}
131*7c478bd9Sstevel@tonic-gate 
132*7c478bd9Sstevel@tonic-gate 	/*
133*7c478bd9Sstevel@tonic-gate 	 * The following is equivalent to
134*7c478bd9Sstevel@tonic-gate 	 *
135*7c478bd9Sstevel@tonic-gate 	 *  return x + I * y;
136*7c478bd9Sstevel@tonic-gate 	 */
137*7c478bd9Sstevel@tonic-gate 	((float *)&v)[0] = (float)x;
138*7c478bd9Sstevel@tonic-gate 	((float *)&v)[1] = (float)y;
139*7c478bd9Sstevel@tonic-gate 	return (v);
140*7c478bd9Sstevel@tonic-gate }
141