1 files changed, 14 insertions, 14 deletions

diff --git a/src/lib/libcrypto/rsa/rsa_chk.c b/src/lib/libcrypto/rsa/rsa_chk.c
index 54113f89f6..0f9e0944db 100644
--- a/src/lib/libcrypto/rsa/rsa_chk.c
+++ b/src/lib/libcrypto/rsa/rsa_chk.c
@@ -1,4 +1,4 @@
-/* $OpenBSD: rsa_chk.c,v 1.7 2014/07/09 08:20:08 miod Exp $ */
+/* $OpenBSD: rsa_chk.c,v 1.8 2014/07/09 19:51:38 jsing Exp $ */
 /* ====================================================================
  * Copyright (c) 1999 The OpenSSL Project.  All rights reserved.
  *
@@ -7,7 +7,7 @@
  * are met:
  *
  * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
+ *    notice, this list of conditions and the following disclaimer.
  *
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in
@@ -65,7 +65,7 @@ RSA_check_key(const RSA *key)
                 RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_VALUE_MISSING);
                 return 0;
         }
-        
+
         i = BN_new();
         j = BN_new();
         k = BN_new();
@@ -78,7 +78,7 @@ RSA_check_key(const RSA *key)
                 RSAerr(RSA_F_RSA_CHECK_KEY, ERR_R_MALLOC_FAILURE);
                 goto err;
         }
-        
+
         /* p prime? */
         r = BN_is_prime_ex(key->p, BN_prime_checks, NULL, NULL);
         if (r != 1) {
@@ -87,7 +87,7 @@ RSA_check_key(const RSA *key)
                         goto err;
                 RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_P_NOT_PRIME);
         }
-        
+
         /* q prime? */
         r = BN_is_prime_ex(key->q, BN_prime_checks, NULL, NULL);
         if (r != 1) {
@@ -96,19 +96,19 @@ RSA_check_key(const RSA *key)
                         goto err;
                 RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_Q_NOT_PRIME);
         }
-        
+
         /* n = p*q? */
         r = BN_mul(i, key->p, key->q, ctx);
         if (!r) {
                 ret = -1;
                 goto err;
         }
-        
+
         if (BN_cmp(i, key->n) != 0) {
                 ret = 0;
                 RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_N_DOES_NOT_EQUAL_P_Q);
         }
-        
+
         /* d*e = 1  mod lcm(p-1,q-1)? */
 
         r = BN_sub(i, key->p, BN_value_one());
@@ -149,7 +149,7 @@ RSA_check_key(const RSA *key)
                 ret = 0;
                 RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_D_E_NOT_CONGRUENT_TO_1);
         }
-        
+
         if (key->dmp1 != NULL && key->dmq1 != NULL && key->iqmp != NULL) {
                 /* dmp1 = d mod (p-1)? */
                 r = BN_sub(i, key->p, BN_value_one());
@@ -169,14 +169,14 @@ RSA_check_key(const RSA *key)
                         RSAerr(RSA_F_RSA_CHECK_KEY,
                             RSA_R_DMP1_NOT_CONGRUENT_TO_D);
                 }
-        
-                /* dmq1 = d mod (q-1)? */    
+
+                /* dmq1 = d mod (q-1)? */
                 r = BN_sub(i, key->q, BN_value_one());
                 if (!r) {
                         ret = -1;
                         goto err;
                 }
-        
+
                 r = BN_mod(j, key->d, i, ctx);
                 if (!r) {
                         ret = -1;
@@ -188,7 +188,7 @@ RSA_check_key(const RSA *key)
                         RSAerr(RSA_F_RSA_CHECK_KEY,
                             RSA_R_DMQ1_NOT_CONGRUENT_TO_D);
                 }
-        
+
                 /* iqmp = q^-1 mod p? */
                 if (!BN_mod_inverse(i, key->q, key->p, ctx)) {
                         ret = -1;
@@ -202,7 +202,7 @@ RSA_check_key(const RSA *key)
                 }
         }
 
- err:
+err:
         if (i != NULL)
                 BN_free(i);
         if (j != NULL)