Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

Name:mpute polynomial GCD (Greatest Common Divisor) in GF(2^m)[X]

Proto:static struct gf_poly *gf_poly_gcd(struct bch_control *bch, struct gf_poly *a, struct gf_poly *b)

Type:struct gf_poly

Parameter:

TypeParameterName
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  If polynomial degree < polynomial degree Then
784  tmp = b
785  b = a
786  a = tmp
789  When polynomial degree > 0 cycle
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  Return a
Caller
NameDescribe
factor_polynomialactor a polynomial using Berlekamp Trace algorithm (BTA)