diff options
author | Steve French <sfrench@us.ibm.com> | 2007-07-08 11:40:40 -0400 |
---|---|---|
committer | Steve French <sfrench@us.ibm.com> | 2007-07-08 11:40:40 -0400 |
commit | 3870253efb65e1960421ca74f5d336218c28fc5b (patch) | |
tree | 2334067405b14a5896cd6fdebb5636adda8e896f /fs/cifs/smbdes.c | |
parent | 790fe579f5006b72dfd2814f9263a73b0b455e81 (diff) |
[CIFS] more whitespace fixes
Signed-off-by: Steve French <sfrench@us.ibm.com>
Diffstat (limited to 'fs/cifs/smbdes.c')
-rw-r--r-- | fs/cifs/smbdes.c | 24 |
1 files changed, 12 insertions, 12 deletions
diff --git a/fs/cifs/smbdes.c b/fs/cifs/smbdes.c index 1b1daf63f062..1e92559cb8cf 100644 --- a/fs/cifs/smbdes.c +++ b/fs/cifs/smbdes.c | |||
@@ -1,8 +1,8 @@ | |||
1 | /* | 1 | /* |
2 | Unix SMB/Netbios implementation. | 2 | Unix SMB/Netbios implementation. |
3 | Version 1.9. | 3 | Version 1.9. |
4 | 4 | ||
5 | a partial implementation of DES designed for use in the | 5 | a partial implementation of DES designed for use in the |
6 | SMB authentication protocol | 6 | SMB authentication protocol |
7 | 7 | ||
8 | Copyright (C) Andrew Tridgell 1998 | 8 | Copyright (C) Andrew Tridgell 1998 |
@@ -23,10 +23,10 @@ | |||
23 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | 23 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
24 | */ | 24 | */ |
25 | 25 | ||
26 | /* NOTES: | 26 | /* NOTES: |
27 | 27 | ||
28 | This code makes no attempt to be fast! In fact, it is a very | 28 | This code makes no attempt to be fast! In fact, it is a very |
29 | slow implementation | 29 | slow implementation |
30 | 30 | ||
31 | This code is NOT a complete DES implementation. It implements only | 31 | This code is NOT a complete DES implementation. It implements only |
32 | the minimum necessary for SMB authentication, as used by all SMB | 32 | the minimum necessary for SMB authentication, as used by all SMB |
@@ -153,7 +153,7 @@ static uchar sbox[8][4][16] = { | |||
153 | }; | 153 | }; |
154 | 154 | ||
155 | static void | 155 | static void |
156 | permute(char *out, char *in, uchar * p, int n) | 156 | permute(char *out, char *in, uchar *p, int n) |
157 | { | 157 | { |
158 | int i; | 158 | int i; |
159 | for (i = 0; i < n; i++) | 159 | for (i = 0; i < n; i++) |
@@ -202,18 +202,18 @@ dohash(char *out, char *in, char *key, int forw) | |||
202 | char *rl; | 202 | char *rl; |
203 | 203 | ||
204 | /* Have to reduce stack usage */ | 204 | /* Have to reduce stack usage */ |
205 | pk1 = kmalloc(56+56+64+64,GFP_KERNEL); | 205 | pk1 = kmalloc(56+56+64+64, GFP_KERNEL); |
206 | if(pk1 == NULL) | 206 | if (pk1 == NULL) |
207 | return; | 207 | return; |
208 | 208 | ||
209 | ki = kmalloc(16*48, GFP_KERNEL); | 209 | ki = kmalloc(16*48, GFP_KERNEL); |
210 | if(ki == NULL) { | 210 | if (ki == NULL) { |
211 | kfree(pk1); | 211 | kfree(pk1); |
212 | return; | 212 | return; |
213 | } | 213 | } |
214 | 214 | ||
215 | cd = pk1 + 56; | 215 | cd = pk1 + 56; |
216 | pd1= cd + 56; | 216 | pd1 = cd + 56; |
217 | rl = pd1 + 64; | 217 | rl = pd1 + 64; |
218 | 218 | ||
219 | permute(pk1, key, perm1, 56); | 219 | permute(pk1, key, perm1, 56); |
@@ -247,7 +247,7 @@ dohash(char *out, char *in, char *key, int forw) | |||
247 | char *r2; /* r2[32] */ | 247 | char *r2; /* r2[32] */ |
248 | 248 | ||
249 | er = kmalloc(48+48+32+32+32, GFP_KERNEL); | 249 | er = kmalloc(48+48+32+32+32, GFP_KERNEL); |
250 | if(er == NULL) { | 250 | if (er == NULL) { |
251 | kfree(pk1); | 251 | kfree(pk1); |
252 | kfree(ki); | 252 | kfree(ki); |
253 | return; | 253 | return; |
@@ -327,8 +327,8 @@ smbhash(unsigned char *out, unsigned char *in, unsigned char *key, int forw) | |||
327 | char *keyb; /* keyb[64] */ | 327 | char *keyb; /* keyb[64] */ |
328 | unsigned char key2[8]; | 328 | unsigned char key2[8]; |
329 | 329 | ||
330 | outb = kmalloc(64 * 3,GFP_KERNEL); | 330 | outb = kmalloc(64 * 3, GFP_KERNEL); |
331 | if(outb == NULL) | 331 | if (outb == NULL) |
332 | return; | 332 | return; |
333 | 333 | ||
334 | inb = outb + 64; | 334 | inb = outb + 64; |