![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to nd.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / engine|
Return to nd.c CVS log | Up to [local] / OpenXM_contrib2 / asir2000 / engine |
1.7 ! noro 1: /* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.6 2003/07/25 04:19:54 noro Exp $ */
1.2 noro 2:
1.1 noro 3: #include "ca.h"
4: #include "inline.h"
5:
1.6 noro 6: #define USE_NDV 1
1.4 noro 7:
1.1 noro 8: #if defined(__GNUC__)
9: #define INLINE inline
10: #elif defined(VISUAL)
11: #define INLINE __inline
12: #else
13: #define INLINE
14: #endif
15:
16: #define REDTAB_LEN 32003
17:
18: typedef struct oPGeoBucket {
19: int m;
20: struct oND *body[32];
21: } *PGeoBucket;
22:
23: typedef struct oND {
24: struct oNM *body;
25: int nv;
26: int sugar;
27: } *ND;
28:
1.3 noro 29: typedef struct oNDV {
30: struct oNMV *body;
31: int nv;
32: int sugar;
33: int len;
34: } *NDV;
35:
1.1 noro 36: typedef struct oNM {
37: struct oNM *next;
38: int td;
39: int c;
40: unsigned int dl[1];
41: } *NM;
42:
1.3 noro 43: typedef struct oNMV {
44: int td;
45: int c;
46: unsigned int dl[1];
47: } *NMV;
48:
1.1 noro 49: typedef struct oND_pairs {
50: struct oND_pairs *next;
51: int i1,i2;
52: int td,sugar;
53: unsigned int lcm[1];
54: } *ND_pairs;
55:
56: static ND *nd_ps;
1.3 noro 57: static NDV *nd_psv;
1.1 noro 58: static unsigned int **nd_bound;
59: int nd_mod,nd_nvar;
60: int is_rlex;
61: int nd_epw,nd_bpe,nd_wpd;
62: unsigned int nd_mask[32];
63: unsigned int nd_mask0,nd_mask1;
64: NM _nm_free_list;
65: ND _nd_free_list;
66: ND_pairs _ndp_free_list;
67: NM *nd_red;
68: int nd_red_len;
69:
70: extern int Top,Reverse;
71: int nd_psn,nd_pslen;
72: int nd_found,nd_create,nd_notfirst;
1.6 noro 73: int *nd_psl;
1.1 noro 74:
75: void GC_gcollect();
76: NODE append_one(NODE,int);
77:
78: #define HTD(d) ((d)->body->td)
79: #define HDL(d) ((d)->body->dl)
80: #define HC(d) ((d)->body->c)
81:
82: #define NEWND_pairs(m) if(!_ndp_free_list)_NDP_alloc(); (m)=_ndp_free_list; _ndp_free_list = NEXT(_ndp_free_list)
83: #define NEWNM(m) if(!_nm_free_list)_NM_alloc(); (m)=_nm_free_list; _nm_free_list = NEXT(_nm_free_list)
84: #define MKND(n,m,d) if(!_nd_free_list)_ND_alloc(); (d)=_nd_free_list; _nd_free_list = (ND)BDY(_nd_free_list); (d)->nv=(n); BDY(d)=(m)
85:
86: #define NEXTNM(r,c) \
87: if(!(r)){NEWNM(r);(c)=(r);}else{NEWNM(NEXT(c));(c)=NEXT(c);}
88: #define NEXTNM2(r,c,s) \
89: if(!(r)){(c)=(r)=(s);}else{NEXT(c)=(s);(c)=(s);}
90: #define FREENM(m) NEXT(m)=_nm_free_list; _nm_free_list=(m)
91: #define FREENDP(m) NEXT(m)=_ndp_free_list; _ndp_free_list=(m)
92: #define FREEND(m) BDY(m)=(NM)_nd_free_list; _nd_free_list=(m)
93:
94: #define NEXTND_pairs(r,c) \
95: if(!(r)){NEWND_pairs(r);(c)=(r);}else{NEWND_pairs(NEXT(c));(c)=NEXT(c);}
96:
97: ND_pairs crit_B( ND_pairs d, int s );
98: void nd_gr(LIST f,LIST v,int m,struct order_spec *ord,LIST *rp);
99: NODE nd_setup(NODE f);
100: int nd_newps(ND a);
101: ND_pairs nd_minp( ND_pairs d, ND_pairs *prest );
102: NODE update_base(NODE nd,int ndp);
103: static ND_pairs equivalent_pairs( ND_pairs d1, ND_pairs *prest );
104: int crit_2( int dp1, int dp2 );
105: ND_pairs crit_F( ND_pairs d1 );
106: ND_pairs crit_M( ND_pairs d1 );
107: ND_pairs nd_newpairs( NODE g, int t );
108: ND_pairs update_pairs( ND_pairs d, NODE /* of index */ g, int t);
109: NODE nd_gb(NODE f);
110: void nd_free_private_storage();
111: void _NM_alloc();
112: void _ND_alloc();
113: int ndl_td(unsigned int *d);
114: ND nd_add(ND p1,ND p2);
115: ND nd_mul_nm(ND p,NM m0);
1.6 noro 116: ND nd_mul_ind_nm(int index,NM m0);
1.1 noro 117: ND nd_mul_term(ND p,int td,unsigned int *d);
118: int nd_sp(ND_pairs p,ND *nf);
1.6 noro 119: int nd_find_reducer(ND g);
1.1 noro 120: int nd_nf(ND g,int full,ND *nf);
121: ND nd_reduce(ND p1,ND p2);
122: ND nd_reduce_special(ND p1,ND p2);
123: void nd_free(ND p);
124: void ndl_print(unsigned int *dl);
125: void nd_print(ND p);
126: void ndp_print(ND_pairs d);
127: int nd_length(ND p);
128: void nd_monic(ND p);
129: void nd_mul_c(ND p,int mul);
130: void nd_free_redlist();
131: void nd_append_red(unsigned int *d,int td,int i);
132: unsigned int *nd_compute_bound(ND p);
1.5 noro 133: unsigned int *dp_compute_bound(DP p);
1.1 noro 134: ND_pairs nd_reconstruct(ND_pairs);
135: void nd_setup_parameters();
136: ND nd_dup(ND p,int obpe);
1.6 noro 137: ND nd_copy(ND p);
1.1 noro 138: void ndl_dup(int obpe,unsigned int *d,unsigned int *r);
1.4 noro 139:
140: #if USE_NDV
141: #define NMV_ADV(m) (m = (NMV)(((char *)m)+nmv_adv))
142: #define NEWNDV(d) ((d)=(NDV)MALLOC(sizeof(struct oNDV)))
143: #define MKNDV(n,m,l,d) NEWNDV(d); (d)->nv=(n); BDY(d)=(m); (d)->len = l;
144:
145: int nmv_adv;
146: int nmv_len;
147: NDV ndv_red;
148:
149: ND ndv_add(ND p1,NDV p2);
1.3 noro 150: NDV ndtondv(ND p);
151: void ndv_mul_nm(NDV pv,NM m,NDV r);
1.4 noro 152: #endif
1.1 noro 153:
154: void nd_free_private_storage()
155: {
156: _nd_free_list = 0;
157: _nm_free_list = 0;
1.5 noro 158: _ndp_free_list = 0;
1.1 noro 159: nd_red = 0;
160: GC_gcollect();
161: }
162:
163: void _NM_alloc()
164: {
165: NM p;
166: int i;
167:
168: for ( i = 0; i < 16; i++ ) {
169: p = (NM)GC_malloc(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int));
170: p->next = _nm_free_list; _nm_free_list = p;
171: }
172: }
173:
174: void _ND_alloc()
175: {
176: ND p;
177: int i;
178:
179: for ( i = 0; i < 1024; i++ ) {
180: p = (ND)GC_malloc(sizeof(struct oND));
181: p->body = (NM)_nd_free_list; _nd_free_list = p;
182: }
183: }
184:
185: void _NDP_alloc()
186: {
187: ND_pairs p;
188: int i;
189:
190: for ( i = 0; i < 10240; i++ ) {
191: p = (ND_pairs)GC_malloc(sizeof(struct oND_pairs)
192: +(nd_wpd-1)*sizeof(unsigned int));
193: p->next = _ndp_free_list; _ndp_free_list = p;
194: }
195: }
196:
197: INLINE nd_length(ND p)
198: {
199: NM m;
200: int i;
201:
202: if ( !p )
203: return 0;
204: else {
205: for ( i = 0, m = BDY(p); m; m = NEXT(m), i++ );
206: return i;
207: }
208: }
209:
210: INLINE int ndl_reducible(unsigned int *d1,unsigned int *d2)
211: {
212: unsigned int u1,u2;
213: int i,j;
214:
215: switch ( nd_bpe ) {
216: case 4:
217: for ( i = 0; i < nd_wpd; i++ ) {
218: u1 = d1[i]; u2 = d2[i];
219: if ( (u1&0xf0000000) < (u2&0xf0000000) ) return 0;
220: if ( (u1&0xf000000) < (u2&0xf000000) ) return 0;
221: if ( (u1&0xf00000) < (u2&0xf00000) ) return 0;
222: if ( (u1&0xf0000) < (u2&0xf0000) ) return 0;
223: if ( (u1&0xf000) < (u2&0xf000) ) return 0;
224: if ( (u1&0xf00) < (u2&0xf00) ) return 0;
225: if ( (u1&0xf0) < (u2&0xf0) ) return 0;
226: if ( (u1&0xf) < (u2&0xf) ) return 0;
227: }
228: return 1;
229: break;
230: case 6:
231: for ( i = 0; i < nd_wpd; i++ ) {
232: u1 = d1[i]; u2 = d2[i];
233: if ( (u1&0x3f000000) < (u2&0x3f000000) ) return 0;
234: if ( (u1&0xfc0000) < (u2&0xfc0000) ) return 0;
235: if ( (u1&0x3f000) < (u2&0x3f000) ) return 0;
236: if ( (u1&0xfc0) < (u2&0xfc0) ) return 0;
237: if ( (u1&0x3f) < (u2&0x3f) ) return 0;
238: }
239: return 1;
240: break;
241: case 8:
242: for ( i = 0; i < nd_wpd; i++ ) {
243: u1 = d1[i]; u2 = d2[i];
244: if ( (u1&0xff000000) < (u2&0xff000000) ) return 0;
245: if ( (u1&0xff0000) < (u2&0xff0000) ) return 0;
246: if ( (u1&0xff00) < (u2&0xff00) ) return 0;
247: if ( (u1&0xff) < (u2&0xff) ) return 0;
248: }
249: return 1;
250: break;
251: case 16:
252: for ( i = 0; i < nd_wpd; i++ ) {
253: u1 = d1[i]; u2 = d2[i];
254: if ( (u1&0xffff0000) < (u2&0xffff0000) ) return 0;
255: if ( (u1&0xffff) < (u2&0xffff) ) return 0;
256: }
257: return 1;
258: break;
259: case 32:
260: for ( i = 0; i < nd_wpd; i++ )
261: if ( d1[i] < d2[i] ) return 0;
262: return 1;
263: break;
264: default:
265: for ( i = 0; i < nd_wpd; i++ ) {
266: u1 = d1[i]; u2 = d2[i];
267: for ( j = 0; j < nd_epw; j++ )
268: if ( (u1&nd_mask[j]) < (u2&nd_mask[j]) ) return 0;
269: }
270: return 1;
271: }
272: }
273:
274: void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned int *d)
275: {
276: unsigned int t1,t2,u,u1,u2;
277: int i,j;
278:
279: switch ( nd_bpe ) {
280: case 4:
281: for ( i = 0; i < nd_wpd; i++ ) {
282: u1 = d1[i]; u2 = d2[i];
283: t1 = (u1&0xf0000000); t2 = (u2&0xf0000000); u = t1>t2?t1:t2;
284: t1 = (u1&0xf000000); t2 = (u2&0xf000000); u |= t1>t2?t1:t2;
285: t1 = (u1&0xf00000); t2 = (u2&0xf00000); u |= t1>t2?t1:t2;
286: t1 = (u1&0xf0000); t2 = (u2&0xf0000); u |= t1>t2?t1:t2;
287: t1 = (u1&0xf000); t2 = (u2&0xf000); u |= t1>t2?t1:t2;
288: t1 = (u1&0xf00); t2 = (u2&0xf00); u |= t1>t2?t1:t2;
289: t1 = (u1&0xf0); t2 = (u2&0xf0); u |= t1>t2?t1:t2;
290: t1 = (u1&0xf); t2 = (u2&0xf); u |= t1>t2?t1:t2;
291: d[i] = u;
292: }
293: break;
294: case 6:
295: for ( i = 0; i < nd_wpd; i++ ) {
296: u1 = d1[i]; u2 = d2[i];
297: t1 = (u1&0x3f000000); t2 = (u2&0x3f000000); u = t1>t2?t1:t2;
298: t1 = (u1&0xfc0000); t2 = (u2&0xfc0000); u |= t1>t2?t1:t2;
299: t1 = (u1&0x3f000); t2 = (u2&0x3f000); u |= t1>t2?t1:t2;
300: t1 = (u1&0xfc0); t2 = (u2&0xfc0); u |= t1>t2?t1:t2;
301: t1 = (u1&0x3f); t2 = (u2&0x3f); u |= t1>t2?t1:t2;
302: d[i] = u;
303: }
304: break;
305: case 8:
306: for ( i = 0; i < nd_wpd; i++ ) {
307: u1 = d1[i]; u2 = d2[i];
308: t1 = (u1&0xff000000); t2 = (u2&0xff000000); u = t1>t2?t1:t2;
309: t1 = (u1&0xff0000); t2 = (u2&0xff0000); u |= t1>t2?t1:t2;
310: t1 = (u1&0xff00); t2 = (u2&0xff00); u |= t1>t2?t1:t2;
311: t1 = (u1&0xff); t2 = (u2&0xff); u |= t1>t2?t1:t2;
312: d[i] = u;
313: }
314: break;
315: case 16:
316: for ( i = 0; i < nd_wpd; i++ ) {
317: u1 = d1[i]; u2 = d2[i];
318: t1 = (u1&0xffff0000); t2 = (u2&0xffff0000); u = t1>t2?t1:t2;
319: t1 = (u1&0xffff); t2 = (u2&0xffff); u |= t1>t2?t1:t2;
320: d[i] = u;
321: }
322: break;
323: case 32:
324: for ( i = 0; i < nd_wpd; i++ ) {
325: u1 = d1[i]; u2 = d2[i];
326: d[i] = u1>u2?u1:u2;
327: }
328: break;
329: default:
330: for ( i = 0; i < nd_wpd; i++ ) {
331: u1 = d1[i]; u2 = d2[i];
332: for ( j = 0, u = 0; j < nd_epw; j++ ) {
333: t1 = (u1&nd_mask[j]); t2 = (u2&nd_mask[j]); u |= t1>t2?t1:t2;
334: }
335: d[i] = u;
336: }
337: break;
338: }
339: }
340:
341: int ndl_td(unsigned int *d)
342: {
343: unsigned int t,u;
344: int i,j;
345:
346: for ( t = 0, i = 0; i < nd_wpd; i++ ) {
347: u = d[i];
348: for ( j = 0; j < nd_epw; j++, u>>=nd_bpe )
349: t += (u&nd_mask0);
350: }
351: return t;
352: }
353:
354: INLINE int ndl_compare(unsigned int *d1,unsigned int *d2)
355: {
356: int i;
357:
358: for ( i = 0; i < nd_wpd; i++, d1++, d2++ )
359: if ( *d1 > *d2 )
360: return is_rlex ? -1 : 1;
361: else if ( *d1 < *d2 )
362: return is_rlex ? 1 : -1;
363: return 0;
364: }
365:
366: INLINE int ndl_equal(unsigned int *d1,unsigned int *d2)
367: {
368: int i;
369:
370: for ( i = 0; i < nd_wpd; i++ )
371: if ( d1[i] != d2[i] )
372: return 0;
373: return 1;
374: }
375:
1.6 noro 376: INLINE void ndl_copy(unsigned int *d1,unsigned int *d2)
377: {
378: int i;
379:
380: switch ( nd_wpd ) {
381: case 1:
382: d2[0] = d1[0];
383: break;
384: case 2:
385: d2[0] = d1[0];
386: d2[1] = d1[1];
387: break;
388: default:
389: for ( i = 0; i < nd_wpd; i++ )
390: d2[i] = d1[i];
391: break;
392: }
393: }
394:
1.1 noro 395: INLINE void ndl_add(unsigned int *d1,unsigned int *d2,unsigned int *d)
396: {
397: int i;
398:
1.6 noro 399: switch ( nd_wpd ) {
400: case 1:
401: d[0] = d1[0]+d2[0];
402: break;
403: case 2:
404: d[0] = d1[0]+d2[0];
405: d[1] = d1[1]+d2[1];
406: break;
407: default:
408: for ( i = 0; i < nd_wpd; i++ )
409: d[i] = d1[i]+d2[i];
410: break;
411: }
412: }
413:
414: INLINE void ndl_add2(unsigned int *d1,unsigned int *d2)
415: {
416: int i;
417:
418: switch ( nd_wpd ) {
419: case 1:
420: d2[0] += d1[0];
421: break;
422: case 2:
423: d2[0] += d1[0];
424: d2[1] += d1[1];
425: break;
426: default:
427: for ( i = 0; i < nd_wpd; i++ )
428: d2[i] += d1[i];
429: break;
1.1 noro 430: }
431: }
432:
433: void ndl_sub(unsigned int *d1,unsigned int *d2,unsigned int *d)
434: {
435: int i;
436:
437: for ( i = 0; i < nd_wpd; i++ )
438: d[i] = d1[i]-d2[i];
439: }
440:
441: int ndl_disjoint(unsigned int *d1,unsigned int *d2)
442: {
443: unsigned int t1,t2,u,u1,u2;
444: int i,j;
445:
446: switch ( nd_bpe ) {
447: case 4:
448: for ( i = 0; i < nd_wpd; i++ ) {
449: u1 = d1[i]; u2 = d2[i];
450: t1 = u1&0xf0000000; t2 = u2&0xf0000000; if ( t1&&t2 ) return 0;
451: t1 = u1&0xf000000; t2 = u2&0xf000000; if ( t1&&t2 ) return 0;
452: t1 = u1&0xf00000; t2 = u2&0xf00000; if ( t1&&t2 ) return 0;
453: t1 = u1&0xf0000; t2 = u2&0xf0000; if ( t1&&t2 ) return 0;
454: t1 = u1&0xf000; t2 = u2&0xf000; if ( t1&&t2 ) return 0;
455: t1 = u1&0xf00; t2 = u2&0xf00; if ( t1&&t2 ) return 0;
456: t1 = u1&0xf0; t2 = u2&0xf0; if ( t1&&t2 ) return 0;
457: t1 = u1&0xf; t2 = u2&0xf; if ( t1&&t2 ) return 0;
458: }
459: return 1;
460: break;
461: case 6:
462: for ( i = 0; i < nd_wpd; i++ ) {
463: u1 = d1[i]; u2 = d2[i];
464: t1 = u1&0x3f000000; t2 = u2&0x3f000000; if ( t1&&t2 ) return 0;
465: t1 = u1&0xfc0000; t2 = u2&0xfc0000; if ( t1&&t2 ) return 0;
466: t1 = u1&0x3f000; t2 = u2&0x3f000; if ( t1&&t2 ) return 0;
467: t1 = u1&0xfc0; t2 = u2&0xfc0; if ( t1&&t2 ) return 0;
468: t1 = u1&0x3f; t2 = u2&0x3f; if ( t1&&t2 ) return 0;
469: }
470: return 1;
471: break;
472: case 8:
473: for ( i = 0; i < nd_wpd; i++ ) {
474: u1 = d1[i]; u2 = d2[i];
475: t1 = u1&0xff000000; t2 = u2&0xff000000; if ( t1&&t2 ) return 0;
476: t1 = u1&0xff0000; t2 = u2&0xff0000; if ( t1&&t2 ) return 0;
477: t1 = u1&0xff00; t2 = u2&0xff00; if ( t1&&t2 ) return 0;
478: t1 = u1&0xff; t2 = u2&0xff; if ( t1&&t2 ) return 0;
479: }
480: return 1;
481: break;
482: case 16:
483: for ( i = 0; i < nd_wpd; i++ ) {
484: u1 = d1[i]; u2 = d2[i];
485: t1 = u1&0xffff0000; t2 = u2&0xffff0000; if ( t1&&t2 ) return 0;
486: t1 = u1&0xffff; t2 = u2&0xffff; if ( t1&&t2 ) return 0;
487: }
488: return 1;
489: break;
490: case 32:
491: for ( i = 0; i < nd_wpd; i++ )
492: if ( d1[i] && d2[i] ) return 0;
493: return 1;
494: break;
495: default:
496: for ( i = 0; i < nd_wpd; i++ ) {
497: u1 = d1[i]; u2 = d2[i];
498: for ( j = 0; j < nd_epw; j++ ) {
499: if ( (u1&nd_mask0) && (u2&nd_mask0) ) return 0;
500: u1 >>= nd_bpe; u2 >>= nd_bpe;
501: }
502: }
503: return 1;
504: break;
505: }
506: }
507:
508: ND nd_reduce(ND p1,ND p2)
509: {
510: int c,c1,c2,t,td,td2,mul;
511: NM m2,prev,head,cur,new;
512: unsigned int *d;
513:
514: if ( !p1 )
515: return 0;
516: else {
517: c2 = invm(HC(p2),nd_mod);
518: c1 = nd_mod-HC(p1);
519: DMAR(c1,c2,0,nd_mod,mul);
520: td = HTD(p1)-HTD(p2);
521: d = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int));
522: ndl_sub(HDL(p1),HDL(p2),d);
523: prev = 0; head = cur = BDY(p1);
524: NEWNM(new);
525: for ( m2 = BDY(p2); m2; ) {
526: td2 = new->td = m2->td+td;
527: ndl_add(m2->dl,d,new->dl);
528: if ( !cur ) {
529: c1 = C(m2);
530: DMAR(c1,mul,0,nd_mod,c2);
531: C(new) = c2;
532: if ( !prev ) {
533: prev = new;
534: NEXT(prev) = 0;
535: head = prev;
536: } else {
537: NEXT(prev) = new;
538: NEXT(new) = 0;
539: prev = new;
540: }
541: m2 = NEXT(m2);
542: NEWNM(new);
543: continue;
544: }
545: if ( cur->td > td2 )
546: c = 1;
547: else if ( cur->td < td2 )
548: c = -1;
549: else
550: c = ndl_compare(cur->dl,new->dl);
551: switch ( c ) {
552: case 0:
553: c2 = C(m2);
554: c1 = C(cur);
555: DMAR(c2,mul,c1,nd_mod,t);
556: if ( t )
557: C(cur) = t;
558: else if ( !prev ) {
559: head = NEXT(cur);
560: FREENM(cur);
561: cur = head;
562: } else {
563: NEXT(prev) = NEXT(cur);
564: FREENM(cur);
565: cur = NEXT(prev);
566: }
567: m2 = NEXT(m2);
568: break;
569: case 1:
570: prev = cur;
571: cur = NEXT(cur);
572: break;
573: case -1:
574: if ( !prev ) {
575: /* cur = head */
576: prev = new;
577: c2 = C(m2);
578: DMAR(c2,mul,0,nd_mod,c1);
579: C(prev) = c1;
580: NEXT(prev) = head;
581: head = prev;
582: } else {
583: c2 = C(m2);
584: DMAR(c2,mul,0,nd_mod,c1);
585: C(new) = c1;
586: NEXT(prev) = new;
587: NEXT(new) = cur;
588: prev = new;
589: }
590: NEWNM(new);
591: m2 = NEXT(m2);
592: break;
593: }
594: }
595: FREENM(new);
596: if ( head ) {
597: BDY(p1) = head;
598: p1->sugar = MAX(p1->sugar,p2->sugar+td);
599: return p1;
600: } else {
601: FREEND(p1);
602: return 0;
603: }
604:
605: }
606: }
607:
608: /* HDL(p1) = HDL(p2) */
609:
610: ND nd_reduce_special(ND p1,ND p2)
611: {
612: int c,c1,c2,t,td,td2,mul;
613: NM m2,prev,head,cur,new;
614:
615: if ( !p1 )
616: return 0;
617: else {
618: c2 = invm(HC(p2),nd_mod);
619: c1 = nd_mod-HC(p1);
620: DMAR(c1,c2,0,nd_mod,mul);
621: prev = 0; head = cur = BDY(p1);
622: NEWNM(new);
623: for ( m2 = BDY(p2); m2; ) {
624: td2 = new->td = m2->td;
625: if ( !cur ) {
626: c1 = C(m2);
627: DMAR(c1,mul,0,nd_mod,c2);
628: C(new) = c2;
629: bcopy(m2->dl,new->dl,nd_wpd*sizeof(unsigned int));
630: if ( !prev ) {
631: prev = new;
632: NEXT(prev) = 0;
633: head = prev;
634: } else {
635: NEXT(prev) = new;
636: NEXT(new) = 0;
637: prev = new;
638: }
639: m2 = NEXT(m2);
640: NEWNM(new);
641: continue;
642: }
643: if ( cur->td > td2 )
644: c = 1;
645: else if ( cur->td < td2 )
646: c = -1;
647: else
648: c = ndl_compare(cur->dl,m2->dl);
649: switch ( c ) {
650: case 0:
651: c2 = C(m2);
652: c1 = C(cur);
653: DMAR(c2,mul,c1,nd_mod,t);
654: if ( t )
655: C(cur) = t;
656: else if ( !prev ) {
657: head = NEXT(cur);
658: FREENM(cur);
659: cur = head;
660: } else {
661: NEXT(prev) = NEXT(cur);
662: FREENM(cur);
663: cur = NEXT(prev);
664: }
665: m2 = NEXT(m2);
666: break;
667: case 1:
668: prev = cur;
669: cur = NEXT(cur);
670: break;
671: case -1:
672: bcopy(m2->dl,new->dl,nd_wpd*sizeof(unsigned int));
673: if ( !prev ) {
674: /* cur = head */
675: prev = new;
676: c2 = C(m2);
677: DMAR(c2,mul,0,nd_mod,c1);
678: C(prev) = c1;
679: NEXT(prev) = head;
680: head = prev;
681: } else {
682: c2 = C(m2);
683: DMAR(c2,mul,0,nd_mod,c1);
684: C(new) = c1;
685: NEXT(prev) = new;
686: NEXT(new) = cur;
687: prev = new;
688: }
689: NEWNM(new);
690: m2 = NEXT(m2);
691: break;
692: }
693: }
694: FREENM(new);
695: if ( head ) {
696: BDY(p1) = head;
697: p1->sugar = MAX(p1->sugar,p2->sugar+td);
698: return p1;
699: } else {
700: FREEND(p1);
701: return 0;
702: }
703:
704: }
705: }
706:
1.5 noro 707: int ndl_check_bound2(int index,unsigned int *d2)
1.1 noro 708: {
1.5 noro 709: unsigned int u2;
710: unsigned int *d1;
711: int i,j,ind,k;
1.1 noro 712:
1.5 noro 713: d1 = nd_bound[index];
714: ind = 0;
715: switch ( nd_bpe ) {
716: case 4:
717: for ( i = 0; i < nd_wpd; i++ ) {
718: u2 = d2[i];
719: if ( d1[ind++]+((u2>>28)&0xf) >= 0x10 ) return 1;
720: if ( d1[ind++]+((u2>>24)&0xf) >= 0x10 ) return 1;
721: if ( d1[ind++]+((u2>>20)&0xf) >= 0x10 ) return 1;
722: if ( d1[ind++]+((u2>>16)&0xf) >= 0x10 ) return 1;
723: if ( d1[ind++]+((u2>>12)&0xf) >= 0x10 ) return 1;
724: if ( d1[ind++]+((u2>>8)&0xf) >= 0x10 ) return 1;
725: if ( d1[ind++]+((u2>>4)&0xf) >= 0x10 ) return 1;
726: if ( d1[ind++]+(u2&0xf) >= 0x10 ) return 1;
727: }
728: return 0;
729: break;
730: case 6:
731: for ( i = 0; i < nd_wpd; i++ ) {
732: u2 = d2[i];
733: if ( d1[ind++]+((u2>>24)&0x3f) >= 0x40 ) return 1;
734: if ( d1[ind++]+((u2>>18)&0x3f) >= 0x40 ) return 1;
735: if ( d1[ind++]+((u2>>12)&0x3f) >= 0x40 ) return 1;
736: if ( d1[ind++]+((u2>>6)&0x3f) >= 0x40 ) return 1;
737: if ( d1[ind++]+(u2&0x3f) >= 0x40 ) return 1;
738: }
739: return 0;
740: break;
741: case 8:
742: for ( i = 0; i < nd_wpd; i++ ) {
743: u2 = d2[i];
744: if ( d1[ind++]+((u2>>24)&0xff) >= 0x100 ) return 1;
745: if ( d1[ind++]+((u2>>16)&0xff) >= 0x100 ) return 1;
746: if ( d1[ind++]+((u2>>8)&0xff) >= 0x100 ) return 1;
747: if ( d1[ind++]+(u2&0xff) >= 0x100 ) return 1;
748: }
749: return 0;
750: break;
751: case 16:
752: for ( i = 0; i < nd_wpd; i++ ) {
753: u2 = d2[i];
754: if ( d1[ind++]+((u2>>16)&0xffff) > 0x10000 ) return 1;
755: if ( d1[ind++]+(u2&0xffff) > 0x10000 ) return 1;
756: }
757: return 0;
758: break;
759: case 32:
760: for ( i = 0; i < nd_wpd; i++ )
761: if ( d1[i]+d2[i]<d1[i] ) return 1;
762: return 0;
763: break;
764: default:
765: for ( i = 0; i < nd_wpd; i++ ) {
766: u2 = d2[i];
767: k = (nd_epw-1)*nd_bpe;
768: for ( j = 0; j < nd_epw; j++, k -= nd_bpe )
769: if ( d1[ind++]+((u2>>k)&nd_mask0) > nd_mask0 ) return 1;
770: }
771: return 0;
772: break;
773: }
1.1 noro 774: }
775:
776: int nd_sp(ND_pairs p,ND *rp)
777: {
778: NM m;
779: ND p1,p2,t1,t2;
1.5 noro 780: unsigned int *lcm;
1.1 noro 781: int td;
782:
783: p1 = nd_ps[p->i1];
784: p2 = nd_ps[p->i2];
785: lcm = p->lcm;
786: td = p->td;
787: NEWNM(m);
788: C(m) = HC(p2); m->td = td-HTD(p1); ndl_sub(lcm,HDL(p1),m->dl); NEXT(m) = 0;
1.5 noro 789: if ( ndl_check_bound2(p->i1,m->dl) )
1.1 noro 790: return 0;
791: t1 = nd_mul_nm(p1,m);
792: C(m) = nd_mod-HC(p1); m->td = td-HTD(p2); ndl_sub(lcm,HDL(p2),m->dl);
1.5 noro 793: if ( ndl_check_bound2(p->i2,m->dl) ) {
1.1 noro 794: nd_free(t1);
795: return 0;
796: }
797: t2 = nd_mul_nm(p2,m);
798: FREENM(m);
799: *rp = nd_add(t1,t2);
800: return 1;
801: }
802:
1.6 noro 803: INLINE int ndl_hash_value(int td,unsigned int *d)
1.1 noro 804: {
805: int i;
806: int r;
807:
808: r = td;
809: for ( i = 0; i < nd_wpd; i++ )
810: r = ((r<<16)+d[i])%REDTAB_LEN;
811: return r;
812: }
813:
1.7 ! noro 814: int nd_find_reducer(ND g)
1.1 noro 815: {
816: NM m;
1.6 noro 817: ND p;
818: int d,k,i;
1.1 noro 819:
820: d = ndl_hash_value(HTD(g),HDL(g));
821: for ( m = nd_red[d], k = 0; m; m = NEXT(m), k++ ) {
822: if ( HTD(g) == m->td && ndl_equal(HDL(g),m->dl) ) {
823: if ( k > 0 ) nd_notfirst++;
824: nd_found++;
1.6 noro 825: return m->c;
1.1 noro 826: }
827: }
828:
829: for ( i = 0; i < nd_psn; i++ ) {
830: p = nd_ps[i];
831: if ( HTD(g) >= HTD(p) && ndl_reducible(HDL(g),HDL(p)) ) {
832: nd_create++;
1.6 noro 833: nd_append_red(HDL(g),HTD(g),i);
834: return i;
1.1 noro 835: }
836: }
1.6 noro 837: return -1;
1.1 noro 838: }
839:
840: ND nd_find_monic_reducer(ND g)
841: {
842: int *d;
843: ND p,r;
844: int i;
845:
846: for ( i = 0; i < nd_psn; i++ ) {
847: p = nd_ps[i];
848: if ( HTD(g) >= HTD(p) && ndl_reducible(HDL(g),HDL(p)) ) {
849: d = (int *)ALLOCA(nd_wpd*sizeof(int));
850: ndl_sub(HDL(g),HDL(p),d);
851: r = nd_mul_term(p,HTD(g)-HTD(p),d);
852: return r;
853: }
854: }
855: return 0;
856: }
857:
858: ND nd_add(ND p1,ND p2)
859: {
860: int n,c;
861: int t;
862: ND r;
863: NM m1,m2,mr0,mr,s;
864:
865: if ( !p1 )
866: return p2;
867: else if ( !p2 )
868: return p1;
869: else {
870: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
871: if ( m1->td > m2->td )
872: c = 1;
873: else if ( m1->td < m2->td )
874: c = -1;
875: else
876: c = ndl_compare(m1->dl,m2->dl);
877: switch ( c ) {
878: case 0:
879: t = ((C(m1))+(C(m2))) - nd_mod;
880: if ( t < 0 )
881: t += nd_mod;
882: s = m1; m1 = NEXT(m1);
883: if ( t ) {
884: NEXTNM2(mr0,mr,s); C(mr) = (t);
885: } else {
886: FREENM(s);
887: }
888: s = m2; m2 = NEXT(m2); FREENM(s);
889: break;
890: case 1:
891: s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s);
892: break;
893: case -1:
894: s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s);
895: break;
896: }
897: }
898: if ( !mr0 )
899: if ( m1 )
900: mr0 = m1;
901: else if ( m2 )
902: mr0 = m2;
903: else
904: return 0;
905: else if ( m1 )
906: NEXT(mr) = m1;
907: else if ( m2 )
908: NEXT(mr) = m2;
909: else
910: NEXT(mr) = 0;
911: BDY(p1) = mr0;
912: p1->sugar = MAX(p1->sugar,p2->sugar);
913: FREEND(p2);
914: return p1;
915: }
916: }
917:
918: ND nd_mul_nm(ND p,NM m0)
919: {
920: NM m,mr,mr0;
921: unsigned int *d,*dt,*dm;
922: int c,n,td,i,c1,c2;
923: int *pt,*p1,*p2;
924: ND r;
925:
926: if ( !p )
927: return 0;
928: else {
929: n = NV(p); m = BDY(p);
930: d = m0->dl; td = m0->td; c = C(m0);
931: mr0 = 0;
932: for ( ; m; m = NEXT(m) ) {
933: NEXTNM(mr0,mr);
934: c1 = C(m);
935: DMAR(c1,c,0,nd_mod,c2);
936: C(mr) = c2;
937: mr->td = m->td+td;
938: ndl_add(m->dl,d,mr->dl);
939: }
940: NEXT(mr) = 0;
941: MKND(NV(p),mr0,r);
942: r->sugar = p->sugar + td;
943: return r;
944: }
945: }
946:
1.6 noro 947: ND nd_mul_ind_nm(int index,NM m0)
948: {
949: register int c1,c2,c;
950: register NM m,new,prev;
951: NM mr0;
952: unsigned int *d;
953: int n,td,i,len,d0,d1;
954: ND p,r;
955:
956: p = nd_ps[index];
957: len = nd_psl[index];
958: n = NV(p); m = BDY(p);
959: d = m0->dl; td = m0->td; c = C(m0);
960:
961: NEWNM(mr0);
962: c1 = C(m); DMAR(c1,c,0,nd_mod,c2); C(mr0) = c2;
963: mr0->td = m->td+td; ndl_add(m->dl,d,mr0->dl);
964: prev = mr0; m = NEXT(m);
965: len--;
966:
967: switch ( nd_wpd ) {
968: case 1:
969: d0 = d[0];
970: while ( len-- ) {
971: c1 = C(m); DMAR(c1,c,0,nd_mod,c2);
972: NEWNM(new); C(new) = c2;
973: new->td = m->td+td; new->dl[0] = m->dl[0]+d0;
974: m = NEXT(m); NEXT(prev) = new; prev = new;
975: }
976: break;
977: case 2:
978: d0 = d[0]; d1 = d[1];
979: while ( len-- ) {
980: c1 = C(m); DMAR(c1,c,0,nd_mod,c2);
981: NEWNM(new); C(new) = c2;
982: new->td = m->td+td;
983: new->dl[0] = m->dl[0]+d0;
984: new->dl[1] = m->dl[1]+d1;
985: m = NEXT(m); NEXT(prev) = new; prev = new;
986: }
987: break;
988: default:
989: while ( len-- ) {
990: c1 = C(m); DMAR(c1,c,0,nd_mod,c2);
991: NEWNM(new); C(new) = c2;
992: new->td = m->td+td; ndl_add(m->dl,d,new->dl);
993: m = NEXT(m); NEXT(prev) = new; prev = new;
994: }
995: break;
996: }
997:
998: NEXT(prev) = 0;
999: MKND(NV(p),mr0,r);
1000: r->sugar = p->sugar + td;
1001: return r;
1002: }
1003:
1.1 noro 1004: ND nd_mul_term(ND p,int td,unsigned int *d)
1005: {
1006: NM m,mr,mr0;
1007: int c,n;
1008: ND r;
1009:
1010: if ( !p )
1011: return 0;
1012: else {
1013: n = NV(p); m = BDY(p);
1014: for ( mr0 = 0; m; m = NEXT(m) ) {
1015: NEXTNM(mr0,mr);
1016: C(mr) = C(m);
1017: mr->td = m->td+td;
1018: ndl_add(m->dl,d,mr->dl);
1019: }
1020: NEXT(mr) = 0;
1021: MKND(NV(p),mr0,r);
1022: r->sugar = p->sugar + td;
1023: return r;
1024: }
1025: }
1026:
1027: #if 1
1028: /* ret=1 : success, ret=0 : overflow */
1029: int nd_nf(ND g,int full,ND *rp)
1030: {
1.3 noro 1031: ND p,d;
1.1 noro 1032: NM m,mrd,tail;
1.7 ! noro 1033: NM mul;
1.6 noro 1034: int n,sugar,psugar,stat,index;
1035: int c,c1,c2;
1.4 noro 1036: #if USE_NDV
1.3 noro 1037: NDV red;
1.4 noro 1038: #else
1039: ND red;
1040: #endif
1.1 noro 1041:
1042: if ( !g ) {
1043: *rp = 0;
1044: return 1;
1045: }
1046: sugar = g->sugar;
1047: n = NV(g);
1.7 ! noro 1048: mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int));
1.1 noro 1049: for ( d = 0; g; ) {
1.6 noro 1050: index = nd_find_reducer(g);
1051: if ( index >= 0 ) {
1052: p = nd_ps[index];
1.7 ! noro 1053: ndl_sub(HDL(g),HDL(p),mul->dl);
! 1054: mul->td = HTD(g)-HTD(p);
! 1055: if ( ndl_check_bound2(index,mul->dl) ) {
1.6 noro 1056: nd_free(g); nd_free(d);
1057: return 0;
1058: }
1059: c1 = invm(HC(p),nd_mod); c2 = nd_mod-HC(g);
1.7 ! noro 1060: DMAR(c1,c2,0,nd_mod,c); C(mul) = c;
1.4 noro 1061: #if USE_NDV
1.7 ! noro 1062: ndv_mul_nm(nd_psv[index],mul,ndv_red);
1.4 noro 1063: g = ndv_add(g,ndv_red);
1064: sugar = MAX(sugar,ndv_red->sugar);
1065: #else
1.7 ! noro 1066: red = nd_mul_ind_nm(index,mul);
1.1 noro 1067: g = nd_add(g,red);
1.4 noro 1068: sugar = MAX(sugar,red->sugar);
1.1 noro 1069: #endif
1070: } else if ( !full ) {
1071: *rp = g;
1072: return 1;
1073: } else {
1074: m = BDY(g);
1075: if ( NEXT(m) ) {
1076: BDY(g) = NEXT(m); NEXT(m) = 0;
1077: } else {
1078: FREEND(g); g = 0;
1079: }
1080: if ( d ) {
1081: NEXT(tail)=m;
1082: tail=m;
1083: } else {
1084: MKND(n,m,d);
1085: tail = BDY(d);
1086: }
1087: }
1088: }
1089: if ( d )
1090: d->sugar = sugar;
1091: *rp = d;
1092: return 1;
1093: }
1094: #else
1095:
1096: ND nd_remove_head(ND p)
1097: {
1098: NM m;
1099:
1100: m = BDY(p);
1101: if ( !NEXT(m) ) {
1102: FREEND(p);
1103: p = 0;
1104: } else
1105: BDY(p) = NEXT(m);
1106: FREENM(m);
1107: return p;
1108: }
1109:
1110: PGeoBucket create_pbucket()
1111: {
1112: PGeoBucket g;
1113:
1114: g = CALLOC(1,sizeof(struct oPGeoBucket));
1115: g->m = -1;
1116: return g;
1117: }
1118:
1119: void add_pbucket(PGeoBucket g,ND d)
1120: {
1121: int l,k,m;
1122:
1123: l = nd_length(d);
1124: for ( k = 0, m = 1; l > m; k++, m <<= 2 );
1125: /* 4^(k-1) < l <= 4^k */
1126: d = nd_add(g->body[k],d);
1127: for ( ; d && nd_length(d) > 1<<(2*k); k++ ) {
1128: g->body[k] = 0;
1129: d = nd_add(g->body[k+1],d);
1130: }
1131: g->body[k] = d;
1132: g->m = MAX(g->m,k);
1133: }
1134:
1135: int head_pbucket(PGeoBucket g)
1136: {
1137: int j,i,c,k,nv,sum;
1138: unsigned int *di,*dj;
1139: ND gi,gj;
1140:
1141: k = g->m;
1142: while ( 1 ) {
1143: j = -1;
1144: for ( i = 0; i <= k; i++ ) {
1145: if ( !(gi = g->body[i]) )
1146: continue;
1147: if ( j < 0 ) {
1148: j = i;
1149: gj = g->body[j];
1150: dj = HDL(gj);
1151: sum = HC(gj);
1152: } else {
1153: di = HDL(gi);
1154: nv = NV(gi);
1155: if ( HTD(gi) > HTD(gj) )
1156: c = 1;
1157: else if ( HTD(gi) < HTD(gj) )
1158: c = -1;
1159: else
1160: c = ndl_compare(di,dj);
1161: if ( c > 0 ) {
1162: if ( sum )
1163: HC(gj) = sum;
1164: else
1165: g->body[j] = nd_remove_head(gj);
1166: j = i;
1167: gj = g->body[j];
1168: dj = HDL(gj);
1169: sum = HC(gj);
1170: } else if ( c == 0 ) {
1171: sum = sum+HC(gi)-nd_mod;
1172: if ( sum < 0 )
1173: sum += nd_mod;
1174: g->body[i] = nd_remove_head(gi);
1175: }
1176: }
1177: }
1178: if ( j < 0 )
1179: return -1;
1180: else if ( sum ) {
1181: HC(gj) = sum;
1182: return j;
1183: } else
1184: g->body[j] = nd_remove_head(gj);
1185: }
1186: }
1187:
1188: ND normalize_pbucket(PGeoBucket g)
1189: {
1190: int i;
1191: ND r,t;
1192:
1193: r = 0;
1194: for ( i = 0; i <= g->m; i++ )
1195: r = nd_add(r,g->body[i]);
1196: return r;
1197: }
1198:
1199: ND nd_nf(ND g,int full)
1200: {
1201: ND u,p,d,red;
1202: NODE l;
1203: NM m,mrd;
1204: int sugar,psugar,n,h_reducible,h;
1205: PGeoBucket bucket;
1206:
1207: if ( !g ) {
1208: return 0;
1209: }
1210: sugar = g->sugar;
1211: n = g->nv;
1212: bucket = create_pbucket();
1213: add_pbucket(bucket,g);
1214: d = 0;
1215: while ( 1 ) {
1216: h = head_pbucket(bucket);
1217: if ( h < 0 ) {
1218: if ( d )
1219: d->sugar = sugar;
1220: return d;
1221: }
1222: g = bucket->body[h];
1223: red = nd_find_reducer(g);
1224: if ( red ) {
1225: bucket->body[h] = nd_remove_head(g);
1226: red = nd_remove_head(red);
1227: add_pbucket(bucket,red);
1228: sugar = MAX(sugar,red->sugar);
1229: } else if ( !full ) {
1230: g = normalize_pbucket(bucket);
1231: if ( g )
1232: g->sugar = sugar;
1233: return g;
1234: } else {
1235: m = BDY(g);
1236: if ( NEXT(m) ) {
1237: BDY(g) = NEXT(m); NEXT(m) = 0;
1238: } else {
1239: FREEND(g); g = 0;
1240: }
1241: bucket->body[h] = g;
1242: NEXT(m) = 0;
1243: if ( d ) {
1244: for ( mrd = BDY(d); NEXT(mrd); mrd = NEXT(mrd) );
1245: NEXT(mrd) = m;
1246: } else {
1247: MKND(n,m,d);
1248: }
1249: }
1250: }
1251: }
1252: #endif
1253:
1254: NODE nd_gb(NODE f)
1255: {
1256: int i,nh,sugar,stat;
1257: NODE r,g,gall;
1258: ND_pairs d;
1259: ND_pairs l;
1260: ND h,nf;
1261:
1262: for ( gall = g = 0, d = 0, r = f; r; r = NEXT(r) ) {
1263: i = (int)BDY(r);
1264: d = update_pairs(d,g,i);
1265: g = update_base(g,i);
1266: gall = append_one(gall,i);
1267: }
1268: sugar = 0;
1269: while ( d ) {
1270: again:
1271: l = nd_minp(d,&d);
1272: if ( l->sugar != sugar ) {
1273: sugar = l->sugar;
1274: fprintf(asir_out,"%d",sugar);
1275: }
1276: stat = nd_sp(l,&h);
1277: if ( !stat ) {
1278: NEXT(l) = d; d = l;
1279: d = nd_reconstruct(d);
1280: goto again;
1281: }
1282: stat = nd_nf(h,!Top,&nf);
1283: if ( !stat ) {
1284: NEXT(l) = d; d = l;
1285: d = nd_reconstruct(d);
1286: goto again;
1287: } else if ( nf ) {
1288: printf("+"); fflush(stdout);
1289: nh = nd_newps(nf);
1290: d = update_pairs(d,g,nh);
1291: g = update_base(g,nh);
1292: gall = append_one(gall,nh);
1293: FREENDP(l);
1294: } else {
1295: printf("."); fflush(stdout);
1296: FREENDP(l);
1297: }
1298: }
1299: return g;
1300: }
1301:
1302: ND_pairs update_pairs( ND_pairs d, NODE /* of index */ g, int t)
1303: {
1304: ND_pairs d1,nd,cur,head,prev,remove;
1305:
1306: if ( !g ) return d;
1307: d = crit_B(d,t);
1308: d1 = nd_newpairs(g,t);
1309: d1 = crit_M(d1);
1310: d1 = crit_F(d1);
1311: prev = 0; cur = head = d1;
1312: while ( cur ) {
1313: if ( crit_2( cur->i1,cur->i2 ) ) {
1314: remove = cur;
1315: if ( !prev ) {
1316: head = cur = NEXT(cur);
1317: } else {
1318: cur = NEXT(prev) = NEXT(cur);
1319: }
1320: FREENDP(remove);
1321: } else {
1322: prev = cur;
1323: cur = NEXT(cur);
1324: }
1325: }
1326: if ( !d )
1327: return head;
1328: else {
1329: nd = d;
1330: while ( NEXT(nd) )
1331: nd = NEXT(nd);
1332: NEXT(nd) = head;
1333: return d;
1334: }
1335: }
1336:
1337: ND_pairs nd_newpairs( NODE g, int t )
1338: {
1339: NODE h;
1340: unsigned int *dl;
1341: int td,ts,s;
1342: ND_pairs r,r0;
1343:
1344: dl = HDL(nd_ps[t]);
1345: td = HTD(nd_ps[t]);
1346: ts = nd_ps[t]->sugar - td;
1347: for ( r0 = 0, h = g; h; h = NEXT(h) ) {
1348: NEXTND_pairs(r0,r);
1349: r->i1 = (int)BDY(h);
1350: r->i2 = t;
1351: ndl_lcm(HDL(nd_ps[r->i1]),dl,r->lcm);
1352: r->td = ndl_td(r->lcm);
1353: s = nd_ps[r->i1]->sugar-HTD(nd_ps[r->i1]);
1354: r->sugar = MAX(s,ts) + r->td;
1355: }
1356: NEXT(r) = 0;
1357: return r0;
1358: }
1359:
1360: ND_pairs crit_B( ND_pairs d, int s )
1361: {
1362: ND_pairs cur,head,prev,remove;
1363: unsigned int *t,*tl,*lcm;
1364: int td,tdl;
1365:
1366: if ( !d ) return 0;
1367: t = HDL(nd_ps[s]);
1368: prev = 0;
1369: head = cur = d;
1370: lcm = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int));
1371: while ( cur ) {
1372: tl = cur->lcm;
1373: if ( ndl_reducible(tl,t)
1374: && (ndl_lcm(HDL(nd_ps[cur->i1]),t,lcm),!ndl_equal(lcm,tl))
1375: && (ndl_lcm(HDL(nd_ps[cur->i2]),t,lcm),!ndl_equal(lcm,tl)) ) {
1376: remove = cur;
1377: if ( !prev ) {
1378: head = cur = NEXT(cur);
1379: } else {
1380: cur = NEXT(prev) = NEXT(cur);
1381: }
1382: FREENDP(remove);
1383: } else {
1384: prev = cur;
1385: cur = NEXT(cur);
1386: }
1387: }
1388: return head;
1389: }
1390:
1391: ND_pairs crit_M( ND_pairs d1 )
1392: {
1393: ND_pairs e,d2,d3,dd,p;
1394: unsigned int *id,*jd;
1395: int itd,jtd;
1396:
1397: for ( dd = 0, e = d1; e; e = d3 ) {
1398: if ( !(d2 = NEXT(e)) ) {
1399: NEXT(e) = dd;
1400: return e;
1401: }
1402: id = e->lcm;
1403: itd = e->td;
1404: for ( d3 = 0; d2; d2 = p ) {
1405: p = NEXT(d2),
1406: jd = d2->lcm;
1407: jtd = d2->td;
1408: if ( jtd == itd )
1409: if ( id == jd );
1410: else if ( ndl_reducible(jd,id) ) continue;
1411: else if ( ndl_reducible(id,jd) ) goto delit;
1412: else ;
1413: else if ( jtd > itd )
1414: if ( ndl_reducible(jd,id) ) continue;
1415: else ;
1416: else if ( ndl_reducible(id,jd ) ) goto delit;
1417: NEXT(d2) = d3;
1418: d3 = d2;
1419: }
1420: NEXT(e) = dd;
1421: dd = e;
1422: continue;
1423: /**/
1424: delit: NEXT(d2) = d3;
1425: d3 = d2;
1426: for ( ; p; p = d2 ) {
1427: d2 = NEXT(p);
1428: NEXT(p) = d3;
1429: d3 = p;
1430: }
1431: FREENDP(e);
1432: }
1433: return dd;
1434: }
1435:
1436: ND_pairs crit_F( ND_pairs d1 )
1437: {
1438: ND_pairs rest, head,remove;
1439: ND_pairs last, p, r, w;
1440: int s;
1441:
1442: for ( head = last = 0, p = d1; NEXT(p); ) {
1443: r = w = equivalent_pairs(p,&rest);
1444: s = r->sugar;
1445: w = NEXT(w);
1446: while ( w ) {
1447: if ( crit_2(w->i1,w->i2) ) {
1448: r = w;
1449: w = NEXT(w);
1450: while ( w ) {
1451: remove = w;
1452: w = NEXT(w);
1453: FREENDP(remove);
1454: }
1455: break;
1456: } else if ( w->sugar < s ) {
1457: FREENDP(r);
1458: r = w;
1459: s = r->sugar;
1460: w = NEXT(w);
1461: } else {
1462: remove = w;
1463: w = NEXT(w);
1464: FREENDP(remove);
1465: }
1466: }
1467: if ( last ) NEXT(last) = r;
1468: else head = r;
1469: NEXT(last = r) = 0;
1470: p = rest;
1471: if ( !p ) return head;
1472: }
1473: if ( !last ) return p;
1474: NEXT(last) = p;
1475: return head;
1476: }
1477:
1478: int crit_2( int dp1, int dp2 )
1479: {
1480: return ndl_disjoint(HDL(nd_ps[dp1]),HDL(nd_ps[dp2]));
1481: }
1482:
1483: static ND_pairs equivalent_pairs( ND_pairs d1, ND_pairs *prest )
1484: {
1485: ND_pairs w,p,r,s;
1486: unsigned int *d;
1487: int td;
1488:
1489: w = d1;
1490: d = w->lcm;
1491: td = w->td;
1492: s = NEXT(w);
1493: NEXT(w) = 0;
1494: for ( r = 0; s; s = p ) {
1495: p = NEXT(s);
1496: if ( td == s->td && ndl_equal(d,s->lcm) ) {
1497: NEXT(s) = w;
1498: w = s;
1499: } else {
1500: NEXT(s) = r;
1501: r = s;
1502: }
1503: }
1504: *prest = r;
1505: return w;
1506: }
1507:
1508: NODE update_base(NODE nd,int ndp)
1509: {
1510: unsigned int *dl, *dln;
1511: NODE last, p, head;
1512: int td,tdn;
1513:
1514: dl = HDL(nd_ps[ndp]);
1515: td = HTD(nd_ps[ndp]);
1516: for ( head = last = 0, p = nd; p; ) {
1517: dln = HDL(nd_ps[(int)BDY(p)]);
1518: tdn = HTD(nd_ps[(int)BDY(p)]);
1519: if ( tdn >= td && ndl_reducible( dln, dl ) ) {
1520: p = NEXT(p);
1521: if ( last ) NEXT(last) = p;
1522: } else {
1523: if ( !last ) head = p;
1524: p = NEXT(last = p);
1525: }
1526: }
1527: head = append_one(head,ndp);
1528: return head;
1529: }
1530:
1531: ND_pairs nd_minp( ND_pairs d, ND_pairs *prest )
1532: {
1533: ND_pairs m,ml,p,l;
1534: unsigned int *lcm;
1535: int s,td,len,tlen,c;
1536:
1537: if ( !(p = NEXT(m = d)) ) {
1538: *prest = p;
1539: NEXT(m) = 0;
1540: return m;
1541: }
1542: lcm = m->lcm;
1543: s = m->sugar;
1544: td = m->td;
1.6 noro 1545: len = nd_psl[m->i1]+nd_psl[m->i2];
1.1 noro 1546: for ( ml = 0, l = m; p; p = NEXT(l = p) ) {
1547: if (p->sugar < s)
1548: goto find;
1549: else if ( p->sugar == s ) {
1550: if ( p->td < td )
1551: goto find;
1552: else if ( p->td == td ) {
1553: c = ndl_compare(p->lcm,lcm);
1554: if ( c < 0 )
1555: goto find;
1556: else if ( c == 0 ) {
1.6 noro 1557: tlen = nd_psl[p->i1]+nd_psl[p->i2];
1.1 noro 1558: if ( tlen < len )
1559: goto find;
1560: }
1561: }
1562: }
1563: continue;
1564: find:
1565: ml = l;
1566: m = p;
1567: lcm = m->lcm;
1568: s = m->sugar;
1569: td = m->td;
1570: len = tlen;
1571: }
1572: if ( !ml ) *prest = NEXT(m);
1573: else {
1574: NEXT(ml) = NEXT(m);
1575: *prest = d;
1576: }
1577: NEXT(m) = 0;
1578: return m;
1579: }
1580:
1581: int nd_newps(ND a)
1582: {
1.3 noro 1583: int len;
1584:
1.1 noro 1585: if ( nd_psn == nd_pslen ) {
1586: nd_pslen *= 2;
1587: nd_ps = (ND *)REALLOC((char *)nd_ps,nd_pslen*sizeof(ND));
1.6 noro 1588: nd_psl = (int *)REALLOC((char *)nd_psl,nd_pslen*sizeof(int));
1.4 noro 1589: #if USE_NDV
1.3 noro 1590: nd_psv = (NDV *)REALLOC((char *)nd_psv,nd_pslen*sizeof(NDV));
1.4 noro 1591: #endif
1.1 noro 1592: nd_bound = (unsigned int **)
1593: REALLOC((char *)nd_bound,nd_pslen*sizeof(unsigned int *));
1594: }
1595: nd_monic(a);
1596: nd_ps[nd_psn] = a;
1.6 noro 1597: nd_psl[nd_psn] = nd_length(a);
1.1 noro 1598: nd_bound[nd_psn] = nd_compute_bound(a);
1.5 noro 1599: #if USE_NDV
1.6 noro 1600: nd_psv[nd_psn] = ndtondv(a);
1.3 noro 1601: len = nd_psv[nd_psn]->len;
1602: if ( len > nmv_len ) {
1603: nmv_len = 2*len;
1604: BDY(ndv_red) = (NMV)REALLOC(BDY(ndv_red),nmv_len*nmv_adv);
1605: }
1.4 noro 1606: #endif
1.1 noro 1607: return nd_psn++;
1608: }
1609:
1610: NODE NODE_sortb(NODE f,int);
1611: ND dptond(DP);
1612: DP ndtodp(ND);
1613:
1614: NODE nd_setup(NODE f)
1615: {
1.5 noro 1616: int i,j,td,len,max;
1.1 noro 1617: NODE s,s0,f0;
1.5 noro 1618: unsigned int *d;
1.1 noro 1619:
1620: nd_found = 0;
1621: nd_notfirst = 0;
1622: nd_create = 0;
1623: #if 0
1624: f0 = f = NODE_sortb(f,1);
1625: #endif
1626: nd_psn = length(f); nd_pslen = 2*nd_psn;
1627: nd_ps = (ND *)MALLOC(nd_pslen*sizeof(ND));
1.6 noro 1628: nd_psl = (int *)MALLOC(nd_pslen*sizeof(int));
1.4 noro 1629: #if USE_NDV
1.3 noro 1630: nd_psv = (NDV *)MALLOC(nd_pslen*sizeof(NDV));
1.4 noro 1631: #endif
1.1 noro 1632: nd_bound = (unsigned int **)MALLOC(nd_pslen*sizeof(unsigned int *));
1.5 noro 1633: for ( max = 0, i = 0, s = f; i < nd_psn; i++, s = NEXT(s) ) {
1634: nd_bound[i] = d = dp_compute_bound((DP)BDY(s));
1635: for ( j = 0; j < nd_nvar; j++ )
1636: max = MAX(d[j],max);
1637: }
1638:
1639: if ( max < 2 )
1640: nd_bpe = 2;
1641: else if ( max < 4 )
1642: nd_bpe = 4;
1643: else if ( max < 64 )
1644: nd_bpe = 6;
1645: else if ( max < 256 )
1646: nd_bpe = 8;
1647: else if ( max < 65536 )
1648: nd_bpe = 16;
1649: else
1650: nd_bpe = 32;
1651:
1.1 noro 1652: nd_setup_parameters();
1653: nd_free_private_storage();
1.3 noro 1654: len = 0;
1.1 noro 1655: for ( i = 0; i < nd_psn; i++, f = NEXT(f) ) {
1656: nd_ps[i] = dptond((DP)BDY(f));
1.5 noro 1657: nd_monic(nd_ps[i]);
1.6 noro 1658: nd_psl[i] = nd_length(nd_ps[i]);
1.4 noro 1659: #if USE_NDV
1.3 noro 1660: nd_psv[i] = ndtondv(nd_ps[i]);
1.4 noro 1661: len = MAX(len,nd_psv[i]->len);
1662: #endif
1.1 noro 1663: }
1664: nd_red = (NM *)MALLOC(REDTAB_LEN*sizeof(NM));
1.4 noro 1665: #if USE_NDV
1.3 noro 1666: nmv_len = 16*len;
1667: NEWNDV(ndv_red);
1668: BDY(ndv_red) = (NMV)MALLOC_ATOMIC(nmv_len*nmv_adv);
1.4 noro 1669: #endif
1.1 noro 1670: for ( s0 = 0, i = 0; i < nd_psn; i++ ) {
1671: NEXTNODE(s0,s); BDY(s) = (pointer)i;
1672: }
1673: if ( s0 ) NEXT(s) = 0;
1674: return s0;
1675: }
1676:
1677: void nd_gr(LIST f,LIST v,int m,struct order_spec *ord,LIST *rp)
1678: {
1679: struct order_spec ord1;
1680: VL fv,vv,vc;
1681: NODE fd,fd0,r,r0,t,x,s,xx;
1682: DP a,b,c;
1683:
1684: get_vars((Obj)f,&fv); pltovl(v,&vv);
1685: nd_nvar = length(vv);
1686: if ( ord->id )
1687: error("nd_gr : unsupported order");
1688: switch ( ord->ord.simple ) {
1689: case 0:
1690: is_rlex = 1;
1691: break;
1692: case 1:
1693: is_rlex = 0;
1694: break;
1695: default:
1696: error("nd_gr : unsupported order");
1697: }
1698: initd(ord);
1699: nd_mod = m;
1700: for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
1701: ptod(CO,vv,(P)BDY(t),&b);
1702: _dp_mod(b,m,0,&c);
1703: if ( c ) {
1704: NEXTNODE(fd0,fd); BDY(fd) = (pointer)c;
1705: }
1706: }
1707: if ( fd0 ) NEXT(fd) = 0;
1708: s = nd_setup(fd0);
1709: x = nd_gb(s);
1710: #if 0
1711: x = nd_reduceall(x,m);
1712: #endif
1713: for ( r0 = 0; x; x = NEXT(x) ) {
1714: NEXTNODE(r0,r);
1715: a = ndtodp(nd_ps[(int)BDY(x)]);
1716: _dtop_mod(CO,vv,a,(P *)&BDY(r));
1717: }
1718: if ( r0 ) NEXT(r) = 0;
1719: MKLIST(*rp,r0);
1720: fprintf(asir_out,"found=%d,notfirst=%d,create=%d\n",
1721: nd_found,nd_notfirst,nd_create);
1722: }
1723:
1724: void dltondl(int n,DL dl,unsigned int *r)
1725: {
1726: unsigned int *d;
1727: int i;
1728:
1729: d = dl->d;
1730: bzero(r,nd_wpd*sizeof(unsigned int));
1731: if ( is_rlex )
1732: for ( i = 0; i < n; i++ )
1733: r[(n-1-i)/nd_epw] |= (d[i]<<((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe));
1734: else
1735: for ( i = 0; i < n; i++ )
1736: r[i/nd_epw] |= d[i]<<((nd_epw-(i%nd_epw)-1)*nd_bpe);
1737: }
1738:
1739: DL ndltodl(int n,int td,unsigned int *ndl)
1740: {
1741: DL dl;
1742: int *d;
1743: int i;
1744:
1745: NEWDL(dl,n);
1746: dl->td = td;
1747: d = dl->d;
1748: if ( is_rlex )
1749: for ( i = 0; i < n; i++ )
1750: d[i] = (ndl[(n-1-i)/nd_epw]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe))
1751: &((1<<nd_bpe)-1);
1752: else
1753: for ( i = 0; i < n; i++ )
1754: d[i] = (ndl[i/nd_epw]>>((nd_epw-(i%nd_epw)-1)*nd_bpe))
1755: &((1<<nd_bpe)-1);
1756: return dl;
1757: }
1758:
1759: ND dptond(DP p)
1760: {
1761: ND d;
1762: NM m0,m;
1763: MP t;
1764: int n;
1765:
1766: if ( !p )
1767: return 0;
1768: n = NV(p);
1769: m0 = 0;
1770: for ( t = BDY(p); t; t = NEXT(t) ) {
1771: NEXTNM(m0,m);
1772: m->c = ITOS(t->c);
1773: m->td = t->dl->td;
1774: dltondl(n,t->dl,m->dl);
1775: }
1776: NEXT(m) = 0;
1777: MKND(n,m0,d);
1778: d->nv = n;
1779: d->sugar = p->sugar;
1780: return d;
1781: }
1782:
1783: DP ndtodp(ND p)
1784: {
1785: DP d;
1786: MP m0,m;
1787: NM t;
1788: int n;
1789:
1790: if ( !p )
1791: return 0;
1792: n = NV(p);
1793: m0 = 0;
1794: for ( t = BDY(p); t; t = NEXT(t) ) {
1795: NEXTMP(m0,m);
1796: m->c = STOI(t->c);
1797: m->dl = ndltodl(n,t->td,t->dl);
1798: }
1799: NEXT(m) = 0;
1800: MKDP(n,m0,d);
1801: d->sugar = p->sugar;
1802: return d;
1803: }
1804:
1805: void ndl_print(unsigned int *dl)
1806: {
1807: int n;
1808: int i;
1809:
1810: n = nd_nvar;
1811: printf("<<");
1812: if ( is_rlex )
1813: for ( i = 0; i < n; i++ )
1814: printf(i==n-1?"%d":"%d,",
1815: (dl[(n-1-i)/nd_epw]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe))
1816: &((1<<nd_bpe)-1));
1817: else
1818: for ( i = 0; i < n; i++ )
1819: printf(i==n-1?"%d":"%d,",
1820: (dl[i/nd_epw]>>((nd_epw-(i%nd_epw)-1)*nd_bpe))
1821: &((1<<nd_bpe)-1));
1822: printf(">>");
1823: }
1824:
1825: void nd_print(ND p)
1826: {
1827: NM m;
1828:
1829: if ( !p )
1830: printf("0\n");
1831: else {
1832: for ( m = BDY(p); m; m = NEXT(m) ) {
1833: printf("+%d*",m->c);
1834: ndl_print(m->dl);
1835: }
1836: printf("\n");
1837: }
1838: }
1839:
1840: void ndp_print(ND_pairs d)
1841: {
1842: ND_pairs t;
1843:
1844: for ( t = d; t; t = NEXT(t) ) {
1845: printf("%d,%d ",t->i1,t->i2);
1846: }
1847: printf("\n");
1848: }
1849:
1850: void nd_monic(ND p)
1851: {
1852: if ( !p )
1853: return;
1854: else
1855: nd_mul_c(p,invm(HC(p),nd_mod));
1856: }
1857:
1858: void nd_mul_c(ND p,int mul)
1859: {
1860: NM m;
1861: int c,c1;
1862:
1863: if ( !p )
1864: return;
1865: for ( m = BDY(p); m; m = NEXT(m) ) {
1866: c1 = C(m);
1867: DMAR(c1,mul,0,nd_mod,c);
1868: C(m) = c;
1869: }
1870: }
1871:
1872: void nd_free(ND p)
1873: {
1874: NM t,s;
1875:
1876: if ( !p )
1877: return;
1878: t = BDY(p);
1879: while ( t ) {
1880: s = NEXT(t);
1881: FREENM(t);
1882: t = s;
1883: }
1884: FREEND(p);
1885: }
1886:
1887: void nd_append_red(unsigned int *d,int td,int i)
1888: {
1889: NM m,m0;
1890: int h;
1891:
1892: NEWNM(m);
1893: h = ndl_hash_value(td,d);
1894: m->c = i;
1895: m->td = td;
1.7 ! noro 1896: ndl_copy(d,m->dl);
1.1 noro 1897: NEXT(m) = nd_red[h];
1898: nd_red[h] = m;
1899: }
1900:
1.5 noro 1901: unsigned int *dp_compute_bound(DP p)
1902: {
1903: unsigned int *d,*d1,*d2,*t;
1904: MP m;
1.7 ! noro 1905: int i,l;
1.5 noro 1906:
1907: if ( !p )
1908: return 0;
1909: d1 = (unsigned int *)ALLOCA(nd_nvar*sizeof(unsigned int));
1910: d2 = (unsigned int *)ALLOCA(nd_nvar*sizeof(unsigned int));
1911: m = BDY(p);
1912: bcopy(m->dl->d,d1,nd_nvar*sizeof(unsigned int));
1913: for ( m = NEXT(BDY(p)); m; m = NEXT(m) ) {
1914: d = m->dl->d;
1915: for ( i = 0; i < nd_nvar; i++ )
1916: d2[i] = d[i] > d1[i] ? d[i] : d1[i];
1917: t = d1; d1 = d2; d2 = t;
1918: }
1.7 ! noro 1919: l = ((nd_nvar+(sizeof(unsigned int)-1))/sizeof(unsigned int))*sizeof(unsigned int);
! 1920: t = (unsigned int *)MALLOC_ATOMIC(l*sizeof(unsigned int));
! 1921: bzero(t,l*sizeof(unsigned int));
1.5 noro 1922: bcopy(d1,t,nd_nvar*sizeof(unsigned int));
1923: return t;
1924: }
1925:
1.1 noro 1926: unsigned int *nd_compute_bound(ND p)
1927: {
1928: unsigned int *d1,*d2,*t;
1.5 noro 1929: int i;
1.1 noro 1930: NM m;
1931:
1932: if ( !p )
1933: return 0;
1934: d1 = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int));
1935: d2 = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int));
1936: bcopy(HDL(p),d1,nd_wpd*sizeof(unsigned int));
1937: for ( m = NEXT(BDY(p)); m; m = NEXT(m) ) {
1938: ndl_lcm(m->dl,d1,d2);
1939: t = d1; d1 = d2; d2 = t;
1940: }
1.5 noro 1941: t = (unsigned int *)MALLOC_ATOMIC(nd_nvar*sizeof(unsigned int));
1942: bzero(t,nd_nvar*sizeof(unsigned int));
1943: for ( i = 0; i < nd_nvar; i++ )
1944: t[i] = (d1[i/nd_epw]>>((nd_epw-(i%nd_epw)-1)*nd_bpe))&nd_mask0;
1.1 noro 1945: return t;
1946: }
1947:
1948: void nd_setup_parameters() {
1949: int i;
1950:
1951: nd_epw = (sizeof(unsigned int)*8)/nd_bpe;
1952: nd_wpd = nd_nvar/nd_epw+(nd_nvar%nd_epw?1:0);
1953: if ( nd_bpe < 32 ) {
1954: nd_mask0 = (1<<nd_bpe)-1;
1955: } else {
1956: nd_mask0 = 0xffffffff;
1957: }
1958: bzero(nd_mask,sizeof(nd_mask));
1959: nd_mask1 = 0;
1960: for ( i = 0; i < nd_epw; i++ ) {
1961: nd_mask[nd_epw-i-1] = (nd_mask0<<(i*nd_bpe));
1962: nd_mask1 |= (1<<(nd_bpe-1))<<(i*nd_bpe);
1963: }
1.4 noro 1964: #if USE_NDV
1.3 noro 1965: nmv_adv = sizeof(struct oNMV)+(nd_wpd-1)*sizeof(unsigned int);
1.4 noro 1966: #endif
1.1 noro 1967: }
1968:
1969: ND_pairs nd_reconstruct(ND_pairs d)
1970: {
1971: int i,obpe;
1.6 noro 1972: NM prev_nm_free_list,mr0,mr,m;
1.1 noro 1973: ND_pairs s0,s,t,prev_ndp_free_list;
1974:
1975: obpe = nd_bpe;
1.5 noro 1976: if ( obpe < 4 )
1977: nd_bpe = 4;
1978: else if ( obpe < 6 )
1979: nd_bpe = 6;
1980: else if ( obpe < 8 )
1981: nd_bpe = 8;
1982: else if ( obpe < 16 )
1983: nd_bpe = 16;
1984: else if ( obpe < 32 )
1985: nd_bpe = 32;
1986: else
1987: error("nd_reconstruct : exponent too large");
1988:
1.1 noro 1989: nd_setup_parameters();
1990: prev_nm_free_list = _nm_free_list;
1991: prev_ndp_free_list = _ndp_free_list;
1992: _nm_free_list = 0;
1993: _ndp_free_list = 0;
1994: for ( i = 0; i < nd_psn; i++ ) {
1995: nd_ps[i] = nd_dup(nd_ps[i],obpe);
1.4 noro 1996: #if USE_NDV
1.3 noro 1997: nd_psv[i] = ndtondv(nd_ps[i]);
1.4 noro 1998: #endif
1.1 noro 1999: }
2000: s0 = 0;
2001: for ( t = d; t; t = NEXT(t) ) {
2002: NEXTND_pairs(s0,s);
2003: s->i1 = t->i1;
2004: s->i2 = t->i2;
2005: s->td = t->td;
2006: s->sugar = t->sugar;
2007: ndl_dup(obpe,t->lcm,s->lcm);
2008: }
1.6 noro 2009: for ( i = 0; i < REDTAB_LEN; i++ ) {
2010: for ( mr0 = 0, m = nd_red[i]; m; m = NEXT(m) ) {
2011: NEXTNM(mr0,mr);
2012: mr->c = m->c;
2013: mr->td = m->td;
2014: ndl_dup(obpe,m->dl,mr->dl);
2015: }
2016: if ( mr0 ) NEXT(mr) = 0;
2017: nd_red[i] = mr0;
2018: }
1.1 noro 2019: if ( s0 ) NEXT(s) = 0;
2020: prev_nm_free_list = 0;
2021: prev_ndp_free_list = 0;
1.4 noro 2022: #if USE_NDV
1.3 noro 2023: BDY(ndv_red) = (NMV)REALLOC(BDY(ndv_red),nmv_len*nmv_adv);
1.4 noro 2024: #endif
1.1 noro 2025: GC_gcollect();
2026: return s0;
2027: }
2028:
2029: void ndl_dup(int obpe,unsigned int *d,unsigned int *r)
2030: {
2031: int n,i,ei,oepw,cepw,cbpe;
2032:
2033: n = nd_nvar;
2034: oepw = (sizeof(unsigned int)*8)/obpe;
2035: cepw = nd_epw;
2036: cbpe = nd_bpe;
2037: if ( is_rlex )
2038: for ( i = 0; i < n; i++ ) {
2039: ei = (d[(n-1-i)/oepw]>>((oepw-((n-1-i)%oepw)-1)*obpe))
2040: &((1<<obpe)-1);
2041: r[(n-1-i)/cepw] |= (ei<<((cepw-((n-1-i)%cepw)-1)*cbpe));
2042: }
2043: else
2044: for ( i = 0; i < n; i++ ) {
2045: ei = (d[i/oepw]>>((oepw-(i%oepw)-1)*obpe))
2046: &((1<<obpe)-1);
2047: r[i/cepw] |= (ei<<((cepw-(i%cepw)-1)*cbpe));
2048: }
2049: }
2050:
2051: ND nd_dup(ND p,int obpe)
2052: {
2053: NM m,mr,mr0;
2054: int c,n;
2055: ND r;
2056:
2057: if ( !p )
2058: return 0;
2059: else {
2060: n = NV(p); m = BDY(p);
2061: for ( mr0 = 0; m; m = NEXT(m) ) {
2062: NEXTNM(mr0,mr);
2063: C(mr) = C(m);
2064: mr->td = m->td;
2065: ndl_dup(obpe,m->dl,mr->dl);
2066: }
2067: NEXT(mr) = 0;
2068: MKND(NV(p),mr0,r);
2069: r->sugar = p->sugar;
2070: return r;
2071: }
2072: }
1.3 noro 2073:
1.6 noro 2074: ND nd_copy(ND p)
2075: {
2076: NM m,mr,mr0;
2077: int c,n,s;
2078: ND r;
2079:
2080: if ( !p )
2081: return 0;
2082: else {
2083: s = sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int);
2084: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
2085: NEXTNM(mr0,mr);
2086: C(mr) = C(m);
2087: mr->td = m->td;
2088: ndl_copy(m->dl,mr->dl);
2089: }
2090: NEXT(mr) = 0;
2091: MKND(NV(p),mr0,r);
2092: r->sugar = p->sugar;
2093: return r;
2094: }
2095: }
2096:
1.4 noro 2097: #if USE_NDV
2098: void ndv_mul_nm(NDV p,NM m0,NDV r)
2099: {
2100: NMV m,mr,mr0;
2101: unsigned int *d,*dt,*dm;
2102: int c,n,td,i,c1,c2,len;
2103:
2104: if ( !p )
2105: /* XXX */
2106: r->len = 0;
2107: else {
2108: n = NV(p); m = BDY(p); len = p->len;
2109: d = m0->dl; td = m0->td; c = C(m0);
2110: mr = BDY(r);
2111: for ( i = 0; i < len; i++, NMV_ADV(m), NMV_ADV(mr) ) {
2112: c1 = C(m);
2113: DMAR(c1,c,0,nd_mod,c2);
2114: C(mr) = c2;
2115: mr->td = m->td+td;
2116: ndl_add(m->dl,d,mr->dl);
2117: }
2118: NV(r) = NV(p);
2119: r->len = p->len;
2120: r->sugar = p->sugar + td;
2121: }
2122: }
2123:
2124: ND ndv_add(ND p1,NDV p2)
2125: {
2126: int c,c1,c2,t,td,td2,mul,len,i;
2127: NM prev,head,cur,new;
2128: unsigned int *d;
2129: NMV m2;
2130:
2131: if ( !p1 )
2132: return 0;
2133: else {
2134: prev = 0; head = cur = BDY(p1);
2135: NEWNM(new);
2136: len = p2->len;
2137: for ( m2 = BDY(p2), i = 0; i < len; ) {
2138: td2 = new->td = m2->td;
2139: if ( !cur ) {
2140: C(new) = C(m2);
1.6 noro 2141: ndl_copy(m2->dl,new->dl);
1.4 noro 2142: if ( !prev ) {
2143: prev = new;
2144: NEXT(prev) = 0;
2145: head = prev;
2146: } else {
2147: NEXT(prev) = new;
2148: NEXT(new) = 0;
2149: prev = new;
2150: }
2151: NMV_ADV(m2); i++;
2152: NEWNM(new);
2153: continue;
2154: }
2155: if ( cur->td > td2 )
2156: c = 1;
2157: else if ( cur->td < td2 )
2158: c = -1;
2159: else
2160: c = ndl_compare(cur->dl,m2->dl);
2161: switch ( c ) {
2162: case 0:
2163: t = C(m2)+C(cur)-nd_mod;
2164: if ( t < 0 )
2165: t += nd_mod;
2166: if ( t )
2167: C(cur) = t;
2168: else if ( !prev ) {
2169: head = NEXT(cur);
2170: FREENM(cur);
2171: cur = head;
2172: } else {
2173: NEXT(prev) = NEXT(cur);
2174: FREENM(cur);
2175: cur = NEXT(prev);
2176: }
2177: NMV_ADV(m2); i++;
2178: break;
2179: case 1:
2180: prev = cur;
2181: cur = NEXT(cur);
2182: break;
2183: case -1:
1.6 noro 2184: ndl_copy(m2->dl,new->dl);
1.4 noro 2185: if ( !prev ) {
2186: /* cur = head */
2187: prev = new;
2188: C(prev) = C(m2);
2189: NEXT(prev) = head;
2190: head = prev;
2191: } else {
2192: C(new) = C(m2);
2193: NEXT(prev) = new;
2194: NEXT(new) = cur;
2195: prev = new;
2196: }
2197: NEWNM(new);
2198: NMV_ADV(m2); i++;
2199: break;
2200: }
2201: }
2202: FREENM(new);
2203: if ( head ) {
2204: BDY(p1) = head;
2205: p1->sugar = MAX(p1->sugar,p2->sugar+td);
2206: return p1;
2207: } else {
2208: FREEND(p1);
2209: return 0;
2210: }
2211:
2212: }
2213: }
2214:
1.3 noro 2215: NDV ndtondv(ND p)
2216: {
2217: NDV d;
2218: NMV m,m0;
2219: NM t;
2220: int i,len;
2221:
2222: if ( !p )
2223: return 0;
2224: len = nd_length(p);
2225: m0 = m = (NMV)MALLOC_ATOMIC(len*nmv_adv);
2226: for ( t = BDY(p), i = 0; t; t = NEXT(t), i++, NMV_ADV(m) ) {
2227: m->td = t->td;
1.7 ! noro 2228: ndl_copy(t->dl,m->dl);
1.3 noro 2229: m->c = t->c;
2230: }
2231: MKNDV(NV(p),m0,len,d);
2232: d->sugar = p->sugar;
2233: return d;
2234: }
2235:
2236: void ndv_print(NDV p)
2237: {
2238: NMV m;
2239: int i,len;
2240:
2241: if ( !p )
2242: printf("0\n");
2243: else {
2244: len = p->len;
2245: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
2246: printf("+%d*",m->c);
2247: ndl_print(m->dl);
2248: }
2249: printf("\n");
2250: }
2251: }
1.4 noro 2252: #endif