diff options
| author | bcook <> | 2014-08-18 19:11:48 +0000 |
|---|---|---|
| committer | bcook <> | 2014-08-18 19:11:48 +0000 |
| commit | 6ee9e8bd1dfefb2512d09447fa41d83947caba6c (patch) | |
| tree | 1a0b420df1945872d5e272d78732e7436157f08d /src/lib/libcrypto/md5 | |
| parent | a904076a7b693c8512f298bacec36b1e7e3ff538 (diff) | |
| download | openbsd-6ee9e8bd1dfefb2512d09447fa41d83947caba6c.tar.gz openbsd-6ee9e8bd1dfefb2512d09447fa41d83947caba6c.tar.bz2 openbsd-6ee9e8bd1dfefb2512d09447fa41d83947caba6c.zip | |
remove return value from HOST_c2l/l2c macros
These macros and asm inlines simulate a function returning a value, but
nothing ever uses this return value. Remove the pseudo-returns and
(void) casts discarding the unused values.
This, maybe unsurprisingly, speeds things up a bit. It also removes the
GCC 4.9 warnings about unused values.
ok miod@ deraadt@
Diffstat (limited to 'src/lib/libcrypto/md5')
| -rw-r--r-- | src/lib/libcrypto/md5/md5_locl.h | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/src/lib/libcrypto/md5/md5_locl.h b/src/lib/libcrypto/md5/md5_locl.h index a4520be509..9aaed18d7f 100644 --- a/src/lib/libcrypto/md5/md5_locl.h +++ b/src/lib/libcrypto/md5/md5_locl.h | |||
| @@ -1,4 +1,4 @@ | |||
| 1 | /* $OpenBSD: md5_locl.h,v 1.11 2014/06/12 15:49:29 deraadt Exp $ */ | 1 | /* $OpenBSD: md5_locl.h,v 1.12 2014/08/18 19:11:48 bcook 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 | * |
| @@ -88,10 +88,10 @@ void md5_block_data_order (MD5_CTX *c, const void *p,size_t num); | |||
| 88 | #define HASH_FINAL MD5_Final | 88 | #define HASH_FINAL MD5_Final |
| 89 | #define HASH_MAKE_STRING(c,s) do { \ | 89 | #define HASH_MAKE_STRING(c,s) do { \ |
| 90 | unsigned long ll; \ | 90 | unsigned long ll; \ |
| 91 | ll=(c)->A; (void)HOST_l2c(ll,(s)); \ | 91 | ll=(c)->A; HOST_l2c(ll,(s)); \ |
| 92 | ll=(c)->B; (void)HOST_l2c(ll,(s)); \ | 92 | ll=(c)->B; HOST_l2c(ll,(s)); \ |
| 93 | ll=(c)->C; (void)HOST_l2c(ll,(s)); \ | 93 | ll=(c)->C; HOST_l2c(ll,(s)); \ |
| 94 | ll=(c)->D; (void)HOST_l2c(ll,(s)); \ | 94 | ll=(c)->D; HOST_l2c(ll,(s)); \ |
| 95 | } while (0) | 95 | } while (0) |
| 96 | #define HASH_BLOCK_DATA_ORDER md5_block_data_order | 96 | #define HASH_BLOCK_DATA_ORDER md5_block_data_order |
| 97 | 97 | ||
