1
0
mirror of https://github.com/Mbed-TLS/mbedtls.git synced 2025-06-06 11:40:59 +03:00

Docs; minor tidy-up

Signed-off-by: Dave Rodgman <dave.rodgman@arm.com>
This commit is contained in:
Dave Rodgman 2024-02-14 13:57:53 +00:00
parent 693fb4f0b2
commit 427a5a1915

View File

@ -12,6 +12,8 @@
#include "common.h" #include "common.h"
#if defined(MBEDTLS_SHA3_C)
/* /*
* These macros select manually unrolled implementations of parts of the main permutation function. * These macros select manually unrolled implementations of parts of the main permutation function.
* *
@ -21,6 +23,9 @@
* Rolling up the theta loop saves a lot of code-size at small performance cost. The code-size * Rolling up the theta loop saves a lot of code-size at small performance cost. The code-size
* saving then enables us to unroll the other loops for a net code-size saving with a net * saving then enables us to unroll the other loops for a net code-size saving with a net
* performance win. * performance win.
*
* Depending on your compiler and target, it may be beneficial to adjust these; the defaults here
* should give sensible trade-offs for gcc and clang.
*/ */
#undef MBEDTLS_SHA3_THETA_UNROLL //no-check-names #undef MBEDTLS_SHA3_THETA_UNROLL //no-check-names
#define MBEDTLS_SHA3_RHO_UNROLL //no-check-names #define MBEDTLS_SHA3_RHO_UNROLL //no-check-names
@ -33,8 +38,6 @@
#define MBEDTLS_SHA3_CHI_UNROLL //no-check-names #define MBEDTLS_SHA3_CHI_UNROLL //no-check-names
#endif #endif
#if defined(MBEDTLS_SHA3_C)
#include "mbedtls/sha3.h" #include "mbedtls/sha3.h"
#include "mbedtls/platform_util.h" #include "mbedtls/platform_util.h"
#include "mbedtls/error.h" #include "mbedtls/error.h"
@ -164,7 +167,8 @@ static void keccak_f1600(mbedtls_sha3_context *ctx)
/* Chi */ /* Chi */
#if !defined(MBEDTLS_SHA3_CHI_UNROLL) //no-check-names #if !defined(MBEDTLS_SHA3_CHI_UNROLL) //no-check-names
for (i = 0; i <= 20; i += 5) { for (i = 0; i <= 20; i += 5) {
lane[0] = s[i]; lane[1] = s[i + 1]; lane[2] = s[i + 2]; lane[3] = s[i + 3]; lane[4] = s[i + 4]; lane[0] = s[i]; lane[1] = s[i + 1]; lane[2] = s[i + 2];
lane[3] = s[i + 3]; lane[4] = s[i + 4];
s[i + 0] ^= (~lane[1]) & lane[2]; s[i + 0] ^= (~lane[1]) & lane[2];
s[i + 1] ^= (~lane[2]) & lane[3]; s[i + 1] ^= (~lane[2]) & lane[3];
s[i + 2] ^= (~lane[3]) & lane[4]; s[i + 2] ^= (~lane[3]) & lane[4];