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 #if !defined(sparc) && !defined(__sparc) 30*7c478bd9Sstevel@tonic-gate #error This code is for SPARC only 31*7c478bd9Sstevel@tonic-gate #endif 32*7c478bd9Sstevel@tonic-gate 33*7c478bd9Sstevel@tonic-gate /* 34*7c478bd9Sstevel@tonic-gate * _Q_scl(x, n) sets *x = *x * 2^n. 35*7c478bd9Sstevel@tonic-gate * 36*7c478bd9Sstevel@tonic-gate * This routine tacitly assumes the result will be either zero 37*7c478bd9Sstevel@tonic-gate * or normal, so there is no need to raise any exceptions. 38*7c478bd9Sstevel@tonic-gate */ 39*7c478bd9Sstevel@tonic-gate void 40*7c478bd9Sstevel@tonic-gate _Q_scl(long double *x, int n) 41*7c478bd9Sstevel@tonic-gate { 42*7c478bd9Sstevel@tonic-gate union { 43*7c478bd9Sstevel@tonic-gate unsigned int i[4]; 44*7c478bd9Sstevel@tonic-gate long double q; 45*7c478bd9Sstevel@tonic-gate } xx; 46*7c478bd9Sstevel@tonic-gate int hx; 47*7c478bd9Sstevel@tonic-gate 48*7c478bd9Sstevel@tonic-gate xx.q = *x; 49*7c478bd9Sstevel@tonic-gate hx = xx.i[0] & ~0x80000000; 50*7c478bd9Sstevel@tonic-gate 51*7c478bd9Sstevel@tonic-gate if (hx < 0x10000) { /* x is zero or subnormal */ 52*7c478bd9Sstevel@tonic-gate if ((hx | xx.i[1] | xx.i[2] | xx.i[3]) == 0) 53*7c478bd9Sstevel@tonic-gate return; 54*7c478bd9Sstevel@tonic-gate 55*7c478bd9Sstevel@tonic-gate /* normalize x */ 56*7c478bd9Sstevel@tonic-gate while (hx == 0 && xx.i[1] < 0x10000) { 57*7c478bd9Sstevel@tonic-gate hx = xx.i[1]; 58*7c478bd9Sstevel@tonic-gate xx.i[1] = xx.i[2]; 59*7c478bd9Sstevel@tonic-gate xx.i[2] = xx.i[3]; 60*7c478bd9Sstevel@tonic-gate xx.i[3] = 0; 61*7c478bd9Sstevel@tonic-gate n -= 32; 62*7c478bd9Sstevel@tonic-gate } 63*7c478bd9Sstevel@tonic-gate while (hx < 0x10000) { 64*7c478bd9Sstevel@tonic-gate hx = (hx << 1) | (xx.i[1] >> 31); 65*7c478bd9Sstevel@tonic-gate xx.i[1] = (xx.i[1] << 1) | (xx.i[2] >> 31); 66*7c478bd9Sstevel@tonic-gate xx.i[2] = (xx.i[2] << 1) | (xx.i[3] >> 31); 67*7c478bd9Sstevel@tonic-gate xx.i[3] <<= 1; 68*7c478bd9Sstevel@tonic-gate n--; 69*7c478bd9Sstevel@tonic-gate } 70*7c478bd9Sstevel@tonic-gate xx.i[0] = hx | (xx.i[0] & 0x80000000); 71*7c478bd9Sstevel@tonic-gate } 72*7c478bd9Sstevel@tonic-gate 73*7c478bd9Sstevel@tonic-gate if ((hx >> 16) + n < 1) { 74*7c478bd9Sstevel@tonic-gate /* for subnormal result, just deliver zero */ 75*7c478bd9Sstevel@tonic-gate xx.i[0] = xx.i[0] & 0x80000000; 76*7c478bd9Sstevel@tonic-gate xx.i[1] = xx.i[2] = xx.i[3] = 0; 77*7c478bd9Sstevel@tonic-gate } else 78*7c478bd9Sstevel@tonic-gate xx.i[0] += (n << 16); 79*7c478bd9Sstevel@tonic-gate *x = xx.q; 80*7c478bd9Sstevel@tonic-gate } 81*7c478bd9Sstevel@tonic-gate 82*7c478bd9Sstevel@tonic-gate static const union { 83*7c478bd9Sstevel@tonic-gate int i[4]; 84*7c478bd9Sstevel@tonic-gate long double q; 85*7c478bd9Sstevel@tonic-gate } consts[2] = { 86*7c478bd9Sstevel@tonic-gate { 0x7ffe0000, 0, 0, 0 }, 87*7c478bd9Sstevel@tonic-gate { 0x00010000, 0, 0, 0 } 88*7c478bd9Sstevel@tonic-gate }; 89*7c478bd9Sstevel@tonic-gate 90*7c478bd9Sstevel@tonic-gate /* 91*7c478bd9Sstevel@tonic-gate * _Q_scle(x, n) sets *x = *x * 2^n, raising overflow or underflow 92*7c478bd9Sstevel@tonic-gate * as appropriate. 93*7c478bd9Sstevel@tonic-gate * 94*7c478bd9Sstevel@tonic-gate * This routine tacitly assumes the argument is either zero or normal. 95*7c478bd9Sstevel@tonic-gate */ 96*7c478bd9Sstevel@tonic-gate void 97*7c478bd9Sstevel@tonic-gate _Q_scle(long double *x, int n) 98*7c478bd9Sstevel@tonic-gate { 99*7c478bd9Sstevel@tonic-gate union { 100*7c478bd9Sstevel@tonic-gate unsigned int i[4]; 101*7c478bd9Sstevel@tonic-gate long double q; 102*7c478bd9Sstevel@tonic-gate } xx; 103*7c478bd9Sstevel@tonic-gate int hx; 104*7c478bd9Sstevel@tonic-gate 105*7c478bd9Sstevel@tonic-gate xx.q = *x; 106*7c478bd9Sstevel@tonic-gate hx = (xx.i[0] >> 16) & 0x7fff; 107*7c478bd9Sstevel@tonic-gate 108*7c478bd9Sstevel@tonic-gate if (hx == 0) /* x must be zero */ 109*7c478bd9Sstevel@tonic-gate return; 110*7c478bd9Sstevel@tonic-gate 111*7c478bd9Sstevel@tonic-gate hx += n; 112*7c478bd9Sstevel@tonic-gate if (hx >= 0x7fff) { /* overflow */ 113*7c478bd9Sstevel@tonic-gate xx.i[0] = 0x7ffe0000 | (xx.i[0] & 0x80000000); 114*7c478bd9Sstevel@tonic-gate xx.i[1] = xx.i[2] = xx.i[3] = 0; 115*7c478bd9Sstevel@tonic-gate xx.q *= consts[0].q; 116*7c478bd9Sstevel@tonic-gate } else if (hx < 1) { /* possible underflow */ 117*7c478bd9Sstevel@tonic-gate if (hx < -112) { 118*7c478bd9Sstevel@tonic-gate xx.i[0] = 0x00010000 | (xx.i[0] & 0x80000000); 119*7c478bd9Sstevel@tonic-gate xx.i[1] = xx.i[2] = xx.i[3] = 0; 120*7c478bd9Sstevel@tonic-gate } else { 121*7c478bd9Sstevel@tonic-gate xx.i[0] = (0x3ffe0000 + (hx << 16)) | 122*7c478bd9Sstevel@tonic-gate (xx.i[0] & 0x8000ffff); 123*7c478bd9Sstevel@tonic-gate } 124*7c478bd9Sstevel@tonic-gate xx.q *= consts[1].q; 125*7c478bd9Sstevel@tonic-gate } else 126*7c478bd9Sstevel@tonic-gate xx.i[0] += (n << 16); 127*7c478bd9Sstevel@tonic-gate 128*7c478bd9Sstevel@tonic-gate *x = xx.q; 129*7c478bd9Sstevel@tonic-gate } 130