函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

函数名称：mpute polynomial GCD (Greatest Common Divisor) in GF(2^m)[X]

函数原型：static struct gf_poly *gf_poly_gcd(struct bch_control *bch, struct gf_poly *a, struct gf_poly *b)

返回类型：struct gf_poly

参数：

类型参数名称
struct bch_control *bch
struct gf_poly *a
struct gf_poly *b
781  dbg("gcd(%s,%s)=", gf_poly_str(a), gf_poly_str(b))
783  如果polynomial degree 小于polynomial degree 则
784  tmp等于b
785  b等于a
786  a等于tmp
789  当polynomial degree 大于0循环
790  mpute polynomial Euclidean division remainder in GF(2^m)[X]
791  tmp等于b
792  b等于a
793  a等于tmp
796  dbg("%s\n", gf_poly_str(a))
798  返回:a
调用者
名称描述
factor_polynomialactor a polynomial using Berlekamp Trace algorithm (BTA)