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