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