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 2004 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 /*
28*7c478bd9Sstevel@tonic-gate * _D_cplx_div_ix(b, w) returns (I * b) / w with infinities handled
29*7c478bd9Sstevel@tonic-gate * according to C99.
30*7c478bd9Sstevel@tonic-gate *
31*7c478bd9Sstevel@tonic-gate * If b and w are both finite and w is nonzero, _D_cplx_div_ix(b, w)
32*7c478bd9Sstevel@tonic-gate * delivers the complex quotient q according to the usual formula:
33*7c478bd9Sstevel@tonic-gate * let c = Re(w), and d = Im(w); then q = x + I * y where x = (b * d)
34*7c478bd9Sstevel@tonic-gate * / r and y = (b * c) / r with r = c * c + d * d. This implementa-
35*7c478bd9Sstevel@tonic-gate * tion computes intermediate results in extended precision to avoid
36*7c478bd9Sstevel@tonic-gate * premature underflow or overflow.
37*7c478bd9Sstevel@tonic-gate *
38*7c478bd9Sstevel@tonic-gate * If b is neither NaN nor zero and w is zero, or if b is infinite
39*7c478bd9Sstevel@tonic-gate * and w is finite and nonzero, _D_cplx_div_ix delivers an infinite
40*7c478bd9Sstevel@tonic-gate * result. If b is finite and w is infinite, _D_cplx_div_ix delivers
41*7c478bd9Sstevel@tonic-gate * a zero result.
42*7c478bd9Sstevel@tonic-gate *
43*7c478bd9Sstevel@tonic-gate * If b and w are both zero or both infinite, or if either b or w is
44*7c478bd9Sstevel@tonic-gate * NaN, _D_cplx_div_ix delivers NaN + I * NaN. C99 doesn't specify
45*7c478bd9Sstevel@tonic-gate * these cases.
46*7c478bd9Sstevel@tonic-gate *
47*7c478bd9Sstevel@tonic-gate * This implementation can raise spurious invalid operation, inexact,
48*7c478bd9Sstevel@tonic-gate * and division-by-zero exceptions. C99 allows this.
49*7c478bd9Sstevel@tonic-gate *
50*7c478bd9Sstevel@tonic-gate * Warning: Do not attempt to "optimize" this code by removing multi-
51*7c478bd9Sstevel@tonic-gate * plications by zero.
52*7c478bd9Sstevel@tonic-gate */
53*7c478bd9Sstevel@tonic-gate
54*7c478bd9Sstevel@tonic-gate #if !defined(i386) && !defined(__i386) && !defined(__amd64)
55*7c478bd9Sstevel@tonic-gate #error This code is for x86 only
56*7c478bd9Sstevel@tonic-gate #endif
57*7c478bd9Sstevel@tonic-gate
58*7c478bd9Sstevel@tonic-gate /*
59*7c478bd9Sstevel@tonic-gate * Return +1 if x is +Inf, -1 if x is -Inf, and 0 otherwise
60*7c478bd9Sstevel@tonic-gate */
61*7c478bd9Sstevel@tonic-gate static int
testinf(double x)62*7c478bd9Sstevel@tonic-gate testinf(double x)
63*7c478bd9Sstevel@tonic-gate {
64*7c478bd9Sstevel@tonic-gate union {
65*7c478bd9Sstevel@tonic-gate int i[2];
66*7c478bd9Sstevel@tonic-gate double d;
67*7c478bd9Sstevel@tonic-gate } xx;
68*7c478bd9Sstevel@tonic-gate
69*7c478bd9Sstevel@tonic-gate xx.d = x;
70*7c478bd9Sstevel@tonic-gate return (((((xx.i[1] << 1) - 0xffe00000) | xx.i[0]) == 0)?
71*7c478bd9Sstevel@tonic-gate (1 | (xx.i[1] >> 31)) : 0);
72*7c478bd9Sstevel@tonic-gate }
73*7c478bd9Sstevel@tonic-gate
74*7c478bd9Sstevel@tonic-gate double _Complex
_D_cplx_div_ix(double b,double _Complex w)75*7c478bd9Sstevel@tonic-gate _D_cplx_div_ix(double b, double _Complex w)
76*7c478bd9Sstevel@tonic-gate {
77*7c478bd9Sstevel@tonic-gate double _Complex v;
78*7c478bd9Sstevel@tonic-gate union {
79*7c478bd9Sstevel@tonic-gate int i[2];
80*7c478bd9Sstevel@tonic-gate double d;
81*7c478bd9Sstevel@tonic-gate } cc, dd;
82*7c478bd9Sstevel@tonic-gate double c, d;
83*7c478bd9Sstevel@tonic-gate long double r, x, y;
84*7c478bd9Sstevel@tonic-gate int i, j;
85*7c478bd9Sstevel@tonic-gate
86*7c478bd9Sstevel@tonic-gate /*
87*7c478bd9Sstevel@tonic-gate * The following is equivalent to
88*7c478bd9Sstevel@tonic-gate *
89*7c478bd9Sstevel@tonic-gate * c = creal(w); d = cimag(w);
90*7c478bd9Sstevel@tonic-gate */
91*7c478bd9Sstevel@tonic-gate /* LINTED alignment */
92*7c478bd9Sstevel@tonic-gate c = ((double *)&w)[0];
93*7c478bd9Sstevel@tonic-gate /* LINTED alignment */
94*7c478bd9Sstevel@tonic-gate d = ((double *)&w)[1];
95*7c478bd9Sstevel@tonic-gate
96*7c478bd9Sstevel@tonic-gate r = (long double)c * c + (long double)d * d;
97*7c478bd9Sstevel@tonic-gate
98*7c478bd9Sstevel@tonic-gate if (r == 0.0f) {
99*7c478bd9Sstevel@tonic-gate /* w is zero; multiply b by 1/Re(w) - I * Im(w) */
100*7c478bd9Sstevel@tonic-gate c = 1.0f / c;
101*7c478bd9Sstevel@tonic-gate j = testinf(b);
102*7c478bd9Sstevel@tonic-gate if (j) { /* b is infinite */
103*7c478bd9Sstevel@tonic-gate b = j;
104*7c478bd9Sstevel@tonic-gate }
105*7c478bd9Sstevel@tonic-gate /* LINTED alignment */
106*7c478bd9Sstevel@tonic-gate ((double *)&v)[0] = (b == 0.0f)? b * c : b * d;
107*7c478bd9Sstevel@tonic-gate /* LINTED alignment */
108*7c478bd9Sstevel@tonic-gate ((double *)&v)[1] = b * c;
109*7c478bd9Sstevel@tonic-gate return (v);
110*7c478bd9Sstevel@tonic-gate }
111*7c478bd9Sstevel@tonic-gate
112*7c478bd9Sstevel@tonic-gate r = (long double)b / r;
113*7c478bd9Sstevel@tonic-gate x = (long double)d * r;
114*7c478bd9Sstevel@tonic-gate y = (long double)c * r;
115*7c478bd9Sstevel@tonic-gate
116*7c478bd9Sstevel@tonic-gate if (x != x || y != y) {
117*7c478bd9Sstevel@tonic-gate /*
118*7c478bd9Sstevel@tonic-gate * x or y is NaN, so b and w can't both be finite and
119*7c478bd9Sstevel@tonic-gate * nonzero. Since we handled the case w = 0 above, the
120*7c478bd9Sstevel@tonic-gate * only case to check here is when w is infinite.
121*7c478bd9Sstevel@tonic-gate */
122*7c478bd9Sstevel@tonic-gate i = testinf(c);
123*7c478bd9Sstevel@tonic-gate j = testinf(d);
124*7c478bd9Sstevel@tonic-gate if (i | j) { /* w is infinite */
125*7c478bd9Sstevel@tonic-gate cc.d = c;
126*7c478bd9Sstevel@tonic-gate dd.d = d;
127*7c478bd9Sstevel@tonic-gate c = (cc.i[1] < 0)? -0.0f : 0.0f;
128*7c478bd9Sstevel@tonic-gate d = (dd.i[1] < 0)? -0.0f : 0.0f;
129*7c478bd9Sstevel@tonic-gate x = (long double)d * b;
130*7c478bd9Sstevel@tonic-gate y = (long double)c * b;
131*7c478bd9Sstevel@tonic-gate }
132*7c478bd9Sstevel@tonic-gate }
133*7c478bd9Sstevel@tonic-gate
134*7c478bd9Sstevel@tonic-gate /*
135*7c478bd9Sstevel@tonic-gate * The following is equivalent to
136*7c478bd9Sstevel@tonic-gate *
137*7c478bd9Sstevel@tonic-gate * return x + I * y;
138*7c478bd9Sstevel@tonic-gate */
139*7c478bd9Sstevel@tonic-gate /* LINTED alignment */
140*7c478bd9Sstevel@tonic-gate ((double *)&v)[0] = (double)x;
141*7c478bd9Sstevel@tonic-gate /* LINTED alignment */
142*7c478bd9Sstevel@tonic-gate ((double *)&v)[1] = (double)y;
143*7c478bd9Sstevel@tonic-gate return (v);
144*7c478bd9Sstevel@tonic-gate }
145