Line data Source code
1 : #line 2 "../src/kernel/none/mp.c"
2 : /* Copyright (C) 2000-2003 The PARI group.
3 :
4 : This file is part of the PARI/GP package.
5 :
6 : PARI/GP is free software; you can redistribute it and/or modify it under the
7 : terms of the GNU General Public License as published by the Free Software
8 : Foundation; either version 2 of the License, or (at your option) any later
9 : version. It is distributed in the hope that it will be useful, but WITHOUT
10 : ANY WARRANTY WHATSOEVER.
11 :
12 : Check the License for details. You should have received a copy of it, along
13 : with the package; see the file 'COPYING'. If not, write to the Free Software
14 : Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */
15 :
16 : /***********************************************************************/
17 : /** **/
18 : /** MULTIPRECISION KERNEL **/
19 : /** **/
20 : /***********************************************************************/
21 : #include "pari.h"
22 : #include "paripriv.h"
23 : #include "../src/kernel/none/tune-gen.h"
24 :
25 : void
26 752 : pari_kernel_init(void) { }
27 : void
28 750 : pari_kernel_close(void) { }
29 : const char *
30 2 : pari_kernel_version(void) { return ""; }
31 :
32 : /* NOTE: arguments of "spec" routines (muliispec, addiispec, etc.) aren't
33 : * GENs but pairs (long *a, long na) representing a list of digits (in basis
34 : * BITS_IN_LONG) : a[0], ..., a[na-1]. [ In ordre to facilitate splitting: no
35 : * need to reintroduce codewords ] */
36 :
37 : #define LIMBS(x) ((x)+2)
38 : #define NLIMBS(x) (lgefint(x)-2)
39 :
40 : /* Normalize a nonnegative integer */
41 : GEN
42 744455961 : int_normalize(GEN x, long known_zero_words)
43 : {
44 744455961 : long i, lx = lgefint(x);
45 : GEN x0;
46 744455961 : if (lx == 2) { x[1] = evalsigne(0) | evallgefint(2); return x; }
47 744455961 : if (!known_zero_words && x[2]) return x;
48 3105181053 : for (i = 2+known_zero_words; i < lx; i++)
49 3041943933 : if (x[i]) break;
50 321551817 : x0 = x; i -= 2; x += i;
51 321551817 : if (x0 == (GEN)avma) set_avma((pari_sp)x);
52 194260041 : else stackdummy((pari_sp)(x0+i), (pari_sp)x0);
53 321551817 : lx -= i;
54 321551817 : x[0] = evaltyp(t_INT) | evallg(lx);
55 321551817 : if (lx == 2) x[1] = evalsigne(0) | evallgefint(lx);
56 258314697 : else x[1] = evalsigne(1) | evallgefint(lx);
57 321551817 : return x;
58 : }
59 :
60 : /***********************************************************************/
61 : /** **/
62 : /** ADDITION / SUBTRACTION **/
63 : /** **/
64 : /***********************************************************************/
65 :
66 : GEN
67 2239641 : setloop(GEN a)
68 : {
69 2239641 : pari_sp av = avma;
70 2239641 : (void)cgetg(lgefint(a) + 3, t_VECSMALL);
71 2239641 : return icopy_avma(a, av); /* two cells of extra space before a */
72 : }
73 :
74 : /* we had a = setloop(?), then some incloops. Reset a to b */
75 : GEN
76 130656 : resetloop(GEN a, GEN b) {
77 130656 : long lb = lgefint(b);
78 130656 : a += lgefint(a) - lb;
79 130656 : a[0] = evaltyp(t_INT) | evallg(lb);
80 130656 : affii(b, a); return a;
81 : }
82 :
83 : /* assume a > 0, initialized by setloop. Do a++ */
84 : static GEN
85 31940844 : incpos(GEN a)
86 : {
87 31940844 : long i, l = lgefint(a);
88 31940847 : for (i=l-1; i>1; i--)
89 31940844 : if (++a[i]) return a;
90 3 : l++; a--; /* use extra cell */
91 3 : a[0]=evaltyp(t_INT) | _evallg(l);
92 3 : a[1]=evalsigne(1) | evallgefint(l);
93 3 : a[2]=1; return a;
94 : }
95 :
96 : /* assume a < 0, initialized by setloop. Do a++ */
97 : static GEN
98 49989 : incneg(GEN a)
99 : {
100 49989 : long i, l = lgefint(a)-1;
101 49989 : if (uel(a,l)--)
102 : {
103 49986 : if (l == 2 && !a[2])
104 : {
105 1482 : a++; /* save one cell */
106 1482 : a[0] = evaltyp(t_INT) | _evallg(2);
107 1482 : a[1] = evalsigne(0) | evallgefint(2);
108 : }
109 49986 : return a;
110 : }
111 3 : for (i = l-1;; i--) /* finishes since a[2] != 0 */
112 3 : if (uel(a,i)--) break;
113 3 : if (!a[2])
114 : {
115 3 : a++; /* save one cell */
116 3 : a[0] = evaltyp(t_INT) | _evallg(l);
117 3 : a[1] = evalsigne(-1) | evallgefint(l);
118 : }
119 3 : return a;
120 : }
121 :
122 : /* assume a initialized by setloop. Do a++ */
123 : GEN
124 32242341 : incloop(GEN a)
125 : {
126 32242341 : switch(signe(a))
127 : {
128 251508 : case 0: a--; /* use extra cell */
129 251508 : a[0]=evaltyp(t_INT) | _evallg(3);
130 251508 : a[1]=evalsigne(1) | evallgefint(3);
131 251508 : a[2]=1; return a;
132 49989 : case -1: return incneg(a);
133 31940844 : default: return incpos(a);
134 : }
135 : }
136 :
137 : INLINE GEN
138 2104914948 : adduispec(ulong s, GEN x, long nx)
139 : {
140 2104914948 : GEN xd, zd = (GEN)avma;
141 : long lz;
142 :
143 2104914948 : if (nx == 1) return adduu(s, uel(x,0));
144 732037728 : lz = nx+3; (void)new_chunk(lz);
145 732037728 : xd = x + nx;
146 732037728 : *--zd = (ulong)*--xd + s;
147 732037728 : if ((ulong)*zd < s)
148 : for(;;)
149 : {
150 262818981 : if (xd == x) { *--zd = 1; break; } /* enlarge z */
151 259114227 : *--zd = ((ulong)*--xd) + 1;
152 259114227 : if (*zd) { lz--; break; }
153 : }
154 475760265 : else lz--;
155 1715591457 : while (xd > x) *--zd = *--xd;
156 732037728 : *--zd = evalsigne(1) | evallgefint(lz);
157 732037728 : *--zd = evaltyp(t_INT) | evallg(lz);
158 732037728 : return gc_const((pari_sp)zd, zd);
159 : }
160 :
161 : GEN
162 344603685 : adduispec_offset(ulong s, GEN x, long offset, long nx)
163 : {
164 344603685 : GEN xd = x+lgefint(x)-nx-offset;
165 451733418 : while (nx && *xd==0) {xd++; nx--;}
166 344603685 : if (!nx) return utoi(s);
167 312566358 : return adduispec(s,xd,nx);
168 : }
169 :
170 : static GEN
171 4233136881 : addiispec(GEN x, GEN y, long nx, long ny)
172 : {
173 : GEN xd, yd, zd;
174 4233136881 : long lz, i = -2;
175 : LOCAL_OVERFLOW;
176 :
177 4233136881 : if (nx < ny) swapspec(x,y, nx,ny);
178 4233136881 : if (ny == 1) return adduispec(*y,x,nx);
179 2501149110 : zd = (GEN)avma;
180 2501149110 : lz = nx+3; (void)new_chunk(lz);
181 2501149110 : xd = x + nx;
182 2501149110 : yd = y + ny;
183 2501149110 : zd[-1] = addll(xd[-1], yd[-1]);
184 : #ifdef addllx8
185 2184814122 : for ( ; i-8 > -ny; i-=8)
186 1351097752 : addllx8(xd+i, yd+i, zd+i, overflow);
187 : #endif
188 34330049143 : for ( ; i >= -ny; i--) zd[i] = addllx(xd[i], yd[i]);
189 2501149110 : if (overflow)
190 : for(;;)
191 : {
192 503928465 : if (i < -nx) { zd[i] = 1; i--; break; } /* enlarge z */
193 332420043 : zd[i] = uel(xd,i) + 1;
194 332420043 : if (zd[i]) { i--; lz--; break; }
195 60833850 : i--;
196 : }
197 2058054495 : else lz--;
198 17771377197 : for (; i >= -nx; i--) zd[i] = xd[i];
199 2501149110 : zd += i+1;
200 2501149110 : *--zd = evalsigne(1) | evallgefint(lz);
201 2501149110 : *--zd = evaltyp(t_INT) | evallg(lz);
202 2501149110 : return gc_const((pari_sp)zd, zd);
203 : }
204 :
205 : /* assume x >= s */
206 : INLINE GEN
207 1407682554 : subiuspec(GEN x, ulong s, long nx)
208 : {
209 1407682554 : GEN xd, zd = (GEN)avma;
210 : long lz;
211 : LOCAL_OVERFLOW;
212 :
213 1407682554 : if (nx == 1) return utoi(x[0] - s);
214 :
215 331364100 : lz = nx+2; (void)new_chunk(lz);
216 331364100 : xd = x + nx;
217 331364100 : *--zd = subll(*--xd, s);
218 331364100 : if (overflow)
219 : for(;;)
220 : {
221 148302552 : *--zd = ((ulong)*--xd) - 1;
222 148302552 : if (*xd) break;
223 : }
224 331364100 : if (xd == x)
225 241425522 : while (*zd == 0) { zd++; lz--; } /* shorten z */
226 : else
227 4604451750 : do *--zd = *--xd; while (xd > x);
228 331364100 : *--zd = evalsigne(1) | evallgefint(lz);
229 331364100 : *--zd = evaltyp(t_INT) | evallg(lz);
230 331364100 : return gc_const((pari_sp)zd, zd);
231 : }
232 :
233 : /* assume x > y */
234 : static GEN
235 3113829276 : subiispec(GEN x, GEN y, long nx, long ny)
236 : {
237 : GEN xd,yd,zd;
238 3113829276 : long lz, i = -2;
239 : LOCAL_OVERFLOW;
240 :
241 3113829276 : if (ny==1) return subiuspec(x,*y,nx);
242 1845405612 : zd = (GEN)avma;
243 1845405612 : lz = nx+2; (void)new_chunk(lz);
244 1845405612 : xd = x + nx;
245 1845405612 : yd = y + ny;
246 1845405612 : zd[-1] = subll(xd[-1], yd[-1]);
247 : #ifdef subllx8
248 2063269691 : for ( ; i-8 > -ny; i-=8)
249 1448134487 : subllx8(xd+i, yd+i, zd+i, overflow);
250 : #endif
251 32215712141 : for ( ; i >= -ny; i--) zd[i] = subllx(xd[i], yd[i]);
252 1845405612 : if (overflow)
253 : for(;;)
254 : {
255 960858552 : zd[i] = uel(xd,i) - 1;
256 960858552 : if (xd[i--]) break;
257 : }
258 1845405612 : if (i>=-nx)
259 4456257969 : for (; i >= -nx; i--) zd[i] = xd[i];
260 : else
261 2187989367 : while (zd[i+1] == 0) { i++; lz--; } /* shorten z */
262 1845405612 : zd += i+1;
263 1845405612 : *--zd = evalsigne(1) | evallgefint(lz);
264 1845405612 : *--zd = evaltyp(t_INT) | evallg(lz);
265 1845405612 : return gc_const((pari_sp)zd, zd);
266 : }
267 :
268 : static void
269 362432841 : roundr_up_ip(GEN x, long l)
270 : {
271 362432841 : long i = l;
272 : for(;;)
273 : {
274 363138879 : if (++uel(x,--i)) break;
275 923403 : if (i == 2) { x[2] = (long)HIGHBIT; shiftr_inplace(x, 1); break; }
276 : }
277 362432841 : }
278 :
279 : void
280 293535819 : affir(GEN x, GEN y)
281 : {
282 293535819 : const long s = signe(x), ly = lg(y);
283 : long lx, sh, i;
284 :
285 293535819 : if (!s)
286 : {
287 24639750 : y[1] = evalexpo(-bit_accuracy(ly));
288 24639750 : return;
289 : }
290 :
291 268896069 : lx = lgefint(x); sh = bfffo(x[2]);
292 268896069 : y[1] = evalsigne(s) | evalexpo(bit_accuracy(lx)-sh-1);
293 268896069 : if (sh) {
294 264567555 : if (lx <= ly)
295 : {
296 616295838 : for (i=lx; i<ly; i++) y[i]=0;
297 192469266 : shift_left(y,x,2,lx-1, 0,sh);
298 192469266 : return;
299 : }
300 72098289 : shift_left(y,x,2,ly-1, x[ly],sh);
301 : /* lx > ly: round properly */
302 72098289 : if ((uel(x,ly)<<sh) & HIGHBIT) roundr_up_ip(y, ly);
303 : }
304 : else {
305 4328514 : if (lx <= ly)
306 : {
307 4532865 : for (i=2; i<lx; i++) y[i]=x[i];
308 3793047 : for ( ; i<ly; i++) y[i]=0;
309 1207752 : return;
310 : }
311 7573944 : for (i=2; i<ly; i++) y[i]=x[i];
312 : /* lx > ly: round properly */
313 3120762 : if (uel(x,ly) & HIGHBIT) roundr_up_ip(y, ly);
314 : }
315 : }
316 :
317 : INLINE GEN
318 1156080039 : shiftispec(GEN x, long nx, long n)
319 : {
320 : long ny, i, m;
321 : GEN y, yd;
322 1156080039 : if (!n) return icopyspec(x, nx);
323 :
324 1070428206 : if (n > 0)
325 : {
326 650411235 : GEN z = (GEN)avma;
327 650411235 : long d = dvmdsBIL(n, &m);
328 :
329 650411235 : ny = nx+d; y = new_chunk(ny + 2); yd = y + 2;
330 6577744920 : for ( ; d; d--) *--z = 0;
331 1807496244 : if (!m) for (i=0; i<nx; i++) yd[i]=x[i];
332 : else
333 : {
334 629812656 : const ulong sh = BITS_IN_LONG - m;
335 629812656 : shift_left(yd,x, 0,nx-1, 0,m);
336 629812656 : i = uel(x,0) >> sh;
337 : /* Extend y on the left? */
338 629812656 : if (i) { ny++; y = new_chunk(1); y[2] = i; }
339 : }
340 : }
341 : else
342 : {
343 420016971 : ny = nx - dvmdsBIL(-n, &m);
344 420016971 : if (ny<1) return gen_0;
345 418856469 : y = new_chunk(ny + 2); yd = y + 2;
346 418856469 : if (m) {
347 242586141 : shift_right(yd,x, 0,ny, 0,m);
348 242586141 : if (yd[0] == 0)
349 : {
350 31459161 : if (ny==1) return gc_const((pari_sp)(y+3), gen_0);
351 25795308 : ny--; set_avma((pari_sp)(++y));
352 : }
353 : } else {
354 7349074629 : for (i=0; i<ny; i++) yd[i]=x[i];
355 : }
356 : }
357 1063603851 : y[1] = evalsigne(1)|evallgefint(ny + 2);
358 1063603851 : y[0] = evaltyp(t_INT)|evallg(ny + 2); return y;
359 : }
360 :
361 : GEN
362 41897718 : mantissa2nr(GEN x, long n)
363 : { /*This is a kludge since x is not an integer*/
364 41897718 : long s = signe(x);
365 : GEN y;
366 :
367 41897718 : if(s == 0) return gen_0;
368 41896797 : y = shiftispec(x + 2, lg(x) - 2, n);
369 41896797 : if (signe(y)) setsigne(y, s);
370 41896797 : return y;
371 : }
372 :
373 : GEN
374 2456841 : truncr(GEN x)
375 : {
376 : long d,e,i,s,m;
377 : GEN y;
378 :
379 2456841 : if ((s=signe(x)) == 0 || (e=expo(x)) < 0) return gen_0;
380 960633 : d = nbits2lg(e+1); m = remsBIL(e);
381 960633 : if (d > lg(x)) pari_err_PREC( "truncr (precision loss in truncation)");
382 :
383 960630 : y=cgeti(d); y[1] = evalsigne(s) | evallgefint(d);
384 960630 : if (++m == BITS_IN_LONG)
385 909 : for (i=2; i<d; i++) y[i]=x[i];
386 : else
387 960255 : shift_right(y,x, 2,d,0, BITS_IN_LONG - m);
388 960630 : return y;
389 : }
390 :
391 : /* integral part */
392 : GEN
393 2687082 : floorr(GEN x)
394 : {
395 : long d,e,i,lx,m;
396 : GEN y;
397 :
398 2687082 : if (signe(x) >= 0) return truncr(x);
399 772860 : if ((e=expo(x)) < 0) return gen_m1;
400 252882 : d = nbits2lg(e+1); m = remsBIL(e);
401 252882 : lx=lg(x); if (d>lx) pari_err_PREC( "floorr (precision loss in truncation)");
402 252882 : y = new_chunk(d);
403 252882 : if (++m == BITS_IN_LONG)
404 : {
405 477 : for (i=2; i<d; i++) y[i]=x[i];
406 234 : i=d; while (i<lx && !x[i]) i++;
407 153 : if (i==lx) goto END;
408 : }
409 : else
410 : {
411 252729 : shift_right(y,x, 2,d,0, BITS_IN_LONG - m);
412 252729 : if (uel(x,d-1)<<m == 0)
413 : {
414 312240 : i=d; while (i<lx && !x[i]) i++;
415 82125 : if (i==lx) goto END;
416 : }
417 : }
418 : /* set y:=y+1 */
419 199728 : for (i=d-1; i>=2; i--) { uel(y,i)++; if (y[i]) goto END; }
420 0 : y=new_chunk(1); y[2]=1; d++;
421 252882 : END:
422 252882 : y[1] = evalsigne(-1) | evallgefint(d);
423 252882 : y[0] = evaltyp(t_INT) | evallg(d); return y;
424 : }
425 :
426 : INLINE int
427 3684989064 : cmpiispec(GEN x, GEN y, long lx, long ly)
428 : {
429 : long i;
430 3684989064 : if (lx < ly) return -1;
431 3430103166 : if (lx > ly) return 1;
432 3368620809 : i = 0; while (i<lx && x[i]==y[i]) i++;
433 2939942280 : if (i==lx) return 0;
434 2760034971 : return (uel(x,i) > uel(y,i))? 1: -1;
435 : }
436 :
437 : INLINE int
438 188308917 : equaliispec(GEN x, GEN y, long lx, long ly)
439 : {
440 : long i;
441 188308917 : if (lx != ly) return 0;
442 345160125 : i = ly-1; while (i>=0 && x[i]==y[i]) i--;
443 188231028 : return i < 0;
444 : }
445 :
446 : /***********************************************************************/
447 : /** **/
448 : /** MULTIPLICATION **/
449 : /** **/
450 : /***********************************************************************/
451 : /* assume ny > 0 */
452 : INLINE GEN
453 4147422915 : muluispec(ulong x, GEN y, long ny)
454 : {
455 4147422915 : GEN yd, z = (GEN)avma;
456 4147422915 : long lz = ny+3;
457 : LOCAL_HIREMAINDER;
458 :
459 4147422915 : (void)new_chunk(lz);
460 4147422915 : yd = y + ny; *--z = mulll(x, *--yd);
461 14552084967 : while (yd > y) *--z = addmul(x,*--yd);
462 4147422915 : if (hiremainder) *--z = hiremainder; else lz--;
463 4147422915 : *--z = evalsigne(1) | evallgefint(lz);
464 4147422915 : *--z = evaltyp(t_INT) | evallg(lz);
465 4147422915 : return gc_const((pari_sp)z, z);
466 : }
467 :
468 : /* a + b*|Y| */
469 : GEN
470 0 : addumului(ulong a, ulong b, GEN Y)
471 : {
472 : GEN yd,y,z;
473 : long ny,lz;
474 : LOCAL_HIREMAINDER;
475 : LOCAL_OVERFLOW;
476 :
477 0 : if (!b || !signe(Y)) return utoi(a);
478 :
479 0 : y = LIMBS(Y); z = (GEN)avma;
480 0 : ny = NLIMBS(Y);
481 0 : lz = ny+3;
482 :
483 0 : (void)new_chunk(lz);
484 0 : yd = y + ny; *--z = addll(a, mulll(b, *--yd));
485 0 : if (overflow) hiremainder++; /* can't overflow */
486 0 : while (yd > y) *--z = addmul(b,*--yd);
487 0 : if (hiremainder) *--z = hiremainder; else lz--;
488 0 : *--z = evalsigne(1) | evallgefint(lz);
489 0 : *--z = evaltyp(t_INT) | evallg(lz);
490 0 : return gc_const((pari_sp)z, z);
491 : }
492 :
493 : /***********************************************************************/
494 : /** **/
495 : /** DIVISION **/
496 : /** **/
497 : /***********************************************************************/
498 :
499 : ulong
500 1236940743 : umodiu(GEN y, ulong x)
501 : {
502 1236940743 : long sy=signe(y),ly,i;
503 : ulong xi;
504 : LOCAL_HIREMAINDER;
505 :
506 1236940743 : if (!x) pari_err_INV("umodiu",gen_0);
507 1236940743 : if (!sy) return 0;
508 1011523200 : ly = lgefint(y);
509 1011523200 : if (x <= uel(y,2))
510 : {
511 311443026 : hiremainder=0;
512 311443026 : if (ly==3)
513 : {
514 279011466 : hiremainder=uel(y,2)%x;
515 279011466 : if (!hiremainder) return 0;
516 236229612 : return (sy > 0)? hiremainder: x - hiremainder;
517 : }
518 : }
519 : else
520 : {
521 700080174 : if (ly==3) return (sy > 0)? uel(y,2): x - uel(y,2);
522 92418486 : hiremainder=uel(y,2); ly--; y++;
523 : }
524 124850046 : xi = get_Fl_red(x);
525 7137737904 : for (i=2; i<ly; i++) (void)divll_pre(y[i],x,xi);
526 124850046 : if (!hiremainder) return 0;
527 115076085 : return (sy > 0)? hiremainder: x - hiremainder;
528 : }
529 :
530 : /* return |y| \/ x */
531 : GEN
532 193421328 : absdiviu_rem(GEN y, ulong x, ulong *rem)
533 : {
534 : long ly,i;
535 : GEN z;
536 : ulong xi;
537 : LOCAL_HIREMAINDER;
538 :
539 193421328 : if (!x) pari_err_INV("absdiviu_rem",gen_0);
540 193421328 : if (!signe(y)) { *rem = 0; return gen_0; }
541 :
542 179864028 : ly = lgefint(y);
543 179864028 : if (x <= uel(y,2))
544 : {
545 154372047 : hiremainder=0;
546 154372047 : if (ly==3)
547 : {
548 130759515 : z = cgetipos(3);
549 130759515 : z[2] = divll(uel(y,2),x);
550 130759515 : *rem = hiremainder; return z;
551 : }
552 : }
553 : else
554 : {
555 25491981 : if (ly==3) { *rem = uel(y,2); return gen_0; }
556 6863634 : hiremainder = uel(y,2); ly--; y++;
557 : }
558 30476166 : xi = get_Fl_red(x);
559 30476166 : z = cgetipos(ly);
560 183720468 : for (i=2; i<ly; i++) z[i]=divll_pre(y[i],x,xi);
561 30476166 : *rem = hiremainder; return z;
562 : }
563 :
564 : GEN
565 56593035 : divis_rem(GEN y, long x, long *rem)
566 : {
567 56593035 : long sy=signe(y),ly,s,i;
568 : GEN z;
569 : ulong xi;
570 : LOCAL_HIREMAINDER;
571 :
572 56593035 : if (!x) pari_err_INV("divis_rem",gen_0);
573 56593035 : if (!sy) { *rem=0; return gen_0; }
574 37925715 : if (x<0) { s = -sy; x = -x; } else s = sy;
575 :
576 37925715 : ly = lgefint(y);
577 37925715 : if ((ulong)x <= uel(y,2))
578 : {
579 25145613 : hiremainder=0;
580 25145613 : if (ly==3)
581 : {
582 24842520 : z = cgeti(3); z[1] = evallgefint(3) | evalsigne(s);
583 24842520 : z[2] = divll(uel(y,2),x);
584 24842520 : if (sy<0) hiremainder = - ((long)hiremainder);
585 24842520 : *rem = (long)hiremainder; return z;
586 : }
587 : }
588 : else
589 : {
590 12780102 : if (ly==3) { *rem = itos(y); return gen_0; }
591 236043 : hiremainder = uel(y,2); ly--; y++;
592 : }
593 539136 : xi = get_Fl_red(x);
594 539136 : z = cgeti(ly); z[1] = evallgefint(ly) | evalsigne(s);
595 2897433 : for (i=2; i<ly; i++) z[i]=divll_pre(y[i],x,xi);
596 539136 : if (sy<0) hiremainder = - ((long)hiremainder);
597 539136 : *rem = (long)hiremainder; return z;
598 : }
599 :
600 : GEN
601 715203 : divis(GEN y, long x)
602 : {
603 715203 : long sy=signe(y),ly,s,i;
604 : ulong xi;
605 : GEN z;
606 : LOCAL_HIREMAINDER;
607 :
608 715203 : if (!x) pari_err_INV("divis",gen_0);
609 715203 : if (!sy) return gen_0;
610 715167 : if (x<0) { s = -sy; x = -x; } else s = sy;
611 :
612 715167 : ly = lgefint(y);
613 715167 : if ((ulong)x <= uel(y,2))
614 : {
615 704934 : hiremainder=0;
616 704934 : if (ly==3)
617 : {
618 635625 : z = cgeti(3); z[1] = evallgefint(3) | evalsigne(s);
619 635625 : z[2] = divll(y[2],x);
620 635625 : return z;
621 : }
622 : }
623 : else
624 : {
625 10233 : if (ly==3) return gen_0;
626 9999 : hiremainder=y[2]; ly--; y++;
627 : }
628 79308 : xi = get_Fl_red(x);
629 79308 : z = cgeti(ly); z[1] = evallgefint(ly) | evalsigne(s);
630 594294 : for (i=2; i<ly; i++) z[i]=divll_pre(y[i],x, xi);
631 79308 : return z;
632 : }
633 :
634 : GEN
635 109132455 : divrr(GEN x, GEN y)
636 : {
637 109132455 : long sx=signe(x), sy=signe(y), lx,ly,lr,e,i,j;
638 : ulong y0,y1;
639 : GEN r, r1;
640 :
641 109132455 : if (!sy) pari_err_INV("divrr",y);
642 109132455 : e = expo(x) - expo(y);
643 109132455 : if (!sx) return real_0_bit(e);
644 108861375 : if (sy<0) sx = -sx;
645 :
646 108861375 : lx=lg(x); ly=lg(y);
647 108861375 : if (ly==3)
648 : {
649 18857064 : ulong k = x[2], l = (lx>3)? x[3]: 0;
650 : LOCAL_HIREMAINDER;
651 18857064 : if (k < uel(y,2)) e--;
652 : else
653 : {
654 5368389 : l >>= 1; if (k&1) l |= HIGHBIT;
655 5368389 : k >>= 1;
656 : }
657 18857064 : hiremainder = k; k = divll(l,y[2]);
658 18857064 : if (hiremainder > (uel(y,2) >> 1) && !++k) { k = HIGHBIT; e++; }
659 18857064 : r = cgetg(3, t_REAL);
660 18857064 : r[1] = evalsigne(sx) | evalexpo(e);
661 18857064 : r[2] = k; return r;
662 : }
663 :
664 90004311 : lr = minss(lx,ly); r = new_chunk(lr);
665 90004311 : r1 = r-1;
666 623504961 : r1[1] = 0; for (i=2; i<lr; i++) r1[i]=x[i];
667 90004311 : r1[lr] = (lx>ly)? x[lr]: 0;
668 90004311 : y0 = y[2]; y1 = y[3];
669 713509272 : for (i=0; i<lr-1; i++)
670 : { /* r1 = r + (i-1), OK up to r1[2] (accesses at most r[lr]) */
671 : ulong k, qp;
672 : LOCAL_HIREMAINDER;
673 : LOCAL_OVERFLOW;
674 :
675 623504961 : if (uel(r1,1) == y0) { qp = ULONG_MAX; k = addll(y0,r1[2]); }
676 : else
677 : {
678 622253451 : if (uel(r1,1) > y0) /* can't happen if i=0 */
679 : {
680 0 : GEN y1 = y+1;
681 0 : j = lr-i; r1[j] = subll(r1[j],y1[j]);
682 0 : for (j--; j>0; j--) r1[j] = subllx(r1[j],y1[j]);
683 0 : j=i; do uel(r,--j)++; while (j && !uel(r,j));
684 : }
685 622253451 : hiremainder = r1[1]; overflow = 0;
686 622253451 : qp = divll(r1[2],y0); k = hiremainder;
687 : }
688 623504961 : j = lr-i+1;
689 623504961 : if (!overflow)
690 : {
691 : long k3, k4;
692 622535859 : k3 = mulll(qp,y1);
693 622535859 : if (j == 3) /* i = lr - 2 maximal, r1[3] undefined -> 0 */
694 89961159 : k4 = subll(hiremainder,k);
695 : else
696 : {
697 532574700 : k3 = subll(k3, r1[3]);
698 532574700 : k4 = subllx(hiremainder,k);
699 : }
700 816724787 : while (!overflow && k4) { qp--; k3 = subll(k3,y1); k4 = subllx(k4,y0); }
701 : }
702 623504961 : if (j<ly) (void)mulll(qp,y[j]); else { hiremainder = 0 ; j = ly; }
703 4094754216 : for (j--; j>1; j--)
704 : {
705 3471249255 : r1[j] = subll(r1[j], addmul(qp,y[j]));
706 3471249255 : hiremainder += overflow;
707 : }
708 623504961 : if (uel(r1,1) != hiremainder)
709 : {
710 463023 : if (uel(r1,1) < hiremainder)
711 : {
712 463023 : qp--;
713 463023 : j = lr-i-(lr-i>=ly); r1[j] = addll(r1[j], y[j]);
714 2528394 : for (j--; j>1; j--) r1[j] = addllx(r1[j], y[j]);
715 : }
716 : else
717 : {
718 0 : r1[1] -= hiremainder;
719 0 : while (r1[1])
720 : {
721 0 : qp++; if (!qp) { j=i; do uel(r,--j)++; while (j && !r[j]); }
722 0 : j = lr-i-(lr-i>=ly); r1[j] = subll(r1[j],y[j]);
723 0 : for (j--; j>1; j--) r1[j] = subllx(r1[j],y[j]);
724 0 : r1[1] -= overflow;
725 : }
726 : }
727 : }
728 623504961 : *++r1 = qp;
729 : }
730 : /* i = lr-1 */
731 : /* round correctly */
732 90004311 : if (uel(r1,1) > (y0>>1))
733 : {
734 44099066 : j=i; do uel(r,--j)++; while (j && !r[j]);
735 : }
736 623504961 : r1 = r-1; for (j=i; j>=2; j--) r[j]=r1[j];
737 90004311 : if (r[0] == 0) e--;
738 39184977 : else if (r[0] == 1) { shift_right(r,r, 2,lr, 1,1); }
739 : else { /* possible only when rounding up to 0x2 0x0 ... */
740 6 : r[2] = (long)HIGHBIT; e++;
741 : }
742 90004311 : r[0] = evaltyp(t_REAL)|evallg(lr);
743 90004311 : r[1] = evalsigne(sx) | evalexpo(e);
744 90004311 : return r;
745 : }
746 :
747 : GEN
748 101008338 : divri(GEN x, GEN y)
749 : {
750 101008338 : long lx, s = signe(y);
751 : pari_sp av;
752 : GEN z;
753 :
754 101008338 : if (!s) pari_err_INV("divri",y);
755 101008338 : if (!signe(x)) return real_0_bit(expo(x) - expi(y));
756 100841469 : if (!is_bigint(y)) {
757 78044496 : GEN z = divru(x, y[2]);
758 78044496 : if (s < 0) togglesign(z);
759 78044496 : return z;
760 : }
761 22796973 : lx = lg(x); z = cgetg(lx, t_REAL); av = avma;
762 22796973 : affrr(divrr(x, itor(y, lg2prec(lx+1))), z);
763 22796973 : return gc_const(av, z);
764 : }
765 :
766 : /* Integer division x / y: such that sign(r) = sign(x)
767 : * if z = ONLY_REM return remainder, otherwise return quotient
768 : * if z != NULL set *z to remainder
769 : * *z is the last object on stack (and thus can be disposed of with cgiv
770 : * instead of gerepile)
771 : * If *z is zero, we put gen_0 here and no copy.
772 : * space needed: lx + ly */
773 : GEN
774 1298645280 : dvmdii(GEN x, GEN y, GEN *z)
775 : {
776 1298645280 : long sx = signe(x), sy = signe(y);
777 1298645280 : long lx, ly = lgefint(y), lz, i, j, sh, lq, lr;
778 : pari_sp av;
779 : ulong y0,y0i,y1, *xd,*rd,*qd;
780 : GEN q, r, r1;
781 :
782 1298645280 : if (!sx)
783 : {
784 39793482 : if (ly < 3) pari_err_INV("dvmdii",gen_0);
785 39793479 : if (!z || z == ONLY_REM) return gen_0;
786 21129162 : *z=gen_0; return gen_0;
787 : }
788 1258851798 : if (ly <= 3)
789 : {
790 : ulong rem;
791 534475356 : if (ly < 3) pari_err_INV("dvmdii",gen_0);
792 534475356 : if (z == ONLY_REM)
793 : {
794 404027262 : rem = umodiu(x,uel(y,2));
795 404027262 : if (!rem) return gen_0;
796 366069066 : return (sx < 0)? utoineg(uel(y,2) - rem): utoipos(rem);
797 : }
798 130448094 : q = absdiviu_rem(x, uel(y,2), &rem);
799 130448094 : if (sx != sy) togglesign(q);
800 130448094 : if (!z) return q;
801 127531110 : if (!rem) *z = gen_0;
802 60995559 : else *z = sx < 0? utoineg(rem): utoipos(rem);
803 127531110 : return q;
804 : }
805 724376442 : lx=lgefint(x);
806 724376442 : lz=lx-ly;
807 724376442 : if (lz <= 0)
808 : {
809 359701461 : if (lz == 0)
810 : {
811 311492046 : for (i=2; i<lx; i++)
812 310885068 : if (x[i] != y[i])
813 : {
814 296459439 : if (uel(x,i) > uel(y,i)) goto DIVIDE;
815 45323361 : goto TRIVIAL;
816 : }
817 606978 : if (z == ONLY_REM) return gen_0;
818 63804 : if (z) *z = gen_0;
819 63804 : if (sx < 0) sy = -sy;
820 63804 : return stoi(sy);
821 : }
822 62635044 : TRIVIAL:
823 107958405 : if (z == ONLY_REM) return icopy(x);
824 1972725 : if (z) *z = icopy(x);
825 1972725 : return gen_0;
826 : }
827 364674981 : DIVIDE: /* quotient is nonzero */
828 615811059 : av=avma; if (sx<0) sy = -sy;
829 615811059 : r1 = new_chunk(lx); sh = bfffo(y[2]);
830 615811059 : if (sh)
831 : { /* normalize so that highbit(y) = 1 (shift left x and y by sh bits)*/
832 607039851 : const ulong m = BITS_IN_LONG - sh;
833 607039851 : r = new_chunk(ly);
834 607039851 : shift_left(r, y,2,ly-1, 0,sh); y = r;
835 607039851 : shift_left(r1,x,2,lx-1, 0,sh);
836 607039851 : r1[1] = uel(x,2) >> m;
837 : }
838 : else
839 : {
840 90288687 : r1[1] = 0; for (j=2; j<lx; j++) r1[j] = x[j];
841 : }
842 615811059 : x = r1;
843 615811059 : y0 = y[2]; y0i = get_Fl_red(y0);
844 615811059 : y1 = y[3];
845 2742730566 : for (i=0; i<=lz; i++)
846 : { /* r1 = x + i */
847 : ulong k, qp;
848 : LOCAL_HIREMAINDER;
849 : LOCAL_OVERFLOW;
850 :
851 2126919507 : if (uel(r1,1) == y0)
852 : {
853 39594 : qp = ULONG_MAX; k = addll(y0,r1[2]);
854 : }
855 : else
856 : {
857 2126879913 : hiremainder = r1[1]; overflow = 0;
858 2126879913 : qp = divll_pre(r1[2],y0,y0i); k = hiremainder;
859 : }
860 2126919507 : if (!overflow)
861 : {
862 2126883703 : long k3 = subll(mulll(qp,y1), r1[3]);
863 2126883703 : long k4 = subllx(hiremainder,k);
864 2559814591 : while (!overflow && k4) { qp--; k3 = subll(k3,y1); k4 = subllx(k4,y0); }
865 : }
866 2126919507 : hiremainder = 0; j = ly;
867 62591661486 : for (j--; j>1; j--)
868 : {
869 60464741979 : r1[j] = subll(r1[j], addmul(qp,y[j]));
870 60464741979 : hiremainder += overflow;
871 : }
872 2126919507 : if (uel(r1,1) < hiremainder)
873 : {
874 5589492 : qp--;
875 5589492 : j = ly-1; r1[j] = addll(r1[j],y[j]);
876 30303433 : for (j--; j>1; j--) r1[j] = addllx(r1[j],y[j]);
877 : }
878 2126919507 : *++r1 = qp;
879 : }
880 :
881 615811059 : lq = lz+2;
882 615811059 : if (!z)
883 : {
884 2234895 : qd = (ulong*)av;
885 2234895 : xd = (ulong*)(x + lq);
886 2234895 : if (x[1]) { lz++; lq++; }
887 31011753 : while (lz--) *--qd = *--xd;
888 2234895 : *--qd = evalsigne(sy) | evallgefint(lq);
889 2234895 : *--qd = evaltyp(t_INT) | evallg(lq);
890 2234895 : return gc_const((pari_sp)qd, (GEN)qd);
891 : }
892 :
893 696902004 : j=lq; while (j<lx && !x[j]) j++;
894 613576164 : lz = lx-j;
895 613576164 : if (z == ONLY_REM)
896 : {
897 381423219 : if (lz==0) return gc_const(av, gen_0);
898 372359658 : rd = (ulong*)av; lr = lz+2;
899 372359658 : xd = (ulong*)(x + lx);
900 404615907 : if (!sh) while (lz--) *--rd = *--xd;
901 : else
902 : { /* shift remainder right by sh bits */
903 364324941 : const ulong shl = BITS_IN_LONG - sh;
904 : ulong l;
905 364324941 : xd--;
906 1228982007 : while (--lz) /* fill r[3..] */
907 : {
908 864657066 : l = *xd >> sh;
909 864657066 : *--rd = l | (*--xd << shl);
910 : }
911 364324941 : l = *xd >> sh;
912 364324941 : if (l) *--rd = l; else lr--;
913 : }
914 372359658 : *--rd = evalsigne(sx) | evallgefint(lr);
915 372359658 : *--rd = evaltyp(t_INT) | evallg(lr);
916 372359658 : return gc_const((pari_sp)rd, (GEN)rd);
917 : }
918 :
919 232152945 : lr = lz+2;
920 232152945 : rd = NULL; /* gcc -Wall */
921 232152945 : if (lz)
922 : { /* non zero remainder: initialize rd */
923 228095469 : xd = (ulong*)(x + lx);
924 228095469 : if (!sh)
925 : {
926 565704 : rd = (ulong*)avma; (void)new_chunk(lr);
927 5557662 : while (lz--) *--rd = *--xd;
928 : }
929 : else
930 : { /* shift remainder right by sh bits */
931 227529765 : const ulong shl = BITS_IN_LONG - sh;
932 : ulong l;
933 227529765 : rd = (ulong*)x; /* overwrite shifted y */
934 227529765 : xd--;
935 1038845541 : while (--lz)
936 : {
937 811315776 : l = *xd >> sh;
938 811315776 : *--rd = l | (*--xd << shl);
939 : }
940 227529765 : l = *xd >> sh;
941 227529765 : if (l) *--rd = l; else lr--;
942 : }
943 228095469 : *--rd = evalsigne(sx) | evallgefint(lr);
944 228095469 : *--rd = evaltyp(t_INT) | evallg(lr);
945 228095469 : rd += lr;
946 : }
947 232152945 : qd = (ulong*)av;
948 232152945 : xd = (ulong*)(x + lq);
949 232152945 : if (x[1]) lq++;
950 698854881 : j = lq-2; while (j--) *--qd = *--xd;
951 232152945 : *--qd = evalsigne(sy) | evallgefint(lq);
952 232152945 : *--qd = evaltyp(t_INT) | evallg(lq);
953 232152945 : q = (GEN)qd;
954 232152945 : if (lr==2) *z = gen_0;
955 : else
956 : { /* rd has been properly initialized: we had lz > 0 */
957 1585549392 : while (lr--) *--qd = *--rd;
958 228095469 : *z = (GEN)qd;
959 : }
960 232152945 : return gc_const((pari_sp)qd, q);
961 : }
962 :
963 : /* Montgomery reduction.
964 : * N has k words, assume T >= 0 has less than 2k.
965 : * Return res := T / B^k mod N, where B = 2^BIL
966 : * such that 0 <= res < T/B^k + N and res has less than k words */
967 : GEN
968 39714855 : red_montgomery(GEN T, GEN N, ulong inv)
969 : {
970 : pari_sp av;
971 : GEN Te, Td, Ne, Nd, scratch;
972 39714855 : ulong i, j, m, t, d, k = NLIMBS(N);
973 : int carry;
974 : LOCAL_HIREMAINDER;
975 : LOCAL_OVERFLOW;
976 :
977 39714855 : if (k == 0) return gen_0;
978 39714855 : d = NLIMBS(T); /* <= 2*k */
979 39714855 : if (d == 0) return gen_0;
980 : #ifdef DEBUG
981 : if (d > 2*k) pari_err_BUG("red_montgomery");
982 : #endif
983 39714846 : if (k == 1)
984 : { /* as below, special cased for efficiency */
985 155685 : ulong n = uel(N,2);
986 155685 : if (d == 1) {
987 155499 : hiremainder = uel(T,2);
988 155499 : m = hiremainder * inv;
989 155499 : (void)addmul(m, n); /* t + m*n = 0 */
990 155499 : return utoi(hiremainder);
991 : } else { /* d = 2 */
992 186 : hiremainder = uel(T,3);
993 186 : m = hiremainder * inv;
994 186 : (void)addmul(m, n); /* t + m*n = 0 */
995 186 : t = addll(hiremainder, uel(T,2));
996 186 : if (overflow) t -= n; /* t > n doesn't fit in 1 word */
997 186 : return utoi(t);
998 : }
999 : }
1000 : /* assume k >= 2 */
1001 39559161 : av = avma; scratch = new_chunk(k<<1); /* >= k + 2: result fits */
1002 :
1003 : /* copy T to scratch space (pad with zeroes to 2k words) */
1004 39559161 : Td = (GEN)av;
1005 39559161 : Te = T + (d+2);
1006 856072332 : for (i=0; i < d ; i++) *--Td = *--Te;
1007 66903834 : for ( ; i < (k<<1); i++) *--Td = 0;
1008 :
1009 39559161 : Te = (GEN)av; /* 1 beyond end of current T mantissa (in scratch) */
1010 39559161 : Ne = N + k+2; /* 1 beyond end of N mantissa */
1011 :
1012 39559161 : carry = 0;
1013 461488083 : for (i=0; i<k; i++) /* set T := T/B nod N, k times */
1014 : {
1015 421928922 : Td = Te; /* one beyond end of (new) T mantissa */
1016 421928922 : Nd = Ne;
1017 421928922 : hiremainder = *--Td;
1018 421928922 : m = hiremainder * inv; /* solve T + m N = O(B) */
1019 :
1020 : /* set T := (T + mN) / B */
1021 421928922 : Te = Td;
1022 421928922 : (void)addmul(m, *--Nd); /* = 0 */
1023 6845560320 : for (j=1; j<k; j++)
1024 : {
1025 6423631398 : t = addll(addmul(m, *--Nd), *--Td);
1026 6423631398 : *Td = t;
1027 6423631398 : hiremainder += overflow;
1028 : }
1029 421928922 : t = addll(hiremainder, *--Td); *Td = t + carry;
1030 421928922 : carry = (overflow || (carry && *Td == 0));
1031 : }
1032 39559161 : if (carry)
1033 : { /* Td > N overflows (k+1 words), set Td := Td - N */
1034 373056 : Td = Te;
1035 373056 : Nd = Ne;
1036 373056 : t = subll(*--Td, *--Nd); *Td = t;
1037 6971085 : while (Td > scratch) { t = subllx(*--Td, *--Nd); *Td = t; }
1038 : }
1039 :
1040 : /* copy result */
1041 39559161 : Td = (GEN)av;
1042 43929684 : while (*scratch == 0 && Te > scratch) scratch++; /* strip leading 0s */
1043 457117560 : while (Te > scratch) *--Td = *--Te;
1044 39559161 : k = (GEN)av - Td; if (!k) return gc_const(av, gen_0);
1045 39559161 : k += 2;
1046 39559161 : *--Td = evalsigne(1) | evallgefint(k);
1047 39559161 : *--Td = evaltyp(t_INT) | evallg(k);
1048 : #ifdef DEBUG
1049 : {
1050 : long l = NLIMBS(N), s = BITS_IN_LONG*l;
1051 : GEN R = int2n(s);
1052 : GEN res = remii(mulii(T, Fp_inv(R, N)), N);
1053 : if (k > lgefint(N)
1054 : || !equalii(remii(Td,N),res)
1055 : || cmpii(Td, addii(shifti(T, -s), N)) >= 0) pari_err_BUG("red_montgomery");
1056 : }
1057 : #endif
1058 39559161 : return gc_const((pari_sp)Td, Td);
1059 : }
1060 :
1061 : /* EXACT INTEGER DIVISION */
1062 :
1063 : /* assume xy>0, the division is exact and y is odd. Destroy x */
1064 : static GEN
1065 31432665 : diviuexact_i(GEN x, ulong y)
1066 : {
1067 : long i, lz, lx;
1068 : ulong q, yinv;
1069 : GEN z, z0, x0, x0min;
1070 :
1071 31432665 : if (y == 1) return icopy(x);
1072 24674331 : lx = lgefint(x);
1073 24674331 : if (lx == 3)
1074 : {
1075 1090194 : q = uel(x,2) / y;
1076 1090194 : if (!q) pari_err_OP("exact division", x, utoi(y));
1077 1090194 : return utoipos(q);
1078 : }
1079 23584137 : yinv = invmod2BIL(y);
1080 23584137 : lz = (y <= uel(x,2)) ? lx : lx-1;
1081 23584137 : z = new_chunk(lz);
1082 23584137 : z0 = z + lz;
1083 23584137 : x0 = x + lx; x0min = x + lx-lz+2;
1084 :
1085 84443451 : while (x0 > x0min)
1086 : {
1087 60859314 : *--z0 = q = yinv*uel(--x0,0); /* i-th quotient */
1088 60859314 : if (!q) continue;
1089 : /* x := x - q * y */
1090 : { /* update neither lowest word (could set it to 0) nor highest ones */
1091 60334425 : GEN x1 = x0 - 1;
1092 : LOCAL_HIREMAINDER;
1093 60334425 : (void)mulll(q,y);
1094 60334425 : if (hiremainder)
1095 : {
1096 48266421 : if (uel(x1,0) < hiremainder)
1097 : {
1098 131727 : uel(x1,0) -= hiremainder;
1099 133692 : do uel(--x1,0)--; while (uel(x1,0) == ULONG_MAX);
1100 : }
1101 : else
1102 48134694 : uel(x1,0) -= hiremainder;
1103 : }
1104 : }
1105 : }
1106 23584137 : i=2; while(!z[i]) i++;
1107 23584137 : z += i-2; lz -= i-2;
1108 23584137 : z[0] = evaltyp(t_INT)|evallg(lz);
1109 23584137 : z[1] = evalsigne(1)|evallg(lz);
1110 23584137 : if (lz == 2) pari_err_OP("exact division", x, utoi(y));
1111 23584137 : return gc_const((pari_sp)z, z);
1112 : }
1113 :
1114 : /* assume y != 0 and the division is exact */
1115 : GEN
1116 20676921 : diviuexact(GEN x, ulong y)
1117 : {
1118 : pari_sp av;
1119 20676921 : long lx, vy, s = signe(x);
1120 : GEN z;
1121 :
1122 20676921 : if (!s) return gen_0;
1123 19838757 : if (y == 1) return icopy(x);
1124 16847286 : lx = lgefint(x);
1125 16847286 : if (lx == 3) {
1126 13006542 : ulong q = uel(x,2) / y;
1127 13006542 : if (!q) pari_err_OP("exact division", x, utoi(y));
1128 13006542 : return (s > 0)? utoipos(q): utoineg(q);
1129 : }
1130 3840744 : av = avma; (void)new_chunk(lx); vy = vals(y);
1131 3840744 : if (vy) {
1132 1500183 : y >>= vy;
1133 1500183 : if (y == 1) { set_avma(av); return shifti(x, -vy); }
1134 700893 : x = shifti(x, -vy);
1135 700893 : if (lx == 3) {
1136 0 : ulong q = uel(x,2) / y;
1137 0 : set_avma(av);
1138 0 : if (!q) pari_err_OP("exact division", x, utoi(y));
1139 0 : return (s > 0)? utoipos(q): utoineg(q);
1140 : }
1141 2340561 : } else x = icopy(x);
1142 3041454 : set_avma(av);
1143 3041454 : z = diviuexact_i(x, y);
1144 3041454 : setsigne(z, s); return z;
1145 : }
1146 :
1147 : /* Find z such that x=y*z, knowing that y | x (unchecked)
1148 : * Method: y0 z0 = x0 mod B = 2^BITS_IN_LONG ==> z0 = 1/y0 mod B.
1149 : * Set x := (x - z0 y) / B, updating only relevant words, and repeat */
1150 : GEN
1151 354203850 : diviiexact(GEN x, GEN y)
1152 : {
1153 354203850 : long lx, ly, lz, vy, i, ii, sx = signe(x), sy = signe(y);
1154 : pari_sp av;
1155 : ulong y0inv,q;
1156 : GEN z;
1157 :
1158 354203850 : if (!sy) pari_err_INV("diviiexact",gen_0);
1159 354203850 : if (!sx) return gen_0;
1160 285144384 : lx = lgefint(x);
1161 285144384 : if (lx == 3) {
1162 221166648 : q = uel(x,2) / uel(y,2);
1163 221166648 : if (!q) pari_err_OP("exact division", x, y);
1164 221166648 : return (sx+sy) ? utoipos(q): utoineg(q);
1165 : }
1166 63977736 : vy = vali(y); av = avma;
1167 63977736 : (void)new_chunk(lx); /* enough room for z */
1168 63977736 : if (vy)
1169 : { /* make y odd */
1170 33764721 : y = shifti(y,-vy);
1171 33764721 : x = shifti(x,-vy); lx = lgefint(x);
1172 : }
1173 30213015 : else x = icopy(x); /* necessary because we destroy x */
1174 63977736 : set_avma(av); /* will erase our x,y when exiting */
1175 : /* now y is odd */
1176 63977736 : ly = lgefint(y);
1177 63977736 : if (ly == 3)
1178 : {
1179 28391211 : z = diviuexact_i(x,uel(y,2)); /* x != 0 */
1180 28391211 : setsigne(z, (sx+sy)? 1: -1); return z;
1181 : }
1182 35586525 : y0inv = invmod2BIL(y[ly-1]);
1183 55469232 : i=2; while (i<ly && y[i]==x[i]) i++;
1184 35586525 : lz = (i==ly || uel(y,i) < uel(x,i)) ? lx-ly+3 : lx-ly+2;
1185 35586525 : z = new_chunk(lz);
1186 :
1187 35586525 : y += ly - 1; /* now y[-i] = i-th word of y */
1188 165795885 : for (ii=lx-1,i=lz-1; i>=2; i--,ii--)
1189 : {
1190 : long limj;
1191 : LOCAL_HIREMAINDER;
1192 : LOCAL_OVERFLOW;
1193 :
1194 130209360 : z[i] = q = y0inv*uel(x,ii); /* i-th quotient */
1195 130209360 : if (!q) continue;
1196 :
1197 : /* x := x - q * y */
1198 130096986 : (void)mulll(q,y[0]); limj = maxss(lx - lz, ii+3-ly);
1199 : { /* update neither lowest word (could set it to 0) nor highest ones */
1200 130096986 : GEN x0 = x + (ii - 1), y0 = y - 1, xlim = x + limj;
1201 2277204195 : for (; x0 >= xlim; x0--, y0--)
1202 : {
1203 2147107209 : *x0 = subll(*x0, addmul(q,*y0));
1204 2147107209 : hiremainder += overflow;
1205 : }
1206 130096986 : if (hiremainder && limj != lx - lz)
1207 : {
1208 68759196 : if ((ulong)*x0 < hiremainder)
1209 : {
1210 798210 : *x0 -= hiremainder;
1211 798210 : do (*--x0)--; while ((ulong)*x0 == ULONG_MAX);
1212 : }
1213 : else
1214 67960986 : *x0 -= hiremainder;
1215 : }
1216 : }
1217 : }
1218 35586525 : i=2; while(!z[i]) i++;
1219 35586525 : z += i-2; lz -= (i-2);
1220 35586525 : z[0] = evaltyp(t_INT)|evallg(lz);
1221 35586525 : z[1] = evalsigne((sx+sy)? 1: -1) | evallg(lz);
1222 35586525 : if (lz == 2) pari_err_OP("exact division", x, y);
1223 35586525 : return gc_const((pari_sp)z, z);
1224 : }
1225 :
1226 : /* assume yz != and yz | x */
1227 : GEN
1228 148749 : diviuuexact(GEN x, ulong y, ulong z)
1229 : {
1230 : long tmp[4];
1231 : ulong t;
1232 : LOCAL_HIREMAINDER;
1233 148749 : t = mulll(y, z);
1234 148749 : if (!hiremainder) return diviuexact(x, t);
1235 0 : tmp[0] = evaltyp(t_INT)|_evallg(4);
1236 0 : tmp[1] = evalsigne(1)|evallgefint(4);
1237 0 : tmp[2] = hiremainder;
1238 0 : tmp[3] = t;
1239 0 : return diviiexact(x, tmp);
1240 : }
1241 :
1242 : /********************************************************************/
1243 : /** **/
1244 : /** INTEGER MULTIPLICATION (BASECASE) **/
1245 : /** **/
1246 : /********************************************************************/
1247 : /* nx >= ny = num. of digits of x, y (not GEN, see mulii) */
1248 : INLINE GEN
1249 4420009698 : muliispec_basecase(GEN x, GEN y, long nx, long ny)
1250 : {
1251 : GEN z2e,z2d,yd,xd,ye,zd;
1252 : long p1,lz;
1253 : LOCAL_HIREMAINDER;
1254 :
1255 4420009698 : if (ny == 1) return muluispec((ulong)*y, x, nx);
1256 1053543480 : if (ny == 0) return gen_0;
1257 1052386803 : zd = (GEN)avma; lz = nx+ny+2;
1258 1052386803 : (void)new_chunk(lz);
1259 1052386803 : xd = x + nx;
1260 1052386803 : yd = y + ny;
1261 1052386803 : ye = yd; p1 = *--xd;
1262 :
1263 1052386803 : *--zd = mulll(p1, *--yd); z2e = zd;
1264 8530078179 : while (yd > y) *--zd = addmul(p1, *--yd);
1265 1052386803 : *--zd = hiremainder;
1266 :
1267 9840712572 : while (xd > x)
1268 : {
1269 : LOCAL_OVERFLOW;
1270 8788325769 : yd = ye; p1 = *--xd;
1271 :
1272 8788325769 : z2d = --z2e;
1273 8788325769 : *z2d = addll(mulll(p1, *--yd), *z2d); z2d--;
1274 >10938*10^7 : while (yd > y)
1275 : {
1276 >10059*10^7 : hiremainder += overflow;
1277 >10059*10^7 : *z2d = addll(addmul(p1, *--yd), *z2d); z2d--;
1278 : }
1279 8788325769 : *--zd = hiremainder + overflow;
1280 : }
1281 1052386803 : if (*zd == 0) { zd++; lz--; } /* normalize */
1282 1052386803 : *--zd = evalsigne(1) | evallgefint(lz);
1283 1052386803 : *--zd = evaltyp(t_INT) | evallg(lz);
1284 1052386803 : return gc_const((pari_sp)zd, zd);
1285 : }
1286 :
1287 : INLINE GEN
1288 823283643 : sqrispec_basecase(GEN x, long nx)
1289 : {
1290 : GEN z2e,z2d,yd,xd,zd,x0,z0;
1291 : long p1,lz;
1292 : LOCAL_HIREMAINDER;
1293 : LOCAL_OVERFLOW;
1294 :
1295 823283643 : if (nx == 1) return sqru((ulong)*x);
1296 577190439 : if (nx == 0) return gen_0;
1297 194446278 : zd = (GEN)avma; lz = (nx+1) << 1;
1298 194446278 : z0 = new_chunk(lz);
1299 194446278 : if (nx == 1)
1300 : {
1301 0 : *--zd = mulll(*x, *x);
1302 0 : *--zd = hiremainder; goto END;
1303 : }
1304 194446278 : xd = x + nx;
1305 :
1306 : /* compute double products --> zd */
1307 194446278 : p1 = *--xd; yd = xd; --zd;
1308 194446278 : *--zd = mulll(p1, *--yd); z2e = zd;
1309 1124078691 : while (yd > x) *--zd = addmul(p1, *--yd);
1310 194446278 : *--zd = hiremainder;
1311 :
1312 194446278 : x0 = x+1;
1313 1124078691 : while (xd > x0)
1314 : {
1315 : LOCAL_OVERFLOW;
1316 929632413 : p1 = *--xd; yd = xd;
1317 :
1318 929632413 : z2e -= 2; z2d = z2e;
1319 929632413 : *z2d = addll(mulll(p1, *--yd), *z2d); z2d--;
1320 7745788662 : while (yd > x)
1321 : {
1322 6816156249 : hiremainder += overflow;
1323 6816156249 : *z2d = addll(addmul(p1, *--yd), *z2d); z2d--;
1324 : }
1325 929632413 : *--zd = hiremainder + overflow;
1326 : }
1327 : /* multiply zd by 2 (put result in zd - 1) */
1328 194446278 : zd[-1] = ((*zd & HIGHBIT) != 0);
1329 194446278 : shift_left(zd, zd, 0, (nx<<1)-3, 0, 1);
1330 :
1331 : /* add the squares */
1332 194446278 : xd = x + nx; zd = z0 + lz;
1333 194446278 : p1 = *--xd;
1334 194446278 : zd--; *zd = mulll(p1,p1);
1335 194446278 : zd--; *zd = addll(hiremainder, *zd);
1336 1318524969 : while (xd > x)
1337 : {
1338 1124078691 : p1 = *--xd;
1339 1124078691 : zd--; *zd = addll(mulll(p1,p1)+ overflow, *zd);
1340 1124078691 : zd--; *zd = addll(hiremainder + overflow, *zd);
1341 : }
1342 :
1343 194446278 : END:
1344 194446278 : if (*zd == 0) { zd++; lz--; } /* normalize */
1345 194446278 : *--zd = evalsigne(1) | evallgefint(lz);
1346 194446278 : *--zd = evaltyp(t_INT) | evallg(lz);
1347 194446278 : return gc_const((pari_sp)zd, zd);
1348 : }
1349 :
1350 : /********************************************************************/
1351 : /** **/
1352 : /** INTEGER MULTIPLICATION (FFT) **/
1353 : /** **/
1354 : /********************************************************************/
1355 :
1356 : /*
1357 : Compute parameters for FFT:
1358 : len: result length
1359 : k: FFT depth.
1360 : n: number of blocks (2^k)
1361 : bs: block size
1362 : mod: Modulus is M=2^(BIL*mod)+1
1363 : ord: order of 2 in Z/MZ.
1364 : We must have:
1365 : bs*n >= l
1366 : 2^(BIL*mod) > nb*2^(2*BIL*bs)
1367 : 2^k | 2*BIL*mod
1368 : */
1369 : static void
1370 84627 : mulliifft_params(long len, long *k, long *mod, long *bs, long *n, ulong *ord)
1371 : {
1372 : long r;
1373 84627 : *k = expu((3*len)>>2)-3;
1374 : do {
1375 84630 : (*k)--;
1376 84630 : r = *k-(TWOPOTBITS_IN_LONG+2);
1377 84630 : *n = 1L<<*k;
1378 84630 : *bs = (len+*n-1)>>*k;
1379 84630 : *mod= 2**bs+1;
1380 84630 : if (r>0)
1381 5055 : *mod=((*mod+(1L<<r)-1)>>r)<<r;
1382 84630 : } while(*mod>=3**bs);
1383 84627 : *ord= 4**mod*BITS_IN_LONG;
1384 84627 : }
1385 :
1386 : /* Zf_: arithmetic in ring Z/MZ where M= 2^(BITS_IN_LONG*mod)+1
1387 : * for some mod.
1388 : * Do not garbage collect.
1389 : */
1390 :
1391 : static GEN
1392 185349504 : Zf_add(GEN a, GEN b, GEN M)
1393 : {
1394 185349504 : GEN y, z = addii(a,b);
1395 185349504 : long mod = lgefint(M)-3;
1396 185349504 : long l = NLIMBS(z);
1397 185349504 : if (l<=mod) return z;
1398 71754042 : y = subiu(z, 1);
1399 71754042 : if (NLIMBS(y)<=mod) return z;
1400 71754042 : return int_normalize(y,1);
1401 : }
1402 :
1403 : static GEN
1404 188674131 : Zf_sub(GEN a, GEN b, GEN M)
1405 : {
1406 188674131 : GEN z = subii(a,b);
1407 188674131 : return signe(z)>=0? z: addii(M,z);
1408 : }
1409 :
1410 : /* destroy z */
1411 : static GEN
1412 394134012 : Zf_red_destroy(GEN z, GEN M)
1413 : {
1414 394134012 : long mod = lgefint(M)-3;
1415 394134012 : long l = NLIMBS(z);
1416 : GEN y;
1417 394134012 : if (l<=mod) return z;
1418 174907977 : y = shifti(z, -mod*BITS_IN_LONG);
1419 174907977 : z = int_normalize(z, NLIMBS(y));
1420 174907977 : y = Zf_red_destroy(y, M);
1421 174907977 : z = subii(z, y);
1422 174907977 : if (signe(z)<0) z = addii(z, M);
1423 174907977 : return z;
1424 : }
1425 :
1426 : INLINE GEN
1427 203619507 : Zf_shift(GEN a, ulong s, GEN M) { return Zf_red_destroy(shifti(a, s), M); }
1428 :
1429 : /*
1430 : Multiply by sqrt(2)^s
1431 : We use the formula sqrt(2)=z_8*(1-z_4)) && z_8=2^(ord/16) [2^(ord/4)+1]
1432 : */
1433 :
1434 : static GEN
1435 185349504 : Zf_mulsqrt2(GEN a, ulong s, ulong ord, GEN M)
1436 : {
1437 185349504 : ulong hord = ord>>1;
1438 185349504 : if (!signe(a)) return gen_0;
1439 181363725 : if (odd(s)) /* Multiply by 2^(s/2) */
1440 : {
1441 3324627 : GEN az8 = Zf_shift(a, ord>>4, M);
1442 3324627 : GEN az83 = Zf_shift(az8, ord>>3, M);
1443 3324627 : a = Zf_sub(az8, az83, M);
1444 3324627 : s--;
1445 : }
1446 181363725 : if (s < hord)
1447 134759730 : return Zf_shift(a, s>>1, M);
1448 : else
1449 46603995 : return subii(M,Zf_shift(a, (s-hord)>>1, M));
1450 : }
1451 :
1452 : INLINE GEN
1453 436224 : Zf_sqr(GEN a, GEN M) { return Zf_red_destroy(sqri(a), M); }
1454 :
1455 : INLINE GEN
1456 15170304 : Zf_mul(GEN a, GEN b, GEN M) { return Zf_red_destroy(mulii(a,b), M); }
1457 :
1458 : /* In place, bit reversing FFT */
1459 : static void
1460 30609243 : muliifft_dit(ulong o, ulong ord, GEN M, GEN FFT, long d, long step)
1461 : {
1462 30609243 : pari_sp av = avma;
1463 : long i;
1464 30609243 : ulong j, no = (o<<1)%ord;
1465 30609243 : long hstep=step>>1;
1466 153541851 : for (i = d+1, j = 0; i <= d+hstep; ++i, j =(j+o)%ord)
1467 : {
1468 122932608 : GEN a = Zf_add(gel(FFT,i), gel(FFT,i+hstep), M);
1469 122932608 : GEN b = Zf_mulsqrt2(Zf_sub(gel(FFT,i), gel(FFT,i+hstep), M), j, ord, M);
1470 122932608 : affii(a,gel(FFT,i));
1471 122932608 : affii(b,gel(FFT,i+hstep));
1472 122932608 : set_avma(av);
1473 : }
1474 30609243 : if (hstep>1)
1475 : {
1476 15220827 : muliifft_dit(no, ord, M, FFT, d, hstep);
1477 15220827 : muliifft_dit(no, ord, M, FFT, d+hstep, hstep);
1478 : }
1479 30609243 : }
1480 :
1481 : /* In place, bit reversed FFT, inverse of muliifft_dit */
1482 : static void
1483 15521901 : muliifft_dis(ulong o, ulong ord, GEN M, GEN FFT, long d, long step)
1484 : {
1485 15521901 : pari_sp av = avma;
1486 : long i;
1487 15521901 : ulong j, no = (o<<1)%ord;
1488 15521901 : long hstep=step>>1;
1489 15521901 : if (hstep>1)
1490 : {
1491 7718637 : muliifft_dis(no, ord, M, FFT, d, hstep);
1492 7718637 : muliifft_dis(no, ord, M, FFT, d+hstep, hstep);
1493 : }
1494 77938797 : for (i = d+1, j = 0; i <= d+hstep; ++i, j =(j+o)%ord)
1495 : {
1496 62416896 : GEN z = Zf_mulsqrt2(gel(FFT,i+hstep), j, ord, M);
1497 62416896 : GEN a = Zf_add(gel(FFT,i), z, M);
1498 62416896 : GEN b = Zf_sub(gel(FFT,i), z, M);
1499 62416896 : affii(a,gel(FFT,i));
1500 62416896 : affii(b,gel(FFT,i+hstep));
1501 62416896 : set_avma(av);
1502 : }
1503 15521901 : }
1504 :
1505 : static GEN
1506 167589 : muliifft_spliti(GEN a, long na, long bs, long n, long mod)
1507 : {
1508 167589 : GEN ap = a+na-1;
1509 167589 : GEN c = cgetg(n+1, t_VEC);
1510 : long i,j;
1511 30944421 : for(i=1;i<=n;i++)
1512 : {
1513 30776832 : GEN z = cgeti(mod+3);
1514 30776832 : if (na)
1515 : {
1516 15156264 : long m = minss(bs, na), v=0;
1517 15156264 : GEN zp, aa=ap-m+1;
1518 83070021 : while (!*aa && v<m) {aa++; v++;}
1519 15156264 : zp = z+m-v+1;
1520 377102751 : for (j=v; j < m; j++)
1521 361946487 : *zp-- = *ap--;
1522 15156264 : ap -= v; na -= m;
1523 15156264 : z[1] = evalsigne(m!=v) | evallgefint(m-v+2);
1524 : } else
1525 15620568 : z[1] = evalsigne(0) | evallgefint(2);
1526 30776832 : gel(c, i) = z;
1527 : }
1528 167589 : return c;
1529 : }
1530 :
1531 : static GEN
1532 84627 : muliifft_unspliti(GEN V, long bs, long len)
1533 : {
1534 84627 : long s, i, j, l = lg(V);
1535 84627 : GEN a = cgeti(len);
1536 84627 : a[1] = evalsigne(1)|evallgefint(len);
1537 436579296 : for(i=2;i<len;i++)
1538 436494669 : a[i] = 0;
1539 15691155 : for(i=1, s=0; i<l; i++, s+=bs)
1540 : {
1541 15606528 : GEN u = gel(V,i);
1542 15606528 : if (signe(u))
1543 : {
1544 15032862 : GEN ap = int_W(a,s);
1545 15032862 : GEN up = int_LSW(u);
1546 15032862 : long lu = NLIMBS(u);
1547 : LOCAL_OVERFLOW;
1548 15032862 : *ap = addll(*ap, *up--); ap--;
1549 853391682 : for (j=1; j<lu; j++)
1550 838358820 : { *ap = addllx(*ap, *up--); ap--; }
1551 15035418 : while (overflow)
1552 2556 : { *ap = addll(*ap, 1); ap--; }
1553 : }
1554 : }
1555 84627 : return int_normalize(a,0);
1556 : }
1557 :
1558 : static GEN
1559 1665 : sqrispec_fft(GEN a, long na)
1560 : {
1561 1665 : pari_sp av, ltop = avma;
1562 1665 : long len = 2*na;
1563 : long k, mod, bs, n;
1564 : GEN FFT, M;
1565 : long i;
1566 : ulong o, ord;
1567 :
1568 1665 : mulliifft_params(len,&k,&mod,&bs,&n,&ord);
1569 1665 : o = ord>>k;
1570 1665 : M = int2n(mod*BITS_IN_LONG);
1571 1665 : M[2+mod] = 1;
1572 1665 : FFT = muliifft_spliti(a, na, bs, n, mod);
1573 1665 : muliifft_dit(o, ord, M, FFT, 0, n);
1574 1665 : av = avma;
1575 437889 : for(i=1; i<=n; i++)
1576 : {
1577 436224 : affii(Zf_sqr(gel(FFT,i), M), gel(FFT,i));
1578 436224 : set_avma(av);
1579 : }
1580 1665 : muliifft_dis(ord-o, ord, M, FFT, 0, n);
1581 437889 : for(i=1; i<=n; i++)
1582 : {
1583 436224 : affii(Zf_shift(gel(FFT,i), (ord>>1)-k, M), gel(FFT,i));
1584 436224 : set_avma(av);
1585 : }
1586 1665 : return gerepileuptoint(ltop, muliifft_unspliti(FFT,bs,2+len));
1587 : }
1588 :
1589 : static GEN
1590 82962 : muliispec_fft(GEN a, GEN b, long na, long nb)
1591 : {
1592 82962 : pari_sp av, av2, ltop = avma;
1593 82962 : long len = na+nb;
1594 : long k, mod, bs, n;
1595 : GEN FFT, FFTb, M;
1596 : long i;
1597 : ulong o, ord;
1598 :
1599 82962 : mulliifft_params(len,&k,&mod,&bs,&n,&ord);
1600 82962 : o = ord>>k;
1601 82962 : M = int2n(mod*BITS_IN_LONG);
1602 82962 : M[2+mod] = 1;
1603 82962 : FFT = muliifft_spliti(a, na, bs, n, mod);
1604 82962 : av=avma;
1605 82962 : muliifft_dit(o, ord, M, FFT, 0, n);
1606 82962 : FFTb = muliifft_spliti(b, nb, bs, n, mod);
1607 82962 : av2 = avma;
1608 82962 : muliifft_dit(o, ord, M, FFTb, 0, n);
1609 15253266 : for(i=1; i<=n; i++)
1610 : {
1611 15170304 : affii(Zf_mul(gel(FFT,i), gel(FFTb,i), M), gel(FFT,i));
1612 15170304 : set_avma(av2);
1613 : }
1614 82962 : set_avma(av);
1615 82962 : muliifft_dis(ord-o, ord, M, FFT, 0, n);
1616 15253266 : for(i=1; i<=n; i++)
1617 : {
1618 15170304 : affii(Zf_shift(gel(FFT,i),(ord>>1)-k,M), gel(FFT,i));
1619 15170304 : set_avma(av);
1620 : }
1621 82962 : return gerepileuptoint(ltop, muliifft_unspliti(FFT,bs,2+len));
1622 : }
1623 :
1624 : /********************************************************************/
1625 : /** **/
1626 : /** INTEGER MULTIPLICATION (KARATSUBA) **/
1627 : /** **/
1628 : /********************************************************************/
1629 :
1630 : /* return (x shifted left d words) + y. Assume d > 0, x > 0 and y >= 0 */
1631 : static GEN
1632 599786130 : addshiftw(GEN x, GEN y, long d)
1633 : {
1634 599786130 : GEN z,z0,y0,yd, zd = (GEN)avma;
1635 599786130 : long a,lz,ly = lgefint(y);
1636 :
1637 599786130 : z0 = new_chunk(d);
1638 599786130 : a = ly-2; yd = y+ly;
1639 599786130 : if (a >= d)
1640 : {
1641 10832208264 : y0 = yd-d; while (yd > y0) *--zd = *--yd; /* copy last d words of y */
1642 595773525 : a -= d;
1643 595773525 : if (a)
1644 410398116 : z = addiispec(LIMBS(x), LIMBS(y), NLIMBS(x), a);
1645 : else
1646 185375409 : z = icopy(x);
1647 : }
1648 : else
1649 : {
1650 15336462 : y0 = yd-a; while (yd > y0) *--zd = *--yd; /* copy last a words of y */
1651 68073105 : while (zd > z0) *--zd = 0; /* complete with 0s */
1652 4012605 : z = icopy(x);
1653 : }
1654 599786130 : lz = lgefint(z)+d;
1655 599786130 : z[1] = evalsigne(1) | evallgefint(lz);
1656 599786130 : z[0] = evaltyp(t_INT) | evallg(lz); return z;
1657 : }
1658 :
1659 : /* Fast product (Karatsuba) of integers. a and b are "special" GENs
1660 : * c,c0,c1,c2 are genuine GENs.
1661 : */
1662 : GEN
1663 4620974874 : muliispec(GEN a, GEN b, long na, long nb)
1664 : {
1665 : GEN a0,c,c0;
1666 : long n0, n0a, i;
1667 : pari_sp av;
1668 :
1669 4620974874 : if (na < nb) swapspec(a,b, na,nb);
1670 4620974874 : if (nb < MULII_KARATSUBA_LIMIT) return muliispec_basecase(a,b,na,nb);
1671 200965176 : if (nb >= MULII_FFT_LIMIT) return muliispec_fft(a,b,na,nb);
1672 200882214 : i=(na>>1); n0=na-i; na=i;
1673 200882214 : av=avma; a0=a+na; n0a=n0;
1674 296893863 : while (n0a && !*a0) { a0++; n0a--; }
1675 :
1676 200882214 : if (n0a && nb > n0)
1677 197447370 : { /* nb <= na <= n0 */
1678 : GEN b0,c1,c2;
1679 : long n0b;
1680 :
1681 197447370 : nb -= n0;
1682 197447370 : c = muliispec(a,b,na,nb);
1683 197447370 : b0 = b+nb; n0b = n0;
1684 277312488 : while (n0b && !*b0) { b0++; n0b--; }
1685 197447370 : if (n0b)
1686 : {
1687 196725387 : c0 = muliispec(a0,b0, n0a,n0b);
1688 :
1689 196725387 : c2 = addiispec(a0,a, n0a,na);
1690 196725387 : c1 = addiispec(b0,b, n0b,nb);
1691 196725387 : c1 = muliispec(LIMBS(c1),LIMBS(c2), NLIMBS(c1),NLIMBS(c2));
1692 196725387 : c2 = addiispec(LIMBS(c0),LIMBS(c), NLIMBS(c0),NLIMBS(c));
1693 :
1694 196725387 : c1 = subiispec(LIMBS(c1),LIMBS(c2), NLIMBS(c1),NLIMBS(c2));
1695 : }
1696 : else
1697 : {
1698 721983 : c0 = gen_0;
1699 721983 : c1 = muliispec(a0,b, n0a,nb);
1700 : }
1701 197447370 : c = addshiftw(c,c1, n0);
1702 : }
1703 : else
1704 : {
1705 3434844 : c = muliispec(a,b,na,nb);
1706 3434844 : c0 = muliispec(a0,b,n0a,nb);
1707 : }
1708 200882214 : return gerepileuptoint(av, addshiftw(c,c0, n0));
1709 : }
1710 : GEN
1711 165417 : muluui(ulong x, ulong y, GEN z)
1712 : {
1713 165417 : long t, s = signe(z);
1714 : GEN r;
1715 : LOCAL_HIREMAINDER;
1716 :
1717 165417 : if (!x || !y || !signe(z)) return gen_0;
1718 165120 : t = mulll(x,y);
1719 165120 : if (!hiremainder)
1720 165120 : r = muluispec(t, z+2, lgefint(z)-2);
1721 : else
1722 : {
1723 : long tmp[2];
1724 0 : tmp[0] = hiremainder;
1725 0 : tmp[1] = t;
1726 0 : r = muliispec(z+2,tmp,lgefint(z)-2,2);
1727 : }
1728 165120 : setsigne(r,s); return r;
1729 : }
1730 :
1731 : #define sqrispec_mirror sqrispec
1732 : #define muliispec_mirror muliispec
1733 :
1734 : /* x % (2^n), assuming n >= 0 */
1735 : GEN
1736 18653331 : remi2n(GEN x, long n)
1737 : {
1738 18653331 : long hi,l,k,lx,ly, sx = signe(x);
1739 : GEN z, xd, zd;
1740 :
1741 18653331 : if (!sx || !n) return gen_0;
1742 :
1743 18630597 : k = dvmdsBIL(n, &l);
1744 18630597 : lx = lgefint(x);
1745 18630597 : if (lx < k+3) return icopy(x);
1746 :
1747 18328926 : xd = x + (lx-k-1);
1748 : /* x = |_|...|#|1|...|k| : copy the last l bits of # and the last k words
1749 : * ^--- initial xd */
1750 18328926 : hi = ((ulong)*xd) & ((1UL<<l)-1); /* last l bits of # = top bits of result */
1751 18328926 : if (!hi)
1752 : { /* strip leading zeroes from result */
1753 1131735 : xd++; while (k && !*xd) { k--; xd++; }
1754 1104039 : if (!k) return gen_0;
1755 906207 : ly = k+2; xd--;
1756 : }
1757 : else
1758 17224887 : ly = k+3;
1759 :
1760 18131094 : zd = z = cgeti(ly);
1761 18131094 : *++zd = evalsigne(sx) | evallgefint(ly);
1762 18131094 : if (hi) *++zd = hi;
1763 72122001 : for ( ;k; k--) *++zd = *++xd;
1764 18131094 : return z;
1765 : }
1766 :
1767 : GEN
1768 830633202 : sqrispec(GEN a, long na)
1769 : {
1770 : GEN a0,c;
1771 : long n0, n0a, i;
1772 : pari_sp av;
1773 :
1774 830633202 : if (na < SQRI_KARATSUBA_LIMIT) return sqrispec_basecase(a,na);
1775 7349559 : if (na >= SQRI_FFT_LIMIT) return sqrispec_fft(a,na);
1776 7347894 : i=(na>>1); n0=na-i; na=i;
1777 7347894 : av=avma; a0=a+na; n0a=n0;
1778 11615877 : while (n0a && !*a0) { a0++; n0a--; }
1779 7347894 : c = sqrispec(a,na);
1780 7347894 : if (n0a)
1781 : {
1782 7339191 : GEN t, c1, c0 = sqrispec(a0,n0a);
1783 : #if 0
1784 : c1 = shifti(muliispec(a0,a, n0a,na),1);
1785 : #else /* faster */
1786 7339191 : t = addiispec(a0,a,n0a,na);
1787 7339191 : t = sqrispec(LIMBS(t),NLIMBS(t));
1788 7339191 : c1= addiispec(LIMBS(c0),LIMBS(c), NLIMBS(c0), NLIMBS(c));
1789 7339191 : c1= subiispec(LIMBS(t),LIMBS(c1), NLIMBS(t), NLIMBS(c1));
1790 : #endif
1791 7339191 : c = addshiftw(c,c1, n0);
1792 7339191 : c = addshiftw(c,c0, n0);
1793 : }
1794 : else
1795 8703 : c = addshiftw(c,gen_0,n0<<1);
1796 7347894 : return gerepileuptoint(av, c);
1797 : }
1798 :
1799 : /********************************************************************/
1800 : /** **/
1801 : /** KARATSUBA SQUARE ROOT **/
1802 : /** adapted from Paul Zimmermann's implementation of **/
1803 : /** his algorithm in GMP (mpn_sqrtrem) **/
1804 : /** **/
1805 : /********************************************************************/
1806 :
1807 : /* Square roots table */
1808 : static const unsigned char approx_tab[192] = {
1809 : 128,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,
1810 : 143,144,144,145,146,147,148,149,150,150,151,152,153,154,155,155,
1811 : 156,157,158,159,160,160,161,162,163,163,164,165,166,167,167,168,
1812 : 169,170,170,171,172,173,173,174,175,176,176,177,178,178,179,180,
1813 : 181,181,182,183,183,184,185,185,186,187,187,188,189,189,190,191,
1814 : 192,192,193,193,194,195,195,196,197,197,198,199,199,200,201,201,
1815 : 202,203,203,204,204,205,206,206,207,208,208,209,209,210,211,211,
1816 : 212,212,213,214,214,215,215,216,217,217,218,218,219,219,220,221,
1817 : 221,222,222,223,224,224,225,225,226,226,227,227,228,229,229,230,
1818 : 230,231,231,232,232,233,234,234,235,235,236,236,237,237,238,238,
1819 : 239,240,240,241,241,242,242,243,243,244,244,245,245,246,246,247,
1820 : 247,248,248,249,249,250,250,251,251,252,252,253,253,254,254,255
1821 : };
1822 :
1823 : /* N[0], assume N[0] >= 2^(BIL-2).
1824 : * Return r,s such that s^2 + r = N, 0 <= r <= 2s */
1825 : static void
1826 78078717 : p_sqrtu1(ulong *N, ulong *ps, ulong *pr)
1827 : {
1828 78078717 : ulong prec, r, s, q, u, n0 = N[0];
1829 :
1830 78078717 : q = n0 >> (BITS_IN_LONG - 8);
1831 : /* 2^6 = 64 <= q < 256 = 2^8 */
1832 78078717 : s = approx_tab[q - 64]; /* 128 <= s < 255 */
1833 78078717 : r = (n0 >> (BITS_IN_LONG - 16)) - s * s; /* r <= 2*s */
1834 78078717 : if (r > (s << 1)) { r -= (s << 1) | 1; s++; }
1835 :
1836 : /* 8-bit approximation from the high 8-bits of N[0] */
1837 78078717 : prec = 8;
1838 78078717 : n0 <<= 2 * prec;
1839 234236151 : while (2 * prec < BITS_IN_LONG)
1840 : { /* invariant: s has prec bits, and r <= 2*s */
1841 156157434 : r = (r << prec) + (n0 >> (BITS_IN_LONG - prec));
1842 156157434 : n0 <<= prec;
1843 156157434 : u = 2 * s;
1844 156157434 : q = r / u; u = r - q * u;
1845 156157434 : s = (s << prec) + q;
1846 156157434 : u = (u << prec) + (n0 >> (BITS_IN_LONG - prec));
1847 156157434 : q = q * q;
1848 156157434 : r = u - q;
1849 156157434 : if (u < q) { s--; r += (s << 1) | 1; }
1850 156157434 : n0 <<= prec;
1851 156157434 : prec = 2 * prec;
1852 : }
1853 78078717 : *ps = s;
1854 78078717 : *pr = r;
1855 78078717 : }
1856 :
1857 : /* N[0..1], assume N[0] >= 2^(BIL-2).
1858 : * Return 1 if remainder overflows, 0 otherwise */
1859 : static int
1860 75491139 : p_sqrtu2(ulong *N, ulong *ps, ulong *pr)
1861 : {
1862 75491139 : ulong cc, qhl, r, s, q, u, n1 = N[1];
1863 : LOCAL_OVERFLOW;
1864 :
1865 75491139 : p_sqrtu1(N, &s, &r); /* r <= 2s */
1866 113332062 : qhl = 0; while (r >= s) { qhl++; r -= s; }
1867 : /* now r < s < 2^(BIL/2) */
1868 75491139 : r = (r << BITS_IN_HALFULONG) | (n1 >> BITS_IN_HALFULONG);
1869 75491139 : u = s << 1;
1870 75491139 : q = r / u; u = r - q * u;
1871 75491139 : q += (qhl & 1) << (BITS_IN_HALFULONG - 1);
1872 75491139 : qhl >>= 1;
1873 : /* (initial r)<<(BIL/2) + n1>>(BIL/2) = (qhl<<(BIL/2) + q) * 2s + u */
1874 75491139 : s = ((s + qhl) << BITS_IN_HALFULONG) + q;
1875 75491139 : cc = u >> BITS_IN_HALFULONG;
1876 75491139 : r = (u << BITS_IN_HALFULONG) | (n1 & LOWMASK);
1877 75491139 : r = subll(r, q * q);
1878 75491139 : cc -= overflow + qhl;
1879 : /* now subtract 2*q*2^(BIL/2) + 2^BIL if qhl is set */
1880 75491139 : if ((long)cc < 0)
1881 : {
1882 19397421 : if (s) {
1883 19369890 : r = addll(r, s);
1884 19369890 : cc += overflow;
1885 19369890 : s--;
1886 : } else {
1887 27531 : cc++;
1888 27531 : s = ~0UL;
1889 : }
1890 19397421 : r = addll(r, s);
1891 19397421 : cc += overflow;
1892 : }
1893 75491139 : *ps = s;
1894 75491139 : *pr = r; return cc;
1895 : }
1896 :
1897 : static void
1898 74443794 : xmpn_zero(GEN x, long n)
1899 : {
1900 539200674 : while (--n >= 0) x[n]=0;
1901 74443794 : }
1902 : static void
1903 855278667 : xmpn_copy(GEN z, GEN x, long n)
1904 : {
1905 855278667 : long k = n;
1906 3273202461 : while (--k >= 0) z[k] = x[k];
1907 855278667 : }
1908 : /* a[0..la-1] * 2^(lb BIL) | b[0..lb-1] */
1909 : static GEN
1910 373538922 : catii(GEN a, long la, GEN b, long lb)
1911 : {
1912 373538922 : long l = la + lb + 2;
1913 373538922 : GEN z = cgetipos(l);
1914 373538922 : xmpn_copy(LIMBS(z), a, la);
1915 373538922 : xmpn_copy(LIMBS(z) + la, b, lb);
1916 373538922 : return int_normalize(z, 0);
1917 : }
1918 :
1919 : /* sqrt n[0..1], assume n normalized */
1920 : static GEN
1921 75219783 : sqrtispec2(GEN n, GEN *pr)
1922 : {
1923 : ulong s, r;
1924 75219783 : int hi = p_sqrtu2((ulong*)n, &s, &r);
1925 75219783 : GEN S = utoi(s);
1926 75219783 : *pr = hi? uutoi(1,r): utoi(r);
1927 75219783 : return S;
1928 : }
1929 :
1930 : /* sqrt n[0], _dont_ assume n normalized */
1931 : static GEN
1932 2587578 : sqrtispec1_sh(GEN n, GEN *pr)
1933 : {
1934 : GEN S;
1935 2587578 : ulong r, s, u0 = uel(n,0);
1936 2587578 : int sh = bfffo(u0) & ~1UL;
1937 2587578 : if (sh) u0 <<= sh;
1938 2587578 : p_sqrtu1(&u0, &s, &r);
1939 : /* s^2 + r = u0, s < 2^(BIL/2). Rescale back:
1940 : * 2^(2k) n = S^2 + R
1941 : * so 2^(2k) n = (S - s0)^2 + (2*S*s0 - s0^2 + R), s0 = S mod 2^k. */
1942 2587578 : if (sh) {
1943 1580856 : int k = sh >> 1;
1944 1580856 : ulong s0 = s & ((1L<<k) - 1);
1945 1580856 : r += s * (s0<<1);
1946 1580856 : s >>= k;
1947 1580856 : r >>= sh;
1948 : }
1949 2587578 : S = utoi(s);
1950 2587578 : if (pr) *pr = utoi(r);
1951 2587578 : return S;
1952 : }
1953 :
1954 : /* sqrt n[0..1], _dont_ assume n normalized */
1955 : static GEN
1956 271356 : sqrtispec2_sh(GEN n, GEN *pr)
1957 : {
1958 : GEN S;
1959 271356 : ulong U[2], r, s, u0 = uel(n,0), u1 = uel(n,1);
1960 271356 : int hi, sh = bfffo(u0) & ~1UL;
1961 271356 : if (sh) {
1962 243390 : u0 = (u0 << sh) | (u1 >> (BITS_IN_LONG-sh));
1963 243390 : u1 <<= sh;
1964 : }
1965 271356 : U[0] = u0;
1966 271356 : U[1] = u1; hi = p_sqrtu2(U, &s, &r);
1967 : /* s^2 + R = u0|u1. Rescale back:
1968 : * 2^(2k) n = S^2 + R
1969 : * so 2^(2k) n = (S - s0)^2 + (2*S*s0 - s0^2 + R), s0 = S mod 2^k. */
1970 271356 : if (sh) {
1971 243390 : int k = sh >> 1;
1972 243390 : ulong s0 = s & ((1L<<k) - 1);
1973 : LOCAL_HIREMAINDER;
1974 : LOCAL_OVERFLOW;
1975 243390 : r = addll(r, mulll(s, (s0<<1)));
1976 243390 : if (overflow) hiremainder++;
1977 243390 : hiremainder += hi; /* + 0 or 1 */
1978 243390 : s >>= k;
1979 243390 : r = (r>>sh) | (hiremainder << (BITS_IN_LONG-sh));
1980 243390 : hi = (hiremainder & (1L<<sh));
1981 : }
1982 271356 : S = utoi(s);
1983 271356 : if (pr) *pr = hi? uutoi(1,r): utoi(r);
1984 271356 : return S;
1985 : }
1986 :
1987 : /* Let N = N[0..2n-1]. Return S (and set R) s.t S^2 + R = N, 0 <= R <= 2S
1988 : * Assume N normalized */
1989 : static GEN
1990 261989244 : sqrtispec(GEN N, long n, GEN *r)
1991 : {
1992 : GEN S, R, q, z, u;
1993 : long l, h;
1994 :
1995 261989244 : if (n == 1) return sqrtispec2(N, r);
1996 186769461 : l = n >> 1;
1997 186769461 : h = n - l; /* N = a3(h) | a2(h) | a1(l) | a0(l words) */
1998 186769461 : S = sqrtispec(N, h, &R); /* S^2 + R = a3|a2 */
1999 :
2000 186769461 : z = catii(LIMBS(R), NLIMBS(R), N + 2*h, l); /* = R | a1(l) */
2001 186769461 : q = dvmdii(z, shifti(S,1), &u);
2002 186769461 : z = catii(LIMBS(u), NLIMBS(u), N + n + h, l); /* = u | a0(l) */
2003 :
2004 186769461 : S = addshiftw(S, q, l);
2005 186769461 : R = subii(z, sqri(q));
2006 186769461 : if (signe(R) < 0)
2007 : {
2008 30188832 : GEN S2 = shifti(S,1);
2009 30188832 : R = addis(subiispec(LIMBS(S2),LIMBS(R), NLIMBS(S2),NLIMBS(R)), -1);
2010 30188832 : S = addis(S, -1);
2011 : }
2012 186769461 : *r = R; return S;
2013 : }
2014 :
2015 : /* Return S (and set R) s.t S^2 + R = N, 0 <= R <= 2S.
2016 : * As for dvmdii, R is last on stack and guaranteed to be gen_0 in case the
2017 : * remainder is 0. R = NULL is allowed. */
2018 : GEN
2019 3635478 : sqrtremi(GEN N, GEN *r)
2020 : {
2021 : pari_sp av;
2022 3635478 : GEN S, R, n = N+2;
2023 3635478 : long k, l2, ln = NLIMBS(N);
2024 : int sh;
2025 :
2026 3635478 : if (ln <= 2)
2027 : {
2028 2859489 : if (ln == 2) return sqrtispec2_sh(n, r);
2029 2588133 : if (ln == 1) return sqrtispec1_sh(n, r);
2030 555 : if (r) *r = gen_0;
2031 555 : return gen_0;
2032 : }
2033 775989 : av = avma;
2034 775989 : sh = bfffo(n[0]) >> 1;
2035 775989 : l2 = (ln + 1) >> 1;
2036 775989 : if (sh || (ln & 1)) { /* normalize n, so that n[0] >= 2^BIL / 4 */
2037 775557 : GEN s0, t = new_chunk(ln + 1);
2038 775557 : t[ln] = 0;
2039 775557 : if (sh)
2040 774069 : shift_left(t, n, 0,ln-1, 0, sh << 1);
2041 : else
2042 1488 : xmpn_copy(t, n, ln);
2043 775557 : S = sqrtispec(t, l2, &R); /* t normalized, 2 * l2 words */
2044 : /* Rescale back:
2045 : * 2^(2k) n = S^2 + R, k = sh + (ln & 1)*BIL/2
2046 : * so 2^(2k) n = (S - s0)^2 + (2*S*s0 - s0^2 + R), s0 = S mod 2^k. */
2047 775557 : k = sh + (ln & 1) * (BITS_IN_LONG/2);
2048 775557 : s0 = remi2n(S, k);
2049 775557 : R = addii(shifti(R,-1), mulii(s0, S));
2050 775557 : R = shifti(R, 1 - (k<<1));
2051 775557 : S = shifti(S, -k);
2052 : }
2053 : else
2054 432 : S = sqrtispec(n, l2, &R);
2055 :
2056 775989 : if (!r) { set_avma((pari_sp)S); return gerepileuptoint(av, S); }
2057 722598 : gerepileall(av, 2, &S, &R); *r = R; return S;
2058 : }
2059 :
2060 : /* compute sqrt(|a|), assuming a != 0 */
2061 :
2062 : #if 1
2063 : GEN
2064 74443794 : sqrtr_abs(GEN x)
2065 : {
2066 74443794 : long l = lg(x) - 2, e = expo(x), er = e>>1;
2067 74443794 : GEN b, c, res = cgetg(2 + l, t_REAL);
2068 74443794 : res[1] = evalsigne(1) | evalexpo(er);
2069 74443794 : if (e&1) {
2070 33755541 : b = new_chunk(l << 1);
2071 33755541 : xmpn_copy(b, x+2, l);
2072 33755541 : xmpn_zero(b + l,l);
2073 33755541 : b = sqrtispec(b, l, &c);
2074 33755541 : xmpn_copy(res+2, b+2, l);
2075 33755541 : if (cmpii(c, b) > 0) roundr_up_ip(res, l+2);
2076 : } else {
2077 : ulong u;
2078 40688253 : b = new_chunk(2 + (l << 1));
2079 40688253 : shift_left(b+1, x+2, 0,l-1, 0, BITS_IN_LONG-1);
2080 40688253 : b[0] = uel(x,2)>>1;
2081 40688253 : xmpn_zero(b + l+1,l+1);
2082 40688253 : b = sqrtispec(b, l+1, &c);
2083 40688253 : xmpn_copy(res+2, b+2, l);
2084 40688253 : u = uel(b,l+2);
2085 40688253 : if ( u&HIGHBIT || (u == ~HIGHBIT && cmpii(c,b) > 0))
2086 20015718 : roundr_up_ip(res, l+2);
2087 : }
2088 74443794 : return gc_const((pari_sp)res, res);
2089 : }
2090 :
2091 : #else /* use t_REAL: currently much slower (quadratic division) */
2092 :
2093 : #ifdef LONG_IS_64BIT
2094 : /* 64 bits of b = sqrt(a[0] * 2^64 + a[1]) [ up to 1ulp ] */
2095 : static ulong
2096 : sqrtu2(ulong *a)
2097 : {
2098 : ulong c, b = dblmantissa( sqrt((double)a[0]) );
2099 : LOCAL_HIREMAINDER;
2100 : LOCAL_OVERFLOW;
2101 :
2102 : /* > 32 correct bits, 1 Newton iteration to reach 64 */
2103 : if (b <= a[0]) return HIGHBIT | (a[0] >> 1);
2104 : hiremainder = a[0]; c = divll(a[1], b);
2105 : return (addll(c, b) >> 1) | HIGHBIT;
2106 : }
2107 : /* 64 bits of sqrt(a[0] * 2^63) */
2108 : static ulong
2109 : sqrtu2_1(ulong *a)
2110 : {
2111 : ulong t[2];
2112 : t[0] = (a[0] >> 1);
2113 : t[1] = (a[0] << (BITS_IN_LONG-1)) | (a[1] >> 1);
2114 : return sqrtu2(t);
2115 : }
2116 : #else
2117 : /* 32 bits of sqrt(a[0] * 2^32) */
2118 : static ulong
2119 : sqrtu2(ulong *a) { return dblmantissa( sqrt((double)a[0]) ); }
2120 : /* 32 bits of sqrt(a[0] * 2^31) */
2121 : static ulong
2122 : sqrtu2_1(ulong *a) { return dblmantissa( sqrt(2. * a[0]) ); }
2123 : #endif
2124 :
2125 : GEN
2126 : sqrtr_abs(GEN x)
2127 : {
2128 : long l1, i, l = lg(x), ex = expo(x);
2129 : GEN a, t, y = cgetg(l, t_REAL);
2130 : pari_sp av, av0 = avma;
2131 :
2132 : a = rtor(x, lg2prec(l+1));
2133 : t = cgetg(l+1, t_REAL);
2134 : if (ex & 1) { /* odd exponent */
2135 : a[1] = evalsigne(1) | _evalexpo(1);
2136 : t[2] = (long)sqrtu2((ulong*)a + 2);
2137 : } else { /* even exponent */
2138 : a[1] = evalsigne(1) | _evalexpo(0);
2139 : t[2] = (long)sqrtu2_1((ulong*)a + 2);
2140 : }
2141 : t[1] = evalsigne(1) | _evalexpo(0);
2142 : for (i = 3; i <= l; i++) t[i] = 0;
2143 :
2144 : /* |x| = 2^(ex/2) a, t ~ sqrt(a) */
2145 : l--; l1 = 1; av = avma;
2146 : while (l1 < l) { /* let t := (t + a/t)/2 */
2147 : l1 <<= 1; if (l1 > l) l1 = l;
2148 : setlg(a, l1 + 2);
2149 : setlg(t, l1 + 2);
2150 : affrr(addrr(t, divrr(a,t)), t); shiftr_inplace(t, -1);
2151 : set_avma(av);
2152 : }
2153 : affrr(t,y); shiftr_inplace(y, (ex>>1));
2154 : return gc_const(av0, y);
2155 : }
2156 :
2157 : #endif
2158 :
2159 : /*******************************************************************
2160 : * *
2161 : * Base Conversion *
2162 : * *
2163 : *******************************************************************/
2164 :
2165 : static void
2166 726453 : convi_dac(GEN x, ulong l, ulong *res)
2167 : {
2168 726453 : pari_sp ltop=avma;
2169 : ulong m;
2170 : GEN x1,x2;
2171 726453 : if (l==1) { *res=itou(x); return; }
2172 344769 : m=l>>1;
2173 344769 : x1=dvmdii(x,powuu(1000000000UL,m),&x2);
2174 344769 : convi_dac(x1,l-m,res+m);
2175 344769 : convi_dac(x2,m,res);
2176 344769 : set_avma(ltop);
2177 : }
2178 :
2179 : /* convert integer --> base 10^9 [not memory clean] */
2180 : ulong *
2181 305335 : convi(GEN x, long *l)
2182 : {
2183 305335 : long lz, lx = lgefint(x);
2184 : ulong *z;
2185 305335 : if (lx == 3 && uel(x,2) < 1000000000UL) {
2186 268420 : z = (ulong*)new_chunk(1);
2187 268420 : *z = x[2];
2188 268420 : *l = 1; return z+1;
2189 : }
2190 36915 : lz = 1 + (long)bit_accuracy_mul(lx, LOG10_2/9);
2191 36915 : z = (ulong*)new_chunk(lz);
2192 36915 : convi_dac(x,(ulong)lz,z);
2193 66579 : while (z[lz-1]==0) lz--;
2194 36915 : *l=lz; return z+lz;
2195 : }
2196 :
|
