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