c3-lang/libtommath

diff --git a/bn_mp_init_copy.c b/bn_mp_init_copy.c
index 3321c47..9a5ae72 100644
--- a/bn_mp_init_copy.c
+++ b/bn_mp_init_copy.c
@@ -24,7 +24,7 @@ int mp_init_copy (mp_int * a, mp_int * b)
     return res;
   }
 
-  if((res = mp_copy(b, a)) != MP_OKAY) {
+  if ((res = mp_copy(b, a)) != MP_OKAY) {
     mp_clear(a);
   }
 
diff --git a/bn_mp_shrink.c b/bn_mp_shrink.c
index 5f08631..0e14320 100644
--- a/bn_mp_shrink.c
+++ b/bn_mp_shrink.c
@@ -21,7 +21,7 @@ int mp_shrink (mp_int * a)
   mp_digit *tmp;
   int used = 1;
 
-  if(a->used > 0) {
+  if (a->used > 0) {
     used = a->used;
   }
 
diff --git a/bn_mp_sqrtmod_prime.c b/bn_mp_sqrtmod_prime.c
index 1597ad9..73ef24b 100644
--- a/bn_mp_sqrtmod_prime.c
+++ b/bn_mp_sqrtmod_prime.c
@@ -66,7 +66,7 @@ int mp_sqrtmod_prime(mp_int *n, mp_int *prime, mp_int *ret)
   /* find a Z such that the Legendre symbol (Z|prime) == -1 */
   if ((res = mp_set_int(&Z, 2)) != MP_OKAY)                     goto cleanup;
   /* Z = 2 */
-  while(1) {
+  while (1) {
     if ((res = mp_jacobi(&Z, prime, &legendre)) != MP_OKAY)     goto cleanup;
     if (legendre == -1) break;
     if ((res = mp_add_d(&Z, 1, &Z)) != MP_OKAY)                 goto cleanup;