/usr/include/fplll/dpe.h is in libfplll-dev 4.0.4-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 | /* Copyright (C) 2004, 2005, 2006, 2008 Patrick Pelissier, Paul Zimmermann,
LORIA/INRIA Nancy - Grand-Est.
This file is part of the DPE Library.
The DPE Library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or (at your
option) any later version.
The DPE Library 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 Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the DPE Library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
MA 02110-1301, USA. */
/* WARNING: Patched version */
#ifndef FPLLL_DPE_H
#define FPLLL_DPE_H
#define __DPE
#include <stdlib.h> /* For exit */
#include <stdio.h> /* For fprintf and fscanf */
#include <math.h> /* for round, floor, ceil */
#if defined (__sun) /* for round on Solaris 10 */
#include "tgmath.h"
#include "ieeefp.h"
#undef NAN
#define NAN 0.0/0.0
#endif
#include <limits.h>
#define DPE_VERSION_MAJOR 1
#define DPE_VERSION_MINOR 5
#if defined(__GNUC__) && (__GNUC__ >= 3)
# define DPE_LIKELY(x) (__builtin_expect(!!(x),1))
# define DPE_UNLIKELY(x) (__builtin_expect((x),0))
# define DPE_UNUSED_ATTR __attribute__((unused))
#else
# define DPE_LIKELY(x) (x)
# define DPE_UNLIKELY(x) (x)
# define DPE_UNUSED_ATTR
#endif
#if !defined(DPE_USE_DOUBLE) && !defined(DPE_USE_LONGDOUBLE)
# define DPE_USE_DOUBLE
#endif
#if (defined(__i386) || defined (__x86_64)) && !defined(DPE_LITTLEENDIAN32) && defined(DPE_USE_DOUBLE)
# define DPE_LITTLEENDIAN32
#endif
#if defined(DPE_USE_DOUBLE)
# define DPE_DOUBLE double /* mantissa type */
# define DPE_BITSIZE 53 /* bitsize of DPE_DOUBLE */
# define DPE_2_POW_BITSIZE 0x1P53
/* DPE_LDEXP(DPE_DOUBLE m, DPEEXP e) return x = m * 2^e */
# define DPE_LDEXP ldexp
/* DPE_FREXP(DPE_DOUBLE x, DPEEXP *e) returns m, e such that x = m * 2^e with
1/2 <= m < 1 */
# define DPE_FREXP frexp
/* DPE_ROUND(DPE_DOUBLE x) returns the nearest integer to x */
# define DPE_ROUND round
# define DPE_RINT rint
# define DPE_FLOOR floor
# define DPE_CEIL ceil
# define DPE_TRUNC trunc
#elif defined(DPE_USE_LONGDOUBLE)
# define DPE_DOUBLE long double
# define DPE_BITSIZE 64
# define DPE_2_POW_BITSIZE 0x1P64
# define DPE_LDEXP ldexpl
# define DPE_FREXP frexpl
# define DPE_ROUND roundl
# define DPE_RINT rintl
# define DPE_FLOOR floorl
# define DPE_CEIL ceill
# define DPE_TRUNC truncl
#else
# error "neither DPE_USE_DOUBLE nor DPE_USE_LONGDOUBLE is defined"
#endif
#if defined(DPE_USE_LONG)
# define DPE_EXP_T long /* exponent type */
# define DPE_EXPMIN LONG_MIN /* smallest possible exponent */
#elif defined(DPE_USE_LONGLONG)
# define DPE_EXP_T long long
# define DPE_EXPMIN LONG_LONG_MIN
#else
# define DPE_EXP_T int /* exponent type */
# define DPE_EXPMIN INT_MIN /* smallest possible exponent */
#endif
typedef union
{
double d;
int i[2];
} dpe_double_words;
typedef struct
{
DPE_DOUBLE d; /* significand */
DPE_EXP_T exp; /* exponent */
} dpe_struct;
typedef dpe_struct dpe_t[1];
#define DPE_MANT(x) ((x)->d)
#define DPE_EXP(x) ((x)->exp)
#define DPE_SIGN(x) ((DPE_MANT(x) < 0.0) ? -1 : (DPE_MANT(x) > 0.0))
#define DPE_INLINE static inline
/* initialize */
DPE_INLINE void
dpe_init (dpe_t x DPE_UNUSED_ATTR)
{
}
/* clear */
DPE_INLINE void
dpe_clear (dpe_t x DPE_UNUSED_ATTR)
{
}
/* set x to y */
DPE_INLINE void
dpe_set (dpe_t x, const dpe_t y)
{
DPE_MANT(x) = DPE_MANT(y);
DPE_EXP(x) = DPE_EXP(y);
}
/* set x to -y */
DPE_INLINE void
dpe_neg (dpe_t x, const dpe_t y)
{
DPE_MANT(x) = -DPE_MANT(y);
DPE_EXP(x) = DPE_EXP(y);
}
/* set x to |y| */
DPE_INLINE void
dpe_abs (dpe_t x, const dpe_t y)
{
DPE_MANT(x) = (DPE_MANT(y) >= 0) ? DPE_MANT(y) : -DPE_MANT(y);
DPE_EXP(x) = DPE_EXP(y);
}
/* set mantissa in [1/2, 1), except for 0 which has minimum exponent */
static void
dpe_normalize (dpe_t x)
{
if (DPE_UNLIKELY (DPE_MANT(x) == 0.0 || finite (DPE_MANT(x)) == 0))
{
if (DPE_MANT(x) == 0.0)
DPE_EXP(x) = DPE_EXPMIN;
/* otherwise let the exponent of NaN, Inf unchanged */
}
else
{
DPE_EXP_T e;
#ifdef DPE_LITTLEENDIAN32 /* 32-bit little endian */
dpe_double_words dw;
dw.d = DPE_MANT(x);
e = (dw.i[1] >> 20) & 0x7FF; /* unbiased exponent, 1022 for m=1/2 */
DPE_EXP(x) += e - 1022;
dw.i[1] = (dw.i[1] & 0x800FFFFF) | 0x3FE00000;
DPE_MANT(x) = dw.d;
#else /* portable code */
double m = DPE_MANT(x);
DPE_MANT(x) = DPE_FREXP (m, &e);
DPE_EXP(x) += e;
#endif
}
}
#if defined(DPE_USE_DOUBLE)
static const double dpe_scale_tab[54] = {
0x1P0, 0x1P-1, 0x1P-2, 0x1P-3, 0x1P-4, 0x1P-5, 0x1P-6, 0x1P-7, 0x1P-8,
0x1P-9, 0x1P-10, 0x1P-11, 0x1P-12, 0x1P-13, 0x1P-14, 0x1P-15, 0x1P-16,
0x1P-17, 0x1P-18, 0x1P-19, 0x1P-20, 0x1P-21, 0x1P-22, 0x1P-23, 0x1P-24,
0x1P-25, 0x1P-26, 0x1P-27, 0x1P-28, 0x1P-29, 0x1P-30, 0x1P-31, 0x1P-32,
0x1P-33, 0x1P-34, 0x1P-35, 0x1P-36, 0x1P-37, 0x1P-38, 0x1P-39, 0x1P-40,
0x1P-41, 0x1P-42, 0x1P-43, 0x1P-44, 0x1P-45, 0x1P-46, 0x1P-47, 0x1P-48,
0x1P-49, 0x1P-50, 0x1P-51, 0x1P-52, 0x1P-53};
#endif
DPE_INLINE double
dpe_scale (double d, int s)
{
/* -DPE_BITSIZE < s <= 0 and 1/2 <= d < 1 */
#if defined(DPE_USE_DOUBLE)
return d * dpe_scale_tab [-s];
#else /* portable code */
return DPE_LDEXP (d, s);
#endif
}
/* set x to y */
DPE_INLINE void
dpe_set_d (dpe_t x, double y)
{
DPE_MANT(x) = (DPE_DOUBLE) y;
DPE_EXP(x) = 0;
dpe_normalize (x);
}
/* set x to y */
DPE_INLINE void
dpe_set_ld (dpe_t x, long double y)
{
DPE_MANT(x) = (DPE_DOUBLE) y;
DPE_EXP(x) = 0;
dpe_normalize (x);
}
/* set x to y */
DPE_INLINE void
dpe_set_ui (dpe_t x, unsigned long y)
{
DPE_MANT(x) = (DPE_DOUBLE) y;
DPE_EXP(x) = 0;
dpe_normalize (x);
}
/* set x to y */
DPE_INLINE void
dpe_set_si (dpe_t x, long y)
{
DPE_MANT(x) = (DPE_DOUBLE) y;
DPE_EXP(x) = 0;
dpe_normalize (x);
}
DPE_INLINE long
dpe_get_si (const dpe_t x)
{
DPE_DOUBLE d = DPE_LDEXP (DPE_MANT (x), DPE_EXP (x));
return (long) d;
}
DPE_INLINE unsigned long
dpe_get_ui (const dpe_t x)
{
DPE_DOUBLE d = DPE_LDEXP (DPE_MANT (x), DPE_EXP (x));
return (d < 0.0) ? 0 : (unsigned long) d;
}
DPE_INLINE double
dpe_get_d (const dpe_t x)
{
return DPE_LDEXP (DPE_MANT (x), DPE_EXP (x));
}
DPE_INLINE long double
dpe_get_ld (const dpe_t x)
{
return DPE_LDEXP (DPE_MANT (x), DPE_EXP (x));
}
#ifdef __GMP_H__
/* set x to y */
DPE_INLINE void
dpe_set_z (dpe_t x, const mpz_t y)
{
long e;
DPE_MANT(x) = mpz_get_d_2exp (&e, y);
DPE_EXP(x) = (DPE_EXP_T) e;
}
/* set x to y, rounded to nearest */
DPE_INLINE void
dpe_get_z (mpz_t x, const dpe_t y)
{
DPE_EXP_T ey = DPE_EXP(y);
if (ey >= DPE_BITSIZE) /* y is an integer */
{
DPE_DOUBLE d = DPE_MANT(y) * DPE_2_POW_BITSIZE; /* d is an integer */
mpz_set_d (x, d); /* should be exact */
mpz_mul_2exp (x, x, (unsigned long) ey - DPE_BITSIZE);
}
else /* DPE_EXP(y) < DPE_BITSIZE */
{
if (DPE_UNLIKELY (ey < 0)) /* |y| < 1/2 */
mpz_set_ui (x, 0);
else
{
DPE_DOUBLE d = DPE_LDEXP(DPE_MANT(y), ey);
mpz_set_d (x, (double) DPE_ROUND(d));
}
}
}
/* return e and x such that y = x*2^e */
DPE_INLINE mp_exp_t
dpe_get_z_exp (mpz_t x, const dpe_t y)
{
mpz_set_d (x, DPE_MANT (y) * DPE_2_POW_BITSIZE);
return DPE_EXP(y) - DPE_BITSIZE;
}
#endif //#ifdef __GMP_H__
/* x <- y + z, assuming y and z are normalized, returns x normalized */
DPE_INLINE void
dpe_add (dpe_t x, const dpe_t y, const dpe_t z)
{
if (DPE_UNLIKELY (DPE_EXP(y) > DPE_EXP(z) + DPE_BITSIZE))
/* |z| < 1/2*ulp(y), thus o(y+z) = y */
dpe_set (x, y);
else if (DPE_UNLIKELY (DPE_EXP(z) > DPE_EXP(y) + DPE_BITSIZE))
dpe_set (x, z);
else
{
DPE_EXP_T d = DPE_EXP(y) - DPE_EXP(z); /* |d| <= DPE_BITSIZE */
if (d >= 0)
{
DPE_MANT(x) = DPE_MANT(y) + dpe_scale (DPE_MANT(z), -d);
DPE_EXP(x) = DPE_EXP(y);
}
else
{
DPE_MANT(x) = DPE_MANT(z) + dpe_scale (DPE_MANT(y), d);
DPE_EXP(x) = DPE_EXP(z);
}
dpe_normalize (x);
}
}
/* x <- y - z, assuming y and z are normalized, returns x normalized */
DPE_INLINE void
dpe_sub (dpe_t x, const dpe_t y, const dpe_t z)
{
if (DPE_UNLIKELY (DPE_EXP(y) > DPE_EXP(z) + DPE_BITSIZE))
/* |z| < 1/2*ulp(y), thus o(y-z) = y */
dpe_set (x, y);
else if (DPE_UNLIKELY (DPE_EXP(z) > DPE_EXP(y) + DPE_BITSIZE))
dpe_neg (x, z);
else
{
DPE_EXP_T d = DPE_EXP(y) - DPE_EXP(z); /* |d| <= DPE_BITSIZE */
if (d >= 0)
{
DPE_MANT(x) = DPE_MANT(y) - dpe_scale (DPE_MANT(z), -d);
DPE_EXP(x) = DPE_EXP(y);
}
else
{
DPE_MANT(x) = dpe_scale (DPE_MANT(y), d) - DPE_MANT(z);
DPE_EXP(x) = DPE_EXP(z);
}
dpe_normalize (x);
}
}
/* x <- y * z, assuming y and z are normalized, returns x normalized */
DPE_INLINE void
dpe_mul (dpe_t x, const dpe_t y, const dpe_t z)
{
DPE_MANT(x) = DPE_MANT(y) * DPE_MANT(z);
DPE_EXP(x) = DPE_EXP(y) + DPE_EXP(z);
dpe_normalize (x);
}
/* x <- sqrt(y), assuming y is normalized, returns x normalized */
DPE_INLINE void
dpe_sqrt (dpe_t x, const dpe_t y)
{
DPE_EXP_T ey = DPE_EXP(y);
if (ey % 2)
{
/* since 1/2 <= my < 1, 1/4 <= my/2 < 1 */
DPE_MANT(x) = sqrt (0.5 * DPE_MANT(y));
DPE_EXP(x) = (ey + 1) / 2;
}
else
{
DPE_MANT(x) = sqrt (DPE_MANT(y));
DPE_EXP(x) = ey / 2;
}
}
/* x <- y / z, assuming y and z are normalized, returns x normalized.
Assumes z is not zero. */
DPE_INLINE void
dpe_div (dpe_t x, const dpe_t y, const dpe_t z)
{
DPE_MANT(x) = DPE_MANT(y) / DPE_MANT(z);
DPE_EXP(x) = DPE_EXP(y) - DPE_EXP(z);
dpe_normalize (x);
}
/* x <- y * z, assuming y normalized, returns x normalized */
DPE_INLINE void
dpe_mul_ui (dpe_t x, const dpe_t y, unsigned long z)
{
DPE_MANT(x) = DPE_MANT(y) * (DPE_DOUBLE) z;
DPE_EXP(x) = DPE_EXP(y);
dpe_normalize (x);
}
/* x <- y / z, assuming y normalized, z non-zero, returns x normalized */
DPE_INLINE void
dpe_div_ui (dpe_t x, const dpe_t y, unsigned long z)
{
DPE_MANT(x) = DPE_MANT(y) / (DPE_DOUBLE) z;
DPE_EXP(x) = DPE_EXP(y);
dpe_normalize (x);
}
/* x <- y * 2^e */
DPE_INLINE void
dpe_mul_2si (dpe_t x, const dpe_t y, long e)
{
DPE_MANT(x) = DPE_MANT(y);
DPE_EXP(x) = DPE_EXP(y) + (DPE_EXP_T) e;
}
/* x <- y * 2^e */
DPE_INLINE void
dpe_mul_2exp (dpe_t x, const dpe_t y, unsigned long e)
{
DPE_MANT(x) = DPE_MANT(y);
DPE_EXP(x) = DPE_EXP(y) + (DPE_EXP_T) e;
}
/* x <- y / 2^e */
DPE_INLINE void
dpe_div_2exp (dpe_t x, const dpe_t y, unsigned long e)
{
DPE_MANT(x) = DPE_MANT(y);
DPE_EXP(x) = DPE_EXP(y) - (DPE_EXP_T) e;
}
/* return e and x such that y = x*2^e (equality is not guaranteed if the 'long'
type has fewer bits than the significand in dpe_t) */
DPE_INLINE DPE_EXP_T
dpe_get_si_exp (long *x, const dpe_t y)
{
if (sizeof(long) == 4) /* 32-bit word: long has 31 bits */
{
*x = (long) (DPE_MANT(y) * 2147483648.0);
return DPE_EXP(y) - 31;
}
else if (sizeof(long) == 8) /* 64-bit word: long has 63 bits */
{
*x = (long) (DPE_MANT (y) * 9223372036854775808.0);
return DPE_EXP(y) - 63;
}
else
{
fprintf (stderr, "Error, neither 32-bit nor 64-bit word\n");
exit (1);
}
}
static DPE_UNUSED_ATTR int dpe_str_prec = 16;
static int dpe_out_str (FILE *s, int base, const dpe_t x) DPE_UNUSED_ATTR;
static int
dpe_out_str (FILE *s, int base, const dpe_t x)
{
DPE_DOUBLE d = DPE_MANT(x);
DPE_EXP_T e2 = DPE_EXP(x);
int e10 = 0;
char sign = ' ';
if (DPE_UNLIKELY (base != 10))
{
fprintf (stderr, "Error in dpe_out_str, only base 10 allowed\n");
exit (1);
}
if (d == 0.0)
#ifdef DPE_USE_DOUBLE
return fprintf (s, "%1.*f", dpe_str_prec, d);
#else
return fprintf (s, "foo\n %1.*Lf", dpe_str_prec, d);
#endif
if (d < 0)
{
d = -d;
sign = '-';
}
if (e2 > 0)
{
while (e2 > 0)
{
e2 --;
d *= 2.0;
if (d >= 10.0)
{
d /= 10.0;
e10 ++;
}
}
}
else /* e2 <= 0 */
{
while (e2 < 0)
{
e2 ++;
d /= 2.0;
if (d < 1.0)
{
d *= 10.0;
e10 --;
}
}
}
#ifdef DPE_USE_DOUBLE
return fprintf (s, "%c%1.*f*10^%d", sign, dpe_str_prec, d, e10);
#else
return fprintf (s, "%c%1.*Lf*10^%d", sign, dpe_str_prec, d, e10);
#endif
}
static size_t dpe_inp_str (dpe_t x, FILE *s, int base) DPE_UNUSED_ATTR;
static size_t
dpe_inp_str (dpe_t x, FILE *s, int base)
{
size_t res;
DPE_DOUBLE d;
if (DPE_UNLIKELY (base != 10))
{
fprintf (stderr, "Error in dpe_out_str, only base 10 allowed\n");
exit (1);
}
#ifdef DPE_USE_DOUBLE
res = fscanf (s, "%lf", &d);
#else
res = fscanf (s, "%Lf", &d);
#endif
dpe_set_d (x, d);
return res;
}
DPE_INLINE void
dpe_dump (const dpe_t x)
{
dpe_out_str (stdout, 10, x);
putchar ('\n');
}
DPE_INLINE int
dpe_zero_p (const dpe_t x)
{
return DPE_MANT (x) == 0;
}
/* return a positive value if x > y
a negative value if x < y
and 0 otherwise (x=y). */
DPE_INLINE int
dpe_cmp (const dpe_t x, const dpe_t y)
{
int sx = DPE_SIGN(x);
int d = sx - DPE_SIGN(y);
if (d != 0)
return d;
else if (DPE_EXP(x) > DPE_EXP(y))
return (sx > 0) ? 1 : -1;
else if (DPE_EXP(y) > DPE_EXP(x))
return (sx > 0) ? -1 : 1;
else /* DPE_EXP(x) = DPE_EXP(y) */
return (DPE_MANT(x) < DPE_MANT(y)) ? -1 : (DPE_MANT(x) > DPE_MANT(y));
}
DPE_INLINE int
dpe_cmp_d (const dpe_t x, double d)
{
dpe_t y;
dpe_set_d (y, d);
return dpe_cmp (x, y);
}
DPE_INLINE int
dpe_cmp_ui (const dpe_t x, unsigned long d)
{
dpe_t y;
dpe_set_ui (y, d);
return dpe_cmp (x, y);
}
DPE_INLINE int
dpe_cmp_si (const dpe_t x, long d)
{
dpe_t y;
dpe_set_si (y, d);
return dpe_cmp (x, y);
}
/* set x to integer nearest to y */
DPE_INLINE void
dpe_round (dpe_t x, const dpe_t y)
{
if (DPE_EXP(y) < 0) /* |y| < 1/2 */
dpe_set_ui (x, 0);
else if (DPE_EXP(y) >= DPE_BITSIZE) /* y is an integer */
dpe_set (x, y);
else
{
DPE_DOUBLE d;
d = DPE_LDEXP(DPE_MANT(y), DPE_EXP(y));
dpe_set_d (x, DPE_ROUND(d));
}
}
/* set x to integer nearest to y */
DPE_INLINE void
dpe_rint (dpe_t x, const dpe_t y)
{
if (DPE_EXP(y) < 0) /* |y| < 1/2 */
dpe_set_ui (x, 0);
else if (DPE_EXP(y) >= DPE_BITSIZE) /* y is an integer */
dpe_set (x, y);
else
{
DPE_DOUBLE d;
d = DPE_LDEXP(DPE_MANT(y), DPE_EXP(y));
dpe_set_d (x, DPE_RINT(d));
}
}
/* set x to the fractional part of y, defined as y - trunc(y), thus the
fractional part has absolute value in [0, 1), and same sign as y */
DPE_INLINE void
dpe_frac (dpe_t x, const dpe_t y)
{
/* If |y| is smaller than 1, keep it */
if (DPE_EXP(y) <= 0)
dpe_set (x, y);
else if (DPE_EXP(y) >= DPE_BITSIZE) /* y is an integer */
dpe_set_ui (x, 0);
else
{
DPE_DOUBLE d;
d = DPE_LDEXP(DPE_MANT(y), DPE_EXP(y));
dpe_set_d (x, d - DPE_TRUNC(d));
}
}
/* set x to largest integer <= y */
DPE_INLINE void
dpe_floor (dpe_t x, const dpe_t y)
{
if (DPE_EXP(y) <= 0) /* |y| < 1 */
{
if (DPE_SIGN(y) >= 0) /* 0 <= y < 1 */
dpe_set_ui (x, 0);
else /* -1 < y < 0 */
dpe_set_si (x, -1);
}
else if (DPE_EXP(y) >= DPE_BITSIZE) /* y is an integer */
dpe_set (x, y);
else
{
DPE_DOUBLE d;
d = DPE_LDEXP(DPE_MANT(y), DPE_EXP(y));
dpe_set_d (x, DPE_FLOOR(d));
}
}
/* set x to smallest integer >= y */
DPE_INLINE void
dpe_ceil (dpe_t x, const dpe_t y)
{
if (DPE_EXP(y) <= 0) /* |y| < 1 */
{
if (DPE_SIGN(y) > 0) /* 0 < y < 1 */
dpe_set_ui (x, 1);
else /* -1 < y <= 0 */
dpe_set_si (x, 0);
}
else if (DPE_EXP(y) >= DPE_BITSIZE) /* y is an integer */
dpe_set (x, y);
else
{
DPE_DOUBLE d;
d = DPE_LDEXP(DPE_MANT(y), DPE_EXP(y));
dpe_set_d (x, DPE_CEIL(d));
}
}
DPE_INLINE void
dpe_swap (dpe_t x, dpe_t y)
{
DPE_EXP_T i = DPE_EXP (x);
DPE_DOUBLE d = DPE_MANT (x);
DPE_EXP (x) = DPE_EXP (y);
DPE_MANT (x) = DPE_MANT (y);
DPE_EXP (y) = i;
DPE_MANT (y) = d;
}
#endif /* FPLLL_DPE_H */
|