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