diff options
| author | tb <> | 2025-05-01 00:35:23 +0000 |
|---|---|---|
| committer | tb <> | 2025-05-01 00:35:23 +0000 |
| commit | 5da7423ce712cde5b4217f03cf3fa735cd824239 (patch) | |
| tree | e4edd04797f6fedade863e11c21f5ee2e19c90fc /src | |
| parent | 3276aad9855c6cd2565069523b365fc3fe5df45a (diff) | |
| download | openbsd-5da7423ce712cde5b4217f03cf3fa735cd824239.tar.gz openbsd-5da7423ce712cde5b4217f03cf3fa735cd824239.tar.bz2 openbsd-5da7423ce712cde5b4217f03cf3fa735cd824239.zip | |
lhash: add missing spaces before assignment operator
Diffstat (limited to 'src')
| -rw-r--r-- | src/lib/libcrypto/lhash/lhash.c | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/lib/libcrypto/lhash/lhash.c b/src/lib/libcrypto/lhash/lhash.c index aa532267de..ad6ece543b 100644 --- a/src/lib/libcrypto/lhash/lhash.c +++ b/src/lib/libcrypto/lhash/lhash.c | |||
| @@ -1,4 +1,4 @@ | |||
| 1 | /* $OpenBSD: lhash.c,v 1.28 2024/07/14 14:32:45 jsing Exp $ */ | 1 | /* $OpenBSD: lhash.c,v 1.29 2025/05/01 00:35:23 tb Exp $ */ |
| 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) | 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
| 3 | * All rights reserved. | 3 | * All rights reserved. |
| 4 | * | 4 | * |
| @@ -115,11 +115,11 @@ expand(_LHASH *lh) | |||
| 115 | #endif | 115 | #endif |
| 116 | if ((hash % nni) != p) { /* move it */ | 116 | if ((hash % nni) != p) { /* move it */ |
| 117 | *n1 = (*n1)->next; | 117 | *n1 = (*n1)->next; |
| 118 | np->next= *n2; | 118 | np->next = *n2; |
| 119 | *n2 = np; | 119 | *n2 = np; |
| 120 | } else | 120 | } else |
| 121 | n1 = &((*n1)->next); | 121 | n1 = &((*n1)->next); |
| 122 | np= *n1; | 122 | np = *n1; |
| 123 | } | 123 | } |
| 124 | 124 | ||
| 125 | if ((lh->p) >= lh->pmax) { | 125 | if ((lh->p) >= lh->pmax) { |
| @@ -305,7 +305,7 @@ lh_delete(_LHASH *lh, const void *data) | |||
| 305 | if (*rn == NULL) { | 305 | if (*rn == NULL) { |
| 306 | return (NULL); | 306 | return (NULL); |
| 307 | } else { | 307 | } else { |
| 308 | nn= *rn; | 308 | nn = *rn; |
| 309 | *rn = nn->next; | 309 | *rn = nn->next; |
| 310 | ret = nn->data; | 310 | ret = nn->data; |
| 311 | free(nn); | 311 | free(nn); |
