lib/reed_solomon/reed_solomon.c

62  * @fcr:	first root of RS code generator polynomial, index form
71 				   int fcr, int prim, int nroots, gfp_t gfp)
84 	rs->fcr = fcr;
135 	for (i = 0, root = fcr * prim; i < nroots; i++, root += prim) {
207  *  @fcr:	the first consecutive root of the rs code generator polynomial
214 					   int (*gffunc)(int), int fcr,
224 	if (fcr < 0 || fcr >= (1<<symsize))
253 		if (fcr != cd->fcr)
266 	rs->codec = codec_init(symsize, gfpoly, gffunc, fcr, prim, nroots, gfp);
282  *  @fcr:	the first consecutive root of the rs code generator polynomial
288 struct rs_control *init_rs_gfp(int symsize, int gfpoly, int fcr, int prim,
291 	return init_rs_internal(symsize, gfpoly, NULL, fcr, prim, nroots, gfp);
302  *  @fcr:	the first consecutive root of the rs code generator polynomial
308 					 int fcr, int prim, int nroots)
310 	return init_rs_internal(symsize, 0, gffunc, fcr, prim, nroots,