函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

函数名称：actor a polynomial using Berlekamp Trace algorithm (BTA)

函数原型：static void factor_polynomial(struct bch_control *bch, int k, struct gf_poly *f, struct gf_poly **g, struct gf_poly **h)

返回类型：void

参数：

类型参数名称
struct bch_control *bch
intk
struct gf_poly *f
struct gf_poly **g
struct gf_poly **h
851  f2等于poly_2t[0]
852  q等于poly_2t[1]
853  tk等于poly_2t[2]
854  z等于poly_2t[3]
857  dbg("factoring %s...\n", gf_poly_str(f))
859  g等于f
860  * h = NULL
863  Given a polynomial f and an integer k, compute Tr(a^kX) mod f* This is used in Berlekamp Trace algorithm for splitting polynomials
865  如果polynomial degree 大于0则
867  gf_poly_copy(f2, f)
868  gcd等于mpute polynomial GCD (Greatest Common Divisor) in GF(2^m)[X]
869  如果polynomial degree 小于polynomial degree 则
871  mpute polynomial Euclidean division quotient in GF(2^m)[X]
873  h等于poly
874  gf_poly_copy( * g, gcd)
875  gf_poly_copy( * h, q)
调用者
名称描述
find_poly_rootsd roots of a polynomial, using BTZ algorithm; see the beginning of this* file for details