-
Notifications
You must be signed in to change notification settings - Fork 0
/
find_points.c
2112 lines (1784 loc) · 62.3 KB
/
find_points.c
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
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/***********************************************************************
* ratpoints-2.2.2 *
* - A program to find rational points on hyperelliptic curves *
* Copyright (C) 2008, 2009, 2022 Michael Stoll *
* *
* This program 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 of *
* the License, or (at your option) any later version. *
* *
* This program 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 version 2 of the GNU General *
* Public License along with this program. *
* If not, see <http://www.gnu.org/licenses/>. *
***********************************************************************/
/***********************************************************************
* find_points.c *
* *
* Core program file for ratpoints *
* *
* Michael Stoll, September 21, 2009, January 7, 2022 *
* with changes by Bill Allombert, Dec 29, 2021 *
***********************************************************************/
#include "rp-private.h"
#include "primes.h"
/* defines
long prime[PRIMES1000]; */
#include "find_points.h"
/* defines
static const int squares[RATPOINTS_NUM_PRIMES+1][RATPOINTS_MAX_PRIME];
squares[n][x] = 1 if x is a square mod prime[n], 0 if not
static const long offsets[RATPOINTS_NUM_PRIMES];
offset[n] = (2*LONG_LENGTH)^(-1) mod prime[n]
static const long inverses[RATPOINTS_NUM_PRIMES][RATPOINTS_MAX_PRIME];
inverses[n][x] = x^(-1) mod prime[n] for x != 0 mod prime[n]
ratpoints_bit_array sieves0[RATPOINTS_NUM_PRIMES][RATPOINTS_MAX_PRIME_EVEN]
sieves0[n][x] has bit i set (0 <= x < prime[n])
<==> x*LONG_LENGTH + i is not divisible by prime[n]
*/
#define MAX_DIVISORS 512
/* Maximal length of array for squarefree divisors of leading coefficient */
extern ratpoints_init_fun sieve_init[RATPOINTS_NUM_PRIMES];
typedef struct { double r; ratpoints_sieve_entry *ssp; } entry;
typedef struct { int p; int val; int slope; } use_squares1_info;
typedef struct { long p;
unsigned long *start;
unsigned long *end;
unsigned long *curr; }
forbidden_entry;
static const int squares16[16] = {1,1,0,0,1,0,0,0,0,1,0,0,0,0,0,0};
/* Says if a is a square mod 16, for a = 0..15 */
/**************************************************************************
* Initialization and cleanup of ratpoints_args structure *
**************************************************************************/
/* The following is needed to obtain the correct memory alignment
* when using 256-bit or 512-bit "words".
* (Added by Bill Allombert)
*/
void *pointer_align(void *xx, long m)
{
/* return the smallest address >= xx that is divisible by m */
unsigned long x = (unsigned long) xx;
long r = x % m;
if (r == 0) return xx;
return (void *) (x + m - r);
}
/* NOTE: args->degree must be set */
void find_points_init(ratpoints_args *args)
{
long work_len = 3 + (args->degree + 1);
/* allocate space for work[] */
mpz_t *work = malloc(work_len*sizeof(mpz_t));
#ifdef DEBUG
printf("\nfind_points: initialize..."); fflush(NULL);
#endif
/* and initialize the mpz_t's in it */
{ long i;
for(i = 0; i < work_len; i++) mpz_init(work[i]);
}
/* insert in args */
args->work = work;
args->work_length = work_len;
/* allocate space for se_buffer */
args->se_buffer
= (ratpoints_sieve_entry *) malloc(RATPOINTS_NUM_PRIMES
* sizeof(ratpoints_sieve_entry));
args->se_next = args->se_buffer;
/* allocate space for ba_buffer */
{ long need = 0;
long n;
/* Figure out how much space is needed for the sieving information:
* For each prime p, we need p arrays (one for each denominator mod p)
* of length p + RATPOINTS_CHUNK-1.
* (We add RATPOINTS_CHUNK-1 so that we can avoid a wrap-around in _ratpoints_sift0.)
*/
for(n = 0; n < RATPOINTS_NUM_PRIMES; n++) { need += prime[n]*(prime[n] + RATPOINTS_CHUNK-1); }
/* args->ba_buffer_na saves the start address of the block reserved by malloc,
* so that it can be freed later.
* Use need+1 to have the necessary leeway for the alignment.
*/
args->ba_buffer_na = malloc((need+1)*sizeof(ratpoints_bit_array));
args->ba_buffer = pointer_align(args->ba_buffer_na, sizeof(ratpoints_bit_array));
args->ba_next = args->ba_buffer;
}
/* allocate space for int_buffer */
args->int_buffer
= malloc(RATPOINTS_NUM_PRIMES*(RATPOINTS_MAX_PRIME+1)*sizeof(int));
args->int_next = args->int_buffer;
/* allocate sieve_list */
args->sieve_list = malloc(RATPOINTS_NUM_PRIMES
* sizeof(ratpoints_sieve_entry*));
/* allocate remaining data structures */
args->den_info = malloc((PRIMES1000+2)*sizeof(use_squares1_info));
args->divisors = malloc((MAX_DIVISORS+1)*sizeof(long));
args->forb_ba = malloc((RATPOINTS_NUM_PRIMES + 1)*sizeof(forbidden_entry));
args->forbidden = malloc((RATPOINTS_NUM_PRIMES + 1)*sizeof(long));
#ifdef DEBUG
printf("done.\n"); fflush(NULL);
#endif
return;
}
void find_points_clear(ratpoints_args *args)
{
#ifdef DEBUG
printf("\nfind_points: clean up..."); fflush(NULL);
#endif
/* clear mpz_t's in work[] */
{ long i;
mpz_t *work = args->work;
for(i = 0; i < args->work_length; i++) mpz_clear(work[i]);
}
/* free memory */
free(args->work);
free(args->se_buffer);
free(args->ba_buffer_na);
free(args->int_buffer);
free(args->sieve_list);
free(args->den_info);
free(args->divisors);
free(args->forb_ba);
free(args->forbidden);
/* clear pointer in args */
args->work = NULL; args->work_length = 0;
args->se_buffer = NULL; args->se_next = NULL;
args->ba_buffer_na = NULL;
args->ba_buffer = NULL; args->ba_next = NULL;
args->int_buffer = NULL; args->int_next = NULL;
args->sieve_list = NULL;
args->den_info = NULL; args->divisors = NULL;
args->forb_ba = NULL; args->forbidden = NULL;
#ifdef DEBUG
printf("done.\n"); fflush(NULL);
#endif
return;
}
/**************************************************************************
* Helper function: valuation of gmp-integer at a prime *
**************************************************************************/
#define VERY_BIG 1000
static long valuation(const mpz_t n, long p, long *r, mpz_t vvv)
{
long v = 0;
unsigned long rem;
mpz_abs(vvv, n);
if(mpz_cmp_ui(vvv, 0) == 0) { *r = 0; return(VERY_BIG); }
rem = mpz_fdiv_q_ui(vvv, vvv, p);
while(rem == 0)
{ v++;
rem = mpz_fdiv_q_ui(vvv, vvv, p);
}
*r = rem;
return(v);
}
/* Same for a long integer */
static long valuation1(long n, long p)
{
long v = 0;
unsigned long rem;
unsigned long qn = abs(n);
if(n == 0) { return(VERY_BIG); }
rem = qn % p;
while(rem == 0)
{ v++;
qn = qn/p;
rem = qn % p;
}
return(v);
}
/**************************************************************************
* Try to avoid divisions *
**************************************************************************/
static inline long mod(long a, long b)
{
long b1 = b << 4; /* b1 = 16*b */
if(a < -b1) { a %= b; if(a < 0) { a += b; } return(a); }
if(a < 0) { a += b1; }
else { if(a >= b1) { return(a % b); } }
b1 >>= 1; /* b1 = 8*b */
if(a >= b1) { a -= b1; }
b1 >>= 1; /* b1 = 4*b */
if(a >= b1) { a -= b1; }
b1 >>= 1; /* b1 = 2*b */
if(a >= b1) { a -= b1; }
if(a >= b) { a -= b; }
return(a);
}
/**************************************************************************
* Helper function: Jacobi symbol *
**************************************************************************/
static inline int jacobi(long b, mpz_t tmp, const mpz_t lcf)
{ /* Jacobi symbol (leading coeff/b) */
long f;
/* avoid divisions as far as possible! */
/* remove 2's from b */
while((b & 1) == 0) b >>= 1;
f = mpz_fdiv_r_ui(tmp, lcf, (unsigned long)b);
if(f == 0) return(1);
while(1)
{ long s = 1;
long n = f;
long m = b; /* m is odd, n is positive and < m */
/* looking at (n/m) */
while(!(n & 1))
{ if(m & 2) s = -s; /* change sign iff m = 3 or 5 mod 8 */
if(m & 4) s = -s;
n >>= 1;
}
while(1)
{ /* switch roles */
if(n & m & 2) s = -s; /* change sign iff m, n = 3 mod 4 */
/* now we are looking at (m/n) */
while(m > n)
{ m -= n;
do
{ if(n & 2) s = -s; /* change sign iff n = 3 or 5 mod 8 */
if(n & 4) s = -s;
m >>= 1;
}
while(!(m & 1));
}
if(m == n)
{ if(m == 1) return(s);
/* otherwise, m is the gcd of f and b; remove it from b */
b /= m; if(f >= b) f %= b;
if(f == 0) return(1);
break;
}
/* here m < n */
/* switch roles */
if(n & m & 2) s = -s; /* change sign iff m, n = 3 mod 4 */
/* now we are looking at (n/m) */
while(n > m)
{ n -= m;
do
{ if(m & 2) s = -s; /* change sign iff m = 3 or 5 mod 8 */
if(m & 4) s = -s;
n >>= 1;
}
while(!(n & 1));
}
if(m == n)
{ if(m == 1) return(s);
/* otherwise, m is the gcd of f and b; remove it from b */
b /= m; if(f >= b) f %= b;
if(f == 0) return(1);
break;
}
}
}
}
static inline int jacobi1(long b, const long lcf)
{ /* Jacobi symbol (leading coeff/b) */
long f;
int neg = 0;
/* avoid divisions as far as possible! */
/* remove 2's from b */
while((b & 1) == 0) b >>= 1;
f = lcf;
if(f < 0) { f = -f; neg = 1; }
if(b < 1UL<<(LONG_LENGTH - 4)) f = mod(f, b);
if(f == 0) return(1);
while(1)
{ long s = (neg && (b & 2)) ? -1 : 1;
long n = f;
long m = b; /* m is odd, n is positive */
/* looking at (n/m) */
while(!(n & 1))
{ if(m & 2) s = -s; /* change sign iff m = 3 or 5 mod 8 */
if(m & 4) s = -s;
n >>= 1;
}
while(1)
{ /* switch roles */
if(n & m & 2) s = -s; /* change sign iff m, n = 3 mod 4 */
/* now we are looking at (m/n) */
while(m > n)
{ m -= n;
do
{ if(n & 2) s = -s; /* change sign iff n = 3 or 5 mod 8 */
if(n & 4) s = -s;
m >>= 1;
}
while(!(m & 1));
}
if(m == n)
{ if(m == 1) return(s);
/* otherwise, m is the gcd of f and b; remove it from b */
b /= m; /* if(f >= b) f %= b; */
if(f == 0) return(1);
break;
}
/* here m < n */
/* switch roles */
if(n & m & 2) s = -s; /* change sign iff m, n = 3 mod 4 */
/* now we are looking at (n/m) */
while(n > m)
{ n -= m;
do
{ if(m & 2) s = -s; /* change sign iff m = 3 or 5 mod 8 */
if(m & 4) s = -s;
n >>= 1;
}
while(!(n & 1));
}
if(m == n)
{ if(m == 1) return(s);
/* otherwise, m is the gcd of f and b; remove it from b */
b /= m; /* if(f >= b) f %= b; */
if(f == 0) return(1);
break;
}
}
}
}
/************************************************************************
* Set up information on possible denominators *
* when polynomial is of odd degree with leading coefficient != +-1 *
************************************************************************/
static void setup_us1(ratpoints_args *args)
{
mpz_t *work = args->work; /* abs. value of leading coeff. in work[0] */
long count = 0;
unsigned long i, v;
unsigned long rem;
/* typedef struct { int p; int val; int slope; } use_squares1_info; */
use_squares1_info *den_info = (use_squares1_info *)args->den_info;
long *divisors = (long *)args->divisors;
/* find prime divisors of leading coefficient*/
/* first p = 2 */
#ifdef DEBUG
printf("\nsetup_us1: find v_2(lcf)..."); fflush(NULL);
#endif
v = mpz_scan1(work[0], 0); /* find first 1-bit ==> 2-adic valuation */
#ifdef DEBUG
printf(" = %ld\n", v); fflush(NULL);
#endif
if(v > 0)
{ /* prime divisor found; divide it off */
den_info[count].p = 2;
mpz_fdiv_q_2exp(work[0], work[0], v); /* remove power of 2 */
den_info[count].val = v;
count++;
}
for(i = 0; i < PRIMES1000 && mpz_cmp_si(work[0], 1); i++)
{ int p = prime[i];
if(mpz_cmp_si(work[0], p*p) < 0)
{ /* remaining part must be prime */
#ifdef DEBUG
printf("\nsetup_us1: remaining factor");
fflush(NULL);
#endif
if(mpz_fits_slong_p(work[0]))
{
den_info[count].p = mpz_get_si(work[0]);
den_info[count].val = 1;
#ifdef DEBUG
printf(" = %d ==> fits into a long\n", den_info[count].p);
fflush(NULL);
#endif
count++;
mpz_set_si(work[0], 1); /* divide it off */
}
#ifdef DEBUG
else
{ printf(" is too large\n"); fflush(NULL); }
#endif
break;
}
else
{
#ifdef DEBUG
printf("\nsetup_us1: find v_%d(lcf)...", p); fflush(NULL);
#endif
v = 0;
rem = mpz_fdiv_q_ui(work[1], work[0], p);
if(rem == 0)
{ /* prime divisor found; divide it off */
den_info[count].p = p;
while(rem == 0)
{ v++;
mpz_set(work[0], work[1]);
rem = mpz_fdiv_q_ui(work[1], work[0], p);
}
den_info[count].val = v;
count++;
}
#ifdef DEBUG
printf(" = %ld\n", v); fflush(NULL);
#endif
} }
#ifdef DEBUG
printf("\nsetup_us1: %ld entries in den_info\n", count); fflush(NULL);
#endif
den_info[count].p = 0; /* terminate array */
/* check if factorization is complete */
if(mpz_cmp_si(work[0], 1) == 0)
{ /* set up array of squarefree divisors */
long *div = &divisors[1];
divisors[0] = 1;
for(i = 0; i < count; i++)
{ /* multiply all divisors known so far by next prime */
long *div0 = &divisors[0];
long *div1 = div;
for( ; div0 != div1; div0++)
{ long t = *div0 * (long)den_info[i].p;
if(t <= args->b_high) { *div++ = t; }
if(div >= &divisors[MAX_DIVISORS]) { break; }
}
if(div >= &divisors[MAX_DIVISORS]) { break; }
}
if(div < &divisors[MAX_DIVISORS])
{ *div = 0; /* terminate divisors array */
/* note that we can use the information */
args->flags |= RATPOINTS_USE_SQUARES1;
/* set slopes in den_info */
#ifdef DEBUG
printf("\nsetup_us1: compute slopes...\n"); fflush(NULL);
#endif
for(i = 0; i < count; i++)
{ /* compute min{n : (d-k)*n > v_p(f_d) - v_p(f_k), k = 0,...,d-1} */
int p = den_info[i].p;
int v = den_info[i].val;
int n = 1;
int k;
mpz_t *c = args->cof;
long degree = args->degree;
for(k = degree - 1; k >= 0; k--)
{ long dummy;
int t = 1 + v - valuation(c[k], p, &dummy, work[0]);
int m = CEIL(t, (degree - k));
if(m > n) { n = m; }
}
#ifdef DEBUG
printf(" i = %ld (p = %d): slope = %d\n", i, p, n); fflush(NULL);
#endif
den_info[i].slope = n;
}
}
else
{
#ifdef DEBUG
printf("\nsetup_us1: too many divisors\n"); fflush(NULL);
#endif
}
}
else
{
#ifdef DEBUG
printf("\nsetup_us1: no complete factorization\n"); fflush(NULL);
#endif
}
return;
}
/************************************************************************
* Consider 2-adic information *
************************************************************************/
static bit_selection get_2adic_info(ratpoints_args *args,
unsigned long *den_bits,
ratpoints_bit_array *num_bits)
{
mpz_t *c = args->cof;
long degree = args->degree;
int is_f_square16[24];
long cmp[degree+1]; /* The coefficients of f reduced modulo 16 */
long npe = 0, npo = 0;
bit_selection result;
#ifdef DEBUG
printf("\nget_2adic_info: start...\n"); fflush(NULL);
#endif
/* compute coefficients mod 16 */
{ long n;
for(n = 0; n <= degree; n++) { cmp[n] = mpz_get_si(c[n]) & 0xf; }
}
/* determine if f(a) is a square mod 16, for a = 0..15 */
{ long a;
for(a = 0 ; a < 16; a++)
{ unsigned long s = cmp[degree];
long n;
for(n = degree - 1 ; n >= 0 ; n--)
{ s *= a;
s += cmp[n];
}
s &= 0xf;
if((is_f_square16[a] = squares16[s]))
{ if(a & 1) { npo++; } else { npe++; } }
} }
/* even denominators:
is_f_square16[16+k] says if f((2k+1)/2) is a square, k = 0..3
is_f_square16[20+k] says if f((2k+1)/4) is a square, k = 0,1
is_f_square16[22] says if f(odd/8) is a square
is_f_square16[23] says if f(odd/2^n), n >= 4, can be a square */
{ long np1 = 0, np2 = 0, np3 = 0, np4 = 0;
if(degree & 1)
{ long cf = 4*cmp[degree-1];
long a;
if(degree >= 2) { cf += 8*cmp[degree-2]; }
for(a = 0; a < 4; a++)
{ /* Compute 2 c[d] k^d + 4 c[d-1] k^(d-1) + 8 c[d-2] k^(d-2), k = 2a+1.
Note that k^d = k mod 8, k^(d-1) = 1 mod 8. */
long k = 2*a+1;
long s = (2*k*cmp[degree] + cf) & 0xf;
if((is_f_square16[16+a] = squares16[s])) { np1++; }
}
if((is_f_square16[20] = squares16[(4*cmp[degree]) & 0xf])) { np2++; }
if((is_f_square16[21] = squares16[(12*cmp[degree]) & 0xf])) { np2++; }
if((is_f_square16[22] = squares16[(8*cmp[degree]) & 0xf])) { np3++; }
is_f_square16[23] = 1; np4++;
}
else
{ long cf = (degree >= 2) ? 4*cmp[degree-2] : 0;
long a;
if(degree >= 3) { cf += 8*cmp[degree-3]; }
for(a = 0; a < 4; a++)
{ /* compute c[d] k^d + 2 c[d-1] k^(d-1) + ... + 8 c[d-3] k^(d-3),
k = 2a+1.
Note that k^d = k^2 mod 16, k^(d-1) = k mod 8. */
long k = 2*a+1;
long s = ((cmp[degree]*k + 2*cmp[degree-1])*k + cf) & 0xf;
if((is_f_square16[16+a] = squares16[s])) { np1++; }
}
if((is_f_square16[20] = squares16[(cmp[degree]+4*cmp[degree-1]) & 0xf]))
{ np2++; }
if((is_f_square16[21] = squares16[(cmp[degree]+12*cmp[degree-1]) & 0xf]))
{np2++; }
if((is_f_square16[22] = squares16[(cmp[degree]+8*cmp[degree-1]) & 0xf]))
{np3++; }
if((is_f_square16[23] = squares16[cmp[degree]]))
{ np4++; }
}
#ifdef DEBUG
printf("\nis_f_square16 :\n[");
{ long a;
for(a = 0; a < 23; a++) { printf("%d,", is_f_square16[a]); }
printf("%d]\n", is_f_square16[23]);
}
fflush(NULL);
#endif
/* set den_bits */
{ unsigned long db = 0;
long i;
if(npe + npo > 0) { db |= 0xaaaaUL; }
/* odd denominators */
if(np1 > 0) { db |= 0x4444UL; }
/* v_2(den) = 1 */
if(np2 > 0) { db |= 0x1010UL; }
/* v_2(den) = 2 */
if(np3 > 0) { db |= 0x0100UL; }
/* v_2(den) = 3 */
if(np4 > 0) { db |= 0x0001UL; }
/* v_2(den) >= 4 */
if(db == 0) { *den_bits = 0UL; return(num_none); }
for(i = 16; i < LONG_LENGTH; i <<= 1) { db |= db << i; }
#ifdef DEBUG
printf("\nden_bits: %*.*lx\n", WIDTH, WIDTH, db);
fflush(NULL);
#endif
*den_bits = db;
}
/* determine result */
result = (npe == 0) ? ((npo == 0) ? num_none : num_odd)
: ((npo == 0) ? num_even : num_all);
}
{ /* set up num_bits[16] */
long b;
/* odd denominators */
switch(result)
{ case num_all:
for(b = 1; b < 16; b += 2)
{ unsigned long work = 0;
unsigned long bit = 1;
long i;
long invb = b; /* inverse of b mod 16 */
if(b & 2) invb ^= 8;
if(b & 4) invb ^= 8;
for(i = 0; i < 16; i++)
{ if(is_f_square16[(invb*i) & 0xf]) { work |= bit; }
bit <<= 1;
}
/* now repeat the 16 bits */
for(i = 16; i < LONG_LENGTH; i <<= 1) { work |= work << i; }
num_bits[b] = RBA(work);
}
break;
case num_odd:
for(b = 1; b < 16; b += 2)
{ unsigned long work = 0;
unsigned long bit = 1;
long i;
long invb = b; /* inverse of b mod 16 */
if(b & 2) invb ^= 8;
if(b & 4) invb ^= 8;
for(i = 1; i < 16; i += 2)
{ if(is_f_square16[(invb*i) & 0xf]) { work |= bit; }
bit <<= 1;
}
/* now repeat the 8 bits */
for(i = 8; i < LONG_LENGTH; i <<= 1) { work |= work << i; }
num_bits[b] = RBA(work);
}
break;
case num_even:
for(b = 1; b < 16; b += 2)
{ unsigned long work = 0;
unsigned long bit = 1;
long i;
long invb = b; /* inverse of b mod 16 */
if(b & 2) invb ^= 8;
if(b & 4) invb ^= 8;
for(i = 0; i < 16; i += 2)
{ if(is_f_square16[(invb*i) & 0xf]) { work |= bit; }
bit <<= 1;
}
/* now repeat the 8 bits */
for(i = 8; i < LONG_LENGTH; i <<= 1) { work |= work << i; }
num_bits[b] = RBA(work);
}
break;
case num_none:
for(b = 1; b < 16; b += 2) { num_bits[b] = zero; }
}
/* v_2(den) = 1 : only odd numerators */
for(b = 1; b < 8; b += 2)
{ unsigned long work;
unsigned long bit;
long i;
work = 0; bit = 1;
for(i = 1; i < 16; i += 2)
{ if(is_f_square16[16 + (((b*i)>>1) & 0x3)]) { work |= bit; }
bit <<= 1;
}
/* now repeat the 8 bits */
for(i = 8; i < LONG_LENGTH; i <<= 1) { work |= work << i; }
num_bits[2*b] = RBA(work);
}
/* v_2(den) = 2 : only odd numerators */
for(b = 1; b < 4; b += 2)
{ unsigned long work = 0;
unsigned long bit = 1;
long i;
work = 0; bit = 1;
for(i = 1; i < 8; i += 2)
{ if(is_f_square16[20 + (((b*i)>>1) & 0x1)]) { work |= bit; }
bit <<= 1;
}
/* now repeat the 4 bits */
for(i = 4; i < LONG_LENGTH; i <<= 1) { work |= work << i; }
num_bits[4*b] = RBA(work);
}
/* v_2(den) = 3, >= 4 : only odd numerators */
num_bits[8] = (is_f_square16[22]) ? RBA(~(0UL)) : zero;
num_bits[0] = (is_f_square16[23]) ? RBA(~(0UL)) : zero;
}
#ifdef DEBUG
printf("\nget_2adic_info: done.\n"); fflush(NULL);
#endif
return(result);
}
/**************************************************************************
* This is a comparison function needed for sorting in order to determine *
* the `best' primes for sieving. *
**************************************************************************/
static int compare_entries(const void *a, const void *b)
{
double diff = (((entry *)a)->r - ((entry *)b)->r);
return (diff > 0) ? 1 : (diff < 0) ? -1 : 0;
}
/************************************************************************
* Collect the sieving information *
************************************************************************/
static long sieving_info(ratpoints_args *args,
int use_c_long, long *c_long,
ratpoints_sieve_entry **sieve_list)
/* This function either returns a prime p;
* in this case, the curve has no points mod p, hence no rational points;
* or else returns 0. */
{
mpz_t *c = args->cof;
long degree = args->degree;
long fba = 0;
long fdc = 0;
long pn;
long pnp = 0;
entry prec[RATPOINTS_NUM_PRIMES];
/* This array is used for sorting in order to
determine the `best' sieving primes. */
forbidden_entry *forb_ba = (forbidden_entry *)args->forb_ba;
long *forbidden = (long *)args->forbidden;
/* initialize sieve in se_buffer */
for(pn = 0; pn < args->num_primes; pn++)
{ long coeffs_mod_p[degree+1];
/* The coefficients of f reduced modulo p */
long p = prime[pn];
long n, a, np; /* np counts the x-coordinates that give points mod p */
int *is_f_square = args->int_next;
args->int_next += p + 1; /* need space for (p+1) int's */
#ifdef DEBUG
printf("\nsieving_info: p = %ld\n", p);
fflush(NULL);
#endif
/* compute coefficients mod p */
if(use_c_long)
{ for(n = 0; n <= degree; n++)
{ coeffs_mod_p[n] = mod(c_long[n], p); }
}
else
{ for(n = 0; n <= degree; n++)
{ coeffs_mod_p[n] = mpz_fdiv_r_ui(args->work[0], c[n], p); }
}
/* Determine the x-coords a mod p such that f(a) is a square mod p. */
np = squares[pn][coeffs_mod_p[0]]; /* for a = 0, f(a) = constant term */
is_f_square[0] = np;
for(a = 1 ; a < p; a++)
{ unsigned long s = coeffs_mod_p[degree];
/* try to avoid divisions (by p) */
if((degree+1)*RATPOINTS_MAX_BITS_IN_PRIME <= LONG_LENGTH)
{ for(n = degree - 1 ; n >= 0 ; n--)
{ s *= a; s += coeffs_mod_p[n]; }
/* here, s < p^(degree+1) <= max. long */
s %= p;
}
else
{ for(n = degree - 1 ; n >= 0 ; n--)
{ s *= a; s += coeffs_mod_p[n];
if(s+1 >= (1UL)<<(LONG_LENGTH - RATPOINTS_MAX_BITS_IN_PRIME))
{ s %= p; }
}
s %= p;
}
if((is_f_square[a] = squares[pn][s])) { np++; }
}
/* last entry says if there are points at infinity mod p */
is_f_square[p] = (degree & 1) || squares[pn][coeffs_mod_p[degree]];
#ifdef DEBUG
printf("\nis_f_square(p = %ld) : \n[", p);
{ long a;
for(a = 0; a < p; a++) { printf("%d,", is_f_square[a]); }
printf("%d]\n", is_f_square[p]);
}
fflush(NULL);
#endif
/* check if there are no solutions mod p */
if(np == 0 && !is_f_square[p])
{
return(p); /* if yes, return p --> no rational points */
}
/* Fill arrays with info for p */
if(np < p)
{ /* only when there is some information */
{ double r = is_f_square[p] ? ((double)(np*(p-1) + p))/((double)(p*p))
: (double)np/(double)p;
prec[pnp].r = r;
}
/* set up sieve_entry :
typedef struct
{ ratpoints_init_fun init; long p; int *is_f_square; int *inverses;
long offset; (ratpoints_bit_array *)sieve[RATPOINTS_MAX_PRIME]; }
ratpoints_sieve_entry;
*/
{ ratpoints_sieve_entry *se = (ratpoints_sieve_entry *)args->se_next;
long i;
args->se_next += sizeof(ratpoints_sieve_entry);
/* one entry must be stored - note that se_next is of type void* */
se->init = sieve_init[pn];
se->p = p;
se->is_f_square = is_f_square;
se->inverses = &inverses[pn][0];
se->offset = offsets[pn];
se->sieve[0] = (ratpoints_bit_array *)&sieves0[pn][0];
for(i = 1; i < p; i++) { se->sieve[i] = NULL; }
prec[pnp].ssp = se;
}
pnp++;
}
if((args->flags & RATPOINTS_CHECK_DENOM)
&& fba + fdc < args->max_forbidden
&& !is_f_square[p])
{ /* record forbidden divisors of the denominator */
if(coeffs_mod_p[degree] == 0)
{ /* leading coeff. divisible by p */
long r;
long v = valuation(c[degree], p, &r, args->work[0]);
if((v & 1) || !squares[pn][r])
{ /* Can only get something when valuation is odd
or when valuation is even and lcf is not a p-adic square.
Compute smallest n such that if v(den) >= n, the leading
term determines the valuation. Then we must have v(den) < n. */
long n = 1;
long k, pp;
for(k = degree-1; k >= 0; k--)
{ if(coeffs_mod_p[k] == 0)
{ long dummy;
long t = 1 + v - valuation(c[k], p, &dummy, args->work[0]);
long m = CEIL(t, (degree-k));
if(m > n) { n = m; }
} }
if(n == 1)
{ forb_ba[fba].p = p;
forb_ba[fba].start = &sieves0[pn][0];
forb_ba[fba].end = &sieves0[pn][p];
forb_ba[fba].curr = forb_ba[fba].start;
fba++;
pp = p;
}
else
{ for(pp = 1; n; n--) { pp *= p; } /* p^n */
forbidden[fdc] = pp; fdc++;
}
#ifdef DEBUG
printf("\nexcluding denominators divisible by %ld\n", pp);
fflush(NULL);
#endif
}
}
else /* leading coefficient is a non-square mod p */
{ /* denominator divisible by p is excluded */
forb_ba[fba].p = p;
forb_ba[fba].start = &sieves0[pn][0];
forb_ba[fba].end = &sieves0[pn][p];
forb_ba[fba].curr = forb_ba[fba].start;
fba++;