OpenGrok

45   2. Separate sieving with primes p < SIEVESIZE and p >= SIEVESIZE.  The latter
48   3. For primes p >= SIEVESIZE, i.e., typically the majority of primes, we
76   if (sp != ps->s + SIEVESIZE)
86       ps->s0 = 3 - 2 * SIEVESIZE; /* Tricky */
93   for (sp = ps->s; sp < ps->s + SIEVESIZE; sp++)
96   memset (ps->s, 0, SIEVESIZE);
99   ps->s0 += 2 * SIEVESIZE;
102   while ((ps->sqrt_s0 + 1) * (ps->sqrt_s0 + 1) <= ps->s0 + 2 * SIEVESIZE - 1)
111   while (sp < ps->s + SIEVESIZE)
122   while (sp < ps->s + SIEVESIZE)
133   while (sp < ps->s + SIEVESIZE)
148       while (sp < ps->s + SIEVESIZE)
164   ps->d = SIEVESIZE;
165   ps->s[SIEVESIZE] = 0;		/* sentinel */

Indexes created Fri Jun 26 00:24:39 UTC 2026