[12c6f2d] | 1 | /*
|
---|
[df4ed85] | 2 | * Copyright (c) 2005 Josef Cejka
|
---|
[c67aff2] | 3 | * Copyright (c) 2011 Petr Koupy
|
---|
[12c6f2d] | 4 | * All rights reserved.
|
---|
| 5 | *
|
---|
| 6 | * Redistribution and use in source and binary forms, with or without
|
---|
| 7 | * modification, are permitted provided that the following conditions
|
---|
| 8 | * are met:
|
---|
| 9 | *
|
---|
| 10 | * - Redistributions of source code must retain the above copyright
|
---|
| 11 | * notice, this list of conditions and the following disclaimer.
|
---|
| 12 | * - Redistributions in binary form must reproduce the above copyright
|
---|
| 13 | * notice, this list of conditions and the following disclaimer in the
|
---|
| 14 | * documentation and/or other materials provided with the distribution.
|
---|
| 15 | * - The name of the author may not be used to endorse or promote products
|
---|
| 16 | * derived from this software without specific prior written permission.
|
---|
| 17 | *
|
---|
| 18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
---|
| 19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
---|
| 20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
| 21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
| 22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
| 23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
---|
| 24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
---|
| 25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
| 26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
---|
| 27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
| 28 | */
|
---|
| 29 |
|
---|
[750636a] | 30 | /** @addtogroup softfloat
|
---|
[846848a6] | 31 | * @{
|
---|
| 32 | */
|
---|
[c67aff2] | 33 | /** @file Addition functions.
|
---|
[846848a6] | 34 | */
|
---|
| 35 |
|
---|
[750636a] | 36 | #include <sftypes.h>
|
---|
| 37 | #include <add.h>
|
---|
| 38 | #include <comparison.h>
|
---|
[c67aff2] | 39 | #include <common.h>
|
---|
[12c6f2d] | 40 |
|
---|
[c67aff2] | 41 | /**
|
---|
| 42 | * Add two single-precision floats with the same signs.
|
---|
| 43 | *
|
---|
| 44 | * @param a First input operand.
|
---|
| 45 | * @param b Second input operand.
|
---|
| 46 | * @return Result of addition.
|
---|
[12c6f2d] | 47 | */
|
---|
| 48 | float32 addFloat32(float32 a, float32 b)
|
---|
| 49 | {
|
---|
| 50 | int expdiff;
|
---|
[c67aff2] | 51 | uint32_t exp1, exp2, frac1, frac2;
|
---|
[12c6f2d] | 52 |
|
---|
[4a5abddd] | 53 | expdiff = a.parts.exp - b.parts.exp;
|
---|
| 54 | if (expdiff < 0) {
|
---|
[12c6f2d] | 55 | if (isFloat32NaN(b)) {
|
---|
[1266543] | 56 | /* TODO: fix SigNaN */
|
---|
[12c6f2d] | 57 | if (isFloat32SigNaN(b)) {
|
---|
[c67aff2] | 58 | }
|
---|
[12c6f2d] | 59 |
|
---|
| 60 | return b;
|
---|
[c67aff2] | 61 | }
|
---|
[12c6f2d] | 62 |
|
---|
[4a5abddd] | 63 | if (b.parts.exp == FLOAT32_MAX_EXPONENT) {
|
---|
[12c6f2d] | 64 | return b;
|
---|
| 65 | }
|
---|
| 66 |
|
---|
[1266543] | 67 | frac1 = b.parts.fraction;
|
---|
[4a5abddd] | 68 | exp1 = b.parts.exp;
|
---|
[1266543] | 69 | frac2 = a.parts.fraction;
|
---|
[4a5abddd] | 70 | exp2 = a.parts.exp;
|
---|
| 71 | expdiff *= -1;
|
---|
[12c6f2d] | 72 | } else {
|
---|
[1266543] | 73 | if ((isFloat32NaN(a)) || (isFloat32NaN(b))) {
|
---|
| 74 | /* TODO: fix SigNaN */
|
---|
[4a5abddd] | 75 | if (isFloat32SigNaN(a) || isFloat32SigNaN(b)) {
|
---|
[c67aff2] | 76 | }
|
---|
| 77 | return (isFloat32NaN(a) ? a : b);
|
---|
| 78 | }
|
---|
[12c6f2d] | 79 |
|
---|
[4a5abddd] | 80 | if (a.parts.exp == FLOAT32_MAX_EXPONENT) {
|
---|
[12c6f2d] | 81 | return a;
|
---|
| 82 | }
|
---|
| 83 |
|
---|
[1266543] | 84 | frac1 = a.parts.fraction;
|
---|
[4a5abddd] | 85 | exp1 = a.parts.exp;
|
---|
[1266543] | 86 | frac2 = b.parts.fraction;
|
---|
[4a5abddd] | 87 | exp2 = b.parts.exp;
|
---|
[c67aff2] | 88 | }
|
---|
[12c6f2d] | 89 |
|
---|
| 90 | if (exp1 == 0) {
|
---|
| 91 | /* both are denormalized */
|
---|
[1266543] | 92 | frac1 += frac2;
|
---|
| 93 | if (frac1 & FLOAT32_HIDDEN_BIT_MASK ) {
|
---|
[12c6f2d] | 94 | /* result is not denormalized */
|
---|
| 95 | a.parts.exp = 1;
|
---|
[c67aff2] | 96 | }
|
---|
[1266543] | 97 | a.parts.fraction = frac1;
|
---|
[12c6f2d] | 98 | return a;
|
---|
[c67aff2] | 99 | }
|
---|
[12c6f2d] | 100 |
|
---|
[1266543] | 101 | frac1 |= FLOAT32_HIDDEN_BIT_MASK; /* add hidden bit */
|
---|
[12c6f2d] | 102 |
|
---|
| 103 | if (exp2 == 0) {
|
---|
| 104 | /* second operand is denormalized */
|
---|
[e6a40ac] | 105 | --expdiff;
|
---|
[12c6f2d] | 106 | } else {
|
---|
| 107 | /* add hidden bit to second operand */
|
---|
[1266543] | 108 | frac2 |= FLOAT32_HIDDEN_BIT_MASK;
|
---|
[c67aff2] | 109 | }
|
---|
[12c6f2d] | 110 |
|
---|
| 111 | /* create some space for rounding */
|
---|
[1266543] | 112 | frac1 <<= 6;
|
---|
| 113 | frac2 <<= 6;
|
---|
[12c6f2d] | 114 |
|
---|
[1266543] | 115 | if (expdiff < (FLOAT32_FRACTION_SIZE + 2) ) {
|
---|
| 116 | frac2 >>= expdiff;
|
---|
| 117 | frac1 += frac2;
|
---|
[d3ca210] | 118 | } else {
|
---|
| 119 | a.parts.exp = exp1;
|
---|
| 120 | a.parts.fraction = (frac1 >> 6) & (~(FLOAT32_HIDDEN_BIT_MASK));
|
---|
| 121 | return a;
|
---|
| 122 | }
|
---|
[12c6f2d] | 123 |
|
---|
[1266543] | 124 | if (frac1 & (FLOAT32_HIDDEN_BIT_MASK << 7) ) {
|
---|
[12c6f2d] | 125 | ++exp1;
|
---|
[1266543] | 126 | frac1 >>= 1;
|
---|
[c67aff2] | 127 | }
|
---|
[12c6f2d] | 128 |
|
---|
[1266543] | 129 | /* rounding - if first bit after fraction is set then round up */
|
---|
| 130 | frac1 += (0x1 << 5);
|
---|
[12c6f2d] | 131 |
|
---|
[1266543] | 132 | if (frac1 & (FLOAT32_HIDDEN_BIT_MASK << 7)) {
|
---|
| 133 | /* rounding overflow */
|
---|
[12c6f2d] | 134 | ++exp1;
|
---|
[1266543] | 135 | frac1 >>= 1;
|
---|
[c67aff2] | 136 | }
|
---|
[e6a40ac] | 137 |
|
---|
| 138 | if ((exp1 == FLOAT32_MAX_EXPONENT ) || (exp2 > exp1)) {
|
---|
[c67aff2] | 139 | /* overflow - set infinity as result */
|
---|
| 140 | a.parts.exp = FLOAT32_MAX_EXPONENT;
|
---|
| 141 | a.parts.fraction = 0;
|
---|
| 142 | return a;
|
---|
| 143 | }
|
---|
[1266543] | 144 |
|
---|
[12c6f2d] | 145 | a.parts.exp = exp1;
|
---|
| 146 |
|
---|
[750636a] | 147 | /* Clear hidden bit and shift */
|
---|
[c67aff2] | 148 | a.parts.fraction = ((frac1 >> 6) & (~FLOAT32_HIDDEN_BIT_MASK));
|
---|
[12c6f2d] | 149 | return a;
|
---|
| 150 | }
|
---|
| 151 |
|
---|
[c67aff2] | 152 | /**
|
---|
| 153 | * Add two double-precision floats with the same signs.
|
---|
| 154 | *
|
---|
| 155 | * @param a First input operand.
|
---|
| 156 | * @param b Second input operand.
|
---|
| 157 | * @return Result of addition.
|
---|
[12c6f2d] | 158 | */
|
---|
| 159 | float64 addFloat64(float64 a, float64 b)
|
---|
| 160 | {
|
---|
| 161 | int expdiff;
|
---|
[aa59fa0] | 162 | uint32_t exp1, exp2;
|
---|
| 163 | uint64_t frac1, frac2;
|
---|
[12c6f2d] | 164 |
|
---|
[c67aff2] | 165 | expdiff = ((int) a.parts.exp) - b.parts.exp;
|
---|
[4a5abddd] | 166 | if (expdiff < 0) {
|
---|
[12c6f2d] | 167 | if (isFloat64NaN(b)) {
|
---|
[1266543] | 168 | /* TODO: fix SigNaN */
|
---|
[12c6f2d] | 169 | if (isFloat64SigNaN(b)) {
|
---|
[c67aff2] | 170 | }
|
---|
[12c6f2d] | 171 |
|
---|
| 172 | return b;
|
---|
[c67aff2] | 173 | }
|
---|
[12c6f2d] | 174 |
|
---|
| 175 | /* b is infinity and a not */
|
---|
[c67aff2] | 176 | if (b.parts.exp == FLOAT64_MAX_EXPONENT) {
|
---|
[12c6f2d] | 177 | return b;
|
---|
| 178 | }
|
---|
| 179 |
|
---|
[1266543] | 180 | frac1 = b.parts.fraction;
|
---|
[4a5abddd] | 181 | exp1 = b.parts.exp;
|
---|
[1266543] | 182 | frac2 = a.parts.fraction;
|
---|
[4a5abddd] | 183 | exp2 = a.parts.exp;
|
---|
| 184 | expdiff *= -1;
|
---|
[12c6f2d] | 185 | } else {
|
---|
| 186 | if (isFloat64NaN(a)) {
|
---|
[1266543] | 187 | /* TODO: fix SigNaN */
|
---|
[4a5abddd] | 188 | if (isFloat64SigNaN(a) || isFloat64SigNaN(b)) {
|
---|
[c67aff2] | 189 | }
|
---|
[12c6f2d] | 190 | return a;
|
---|
[c67aff2] | 191 | }
|
---|
[12c6f2d] | 192 |
|
---|
| 193 | /* a is infinity and b not */
|
---|
[c67aff2] | 194 | if (a.parts.exp == FLOAT64_MAX_EXPONENT) {
|
---|
[12c6f2d] | 195 | return a;
|
---|
| 196 | }
|
---|
| 197 |
|
---|
[1266543] | 198 | frac1 = a.parts.fraction;
|
---|
[12c6f2d] | 199 | exp1 = a.parts.exp;
|
---|
[1266543] | 200 | frac2 = b.parts.fraction;
|
---|
[12c6f2d] | 201 | exp2 = b.parts.exp;
|
---|
[c67aff2] | 202 | }
|
---|
[12c6f2d] | 203 |
|
---|
| 204 | if (exp1 == 0) {
|
---|
| 205 | /* both are denormalized */
|
---|
[1266543] | 206 | frac1 += frac2;
|
---|
| 207 | if (frac1 & FLOAT64_HIDDEN_BIT_MASK) {
|
---|
[12c6f2d] | 208 | /* result is not denormalized */
|
---|
| 209 | a.parts.exp = 1;
|
---|
[c67aff2] | 210 | }
|
---|
[1266543] | 211 | a.parts.fraction = frac1;
|
---|
[12c6f2d] | 212 | return a;
|
---|
[c67aff2] | 213 | }
|
---|
[12c6f2d] | 214 |
|
---|
[1266543] | 215 | /* add hidden bit - frac1 is sure not denormalized */
|
---|
| 216 | frac1 |= FLOAT64_HIDDEN_BIT_MASK;
|
---|
[12c6f2d] | 217 |
|
---|
| 218 | /* second operand ... */
|
---|
| 219 | if (exp2 == 0) {
|
---|
| 220 | /* ... is denormalized */
|
---|
| 221 | --expdiff;
|
---|
| 222 | } else {
|
---|
| 223 | /* is not denormalized */
|
---|
[1266543] | 224 | frac2 |= FLOAT64_HIDDEN_BIT_MASK;
|
---|
[c67aff2] | 225 | }
|
---|
[12c6f2d] | 226 |
|
---|
| 227 | /* create some space for rounding */
|
---|
[1266543] | 228 | frac1 <<= 6;
|
---|
| 229 | frac2 <<= 6;
|
---|
[12c6f2d] | 230 |
|
---|
[c67aff2] | 231 | if (expdiff < (FLOAT64_FRACTION_SIZE + 2)) {
|
---|
[1266543] | 232 | frac2 >>= expdiff;
|
---|
| 233 | frac1 += frac2;
|
---|
[d3ca210] | 234 | } else {
|
---|
| 235 | a.parts.exp = exp1;
|
---|
| 236 | a.parts.fraction = (frac1 >> 6) & (~(FLOAT64_HIDDEN_BIT_MASK));
|
---|
| 237 | return a;
|
---|
| 238 | }
|
---|
[12c6f2d] | 239 |
|
---|
[c67aff2] | 240 | if (frac1 & (FLOAT64_HIDDEN_BIT_MASK << 7)) {
|
---|
[12c6f2d] | 241 | ++exp1;
|
---|
[1266543] | 242 | frac1 >>= 1;
|
---|
[c67aff2] | 243 | }
|
---|
[12c6f2d] | 244 |
|
---|
[1266543] | 245 | /* rounding - if first bit after fraction is set then round up */
|
---|
| 246 | frac1 += (0x1 << 5);
|
---|
[12c6f2d] | 247 |
|
---|
[1266543] | 248 | if (frac1 & (FLOAT64_HIDDEN_BIT_MASK << 7)) {
|
---|
| 249 | /* rounding overflow */
|
---|
[12c6f2d] | 250 | ++exp1;
|
---|
[1266543] | 251 | frac1 >>= 1;
|
---|
[c67aff2] | 252 | }
|
---|
[12c6f2d] | 253 |
|
---|
[d3ca210] | 254 | if ((exp1 == FLOAT64_MAX_EXPONENT ) || (exp2 > exp1)) {
|
---|
[c67aff2] | 255 | /* overflow - set infinity as result */
|
---|
| 256 | a.parts.exp = FLOAT64_MAX_EXPONENT;
|
---|
| 257 | a.parts.fraction = 0;
|
---|
| 258 | return a;
|
---|
| 259 | }
|
---|
[1266543] | 260 |
|
---|
[12c6f2d] | 261 | a.parts.exp = exp1;
|
---|
[750636a] | 262 | /* Clear hidden bit and shift */
|
---|
[c67aff2] | 263 | a.parts.fraction = ((frac1 >> 6 ) & (~FLOAT64_HIDDEN_BIT_MASK));
|
---|
| 264 | return a;
|
---|
| 265 | }
|
---|
| 266 |
|
---|
| 267 | /**
|
---|
| 268 | * Add two quadruple-precision floats with the same signs.
|
---|
| 269 | *
|
---|
| 270 | * @param a First input operand.
|
---|
| 271 | * @param b Second input operand.
|
---|
| 272 | * @return Result of addition.
|
---|
| 273 | */
|
---|
| 274 | float128 addFloat128(float128 a, float128 b)
|
---|
| 275 | {
|
---|
| 276 | int expdiff;
|
---|
| 277 | uint32_t exp1, exp2;
|
---|
| 278 | uint64_t frac1_hi, frac1_lo, frac2_hi, frac2_lo, tmp_hi, tmp_lo;
|
---|
| 279 |
|
---|
| 280 | expdiff = ((int) a.parts.exp) - b.parts.exp;
|
---|
| 281 | if (expdiff < 0) {
|
---|
| 282 | if (isFloat128NaN(b)) {
|
---|
| 283 | /* TODO: fix SigNaN */
|
---|
| 284 | if (isFloat128SigNaN(b)) {
|
---|
| 285 | }
|
---|
| 286 |
|
---|
| 287 | return b;
|
---|
| 288 | }
|
---|
| 289 |
|
---|
| 290 | /* b is infinity and a not */
|
---|
| 291 | if (b.parts.exp == FLOAT128_MAX_EXPONENT) {
|
---|
| 292 | return b;
|
---|
| 293 | }
|
---|
| 294 |
|
---|
| 295 | frac1_hi = b.parts.frac_hi;
|
---|
| 296 | frac1_lo = b.parts.frac_lo;
|
---|
| 297 | exp1 = b.parts.exp;
|
---|
| 298 | frac2_hi = a.parts.frac_hi;
|
---|
| 299 | frac2_lo = a.parts.frac_lo;
|
---|
| 300 | exp2 = a.parts.exp;
|
---|
| 301 | expdiff *= -1;
|
---|
| 302 | } else {
|
---|
| 303 | if (isFloat128NaN(a)) {
|
---|
| 304 | /* TODO: fix SigNaN */
|
---|
| 305 | if (isFloat128SigNaN(a) || isFloat128SigNaN(b)) {
|
---|
| 306 | }
|
---|
| 307 | return a;
|
---|
| 308 | }
|
---|
| 309 |
|
---|
| 310 | /* a is infinity and b not */
|
---|
| 311 | if (a.parts.exp == FLOAT128_MAX_EXPONENT) {
|
---|
| 312 | return a;
|
---|
| 313 | }
|
---|
| 314 |
|
---|
| 315 | frac1_hi = a.parts.frac_hi;
|
---|
| 316 | frac1_lo = a.parts.frac_lo;
|
---|
| 317 | exp1 = a.parts.exp;
|
---|
| 318 | frac2_hi = b.parts.frac_hi;
|
---|
| 319 | frac2_lo = b.parts.frac_lo;
|
---|
| 320 | exp2 = b.parts.exp;
|
---|
| 321 | }
|
---|
| 322 |
|
---|
| 323 | if (exp1 == 0) {
|
---|
| 324 | /* both are denormalized */
|
---|
| 325 | add128(frac1_hi, frac1_lo, frac2_hi, frac2_lo, &frac1_hi, &frac1_lo);
|
---|
| 326 |
|
---|
| 327 | and128(frac1_hi, frac1_lo,
|
---|
| 328 | FLOAT128_HIDDEN_BIT_MASK_HI, FLOAT128_HIDDEN_BIT_MASK_LO,
|
---|
| 329 | &tmp_hi, &tmp_lo);
|
---|
| 330 | if (lt128(0x0ll, 0x0ll, tmp_hi, tmp_lo)) {
|
---|
| 331 | /* result is not denormalized */
|
---|
| 332 | a.parts.exp = 1;
|
---|
| 333 | }
|
---|
| 334 |
|
---|
| 335 | a.parts.frac_hi = frac1_hi;
|
---|
| 336 | a.parts.frac_lo = frac1_lo;
|
---|
| 337 | return a;
|
---|
| 338 | }
|
---|
| 339 |
|
---|
| 340 | /* add hidden bit - frac1 is sure not denormalized */
|
---|
| 341 | or128(frac1_hi, frac1_lo,
|
---|
| 342 | FLOAT128_HIDDEN_BIT_MASK_HI, FLOAT128_HIDDEN_BIT_MASK_LO,
|
---|
| 343 | &frac1_hi, &frac1_lo);
|
---|
| 344 |
|
---|
| 345 | /* second operand ... */
|
---|
| 346 | if (exp2 == 0) {
|
---|
| 347 | /* ... is denormalized */
|
---|
| 348 | --expdiff;
|
---|
| 349 | } else {
|
---|
| 350 | /* is not denormalized */
|
---|
| 351 | or128(frac2_hi, frac2_lo,
|
---|
| 352 | FLOAT128_HIDDEN_BIT_MASK_HI, FLOAT128_HIDDEN_BIT_MASK_LO,
|
---|
| 353 | &frac2_hi, &frac2_lo);
|
---|
| 354 | }
|
---|
| 355 |
|
---|
| 356 | /* create some space for rounding */
|
---|
| 357 | lshift128(frac1_hi, frac1_lo, 6, &frac1_hi, &frac1_lo);
|
---|
| 358 | lshift128(frac2_hi, frac2_lo, 6, &frac2_hi, &frac2_lo);
|
---|
| 359 |
|
---|
| 360 | if (expdiff < (FLOAT128_FRACTION_SIZE + 2)) {
|
---|
| 361 | rshift128(frac2_hi, frac2_lo, expdiff, &frac2_hi, &frac2_lo);
|
---|
| 362 | add128(frac1_hi, frac1_lo, frac2_hi, frac2_lo, &frac1_hi, &frac1_lo);
|
---|
| 363 | } else {
|
---|
| 364 | a.parts.exp = exp1;
|
---|
| 365 |
|
---|
| 366 | rshift128(frac1_hi, frac1_lo, 6, &frac1_hi, &frac1_lo);
|
---|
| 367 | not128(FLOAT128_HIDDEN_BIT_MASK_HI, FLOAT128_HIDDEN_BIT_MASK_LO,
|
---|
| 368 | &tmp_hi, &tmp_lo);
|
---|
| 369 | and128(frac1_hi, frac1_lo, tmp_hi, tmp_lo, &tmp_hi, &tmp_lo);
|
---|
| 370 |
|
---|
| 371 | a.parts.frac_hi = tmp_hi;
|
---|
| 372 | a.parts.frac_lo = tmp_lo;
|
---|
| 373 | return a;
|
---|
| 374 | }
|
---|
| 375 |
|
---|
| 376 | lshift128(FLOAT128_HIDDEN_BIT_MASK_HI, FLOAT128_HIDDEN_BIT_MASK_LO, 7,
|
---|
| 377 | &tmp_hi, &tmp_lo);
|
---|
| 378 | and128(frac1_hi, frac1_lo, tmp_hi, tmp_lo, &tmp_hi, &tmp_lo);
|
---|
| 379 | if (lt128(0x0ll, 0x0ll, tmp_hi, tmp_lo)) {
|
---|
| 380 | ++exp1;
|
---|
| 381 | rshift128(frac1_hi, frac1_lo, 1, &frac1_hi, &frac1_lo);
|
---|
| 382 | }
|
---|
| 383 |
|
---|
| 384 | /* rounding - if first bit after fraction is set then round up */
|
---|
| 385 | add128(frac1_hi, frac1_lo, 0x0ll, 0x1ll << 5, &frac1_hi, &frac1_lo);
|
---|
| 386 |
|
---|
| 387 | lshift128(FLOAT128_HIDDEN_BIT_MASK_HI, FLOAT128_HIDDEN_BIT_MASK_LO, 7,
|
---|
| 388 | &tmp_hi, &tmp_lo);
|
---|
| 389 | and128(frac1_hi, frac1_lo, tmp_hi, tmp_lo, &tmp_hi, &tmp_lo);
|
---|
| 390 | if (lt128(0x0ll, 0x0ll, tmp_hi, tmp_lo)) {
|
---|
| 391 | /* rounding overflow */
|
---|
| 392 | ++exp1;
|
---|
| 393 | rshift128(frac1_hi, frac1_lo, 1, &frac1_hi, &frac1_lo);
|
---|
| 394 | }
|
---|
| 395 |
|
---|
| 396 | if ((exp1 == FLOAT128_MAX_EXPONENT ) || (exp2 > exp1)) {
|
---|
| 397 | /* overflow - set infinity as result */
|
---|
| 398 | a.parts.exp = FLOAT64_MAX_EXPONENT;
|
---|
| 399 | a.parts.frac_hi = 0;
|
---|
| 400 | a.parts.frac_lo = 0;
|
---|
| 401 | return a;
|
---|
| 402 | }
|
---|
| 403 |
|
---|
| 404 | a.parts.exp = exp1;
|
---|
[d3ca210] | 405 |
|
---|
[c67aff2] | 406 | /* Clear hidden bit and shift */
|
---|
| 407 | rshift128(frac1_hi, frac1_lo, 6, &frac1_hi, &frac1_lo);
|
---|
| 408 | not128(FLOAT128_HIDDEN_BIT_MASK_HI, FLOAT128_HIDDEN_BIT_MASK_LO,
|
---|
| 409 | &tmp_hi, &tmp_lo);
|
---|
| 410 | and128(frac1_hi, frac1_lo, tmp_hi, tmp_lo, &tmp_hi, &tmp_lo);
|
---|
| 411 |
|
---|
| 412 | a.parts.frac_hi = tmp_hi;
|
---|
| 413 | a.parts.frac_lo = tmp_lo;
|
---|
| 414 |
|
---|
[12c6f2d] | 415 | return a;
|
---|
| 416 | }
|
---|
| 417 |
|
---|
[231a60a] | 418 | /** @}
|
---|
[846848a6] | 419 | */
|
---|