/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2004 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*
* _D_cplx_mul(z, w) returns z * w with infinities handled according
* to C99.
*
* If z and w are both finite, _D_cplx_mul(z, w) delivers the complex
* product according to the usual formula: let a = Re(z), b = Im(z),
* c = Re(w), and d = Im(w); then _D_cplx_mul(z, w) delivers x + I * y
* where x = a * c - b * d and y = a * d + b * c. This implementation
* uses extended precision to form these expressions, so none of the
* intermediate products can overflow.
*
* If one of z or w is infinite and the other is either finite nonzero
* or infinite, _D_cplx_mul delivers an infinite result. If one factor
* is infinite and the other is zero, _D_cplx_mul delivers NaN + I * NaN.
* C99 doesn't specify the latter case.
*
* C99 also doesn't specify what should happen if either z or w is a
* complex NaN (i.e., neither finite nor infinite). This implementation
* delivers NaN + I * NaN in this case.
*
* This implementation can raise spurious invalid operation and inexact
* exceptions. C99 allows this.
*/
#endif
static union {
int i;
float f;
} inf = {
0x7f800000
};
/*
* Return +1 if x is +Inf, -1 if x is -Inf, and 0 otherwise
*/
static int
testinf(double x)
{
union {
int i[2];
double d;
} xx;
xx.d = x;
}
double _Complex
_D_cplx_mul(double _Complex z, double _Complex w)
{
double _Complex v;
double a, b, c, d;
long double x, y;
int recalc, i, j;
/*
* The following is equivalent to
*
* a = creal(z); b = cimag(z);
* c = creal(w); d = cimag(w);
*/
/* LINTED alignment */
a = ((double *)&z)[0];
/* LINTED alignment */
b = ((double *)&z)[1];
/* LINTED alignment */
c = ((double *)&w)[0];
/* LINTED alignment */
d = ((double *)&w)[1];
x = (long double)a * c - (long double)b * d;
y = (long double)a * d + (long double)b * c;
if (x != x && y != y) {
/*
* Both x and y are NaN, so z and w can't both be finite.
* If at least one of z or w is a complex NaN, and neither
* is infinite, then we might as well deliver NaN + I * NaN.
* So the only cases to check are when one of z or w is
* infinite.
*/
recalc = 0;
i = testinf(a);
j = testinf(b);
if (i | j) { /* z is infinite */
/* "factor out" infinity */
a = i;
b = j;
recalc = 1;
}
i = testinf(c);
j = testinf(d);
if (i | j) { /* w is infinite */
/* "factor out" infinity */
c = i;
d = j;
recalc = 1;
}
if (recalc) {
x = inf.f * ((long double)a * c - (long double)b * d);
y = inf.f * ((long double)a * d + (long double)b * c);
}
}
/*
* The following is equivalent to
*
* return x + I * y;
*/
/* LINTED alignment */
((double *)&v)[0] = (double)x;
/* LINTED alignment */
((double *)&v)[1] = (double)y;
return (v);
}