|
@@ -261,6 +261,10 @@ contract256_slidingwindow_modm(signed char r[256], const bignum256modm s, int wi
|
|
|
continue;
|
|
|
|
|
|
for (b = 1; (b < (soplen - j)) && (b <= 6); b++) {
|
|
|
+ /* XXX Tor: coverity scan says that r[j+b] can
|
|
|
+ * overflow, but that's not possible: b < (soplen-j)
|
|
|
+ * guarantees that b + j < soplen, so b+j < 256,
|
|
|
+ * so the index doesn't overflow. */
|
|
|
if ((r[j] + (r[j + b] << b)) <= m) {
|
|
|
r[j] += r[j + b] << b;
|
|
|
r[j + b] = 0;
|