1 /* Copyright (C) 2007 Free Software Foundation, Inc.
3 This file is part of GCC.
5 GCC is free software; you can redistribute it and/or modify it under
6 the terms of the GNU General Public License as published by the Free
7 Software Foundation; either version 2, or (at your option) any later
10 In addition to the permissions in the GNU General Public License, the
11 Free Software Foundation gives you unlimited permission to link the
12 compiled version of this file into combinations with other programs,
13 and to distribute those combinations without any restriction coming
14 from the use of this file. (The General Public License restrictions
15 do apply in other respects; for example, they cover modification of
16 the file, and distribution when not linked into a combine
19 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
20 WARRANTY; without even the implied warranty of MERCHANTABILITY or
21 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
24 You should have received a copy of the GNU General Public License
25 along with GCC; see the file COPYING. If not, write to the Free
26 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
29 #include "bid_internal.h"
31 #define MAX_FORMAT_DIGITS 16
32 #define DECIMAL_EXPONENT_BIAS 398
33 #define MAX_DECIMAL_EXPONENT 767
35 #if DECIMAL_CALL_BY_REFERENCE
38 bid64_scalb (UINT64
* pres
, UINT64
* px
,
39 int *pn _RND_MODE_PARAM _EXC_FLAGS_PARAM _EXC_MASKS_PARAM
46 bid64_scalb (UINT64 x
,
47 int n _RND_MODE_PARAM _EXC_FLAGS_PARAM _EXC_MASKS_PARAM
50 UINT64 sign_x
, coefficient_x
, res
;
52 int exponent_x
, rmode
;
54 #if DECIMAL_CALL_BY_REFERENCE
55 #if !DECIMAL_GLOBAL_ROUNDING
56 _IDEC_round rnd_mode
= *prnd_mode
;
62 // unpack arguments, check for NaN or Infinity
63 if (!unpack_BID64 (&sign_x
, &exponent_x
, &coefficient_x
, x
)) {
64 // x is Inf. or NaN or 0
65 #ifdef SET_STATUS_FLAGS
66 if ((x
& SNAN_MASK64
) == SNAN_MASK64
) // y is sNaN
67 __set_status_flags (pfpsf
, INVALID_EXCEPTION
);
70 res
= coefficient_x
& QUIET_MASK64
;
72 exp64
= (SINT64
) exponent_x
+ (SINT64
) n
;
74 if(exp64
>MAX_DECIMAL_EXPONENT
) exp64
=MAX_DECIMAL_EXPONENT
;
76 res
= very_fast_get_BID64 (sign_x
, exponent_x
, coefficient_x
); // 0
81 exp64
= (SINT64
) exponent_x
+ (SINT64
) n
;
84 if ((UINT32
) exponent_x
<= MAX_DECIMAL_EXPONENT
) {
85 res
= very_fast_get_BID64 (sign_x
, exponent_x
, coefficient_x
);
89 if (exp64
> MAX_DECIMAL_EXPONENT
) {
90 // try to normalize coefficient
91 while ((coefficient_x
< 1000000000000000ull)
92 && (exp64
> MAX_DECIMAL_EXPONENT
)) {
93 // coefficient_x < 10^15, scale by 10
94 coefficient_x
= (coefficient_x
<< 1) + (coefficient_x
<< 3);
98 if (exp64
<= MAX_DECIMAL_EXPONENT
) {
99 res
= very_fast_get_BID64 (sign_x
, exponent_x
, coefficient_x
);
102 exponent_x
= 0x7fffffff; // overflow
105 // the BID pack routine will round the coefficient
107 res
= get_BID64 (sign_x
, exponent_x
, coefficient_x
, rmode
, pfpsf
);