函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

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

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

返回类型：int

参数：

类型参数名称
struct bch_control *bch
struct gf_poly *poly
unsigned int *roots
648  n等于0
649  e等于0
651  如果polynomial terms [0]恒等于0则返回:0
655  e4等于polynomial terms [4]
656  d等于gf_div(bch, polynomial terms [0], e4)
657  c等于gf_div(bch, polynomial terms [1], e4)
658  b等于gf_div(bch, polynomial terms [2], e4)
659  a等于gf_div(bch, polynomial terms [3], e4)
662  如果a则
664  如果c则
666  f等于gf_div(bch, c, a)
667  l等于a_log(bch, f)
668  l加等于如果l按位与1则GF_N(bch)否则0
669  e等于a_pow(bch, l / 2)
677  d等于a_pow(bch, 2 * l)按位异或Galois field basic operations: multiply, divide, inverse, etc. 按位异或d
678  b等于Galois field basic operations: multiply, divide, inverse, etc. 按位异或b
681  如果d恒等于0则返回:0
685  c2等于gf_inv(bch, d)
686  b2等于gf_div(bch, a, d)
687  a2等于gf_div(bch, b, d)
688  否则
690  c2等于d
691  b2等于c
692  a2等于b
695  如果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则
696  以i小于4循环
698  f等于如果a则gf_inv(bch, roots[i])否则roots[i]
699  roots[i]等于a_ilog(bch, f ^ e)
701  n等于4
703  返回:n
调用者
名称描述
find_poly_rootsd roots of a polynomial, using BTZ algorithm; see the beginning of this* file for details