1use crate::ffi::svp::{delete_svp_ppol, new_svp_ppol, svp_apply_dft, svp_ppol_t, svp_prepare};
 2use crate::scalar::Scalar;
 3use crate::{Module, VecZnx, VecZnxDft};
 4
 5pub struct SvpPPol(pub *mut svp_ppol_t);
 6
 7impl SvpPPol {
 8    pub fn delete(self) {
 9        unsafe { delete_svp_ppol(self.0) };
10        let _ = drop(self);
11    }
12}
13
14impl Module {
15    // Prepares a scalar polynomial (1 limb) for a scalar x vector product.
16    // Method will panic if a.limbs() != 1.
17    pub fn svp_prepare(&self, svp_ppol: &mut SvpPPol, a: &Scalar) {
18        unsafe { svp_prepare(self.0, svp_ppol.0, a.as_ptr()) }
19    }
20
21    // Allocates a scalar-vector-product prepared-poly (VecZnxBig).
22    pub fn svp_new_ppol(&self) -> SvpPPol {
23        unsafe { SvpPPol(new_svp_ppol(self.0)) }
24    }
25
26    // Applies a scalar x vector product: res <- a (ppol) x b
27    pub fn svp_apply_dft(&self, c: &mut VecZnxDft, a: &SvpPPol, b: &VecZnx) {
28        let limbs: u64 = b.limbs() as u64;
29        assert!(
30            c.limbs() as u64 >= limbs,
31            "invalid c_vector: c_vector.limbs()={} < b.limbs()={}",
32            c.limbs(),
33            limbs
34        );
35        unsafe { svp_apply_dft(self.0, c.0, limbs, a.0, b.as_ptr(), limbs, b.n() as u64) }
36    }
37}