rslib.h File Reference

#include <linux/list.h>

Go to the source code of this file.

Data Structures
struct	rs_control

Functions
struct rs_control *	init_rs (int symsize, int gfpoly, int fcr, int prim, int nroots)
struct rs_control *	init_rs_non_canonical (int symsize, int(*func)(int), int fcr, int prim, int nroots)
void	free_rs (struct rs_control *rs)

Function Documentation

void free_rs

(

struct rs_control *

rs

)

free_rs - Free the rs control structure, if it is no longer used : the control structure which is not longer used by the caller

Definition at line 171 of file reed_solomon.c.

struct rs_control* init_rs ( int  symsize, int  gfpoly, int  fcr, int  prim, int  nroots  )

read

init_rs - Find a matching or allocate a new rs control structure : the symbol size (number of bits) : the extended Galois field generator polynomial coefficients, with the 0th coefficient in the low order bit. The polynomial must be primitive; : the first consecutive root of the rs code generator polynomial in index form : primitive element to generate polynomial roots : RS code generator polynomial degree (number of roots)

Definition at line 260 of file reed_solomon.c.

struct rs_control* init_rs_non_canonical ( int  symsize, int(*)(int)  gffunc, int  fcr, int  prim, int  nroots  )

read

init_rs_non_canonical - Find a matching or allocate a new rs control structure, for fields with non-canonical representation : the symbol size (number of bits) : pointer to function to generate the next field element, or the multiplicative identity element if given 0. Used instead of gfpoly if gfpoly is 0 : the first consecutive root of the rs code generator polynomial in index form : primitive element to generate polynomial roots : RS code generator polynomial degree (number of roots)

Definition at line 279 of file reed_solomon.c.