Line | Count | Source |
1 | | /* mpn_mul_n -- multiply natural numbers. |
2 | | |
3 | | Copyright 1991, 1993, 1994, 1996-2003, 2005, 2008, 2009 Free Software |
4 | | Foundation, Inc. |
5 | | |
6 | | This file is part of the GNU MP Library. |
7 | | |
8 | | The GNU MP Library is free software; you can redistribute it and/or modify |
9 | | it under the terms of either: |
10 | | |
11 | | * the GNU Lesser General Public License as published by the Free |
12 | | Software Foundation; either version 3 of the License, or (at your |
13 | | option) any later version. |
14 | | |
15 | | or |
16 | | |
17 | | * the GNU General Public License as published by the Free Software |
18 | | Foundation; either version 2 of the License, or (at your option) any |
19 | | later version. |
20 | | |
21 | | or both in parallel, as here. |
22 | | |
23 | | The GNU MP Library is distributed in the hope that it will be useful, but |
24 | | WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
25 | | or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
26 | | for more details. |
27 | | |
28 | | You should have received copies of the GNU General Public License and the |
29 | | GNU Lesser General Public License along with the GNU MP Library. If not, |
30 | | see https://www.gnu.org/licenses/. */ |
31 | | |
32 | | #include "gmp-impl.h" |
33 | | #include "longlong.h" |
34 | | |
35 | | void |
36 | | mpn_mul_n (mp_ptr p, mp_srcptr a, mp_srcptr b, mp_size_t n) |
37 | 120M | { |
38 | 120M | ASSERT (n >= 1); |
39 | 120M | ASSERT (! MPN_OVERLAP_P (p, 2 * n, a, n)); |
40 | 120M | ASSERT (! MPN_OVERLAP_P (p, 2 * n, b, n)); |
41 | | |
42 | 120M | if (BELOW_THRESHOLD (n, MUL_TOOM22_THRESHOLD)) |
43 | 110M | { |
44 | 110M | mpn_mul_basecase (p, a, n, b, n); |
45 | 110M | } |
46 | 9.64M | else if (BELOW_THRESHOLD (n, MUL_TOOM33_THRESHOLD)) |
47 | 7.59M | { |
48 | | /* Allocate workspace of fixed size on stack: fast! */ |
49 | 7.59M | mp_limb_t ws[mpn_toom22_mul_itch (MUL_TOOM33_THRESHOLD_LIMIT-1, |
50 | 7.59M | MUL_TOOM33_THRESHOLD_LIMIT-1)]; |
51 | 7.59M | ASSERT (MUL_TOOM33_THRESHOLD <= MUL_TOOM33_THRESHOLD_LIMIT); |
52 | 7.59M | mpn_toom22_mul (p, a, n, b, n, ws); |
53 | 7.59M | } |
54 | 2.04M | else if (BELOW_THRESHOLD (n, MUL_TOOM44_THRESHOLD)) |
55 | 2.04M | { |
56 | 2.04M | mp_ptr ws; |
57 | 2.04M | TMP_SDECL; |
58 | 2.04M | TMP_SMARK; |
59 | 2.04M | ws = TMP_SALLOC_LIMBS (mpn_toom33_mul_itch (n, n)); |
60 | 2.04M | mpn_toom33_mul (p, a, n, b, n, ws); |
61 | 2.04M | TMP_SFREE; |
62 | 2.04M | } |
63 | 0 | else if (BELOW_THRESHOLD (n, MUL_TOOM6H_THRESHOLD)) |
64 | 0 | { |
65 | 0 | mp_ptr ws; |
66 | 0 | TMP_SDECL; |
67 | 0 | TMP_SMARK; |
68 | 0 | ws = TMP_SALLOC_LIMBS (mpn_toom44_mul_itch (n, n)); |
69 | 0 | mpn_toom44_mul (p, a, n, b, n, ws); |
70 | 0 | TMP_SFREE; |
71 | 0 | } |
72 | 0 | else if (BELOW_THRESHOLD (n, MUL_TOOM8H_THRESHOLD)) |
73 | 0 | { |
74 | 0 | mp_ptr ws; |
75 | 0 | TMP_SDECL; |
76 | 0 | TMP_SMARK; |
77 | 0 | ws = TMP_SALLOC_LIMBS (mpn_toom6_mul_n_itch (n)); |
78 | 0 | mpn_toom6h_mul (p, a, n, b, n, ws); |
79 | 0 | TMP_SFREE; |
80 | 0 | } |
81 | 0 | else if (BELOW_THRESHOLD (n, MUL_FFT_THRESHOLD)) |
82 | 0 | { |
83 | 0 | mp_ptr ws; |
84 | 0 | TMP_DECL; |
85 | 0 | TMP_MARK; |
86 | 0 | ws = TMP_ALLOC_LIMBS (mpn_toom8_mul_n_itch (n)); |
87 | 0 | mpn_toom8h_mul (p, a, n, b, n, ws); |
88 | 0 | TMP_FREE; |
89 | 0 | } |
90 | 0 | else |
91 | 0 | { |
92 | | /* The current FFT code allocates its own space. That should probably |
93 | | change. */ |
94 | 0 | mpn_fft_mul (p, a, n, b, n); |
95 | 0 | } |
96 | 120M | } |