LMMP 4.3.0
Lamina High-Precision Arithmetic Library
载入中...
搜索中...
未找到
pow_1.c
浏览该文件的文档.
1/**
2 * Copyright (C) 2026 HJimmyK (Jericho Knox)
3 *
4 * This file is part of LMMP.
5 *
6 * LMMP is free software: you can redistribute it and/or modify it
7 * under the terms of the GNU Lesser General Public License as
8 * published by the Free Software Foundation; either version 3 of
9 * the License, or (at your option) any later version.
10 *
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU Lesser General Public License for more details.
15 *
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library. If not, see
18 * <https://www.gnu.org/licenses/>.
19 *
20 * SPDX-License-Identifier: LGPL-3.0-or-later
21 */
22
23#include "impl/inlines.h"
24#include "mparam.h"
25#include "impl/mul_hard.h"
26#include "impl/tmp_alloc.h"
27#include "lmmp/lmmpn.h"
28#include "lmmp/numth.h"
29
30
32 dst[0] = 1;
33 return 1;
34}
35
37 lmmp_zero(dst, exp / LIMB_BITS);
38 dst[exp / LIMB_BITS] = (1ull << (exp % LIMB_BITS));
39 rn = exp / LIMB_BITS + 1;
40 return rn;
41}
42
44 exp <<= 1;
45 lmmp_zero(dst, exp / LIMB_BITS);
46 dst[exp / LIMB_BITS] = (1ull << (exp % LIMB_BITS));
47 rn = exp / LIMB_BITS + 1;
48 return rn;
49}
50
52 exp *= 3;
53 lmmp_zero(dst, exp / LIMB_BITS);
54 dst[exp / LIMB_BITS] = (1ull << (exp % LIMB_BITS));
55 rn = exp / LIMB_BITS + 1;
56 return rn;
57}
58
61 static const mp_limb_t tab[32] = {
62 1, 3, 9, 27, 81, 243, 729, 2187,
63 6561, 19683, 59049, 177147, 531441, 1594323, 4782969, 14348907,
64 43046721, 129140163, 387420489, 1162261467, 3486784401, 10460353203, 31381059609, 94143178827,
65 282429536481,847288609443,2541865828329,7625597484987,22876792454961,68630377364883,205891132094649,617673396283947,
66 };
67
69 rn = 1;
70 sq[0] = 1;
71 int i = 12;
72 while ((exp & (0x1full << ((i--) * 5))) == 0);
73 for (++i; i >= 0; --i) {
74 mp_size_t p = (exp & (0x1full << (i * 5))) >> (i * 5);
75 dst[rn] = lmmp_mul_1_(dst, sq, rn, tab[p]);
76 ++rn;
77 rn -= (dst[rn - 1] == 0) ? 1 : 0;
78 if (i > 0) {
79 lmmp_sqr_(sq, dst, rn);
80 rn <<= 1;
81 rn -= (sq[rn - 1] == 0) ? 1 : 0;
82
83 lmmp_sqr_(dst, sq, rn);
84 rn <<= 1;
85 rn -= (dst[rn - 1] == 0) ? 1 : 0;
86
87 lmmp_sqr_(sq, dst, rn);
88 rn <<= 1;
89 rn -= (sq[rn - 1] == 0) ? 1 : 0;
90
91 lmmp_sqr_(dst, sq, rn);
92 rn <<= 1;
93 rn -= (dst[rn - 1] == 0) ? 1 : 0;
94
95 lmmp_sqr_(sq, dst, rn);
96 rn <<= 1;
97 rn -= (sq[rn - 1] == 0) ? 1 : 0;
98 }
99 }
100 TEMP_FREE;
101 return rn;
102}
103
104#define define_1_npow_1_(_n_) \
105 static mp_size_t lmmp_##_n_##pow_1_(mp_ptr restrict dst, mp_size_t rn, ulong exp) { \
106 TEMP_DECL; \
107 static const mp_limb_t tab[16] = { \
108 1, \
109 (mp_limb_t)_n_, \
110 (mp_limb_t)_n_ * _n_, \
111 (mp_limb_t)_n_ * _n_ * _n_, \
112 (mp_limb_t)_n_ * _n_ * _n_ * _n_, \
113 (mp_limb_t)_n_ * _n_ * _n_ * _n_ * _n_, \
114 (mp_limb_t)_n_ * _n_ * _n_ * _n_ * _n_ * _n_, \
115 (mp_limb_t)_n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_, \
116 (mp_limb_t)_n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_, \
117 (mp_limb_t)_n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_, \
118 (mp_limb_t)_n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_, \
119 (mp_limb_t)_n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_, \
120 (mp_limb_t)_n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_, \
121 (mp_limb_t)_n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_, \
122 (mp_limb_t)_n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_, \
123 (mp_limb_t)_n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_ * _n_}; \
124 \
125 mp_size_t sqn = (rn + 2) >> 1; \
126 mp_ptr restrict sq = TALLOC_TYPE(sqn, mp_limb_t); \
127 rn = 1; \
128 dst[0] = 1; \
129 int i = 15; \
130 while ((exp & (0xfull << ((i--) * 4))) == 0); \
131 for (++i; i >= 0; --i) { \
132 mp_size_t p = (exp & (0xfull << (i * 4))) >> (i * 4); \
133 dst[rn] = lmmp_mul_1_(dst, dst, rn, tab[p]); \
134 ++rn; \
135 rn -= (dst[rn - 1] == 0) ? 1 : 0; \
136 if (i > 0) { \
137 lmmp_sqr_(sq, dst, rn); \
138 rn <<= 1; \
139 rn -= (sq[rn - 1] == 0) ? 1 : 0; \
140 \
141 lmmp_sqr_(dst, sq, rn); \
142 rn <<= 1; \
143 rn -= (dst[rn - 1] == 0) ? 1 : 0; \
144 \
145 lmmp_sqr_(sq, dst, rn); \
146 rn <<= 1; \
147 rn -= (sq[rn - 1] == 0) ? 1 : 0; \
148 \
149 lmmp_sqr_(dst, sq, rn); \
150 rn <<= 1; \
151 rn -= (dst[rn - 1] == 0) ? 1 : 0; \
152 } \
153 } \
154 TEMP_FREE; \
155 return rn; \
156 }
157
163
165 mp_size_t n = exp / LIMB_BITS;
166 lmmp_zero(dst, n);
167 rn = lmmp_3pow_1_(dst + n, rn - n, exp);
168 dst[n + rn] = lmmp_shl_(dst + n, dst + n, rn, exp % LIMB_BITS);
169 rn += n + 1;
170 rn -= dst[rn - 1] == 0 ? 1 : 0;
171 return rn;
172}
173
175 TEMP_DECL;
176 mp_ptr restrict tp = TALLOC_TYPE((rn + 1) >> 1, mp_limb_t);
177 rn = lmmp_3pow_1_(tp, (rn + 1) >> 1, exp);
178 lmmp_sqr_(dst, tp, rn);
179 rn <<= 1;
180 rn -= dst[rn - 1] == 0 ? 1 : 0;
181 TEMP_FREE;
182 return rn;
183}
184
186 mp_size_t n = exp / LIMB_BITS;
187 lmmp_zero(dst, n);
188 rn = lmmp_5pow_1_(dst + n, rn - n, exp);
189 dst[n + rn] = lmmp_shl_(dst + n, dst + n, rn, exp % LIMB_BITS);
190 rn += n + 1;
191 rn -= dst[rn - 1] == 0 ? 1 : 0;
192 return rn;
193}
194
196 mp_size_t n = (2 * exp) / LIMB_BITS;
197 lmmp_zero(dst, n);
198 rn = lmmp_3pow_1_(dst + n, rn - n, exp);
199 dst[n + rn] = lmmp_shl_(dst + n, dst + n, rn, (2 * exp) % LIMB_BITS);
200 rn += n + 1;
201 rn -= dst[rn - 1] == 0 ? 1 : 0;
202 return rn;
203}
204
206 mp_size_t n = exp / LIMB_BITS;
207 lmmp_zero(dst, n);
208 rn = lmmp_7pow_1_(dst + n, rn - n, exp);
209 dst[n + rn] = lmmp_shl_(dst + n, dst + n, rn, exp % LIMB_BITS);
210 rn += n + 1;
211 rn -= dst[rn - 1] == 0 ? 1 : 0;
212 return rn;
213}
214
216 switch (base) {
217 case 1:
218 return lmmp_1pow_1_(dst);
219 case 2:
220 return lmmp_2pow_1_(dst, rn, exp);
221 case 3:
222 return lmmp_3pow_1_(dst, rn, exp);
223 case 4:
224 return lmmp_4pow_1_(dst, rn, exp);
225 case 5:
226 return lmmp_5pow_1_(dst, rn, exp);
227 case 6:
228 return lmmp_6pow_1_(dst, rn, exp);
229 case 7:
230 return lmmp_7pow_1_(dst, rn, exp);
231 case 8:
232 return lmmp_8pow_1_(dst, rn, exp);
233 case 9:
234 return lmmp_9pow_1_(dst, rn, exp);
235 case 10:
236 return lmmp_10pow_1_(dst, rn, exp);
237 case 11:
238 return lmmp_11pow_1_(dst, rn, exp);
239 case 12:
240 return lmmp_12pow_1_(dst, rn, exp);
241 case 13:
242 return lmmp_13pow_1_(dst, rn, exp);
243 case 14:
244 return lmmp_14pow_1_(dst, rn, exp);
245 case 15:
246 return lmmp_15pow_1_(dst, rn, exp);
247 default:
248 lmmp_param_assert(base <= 15 && base >= 1);
249 return 0;
250 }
251}
252
254 lmmp_param_assert(base >= 2);
256 TEMP_DECL;
257 mp_limb_t tab[8];
258 tab[0] = 1;
259 tab[1] = tab[0] * base;
260 tab[2] = tab[1] * base;
261 tab[3] = tab[2] * base;
262 tab[4] = tab[3] * base;
263 tab[5] = tab[4] * base;
264 tab[6] = tab[5] * base;
265 tab[7] = tab[6] * base;
266
268 sq[0] = 1;
269 rn = 1;
270 int i = 21;
271 while ((exp & (0x7ull << ((i--) * 3))) == 0);
272 for (++i; i >= 0; --i) {
273 mp_size_t p = (exp & (0x7ull << (i * 3))) >> (i * 3);
274 dst[rn] = lmmp_mul_1_(dst, sq, rn, tab[p]);
275 ++rn;
276 rn -= (dst[rn - 1] == 0) ? 1 : 0;
277 if (i > 0) {
278 lmmp_sqr_(sq, dst, rn);
279 rn <<= 1;
280 rn -= (sq[rn - 1] == 0) ? 1 : 0;
281 lmmp_sqr_(dst, sq, rn);
282 rn <<= 1;
283 rn -= (dst[rn - 1] == 0) ? 1 : 0;
284 lmmp_sqr_(sq, dst, rn);
285 rn <<= 1;
286 rn -= (sq[rn - 1] == 0) ? 1 : 0;
287 }
288 }
289 TEMP_FREE;
290 return rn;
291}
292
294 lmmp_param_assert(base >= 2);
296 TEMP_DECL;
297 mp_limb_t tab[8][2];
298 tab[0][0] = 1;
299 tab[0][1] = 0;
300 tab[1][0] = base;
301 tab[1][1] = 0;
302 tab[2][0] = tab[1][0] * base;
303 tab[2][1] = 0;
304 tab[3][0] = tab[2][0] * base;
305 tab[3][1] = 0;
306 lmmp_mullh_(tab[2][0], tab[2][0], tab[4]);
307 lmmp_mullh_(tab[3][0], tab[2][0], tab[5]);
308 lmmp_mullh_(tab[3][0], tab[3][0], tab[6]);
309 lmmp_mullh_(tab[3][0], tab[4][0], tab[7]);
310 tab[7][1] += tab[3][0] * tab[4][1];
311
313 rn = 1;
314 sq[0] = 1;
315 int i = 21;
316 while ((exp & (0x7ull << ((i--) * 3))) == 0);
317 for (++i; i >= 0; --i) {
318 mp_size_t p = (exp & (0x7ull << (i * 3))) >> (i * 3);
319 mp_srcptr tap = tab[p];
320 mp_size_t tan = (tap[1] != 0) ? 2 : 1;
321 if (rn >= tan)
322 lmmp_mul_basecase_(dst, sq, rn, tap, tan);
323 else
324 lmmp_mul_basecase_(dst, tap, tan, sq, rn);
325 rn += tan;
326 rn -= (dst[rn - 1] == 0) ? 1 : 0;
327
328 if (i > 0) {
329 lmmp_sqr_(sq, dst, rn);
330 rn <<= 1;
331 rn -= (sq[rn - 1] == 0) ? 1 : 0;
332 lmmp_sqr_(dst, sq, rn);
333 rn <<= 1;
334 rn -= (dst[rn - 1] == 0) ? 1 : 0;
335 lmmp_sqr_(sq, dst, rn);
336 rn <<= 1;
337 rn -= (sq[rn - 1] == 0) ? 1 : 0;
338 }
339 }
340 TEMP_FREE;
341 return rn;
342}
343
344#define mul_b(i) \
345 if (rn >= b##i##n) \
346 lmmp_mul_basecase_(dst, sq, rn, b##i, b##i##n); \
347 else \
348 lmmp_mul_basecase_(dst, b##i, b##i##n, sq, rn); \
349 rn += b##i##n; \
350 rn -= (dst[rn - 1] == 0) ? 1 : 0;
351
353 lmmp_param_assert(base >= 2);
355 TEMP_DECL;
356 mp_limb_t b1[1] = {base};
357#define b1n 1
358 mp_limb_t b2[1] = {base * base};
359#define b2n 1
360
361 mp_limb_t b3[2];
362 lmmp_mullh_(b2[0], base, b3);
363 mp_size_t b3n = b3[1] != 0 ? 2 : 1;
364
365 mp_limb_t b4[2];
366 lmmp_mullh_(b2[0], b2[0], b4);
367 mp_size_t b4n = b4[1] != 0 ? 2 : 1;
368
369 mp_limb_t b5[3];
370 b5[b4n] = lmmp_mul_1_(b5, b4, b4n, base);
371 mp_size_t b5n = b4n + 1;
372 b5n -= (b5[b5n - 1] == 0) ? 1 : 0;
373
374 mp_limb_t b6[4];
375 lmmp_sqr_hard_n_(b6, b3, b3n);
376 mp_size_t b6n = 2 * b3n;
377 b6n -= (b6[b6n - 1] == 0) ? 1 : 0;
378
379 mp_limb_t b7[4];
380 b7[b5n] = lmmp_mul_1_(b7, b5, b5n, b2[0]);
381 mp_size_t b7n = b5n + 1;
382 b7n -= (b7[b7n - 1] == 0) ? 1 : 0;
383
385 sq[0] = 1;
386 rn = 1;
387 int i = 21;
388 while ((exp & (0x7ull << ((i--) * 3))) == 0);
389 for (++i; i >= 0; --i) {
390 mp_size_t p = (exp & (0x7ull << (i * 3))) >> (i * 3);
391 switch (p) {
392 case 0:
393 lmmp_copy(dst, sq, rn);
394 break;
395 case 1:
396 mul_b(1);
397 break;
398 case 2:
399 mul_b(2);
400 break;
401 case 3:
402 mul_b(3);
403 break;
404 case 4:
405 mul_b(4);
406 break;
407 case 5:
408 mul_b(5);
409 break;
410 case 6:
411 mul_b(6);
412 break;
413 case 7:
414 mul_b(7);
415 break;
416 }
417 if (i > 0) {
418 lmmp_sqr_(sq, dst, rn);
419 rn <<= 1;
420 rn -= (sq[rn - 1] == 0) ? 1 : 0;
421 lmmp_sqr_(dst, sq, rn);
422 rn <<= 1;
423 rn -= (dst[rn - 1] == 0) ? 1 : 0;
424 lmmp_sqr_(sq, dst, rn);
425 rn <<= 1;
426 rn -= (sq[rn - 1] == 0) ? 1 : 0;
427 }
428 }
429 TEMP_FREE;
430 return rn;
431#undef b1n
432#undef b2n
433}
434
437 TEMP_DECL;
438
439#define b1n 1
440 mp_limb_t b1[1] = {base};
441#define b2n 2
442 mp_limb_t b2[2];
443 lmmp_mullh_(base, base, b2);
444 mp_limb_t b3[3];
445 b3[2] = lmmp_mul_1_(b3, b2, b2n, base);
446 mp_size_t b3n = b3[2] != 0 ? 3 : 2;
447
448 mp_limb_t b4[4];
449 lmmp_sqr_hard_2_(b4, b2);
450 mp_size_t b4n = b4[3] != 0 ? 4 : 3;
451
452 mp_limb_t b5[5];
453 b5[b4n] = lmmp_mul_1_(b5, b4, b4n, base);
454 mp_size_t b5n = b4n + 1;
455 b5n -= (b5[b5n - 1] == 0) ? 1 : 0;
456
457 mp_limb_t b6[6];
458 lmmp_sqr_hard_n_(b6, b3, b3n);
459 mp_size_t b6n = 2 * b3n;
460 b6n -= (b6[b6n - 1] == 0) ? 1 : 0;
461
462 mp_limb_t b7[7];
463 b7[b6n] = lmmp_mul_1_(b7, b6, b6n, b1[0]);
464 mp_size_t b7n = b6n + 1;
465 b7n -= (b7[b7n - 1] == 0) ? 1 : 0;
466
468 sq[0] = 1;
469 rn = 1;
470 int i = 21;
471 while ((exp & (0x7ull << ((i--) * 3))) == 0);
472 for (++i; i >= 0; --i) {
473 mp_size_t p = (exp & (0x7ull << (i * 3))) >> (i * 3);
474 switch (p) {
475 case 0:
476 lmmp_copy(dst, sq, rn);
477 break;
478 case 1:
479 mul_b(1);
480 break;
481 case 2:
482 mul_b(2);
483 break;
484 case 3:
485 mul_b(3);
486 break;
487 case 4:
488 mul_b(4);
489 break;
490 case 5:
491 mul_b(5);
492 break;
493 case 6:
494 mul_b(6);
495 break;
496 case 7:
497 mul_b(7);
498 break;
499 }
500
501 if (i > 0) {
502 lmmp_sqr_(sq, dst, rn);
503 rn <<= 1;
504 rn -= (sq[rn - 1] == 0) ? 1 : 0;
505 lmmp_sqr_(dst, sq, rn);
506 rn <<= 1;
507 rn -= (dst[rn - 1] == 0) ? 1 : 0;
508 lmmp_sqr_(sq, dst, rn);
509 rn <<= 1;
510 rn -= (sq[rn - 1] == 0) ? 1 : 0;
511 }
512 }
513 TEMP_FREE;
514 return rn;
515#undef b1n
516#undef b2n
517#undef mul_b
518}
519
520/*
521 * base ^ exp
522 *
523 * - base <= 15 : 4-bit lmmp_u4_pow_1_
524 * - base <= 255 : 8-bit lmmp_u8_pow_1_
525 * - base <= 65535 : 16-bit lmmp_u16_pow_1_
526 * - base <= 2^32-1 : 32-bit lmmp_u32_pow_1_
527 * - base <= 2^64-1 : 64-bit lmmp_u64_pow_1_
528 */
529
531 lmmp_param_assert(base >= 1);
532 lmmp_param_assert(exp > 0);
533 if (base <= (mp_limb_t)0xf) {
534 return lmmp_u4_pow_1_(dst, rn, base, exp);
535 } else {
536 int tz = lmmp_tailing_zeros_(base);
537 base >>= tz;
538 mp_size_t shw = (exp * tz) / LIMB_BITS;
539 mp_size_t shl = (exp * tz) % LIMB_BITS;
540
541 lmmp_param_assert(rn > shw);
542 lmmp_zero(dst, shw);
543 if (base <= (mp_limb_t)0xf)
544 rn = lmmp_u4_pow_1_(dst + shw, rn - shw, base, exp);
545 else if (base <= (mp_limb_t)MP_UCHAR_MAX)
546 rn = lmmp_u8_pow_1_(dst + shw, rn - shw, base, exp);
547 else if (base <= (mp_limb_t)MP_USHORT_MAX)
548 rn = lmmp_u16_pow_1_(dst + shw, rn - shw, base, exp);
549 else if (base <= (mp_limb_t)MP_UINT_MAX)
550 rn = lmmp_u32_pow_1_(dst + shw, rn - shw, base, exp);
551 else
552 rn = lmmp_u64_pow_1_(dst + shw, rn - shw, base, exp);
553
554 if (shl) {
555 dst[shw + rn] = lmmp_shl_(dst + shw, dst + shw, rn, shl);
556 rn += shw + 1;
557 rn -= (dst[rn - 1] == 0) ? 1 : 0;
558 } else {
559 rn += shw;
560 }
561 return rn;
562 }
563}
#define lmmp_mullh_
#define lmmp_sqr_
#define lmmp_tailing_zeros_
#define MP_UINT_MAX
#define MP_UCHAR_MAX
#define MP_USHORT_MAX
mp_limb_t * mp_ptr
定义 lmmp.h:96
#define lmmp_copy(dst, src, n)
定义 lmmp.h:474
#define lmmp_zero(dst, n)
定义 lmmp.h:476
uint64_t mp_size_t
定义 lmmp.h:93
const mp_limb_t * mp_srcptr
定义 lmmp.h:97
uint64_t mp_limb_t
定义 lmmp.h:92
#define LIMB_BITS
定义 lmmp.h:102
#define lmmp_param_assert(x)
定义 lmmp.h:509
void lmmp_mul_basecase_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb)
基础乘法运算 [dst,na+nb] = [numa,na] * [numb,nb]
mp_limb_t lmmp_shl_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_size_t shl)
左移操作 [dst,na] = [numa,na]<<shl,dst的低shl位填充0
定义 shl.c:26
mp_limb_t lmmp_mul_1_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_limb_t x)
乘以单limb操作 [dst,na] = [numa,na] * x
定义 mul_1.c:27
#define lmmp_sqr_hard_n_
void lmmp_sqr_hard_2_(mp_ptr dst, mp_srcptr numa)
#define b1
#define b2
#define tp
#define n
#define b3
mp_size_t lmmp_u4_pow_1_(mp_ptr dst, mp_size_t rn, ulong base, ulong exp)
计算幂次方 [dst,rn] = [base,1] ^ exp
mp_size_t lmmp_u32_pow_1_(mp_ptr dst, mp_size_t rn, ulong base, ulong exp)
计算幂次方 [dst,rn] = [base,1] ^ exp
mp_size_t lmmp_pow_1_(mp_ptr dst, mp_size_t rn, mp_limb_t base, ulong exp)
计算幂次方 [dst,rn] = [base,1] ^ exp
mp_size_t lmmp_u64_pow_1_(mp_ptr dst, mp_size_t rn, ulong base, ulong exp)
计算幂次方 [dst,rn] = [base,1] ^ exp
mp_size_t lmmp_u8_pow_1_(mp_ptr dst, mp_size_t rn, ulong base, ulong exp)
计算幂次方 [dst,rn] = [base,1] ^ exp
mp_size_t lmmp_u16_pow_1_(mp_ptr dst, mp_size_t rn, ulong base, ulong exp)
计算幂次方 [dst,rn] = [base,1] ^ exp
uint64_t ulong
定义 numth.h:39
static mp_size_t lmmp_8pow_1_(mp_ptr restrict dst, mp_size_t rn, ulong exp)
定义 pow_1.c:51
static mp_size_t lmmp_11pow_1_(mp_ptr restrict dst, mp_size_t rn, ulong exp)
static mp_size_t lmmp_4pow_1_(mp_ptr restrict dst, mp_size_t rn, ulong exp)
定义 pow_1.c:43
#define b2n
static mp_size_t lmmp_5pow_1_(mp_ptr restrict dst, mp_size_t rn, ulong exp)
static mp_size_t lmmp_9pow_1_(mp_ptr restrict dst, mp_size_t rn, ulong exp)
static mp_size_t lmmp_7pow_1_(mp_ptr restrict dst, mp_size_t rn, ulong exp)
static mp_size_t lmmp_14pow_1_(mp_ptr restrict dst, mp_size_t rn, ulong exp)
static mp_size_t lmmp_13pow_1_(mp_ptr restrict dst, mp_size_t rn, ulong exp)
static mp_size_t lmmp_2pow_1_(mp_ptr restrict dst, mp_size_t rn, ulong exp)
定义 pow_1.c:36
static mp_size_t lmmp_6pow_1_(mp_ptr restrict dst, mp_size_t rn, ulong exp)
#define mul_b(i)
#define define_1_npow_1_(_n_)
static mp_size_t lmmp_3pow_1_(mp_ptr restrict dst, mp_size_t rn, ulong exp)
定义 pow_1.c:59
static mp_size_t lmmp_10pow_1_(mp_ptr restrict dst, mp_size_t rn, ulong exp)
static mp_size_t lmmp_15pow_1_(mp_ptr restrict dst, mp_size_t rn, ulong exp)
static mp_size_t lmmp_12pow_1_(mp_ptr restrict dst, mp_size_t rn, ulong exp)
static mp_size_t lmmp_1pow_1_(mp_ptr restrict dst)
Copyright (C) 2026 HJimmyK (Jericho Knox)
定义 pow_1.c:31
#define restrict
Copyright (C) 2026 HJimmyK (Jericho Knox)
#define TEMP_DECL
#define TEMP_FREE
#define TALLOC_TYPE(n, type)