Annotation of OpenXM_contrib2/asir2000/engine/nd.c, Revision 1.98
1.98 ! noro 1: /* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.97 2004/03/25 01:31:03 noro Exp $ */
1.2 noro 2:
1.94 noro 3: #include "nd.h"
1.63 noro 4:
1.61 noro 5: int (*ndl_compare_function)(UINT *a1,UINT *a2);
1.94 noro 6: int nd_dcomp;
7: NM _nm_free_list;
8: ND _nd_free_list;
9: ND_pairs _ndp_free_list;
1.32 noro 10:
1.74 noro 11: static int ndv_alloc;
1.87 noro 12: #if 1
1.69 noro 13: static int nd_f4_nsp=0x7fffffff;
1.87 noro 14: #else
15: static int nd_f4_nsp=50;
16: #endif
1.42 noro 17: static double nd_scale=2;
1.61 noro 18: static UINT **nd_bound;
1.42 noro 19: static struct order_spec *nd_ord;
20: static EPOS nd_epos;
1.43 noro 21: static BlockMask nd_blockmask;
1.42 noro 22: static int nd_nvar;
23: static int nd_isrlex;
24: static int nd_epw,nd_bpe,nd_wpd,nd_exporigin;
1.61 noro 25: static UINT nd_mask[32];
26: static UINT nd_mask0,nd_mask1;
1.42 noro 27:
1.20 noro 28: static NDV *nd_ps;
1.53 noro 29: static NDV *nd_ps_trace;
1.42 noro 30: static RHist *nd_psh;
31: static int nd_psn,nd_pslen;
32: static RHist *nd_red;
1.96 noro 33: static int *nd_work_vector;
34: static int **nd_matrix;
35: static int nd_matrix_len;
1.97 noro 36: static struct weight_or_block *nd_worb;
37: static int nd_worb_len;
1.42 noro 38: static int nd_found,nd_create,nd_notfirst;
39: static int nmv_adv;
1.77 noro 40: static int nd_demand;
1.1 noro 41:
42: void nd_free_private_storage()
43: {
44: _nm_free_list = 0;
1.5 noro 45: _ndp_free_list = 0;
1.71 noro 46: #if 0
1.1 noro 47: GC_gcollect();
1.71 noro 48: #endif
1.1 noro 49: }
50:
51: void _NM_alloc()
52: {
53: NM p;
54: int i;
55:
1.11 noro 56: for ( i = 0; i < 1024; i++ ) {
1.61 noro 57: p = (NM)GC_malloc(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT));
1.1 noro 58: p->next = _nm_free_list; _nm_free_list = p;
59: }
60: }
61:
62: void _ND_alloc()
63: {
64: ND p;
65: int i;
66:
67: for ( i = 0; i < 1024; i++ ) {
68: p = (ND)GC_malloc(sizeof(struct oND));
69: p->body = (NM)_nd_free_list; _nd_free_list = p;
70: }
71: }
72:
73: void _NDP_alloc()
74: {
75: ND_pairs p;
76: int i;
77:
1.11 noro 78: for ( i = 0; i < 1024; i++ ) {
1.1 noro 79: p = (ND_pairs)GC_malloc(sizeof(struct oND_pairs)
1.61 noro 80: +(nd_wpd-1)*sizeof(UINT));
1.1 noro 81: p->next = _ndp_free_list; _ndp_free_list = p;
82: }
83: }
84:
1.30 noro 85: INLINE int nd_length(ND p)
1.1 noro 86: {
87: NM m;
88: int i;
89:
90: if ( !p )
91: return 0;
92: else {
93: for ( i = 0, m = BDY(p); m; m = NEXT(m), i++ );
94: return i;
95: }
96: }
97:
1.61 noro 98: INLINE int ndl_reducible(UINT *d1,UINT *d2)
1.1 noro 99: {
1.61 noro 100: UINT u1,u2;
1.1 noro 101: int i,j;
102:
1.34 noro 103: if ( TD(d1) < TD(d2) ) return 0;
1.65 noro 104: #if USE_UNROLL
1.1 noro 105: switch ( nd_bpe ) {
1.62 noro 106: case 3:
107: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
108: u1 = d1[i]; u2 = d2[i];
109: if ( (u1&0x38000000) < (u2&0x38000000) ) return 0;
110: if ( (u1& 0x7000000) < (u2& 0x7000000) ) return 0;
111: if ( (u1& 0xe00000) < (u2& 0xe00000) ) return 0;
112: if ( (u1& 0x1c0000) < (u2& 0x1c0000) ) return 0;
113: if ( (u1& 0x38000) < (u2& 0x38000) ) return 0;
114: if ( (u1& 0x7000) < (u2& 0x7000) ) return 0;
115: if ( (u1& 0xe00) < (u2& 0xe00) ) return 0;
116: if ( (u1& 0x1c0) < (u2& 0x1c0) ) return 0;
117: if ( (u1& 0x38) < (u2& 0x38) ) return 0;
118: if ( (u1& 0x7) < (u2& 0x7) ) return 0;
119: }
120: return 1;
121: break;
1.1 noro 122: case 4:
1.41 noro 123: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 124: u1 = d1[i]; u2 = d2[i];
125: if ( (u1&0xf0000000) < (u2&0xf0000000) ) return 0;
1.62 noro 126: if ( (u1& 0xf000000) < (u2& 0xf000000) ) return 0;
127: if ( (u1& 0xf00000) < (u2& 0xf00000) ) return 0;
128: if ( (u1& 0xf0000) < (u2& 0xf0000) ) return 0;
129: if ( (u1& 0xf000) < (u2& 0xf000) ) return 0;
130: if ( (u1& 0xf00) < (u2& 0xf00) ) return 0;
131: if ( (u1& 0xf0) < (u2& 0xf0) ) return 0;
132: if ( (u1& 0xf) < (u2& 0xf) ) return 0;
1.1 noro 133: }
134: return 1;
135: break;
136: case 6:
1.41 noro 137: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 138: u1 = d1[i]; u2 = d2[i];
139: if ( (u1&0x3f000000) < (u2&0x3f000000) ) return 0;
1.62 noro 140: if ( (u1& 0xfc0000) < (u2& 0xfc0000) ) return 0;
141: if ( (u1& 0x3f000) < (u2& 0x3f000) ) return 0;
142: if ( (u1& 0xfc0) < (u2& 0xfc0) ) return 0;
143: if ( (u1& 0x3f) < (u2& 0x3f) ) return 0;
1.1 noro 144: }
145: return 1;
146: break;
147: case 8:
1.41 noro 148: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 149: u1 = d1[i]; u2 = d2[i];
150: if ( (u1&0xff000000) < (u2&0xff000000) ) return 0;
1.62 noro 151: if ( (u1& 0xff0000) < (u2& 0xff0000) ) return 0;
152: if ( (u1& 0xff00) < (u2& 0xff00) ) return 0;
153: if ( (u1& 0xff) < (u2& 0xff) ) return 0;
1.1 noro 154: }
155: return 1;
156: break;
157: case 16:
1.41 noro 158: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 159: u1 = d1[i]; u2 = d2[i];
160: if ( (u1&0xffff0000) < (u2&0xffff0000) ) return 0;
1.62 noro 161: if ( (u1& 0xffff) < (u2& 0xffff) ) return 0;
1.1 noro 162: }
163: return 1;
164: break;
165: case 32:
1.41 noro 166: for ( i = nd_exporigin; i < nd_wpd; i++ )
1.1 noro 167: if ( d1[i] < d2[i] ) return 0;
168: return 1;
169: break;
170: default:
1.41 noro 171: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 172: u1 = d1[i]; u2 = d2[i];
173: for ( j = 0; j < nd_epw; j++ )
174: if ( (u1&nd_mask[j]) < (u2&nd_mask[j]) ) return 0;
175: }
176: return 1;
177: }
1.65 noro 178: #else
179: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
180: u1 = d1[i]; u2 = d2[i];
181: for ( j = 0; j < nd_epw; j++ )
182: if ( (u1&nd_mask[j]) < (u2&nd_mask[j]) ) return 0;
183: }
184: return 1;
185: #endif
1.1 noro 186: }
187:
1.61 noro 188: /*
189: * If the current order is a block order,
190: * then the last block is length 1 and contains
191: * the homo variable. Otherwise, the original
192: * order is either 0 or 2.
193: */
194:
195: void ndl_homogenize(UINT *d,UINT *r,int obpe,EPOS oepos,int weight)
1.23 noro 196: {
1.61 noro 197: int w,i,e,n,omask0;
198:
199: omask0 = (1<<obpe)-1;
200: n = nd_nvar-1;
201: ndl_zero(r);
202: for ( i = 0; i < n; i++ ) {
203: e = GET_EXP_OLD(d,i);
204: PUT_EXP(r,i,e);
205: }
206: w = TD(d);
207: PUT_EXP(r,nd_nvar-1,weight-w);
208: TD(r) = weight;
209: if ( nd_blockmask ) ndl_weight_mask(r);
210: }
211:
212: void ndl_dehomogenize(UINT *d)
213: {
214: UINT mask;
215: UINT h;
1.31 noro 216: int i,bits;
1.23 noro 217:
1.44 noro 218: if ( nd_blockmask ) {
219: h = GET_EXP(d,nd_nvar-1);
1.45 noro 220: XOR_EXP(d,nd_nvar-1,h);
1.44 noro 221: TD(d) -= h;
222: d[nd_exporigin-1] -= h;
223: } else {
224: if ( nd_isrlex ) {
225: if ( nd_bpe == 32 ) {
226: h = d[nd_exporigin];
227: for ( i = nd_exporigin+1; i < nd_wpd; i++ )
228: d[i-1] = d[i];
229: d[i-1] = 0;
230: TD(d) -= h;
231: } else {
232: bits = nd_epw*nd_bpe;
233: mask = bits==32?0xffffffff:((1<<(nd_epw*nd_bpe))-1);
234: h = (d[nd_exporigin]>>((nd_epw-1)*nd_bpe))&nd_mask0;
235: for ( i = nd_exporigin; i < nd_wpd; i++ )
236: d[i] = ((d[i]<<nd_bpe)&mask)
237: |(i+1<nd_wpd?((d[i+1]>>((nd_epw-1)*nd_bpe))&nd_mask0):0);
238: TD(d) -= h;
239: }
1.45 noro 240: } else {
241: h = GET_EXP(d,nd_nvar-1);
242: XOR_EXP(d,nd_nvar-1,h);
243: TD(d) -= h;
244: }
1.44 noro 245: }
1.23 noro 246: }
247:
1.61 noro 248: void ndl_lcm(UINT *d1,unsigned *d2,UINT *d)
1.1 noro 249: {
1.61 noro 250: UINT t1,t2,u,u1,u2;
1.43 noro 251: int i,j,l;
1.1 noro 252:
1.65 noro 253: #if USE_UNROLL
1.1 noro 254: switch ( nd_bpe ) {
1.62 noro 255: case 3:
256: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
257: u1 = d1[i]; u2 = d2[i];
258: t1 = (u1&0x38000000); t2 = (u2&0x38000000); u = t1>t2?t1:t2;
259: t1 = (u1& 0x7000000); t2 = (u2& 0x7000000); u |= t1>t2?t1:t2;
260: t1 = (u1& 0xe00000); t2 = (u2& 0xe00000); u |= t1>t2?t1:t2;
261: t1 = (u1& 0x1c0000); t2 = (u2& 0x1c0000); u |= t1>t2?t1:t2;
262: t1 = (u1& 0x38000); t2 = (u2& 0x38000); u |= t1>t2?t1:t2;
263: t1 = (u1& 0x7000); t2 = (u2& 0x7000); u |= t1>t2?t1:t2;
264: t1 = (u1& 0xe00); t2 = (u2& 0xe00); u |= t1>t2?t1:t2;
265: t1 = (u1& 0x1c0); t2 = (u2& 0x1c0); u |= t1>t2?t1:t2;
266: t1 = (u1& 0x38); t2 = (u2& 0x38); u |= t1>t2?t1:t2;
267: t1 = (u1& 0x7); t2 = (u2& 0x7); u |= t1>t2?t1:t2;
268: d[i] = u;
269: }
270: break;
1.1 noro 271: case 4:
1.41 noro 272: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 273: u1 = d1[i]; u2 = d2[i];
274: t1 = (u1&0xf0000000); t2 = (u2&0xf0000000); u = t1>t2?t1:t2;
1.62 noro 275: t1 = (u1& 0xf000000); t2 = (u2& 0xf000000); u |= t1>t2?t1:t2;
276: t1 = (u1& 0xf00000); t2 = (u2& 0xf00000); u |= t1>t2?t1:t2;
277: t1 = (u1& 0xf0000); t2 = (u2& 0xf0000); u |= t1>t2?t1:t2;
278: t1 = (u1& 0xf000); t2 = (u2& 0xf000); u |= t1>t2?t1:t2;
279: t1 = (u1& 0xf00); t2 = (u2& 0xf00); u |= t1>t2?t1:t2;
280: t1 = (u1& 0xf0); t2 = (u2& 0xf0); u |= t1>t2?t1:t2;
281: t1 = (u1& 0xf); t2 = (u2& 0xf); u |= t1>t2?t1:t2;
1.1 noro 282: d[i] = u;
283: }
284: break;
285: case 6:
1.41 noro 286: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 287: u1 = d1[i]; u2 = d2[i];
288: t1 = (u1&0x3f000000); t2 = (u2&0x3f000000); u = t1>t2?t1:t2;
1.62 noro 289: t1 = (u1& 0xfc0000); t2 = (u2& 0xfc0000); u |= t1>t2?t1:t2;
290: t1 = (u1& 0x3f000); t2 = (u2& 0x3f000); u |= t1>t2?t1:t2;
291: t1 = (u1& 0xfc0); t2 = (u2& 0xfc0); u |= t1>t2?t1:t2;
292: t1 = (u1& 0x3f); t2 = (u2& 0x3f); u |= t1>t2?t1:t2;
1.1 noro 293: d[i] = u;
294: }
295: break;
296: case 8:
1.41 noro 297: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 298: u1 = d1[i]; u2 = d2[i];
299: t1 = (u1&0xff000000); t2 = (u2&0xff000000); u = t1>t2?t1:t2;
1.62 noro 300: t1 = (u1& 0xff0000); t2 = (u2& 0xff0000); u |= t1>t2?t1:t2;
301: t1 = (u1& 0xff00); t2 = (u2& 0xff00); u |= t1>t2?t1:t2;
302: t1 = (u1& 0xff); t2 = (u2& 0xff); u |= t1>t2?t1:t2;
1.1 noro 303: d[i] = u;
304: }
305: break;
306: case 16:
1.41 noro 307: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 308: u1 = d1[i]; u2 = d2[i];
309: t1 = (u1&0xffff0000); t2 = (u2&0xffff0000); u = t1>t2?t1:t2;
1.62 noro 310: t1 = (u1& 0xffff); t2 = (u2& 0xffff); u |= t1>t2?t1:t2;
1.1 noro 311: d[i] = u;
312: }
313: break;
314: case 32:
1.41 noro 315: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 316: u1 = d1[i]; u2 = d2[i];
317: d[i] = u1>u2?u1:u2;
318: }
319: break;
320: default:
1.41 noro 321: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 322: u1 = d1[i]; u2 = d2[i];
323: for ( j = 0, u = 0; j < nd_epw; j++ ) {
324: t1 = (u1&nd_mask[j]); t2 = (u2&nd_mask[j]); u |= t1>t2?t1:t2;
325: }
326: d[i] = u;
327: }
328: break;
329: }
1.65 noro 330: #else
331: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
332: u1 = d1[i]; u2 = d2[i];
333: for ( j = 0, u = 0; j < nd_epw; j++ ) {
334: t1 = (u1&nd_mask[j]); t2 = (u2&nd_mask[j]); u |= t1>t2?t1:t2;
335: }
336: d[i] = u;
337: }
338: #endif
1.39 noro 339: TD(d) = ndl_weight(d);
1.61 noro 340: if ( nd_blockmask ) ndl_weight_mask(d);
1.57 noro 341: }
342:
1.61 noro 343: int ndl_weight(UINT *d)
1.1 noro 344: {
1.61 noro 345: UINT t,u;
1.1 noro 346: int i,j;
347:
1.60 noro 348: if ( current_dl_weight_vector )
349: for ( i = 0, t = 0; i < nd_nvar; i++ ) {
350: u = GET_EXP(d,i);
351: t += MUL_WEIGHT(u,i);
352: }
353: else
354: for ( t = 0, i = nd_exporigin; i < nd_wpd; i++ ) {
355: u = d[i];
356: for ( j = 0; j < nd_epw; j++, u>>=nd_bpe )
357: t += (u&nd_mask0);
358: }
1.1 noro 359: return t;
360: }
361:
1.61 noro 362: void ndl_weight_mask(UINT *d)
1.43 noro 363: {
1.61 noro 364: UINT t,u;
365: UINT *mask;
366: int i,j,k,l;
1.43 noro 367:
1.61 noro 368: l = nd_blockmask->n;
369: for ( k = 0; k < l; k++ ) {
370: mask = nd_blockmask->mask[k];
371: if ( current_dl_weight_vector )
372: for ( i = 0, t = 0; i < nd_nvar; i++ ) {
373: u = GET_EXP_MASK(d,i,mask);
374: t += MUL_WEIGHT(u,i);
375: }
376: else
377: for ( t = 0, i = nd_exporigin; i < nd_wpd; i++ ) {
378: u = d[i]&mask[i];
379: for ( j = 0; j < nd_epw; j++, u>>=nd_bpe )
380: t += (u&nd_mask0);
381: }
382: d[k+1] = t;
383: }
1.43 noro 384: }
385:
1.61 noro 386: int ndl_lex_compare(UINT *d1,UINT *d2)
1.1 noro 387: {
388: int i;
389:
1.41 noro 390: d1 += nd_exporigin;
391: d2 += nd_exporigin;
392: for ( i = nd_exporigin; i < nd_wpd; i++, d1++, d2++ )
1.1 noro 393: if ( *d1 > *d2 )
1.32 noro 394: return nd_isrlex ? -1 : 1;
1.1 noro 395: else if ( *d1 < *d2 )
1.32 noro 396: return nd_isrlex ? 1 : -1;
1.1 noro 397: return 0;
398: }
399:
1.61 noro 400: int ndl_block_compare(UINT *d1,UINT *d2)
1.43 noro 401: {
402: int i,l,j,ord_o,ord_l;
403: struct order_pair *op;
1.61 noro 404: UINT t1,t2,m;
405: UINT *mask;
1.43 noro 406:
407: l = nd_blockmask->n;
408: op = nd_blockmask->order_pair;
409: for ( j = 0; j < l; j++ ) {
410: mask = nd_blockmask->mask[j];
411: ord_o = op[j].order;
412: if ( ord_o < 2 )
1.44 noro 413: if ( (t1=d1[j+1]) > (t2=d2[j+1]) ) return 1;
414: else if ( t1 < t2 ) return -1;
1.43 noro 415: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.44 noro 416: m = mask[i];
417: t1 = d1[i]&m;
418: t2 = d2[i]&m;
1.43 noro 419: if ( t1 > t2 )
420: return !ord_o ? -1 : 1;
421: else if ( t1 < t2 )
422: return !ord_o ? 1 : -1;
423: }
424: }
425: return 0;
426: }
427:
1.96 noro 428: int ndl_matrix_compare(UINT *d1,UINT *d2)
429: {
430: int i,j,s;
431: int *v;
432:
433: for ( j = 0; j < nd_nvar; j++ )
434: nd_work_vector[j] = GET_EXP(d1,j)-GET_EXP(d2,j);
435: for ( i = 0; i < nd_matrix_len; i++ ) {
436: v = nd_matrix[i];
437: for ( j = 0, s = 0; j < nd_nvar; j++ )
438: s += v[j]*nd_work_vector[j];
439: if ( s > 0 ) return 1;
440: else if ( s < 0 ) return -1;
441: }
442: return 0;
443: }
444:
1.97 noro 445: int ndl_composite_compare(UINT *d1,UINT *d2)
446: {
447: int i,j,s,start,end,len,o;
448: int *v;
449: struct sparse_weight *sw;
450:
451: for ( j = 0; j < nd_nvar; j++ )
452: nd_work_vector[j] = GET_EXP(d1,j)-GET_EXP(d2,j);
453: for ( i = 0; i < nd_worb_len; i++ ) {
454: len = nd_worb[i].length;
455: switch ( nd_worb[i].type ) {
456: case IS_DENSE_WEIGHT:
457: v = nd_worb[i].body.dense_weight;
458: for ( j = 0, s = 0; j < len; j++ )
459: s += v[j]*nd_work_vector[j];
460: if ( s > 0 ) return 1;
461: else if ( s < 0 ) return -1;
462: break;
463: case IS_SPARSE_WEIGHT:
464: sw = nd_worb[i].body.sparse_weight;
465: for ( j = 0, s = 0; j < len; j++ )
466: s += sw[j].value*nd_work_vector[sw[j].pos];
467: if ( s > 0 ) return 1;
468: else if ( s < 0 ) return -1;
469: break;
470: case IS_BLOCK:
471: o = nd_worb[i].body.block.order;
472: start = nd_worb[i].body.block.start;
473: switch ( o ) {
474: case 0:
475: end = start+len;
476: for ( j = start, s = 0; j < end; j++ )
477: s += MUL_WEIGHT(nd_work_vector[j],j);
478: if ( s > 0 ) return 1;
479: else if ( s < 0 ) return -1;
480: for ( j = end-1; j >= start; j-- )
481: if ( nd_work_vector[j] < 0 ) return 1;
482: else if ( nd_work_vector[j] > 0 ) return -1;
483: break;
484: case 1:
485: end = start+len;
486: for ( j = start, s = 0; j < end; j++ )
487: s += MUL_WEIGHT(nd_work_vector[j],j);
488: if ( s > 0 ) return 1;
489: else if ( s < 0 ) return -1;
490: for ( j = start; j < end; j++ )
491: if ( nd_work_vector[j] > 0 ) return 1;
492: else if ( nd_work_vector[j] < 0 ) return -1;
493: break;
494: case 2:
495: for ( j = start; j < end; j++ )
496: if ( nd_work_vector[j] > 0 ) return 1;
497: else if ( nd_work_vector[j] < 0 ) return -1;
498: break;
499: }
500: break;
501: }
502: }
503: return 0;
504: }
505:
1.58 noro 506: /* TDH -> WW -> TD-> RL */
507:
1.61 noro 508: int ndl_ww_lex_compare(UINT *d1,UINT *d2)
1.58 noro 509: {
510: int i,m,e1,e2;
511:
512: if ( TD(d1) > TD(d2) ) return 1;
513: else if ( TD(d1) < TD(d2) ) return -1;
514: m = nd_nvar>>1;
515: for ( i = 0, e1 = e2 = 0; i < m; i++ ) {
516: e1 += current_weyl_weight_vector[i]*(GET_EXP(d1,m+i)-GET_EXP(d1,i));
517: e2 += current_weyl_weight_vector[i]*(GET_EXP(d2,m+i)-GET_EXP(d2,i));
518: }
519: if ( e1 > e2 ) return 1;
520: else if ( e1 < e2 ) return -1;
521: return ndl_lex_compare(d1,d2);
522: }
523:
1.61 noro 524: INLINE int ndl_equal(UINT *d1,UINT *d2)
1.1 noro 525: {
526: int i;
527:
1.81 noro 528: switch ( nd_wpd ) {
529: case 2:
530: if ( TD(d2) != TD(d1) ) return 0;
531: if ( d2[1] != d1[1] ) return 0;
532: return 1;
533: break;
534: case 3:
535: if ( TD(d2) != TD(d1) ) return 0;
536: if ( d2[1] != d1[1] ) return 0;
537: if ( d2[2] != d1[2] ) return 0;
538: return 1;
539: break;
540: default:
541: for ( i = 0; i < nd_wpd; i++ )
542: if ( *d1++ != *d2++ ) return 0;
543: return 1;
544: break;
545: }
1.1 noro 546: }
547:
1.61 noro 548: INLINE void ndl_copy(UINT *d1,UINT *d2)
1.6 noro 549: {
550: int i;
551:
552: switch ( nd_wpd ) {
1.41 noro 553: case 2:
1.34 noro 554: TD(d2) = TD(d1);
555: d2[1] = d1[1];
1.6 noro 556: break;
1.41 noro 557: case 3:
1.34 noro 558: TD(d2) = TD(d1);
1.6 noro 559: d2[1] = d1[1];
1.34 noro 560: d2[2] = d1[2];
1.6 noro 561: break;
562: default:
1.41 noro 563: for ( i = 0; i < nd_wpd; i++ )
1.6 noro 564: d2[i] = d1[i];
565: break;
566: }
567: }
568:
1.61 noro 569: INLINE void ndl_zero(UINT *d)
570: {
571: int i;
572: for ( i = 0; i < nd_wpd; i++ ) d[i] = 0;
573: }
574:
575: INLINE void ndl_add(UINT *d1,UINT *d2,UINT *d)
1.1 noro 576: {
577: int i;
578:
1.43 noro 579: #if 1
1.6 noro 580: switch ( nd_wpd ) {
1.41 noro 581: case 2:
582: TD(d) = TD(d1)+TD(d2);
1.34 noro 583: d[1] = d1[1]+d2[1];
1.6 noro 584: break;
1.41 noro 585: case 3:
586: TD(d) = TD(d1)+TD(d2);
1.6 noro 587: d[1] = d1[1]+d2[1];
1.34 noro 588: d[2] = d1[2]+d2[2];
1.6 noro 589: break;
590: default:
1.43 noro 591: for ( i = 0; i < nd_wpd; i++ ) d[i] = d1[i]+d2[i];
1.6 noro 592: break;
593: }
1.43 noro 594: #else
595: for ( i = 0; i < nd_wpd; i++ ) d[i] = d1[i]+d2[i];
596: #endif
1.6 noro 597: }
598:
1.55 noro 599: /* d1 += d2 */
1.61 noro 600: INLINE void ndl_addto(UINT *d1,UINT *d2)
1.55 noro 601: {
602: int i;
603:
604: #if 1
605: switch ( nd_wpd ) {
606: case 2:
607: TD(d1) += TD(d2);
608: d1[1] += d2[1];
609: break;
610: case 3:
611: TD(d1) += TD(d2);
612: d1[1] += d2[1];
613: d1[2] += d2[2];
614: break;
615: default:
616: for ( i = 0; i < nd_wpd; i++ ) d1[i] += d2[i];
617: break;
618: }
619: #else
620: for ( i = 0; i < nd_wpd; i++ ) d1[i] += d2[i];
621: #endif
622: }
623:
1.61 noro 624: INLINE void ndl_sub(UINT *d1,UINT *d2,UINT *d)
1.6 noro 625: {
626: int i;
627:
1.43 noro 628: for ( i = 0; i < nd_wpd; i++ ) d[i] = d1[i]-d2[i];
1.1 noro 629: }
630:
1.61 noro 631: int ndl_disjoint(UINT *d1,UINT *d2)
1.1 noro 632: {
1.61 noro 633: UINT t1,t2,u,u1,u2;
1.1 noro 634: int i,j;
635:
1.65 noro 636: #if USE_UNROLL
1.1 noro 637: switch ( nd_bpe ) {
1.62 noro 638: case 3:
639: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
640: u1 = d1[i]; u2 = d2[i];
641: t1 = u1&0x38000000; t2 = u2&0x38000000; if ( t1&&t2 ) return 0;
642: t1 = u1& 0x7000000; t2 = u2& 0x7000000; if ( t1&&t2 ) return 0;
643: t1 = u1& 0xe00000; t2 = u2& 0xe00000; if ( t1&&t2 ) return 0;
644: t1 = u1& 0x1c0000; t2 = u2& 0x1c0000; if ( t1&&t2 ) return 0;
645: t1 = u1& 0x38000; t2 = u2& 0x38000; if ( t1&&t2 ) return 0;
646: t1 = u1& 0x7000; t2 = u2& 0x7000; if ( t1&&t2 ) return 0;
647: t1 = u1& 0xe00; t2 = u2& 0xe00; if ( t1&&t2 ) return 0;
648: t1 = u1& 0x1c0; t2 = u2& 0x1c0; if ( t1&&t2 ) return 0;
649: t1 = u1& 0x38; t2 = u2& 0x38; if ( t1&&t2 ) return 0;
650: t1 = u1& 0x7; t2 = u2& 0x7; if ( t1&&t2 ) return 0;
651: }
652: return 1;
653: break;
1.1 noro 654: case 4:
1.41 noro 655: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 656: u1 = d1[i]; u2 = d2[i];
657: t1 = u1&0xf0000000; t2 = u2&0xf0000000; if ( t1&&t2 ) return 0;
1.62 noro 658: t1 = u1& 0xf000000; t2 = u2& 0xf000000; if ( t1&&t2 ) return 0;
659: t1 = u1& 0xf00000; t2 = u2& 0xf00000; if ( t1&&t2 ) return 0;
660: t1 = u1& 0xf0000; t2 = u2& 0xf0000; if ( t1&&t2 ) return 0;
661: t1 = u1& 0xf000; t2 = u2& 0xf000; if ( t1&&t2 ) return 0;
662: t1 = u1& 0xf00; t2 = u2& 0xf00; if ( t1&&t2 ) return 0;
663: t1 = u1& 0xf0; t2 = u2& 0xf0; if ( t1&&t2 ) return 0;
664: t1 = u1& 0xf; t2 = u2& 0xf; if ( t1&&t2 ) return 0;
1.1 noro 665: }
666: return 1;
667: break;
668: case 6:
1.41 noro 669: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 670: u1 = d1[i]; u2 = d2[i];
671: t1 = u1&0x3f000000; t2 = u2&0x3f000000; if ( t1&&t2 ) return 0;
1.62 noro 672: t1 = u1& 0xfc0000; t2 = u2& 0xfc0000; if ( t1&&t2 ) return 0;
673: t1 = u1& 0x3f000; t2 = u2& 0x3f000; if ( t1&&t2 ) return 0;
674: t1 = u1& 0xfc0; t2 = u2& 0xfc0; if ( t1&&t2 ) return 0;
675: t1 = u1& 0x3f; t2 = u2& 0x3f; if ( t1&&t2 ) return 0;
1.1 noro 676: }
677: return 1;
678: break;
679: case 8:
1.41 noro 680: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 681: u1 = d1[i]; u2 = d2[i];
682: t1 = u1&0xff000000; t2 = u2&0xff000000; if ( t1&&t2 ) return 0;
1.62 noro 683: t1 = u1& 0xff0000; t2 = u2& 0xff0000; if ( t1&&t2 ) return 0;
684: t1 = u1& 0xff00; t2 = u2& 0xff00; if ( t1&&t2 ) return 0;
685: t1 = u1& 0xff; t2 = u2& 0xff; if ( t1&&t2 ) return 0;
1.1 noro 686: }
687: return 1;
688: break;
689: case 16:
1.41 noro 690: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 691: u1 = d1[i]; u2 = d2[i];
692: t1 = u1&0xffff0000; t2 = u2&0xffff0000; if ( t1&&t2 ) return 0;
1.62 noro 693: t1 = u1& 0xffff; t2 = u2& 0xffff; if ( t1&&t2 ) return 0;
1.1 noro 694: }
695: return 1;
696: break;
697: case 32:
1.41 noro 698: for ( i = nd_exporigin; i < nd_wpd; i++ )
1.1 noro 699: if ( d1[i] && d2[i] ) return 0;
700: return 1;
701: break;
702: default:
1.41 noro 703: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 704: u1 = d1[i]; u2 = d2[i];
705: for ( j = 0; j < nd_epw; j++ ) {
706: if ( (u1&nd_mask0) && (u2&nd_mask0) ) return 0;
707: u1 >>= nd_bpe; u2 >>= nd_bpe;
708: }
709: }
710: return 1;
711: break;
712: }
1.65 noro 713: #else
714: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
715: u1 = d1[i]; u2 = d2[i];
716: for ( j = 0; j < nd_epw; j++ ) {
717: if ( (u1&nd_mask0) && (u2&nd_mask0) ) return 0;
718: u1 >>= nd_bpe; u2 >>= nd_bpe;
719: }
720: }
721: return 1;
722: #endif
1.1 noro 723: }
724:
1.61 noro 725: int ndl_check_bound2(int index,UINT *d2)
1.1 noro 726: {
1.61 noro 727: UINT u2;
728: UINT *d1;
1.5 noro 729: int i,j,ind,k;
1.1 noro 730:
1.5 noro 731: d1 = nd_bound[index];
732: ind = 0;
1.65 noro 733: #if USE_UNROLL
1.5 noro 734: switch ( nd_bpe ) {
1.62 noro 735: case 3:
736: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
737: u2 = d2[i];
738: if ( d1[ind++]+((u2>>27)&0x7) >= 0x8 ) return 1;
739: if ( d1[ind++]+((u2>>24)&0x7) >= 0x8 ) return 1;
740: if ( d1[ind++]+((u2>>21)&0x7) >= 0x8 ) return 1;
741: if ( d1[ind++]+((u2>>18)&0x7) >= 0x8 ) return 1;
742: if ( d1[ind++]+((u2>>15)&0x7) >= 0x8 ) return 1;
743: if ( d1[ind++]+((u2>>12)&0x7) >= 0x8 ) return 1;
744: if ( d1[ind++]+((u2>>9)&0x7) >= 0x8 ) return 1;
745: if ( d1[ind++]+((u2>>6)&0x7) >= 0x8 ) return 1;
746: if ( d1[ind++]+((u2>>3)&0x7) >= 0x8 ) return 1;
747: if ( d1[ind++]+(u2&0x7) >= 0x8 ) return 1;
748: }
749: return 0;
750: break;
1.5 noro 751: case 4:
1.41 noro 752: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.5 noro 753: u2 = d2[i];
754: if ( d1[ind++]+((u2>>28)&0xf) >= 0x10 ) return 1;
755: if ( d1[ind++]+((u2>>24)&0xf) >= 0x10 ) return 1;
756: if ( d1[ind++]+((u2>>20)&0xf) >= 0x10 ) return 1;
757: if ( d1[ind++]+((u2>>16)&0xf) >= 0x10 ) return 1;
758: if ( d1[ind++]+((u2>>12)&0xf) >= 0x10 ) return 1;
759: if ( d1[ind++]+((u2>>8)&0xf) >= 0x10 ) return 1;
760: if ( d1[ind++]+((u2>>4)&0xf) >= 0x10 ) return 1;
761: if ( d1[ind++]+(u2&0xf) >= 0x10 ) return 1;
762: }
763: return 0;
764: break;
765: case 6:
1.41 noro 766: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.5 noro 767: u2 = d2[i];
768: if ( d1[ind++]+((u2>>24)&0x3f) >= 0x40 ) return 1;
769: if ( d1[ind++]+((u2>>18)&0x3f) >= 0x40 ) return 1;
770: if ( d1[ind++]+((u2>>12)&0x3f) >= 0x40 ) return 1;
771: if ( d1[ind++]+((u2>>6)&0x3f) >= 0x40 ) return 1;
772: if ( d1[ind++]+(u2&0x3f) >= 0x40 ) return 1;
773: }
774: return 0;
775: break;
776: case 8:
1.41 noro 777: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.5 noro 778: u2 = d2[i];
779: if ( d1[ind++]+((u2>>24)&0xff) >= 0x100 ) return 1;
780: if ( d1[ind++]+((u2>>16)&0xff) >= 0x100 ) return 1;
781: if ( d1[ind++]+((u2>>8)&0xff) >= 0x100 ) return 1;
782: if ( d1[ind++]+(u2&0xff) >= 0x100 ) return 1;
783: }
784: return 0;
785: break;
786: case 16:
1.41 noro 787: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.5 noro 788: u2 = d2[i];
789: if ( d1[ind++]+((u2>>16)&0xffff) > 0x10000 ) return 1;
790: if ( d1[ind++]+(u2&0xffff) > 0x10000 ) return 1;
791: }
792: return 0;
793: break;
794: case 32:
1.41 noro 795: for ( i = nd_exporigin; i < nd_wpd; i++ )
1.5 noro 796: if ( d1[i]+d2[i]<d1[i] ) return 1;
797: return 0;
798: break;
799: default:
1.41 noro 800: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.5 noro 801: u2 = d2[i];
802: k = (nd_epw-1)*nd_bpe;
803: for ( j = 0; j < nd_epw; j++, k -= nd_bpe )
804: if ( d1[ind++]+((u2>>k)&nd_mask0) > nd_mask0 ) return 1;
805: }
806: return 0;
807: break;
808: }
1.65 noro 809: #else
810: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
811: u2 = d2[i];
812: k = (nd_epw-1)*nd_bpe;
813: for ( j = 0; j < nd_epw; j++, k -= nd_bpe )
814: if ( d1[ind++]+((u2>>k)&nd_mask0) > nd_mask0 ) return 1;
815: }
816: return 0;
817: #endif
1.1 noro 818: }
819:
1.61 noro 820: INLINE int ndl_hash_value(UINT *d)
1.1 noro 821: {
822: int i;
823: int r;
824:
1.34 noro 825: r = 0;
1.41 noro 826: for ( i = 0; i < nd_wpd; i++ )
1.1 noro 827: r = ((r<<16)+d[i])%REDTAB_LEN;
828: return r;
829: }
830:
1.63 noro 831: INLINE int ndl_find_reducer(UINT *dg)
1.1 noro 832: {
1.13 noro 833: RHist r;
1.6 noro 834: int d,k,i;
1.1 noro 835:
1.63 noro 836: d = ndl_hash_value(dg);
1.13 noro 837: for ( r = nd_red[d], k = 0; r; r = NEXT(r), k++ ) {
1.34 noro 838: if ( ndl_equal(dg,DL(r)) ) {
1.1 noro 839: if ( k > 0 ) nd_notfirst++;
840: nd_found++;
1.13 noro 841: return r->index;
1.1 noro 842: }
843: }
1.13 noro 844: if ( Reverse )
845: for ( i = nd_psn-1; i >= 0; i-- ) {
846: r = nd_psh[i];
1.34 noro 847: if ( ndl_reducible(dg,DL(r)) ) {
1.13 noro 848: nd_create++;
1.34 noro 849: nd_append_red(dg,i);
1.13 noro 850: return i;
851: }
852: }
853: else
854: for ( i = 0; i < nd_psn; i++ ) {
855: r = nd_psh[i];
1.34 noro 856: if ( ndl_reducible(dg,DL(r)) ) {
1.13 noro 857: nd_create++;
1.34 noro 858: nd_append_red(dg,i);
1.13 noro 859: return i;
860: }
1.1 noro 861: }
1.6 noro 862: return -1;
1.1 noro 863: }
864:
1.63 noro 865: ND nd_merge(ND p1,ND p2)
866: {
867: int n,c;
868: int t,can,td1,td2;
869: ND r;
870: NM m1,m2,mr0,mr,s;
871:
872: if ( !p1 ) return p2;
873: else if ( !p2 ) return p1;
874: else {
875: can = 0;
876: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
877: c = DL_COMPARE(DL(m1),DL(m2));
878: switch ( c ) {
879: case 0:
880: s = m1; m1 = NEXT(m1);
881: can++; NEXTNM2(mr0,mr,s);
882: s = m2; m2 = NEXT(m2); FREENM(s);
883: break;
884: case 1:
885: s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s);
886: break;
887: case -1:
888: s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s);
889: break;
890: }
891: }
892: if ( !mr0 )
893: if ( m1 ) mr0 = m1;
894: else if ( m2 ) mr0 = m2;
895: else return 0;
896: else if ( m1 ) NEXT(mr) = m1;
897: else if ( m2 ) NEXT(mr) = m2;
898: else NEXT(mr) = 0;
899: BDY(p1) = mr0;
900: SG(p1) = MAX(SG(p1),SG(p2));
901: LEN(p1) = LEN(p1)+LEN(p2)-can;
902: FREEND(p2);
903: return p1;
904: }
905: }
906:
1.31 noro 907: ND nd_add(int mod,ND p1,ND p2)
1.1 noro 908: {
909: int n,c;
1.34 noro 910: int t,can,td1,td2;
1.1 noro 911: ND r;
912: NM m1,m2,mr0,mr,s;
913:
1.34 noro 914: if ( !p1 ) return p2;
915: else if ( !p2 ) return p1;
1.71 noro 916: else if ( mod == -1 ) return nd_add_sf(p1,p2);
1.34 noro 917: else if ( !mod ) return nd_add_q(p1,p2);
1.1 noro 918: else {
1.30 noro 919: can = 0;
1.1 noro 920: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
1.34 noro 921: c = DL_COMPARE(DL(m1),DL(m2));
1.1 noro 922: switch ( c ) {
923: case 0:
1.19 noro 924: t = ((CM(m1))+(CM(m2))) - mod;
1.34 noro 925: if ( t < 0 ) t += mod;
1.1 noro 926: s = m1; m1 = NEXT(m1);
927: if ( t ) {
1.34 noro 928: can++; NEXTNM2(mr0,mr,s); CM(mr) = (t);
1.17 noro 929: } else {
1.34 noro 930: can += 2; FREENM(s);
1.17 noro 931: }
932: s = m2; m2 = NEXT(m2); FREENM(s);
1.95 noro 933: break;
934: case 1:
935: s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s);
936: break;
937: case -1:
938: s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s);
939: break;
940: }
941: }
942: if ( !mr0 )
943: if ( m1 ) mr0 = m1;
944: else if ( m2 ) mr0 = m2;
945: else return 0;
946: else if ( m1 ) NEXT(mr) = m1;
947: else if ( m2 ) NEXT(mr) = m2;
948: else NEXT(mr) = 0;
949: BDY(p1) = mr0;
950: SG(p1) = MAX(SG(p1),SG(p2));
951: LEN(p1) = LEN(p1)+LEN(p2)-can;
952: FREEND(p2);
953: return p1;
954: }
955: }
956:
957: /* XXX on opteron, the inlined manipulation of destructive additon of
958: * two NM seems to make gcc optimizer get confused, so the part is
959: * done in a function.
960: */
961:
962: int nm_destructive_add_q(NM *m1,NM *m2,NM *mr0,NM *mr)
963: {
964: NM s;
965: Q t;
966: int can;
967:
968: addq(CQ(*m1),CQ(*m2),&t);
969: s = *m1; *m1 = NEXT(*m1);
970: if ( t ) {
971: can = 1; NEXTNM2(*mr0,*mr,s); CQ(*mr) = (t);
972: } else {
973: can = 2; FREENM(s);
974: }
975: s = *m2; *m2 = NEXT(*m2); FREENM(s);
976: return can;
977: }
978:
979: ND nd_add_q(ND p1,ND p2)
980: {
981: int n,c,can;
982: ND r;
983: NM m1,m2,mr0,mr,s;
984: Q t;
985:
986: if ( !p1 ) return p2;
987: else if ( !p2 ) return p1;
988: else {
989: can = 0;
990: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
991: c = DL_COMPARE(DL(m1),DL(m2));
992: switch ( c ) {
993: case 0:
994: #if defined(__x86_64__)
995: can += nm_destructive_add_q(&m1,&m2,&mr0,&mr);
996: #else
997: addq(CQ(m1),CQ(m2),&t);
998: s = m1; m1 = NEXT(m1);
999: if ( t ) {
1000: can++; NEXTNM2(mr0,mr,s); CQ(mr) = (t);
1001: } else {
1002: can += 2; FREENM(s);
1003: }
1004: s = m2; m2 = NEXT(m2); FREENM(s);
1005: #endif
1.17 noro 1006: break;
1007: case 1:
1008: s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s);
1009: break;
1010: case -1:
1011: s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s);
1012: break;
1013: }
1014: }
1015: if ( !mr0 )
1.34 noro 1016: if ( m1 ) mr0 = m1;
1017: else if ( m2 ) mr0 = m2;
1018: else return 0;
1019: else if ( m1 ) NEXT(mr) = m1;
1020: else if ( m2 ) NEXT(mr) = m2;
1021: else NEXT(mr) = 0;
1.17 noro 1022: BDY(p1) = mr0;
1023: SG(p1) = MAX(SG(p1),SG(p2));
1.31 noro 1024: LEN(p1) = LEN(p1)+LEN(p2)-can;
1.17 noro 1025: FREEND(p2);
1026: return p1;
1027: }
1028: }
1029:
1.71 noro 1030: ND nd_add_sf(ND p1,ND p2)
1031: {
1032: int n,c,can;
1033: ND r;
1034: NM m1,m2,mr0,mr,s;
1035: int t;
1036:
1037: if ( !p1 ) return p2;
1038: else if ( !p2 ) return p1;
1039: else {
1040: can = 0;
1041: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
1042: c = DL_COMPARE(DL(m1),DL(m2));
1043: switch ( c ) {
1044: case 0:
1045: t = _addsf(CM(m1),CM(m2));
1046: s = m1; m1 = NEXT(m1);
1047: if ( t ) {
1048: can++; NEXTNM2(mr0,mr,s); CM(mr) = (t);
1049: } else {
1050: can += 2; FREENM(s);
1051: }
1052: s = m2; m2 = NEXT(m2); FREENM(s);
1053: break;
1054: case 1:
1055: s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s);
1056: break;
1057: case -1:
1058: s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s);
1059: break;
1060: }
1061: }
1062: if ( !mr0 )
1063: if ( m1 ) mr0 = m1;
1064: else if ( m2 ) mr0 = m2;
1065: else return 0;
1066: else if ( m1 ) NEXT(mr) = m1;
1067: else if ( m2 ) NEXT(mr) = m2;
1068: else NEXT(mr) = 0;
1069: BDY(p1) = mr0;
1070: SG(p1) = MAX(SG(p1),SG(p2));
1071: LEN(p1) = LEN(p1)+LEN(p2)-can;
1072: FREEND(p2);
1073: return p1;
1074: }
1075: }
1076:
1.1 noro 1077: /* ret=1 : success, ret=0 : overflow */
1.69 noro 1078: int nd_nf(int mod,ND g,NDV *ps,int full,NDC dn,ND *rp)
1.1 noro 1079: {
1.11 noro 1080: ND d;
1.1 noro 1081: NM m,mrd,tail;
1.7 noro 1082: NM mul;
1.10 noro 1083: int n,sugar,psugar,sugar0,stat,index;
1.30 noro 1084: int c,c1,c2,dummy;
1.17 noro 1085: RHist h;
1.11 noro 1086: NDV p,red;
1.69 noro 1087: Q cg,cred,gcd,tq,qq;
1.21 noro 1088: double hmag;
1.1 noro 1089:
1.69 noro 1090: if ( dn ) {
1091: if ( mod )
1092: dn->m = 1;
1093: else
1094: dn->z = ONE;
1095: }
1.1 noro 1096: if ( !g ) {
1097: *rp = 0;
1098: return 1;
1099: }
1.34 noro 1100: if ( !mod ) hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;
1.21 noro 1101:
1.14 noro 1102: sugar0 = sugar = SG(g);
1.1 noro 1103: n = NV(g);
1.61 noro 1104: mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT));
1.1 noro 1105: for ( d = 0; g; ) {
1.63 noro 1106: index = ndl_find_reducer(HDL(g));
1.6 noro 1107: if ( index >= 0 ) {
1.17 noro 1108: h = nd_psh[index];
1109: ndl_sub(HDL(g),DL(h),DL(mul));
1.14 noro 1110: if ( ndl_check_bound2(index,DL(mul)) ) {
1.6 noro 1111: nd_free(g); nd_free(d);
1112: return 0;
1113: }
1.77 noro 1114: if ( nd_demand )
1115: p = ndv_load(index);
1116: else
1117: p = ps[index];
1.71 noro 1118: if ( mod == -1 )
1119: CM(mul) = _mulsf(_invsf(HCM(p)),_chsgnsf(HCM(g)));
1120: else if ( mod ) {
1.19 noro 1121: c1 = invm(HCM(p),mod); c2 = mod-HCM(g);
1122: DMAR(c1,c2,0,mod,c); CM(mul) = c;
1.16 noro 1123: } else {
1.17 noro 1124: igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred);
1.16 noro 1125: chsgnq(cg,&CQ(mul));
1.20 noro 1126: nd_mul_c_q(d,cred); nd_mul_c_q(g,cred);
1.69 noro 1127: if ( dn ) {
1128: mulq(dn->z,cred,&tq); dn->z = tq;
1129: }
1.16 noro 1130: }
1.55 noro 1131: g = nd_add(mod,g,ndv_mul_nm(mod,mul,p));
1.34 noro 1132: sugar = MAX(sugar,SG(p)+TD(DL(mul)));
1.22 noro 1133: if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) {
1.69 noro 1134: tq = HCQ(g);
1.21 noro 1135: nd_removecont2(d,g);
1.69 noro 1136: if ( dn ) {
1137: divq(tq,HCQ(g),&qq); divq(dn->z,qq,&tq); dn->z = tq;
1138: }
1.21 noro 1139: hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;
1140: }
1.1 noro 1141: } else if ( !full ) {
1142: *rp = g;
1143: return 1;
1144: } else {
1145: m = BDY(g);
1146: if ( NEXT(m) ) {
1.34 noro 1147: BDY(g) = NEXT(m); NEXT(m) = 0; LEN(g)--;
1.1 noro 1148: } else {
1149: FREEND(g); g = 0;
1150: }
1151: if ( d ) {
1.34 noro 1152: NEXT(tail)=m; tail=m; LEN(d)++;
1.1 noro 1153: } else {
1.34 noro 1154: MKND(n,m,1,d); tail = BDY(d);
1.1 noro 1155: }
1156: }
1157: }
1.34 noro 1158: if ( d ) SG(d) = sugar;
1.1 noro 1159: *rp = d;
1160: return 1;
1161: }
1.28 noro 1162:
1.53 noro 1163: int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp)
1.25 noro 1164: {
1165: int hindex,index;
1166: NDV p;
1167: ND u,d,red;
1168: NODE l;
1.31 noro 1169: NM mul,m,mrd,tail;
1.25 noro 1170: int sugar,psugar,n,h_reducible;
1171: PGeoBucket bucket;
1172: int c,c1,c2;
1.26 noro 1173: Q cg,cred,gcd,zzz;
1.25 noro 1174: RHist h;
1.28 noro 1175: double hmag,gmag;
1.77 noro 1176: int count = 0;
1177: int hcount = 0;
1.25 noro 1178:
1179: if ( !g ) {
1180: *rp = 0;
1181: return 1;
1182: }
1183: sugar = SG(g);
1184: n = NV(g);
1.34 noro 1185: if ( !mod ) hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;
1.25 noro 1186: bucket = create_pbucket();
1.31 noro 1187: add_pbucket(mod,bucket,g);
1.25 noro 1188: d = 0;
1.61 noro 1189: mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT));
1.25 noro 1190: while ( 1 ) {
1.26 noro 1191: hindex = mod?head_pbucket(mod,bucket):head_pbucket_q(bucket);
1.25 noro 1192: if ( hindex < 0 ) {
1.77 noro 1193: if ( DP_Print > 3 ) printf("(%d %d)",count,hcount);
1.34 noro 1194: if ( d ) SG(d) = sugar;
1.25 noro 1195: *rp = d;
1196: return 1;
1197: }
1198: g = bucket->body[hindex];
1.63 noro 1199: index = ndl_find_reducer(HDL(g));
1.25 noro 1200: if ( index >= 0 ) {
1.77 noro 1201: count++;
1202: if ( !d ) hcount++;
1.25 noro 1203: h = nd_psh[index];
1204: ndl_sub(HDL(g),DL(h),DL(mul));
1205: if ( ndl_check_bound2(index,DL(mul)) ) {
1.26 noro 1206: nd_free(d);
1.25 noro 1207: free_pbucket(bucket);
1208: *rp = 0;
1209: return 0;
1210: }
1.53 noro 1211: p = ps[index];
1.71 noro 1212: if ( mod == -1 )
1213: CM(mul) = _mulsf(_invsf(HCM(p)),_chsgnsf(HCM(g)));
1214: else if ( mod ) {
1.25 noro 1215: c1 = invm(HCM(p),mod); c2 = mod-HCM(g);
1216: DMAR(c1,c2,0,mod,c); CM(mul) = c;
1217: } else {
1218: igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred);
1219: chsgnq(cg,&CQ(mul));
1.26 noro 1220: nd_mul_c_q(d,cred);
1221: mulq_pbucket(bucket,cred);
1222: g = bucket->body[hindex];
1.28 noro 1223: gmag = (double)p_mag((P)HCQ(g));
1.25 noro 1224: }
1.55 noro 1225: red = ndv_mul_nm(mod,mul,p);
1.25 noro 1226: bucket->body[hindex] = nd_remove_head(g);
1227: red = nd_remove_head(red);
1.31 noro 1228: add_pbucket(mod,bucket,red);
1.34 noro 1229: psugar = SG(p)+TD(DL(mul));
1230: sugar = MAX(sugar,psugar);
1.28 noro 1231: if ( !mod && hmag && (gmag > hmag) ) {
1232: g = normalize_pbucket(mod,bucket);
1233: if ( !g ) {
1.34 noro 1234: if ( d ) SG(d) = sugar;
1.28 noro 1235: *rp = d;
1236: return 1;
1237: }
1238: nd_removecont2(d,g);
1239: hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;
1.31 noro 1240: add_pbucket(mod,bucket,g);
1.28 noro 1241: }
1.25 noro 1242: } else if ( !full ) {
1243: g = normalize_pbucket(mod,bucket);
1.34 noro 1244: if ( g ) SG(g) = sugar;
1.25 noro 1245: *rp = g;
1246: return 1;
1247: } else {
1248: m = BDY(g);
1249: if ( NEXT(m) ) {
1.34 noro 1250: BDY(g) = NEXT(m); NEXT(m) = 0; LEN(g)--;
1.25 noro 1251: } else {
1252: FREEND(g); g = 0;
1253: }
1254: bucket->body[hindex] = g;
1255: NEXT(m) = 0;
1256: if ( d ) {
1.34 noro 1257: NEXT(tail)=m; tail=m; LEN(d)++;
1.25 noro 1258: } else {
1.34 noro 1259: MKND(n,m,1,d); tail = BDY(d);
1.25 noro 1260: }
1261: }
1262: }
1263: }
1.27 noro 1264:
1.61 noro 1265: /* input : list of NDV, cand : list of NDV */
1.28 noro 1266:
1.61 noro 1267: int ndv_check_candidate(NODE input,int obpe,int oadv,EPOS oepos,NODE cand)
1.28 noro 1268: {
1269: int n,i,stat;
1270: ND nf,d;
1.61 noro 1271: NDV r;
1.45 noro 1272: NODE t,s;
1.69 noro 1273: union oNDC dn;
1.45 noro 1274:
1.61 noro 1275: ndv_setup(0,0,cand);
1.31 noro 1276: n = length(cand);
1.28 noro 1277:
1278: /* membercheck : list is a subset of Id(cand) ? */
1279: for ( t = input; t; t = NEXT(t) ) {
1.45 noro 1280: again:
1.61 noro 1281: if ( nd_bpe > obpe )
1282: r = ndv_dup_realloc((NDV)BDY(t),obpe,oadv,oepos);
1283: else
1284: r = (NDV)BDY(t);
1285: d = ndvtond(0,r);
1.69 noro 1286: stat = nd_nf(0,d,nd_ps,0,0,&nf);
1.45 noro 1287: if ( !stat ) {
1288: nd_reconstruct(0,0,0);
1289: goto again;
1290: } else if ( nf ) return 0;
1.71 noro 1291: if ( DP_Print ) { printf("."); fflush(stdout); }
1.28 noro 1292: }
1.71 noro 1293: if ( DP_Print ) { printf("\n"); }
1.28 noro 1294: /* gbcheck : cand is a GB of Id(cand) ? */
1.77 noro 1295: if ( !nd_gb(0,0,1) ) return 0;
1.28 noro 1296: /* XXX */
1.23 noro 1297: return 1;
1298: }
1.1 noro 1299:
1300: ND nd_remove_head(ND p)
1301: {
1302: NM m;
1303:
1304: m = BDY(p);
1305: if ( !NEXT(m) ) {
1.34 noro 1306: FREEND(p); p = 0;
1.31 noro 1307: } else {
1.34 noro 1308: BDY(p) = NEXT(m); LEN(p)--;
1.31 noro 1309: }
1.1 noro 1310: FREENM(m);
1311: return p;
1312: }
1313:
1.69 noro 1314: ND nd_separate_head(ND p,ND *head)
1315: {
1316: NM m,m0;
1317: ND r;
1318:
1319: m = BDY(p);
1320: if ( !NEXT(m) ) {
1321: *head = p; p = 0;
1322: } else {
1323: m0 = m;
1324: BDY(p) = NEXT(m); LEN(p)--;
1325: NEXT(m0) = 0;
1326: MKND(NV(p),m0,1,r);
1327: *head = r;
1328: }
1329: return p;
1330: }
1331:
1.1 noro 1332: PGeoBucket create_pbucket()
1333: {
1334: PGeoBucket g;
1335:
1336: g = CALLOC(1,sizeof(struct oPGeoBucket));
1337: g->m = -1;
1338: return g;
1339: }
1340:
1.25 noro 1341: void free_pbucket(PGeoBucket b) {
1342: int i;
1343:
1.26 noro 1344: for ( i = 0; i <= b->m; i++ )
1.25 noro 1345: if ( b->body[i] ) {
1346: nd_free(b->body[i]);
1347: b->body[i] = 0;
1348: }
1349: GC_free(b);
1350: }
1351:
1.63 noro 1352: void add_pbucket_symbolic(PGeoBucket g,ND d)
1353: {
1354: int l,i,k,m;
1355:
1356: if ( !d )
1357: return;
1358: l = LEN(d);
1359: for ( k = 0, m = 1; l > m; k++, m <<= 1 );
1360: /* 2^(k-1) < l <= 2^k (=m) */
1361: d = nd_merge(g->body[k],d);
1362: for ( ; d && LEN(d) > m; k++, m <<= 1 ) {
1363: g->body[k] = 0;
1364: d = nd_merge(g->body[k+1],d);
1365: }
1366: g->body[k] = d;
1367: g->m = MAX(g->m,k);
1368: }
1369:
1.31 noro 1370: void add_pbucket(int mod,PGeoBucket g,ND d)
1.1 noro 1371: {
1.31 noro 1372: int l,i,k,m;
1.1 noro 1373:
1.31 noro 1374: if ( !d )
1375: return;
1376: l = LEN(d);
1.29 noro 1377: for ( k = 0, m = 1; l > m; k++, m <<= 1 );
1378: /* 2^(k-1) < l <= 2^k (=m) */
1.31 noro 1379: d = nd_add(mod,g->body[k],d);
1380: for ( ; d && LEN(d) > m; k++, m <<= 1 ) {
1.1 noro 1381: g->body[k] = 0;
1.31 noro 1382: d = nd_add(mod,g->body[k+1],d);
1.1 noro 1383: }
1384: g->body[k] = d;
1385: g->m = MAX(g->m,k);
1386: }
1387:
1.26 noro 1388: void mulq_pbucket(PGeoBucket g,Q c)
1389: {
1390: int k;
1391:
1392: for ( k = 0; k <= g->m; k++ )
1393: nd_mul_c_q(g->body[k],c);
1394: }
1395:
1.63 noro 1396: NM remove_head_pbucket_symbolic(PGeoBucket g)
1397: {
1398: int j,i,k,c;
1399: NM head;
1400:
1401: k = g->m;
1402: j = -1;
1403: for ( i = 0; i <= k; i++ ) {
1404: if ( !g->body[i] ) continue;
1405: if ( j < 0 ) j = i;
1406: else {
1407: c = DL_COMPARE(HDL(g->body[i]),HDL(g->body[j]));
1408: if ( c > 0 )
1409: j = i;
1410: else if ( c == 0 )
1411: g->body[i] = nd_remove_head(g->body[i]);
1412: }
1413: }
1414: if ( j < 0 ) return 0;
1415: else {
1416: head = BDY(g->body[j]);
1417: if ( !NEXT(head) ) {
1418: FREEND(g->body[j]);
1419: g->body[j] = 0;
1420: } else {
1421: BDY(g->body[j]) = NEXT(head);
1422: LEN(g->body[j])--;
1423: }
1424: return head;
1425: }
1426: }
1427:
1.19 noro 1428: int head_pbucket(int mod,PGeoBucket g)
1.1 noro 1429: {
1430: int j,i,c,k,nv,sum;
1.61 noro 1431: UINT *di,*dj;
1.1 noro 1432: ND gi,gj;
1433:
1434: k = g->m;
1435: while ( 1 ) {
1436: j = -1;
1437: for ( i = 0; i <= k; i++ ) {
1438: if ( !(gi = g->body[i]) )
1439: continue;
1440: if ( j < 0 ) {
1441: j = i;
1442: gj = g->body[j];
1443: dj = HDL(gj);
1.14 noro 1444: sum = HCM(gj);
1.1 noro 1445: } else {
1.34 noro 1446: c = DL_COMPARE(HDL(gi),dj);
1.1 noro 1447: if ( c > 0 ) {
1.34 noro 1448: if ( sum ) HCM(gj) = sum;
1449: else g->body[j] = nd_remove_head(gj);
1.1 noro 1450: j = i;
1451: gj = g->body[j];
1452: dj = HDL(gj);
1.14 noro 1453: sum = HCM(gj);
1.1 noro 1454: } else if ( c == 0 ) {
1.71 noro 1455: if ( mod == -1 )
1456: sum = _addsf(sum,HCM(gi));
1457: else {
1458: sum = sum+HCM(gi)-mod;
1459: if ( sum < 0 ) sum += mod;
1460: }
1.1 noro 1461: g->body[i] = nd_remove_head(gi);
1462: }
1463: }
1464: }
1.34 noro 1465: if ( j < 0 ) return -1;
1.1 noro 1466: else if ( sum ) {
1.14 noro 1467: HCM(gj) = sum;
1.26 noro 1468: return j;
1.31 noro 1469: } else
1.26 noro 1470: g->body[j] = nd_remove_head(gj);
1471: }
1472: }
1473:
1474: int head_pbucket_q(PGeoBucket g)
1475: {
1476: int j,i,c,k,nv;
1477: Q sum,t;
1478: ND gi,gj;
1479:
1480: k = g->m;
1481: while ( 1 ) {
1482: j = -1;
1483: for ( i = 0; i <= k; i++ ) {
1.34 noro 1484: if ( !(gi = g->body[i]) ) continue;
1.26 noro 1485: if ( j < 0 ) {
1486: j = i;
1487: gj = g->body[j];
1488: sum = HCQ(gj);
1489: } else {
1490: nv = NV(gi);
1.34 noro 1491: c = DL_COMPARE(HDL(gi),HDL(gj));
1.26 noro 1492: if ( c > 0 ) {
1.34 noro 1493: if ( sum ) HCQ(gj) = sum;
1494: else g->body[j] = nd_remove_head(gj);
1.26 noro 1495: j = i;
1496: gj = g->body[j];
1497: sum = HCQ(gj);
1498: } else if ( c == 0 ) {
1499: addq(sum,HCQ(gi),&t);
1500: sum = t;
1501: g->body[i] = nd_remove_head(gi);
1502: }
1503: }
1504: }
1.34 noro 1505: if ( j < 0 ) return -1;
1.26 noro 1506: else if ( sum ) {
1507: HCQ(gj) = sum;
1.1 noro 1508: return j;
1.31 noro 1509: } else
1.1 noro 1510: g->body[j] = nd_remove_head(gj);
1511: }
1512: }
1513:
1.25 noro 1514: ND normalize_pbucket(int mod,PGeoBucket g)
1.1 noro 1515: {
1.31 noro 1516: int i;
1.1 noro 1517: ND r,t;
1518:
1519: r = 0;
1.28 noro 1520: for ( i = 0; i <= g->m; i++ ) {
1.31 noro 1521: r = nd_add(mod,r,g->body[i]);
1.28 noro 1522: g->body[i] = 0;
1523: }
1524: g->m = -1;
1.1 noro 1525: return r;
1526: }
1527:
1.92 noro 1528: void do_diagonalize(int sugar,int m)
1529: {
1530: int i,nh,stat;
1531: NODE r,g,t;
1532: ND h,nf,s,head;
1533: NDV nfv;
1534: Q q,num,den;
1535: union oNDC dn;
1536:
1537: for ( i = nd_psn-1; i >= 0 && SG(nd_psh[i]) == sugar; i-- ) {
1538: if ( nd_demand )
1539: nfv = ndv_load(i);
1540: else
1541: nfv = nd_ps[i];
1542: s = ndvtond(m,nfv);
1543: s = nd_separate_head(s,&head);
1544: nd_nf(m,s,nd_ps,1,&dn,&nf);
1545: if ( !m ) {
1546: NTOQ(NM(dn.z),SGN(dn.z),num);
1547: mulq(HCQ(head),num,&q); HCQ(head) = q;
1548: if ( DN(dn.z) ) {
1549: NTOQ(DN(dn.z),1,den);
1550: nd_mul_c_q(nf,den);
1551: }
1552: }
1553: nf = nd_add(m,head,nf);
1554: ndv_free(nfv);
1555: nd_removecont(m,nf);
1556: nfv = ndtondv(m,nf);
1557: nd_free(nf);
1558: nd_bound[i] = ndv_compute_bound(nfv);
1559: if ( nd_demand ) {
1560: ndv_save(nfv,i);
1561: ndv_free(nfv);
1562: } else
1563: nd_ps[i] = nfv;
1564: }
1565: }
1566:
1.27 noro 1567: /* return value = 0 => input is not a GB */
1568:
1.77 noro 1569: NODE nd_gb(int m,int ishomo,int checkonly)
1.1 noro 1570: {
1571: int i,nh,sugar,stat;
1.23 noro 1572: NODE r,g,t;
1.1 noro 1573: ND_pairs d;
1574: ND_pairs l;
1.77 noro 1575: ND h,nf,s,head;
1.63 noro 1576: NDV nfv;
1.85 noro 1577: Q q,num,den;
1.69 noro 1578: union oNDC dn;
1.1 noro 1579:
1.23 noro 1580: g = 0; d = 0;
1581: for ( i = 0; i < nd_psn; i++ ) {
1.1 noro 1582: d = update_pairs(d,g,i);
1583: g = update_base(g,i);
1584: }
1585: sugar = 0;
1586: while ( d ) {
1587: again:
1588: l = nd_minp(d,&d);
1.14 noro 1589: if ( SG(l) != sugar ) {
1.92 noro 1590: if ( ishomo ) do_diagonalize(sugar,m);
1591:
1.14 noro 1592: sugar = SG(l);
1.71 noro 1593: if ( DP_Print ) fprintf(asir_out,"%d",sugar);
1.1 noro 1594: }
1.53 noro 1595: stat = nd_sp(m,0,l,&h);
1.1 noro 1596: if ( !stat ) {
1597: NEXT(l) = d; d = l;
1.20 noro 1598: d = nd_reconstruct(m,0,d);
1.1 noro 1599: goto again;
1600: }
1.41 noro 1601: #if USE_GEOBUCKET
1.69 noro 1602: stat = m?nd_nf_pbucket(m,h,nd_ps,!Top,&nf):nd_nf(m,h,nd_ps,!Top,0,&nf);
1.41 noro 1603: #else
1.69 noro 1604: stat = nd_nf(m,h,nd_ps,!Top,0,&nf);
1.41 noro 1605: #endif
1.1 noro 1606: if ( !stat ) {
1607: NEXT(l) = d; d = l;
1.20 noro 1608: d = nd_reconstruct(m,0,d);
1.1 noro 1609: goto again;
1610: } else if ( nf ) {
1.27 noro 1611: if ( checkonly ) return 0;
1.71 noro 1612: if ( DP_Print ) { printf("+"); fflush(stdout); }
1.63 noro 1613: nd_removecont(m,nf);
1614: nfv = ndtondv(m,nf); nd_free(nf);
1.77 noro 1615: nh = ndv_newps(m,nfv,0);
1.1 noro 1616: d = update_pairs(d,g,nh);
1617: g = update_base(g,nh);
1618: FREENDP(l);
1619: } else {
1.71 noro 1620: if ( DP_Print ) { printf("."); fflush(stdout); }
1.1 noro 1621: FREENDP(l);
1622: }
1623: }
1.77 noro 1624: if ( nd_demand )
1625: for ( t = g; t; t = NEXT(t) )
1626: BDY(t) = (pointer)ndv_load((int)BDY(t));
1627: else
1628: for ( t = g; t; t = NEXT(t) )
1629: BDY(t) = (pointer)nd_ps[(int)BDY(t)];
1.1 noro 1630: return g;
1631: }
1632:
1.92 noro 1633: void do_diagonalize_trace(int sugar,int m)
1.91 noro 1634: {
1635: int i,nh,stat;
1636: NODE r,g,t;
1637: ND h,nf,nfq,s,head;
1638: NDV nfv,nfqv;
1639: Q q,den,num;
1640: union oNDC dn;
1641:
1642: for ( i = nd_psn-1; i >= 0 && SG(nd_psh[i]) == sugar; i-- ) {
1643: /* for nd_ps */
1644: s = ndvtond(m,nd_ps[i]);
1645: s = nd_separate_head(s,&head);
1646: nd_nf_pbucket(m,s,nd_ps,1,&nf);
1647: nf = nd_add(m,head,nf);
1648: ndv_free(nd_ps[i]);
1649: nd_ps[i] = ndtondv(m,nf);
1650: nd_free(nf);
1651:
1652: /* for nd_ps_trace */
1653: if ( nd_demand )
1654: nfv = ndv_load(i);
1655: else
1656: nfv = nd_ps_trace[i];
1657: s = ndvtond(0,nfv);
1658: s = nd_separate_head(s,&head);
1659: nd_nf(0,s,nd_ps_trace,1,&dn,&nf);
1660: NTOQ(NM(dn.z),SGN(dn.z),num);
1661: mulq(HCQ(head),num,&q); HCQ(head) = q;
1662: if ( DN(dn.z) ) {
1663: NTOQ(DN(dn.z),1,den);
1664: nd_mul_c_q(nf,den);
1665: }
1666: nf = nd_add(0,head,nf);
1667: ndv_free(nfv);
1668: nd_removecont(0,nf);
1669: nfv = ndtondv(0,nf);
1670: nd_free(nf);
1671: nd_bound[i] = ndv_compute_bound(nfv);
1672: if ( nd_demand ) {
1673: ndv_save(nfv,i);
1674: ndv_free(nfv);
1675: } else
1676: nd_ps_trace[i] = nfv;
1677: }
1678: }
1679:
1.82 noro 1680: NODE nd_gb_trace(int m,int ishomo)
1.20 noro 1681: {
1682: int i,nh,sugar,stat;
1.23 noro 1683: NODE r,g,t;
1.20 noro 1684: ND_pairs d;
1685: ND_pairs l;
1.82 noro 1686: ND h,nf,nfq,s,head;
1.63 noro 1687: NDV nfv,nfqv;
1.85 noro 1688: Q q,den,num;
1.69 noro 1689: union oNDC dn;
1.20 noro 1690:
1.23 noro 1691: g = 0; d = 0;
1692: for ( i = 0; i < nd_psn; i++ ) {
1.20 noro 1693: d = update_pairs(d,g,i);
1694: g = update_base(g,i);
1695: }
1696: sugar = 0;
1697: while ( d ) {
1698: again:
1699: l = nd_minp(d,&d);
1700: if ( SG(l) != sugar ) {
1.93 noro 1701: if ( ishomo ) do_diagonalize_trace(sugar,m);
1.20 noro 1702: sugar = SG(l);
1.71 noro 1703: if ( DP_Print ) fprintf(asir_out,"%d",sugar);
1.20 noro 1704: }
1.53 noro 1705: stat = nd_sp(m,0,l,&h);
1.20 noro 1706: if ( !stat ) {
1707: NEXT(l) = d; d = l;
1708: d = nd_reconstruct(m,1,d);
1709: goto again;
1710: }
1.41 noro 1711: #if USE_GEOBUCKET
1.53 noro 1712: stat = nd_nf_pbucket(m,h,nd_ps,!Top,&nf);
1.41 noro 1713: #else
1.69 noro 1714: stat = nd_nf(m,h,nd_ps,!Top,0,&nf);
1.41 noro 1715: #endif
1.20 noro 1716: if ( !stat ) {
1717: NEXT(l) = d; d = l;
1718: d = nd_reconstruct(m,1,d);
1719: goto again;
1720: } else if ( nf ) {
1.77 noro 1721: if ( nd_demand ) {
1722: nfqv = ndv_load(nd_psn);
1723: nfq = ndvtond(0,nfqv);
1724: } else
1725: nfq = 0;
1726: if ( !nfq ) {
1727: if ( !nd_sp(0,1,l,&h) || !nd_nf(0,h,nd_ps_trace,!Top,0,&nfq) ) {
1728: NEXT(l) = d; d = l;
1729: d = nd_reconstruct(m,1,d);
1730: goto again;
1731: }
1.70 noro 1732: }
1.20 noro 1733: if ( nfq ) {
1.70 noro 1734: /* m|HC(nfq) => failure */
1.63 noro 1735: if ( !rem(NM(HCQ(nfq)),m) ) return 0;
1736:
1.71 noro 1737: if ( DP_Print ) { printf("+"); fflush(stdout); }
1.63 noro 1738: nd_removecont(m,nf); nfv = ndtondv(m,nf); nd_free(nf);
1739: nd_removecont(0,nfq); nfqv = ndtondv(0,nfq); nd_free(nfq);
1.77 noro 1740: nh = ndv_newps(0,nfv,nfqv);
1.20 noro 1741: d = update_pairs(d,g,nh);
1742: g = update_base(g,nh);
1743: } else {
1.71 noro 1744: if ( DP_Print ) { printf("*"); fflush(stdout); }
1.20 noro 1745: }
1746: } else {
1.71 noro 1747: if ( DP_Print ) { printf("."); fflush(stdout); }
1.20 noro 1748: }
1749: FREENDP(l);
1750: }
1.77 noro 1751: if ( nd_demand )
1752: for ( t = g; t; t = NEXT(t) )
1753: BDY(t) = (pointer)ndv_load((int)BDY(t));
1754: else
1755: for ( t = g; t; t = NEXT(t) )
1756: BDY(t) = (pointer)nd_ps_trace[(int)BDY(t)];
1.20 noro 1757: return g;
1758: }
1759:
1.23 noro 1760: int ndv_compare(NDV *p1,NDV *p2)
1761: {
1.34 noro 1762: return DL_COMPARE(HDL(*p1),HDL(*p2));
1.23 noro 1763: }
1764:
1765: int ndv_compare_rev(NDV *p1,NDV *p2)
1766: {
1.34 noro 1767: return -DL_COMPARE(HDL(*p1),HDL(*p2));
1.23 noro 1768: }
1769:
1.61 noro 1770: NODE ndv_reduceall(int m,NODE f)
1.23 noro 1771: {
1.69 noro 1772: int i,n,stat;
1773: ND nf,g,head;
1.23 noro 1774: NODE t,a0,a;
1.69 noro 1775: union oNDC dn;
1776: NDV *w;
1.85 noro 1777: Q q,num,den;
1.23 noro 1778:
1.69 noro 1779: n = length(f);
1780: #if 0
1781: w = (NDV *)ALLOCA(n*sizeof(NDV));
1782: for ( i = 0, t = f; i < n; i++, t = NEXT(t) ) w[i] = (NDV)BDY(t);
1783: qsort(w,n,sizeof(NDV),
1784: (int (*)(const void *,const void *))ndv_compare);
1785: for ( t = f, i = 0; t; i++, t = NEXT(t) ) BDY(t) = (pointer)w[i];
1786: #endif
1787: ndv_setup(m,0,f);
1788: for ( i = 0; i < n; ) {
1789: g = ndvtond(m,nd_ps[i]);
1790: g = nd_separate_head(g,&head);
1791: stat = nd_nf(m,g,nd_ps,1,&dn,&nf);
1.50 noro 1792: if ( !stat )
1.69 noro 1793: nd_reconstruct(m,0,0);
1794: else {
1.71 noro 1795: if ( DP_Print ) { printf("."); fflush(stdout); }
1.85 noro 1796: if ( !m ) {
1797: NTOQ(NM(dn.z),SGN(dn.z),num);
1798: mulq(HCQ(head),num,&q); HCQ(head) = q;
1799: if ( DN(dn.z) ) {
1800: NTOQ(DN(dn.z),1,den);
1801: nd_mul_c_q(nf,den);
1802: }
1803: }
1.69 noro 1804: nf = nd_add(m,head,nf);
1805: ndv_free(nd_ps[i]);
1.24 noro 1806: nd_removecont(m,nf);
1.69 noro 1807: nd_ps[i] = ndtondv(m,nf); nd_free(nf);
1808: nd_bound[i] = ndv_compute_bound(nd_ps[i]);
1.50 noro 1809: i++;
1.23 noro 1810: }
1811: }
1.71 noro 1812: if ( DP_Print ) { printf("\n"); }
1.23 noro 1813: for ( a0 = 0, i = 0; i < n; i++ ) {
1814: NEXTNODE(a0,a);
1.69 noro 1815: BDY(a) = (pointer)nd_ps[i];
1.23 noro 1816: }
1817: NEXT(a) = 0;
1818: return a0;
1819: }
1820:
1.1 noro 1821: ND_pairs update_pairs( ND_pairs d, NODE /* of index */ g, int t)
1822: {
1823: ND_pairs d1,nd,cur,head,prev,remove;
1824:
1825: if ( !g ) return d;
1826: d = crit_B(d,t);
1827: d1 = nd_newpairs(g,t);
1828: d1 = crit_M(d1);
1829: d1 = crit_F(d1);
1.55 noro 1830: if ( do_weyl )
1831: head = d1;
1832: else {
1833: prev = 0; cur = head = d1;
1834: while ( cur ) {
1835: if ( crit_2( cur->i1,cur->i2 ) ) {
1836: remove = cur;
1837: if ( !prev ) head = cur = NEXT(cur);
1838: else cur = NEXT(prev) = NEXT(cur);
1839: FREENDP(remove);
1840: } else {
1841: prev = cur; cur = NEXT(cur);
1842: }
1.1 noro 1843: }
1844: }
1845: if ( !d )
1846: return head;
1847: else {
1848: nd = d;
1.34 noro 1849: while ( NEXT(nd) ) nd = NEXT(nd);
1.1 noro 1850: NEXT(nd) = head;
1851: return d;
1852: }
1853: }
1854:
1855: ND_pairs nd_newpairs( NODE g, int t )
1856: {
1857: NODE h;
1.61 noro 1858: UINT *dl;
1.34 noro 1859: int ts,s;
1.1 noro 1860: ND_pairs r,r0;
1861:
1.20 noro 1862: dl = DL(nd_psh[t]);
1.34 noro 1863: ts = SG(nd_psh[t]) - TD(dl);
1.1 noro 1864: for ( r0 = 0, h = g; h; h = NEXT(h) ) {
1865: NEXTND_pairs(r0,r);
1866: r->i1 = (int)BDY(h);
1867: r->i2 = t;
1.20 noro 1868: ndl_lcm(DL(nd_psh[r->i1]),dl,r->lcm);
1.34 noro 1869: s = SG(nd_psh[r->i1])-TD(DL(nd_psh[r->i1]));
1870: SG(r) = MAX(s,ts) + TD(LCM(r));
1.1 noro 1871: }
1872: NEXT(r) = 0;
1873: return r0;
1874: }
1875:
1876: ND_pairs crit_B( ND_pairs d, int s )
1877: {
1878: ND_pairs cur,head,prev,remove;
1.61 noro 1879: UINT *t,*tl,*lcm;
1.1 noro 1880: int td,tdl;
1881:
1882: if ( !d ) return 0;
1.20 noro 1883: t = DL(nd_psh[s]);
1.1 noro 1884: prev = 0;
1885: head = cur = d;
1.61 noro 1886: lcm = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
1.1 noro 1887: while ( cur ) {
1888: tl = cur->lcm;
1889: if ( ndl_reducible(tl,t)
1.20 noro 1890: && (ndl_lcm(DL(nd_psh[cur->i1]),t,lcm),!ndl_equal(lcm,tl))
1891: && (ndl_lcm(DL(nd_psh[cur->i2]),t,lcm),!ndl_equal(lcm,tl)) ) {
1.1 noro 1892: remove = cur;
1893: if ( !prev ) {
1894: head = cur = NEXT(cur);
1895: } else {
1896: cur = NEXT(prev) = NEXT(cur);
1897: }
1898: FREENDP(remove);
1899: } else {
1.34 noro 1900: prev = cur; cur = NEXT(cur);
1.1 noro 1901: }
1902: }
1903: return head;
1904: }
1905:
1906: ND_pairs crit_M( ND_pairs d1 )
1907: {
1908: ND_pairs e,d2,d3,dd,p;
1.61 noro 1909: UINT *id,*jd;
1.1 noro 1910:
1911: for ( dd = 0, e = d1; e; e = d3 ) {
1912: if ( !(d2 = NEXT(e)) ) {
1913: NEXT(e) = dd;
1914: return e;
1915: }
1.34 noro 1916: id = LCM(e);
1.1 noro 1917: for ( d3 = 0; d2; d2 = p ) {
1.34 noro 1918: p = NEXT(d2);
1919: jd = LCM(d2);
1920: if ( ndl_equal(jd,id) )
1921: ;
1922: else if ( TD(jd) > TD(id) )
1.1 noro 1923: if ( ndl_reducible(jd,id) ) continue;
1924: else ;
1.34 noro 1925: else if ( ndl_reducible(id,jd) ) goto delit;
1.1 noro 1926: NEXT(d2) = d3;
1927: d3 = d2;
1928: }
1929: NEXT(e) = dd;
1930: dd = e;
1931: continue;
1932: /**/
1933: delit: NEXT(d2) = d3;
1934: d3 = d2;
1935: for ( ; p; p = d2 ) {
1936: d2 = NEXT(p);
1937: NEXT(p) = d3;
1938: d3 = p;
1939: }
1940: FREENDP(e);
1941: }
1942: return dd;
1943: }
1944:
1945: ND_pairs crit_F( ND_pairs d1 )
1946: {
1947: ND_pairs rest, head,remove;
1948: ND_pairs last, p, r, w;
1949: int s;
1950:
1951: for ( head = last = 0, p = d1; NEXT(p); ) {
1952: r = w = equivalent_pairs(p,&rest);
1.14 noro 1953: s = SG(r);
1.1 noro 1954: w = NEXT(w);
1955: while ( w ) {
1956: if ( crit_2(w->i1,w->i2) ) {
1957: r = w;
1958: w = NEXT(w);
1959: while ( w ) {
1960: remove = w;
1961: w = NEXT(w);
1962: FREENDP(remove);
1963: }
1964: break;
1.14 noro 1965: } else if ( SG(w) < s ) {
1.1 noro 1966: FREENDP(r);
1967: r = w;
1.14 noro 1968: s = SG(r);
1.1 noro 1969: w = NEXT(w);
1970: } else {
1971: remove = w;
1972: w = NEXT(w);
1973: FREENDP(remove);
1974: }
1975: }
1976: if ( last ) NEXT(last) = r;
1977: else head = r;
1978: NEXT(last = r) = 0;
1979: p = rest;
1980: if ( !p ) return head;
1981: }
1982: if ( !last ) return p;
1983: NEXT(last) = p;
1984: return head;
1985: }
1986:
1987: int crit_2( int dp1, int dp2 )
1988: {
1.20 noro 1989: return ndl_disjoint(DL(nd_psh[dp1]),DL(nd_psh[dp2]));
1.1 noro 1990: }
1991:
1.40 noro 1992: ND_pairs equivalent_pairs( ND_pairs d1, ND_pairs *prest )
1.1 noro 1993: {
1994: ND_pairs w,p,r,s;
1.61 noro 1995: UINT *d;
1.1 noro 1996:
1997: w = d1;
1.34 noro 1998: d = LCM(w);
1.1 noro 1999: s = NEXT(w);
2000: NEXT(w) = 0;
2001: for ( r = 0; s; s = p ) {
2002: p = NEXT(s);
1.34 noro 2003: if ( ndl_equal(d,LCM(s)) ) {
1.39 noro 2004: NEXT(s) = w; w = s;
1.1 noro 2005: } else {
1.39 noro 2006: NEXT(s) = r; r = s;
1.1 noro 2007: }
2008: }
2009: *prest = r;
2010: return w;
2011: }
2012:
2013: NODE update_base(NODE nd,int ndp)
2014: {
1.61 noro 2015: UINT *dl, *dln;
1.1 noro 2016: NODE last, p, head;
2017:
1.20 noro 2018: dl = DL(nd_psh[ndp]);
1.1 noro 2019: for ( head = last = 0, p = nd; p; ) {
1.20 noro 2020: dln = DL(nd_psh[(int)BDY(p)]);
1.34 noro 2021: if ( ndl_reducible( dln, dl ) ) {
1.1 noro 2022: p = NEXT(p);
2023: if ( last ) NEXT(last) = p;
2024: } else {
2025: if ( !last ) head = p;
2026: p = NEXT(last = p);
2027: }
2028: }
2029: head = append_one(head,ndp);
2030: return head;
2031: }
2032:
2033: ND_pairs nd_minp( ND_pairs d, ND_pairs *prest )
2034: {
2035: ND_pairs m,ml,p,l;
1.61 noro 2036: UINT *lcm;
1.33 noro 2037: int s,td,len,tlen,c,c1;
1.1 noro 2038:
2039: if ( !(p = NEXT(m = d)) ) {
2040: *prest = p;
2041: NEXT(m) = 0;
2042: return m;
2043: }
1.14 noro 2044: s = SG(m);
1.77 noro 2045: if ( !NoSugar ) {
2046: for ( ml = 0, l = m; p; p = NEXT(l = p) )
2047: if ( (SG(p) < s)
2048: || ((SG(p) == s) && (DL_COMPARE(LCM(p),LCM(m)) < 0)) ) {
2049: ml = l; m = p; s = SG(m);
2050: }
2051: } else {
2052: for ( ml = 0, l = m; p; p = NEXT(l = p) )
2053: if ( DL_COMPARE(LCM(p),LCM(m)) < 0 ) {
2054: ml = l; m = p; s = SG(m);
2055: }
2056: }
1.1 noro 2057: if ( !ml ) *prest = NEXT(m);
2058: else {
2059: NEXT(ml) = NEXT(m);
2060: *prest = d;
2061: }
2062: NEXT(m) = 0;
2063: return m;
2064: }
2065:
1.63 noro 2066: ND_pairs nd_minsugarp( ND_pairs d, ND_pairs *prest )
2067: {
1.69 noro 2068: int msugar,i;
1.63 noro 2069: ND_pairs t,dm0,dm,dr0,dr;
2070:
2071: for ( msugar = SG(d), t = NEXT(d); t; t = NEXT(t) )
2072: if ( SG(t) < msugar ) msugar = SG(t);
2073: dm0 = 0; dr0 = 0;
1.69 noro 2074: for ( i = 0, t = d; t; t = NEXT(t) )
2075: if ( i < nd_f4_nsp && SG(t) == msugar ) {
1.63 noro 2076: if ( dm0 ) NEXT(dm) = t;
2077: else dm0 = t;
2078: dm = t;
1.69 noro 2079: i++;
1.63 noro 2080: } else {
2081: if ( dr0 ) NEXT(dr) = t;
2082: else dr0 = t;
2083: dr = t;
2084: }
2085: NEXT(dm) = 0;
2086: if ( dr0 ) NEXT(dr) = 0;
2087: *prest = dr0;
2088: return dm0;
2089: }
2090:
1.77 noro 2091: int ndv_newps(int m,NDV a,NDV aq)
1.1 noro 2092: {
1.3 noro 2093: int len;
1.13 noro 2094: RHist r;
1.20 noro 2095: NDV b;
1.3 noro 2096:
1.1 noro 2097: if ( nd_psn == nd_pslen ) {
2098: nd_pslen *= 2;
1.11 noro 2099: nd_ps = (NDV *)REALLOC((char *)nd_ps,nd_pslen*sizeof(NDV));
1.53 noro 2100: nd_ps_trace = (NDV *)REALLOC((char *)nd_ps_trace,nd_pslen*sizeof(NDV));
1.13 noro 2101: nd_psh = (RHist *)REALLOC((char *)nd_psh,nd_pslen*sizeof(RHist));
1.61 noro 2102: nd_bound = (UINT **)
2103: REALLOC((char *)nd_bound,nd_pslen*sizeof(UINT *));
1.1 noro 2104: }
1.39 noro 2105: NEWRHist(r); nd_psh[nd_psn] = r;
1.63 noro 2106: nd_ps[nd_psn] = a;
1.39 noro 2107: if ( aq ) {
1.63 noro 2108: nd_ps_trace[nd_psn] = aq;
2109: nd_bound[nd_psn] = ndv_compute_bound(aq);
1.39 noro 2110: SG(r) = SG(aq); ndl_copy(HDL(aq),DL(r));
1.53 noro 2111: } else {
1.63 noro 2112: nd_bound[nd_psn] = ndv_compute_bound(a);
1.53 noro 2113: SG(r) = SG(a); ndl_copy(HDL(a),DL(r));
1.39 noro 2114: }
1.77 noro 2115: if ( nd_demand ) {
2116: if ( aq ) {
2117: ndv_save(nd_ps_trace[nd_psn],nd_psn);
2118: nd_ps_trace[nd_psn] = 0;
2119: } else {
2120: ndv_save(nd_ps[nd_psn],nd_psn);
2121: nd_ps[nd_psn] = 0;
2122: }
2123: }
1.1 noro 2124: return nd_psn++;
2125: }
2126:
1.61 noro 2127: void ndv_setup(int mod,int trace,NODE f)
1.1 noro 2128: {
1.5 noro 2129: int i,j,td,len,max;
1.1 noro 2130: NODE s,s0,f0;
1.61 noro 2131: UINT *d;
1.13 noro 2132: RHist r;
1.69 noro 2133: NDV *w;
1.61 noro 2134: NDV a,am;
1.11 noro 2135:
2136: nd_found = 0; nd_notfirst = 0; nd_create = 0;
1.1 noro 2137:
1.69 noro 2138: for ( nd_psn = 0, s = f; s; s = NEXT(s) ) if ( BDY(s) ) nd_psn++;
2139: w = (NDV *)ALLOCA(nd_psn*sizeof(NDV));
2140: for ( i = 0, s = f; s; s = NEXT(s) ) if ( BDY(s) ) w[i++] = BDY(s);
2141: qsort(w,nd_psn,sizeof(NDV),
2142: (int (*)(const void *,const void *))ndv_compare);
2143: nd_pslen = 2*nd_psn;
1.11 noro 2144: nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV));
1.53 noro 2145: nd_ps_trace = (NDV *)MALLOC(nd_pslen*sizeof(NDV));
1.13 noro 2146: nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist));
1.61 noro 2147: nd_bound = (UINT **)MALLOC(nd_pslen*sizeof(UINT *));
1.57 noro 2148:
1.11 noro 2149: if ( !nd_red )
1.13 noro 2150: nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist));
1.71 noro 2151: for ( i = 0; i < REDTAB_LEN; i++ ) nd_red[i] = 0;
1.69 noro 2152: for ( i = 0; i < nd_psn; i++ ) {
1.39 noro 2153: if ( trace ) {
1.69 noro 2154: a = nd_ps_trace[i] = ndv_dup(0,w[i]);
1.61 noro 2155: ndv_removecont(0,a);
2156: am = nd_ps[i] = ndv_dup(mod,a);
2157: ndv_mod(mod,am);
2158: ndv_removecont(mod,am);
2159: } else {
1.69 noro 2160: a = nd_ps[i] = ndv_dup(mod,w[i]);
1.61 noro 2161: ndv_removecont(mod,a);
1.39 noro 2162: }
1.61 noro 2163: NEWRHist(r); SG(r) = HTD(a); ndl_copy(HDL(a),DL(r));
1.57 noro 2164: nd_bound[i] = ndv_compute_bound(a);
1.20 noro 2165: nd_psh[i] = r;
1.77 noro 2166: if ( nd_demand ) {
2167: if ( trace ) {
2168: ndv_save(nd_ps_trace[i],i);
2169: nd_ps_trace[i] = 0;
2170: } else {
2171: ndv_save(nd_ps[i],i);
2172: nd_ps[i] = 0;
2173: }
2174: }
1.20 noro 2175: }
2176: }
2177:
1.63 noro 2178: void nd_gr(LIST f,LIST v,int m,int f4,struct order_spec *ord,LIST *rp)
1.1 noro 2179: {
1.61 noro 2180: VL tv,fv,vv,vc;
1.1 noro 2181: NODE fd,fd0,r,r0,t,x,s,xx;
1.61 noro 2182: int e,max,nvar;
1.69 noro 2183: NDV b;
1.77 noro 2184: int ishomo;
1.1 noro 2185:
1.78 noro 2186: if ( !m && Demand ) nd_demand = 1;
2187: else nd_demand = 0;
2188:
1.74 noro 2189: ndv_alloc = 0;
1.1 noro 2190: get_vars((Obj)f,&fv); pltovl(v,&vv);
1.74 noro 2191: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
1.88 noro 2192: switch ( ord->id ) {
2193: case 1:
2194: if ( ord->nv != nvar )
2195: error("nd_{gr,f4} : invalid order specification");
2196: break;
2197: default:
2198: break;
2199: }
1.32 noro 2200: nd_init_ord(ord);
1.61 noro 2201: for ( t = BDY(f), max = 0; t; t = NEXT(t) )
2202: for ( tv = vv; tv; tv = NEXT(tv) ) {
2203: e = getdeg(tv->v,(P)BDY(t));
2204: max = MAX(e,max);
2205: }
2206: nd_setup_parameters(nvar,max);
1.77 noro 2207: ishomo = 1;
1.1 noro 2208: for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
1.61 noro 2209: b = (pointer)ptondv(CO,vv,(P)BDY(t));
1.77 noro 2210: if ( ishomo )
2211: ishomo = ishomo && ndv_ishomo(b);
1.69 noro 2212: if ( m ) ndv_mod(m,b);
1.61 noro 2213: if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; }
1.1 noro 2214: }
2215: if ( fd0 ) NEXT(fd) = 0;
1.61 noro 2216: ndv_setup(m,0,fd0);
1.77 noro 2217: x = f4?nd_f4(m):nd_gb(m,ishomo,0);
1.82 noro 2218: nd_demand = 0;
1.61 noro 2219: x = ndv_reducebase(x);
2220: x = ndv_reduceall(m,x);
1.23 noro 2221: for ( r0 = 0, t = x; t; t = NEXT(t) ) {
1.1 noro 2222: NEXTNODE(r0,r);
1.61 noro 2223: BDY(r) = ndvtop(m,CO,vv,BDY(t));
1.20 noro 2224: }
2225: if ( r0 ) NEXT(r) = 0;
2226: MKLIST(*rp,r0);
1.74 noro 2227: fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc);
1.20 noro 2228: }
2229:
1.52 noro 2230: void nd_gr_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp)
1.20 noro 2231: {
1.89 noro 2232: struct order_spec *ord1;
1.61 noro 2233: VL tv,fv,vv,vc;
1.27 noro 2234: NODE fd,fd0,in0,in,r,r0,t,s,cand;
1.61 noro 2235: int m,nocheck,nvar,mindex,e,max;
2236: NDV c;
2237: NMV a;
1.27 noro 2238: P p;
1.61 noro 2239: EPOS oepos;
1.82 noro 2240: int obpe,oadv,wmax,i,len,cbpe,ishomo;
1.20 noro 2241:
2242: get_vars((Obj)f,&fv); pltovl(v,&vv);
1.74 noro 2243: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
1.88 noro 2244: switch ( ord->id ) {
2245: case 1:
2246: if ( ord->nv != nvar )
2247: error("nd_gr_trace : invalid order specification");
2248: break;
2249: default:
2250: break;
2251: }
1.52 noro 2252: nocheck = 0;
2253: mindex = 0;
2254:
1.78 noro 2255: if ( Demand ) nd_demand = 1;
2256: else nd_demand = 0;
2257:
1.52 noro 2258: /* setup modulus */
2259: if ( trace < 0 ) {
2260: trace = -trace;
2261: nocheck = 1;
2262: }
2263: m = trace > 1 ? trace : get_lprime(mindex);
1.61 noro 2264: for ( t = BDY(f), max = 0; t; t = NEXT(t) )
2265: for ( tv = vv; tv; tv = NEXT(tv) ) {
2266: e = getdeg(tv->v,(P)BDY(t));
2267: max = MAX(e,max);
1.23 noro 2268: }
1.61 noro 2269: nd_init_ord(ord);
2270: nd_setup_parameters(nvar,max);
2271: obpe = nd_bpe; oadv = nmv_adv; oepos = nd_epos;
1.82 noro 2272: ishomo = 1;
1.61 noro 2273: for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
2274: c = ptondv(CO,vv,(P)BDY(t));
1.82 noro 2275: if ( ishomo )
2276: ishomo = ishomo && ndv_ishomo(c);
1.61 noro 2277: if ( c ) {
2278: NEXTNODE(in0,in); BDY(in) = (pointer)c;
2279: NEXTNODE(fd0,fd); BDY(fd) = (pointer)ndv_dup(0,c);
1.23 noro 2280: }
1.61 noro 2281: }
2282: if ( in0 ) NEXT(in) = 0;
2283: if ( fd0 ) NEXT(fd) = 0;
1.82 noro 2284: if ( !ishomo && homo ) {
1.61 noro 2285: for ( t = in0, wmax = 0; t; t = NEXT(t) ) {
2286: c = (NDV)BDY(t); len = LEN(c);
2287: for ( a = BDY(c), i = 0; i < len; i++, NMV_ADV(a) )
2288: wmax = MAX(TD(DL(a)),wmax);
2289: }
2290: homogenize_order(ord,nvar,&ord1);
1.89 noro 2291: nd_init_ord(ord1);
1.61 noro 2292: nd_setup_parameters(nvar+1,wmax);
2293: for ( t = fd0; t; t = NEXT(t) )
2294: ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos);
1.27 noro 2295: }
1.52 noro 2296: while ( 1 ) {
1.77 noro 2297: if ( Demand )
2298: nd_demand = 1;
1.61 noro 2299: ndv_setup(m,1,fd0);
1.82 noro 2300: cand = nd_gb_trace(m,ishomo || homo);
1.52 noro 2301: if ( !cand ) {
2302: /* failure */
1.61 noro 2303: if ( trace > 1 ) { *rp = 0; return; }
2304: else m = get_lprime(++mindex);
1.52 noro 2305: continue;
2306: }
1.82 noro 2307: if ( !ishomo && homo ) {
1.27 noro 2308: /* dehomogenization */
1.61 noro 2309: for ( t = cand; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord);
1.45 noro 2310: nd_init_ord(ord);
1.61 noro 2311: nd_setup_parameters(nvar,0);
1.27 noro 2312: }
1.77 noro 2313: nd_demand = 0;
1.61 noro 2314: cand = ndv_reducebase(cand);
2315: cand = ndv_reduceall(0,cand);
1.78 noro 2316: cbpe = nd_bpe;
1.61 noro 2317: if ( nocheck )
2318: break;
2319: if ( ndv_check_candidate(in0,obpe,oadv,oepos,cand) )
1.52 noro 2320: /* success */
2321: break;
2322: else if ( trace > 1 ) {
2323: /* failure */
2324: *rp = 0; return;
1.61 noro 2325: } else {
1.52 noro 2326: /* try the next modulus */
2327: m = get_lprime(++mindex);
1.61 noro 2328: /* reset the parameters */
1.82 noro 2329: if ( !ishomo && homo ) {
1.89 noro 2330: nd_init_ord(ord1);
1.61 noro 2331: nd_setup_parameters(nvar+1,wmax);
2332: } else {
2333: nd_init_ord(ord);
2334: nd_setup_parameters(nvar,max);
2335: }
2336: }
1.52 noro 2337: }
1.27 noro 2338: /* dp->p */
1.61 noro 2339: nd_bpe = cbpe;
1.73 noro 2340: nd_setup_parameters(nd_nvar,0);
1.61 noro 2341: for ( r = cand; r; r = NEXT(r) ) BDY(r) = (pointer)ndvtop(0,CO,vv,BDY(r));
1.27 noro 2342: MKLIST(*rp,cand);
1.1 noro 2343: }
2344:
1.61 noro 2345: void dltondl(int n,DL dl,UINT *r)
1.1 noro 2346: {
1.61 noro 2347: UINT *d;
1.57 noro 2348: int i,j,l,s,ord_l;
1.43 noro 2349: struct order_pair *op;
1.1 noro 2350:
2351: d = dl->d;
1.41 noro 2352: for ( i = 0; i < nd_wpd; i++ ) r[i] = 0;
1.43 noro 2353: if ( nd_blockmask ) {
2354: l = nd_blockmask->n;
2355: op = nd_blockmask->order_pair;
2356: for ( j = 0, s = 0; j < l; j++ ) {
2357: ord_l = op[j].length;
1.57 noro 2358: for ( i = 0; i < ord_l; i++, s++ ) PUT_EXP(r,s,d[s]);
1.43 noro 2359: }
2360: TD(r) = ndl_weight(r);
1.61 noro 2361: ndl_weight_mask(r);
1.43 noro 2362: } else {
1.56 noro 2363: for ( i = 0; i < n; i++ ) PUT_EXP(r,i,d[i]);
1.43 noro 2364: TD(r) = ndl_weight(r);
2365: }
1.1 noro 2366: }
2367:
1.61 noro 2368: DL ndltodl(int n,UINT *ndl)
1.1 noro 2369: {
2370: DL dl;
2371: int *d;
1.57 noro 2372: int i,j,l,s,ord_l;
1.43 noro 2373: struct order_pair *op;
1.1 noro 2374:
2375: NEWDL(dl,n);
1.34 noro 2376: dl->td = TD(ndl);
1.1 noro 2377: d = dl->d;
1.43 noro 2378: if ( nd_blockmask ) {
2379: l = nd_blockmask->n;
2380: op = nd_blockmask->order_pair;
2381: for ( j = 0, s = 0; j < l; j++ ) {
2382: ord_l = op[j].length;
1.57 noro 2383: for ( i = 0; i < ord_l; i++, s++ ) d[s] = GET_EXP(ndl,s);
1.43 noro 2384: }
2385: } else {
1.56 noro 2386: for ( i = 0; i < n; i++ ) d[i] = GET_EXP(ndl,i);
1.43 noro 2387: }
1.1 noro 2388: return dl;
2389: }
2390:
1.61 noro 2391: void ndl_print(UINT *dl)
1.1 noro 2392: {
2393: int n;
1.57 noro 2394: int i,j,l,ord_l,s,s0;
1.43 noro 2395: struct order_pair *op;
1.1 noro 2396:
2397: n = nd_nvar;
2398: printf("<<");
1.43 noro 2399: if ( nd_blockmask ) {
2400: l = nd_blockmask->n;
2401: op = nd_blockmask->order_pair;
2402: for ( j = 0, s = s0 = 0; j < l; j++ ) {
2403: ord_l = op[j].length;
1.57 noro 2404: for ( i = 0; i < ord_l; i++, s++ )
2405: printf(s==n-1?"%d":"%d,",GET_EXP(dl,s));
1.43 noro 2406: }
2407: } else {
1.56 noro 2408: for ( i = 0; i < n; i++ ) printf(i==n-1?"%d":"%d,",GET_EXP(dl,i));
1.43 noro 2409: }
1.1 noro 2410: printf(">>");
2411: }
2412:
2413: void nd_print(ND p)
2414: {
2415: NM m;
2416:
2417: if ( !p )
2418: printf("0\n");
2419: else {
2420: for ( m = BDY(p); m; m = NEXT(m) ) {
1.71 noro 2421: if ( CM(m) & 0x80000000 ) printf("+@_%d*",IFTOF(CM(m)));
2422: else printf("+%d*",CM(m));
1.14 noro 2423: ndl_print(DL(m));
1.1 noro 2424: }
2425: printf("\n");
2426: }
2427: }
2428:
1.16 noro 2429: void nd_print_q(ND p)
2430: {
2431: NM m;
2432:
2433: if ( !p )
2434: printf("0\n");
2435: else {
2436: for ( m = BDY(p); m; m = NEXT(m) ) {
2437: printf("+");
1.74 noro 2438: printexpr(CO,(Obj)CQ(m));
1.16 noro 2439: printf("*");
2440: ndl_print(DL(m));
2441: }
2442: printf("\n");
2443: }
2444: }
2445:
1.1 noro 2446: void ndp_print(ND_pairs d)
2447: {
2448: ND_pairs t;
2449:
1.34 noro 2450: for ( t = d; t; t = NEXT(t) ) printf("%d,%d ",t->i1,t->i2);
1.1 noro 2451: printf("\n");
2452: }
2453:
1.20 noro 2454: void nd_removecont(int mod,ND p)
1.16 noro 2455: {
2456: int i,n;
2457: Q *w;
2458: Q dvr,t;
2459: NM m;
1.21 noro 2460: struct oVECT v;
2461: N q,r;
1.16 noro 2462:
1.71 noro 2463: if ( mod == -1 ) nd_mul_c(mod,p,_invsf(HCM(p)));
2464: else if ( mod ) nd_mul_c(mod,p,invm(HCM(p),mod));
1.20 noro 2465: else {
2466: for ( m = BDY(p), n = 0; m; m = NEXT(m), n++ );
2467: w = (Q *)ALLOCA(n*sizeof(Q));
1.21 noro 2468: v.len = n;
2469: v.body = (pointer *)w;
1.34 noro 2470: for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) w[i] = CQ(m);
1.21 noro 2471: removecont_array(w,n);
2472: for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) CQ(m) = w[i];
1.16 noro 2473: }
2474: }
2475:
1.21 noro 2476: void nd_removecont2(ND p1,ND p2)
2477: {
2478: int i,n1,n2,n;
2479: Q *w;
2480: Q dvr,t;
2481: NM m;
2482: struct oVECT v;
2483: N q,r;
2484:
2485: if ( !p1 ) {
2486: nd_removecont(0,p2); return;
2487: } else if ( !p2 ) {
2488: nd_removecont(0,p1); return;
2489: }
2490: n1 = nd_length(p1);
2491: n2 = nd_length(p2);
2492: n = n1+n2;
2493: w = (Q *)ALLOCA(n*sizeof(Q));
2494: v.len = n;
2495: v.body = (pointer *)w;
1.34 noro 2496: for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) w[i] = CQ(m);
2497: for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = CQ(m);
1.21 noro 2498: removecont_array(w,n);
2499: for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) CQ(m) = w[i];
2500: for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) CQ(m) = w[i];
2501: }
2502:
1.20 noro 2503: void ndv_removecont(int mod,NDV p)
1.16 noro 2504: {
2505: int i,len;
2506: Q *w;
2507: Q dvr,t;
2508: NMV m;
2509:
1.71 noro 2510: if ( mod == -1 )
2511: ndv_mul_c(mod,p,_invsf(HCM(p)));
2512: else if ( mod )
1.20 noro 2513: ndv_mul_c(mod,p,invm(HCM(p),mod));
2514: else {
2515: len = p->len;
2516: w = (Q *)ALLOCA(len*sizeof(Q));
1.34 noro 2517: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) w[i] = CQ(m);
1.20 noro 2518: sortbynm(w,len);
2519: qltozl(w,len,&dvr);
2520: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) {
2521: divq(CQ(m),dvr,&t); CQ(m) = t;
2522: }
1.16 noro 2523: }
1.21 noro 2524: }
2525:
1.61 noro 2526: void ndv_homogenize(NDV p,int obpe,int oadv,EPOS oepos)
2527: {
2528: int len,i,max;
2529: NMV m,mr0,mr,t;
2530:
2531: len = p->len;
2532: for ( m = BDY(p), i = 0, max = 0; i < len; NMV_OADV(m), i++ )
2533: max = MAX(max,TD(DL(m)));
2534: mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p);
2535: m = (NMV)((char *)mr0+(len-1)*oadv);
2536: mr = (NMV)((char *)mr0+(len-1)*nmv_adv);
2537: t = (NMV)ALLOCA(nmv_adv);
2538: for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) {
2539: ndl_homogenize(DL(m),DL(t),obpe,oepos,max);
2540: CQ(mr) = CQ(m);
2541: ndl_copy(DL(t),DL(mr));
2542: }
2543: NV(p)++;
2544: BDY(p) = mr0;
2545: }
2546:
1.45 noro 2547: void ndv_dehomogenize(NDV p,struct order_spec *ord)
1.23 noro 2548: {
1.45 noro 2549: int i,j,adj,len,newnvar,newwpd,newadv,newexporigin;
1.23 noro 2550: Q *w;
2551: Q dvr,t;
2552: NMV m,r;
2553:
2554: len = p->len;
2555: newnvar = nd_nvar-1;
1.48 noro 2556: newexporigin = nd_get_exporigin(ord);
1.45 noro 2557: newwpd = newnvar/nd_epw+(newnvar%nd_epw?1:0)+newexporigin;
1.23 noro 2558: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ )
1.34 noro 2559: ndl_dehomogenize(DL(m));
1.23 noro 2560: if ( newwpd != nd_wpd ) {
1.90 noro 2561: newadv = ROUND_FOR_ALIGN(sizeof(struct oNMV)+(newwpd-1)*sizeof(UINT));
1.61 noro 2562: for ( m = r = BDY(p), i = 0; i < len; NMV_ADV(m), NDV_NADV(r), i++ ) {
1.45 noro 2563: CQ(r) = CQ(m);
2564: for ( j = 0; j < newexporigin; j++ ) DL(r)[j] = DL(m)[j];
2565: adj = nd_exporigin-newexporigin;
2566: for ( ; j < newwpd; j++ ) DL(r)[j] = DL(m)[j+adj];
1.23 noro 2567: }
2568: }
2569: NV(p)--;
2570: }
2571:
1.21 noro 2572: void removecont_array(Q *c,int n)
2573: {
2574: struct oVECT v;
2575: Q d0,d1,a,u,u1,gcd;
2576: int i;
2577: N qn,rn,gn;
2578: Q *q,*r;
2579:
2580: q = (Q *)ALLOCA(n*sizeof(Q));
2581: r = (Q *)ALLOCA(n*sizeof(Q));
2582: v.id = O_VECT; v.len = n; v.body = (pointer *)c;
2583: igcdv_estimate(&v,&d0);
2584: for ( i = 0; i < n; i++ ) {
2585: divn(NM(c[i]),NM(d0),&qn,&rn);
2586: NTOQ(qn,SGN(c[i])*SGN(d0),q[i]);
2587: NTOQ(rn,SGN(c[i]),r[i]);
2588: }
1.34 noro 2589: for ( i = 0; i < n; i++ ) if ( r[i] ) break;
1.21 noro 2590: if ( i < n ) {
2591: v.id = O_VECT; v.len = n; v.body = (pointer *)r;
2592: igcdv(&v,&d1);
2593: gcdn(NM(d0),NM(d1),&gn); NTOQ(gn,1,gcd);
2594: divsn(NM(d0),gn,&qn); NTOQ(qn,1,a);
2595: for ( i = 0; i < n; i++ ) {
2596: mulq(a,q[i],&u);
2597: if ( r[i] ) {
2598: divsn(NM(r[i]),gn,&qn); NTOQ(qn,SGN(r[i]),u1);
2599: addq(u,u1,&q[i]);
2600: } else
2601: q[i] = u;
2602: }
2603: }
1.34 noro 2604: for ( i = 0; i < n; i++ ) c[i] = q[i];
1.16 noro 2605: }
2606:
1.19 noro 2607: void nd_mul_c(int mod,ND p,int mul)
1.1 noro 2608: {
2609: NM m;
2610: int c,c1;
2611:
1.34 noro 2612: if ( !p ) return;
1.71 noro 2613: if ( mod == -1 )
2614: for ( m = BDY(p); m; m = NEXT(m) )
2615: CM(m) = _mulsf(CM(m),mul);
2616: else
2617: for ( m = BDY(p); m; m = NEXT(m) ) {
2618: c1 = CM(m); DMAR(c1,mul,0,mod,c); CM(m) = c;
2619: }
1.1 noro 2620: }
2621:
1.16 noro 2622: void nd_mul_c_q(ND p,Q mul)
2623: {
2624: NM m;
2625: Q c;
2626:
1.34 noro 2627: if ( !p ) return;
1.16 noro 2628: for ( m = BDY(p); m; m = NEXT(m) ) {
2629: mulq(CQ(m),mul,&c); CQ(m) = c;
2630: }
2631: }
2632:
1.61 noro 2633: void nd_mul_c_p(VL vl,ND p,P mul)
2634: {
2635: NM m;
2636: P c;
2637:
2638: if ( !p ) return;
2639: for ( m = BDY(p); m; m = NEXT(m) ) {
2640: mulp(vl,CP(m),mul,&c); CP(m) = c;
2641: }
2642: }
2643:
1.1 noro 2644: void nd_free(ND p)
2645: {
2646: NM t,s;
2647:
1.34 noro 2648: if ( !p ) return;
1.1 noro 2649: t = BDY(p);
2650: while ( t ) {
2651: s = NEXT(t);
2652: FREENM(t);
2653: t = s;
2654: }
2655: FREEND(p);
2656: }
2657:
1.23 noro 2658: void ndv_free(NDV p)
2659: {
2660: GC_free(BDY(p));
2661: }
2662:
1.61 noro 2663: void nd_append_red(UINT *d,int i)
1.1 noro 2664: {
1.13 noro 2665: RHist m,m0;
1.1 noro 2666: int h;
2667:
1.13 noro 2668: NEWRHist(m);
1.34 noro 2669: h = ndl_hash_value(d);
1.13 noro 2670: m->index = i;
1.14 noro 2671: ndl_copy(d,DL(m));
1.1 noro 2672: NEXT(m) = nd_red[h];
2673: nd_red[h] = m;
2674: }
2675:
1.61 noro 2676: UINT *ndv_compute_bound(NDV p)
1.1 noro 2677: {
1.61 noro 2678: UINT *d1,*d2,*t;
2679: UINT u;
1.57 noro 2680: int i,j,k,l,len,ind;
1.45 noro 2681: NMV m;
1.1 noro 2682:
2683: if ( !p )
2684: return 0;
1.61 noro 2685: d1 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
2686: d2 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
1.45 noro 2687: len = LEN(p);
2688: m = BDY(p); ndl_copy(DL(m),d1); NMV_ADV(m);
2689: for ( i = 1; i < len; i++, NMV_ADV(m) ) {
1.14 noro 2690: ndl_lcm(DL(m),d1,d2);
1.1 noro 2691: t = d1; d1 = d2; d2 = t;
2692: }
1.12 noro 2693: l = nd_nvar+31;
1.61 noro 2694: t = (UINT *)MALLOC_ATOMIC(l*sizeof(UINT));
1.57 noro 2695: for ( i = nd_exporigin, ind = 0; i < nd_wpd; i++ ) {
2696: u = d1[i];
2697: k = (nd_epw-1)*nd_bpe;
2698: for ( j = 0; j < nd_epw; j++, k -= nd_bpe, ind++ )
2699: t[ind] = (u>>k)&nd_mask0;
2700: }
2701: for ( ; ind < l; ind++ ) t[ind] = 0;
1.1 noro 2702: return t;
2703: }
2704:
1.48 noro 2705: int nd_get_exporigin(struct order_spec *ord)
2706: {
1.51 noro 2707: switch ( ord->id ) {
1.96 noro 2708: case 0: case 2:
1.48 noro 2709: return 1;
1.41 noro 2710: case 1:
2711: /* block order */
1.43 noro 2712: /* d[0]:weight d[1]:w0,...,d[nd_exporigin-1]:w(n-1) */
1.48 noro 2713: return ord->ord.block.length+1;
1.96 noro 2714: case 3:
2715: error("nd_get_exporigin : composite order is not supported yet.");
1.41 noro 2716: }
1.48 noro 2717: }
2718:
1.61 noro 2719: void nd_setup_parameters(int nvar,int max) {
1.79 noro 2720: int i,j,n,elen,ord_o,ord_l,l,s,wpd;
1.57 noro 2721: struct order_pair *op;
1.48 noro 2722:
1.73 noro 2723: nd_nvar = nvar;
1.79 noro 2724: if ( max ) {
1.83 noro 2725: /* XXX */
2726: if ( do_weyl ) nd_bpe = 32;
2727: else if ( max < 2 ) nd_bpe = 1;
1.79 noro 2728: else if ( max < 4 ) nd_bpe = 2;
2729: else if ( max < 8 ) nd_bpe = 3;
2730: else if ( max < 16 ) nd_bpe = 4;
2731: else if ( max < 32 ) nd_bpe = 5;
2732: else if ( max < 64 ) nd_bpe = 6;
2733: else if ( max < 256 ) nd_bpe = 8;
2734: else if ( max < 1024 ) nd_bpe = 10;
2735: else if ( max < 65536 ) nd_bpe = 16;
2736: else nd_bpe = 32;
2737: }
1.61 noro 2738: nd_epw = (sizeof(UINT)*8)/nd_bpe;
1.48 noro 2739: elen = nd_nvar/nd_epw+(nd_nvar%nd_epw?1:0);
2740: nd_exporigin = nd_get_exporigin(nd_ord);
1.79 noro 2741: wpd = nd_exporigin+elen;
2742: if ( wpd != nd_wpd ) {
2743: nd_free_private_storage();
2744: nd_wpd = wpd;
2745: }
1.1 noro 2746: if ( nd_bpe < 32 ) {
2747: nd_mask0 = (1<<nd_bpe)-1;
2748: } else {
2749: nd_mask0 = 0xffffffff;
2750: }
2751: bzero(nd_mask,sizeof(nd_mask));
2752: nd_mask1 = 0;
2753: for ( i = 0; i < nd_epw; i++ ) {
2754: nd_mask[nd_epw-i-1] = (nd_mask0<<(i*nd_bpe));
2755: nd_mask1 |= (1<<(nd_bpe-1))<<(i*nd_bpe);
2756: }
1.90 noro 2757: nmv_adv = ROUND_FOR_ALIGN(sizeof(struct oNMV)+(nd_wpd-1)*sizeof(UINT));
1.57 noro 2758: nd_epos = nd_create_epos(nd_ord);
1.43 noro 2759: nd_blockmask = nd_create_blockmask(nd_ord);
1.96 noro 2760: nd_work_vector = (int *)REALLOC(nd_work_vector,nd_nvar*sizeof(int));
1.1 noro 2761: }
2762:
1.20 noro 2763: ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d)
1.1 noro 2764: {
1.37 noro 2765: int i,obpe,oadv,h;
1.71 noro 2766: static NM prev_nm_free_list;
2767: static ND_pairs prev_ndp_free_list;
1.13 noro 2768: RHist mr0,mr;
2769: RHist r;
1.37 noro 2770: RHist *old_red;
1.71 noro 2771: ND_pairs s0,s,t;
1.43 noro 2772: EPOS oepos;
1.15 noro 2773:
1.1 noro 2774: obpe = nd_bpe;
1.11 noro 2775: oadv = nmv_adv;
1.43 noro 2776: oepos = nd_epos;
1.63 noro 2777: if ( obpe < 2 ) nd_bpe = 2;
2778: else if ( obpe < 3 ) nd_bpe = 3;
1.62 noro 2779: else if ( obpe < 4 ) nd_bpe = 4;
1.63 noro 2780: else if ( obpe < 5 ) nd_bpe = 5;
1.34 noro 2781: else if ( obpe < 6 ) nd_bpe = 6;
2782: else if ( obpe < 8 ) nd_bpe = 8;
1.63 noro 2783: else if ( obpe < 10 ) nd_bpe = 10;
1.34 noro 2784: else if ( obpe < 16 ) nd_bpe = 16;
2785: else if ( obpe < 32 ) nd_bpe = 32;
2786: else error("nd_reconstruct : exponent too large");
1.5 noro 2787:
1.73 noro 2788: nd_setup_parameters(nd_nvar,0);
1.1 noro 2789: prev_nm_free_list = _nm_free_list;
2790: prev_ndp_free_list = _ndp_free_list;
2791: _nm_free_list = 0;
2792: _ndp_free_list = 0;
1.53 noro 2793: for ( i = nd_psn-1; i >= 0; i-- ) ndv_realloc(nd_ps[i],obpe,oadv,oepos);
2794: if ( trace )
2795: for ( i = nd_psn-1; i >= 0; i-- )
2796: ndv_realloc(nd_ps_trace[i],obpe,oadv,oepos);
1.1 noro 2797: s0 = 0;
2798: for ( t = d; t; t = NEXT(t) ) {
2799: NEXTND_pairs(s0,s);
2800: s->i1 = t->i1;
2801: s->i2 = t->i2;
1.14 noro 2802: SG(s) = SG(t);
1.61 noro 2803: ndl_reconstruct(LCM(t),LCM(s),obpe,oepos);
1.1 noro 2804: }
1.37 noro 2805:
2806: old_red = (RHist *)ALLOCA(REDTAB_LEN*sizeof(RHist));
1.6 noro 2807: for ( i = 0; i < REDTAB_LEN; i++ ) {
1.37 noro 2808: old_red[i] = nd_red[i];
2809: nd_red[i] = 0;
2810: }
2811: for ( i = 0; i < REDTAB_LEN; i++ )
2812: for ( r = old_red[i]; r; r = NEXT(r) ) {
2813: NEWRHist(mr);
1.13 noro 2814: mr->index = r->index;
1.20 noro 2815: SG(mr) = SG(r);
1.61 noro 2816: ndl_reconstruct(DL(r),DL(mr),obpe,oepos);
1.37 noro 2817: h = ndl_hash_value(DL(mr));
2818: NEXT(mr) = nd_red[h];
2819: nd_red[h] = mr;
1.6 noro 2820: }
1.37 noro 2821: for ( i = 0; i < REDTAB_LEN; i++ ) old_red[i] = 0;
2822: old_red = 0;
1.11 noro 2823: for ( i = 0; i < nd_psn; i++ ) {
1.20 noro 2824: NEWRHist(r); SG(r) = SG(nd_psh[i]);
1.61 noro 2825: ndl_reconstruct(DL(nd_psh[i]),DL(r),obpe,oepos);
1.13 noro 2826: nd_psh[i] = r;
1.11 noro 2827: }
1.1 noro 2828: if ( s0 ) NEXT(s) = 0;
2829: prev_nm_free_list = 0;
2830: prev_ndp_free_list = 0;
1.71 noro 2831: #if 0
1.1 noro 2832: GC_gcollect();
1.71 noro 2833: #endif
1.1 noro 2834: return s0;
2835: }
2836:
1.61 noro 2837: void ndl_reconstruct(UINT *d,UINT *r,int obpe,EPOS oepos)
1.1 noro 2838: {
1.57 noro 2839: int n,i,ei,oepw,omask0,j,s,ord_l,l;
1.43 noro 2840: struct order_pair *op;
1.1 noro 2841:
2842: n = nd_nvar;
1.61 noro 2843: oepw = (sizeof(UINT)*8)/obpe;
1.43 noro 2844: omask0 = (1<<obpe)-1;
1.34 noro 2845: TD(r) = TD(d);
1.41 noro 2846: for ( i = nd_exporigin; i < nd_wpd; i++ ) r[i] = 0;
1.43 noro 2847: if ( nd_blockmask ) {
2848: l = nd_blockmask->n;
2849: op = nd_blockmask->order_pair;
2850: for ( i = 1; i < nd_exporigin; i++ )
2851: r[i] = d[i];
2852: for ( j = 0, s = 0; j < l; j++ ) {
2853: ord_l = op[j].length;
1.57 noro 2854: for ( i = 0; i < ord_l; i++, s++ ) {
2855: ei = GET_EXP_OLD(d,s);
2856: PUT_EXP(r,s,ei);
2857: }
1.1 noro 2858: }
1.43 noro 2859: } else {
1.56 noro 2860: for ( i = 0; i < n; i++ ) {
2861: ei = GET_EXP_OLD(d,i);
2862: PUT_EXP(r,i,ei);
2863: }
1.1 noro 2864: }
2865: }
1.3 noro 2866:
1.6 noro 2867: ND nd_copy(ND p)
2868: {
2869: NM m,mr,mr0;
1.41 noro 2870: int c,n;
1.6 noro 2871: ND r;
2872:
2873: if ( !p )
2874: return 0;
2875: else {
2876: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
2877: NEXTNM(mr0,mr);
1.14 noro 2878: CM(mr) = CM(m);
2879: ndl_copy(DL(m),DL(mr));
1.6 noro 2880: }
2881: NEXT(mr) = 0;
1.31 noro 2882: MKND(NV(p),mr0,LEN(p),r);
1.14 noro 2883: SG(r) = SG(p);
1.6 noro 2884: return r;
2885: }
2886: }
2887:
1.53 noro 2888: int nd_sp(int mod,int trace,ND_pairs p,ND *rp)
1.11 noro 2889: {
2890: NM m;
2891: NDV p1,p2;
2892: ND t1,t2;
1.61 noro 2893: UINT *lcm;
1.31 noro 2894: int td;
1.11 noro 2895:
1.77 noro 2896: if ( !mod && nd_demand ) {
2897: p1 = ndv_load(p->i1); p2 = ndv_load(p->i2);
1.53 noro 2898: } else {
1.77 noro 2899: if ( trace ) {
2900: p1 = nd_ps_trace[p->i1]; p2 = nd_ps_trace[p->i2];
2901: } else {
2902: p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2];
2903: }
1.20 noro 2904: }
1.34 noro 2905: lcm = LCM(p);
1.11 noro 2906: NEWNM(m);
1.20 noro 2907: CQ(m) = HCQ(p2);
1.34 noro 2908: ndl_sub(lcm,HDL(p1),DL(m));
1.56 noro 2909: if ( ndl_check_bound2(p->i1,DL(m)) )
2910: return 0;
1.55 noro 2911: t1 = ndv_mul_nm(mod,m,p1);
1.71 noro 2912: if ( mod == -1 ) CM(m) = _chsgnsf(HCM(p1));
2913: else if ( mod ) CM(m) = mod-HCM(p1);
1.34 noro 2914: else chsgnq(HCQ(p1),&CQ(m));
2915: ndl_sub(lcm,HDL(p2),DL(m));
1.14 noro 2916: if ( ndl_check_bound2(p->i2,DL(m)) ) {
1.11 noro 2917: nd_free(t1);
2918: return 0;
2919: }
1.55 noro 2920: t2 = ndv_mul_nm(mod,m,p2);
1.31 noro 2921: *rp = nd_add(mod,t1,t2);
1.11 noro 2922: FREENM(m);
2923: return 1;
2924: }
2925:
1.19 noro 2926: void ndv_mul_c(int mod,NDV p,int mul)
1.11 noro 2927: {
2928: NMV m;
2929: int c,c1,len,i;
2930:
1.34 noro 2931: if ( !p ) return;
1.14 noro 2932: len = LEN(p);
1.71 noro 2933: if ( mod == -1 )
2934: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) )
2935: CM(m) = _mulsf(CM(m),mul);
2936: else
2937: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
2938: c1 = CM(m); DMAR(c1,mul,0,mod,c); CM(m) = c;
2939: }
1.11 noro 2940: }
2941:
1.16 noro 2942: void ndv_mul_c_q(NDV p,Q mul)
2943: {
2944: NMV m;
2945: Q c;
2946: int len,i;
2947:
1.34 noro 2948: if ( !p ) return;
1.16 noro 2949: len = LEN(p);
2950: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
2951: mulq(CQ(m),mul,&c); CQ(m) = c;
2952: }
2953: }
2954:
1.55 noro 2955: ND weyl_ndv_mul_nm(int mod,NM m0,NDV p) {
2956: int n2,i,j,l,n,tlen;
1.61 noro 2957: UINT *d0;
1.55 noro 2958: NM *tab,*psum;
2959: ND s,r;
2960: NM t;
2961: NMV m1;
2962:
2963: if ( !p ) return 0;
2964: n = NV(p); n2 = n>>1;
2965: d0 = DL(m0);
2966: l = LEN(p);
2967: for ( i = 0, tlen = 1; i < n2; i++ ) tlen *= (GET_EXP(d0,n2+i)+1);
2968: tab = (NM *)ALLOCA(tlen*sizeof(NM));
2969: psum = (NM *)ALLOCA(tlen*sizeof(NM));
2970: for ( i = 0; i < tlen; i++ ) psum[i] = 0;
1.56 noro 2971: m1 = (NMV)(((char *)BDY(p))+nmv_adv*(l-1));
2972: for ( i = l-1; i >= 0; i--, NMV_PREV(m1) ) {
1.55 noro 2973: /* m0(NM) * m1(NMV) => tab(NM) */
1.56 noro 2974: weyl_mul_nm_nmv(n,mod,m0,m1,tab,tlen);
1.55 noro 2975: for ( j = 0; j < tlen; j++ ) {
2976: if ( tab[j] ) {
2977: NEXT(tab[j]) = psum[j]; psum[j] = tab[j];
2978: }
2979: }
2980: }
2981: for ( i = tlen-1, r = 0; i >= 0; i-- )
2982: if ( psum[i] ) {
2983: for ( j = 0, t = psum[i]; t; t = NEXT(t), j++ );
2984: MKND(n,psum[i],j,s);
2985: r = nd_add(mod,r,s);
2986: }
1.56 noro 2987: if ( r ) SG(r) = SG(p)+TD(d0);
2988: return r;
1.55 noro 2989: }
2990:
1.56 noro 2991: /* product of monomials */
2992: /* XXX block order is not handled correctly */
2993:
1.55 noro 2994: void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *tab,int tlen)
2995: {
1.56 noro 2996: int i,n2,j,s,curlen,homo,h,a,b,k,l,u,min;
1.61 noro 2997: UINT *d0,*d1,*d,*dt,*ctab;
1.56 noro 2998: Q *ctab_q;
2999: Q q,q1;
1.61 noro 3000: UINT c0,c1,c;
1.55 noro 3001: NM *p;
3002: NM m,t;
3003:
3004: for ( i = 0; i < tlen; i++ ) tab[i] = 0;
3005: if ( !m0 || !m1 ) return;
3006: d0 = DL(m0); d1 = DL(m1); n2 = n>>1;
3007: NEWNM(m); d = DL(m);
1.56 noro 3008: if ( mod ) {
3009: c0 = CM(m0); c1 = CM(m1); DMAR(c0,c1,0,mod,c); CM(m) = c;
3010: } else
3011: mulq(CQ(m0),CQ(m1),&CQ(m));
1.55 noro 3012: for ( i = 0; i < nd_wpd; i++ ) d[i] = 0;
3013: homo = n&1 ? 1 : 0;
3014: if ( homo ) {
3015: /* offset of h-degree */
3016: h = GET_EXP(d0,n-1)+GET_EXP(d1,n-1);
3017: PUT_EXP(DL(m),n-1,h);
3018: TD(DL(m)) = h;
1.61 noro 3019: if ( nd_blockmask ) ndl_weight_mask(DL(m));
1.55 noro 3020: }
3021: tab[0] = m;
3022: NEWNM(m); d = DL(m);
1.57 noro 3023: for ( i = 0, curlen = 1; i < n2; i++ ) {
1.55 noro 3024: a = GET_EXP(d0,i); b = GET_EXP(d1,n2+i);
3025: k = GET_EXP(d0,n2+i); l = GET_EXP(d1,i);
3026: /* xi^a*(Di^k*xi^l)*Di^b */
3027: a += l; b += k;
1.56 noro 3028: s = MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i);
1.55 noro 3029: if ( !k || !l ) {
3030: for ( j = 0; j < curlen; j++ )
1.56 noro 3031: if ( t = tab[j] ) {
3032: dt = DL(t);
3033: PUT_EXP(dt,i,a); PUT_EXP(dt,n2+i,b); TD(dt) += s;
1.61 noro 3034: if ( nd_blockmask ) ndl_weight_mask(dt);
1.55 noro 3035: }
3036: curlen *= k+1;
3037: continue;
3038: }
3039: min = MIN(k,l);
1.56 noro 3040: if ( mod ) {
1.61 noro 3041: ctab = (UINT *)ALLOCA((min+1)*sizeof(UINT));
1.56 noro 3042: mkwcm(k,l,mod,ctab);
3043: } else {
3044: ctab_q = (Q *)ALLOCA((min+1)*sizeof(Q));
3045: mkwc(k,l,ctab_q);
3046: }
1.57 noro 3047: for ( j = min; j >= 0; j-- ) {
1.56 noro 3048: for ( u = 0; u < nd_wpd; u++ ) d[u] = 0;
1.55 noro 3049: PUT_EXP(d,i,a-j); PUT_EXP(d,n2+i,b-j);
1.56 noro 3050: h = MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i);
1.55 noro 3051: if ( homo ) {
3052: TD(d) = s;
1.56 noro 3053: PUT_EXP(d,n-1,s-h);
1.55 noro 3054: } else TD(d) = h;
1.61 noro 3055: if ( nd_blockmask ) ndl_weight_mask(d);
1.56 noro 3056: if ( mod ) c = ctab[j];
3057: else q = ctab_q[j];
1.57 noro 3058: p = tab+curlen*j;
3059: if ( j == 0 ) {
3060: for ( u = 0; u < curlen; u++, p++ ) {
3061: if ( tab[u] ) {
3062: ndl_addto(DL(tab[u]),d);
3063: if ( mod ) {
3064: c0 = CM(tab[u]); DMAR(c0,c,0,mod,c1); CM(tab[u]) = c1;
3065: } else {
3066: mulq(CQ(tab[u]),q,&q1); CQ(tab[u]) = q1;
3067: }
3068: }
1.56 noro 3069: }
1.57 noro 3070: } else {
3071: for ( u = 0; u < curlen; u++, p++ ) {
3072: if ( tab[u] ) {
3073: NEWNM(t);
3074: ndl_add(DL(tab[u]),d,DL(t));
3075: if ( mod ) {
3076: c0 = CM(tab[u]); DMAR(c0,c,0,mod,c1); CM(t) = c1;
3077: } else
3078: mulq(CQ(tab[u]),q,&CQ(t));
3079: *p = t;
3080: }
1.55 noro 3081: }
3082: }
3083: }
3084: curlen *= k+1;
3085: }
3086: FREENM(m);
3087: }
3088:
1.63 noro 3089: ND ndv_mul_nm_symbolic(NM m0,NDV p)
3090: {
3091: NM mr,mr0;
3092: NMV m;
3093: UINT *d,*dt,*dm;
3094: int c,n,td,i,c1,c2,len;
3095: Q q;
3096: ND r;
3097:
3098: if ( !p ) return 0;
3099: else {
3100: n = NV(p); m = BDY(p);
3101: d = DL(m0);
3102: len = LEN(p);
3103: mr0 = 0;
3104: td = TD(d);
3105: c = CM(m0);
3106: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
3107: NEXTNM(mr0,mr);
3108: CM(mr) = 1;
3109: ndl_add(DL(m),d,DL(mr));
3110: }
3111: NEXT(mr) = 0;
3112: MKND(NV(p),mr0,len,r);
3113: SG(r) = SG(p) + TD(d);
3114: return r;
3115: }
3116: }
3117:
1.55 noro 3118: ND ndv_mul_nm(int mod,NM m0,NDV p)
1.9 noro 3119: {
3120: NM mr,mr0;
3121: NMV m;
1.61 noro 3122: UINT *d,*dt,*dm;
1.9 noro 3123: int c,n,td,i,c1,c2,len;
1.16 noro 3124: Q q;
1.9 noro 3125: ND r;
3126:
1.34 noro 3127: if ( !p ) return 0;
1.55 noro 3128: else if ( do_weyl )
1.71 noro 3129: if ( mod == -1 )
3130: error("ndv_mul_nm : not implemented (weyl)");
3131: else
3132: return weyl_ndv_mul_nm(mod,m0,p);
1.9 noro 3133: else {
3134: n = NV(p); m = BDY(p);
1.34 noro 3135: d = DL(m0);
1.14 noro 3136: len = LEN(p);
1.9 noro 3137: mr0 = 0;
1.34 noro 3138: td = TD(d);
1.71 noro 3139: if ( mod == -1 ) {
3140: c = CM(m0);
3141: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
3142: NEXTNM(mr0,mr);
3143: CM(mr) = _mulsf(CM(m),c);
3144: ndl_add(DL(m),d,DL(mr));
3145: }
3146: } else if ( mod ) {
1.16 noro 3147: c = CM(m0);
3148: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
3149: NEXTNM(mr0,mr);
3150: c1 = CM(m);
1.19 noro 3151: DMAR(c1,c,0,mod,c2);
1.16 noro 3152: CM(mr) = c2;
3153: ndl_add(DL(m),d,DL(mr));
3154: }
3155: } else {
3156: q = CQ(m0);
3157: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
3158: NEXTNM(mr0,mr);
3159: mulq(CQ(m),q,&CQ(mr));
3160: ndl_add(DL(m),d,DL(mr));
3161: }
1.4 noro 3162: }
1.9 noro 3163: NEXT(mr) = 0;
1.31 noro 3164: MKND(NV(p),mr0,len,r);
1.34 noro 3165: SG(r) = SG(p) + TD(d);
1.9 noro 3166: return r;
1.4 noro 3167: }
3168: }
3169:
1.43 noro 3170: void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos)
1.11 noro 3171: {
1.13 noro 3172: NMV m,mr,mr0,t;
3173: int len,i,k;
1.11 noro 3174:
1.61 noro 3175: if ( !p ) return;
3176: m = BDY(p); len = LEN(p);
3177: mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p);
3178: m = (NMV)((char *)mr0+(len-1)*oadv);
3179: mr = (NMV)((char *)mr0+(len-1)*nmv_adv);
3180: t = (NMV)ALLOCA(nmv_adv);
3181: for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) {
3182: CQ(t) = CQ(m);
3183: for ( k = 0; k < nd_wpd; k++ ) DL(t)[k] = 0;
3184: ndl_reconstruct(DL(m),DL(t),obpe,oepos);
3185: CQ(mr) = CQ(t);
3186: ndl_copy(DL(t),DL(mr));
3187: }
3188: BDY(p) = mr0;
3189: }
3190:
3191: NDV ndv_dup_realloc(NDV p,int obpe,int oadv,EPOS oepos)
3192: {
3193: NMV m,mr,mr0;
3194: int len,i;
3195: NDV r;
1.11 noro 3196:
1.61 noro 3197: if ( !p ) return 0;
3198: m = BDY(p); len = LEN(p);
3199: mr0 = mr = (NMV)MALLOC(len*nmv_adv);
3200: for ( i = 0; i < len; i++, NMV_OADV(m), NMV_ADV(mr) ) {
3201: ndl_zero(DL(mr));
3202: ndl_reconstruct(DL(m),DL(mr),obpe,oepos);
3203: CQ(mr) = CQ(m);
1.11 noro 3204: }
1.61 noro 3205: MKNDV(NV(p),mr0,len,r);
3206: SG(r) = SG(p);
3207: return r;
1.11 noro 3208: }
3209:
1.61 noro 3210: /* duplicate p */
3211:
3212: NDV ndv_dup(int mod,NDV p)
1.3 noro 3213: {
3214: NDV d;
1.61 noro 3215: NMV t,m,m0;
1.3 noro 3216: int i,len;
3217:
1.34 noro 3218: if ( !p ) return 0;
1.31 noro 3219: len = LEN(p);
1.34 noro 3220: m0 = m = (NMV)(mod?MALLOC_ATOMIC(len*nmv_adv):MALLOC(len*nmv_adv));
1.61 noro 3221: for ( t = BDY(p), i = 0; i < len; i++, NMV_ADV(t), NMV_ADV(m) ) {
1.14 noro 3222: ndl_copy(DL(t),DL(m));
1.16 noro 3223: CQ(m) = CQ(t);
1.3 noro 3224: }
3225: MKNDV(NV(p),m0,len,d);
1.23 noro 3226: SG(d) = SG(p);
3227: return d;
3228: }
3229:
1.63 noro 3230: ND nd_dup(ND p)
3231: {
3232: ND d;
3233: NM t,m,m0;
3234:
3235: if ( !p ) return 0;
3236: for ( m0 = 0, t = BDY(p); t; t = NEXT(t) ) {
3237: NEXTNM(m0,m);
3238: ndl_copy(DL(t),DL(m));
3239: CQ(m) = CQ(t);
3240: }
3241: if ( m0 ) NEXT(m) = 0;
3242: MKND(NV(p),m0,LEN(p),d);
3243: SG(d) = SG(p);
3244: return d;
3245: }
3246:
1.61 noro 3247: /* XXX if p->len == 0 then it represents 0 */
3248:
3249: void ndv_mod(int mod,NDV p)
3250: {
3251: NMV t,d;
3252: int r;
3253: int i,len,dlen;
1.71 noro 3254: Obj gfs;
1.61 noro 3255:
3256: if ( !p ) return;
3257: len = LEN(p);
3258: dlen = 0;
1.71 noro 3259: if ( mod == -1 )
3260: for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) {
3261: simp_ff((Obj)CP(t),&gfs);
3262: r = FTOIF(CONT((GFS)gfs));
1.61 noro 3263: CM(d) = r;
3264: ndl_copy(DL(t),DL(d));
3265: NMV_ADV(d);
3266: dlen++;
3267: }
1.71 noro 3268: else
3269: for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) {
3270: r = rem(NM(CQ(t)),mod);
3271: if ( r ) {
3272: if ( SGN(CQ(t)) < 0 )
3273: r = mod-r;
3274: CM(d) = r;
3275: ndl_copy(DL(t),DL(d));
3276: NMV_ADV(d);
3277: dlen++;
3278: }
3279: }
1.61 noro 3280: LEN(p) = dlen;
3281: }
3282:
3283: NDV ptondv(VL vl,VL dvl,P p)
3284: {
3285: ND nd;
3286:
3287: nd = ptond(vl,dvl,p);
3288: return ndtondv(0,nd);
3289: }
3290:
3291: ND ptond(VL vl,VL dvl,P p)
1.23 noro 3292: {
1.61 noro 3293: int n,i,j,k,e;
3294: VL tvl;
3295: V v;
3296: DCP dc;
3297: DCP *w;
3298: ND r,s,t,u;
3299: P x;
3300: int c;
3301: UINT *d;
1.23 noro 3302: NM m,m0;
1.61 noro 3303:
3304: if ( !p )
3305: return 0;
3306: else if ( NUM(p) ) {
3307: NEWNM(m);
3308: ndl_zero(DL(m));
3309: CQ(m) = (Q)p;
3310: NEXT(m) = 0;
3311: MKND(nd_nvar,m,1,r);
3312: SG(r) = 0;
3313: return r;
3314: } else {
3315: for ( dc = DC(p), k = 0; dc; dc = NEXT(dc), k++ );
3316: w = (DCP *)ALLOCA(k*sizeof(DCP));
3317: for ( dc = DC(p), j = 0; j < k; dc = NEXT(dc), j++ ) w[j] = dc;
3318: for ( i = 0, tvl = dvl, v = VR(p);
1.98 ! noro 3319: tvl && tvl->v != v; tvl = NEXT(tvl), i++ );
1.61 noro 3320: if ( !tvl ) {
3321: for ( j = k-1, s = 0, MKV(v,x); j >= 0; j-- ) {
3322: t = ptond(vl,dvl,COEF(w[j]));
3323: pwrp(vl,x,DEG(w[j]),&p);
3324: nd_mul_c_p(CO,t,p); s = nd_add(0,s,t);
3325: }
3326: return s;
3327: } else {
3328: NEWNM(m0); d = DL(m0);
3329: for ( j = k-1, s = 0; j >= 0; j-- ) {
3330: ndl_zero(d); e = QTOS(DEG(w[j])); PUT_EXP(d,i,e);
3331: TD(d) = MUL_WEIGHT(e,i);
3332: if ( nd_blockmask) ndl_weight_mask(d);
3333: t = ptond(vl,dvl,COEF(w[j]));
3334: for ( m = BDY(t); m; m = NEXT(m) )
3335: ndl_addto(DL(m),d);
3336: SG(t) += TD(d);
3337: s = nd_add(0,s,t);
3338: }
3339: FREENM(m0);
3340: return s;
3341: }
3342: }
3343: }
3344:
3345: P ndvtop(int mod,VL vl,VL dvl,NDV p)
3346: {
3347: VL tvl;
3348: int len,n,j,i,e;
3349: NMV m;
3350: Q q;
3351: P c;
3352: UINT *d;
3353: P s,r,u,t,w;
1.71 noro 3354: GFS gfs;
1.23 noro 3355:
1.34 noro 3356: if ( !p ) return 0;
1.61 noro 3357: else {
3358: len = LEN(p);
3359: n = NV(p);
3360: m = (NMV)(((char *)BDY(p))+nmv_adv*(len-1));
3361: for ( j = len-1, s = 0; j >= 0; j--, NMV_PREV(m) ) {
1.71 noro 3362: if ( mod == -1 ) {
3363: e = IFTOF(CM(m)); MKGFS(e,gfs); c = (P)gfs;
3364: } else if ( mod ) {
1.61 noro 3365: STOQ(CM(m),q); c = (P)q;
3366: } else
3367: c = CP(m);
3368: d = DL(m);
3369: for ( i = 0, t = c, tvl = dvl; i < n; tvl = NEXT(tvl), i++ ) {
3370: MKV(tvl->v,r); e = GET_EXP(d,i); STOQ(e,q);
3371: pwrp(vl,r,q,&u); mulp(vl,t,u,&w); t = w;
3372: }
3373: addp(vl,s,t,&u); s = u;
3374: }
3375: return s;
1.23 noro 3376: }
1.3 noro 3377: }
3378:
1.61 noro 3379: NDV ndtondv(int mod,ND p)
1.11 noro 3380: {
3381: NDV d;
1.61 noro 3382: NMV m,m0;
3383: NM t;
3384: int i,len;
1.11 noro 3385:
1.34 noro 3386: if ( !p ) return 0;
1.61 noro 3387: len = LEN(p);
1.74 noro 3388: if ( mod )
3389: m0 = m = (NMV)GC_malloc_atomic_ignore_off_page(len*nmv_adv);
3390: else
3391: m0 = m = MALLOC(len*nmv_adv);
3392: ndv_alloc += nmv_adv*len;
1.61 noro 3393: for ( t = BDY(p), i = 0; t; t = NEXT(t), i++, NMV_ADV(m) ) {
3394: ndl_copy(DL(t),DL(m));
3395: CQ(m) = CQ(t);
1.11 noro 3396: }
1.61 noro 3397: MKNDV(NV(p),m0,len,d);
1.14 noro 3398: SG(d) = SG(p);
1.11 noro 3399: return d;
3400: }
3401:
1.61 noro 3402: ND ndvtond(int mod,NDV p)
1.11 noro 3403: {
1.61 noro 3404: ND d;
3405: NM m,m0;
1.11 noro 3406: NMV t;
1.61 noro 3407: int i,len;
1.11 noro 3408:
1.34 noro 3409: if ( !p ) return 0;
1.11 noro 3410: m0 = 0;
1.61 noro 3411: len = p->len;
3412: for ( t = BDY(p), i = 0; i < len; NMV_ADV(t), i++ ) {
3413: NEXTNM(m0,m);
3414: ndl_copy(DL(t),DL(m));
3415: CQ(m) = CQ(t);
1.11 noro 3416: }
3417: NEXT(m) = 0;
1.61 noro 3418: MKND(NV(p),m0,len,d);
1.14 noro 3419: SG(d) = SG(p);
1.11 noro 3420: return d;
3421: }
3422:
1.3 noro 3423: void ndv_print(NDV p)
3424: {
3425: NMV m;
3426: int i,len;
3427:
1.34 noro 3428: if ( !p ) printf("0\n");
1.3 noro 3429: else {
1.14 noro 3430: len = LEN(p);
1.3 noro 3431: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
1.71 noro 3432: if ( CM(m) & 0x80000000 ) printf("+@_%d*",IFTOF(CM(m)));
3433: else printf("+%d*",CM(m));
1.16 noro 3434: ndl_print(DL(m));
3435: }
3436: printf("\n");
3437: }
3438: }
3439:
3440: void ndv_print_q(NDV p)
3441: {
3442: NMV m;
3443: int i,len;
3444:
1.34 noro 3445: if ( !p ) printf("0\n");
1.16 noro 3446: else {
3447: len = LEN(p);
3448: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
3449: printf("+");
1.74 noro 3450: printexpr(CO,(Obj)CQ(m));
1.16 noro 3451: printf("*");
1.14 noro 3452: ndl_print(DL(m));
1.3 noro 3453: }
3454: printf("\n");
3455: }
1.25 noro 3456: }
3457:
1.61 noro 3458: NODE ndv_reducebase(NODE x)
1.27 noro 3459: {
3460: int len,i,j;
3461: NDV *w;
3462: NODE t,t0;
3463:
3464: len = length(x);
3465: w = (NDV *)ALLOCA(len*sizeof(NDV));
3466: for ( i = 0, t = x; i < len; i++, t = NEXT(t) ) w[i] = BDY(t);
3467: for ( i = 0; i < len; i++ ) {
3468: for ( j = 0; j < i; j++ ) {
3469: if ( w[i] && w[j] )
3470: if ( ndl_reducible(HDL(w[i]),HDL(w[j])) ) w[i] = 0;
3471: else if ( ndl_reducible(HDL(w[j]),HDL(w[i])) ) w[j] = 0;
3472: }
3473: }
3474: for ( i = len-1, t0 = 0; i >= 0; i-- ) {
3475: if ( w[i] ) { NEXTNODE(t0,t); BDY(t) = (pointer)w[i]; }
3476: }
3477: NEXT(t) = 0; x = t0;
3478: return x;
1.11 noro 3479: }
1.32 noro 3480:
1.43 noro 3481: /* XXX incomplete */
3482:
1.32 noro 3483: void nd_init_ord(struct order_spec *ord)
3484: {
1.43 noro 3485: switch ( ord->id ) {
1.32 noro 3486: case 0:
1.43 noro 3487: switch ( ord->ord.simple ) {
3488: case 0:
3489: nd_dcomp = 1;
3490: nd_isrlex = 1;
3491: break;
3492: case 1:
3493: nd_dcomp = 1;
3494: nd_isrlex = 0;
3495: break;
3496: case 2:
3497: nd_dcomp = 0;
3498: nd_isrlex = 0;
1.45 noro 3499: ndl_compare_function = ndl_lex_compare;
1.58 noro 3500: break;
3501: case 11:
3502: /* XXX */
3503: nd_dcomp = 0;
3504: nd_isrlex = 1;
3505: ndl_compare_function = ndl_ww_lex_compare;
1.43 noro 3506: break;
3507: default:
3508: error("nd_gr : unsupported order");
3509: }
1.32 noro 3510: break;
3511: case 1:
1.96 noro 3512: /* block order */
1.43 noro 3513: /* XXX */
3514: nd_dcomp = -1;
1.32 noro 3515: nd_isrlex = 0;
1.45 noro 3516: ndl_compare_function = ndl_block_compare;
1.34 noro 3517: break;
1.43 noro 3518: case 2:
1.96 noro 3519: /* matrix order */
3520: /* XXX */
3521: nd_dcomp = -1;
3522: nd_isrlex = 0;
3523: nd_matrix_len = ord->ord.matrix.row;
3524: nd_matrix = ord->ord.matrix.matrix;
3525: ndl_compare_function = ndl_matrix_compare;
3526: break;
3527: case 3:
1.97 noro 3528: /* composite order */
3529: nd_dcomp = -1;
3530: nd_isrlex = 0;
3531: nd_worb_len = ord->ord.composite.length;
3532: nd_worb = ord->ord.composite.w_or_b;
3533: ndl_compare_function = ndl_composite_compare;
1.32 noro 3534: break;
3535: }
1.41 noro 3536: nd_ord = ord;
1.32 noro 3537: }
3538:
1.43 noro 3539: BlockMask nd_create_blockmask(struct order_spec *ord)
3540: {
3541: int n,i,j,s,l;
1.61 noro 3542: UINT *t;
1.43 noro 3543: BlockMask bm;
3544:
1.96 noro 3545: /* we only create mask table for block order */
3546: if ( ord->id != 1 )
1.43 noro 3547: return 0;
3548: n = ord->ord.block.length;
3549: bm = (BlockMask)MALLOC(sizeof(struct oBlockMask));
3550: bm->n = n;
3551: bm->order_pair = ord->ord.block.order_pair;
1.61 noro 3552: bm->mask = (UINT **)MALLOC(n*sizeof(UINT *));
1.43 noro 3553: for ( i = 0, s = 0; i < n; i++ ) {
1.61 noro 3554: bm->mask[i] = t = (UINT *)MALLOC_ATOMIC(nd_wpd*sizeof(UINT));
1.43 noro 3555: for ( j = 0; j < nd_wpd; j++ ) t[j] = 0;
3556: l = bm->order_pair[i].length;
3557: for ( j = 0; j < l; j++, s++ ) PUT_EXP(t,s,nd_mask0);
3558: }
3559: return bm;
1.57 noro 3560: }
3561:
3562: EPOS nd_create_epos(struct order_spec *ord)
3563: {
3564: int i,j,l,s,ord_l,ord_o;
3565: EPOS epos;
3566: struct order_pair *op;
3567:
3568: epos = (EPOS)MALLOC_ATOMIC(nd_nvar*sizeof(struct oEPOS));
3569: switch ( ord->id ) {
3570: case 0:
3571: if ( nd_isrlex ) {
3572: for ( i = 0; i < nd_nvar; i++ ) {
3573: epos[i].i = nd_exporigin + (nd_nvar-1-i)/nd_epw;
3574: epos[i].s = (nd_epw-((nd_nvar-1-i)%nd_epw)-1)*nd_bpe;
3575: }
3576: } else {
3577: for ( i = 0; i < nd_nvar; i++ ) {
3578: epos[i].i = nd_exporigin + i/nd_epw;
3579: epos[i].s = (nd_epw-(i%nd_epw)-1)*nd_bpe;
3580: }
3581: }
3582: break;
3583: case 1:
3584: /* block order */
3585: l = ord->ord.block.length;
3586: op = ord->ord.block.order_pair;
3587: for ( j = 0, s = 0; j < l; j++ ) {
3588: ord_o = op[j].order;
3589: ord_l = op[j].length;
3590: if ( !ord_o )
3591: for ( i = 0; i < ord_l; i++ ) {
3592: epos[s+i].i = nd_exporigin + (s+ord_l-i-1)/nd_epw;
3593: epos[s+i].s = (nd_epw-((s+ord_l-i-1)%nd_epw)-1)*nd_bpe;
3594: }
3595: else
3596: for ( i = 0; i < ord_l; i++ ) {
3597: epos[s+i].i = nd_exporigin + (s+i)/nd_epw;
3598: epos[s+i].s = (nd_epw-((s+i)%nd_epw)-1)*nd_bpe;
3599: }
3600: s += ord_l;
3601: }
3602: break;
3603: case 2:
1.96 noro 3604: /* matrix order */
3605: case 3:
3606: /* composite order */
3607: for ( i = 0; i < nd_nvar; i++ ) {
3608: epos[i].i = nd_exporigin + i/nd_epw;
3609: epos[i].s = (nd_epw-(i%nd_epw)-1)*nd_bpe;
3610: }
3611: break;
1.57 noro 3612: }
3613: return epos;
1.43 noro 3614: }
1.59 noro 3615:
3616: /* external interface */
3617:
3618: void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec *ord,P *rp)
3619: {
1.61 noro 3620: NODE t,in0,in;
1.59 noro 3621: ND nd,nf;
1.61 noro 3622: NDV ndv;
3623: VL vv,tv;
3624: int stat,nvar,max,e;
1.69 noro 3625: union oNDC dn;
1.59 noro 3626:
3627: pltovl(v,&vv);
1.74 noro 3628: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
1.61 noro 3629:
3630: /* get the degree bound */
3631: for ( t = BDY(g), max = 0; t; t = NEXT(t) )
3632: for ( tv = vv; tv; tv = NEXT(tv) ) {
3633: e = getdeg(tv->v,(P)BDY(t));
3634: max = MAX(e,max);
3635: }
3636: for ( tv = vv; tv; tv = NEXT(tv) ) {
3637: e = getdeg(tv->v,f);
3638: max = MAX(e,max);
3639: }
3640:
1.59 noro 3641: nd_init_ord(ord);
1.61 noro 3642: nd_setup_parameters(nvar,max);
3643:
3644: /* conversion to ndv */
3645: for ( in0 = 0, t = BDY(g); t; t = NEXT(t) ) {
3646: NEXTNODE(in0,in);
3647: BDY(in) = (pointer)ptondv(CO,vv,(P)BDY(t));
1.69 noro 3648: if ( m ) ndv_mod(m,(NDV)BDY(in));
1.61 noro 3649: }
3650: NEXTNODE(in0,in);
3651: BDY(in) = (pointer)ptondv(CO,vv,f);
1.69 noro 3652: if ( m ) ndv_mod(m,(NDV)BDY(in));
1.61 noro 3653: NEXT(in) = 0;
3654:
3655: ndv_setup(m,0,in0);
1.59 noro 3656: nd_psn--;
3657: nd_scale=2;
3658: while ( 1 ) {
3659: nd = (pointer)ndvtond(m,nd_ps[nd_psn]);
1.69 noro 3660: stat = nd_nf(m,nd,nd_ps,1,0,&nf);
1.59 noro 3661: if ( !stat ) {
3662: nd_psn++;
3663: nd_reconstruct(m,0,0);
3664: nd_psn--;
3665: } else
3666: break;
3667: }
1.61 noro 3668: *rp = ndvtop(m,CO,vv,ndtondv(m,nf));
1.63 noro 3669: }
3670:
3671: int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r)
3672: {
3673: NM m;
3674: UINT *t,*s;
3675: int i;
3676:
3677: for ( i = 0; i < n; i++ ) r[i] = 0;
3678: for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) {
3679: t = DL(m);
3680: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
3681: r[i] = CM(m);
3682: }
3683: for ( i = 0; !r[i]; i++ );
3684: return i;
3685: }
3686:
1.74 noro 3687: int ndv_to_vect(int mod,UINT *s0,int n,NDV d,UINT *r)
3688: {
3689: NMV m;
3690: UINT *t,*s;
3691: int i,j,len;
3692:
3693: for ( i = 0; i < n; i++ ) r[i] = 0;
3694: m = BDY(d);
3695: len = LEN(d);
3696: for ( i = j = 0, s = s0; j < len; j++, NMV_ADV(m)) {
3697: t = DL(m);
3698: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
3699: r[i] = CM(m);
3700: }
3701: for ( i = 0; !r[i]; i++ );
3702: return i;
3703: }
3704:
1.63 noro 3705: int nm_ind_pair_to_vect(int mod,UINT *s0,int n,NM_ind_pair pair,UINT *r)
3706: {
3707: NM m;
3708: NMV mr;
3709: UINT *d,*t,*s;
3710: NDV p;
3711: int i,j,len;
3712:
3713: m = pair->mul;
3714: d = DL(m);
3715: p = nd_ps[pair->index];
3716: t = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
3717: for ( i = 0; i < n; i++ ) r[i] = 0;
3718: len = LEN(p);
3719: for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) {
3720: ndl_add(d,DL(mr),t);
3721: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
3722: r[i] = CM(mr);
3723: }
3724: for ( i = 0; !r[i]; i++ );
3725: return i;
3726: }
3727:
1.67 noro 3728: IndArray nm_ind_pair_to_vect_compress(int mod,UINT *s0,int n,NM_ind_pair pair)
1.64 noro 3729: {
3730: NM m;
3731: NMV mr;
3732: UINT *d,*t,*s;
3733: NDV p;
1.67 noro 3734: unsigned char *ivc;
3735: unsigned short *ivs;
1.81 noro 3736: UINT *v,*ivi,*s0v;
1.67 noro 3737: int i,j,len,prev,diff,cdiff;
3738: IndArray r;
1.64 noro 3739:
3740: m = pair->mul;
3741: d = DL(m);
3742: p = nd_ps[pair->index];
3743: len = LEN(p);
3744: t = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
1.67 noro 3745: v = (unsigned int *)ALLOCA(len*sizeof(unsigned int));
1.64 noro 3746: for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) {
3747: ndl_add(d,DL(mr),t);
3748: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
1.67 noro 3749: v[j] = i;
3750: }
1.81 noro 3751: r = (IndArray)MALLOC(sizeof(struct oIndArray));
1.67 noro 3752: r->head = v[0];
3753: diff = 0;
3754: for ( i = 1; i < len; i++ ) {
3755: cdiff = v[i]-v[i-1]; diff = MAX(cdiff,diff);
3756: }
3757: if ( diff < 256 ) {
3758: r->width = 1;
3759: ivc = (unsigned char *)MALLOC_ATOMIC(len*sizeof(unsigned char));
3760: r->index.c = ivc;
3761: for ( i = 1, ivc[0] = 0; i < len; i++ ) ivc[i] = v[i]-v[i-1];
3762: } else if ( diff < 65536 ) {
3763: r->width = 2;
3764: ivs = (unsigned short *)MALLOC_ATOMIC(len*sizeof(unsigned short));
3765: r->index.s = ivs;
3766: for ( i = 1, ivs[0] = 0; i < len; i++ ) ivs[i] = v[i]-v[i-1];
3767: } else {
3768: r->width = 4;
3769: ivi = (unsigned int *)MALLOC_ATOMIC(len*sizeof(unsigned int));
3770: r->index.i = ivi;
3771: for ( i = 1, ivi[0] = 0; i < len; i++ ) ivi[i] = v[i]-v[i-1];
1.64 noro 3772: }
1.67 noro 3773: return r;
1.64 noro 3774: }
3775:
1.65 noro 3776:
1.76 noro 3777: int ndv_reduce_vect(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.65 noro 3778: {
1.67 noro 3779: int i,j,k,len,pos,prev;
1.66 noro 3780: UINT c,c1,c2,c3,up,lo,dmy;
1.67 noro 3781: IndArray ivect;
3782: unsigned char *ivc;
3783: unsigned short *ivs;
3784: unsigned int *ivi;
1.65 noro 3785: NDV redv;
1.67 noro 3786: NMV mr;
1.65 noro 3787: NODE rp;
1.76 noro 3788: int maxrs;
1.65 noro 3789:
1.76 noro 3790: maxrs = 0;
1.74 noro 3791: for ( i = 0; i < nred; i++ ) {
1.65 noro 3792: ivect = imat[i];
1.67 noro 3793: k = ivect->head; svect[k] %= m;
1.65 noro 3794: if ( c = svect[k] ) {
1.76 noro 3795: maxrs = MAX(maxrs,rp0[i]->sugar);
1.74 noro 3796: c = m-c; redv = nd_ps[rp0[i]->index];
1.67 noro 3797: len = LEN(redv); mr = BDY(redv);
3798: svect[k] = 0; prev = k;
3799: switch ( ivect->width ) {
3800: case 1:
3801: ivc = ivect->index.c;
3802: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
3803: pos = prev+ivc[j]; c1 = CM(mr); c2 = svect[pos];
3804: prev = pos;
3805: DMA(c1,c,c2,up,lo);
3806: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
3807: } else svect[pos] = lo;
3808: }
3809: break;
3810: case 2:
3811: ivs = ivect->index.s;
3812: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
3813: pos = prev+ivs[j]; c1 = CM(mr); c2 = svect[pos];
3814: prev = pos;
3815: DMA(c1,c,c2,up,lo);
3816: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
3817: } else svect[pos] = lo;
3818: }
3819: break;
3820: case 4:
3821: ivi = ivect->index.i;
3822: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
3823: pos = prev+ivi[j]; c1 = CM(mr); c2 = svect[pos];
3824: prev = pos;
3825: DMA(c1,c,c2,up,lo);
3826: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
3827: } else svect[pos] = lo;
3828: }
3829: break;
1.65 noro 3830: }
3831: }
3832: }
1.66 noro 3833: for ( i = 0; i < col; i++ )
3834: if ( svect[i] >= (UINT)m ) svect[i] %= m;
1.76 noro 3835: return maxrs;
1.65 noro 3836: }
3837:
1.76 noro 3838: int ndv_reduce_vect_sf(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.72 noro 3839: {
3840: int i,j,k,len,pos,prev;
3841: UINT c,c1,c2,c3,up,lo,dmy;
3842: IndArray ivect;
3843: unsigned char *ivc;
3844: unsigned short *ivs;
3845: unsigned int *ivi;
3846: NDV redv;
3847: NMV mr;
3848: NODE rp;
1.76 noro 3849: int maxrs;
1.72 noro 3850:
1.76 noro 3851: maxrs = 0;
1.74 noro 3852: for ( i = 0; i < nred; i++ ) {
1.72 noro 3853: ivect = imat[i];
3854: k = ivect->head; svect[k] %= m;
3855: if ( c = svect[k] ) {
1.76 noro 3856: maxrs = MAX(maxrs,rp0[i]->sugar);
1.74 noro 3857: c = _chsgnsf(c); redv = nd_ps[rp0[i]->index];
1.72 noro 3858: len = LEN(redv); mr = BDY(redv);
3859: svect[k] = 0; prev = k;
3860: switch ( ivect->width ) {
3861: case 1:
3862: ivc = ivect->index.c;
3863: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
3864: pos = prev+ivc[j]; prev = pos;
3865: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
3866: }
3867: break;
3868: case 2:
3869: ivs = ivect->index.s;
3870: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
3871: pos = prev+ivs[j]; prev = pos;
3872: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
3873: }
3874: break;
3875: case 4:
3876: ivi = ivect->index.i;
3877: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
3878: pos = prev+ivi[j]; prev = pos;
3879: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
3880: }
3881: break;
3882: }
3883: }
3884: }
1.76 noro 3885: return maxrs;
1.72 noro 3886: }
3887:
1.65 noro 3888: NDV vect_to_ndv(UINT *vect,int spcol,int col,int *rhead,UINT *s0vect)
3889: {
3890: int j,k,len;
3891: UINT *p;
3892: UINT c;
3893: NDV r;
3894: NMV mr0,mr;
3895:
3896: for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++;
3897: if ( !len ) return 0;
3898: else {
1.74 noro 3899: mr0 = (NMV)GC_malloc_atomic_ignore_off_page(nmv_adv*len);
3900: ndv_alloc += nmv_adv*len;
1.65 noro 3901: mr = mr0;
3902: p = s0vect;
3903: for ( j = k = 0; j < col; j++, p += nd_wpd )
3904: if ( !rhead[j] ) {
3905: if ( c = vect[k++] ) {
3906: ndl_copy(p,DL(mr)); CM(mr) = c; NMV_ADV(mr);
3907: }
3908: }
3909: MKNDV(nd_nvar,mr0,len,r);
3910: return r;
3911: }
3912: }
3913:
1.74 noro 3914: int nd_sp_f4(int m,ND_pairs l,PGeoBucket bucket)
1.65 noro 3915: {
3916: ND_pairs t;
3917: NODE sp0,sp;
3918: int stat;
3919: ND spol;
3920:
3921: for ( t = l; t; t = NEXT(t) ) {
3922: stat = nd_sp(m,0,t,&spol);
3923: if ( !stat ) return 0;
3924: if ( spol ) {
3925: add_pbucket_symbolic(bucket,spol);
3926: }
3927: }
1.68 noro 3928: return 1;
1.65 noro 3929: }
3930:
3931: int nd_symbolic_preproc(PGeoBucket bucket,UINT **s0vect,NODE *r)
3932: {
3933: NODE rp0,rp;
3934: NM mul,head,s0,s;
1.76 noro 3935: int index,col,i,sugar;
1.65 noro 3936: RHist h;
3937: UINT *s0v,*p;
3938: NM_ind_pair pair;
3939: ND red;
3940:
3941: s0 = 0; rp0 = 0; col = 0;
3942: while ( 1 ) {
3943: head = remove_head_pbucket_symbolic(bucket);
3944: if ( !head ) break;
3945: if ( !s0 ) s0 = head;
3946: else NEXT(s) = head;
3947: s = head;
3948: index = ndl_find_reducer(DL(head));
3949: if ( index >= 0 ) {
3950: h = nd_psh[index];
3951: NEWNM(mul);
3952: ndl_sub(DL(head),DL(h),DL(mul));
3953: if ( ndl_check_bound2(index,DL(mul)) ) return 0;
1.76 noro 3954: sugar = TD(DL(mul))+SG(nd_ps[index]);
3955: MKNM_ind_pair(pair,mul,index,sugar);
1.65 noro 3956: red = ndv_mul_nm_symbolic(mul,nd_ps[index]);
3957: add_pbucket_symbolic(bucket,nd_remove_head(red));
3958: NEXTNODE(rp0,rp); BDY(rp) = (pointer)pair;
3959: }
3960: col++;
3961: }
1.72 noro 3962: if ( rp0 ) NEXT(rp) = 0;
3963: NEXT(s) = 0;
1.65 noro 3964: s0v = (UINT *)MALLOC_ATOMIC(col*nd_wpd*sizeof(UINT));
3965: for ( i = 0, p = s0v, s = s0; i < col;
3966: i++, p += nd_wpd, s = NEXT(s) ) ndl_copy(DL(s),p);
3967: *s0vect = s0v;
3968: *r = rp0;
3969: return col;
3970: }
3971:
1.69 noro 3972: NODE nd_f4(int m)
3973: {
3974: int i,nh,stat,index;
3975: NODE r,g;
3976: ND_pairs d,l,t;
3977: ND spol,red;
3978: NDV nf,redv;
3979: NM s0,s;
1.84 noro 3980: NODE rp0,srp0,nflist;
1.69 noro 3981: int nsp,nred,col,rank,len,k,j,a;
3982: UINT c;
1.74 noro 3983: UINT **spmat;
1.69 noro 3984: UINT *s0vect,*svect,*p,*v;
3985: int *colstat;
3986: IndArray *imat;
3987: int *rhead;
3988: int spcol,sprow;
3989: int sugar;
3990: PGeoBucket bucket;
3991: struct oEGT eg0,eg1,eg_f4;
3992:
3993: if ( !m )
3994: error("nd_f4 : not implemented");
1.74 noro 3995: ndv_alloc = 0;
1.69 noro 3996: g = 0; d = 0;
3997: for ( i = 0; i < nd_psn; i++ ) {
3998: d = update_pairs(d,g,i);
3999: g = update_base(g,i);
4000: }
4001: while ( d ) {
4002: get_eg(&eg0);
4003: l = nd_minsugarp(d,&d);
4004: sugar = SG(l);
4005: bucket = create_pbucket();
1.74 noro 4006: stat = nd_sp_f4(m,l,bucket);
1.69 noro 4007: if ( !stat ) {
4008: for ( t = l; NEXT(t); t = NEXT(t) );
4009: NEXT(t) = d; d = l;
4010: d = nd_reconstruct(m,0,d);
4011: continue;
4012: }
1.86 noro 4013: if ( bucket->m < 0 ) continue;
1.69 noro 4014: col = nd_symbolic_preproc(bucket,&s0vect,&rp0);
4015: if ( !col ) {
4016: for ( t = l; NEXT(t); t = NEXT(t) );
4017: NEXT(t) = d; d = l;
4018: d = nd_reconstruct(m,0,d);
4019: continue;
4020: }
4021: get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1);
1.74 noro 4022: if ( DP_Print )
4023: fprintf(asir_out,"sugar=%d,symb=%fsec,",
4024: sugar,eg_f4.exectime+eg_f4.gctime);
4025: if ( 1 )
4026: nflist = nd_f4_red(m,l,s0vect,col,rp0);
4027: else
4028: nflist = nd_f4_red_dist(m,l,s0vect,col,rp0);
1.69 noro 4029: /* adding new bases */
1.74 noro 4030: for ( r = nflist; r; r = NEXT(r) ) {
4031: nf = (NDV)BDY(r);
1.69 noro 4032: ndv_removecont(m,nf);
1.77 noro 4033: nh = ndv_newps(m,nf,0);
1.69 noro 4034: d = update_pairs(d,g,nh);
4035: g = update_base(g,nh);
4036: }
4037: }
4038: for ( r = g; r; r = NEXT(r) ) BDY(r) = (pointer)nd_ps[(int)BDY(r)];
1.74 noro 4039: fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc);
1.69 noro 4040: return g;
4041: }
1.74 noro 4042:
4043: NODE nd_f4_red(int m,ND_pairs sp0,UINT *s0vect,int col,NODE rp0)
1.63 noro 4044: {
1.67 noro 4045: IndArray *imat;
1.74 noro 4046: int nsp,nred,spcol,sprow,a;
1.65 noro 4047: int *rhead;
1.74 noro 4048: int i,j,k,l,rank;
4049: NODE rp,r0,r;
4050: ND_pairs sp;
4051: ND spol;
4052: int **spmat;
4053: UINT *svect,*v;
4054: int *colstat;
1.80 noro 4055: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
1.74 noro 4056: NM_ind_pair *rvect;
1.76 noro 4057: int maxrs;
4058: int *spsugar;
1.63 noro 4059:
1.74 noro 4060: get_eg(&eg0);
4061: for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ );
4062: nred = length(rp0); spcol = col-nred;
4063: imat = (IndArray *)ALLOCA(nred*sizeof(IndArray));
4064: rhead = (int *)ALLOCA(col*sizeof(int));
4065: for ( i = 0; i < col; i++ ) rhead[i] = 0;
1.63 noro 4066:
1.74 noro 4067: /* construction of index arrays */
4068: rvect = (NM_ind_pair *)ALLOCA(nred*sizeof(NM_ind_pair));
4069: for ( rp = rp0, i = 0; rp; i++, rp = NEXT(rp) ) {
4070: rvect[i] = (NM_ind_pair)BDY(rp);
4071: imat[i] = nm_ind_pair_to_vect_compress(m,s0vect,col,rvect[i]);
4072: rhead[imat[i]->head] = 1;
4073: }
4074:
4075: /* elimination (1st step) */
4076: spmat = (int **)ALLOCA(nsp*sizeof(UINT *));
4077: svect = (UINT *)ALLOCA(col*sizeof(UINT));
1.76 noro 4078: spsugar = (int *)ALLOCA(nsp*sizeof(UINT));
1.74 noro 4079: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
4080: nd_sp(m,0,sp,&spol);
1.75 noro 4081: if ( !spol ) continue;
1.74 noro 4082: nd_to_vect(m,s0vect,col,spol,svect);
1.76 noro 4083: if ( m == -1 )
4084: maxrs = ndv_reduce_vect_sf(m,svect,col,imat,rvect,nred);
4085: else
4086: maxrs = ndv_reduce_vect(m,svect,col,imat,rvect,nred);
1.74 noro 4087: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
4088: if ( i < col ) {
4089: spmat[sprow] = v = (UINT *)MALLOC_ATOMIC(spcol*sizeof(UINT));
4090: for ( j = k = 0; j < col; j++ )
4091: if ( !rhead[j] ) v[k++] = svect[j];
1.76 noro 4092: spsugar[sprow] = MAX(maxrs,SG(spol));
1.74 noro 4093: sprow++;
4094: }
1.76 noro 4095: nd_free(spol);
1.74 noro 4096: }
1.80 noro 4097: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
4098: if ( DP_Print ) {
4099: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
4100: fflush(asir_out);
4101: }
1.74 noro 4102: /* free index arrays */
4103: for ( i = 0; i < nred; i++ ) GC_free(imat[i]->index.c);
4104:
4105: /* elimination (2nd step) */
4106: colstat = (int *)ALLOCA(spcol*sizeof(int));
4107: if ( m == -1 )
1.76 noro 4108: rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat);
1.74 noro 4109: else
1.76 noro 4110: rank = nd_gauss_elim_mod(spmat,spsugar,sprow,spcol,m,colstat);
1.74 noro 4111: r0 = 0;
4112: for ( i = 0; i < rank; i++ ) {
4113: NEXTNODE(r0,r); BDY(r) =
4114: (pointer)vect_to_ndv(spmat[i],spcol,col,rhead,s0vect);
1.76 noro 4115: SG((NDV)BDY(r)) = spsugar[i];
1.74 noro 4116: GC_free(spmat[i]);
4117: }
4118: for ( ; i < sprow; i++ ) GC_free(spmat[i]);
1.80 noro 4119: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
4120: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
1.74 noro 4121: if ( DP_Print ) {
1.80 noro 4122: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
1.74 noro 4123: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
4124: nsp,nred,sprow,spcol,rank);
4125: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
1.63 noro 4126: }
1.74 noro 4127: return r0;
4128: }
4129:
4130: FILE *nd_write,*nd_read;
4131:
4132: void nd_send_int(int a) {
4133: write_int(nd_write,&a);
4134: }
4135:
4136: void nd_send_intarray(int *p,int len) {
4137: write_intarray(nd_write,p,len);
4138: }
4139:
4140: int nd_recv_int() {
4141: int a;
4142:
4143: read_int(nd_read,&a);
4144: return a;
4145: }
4146:
4147: void nd_recv_intarray(int *p,int len) {
4148: read_intarray(nd_read,p,len);
4149: }
4150:
4151: void nd_send_ndv(NDV p) {
4152: int len,i;
4153: NMV m;
4154:
4155: if ( !p ) nd_send_int(0);
4156: else {
4157: len = LEN(p);
4158: nd_send_int(len);
4159: m = BDY(p);
4160: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
4161: nd_send_int(CM(m));
4162: nd_send_intarray(DL(m),nd_wpd);
1.68 noro 4163: }
1.74 noro 4164: }
4165: }
4166:
4167: void nd_send_nd(ND p) {
4168: int len,i;
4169: NM m;
4170:
4171: if ( !p ) nd_send_int(0);
4172: else {
4173: len = LEN(p);
4174: nd_send_int(len);
4175: m = BDY(p);
4176: for ( i = 0; i < len; i++, m = NEXT(m) ) {
4177: nd_send_int(CM(m));
4178: nd_send_intarray(DL(m),nd_wpd);
1.65 noro 4179: }
1.74 noro 4180: }
4181: }
1.65 noro 4182:
1.74 noro 4183: NDV nd_recv_ndv()
4184: {
4185: int len,i;
4186: NMV m,m0;
4187: NDV r;
1.65 noro 4188:
1.74 noro 4189: len = nd_recv_int();
4190: if ( !len ) return 0;
4191: else {
4192: m0 = m = (NMV)GC_malloc_atomic_ignore_off_page(nmv_adv*len);
4193: ndv_alloc += len*nmv_adv;
4194: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
4195: CM(m) = nd_recv_int();
4196: nd_recv_intarray(DL(m),nd_wpd);
1.71 noro 4197: }
1.74 noro 4198: MKNDV(nd_nvar,m0,len,r);
4199: return r;
4200: }
4201: }
1.65 noro 4202:
1.74 noro 4203: int ox_exec_f4_red(Q proc)
4204: {
4205: Obj obj;
4206: STRING fname;
4207: NODE arg;
4208: int s;
4209: extern int ox_need_conv,ox_file_io;
4210:
4211: MKSTR(fname,"nd_exec_f4_red");
4212: arg = mknode(2,proc,fname);
4213: Pox_cmo_rpc(arg,&obj);
4214: s = get_ox_server_id(QTOS(proc));
4215: nd_write = iofp[s].out;
4216: nd_read = iofp[s].in;
4217: ox_need_conv = ox_file_io = 0;
4218: return s;
4219: }
4220:
4221: NODE nd_f4_red_dist(int m,ND_pairs sp0,UINT *s0vect,int col,NODE rp0)
4222: {
4223: int nsp,nred;
4224: int i,rank,s;
4225: NODE rp,r0,r;
4226: ND_pairs sp;
4227: NM_ind_pair pair;
4228: NMV nmv;
4229: NM nm;
4230: NDV nf;
4231: Obj proc,dmy;
4232:
4233: ox_launch_main(0,0,&proc);
4234: s = ox_exec_f4_red((Q)proc);
4235:
4236: nd_send_int(m);
4237: nd_send_int(nd_nvar);
4238: nd_send_int(nd_bpe);
4239: nd_send_int(nd_wpd);
4240: nd_send_int(nmv_adv);
4241:
1.89 noro 4242: saveobj(nd_write,dp_current_spec->obj); fflush(nd_write);
1.74 noro 4243:
4244: nd_send_int(nd_psn);
4245: for ( i = 0; i < nd_psn; i++ ) nd_send_ndv(nd_ps[i]);
4246:
4247: for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ );
4248: nd_send_int(nsp);
4249: for ( i = 0, sp = sp0; i < nsp; i++, sp = NEXT(sp) ) {
4250: nd_send_int(sp->i1); nd_send_int(sp->i2);
4251: }
4252:
4253: nd_send_int(col); nd_send_intarray(s0vect,col*nd_wpd);
4254:
4255: nred = length(rp0); nd_send_int(nred);
4256: for ( i = 0, rp = rp0; i < nred; i++, rp = NEXT(rp) ) {
4257: pair = (NM_ind_pair)BDY(rp);
4258: nd_send_int(pair->index);
4259: nd_send_intarray(pair->mul->dl,nd_wpd);
4260: }
4261: fflush(nd_write);
4262: rank = nd_recv_int();
4263: fprintf(asir_out,"rank=%d\n",rank);
4264: r0 = 0;
4265: for ( i = 0; i < rank; i++ ) {
4266: nf = nd_recv_ndv();
4267: NEXTNODE(r0,r); BDY(r) = (pointer)nf;
4268: }
4269: Pox_shutdown(mknode(1,proc),&dmy);
4270: return r0;
4271: }
4272:
4273: /* server side */
4274:
4275: void nd_exec_f4_red_dist()
4276: {
4277: int m,i,nsp,col,s0size,nred,spcol,j,k;
4278: NM_ind_pair *rp0;
4279: NDV nf;
4280: UINT *s0vect;
4281: IndArray *imat;
4282: int *rhead;
4283: int **spmat;
4284: UINT *svect,*v;
4285: ND_pairs *sp0;
4286: int *colstat;
4287: int a,sprow,rank;
1.89 noro 4288: struct order_spec *ord;
1.74 noro 4289: Obj ordspec;
4290: ND spol;
1.76 noro 4291: int maxrs;
4292: int *spsugar;
1.74 noro 4293:
4294: nd_read = iofp[0].in;
4295: nd_write = iofp[0].out;
4296: m = nd_recv_int();
4297: nd_nvar = nd_recv_int();
4298: nd_bpe = nd_recv_int();
4299: nd_wpd = nd_recv_int();
4300: nmv_adv = nd_recv_int();
4301:
4302: loadobj(nd_read,&ordspec);
1.89 noro 4303: create_order_spec(0,ordspec,&ord);
4304: nd_init_ord(ord);
1.74 noro 4305: nd_setup_parameters(nd_nvar,0);
4306:
4307: nd_psn = nd_recv_int();
4308: nd_ps = (NDV *)MALLOC(nd_psn*sizeof(NDV));
4309: nd_bound = (UINT **)MALLOC(nd_psn*sizeof(UINT *));
4310: for ( i = 0; i < nd_psn; i++ ) {
4311: nd_ps[i] = nd_recv_ndv();
4312: nd_bound[i] = ndv_compute_bound(nd_ps[i]);
4313: }
4314:
4315: nsp = nd_recv_int();
4316: sp0 = (ND_pairs *)MALLOC(nsp*sizeof(ND_pairs));
4317: for ( i = 0; i < nsp; i++ ) {
4318: NEWND_pairs(sp0[i]);
4319: sp0[i]->i1 = nd_recv_int(); sp0[i]->i2 = nd_recv_int();
4320: ndl_lcm(HDL(nd_ps[sp0[i]->i1]),HDL(nd_ps[sp0[i]->i2]),LCM(sp0[i]));
4321: }
4322:
4323: col = nd_recv_int();
4324: s0size = col*nd_wpd;
4325: s0vect = (UINT *)MALLOC(s0size*sizeof(UINT));
4326: nd_recv_intarray(s0vect,s0size);
4327:
4328: nred = nd_recv_int();
4329: rp0 = (NM_ind_pair *)MALLOC(nred*sizeof(NM_ind_pair));
4330: for ( i = 0; i < nred; i++ ) {
4331: rp0[i] = (NM_ind_pair)MALLOC(sizeof(struct oNM_ind_pair));
4332: rp0[i]->index = nd_recv_int();
4333: rp0[i]->mul = (NM)MALLOC(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT));
4334: nd_recv_intarray(rp0[i]->mul->dl,nd_wpd);
4335: }
4336:
4337: spcol = col-nred;
4338: imat = (IndArray *)MALLOC(nred*sizeof(IndArray));
4339: rhead = (int *)MALLOC(col*sizeof(int));
4340: for ( i = 0; i < col; i++ ) rhead[i] = 0;
4341:
4342: /* construction of index arrays */
4343: for ( i = 0; i < nred; i++ ) {
4344: imat[i] = nm_ind_pair_to_vect_compress(m,s0vect,col,rp0[i]);
4345: rhead[imat[i]->head] = 1;
4346: }
4347:
4348: /* elimination (1st step) */
4349: spmat = (int **)MALLOC(nsp*sizeof(UINT *));
4350: svect = (UINT *)MALLOC(col*sizeof(UINT));
1.76 noro 4351: spsugar = (int *)ALLOCA(nsp*sizeof(UINT));
1.74 noro 4352: for ( a = sprow = 0; a < nsp; a++ ) {
4353: nd_sp(m,0,sp0[a],&spol);
1.75 noro 4354: if ( !spol ) continue;
1.74 noro 4355: nd_to_vect(m,s0vect,col,spol,svect);
1.76 noro 4356: if ( m == -1 )
4357: maxrs = ndv_reduce_vect_sf(m,svect,col,imat,rp0,nred);
4358: else
4359: maxrs = ndv_reduce_vect(m,svect,col,imat,rp0,nred);
1.74 noro 4360: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
4361: if ( i < col ) {
4362: spmat[sprow] = v = (UINT *)MALLOC(spcol*sizeof(UINT));
4363: for ( j = k = 0; j < col; j++ )
4364: if ( !rhead[j] ) v[k++] = svect[j];
1.76 noro 4365: spsugar[sprow] = MAX(maxrs,SG(spol));
1.74 noro 4366: sprow++;
4367: }
1.76 noro 4368: nd_free(spol);
1.74 noro 4369: }
4370: /* elimination (2nd step) */
4371: colstat = (int *)ALLOCA(spcol*sizeof(int));
4372: if ( m == -1 )
1.76 noro 4373: rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat);
1.74 noro 4374: else
1.76 noro 4375: rank = nd_gauss_elim_mod(spmat,spsugar,sprow,spcol,m,colstat);
1.74 noro 4376: nd_send_int(rank);
4377: for ( i = 0; i < rank; i++ ) {
4378: nf = vect_to_ndv(spmat[i],spcol,col,rhead,s0vect);
4379: nd_send_ndv(nf);
1.63 noro 4380: }
1.74 noro 4381: fflush(nd_write);
1.76 noro 4382: }
4383:
4384: int nd_gauss_elim_mod(int **mat0,int *sugar,int row,int col,int md,int *colstat)
4385: {
4386: int i,j,k,l,inv,a,rank,s;
4387: unsigned int *t,*pivot,*pk;
4388: unsigned int **mat;
4389:
4390: mat = (unsigned int **)mat0;
4391: for ( rank = 0, j = 0; j < col; j++ ) {
4392: for ( i = rank; i < row; i++ )
4393: mat[i][j] %= md;
4394: for ( i = rank; i < row; i++ )
4395: if ( mat[i][j] )
4396: break;
4397: if ( i == row ) {
4398: colstat[j] = 0;
4399: continue;
4400: } else
4401: colstat[j] = 1;
4402: if ( i != rank ) {
4403: t = mat[i]; mat[i] = mat[rank]; mat[rank] = t;
4404: s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s;
4405: }
4406: pivot = mat[rank];
4407: s = sugar[rank];
4408: inv = invm(pivot[j],md);
4409: for ( k = j, pk = pivot+k; k < col; k++, pk++ )
4410: if ( *pk ) {
4411: if ( *pk >= (unsigned int)md )
4412: *pk %= md;
4413: DMAR(*pk,inv,0,md,*pk)
4414: }
4415: for ( i = rank+1; i < row; i++ ) {
4416: t = mat[i];
4417: if ( a = t[j] ) {
4418: sugar[i] = MAX(sugar[i],s);
4419: red_by_vect(md,t+j,pivot+j,md-a,col-j);
4420: }
4421: }
4422: rank++;
4423: }
4424: for ( j = col-1, l = rank-1; j >= 0; j-- )
4425: if ( colstat[j] ) {
4426: pivot = mat[l];
4427: s = sugar[l];
4428: for ( i = 0; i < l; i++ ) {
4429: t = mat[i];
4430: t[j] %= md;
4431: if ( a = t[j] ) {
4432: sugar[i] = MAX(sugar[i],s);
4433: red_by_vect(md,t+j,pivot+j,md-a,col-j);
4434: }
4435: }
4436: l--;
4437: }
4438: for ( j = 0, l = 0; l < rank; j++ )
4439: if ( colstat[j] ) {
4440: t = mat[l];
4441: for ( k = j; k < col; k++ )
4442: if ( t[k] >= (unsigned int)md )
4443: t[k] %= md;
4444: l++;
4445: }
4446: return rank;
4447: }
4448:
4449: int nd_gauss_elim_sf(int **mat0,int *sugar,int row,int col,int md,int *colstat)
4450: {
4451: int i,j,k,l,inv,a,rank,s;
4452: unsigned int *t,*pivot,*pk;
4453: unsigned int **mat;
4454:
4455: mat = (unsigned int **)mat0;
4456: for ( rank = 0, j = 0; j < col; j++ ) {
4457: for ( i = rank; i < row; i++ )
4458: if ( mat[i][j] )
4459: break;
4460: if ( i == row ) {
4461: colstat[j] = 0;
4462: continue;
4463: } else
4464: colstat[j] = 1;
4465: if ( i != rank ) {
4466: t = mat[i]; mat[i] = mat[rank]; mat[rank] = t;
4467: s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s;
4468: }
4469: pivot = mat[rank];
4470: s = sugar[rank];
4471: inv = _invsf(pivot[j]);
4472: for ( k = j, pk = pivot+k; k < col; k++, pk++ )
4473: if ( *pk )
4474: *pk = _mulsf(*pk,inv);
4475: for ( i = rank+1; i < row; i++ ) {
4476: t = mat[i];
4477: if ( a = t[j] ) {
4478: sugar[i] = MAX(sugar[i],s);
4479: red_by_vect_sf(md,t+j,pivot+j,_chsgnsf(a),col-j);
4480: }
4481: }
4482: rank++;
4483: }
4484: for ( j = col-1, l = rank-1; j >= 0; j-- )
4485: if ( colstat[j] ) {
4486: pivot = mat[l];
4487: s = sugar[l];
4488: for ( i = 0; i < l; i++ ) {
4489: t = mat[i];
4490: if ( a = t[j] ) {
4491: sugar[i] = MAX(sugar[i],s);
4492: red_by_vect_sf(md,t+j,pivot+j,_chsgnsf(a),col-j);
4493: }
4494: }
4495: l--;
4496: }
4497: return rank;
1.77 noro 4498: }
4499:
4500: int ndv_ishomo(NDV p)
4501: {
4502: NMV m;
4503: int len,h;
4504:
4505: if ( !p ) return 1;
4506: len = LEN(p);
4507: m = BDY(p);
4508: h = TD(DL(m));
4509: NMV_ADV(m);
4510: for ( len--; len; len--, NMV_ADV(m) )
4511: if ( TD(DL(m)) != h ) return 0;
4512: return 1;
4513: }
4514:
4515: void ndv_save(NDV p,int index)
4516: {
4517: FILE *s;
4518: char name[BUFSIZ];
4519: short id;
4520: int nv,sugar,len,n,i,td,e,j;
4521: NMV m;
4522: unsigned int *dl;
4523:
4524: sprintf(name,"%s/%d",Demand,index);
4525: s = fopen(name,"w");
4526: savevl(s,0);
4527: if ( !p ) {
4528: saveobj(s,0);
4529: return;
4530: }
4531: id = O_DP;
4532: nv = NV(p);
4533: sugar = SG(p);
4534: len = LEN(p);
4535: write_short(s,&id); write_int(s,&nv); write_int(s,&sugar);
4536: write_int(s,&len);
4537:
4538: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
4539: saveobj(s,(Obj)CQ(m));
4540: dl = DL(m);
4541: td = TD(dl);
4542: write_int(s,&td);
4543: for ( j = 0; j < nv; j++ ) {
4544: e = GET_EXP(dl,j);
4545: write_int(s,&e);
4546: }
4547: }
4548: fclose(s);
4549: }
4550:
4551: NDV ndv_load(int index)
4552: {
4553: FILE *s;
4554: char name[BUFSIZ];
4555: short id;
4556: int nv,sugar,len,n,i,td,e,j;
4557: NDV d;
4558: NMV m0,m;
4559: unsigned int *dl;
4560: Obj obj;
4561:
4562: sprintf(name,"%s/%d",Demand,index);
4563: s = fopen(name,"r");
4564: if ( !s ) return 0;
4565:
4566: skipvl(s);
4567: read_short(s,&id);
4568: if ( !id ) return 0;
4569: read_int(s,&nv);
4570: read_int(s,&sugar);
4571: read_int(s,&len);
4572:
4573: m0 = m = MALLOC(len*nmv_adv);
4574: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
4575: loadobj(s,&obj); CQ(m) = (Q)obj;
4576: dl = DL(m);
4577: ndl_zero(dl);
4578: read_int(s,&td); TD(dl) = td;
4579: for ( j = 0; j < nv; j++ ) {
4580: read_int(s,&e);
4581: PUT_EXP(dl,j,e);
4582: }
4583: if ( nd_blockmask ) ndl_weight_mask(dl);
4584: }
4585: fclose(s);
4586: MKNDV(nv,m0,len,d);
4587: SG(d) = sugar;
4588: return d;
1.59 noro 4589: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>