Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\bch.c Create Date:2022-07-28 06:59:40
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:shorter and faster modulo function, only works when v < 2N.

Proto:static inline int mod_s(struct bch_control *bch, unsigned int v)

Type:int

Parameter:

TypeParameterName
struct bch_control *bch
unsigned intv
281  n = GF_N(bch)
282  Return If v < n Then v Else v - n
Caller
NameDescribe
gf_mulGalois field basic operations: multiply, divide, inverse, etc.
gf_sqr
gf_div
a_ilog
find_affine4_rootshis function builds and solves a linear system for finding roots of a degree* 4 affine monic polynomial X^4+aX^2+bX+c over GF(2^m).
find_poly_deg1_rootsmpute root r of a degree 1 polynomial over GF(2^m) (returned as log(1/r))
gf_poly_logrepld monic, log-based representation of a polynomial
gf_poly_modmpute polynomial Euclidean division remainder in GF(2^m)[X]
compute_generator_polynomialmpute generator polynomial for given (m,t) parameters.