函数逻辑报告 |
Source Code:lib\mpi\generic_mpih-add1.c |
Create Date:2022-07-27 08:17:10 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称:mpihelp_add_n
函数原型:mpi_limb_t mpihelp_add_n(mpi_ptr_t res_ptr, mpi_ptr_t s1_ptr, mpi_ptr_t s2_ptr, mpi_size_t size)
返回类型:mpi_limb_t
参数:
| 类型 | 参数 | 名称 |
|---|---|---|
| mpi_ptr_t | res_ptr | |
| mpi_ptr_t | s1_ptr | |
| mpi_ptr_t | s2_ptr | |
| mpi_size_t | size |
| 36 | cy等于0 |
| 37 | 循环 |
| 47 | 返回:cy |
| 名称 | 描述 |
|---|---|
| mpihelp_divrem | Divide num (NP/NSIZE) by den (DP/DSIZE) and write* the NSIZE-DSIZE least significant quotient limbs at QP* and the DSIZE long remainder at NP. If QEXTRA_LIMBS is* non-zero, generate that many fraction bits and append them after the* other quotient limbs. |
| mul_n_basecase | Multiply the natural numbers u (pointed to by UP) and v (pointed to by VP),* both with SIZE limbs, and store the result at PRODP. 2 * SIZE limbs are* always stored. Return the most significant limb.* Argument constraints:* 1 |
| mul_n | |
| mpih_sqr_n_basecase | |
| mpih_sqr_n | |
| mpihelp_mul_karatsuba_case | |
| mpihelp_mul | Multiply the natural numbers u (pointed to by UP, with USIZE limbs)* and v (pointed to by VP, with VSIZE limbs), and store the result at* PRODP. USIZE + VSIZE limbs are always stored, but if the input* operands are normalized |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |