Fix semantically meaningful typos in comments

Signed-off-by: Gilles Peskine <Gilles.Peskine@arm.com>
This commit is contained in:
Gilles Peskine 2021-03-10 23:44:10 +01:00
parent 2536aa709b
commit e1bba7ce48

View File

@ -1674,13 +1674,13 @@ int mbedtls_mpi_mul_int( mbedtls_mpi *X, const mbedtls_mpi *A, mbedtls_mpi_uint
return( 0 ); return( 0 );
} }
/* Calculate X*b as A + A*(b-1) to take advantage of mpi_mul_hlp */ /* Calculate A*b as A + A*(b-1) to take advantage of mpi_mul_hlp */
int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED; int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
/* In general, A * b requires 1 limb more than b. If /* In general, A * b requires 1 limb more than b. If
* A->p[n - 1] * b / b == A->p[n - 1], then A * b fits in the same * A->p[n - 1] * b / b == A->p[n - 1], then A * b fits in the same
* number of limbs as A and the call to grow() is not required since * number of limbs as A and the call to grow() is not required since
* copy() will take care of the growth. However, experimentally, * copy() will take care of the growth if needed. However, experimentally,
* making the call to grow() conditional causes slightly fewer * making the call to grow() unconditional causes slightly fewer
* calls to calloc() in ECP code, presumably because it reuses the * calls to calloc() in ECP code, presumably because it reuses the
* same mpi for a while and this way the mpi is more likely to directly * same mpi for a while and this way the mpi is more likely to directly
* grow to its final size. */ * grow to its final size. */