3 // Copyright (C) 2000, 2001, Intel Corporation
4 // All rights reserved.
6 // Contributed 2/2/2000 by John Harrison, Ted Kubaska, Bob Norin, Shane Story,
7 // and Ping Tak Peter Tang of the Computational Software Lab, 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://developer.intel.com/opensource.
41 //==============================================================
42 // 2/02/00: Initial version
43 // 2/03/00: Modified to improve speed
44 // 5/31/00: Fixed bug when x a double-extended denormal
47 //==============================================================
48 // long double significandl(long double x)
50 // Overview of operation
51 //==============================================================
52 // If x = sig * 2**n with 1 <= sig < 2
53 // significandl returns sig
55 // predicate registers used:
58 // floating-point registers used:
61 #include "libm_support.h"
72 // qnan snan inf norm unorm 0 -+
75 // f10 gets f8(sign) with f1(exp,significand)
78 (p0) fmerge.s f10 = f8,f1
87 // Test for denormal input
90 (p0) fclass.m.unc p7,p0 = f8, 0x0b
94 // p6 = TRUE ==> x is not (nan,inf,0)
95 // return sign(f8) exp(f1) significand(f8)
96 // else x is (nan,inf,0)
97 // return sign(f8) exp(f8) significand(f8), normalized.
100 (p0) fclass.m.unc p0,p6 = f8, 0xe7
107 (p7) br.cond.spnt L(SIGNIFICAND_DENORM) ;; // Branch if x denormal
112 (p6) fmerge.se f8 = f10,f8
119 (p0) br.ret.sptk b0 ;;
122 L(SIGNIFICAND_DENORM):
126 (p0) fmerge.se f8 = f10,f9
130 // Check if fnorm(x) still denormal, means x double-extended denormal
133 (p0) fclass.m.unc p7,p0 = f9, 0x0b
137 // This will be the final result unless x double-extended denormal
144 // If x double-extended denorm, then significand ok, but must merge in
148 (p7) fmerge.se f8 = f10,f8
152 // Final normalization if x double-extended denorm
156 (p0) br.ret.sptk b0 ;;
160 ASM_SIZE_DIRECTIVE(significandl)