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