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