powlo.c 文件参考

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

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

浏览源代码.

宏定义
#define	getbit(p, bi)   ((p[(bi - 1) / LIMB_BITS] >> (bi - 1) % LIMB_BITS) & 1)

函数
static mp_bitcnt_t	count_bits (mp_srcptr p, mp_size_t n)
static mp_limb_t	getbits (const mp_limb_t *p, mp_bitcnt_t bi, mp_bitcnt_t nbits)
static void	lmmp_mullo_n_ (mp_ptr restrict dst, mp_srcptr restrict numa, mp_srcptr restrict numb, mp_size_t n, mp_ptr restrict tp)
void	lmmp_powlo_ (mp_ptr restrict dst, mp_srcptr restrict bp, mp_size_t n, mp_srcptr restrict ep, mp_size_t en)
static void	lmmp_sqrlo_n_ (mp_ptr restrict dst, mp_srcptr restrict numa, mp_size_t n, mp_ptr restrict tp)
	Copyright (C) 2026 HJimmyK(Jericho Knox)
static mp_size_t	win_size (mp_size_t eb)

宏定义说明

getbit

#define getbit	(		p,
			bi
	)		((p[(bi - 1) / LIMB_BITS] >> (bi - 1) % LIMB_BITS) & 1)

在文件 powlo.c 第 58 行定义.

函数说明

count_bits()

static mp_bitcnt_t count_bits ( mp_srcptr  p, mp_size_t  n  )

inlinestatic

在文件 powlo.c 第 79 行定义.

                                                               {
    return (n - 1) * LIMB_BITS + lmmp_limb_bits_(p[n - 1]);
}

引用了 LIMB_BITS, lmmp_limb_bits_ , 以及 n.

被这些函数引用 lmmp_powlo_().

这是这个函数的调用关系图:

getbits()

static mp_limb_t getbits ( const mp_limb_t *  p, mp_bitcnt_t  bi, mp_bitcnt_t  nbits  )

inlinestatic

在文件 powlo.c 第 60 行定义.

                                                                                       {
    mp_bitcnt_t nbits_in_r;
    mp_limb_t r;
    mp_size_t i;
 
    if (bi <= nbits) {
        return p[0] & (((mp_limb_t)1 << bi) - 1);
    } else {
        bi -= nbits;                     /* bit index of low bit to extract */
        i = bi / LIMB_BITS;              /* word index of low bit to extract */
        bi %= LIMB_BITS;                 /* bit index in low word */
        r = p[i] >> bi;                  /* extract (low) bits */
        nbits_in_r = LIMB_BITS - bi;     /* number of bits now in r */
        if (nbits_in_r < nbits)          /* did we get enough bits? */
            r += p[i + 1] << nbits_in_r; /* prepend bits from higher word */
        return r & (((mp_limb_t)1 << nbits) - 1);
    }
}

引用了 LIMB_BITS , 以及 n.

被这些函数引用 lmmp_powlo_().

这是这个函数的调用关系图:

lmmp_mullo_n_()

static void lmmp_mullo_n_ ( mp_ptr restrict  dst, mp_srcptr restrict  numa, mp_srcptr restrict  numb, mp_size_t  n, mp_ptr restrict  tp  )

inlinestatic

在文件 powlo.c 第 37 行定义.

  {
    if (n < MULLO_DC_THRESHOLD) {
        lmmp_mullo_dc_(dst, numa, numb, tp, n);
    } else {
        lmmp_mullo_fft_(dst, numa, numb, n, tp);
    }
}

引用了 lmmp_mullo_dc_(), lmmp_mullo_fft_(), MULLO_DC_THRESHOLD, n, numb , 以及 tp.

被这些函数引用 lmmp_powlo_().

函数调用图:

这是这个函数的调用关系图:

lmmp_powlo_()

void lmmp_powlo_	(	mp_ptr restrict	dst,
		mp_srcptr restrict	bp,
		mp_size_t	n,
		mp_srcptr restrict	ep,
		mp_size_t	en
	)

在文件 powlo.c 第 83 行定义.

                                                                                                               {
    lmmp_param_assert(ep[en - 1] > 0);
    lmmp_param_assert(n > 0 && en > 0);
    lmmp_param_assert(dst != NULL && bp != NULL && ep != NULL);
    mp_bitcnt_t cnt, ebi;
    unsigned windowsize, this_windowsize;
    mp_limb_t expbits;
    mp_limb_t* pp;
    long i;
    int flipflop;
    TEMP_DECL;
    mp_ptr restrict tp = TALLOC_TYPE(5 * n, mp_limb_t);
    mp_ptr restrict scratch = tp + 3 * n;
 
    ebi = count_bits(ep, en);
 
    windowsize = win_size(ebi);
    if (windowsize > 1) {
        mp_limb_t *this_pp, *last_pp;
        lmmp_debug_assert(windowsize < ebi);
 
        pp = TALLOC_TYPE((n << (windowsize - 1)), mp_limb_t);
 
        this_pp = pp;
 
        lmmp_copy(this_pp, bp, n);
 
        /* Store b^2 in tp.  */
        lmmp_sqrlo_n_(tp, bp, n, scratch);
 
        /* Precompute odd powers of b and put them in the temporary area at pp.  */
        i = (1 << (windowsize - 1)) - 1;
        do {
            last_pp = this_pp;
            this_pp += n;
            lmmp_mullo_n_(this_pp, last_pp, tp, n, scratch);
        } while (--i != 0);
 
        expbits = getbits(ep, ebi, windowsize);
        ebi -= windowsize;
 
        ctz_shr_u64(expbits, expbits, cnt);
        ebi += cnt;
 
        lmmp_copy(dst, pp + n * (expbits >> 1), n);
    } else {
        pp = tp + n;
        lmmp_copy(pp, bp, n);
        lmmp_copy(dst, bp, n);
        --ebi;
    }
 
    flipflop = 0;
 
    do {
        while (getbit(ep, ebi) == 0) {
            lmmp_sqrlo_n_(tp, dst, n, scratch);
            LMMP_SWAP(dst, tp, mp_ptr);
            flipflop = !flipflop;
            if (--ebi == 0)
                goto done;
        }
 
        /* The next bit of the exponent is 1.  Now extract the largest block of
    bits <= windowsize, and such that the least significant bit is 1.  */
 
        expbits = getbits(ep, ebi, windowsize);
        this_windowsize = LMMP_MIN(windowsize, ebi);
 
        ctz_shr_u64(expbits, expbits, cnt);
        this_windowsize -= cnt;
        ebi -= this_windowsize;
 
        while (this_windowsize > 1) {
            lmmp_sqrlo_n_(tp, dst, n, scratch);
            lmmp_sqrlo_n_(dst, tp, n, scratch);
            this_windowsize -= 2;
        }
 
        if (this_windowsize != 0)
            lmmp_sqrlo_n_(tp, dst, n, scratch);
        else {
            LMMP_SWAP(dst, tp, mp_ptr);
            flipflop = !flipflop;
        }
        lmmp_mullo_n_(dst, tp, pp + n * (expbits >> 1), n, scratch);
    } while (ebi != 0);
 
done:
    if (flipflop)
        lmmp_copy(tp, dst, n);
    TEMP_FREE;
}

引用了 count_bits(), ctz_shr_u64, getbit, getbits(), lmmp_copy, lmmp_debug_assert, LMMP_MIN, lmmp_mullo_n_(), lmmp_param_assert, lmmp_sqrlo_n_(), LMMP_SWAP, n, scratch, TALLOC_TYPE, TEMP_DECL, TEMP_FREE, tp , 以及 win_size().

函数调用图:

lmmp_sqrlo_n_()

static void lmmp_sqrlo_n_ ( mp_ptr restrict  dst, mp_srcptr restrict  numa, mp_size_t  n, mp_ptr restrict  tp  )

inlinestatic

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/.

在文件 powlo.c 第 24 行定义.

  {
    if (n < MULLO_DC_THRESHOLD) {
        lmmp_sqrlo_dc_(dst, numa, tp, n);
    } else {
        lmmp_mullo_fft_(dst, numa, numa, n, tp);
    }
}

引用了 lmmp_mullo_fft_(), lmmp_sqrlo_dc_(), MULLO_DC_THRESHOLD, n , 以及 tp.

被这些函数引用 lmmp_powlo_().

函数调用图:

这是这个函数的调用关系图:

win_size()

static mp_size_t win_size ( mp_size_t  eb )

inlinestatic

在文件 powlo.c 第 51 行定义.

                                               {
    mp_size_t k;
    static mp_bitcnt_t x[] = {7, 25, 81, 241, 673, 1793, 4609, 11521, 28161, ~(mp_bitcnt_t)0};
    for (k = 0; eb > x[k++];);
    return k;
}

引用了 k , 以及 n.

被这些函数引用 lmmp_powlo_().

这是这个函数的调用关系图: