Tcl Source Code

Check-in [a0a32b3e13]
Login
Bounty program for improvements to Tcl and certain Tcl packages.
Tcl 2019 Conference, Houston/TX, US, Nov 4-8
Send your abstracts to [email protected]
or submit via the online form by Sep 9.

Many hyperlinks are disabled.
Use anonymous login to enable hyperlinks.

Overview
Comment:Eliminate use of int32_t (doesn't work on MSVC++ 6.0)
Downloads: Tarball | ZIP archive | SQL archive
Timelines: family | ancestors | libtommath-no-stdint.h
Files: files | file ages | folders
SHA3-256:a0a32b3e1381388acc94b4a4d109431c658fa9d4a98d6cff39eefc5b4f573c01
User & Date: jan.nijtmans 2019-04-10 20:07:15
Context
2019-04-10
20:07
Eliminate use of int32_t (doesn't work on MSVC++ 6.0) Leaf check-in: a0a32b3e13 user: jan.nijtmans tags: libtommath-no-stdint.h
2019-04-05
17:00
Merge libtommath check-in: 1346329282 user: jan.nijtmans tags: libtommath-no-stdint.h
Changes
Hide Diffs Unified Diffs Ignore Whitespace Patch

Changes to libtommath/bn_mp_prime_strong_lucas_selfridge.c.

76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
     Pentium (P5x, I think) Intel processor)
*/
int mp_prime_strong_lucas_selfridge(const mp_int *a, int *result)
{
   /* CZ TODO: choose better variable names! */
   mp_int Dz, gcd, Np1, Uz, Vz, U2mz, V2mz, Qmz, Q2mz, Qkdz, T1z, T2z, T3z, T4z, Q2kdz;
   /* CZ TODO: Some of them need the full 32 bit, hence the (temporary) exclusion of MP_8BIT */
   int32_t D, Ds, J, sign, P, Q, r, s, u, Nbits;
   int e;
   int isset, oddness;

   *result = MP_NO;
   /*
   Find the first element D in the sequence {5, -7, 9, -11, 13, ...}
   such that Jacobi(D,N) = -1 (Selfridge's algorithm). Theory






|







76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
     Pentium (P5x, I think) Intel processor)
*/
int mp_prime_strong_lucas_selfridge(const mp_int *a, int *result)
{
   /* CZ TODO: choose better variable names! */
   mp_int Dz, gcd, Np1, Uz, Vz, U2mz, V2mz, Qmz, Q2mz, Qkdz, T1z, T2z, T3z, T4z, Q2kdz;
   /* CZ TODO: Some of them need the full 32 bit, hence the (temporary) exclusion of MP_8BIT */
   int D, Ds, J, sign, P, Q, r, s, u, Nbits;
   int e;
   int isset, oddness;

   *result = MP_NO;
   /*
   Find the first element D in the sequence {5, -7, 9, -11, 13, ...}
   such that Jacobi(D,N) = -1 (Selfridge's algorithm). Theory