Merge trunkz_modifier

1 files changed, 18 insertions, 18 deletions

diff --git a/libtommath/bn_mp_prime_is_divisible.c b/libtommath/bn_mp_prime_is_divisible.c
index eea4a27..c1e1158 100644
--- a/libtommath/bn_mp_prime_is_divisible.c
+++ b/libtommath/bn_mp_prime_is_divisible.c
@@ -15,33 +15,33 @@
  * Tom St Denis, tstdenis82@gmail.com, http://libtom.org
  */
 
-/* determines if an integers is divisible by one 
+/* determines if an integers is divisible by one
  * of the first PRIME_SIZE primes or not
  *
  * sets result to 0 if not, 1 if yes
  */
-int mp_prime_is_divisible (mp_int * a, int *result)
+int mp_prime_is_divisible(const mp_int *a, int *result)
 {
-  int     err, ix;
-  mp_digit res;
+   int     err, ix;
+   mp_digit res;
 
-  /* default to not */
-  *result = MP_NO;
+   /* default to not */
+   *result = MP_NO;
 
-  for (ix = 0; ix < PRIME_SIZE; ix++) {
-    /* what is a mod LBL_prime_tab[ix] */
-    if ((err = mp_mod_d (a, ltm_prime_tab[ix], &res)) != MP_OKAY) {
-      return err;
-    }
+   for (ix = 0; ix < PRIME_SIZE; ix++) {
+      /* what is a mod LBL_prime_tab[ix] */
+      if ((err = mp_mod_d(a, ltm_prime_tab[ix], &res)) != MP_OKAY) {
+         return err;
+      }
 
-    /* is the residue zero? */
-    if (res == 0) {
-      *result = MP_YES;
-      return MP_OKAY;
-    }
-  }
+      /* is the residue zero? */
+      if (res == 0) {
+         *result = MP_YES;
+         return MP_OKAY;
+      }
+   }
 
-  return MP_OKAY;
+   return MP_OKAY;
 }
 #endif