pow_basecase.c 文件参考

#include "../../../include/lammp/impl/inlines.h"
#include "../../../include/lammp/impl/mparam.h"
#include "../../../include/lammp/impl/tmp_alloc.h"
#include "../../../include/lammp/lmmpn.h"
#include "../../../include/lammp/numth.h"

pow_basecase.c 的引用(Include)关系图:

浏览源代码.

宏定义
#define	b1   base
#define	b1n   n
#define	mul_b(_i_)
	Copyright (C) 2026 HJimmyK(Jericho Knox)

函数
mp_size_t	lmmp_pow_basecase_ (mp_ptr restrict dst, mp_size_t rn, mp_srcptr restrict base, mp_size_t n, ulong exp)

宏定义说明

b1

#define b1   base

b1n

#define b1n   n

mul_b

#define mul_b

(

_i_

)

值:

    lmmp_mul_(dst, sq, rn, b##_i_, b##_i_##n);     \
    rn += b##_i_##n;                               \
    rn -= (dst[rn - 1] == 0) ? 1 : 0

Copyright (C) 2026 HJimmyK(Jericho Knox)

This file is part of LAMMP.

LAMMP is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License (LGPL) as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version.

This program is distributed WITHOUT ANY WARRANTY.

See https://www.gnu.org/licenses/.

在文件 pow_basecase.c 第 23 行定义.

                                 : 0

函数说明

lmmp_pow_basecase_()

mp_size_t lmmp_pow_basecase_	(	mp_ptr restrict	dst,
		mp_size_t	rn,
		mp_srcptr restrict	base,
		mp_size_t	n,
		ulong	exp
	)

在文件 pow_basecase.c 第 28 行定义.

                                                                                                                 {
    lmmp_param_assert(exp >= 3);
    lmmp_param_assert(exp % 2 == 1);
    TEMP_DECL;
 
#define b1 base
#define b1n n
    mp_ptr restrict sq = TALLOC_TYPE(rn, mp_limb_t);
    rn = n;
    lmmp_copy(dst, base, n);
    lmmp_sqr_(sq, dst, rn);
    rn <<= 1;
    rn -= (sq[rn - 1] == 0) ? 1 : 0;
    int lz = lmmp_leading_zeros_(exp);
    int i = 62 - lz;
    exp <<= lz + 1;
/*
    For the intermediate 0, we will skip it entirely until the next 1, 
    and then perform a multiplication. This can reduce the extra copying 
    caused by sparse 1s and improve efficiency.
 */
    for ( ; i > 0; ) {
        lz = lmmp_leading_zeros_(exp);
        if (lz == 0) {
            mul_b(1);
 
            lmmp_sqr_(sq, dst, rn);
            rn <<= 1;
            rn -= (sq[rn - 1] == 0) ? 1 : 0;
            --i;
            exp <<= 1;
        } else {
            int j = 2;
            if (lz & 1) {
                lmmp_copy(dst, sq, rn);
                lmmp_sqr_(sq, dst, rn);
                rn <<= 1;
                rn -= (sq[rn - 1] == 0);
                ++j;
                for (; j <= lz; j += 2) {
                    lmmp_sqr_(dst, sq, rn);
                    rn <<= 1;
                    rn -= (dst[rn - 1] == 0);
                    lmmp_sqr_(sq, dst, rn);
                    rn <<= 1;
                    rn -= (sq[rn - 1] == 0);
                }
            } else {
                for (; j <= lz; j += 2) {
                    lmmp_sqr_(dst, sq, rn);
                    rn <<= 1;
                    rn -= (dst[rn - 1] == 0);
                    lmmp_sqr_(sq, dst, rn);
                    rn <<= 1;
                    rn -= (sq[rn - 1] == 0);
                }
            }
 
            i -= lz;
            exp <<= lz;
        }
    }
    lmmp_debug_assert(exp == LIMB_B_2);
 
    mul_b(1);
    
    TEMP_FREE;
    return rn;
 
#undef b1
#undef b1n
#undef new_b
}

引用了 LIMB_B_2, lmmp_copy, lmmp_debug_assert, lmmp_leading_zeros_, lmmp_param_assert, lmmp_sqr_, mul_b, n, TALLOC_TYPE, TEMP_DECL , 以及 TEMP_FREE.