函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\bch.c Create Date:2022-07-27 07:57:04
Last Modify:2020-03-12 14:18:49 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

函数名称:shorter and faster modulo function, only works when v < 2N.

函数原型:static inline int mod_s(struct bch_control *bch, unsigned int v)

返回类型:int

参数:

类型参数名称
struct bch_control *bch
unsigned intv
281  n等于GF_N(bch)
282  返回:如果v小于nv否则vn
调用者
名称描述
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.