Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

Name:d roots of a polynomial, using BTZ algorithm; see the beginning of this* file for details

Proto:static int find_poly_roots(struct bch_control *bch, unsigned int k, struct gf_poly *poly, unsigned int *roots)

Type:int

Parameter:

TypeParameterName
struct bch_control *bch
unsigned intk
struct gf_poly *poly
unsigned int *roots
892  Case polynomial degree == 1
893  cnt = mpute root r of a degree 1 polynomial over GF(2^m) (returned as log(1/r))
894  Break
895  Case polynomial degree == 2
896  cnt = mpute roots of a degree 2 polynomial over GF(2^m)
897  Break
898  Case polynomial degree == 3
899  cnt = mpute roots of a degree 3 polynomial over GF(2^m)
900  Break
901  Case polynomial degree == 4
902  cnt = mpute roots of a degree 4 polynomial over GF(2^m)
903  Break
904  Default
906  cnt = 0
907  If polynomial degree && k <= GF_M(bch) Then
908  actor a polynomial using Berlekamp Trace algorithm (BTA)
909  If f1 Then cnt += d roots of a polynomial, using BTZ algorithm; see the beginning of this* file for details
911  If f2 Then cnt += d roots of a polynomial, using BTZ algorithm; see the beginning of this* file for details
914  Break
916  Return cnt
Caller
NameDescribe
find_poly_rootsd roots of a polynomial, using BTZ algorithm; see the beginning of this* file for details
decode_bchdecode_bch - decode received codeword and find bit error locations*@bch: BCH control structure*@data: received data, ignored if @calc_ecc is provided*@len: data length in bytes, must always be provided*@recv_ecc: received ecc, if NULL then assume it was