/* Auxiliary routines for the ecm library. Copyright 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2011 Paul Zimmermann, Alexander Kruppa. This file is part of the ECM Library. The ECM 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 3 of the License, or (at your option) any later version. The ECM 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 ECM Library; see the file COPYING.LIB. If not, see http://www.gnu.org/licenses/ or write to the Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ /* need stdio.h and stdarg.h for gmp.h to declare gmp_vfprintf */ #include #include #include #include "ecm-impl.h" #if HAVE_SYS_TIME_H # include #endif #include #ifdef HAVE_LIMITS_H # include #else # ifndef ULONG_MAX # define LONG_MAX (__GMP_ULONG_MAX / 2) # endif #endif #ifdef HAVE_STDINT #include #else /* size_t is an unsigned integer so this ought to work */ #ifndef SIZE_MAX #define SIZE_MAX (~((size_t) 0)) #endif #endif #define VERBOSE __ECM(verbose) static int VERBOSE = OUTPUT_NORMAL; void mpz_add_si (mpz_t r, mpz_t s, long i) { if (i >= 0) mpz_add_ui (r, s, (unsigned long) i); else mpz_sub_ui (r, s, (unsigned long) (-i)); } void mpz_sub_si (mpz_t r, mpz_t s, long i) { if (i >= 0) mpz_sub_ui (r, s, (unsigned long) i); else mpz_add_ui (r, s, (unsigned long) (-i)); } /* Divide RS by 3 */ void mpz_divby3_1op (mpz_t RS) { mp_size_t abssize = mpz_size (RS); if (abssize == 0) return; mpn_divexact_by3 (RS->_mp_d, RS->_mp_d, abssize); if (RS->_mp_d[abssize - 1] == 0) RS->_mp_size -= mpz_sgn (RS); } /* Convert a double d to a size_t. Assumes d >= 0. If d > SIZE_MAX, returns SIZE_MAX. */ size_t double_to_size (double d) { ASSERT(d >= 0.0); return (d > (double) SIZE_MAX) ? SIZE_MAX : (size_t) d; } /* cputime () gives the elapsed time in milliseconds */ #if defined (_WIN32) /* First case - GetProcessTimes () is the only known way of getting process * time (as opposed to calendar time) under mingw32 */ #include long cputime () { FILETIME lpCreationTime, lpExitTime, lpKernelTime, lpUserTime; ULARGE_INTEGER n; HANDLE hProcess = GetCurrentProcess(); GetProcessTimes (hProcess, &lpCreationTime, &lpExitTime, &lpKernelTime, &lpUserTime); /* copy FILETIME to a ULARGE_INTEGER as recommended by MSDN docs */ n.u.LowPart = lpUserTime.dwLowDateTime; n.u.HighPart = lpUserTime.dwHighDateTime; /* lpUserTime is in units of 100 ns. Return time in milliseconds */ return (long) (n.QuadPart / 10000); } #elif defined (HAVE_GETRUSAGE) /* Next case: getrusage () has higher resolution than clock () and so is preferred. */ #ifdef HAVE_SYS_TYPES_H # include #endif #ifdef HAVE_SYS_RESOURCE_H # include #endif long cputime (void) { struct rusage rus; getrusage (RUSAGE_SELF, &rus); /* This overflows a 32 bit signed int after 2147483s = 24.85 days */ return rus.ru_utime.tv_sec * 1000L + rus.ru_utime.tv_usec / 1000L; } #else /* Resort to clock (), which on some systems may return calendar time. */ long cputime (void) { /* Return time in milliseconds */ return (long) (clock () * (1000. / (double) CLOCKS_PER_SEC)); } #endif /* defining cputime () */ /* ellapsed time (in milliseconds) between st0 and st1 (values of cputime) */ long elltime (long st0, long st1) { return st1 - st0; /* assumes no wrap around */ } /* Get real (wall-clock) time in milliseconds */ long realtime (void) { #ifdef HAVE_GETTIMEOFDAY struct timeval tv; int ret = gettimeofday (&tv, NULL); ASSERT_ALWAYS(ret == 0); /* if HAVE_GETTIMEOFDAY, it should be functional */ return (long) tv.tv_sec * 1000L + (long) tv.tv_usec / 1000L; #else return 0L; #endif } /* Tests if loglevel gets printed with the current verbose setting */ int test_verbose (int loglevel) { return (loglevel <= VERBOSE); } void set_verbose (int v) { VERBOSE = v; } int outputf (int loglevel, const char *format, ...) { va_list ap; int n = 0; va_start (ap, format); if (loglevel != OUTPUT_ERROR && loglevel <= VERBOSE) { n = gmp_vfprintf (ECM_STDOUT, format, ap); fflush (ECM_STDOUT); } else if (loglevel == OUTPUT_ERROR) n = gmp_vfprintf (ECM_STDERR, format, ap); va_end (ap); return n; } /* for P-1 and P+1 we have A = y = z = NULL */ void writechkfile (char *chkfilename, int method, double p, mpmod_t modulus, mpres_t A, mpres_t x, mpres_t y, mpres_t z) { FILE *chkfile; char *methodname; mpz_t t; outputf (OUTPUT_VERBOSE, "Writing checkpoint to %s at p = %.0f\n", chkfilename, p); switch (method) { case ECM_ECM : methodname = "ECM"; break; case ECM_PM1 : methodname = "P-1"; break; case ECM_PP1 : methodname = "P+1"; break; default: outputf (OUTPUT_ERROR, "writechkfile: Invalid method\n"); return; } chkfile = fopen (chkfilename, "w"); ASSERT_ALWAYS(chkfile != NULL); mpz_init (t); gmp_fprintf (chkfile, "METHOD=%s; B1=%.0f; N=%Zd;", methodname, p, modulus->orig_modulus); mpres_get_z (t, x, modulus); gmp_fprintf (chkfile, " X=0x%Zx;", t); if (method == ECM_ECM) { if (y != NULL) /* this should mean Weierstrass form */ { /* actually, we want to print (x:y:1) */ mpres_get_z (t, y, modulus); gmp_fprintf (chkfile, " Y=0x%Zx;", t); fprintf (chkfile, " Z=0x1;"); } else /* one day, we could have some homogeneous form to deal with */ { mpres_get_z (t, z, modulus); gmp_fprintf (chkfile, " Z=0x%Zx;", t); } mpres_get_z (t, A, modulus); gmp_fprintf (chkfile, " A=0x%Zx;", t); } fprintf (chkfile, "\n"); mpz_clear (t); fflush (chkfile); fclose (chkfile); } #if 0 /* currently unused (only used in listz_handle.c, currently inactive) */ int aux_fseek64(FILE *f, const int64_t offset, const int whence) { #ifdef HAVE__FSEEKI64 return _fseeki64(f, offset, whence); #endif #if LONG_MAX == INT64_MAX return fseek (f, (long) offset, whence); #endif ASSERT_ALWAYS (offset <= LONG_MAX); return fseek (f, (long) offset, whence); } #endif int ecm_tstbit (mpz_srcptr u, ecm_uint bit_index) { mp_srcptr u_ptr = PTR(u); ecm_int size = SIZ(u); ecm_uint abs_size = ABS(size); ecm_uint limb_index = bit_index / GMP_NUMB_BITS; mp_srcptr p = u_ptr + limb_index; mp_limb_t limb; if (limb_index >= abs_size) return (size < 0); limb = *p; if (size < 0) { limb = -limb; /* twos complement */ while (p != u_ptr) { p--; if (*p != 0) { limb--; /* make it a ones complement instead */ break; } } } return (limb >> (bit_index % GMP_NUMB_BITS)) & 1; }