//! [`Uint`] addition operations. use crate::{Checked, CheckedAdd, CtChoice, Limb, Uint, Wrapping, Zero}; use core::ops::{Add, AddAssign}; use subtle::CtOption; impl Uint { /// Computes `a + b + carry`, returning the result along with the new carry. #[inline(always)] pub const fn adc(&self, rhs: &Self, mut carry: Limb) -> (Self, Limb) { let mut limbs = [Limb::ZERO; LIMBS]; let mut i = 0; while i < LIMBS { let (w, c) = self.limbs[i].adc(rhs.limbs[i], carry); limbs[i] = w; carry = c; i += 1; } (Self { limbs }, carry) } /// Perform saturating addition, returning `MAX` on overflow. pub const fn saturating_add(&self, rhs: &Self) -> Self { let (res, overflow) = self.adc(rhs, Limb::ZERO); if overflow.0 == 0 { res } else { Self::MAX } } /// Perform wrapping addition, discarding overflow. pub const fn wrapping_add(&self, rhs: &Self) -> Self { self.adc(rhs, Limb::ZERO).0 } /// Perform wrapping addition, returning the truthy value as the second element of the tuple /// if an overflow has occurred. pub(crate) const fn conditional_wrapping_add( &self, rhs: &Self, choice: CtChoice, ) -> (Self, CtChoice) { let actual_rhs = Uint::ct_select(&Uint::ZERO, rhs, choice); let (sum, carry) = self.adc(&actual_rhs, Limb::ZERO); (sum, CtChoice::from_lsb(carry.0)) } } impl CheckedAdd<&Uint> for Uint { type Output = Self; fn checked_add(&self, rhs: &Self) -> CtOption { let (result, carry) = self.adc(rhs, Limb::ZERO); CtOption::new(result, carry.is_zero()) } } impl Add for Wrapping> { type Output = Self; fn add(self, rhs: Self) -> Wrapping> { Wrapping(self.0.wrapping_add(&rhs.0)) } } impl Add<&Wrapping>> for Wrapping> { type Output = Wrapping>; fn add(self, rhs: &Wrapping>) -> Wrapping> { Wrapping(self.0.wrapping_add(&rhs.0)) } } impl Add>> for &Wrapping> { type Output = Wrapping>; fn add(self, rhs: Wrapping>) -> Wrapping> { Wrapping(self.0.wrapping_add(&rhs.0)) } } impl Add<&Wrapping>> for &Wrapping> { type Output = Wrapping>; fn add(self, rhs: &Wrapping>) -> Wrapping> { Wrapping(self.0.wrapping_add(&rhs.0)) } } impl AddAssign for Wrapping> { fn add_assign(&mut self, other: Self) { *self = *self + other; } } impl AddAssign<&Wrapping>> for Wrapping> { fn add_assign(&mut self, other: &Self) { *self = *self + other; } } impl Add for Checked> { type Output = Self; fn add(self, rhs: Self) -> Checked> { Checked( self.0 .and_then(|lhs| rhs.0.and_then(|rhs| lhs.checked_add(&rhs))), ) } } impl Add<&Checked>> for Checked> { type Output = Checked>; fn add(self, rhs: &Checked>) -> Checked> { Checked( self.0 .and_then(|lhs| rhs.0.and_then(|rhs| lhs.checked_add(&rhs))), ) } } impl Add>> for &Checked> { type Output = Checked>; fn add(self, rhs: Checked>) -> Checked> { Checked( self.0 .and_then(|lhs| rhs.0.and_then(|rhs| lhs.checked_add(&rhs))), ) } } impl Add<&Checked>> for &Checked> { type Output = Checked>; fn add(self, rhs: &Checked>) -> Checked> { Checked( self.0 .and_then(|lhs| rhs.0.and_then(|rhs| lhs.checked_add(&rhs))), ) } } impl AddAssign for Checked> { fn add_assign(&mut self, other: Self) { *self = *self + other; } } impl AddAssign<&Checked>> for Checked> { fn add_assign(&mut self, other: &Self) { *self = *self + other; } } #[cfg(test)] mod tests { use crate::{CheckedAdd, Limb, U128}; #[test] fn adc_no_carry() { let (res, carry) = U128::ZERO.adc(&U128::ONE, Limb::ZERO); assert_eq!(res, U128::ONE); assert_eq!(carry, Limb::ZERO); } #[test] fn adc_with_carry() { let (res, carry) = U128::MAX.adc(&U128::ONE, Limb::ZERO); assert_eq!(res, U128::ZERO); assert_eq!(carry, Limb::ONE); } #[test] fn wrapping_add_no_carry() { assert_eq!(U128::ZERO.wrapping_add(&U128::ONE), U128::ONE); } #[test] fn wrapping_add_with_carry() { assert_eq!(U128::MAX.wrapping_add(&U128::ONE), U128::ZERO); } #[test] fn checked_add_ok() { let result = U128::ZERO.checked_add(&U128::ONE); assert_eq!(result.unwrap(), U128::ONE); } #[test] fn checked_add_overflow() { let result = U128::MAX.checked_add(&U128::ONE); assert!(!bool::from(result.is_some())); } }