函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

函数名称：Given a polynomial f and an integer k, compute Tr(a^kX) mod f* This is used in Berlekamp Trace algorithm for splitting polynomials

函数原型：static void compute_trace_bk_mod(struct bch_control *bch, int k, const struct gf_poly *f, struct gf_poly *z, struct gf_poly *out)

返回类型：void

参数：

类型参数名称
struct bch_control *bch
intk
const struct gf_poly *f
struct gf_poly *z
struct gf_poly *out
809  m等于GF_M(bch)
813  polynomial degree 等于1
814  polynomial terms [0]等于0
815  polynomial terms [1]等于private: [k]
817  polynomial degree 等于0
818  memset(out, 0, given its degree, compute a polynomial size in bytes (polynomial degree ))
821  ld monic, log-based representation of a polynomial
823  以i小于m循环
825  以j大于等于0循环
826  polynomial terms [j]异或等于polynomial terms [j]
827  polynomial terms [2 * j]等于gf_sqr(bch, polynomial terms [j])
828  polynomial terms [2 * j + 1]等于0
830  如果polynomial degree 大于polynomial degree 则polynomial degree 等于polynomial degree
833  如果i小于m减1则
834  polynomial degree 乘等于2
836  mpute polynomial Euclidean division remainder in GF(2^m)[X]
839  当非polynomial terms [polynomial degree ]且polynomial degree 循环
840  polynomial degree 自减
842  dbg("Tr(a^%d.X) mod f = %s\n", k, gf_poly_str(out))
调用者
名称描述
factor_polynomialactor a polynomial using Berlekamp Trace algorithm (BTA)