7#include "../../../include/lammp/impl/tmp_alloc.h"
8#include "../../../include/lammp/lmmpn.h"
9#include "../../../include/lammp/numth.h"
16 }
else if (un == vn) {
20 }
else if (cmp == 0) {
32 while (
bn > 0 || (
bn == 1 && b[0] == 0)) {
37 while (dst[
bn - 1] == 0 &&
bn > 0) {
mp_size_t lmmp_gcd_basecase_(mp_ptr dst, mp_srcptr up, mp_size_t un, mp_srcptr vp, mp_size_t vn)
计算两个无符号整数的最大公约数(不建议使用此算法,更高版本可能被彻底弃用)
#define LMMP_SWAP(x, y, type)
#define lmmp_copy(dst, src, n)
const mp_limb_t * mp_srcptr
#define lmmp_param_assert(x)
static int lmmp_cmp_(mp_srcptr numa, mp_srcptr numb, mp_size_t n)
大数比较函数(内联)
void lmmp_div_(mp_ptr dstq, mp_ptr dstr, mp_srcptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb)
大数除法和取模操作
#define TALLOC_TYPE(n, type)