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 2952749089 : icopy_sign(GEN x, long sx)
18 : {
19 2952749089 : GEN y=icopy(x);
20 2962198692 : setsigne(y,sx);
21 2962198692 : return y;
22 : }
23 :
24 : GEN
25 302429050 : addsi_sign(long x, GEN y, long sy)
26 : {
27 : long sx,ly;
28 : GEN z;
29 :
30 302429050 : if (!x) return icopy_sign(y, sy);
31 286756174 : if (!sy) return stoi(x);
32 158101456 : if (x<0) { sx=-1; x=-x; } else sx=1;
33 158101456 : if (sx==sy)
34 : {
35 50414279 : z = adduispec(x,y+2, lgefint(y)-2);
36 50407760 : setsigne(z,sy); return z;
37 : }
38 107687177 : ly=lgefint(y);
39 107687177 : if (ly==3)
40 : {
41 19061266 : const long d = (long)(uel(y,2) - (ulong)x);
42 19061266 : if (!d) return gen_0;
43 17881888 : z=cgeti(3);
44 17879041 : if (y[2] < 0 || d > 0) {
45 14895710 : z[1] = evalsigne(sy) | evallgefint(3);
46 14895710 : z[2] = d;
47 : }
48 : else {
49 2983331 : z[1] = evalsigne(-sy) | evallgefint(3);
50 2983331 : z[2] =-d;
51 : }
52 17879041 : return z;
53 : }
54 88625911 : z = subiuspec(y+2,x, ly-2);
55 88741225 : setsigne(z,sy); return z;
56 : }
57 : GEN
58 225355266 : addui_sign(ulong x, GEN y, long sy)
59 : {
60 : long ly;
61 : GEN z;
62 :
63 225355266 : if (!x) return icopy_sign(y, sy);
64 223811313 : if (!sy) return utoipos(x);
65 218390769 : if (sy == 1) return adduispec(x,y+2, lgefint(y)-2);
66 111193587 : ly=lgefint(y);
67 111193587 : if (ly==3)
68 : {
69 25236363 : const ulong t = y[2];
70 25236363 : if (x == t) return gen_0;
71 23372355 : z=cgeti(3);
72 23372011 : if (x < t) {
73 23139016 : z[1] = evalsigne(-1) | evallgefint(3);
74 23139016 : z[2] = t - x;
75 : }
76 : else {
77 232995 : z[1] = evalsigne(1) | evallgefint(3);
78 232995 : z[2] = x - t;
79 : }
80 23372011 : return z;
81 : }
82 85957224 : z = subiuspec(y+2,x, ly-2);
83 85958318 : setsigne(z,-1); return z;
84 : }
85 :
86 : /* return gen_0 when the sign is 0 */
87 : GEN
88 16446468199 : addii_sign(GEN x, long sx, GEN y, long sy)
89 : {
90 : long lx,ly;
91 : GEN z;
92 :
93 16446468199 : if (!sx) return sy? icopy_sign(y, sy): gen_0;
94 13006796692 : if (!sy) return icopy_sign(x, sx);
95 11189090252 : lx = lgefint(x);
96 11189090252 : ly = lgefint(y);
97 11189090252 : if (sx==sy)
98 6062964281 : z = addiispec(x+2,y+2,lx-2,ly-2);
99 : else
100 : { /* sx != sy */
101 5126125971 : long i = cmpiispec(x+2,y+2,lx-2,ly-2);
102 5201395599 : if (!i) return gen_0;
103 : /* we must ensure |x| > |y| for subiispec */
104 4938936211 : if (i < 0) {
105 2001373072 : sx = sy;
106 2001373072 : z = subiispec(y+2,x+2,ly-2,lx-2);
107 : }
108 : else
109 2937563139 : z = subiispec(x+2,y+2,lx-2,ly-2);
110 : }
111 10976762585 : setsigne(z,sx); return z;
112 : }
113 :
114 : INLINE GEN
115 391526883 : rcopy_sign(GEN x, long sx) { GEN y = rcopy(x); setsigne(y,sx); return y; }
116 :
117 : GEN
118 481803305 : addir_sign(GEN x, long sx, GEN y, long sy)
119 : {
120 : long e, l, ly;
121 : GEN z;
122 :
123 481803305 : if (!sx) return rcopy_sign(y, sy);
124 145073694 : e = expo(y) - expi(x);
125 145133626 : if (!sy)
126 : {
127 1306110 : if (e >= 0) return rcopy_sign(y, sy);
128 1306076 : z = itor(x, nbits2prec(-e));
129 1305629 : setsigne(z, sx); return z;
130 : }
131 :
132 143827516 : ly = lg(y);
133 143827516 : if (e > 0)
134 : {
135 40033516 : l = lg2prec(ly - divsBIL(e));
136 40032746 : if (l < LOWDEFAULTPREC) return rcopy_sign(y, sy);
137 : }
138 103794000 : else l = lg2prec(ly) + nbits2extraprec(-e);
139 143346343 : z = (GEN)avma;
140 143346343 : y = addrr_sign(itor(x,l), sx, y, sy);
141 1108957688 : ly = lg(y); while (ly--) *--z = y[ly];
142 143312586 : set_avma((pari_sp)z); return z;
143 : }
144 :
145 : static GEN
146 486174928 : addsr_sign(long x, GEN y, long sy)
147 : {
148 : long e, l, ly, sx;
149 : GEN z;
150 :
151 486174928 : if (!x) return rcopy_sign(y, sy);
152 486167319 : if (x < 0) { sx = -1; x = -x; } else sx = 1;
153 486167319 : e = expo(y) - expu(x);
154 486110209 : if (!sy)
155 : {
156 540307 : if (e >= 0) return rcopy_sign(y, sy);
157 540279 : if (sx == -1) x = -x;
158 540279 : return stor(x, nbits2prec(-e));
159 : }
160 :
161 485569902 : ly = lg(y);
162 485569902 : if (e > 0)
163 : {
164 6038169 : l = lg2prec(ly - divsBIL(e));
165 6038145 : if (l < LOWDEFAULTPREC) return rcopy_sign(y, sy);
166 : }
167 479531733 : else l = lg2prec(ly) + nbits2extraprec(-e);
168 484548393 : z = (GEN)avma;
169 484548393 : y = addrr_sign(stor(x,l), sx, y, sy);
170 6224219974 : ly = lg(y); while (ly--) *--z = y[ly];
171 484763459 : set_avma((pari_sp)z); return z;
172 : }
173 :
174 : GEN
175 473755340 : addsr(long x, GEN y) { return addsr_sign(x, y, signe(y)); }
176 :
177 : GEN
178 12434494 : subsr(long x, GEN y) { return addsr_sign(x, y, -signe(y)); }
179 :
180 : GEN
181 4940455342 : addrr_sign(GEN x, long sx, GEN y, long sy)
182 : {
183 4940455342 : long lx, ex = expo(x);
184 4940455342 : 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 4940455342 : if (!sy)
191 : {
192 332710221 : if (!sx)
193 : {
194 95699963 : if (e > 0) ex = ey;
195 95699963 : return real_0_bit(ex);
196 : }
197 237010258 : if (e >= 0) return real_0_bit(ey);
198 235919078 : lz = nbits2lg(-e);
199 236181470 : lx = lg(x); if (lz > lx) lz = lx;
200 2010252389 : z = cgetg(lz, t_REAL); while(--lz) z[lz] = x[lz];
201 236230104 : setsigne(z,sx); return z;
202 : }
203 4607745121 : if (!sx)
204 : {
205 28631781 : if (e <= 0) return real_0_bit(ex);
206 27045322 : lz = nbits2lg(e);
207 27044999 : ly = lg(y); if (lz > ly) lz = ly;
208 139783647 : z = cgetg(lz, t_REAL); while (--lz) z[lz] = y[lz];
209 27042132 : setsigne(z,sy); return z;
210 : }
211 :
212 4579113340 : if (e < 0) { swap(x,y); lswap(sx,sy); ey=ex; e=-e; }
213 : /* now ey >= ex */
214 4579113340 : lx = lg(x);
215 4579113340 : 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 4579113340 : extend = 0;
220 4579113340 : if (e)
221 : {
222 3959892894 : long d = dvmdsBIL(e, &m), l = ly-d;
223 3957758165 : if (l <= 2) return rcopy_sign(y, sy);
224 3909510847 : if (l > lx) { lz = lx + d + 1; extend = 1; }
225 3124578615 : else { lz = ly; lx = l; }
226 3909510847 : if (m)
227 : { /* shift x right m bits */
228 3896844290 : const pari_sp av = avma;
229 3896844290 : const ulong sh = BITS_IN_LONG-m;
230 3896844290 : GEN p1 = x; x = new_chunk(lx + lz + 1);
231 3892039649 : shift_right(x,p1,2,lx, 0,m);
232 3894502192 : if (extend) uel(x,lx) = uel(p1,lx-1) << sh;
233 3894502192 : set_avma(av); /* HACK: cgetg(lz, t_REAL) will not overwrite x */
234 : }
235 : }
236 : else
237 : { /* d = 0 */
238 619220446 : m = 0;
239 619220446 : if (lx > ly) lx = ly;
240 619220446 : lz = lx;
241 : }
242 :
243 4532873161 : if (sx == sy)
244 : { /* addition */
245 2348816301 : i = lz-1;
246 2348816301 : j = lx-1;
247 2348816301 : if (extend) {
248 473909129 : ulong garde = addll(x[lx], y[i]);
249 473909129 : if (m < 4) /* don't extend for few correct bits */
250 56064524 : z = cgetg(--lz, t_REAL);
251 : else
252 : {
253 417844605 : z = cgetg(lz, t_REAL);
254 417783794 : z[i] = garde;
255 : }
256 : }
257 : else
258 : {
259 1874907172 : z = cgetg(lz, t_REAL);
260 1874790595 : z[i] = addll(x[j], y[i]); j--;
261 : }
262 2345001819 : i--;
263 11953637312 : for (; j>=2; i--,j--) z[i] = addllx(x[j],y[i]);
264 2345001819 : if (overflow)
265 : {
266 556847457 : z[1] = 1; /* stops since z[1] != 0 */
267 558028245 : for (;;) { z[i] = uel(y,i)+1; if (z[i--]) break; }
268 556847457 : if (i <= 0)
269 : {
270 553323162 : shift_right(z,z, 2,lz, 1,1);
271 553619354 : z[1] = evalsigne(sx) | evalexpo(ey+1); return z;
272 : }
273 : }
274 2268528281 : for (; i>=2; i--) z[i] = y[i];
275 1791678657 : z[1] = evalsigne(sx) | evalexpo(ey); return z;
276 : }
277 :
278 : /* subtraction */
279 2184056860 : if (e) f2 = 1;
280 : else
281 : {
282 591487762 : i = 2; while (i < lx && x[i] == y[i]) i++;
283 357353458 : if (i==lx) return real_0_bit(ey+1 - lg2prec(lx));
284 332509838 : f2 = (uel(y,i) > uel(x,i));
285 : }
286 : /* result is nonzero. f2 = (y > x) */
287 2159213240 : i = lz-1; z = cgetg(lz, t_REAL);
288 2154616727 : if (f2)
289 : {
290 2009237849 : j = lx-1;
291 2009237849 : if (extend) z[i] = subll(y[i], x[lx]);
292 1698779412 : else z[i] = subll(y[i], x[j--]);
293 11819150801 : for (i--; j>=2; i--) z[i] = subllx(y[i], x[j--]);
294 2009237849 : if (overflow) /* stops since y[1] != 0 */
295 65329331 : for (;;) { z[i] = uel(y,i)-1; if (y[i--]) break; }
296 2351699544 : for (; i>=2; i--) z[i] = y[i];
297 2009237849 : sx = sy;
298 : }
299 : else
300 : {
301 145378878 : if (extend) z[i] = subll(x[lx], y[i]);
302 145378878 : else z[i] = subll(x[i], y[i]);
303 703038065 : for (i--; i>=2; i--) z[i] = subllx(x[i], y[i]);
304 : }
305 :
306 2309883988 : x = z+2; i = 0; while (!x[i]) i++;
307 2154616727 : lz -= i; z += i;
308 2154616727 : j = bfffo(z[2]); /* need to shift left by j bits to normalize mantissa */
309 2154616727 : ez = ey - (j | (i * BITS_IN_LONG));
310 2154616727 : 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 310881129 : if (m - j < 5 && lz > 3)
314 170149639 : { /* shorten z */
315 170143944 : 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 170143944 : if (j == 0)
320 : /* stackdummy((pari_sp)(z + lz+1), (pari_sp)(z + lz)); */
321 13255745 : z[lz] = evaltyp(t_VECSMALL) | _evallg(1);
322 : else
323 : {
324 156888199 : GEN t = z;
325 156888199 : z++; shift_left(z,t,2,lz-1, last,j);
326 : }
327 170149639 : if ((last<<j) & HIGHBIT)
328 : { /* round up */
329 61624481 : i = lz-1;
330 61766671 : while (++((ulong*)z)[i] == 0 && i > 1) i--;
331 61624481 : if (i == 1) { ez++; z[2] = (long)HIGHBIT; }
332 : }
333 : }
334 140737185 : else if (j) shift_left(z,z,2,lz-1, 0,j);
335 : }
336 1843735598 : else if (j) shift_left(z,z,2,lz-1, 0,j);
337 2155750049 : z[1] = evalsigne(sx) | evalexpo(ez);
338 2163215660 : z[0] = evaltyp(t_REAL) | evallg(lz);
339 2161925177 : set_avma((pari_sp)z); return z;
340 : }
|
