//$Header: /cvsroot/esrg/sfesrg/esrgnxpj/sfnthcgi0304/subfunc_gmp_prob_prime.c,v 1.4 2003/07/01 03:46:58 dtashley Exp $
//
//********************************************************************************
//Copyright (C) 2003 David T. Ashley
//********************************************************************************
//This program or source file 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 or source file 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 may have received a copy of the GNU General Public License
//along with this program; if not, write to the Free Software
//Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
//********************************************************************************
//
//This module uses the GMP libary function:
//
//   mpz_probab_prime_p()
//
//To make a probabilistic assessment of whether an integer is most likely
//prime, definitely composite, etc.  This module is just a direct interface
//to the GMP function cited above.
//
//INPUT PARAMETERS
//----------------
//The subfunction accepts two parameters, the integers whose primality is to be
//assessed, and the number of reps (passed directly to the GMP function).  
//Naturally, the integers should be positive.  Invalid integers are assigned
//defaults.  It is the responsibility of the calling script to do whatever
//sanity checking is desired.
//
//OUTPUT RESULTS
//--------------
//The notation below gives the outputs of the program.  In some cases, [i] notation
//is used to indicate line numbers.
//
//[01] An overall success or failure code for the operation.  Valid responses
//     are:
//        S      :  Success (for this subfunction, the only possible outcome).
//
//[02] The fully normalized first integer entered.  This means it has been
//     stripped of all weird characters, etc., and also perhaps assigned
//     a default value if the original parameter wasn't acceptable.
//     This can be used by the PHP script to repopulate form boxes.
//[03] The fully normalized second integer entered.
//[04] The output from the GMP function.  Semantics are:
//         2  -- definitely prime.
//         1  -- probably prime.
//         0  -- definitely composite.
//[05] "S", indicating success.
//
//Note that this subfunction will always return exactly five lines,
//and the first and last line will be "S".
//
//The return value (exit code) from this subfunction is always 0.
// 

#define MODULE_SUBFUNC_GMP_PROB_PRIME

#include <assert.h>
#include <ctype.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>

#include <gmp.h>

#include "auxfuncs.h"
#include "subfunc_gmp_prob_prime.h"


int SUBFUNC_GMP_PROB_PRIME_main(int argc, char *argv[])
   {
   //Normalized first and second parameters (the integers).
   char *arg1;
   char *arg2;

   //GMP types to maintain the algorithm.
   int nreps_native;
   mpz_t number_to_test, nreps_mpz;

   //Result from the GMP.
   int gmp_result;

   //There must be an acceptable number of command-line arguments.   If not,
   //abort the progam with phony data.
   if (argc != 4)
      {
      printf("S\n2\n5\n2\nS\n");
      return(0);
      }

   //Copy the command-line arguments to a safe place where we can manipulate them.  
   //Leave 2 characters of space in case we assign a "0".
   arg1 = (char *)malloc((AUXFUNCS_size_t_max(1, strlen(argv[2])) + 1) * sizeof(char));
   arg2 = (char *)malloc((AUXFUNCS_size_t_max(1, strlen(argv[3])) + 1) * sizeof(char));
   if ((arg1 == NULL) || (arg2 == NULL))
      {
      printf("S\n2\n5\n2\nS\n");
      return(0);
      }
   strcpy(arg1, argv[2]);
   strcpy(arg2, argv[3]);

   //Strip all of the non-digit trash out of the arguments.
   AUXFUNCS_remove_non_digits(arg1);
   AUXFUNCS_remove_non_digits(arg2);

   //Remove all leading zeros from both arguments.
   AUXFUNCS_remove_leading_zeros(arg1);
   AUXFUNCS_remove_leading_zeros(arg2);

   //If either argument is zero length, fill it in with 0.
   if (!strlen(arg1))
      strcpy(arg1, "0");
   if (!strlen(arg2))
      strcpy(arg2, "0");

   //We are not allowed to have 0's in this function, so
   //abort on zeros.  Also, we can't have 1 for a number to check,
   //as 1 is neither prime nor composite.
   if ((!strcmp(arg1, "0")) || (!strcmp(arg2, "0")) || (!strcmp(arg1, "1")))
      {
      printf("S\n2\n5\n2\nS\n");
      return(0);
      }

   //If either argument exceeds 10000 digits, abort.
   if ((strlen(arg1)>10000) || (strlen(arg2) > 10000))
      {
      printf("S\n2\n5\n2\nS\n");
      return(0);
      }

   //Initialize all of the GMP variables.
   mpz_init(number_to_test);
   mpz_init(nreps_mpz);

   //Assign a and b to initial values.
   mpz_set_str(number_to_test, arg1, 10);
   mpz_set_str(nreps_mpz,      arg2, 10);

   //We don't want to allow any more than 5000 repetitions for that 
   //parameter.  So, if it is larger than 5000, whack it down.
   if (mpz_cmp_d(nreps_mpz, (double)5000) > 0)
      mpz_set_str(nreps_mpz, "5000", 10);

   //Extract the arbitrary length value of the number of reps into
   //a normal integer.
   nreps_native = mpz_get_si(nreps_mpz);

   //Run the GMP library function to guess at primality and get the result 
   //back.
   gmp_result = mpz_probab_prime_p(number_to_test, nreps_native);

   //Now, write the output block.
   printf("S\n");
   mpz_out_str(stdout, 10, number_to_test); 
   printf("\n");     
   mpz_out_str(stdout, 10, nreps_mpz); 
   printf("\n");
   printf("%d\n", gmp_result);
   printf("S\n");

   //Always return 0.
   return(0);
   } 

//********************************************************************************
// $Log: subfunc_gmp_prob_prime.c,v $
// Revision 1.4  2003/07/01 03:46:58  dtashley
// Edits towards working continued fraction best rational approximation
// functionality.
//
// Revision 1.3  2003/04/17 20:02:05  dtashley
// License text for the GPL added.  All source files are now under the GPL,
// after some discussion on the GMP list.
//
// Revision 1.2  2003/04/14 23:27:01  dtashley
// Subfunction GMP_PROB_PRIME finished.
//
// Revision 1.1  2003/04/14 22:35:23  dtashley
// Initial checkin.
//********************************************************************************
// End of SUBFUNC_GMP_PROB_PRIME.C.
//********************************************************************************