X-Git-Url: https://www.bearssl.org/gitweb//home/git/?p=BearSSL;a=blobdiff_plain;f=src%2Fint%2Fi31_muladd.c;h=eecd9e2c6c53230c1e0553844d6bb159c2149d3b;hp=3c5207781ef68fbf300371969435db3272ca478a;hb=491a45337de8dc0a4c100abf33f5c0e187a08afd;hpb=3210f38e0491b39aec1ef419cb4114e9483089fb;ds=inline

diff --git a/src/int/i31_muladd.c b/src/int/i31_muladd.c
index 3c52077..eecd9e2 100644
--- a/src/int/i31_muladd.c
+++ b/src/int/i31_muladd.c
@@ -44,7 +44,7 @@ br_i31_muladd_small(uint32_t *x, uint32_t z, const uint32_t *m)
 		return;
 	}
 	if (m_bitlen <= 31) {
-		uint32_t hi, lo;
+		uint32_t lo;
 
 		hi = x[1] >> 1;
 		lo = (x[1] << 31) | z;
@@ -75,7 +75,7 @@ br_i31_muladd_small(uint32_t *x, uint32_t z, const uint32_t *m)
 	 *
 	 * If a = b*q + r (with 0 <= r < q), we can estimate q by
 	 * doing an Euclidean division on the top words:
-	 *   a0*w+a1 = b0*u + v  (with 0 <= v < w)
+	 *   a0*w+a1 = b0*u + v  (with 0 <= v < b0)
 	 * Then the following holds:
 	 *   0 <= u <= w
 	 *   u-2 <= q <= u