/*=============================================================================

    This file is part of FLINT.

    FLINT 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.

    FLINT 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 the GNU General Public License
    along with FLINT; if not, write to the Free Software
    Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA

=============================================================================*/
/******************************************************************************

    Copyright (C) 2009 William Hart

******************************************************************************/

#include <stdio.h>
#include <stdlib.h>
#include <gmp.h>
#include "flint.h"
#include "ulong_extras.h"

int main(void)
{
   int i, j, result;
   ulong count = UWORD(0);
   FLINT_TEST_INIT(state);
   
   flint_printf("is_strong_probabprime_precomp....");
   fflush(stdout);

   

   for (i = 0; i < 100 * flint_test_multiplier(); i++) /* Test that primes pass the test */
   {
      mp_limb_t a, d, norm;
      mpz_t d_m;
      double dpre;
      mp_limb_t bits = n_randint(state, FLINT_D_BITS-1) + 2;

      mpz_init(d_m);

      do
      {
         d = n_randbits(state, bits) | 1;
         flint_mpz_set_ui(d_m, d);
         mpz_nextprime(d_m, d_m);
         d = flint_mpz_get_ui(d_m);
      } while (FLINT_BIT_COUNT(d) > FLINT_D_BITS);
      if (d == UWORD(2)) d++;
         
      for (j = 0; j < 100; j++)
      {
         do a = n_randint(state, d);
         while (a == UWORD(0));
      
         dpre = n_precompute_inverse(d);
         count_trailing_zeros(norm, d - 1);
         result = n_is_strong_probabprime_precomp(d, dpre, a, (d - 1)>>norm);

         if (!result)
         {
            flint_printf("FAIL:\n");
            flint_printf("a = %wu, d = %wu\n", a, d); 
            abort();
         }
      }

      mpz_clear(d_m);
   }

   for (i = 0; i < 100 * flint_test_multiplier(); i++) /* Test that not too many composites pass */
   {
      mp_limb_t a, d, norm;
      mpz_t d_m;
      double dpre;
      mp_limb_t bits = n_randint(state, FLINT_D_BITS-3) + 4;

      mpz_init(d_m);

      do
      {
         d = n_randbits(state, bits) | 1;
         flint_mpz_set_ui(d_m, d);
      } while (mpz_probab_prime_p(d_m, 12));

      for (j = 0; j < 100; j++)
      {
         do a = n_randint(state, d);
         while (a == UWORD(0));
      
         dpre = n_precompute_inverse(d);
         count_trailing_zeros(norm, d - 1);
         result = !n_is_strong_probabprime_precomp(d, dpre, a, (d - 1)>>norm);

         if (!result) count++;
      }

      mpz_clear(d_m);
   }

   if (count > 220 * flint_test_multiplier()) 
   {
      flint_printf("FAIL:\n");
      flint_printf("count = %wu\n", count);
      abort();
   }

   FLINT_TEST_CLEANUP(state);
   
   flint_printf("PASS\n");
   return 0;
}
