asn1: Fix whitespace

Signed-off-by: Volker Lendecke <vl@samba.org>
Reviewed-by: Guenther Deschner <gd@samba.org>

diff --git a/lib/util/asn1.c b/lib/util/asn1.c
index 8beaf52422f9f6127fa1a38afd9fa80f035868e3..9aa9772e013cc0dcebcc6176b55b3986b2494d6b 100644 (file)
--- a/lib/util/asn1.c
+++ b/lib/util/asn1.c
@@ -1,18 +1,18 @@
-/* 
+/*
    Unix SMB/CIFS implementation.
    simple ASN1 routines
    Copyright (C) Andrew Tridgell 2001
-   
+
    This program 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 3 of the License, or
    (at your option) any later version.
-   
+
    This program 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 should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
@@ -143,7 +143,7 @@ bool asn1_pop_tag(struct asn1_data *data)
        }
        len = data->ofs - (nesting->start+1);
        /* yes, this is ugly. We don't know in advance how many bytes the length
-          of a tag will take, so we assumed 1 byte. If we were wrong then we 
+          of a tag will take, so we assumed 1 byte. If we were wrong then we
           need to correct our mistake */
        if (len > 0xFFFFFF) {
                data->data[nesting->start] = 0x84;
@@ -617,7 +617,7 @@ bool asn1_start_tag(struct asn1_data *data, uint8_t tag)
 {
        uint8_t b;
        struct nesting *nesting;
-       
+
        if (!asn1_read_uint8(data, &b))
                return false;
 
@@ -641,7 +641,7 @@ bool asn1_start_tag(struct asn1_data *data, uint8_t tag)
                        return false;
                nesting->taglen = b;
                while (n > 1) {
-                       if (!asn1_read_uint8(data, &b)) 
+                       if (!asn1_read_uint8(data, &b))
                                return false;
                        nesting->taglen = (nesting->taglen << 8) | b;
                        n--;
@@ -938,8 +938,7 @@ bool asn1_read_implicit_Integer(struct asn1_data *data, int *i)
                }
                *i = (*i << 8) + b;
        }
-       return !data->has_error;        
-       
+       return !data->has_error;
 }
 
 /* read an integer */
@@ -949,7 +948,7 @@ bool asn1_read_Integer(struct asn1_data *data, int *i)
 
        if (!asn1_start_tag(data, ASN1_INTEGER)) return false;
        if (!asn1_read_implicit_Integer(data, i)) return false;
-       return asn1_end_tag(data);      
+       return asn1_end_tag(data);
 }
 
 /* read a BIT STRING */
@@ -989,7 +988,7 @@ bool asn1_read_BitString(struct asn1_data *data, TALLOC_CTX *mem_ctx, DATA_BLOB
 bool asn1_read_enumerated(struct asn1_data *data, int *v)
 {
        *v = 0;
-       
+
        if (!asn1_start_tag(data, ASN1_ENUMERATED)) return false;
        while (!data->has_error && asn1_tag_remaining(data)>0) {
                uint8_t b;
@@ -998,7 +997,7 @@ bool asn1_read_enumerated(struct asn1_data *data, int *v)
                }
                *v = (*v << 8) + b;
        }
-       return asn1_end_tag(data);      
+       return asn1_end_tag(data);
 }
 
 /* check a enumerated value is correct */
@@ -1087,7 +1086,7 @@ int asn1_peek_full_tag(DATA_BLOB blob, uint8_t tag, size_t *packet_size)
        if (size > blob.length) {
                *packet_size = size;
                return EAGAIN;
-       }               
+       }
 
        *packet_size = size;
        return 0;

diff --git a/lib/util/asn1.h b/lib/util/asn1.h
index 9ebf4538b7e4fbb39ffcce0aeeafde5a43239b75..95e7dbf634aac98a89a947d28f782ed2cc426287 100644 (file)
--- a/lib/util/asn1.h
+++ b/lib/util/asn1.h
@@ -1,18 +1,18 @@
-/* 
-   Unix SMB/CIFS implementation.   
+/*
+   Unix SMB/CIFS implementation.
    simple ASN1 code
    Copyright (C) Andrew Tridgell 2001
-   
+
    This program 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 3 of the License, or
    (at your option) any later version.
-   
+
    This program 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 should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */