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/ripemd/rmd_dgst.c | |
| 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/ripemd/rmd_dgst.c')
| -rw-r--r-- | src/lib/libcrypto/ripemd/rmd_dgst.c | 32 |
1 files changed, 16 insertions, 16 deletions
diff --git a/src/lib/libcrypto/ripemd/rmd_dgst.c b/src/lib/libcrypto/ripemd/rmd_dgst.c index 1d2498daec..f26fc31bf3 100644 --- a/src/lib/libcrypto/ripemd/rmd_dgst.c +++ b/src/lib/libcrypto/ripemd/rmd_dgst.c | |||
| @@ -1,4 +1,4 @@ | |||
| 1 | /* $OpenBSD: rmd_dgst.c,v 1.15 2014/07/09 11:10:51 bcook Exp $ */ | 1 | /* $OpenBSD: rmd_dgst.c,v 1.16 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 | * |
| @@ -103,21 +103,21 @@ void ripemd160_block_data_order (RIPEMD160_CTX *ctx, const void *p, size_t num) | |||
| 103 | 103 | ||
| 104 | A=ctx->A; B=ctx->B; C=ctx->C; D=ctx->D; E=ctx->E; | 104 | A=ctx->A; B=ctx->B; C=ctx->C; D=ctx->D; E=ctx->E; |
| 105 | 105 | ||
| 106 | (void)HOST_c2l(data,l); X( 0)=l;(void)HOST_c2l(data,l); X( 1)=l; | 106 | HOST_c2l(data,l); X( 0)=l;HOST_c2l(data,l); X( 1)=l; |
| 107 | RIP1(A,B,C,D,E,WL00,SL00); (void)HOST_c2l(data,l); X( 2)=l; | 107 | RIP1(A,B,C,D,E,WL00,SL00); HOST_c2l(data,l); X( 2)=l; |
| 108 | RIP1(E,A,B,C,D,WL01,SL01); (void)HOST_c2l(data,l); X( 3)=l; | 108 | RIP1(E,A,B,C,D,WL01,SL01); HOST_c2l(data,l); X( 3)=l; |
| 109 | RIP1(D,E,A,B,C,WL02,SL02); (void)HOST_c2l(data,l); X( 4)=l; | 109 | RIP1(D,E,A,B,C,WL02,SL02); HOST_c2l(data,l); X( 4)=l; |
| 110 | RIP1(C,D,E,A,B,WL03,SL03); (void)HOST_c2l(data,l); X( 5)=l; | 110 | RIP1(C,D,E,A,B,WL03,SL03); HOST_c2l(data,l); X( 5)=l; |
| 111 | RIP1(B,C,D,E,A,WL04,SL04); (void)HOST_c2l(data,l); X( 6)=l; | 111 | RIP1(B,C,D,E,A,WL04,SL04); HOST_c2l(data,l); X( 6)=l; |
| 112 | RIP1(A,B,C,D,E,WL05,SL05); (void)HOST_c2l(data,l); X( 7)=l; | 112 | RIP1(A,B,C,D,E,WL05,SL05); HOST_c2l(data,l); X( 7)=l; |
| 113 | RIP1(E,A,B,C,D,WL06,SL06); (void)HOST_c2l(data,l); X( 8)=l; | 113 | RIP1(E,A,B,C,D,WL06,SL06); HOST_c2l(data,l); X( 8)=l; |
| 114 | RIP1(D,E,A,B,C,WL07,SL07); (void)HOST_c2l(data,l); X( 9)=l; | 114 | RIP1(D,E,A,B,C,WL07,SL07); HOST_c2l(data,l); X( 9)=l; |
| 115 | RIP1(C,D,E,A,B,WL08,SL08); (void)HOST_c2l(data,l); X(10)=l; | 115 | RIP1(C,D,E,A,B,WL08,SL08); HOST_c2l(data,l); X(10)=l; |
| 116 | RIP1(B,C,D,E,A,WL09,SL09); (void)HOST_c2l(data,l); X(11)=l; | 116 | RIP1(B,C,D,E,A,WL09,SL09); HOST_c2l(data,l); X(11)=l; |
| 117 | RIP1(A,B,C,D,E,WL10,SL10); (void)HOST_c2l(data,l); X(12)=l; | 117 | RIP1(A,B,C,D,E,WL10,SL10); HOST_c2l(data,l); X(12)=l; |
| 118 | RIP1(E,A,B,C,D,WL11,SL11); (void)HOST_c2l(data,l); X(13)=l; | 118 | RIP1(E,A,B,C,D,WL11,SL11); HOST_c2l(data,l); X(13)=l; |
| 119 | RIP1(D,E,A,B,C,WL12,SL12); (void)HOST_c2l(data,l); X(14)=l; | 119 | RIP1(D,E,A,B,C,WL12,SL12); HOST_c2l(data,l); X(14)=l; |
| 120 | RIP1(C,D,E,A,B,WL13,SL13); (void)HOST_c2l(data,l); X(15)=l; | 120 | RIP1(C,D,E,A,B,WL13,SL13); HOST_c2l(data,l); X(15)=l; |
| 121 | RIP1(B,C,D,E,A,WL14,SL14); | 121 | RIP1(B,C,D,E,A,WL14,SL14); |
| 122 | RIP1(A,B,C,D,E,WL15,SL15); | 122 | RIP1(A,B,C,D,E,WL15,SL15); |
| 123 | 123 | ||
