1*bb722a7dSDimitry Andric //===-- Nearest integer floating-point operations ---------------*- C++ -*-===//
2*bb722a7dSDimitry Andric //
3*bb722a7dSDimitry Andric // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4*bb722a7dSDimitry Andric // See https://llvm.org/LICENSE.txt for license information.
5*bb722a7dSDimitry Andric // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6*bb722a7dSDimitry Andric //
7*bb722a7dSDimitry Andric //===----------------------------------------------------------------------===//
8*bb722a7dSDimitry Andric
9*bb722a7dSDimitry Andric #ifndef LLVM_LIBC_SRC___SUPPORT_FPUTIL_NEARESTINTEGEROPERATIONS_H
10*bb722a7dSDimitry Andric #define LLVM_LIBC_SRC___SUPPORT_FPUTIL_NEARESTINTEGEROPERATIONS_H
11*bb722a7dSDimitry Andric
12*bb722a7dSDimitry Andric #include "FEnvImpl.h"
13*bb722a7dSDimitry Andric #include "FPBits.h"
14*bb722a7dSDimitry Andric #include "rounding_mode.h"
15*bb722a7dSDimitry Andric
16*bb722a7dSDimitry Andric #include "hdr/math_macros.h"
17*bb722a7dSDimitry Andric #include "src/__support/CPP/type_traits.h"
18*bb722a7dSDimitry Andric #include "src/__support/common.h"
19*bb722a7dSDimitry Andric #include "src/__support/macros/config.h"
20*bb722a7dSDimitry Andric
21*bb722a7dSDimitry Andric namespace LIBC_NAMESPACE_DECL {
22*bb722a7dSDimitry Andric namespace fputil {
23*bb722a7dSDimitry Andric
24*bb722a7dSDimitry Andric template <typename T, cpp::enable_if_t<cpp::is_floating_point_v<T>, int> = 0>
trunc(T x)25*bb722a7dSDimitry Andric LIBC_INLINE T trunc(T x) {
26*bb722a7dSDimitry Andric using StorageType = typename FPBits<T>::StorageType;
27*bb722a7dSDimitry Andric FPBits<T> bits(x);
28*bb722a7dSDimitry Andric
29*bb722a7dSDimitry Andric // If x is infinity or NaN, return it.
30*bb722a7dSDimitry Andric // If it is zero also we should return it as is, but the logic
31*bb722a7dSDimitry Andric // later in this function takes care of it. But not doing a zero
32*bb722a7dSDimitry Andric // check, we improve the run time of non-zero values.
33*bb722a7dSDimitry Andric if (bits.is_inf_or_nan())
34*bb722a7dSDimitry Andric return x;
35*bb722a7dSDimitry Andric
36*bb722a7dSDimitry Andric int exponent = bits.get_exponent();
37*bb722a7dSDimitry Andric
38*bb722a7dSDimitry Andric // If the exponent is greater than the most negative mantissa
39*bb722a7dSDimitry Andric // exponent, then x is already an integer.
40*bb722a7dSDimitry Andric if (exponent >= static_cast<int>(FPBits<T>::FRACTION_LEN))
41*bb722a7dSDimitry Andric return x;
42*bb722a7dSDimitry Andric
43*bb722a7dSDimitry Andric // If the exponent is such that abs(x) is less than 1, then return 0.
44*bb722a7dSDimitry Andric if (exponent <= -1)
45*bb722a7dSDimitry Andric return FPBits<T>::zero(bits.sign()).get_val();
46*bb722a7dSDimitry Andric
47*bb722a7dSDimitry Andric int trim_size = FPBits<T>::FRACTION_LEN - exponent;
48*bb722a7dSDimitry Andric StorageType trunc_mantissa =
49*bb722a7dSDimitry Andric static_cast<StorageType>((bits.get_mantissa() >> trim_size) << trim_size);
50*bb722a7dSDimitry Andric bits.set_mantissa(trunc_mantissa);
51*bb722a7dSDimitry Andric return bits.get_val();
52*bb722a7dSDimitry Andric }
53*bb722a7dSDimitry Andric
54*bb722a7dSDimitry Andric template <typename T, cpp::enable_if_t<cpp::is_floating_point_v<T>, int> = 0>
ceil(T x)55*bb722a7dSDimitry Andric LIBC_INLINE T ceil(T x) {
56*bb722a7dSDimitry Andric using StorageType = typename FPBits<T>::StorageType;
57*bb722a7dSDimitry Andric FPBits<T> bits(x);
58*bb722a7dSDimitry Andric
59*bb722a7dSDimitry Andric // If x is infinity NaN or zero, return it.
60*bb722a7dSDimitry Andric if (bits.is_inf_or_nan() || bits.is_zero())
61*bb722a7dSDimitry Andric return x;
62*bb722a7dSDimitry Andric
63*bb722a7dSDimitry Andric bool is_neg = bits.is_neg();
64*bb722a7dSDimitry Andric int exponent = bits.get_exponent();
65*bb722a7dSDimitry Andric
66*bb722a7dSDimitry Andric // If the exponent is greater than the most negative mantissa
67*bb722a7dSDimitry Andric // exponent, then x is already an integer.
68*bb722a7dSDimitry Andric if (exponent >= static_cast<int>(FPBits<T>::FRACTION_LEN))
69*bb722a7dSDimitry Andric return x;
70*bb722a7dSDimitry Andric
71*bb722a7dSDimitry Andric if (exponent <= -1) {
72*bb722a7dSDimitry Andric if (is_neg)
73*bb722a7dSDimitry Andric return T(-0.0);
74*bb722a7dSDimitry Andric else
75*bb722a7dSDimitry Andric return T(1.0);
76*bb722a7dSDimitry Andric }
77*bb722a7dSDimitry Andric
78*bb722a7dSDimitry Andric uint32_t trim_size = FPBits<T>::FRACTION_LEN - exponent;
79*bb722a7dSDimitry Andric StorageType x_u = bits.uintval();
80*bb722a7dSDimitry Andric StorageType trunc_u =
81*bb722a7dSDimitry Andric static_cast<StorageType>((x_u >> trim_size) << trim_size);
82*bb722a7dSDimitry Andric
83*bb722a7dSDimitry Andric // If x is already an integer, return it.
84*bb722a7dSDimitry Andric if (trunc_u == x_u)
85*bb722a7dSDimitry Andric return x;
86*bb722a7dSDimitry Andric
87*bb722a7dSDimitry Andric bits.set_uintval(trunc_u);
88*bb722a7dSDimitry Andric T trunc_value = bits.get_val();
89*bb722a7dSDimitry Andric
90*bb722a7dSDimitry Andric // If x is negative, the ceil operation is equivalent to the trunc operation.
91*bb722a7dSDimitry Andric if (is_neg)
92*bb722a7dSDimitry Andric return trunc_value;
93*bb722a7dSDimitry Andric
94*bb722a7dSDimitry Andric return trunc_value + T(1.0);
95*bb722a7dSDimitry Andric }
96*bb722a7dSDimitry Andric
97*bb722a7dSDimitry Andric template <typename T, cpp::enable_if_t<cpp::is_floating_point_v<T>, int> = 0>
floor(T x)98*bb722a7dSDimitry Andric LIBC_INLINE T floor(T x) {
99*bb722a7dSDimitry Andric FPBits<T> bits(x);
100*bb722a7dSDimitry Andric if (bits.is_neg()) {
101*bb722a7dSDimitry Andric return -ceil(-x);
102*bb722a7dSDimitry Andric } else {
103*bb722a7dSDimitry Andric return trunc(x);
104*bb722a7dSDimitry Andric }
105*bb722a7dSDimitry Andric }
106*bb722a7dSDimitry Andric
107*bb722a7dSDimitry Andric template <typename T, cpp::enable_if_t<cpp::is_floating_point_v<T>, int> = 0>
round(T x)108*bb722a7dSDimitry Andric LIBC_INLINE T round(T x) {
109*bb722a7dSDimitry Andric using StorageType = typename FPBits<T>::StorageType;
110*bb722a7dSDimitry Andric FPBits<T> bits(x);
111*bb722a7dSDimitry Andric
112*bb722a7dSDimitry Andric // If x is infinity NaN or zero, return it.
113*bb722a7dSDimitry Andric if (bits.is_inf_or_nan() || bits.is_zero())
114*bb722a7dSDimitry Andric return x;
115*bb722a7dSDimitry Andric
116*bb722a7dSDimitry Andric int exponent = bits.get_exponent();
117*bb722a7dSDimitry Andric
118*bb722a7dSDimitry Andric // If the exponent is greater than the most negative mantissa
119*bb722a7dSDimitry Andric // exponent, then x is already an integer.
120*bb722a7dSDimitry Andric if (exponent >= static_cast<int>(FPBits<T>::FRACTION_LEN))
121*bb722a7dSDimitry Andric return x;
122*bb722a7dSDimitry Andric
123*bb722a7dSDimitry Andric if (exponent == -1) {
124*bb722a7dSDimitry Andric // Absolute value of x is greater than equal to 0.5 but less than 1.
125*bb722a7dSDimitry Andric return FPBits<T>::one(bits.sign()).get_val();
126*bb722a7dSDimitry Andric }
127*bb722a7dSDimitry Andric
128*bb722a7dSDimitry Andric if (exponent <= -2) {
129*bb722a7dSDimitry Andric // Absolute value of x is less than 0.5.
130*bb722a7dSDimitry Andric return FPBits<T>::zero(bits.sign()).get_val();
131*bb722a7dSDimitry Andric }
132*bb722a7dSDimitry Andric
133*bb722a7dSDimitry Andric uint32_t trim_size = FPBits<T>::FRACTION_LEN - exponent;
134*bb722a7dSDimitry Andric bool half_bit_set =
135*bb722a7dSDimitry Andric bool(bits.get_mantissa() & (StorageType(1) << (trim_size - 1)));
136*bb722a7dSDimitry Andric StorageType x_u = bits.uintval();
137*bb722a7dSDimitry Andric StorageType trunc_u =
138*bb722a7dSDimitry Andric static_cast<StorageType>((x_u >> trim_size) << trim_size);
139*bb722a7dSDimitry Andric
140*bb722a7dSDimitry Andric // If x is already an integer, return it.
141*bb722a7dSDimitry Andric if (trunc_u == x_u)
142*bb722a7dSDimitry Andric return x;
143*bb722a7dSDimitry Andric
144*bb722a7dSDimitry Andric bits.set_uintval(trunc_u);
145*bb722a7dSDimitry Andric T trunc_value = bits.get_val();
146*bb722a7dSDimitry Andric
147*bb722a7dSDimitry Andric if (!half_bit_set) {
148*bb722a7dSDimitry Andric // Franctional part is less than 0.5 so round value is the
149*bb722a7dSDimitry Andric // same as the trunc value.
150*bb722a7dSDimitry Andric return trunc_value;
151*bb722a7dSDimitry Andric } else {
152*bb722a7dSDimitry Andric return bits.is_neg() ? trunc_value - T(1.0) : trunc_value + T(1.0);
153*bb722a7dSDimitry Andric }
154*bb722a7dSDimitry Andric }
155*bb722a7dSDimitry Andric
156*bb722a7dSDimitry Andric template <typename T>
157*bb722a7dSDimitry Andric LIBC_INLINE constexpr cpp::enable_if_t<cpp::is_floating_point_v<T>, T>
round_using_specific_rounding_mode(T x,int rnd)158*bb722a7dSDimitry Andric round_using_specific_rounding_mode(T x, int rnd) {
159*bb722a7dSDimitry Andric using StorageType = typename FPBits<T>::StorageType;
160*bb722a7dSDimitry Andric FPBits<T> bits(x);
161*bb722a7dSDimitry Andric
162*bb722a7dSDimitry Andric // If x is infinity NaN or zero, return it.
163*bb722a7dSDimitry Andric if (bits.is_inf_or_nan() || bits.is_zero())
164*bb722a7dSDimitry Andric return x;
165*bb722a7dSDimitry Andric
166*bb722a7dSDimitry Andric bool is_neg = bits.is_neg();
167*bb722a7dSDimitry Andric int exponent = bits.get_exponent();
168*bb722a7dSDimitry Andric
169*bb722a7dSDimitry Andric // If the exponent is greater than the most negative mantissa
170*bb722a7dSDimitry Andric // exponent, then x is already an integer.
171*bb722a7dSDimitry Andric if (exponent >= static_cast<int>(FPBits<T>::FRACTION_LEN))
172*bb722a7dSDimitry Andric return x;
173*bb722a7dSDimitry Andric
174*bb722a7dSDimitry Andric if (exponent <= -1) {
175*bb722a7dSDimitry Andric switch (rnd) {
176*bb722a7dSDimitry Andric case FP_INT_DOWNWARD:
177*bb722a7dSDimitry Andric return is_neg ? T(-1.0) : T(0.0);
178*bb722a7dSDimitry Andric case FP_INT_UPWARD:
179*bb722a7dSDimitry Andric return is_neg ? T(-0.0) : T(1.0);
180*bb722a7dSDimitry Andric case FP_INT_TOWARDZERO:
181*bb722a7dSDimitry Andric return is_neg ? T(-0.0) : T(0.0);
182*bb722a7dSDimitry Andric case FP_INT_TONEARESTFROMZERO:
183*bb722a7dSDimitry Andric if (exponent < -1)
184*bb722a7dSDimitry Andric return is_neg ? T(-0.0) : T(0.0); // abs(x) < 0.5
185*bb722a7dSDimitry Andric return is_neg ? T(-1.0) : T(1.0); // abs(x) >= 0.5
186*bb722a7dSDimitry Andric case FP_INT_TONEAREST:
187*bb722a7dSDimitry Andric default:
188*bb722a7dSDimitry Andric if (exponent <= -2 || bits.get_mantissa() == 0)
189*bb722a7dSDimitry Andric return is_neg ? T(-0.0) : T(0.0); // abs(x) <= 0.5
190*bb722a7dSDimitry Andric else
191*bb722a7dSDimitry Andric return is_neg ? T(-1.0) : T(1.0); // abs(x) > 0.5
192*bb722a7dSDimitry Andric }
193*bb722a7dSDimitry Andric }
194*bb722a7dSDimitry Andric
195*bb722a7dSDimitry Andric uint32_t trim_size = FPBits<T>::FRACTION_LEN - exponent;
196*bb722a7dSDimitry Andric StorageType x_u = bits.uintval();
197*bb722a7dSDimitry Andric StorageType trunc_u =
198*bb722a7dSDimitry Andric static_cast<StorageType>((x_u >> trim_size) << trim_size);
199*bb722a7dSDimitry Andric
200*bb722a7dSDimitry Andric // If x is already an integer, return it.
201*bb722a7dSDimitry Andric if (trunc_u == x_u)
202*bb722a7dSDimitry Andric return x;
203*bb722a7dSDimitry Andric
204*bb722a7dSDimitry Andric FPBits<T> new_bits(trunc_u);
205*bb722a7dSDimitry Andric T trunc_value = new_bits.get_val();
206*bb722a7dSDimitry Andric
207*bb722a7dSDimitry Andric StorageType trim_value =
208*bb722a7dSDimitry Andric bits.get_mantissa() &
209*bb722a7dSDimitry Andric static_cast<StorageType>(((StorageType(1) << trim_size) - 1));
210*bb722a7dSDimitry Andric StorageType half_value =
211*bb722a7dSDimitry Andric static_cast<StorageType>((StorageType(1) << (trim_size - 1)));
212*bb722a7dSDimitry Andric // If exponent is 0, trimSize will be equal to the mantissa width, and
213*bb722a7dSDimitry Andric // truncIsOdd` will not be correct. So, we handle it as a special case
214*bb722a7dSDimitry Andric // below.
215*bb722a7dSDimitry Andric StorageType trunc_is_odd =
216*bb722a7dSDimitry Andric new_bits.get_mantissa() & (StorageType(1) << trim_size);
217*bb722a7dSDimitry Andric
218*bb722a7dSDimitry Andric switch (rnd) {
219*bb722a7dSDimitry Andric case FP_INT_DOWNWARD:
220*bb722a7dSDimitry Andric return is_neg ? trunc_value - T(1.0) : trunc_value;
221*bb722a7dSDimitry Andric case FP_INT_UPWARD:
222*bb722a7dSDimitry Andric return is_neg ? trunc_value : trunc_value + T(1.0);
223*bb722a7dSDimitry Andric case FP_INT_TOWARDZERO:
224*bb722a7dSDimitry Andric return trunc_value;
225*bb722a7dSDimitry Andric case FP_INT_TONEARESTFROMZERO:
226*bb722a7dSDimitry Andric if (trim_value >= half_value)
227*bb722a7dSDimitry Andric return is_neg ? trunc_value - T(1.0) : trunc_value + T(1.0);
228*bb722a7dSDimitry Andric return trunc_value;
229*bb722a7dSDimitry Andric case FP_INT_TONEAREST:
230*bb722a7dSDimitry Andric default:
231*bb722a7dSDimitry Andric if (trim_value > half_value) {
232*bb722a7dSDimitry Andric return is_neg ? trunc_value - T(1.0) : trunc_value + T(1.0);
233*bb722a7dSDimitry Andric } else if (trim_value == half_value) {
234*bb722a7dSDimitry Andric if (exponent == 0)
235*bb722a7dSDimitry Andric return is_neg ? T(-2.0) : T(2.0);
236*bb722a7dSDimitry Andric if (trunc_is_odd)
237*bb722a7dSDimitry Andric return is_neg ? trunc_value - T(1.0) : trunc_value + T(1.0);
238*bb722a7dSDimitry Andric else
239*bb722a7dSDimitry Andric return trunc_value;
240*bb722a7dSDimitry Andric } else {
241*bb722a7dSDimitry Andric return trunc_value;
242*bb722a7dSDimitry Andric }
243*bb722a7dSDimitry Andric }
244*bb722a7dSDimitry Andric }
245*bb722a7dSDimitry Andric
246*bb722a7dSDimitry Andric template <typename T>
247*bb722a7dSDimitry Andric LIBC_INLINE cpp::enable_if_t<cpp::is_floating_point_v<T>, T>
round_using_current_rounding_mode(T x)248*bb722a7dSDimitry Andric round_using_current_rounding_mode(T x) {
249*bb722a7dSDimitry Andric int rounding_mode = quick_get_round();
250*bb722a7dSDimitry Andric
251*bb722a7dSDimitry Andric switch (rounding_mode) {
252*bb722a7dSDimitry Andric case FE_DOWNWARD:
253*bb722a7dSDimitry Andric return round_using_specific_rounding_mode(x, FP_INT_DOWNWARD);
254*bb722a7dSDimitry Andric case FE_UPWARD:
255*bb722a7dSDimitry Andric return round_using_specific_rounding_mode(x, FP_INT_UPWARD);
256*bb722a7dSDimitry Andric case FE_TOWARDZERO:
257*bb722a7dSDimitry Andric return round_using_specific_rounding_mode(x, FP_INT_TOWARDZERO);
258*bb722a7dSDimitry Andric case FE_TONEAREST:
259*bb722a7dSDimitry Andric return round_using_specific_rounding_mode(x, FP_INT_TONEAREST);
260*bb722a7dSDimitry Andric default:
261*bb722a7dSDimitry Andric __builtin_unreachable();
262*bb722a7dSDimitry Andric }
263*bb722a7dSDimitry Andric }
264*bb722a7dSDimitry Andric
265*bb722a7dSDimitry Andric template <bool IsSigned, typename T>
266*bb722a7dSDimitry Andric LIBC_INLINE constexpr cpp::enable_if_t<cpp::is_floating_point_v<T>, T>
fromfp(T x,int rnd,unsigned int width)267*bb722a7dSDimitry Andric fromfp(T x, int rnd, unsigned int width) {
268*bb722a7dSDimitry Andric using StorageType = typename FPBits<T>::StorageType;
269*bb722a7dSDimitry Andric
270*bb722a7dSDimitry Andric constexpr StorageType EXPLICIT_BIT =
271*bb722a7dSDimitry Andric FPBits<T>::SIG_MASK - FPBits<T>::FRACTION_MASK;
272*bb722a7dSDimitry Andric
273*bb722a7dSDimitry Andric if (width == 0U) {
274*bb722a7dSDimitry Andric raise_except_if_required(FE_INVALID);
275*bb722a7dSDimitry Andric return FPBits<T>::quiet_nan().get_val();
276*bb722a7dSDimitry Andric }
277*bb722a7dSDimitry Andric
278*bb722a7dSDimitry Andric FPBits<T> bits(x);
279*bb722a7dSDimitry Andric
280*bb722a7dSDimitry Andric if (bits.is_inf_or_nan()) {
281*bb722a7dSDimitry Andric raise_except_if_required(FE_INVALID);
282*bb722a7dSDimitry Andric return FPBits<T>::quiet_nan().get_val();
283*bb722a7dSDimitry Andric }
284*bb722a7dSDimitry Andric
285*bb722a7dSDimitry Andric T rounded_value = round_using_specific_rounding_mode(x, rnd);
286*bb722a7dSDimitry Andric
287*bb722a7dSDimitry Andric if constexpr (IsSigned) {
288*bb722a7dSDimitry Andric // T can't hold a finite number >= 2.0 * 2^EXP_BIAS.
289*bb722a7dSDimitry Andric if (width - 1 > FPBits<T>::EXP_BIAS)
290*bb722a7dSDimitry Andric return rounded_value;
291*bb722a7dSDimitry Andric
292*bb722a7dSDimitry Andric StorageType range_exp =
293*bb722a7dSDimitry Andric static_cast<StorageType>(width - 1 + FPBits<T>::EXP_BIAS);
294*bb722a7dSDimitry Andric // rounded_value < -2^(width - 1)
295*bb722a7dSDimitry Andric T range_min =
296*bb722a7dSDimitry Andric FPBits<T>::create_value(Sign::NEG, range_exp, EXPLICIT_BIT).get_val();
297*bb722a7dSDimitry Andric if (rounded_value < range_min) {
298*bb722a7dSDimitry Andric raise_except_if_required(FE_INVALID);
299*bb722a7dSDimitry Andric return FPBits<T>::quiet_nan().get_val();
300*bb722a7dSDimitry Andric }
301*bb722a7dSDimitry Andric // rounded_value > 2^(width - 1) - 1
302*bb722a7dSDimitry Andric T range_max =
303*bb722a7dSDimitry Andric FPBits<T>::create_value(Sign::POS, range_exp, EXPLICIT_BIT).get_val() -
304*bb722a7dSDimitry Andric T(1.0);
305*bb722a7dSDimitry Andric if (rounded_value > range_max) {
306*bb722a7dSDimitry Andric raise_except_if_required(FE_INVALID);
307*bb722a7dSDimitry Andric return FPBits<T>::quiet_nan().get_val();
308*bb722a7dSDimitry Andric }
309*bb722a7dSDimitry Andric
310*bb722a7dSDimitry Andric return rounded_value;
311*bb722a7dSDimitry Andric }
312*bb722a7dSDimitry Andric
313*bb722a7dSDimitry Andric if (rounded_value < T(0.0)) {
314*bb722a7dSDimitry Andric raise_except_if_required(FE_INVALID);
315*bb722a7dSDimitry Andric return FPBits<T>::quiet_nan().get_val();
316*bb722a7dSDimitry Andric }
317*bb722a7dSDimitry Andric
318*bb722a7dSDimitry Andric // T can't hold a finite number >= 2.0 * 2^EXP_BIAS.
319*bb722a7dSDimitry Andric if (width > FPBits<T>::EXP_BIAS)
320*bb722a7dSDimitry Andric return rounded_value;
321*bb722a7dSDimitry Andric
322*bb722a7dSDimitry Andric StorageType range_exp = static_cast<StorageType>(width + FPBits<T>::EXP_BIAS);
323*bb722a7dSDimitry Andric // rounded_value > 2^width - 1
324*bb722a7dSDimitry Andric T range_max =
325*bb722a7dSDimitry Andric FPBits<T>::create_value(Sign::POS, range_exp, EXPLICIT_BIT).get_val() -
326*bb722a7dSDimitry Andric T(1.0);
327*bb722a7dSDimitry Andric if (rounded_value > range_max) {
328*bb722a7dSDimitry Andric raise_except_if_required(FE_INVALID);
329*bb722a7dSDimitry Andric return FPBits<T>::quiet_nan().get_val();
330*bb722a7dSDimitry Andric }
331*bb722a7dSDimitry Andric
332*bb722a7dSDimitry Andric return rounded_value;
333*bb722a7dSDimitry Andric }
334*bb722a7dSDimitry Andric
335*bb722a7dSDimitry Andric template <bool IsSigned, typename T>
336*bb722a7dSDimitry Andric LIBC_INLINE constexpr cpp::enable_if_t<cpp::is_floating_point_v<T>, T>
fromfpx(T x,int rnd,unsigned int width)337*bb722a7dSDimitry Andric fromfpx(T x, int rnd, unsigned int width) {
338*bb722a7dSDimitry Andric T rounded_value = fromfp<IsSigned>(x, rnd, width);
339*bb722a7dSDimitry Andric FPBits<T> bits(rounded_value);
340*bb722a7dSDimitry Andric
341*bb722a7dSDimitry Andric if (!bits.is_nan() && rounded_value != x)
342*bb722a7dSDimitry Andric raise_except_if_required(FE_INEXACT);
343*bb722a7dSDimitry Andric
344*bb722a7dSDimitry Andric return rounded_value;
345*bb722a7dSDimitry Andric }
346*bb722a7dSDimitry Andric
347*bb722a7dSDimitry Andric namespace internal {
348*bb722a7dSDimitry Andric
349*bb722a7dSDimitry Andric template <typename FloatType, typename IntType,
350*bb722a7dSDimitry Andric cpp::enable_if_t<cpp::is_floating_point_v<FloatType> &&
351*bb722a7dSDimitry Andric cpp::is_integral_v<IntType>,
352*bb722a7dSDimitry Andric int> = 0>
rounded_float_to_signed_integer(FloatType x)353*bb722a7dSDimitry Andric LIBC_INLINE IntType rounded_float_to_signed_integer(FloatType x) {
354*bb722a7dSDimitry Andric constexpr IntType INTEGER_MIN = (IntType(1) << (sizeof(IntType) * 8 - 1));
355*bb722a7dSDimitry Andric constexpr IntType INTEGER_MAX = -(INTEGER_MIN + 1);
356*bb722a7dSDimitry Andric FPBits<FloatType> bits(x);
357*bb722a7dSDimitry Andric auto set_domain_error_and_raise_invalid = []() {
358*bb722a7dSDimitry Andric set_errno_if_required(EDOM);
359*bb722a7dSDimitry Andric raise_except_if_required(FE_INVALID);
360*bb722a7dSDimitry Andric };
361*bb722a7dSDimitry Andric
362*bb722a7dSDimitry Andric if (bits.is_inf_or_nan()) {
363*bb722a7dSDimitry Andric set_domain_error_and_raise_invalid();
364*bb722a7dSDimitry Andric return bits.is_neg() ? INTEGER_MIN : INTEGER_MAX;
365*bb722a7dSDimitry Andric }
366*bb722a7dSDimitry Andric
367*bb722a7dSDimitry Andric int exponent = bits.get_exponent();
368*bb722a7dSDimitry Andric constexpr int EXPONENT_LIMIT = sizeof(IntType) * 8 - 1;
369*bb722a7dSDimitry Andric if (exponent > EXPONENT_LIMIT) {
370*bb722a7dSDimitry Andric set_domain_error_and_raise_invalid();
371*bb722a7dSDimitry Andric return bits.is_neg() ? INTEGER_MIN : INTEGER_MAX;
372*bb722a7dSDimitry Andric } else if (exponent == EXPONENT_LIMIT) {
373*bb722a7dSDimitry Andric if (bits.is_pos() || bits.get_mantissa() != 0) {
374*bb722a7dSDimitry Andric set_domain_error_and_raise_invalid();
375*bb722a7dSDimitry Andric return bits.is_neg() ? INTEGER_MIN : INTEGER_MAX;
376*bb722a7dSDimitry Andric }
377*bb722a7dSDimitry Andric // If the control reaches here, then it means that the rounded
378*bb722a7dSDimitry Andric // value is the most negative number for the signed integer type IntType.
379*bb722a7dSDimitry Andric }
380*bb722a7dSDimitry Andric
381*bb722a7dSDimitry Andric // For all other cases, if `x` can fit in the integer type `IntType`,
382*bb722a7dSDimitry Andric // we just return `x`. static_cast will convert the floating
383*bb722a7dSDimitry Andric // point value to the exact integer value.
384*bb722a7dSDimitry Andric return static_cast<IntType>(x);
385*bb722a7dSDimitry Andric }
386*bb722a7dSDimitry Andric
387*bb722a7dSDimitry Andric } // namespace internal
388*bb722a7dSDimitry Andric
389*bb722a7dSDimitry Andric template <typename FloatType, typename IntType,
390*bb722a7dSDimitry Andric cpp::enable_if_t<cpp::is_floating_point_v<FloatType> &&
391*bb722a7dSDimitry Andric cpp::is_integral_v<IntType>,
392*bb722a7dSDimitry Andric int> = 0>
round_to_signed_integer(FloatType x)393*bb722a7dSDimitry Andric LIBC_INLINE IntType round_to_signed_integer(FloatType x) {
394*bb722a7dSDimitry Andric return internal::rounded_float_to_signed_integer<FloatType, IntType>(
395*bb722a7dSDimitry Andric round(x));
396*bb722a7dSDimitry Andric }
397*bb722a7dSDimitry Andric
398*bb722a7dSDimitry Andric template <typename FloatType, typename IntType,
399*bb722a7dSDimitry Andric cpp::enable_if_t<cpp::is_floating_point_v<FloatType> &&
400*bb722a7dSDimitry Andric cpp::is_integral_v<IntType>,
401*bb722a7dSDimitry Andric int> = 0>
402*bb722a7dSDimitry Andric LIBC_INLINE IntType
round_to_signed_integer_using_current_rounding_mode(FloatType x)403*bb722a7dSDimitry Andric round_to_signed_integer_using_current_rounding_mode(FloatType x) {
404*bb722a7dSDimitry Andric return internal::rounded_float_to_signed_integer<FloatType, IntType>(
405*bb722a7dSDimitry Andric round_using_current_rounding_mode(x));
406*bb722a7dSDimitry Andric }
407*bb722a7dSDimitry Andric
408*bb722a7dSDimitry Andric } // namespace fputil
409*bb722a7dSDimitry Andric } // namespace LIBC_NAMESPACE_DECL
410*bb722a7dSDimitry Andric
411*bb722a7dSDimitry Andric #endif // LLVM_LIBC_SRC___SUPPORT_FPUTIL_NEARESTINTEGEROPERATIONS_H
412