-/* Copyright (C) 2007 Free Software Foundation, Inc.
+/* Copyright (C) 2007-2020 Free Software Foundation, Inc.
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
-Software Foundation; either version 2, or (at your option) any later
+Software Foundation; either version 3, or (at your option) any later
version.
-In addition to the permissions in the GNU General Public License, the
-Free Software Foundation gives you unlimited permission to link the
-compiled version of this file into combinations with other programs,
-and to distribute those combinations without any restriction coming
-from the use of this file. (The General Public License restrictions
-do apply in other respects; for example, they cover modification of
-the file, and distribution when not linked into a combine
-executable.)
-
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
-You should have received a copy of the GNU General Public License
-along with GCC; see the file COPYING. If not, write to the Free
-Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
-02110-1301, USA. */
+Under Section 7 of GPL version 3, you are granted additional
+permissions described in the GCC Runtime Library Exception, version
+3.1, as published by the Free Software Foundation.
+
+You should have received a copy of the GNU General Public License and
+a copy of the GCC Runtime Library Exception along with this program;
+see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
+<http://www.gnu.org/licenses/>. */
#include "bid_internal.h"
#if DECIMAL_CALL_BY_REFERENCE
void
-__bid64_quantize (UINT64 * pres, UINT64 * px,
+bid64_quantize (UINT64 * pres, UINT64 * px,
UINT64 *
py _RND_MODE_PARAM _EXC_FLAGS_PARAM _EXC_MASKS_PARAM
_EXC_INFO_PARAM) {
#else
UINT64
-__bid64_quantize (UINT64 x,
+bid64_quantize (UINT64 x,
UINT64 y _RND_MODE_PARAM _EXC_FLAGS_PARAM
_EXC_MASKS_PARAM _EXC_INFO_PARAM) {
#endif
UINT128 CT;
- UINT64 sign_x, sign_y, coefficient_x, coefficient_y, remainder_h, C64;
+ UINT64 sign_x, sign_y, coefficient_x, coefficient_y, remainder_h, C64,
+ valid_x;
UINT64 tmp, carry, res;
int_float tempx;
- int exponent_x, exponent_y = 0, digits_x, extra_digits, amount, amount2;
+ int exponent_x, exponent_y, digits_x, extra_digits, amount, amount2;
int expon_diff, total_digits, bin_expon_cx;
unsigned rmode, status;
y = *py;
#endif
+ valid_x = unpack_BID64 (&sign_x, &exponent_x, &coefficient_x, x);
// unpack arguments, check for NaN or Infinity
if (!unpack_BID64 (&sign_y, &exponent_y, &coefficient_y, y)) {
// Inf. or NaN or 0
#endif
// x=Inf, y=Inf?
- if (((x << 1) == 0xf000000000000000ull)
- && ((y << 1) == 0xf000000000000000ull)) {
- res = x;
+ if (((coefficient_x << 1) == 0xf000000000000000ull)
+ && ((coefficient_y << 1) == 0xf000000000000000ull)) {
+ res = coefficient_x;
BID_RETURN (res);
}
// Inf or NaN?
((x & 0x7c00000000000000ull) < 0x7800000000000000ull)))
__set_status_flags (pfpsf, INVALID_EXCEPTION);
#endif
- res = 0x7c00000000000000ull;
- BID_RETURN (res);
+ if ((y & NAN_MASK64) != NAN_MASK64)
+ coefficient_y = 0;
+ if ((x & NAN_MASK64) != NAN_MASK64) {
+ res = 0x7c00000000000000ull | (coefficient_y & QUIET_MASK64);
+ if (((y & NAN_MASK64) != NAN_MASK64) && ((x & NAN_MASK64) == 0x7800000000000000ull))
+ res = x;
+ BID_RETURN (res);
+ }
}
}
// unpack arguments, check for NaN or Infinity
- if (!unpack_BID64 (&sign_x, &exponent_x, &coefficient_x, x)) {
+ if (!valid_x) {
// x is Inf. or NaN or 0
// Inf or NaN?
|| ((x & 0x7c00000000000000ull) == 0x7800000000000000ull)) //Inf
__set_status_flags (pfpsf, INVALID_EXCEPTION);
#endif
- res = 0x7c00000000000000ull;
+ if ((x & NAN_MASK64) != NAN_MASK64)
+ coefficient_x = 0;
+ res = 0x7c00000000000000ull | (coefficient_x & QUIET_MASK64);
BID_RETURN (res);
}
// get number of decimal digits in coefficient_x
tempx.d = (float) coefficient_x;
bin_expon_cx = ((tempx.i >> 23) & 0xff) - 0x7f;
- digits_x = __bid_estimate_decimal_digits[bin_expon_cx];
- if (coefficient_x >= __bid_power10_table_128[digits_x].w[0])
+ digits_x = estimate_decimal_digits[bin_expon_cx];
+ if (coefficient_x >= power10_table_128[digits_x].w[0])
digits_x++;
expon_diff = exponent_x - exponent_y;
// check range of scaled coefficient
if ((UINT32) (total_digits + 1) <= 17) {
if (expon_diff >= 0) {
- coefficient_x *= __bid_power10_table_128[expon_diff].w[0];
+ coefficient_x *= power10_table_128[expon_diff].w[0];
res = very_fast_get_BID64 (sign_x, exponent_y, coefficient_x);
BID_RETURN (res);
}
#else
rmode = 0;
#endif
- coefficient_x += __bid_round_const_table[rmode][extra_digits];
+ coefficient_x += round_const_table[rmode][extra_digits];
// get P*(2^M[extra_digits])/10^extra_digits
__mul_64x64_to_128 (CT, coefficient_x,
- __bid_reciprocals10_64[extra_digits]);
+ reciprocals10_64[extra_digits]);
// now get P/10^extra_digits: shift C64 right by M[extra_digits]-128
- amount = __bid_short_recip_scale[extra_digits];
+ amount = short_recip_scale[extra_digits];
C64 = CT.w[1] >> amount;
#ifndef IEEE_ROUND_NEAREST_TIES_AWAY
#ifndef IEEE_ROUND_NEAREST
#endif
if (C64 & 1) {
// check whether fractional part of initial_P/10^extra_digits
- // is exactly .5
+ // is exactly .5
// this is the same as fractional part of
// (initial_P + 0.5*10^extra_digits)/10^extra_digits is exactly zero
remainder_h = remainder_h & CT.w[1];
// test whether fractional part is 0
- if (!remainder_h && (CT.w[0] < __bid_reciprocals10_64[extra_digits])) {
+ if (!remainder_h && (CT.w[0] < reciprocals10_64[extra_digits])) {
C64--;
}
}
case ROUNDING_TIES_AWAY:
// test whether fractional part is 0
if ((remainder_h == 0x8000000000000000ull)
- && (CT.w[0] < __bid_reciprocals10_64[extra_digits]))
+ && (CT.w[0] < reciprocals10_64[extra_digits]))
status = EXACT_STATUS;
break;
case ROUNDING_DOWN:
case ROUNDING_TO_ZERO:
- if (!remainder_h && (CT.w[0] < __bid_reciprocals10_64[extra_digits]))
+ if (!remainder_h && (CT.w[0] < reciprocals10_64[extra_digits]))
status = EXACT_STATUS;
//if(!C64 && rmode==ROUNDING_DOWN) sign_s=sign_y;
break;
default:
// round up
__add_carry_out (tmp, carry, CT.w[0],
- __bid_reciprocals10_64[extra_digits]);
+ reciprocals10_64[extra_digits]);
if ((remainder_h >> (64 - amount)) + carry >=
(((UINT64) 1) << amount))
status = EXACT_STATUS;