函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

函数名称：mpute polynomial Euclidean division remainder in GF(2^m)[X]

函数原型：static void gf_poly_mod(struct bch_control *bch, struct gf_poly *a, const struct gf_poly *b, int *rep)

返回类型：void

参数：

类型参数名称
struct bch_control *bch
struct gf_poly *a
const struct gf_poly *b
int *rep
726  c等于polynomial terms
727  d等于polynomial degree
729  如果polynomial degree 小于d则返回
733  如果非rep则
734  rep等于cache
735  ld monic, log-based representation of a polynomial
738  以j大于等于d循环
739  如果c[j]则
740  la等于a_log(bch, c[j])
741  p等于j减d
742  以i小于d循环
743  m等于rep[i]
744  如果m大于等于0则c[p]异或等于private: [shorter and faster modulo function, only works when v < 2N.]
750  polynomial degree 等于d减1
751  当非c[polynomial degree ]且polynomial degree 循环
752  polynomial degree 自减
调用者
名称描述
gf_poly_divmpute polynomial Euclidean division quotient in GF(2^m)[X]
gf_poly_gcdmpute polynomial GCD (Greatest Common Divisor) in GF(2^m)[X]
compute_trace_bk_modGiven a polynomial f and an integer k, compute Tr(a^kX) mod f* This is used in Berlekamp Trace algorithm for splitting polynomials