/*
* 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 2003 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*
* On SPARC V8, _Q_cplx_div_rx(v, a, w) sets *v = *a / *w with in-
* finities handling according to C99.
*
* On SPARC V9, _Q_cplx_div_rx(a, w) returns *a / *w with infinities
* handled according to C99.
*
* If a and w are both finite and w is nonzero, _Q_cplx_div_rx de-
* livers the complex quotient q according to the usual formula: let
* c = Re(w), and d = Im(w); then q = x + I * y where x = (a * c) / r
* and y = (-a * d) / r with r = c * c + d * d. This implementation
* scales to avoid premature underflow or overflow.
*
* If a is neither NaN nor zero and w is zero, or if a is infinite
* and w is finite and nonzero, _Q_cplx_div_rx delivers an infinite
* result. If a is finite and w is infinite, _Q_cplx_div_rx delivers
* a zero result.
*
* If a and w are both zero or both infinite, or if either a or w is
* NaN, _Q_cplx_div_rx delivers NaN + I * NaN. C99 doesn't specify
* these cases.
*
* This implementation can raise spurious underflow, overflow, in-
* valid operation, inexact, and division-by-zero exceptions. C99
* allows this.
*/
#endif
extern void _Q_scl(long double *, int);
extern void _Q_scle(long double *, int);
/*
* Return +1 if x is +Inf, -1 if x is -Inf, and 0 otherwise
*/
static int
testinfl(long double x)
{
union {
int i[4];
long double q;
} xx;
xx.q = x;
}
#ifdef __sparcv9
long double _Complex
{
long double _Complex v;
#else
void
const long double _Complex *w)
{
#endif
union {
int i[4];
long double q;
a = *pa;
/*
* The following is equivalent to
*
* c = creall(*w); d = cimagl(*w);
*/
c = ((long double *)w)[0];
d = ((long double *)w)[1];
/* extract high-order words to estimate |a| and |w| */
aa.q = a;
cc.q = c;
dd.q = d;
/* check for special cases */
i = testinfl(c);
j = testinfl(d);
if (i | j) { /* w is infinite */
} else /* w is nan */
a += c + d;
c *= a;
d *= -a;
goto done;
}
/* w is zero; multiply a by 1/Re(w) - I * Im(w) */
c = 1.0l / c;
i = testinfl(a);
if (i) { /* a is infinite */
a = i;
}
c *= a;
d = (a == 0.0l)? c : -a * d;
goto done;
}
c *= a;
d *= -a;
goto done;
}
/*
* Compute the real and imaginary parts of the quotient,
* scaling to avoid overflow or underflow.
*/
sc = c;
sd = d;
a /= r;
c *= a;
d *= -a;
/* compensate for scaling */
done:
#ifdef __sparcv9
((long double *)&v)[0] = c;
((long double *)&v)[1] = d;
return (v);
#else
((long double *)v)[0] = c;
((long double *)v)[1] = d;
#endif
}