函数逻辑报告 |
Source Code:lib\bch.c |
Create Date:2022-07-27 07:57:04 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:shorter and faster modulo function, only works when v < 2N.
函数原型:static inline int mod_s(struct bch_control *bch, unsigned int v)
返回类型:int
参数:
类型 | 参数 | 名称 |
---|---|---|
struct bch_control * | bch | |
unsigned int | v |
名称 | 描述 |
---|---|
gf_mul | Galois field basic operations: multiply, divide, inverse, etc. |
gf_sqr | |
gf_div | |
a_ilog | |
find_affine4_roots | 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). |
find_poly_deg1_roots | mpute root r of a degree 1 polynomial over GF(2^m) (returned as log(1/r)) |
gf_poly_logrep | ld monic, log-based representation of a polynomial |
gf_poly_mod | mpute polynomial Euclidean division remainder in GF(2^m)[X] |
compute_generator_polynomial | mpute generator polynomial for given (m,t) parameters. |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |