4 // Copyright (c) 2000 - 2003 Intel Corporation
5 // All rights reserved.
7 // Contributed 2000 by the Intel Numerics Group, Intel Corporation
9 // Redistribution and use in source and binary forms, with or without
10 // modification, are permitted provided that the following conditions are
13 // * Redistributions of source code must retain the above copyright
14 // notice, this list of conditions and the following disclaimer.
16 // * Redistributions in binary form must reproduce the above copyright
17 // notice, this list of conditions and the following disclaimer in the
18 // documentation and/or other materials provided with the distribution.
20 // * The name of Intel Corporation may not be used to endorse or promote
21 // products derived from this software without specific prior written
24 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
25 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
26 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
27 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL INTEL OR ITS
28 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
29 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
30 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
31 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
32 // OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY OR TORT (INCLUDING
33 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
34 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 // Intel Corporation is the author of this code, and requests that all
37 // problem reports or change requests be submitted to it directly at
38 // http://www.intel.com/software/products/opensource/libraries/num.htm.
41 //==============================================================
42 // 02/02/00 Initial version
43 // 08/17/00 New and much faster algorithm.
44 // 08/31/00 Avoided bank conflicts on loads, shortened |x|=1 path,
45 // fixed mfb split issue stalls.
46 // 12/19/00 Fixed small arg cases to force inexact, or inexact and underflow.
47 // 08/02/02 New and much faster algorithm II
48 // 02/06/03 Reordered header: .section, .global, .proc, .align
51 //=========================================
52 // The asin function computes the principal value of the arc sine of x.
53 // asin(0) returns 0, asin(1) returns pi/2, asin(-1) returns -pi/2.
54 // A doman error occurs for arguments not in the range [-1,+1].
56 // The asin function returns the arc sine in the range [-pi/2, +pi/2] radians.
60 // Return asin(x) = +/-0.0
62 // 2. 0.0 < |x| < 0.625
63 // Return asin(x) = x + x^3 *PolA(x^2)
64 // where PolA(x^2) = A3 + A5*x^2 + A7*x^4 +...+ A35*x^32
66 // 3. 0.625 <=|x| < 1.0
67 // Return asin(x) = sign(x) * ( Pi/2 - sqrt(R) * PolB(R))
69 // PolB(R) = B0 + B1*R + B2*R^2 +...+B12*R^12
71 // sqrt(R) is approximated using the following sequence:
72 // y0 = (1 + eps)/sqrt(R) - initial approximation by frsqrta,
74 // Then 3 iterations are used to refine the result:
89 // S3 approximates sqrt(R) with enough accuracy for this algorithm
91 // So, the result should be reconstracted as follows:
92 // asin(x) = sign(x) * (Pi/2 - S3*PolB(R))
94 // But for optimization perposes the reconstruction step is slightly
96 // asin(x) = sign(x)*(Pi/2 - PolB(R)*S2) + sign(x)*d2*S2*PolB(R)
99 // Return asin(x) = sign(x)*Pi/2
101 // 5. 1.0 < |x| <= +INF
102 // A doman error occurs for arguments not in the range [-1,+1]
105 // Return asin(x) = QNaN
108 // Return asin(x) = x + x^3,
111 // Normalize input in f8 and return to the very beginning of the function
114 //==============================================================
115 // Floating Point registers used:
117 // f6, f7, f9 -> f15, f32 -> f63
119 // General registers used:
120 // r3, r21 -> r31, r32 -> r38
122 // Predicate registers used:
127 //=========================================
128 // integer registers used
150 GR_Parameter_RESULT = r37
151 GR_Parameter_TAG = r38
153 // floating point registers used
216 //==============================================================
219 LOCAL_OBJECT_START(asin_base_range_table)
220 // Ai: Polynomial coefficients for the asin(x), |x| < .625000
221 // Bi: Polynomial coefficients for the asin(x), |x| > .625000
222 data8 0xBFDAAB56C01AE468 //A29
223 data8 0x3FE1C470B76A5B2B //A31
224 data8 0xBFDC5FF82A0C4205 //A33
225 data8 0x3FC71FD88BFE93F0 //A35
226 data8 0xB504F333F9DE6487, 0x00003FFF //B0
227 data8 0xAAAAAAAAAAAAFC18, 0x00003FFC //A3
228 data8 0x3F9F1C71BC4A7823 //A9
229 data8 0x3F96E8BBAAB216B2 //A11
230 data8 0x3F91C4CA1F9F8A98 //A13
231 data8 0x3F8C9DDCEDEBE7A6 //A15
232 data8 0x3F877784442B1516 //A17
233 data8 0x3F859C0491802BA2 //A19
234 data8 0x9999999998C88B8F, 0x00003FFB //A5
235 data8 0x3F6BD7A9A660BF5E //A21
236 data8 0x3F9FC1659340419D //A23
237 data8 0xB6DB6DB798149BDF, 0x00003FFA //A7
238 data8 0xBFB3EF18964D3ED3 //A25
239 data8 0x3FCD285315542CF2 //A27
240 data8 0xF15BEEEFF7D2966A, 0x00003FFB //B1
241 data8 0x3EF0DDA376D10FB3 //B10
242 data8 0xBEB83CAFE05EBAC9 //B11
243 data8 0x3F65FFB67B513644 //B4
244 data8 0x3F5032FBB86A4501 //B5
245 data8 0x3F392162276C7CBA //B6
246 data8 0x3F2435949FD98BDF //B7
247 data8 0xD93923D7FA08341C, 0x00003FF9 //B2
248 data8 0x3F802995B6D90BDB //B3
249 data8 0x3F10DF86B341A63F //B8
250 data8 0xC90FDAA22168C235, 0x00003FFF // Pi/2
251 data8 0x3EFA3EBD6B0ECB9D //B9
252 data8 0x3EDE18BA080E9098 //B12
253 LOCAL_OBJECT_END(asin_base_range_table)
257 GLOBAL_LIBM_ENTRY(asin)
260 getf.d rXBits = f8 // grab bits of input value
261 // set p12 = 1 if x is a NaN, denormal, or zero
262 fclass.m p12, p0 = f8, 0xcf
266 addl rTblAddr = @ltoff(asin_base_range_table),gp
267 // 1 - x = 1 - |x| for positive x
268 fms.s1 f1mX = f1, f1, f8
269 addl rHalf = 0xFFFE, r0 // exponent of 1/2
273 addl r0625 = 0x3FE4, r0 // high 16 bits of 0.625
274 // set p8 = 1 if x < 0
275 fcmp.lt.s1 p8, p9 = f8, f0
276 shl rSign = rSign, 63 // sign bit
279 // point to the beginning of the table
280 ld8 rTblAddr = [rTblAddr]
281 // 1 + x = 1 - |x| for negative x
282 fma.s1 f1pX = f1, f1, f8
283 adds rOne = 0x3FF, r0
287 andcm rAbsXBits = rXBits, rSign // bits of |x|
288 fmerge.s fSignX = f8, f1 // signum(x)
289 shl r0625 = r0625, 48 // bits of DP representation of 0.625
292 setf.exp fHalf = rHalf // load A2 to FP reg
293 fma.s1 fXSqr = f8, f8, f0 // x^2
294 // branch on special path if x is a NaN, denormal, or zero
295 (p12) br.cond.spnt asin_special
299 adds rPiBy2Ptr = 272, rTblAddr
301 shl rOne = rOne, 52 // bits of 1.0
304 adds rTmpPtr1 = 16, rTblAddr
306 // set p6 = 1 if |x| < 0.625
307 cmp.lt p6, p7 = rAbsXBits, r0625
311 ldfpd fA29, fA31 = [rTblAddr] // A29, fA31
312 // 1 - x = 1 - |x| for positive x
313 (p9) fms.s1 fR = f1, f1, f8
314 // point to coefficient of "near 1" polynomial
315 (p7) adds rTmpPtr2 = 176, rTblAddr
318 ldfpd fA33, fA35 = [rTmpPtr1], 16 // A33, fA35
319 // 1 + x = 1 - |x| for negative x
320 (p8) fma.s1 fR = f1, f1, f8
321 (p6) adds rTmpPtr2 = 48, rTblAddr
325 ldfe fB0 = [rTmpPtr1], 16 // B0
330 adds rTmpPtr3 = 16, rTmpPtr2
331 // set p10 = 1 if |x| = 1.0
332 cmp.eq p10, p0 = rAbsXBits, rOne
333 // branch on special path for |x| = 1.0
334 (p10) br.cond.spnt asin_abs_1
338 ldfe fA3 = [rTmpPtr2], 48 // A3 or B1
340 adds rTmpPtr1 = 64, rTmpPtr3
343 ldfpd fA9, fA11 = [rTmpPtr3], 16 // A9, A11 or B10, B11
344 // set p11 = 1 if |x| > 1.0
345 cmp.gt p11, p0 = rAbsXBits, rOne
346 // branch on special path for |x| > 1.0
347 (p11) br.cond.spnt asin_abs_gt_1
351 ldfpd fA17, fA19 = [rTmpPtr2], 16 // A17, A19 or B6, B7
352 // initial approximation of 1 / sqrt(1 - x)
353 frsqrta.s1 f1mXRcp, p0 = f1mX
357 ldfpd fA13, fA15 = [rTmpPtr3] // A13, A15 or B4, B5
358 fma.s1 fXCube = fXSqr, f8, f0 // x^3
363 ldfe fA5 = [rTmpPtr2], 48 // A5 or B2
364 // initial approximation of 1 / sqrt(1 + x)
365 frsqrta.s1 f1pXRcp, p0 = f1pX
369 ldfpd fA21, fA23 = [rTmpPtr1], 16 // A21, A23 or B3, B8
370 fma.s1 fXQuadr = fXSqr, fXSqr, f0 // x^4
375 ldfe fA7 = [rTmpPtr1] // A7 or Pi/2
376 fma.s1 fRSqr = fR, fR, f0 // R^2
380 ldfpd fA25, fA27 = [rTmpPtr2] // A25, A27 or B9, B12
382 (p6) br.cond.spnt asin_base_range;
388 (p9) fma.s1 fH = fHalf, f1mXRcp, f0 // H0 for x > 0
393 (p9) fma.s1 fS = f1mX, f1mXRcp, f0 // S0 for x > 0
399 (p8) fma.s1 fH = fHalf, f1pXRcp, f0 // H0 for x < 0
404 (p8) fma.s1 fS = f1pX, f1pXRcp, f0 // S0 for x > 0
410 fma.s1 fRQuadr = fRSqr, fRSqr, f0 // R^4
416 fma.s1 fB11 = fB11, fR, fB10
421 fma.s1 fB1 = fB1, fR, fB0
427 fma.s1 fB5 = fB5, fR, fB4
432 fma.s1 fB7 = fB7, fR, fB6
438 fma.s1 fB3 = fB3, fR, fB2
444 fnma.s1 fD = fH, fS, fHalf // d0 = 1/2 - H0*S0
450 fma.s1 fR8 = fRQuadr, fRQuadr, f0 // R^4
455 fma.s1 fB9 = fB9, fR, fB8
461 fma.s1 fB12 = fB12, fRSqr, fB11
466 fma.s1 fB7 = fB7, fRSqr, fB5
472 fma.s1 fB3 = fB3, fRSqr, fB1
478 fma.s1 fH = fH, fD, fH // H1 = H0 + H0*d0
483 fma.s1 fS = fS, fD, fS // S1 = S0 + S0*d0
489 fma.s1 fPiBy2 = fPiBy2, fSignX, f0 // signum(x)*Pi/2
495 fma.s1 fB12 = fB12, fRSqr, fB9
500 fma.s1 fB7 = fB7, fRQuadr, fB3
506 fnma.s1 fD = fH, fS, fHalf // d1 = 1/2 - H1*S1
511 fnma.s1 fSignedS = fSignX, fS, f0 // -signum(x)*S1
517 fma.s1 fCloseTo1Pol = fB12, fR8, fB7
523 fma.s1 fH = fH, fD, fH // H2 = H1 + H1*d1
528 fma.s1 fS = fS, fD, fS // S2 = S1 + S1*d1
534 // -signum(x)* S2 = -signum(x)*(S1 + S1*d1)
535 fma.s1 fSignedS = fSignedS, fD, fSignedS
541 fnma.s1 fD = fH, fS, fHalf // d2 = 1/2 - H2*S2
547 // signum(x)*(Pi/2 - PolB*S2)
548 fma.s1 fPiBy2 = fSignedS, fCloseTo1Pol, fPiBy2
553 // -signum(x)*PolB * S2
554 fma.s1 fCloseTo1Pol = fSignedS, fCloseTo1Pol, f0
560 // final result for 0.625 <= |x| < 1
561 fma.d.s0 f8 = fCloseTo1Pol, fD, fPiBy2
562 // exit here for 0.625 <= |x| < 1
568 // here if |x| < 0.625
573 fma.s1 fA33 = fA33, fXSqr, fA31
578 fma.s1 fA15 = fA15, fXSqr, fA13
584 fma.s1 fA29 = fA29, fXSqr, fA27
589 fma.s1 fA25 = fA25, fXSqr, fA23
595 fma.s1 fA21 = fA21, fXSqr, fA19
600 fma.s1 fA9 = fA9, fXSqr, fA7
606 fma.s1 fA5 = fA5, fXSqr, fA3
612 fma.s1 fA35 = fA35, fXQuadr, fA33
617 fma.s1 fA17 = fA17, fXQuadr, fA15
623 fma.s1 fX8 = fXQuadr, fXQuadr, f0 // x^8
628 fma.s1 fA25 = fA25, fXQuadr, fA21
634 fma.s1 fA9 = fA9, fXQuadr, fA5
640 fma.s1 fA35 = fA35, fXQuadr, fA29
645 fma.s1 fA17 = fA17, fXSqr, fA11
651 fma.s1 fX16 = fX8, fX8, f0 // x^16
657 fma.s1 fA35 = fA35, fX8, fA25
662 fma.s1 fA17 = fA17, fX8, fA9
668 fma.s1 fBaseP = fA35, fX16, fA17
674 // final result for |x| < 0.625
675 fma.d.s0 f8 = fBaseP, fXCube, f8
676 // exit here for |x| < 0.625 path
682 // asin(x) = sign(x) * Pi/2
686 ldfe fPiBy2 = [rPiBy2Ptr] // Pi/2
693 // result for |x| = 1.0
694 fma.d.s0 f8 = fPiBy2, fSignX, f0
695 // exit here for |x| = 1.0
700 // here if x is a NaN, denormal, or zero
705 // set p12 = 1 if x is a NaN
706 fclass.m p12, p0 = f8, 0xc3
711 // smallest positive DP normalized number
712 movl rDenoBound = 0x0010000000000000
717 // set p13 = 1 if x = 0.0
718 fclass.m p13, p0 = f8, 0x07
728 // load smallest normal to FP reg
729 setf.d fDenoBound = rDenoBound
730 // answer if x is a NaN
731 (p12) fma.d.s0 f8 = f8,f1,f0
732 // exit here if x is a NaN
739 // exit here if x = 0.0
743 // if we still here then x is denormal or unnormal
746 // absolute value of normalized x
747 fmerge.s fNormX = f1, fNormX
753 // set p14 = 1 if normalized x is greater than or
754 // equal to the smallest denormalized value
755 // So, if p14 is set to 1 it means that we deal with
756 // unnormal rather than with "true" denormal
757 fcmp.ge.s1 p14, p0 = fNormX, fDenoBound
763 (p14) fcmp.eq.s0 p6, p0 = f8, f0 // Set D flag if x unnormal
768 // normalize unnormal input
769 (p14) fnorm.s1 f8 = f8
770 // return to the main path
771 (p14) br.cond.sptk asin_unnormal_back
774 // if we still here it means that input is "true" denormal
777 // final result if x is denormal
778 fma.d.s0 f8 = f8, fXSqr, f8
779 // exit here if x is denormal
785 // error handler should be called
789 alloc r32 = ar.pfs, 0, 3, 4, 0 // get some registers
790 fmerge.s FR_X = f8,f8
794 mov GR_Parameter_TAG = 61 // error code
795 frcpa.s0 FR_RESULT, p0 = f0,f0
796 // call error handler routine
797 br.cond.sptk __libm_error_region
800 GLOBAL_LIBM_END(asin)
804 LOCAL_LIBM_ENTRY(__libm_error_region)
807 add GR_Parameter_Y=-32,sp // Parameter 2 value
809 .save ar.pfs,GR_SAVE_PFS
810 mov GR_SAVE_PFS=ar.pfs // Save ar.pfs
814 add sp=-64,sp // Create new stack
816 mov GR_SAVE_GP=gp // Save gp
819 stfd [GR_Parameter_Y] = FR_Y,16 // STORE Parameter 2 on stack
820 add GR_Parameter_X = 16,sp // Parameter 1 address
822 mov GR_SAVE_B0=b0 // Save b0
826 stfd [GR_Parameter_X] = FR_X // STORE Parameter 1 on stack
827 add GR_Parameter_RESULT = 0,GR_Parameter_Y // Parameter 3 address
831 stfd [GR_Parameter_Y] = FR_RESULT // STORE Parameter 3 on stack
832 add GR_Parameter_Y = -16,GR_Parameter_Y
833 br.call.sptk b0=__libm_error_support# // Call error handling function
836 add GR_Parameter_RESULT = 48,sp
841 ldfd f8 = [GR_Parameter_RESULT] // Get return result off stack
843 add sp = 64,sp // Restore stack pointer
844 mov b0 = GR_SAVE_B0 // Restore return address
847 mov gp = GR_SAVE_GP // Restore gp
848 mov ar.pfs = GR_SAVE_PFS // Restore ar.pfs
849 br.ret.sptk b0 // Return
852 LOCAL_LIBM_END(__libm_error_region)
853 .type __libm_error_support#,@function
854 .global __libm_error_support#