Skip to Content.
Sympa Menu

cado-nfs - [Cado-nfs-discuss] Problem in Sieve codes

Subject: Discussion related to cado-nfs

List archive

[Cado-nfs-discuss] Problem in Sieve codes


Chronological Thread 
  • From: Reza <gk.inst@gmail.com>
  • To: cado-nfs-discuss@lists.gforge.inria.fr
  • Subject: [Cado-nfs-discuss] Problem in Sieve codes
  • Date: Sun, 10 Nov 2013 10:03:55 +0330
  • List-archive: <http://lists.gforge.inria.fr/pipermail/cado-nfs-discuss>
  • List-id: A discussion list for Cado-NFS <cado-nfs-discuss.lists.gforge.inria.fr>

Hi dear,
I'm tracing the sieving algorithm in CADO-NFS for improving some functions.
Unfortunately, I could not understand the goal of following part of the  code; and why this part have been added to code?.
Note that, the main problem is the Bold line.

PATH: cado-nfs-1.1/sieve/las.c

Line1702:
#ifndef SSE_NORM_INIT
        uint64_t y;
        unsigned char n;
        for (i = 0; i < (int) si->I; i++) {
          /* the double precision number 1.0 has high bit 0 (sign),
             then 11-bit biased exponent 1023, and 52-bit mantissa 0 */
          /* the magic constant here is simply 1023*2^52, where
             1023 is the exponent bias in binary64 */
          y = (zx->x - (uint64_t) 0x3FF0000000000000) >> (52 - l);
          n = rat->S[y & mask];
          ASSERT (n > 0);
          *S++ = n;
          zx->z += gi;
        }
#else


Best regrads,
Ghasem



Archive powered by MHonArc 2.6.19+.

Top of Page