More KNF.

1 files changed, 57 insertions, 51 deletions

diff --git a/src/lib/libcrypto/asn1/a_i2d_fp.c b/src/lib/libcrypto/asn1/a_i2d_fp.c
index 93e6d8351b..082ba1b3a8 100644
--- a/src/lib/libcrypto/asn1/a_i2d_fp.c
+++ b/src/lib/libcrypto/asn1/a_i2d_fp.c
@@ -5,21 +5,21 @@
  * This package is an SSL implementation written
  * by Eric Young (eay@cryptsoft.com).
  * The implementation was written so as to conform with Netscapes SSL.
- * 
+ *
  * This library is free for commercial and non-commercial use as long as
  * the following conditions are aheared to.  The following conditions
  * apply to all code found in this distribution, be it the RC4, RSA,
  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
  * included with this distribution is covered by the same copyright terms
  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
+ *
  * Copyright remains Eric Young's, and as such any Copyright notices in
  * the code are not to be removed.
  * If this package is used in a product, Eric Young should be given attribution
  * as the author of the parts of the library used.
  * This can be in the form of a textual message at program startup or
  * in documentation (online or textual) provided with the package.
- * 
+ *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
@@ -34,10 +34,10 @@
  *     Eric Young (eay@cryptsoft.com)"
  *    The word 'cryptographic' can be left out if the rouines from the library
  *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
+ * 4. If you include any Windows specific code (or a derivative thereof) from
  *    the apps directory (application code) you must include an acknowledgement:
  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
+ *
  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
@@ -49,7 +49,7 @@
  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  * SUCH DAMAGE.
- * 
+ *
  * The licence and distribution terms for any publically available version or
  * derivative of this code cannot be changed.  i.e. this code cannot simply be
  * copied and put under another distribution licence
@@ -64,92 +64,98 @@
 #ifndef NO_OLD_ASN1
 
 #ifndef OPENSSL_NO_FP_API
-int ASN1_i2d_fp(i2d_of_void *i2d, FILE *out, void *x)
+int
+ASN1_i2d_fp(i2d_of_void *i2d, FILE *out, void *x)
 {
-        BIO *b;
-        int ret;
+        BIO *b;
+        int ret;
 
-        if ((b=BIO_new(BIO_s_file())) == NULL) {
-                ASN1err(ASN1_F_ASN1_I2D_FP,ERR_R_BUF_LIB);
-                return(0);
+        if ((b = BIO_new(BIO_s_file())) == NULL) {
+                ASN1err(ASN1_F_ASN1_I2D_FP, ERR_R_BUF_LIB);
+                return (0);
         }
-        BIO_set_fp(b,out,BIO_NOCLOSE);
-        ret=ASN1_i2d_bio(i2d,b,x);
-        BIO_free(b);
-        return(ret);
+        BIO_set_fp(b, out, BIO_NOCLOSE);
+        ret = ASN1_i2d_bio(i2d, b, x);
+        BIO_free(b);
+        return (ret);
 }
 #endif
 
-int ASN1_i2d_bio(i2d_of_void *i2d, BIO *out, unsigned char *x)
+int
+ASN1_i2d_bio(i2d_of_void *i2d, BIO *out, unsigned char *x)
 {
         char *b;
         unsigned char *p;
-        int i,j=0,n,ret=1;
+        int i, j = 0, n, ret = 1;
 
-        n=i2d(x,NULL);
-        b=(char *)malloc(n);
+        n = i2d(x, NULL);
+        b = (char *)malloc(n);
         if (b == NULL) {
-                ASN1err(ASN1_F_ASN1_I2D_BIO,ERR_R_MALLOC_FAILURE);
-                return(0);
+                ASN1err(ASN1_F_ASN1_I2D_BIO, ERR_R_MALLOC_FAILURE);
+                return (0);
         }
 
-        p=(unsigned char *)b;
-        i2d(x,&p);
-        
+        p = (unsigned char *)b;
+        i2d(x, &p);
+
         for (;;) {
-                i=BIO_write(out,&(b[j]),n);
-                if (i == n) break;
+                i = BIO_write(out, &(b[j]), n);
+                if (i == n)
+                        break;
                 if (i <= 0) {
-                        ret=0;
+                        ret = 0;
                         break;
                 }
-                j+=i;
-                n-=i;
+                j += i;
+                n -= i;
         }
         free(b);
-        return(ret);
+        return (ret);
 }
 
 #endif
 
 #ifndef OPENSSL_NO_FP_API
-int ASN1_item_i2d_fp(const ASN1_ITEM *it, FILE *out, void *x)
+int
+ASN1_item_i2d_fp(const ASN1_ITEM *it, FILE *out, void *x)
 {
-        BIO *b;
-        int ret;
+        BIO *b;
+        int ret;
 
-        if ((b=BIO_new(BIO_s_file())) == NULL) {
-                ASN1err(ASN1_F_ASN1_ITEM_I2D_FP,ERR_R_BUF_LIB);
-                return(0);
+        if ((b = BIO_new(BIO_s_file())) == NULL) {
+                ASN1err(ASN1_F_ASN1_ITEM_I2D_FP, ERR_R_BUF_LIB);
+                return (0);
         }
-        BIO_set_fp(b,out,BIO_NOCLOSE);
-        ret=ASN1_item_i2d_bio(it,b,x);
-        BIO_free(b);
-        return(ret);
+        BIO_set_fp(b, out, BIO_NOCLOSE);
+        ret = ASN1_item_i2d_bio(it, b, x);
+        BIO_free(b);
+        return (ret);
 }
 #endif
 
-int ASN1_item_i2d_bio(const ASN1_ITEM *it, BIO *out, void *x)
+int
+ASN1_item_i2d_bio(const ASN1_ITEM *it, BIO *out, void *x)
 {
         unsigned char *b = NULL;
-        int i,j=0,n,ret=1;
+        int i, j = 0, n, ret = 1;
 
         n = ASN1_item_i2d(x, &b, it);
         if (b == NULL) {
-                ASN1err(ASN1_F_ASN1_ITEM_I2D_BIO,ERR_R_MALLOC_FAILURE);
-                return(0);
+                ASN1err(ASN1_F_ASN1_ITEM_I2D_BIO, ERR_R_MALLOC_FAILURE);
+                return (0);
         }
 
         for (;;) {
-                i=BIO_write(out,&(b[j]),n);
-                if (i == n) break;
+                i = BIO_write(out, &(b[j]), n);
+                if (i == n)
+                        break;
                 if (i <= 0) {
-                        ret=0;
+                        ret = 0;
                         break;
                 }
-                j+=i;
-                n-=i;
+                j += i;
+                n -= i;
         }
         free(b);
-        return(ret);
+        return (ret);
 }