From: Sam C. <tri...@us...> - 2005-06-18 20:44:04
|
Update of /cvsroot/ggnfs/branch_0/src/lasieve4 In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv1652/src/lasieve4 Modified Files: gnfs-lasieve4e.c Log Message: - Fixed typo in error message in the lattice siever. factLat.pl changes: - Applied Makoto Kamada's patch to suppress warnings in Miller-Rabin code if the Perl interpreter does not support 64-bit integers. - If M, Y1, and Y0 are all specified in the .poly file, the script will now properly use Y1 and Y0 to calculate the SNFS difficulty. It will also properly handle negative evaluated polynomial values. - Added much more paranoia in polynomial checking in the Perl script. It can be disabled by setting $CHECK_POLY to 0. - Added support for lattice sieving on the rational side. This is controlled by the $LATSIEVE_SIDE setting. - Added some interesting information to the summary file. - Add client id to $PNUM, so if multiple clients are lattice sieving in the same directory, they don't all write to the same .last_spq* file. - Added Geoffrey Reynold's fix for bug when classical sieving is not done in multi-client mode. - Fixed runPol5() so it tolerates abnormal exits in the polynomial search programs. Index: gnfs-lasieve4e.c =================================================================== RCS file: /cvsroot/ggnfs/branch_0/src/lasieve4/gnfs-lasieve4e.c,v retrieving revision 1.1.1.1 retrieving revision 1.2 diff -C2 -d -r1.1.1.1 -r1.2 *** gnfs-lasieve4e.c 8 Jun 2005 19:47:05 -0000 1.1.1.1 --- gnfs-lasieve4e.c 18 Jun 2005 20:43:55 -0000 1.2 *************** *** 3177,3181 **** } if (FB_bound[special_q_side] > first_spq) { ! complain("Special q lower bound %u below rFB bound %g\n", first_spq, FB_bound[special_q_side]); } --- 3177,3181 ---- } if (FB_bound[special_q_side] > first_spq) { ! complain("Special q lower bound %u below FB bound %g\n", first_spq, FB_bound[special_q_side]); } |