Line data Source code
1 : #line 2 "../src/kernel/none/add.c"
2 : /* Copyright (C) 2002-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 : INLINE GEN
17 3933395133 : icopy_sign(GEN x, long sx)
18 : {
19 3933395133 : GEN y=icopy(x);
20 3941534782 : setsigne(y,sx);
21 3941534782 : return y;
22 : }
23 :
24 : GEN
25 311329448 : addsi_sign(long x, GEN y, long sy)
26 : {
27 : long sx,ly;
28 : GEN z;
29 :
30 311329448 : if (!x) return icopy_sign(y, sy);
31 294993885 : if (!sy) return stoi(x);
32 166861715 : if (x<0) { sx=-1; x=-x; } else sx=1;
33 166861715 : if (sx==sy)
34 : {
35 46486399 : z = adduispec(x,y+2, lgefint(y)-2);
36 46480642 : setsigne(z,sy); return z;
37 : }
38 120375316 : ly=lgefint(y);
39 120375316 : if (ly==3)
40 : {
41 18084027 : const long d = (long)(uel(y,2) - (ulong)x);
42 18084027 : if (!d) return gen_0;
43 17066211 : z=cgeti(3);
44 17063586 : if (y[2] < 0 || d > 0) {
45 14589817 : z[1] = evalsigne(sy) | evallgefint(3);
46 14589817 : z[2] = d;
47 : }
48 : else {
49 2473769 : z[1] = evalsigne(-sy) | evallgefint(3);
50 2473769 : z[2] =-d;
51 : }
52 17063586 : return z;
53 : }
54 102291289 : z = subiuspec(y+2,x, ly-2);
55 102423636 : setsigne(z,sy); return z;
56 : }
57 : GEN
58 234559997 : addui_sign(ulong x, GEN y, long sy)
59 : {
60 : long ly;
61 : GEN z;
62 :
63 234559997 : if (!x) return icopy_sign(y, sy);
64 232979439 : if (!sy) return utoipos(x);
65 225905386 : if (sy == 1) return adduispec(x,y+2, lgefint(y)-2);
66 111644704 : ly=lgefint(y);
67 111644704 : if (ly==3)
68 : {
69 25291437 : const ulong t = y[2];
70 25291437 : if (x == t) return gen_0;
71 23419352 : z=cgeti(3);
72 23419132 : if (x < t) {
73 23185951 : z[1] = evalsigne(-1) | evallgefint(3);
74 23185951 : z[2] = t - x;
75 : }
76 : else {
77 233181 : z[1] = evalsigne(1) | evallgefint(3);
78 233181 : z[2] = x - t;
79 : }
80 23419132 : return z;
81 : }
82 86353267 : z = subiuspec(y+2,x, ly-2);
83 86355737 : setsigne(z,-1); return z;
84 : }
85 :
86 : /* return gen_0 when the sign is 0 */
87 : GEN
88 18245827418 : addii_sign(GEN x, long sx, GEN y, long sy)
89 : {
90 : long lx,ly;
91 : GEN z;
92 :
93 18245827418 : if (!sx) return sy? icopy_sign(y, sy): gen_0;
94 14509383782 : if (!sy) return icopy_sign(x, sx);
95 11792568994 : lx = lgefint(x);
96 11792568994 : ly = lgefint(y);
97 11792568994 : if (sx==sy)
98 6358591717 : z = addiispec(x+2,y+2,lx-2,ly-2);
99 : else
100 : { /* sx != sy */
101 5433977277 : long i = cmpiispec(x+2,y+2,lx-2,ly-2);
102 5511227724 : if (!i) return gen_0;
103 : /* we must ensure |x| > |y| for subiispec */
104 5230801160 : if (i < 0) {
105 2131430992 : sx = sy;
106 2131430992 : z = subiispec(y+2,x+2,ly-2,lx-2);
107 : }
108 : else
109 3099370168 : z = subiispec(x+2,y+2,lx-2,ly-2);
110 : }
111 11562870095 : setsigne(z,sx); return z;
112 : }
113 :
114 : INLINE GEN
115 388719533 : rcopy_sign(GEN x, long sx) { GEN y = rcopy(x); setsigne(y,sx); return y; }
116 :
117 : GEN
118 483039611 : addir_sign(GEN x, long sx, GEN y, long sy)
119 : {
120 : long e, l, ly;
121 : GEN z;
122 :
123 483039611 : if (!sx) return rcopy_sign(y, sy);
124 144580659 : e = expo(y) - expi(x);
125 144641084 : if (!sy)
126 : {
127 689509 : if (e >= 0) return rcopy_sign(y, sy);
128 689475 : z = itor(x, nbits2prec(-e));
129 689444 : setsigne(z, sx); return z;
130 : }
131 :
132 143951575 : ly = lg(y);
133 143951575 : if (e > 0)
134 : {
135 41095016 : l = lg2prec(ly - divsBIL(e));
136 41093792 : if (l < LOWDEFAULTPREC) return rcopy_sign(y, sy);
137 : }
138 102856559 : else l = lg2prec(ly) + nbits2extraprec(-e);
139 143465610 : z = (GEN)avma;
140 143465610 : y = addrr_sign(itor(x,l), sx, y, sy);
141 1406403144 : ly = lg(y); while (ly--) *--z = y[ly];
142 143436184 : set_avma((pari_sp)z); return z;
143 : }
144 :
145 : static GEN
146 489139449 : addsr_sign(long x, GEN y, long sy)
147 : {
148 : long e, l, ly, sx;
149 : GEN z;
150 :
151 489139449 : if (!x) return rcopy_sign(y, sy);
152 489131679 : if (x < 0) { sx = -1; x = -x; } else sx = 1;
153 489131679 : e = expo(y) - expu(x);
154 489073594 : if (!sy)
155 : {
156 503811 : if (e >= 0) return rcopy_sign(y, sy);
157 503783 : if (sx == -1) x = -x;
158 503783 : return stor(x, nbits2prec(-e));
159 : }
160 :
161 488569783 : ly = lg(y);
162 488569783 : if (e > 0)
163 : {
164 4975912 : l = lg2prec(ly - divsBIL(e));
165 4975887 : if (l < LOWDEFAULTPREC) return rcopy_sign(y, sy);
166 : }
167 483593871 : else l = lg2prec(ly) + nbits2extraprec(-e);
168 487491617 : z = (GEN)avma;
169 487491617 : y = addrr_sign(stor(x,l), sx, y, sy);
170 6388763843 : ly = lg(y); while (ly--) *--z = y[ly];
171 487636785 : set_avma((pari_sp)z); return z;
172 : }
173 :
174 : GEN
175 479771188 : addsr(long x, GEN y) { return addsr_sign(x, y, signe(y)); }
176 :
177 : GEN
178 9356768 : subsr(long x, GEN y) { return addsr_sign(x, y, -signe(y)); }
179 :
180 : GEN
181 5013951498 : addrr_sign(GEN x, long sx, GEN y, long sy)
182 : {
183 5013951498 : long lx, ex = expo(x);
184 5013951498 : long ly, ey = expo(y), e = ey - ex;
185 : long i, j, lz, ez, m;
186 : int extend, f2;
187 : GEN z;
188 : LOCAL_OVERFLOW;
189 :
190 5013951498 : if (!sy)
191 : {
192 314097874 : if (!sx)
193 : {
194 100690350 : if (e > 0) ex = ey;
195 100690350 : return real_0_bit(ex);
196 : }
197 213407524 : if (e >= 0) return real_0_bit(ey);
198 212328455 : lz = nbits2lg(-e);
199 212488590 : lx = lg(x); if (lz > lx) lz = lx;
200 1626670731 : z = cgetg(lz, t_REAL); while(--lz) z[lz] = x[lz];
201 212503938 : setsigne(z,sx); return z;
202 : }
203 4699853624 : if (!sx)
204 : {
205 28138313 : if (e <= 0) return real_0_bit(ex);
206 26649476 : lz = nbits2lg(e);
207 26649793 : ly = lg(y); if (lz > ly) lz = ly;
208 135575140 : z = cgetg(lz, t_REAL); while (--lz) z[lz] = y[lz];
209 26648177 : setsigne(z,sy); return z;
210 : }
211 :
212 4671715311 : if (e < 0) { swap(x,y); lswap(sx,sy); ey=ex; e=-e; }
213 : /* now ey >= ex */
214 4671715311 : lx = lg(x);
215 4671715311 : ly = lg(y);
216 : /* If exponents differ, need to shift one argument, here x. If
217 : * extend = 1: extension of x,z by m < BIL bits (round to 1 word) */
218 : /* in this case, lz = lx + d + 1, otherwise lx + d */
219 4671715311 : extend = 0;
220 4671715311 : if (e)
221 : {
222 4035767190 : long d = dvmdsBIL(e, &m), l = ly-d;
223 4032427064 : if (l <= 2) return rcopy_sign(y, sy);
224 3989327267 : if (l > lx) { lz = lx + d + 1; extend = 1; }
225 3190006837 : else { lz = ly; lx = l; }
226 3989327267 : if (m)
227 : { /* shift x right m bits */
228 3975863394 : const pari_sp av = avma;
229 3975863394 : const ulong sh = BITS_IN_LONG-m;
230 3975863394 : GEN p1 = x; x = new_chunk(lx + lz + 1);
231 3970639346 : shift_right(x,p1,2,lx, 0,m);
232 3973020074 : if (extend) uel(x,lx) = uel(p1,lx-1) << sh;
233 3973020074 : set_avma(av); /* HACK: cgetg(lz, t_REAL) will not overwrite x */
234 : }
235 : }
236 : else
237 : { /* d = 0 */
238 635948121 : m = 0;
239 635948121 : if (lx > ly) lx = ly;
240 635948121 : lz = lx;
241 : }
242 :
243 4628637534 : if (sx == sy)
244 : { /* addition */
245 2393113020 : i = lz-1;
246 2393113020 : j = lx-1;
247 2393113020 : if (extend) {
248 477327066 : ulong garde = addll(x[lx], y[i]);
249 477327066 : if (m < 4) /* don't extend for few correct bits */
250 55166895 : z = cgetg(--lz, t_REAL);
251 : else
252 : {
253 422160171 : z = cgetg(lz, t_REAL);
254 422220532 : z[i] = garde;
255 : }
256 : }
257 : else
258 : {
259 1915785954 : z = cgetg(lz, t_REAL);
260 1917024557 : z[i] = addll(x[j], y[i]); j--;
261 : }
262 2390941921 : i--;
263 13139099664 : for (; j>=2; i--,j--) z[i] = addllx(x[j],y[i]);
264 2390941921 : if (overflow)
265 : {
266 574725848 : z[1] = 1; /* stops since z[1] != 0 */
267 576008671 : for (;;) { z[i] = uel(y,i)+1; if (z[i--]) break; }
268 574725848 : if (i <= 0)
269 : {
270 571140298 : shift_right(z,z, 2,lz, 1,1);
271 571438423 : z[1] = evalsigne(sx) | evalexpo(ey+1); return z;
272 : }
273 : }
274 2313935508 : for (; i>=2; i--) z[i] = y[i];
275 1819801623 : z[1] = evalsigne(sx) | evalexpo(ey); return z;
276 : }
277 :
278 : /* subtraction */
279 2235524514 : if (e) f2 = 1;
280 : else
281 : {
282 595659993 : i = 2; while (i < lx && x[i] == y[i]) i++;
283 361012461 : if (i==lx) return real_0_bit(ey+1 - lg2prec(lx));
284 336336059 : f2 = (uel(y,i) > uel(x,i));
285 : }
286 : /* result is nonzero. f2 = (y > x) */
287 2210848112 : i = lz-1; z = cgetg(lz, t_REAL);
288 2207852753 : if (f2)
289 : {
290 2061549383 : j = lx-1;
291 2061549383 : if (extend) z[i] = subll(y[i], x[lx]);
292 1739974283 : else z[i] = subll(y[i], x[j--]);
293 12873248887 : for (i--; j>=2; i--) z[i] = subllx(y[i], x[j--]);
294 2061549383 : if (overflow) /* stops since y[1] != 0 */
295 66808699 : for (;;) { z[i] = uel(y,i)-1; if (y[i--]) break; }
296 2419870438 : for (; i>=2; i--) z[i] = y[i];
297 2061549383 : sx = sy;
298 : }
299 : else
300 : {
301 146303370 : if (extend) z[i] = subll(x[lx], y[i]);
302 146303370 : else z[i] = subll(x[i], y[i]);
303 789006514 : for (i--; i>=2; i--) z[i] = subllx(x[i], y[i]);
304 : }
305 :
306 2363696978 : x = z+2; i = 0; while (!x[i]) i++;
307 2207852753 : lz -= i; z += i;
308 2207852753 : j = bfffo(z[2]); /* need to shift left by j bits to normalize mantissa */
309 2207852753 : ez = ey - (j | (i * BITS_IN_LONG));
310 2207852753 : if (extend)
311 : { /* z was extended by d+1 words [should be e bits = d words + m bits] */
312 : /* not worth keeping extra word if less than 5 significant bits in there */
313 321987855 : if (m - j < 5 && lz > 3)
314 170438613 : { /* shorten z */
315 170434401 : ulong last = (ulong)z[--lz]; /* cancelled word */
316 :
317 : /* if we need to shift anyway, shorten from left
318 : * If not, shorten from right, neutralizing last word of z */
319 170434401 : if (j == 0)
320 : /* stackdummy((pari_sp)(z + lz+1), (pari_sp)(z + lz)); */
321 13624419 : z[lz] = evaltyp(t_VECSMALL) | _evallg(1);
322 : else
323 : {
324 156809982 : GEN t = z;
325 156809982 : z++; shift_left(z,t,2,lz-1, last,j);
326 : }
327 170438613 : if ((last<<j) & HIGHBIT)
328 : { /* round up */
329 61771692 : i = lz-1;
330 62233492 : while (++((ulong*)z)[i] == 0 && i > 1) i--;
331 61771692 : if (i == 1) { ez++; z[2] = (long)HIGHBIT; }
332 : }
333 : }
334 151553454 : else if (j) shift_left(z,z,2,lz-1, 0,j);
335 : }
336 1885864898 : else if (j) shift_left(z,z,2,lz-1, 0,j);
337 2209006666 : z[1] = evalsigne(sx) | evalexpo(ez);
338 2215910991 : z[0] = evaltyp(t_REAL) | evallg(lz);
339 2214662608 : set_avma((pari_sp)z); return z;
340 : }
|
