124 u64 seed = 0x3cb7135c1f2a9e11ull;
125 for (
int shape = 0; shape < 3; ++shape) {
127 for (
size_t ns_index = 0; ns_index <
ARRAY_SIZE(ns_values); ++ns_index) {
129 for (
int iter = 0; iter < 4; ++iter) {
131 mp_ptr numa = alloc_limbs(na), numa2 = alloc_limbs(na),
132 dst = alloc_limbs(ns + 1), t1 = alloc_limbs(2 * ns + 2),
133 t2 = alloc_limbs(3 * ns + 2), t3 = alloc_limbs(3 * ns + 8);
134 random_limbs(numa, na, &seed);
136 mp_ptr tt = alloc_limbs(ns);
137 random_limbs(tt, ns, &seed);
138 tt[ns - 1] |= (
u64)0xE << 60;
142 }
else if (shape == 2) {
143 mp_ptr tt = alloc_limbs(ns);
144 random_limbs(tt, ns, &seed);
145 tt[ns - 1] |= (
u64)0xE << 60;
148 sub_small_inplace(numa, na, 1);
159 mp_ptr tp = alloc_limbs(8), dst2 = alloc_limbs(2);
160 memcpy(numa2, numa, (
size_t)na * 8);
163 "cbrt6_fast matches cbrt_6");
164 mp_ptr s2 = alloc_limbs(4), c3 = alloc_limbs(6);
167 mp_ptr rem = alloc_limbs(6);
169 rem[i] = i < na ? numa[i] : 0;
171 mpn_cmp(rem, 6, numa2, 5) == 0,
172 "cbrt6_fast remainder identity");
177 mp_ptr tp = alloc_limbs(6 * ns + 4);
178 memcpy(numa2, numa, (
size_t)na * 8);
184 "cbrt_6/divide floor");
185 if (shape == 1 && na > 6)
187 "perfect cube rem 0 (divide)");
194 const mp_size_t na_values[] = {1, 2, 3, 5, 8, 16};
195 for (
size_t na_index = 0; na_index <
ARRAY_SIZE(na_values); ++na_index) {
197 for (
int family = 0; family < 3; ++family) {
198 mp_ptr numa = alloc_limbs(na);
199 random_limbs(numa, na, &seed);
200 if (numa[na - 1] == 0) numa[na - 1] = 1;
201 if (family > 0 && na % 3 == 0) {
203 mp_ptr tt = alloc_limbs(nt), sq = alloc_limbs(2 * nt);
204 random_limbs(tt, nt, &seed);
207 if (family == 2) sub_small_inplace(numa, na, 1);
211 mp_ptr dsts = alloc_limbs(ns + 4), dstr = alloc_limbs(2 * ns + 4),
212 t1 = alloc_limbs(2 * ns + 4), t2 = alloc_limbs(3 * ns + 4),
213 t3 = alloc_limbs(3 * ns + 10);
219 "cbrt_ floor identity");
224 mp_ptr sum = alloc_limbs(3 * ns + 6);
225 pad_add(t2, 3 * rn, dstr, 2 * ns + 1, 3 * ns + 6, sum);
226 TEST_CHECK_MSG(mpn_eq(sum, 3 * ns + 6, numa, na),
"cbrt_ n == r^3 + rem");
240 u64 seed = 0x11c0ffee22c0ffeeull;
242 for (
size_t na_index = 0; na_index <
ARRAY_SIZE(na_values); ++na_index) {
245 for (
size_t ns_index = 0; ns_index <
ARRAY_SIZE(ns_values); ++ns_index) {
247 if (ns == na)
continue;
248 mp_ptr a = alloc_limbs(na), dstis = alloc_limbs(ns + 2), icq = alloc_limbs(ns + 2),
249 nb = alloc_limbs(3 * ns + na + 4), q = alloc_limbs(3 * ns + 4);
250 for (
int f = 0; f < 3; ++f) {
253 random_limbs(a, na, &seed);
254 a[na - 1] |= (
u64)1 << 61;
268 while (ql > 1 && q[ql - 1] == 0) --ql;
272 mp_ptr im1 = alloc_limbs(ns + 2);
274 memcpy(im1, icq, (
size_t)il * 8);
275 sub_small_inplace(im1, ns + 2, 1);
276 bool ok = memcmp(dstis, icq, (
size_t)(ns + 1) * 8) == 0 ||
277 memcmp(dstis, im1, (
size_t)(ns + 1) * 8) == 0;
void lmmp_mul_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb)
不等长乘法操作 [dst,na+nb] = [numa,na] * [numb,nb]