aboutsummaryrefslogtreecommitdiff
path: root/libgcc/config/libbid/bid128_rem.c
blob: e22043eeb0bf701858cc6a8e397106e9e40620e1 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
/* Copyright (C) 2007  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
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.  */

#define BID_128RES
#include "div_macros.h"


BID128_FUNCTION_ARG2(__bid128_rem, x, y)

  UINT256 P256;
  UINT128 CX, CY, CX2, CQ, CR, T, CXS, P128, res;
  UINT64 sign_x, sign_y;
  SINT64 D;
  int_float f64, fx;
  int exponent_x = 0, exponent_y, diff_expon, bin_expon_cx, scale, scale0;

  // unpack arguments, check for NaN or Infinity
  if (!unpack_BID128_value (&sign_x, &exponent_x, &CX, x)) {
#ifdef SET_STATUS_FLAGS
    if ((y.w[1] & SNAN_MASK64) == SNAN_MASK64) // y is sNaN
      __set_status_flags (pfpsf, INVALID_EXCEPTION);
#endif
    // test if x is NaN
    if ((x.w[1] & 0x7c00000000000000ull) == 0x7c00000000000000ull) {
#ifdef SET_STATUS_FLAGS
      if ((x.w[1] & SNAN_MASK64) == SNAN_MASK64) // y is sNaN
        __set_status_flags (pfpsf, INVALID_EXCEPTION);
#endif
      res.w[1] = x.w[1] & QUIET_MASK64;
      res.w[0] = x.w[0];
      BID_RETURN (res);
    }
    // x is Infinity?
    if ((x.w[1] & 0x7800000000000000ull) == 0x7800000000000000ull) {
      // check if y is Inf.
      if (((y.w[1] & 0x7c00000000000000ull) != 0x7c00000000000000ull))
        // return NaN 
      {
#ifdef SET_STATUS_FLAGS
        // set status flags
        __set_status_flags (pfpsf, INVALID_EXCEPTION);
#endif
        res.w[1] = 0x7c00000000000000ull;
        res.w[0] = 0;
        BID_RETURN (res);
      }

    }
    // x is 0
    if ((y.w[1] & INFINITY_MASK64) != INFINITY_MASK64) { // not Inf/NaN
      if ((!y.w[0]) && !(y.w[1] & 0x0001ffffffffffffull)) {
#ifdef SET_STATUS_FLAGS
        // set status flags
        __set_status_flags (pfpsf, INVALID_EXCEPTION);
#endif
        // x=y=0, return NaN
        res.w[1] = 0x7c00000000000000ull;
        res.w[0] = 0;
        BID_RETURN (res);
      }
      // return 0
      exponent_y = (y.w[1] >> 49) & 0x3fff;
      if (exponent_x > exponent_y)
        exponent_x = exponent_y;

      res.w[1] = sign_x | (((UINT64) exponent_x) << 49);
      res.w[0] = 0;
      BID_RETURN (res);
    }
  }
  if (!unpack_BID128_value (&sign_y, &exponent_y, &CY, y)) {
    // y is Inf. or NaN

    // test if y is NaN
    if ((y.w[1] & 0x7c00000000000000ull) == 0x7c00000000000000ull) {
#ifdef SET_STATUS_FLAGS
      if ((y.w[1] & SNAN_MASK64) == SNAN_MASK64) // y is sNaN
        __set_status_flags (pfpsf, INVALID_EXCEPTION);
#endif
      res.w[1] = y.w[1] & QUIET_MASK64;
      res.w[0] = y.w[0];
      BID_RETURN (res);
    }
    // y is Infinity?
    if ((y.w[1] & 0x7800000000000000ull) == 0x7800000000000000ull) {
      // return x
      res.w[1] = x.w[1];
      res.w[0] = x.w[0];
      BID_RETURN (res);
    }
    // y is 0
#ifdef SET_STATUS_FLAGS
    // set status flags
    __set_status_flags (pfpsf, INVALID_EXCEPTION);
#endif
    res.w[1] = 0x7c00000000000000ull;
    res.w[0] = 0;
    BID_RETURN (res);
  }

  diff_expon = exponent_x - exponent_y;

  if (diff_expon <= 0) {
    diff_expon = -diff_expon;

    if (diff_expon > 34) {
      // |x|<|y| in this case
      res = x;
      BID_RETURN (res);
    }
    // set exponent of y to exponent_x, scale coefficient_y
    T = __bid_power10_table_128[diff_expon];
    __mul_128x128_to_256 (P256, CY, T);

    if (P256.w[2] || P256.w[3]) {
      // |x|<|y| in this case
      res = x;
      BID_RETURN (res);
    }

    CX2.w[1] = (CX.w[1] << 1) | (CX.w[0] >> 63);
    CX2.w[0] = CX.w[0] << 1;
    if (__unsigned_compare_ge_128 (P256, CX2)) {
      // |x|<|y| in this case
      res = x;
      BID_RETURN (res);
    }

    P128.w[0] = P256.w[0];
    P128.w[1] = P256.w[1];
    __div_128_by_128 (&CQ, &CR, CX, P128);

    CX2.w[1] = (CR.w[1] << 1) | (CR.w[0] >> 63);
    CX2.w[0] = CR.w[0] << 1;
    if ((__unsigned_compare_gt_128 (CX2, P256))
        || (CX2.w[1] == P256.w[1] && CX2.w[0] == P256.w[0]
            && (CQ.w[0] & 1))) {
      __sub_128_128 (CR, P256, CR);
      sign_x ^= 0x8000000000000000ull;
    }

    get_BID128_very_fast (&res, sign_x, exponent_x, CR);
    BID_RETURN (res);
  }
  // 2^64
  f64.i = 0x5f800000;

  scale0 = 38;
  if (!CY.w[1])
    scale0 = 34;

  while (diff_expon > 0) {
    // get number of digits in CX and scale=38-digits
    // fx ~ CX
    fx.d = (float) CX.w[1] * f64.d + (float) CX.w[0];
    bin_expon_cx = ((fx.i >> 23) & 0xff) - 0x7f;
    scale = scale0 - __bid_estimate_decimal_digits[bin_expon_cx];
    // scale = 38-__bid_estimate_decimal_digits[bin_expon_cx];
    D = CX.w[1] - __bid_power10_index_binexp_128[bin_expon_cx].w[1];
    if (D > 0
        || (!D
            && CX.w[0] >= __bid_power10_index_binexp_128[bin_expon_cx].w[0]))
      scale--;

    if (diff_expon >= scale)
      diff_expon -= scale;
    else {
      scale = diff_expon;
      diff_expon = 0;
    }

    T = __bid_power10_table_128[scale];
    __mul_128x128_low (CXS, CX, T);

    __div_128_by_128 (&CQ, &CX, CXS, CY);

    // check for remainder == 0
    if (!CX.w[1] && !CX.w[0]) {
      get_BID128_very_fast (&res, sign_x, exponent_y, CX);
      BID_RETURN (res);
    }
  }

  CX2.w[1] = (CX.w[1] << 1) | (CX.w[0] >> 63);
  CX2.w[0] = CX.w[0] << 1;
  if ((__unsigned_compare_gt_128 (CX2, CY))
      || (CX2.w[1] == CY.w[1] && CX2.w[0] == CY.w[0] && (CQ.w[0] & 1))) {
    __sub_128_128 (CX, CY, CX);
    sign_x ^= 0x8000000000000000ull;
  }

  get_BID128_very_fast (&res, sign_x, exponent_y, CX);
  BID_RETURN (res);
}