projects
/
dnssec-prover
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
b0d9ef9
)
Address new rustc warnings around unused variables
author
Matt Corallo
<git@bluematt.me>
Tue, 7 May 2024 17:00:47 +0000
(17:00 +0000)
committer
Matt Corallo
<git@bluematt.me>
Tue, 7 May 2024 17:01:17 +0000
(17:01 +0000)
src/crypto/bigint.rs
patch
|
blob
|
history
diff --git
a/src/crypto/bigint.rs
b/src/crypto/bigint.rs
index 4bd6f372aef071991411c9cf6ee1f581a4935653..a9245a47884866d2669ecb6eb2035c6a208ff257 100644
(file)
--- a/
src/crypto/bigint.rs
+++ b/
src/crypto/bigint.rs
@@
-104,7
+104,7
@@
macro_rules! negate { ($v: ident) => { {
$v[i] ^= 0xffff_ffff_ffff_ffff;
i += 1;
}
$v[i] ^= 0xffff_ffff_ffff_ffff;
i += 1;
}
- add_u64!($v, 1);
+
let _ =
add_u64!($v, 1);
} } }
/// Doubles in-place, returning an overflow flag, in which case one out-of-bounds high bit is
} } }
/// Doubles in-place, returning an overflow flag, in which case one out-of-bounds high bit is
@@
-985,7
+985,8
@@
impl<M: PrimeModulus<U256>> U256Mod<M> {
// should be able to do it at compile time alone.
let r_minus_one = [0xffff_ffff_ffff_ffff; 4];
let (mut r_mod_prime, _) = sub_4(&r_minus_one, &M::PRIME.0);
// should be able to do it at compile time alone.
let r_minus_one = [0xffff_ffff_ffff_ffff; 4];
let (mut r_mod_prime, _) = sub_4(&r_minus_one, &M::PRIME.0);
- add_u64!(r_mod_prime, 1);
+ let r_mod_prime_overflow = add_u64!(r_mod_prime, 1);
+ assert!(!r_mod_prime_overflow);
let r_squared = sqr_4(&r_mod_prime);
let mut prime_extended = [0; 8];
let prime = M::PRIME.0;
let r_squared = sqr_4(&r_mod_prime);
let mut prime_extended = [0; 8];
let prime = M::PRIME.0;
@@
-1183,7
+1184,8
@@
impl<M: PrimeModulus<U384>> U384Mod<M> {
// should be able to do it at compile time alone.
let r_minus_one = [0xffff_ffff_ffff_ffff; 6];
let (mut r_mod_prime, _) = sub_6(&r_minus_one, &M::PRIME.0);
// should be able to do it at compile time alone.
let r_minus_one = [0xffff_ffff_ffff_ffff; 6];
let (mut r_mod_prime, _) = sub_6(&r_minus_one, &M::PRIME.0);
- add_u64!(r_mod_prime, 1);
+ let r_mod_prime_overflow = add_u64!(r_mod_prime, 1);
+ assert!(!r_mod_prime_overflow);
let r_squared = sqr_6(&r_mod_prime);
let mut prime_extended = [0; 12];
let prime = M::PRIME.0;
let r_squared = sqr_6(&r_mod_prime);
let mut prime_extended = [0; 12];
let prime = M::PRIME.0;