Struct bchlib_sys::bch_control

#[repr(C)]
pub struct bch_control {
    pub m: c_uint,
    pub n: c_uint,
    pub t: c_uint,
    pub ecc_bits: c_uint,
    pub ecc_bytes: c_uint,
    pub a_pow_tab: *mut u16,
    pub a_log_tab: *mut u16,
    pub mod8_tab: *mut u32,
    pub ecc_buf: *mut u32,
    pub ecc_buf2: *mut u32,
    pub xi_tab: *mut c_uint,
    pub syn: *mut c_uint,
    pub cache: *mut c_int,
    pub elp: *mut gf_poly,
    pub poly_2t: [*mut gf_poly; 4],
    pub databuf: *mut u8,
}

struct bch_control - BCH control structure @m: Galois field order @n: maximum codeword size in bits (= 2^m-1) @t: error correction capability in bits @ecc_bits: ecc exact size in bits, i.e. generator polynomial degree (<=mt) @ecc_bytes: ecc max size (mt bits) in bytes @a_pow_tab: Galois field GF(2^m) exponentiation lookup table @a_log_tab: Galois field GF(2^m) log lookup table @mod8_tab: remainder generator polynomial lookup tables @ecc_buf: ecc parity words buffer @ecc_buf2: ecc parity words buffer @xi_tab: GF(2^m) base for solving degree 2 polynomial roots @syn: syndrome buffer @cache: log-based polynomial representation buffer @elp: error locator polynomial @poly_2t: temporary polynomials of degree 2t

Fields

m: c_uint

n: c_uint

t: c_uint

ecc_bits: c_uint

ecc_bytes: c_uint

a_pow_tab: *mut u16

a_log_tab: *mut u16

mod8_tab: *mut u32

ecc_buf: *mut u32

ecc_buf2: *mut u32

xi_tab: *mut c_uint

syn: *mut c_uint

cache: *mut c_int

elp: *mut gf_poly

poly_2t: [*mut gf_poly; 4]

databuf: *mut u8

Trait Implementations

impl Copy for bch_control

impl Clone for bch_control

fn clone(&self) -> bch_control

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for bch_control

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.