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 //==============================================================
43 // 05/20/02 Cleaned up namespace and sf0 syntax
44 // 01/20/03 Improved performance and reduced code size
45 //==============================================================
48 //==============================================================
49 // float truncf(float x)
50 //==============================================================
52 // general input registers:
61 // floating-point registers:
67 // predicate registers used:
70 // Overview of operation
71 //==============================================================
72 // float truncf(float x)
73 // Return an integer value (represented as a float) less than or
74 // equal to x in magnitude.
75 // This is x rounded toward zero to an integral value.
76 //==============================================================
79 // if the exponent is > 1003e => 3F(true) = 63(decimal)
80 // we have a significand of 64 bits 1.63-bits.
81 // If we multiply by 2^63, we no longer have a fractional part
82 // So input is an integer value already.
85 // if the exponent is >= 10033 => 34(true) = 52(decimal)
87 // we have a significand of 53 bits 1.52-bits. (implicit 1)
88 // If we multiply by 2^52, we no longer have a fractional part
89 // So input is an integer value already.
92 // if the exponent is > 10016 => 17(true) = 23(decimal)
93 // we have a significand of 24 bits 1.23-bits. (implicit 1)
94 // If we multiply by 2^23, we no longer have a fractional part
95 // So input is an integer value already.
98 GLOBAL_LIBM_ENTRY(truncf)
101 getf.exp rSignexp = f8 // Get signexp, recompute if unorm
102 fcvt.fx.trunc.s1 fXtruncInt = f8 // Convert to int in significand
103 addl rBigexp = 0x10016, r0 // Set exponent at which is integer
106 mov rExpBias = 0x0FFFF // Form exponent bias
107 fnorm.s1 fNormX = f8 // Normalize input
108 mov rExpMask = 0x1FFFF // Form exponent mask
114 fclass.m p7,p0 = f8, 0x0b // Test x unorm
121 fclass.m p6,p0 = f8, 0x1e3 // Test x natval, nan, inf
122 (p7) br.cond.spnt TRUNC_UNORM // Branch if x unorm
127 // Return here from TRUNC_UNORM
129 and rExp = rSignexp, rExpMask // Get biased exponent
130 (p6) fma.s.s0 f8 = f8, f1, f0 // Result if x natval, nan, inf
131 (p6) br.ret.spnt b0 // Exit if x natval, nan, inf
136 cmp.lt p6,p0 = rExp, rExpBias // Is |x| < 1?
137 fcvt.xf f8 = fXtruncInt // Result, assume 1 <= |x| < 2^23
138 cmp.ge p7,p0 = rExp, rBigexp // Is |x| >= 2^23?
142 // We must correct result if |x| < 1, or |x| >= 2^23
143 .pred.rel "mutex",p6,p7
146 (p6) fmerge.s f8 = fNormX, f0 // If |x| < 1, result sgn(x)*0
151 (p7) fma.s.s0 f8 = fNormX, f1, f0 // If |x| >= 2^23, result x
152 br.ret.sptk b0 // Exit main path
160 getf.exp rSignexp = fNormX // Get signexp, recompute if unorm
161 fcmp.eq.s0 p7,p0 = f8, f0 // Dummy op to set denormal flag
162 br.cond.sptk TRUNC_COMMON // Return to main path
166 GLOBAL_LIBM_END(truncf)