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