函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

函数名称：mpute roots of a degree 3 polynomial over GF(2^m)

函数原型：static int find_poly_deg3_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots)

返回类型：int

参数：

类型参数名称
struct bch_control *bch
struct gf_poly *poly
unsigned int *roots
615  n等于0
618  如果polynomial terms [0]则
620  e3等于polynomial terms [3]
621  c2等于gf_div(bch, polynomial terms [0], e3)
622  b2等于gf_div(bch, polynomial terms [1], e3)
623  a2等于gf_div(bch, polynomial terms [2], e3)
626  c等于Galois field basic operations: multiply, divide, inverse, etc.
627  b等于Galois field basic operations: multiply, divide, inverse, etc. 按位异或c2
628  a等于gf_sqr(bch, a2)按位异或b2
631  如果his function builds and solves a linear system for finding roots of a degree* 4 affine monic polynomial X^4+aX^2+bX+c over GF(2^m).恒等于4则
633  以i小于4循环
634  如果tmp[i]不等于a2则roots[n++]等于a_ilog(bch, tmp[i])
639  返回:n
调用者
名称描述
find_poly_rootsd roots of a polynomial, using BTZ algorithm; see the beginning of this* file for details