| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/ulong_extras/ |
| H A D | factor_ecm_select_curve.c | 29 v = n_mulmod_preinv(u, UWORD(4) << n_ecm_inf->normbits, n, n_ecm_inf->ninv, in n_factor_ecm_select_curve()
33 w = n_mulmod_preinv(u, u, n, n_ecm_inf->ninv, n_ecm_inf->normbits); in n_factor_ecm_select_curve()
38 w = n_mulmod_preinv(u, u, n, n_ecm_inf->ninv, n_ecm_inf->normbits); in n_factor_ecm_select_curve()
44 w = n_mulmod_preinv(v, v, n, n_ecm_inf->ninv, n_ecm_inf->normbits); in n_factor_ecm_select_curve()
50 t = n_mulmod_preinv(w, UWORD(4) << n_ecm_inf->normbits, n, n_ecm_inf->ninv, in n_factor_ecm_select_curve()
52 w = n_mulmod_preinv(u, UWORD(3) << n_ecm_inf->normbits, n, n_ecm_inf->ninv, in n_factor_ecm_select_curve()
57 w = n_mulmod_preinv(u, u, n, n_ecm_inf->ninv, n_ecm_inf->normbits); in n_factor_ecm_select_curve()
58 u = n_mulmod_preinv(u, w, n, n_ecm_inf->ninv, n_ecm_inf->normbits); in n_factor_ecm_select_curve()
75 u = n_ll_mod_preinv(hi, lo, n, n_ecm_inf->ninv); in n_factor_ecm_select_curve()
77 v = n_mulmod_preinv(u, t, n, n_ecm_inf->ninv, n_ecm_inf->normbits); in n_factor_ecm_select_curve()
[all …]
|
| H A D | factor_pp1.c | 53 #define n_pp1_2k(x, y, n, ninv, x0, norm) \ argument
56 y = n_mulmod_preinv(y, x, n, ninv, norm); \
58 x = n_mulmod_preinv(x, x, n, ninv, norm); \
62 #define n_pp1_2kp1(x, y, n, ninv, x0, norm) \ argument
65 x = n_mulmod_preinv(x, y, n, ninv, norm); \
67 y = n_mulmod_preinv(y, y, n, ninv, norm); \
84 n_pp1_2kp1(*x, *y, n, ninv, x0, norm); in n_pp1_pow_ui()
86 n_pp1_2k(*x, *y, n, ninv, x0, norm); in n_pp1_pow_ui()
114 n_pp1_pow_ui(x, y, p, n, ninv, norm); in n_pp1_find_power()
125 mp_limb_t x, y = 0, oldx, oldy, ninv; in n_factor_pp1() local
[all …]
|
| H A D | factor_pollard_brent.c | 17 n_sqr_and_add_a(mp_limb_t y, mp_limb_t a, mp_limb_t n, mp_limb_t ninv, in n_sqr_and_add_a() argument
22 y = n_mulmod_preinv(y, y, n, ninv, normbits); in n_sqr_and_add_a()
38 n_factor_pollard_brent_single(mp_limb_t *factor, mp_limb_t n, mp_limb_t ninv, in n_factor_pollard_brent_single() argument
63 y = n_sqr_and_add_a(y, a, n, ninv, normbits); in n_factor_pollard_brent_single()
74 y = n_sqr_and_add_a(y, a, n, ninv, normbits); in n_factor_pollard_brent_single()
79 q = n_mulmod_preinv(q, subval, n, ninv, normbits); in n_factor_pollard_brent_single()
99 ys = n_sqr_and_add_a(ys, a, n, ninv, normbits); in n_factor_pollard_brent_single()
128 mp_limb_t normbits, a, x, n, ninv, max; in n_factor_pollard_brent() local
137 ninv = n_preinvert_limb(n); in n_factor_pollard_brent()
150 ret = n_factor_pollard_brent_single(factor, n, ninv, a, x, normbits, max_iters); in n_factor_pollard_brent()
|
| /dports/math/e-antic/flint2-ae7ec89/ulong_extras/ |
| H A D | factor_ecm_select_curve.c | 29 v = n_mulmod_preinv(u, UWORD(4) << n_ecm_inf->normbits, n, n_ecm_inf->ninv, in n_factor_ecm_select_curve()
33 w = n_mulmod_preinv(u, u, n, n_ecm_inf->ninv, n_ecm_inf->normbits); in n_factor_ecm_select_curve()
38 w = n_mulmod_preinv(u, u, n, n_ecm_inf->ninv, n_ecm_inf->normbits); in n_factor_ecm_select_curve()
44 w = n_mulmod_preinv(v, v, n, n_ecm_inf->ninv, n_ecm_inf->normbits); in n_factor_ecm_select_curve()
50 t = n_mulmod_preinv(w, UWORD(4) << n_ecm_inf->normbits, n, n_ecm_inf->ninv, in n_factor_ecm_select_curve()
52 w = n_mulmod_preinv(u, UWORD(3) << n_ecm_inf->normbits, n, n_ecm_inf->ninv, in n_factor_ecm_select_curve()
57 w = n_mulmod_preinv(u, u, n, n_ecm_inf->ninv, n_ecm_inf->normbits); in n_factor_ecm_select_curve()
58 u = n_mulmod_preinv(u, w, n, n_ecm_inf->ninv, n_ecm_inf->normbits); in n_factor_ecm_select_curve()
75 u = n_ll_mod_preinv(hi, lo, n, n_ecm_inf->ninv); in n_factor_ecm_select_curve()
77 v = n_mulmod_preinv(u, t, n, n_ecm_inf->ninv, n_ecm_inf->normbits); in n_factor_ecm_select_curve()
[all …]
|
| H A D | factor_pp1.c | 53 #define n_pp1_2k(x, y, n, ninv, x0, norm) \ argument
56 y = n_mulmod_preinv(y, x, n, ninv, norm); \
58 x = n_mulmod_preinv(x, x, n, ninv, norm); \
62 #define n_pp1_2kp1(x, y, n, ninv, x0, norm) \ argument
65 x = n_mulmod_preinv(x, y, n, ninv, norm); \
67 y = n_mulmod_preinv(y, y, n, ninv, norm); \
84 n_pp1_2kp1(*x, *y, n, ninv, x0, norm); in n_pp1_pow_ui()
86 n_pp1_2k(*x, *y, n, ninv, x0, norm); in n_pp1_pow_ui()
114 n_pp1_pow_ui(x, y, p, n, ninv, norm); in n_pp1_find_power()
125 mp_limb_t x, y = 0, oldx, oldy, ninv; in n_factor_pp1() local
[all …]
|
| H A D | factor_pollard_brent.c | 17 n_sqr_and_add_a(mp_limb_t y, mp_limb_t a, mp_limb_t n, mp_limb_t ninv, in n_sqr_and_add_a() argument
22 y = n_mulmod_preinv(y, y, n, ninv, normbits); in n_sqr_and_add_a()
38 n_factor_pollard_brent_single(mp_limb_t *factor, mp_limb_t n, mp_limb_t ninv, in n_factor_pollard_brent_single() argument
63 y = n_sqr_and_add_a(y, a, n, ninv, normbits); in n_factor_pollard_brent_single()
74 y = n_sqr_and_add_a(y, a, n, ninv, normbits); in n_factor_pollard_brent_single()
79 q = n_mulmod_preinv(q, subval, n, ninv, normbits); in n_factor_pollard_brent_single()
99 ys = n_sqr_and_add_a(ys, a, n, ninv, normbits); in n_factor_pollard_brent_single()
128 mp_limb_t normbits, a, x, n, ninv, max; in n_factor_pollard_brent() local
137 ninv = n_preinvert_limb(n); in n_factor_pollard_brent()
150 ret = n_factor_pollard_brent_single(factor, n, ninv, a, x, normbits, max_iters); in n_factor_pollard_brent()
|
| /dports/math/flint2/flint-2.8.4/ulong_extras/ |
| H A D | factor_ecm_select_curve.c | 29 v = n_mulmod_preinv(u, UWORD(4) << n_ecm_inf->normbits, n, n_ecm_inf->ninv, in n_factor_ecm_select_curve()
33 w = n_mulmod_preinv(u, u, n, n_ecm_inf->ninv, n_ecm_inf->normbits); in n_factor_ecm_select_curve()
38 w = n_mulmod_preinv(u, u, n, n_ecm_inf->ninv, n_ecm_inf->normbits); in n_factor_ecm_select_curve()
44 w = n_mulmod_preinv(v, v, n, n_ecm_inf->ninv, n_ecm_inf->normbits); in n_factor_ecm_select_curve()
50 t = n_mulmod_preinv(w, UWORD(4) << n_ecm_inf->normbits, n, n_ecm_inf->ninv, in n_factor_ecm_select_curve()
52 w = n_mulmod_preinv(u, UWORD(3) << n_ecm_inf->normbits, n, n_ecm_inf->ninv, in n_factor_ecm_select_curve()
57 w = n_mulmod_preinv(u, u, n, n_ecm_inf->ninv, n_ecm_inf->normbits); in n_factor_ecm_select_curve()
58 u = n_mulmod_preinv(u, w, n, n_ecm_inf->ninv, n_ecm_inf->normbits); in n_factor_ecm_select_curve()
75 u = n_ll_mod_preinv(hi, lo, n, n_ecm_inf->ninv); in n_factor_ecm_select_curve()
77 v = n_mulmod_preinv(u, t, n, n_ecm_inf->ninv, n_ecm_inf->normbits); in n_factor_ecm_select_curve()
[all …]
|
| H A D | factor_pp1.c | 53 #define n_pp1_2k(x, y, n, ninv, x0, norm) \ argument
56 y = n_mulmod_preinv(y, x, n, ninv, norm); \
58 x = n_mulmod_preinv(x, x, n, ninv, norm); \
62 #define n_pp1_2kp1(x, y, n, ninv, x0, norm) \ argument
65 x = n_mulmod_preinv(x, y, n, ninv, norm); \
67 y = n_mulmod_preinv(y, y, n, ninv, norm); \
84 n_pp1_2kp1(*x, *y, n, ninv, x0, norm); in n_pp1_pow_ui()
86 n_pp1_2k(*x, *y, n, ninv, x0, norm); in n_pp1_pow_ui()
114 n_pp1_pow_ui(x, y, p, n, ninv, norm); in n_pp1_find_power()
125 mp_limb_t x, y = 0, oldx, oldy, ninv; in n_factor_pp1() local
[all …]
|
| H A D | factor_pollard_brent.c | 17 n_sqr_and_add_a(mp_limb_t y, mp_limb_t a, mp_limb_t n, mp_limb_t ninv, in n_sqr_and_add_a() argument
22 y = n_mulmod_preinv(y, y, n, ninv, normbits); in n_sqr_and_add_a()
38 n_factor_pollard_brent_single(mp_limb_t *factor, mp_limb_t n, mp_limb_t ninv, in n_factor_pollard_brent_single() argument
63 y = n_sqr_and_add_a(y, a, n, ninv, normbits); in n_factor_pollard_brent_single()
74 y = n_sqr_and_add_a(y, a, n, ninv, normbits); in n_factor_pollard_brent_single()
79 q = n_mulmod_preinv(q, subval, n, ninv, normbits); in n_factor_pollard_brent_single()
99 ys = n_sqr_and_add_a(ys, a, n, ninv, normbits); in n_factor_pollard_brent_single()
128 mp_limb_t normbits, a, x, n, ninv, max; in n_factor_pollard_brent() local
137 ninv = n_preinvert_limb(n); in n_factor_pollard_brent()
150 ret = n_factor_pollard_brent_single(factor, n, ninv, a, x, normbits, max_iters); in n_factor_pollard_brent()
|
| /dports/math/ntl/ntl-11.5.1/include/NTL/ |
| H A D | sp_arith.h | 73 return double(b)*ninv;
478 return wide_double(b)*ninv; in PrepMulDivRem()
495 return MulMod(a, b, n, ninv); in NormalizedMulMod()
586 double ninv = 1/double(n); in sp_NormalizedPrepMulMod() local
621 long q1 = long(fr*ninv); in sp_NormalizedPrepMulMod()
684 return sp_NormalizedMulMod(a, b << ninv.shamt, n << ninv.shamt, ninv.inv) >> ninv.shamt; in MulMod()
697 NormalizedModulus(sp_inverse ninv) { return ninv.shamt == 0; } in NormalizedModulus() argument
721 …return sp_NormalizedMulModWithQuo(qres, a, b << ninv.shamt, n << ninv.shamt, ninv.inv) >> ninv.sha… in MulModWithQuo()
770 …return sp_NormalizedPrepMulModPrecon(b << ninv.shamt, n << ninv.shamt, ninv.inv) << (NTL_BITS_PER_… in PrepMulModPrecon()
913 mulmod_t ninv) in VectorMulMod() argument
[all …]
|
| /dports/science/dynare/dynare-4.6.4/contrib/ms-sbvar/TZcode/MatlabFiles/ |
| H A D | fn_empdfsort.m | 1 function imfcnt = fn_empdfsort(imfcnt,imf_h,imfloor,hbin,ninv)
2 % imfcnt = fn_empdfsort(imfcnt,imf_h,imfloor,hbin,ninv)
6 % (=(imceiling-imfloor)*hbin), this function allows ninv+2 bins for each variable
12 % hbin: k-element vector of bin lengths = (imceilling-imfloor)/ninv.
13 % ninv: number of bins between "imfloor" and "imceiling"
15 % imfcnt: updated ninv+2-by-k matrix of counts (probability)
39 % bin locations from <0, 0, 1,..., ninv-1, >=ninv, a total of ninv+2 bins
44 countInt(find(countInt>=ninv+2)) = ninv+2; % set >=ninv+2 or +infinity at ninv+2 to end
45 countInt = countInt + (0:length(countInt)-1)*(ninv+2);
46 % 1-by-k*(ninv+2) index vector to fill the matrix with prob. (counts)
[all …]
|
| H A D | empdfsort.m | 1 function imfcnt = empdfsort(imfcnt,imf_h,imfloor,hbin,ninv)
2 % imfcnt = empdfsort(imfcnt,imf_h,imfloor,hbin,ninv)
6 % (=(imceiling-imfloor)*hbin), this function allows ninv+2 bins for each variable
8 % imfcnt: initial ninv+2-by-k matrix that records counts in each bin given a column in imfcnt
12 % hbin: bin size = (imceilling-imfloor)/ninv
13 % ninv: number of bins between "imfloor" and "imceiling"
15 % imfcnt: updated ninv+2-by-k matrix of counts (probability)
38 % bin locations from <0, 0, 1,..., ninv-1, >=ninv, a total of ninv+2 bins
43 countInt(find(countInt>=ninv+2)) = ninv+2; % set >=ninv+2 or +infinity at ninv+2 to end
44 countInt = countInt + (0:length(countInt)-1)*(ninv+2); % index to fill the matrix with prob. (coun…
[all …]
|
| H A D | pdfforg.m | 1 function [imfpdf,imfpo,imfprob] = pdfforg(imfcnt,imndraws,forep,nvar,ninv,invc,Am)
2 % [imfpdf,imfpo,imfprob] = pdfforg(imfcnt,imndraws,forep,nvar,ninv,invc,Am)
9 % ninv: the number of small interior intervals for sorting.
15 % imfpdf: 2+ninv-by-forep*nvar. Density
38 invlength = invc ./ ninv;
39 invlengthM = repmat(invlength,[2+ninv,1]);
40 invlengthM([1 2+ninv],:) = 1;
47 imfpo = [1:2+ninv]'; % positions for each forecast
50 invcM = repmat(invc,[2+ninv,1]);
51 AmM = repmat(Am,[2+ninv,1]);
[all …]
|
| H A D | fn_histpdfcnt.m | 17 % Must set ncom so that ninv can be divided
25 % imfpdf: 2+ninv-by-k. Density (NOT probability)
26 % imfpo: 2+ninv-by-k. Bin position (x-axis) in relation to imfs3
27 % imfprob: 2+ninv-by-k. Probability (NOT density) at each bin
54 invlengthM = repmat(hbin',[2+ninv,1]);
63 imfpo = [1:2+ninv]'; % positions for each forecast
66 imfloorM = repmat(imfloor',[2+ninv,1]);
67 imfpo = (imfpo .* invlengthM) + imfloorM; % 2+ninv-by-k
71 if mod(ninv,ncom)
72 warning('Set ncom so that ninv can be divided')
[all …]
|
| /dports/math/pari/pari-2.13.3/src/kernel/none/ |
| H A D | divll_pre.h | 47 divll_pre_normalized(ulong u1, ulong u0, ulong n, ulong ninv, ulong *pt_r) in divll_pre_normalized() argument
52 q0 = mulll(ninv, u1); q1 = hiremainder; in divll_pre_normalized()
68 remll_pre_normalized(ulong u1, ulong u0, ulong n, ulong ninv) in remll_pre_normalized() argument
73 q0 = mulll(ninv, u1); q1 = hiremainder; in remll_pre_normalized()
83 remll_pre(ulong a_hi, ulong a_lo, ulong n, ulong ninv) in remll_pre() argument
92 a_hi = remll_pre_normalized(u1, u0, sn, ninv) >> norm; in remll_pre()
98 return remll_pre_normalized(u1, u0, sn, ninv) >> norm; in remll_pre()
103 extern ulong divll_pre(ulong a_lo, ulong n, ulong ninv);
107 #define divll_pre(a, n, ninv) \ argument
122 divll_pre(ulong a_lo, ulong n, ulong ninv) in divll_pre() argument
[all …]
|
| /dports/math/e-antic/flint2-ae7ec89/fmpz_factor/ |
| H A D | ecm_select_curve.c | 53 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
56 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
63 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
66 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
69 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
72 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
75 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
80 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
85 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
92 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
[all …]
|
| H A D | factor_pp1.c | 87 pp1_mulmod(y, y, x, nn, n, ninv, norm); in pp1_2k()
91 pp1_mulmod(x, x, x, nn, n, ninv, norm); in pp1_2k()
99 pp1_mulmod(x, x, y, nn, n, ninv, norm); in pp1_2kp1()
103 pp1_mulmod(y, y, y, nn, n, ninv, norm); in pp1_2kp1()
119 pp1_mulmod(y, x, x, nn, n, ninv, norm); in pp1_pow_ui()
126 pp1_2kp1(x, y, nn, n, ninv, x0, norm); in pp1_pow_ui()
128 pp1_2k(x, y, nn, n, ninv, x0, norm); in pp1_pow_ui()
180 pp1_pow_ui(x, y, nn, p, n, ninv, norm); in pp1_find_power()
216 ninv = flint_malloc(nn*sizeof(mp_limb_t)); in fmpz_factor_pp1()
234 flint_mpn_preinvn(ninv, n, nn); in fmpz_factor_pp1()
[all …]
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz_factor/ |
| H A D | ecm_select_curve.c | 53 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
56 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
63 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
66 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
69 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
72 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
75 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
80 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
85 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
92 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
[all …]
|
| H A D | factor_pp1.c | 87 pp1_mulmod(y, y, x, nn, n, ninv, norm); in pp1_2k()
91 pp1_mulmod(x, x, x, nn, n, ninv, norm); in pp1_2k()
99 pp1_mulmod(x, x, y, nn, n, ninv, norm); in pp1_2kp1()
103 pp1_mulmod(y, y, y, nn, n, ninv, norm); in pp1_2kp1()
119 pp1_mulmod(y, x, x, nn, n, ninv, norm); in pp1_pow_ui()
126 pp1_2kp1(x, y, nn, n, ninv, x0, norm); in pp1_pow_ui()
128 pp1_2k(x, y, nn, n, ninv, x0, norm); in pp1_pow_ui()
180 pp1_pow_ui(x, y, nn, p, n, ninv, norm); in pp1_find_power()
216 ninv = flint_malloc(nn*sizeof(mp_limb_t)); in fmpz_factor_pp1()
234 flint_mpn_preinvn(ninv, n, nn); in fmpz_factor_pp1()
[all …]
|
| /dports/math/flint2/flint-2.8.4/fmpz_factor/ |
| H A D | ecm_select_curve.c | 53 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
56 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
63 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
66 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
69 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
72 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
75 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
80 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
85 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
92 n, ecm_inf->ninv, ecm_inf->normbits); in fmpz_factor_ecm_select_curve()
[all …]
|
| H A D | factor_pp1.c | 87 pp1_mulmod(y, y, x, nn, n, ninv, norm); in pp1_2k()
91 pp1_mulmod(x, x, x, nn, n, ninv, norm); in pp1_2k()
99 pp1_mulmod(x, x, y, nn, n, ninv, norm); in pp1_2kp1()
103 pp1_mulmod(y, y, y, nn, n, ninv, norm); in pp1_2kp1()
119 pp1_mulmod(y, x, x, nn, n, ninv, norm); in pp1_pow_ui()
126 pp1_2kp1(x, y, nn, n, ninv, x0, norm); in pp1_pow_ui()
128 pp1_2k(x, y, nn, n, ninv, x0, norm); in pp1_pow_ui()
180 pp1_pow_ui(x, y, nn, p, n, ninv, norm); in pp1_find_power()
216 ninv = flint_malloc(nn*sizeof(mp_limb_t)); in fmpz_factor_pp1()
234 flint_mpn_preinvn(ninv, n, nn); in fmpz_factor_pp1()
[all …]
|
| /dports/math/e-antic/flint2-ae7ec89/arith/ |
| H A D | bell_number_nmod.c | 37 return n_mod2_preinv(bell_number_tab[n], mod.n, mod.ninv); in arith_bell_number_nmod()
56 facs[i] = n_mulmod2_preinv(facs[i + 1], i + 1, mod.n, mod.ninv); in arith_bell_number_nmod()
60 pows[0] = n_powmod2_ui_preinv(0, n, mod.n, mod.ninv); in arith_bell_number_nmod()
61 pows[1] = n_powmod2_ui_preinv(1, n, mod.n, mod.ninv); in arith_bell_number_nmod()
66 pows[i] = n_powmod2_ui_preinv(i, n, mod.n, mod.ninv); in arith_bell_number_nmod()
71 pows[j], mod.n, mod.ninv); in arith_bell_number_nmod()
82 u = n_mulmod2_preinv(u, facs[n - i], mod.n, mod.ninv); in arith_bell_number_nmod()
83 u = n_mulmod2_preinv(u, t, mod.n, mod.ninv); in arith_bell_number_nmod()
89 u = n_mulmod2_preinv(u, u, mod.n, mod.ninv); in arith_bell_number_nmod()
90 s = n_mulmod2_preinv(s, u, mod.n, mod.ninv); in arith_bell_number_nmod()
|
| /dports/math/flint2/flint-2.8.4/arith/ |
| H A D | bell_number_nmod.c | 37 return n_mod2_preinv(bell_number_tab[n], mod.n, mod.ninv); in arith_bell_number_nmod()
56 facs[i] = n_mulmod2_preinv(facs[i + 1], i + 1, mod.n, mod.ninv); in arith_bell_number_nmod()
60 pows[0] = n_powmod2_ui_preinv(0, n, mod.n, mod.ninv); in arith_bell_number_nmod()
61 pows[1] = n_powmod2_ui_preinv(1, n, mod.n, mod.ninv); in arith_bell_number_nmod()
66 pows[i] = n_powmod2_ui_preinv(i, n, mod.n, mod.ninv); in arith_bell_number_nmod()
71 pows[j], mod.n, mod.ninv); in arith_bell_number_nmod()
82 u = n_mulmod2_preinv(u, facs[n - i], mod.n, mod.ninv); in arith_bell_number_nmod()
83 u = n_mulmod2_preinv(u, t, mod.n, mod.ninv); in arith_bell_number_nmod()
89 u = n_mulmod2_preinv(u, u, mod.n, mod.ninv); in arith_bell_number_nmod()
90 s = n_mulmod2_preinv(s, u, mod.n, mod.ninv); in arith_bell_number_nmod()
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/arith/ |
| H A D | bell_number_nmod.c | 37 return n_mod2_preinv(bell_number_tab[n], mod.n, mod.ninv); in arith_bell_number_nmod()
56 facs[i] = n_mulmod2_preinv(facs[i + 1], i + 1, mod.n, mod.ninv); in arith_bell_number_nmod()
60 pows[0] = n_powmod2_ui_preinv(0, n, mod.n, mod.ninv); in arith_bell_number_nmod()
61 pows[1] = n_powmod2_ui_preinv(1, n, mod.n, mod.ninv); in arith_bell_number_nmod()
66 pows[i] = n_powmod2_ui_preinv(i, n, mod.n, mod.ninv); in arith_bell_number_nmod()
71 pows[j], mod.n, mod.ninv); in arith_bell_number_nmod()
82 u = n_mulmod2_preinv(u, facs[n - i], mod.n, mod.ninv); in arith_bell_number_nmod()
83 u = n_mulmod2_preinv(u, t, mod.n, mod.ninv); in arith_bell_number_nmod()
89 u = n_mulmod2_preinv(u, u, mod.n, mod.ninv); in arith_bell_number_nmod()
90 s = n_mulmod2_preinv(s, u, mod.n, mod.ninv); in arith_bell_number_nmod()
|
| /dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/linalg/bwc/flint-fft/ |
| H A D | ulong_extras.h | 161 ulong norm, ninv; in n_preinvert_limb() local
164 invert_limb(ninv, n << norm); in n_preinvert_limb()
166 return ninv; in n_preinvert_limb()
184 ulong a_lo, ulong n, ulong ninv);
196 return n_ll_mod_preinv(p1, p2, n, ninv); in n_mulmod2_preinv()
201 ulong p1, p2, ninv; in n_mulmod2() local
205 ninv = n_preinvert_limb(n); in n_mulmod2()
236 ulong ninv; in n_powmod2() local
240 ninv = n_preinvert_limb(n); in n_powmod2()
393 ulong ninv, ulong ai,
[all …]
|