函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

函数名称：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).

函数原型：static int find_affine4_roots(struct bch_control *bch, unsigned int a, unsigned int b, unsigned int c, unsigned int *roots)

返回类型：int

参数：

类型参数名称
struct bch_control *bch
unsigned inta
unsigned intb
unsigned intc
unsigned int *roots
523  m等于GF_M(bch)
524  unsigned int mask = 0xff, t, rows[16] = {0, }
526  j等于a_log(bch, b)
527  k等于a_log(bch, a)
528  rows[0]等于c
531  以i小于m循环
532  rows[i + 1]等于private: [4 * i]按位异或如果a则private: [shorter and faster modulo function, only works when v < 2N.]否则0按位异或如果b则private: [shorter and faster modulo function, only works when v < 2N.]否则0
535  j自加
536  k加等于2
542  以j不等于0循环
543  以k小于16循环
544  t等于rows[k]右移j位按位异或rows[k + j]的值按位与mask
545  rows[k]异或等于t左移j位
546  rows[k + j]异或等于t
549  返回:solve a m x m linear system in GF(2) with an expected number of solutions,* and return the number of found solutions
调用者
名称描述
find_poly_deg3_rootsmpute roots of a degree 3 polynomial over GF(2^m)
find_poly_deg4_rootsmpute roots of a degree 4 polynomial over GF(2^m)