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