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 3925108520 : icopy_sign(GEN x, long sx)
18 : {
19 3925108520 : GEN y=icopy(x);
20 3931967638 : setsigne(y,sx);
21 3931967638 : return y;
22 : }
23 :
24 : GEN
25 311930675 : addsi_sign(long x, GEN y, long sy)
26 : {
27 : long sx,ly;
28 : GEN z;
29 :
30 311930675 : if (!x) return icopy_sign(y, sy);
31 295568600 : if (!sy) return stoi(x);
32 167436205 : if (x<0) { sx=-1; x=-x; } else sx=1;
33 167436205 : if (sx==sy)
34 : {
35 46837771 : z = adduispec(x,y+2, lgefint(y)-2);
36 46831709 : setsigne(z,sy); return z;
37 : }
38 120598434 : ly=lgefint(y);
39 120598434 : if (ly==3)
40 : {
41 18095785 : const long d = (long)(uel(y,2) - (ulong)x);
42 18095785 : if (!d) return gen_0;
43 17076835 : z=cgeti(3);
44 17073921 : if (y[2] < 0 || d > 0) {
45 14597936 : z[1] = evalsigne(sy) | evallgefint(3);
46 14597936 : z[2] = d;
47 : }
48 : else {
49 2475985 : z[1] = evalsigne(-sy) | evallgefint(3);
50 2475985 : z[2] =-d;
51 : }
52 17073921 : return z;
53 : }
54 102502649 : z = subiuspec(y+2,x, ly-2);
55 102606920 : setsigne(z,sy); return z;
56 : }
57 : GEN
58 233948738 : addui_sign(ulong x, GEN y, long sy)
59 : {
60 : long ly;
61 : GEN z;
62 :
63 233948738 : if (!x) return icopy_sign(y, sy);
64 232368182 : if (!sy) return utoipos(x);
65 225275882 : if (sy == 1) return adduispec(x,y+2, lgefint(y)-2);
66 111269397 : ly=lgefint(y);
67 111269397 : if (ly==3)
68 : {
69 24870828 : const ulong t = y[2];
70 24870828 : if (x == t) return gen_0;
71 22993661 : z=cgeti(3);
72 22993233 : if (x < t) {
73 22760050 : z[1] = evalsigne(-1) | evallgefint(3);
74 22760050 : z[2] = t - x;
75 : }
76 : else {
77 233183 : z[1] = evalsigne(1) | evallgefint(3);
78 233183 : z[2] = x - t;
79 : }
80 22993233 : return z;
81 : }
82 86398569 : z = subiuspec(y+2,x, ly-2);
83 86401445 : setsigne(z,-1); return z;
84 : }
85 :
86 : /* return gen_0 when the sign is 0 */
87 : GEN
88 18233742740 : addii_sign(GEN x, long sx, GEN y, long sy)
89 : {
90 : long lx,ly;
91 : GEN z;
92 :
93 18233742740 : if (!sx) return sy? icopy_sign(y, sy): gen_0;
94 14508411062 : if (!sy) return icopy_sign(x, sx);
95 11792658628 : lx = lgefint(x);
96 11792658628 : ly = lgefint(y);
97 11792658628 : if (sx==sy)
98 6357286438 : z = addiispec(x+2,y+2,lx-2,ly-2);
99 : else
100 : { /* sx != sy */
101 5435372190 : long i = cmpiispec(x+2,y+2,lx-2,ly-2);
102 5511833074 : if (!i) return gen_0;
103 : /* we must ensure |x| > |y| for subiispec */
104 5231762813 : if (i < 0) {
105 2131073662 : sx = sy;
106 2131073662 : z = subiispec(y+2,x+2,ly-2,lx-2);
107 : }
108 : else
109 3100689151 : z = subiispec(x+2,y+2,lx-2,ly-2);
110 : }
111 11562556906 : setsigne(z,sx); return z;
112 : }
113 :
114 : INLINE GEN
115 389247107 : rcopy_sign(GEN x, long sx) { GEN y = rcopy(x); setsigne(y,sx); return y; }
116 :
117 : GEN
118 483244317 : addir_sign(GEN x, long sx, GEN y, long sy)
119 : {
120 : long e, l, ly;
121 : GEN z;
122 :
123 483244317 : if (!sx) return rcopy_sign(y, sy);
124 144635133 : e = expo(y) - expi(x);
125 144692683 : if (!sy)
126 : {
127 690667 : if (e >= 0) return rcopy_sign(y, sy);
128 690619 : z = itor(x, nbits2prec(-e));
129 690584 : setsigne(z, sx); return z;
130 : }
131 :
132 144002016 : ly = lg(y);
133 144002016 : if (e > 0)
134 : {
135 41109722 : l = lg2prec(ly - divsBIL(e));
136 41108727 : if (l < LOWDEFAULTPREC) return rcopy_sign(y, sy);
137 : }
138 102892294 : else l = lg2prec(ly) + nbits2extraprec(-e);
139 143517120 : z = (GEN)avma;
140 143517120 : y = addrr_sign(itor(x,l), sx, y, sy);
141 1408639693 : ly = lg(y); while (ly--) *--z = y[ly];
142 143487153 : set_avma((pari_sp)z); return z;
143 : }
144 :
145 : static GEN
146 489171714 : addsr_sign(long x, GEN y, long sy)
147 : {
148 : long e, l, ly, sx;
149 : GEN z;
150 :
151 489171714 : if (!x) return rcopy_sign(y, sy);
152 489163944 : if (x < 0) { sx = -1; x = -x; } else sx = 1;
153 489163944 : e = expo(y) - expu(x);
154 489108220 : if (!sy)
155 : {
156 503766 : if (e >= 0) return rcopy_sign(y, sy);
157 503738 : if (sx == -1) x = -x;
158 503738 : return stor(x, nbits2prec(-e));
159 : }
160 :
161 488604454 : ly = lg(y);
162 488604454 : if (e > 0)
163 : {
164 4980676 : l = lg2prec(ly - divsBIL(e));
165 4980649 : if (l < LOWDEFAULTPREC) return rcopy_sign(y, sy);
166 : }
167 483623778 : else l = lg2prec(ly) + nbits2extraprec(-e);
168 487520723 : z = (GEN)avma;
169 487520723 : y = addrr_sign(stor(x,l), sx, y, sy);
170 6388853082 : ly = lg(y); while (ly--) *--z = y[ly];
171 487661749 : set_avma((pari_sp)z); return z;
172 : }
173 :
174 : GEN
175 479795637 : addsr(long x, GEN y) { return addsr_sign(x, y, signe(y)); }
176 :
177 : GEN
178 9364190 : subsr(long x, GEN y) { return addsr_sign(x, y, -signe(y)); }
179 :
180 : GEN
181 5017701490 : addrr_sign(GEN x, long sx, GEN y, long sy)
182 : {
183 5017701490 : long lx, ex = expo(x);
184 5017701490 : 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 5017701490 : if (!sy)
191 : {
192 314660079 : if (!sx)
193 : {
194 101230669 : if (e > 0) ex = ey;
195 101230669 : return real_0_bit(ex);
196 : }
197 213429410 : if (e >= 0) return real_0_bit(ey);
198 212337466 : lz = nbits2lg(-e);
199 212502590 : lx = lg(x); if (lz > lx) lz = lx;
200 1626012697 : z = cgetg(lz, t_REAL); while(--lz) z[lz] = x[lz];
201 212520370 : setsigne(z,sx); return z;
202 : }
203 4703041411 : if (!sx)
204 : {
205 28200388 : if (e <= 0) return real_0_bit(ex);
206 26704337 : lz = nbits2lg(e);
207 26704594 : ly = lg(y); if (lz > ly) lz = ly;
208 136052531 : z = cgetg(lz, t_REAL); while (--lz) z[lz] = y[lz];
209 26702648 : setsigne(z,sy); return z;
210 : }
211 :
212 4674841023 : if (e < 0) { swap(x,y); lswap(sx,sy); ey=ex; e=-e; }
213 : /* now ey >= ex */
214 4674841023 : lx = lg(x);
215 4674841023 : 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 4674841023 : extend = 0;
220 4674841023 : if (e)
221 : {
222 4037905557 : long d = dvmdsBIL(e, &m), l = ly-d;
223 4036292039 : if (l <= 2) return rcopy_sign(y, sy);
224 3992214795 : if (l > lx) { lz = lx + d + 1; extend = 1; }
225 3192601424 : else { lz = ly; lx = l; }
226 3992214795 : if (m)
227 : { /* shift x right m bits */
228 3979401326 : const pari_sp av = avma;
229 3979401326 : const ulong sh = BITS_IN_LONG-m;
230 3979401326 : GEN p1 = x; x = new_chunk(lx + lz + 1);
231 3973271865 : shift_right(x,p1,2,lx, 0,m);
232 3975851277 : if (extend) uel(x,lx) = uel(p1,lx-1) << sh;
233 3975851277 : set_avma(av); /* HACK: cgetg(lz, t_REAL) will not overwrite x */
234 : }
235 : }
236 : else
237 : { /* d = 0 */
238 636935466 : m = 0;
239 636935466 : if (lx > ly) lx = ly;
240 636935466 : lz = lx;
241 : }
242 :
243 4631559427 : if (sx == sy)
244 : { /* addition */
245 2394522524 : i = lz-1;
246 2394522524 : j = lx-1;
247 2394522524 : if (extend) {
248 477440013 : ulong garde = addll(x[lx], y[i]);
249 477440013 : if (m < 4) /* don't extend for few correct bits */
250 55174650 : z = cgetg(--lz, t_REAL);
251 : else
252 : {
253 422265363 : z = cgetg(lz, t_REAL);
254 422225826 : z[i] = garde;
255 : }
256 : }
257 : else
258 : {
259 1917082511 : z = cgetg(lz, t_REAL);
260 1917682894 : z[i] = addll(x[j], y[i]); j--;
261 : }
262 2391526794 : i--;
263 13152392930 : for (; j>=2; i--,j--) z[i] = addllx(x[j],y[i]);
264 2391526794 : if (overflow)
265 : {
266 575039591 : z[1] = 1; /* stops since z[1] != 0 */
267 576329087 : for (;;) { z[i] = uel(y,i)+1; if (z[i--]) break; }
268 575039591 : if (i <= 0)
269 : {
270 571449037 : shift_right(z,z, 2,lz, 1,1);
271 571748186 : z[1] = evalsigne(sx) | evalexpo(ey+1); return z;
272 : }
273 : }
274 2315028447 : for (; i>=2; i--) z[i] = y[i];
275 1820077757 : z[1] = evalsigne(sx) | evalexpo(ey); return z;
276 : }
277 :
278 : /* subtraction */
279 2237036903 : if (e) f2 = 1;
280 : else
281 : {
282 597224532 : i = 2; while (i < lx && x[i] == y[i]) i++;
283 361300939 : if (i==lx) return real_0_bit(ey+1 - lg2prec(lx));
284 336600986 : f2 = (uel(y,i) > uel(x,i));
285 : }
286 : /* result is nonzero. f2 = (y > x) */
287 2212336950 : i = lz-1; z = cgetg(lz, t_REAL);
288 2208768998 : if (f2)
289 : {
290 2062588070 : j = lx-1;
291 2062588070 : if (extend) z[i] = subll(y[i], x[lx]);
292 1740975542 : else z[i] = subll(y[i], x[j--]);
293 12888312951 : for (i--; j>=2; i--) z[i] = subllx(y[i], x[j--]);
294 2062588070 : if (overflow) /* stops since y[1] != 0 */
295 66866819 : for (;;) { z[i] = uel(y,i)-1; if (y[i--]) break; }
296 2421579369 : for (; i>=2; i--) z[i] = y[i];
297 2062588070 : sx = sy;
298 : }
299 : else
300 : {
301 146180928 : if (extend) z[i] = subll(x[lx], y[i]);
302 146180928 : else z[i] = subll(x[i], y[i]);
303 791080204 : for (i--; i>=2; i--) z[i] = subllx(x[i], y[i]);
304 : }
305 :
306 2365739616 : x = z+2; i = 0; while (!x[i]) i++;
307 2208768998 : lz -= i; z += i;
308 2208768998 : j = bfffo(z[2]); /* need to shift left by j bits to normalize mantissa */
309 2208768998 : ez = ey - (j | (i * BITS_IN_LONG));
310 2208768998 : 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 322031546 : if (m - j < 5 && lz > 3)
314 170449593 : { /* shorten z */
315 170445217 : 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 170445217 : if (j == 0)
320 : /* stackdummy((pari_sp)(z + lz+1), (pari_sp)(z + lz)); */
321 13629845 : z[lz] = evaltyp(t_VECSMALL) | _evallg(1);
322 : else
323 : {
324 156815372 : GEN t = z;
325 156815372 : z++; shift_left(z,t,2,lz-1, last,j);
326 : }
327 170449593 : if ((last<<j) & HIGHBIT)
328 : { /* round up */
329 61774216 : i = lz-1;
330 62236644 : while (++((ulong*)z)[i] == 0 && i > 1) i--;
331 61774216 : if (i == 1) { ez++; z[2] = (long)HIGHBIT; }
332 : }
333 : }
334 151586329 : else if (j) shift_left(z,z,2,lz-1, 0,j);
335 : }
336 1886737452 : else if (j) shift_left(z,z,2,lz-1, 0,j);
337 2209895814 : z[1] = evalsigne(sx) | evalexpo(ez);
338 2216805363 : z[0] = evaltyp(t_REAL) | evallg(lz);
339 2215115155 : set_avma((pari_sp)z); return z;
340 : }
|
