函数逻辑报告 |
Source Code:lib\bch.c |
Create Date:2022-07-27 07:57:19 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:mpute polynomial Euclidean division quotient in GF(2^m)[X]
函数原型:static void gf_poly_div(struct bch_control *bch, struct gf_poly *a, const struct gf_poly *b, struct gf_poly *q)
返回类型:void
参数:
类型 | 参数 | 名称 |
---|---|---|
struct bch_control * | bch | |
struct gf_poly * | a | |
const struct gf_poly * | b | |
struct gf_poly * | q |
761 | 如果polynomial degree 大于等于polynomial degree 则 |
766 | 内存复制(polynomial terms , & polynomial terms [polynomial degree ], (1 + polynomial degree ) * sizeof(unsignedint)) |
767 | 否则 |
768 | polynomial degree 等于0 |
769 | polynomial terms [0]等于0 |
名称 | 描述 |
---|---|
factor_polynomial | actor a polynomial using Berlekamp Trace algorithm (BTA) |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |