Annotation of OpenXM_contrib2/asir2000/engine/nd.c, Revision 1.163
1.163 ! noro 1: /* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.162 2009/01/05 02:47:39 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);
1.163 ! noro 233: if ( nd_module ) MPOS(r) = MPOS(d);
1.157 noro 234: TD(r) = weight;
235: if ( nd_blockmask ) ndl_weight_mask(r);
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
1.163 ! noro 367: if ( nd_module ) MPOS(d) = MPOS(d1);
1.157 noro 368: TD(d) = ndl_weight(d);
369: if ( nd_blockmask ) ndl_weight_mask(d);
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: }
1.161 noro 402: if ( nd_module && current_module_weight_vector && MPOS(d) )
403: t += current_module_weight_vector[MPOS(d)];
1.157 noro 404: return t;
1.1 noro 405: }
406:
1.61 noro 407: void ndl_weight_mask(UINT *d)
1.43 noro 408: {
1.157 noro 409: UINT t,u;
410: UINT *mask;
411: int i,j,k,l;
412:
413: l = nd_blockmask->n;
414: for ( k = 0; k < l; k++ ) {
415: mask = nd_blockmask->mask[k];
416: if ( current_dl_weight_vector )
417: for ( i = 0, t = 0; i < nd_nvar; i++ ) {
418: u = GET_EXP_MASK(d,i,mask);
419: t += MUL_WEIGHT(u,i);
420: }
421: else
422: for ( t = 0, i = nd_exporigin; i < nd_wpd; i++ ) {
423: u = d[i]&mask[i];
424: for ( j = 0; j < nd_epw; j++, u>>=nd_bpe )
425: t += (u&nd_mask0);
426: }
427: d[k+1] = t;
428: }
1.43 noro 429: }
430:
1.61 noro 431: int ndl_lex_compare(UINT *d1,UINT *d2)
1.1 noro 432: {
1.157 noro 433: int i;
1.1 noro 434:
1.157 noro 435: d1 += nd_exporigin;
436: d2 += nd_exporigin;
437: for ( i = nd_exporigin; i < nd_wpd; i++, d1++, d2++ )
438: if ( *d1 > *d2 )
439: return nd_isrlex ? -1 : 1;
440: else if ( *d1 < *d2 )
441: return nd_isrlex ? 1 : -1;
442: return 0;
1.1 noro 443: }
444:
1.61 noro 445: int ndl_block_compare(UINT *d1,UINT *d2)
1.43 noro 446: {
1.157 noro 447: int i,l,j,ord_o,ord_l;
448: struct order_pair *op;
449: UINT t1,t2,m;
450: UINT *mask;
451:
452: l = nd_blockmask->n;
453: op = nd_blockmask->order_pair;
454: for ( j = 0; j < l; j++ ) {
455: mask = nd_blockmask->mask[j];
456: ord_o = op[j].order;
457: if ( ord_o < 2 )
458: if ( (t1=d1[j+1]) > (t2=d2[j+1]) ) return 1;
459: else if ( t1 < t2 ) return -1;
460: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
461: m = mask[i];
462: t1 = d1[i]&m;
463: t2 = d2[i]&m;
464: if ( t1 > t2 )
465: return !ord_o ? -1 : 1;
466: else if ( t1 < t2 )
467: return !ord_o ? 1 : -1;
468: }
469: }
470: return 0;
1.43 noro 471: }
472:
1.96 noro 473: int ndl_matrix_compare(UINT *d1,UINT *d2)
474: {
1.157 noro 475: int i,j,s;
476: int *v;
1.96 noro 477:
1.157 noro 478: for ( j = 0; j < nd_nvar; j++ )
479: nd_work_vector[j] = GET_EXP(d1,j)-GET_EXP(d2,j);
480: for ( i = 0; i < nd_matrix_len; i++ ) {
481: v = nd_matrix[i];
482: for ( j = 0, s = 0; j < nd_nvar; j++ )
483: s += v[j]*nd_work_vector[j];
484: if ( s > 0 ) return 1;
485: else if ( s < 0 ) return -1;
486: }
487: return 0;
1.96 noro 488: }
489:
1.97 noro 490: int ndl_composite_compare(UINT *d1,UINT *d2)
491: {
1.157 noro 492: int i,j,s,start,end,len,o;
493: int *v;
494: struct sparse_weight *sw;
495:
496: for ( j = 0; j < nd_nvar; j++ )
497: nd_work_vector[j] = GET_EXP(d1,j)-GET_EXP(d2,j);
498: for ( i = 0; i < nd_worb_len; i++ ) {
499: len = nd_worb[i].length;
500: switch ( nd_worb[i].type ) {
501: case IS_DENSE_WEIGHT:
502: v = nd_worb[i].body.dense_weight;
503: for ( j = 0, s = 0; j < len; j++ )
504: s += v[j]*nd_work_vector[j];
505: if ( s > 0 ) return 1;
506: else if ( s < 0 ) return -1;
507: break;
508: case IS_SPARSE_WEIGHT:
509: sw = nd_worb[i].body.sparse_weight;
510: for ( j = 0, s = 0; j < len; j++ )
511: s += sw[j].value*nd_work_vector[sw[j].pos];
512: if ( s > 0 ) return 1;
513: else if ( s < 0 ) return -1;
514: break;
515: case IS_BLOCK:
516: o = nd_worb[i].body.block.order;
517: start = nd_worb[i].body.block.start;
518: switch ( o ) {
519: case 0:
520: end = start+len;
521: for ( j = start, s = 0; j < end; j++ )
522: s += MUL_WEIGHT(nd_work_vector[j],j);
523: if ( s > 0 ) return 1;
524: else if ( s < 0 ) return -1;
525: for ( j = end-1; j >= start; j-- )
526: if ( nd_work_vector[j] < 0 ) return 1;
527: else if ( nd_work_vector[j] > 0 ) return -1;
528: break;
529: case 1:
530: end = start+len;
531: for ( j = start, s = 0; j < end; j++ )
532: s += MUL_WEIGHT(nd_work_vector[j],j);
533: if ( s > 0 ) return 1;
534: else if ( s < 0 ) return -1;
535: for ( j = start; j < end; j++ )
536: if ( nd_work_vector[j] > 0 ) return 1;
537: else if ( nd_work_vector[j] < 0 ) return -1;
538: break;
539: case 2:
540: for ( j = start; j < end; j++ )
541: if ( nd_work_vector[j] > 0 ) return 1;
542: else if ( nd_work_vector[j] < 0 ) return -1;
543: break;
544: }
545: break;
546: }
547: }
548: return 0;
1.97 noro 549: }
550:
1.58 noro 551: /* TDH -> WW -> TD-> RL */
552:
1.61 noro 553: int ndl_ww_lex_compare(UINT *d1,UINT *d2)
1.58 noro 554: {
1.157 noro 555: int i,m,e1,e2;
1.58 noro 556:
1.157 noro 557: if ( TD(d1) > TD(d2) ) return 1;
558: else if ( TD(d1) < TD(d2) ) return -1;
559: m = nd_nvar>>1;
560: for ( i = 0, e1 = e2 = 0; i < m; i++ ) {
561: e1 += current_weyl_weight_vector[i]*(GET_EXP(d1,m+i)-GET_EXP(d1,i));
562: e2 += current_weyl_weight_vector[i]*(GET_EXP(d2,m+i)-GET_EXP(d2,i));
563: }
564: if ( e1 > e2 ) return 1;
565: else if ( e1 < e2 ) return -1;
566: return ndl_lex_compare(d1,d2);
567: }
568:
569: int ndl_module_grlex_compare(UINT *d1,UINT *d2)
570: {
571: int i;
572:
1.160 noro 573: if ( nd_ispot ) {
1.157 noro 574: if ( MPOS(d1) < MPOS(d2) ) return 1;
575: else if ( MPOS(d1) > MPOS(d2) ) return -1;
576: }
577: if ( TD(d1) > TD(d2) ) return 1;
578: else if ( TD(d1) < TD(d2) ) return -1;
579: for ( i = nd_nvar-1; i >= 0; i-- )
580: if ( GET_EXP(d1,i) < GET_EXP(d2,i) ) return 1;
581: else if ( GET_EXP(d1,i) > GET_EXP(d2,i) ) return -1;
1.160 noro 582: if ( !nd_ispot ) {
1.157 noro 583: if ( MPOS(d1) < MPOS(d2) ) return 1;
584: else if ( MPOS(d1) > MPOS(d2) ) return -1;
585: }
586: return 0;
587: }
588:
589: int ndl_module_glex_compare(UINT *d1,UINT *d2)
590: {
591: int i;
592:
1.160 noro 593: if ( nd_ispot ) {
1.157 noro 594: if ( MPOS(d1) < MPOS(d2) ) return 1;
595: else if ( MPOS(d1) > MPOS(d2) ) return -1;
596: }
597: if ( TD(d1) > TD(d2) ) return 1;
598: else if ( TD(d1) < TD(d2) ) return -1;
599: for ( i = 0; i < nd_nvar; i++ )
600: if ( GET_EXP(d1,i) > GET_EXP(d2,i) ) return 1;
601: else if ( GET_EXP(d1,i) < GET_EXP(d2,i) ) return -1;
1.160 noro 602: if ( !nd_ispot ) {
1.157 noro 603: if ( MPOS(d1) < MPOS(d2) ) return 1;
604: else if ( MPOS(d1) > MPOS(d2) ) return -1;
605: }
606: return 0;
607: }
608:
609: int ndl_module_lex_compare(UINT *d1,UINT *d2)
610: {
611: int i;
612:
1.160 noro 613: if ( nd_ispot ) {
1.157 noro 614: if ( MPOS(d1) < MPOS(d2) ) return 1;
615: else if ( MPOS(d1) > MPOS(d2) ) return -1;
616: }
617: for ( i = 0; i < nd_nvar; i++ )
618: if ( GET_EXP(d1,i) > GET_EXP(d2,i) ) return 1;
619: else if ( GET_EXP(d1,i) < GET_EXP(d2,i) ) return -1;
1.160 noro 620: if ( !nd_ispot ) {
1.157 noro 621: if ( MPOS(d1) < MPOS(d2) ) return 1;
622: else if ( MPOS(d1) > MPOS(d2) ) return -1;
623: }
624: return 0;
625: }
626:
627: int ndl_module_block_compare(UINT *d1,UINT *d2)
628: {
629: int i,c;
630:
1.160 noro 631: if ( nd_ispot ) {
1.157 noro 632: if ( MPOS(d1) < MPOS(d2) ) return 1;
633: else if ( MPOS(d1) > MPOS(d2) ) return -1;
634: }
635: if ( c = ndl_block_compare(d1,d2) ) return c;
1.160 noro 636: if ( !nd_ispot ) {
1.157 noro 637: if ( MPOS(d1) < MPOS(d2) ) return 1;
638: else if ( MPOS(d1) > MPOS(d2) ) return -1;
639: }
640: return 0;
641: }
642:
643: int ndl_module_matrix_compare(UINT *d1,UINT *d2)
644: {
645: int i,c;
646:
1.160 noro 647: if ( nd_ispot ) {
1.157 noro 648: if ( MPOS(d1) < MPOS(d2) ) return 1;
649: else if ( MPOS(d1) > MPOS(d2) ) return -1;
650: }
651: if ( c = ndl_matrix_compare(d1,d2) ) return c;
1.160 noro 652: if ( !nd_ispot ) {
1.157 noro 653: if ( MPOS(d1) < MPOS(d2) ) return 1;
654: else if ( MPOS(d1) > MPOS(d2) ) return -1;
655: }
656: return 0;
657: }
658:
659: int ndl_module_composite_compare(UINT *d1,UINT *d2)
660: {
661: int i,c;
662:
1.160 noro 663: if ( nd_ispot ) {
1.157 noro 664: if ( MPOS(d1) > MPOS(d2) ) return 1;
665: else if ( MPOS(d1) < MPOS(d2) ) return -1;
666: }
667: if ( c = ndl_composite_compare(d1,d2) ) return c;
1.160 noro 668: if ( !nd_ispot ) {
1.157 noro 669: if ( MPOS(d1) > MPOS(d2) ) return 1;
670: else if ( MPOS(d1) < MPOS(d2) ) return -1;
671: }
672: return 0;
1.58 noro 673: }
674:
1.61 noro 675: INLINE int ndl_equal(UINT *d1,UINT *d2)
1.1 noro 676: {
1.157 noro 677: int i;
1.1 noro 678:
1.157 noro 679: switch ( nd_wpd ) {
680: case 2:
681: if ( TD(d2) != TD(d1) ) return 0;
682: if ( d2[1] != d1[1] ) return 0;
683: return 1;
684: break;
685: case 3:
686: if ( TD(d2) != TD(d1) ) return 0;
687: if ( d2[1] != d1[1] ) return 0;
688: if ( d2[2] != d1[2] ) return 0;
689: return 1;
690: break;
691: default:
692: for ( i = 0; i < nd_wpd; i++ )
693: if ( *d1++ != *d2++ ) return 0;
694: return 1;
695: break;
696: }
1.1 noro 697: }
698:
1.61 noro 699: INLINE void ndl_copy(UINT *d1,UINT *d2)
1.6 noro 700: {
1.157 noro 701: int i;
1.6 noro 702:
1.157 noro 703: switch ( nd_wpd ) {
704: case 2:
705: TD(d2) = TD(d1);
706: d2[1] = d1[1];
707: break;
708: case 3:
709: TD(d2) = TD(d1);
710: d2[1] = d1[1];
711: d2[2] = d1[2];
712: break;
713: default:
714: for ( i = 0; i < nd_wpd; i++ )
715: d2[i] = d1[i];
716: break;
717: }
1.6 noro 718: }
719:
1.61 noro 720: INLINE void ndl_zero(UINT *d)
721: {
1.157 noro 722: int i;
723: for ( i = 0; i < nd_wpd; i++ ) d[i] = 0;
1.61 noro 724: }
725:
726: INLINE void ndl_add(UINT *d1,UINT *d2,UINT *d)
1.1 noro 727: {
1.157 noro 728: int i;
1.1 noro 729:
1.162 noro 730: if ( nd_module ) {
731: if ( MPOS(d1) && MPOS(d2) && (MPOS(d1) != MPOS(d2)) )
732: error("ndl_add : invalid operation");
733: }
1.43 noro 734: #if 1
1.157 noro 735: switch ( nd_wpd ) {
736: case 2:
737: TD(d) = TD(d1)+TD(d2);
738: d[1] = d1[1]+d2[1];
739: break;
740: case 3:
741: TD(d) = TD(d1)+TD(d2);
742: d[1] = d1[1]+d2[1];
743: d[2] = d1[2]+d2[2];
744: break;
745: default:
746: for ( i = 0; i < nd_wpd; i++ ) d[i] = d1[i]+d2[i];
747: break;
748: }
1.43 noro 749: #else
1.157 noro 750: for ( i = 0; i < nd_wpd; i++ ) d[i] = d1[i]+d2[i];
1.43 noro 751: #endif
1.6 noro 752: }
753:
1.55 noro 754: /* d1 += d2 */
1.61 noro 755: INLINE void ndl_addto(UINT *d1,UINT *d2)
1.55 noro 756: {
1.157 noro 757: int i;
1.55 noro 758:
1.162 noro 759: if ( nd_module ) {
760: if ( MPOS(d1) && MPOS(d2) && (MPOS(d1) != MPOS(d2)) )
761: error("ndl_addto : invalid operation");
762: }
1.55 noro 763: #if 1
1.157 noro 764: switch ( nd_wpd ) {
765: case 2:
766: TD(d1) += TD(d2);
767: d1[1] += d2[1];
768: break;
769: case 3:
770: TD(d1) += TD(d2);
771: d1[1] += d2[1];
772: d1[2] += d2[2];
773: break;
774: default:
775: for ( i = 0; i < nd_wpd; i++ ) d1[i] += d2[i];
776: break;
777: }
1.55 noro 778: #else
1.157 noro 779: for ( i = 0; i < nd_wpd; i++ ) d1[i] += d2[i];
1.55 noro 780: #endif
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;
1.163 ! noro 2212: if ( ndl_reducible(tl,t) ) {
! 2213: ndl_lcm(DL(nd_psh[cur->i1]),t,lcm);
! 2214: if ( !ndl_equal(lcm,tl) ) {
! 2215: ndl_lcm(DL(nd_psh[cur->i2]),t,lcm);
! 2216: if (!ndl_equal(lcm,tl)) {
! 2217: remove = cur;
! 2218: if ( !prev ) {
! 2219: head = cur = NEXT(cur);
! 2220: } else {
! 2221: cur = NEXT(prev) = NEXT(cur);
! 2222: }
! 2223: FREENDP(remove);
! 2224: } else {
! 2225: prev = cur; cur = NEXT(cur);
! 2226: }
! 2227: } else {
! 2228: prev = cur; cur = NEXT(cur);
! 2229: }
1.157 noro 2230: } else {
2231: prev = cur; cur = NEXT(cur);
2232: }
2233: }
2234: return head;
1.1 noro 2235: }
2236:
2237: ND_pairs crit_M( ND_pairs d1 )
2238: {
1.157 noro 2239: ND_pairs e,d2,d3,dd,p;
2240: UINT *id,*jd;
1.1 noro 2241:
1.157 noro 2242: if ( !d1 ) return d1;
2243: for ( dd = 0, e = d1; e; e = d3 ) {
2244: if ( !(d2 = NEXT(e)) ) {
2245: NEXT(e) = dd;
2246: return e;
2247: }
2248: id = LCM(e);
2249: for ( d3 = 0; d2; d2 = p ) {
2250: p = NEXT(d2);
2251: jd = LCM(d2);
2252: if ( ndl_equal(jd,id) )
2253: ;
2254: else if ( TD(jd) > TD(id) )
2255: if ( ndl_reducible(jd,id) ) continue;
2256: else ;
2257: else if ( ndl_reducible(id,jd) ) goto delit;
2258: NEXT(d2) = d3;
2259: d3 = d2;
2260: }
2261: NEXT(e) = dd;
2262: dd = e;
2263: continue;
2264: /**/
2265: delit: NEXT(d2) = d3;
2266: d3 = d2;
2267: for ( ; p; p = d2 ) {
2268: d2 = NEXT(p);
2269: NEXT(p) = d3;
2270: d3 = p;
2271: }
2272: FREENDP(e);
2273: }
2274: return dd;
1.1 noro 2275: }
2276:
2277: ND_pairs crit_F( ND_pairs d1 )
2278: {
1.157 noro 2279: ND_pairs rest, head,remove;
2280: ND_pairs last, p, r, w;
2281: int s;
2282:
2283: if ( !d1 ) return d1;
2284: for ( head = last = 0, p = d1; NEXT(p); ) {
2285: r = w = equivalent_pairs(p,&rest);
2286: s = SG(r);
2287: w = NEXT(w);
2288: while ( w ) {
2289: if ( crit_2(w->i1,w->i2) ) {
2290: r = w;
2291: w = NEXT(w);
2292: while ( w ) {
2293: remove = w;
2294: w = NEXT(w);
2295: FREENDP(remove);
2296: }
2297: break;
2298: } else if ( SG(w) < s ) {
2299: FREENDP(r);
2300: r = w;
2301: s = SG(r);
2302: w = NEXT(w);
2303: } else {
2304: remove = w;
2305: w = NEXT(w);
2306: FREENDP(remove);
2307: }
2308: }
2309: if ( last ) NEXT(last) = r;
2310: else head = r;
2311: NEXT(last = r) = 0;
2312: p = rest;
2313: if ( !p ) return head;
2314: }
2315: if ( !last ) return p;
2316: NEXT(last) = p;
2317: return head;
1.1 noro 2318: }
2319:
2320: int crit_2( int dp1, int dp2 )
2321: {
1.157 noro 2322: return ndl_disjoint(DL(nd_psh[dp1]),DL(nd_psh[dp2]));
1.1 noro 2323: }
2324:
1.40 noro 2325: ND_pairs equivalent_pairs( ND_pairs d1, ND_pairs *prest )
1.1 noro 2326: {
1.157 noro 2327: ND_pairs w,p,r,s;
2328: UINT *d;
1.1 noro 2329:
1.157 noro 2330: w = d1;
2331: d = LCM(w);
2332: s = NEXT(w);
2333: NEXT(w) = 0;
2334: for ( r = 0; s; s = p ) {
2335: p = NEXT(s);
2336: if ( ndl_equal(d,LCM(s)) ) {
2337: NEXT(s) = w; w = s;
2338: } else {
2339: NEXT(s) = r; r = s;
2340: }
2341: }
2342: *prest = r;
2343: return w;
1.1 noro 2344: }
2345:
2346: NODE update_base(NODE nd,int ndp)
2347: {
1.157 noro 2348: UINT *dl, *dln;
2349: NODE last, p, head;
1.1 noro 2350:
1.157 noro 2351: dl = DL(nd_psh[ndp]);
2352: for ( head = last = 0, p = nd; p; ) {
1.159 noro 2353: dln = DL(nd_psh[(long)BDY(p)]);
1.157 noro 2354: if ( ndl_reducible( dln, dl ) ) {
2355: p = NEXT(p);
2356: if ( last ) NEXT(last) = p;
2357: } else {
2358: if ( !last ) head = p;
2359: p = NEXT(last = p);
2360: }
2361: }
2362: head = append_one(head,ndp);
2363: return head;
1.1 noro 2364: }
2365:
2366: ND_pairs nd_minp( ND_pairs d, ND_pairs *prest )
2367: {
1.157 noro 2368: ND_pairs m,ml,p,l;
2369: UINT *lcm;
2370: int s,td,len,tlen,c,c1;
2371:
2372: if ( !(p = NEXT(m = d)) ) {
2373: *prest = p;
2374: NEXT(m) = 0;
2375: return m;
2376: }
2377: s = SG(m);
2378: if ( !NoSugar ) {
2379: for ( ml = 0, l = m; p; p = NEXT(l = p) )
2380: if ( (SG(p) < s)
2381: || ((SG(p) == s) && (DL_COMPARE(LCM(p),LCM(m)) < 0)) ) {
2382: ml = l; m = p; s = SG(m);
2383: }
2384: } else {
2385: for ( ml = 0, l = m; p; p = NEXT(l = p) )
2386: if ( DL_COMPARE(LCM(p),LCM(m)) < 0 ) {
2387: ml = l; m = p; s = SG(m);
2388: }
2389: }
2390: if ( !ml ) *prest = NEXT(m);
2391: else {
2392: NEXT(ml) = NEXT(m);
2393: *prest = d;
2394: }
2395: NEXT(m) = 0;
2396: return m;
1.1 noro 2397: }
2398:
1.63 noro 2399: ND_pairs nd_minsugarp( ND_pairs d, ND_pairs *prest )
2400: {
1.157 noro 2401: int msugar,i;
2402: ND_pairs t,dm0,dm,dr0,dr;
1.63 noro 2403:
1.157 noro 2404: for ( msugar = SG(d), t = NEXT(d); t; t = NEXT(t) )
2405: if ( SG(t) < msugar ) msugar = SG(t);
2406: dm0 = 0; dr0 = 0;
2407: for ( i = 0, t = d; t; t = NEXT(t) )
2408: if ( i < nd_f4_nsp && SG(t) == msugar ) {
2409: if ( dm0 ) NEXT(dm) = t;
2410: else dm0 = t;
2411: dm = t;
2412: i++;
2413: } else {
2414: if ( dr0 ) NEXT(dr) = t;
2415: else dr0 = t;
2416: dr = t;
2417: }
2418: NEXT(dm) = 0;
2419: if ( dr0 ) NEXT(dr) = 0;
2420: *prest = dr0;
2421: return dm0;
1.63 noro 2422: }
2423:
1.77 noro 2424: int ndv_newps(int m,NDV a,NDV aq)
1.1 noro 2425: {
1.157 noro 2426: int len;
2427: RHist r;
2428: NDV b;
2429:
2430: if ( nd_psn == nd_pslen ) {
2431: nd_pslen *= 2;
2432: nd_ps = (NDV *)REALLOC((char *)nd_ps,nd_pslen*sizeof(NDV));
2433: nd_ps_trace = (NDV *)REALLOC((char *)nd_ps_trace,nd_pslen*sizeof(NDV));
2434: nd_psh = (RHist *)REALLOC((char *)nd_psh,nd_pslen*sizeof(RHist));
2435: nd_bound = (UINT **)
2436: REALLOC((char *)nd_bound,nd_pslen*sizeof(UINT *));
2437: }
2438: NEWRHist(r); nd_psh[nd_psn] = r;
2439: nd_ps[nd_psn] = a;
2440: if ( aq ) {
2441: nd_ps_trace[nd_psn] = aq;
2442: register_hcf(aq);
2443: nd_bound[nd_psn] = ndv_compute_bound(aq);
2444: SG(r) = SG(aq); ndl_copy(HDL(aq),DL(r));
2445: } else {
2446: if ( !m ) register_hcf(a);
2447: nd_bound[nd_psn] = ndv_compute_bound(a);
2448: SG(r) = SG(a); ndl_copy(HDL(a),DL(r));
2449: }
2450: if ( nd_demand ) {
2451: if ( aq ) {
2452: ndv_save(nd_ps_trace[nd_psn],nd_psn);
2453: nd_ps_trace[nd_psn] = 0;
2454: } else {
2455: ndv_save(nd_ps[nd_psn],nd_psn);
2456: nd_ps[nd_psn] = 0;
2457: }
2458: }
2459: return nd_psn++;
1.1 noro 2460: }
2461:
1.151 noro 2462: void ndv_setup(int mod,int trace,NODE f,int dont_sort,int dont_removecont)
1.1 noro 2463: {
1.157 noro 2464: int i,j,td,len,max;
2465: NODE s,s0,f0;
2466: UINT *d;
2467: RHist r;
2468: NDV *w;
2469: NDV a,am;
2470:
2471: nd_found = 0; nd_notfirst = 0; nd_create = 0;
2472:
2473: for ( nd_psn = 0, s = f; s; s = NEXT(s) ) if ( BDY(s) ) nd_psn++;
2474: w = (NDV *)ALLOCA(nd_psn*sizeof(NDV));
2475: for ( i = 0, s = f; s; s = NEXT(s) ) if ( BDY(s) ) w[i++] = BDY(s);
2476: if ( !dont_sort ) {
2477: /* XXX heuristic */
2478: if ( !nd_ord->id && (nd_ord->ord.simple<2) )
2479: qsort(w,nd_psn,sizeof(NDV),
2480: (int (*)(const void *,const void *))ndv_compare_rev);
2481: else
2482: qsort(w,nd_psn,sizeof(NDV),
2483: (int (*)(const void *,const void *))ndv_compare);
2484: }
2485: nd_pslen = 2*nd_psn;
2486: nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV));
2487: nd_ps_trace = (NDV *)MALLOC(nd_pslen*sizeof(NDV));
2488: nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist));
2489: nd_bound = (UINT **)MALLOC(nd_pslen*sizeof(UINT *));
2490: nd_hcf = 0;
2491:
2492: if ( trace && nd_vc )
2493: makesubst(nd_vc,&nd_subst);
2494: else
2495: nd_subst = 0;
2496:
2497: if ( !nd_red )
2498: nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist));
2499: for ( i = 0; i < REDTAB_LEN; i++ ) nd_red[i] = 0;
2500: for ( i = 0; i < nd_psn; i++ ) {
2501: if ( trace ) {
2502: a = nd_ps_trace[i] = ndv_dup(0,w[i]);
2503: if ( !dont_removecont) ndv_removecont(0,a);
2504: register_hcf(a);
2505: am = nd_ps[i] = ndv_dup(mod,a);
2506: ndv_mod(mod,am);
2507: ndv_removecont(mod,am);
2508: } else {
2509: a = nd_ps[i] = ndv_dup(mod,w[i]);
2510: if ( mod || !dont_removecont ) ndv_removecont(mod,a);
2511: if ( !mod ) register_hcf(a);
2512: }
2513: NEWRHist(r); SG(r) = HTD(a); ndl_copy(HDL(a),DL(r));
2514: nd_bound[i] = ndv_compute_bound(a);
2515: nd_psh[i] = r;
2516: if ( nd_demand ) {
2517: if ( trace ) {
2518: ndv_save(nd_ps_trace[i],i);
2519: nd_ps_trace[i] = 0;
2520: } else {
2521: ndv_save(nd_ps[i],i);
2522: nd_ps[i] = 0;
2523: }
2524: }
2525: }
1.20 noro 2526: }
2527:
1.119 noro 2528: struct order_spec *append_block(struct order_spec *spec,
2529: int nv,int nalg,int ord);
2530:
1.121 noro 2531: extern VECT current_dl_weight_vector_obj;
2532: static VECT prev_weight_vector_obj;
2533:
1.120 noro 2534: void preprocess_algcoef(VL vv,VL av,struct order_spec *ord,LIST f,
1.157 noro 2535: struct order_spec **ord1p,LIST *f1p,NODE *alistp)
1.120 noro 2536: {
1.157 noro 2537: NODE alist,t,s,r0,r,arg;
2538: VL tv;
2539: P poly;
2540: DP d;
2541: Alg alpha,dp;
2542: DAlg inv,da,hc;
2543: MP m;
2544: int i,nvar,nalg,n;
2545: NumberField nf;
2546: LIST f1,f2;
2547: struct order_spec *current_spec;
2548: VECT obj,obj0;
2549: Obj tmp;
2550:
2551: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++);
2552: for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++);
2553:
2554: for ( alist = 0, tv = av; tv; tv = NEXT(tv) ) {
2555: NEXTNODE(alist,t); MKV(tv->v,poly);
2556: MKAlg(poly,alpha); BDY(t) = (pointer)alpha;
2557: tv->v = tv->v->priv;
2558: }
2559: NEXT(t) = 0;
2560:
2561: /* simplification, makeing polynomials monic */
2562: setfield_dalg(alist);
2563: obj_algtodalg(f,&f1);
2564: for ( t = BDY(f); t; t = NEXT(t) ) {
2565: initd(ord); ptod(vv,vv,(P)BDY(t),&d);
2566: hc = (DAlg)BDY(d)->c;
2567: if ( NID(hc) == N_DA ) {
2568: invdalg(hc,&inv);
2569: for ( m = BDY(d); m; m = NEXT(m) ) {
2570: muldalg(inv,(DAlg)m->c,&da); m->c = (P)da;
2571: }
2572: }
2573: initd(ord); dtop(vv,vv,d,&poly); BDY(f) = (pointer)poly;
2574: }
2575: obj_dalgtoalg(f1,&f);
2576:
2577: /* append alg vars to the var list */
2578: for ( tv = vv; NEXT(tv); tv = NEXT(tv) );
2579: NEXT(tv) = av;
2580:
2581: /* append a block to ord */
2582: *ord1p = append_block(ord,nvar,nalg,2);
2583:
2584: /* create generator list */
2585: nf = get_numberfield();
2586: for ( i = nalg-1, t = BDY(f); i >= 0; i-- ) {
2587: MKAlg(nf->defpoly[i],dp);
2588: MKNODE(s,dp,t); t = s;
2589: }
2590: MKLIST(f1,t);
2591: *alistp = alist;
2592: algobjtorat(f1,f1p);
2593:
2594: /* creating a new weight vector */
2595: prev_weight_vector_obj = obj0 = current_dl_weight_vector_obj;
2596: n = nvar+nalg+1;
2597: MKVECT(obj,n);
2598: if ( obj0 && obj0->len == nvar )
2599: for ( i = 0; i < nvar; i++ ) BDY(obj)[i] = BDY(obj0)[i];
2600: else
2601: for ( i = 0; i < nvar; i++ ) BDY(obj)[i] = (pointer)ONE;
2602: for ( i = 0; i < nalg; i++ ) BDY(obj)[i+nvar] = 0;
2603: BDY(obj)[n-1] = (pointer)ONE;
2604: arg = mknode(1,obj);
2605: Pdp_set_weight(arg,&tmp);
1.121 noro 2606: }
2607:
2608: NODE postprocess_algcoef(VL av,NODE alist,NODE r)
2609: {
1.157 noro 2610: NODE s,t,u0,u;
2611: P p;
2612: VL tv;
2613: Obj obj,tmp;
2614: NODE arg;
2615:
2616: u0 = 0;
2617: for ( t = r; t; t = NEXT(t) ) {
2618: p = (P)BDY(t);
2619: for ( tv = av, s = alist; tv; tv = NEXT(tv), s = NEXT(s) ) {
2620: substr(CO,0,(Obj)p,tv->v,(Obj)BDY(s),&obj); p = (P)obj;
2621: }
2622: if ( OID(p) == O_P || (OID(p) == O_N && NID((Num)p) != N_A) ) {
2623: NEXTNODE(u0,u);
2624: BDY(u) = (pointer)p;
2625: }
2626: }
2627: arg = mknode(1,prev_weight_vector_obj);
2628: Pdp_set_weight(arg,&tmp);
1.121 noro 2629:
1.157 noro 2630: return u0;
1.120 noro 2631: }
2632:
1.63 noro 2633: void nd_gr(LIST f,LIST v,int m,int f4,struct order_spec *ord,LIST *rp)
1.1 noro 2634: {
1.157 noro 2635: VL tv,fv,vv,vc,av;
2636: NODE fd,fd0,r,r0,t,x,s,xx,alist;
2637: int e,max,nvar,i;
2638: NDV b;
2639: int ishomo,nalg,mrank,trank;
2640: Alg alpha,dp;
2641: P p,zp;
2642: Q dmy;
2643: LIST f1,f2,zpl;
2644: Obj obj;
2645: NumberField nf;
2646: struct order_spec *ord1;
1.1 noro 2647:
1.163 ! noro 2648: nd_module = 0;
1.157 noro 2649: if ( !m && Demand ) nd_demand = 1;
2650: else nd_demand = 0;
1.78 noro 2651:
1.157 noro 2652: if ( DP_Multiple )
2653: nd_scale = ((double)DP_Multiple)/(double)(Denominator?Denominator:1);
1.103 noro 2654: #if 0
1.157 noro 2655: ndv_alloc = 0;
1.103 noro 2656: #endif
1.157 noro 2657: get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc);
2658: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
2659: switch ( ord->id ) {
2660: case 1:
2661: if ( ord->nv != nvar )
2662: error("nd_{gr,f4} : invalid order specification");
2663: break;
2664: default:
2665: break;
2666: }
2667: nd_nalg = 0;
2668: av = 0;
2669: if ( !m ) {
2670: get_algtree((Obj)f,&av);
2671: for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++ );
2672: nd_ntrans = nvar;
2673: nd_nalg = nalg;
2674: /* #i -> t#i */
2675: if ( nalg ) {
2676: preprocess_algcoef(vv,av,ord,f,&ord1,&f1,&alist);
2677: ord = ord1;
2678: f = f1;
2679: }
2680: nvar += nalg;
2681: }
2682: nd_init_ord(ord);
2683: mrank = 0;
2684: for ( t = BDY(f), max = 0; t; t = NEXT(t) )
2685: for ( tv = vv; tv; tv = NEXT(tv) ) {
2686: if ( nd_module ) {
2687: s = BDY((LIST)BDY(t));
2688: trank = length(s);
2689: mrank = MAX(mrank,trank);
2690: for ( ; s; s = NEXT(s) ) {
2691: e = getdeg(tv->v,(P)BDY(s));
2692: max = MAX(e,max);
2693: }
2694: } else {
2695: e = getdeg(tv->v,(P)BDY(t));
2696: max = MAX(e,max);
2697: }
2698: }
2699: nd_setup_parameters(nvar,max);
2700: ishomo = 1;
2701: for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
2702: if ( nd_module ) {
2703: pltozpl((LIST)BDY(t),&dmy,&zpl);
2704: b = (pointer)pltondv(CO,vv,zpl);
2705: } else {
2706: ptozp((P)BDY(t),1,&dmy,&zp);
2707: b = (pointer)ptondv(CO,vv,zp);
2708: }
2709: if ( ishomo )
2710: ishomo = ishomo && ndv_ishomo(b);
2711: if ( m ) ndv_mod(m,b);
2712: if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; }
2713: }
2714: if ( fd0 ) NEXT(fd) = 0;
2715: ndv_setup(m,0,fd0,0,0);
2716: x = f4?nd_f4(m):nd_gb(m,ishomo,0);
2717: nd_demand = 0;
2718: x = ndv_reducebase(x);
2719: x = ndv_reduceall(m,x);
2720: for ( r0 = 0, t = x; t; t = NEXT(t) ) {
2721: NEXTNODE(r0,r);
2722: if ( nd_module ) BDY(r) = ndvtopl(m,CO,vv,BDY(t),mrank);
2723: else BDY(r) = ndvtop(m,CO,vv,BDY(t));
2724: }
2725: if ( r0 ) NEXT(r) = 0;
2726: if ( nalg )
2727: r0 = postprocess_algcoef(av,alist,r0);
2728: MKLIST(*rp,r0);
1.103 noro 2729: #if 0
1.157 noro 2730: fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc);
1.103 noro 2731: #endif
1.127 noro 2732: }
2733:
2734: void nd_gr_postproc(LIST f,LIST v,int m,struct order_spec *ord,int do_check,LIST *rp)
2735: {
1.157 noro 2736: VL tv,fv,vv,vc,av;
2737: NODE fd,fd0,r,r0,t,x,s,xx,alist;
2738: int e,max,nvar,i;
2739: NDV b;
2740: int ishomo,nalg;
2741: Alg alpha,dp;
2742: P p,zp;
2743: Q dmy;
2744: LIST f1,f2;
2745: Obj obj;
2746: NumberField nf;
2747: struct order_spec *ord1;
2748:
2749: get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc);
2750: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
2751: switch ( ord->id ) {
2752: case 1:
2753: if ( ord->nv != nvar )
2754: error("nd_check : invalid order specification");
2755: break;
2756: default:
2757: break;
2758: }
2759: nd_nalg = 0;
2760: av = 0;
2761: if ( !m ) {
2762: get_algtree((Obj)f,&av);
2763: for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++ );
2764: nd_ntrans = nvar;
2765: nd_nalg = nalg;
2766: /* #i -> t#i */
2767: if ( nalg ) {
2768: preprocess_algcoef(vv,av,ord,f,&ord1,&f1,&alist);
2769: ord = ord1;
2770: f = f1;
2771: }
2772: nvar += nalg;
2773: }
2774: nd_init_ord(ord);
2775: for ( t = BDY(f), max = 0; t; t = NEXT(t) )
2776: for ( tv = vv; tv; tv = NEXT(tv) ) {
2777: e = getdeg(tv->v,(P)BDY(t));
2778: max = MAX(e,max);
2779: }
2780: nd_setup_parameters(nvar,max);
2781: ishomo = 1;
2782: for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
2783: ptozp((P)BDY(t),1,&dmy,&zp);
2784: b = (pointer)ptondv(CO,vv,zp);
2785: if ( ishomo )
2786: ishomo = ishomo && ndv_ishomo(b);
2787: if ( m ) ndv_mod(m,b);
2788: if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; }
2789: }
2790: if ( fd0 ) NEXT(fd) = 0;
2791: ndv_setup(m,0,fd0,0,1);
2792: for ( x = 0, i = 0; i < nd_psn; i++ )
2793: x = update_base(x,i);
2794: if ( do_check ) {
2795: x = nd_gb(m,ishomo,1);
2796: if ( !x ) {
2797: *rp = 0;
2798: return;
2799: }
2800: } else {
2801: for ( t = x; t; t = NEXT(t) )
1.159 noro 2802: BDY(t) = (pointer)nd_ps[(long)BDY(t)];
1.157 noro 2803: }
2804: x = ndv_reducebase(x);
2805: x = ndv_reduceall(m,x);
2806: for ( r0 = 0, t = x; t; t = NEXT(t) ) {
2807: NEXTNODE(r0,r);
2808: BDY(r) = ndvtop(m,CO,vv,BDY(t));
2809: }
2810: if ( r0 ) NEXT(r) = 0;
2811: if ( nalg )
2812: r0 = postprocess_algcoef(av,alist,r0);
2813: MKLIST(*rp,r0);
1.20 noro 2814: }
2815:
1.133 noro 2816: void nd_gr_trace(LIST f,LIST v,int trace,int homo,int f4,struct order_spec *ord,LIST *rp)
1.20 noro 2817: {
1.157 noro 2818: VL tv,fv,vv,vc,av;
2819: NODE fd,fd0,in0,in,r,r0,t,s,cand,alist;
2820: int m,nocheck,nvar,mindex,e,max;
2821: NDV c;
2822: NMV a;
2823: P p,zp;
2824: Q dmy;
2825: EPOS oepos;
1.158 noro 2826: int obpe,oadv,wmax,i,len,cbpe,ishomo,nalg,mrank,trank;
1.157 noro 2827: Alg alpha,dp;
2828: P poly;
1.158 noro 2829: LIST f1,f2,zpl;
1.157 noro 2830: Obj obj;
2831: NumberField nf;
2832: struct order_spec *ord1;
2833: struct oEGT eg_check,eg0,eg1;
2834:
1.163 ! noro 2835: nd_module = 0;
1.157 noro 2836: if ( DP_Multiple )
2837: nd_scale = ((double)DP_Multiple)/(double)(Denominator?Denominator:1);
2838:
2839: get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc);
2840: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
2841: switch ( ord->id ) {
2842: case 1:
2843: if ( ord->nv != nvar )
2844: error("nd_gr_trace : invalid order specification");
2845: break;
2846: default:
2847: break;
2848: }
2849:
2850: get_algtree((Obj)f,&av);
2851: for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++ );
2852: nd_ntrans = nvar;
2853: nd_nalg = nalg;
2854: /* #i -> t#i */
2855: if ( nalg ) {
2856: preprocess_algcoef(vv,av,ord,f,&ord1,&f1,&alist);
2857: ord = ord1;
2858: f = f1;
2859: }
2860: nvar += nalg;
2861:
2862: nocheck = 0;
2863: mindex = 0;
2864:
2865: if ( Demand ) nd_demand = 1;
2866: else nd_demand = 0;
2867:
2868: /* setup modulus */
2869: if ( trace < 0 ) {
2870: trace = -trace;
2871: nocheck = 1;
2872: }
2873: m = trace > 1 ? trace : get_lprime(mindex);
1.158 noro 2874: nd_init_ord(ord);
2875: mrank = 0;
1.157 noro 2876: for ( t = BDY(f), max = 0; t; t = NEXT(t) )
2877: for ( tv = vv; tv; tv = NEXT(tv) ) {
1.158 noro 2878: if ( nd_module ) {
2879: s = BDY((LIST)BDY(t));
2880: trank = length(s);
2881: mrank = MAX(mrank,trank);
2882: for ( ; s; s = NEXT(s) ) {
2883: e = getdeg(tv->v,(P)BDY(s));
2884: max = MAX(e,max);
2885: }
2886: } else {
2887: e = getdeg(tv->v,(P)BDY(t));
2888: max = MAX(e,max);
2889: }
1.157 noro 2890: }
2891: nd_setup_parameters(nvar,max);
2892: obpe = nd_bpe; oadv = nmv_adv; oepos = nd_epos;
2893: ishomo = 1;
2894: for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
1.158 noro 2895: if ( nd_module ) {
2896: pltozpl((LIST)BDY(t),&dmy,&zpl);
2897: c = (pointer)pltondv(CO,vv,zpl);
2898: } else {
2899: ptozp((P)BDY(t),1,&dmy,&zp);
2900: c = (pointer)ptondv(CO,vv,zp);
2901: }
1.157 noro 2902: if ( ishomo )
2903: ishomo = ishomo && ndv_ishomo(c);
2904: if ( c ) {
2905: NEXTNODE(in0,in); BDY(in) = (pointer)c;
2906: NEXTNODE(fd0,fd); BDY(fd) = (pointer)ndv_dup(0,c);
2907: }
2908: }
2909: if ( in0 ) NEXT(in) = 0;
2910: if ( fd0 ) NEXT(fd) = 0;
2911: if ( !ishomo && homo ) {
2912: for ( t = in0, wmax = max; t; t = NEXT(t) ) {
2913: c = (NDV)BDY(t); len = LEN(c);
2914: for ( a = BDY(c), i = 0; i < len; i++, NMV_ADV(a) )
2915: wmax = MAX(TD(DL(a)),wmax);
2916: }
2917: homogenize_order(ord,nvar,&ord1);
2918: nd_init_ord(ord1);
2919: nd_setup_parameters(nvar+1,wmax);
2920: for ( t = fd0; t; t = NEXT(t) )
2921: ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos);
2922: }
2923: while ( 1 ) {
2924: if ( Demand )
2925: nd_demand = 1;
2926: ndv_setup(m,1,fd0,0,0);
2927: cand = f4?nd_f4_trace(m):nd_gb_trace(m,ishomo || homo);
2928: if ( !cand ) {
2929: /* failure */
2930: if ( trace > 1 ) { *rp = 0; return; }
2931: else m = get_lprime(++mindex);
2932: continue;
2933: }
2934: if ( !ishomo && homo ) {
2935: /* dehomogenization */
2936: for ( t = cand; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord);
2937: nd_init_ord(ord);
2938: nd_setup_parameters(nvar,0);
2939: }
2940: nd_demand = 0;
2941: cand = ndv_reducebase(cand);
2942: cand = ndv_reduceall(0,cand);
2943: cbpe = nd_bpe;
2944: if ( nocheck )
2945: break;
2946: get_eg(&eg0);
2947: if ( ndv_check_candidate(in0,obpe,oadv,oepos,cand) )
2948: /* success */
2949: break;
2950: else if ( trace > 1 ) {
2951: /* failure */
2952: *rp = 0; return;
2953: } else {
2954: /* try the next modulus */
2955: m = get_lprime(++mindex);
2956: /* reset the parameters */
2957: if ( !ishomo && homo ) {
2958: nd_init_ord(ord1);
2959: nd_setup_parameters(nvar+1,wmax);
2960: } else {
2961: nd_init_ord(ord);
2962: nd_setup_parameters(nvar,max);
2963: }
2964: }
2965: }
2966: get_eg(&eg1); init_eg(&eg_check); add_eg(&eg_check,&eg0,&eg1);
2967: if ( DP_Print )
2968: fprintf(asir_out,"check=%fsec\n",eg_check.exectime+eg_check.gctime);
2969: /* dp->p */
2970: nd_bpe = cbpe;
2971: nd_setup_parameters(nd_nvar,0);
1.158 noro 2972: for ( r = cand; r; r = NEXT(r) ) {
2973: if ( nd_module ) BDY(r) = ndvtopl(0,CO,vv,BDY(r),mrank);
2974: else BDY(r) = (pointer)ndvtop(0,CO,vv,BDY(r));
2975: }
1.157 noro 2976: if ( nalg )
2977: cand = postprocess_algcoef(av,alist,cand);
2978: MKLIST(*rp,cand);
2979: }
1.52 noro 2980:
1.157 noro 2981: /* XXX : module element is not considered */
1.1 noro 2982:
1.61 noro 2983: void dltondl(int n,DL dl,UINT *r)
1.1 noro 2984: {
1.157 noro 2985: UINT *d;
2986: int i,j,l,s,ord_l;
2987: struct order_pair *op;
2988:
2989: d = dl->d;
2990: for ( i = 0; i < nd_wpd; i++ ) r[i] = 0;
2991: if ( nd_blockmask ) {
2992: l = nd_blockmask->n;
2993: op = nd_blockmask->order_pair;
2994: for ( j = 0, s = 0; j < l; j++ ) {
2995: ord_l = op[j].length;
2996: for ( i = 0; i < ord_l; i++, s++ ) PUT_EXP(r,s,d[s]);
2997: }
2998: TD(r) = ndl_weight(r);
2999: ndl_weight_mask(r);
3000: } else {
3001: for ( i = 0; i < n; i++ ) PUT_EXP(r,i,d[i]);
3002: TD(r) = ndl_weight(r);
3003: }
1.1 noro 3004: }
3005:
1.61 noro 3006: DL ndltodl(int n,UINT *ndl)
1.1 noro 3007: {
1.157 noro 3008: DL dl;
3009: int *d;
3010: int i,j,l,s,ord_l;
3011: struct order_pair *op;
3012:
3013: NEWDL(dl,n);
3014: dl->td = TD(ndl);
3015: d = dl->d;
3016: if ( nd_blockmask ) {
3017: l = nd_blockmask->n;
3018: op = nd_blockmask->order_pair;
3019: for ( j = 0, s = 0; j < l; j++ ) {
3020: ord_l = op[j].length;
3021: for ( i = 0; i < ord_l; i++, s++ ) d[s] = GET_EXP(ndl,s);
3022: }
3023: } else {
3024: for ( i = 0; i < n; i++ ) d[i] = GET_EXP(ndl,i);
3025: }
3026: return dl;
1.1 noro 3027: }
3028:
1.61 noro 3029: void ndl_print(UINT *dl)
1.1 noro 3030: {
1.157 noro 3031: int n;
3032: int i,j,l,ord_l,s,s0;
3033: struct order_pair *op;
3034:
3035: n = nd_nvar;
3036: printf("<<");
3037: if ( nd_blockmask ) {
3038: l = nd_blockmask->n;
3039: op = nd_blockmask->order_pair;
3040: for ( j = 0, s = s0 = 0; j < l; j++ ) {
3041: ord_l = op[j].length;
3042: for ( i = 0; i < ord_l; i++, s++ )
3043: printf(s==n-1?"%d":"%d,",GET_EXP(dl,s));
3044: }
3045: } else {
3046: for ( i = 0; i < n; i++ ) printf(i==n-1?"%d":"%d,",GET_EXP(dl,i));
3047: }
3048: printf(">>");
3049: if ( MPOS(dl) )
3050: printf("*e%d",MPOS(dl));
1.1 noro 3051: }
3052:
3053: void nd_print(ND p)
3054: {
1.157 noro 3055: NM m;
1.1 noro 3056:
1.157 noro 3057: if ( !p )
3058: printf("0\n");
3059: else {
3060: for ( m = BDY(p); m; m = NEXT(m) ) {
3061: if ( CM(m) & 0x80000000 ) printf("+@_%d*",IFTOF(CM(m)));
3062: else printf("+%d*",CM(m));
3063: ndl_print(DL(m));
3064: }
3065: printf("\n");
3066: }
1.1 noro 3067: }
3068:
1.113 noro 3069: void nd_print_q(ND p)
1.16 noro 3070: {
1.157 noro 3071: NM m;
1.16 noro 3072:
1.157 noro 3073: if ( !p )
3074: printf("0\n");
3075: else {
3076: for ( m = BDY(p); m; m = NEXT(m) ) {
3077: printf("+");
3078: printexpr(CO,(Obj)CQ(m));
3079: printf("*");
3080: ndl_print(DL(m));
3081: }
3082: printf("\n");
3083: }
1.16 noro 3084: }
3085:
1.1 noro 3086: void ndp_print(ND_pairs d)
3087: {
1.157 noro 3088: ND_pairs t;
1.1 noro 3089:
1.157 noro 3090: for ( t = d; t; t = NEXT(t) ) printf("%d,%d ",t->i1,t->i2);
3091: printf("\n");
1.1 noro 3092: }
3093:
1.20 noro 3094: void nd_removecont(int mod,ND p)
1.16 noro 3095: {
1.157 noro 3096: int i,n;
3097: Q *w;
3098: Q dvr,t;
3099: NM m;
3100: struct oVECT v;
3101: N q,r;
3102:
3103: if ( mod == -1 ) nd_mul_c(mod,p,_invsf(HCM(p)));
3104: else if ( mod ) nd_mul_c(mod,p,invm(HCM(p),mod));
3105: else {
3106: for ( m = BDY(p), n = 0; m; m = NEXT(m), n++ );
3107: w = (Q *)ALLOCA(n*sizeof(Q));
3108: v.len = n;
3109: v.body = (pointer *)w;
3110: for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) w[i] = CQ(m);
3111: removecont_array((P *)w,n,1);
3112: for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) CQ(m) = w[i];
3113: }
1.16 noro 3114: }
3115:
1.21 noro 3116: void nd_removecont2(ND p1,ND p2)
3117: {
1.157 noro 3118: int i,n1,n2,n;
3119: Q *w;
3120: Q dvr,t;
3121: NM m;
3122: struct oVECT v;
3123: N q,r;
3124:
3125: n1 = nd_length(p1);
3126: n2 = nd_length(p2);
3127: n = n1+n2;
3128: w = (Q *)ALLOCA(n*sizeof(Q));
3129: v.len = n;
3130: v.body = (pointer *)w;
3131: i = 0;
3132: if ( p1 )
3133: for ( m = BDY(p1); i < n1; m = NEXT(m), i++ ) w[i] = CQ(m);
3134: if ( p2 )
3135: for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = CQ(m);
3136: removecont_array((P *)w,n,1);
3137: i = 0;
3138: if ( p1 )
3139: for ( m = BDY(p1); i < n1; m = NEXT(m), i++ ) CQ(m) = w[i];
3140: if ( p2 )
3141: for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) CQ(m) = w[i];
1.21 noro 3142: }
3143:
1.20 noro 3144: void ndv_removecont(int mod,NDV p)
1.16 noro 3145: {
1.157 noro 3146: int i,len,all_p;
3147: Q *c;
3148: P *w;
3149: Q dvr,t;
3150: P g,cont,tp;
3151: NMV m;
3152:
3153: if ( mod == -1 )
3154: ndv_mul_c(mod,p,_invsf(HCM(p)));
3155: else if ( mod )
3156: ndv_mul_c(mod,p,invm(HCM(p),mod));
3157: else {
3158: len = p->len;
3159: w = (P *)ALLOCA(len*sizeof(P));
3160: c = (Q *)ALLOCA(len*sizeof(Q));
3161: for ( m = BDY(p), all_p = 1, i = 0; i < len; NMV_ADV(m), i++ ) {
3162: ptozp(CP(m),1,&c[i],&w[i]);
3163: all_p = all_p && !NUM(w[i]);
3164: }
3165: if ( all_p ) {
3166: qltozl(c,len,&dvr); nd_heu_nezgcdnpz(nd_vc,w,len,1,&g);
3167: mulp(nd_vc,(P)dvr,g,&cont);
3168: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) {
3169: divsp(nd_vc,CP(m),cont,&tp); CP(m) = tp;
3170: }
3171: } else {
3172: sortbynm((Q *)c,len);
3173: qltozl((Q *)c,len,&dvr);
3174: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) {
3175: divsp(nd_vc,CP(m),(P)dvr,&tp); CP(m) = tp;
3176: }
3177: }
3178: }
1.21 noro 3179: }
3180:
1.157 noro 3181: /* koko */
3182:
1.61 noro 3183: void ndv_homogenize(NDV p,int obpe,int oadv,EPOS oepos)
3184: {
1.157 noro 3185: int len,i,max;
3186: NMV m,mr0,mr,t;
1.61 noro 3187:
1.157 noro 3188: len = p->len;
3189: for ( m = BDY(p), i = 0, max = 0; i < len; NMV_OADV(m), i++ )
3190: max = MAX(max,TD(DL(m)));
3191: mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p);
3192: m = (NMV)((char *)mr0+(len-1)*oadv);
3193: mr = (NMV)((char *)mr0+(len-1)*nmv_adv);
3194: t = (NMV)ALLOCA(nmv_adv);
3195: for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) {
3196: ndl_homogenize(DL(m),DL(t),obpe,oepos,max);
3197: CQ(mr) = CQ(m);
3198: ndl_copy(DL(t),DL(mr));
3199: }
3200: NV(p)++;
3201: BDY(p) = mr0;
1.61 noro 3202: }
3203:
1.45 noro 3204: void ndv_dehomogenize(NDV p,struct order_spec *ord)
1.23 noro 3205: {
1.157 noro 3206: int i,j,adj,len,newnvar,newwpd,newadv,newexporigin;
3207: Q *w;
3208: Q dvr,t;
3209: NMV m,r;
3210:
3211: len = p->len;
3212: newnvar = nd_nvar-1;
3213: newexporigin = nd_get_exporigin(ord);
3214: newwpd = newnvar/nd_epw+(newnvar%nd_epw?1:0)+newexporigin;
3215: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ )
3216: ndl_dehomogenize(DL(m));
3217: if ( newwpd != nd_wpd ) {
3218: newadv = ROUND_FOR_ALIGN(sizeof(struct oNMV)+(newwpd-1)*sizeof(UINT));
3219: for ( m = r = BDY(p), i = 0; i < len; NMV_ADV(m), NDV_NADV(r), i++ ) {
3220: CQ(r) = CQ(m);
3221: for ( j = 0; j < newexporigin; j++ ) DL(r)[j] = DL(m)[j];
3222: adj = nd_exporigin-newexporigin;
3223: for ( ; j < newwpd; j++ ) DL(r)[j] = DL(m)[j+adj];
3224: }
3225: }
3226: NV(p)--;
1.23 noro 3227: }
3228:
1.150 noro 3229: void nd_heu_nezgcdnpz(VL vl,P *pl,int m,int full,P *pr)
3230: {
1.157 noro 3231: int i;
3232: P *tpl,*tpl1;
3233: NODE l;
3234: P h,gcd,t;
3235:
3236: tpl = (P *)ALLOCA(m*sizeof(P));
3237: tpl1 = (P *)ALLOCA(m*sizeof(P));
3238: bcopy(pl,tpl,m*sizeof(P));
3239: gcd = (P)ONE;
3240: for ( l = nd_hcf; l; l = NEXT(l) ) {
3241: h = (P)BDY(l);
3242: while ( 1 ) {
3243: for ( i = 0; i < m; i++ )
3244: if ( !divtpz(vl,tpl[i],h,&tpl1[i]) )
3245: break;
3246: if ( i == m ) {
3247: bcopy(tpl1,tpl,m*sizeof(P));
3248: mulp(vl,gcd,h,&t); gcd = t;
3249: } else
3250: break;
3251: }
3252: }
3253: if ( DP_Print > 2 ){fprintf(asir_out,"[%d]",nmonop(gcd)); fflush(asir_out);}
3254: if ( full ) {
3255: heu_nezgcdnpz(vl,tpl,m,&t);
3256: mulp(vl,gcd,t,pr);
3257: } else
3258: *pr = gcd;
1.150 noro 3259: }
3260:
3261: void removecont_array(P *p,int n,int full)
1.146 noro 3262: {
1.157 noro 3263: int all_p,all_q,i;
3264: Q *c;
3265: P *w;
3266: P t,s;
3267:
3268: for ( all_q = 1, i = 0; i < n; i++ )
3269: all_q = all_q && NUM(p[i]);
3270: if ( all_q ) {
3271: removecont_array_q((Q *)p,n);
3272: } else {
3273: c = (Q *)ALLOCA(n*sizeof(Q));
3274: w = (P *)ALLOCA(n*sizeof(P));
3275: for ( i = 0; i < n; i++ ) {
3276: ptozp(p[i],1,&c[i],&w[i]);
3277: }
3278: removecont_array_q(c,n);
3279: nd_heu_nezgcdnpz(nd_vc,w,n,full,&t);
3280: for ( i = 0; i < n; i++ ) {
3281: divsp(nd_vc,w[i],t,&s); mulp(nd_vc,s,(P)c[i],&p[i]);
3282: }
3283: }
1.146 noro 3284: }
3285:
3286: void removecont_array_q(Q *c,int n)
1.21 noro 3287: {
1.157 noro 3288: struct oVECT v;
3289: Q d0,d1,a,u,u1,gcd;
3290: int i,j;
3291: N qn,rn,gn;
3292: Q *q,*r;
3293:
3294: q = (Q *)ALLOCA(n*sizeof(Q));
3295: r = (Q *)ALLOCA(n*sizeof(Q));
3296: v.id = O_VECT; v.len = n; v.body = (pointer *)c;
3297: igcdv_estimate(&v,&d0);
3298: for ( i = 0; i < n; i++ ) {
3299: divn(NM(c[i]),NM(d0),&qn,&rn);
3300: NTOQ(qn,SGN(c[i])*SGN(d0),q[i]);
3301: NTOQ(rn,SGN(c[i]),r[i]);
3302: }
3303: for ( i = 0; i < n; i++ ) if ( r[i] ) break;
3304: if ( i < n ) {
3305: v.id = O_VECT; v.len = n; v.body = (pointer *)r;
3306: igcdv(&v,&d1);
3307: gcdn(NM(d0),NM(d1),&gn); NTOQ(gn,1,gcd);
3308: divsn(NM(d0),gn,&qn); NTOQ(qn,1,a);
3309: for ( i = 0; i < n; i++ ) {
3310: mulq(a,q[i],&u);
3311: if ( r[i] ) {
3312: divsn(NM(r[i]),gn,&qn); NTOQ(qn,SGN(r[i]),u1);
3313: addq(u,u1,&q[i]);
3314: } else
3315: q[i] = u;
3316: }
3317: }
3318: for ( i = 0; i < n; i++ ) c[i] = q[i];
1.16 noro 3319: }
3320:
1.19 noro 3321: void nd_mul_c(int mod,ND p,int mul)
1.1 noro 3322: {
1.157 noro 3323: NM m;
3324: int c,c1;
1.1 noro 3325:
1.157 noro 3326: if ( !p ) return;
3327: if ( mul == 1 ) return;
3328: if ( mod == -1 )
3329: for ( m = BDY(p); m; m = NEXT(m) )
3330: CM(m) = _mulsf(CM(m),mul);
3331: else
3332: for ( m = BDY(p); m; m = NEXT(m) ) {
3333: c1 = CM(m); DMAR(c1,mul,0,mod,c); CM(m) = c;
3334: }
1.1 noro 3335: }
3336:
1.146 noro 3337: void nd_mul_c_q(ND p,P mul)
1.16 noro 3338: {
1.157 noro 3339: NM m;
3340: P c;
1.16 noro 3341:
1.157 noro 3342: if ( !p ) return;
3343: if ( UNIQ(mul) ) return;
3344: for ( m = BDY(p); m; m = NEXT(m) ) {
3345: mulp(nd_vc,CP(m),mul,&c); CP(m) = c;
3346: }
1.16 noro 3347: }
3348:
1.61 noro 3349: void nd_mul_c_p(VL vl,ND p,P mul)
3350: {
1.157 noro 3351: NM m;
3352: P c;
1.61 noro 3353:
1.157 noro 3354: if ( !p ) return;
3355: for ( m = BDY(p); m; m = NEXT(m) ) {
3356: mulp(vl,CP(m),mul,&c); CP(m) = c;
3357: }
1.61 noro 3358: }
3359:
1.1 noro 3360: void nd_free(ND p)
3361: {
1.157 noro 3362: NM t,s;
1.1 noro 3363:
1.157 noro 3364: if ( !p ) return;
3365: t = BDY(p);
3366: while ( t ) {
3367: s = NEXT(t);
3368: FREENM(t);
3369: t = s;
3370: }
3371: FREEND(p);
1.1 noro 3372: }
3373:
1.23 noro 3374: void ndv_free(NDV p)
3375: {
1.157 noro 3376: GC_free(BDY(p));
1.23 noro 3377: }
3378:
1.61 noro 3379: void nd_append_red(UINT *d,int i)
1.1 noro 3380: {
1.157 noro 3381: RHist m,m0;
3382: int h;
1.1 noro 3383:
1.157 noro 3384: NEWRHist(m);
3385: h = ndl_hash_value(d);
3386: m->index = i;
3387: ndl_copy(d,DL(m));
3388: NEXT(m) = nd_red[h];
3389: nd_red[h] = m;
1.1 noro 3390: }
3391:
1.61 noro 3392: UINT *ndv_compute_bound(NDV p)
1.1 noro 3393: {
1.157 noro 3394: UINT *d1,*d2,*t;
3395: UINT u;
3396: int i,j,k,l,len,ind;
3397: NMV m;
3398:
3399: if ( !p )
3400: return 0;
3401: d1 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
3402: d2 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
3403: len = LEN(p);
3404: m = BDY(p); ndl_copy(DL(m),d1); NMV_ADV(m);
3405: for ( i = 1; i < len; i++, NMV_ADV(m) ) {
1.159 noro 3406: ndl_max(DL(m),d1,d2);
1.157 noro 3407: t = d1; d1 = d2; d2 = t;
3408: }
3409: l = nd_nvar+31;
3410: t = (UINT *)MALLOC_ATOMIC(l*sizeof(UINT));
3411: for ( i = nd_exporigin, ind = 0; i < nd_wpd; i++ ) {
3412: u = d1[i];
3413: k = (nd_epw-1)*nd_bpe;
3414: for ( j = 0; j < nd_epw; j++, k -= nd_bpe, ind++ )
3415: t[ind] = (u>>k)&nd_mask0;
3416: }
3417: for ( ; ind < l; ind++ ) t[ind] = 0;
3418: return t;
1.1 noro 3419: }
3420:
1.99 noro 3421: UINT *nd_compute_bound(ND p)
3422: {
1.157 noro 3423: UINT *d1,*d2,*t;
3424: UINT u;
3425: int i,j,k,l,len,ind;
3426: NM m;
3427:
3428: if ( !p )
3429: return 0;
3430: d1 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
3431: d2 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
3432: len = LEN(p);
3433: m = BDY(p); ndl_copy(DL(m),d1); m = NEXT(m);
3434: for ( m = NEXT(m); m; m = NEXT(m) ) {
3435: ndl_lcm(DL(m),d1,d2);
3436: t = d1; d1 = d2; d2 = t;
3437: }
3438: l = nd_nvar+31;
3439: t = (UINT *)MALLOC_ATOMIC(l*sizeof(UINT));
3440: for ( i = nd_exporigin, ind = 0; i < nd_wpd; i++ ) {
3441: u = d1[i];
3442: k = (nd_epw-1)*nd_bpe;
3443: for ( j = 0; j < nd_epw; j++, k -= nd_bpe, ind++ )
3444: t[ind] = (u>>k)&nd_mask0;
3445: }
3446: for ( ; ind < l; ind++ ) t[ind] = 0;
3447: return t;
1.99 noro 3448: }
3449:
1.157 noro 3450: /* if nd_module == 1 then d[nd_exporigin-1] indicates the position */
3451: /* of a term. In this case we need additional 1 word. */
3452:
1.48 noro 3453: int nd_get_exporigin(struct order_spec *ord)
3454: {
1.157 noro 3455: switch ( ord->id ) {
3456: case 0: case 2: case 256: case 258:
3457: return 1+nd_module;
3458: case 1: case 257:
3459: /* block order */
3460: /* poly ring d[0]:weight d[1]:w0,...,d[nd_exporigin-1]:w(n-1) */
3461: /* module d[0]:weight d[1]:w0,...,d[nd_exporigin-2]:w(n-1) */
3462: return ord->ord.block.length+1+nd_module;
3463: case 3: case 259:
3464: error("nd_get_exporigin : composite order is not supported yet.");
3465: }
1.48 noro 3466: }
3467:
1.61 noro 3468: void nd_setup_parameters(int nvar,int max) {
1.157 noro 3469: int i,j,n,elen,ord_o,ord_l,l,s,wpd;
3470: struct order_pair *op;
1.48 noro 3471:
1.157 noro 3472: nd_nvar = nvar;
3473: if ( max ) {
3474: /* XXX */
3475: if ( do_weyl ) nd_bpe = 32;
3476: else if ( max < 2 ) nd_bpe = 1;
3477: else if ( max < 4 ) nd_bpe = 2;
3478: else if ( max < 8 ) nd_bpe = 3;
3479: else if ( max < 16 ) nd_bpe = 4;
3480: else if ( max < 32 ) nd_bpe = 5;
3481: else if ( max < 64 ) nd_bpe = 6;
3482: else if ( max < 256 ) nd_bpe = 8;
3483: else if ( max < 1024 ) nd_bpe = 10;
3484: else if ( max < 65536 ) nd_bpe = 16;
3485: else nd_bpe = 32;
3486: }
3487: nd_epw = (sizeof(UINT)*8)/nd_bpe;
3488: elen = nd_nvar/nd_epw+(nd_nvar%nd_epw?1:0);
3489: nd_exporigin = nd_get_exporigin(nd_ord);
3490: wpd = nd_exporigin+elen;
3491: if ( nd_module )
3492: nd_mpos = nd_exporigin-1;
3493: else
3494: nd_mpos = -1;
3495: if ( wpd != nd_wpd ) {
3496: nd_free_private_storage();
3497: nd_wpd = wpd;
3498: }
3499: if ( nd_bpe < 32 ) {
3500: nd_mask0 = (1<<nd_bpe)-1;
3501: } else {
3502: nd_mask0 = 0xffffffff;
3503: }
3504: bzero(nd_mask,sizeof(nd_mask));
3505: nd_mask1 = 0;
3506: for ( i = 0; i < nd_epw; i++ ) {
3507: nd_mask[nd_epw-i-1] = (nd_mask0<<(i*nd_bpe));
3508: nd_mask1 |= (1<<(nd_bpe-1))<<(i*nd_bpe);
3509: }
3510: nmv_adv = ROUND_FOR_ALIGN(sizeof(struct oNMV)+(nd_wpd-1)*sizeof(UINT));
3511: nd_epos = nd_create_epos(nd_ord);
3512: nd_blockmask = nd_create_blockmask(nd_ord);
3513: nd_work_vector = (int *)REALLOC(nd_work_vector,nd_nvar*sizeof(int));
1.1 noro 3514: }
3515:
1.103 noro 3516: ND_pairs nd_reconstruct(int trace,ND_pairs d)
1.1 noro 3517: {
1.157 noro 3518: int i,obpe,oadv,h;
3519: static NM prev_nm_free_list;
3520: static ND_pairs prev_ndp_free_list;
3521: RHist mr0,mr;
3522: RHist r;
3523: RHist *old_red;
3524: ND_pairs s0,s,t;
3525: EPOS oepos;
3526:
3527: obpe = nd_bpe;
3528: oadv = nmv_adv;
3529: oepos = nd_epos;
3530: if ( obpe < 2 ) nd_bpe = 2;
3531: else if ( obpe < 3 ) nd_bpe = 3;
3532: else if ( obpe < 4 ) nd_bpe = 4;
3533: else if ( obpe < 5 ) nd_bpe = 5;
3534: else if ( obpe < 6 ) nd_bpe = 6;
3535: else if ( obpe < 8 ) nd_bpe = 8;
3536: else if ( obpe < 10 ) nd_bpe = 10;
3537: else if ( obpe < 16 ) nd_bpe = 16;
3538: else if ( obpe < 32 ) nd_bpe = 32;
3539: else error("nd_reconstruct : exponent too large");
3540:
3541: nd_setup_parameters(nd_nvar,0);
3542: prev_nm_free_list = _nm_free_list;
3543: prev_ndp_free_list = _ndp_free_list;
3544: _nm_free_list = 0;
3545: _ndp_free_list = 0;
3546: for ( i = nd_psn-1; i >= 0; i-- ) ndv_realloc(nd_ps[i],obpe,oadv,oepos);
3547: if ( trace )
3548: for ( i = nd_psn-1; i >= 0; i-- )
3549: ndv_realloc(nd_ps_trace[i],obpe,oadv,oepos);
3550: s0 = 0;
3551: for ( t = d; t; t = NEXT(t) ) {
3552: NEXTND_pairs(s0,s);
3553: s->i1 = t->i1;
3554: s->i2 = t->i2;
3555: SG(s) = SG(t);
3556: ndl_reconstruct(LCM(t),LCM(s),obpe,oepos);
3557: }
3558:
3559: old_red = (RHist *)ALLOCA(REDTAB_LEN*sizeof(RHist));
3560: for ( i = 0; i < REDTAB_LEN; i++ ) {
3561: old_red[i] = nd_red[i];
3562: nd_red[i] = 0;
3563: }
3564: for ( i = 0; i < REDTAB_LEN; i++ )
3565: for ( r = old_red[i]; r; r = NEXT(r) ) {
3566: NEWRHist(mr);
3567: mr->index = r->index;
3568: SG(mr) = SG(r);
3569: ndl_reconstruct(DL(r),DL(mr),obpe,oepos);
3570: h = ndl_hash_value(DL(mr));
3571: NEXT(mr) = nd_red[h];
3572: nd_red[h] = mr;
3573: }
3574: for ( i = 0; i < REDTAB_LEN; i++ ) old_red[i] = 0;
3575: old_red = 0;
3576: for ( i = 0; i < nd_psn; i++ ) {
3577: NEWRHist(r); SG(r) = SG(nd_psh[i]);
3578: ndl_reconstruct(DL(nd_psh[i]),DL(r),obpe,oepos);
3579: nd_psh[i] = r;
3580: }
3581: if ( s0 ) NEXT(s) = 0;
3582: prev_nm_free_list = 0;
3583: prev_ndp_free_list = 0;
1.71 noro 3584: #if 0
1.157 noro 3585: GC_gcollect();
1.71 noro 3586: #endif
1.157 noro 3587: return s0;
1.1 noro 3588: }
3589:
1.61 noro 3590: void ndl_reconstruct(UINT *d,UINT *r,int obpe,EPOS oepos)
1.1 noro 3591: {
1.157 noro 3592: int n,i,ei,oepw,omask0,j,s,ord_l,l;
3593: struct order_pair *op;
1.1 noro 3594:
1.157 noro 3595: n = nd_nvar;
3596: oepw = (sizeof(UINT)*8)/obpe;
3597: omask0 = (1<<obpe)-1;
3598: TD(r) = TD(d);
3599: for ( i = nd_exporigin; i < nd_wpd; i++ ) r[i] = 0;
3600: if ( nd_blockmask ) {
3601: l = nd_blockmask->n;
3602: op = nd_blockmask->order_pair;
3603: for ( i = 1; i < nd_exporigin; i++ )
3604: r[i] = d[i];
3605: for ( j = 0, s = 0; j < l; j++ ) {
3606: ord_l = op[j].length;
3607: for ( i = 0; i < ord_l; i++, s++ ) {
3608: ei = GET_EXP_OLD(d,s);
3609: PUT_EXP(r,s,ei);
3610: }
3611: }
3612: } else {
3613: for ( i = 0; i < n; i++ ) {
3614: ei = GET_EXP_OLD(d,i);
3615: PUT_EXP(r,i,ei);
3616: }
3617: }
3618: if ( nd_module ) MPOS(r) = MPOS(d);
1.1 noro 3619: }
1.3 noro 3620:
1.6 noro 3621: ND nd_copy(ND p)
3622: {
1.157 noro 3623: NM m,mr,mr0;
3624: int c,n;
3625: ND r;
3626:
3627: if ( !p )
3628: return 0;
3629: else {
3630: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
3631: NEXTNM(mr0,mr);
3632: CM(mr) = CM(m);
3633: ndl_copy(DL(m),DL(mr));
3634: }
3635: NEXT(mr) = 0;
3636: MKND(NV(p),mr0,LEN(p),r);
3637: SG(r) = SG(p);
3638: return r;
3639: }
1.6 noro 3640: }
3641:
1.53 noro 3642: int nd_sp(int mod,int trace,ND_pairs p,ND *rp)
1.11 noro 3643: {
1.157 noro 3644: NM m1,m2;
3645: NDV p1,p2;
3646: ND t1,t2;
3647: UINT *lcm;
3648: P gp,tp;
3649: Q g,t;
3650: int td;
3651:
3652: if ( !mod && nd_demand ) {
3653: p1 = ndv_load(p->i1); p2 = ndv_load(p->i2);
3654: } else {
3655: if ( trace ) {
3656: p1 = nd_ps_trace[p->i1]; p2 = nd_ps_trace[p->i2];
3657: } else {
3658: p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2];
3659: }
3660: }
3661: lcm = LCM(p);
3662: NEWNM(m1); ndl_sub(lcm,HDL(p1),DL(m1));
3663: if ( ndl_check_bound2(p->i1,DL(m1)) ) {
3664: FREENM(m1); return 0;
3665: }
3666: NEWNM(m2); ndl_sub(lcm,HDL(p2),DL(m2));
3667: if ( ndl_check_bound2(p->i2,DL(m2)) ) {
3668: FREENM(m1); FREENM(m2); return 0;
3669: }
3670:
3671: if ( mod == -1 ) {
3672: CM(m1) = HCM(p2); CM(m2) = _chsgnsf(HCM(p1));
3673: } else if ( mod ) {
3674: CM(m1) = HCM(p2); CM(m2) = mod-HCM(p1);
3675: } else if ( nd_vc ) {
3676: ezgcdpz(nd_vc,HCP(p1),HCP(p2),&gp);
3677: divsp(nd_vc,HCP(p2),gp,&CP(m1));
3678: divsp(nd_vc,HCP(p1),gp,&tp); chsgnp(tp,&CP(m2));
3679: } else {
3680: igcd_cofactor(HCQ(p1),HCQ(p2),&g,&t,&CQ(m1)); chsgnq(t,&CQ(m2));
3681: }
3682: t1 = ndv_mul_nm(mod,m1,p1); t2 = ndv_mul_nm(mod,m2,p2);
3683: *rp = nd_add(mod,t1,t2);
3684: FREENM(m1); FREENM(m2);
3685: return 1;
1.11 noro 3686: }
3687:
1.19 noro 3688: void ndv_mul_c(int mod,NDV p,int mul)
1.11 noro 3689: {
1.157 noro 3690: NMV m;
3691: int c,c1,len,i;
1.11 noro 3692:
1.157 noro 3693: if ( !p ) return;
3694: len = LEN(p);
3695: if ( mod == -1 )
3696: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) )
3697: CM(m) = _mulsf(CM(m),mul);
3698: else
3699: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
3700: c1 = CM(m); DMAR(c1,mul,0,mod,c); CM(m) = c;
3701: }
1.11 noro 3702: }
3703:
1.113 noro 3704: void ndv_mul_c_q(NDV p,Q mul)
1.16 noro 3705: {
1.157 noro 3706: NMV m;
3707: Q c;
3708: int len,i;
3709:
3710: if ( !p ) return;
3711: len = LEN(p);
3712: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
3713: mulq(CQ(m),mul,&c); CQ(m) = c;
3714: }
1.16 noro 3715: }
3716:
1.55 noro 3717: ND weyl_ndv_mul_nm(int mod,NM m0,NDV p) {
1.157 noro 3718: int n2,i,j,l,n,tlen;
3719: UINT *d0;
3720: NM *tab,*psum;
3721: ND s,r;
3722: NM t;
3723: NMV m1;
3724:
3725: if ( !p ) return 0;
3726: n = NV(p); n2 = n>>1;
3727: d0 = DL(m0);
3728: l = LEN(p);
3729: for ( i = 0, tlen = 1; i < n2; i++ ) tlen *= (GET_EXP(d0,n2+i)+1);
3730: tab = (NM *)ALLOCA(tlen*sizeof(NM));
3731: psum = (NM *)ALLOCA(tlen*sizeof(NM));
3732: for ( i = 0; i < tlen; i++ ) psum[i] = 0;
3733: m1 = (NMV)(((char *)BDY(p))+nmv_adv*(l-1));
3734: for ( i = l-1; i >= 0; i--, NMV_PREV(m1) ) {
3735: /* m0(NM) * m1(NMV) => tab(NM) */
3736: weyl_mul_nm_nmv(n,mod,m0,m1,tab,tlen);
3737: for ( j = 0; j < tlen; j++ ) {
3738: if ( tab[j] ) {
3739: NEXT(tab[j]) = psum[j]; psum[j] = tab[j];
3740: }
3741: }
3742: }
3743: for ( i = tlen-1, r = 0; i >= 0; i-- )
3744: if ( psum[i] ) {
3745: for ( j = 0, t = psum[i]; t; t = NEXT(t), j++ );
3746: MKND(n,psum[i],j,s);
3747: r = nd_add(mod,r,s);
3748: }
3749: if ( r ) SG(r) = SG(p)+TD(d0);
3750: return r;
1.55 noro 3751: }
3752:
1.56 noro 3753: /* product of monomials */
3754: /* XXX block order is not handled correctly */
3755:
1.55 noro 3756: void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *tab,int tlen)
3757: {
1.157 noro 3758: int i,n2,j,s,curlen,homo,h,a,b,k,l,u,min;
3759: UINT *d0,*d1,*d,*dt,*ctab;
3760: Q *ctab_q;
3761: Q q,q1;
3762: UINT c0,c1,c;
3763: NM *p;
3764: NM m,t;
3765: int mpos;
3766:
3767: for ( i = 0; i < tlen; i++ ) tab[i] = 0;
3768: if ( !m0 || !m1 ) return;
3769: d0 = DL(m0); d1 = DL(m1); n2 = n>>1;
3770: NEWNM(m); d = DL(m);
3771: if ( mod ) {
3772: c0 = CM(m0); c1 = CM(m1); DMAR(c0,c1,0,mod,c); CM(m) = c;
3773: } else
3774: mulq(CQ(m0),CQ(m1),&CQ(m));
3775: for ( i = 0; i < nd_wpd; i++ ) d[i] = 0;
3776: homo = n&1 ? 1 : 0;
3777: if ( homo ) {
3778: /* offset of h-degree */
3779: h = GET_EXP(d0,n-1)+GET_EXP(d1,n-1);
3780: PUT_EXP(DL(m),n-1,h);
3781: TD(DL(m)) = h;
3782: if ( nd_blockmask ) ndl_weight_mask(DL(m));
3783: }
3784: if ( nd_module ) {
3785: mpos = MPOS(d1);
1.163 ! noro 3786: TD(d1) = ndl_weight(d1);
1.157 noro 3787: if ( MPOS(d0) ) error("weyl_mul_nm_nmv : invalid operation");
3788: }
3789: tab[0] = m;
3790: NEWNM(m); d = DL(m);
3791: for ( i = 0, curlen = 1; i < n2; i++ ) {
3792: a = GET_EXP(d0,i); b = GET_EXP(d1,n2+i);
3793: k = GET_EXP(d0,n2+i); l = GET_EXP(d1,i);
3794: /* xi^a*(Di^k*xi^l)*Di^b */
3795: a += l; b += k;
3796: s = MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i);
3797: if ( !k || !l ) {
3798: for ( j = 0; j < curlen; j++ )
3799: if ( t = tab[j] ) {
3800: dt = DL(t);
3801: PUT_EXP(dt,i,a); PUT_EXP(dt,n2+i,b); TD(dt) += s;
3802: if ( nd_blockmask ) ndl_weight_mask(dt);
3803: }
3804: curlen *= k+1;
3805: continue;
3806: }
3807: min = MIN(k,l);
3808: if ( mod ) {
3809: ctab = (UINT *)ALLOCA((min+1)*sizeof(UINT));
3810: mkwcm(k,l,mod,ctab);
3811: } else {
3812: ctab_q = (Q *)ALLOCA((min+1)*sizeof(Q));
3813: mkwc(k,l,ctab_q);
3814: }
3815: for ( j = min; j >= 0; j-- ) {
3816: for ( u = 0; u < nd_wpd; u++ ) d[u] = 0;
3817: PUT_EXP(d,i,a-j); PUT_EXP(d,n2+i,b-j);
3818: h = MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i);
3819: if ( homo ) {
3820: TD(d) = s;
3821: PUT_EXP(d,n-1,s-h);
3822: } else TD(d) = h;
1.163 ! noro 3823: if ( nd_module ) {
! 3824: MPOS(d) = mpos;
! 3825: TD(d) = ndl_weight(d);
! 3826: }
1.157 noro 3827: if ( nd_blockmask ) ndl_weight_mask(d);
3828: if ( mod ) c = ctab[j];
3829: else q = ctab_q[j];
3830: p = tab+curlen*j;
3831: if ( j == 0 ) {
3832: for ( u = 0; u < curlen; u++, p++ ) {
3833: if ( tab[u] ) {
3834: ndl_addto(DL(tab[u]),d);
3835: if ( mod ) {
3836: c0 = CM(tab[u]); DMAR(c0,c,0,mod,c1); CM(tab[u]) = c1;
3837: } else {
3838: mulq(CQ(tab[u]),q,&q1); CQ(tab[u]) = q1;
3839: }
3840: }
3841: }
3842: } else {
3843: for ( u = 0; u < curlen; u++, p++ ) {
3844: if ( tab[u] ) {
3845: NEWNM(t);
3846: ndl_add(DL(tab[u]),d,DL(t));
3847: if ( mod ) {
3848: c0 = CM(tab[u]); DMAR(c0,c,0,mod,c1); CM(t) = c1;
3849: } else
3850: mulq(CQ(tab[u]),q,&CQ(t));
3851: *p = t;
3852: }
3853: }
3854: }
3855: }
3856: curlen *= k+1;
3857: }
3858: FREENM(m);
1.55 noro 3859: }
3860:
1.63 noro 3861: ND ndv_mul_nm_symbolic(NM m0,NDV p)
3862: {
1.157 noro 3863: NM mr,mr0;
3864: NMV m;
3865: UINT *d,*dt,*dm;
3866: int c,n,td,i,c1,c2,len;
3867: Q q;
3868: ND r;
3869:
3870: if ( !p ) return 0;
3871: else {
3872: n = NV(p); m = BDY(p);
3873: d = DL(m0);
3874: len = LEN(p);
3875: mr0 = 0;
3876: td = TD(d);
3877: c = CM(m0);
3878: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
3879: NEXTNM(mr0,mr);
3880: CM(mr) = 1;
3881: ndl_add(DL(m),d,DL(mr));
3882: }
3883: NEXT(mr) = 0;
3884: MKND(NV(p),mr0,len,r);
3885: SG(r) = SG(p) + TD(d);
3886: return r;
3887: }
1.63 noro 3888: }
3889:
1.55 noro 3890: ND ndv_mul_nm(int mod,NM m0,NDV p)
1.9 noro 3891: {
1.157 noro 3892: NM mr,mr0;
3893: NMV m;
3894: UINT *d,*dt,*dm;
3895: int c,n,td,i,c1,c2,len;
3896: P q;
3897: ND r;
3898:
3899: if ( !p ) return 0;
3900: else if ( do_weyl )
3901: if ( mod == -1 )
3902: error("ndv_mul_nm : not implemented (weyl)");
3903: else
3904: return weyl_ndv_mul_nm(mod,m0,p);
3905: else {
3906: n = NV(p); m = BDY(p);
3907: d = DL(m0);
3908: len = LEN(p);
3909: mr0 = 0;
3910: td = TD(d);
3911: if ( mod == -1 ) {
3912: c = CM(m0);
3913: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
3914: NEXTNM(mr0,mr);
3915: CM(mr) = _mulsf(CM(m),c);
3916: ndl_add(DL(m),d,DL(mr));
3917: }
3918: } else if ( mod ) {
3919: c = CM(m0);
3920: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
3921: NEXTNM(mr0,mr);
3922: c1 = CM(m);
3923: DMAR(c1,c,0,mod,c2);
3924: CM(mr) = c2;
3925: ndl_add(DL(m),d,DL(mr));
3926: }
3927: } else {
3928: q = CP(m0);
3929: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
3930: NEXTNM(mr0,mr);
3931: mulp(nd_vc,CP(m),q,&CP(mr));
3932: ndl_add(DL(m),d,DL(mr));
3933: }
3934: }
3935: NEXT(mr) = 0;
3936: MKND(NV(p),mr0,len,r);
3937: SG(r) = SG(p) + TD(d);
3938: return r;
3939: }
1.4 noro 3940: }
3941:
1.104 noro 3942: ND nd_quo(int mod,PGeoBucket bucket,NDV d)
1.99 noro 3943: {
1.157 noro 3944: NM mq0,mq;
3945: NMV tm;
3946: Q q;
3947: int i,nv,sg,c,c1,c2,hindex;
3948: ND p,t,r;
3949: N tnm;
3950:
3951: if ( bucket->m < 0 ) return 0;
3952: else {
3953: nv = NV(d);
3954: mq0 = 0;
3955: tm = (NMV)ALLOCA(nmv_adv);
3956: while ( 1 ) {
3957: hindex = mod?head_pbucket(mod,bucket):head_pbucket_q(bucket);
3958: if ( hindex < 0 ) break;
3959: p = bucket->body[hindex];
3960: NEXTNM(mq0,mq);
3961: ndl_sub(HDL(p),HDL(d),DL(mq));
3962: ndl_copy(DL(mq),DL(tm));
3963: if ( mod ) {
3964: c1 = invm(HCM(d),mod); c2 = HCM(p);
3965: DMAR(c1,c2,0,mod,c); CM(mq) = c;
3966: CM(tm) = mod-c;
3967: } else {
3968: divsn(NM(HCQ(p)),NM(HCQ(d)),&tnm);
3969: NTOQ(tnm,SGN(HCQ(p))*SGN(HCQ(d)),CQ(mq));
3970: chsgnq(CQ(mq),&CQ(tm));
3971: }
3972: t = ndv_mul_nmv_trunc(mod,tm,d,HDL(d));
3973: bucket->body[hindex] = nd_remove_head(p);
3974: t = nd_remove_head(t);
3975: add_pbucket(mod,bucket,t);
3976: }
3977: if ( !mq0 )
3978: r = 0;
3979: else {
3980: NEXT(mq) = 0;
3981: for ( i = 0, mq = mq0; mq; mq = NEXT(mq), i++ );
3982: MKND(nv,mq0,i,r);
3983: /* XXX */
3984: SG(r) = HTD(r);
3985: }
3986: return r;
3987: }
1.99 noro 3988: }
3989:
1.43 noro 3990: void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos)
1.11 noro 3991: {
1.157 noro 3992: NMV m,mr,mr0,t;
3993: int len,i,k;
1.11 noro 3994:
1.157 noro 3995: if ( !p ) return;
3996: m = BDY(p); len = LEN(p);
3997: mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p);
3998: m = (NMV)((char *)mr0+(len-1)*oadv);
3999: mr = (NMV)((char *)mr0+(len-1)*nmv_adv);
4000: t = (NMV)ALLOCA(nmv_adv);
4001: for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) {
4002: CQ(t) = CQ(m);
4003: for ( k = 0; k < nd_wpd; k++ ) DL(t)[k] = 0;
4004: ndl_reconstruct(DL(m),DL(t),obpe,oepos);
4005: CQ(mr) = CQ(t);
4006: ndl_copy(DL(t),DL(mr));
4007: }
4008: BDY(p) = mr0;
1.61 noro 4009: }
4010:
4011: NDV ndv_dup_realloc(NDV p,int obpe,int oadv,EPOS oepos)
4012: {
1.157 noro 4013: NMV m,mr,mr0;
4014: int len,i;
4015: NDV r;
4016:
4017: if ( !p ) return 0;
4018: m = BDY(p); len = LEN(p);
4019: mr0 = mr = (NMV)MALLOC(len*nmv_adv);
4020: for ( i = 0; i < len; i++, NMV_OADV(m), NMV_ADV(mr) ) {
4021: ndl_zero(DL(mr));
4022: ndl_reconstruct(DL(m),DL(mr),obpe,oepos);
4023: CQ(mr) = CQ(m);
4024: }
4025: MKNDV(NV(p),mr0,len,r);
4026: SG(r) = SG(p);
4027: return r;
1.11 noro 4028: }
4029:
1.61 noro 4030: /* duplicate p */
4031:
4032: NDV ndv_dup(int mod,NDV p)
1.3 noro 4033: {
1.157 noro 4034: NDV d;
4035: NMV t,m,m0;
4036: int i,len;
4037:
4038: if ( !p ) return 0;
4039: len = LEN(p);
4040: m0 = m = (NMV)(mod?MALLOC_ATOMIC(len*nmv_adv):MALLOC(len*nmv_adv));
4041: for ( t = BDY(p), i = 0; i < len; i++, NMV_ADV(t), NMV_ADV(m) ) {
4042: ndl_copy(DL(t),DL(m));
4043: CQ(m) = CQ(t);
4044: }
4045: MKNDV(NV(p),m0,len,d);
4046: SG(d) = SG(p);
4047: return d;
1.23 noro 4048: }
4049:
1.63 noro 4050: ND nd_dup(ND p)
4051: {
1.157 noro 4052: ND d;
4053: NM t,m,m0;
1.63 noro 4054:
1.157 noro 4055: if ( !p ) return 0;
4056: for ( m0 = 0, t = BDY(p); t; t = NEXT(t) ) {
4057: NEXTNM(m0,m);
4058: ndl_copy(DL(t),DL(m));
4059: CQ(m) = CQ(t);
4060: }
4061: if ( m0 ) NEXT(m) = 0;
4062: MKND(NV(p),m0,LEN(p),d);
4063: SG(d) = SG(p);
4064: return d;
1.63 noro 4065: }
4066:
1.61 noro 4067: /* XXX if p->len == 0 then it represents 0 */
4068:
4069: void ndv_mod(int mod,NDV p)
4070: {
1.157 noro 4071: NMV t,d;
4072: int r,s,u;
4073: int i,len,dlen;
4074: P cp;
4075: Q c;
4076: Obj gfs;
4077:
4078: if ( !p ) return;
4079: len = LEN(p);
4080: dlen = 0;
4081: if ( mod == -1 )
4082: for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) {
4083: simp_ff((Obj)CP(t),&gfs);
4084: r = FTOIF(CONT((GFS)gfs));
4085: CM(d) = r;
4086: ndl_copy(DL(t),DL(d));
4087: NMV_ADV(d);
4088: dlen++;
4089: }
4090: else
4091: for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) {
4092: if ( nd_vc ) {
4093: nd_subst_vector(nd_vc,CP(t),nd_subst,&cp);
4094: c = (Q)cp;
4095: } else
4096: c = CQ(t);
4097: r = rem(NM(c),mod);
4098: if ( r ) {
4099: if ( SGN(c) < 0 )
4100: r = mod-r;
4101: if ( DN(c) ) {
4102: s = rem(DN(c),mod);
4103: if ( !s )
4104: error("ndv_mod : division by 0");
4105: s = invm(s,mod);
4106: DMAR(r,s,0,mod,u); r = u;
4107: }
4108: CM(d) = r;
4109: ndl_copy(DL(t),DL(d));
4110: NMV_ADV(d);
4111: dlen++;
4112: }
4113: }
4114: LEN(p) = dlen;
1.61 noro 4115: }
4116:
4117: NDV ptondv(VL vl,VL dvl,P p)
4118: {
1.157 noro 4119: ND nd;
4120:
4121: nd = ptond(vl,dvl,p);
4122: return ndtondv(0,nd);
4123: }
1.61 noro 4124:
1.157 noro 4125: void pltozpl(LIST l,Q *cont,LIST *pp)
4126: {
4127: NODE nd,nd1;
4128: int n;
4129: P *pl;
4130: Q *cl;
4131: int i;
4132: P dmy;
4133: Q dvr;
4134: LIST r;
4135:
4136: nd = BDY(l); n = length(nd);
4137: pl = (P *)ALLOCA(n*sizeof(P));
4138: cl = (Q *)ALLOCA(n*sizeof(P));
4139: for ( i = 0; i < n; i++, nd = NEXT(nd) )
4140: ptozp((P)BDY(nd),1,&cl[i],&dmy);
4141: qltozl(cl,n,&dvr);
4142: nd = BDY(l);
4143: for ( i = 0; i < n; i++, nd = NEXT(nd) ) {
4144: divsp(CO,(P)BDY(nd),(P)dvr,&pl[i]);
4145: }
4146: nd = 0;
4147: for ( i = n-1; i >= 0; i-- ) {
4148: MKNODE(nd1,pl[i],nd); nd = nd1;
4149: }
4150: MKLIST(r,nd);
4151: *pp = r;
4152: }
4153:
4154: /* (a1,a2,...,an) -> a1*e(1)+...+an*e(n) */
4155:
4156: NDV pltondv(VL vl,VL dvl,LIST p)
4157: {
4158: int i;
4159: NODE t;
4160: ND r,ri;
4161: NM m;
4162:
4163: if ( !nd_module ) error("pltond : module order must be set");
4164: r = 0;
4165: for ( i = 1, t = BDY(p); t; t = NEXT(t), i++ ) {
4166: ri = ptond(vl,dvl,(P)BDY(t));
1.163 ! noro 4167: if ( ri )
! 4168: for ( m = BDY(ri); m; m = NEXT(m) ) {
! 4169: MPOS(DL(m)) = i;
! 4170: TD(DL(m)) = ndl_weight(DL(m));
! 4171: if ( nd_blockmask ) ndl_weight_mask(DL(m));
! 4172: }
1.157 noro 4173: r = nd_add(0,r,ri);
4174: }
4175: return ndtondv(0,r);
1.61 noro 4176: }
4177:
4178: ND ptond(VL vl,VL dvl,P p)
1.23 noro 4179: {
1.157 noro 4180: int n,i,j,k,e;
4181: VL tvl;
4182: V v;
4183: DCP dc;
4184: DCP *w;
4185: ND r,s,t,u;
4186: P x;
4187: int c;
4188: UINT *d;
4189: NM m,m0;
4190:
4191: if ( !p )
4192: return 0;
4193: else if ( NUM(p) ) {
4194: NEWNM(m);
4195: ndl_zero(DL(m));
4196: CQ(m) = (Q)p;
4197: NEXT(m) = 0;
4198: MKND(nd_nvar,m,1,r);
4199: SG(r) = 0;
4200: return r;
4201: } else {
4202: for ( dc = DC(p), k = 0; dc; dc = NEXT(dc), k++ );
4203: w = (DCP *)ALLOCA(k*sizeof(DCP));
4204: for ( dc = DC(p), j = 0; j < k; dc = NEXT(dc), j++ ) w[j] = dc;
4205: for ( i = 0, tvl = dvl, v = VR(p);
4206: tvl && tvl->v != v; tvl = NEXT(tvl), i++ );
4207: if ( !tvl ) {
4208: for ( j = k-1, s = 0, MKV(v,x); j >= 0; j-- ) {
4209: t = ptond(vl,dvl,COEF(w[j]));
4210: pwrp(vl,x,DEG(w[j]),&p);
4211: nd_mul_c_p(CO,t,p); s = nd_add(0,s,t);
4212: }
4213: return s;
4214: } else {
4215: NEWNM(m0); d = DL(m0);
4216: for ( j = k-1, s = 0; j >= 0; j-- ) {
4217: ndl_zero(d); e = QTOS(DEG(w[j])); PUT_EXP(d,i,e);
4218: TD(d) = MUL_WEIGHT(e,i);
4219: if ( nd_blockmask) ndl_weight_mask(d);
4220: if ( nd_module ) MPOS(d) = 0;
4221: t = ptond(vl,dvl,COEF(w[j]));
4222: for ( m = BDY(t); m; m = NEXT(m) )
4223: ndl_addto(DL(m),d);
4224: SG(t) += TD(d);
4225: s = nd_add(0,s,t);
4226: }
4227: FREENM(m0);
4228: return s;
4229: }
4230: }
1.61 noro 4231: }
4232:
4233: P ndvtop(int mod,VL vl,VL dvl,NDV p)
4234: {
1.157 noro 4235: VL tvl;
4236: int len,n,j,i,e;
4237: NMV m;
4238: Q q;
4239: P c;
4240: UINT *d;
4241: P s,r,u,t,w;
4242: GFS gfs;
4243:
4244: if ( !p ) return 0;
4245: else {
4246: len = LEN(p);
4247: n = NV(p);
4248: m = (NMV)(((char *)BDY(p))+nmv_adv*(len-1));
4249: for ( j = len-1, s = 0; j >= 0; j--, NMV_PREV(m) ) {
4250: if ( mod == -1 ) {
4251: e = IFTOF(CM(m)); MKGFS(e,gfs); c = (P)gfs;
4252: } else if ( mod ) {
4253: STOQ(CM(m),q); c = (P)q;
4254: } else
4255: c = CP(m);
4256: d = DL(m);
4257: for ( i = 0, t = c, tvl = dvl; i < n; tvl = NEXT(tvl), i++ ) {
4258: MKV(tvl->v,r); e = GET_EXP(d,i); STOQ(e,q);
4259: pwrp(vl,r,q,&u); mulp(vl,t,u,&w); t = w;
4260: }
4261: addp(vl,s,t,&u); s = u;
4262: }
4263: return s;
4264: }
4265: }
4266:
4267: LIST ndvtopl(int mod,VL vl,VL dvl,NDV p,int rank)
4268: {
4269: VL tvl;
4270: int len,n,j,i,e;
4271: NMV m;
4272: Q q;
4273: P c;
4274: UINT *d;
4275: P s,r,u,t,w;
4276: GFS gfs;
4277: P *a;
4278: LIST l;
4279: NODE nd,nd1;
4280:
4281: if ( !p ) return 0;
4282: else {
4283: a = (P *)ALLOCA((rank+1)*sizeof(P));
4284: for ( i = 0; i <= rank; i++ ) a[i] = 0;
4285: len = LEN(p);
4286: n = NV(p);
4287: m = (NMV)(((char *)BDY(p))+nmv_adv*(len-1));
4288: for ( j = len-1; j >= 0; j--, NMV_PREV(m) ) {
4289: if ( mod == -1 ) {
4290: e = IFTOF(CM(m)); MKGFS(e,gfs); c = (P)gfs;
4291: } else if ( mod ) {
4292: STOQ(CM(m),q); c = (P)q;
4293: } else
4294: c = CP(m);
4295: d = DL(m);
4296: for ( i = 0, t = c, tvl = dvl; i < n; tvl = NEXT(tvl), i++ ) {
4297: MKV(tvl->v,r); e = GET_EXP(d,i); STOQ(e,q);
4298: pwrp(vl,r,q,&u); mulp(vl,t,u,&w); t = w;
4299: }
4300: addp(vl,a[MPOS(d)],t,&u); a[MPOS(d)] = u;
4301: }
4302: nd = 0;
4303: for ( i = rank; i > 0; i-- ) {
4304: MKNODE(nd1,a[i],nd); nd = nd1;
4305: }
4306: MKLIST(l,nd);
4307: return l;
4308: }
1.3 noro 4309: }
4310:
1.61 noro 4311: NDV ndtondv(int mod,ND p)
1.11 noro 4312: {
1.157 noro 4313: NDV d;
4314: NMV m,m0;
4315: NM t;
4316: int i,len;
4317:
4318: if ( !p ) return 0;
4319: len = LEN(p);
4320: if ( mod )
4321: m0 = m = (NMV)GC_malloc_atomic_ignore_off_page(len*nmv_adv);
4322: else
4323: m0 = m = MALLOC(len*nmv_adv);
1.103 noro 4324: #if 0
1.157 noro 4325: ndv_alloc += nmv_adv*len;
1.103 noro 4326: #endif
1.157 noro 4327: for ( t = BDY(p), i = 0; t; t = NEXT(t), i++, NMV_ADV(m) ) {
4328: ndl_copy(DL(t),DL(m));
4329: CQ(m) = CQ(t);
4330: }
4331: MKNDV(NV(p),m0,len,d);
4332: SG(d) = SG(p);
4333: return d;
1.11 noro 4334: }
4335:
1.61 noro 4336: ND ndvtond(int mod,NDV p)
1.11 noro 4337: {
1.157 noro 4338: ND d;
4339: NM m,m0;
4340: NMV t;
4341: int i,len;
4342:
4343: if ( !p ) return 0;
4344: m0 = 0;
4345: len = p->len;
4346: for ( t = BDY(p), i = 0; i < len; NMV_ADV(t), i++ ) {
4347: NEXTNM(m0,m);
4348: ndl_copy(DL(t),DL(m));
4349: CQ(m) = CQ(t);
4350: }
4351: NEXT(m) = 0;
4352: MKND(NV(p),m0,len,d);
4353: SG(d) = SG(p);
4354: return d;
1.11 noro 4355: }
4356:
1.3 noro 4357: void ndv_print(NDV p)
4358: {
1.157 noro 4359: NMV m;
4360: int i,len;
1.3 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: if ( CM(m) & 0x80000000 ) printf("+@_%d*",IFTOF(CM(m)));
4367: else printf("+%d*",CM(m));
4368: ndl_print(DL(m));
4369: }
4370: printf("\n");
4371: }
1.16 noro 4372: }
4373:
1.113 noro 4374: void ndv_print_q(NDV p)
1.16 noro 4375: {
1.157 noro 4376: NMV m;
4377: int i,len;
1.16 noro 4378:
1.157 noro 4379: if ( !p ) printf("0\n");
4380: else {
4381: len = LEN(p);
4382: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
4383: printf("+");
4384: printexpr(CO,(Obj)CQ(m));
4385: printf("*");
4386: ndl_print(DL(m));
4387: }
4388: printf("\n");
4389: }
1.25 noro 4390: }
4391:
1.61 noro 4392: NODE ndv_reducebase(NODE x)
1.27 noro 4393: {
1.157 noro 4394: int len,i,j;
4395: NDV *w;
4396: NODE t,t0;
4397:
4398: len = length(x);
4399: w = (NDV *)ALLOCA(len*sizeof(NDV));
4400: for ( i = 0, t = x; i < len; i++, t = NEXT(t) ) w[i] = BDY(t);
4401: for ( i = 0; i < len; i++ ) {
4402: for ( j = 0; j < i; j++ ) {
4403: if ( w[i] && w[j] )
4404: if ( ndl_reducible(HDL(w[i]),HDL(w[j])) ) w[i] = 0;
4405: else if ( ndl_reducible(HDL(w[j]),HDL(w[i])) ) w[j] = 0;
4406: }
4407: }
4408: for ( i = len-1, t0 = 0; i >= 0; i-- ) {
4409: if ( w[i] ) { NEXTNODE(t0,t); BDY(t) = (pointer)w[i]; }
4410: }
4411: NEXT(t) = 0; x = t0;
4412: return x;
1.11 noro 4413: }
1.32 noro 4414:
1.43 noro 4415: /* XXX incomplete */
4416:
1.32 noro 4417: void nd_init_ord(struct order_spec *ord)
4418: {
1.157 noro 4419: nd_module = (ord->id >= 256);
4420: switch ( ord->id ) {
4421: case 0:
4422: switch ( ord->ord.simple ) {
4423: case 0:
4424: nd_dcomp = 1;
4425: nd_isrlex = 1;
4426: break;
4427: case 1:
4428: nd_dcomp = 1;
4429: nd_isrlex = 0;
4430: break;
4431: case 2:
4432: nd_dcomp = 0;
4433: nd_isrlex = 0;
4434: ndl_compare_function = ndl_lex_compare;
4435: break;
4436: case 11:
4437: /* XXX */
4438: nd_dcomp = 0;
4439: nd_isrlex = 1;
4440: ndl_compare_function = ndl_ww_lex_compare;
4441: break;
4442: default:
4443: error("nd_gr : unsupported order");
4444: }
4445: break;
4446: case 1:
4447: /* block order */
4448: /* XXX */
4449: nd_dcomp = -1;
4450: nd_isrlex = 0;
4451: ndl_compare_function = ndl_block_compare;
4452: break;
4453: case 2:
4454: /* matrix order */
4455: /* XXX */
4456: nd_dcomp = -1;
4457: nd_isrlex = 0;
4458: nd_matrix_len = ord->ord.matrix.row;
4459: nd_matrix = ord->ord.matrix.matrix;
4460: ndl_compare_function = ndl_matrix_compare;
4461: break;
4462: case 3:
4463: /* composite order */
4464: nd_dcomp = -1;
4465: nd_isrlex = 0;
4466: nd_worb_len = ord->ord.composite.length;
4467: nd_worb = ord->ord.composite.w_or_b;
4468: ndl_compare_function = ndl_composite_compare;
4469: break;
4470:
4471: /* module order */
4472: case 256:
1.160 noro 4473: nd_ispot = ord->ispot;
1.157 noro 4474: nd_dcomp = -1;
4475: nd_isrlex = 0;
4476: switch ( ord->ord.simple ) {
4477: case 0:
4478: ndl_compare_function = ndl_module_grlex_compare;
4479: break;
4480: case 1:
4481: ndl_compare_function = ndl_module_glex_compare;
4482: break;
4483: case 2:
4484: ndl_compare_function = ndl_module_lex_compare;
4485: break;
4486: default:
4487: error("nd_gr : unsupported order");
4488: }
4489: break;
4490: case 257:
4491: /* block order */
4492: ndl_compare_function = ndl_module_block_compare;
4493: break;
4494: case 258:
4495: /* matrix order */
4496: nd_matrix_len = ord->ord.matrix.row;
4497: nd_matrix = ord->ord.matrix.matrix;
4498: ndl_compare_function = ndl_module_matrix_compare;
4499: break;
4500: case 259:
4501: /* composite order */
4502: nd_worb_len = ord->ord.composite.length;
4503: nd_worb = ord->ord.composite.w_or_b;
4504: ndl_compare_function = ndl_module_composite_compare;
4505: break;
4506: }
4507: nd_ord = ord;
1.32 noro 4508: }
4509:
1.43 noro 4510: BlockMask nd_create_blockmask(struct order_spec *ord)
4511: {
1.157 noro 4512: int n,i,j,s,l;
4513: UINT *t;
4514: BlockMask bm;
4515:
4516: /* we only create mask table for block order */
4517: if ( ord->id != 1 )
4518: return 0;
4519: n = ord->ord.block.length;
4520: bm = (BlockMask)MALLOC(sizeof(struct oBlockMask));
4521: bm->n = n;
4522: bm->order_pair = ord->ord.block.order_pair;
4523: bm->mask = (UINT **)MALLOC(n*sizeof(UINT *));
4524: for ( i = 0, s = 0; i < n; i++ ) {
4525: bm->mask[i] = t = (UINT *)MALLOC_ATOMIC(nd_wpd*sizeof(UINT));
4526: for ( j = 0; j < nd_wpd; j++ ) t[j] = 0;
4527: l = bm->order_pair[i].length;
4528: for ( j = 0; j < l; j++, s++ ) PUT_EXP(t,s,nd_mask0);
4529: }
4530: return bm;
1.57 noro 4531: }
4532:
4533: EPOS nd_create_epos(struct order_spec *ord)
4534: {
1.157 noro 4535: int i,j,l,s,ord_l,ord_o;
4536: EPOS epos;
4537: struct order_pair *op;
4538:
4539: epos = (EPOS)MALLOC_ATOMIC(nd_nvar*sizeof(struct oEPOS));
4540: switch ( ord->id ) {
4541: case 0:
4542: if ( nd_isrlex ) {
4543: for ( i = 0; i < nd_nvar; i++ ) {
4544: epos[i].i = nd_exporigin + (nd_nvar-1-i)/nd_epw;
4545: epos[i].s = (nd_epw-((nd_nvar-1-i)%nd_epw)-1)*nd_bpe;
4546: }
4547: } else {
4548: for ( i = 0; i < nd_nvar; i++ ) {
4549: epos[i].i = nd_exporigin + i/nd_epw;
4550: epos[i].s = (nd_epw-(i%nd_epw)-1)*nd_bpe;
4551: }
4552: }
4553: break;
4554: case 1:
4555: /* block order */
4556: l = ord->ord.block.length;
4557: op = ord->ord.block.order_pair;
4558: for ( j = 0, s = 0; j < l; j++ ) {
4559: ord_o = op[j].order;
4560: ord_l = op[j].length;
4561: if ( !ord_o )
4562: for ( i = 0; i < ord_l; i++ ) {
4563: epos[s+i].i = nd_exporigin + (s+ord_l-i-1)/nd_epw;
4564: epos[s+i].s = (nd_epw-((s+ord_l-i-1)%nd_epw)-1)*nd_bpe;
4565: }
4566: else
4567: for ( i = 0; i < ord_l; i++ ) {
4568: epos[s+i].i = nd_exporigin + (s+i)/nd_epw;
4569: epos[s+i].s = (nd_epw-((s+i)%nd_epw)-1)*nd_bpe;
4570: }
4571: s += ord_l;
4572: }
4573: break;
4574: case 2:
4575: /* matrix order */
4576: case 3:
4577: /* composite order */
4578: default:
4579: for ( i = 0; i < nd_nvar; i++ ) {
4580: epos[i].i = nd_exporigin + i/nd_epw;
4581: epos[i].s = (nd_epw-(i%nd_epw)-1)*nd_bpe;
4582: }
4583: break;
4584: }
4585: return epos;
1.43 noro 4586: }
1.59 noro 4587:
4588: /* external interface */
4589:
4590: void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec *ord,P *rp)
4591: {
1.157 noro 4592: NODE t,in0,in;
4593: ND nd,nf;
4594: NDV ndv;
4595: VL vv,tv;
4596: int stat,nvar,max,e;
4597: union oNDC dn;
4598: Q cont;
4599: P pp;
4600:
4601: if ( !f ) {
4602: *rp = 0;
4603: return;
4604: }
4605: pltovl(v,&vv);
4606: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
4607:
4608: /* get the degree bound */
4609: for ( t = BDY(g), max = 0; t; t = NEXT(t) )
4610: for ( tv = vv; tv; tv = NEXT(tv) ) {
4611: e = getdeg(tv->v,(P)BDY(t));
4612: max = MAX(e,max);
4613: }
4614: for ( tv = vv; tv; tv = NEXT(tv) ) {
4615: e = getdeg(tv->v,f);
4616: max = MAX(e,max);
4617: }
4618:
4619: nd_init_ord(ord);
4620: nd_setup_parameters(nvar,max);
4621:
4622: /* conversion to ndv */
4623: for ( in0 = 0, t = BDY(g); t; t = NEXT(t) ) {
4624: NEXTNODE(in0,in);
4625: ptozp((P)BDY(t),1,&cont,&pp);
4626: BDY(in) = (pointer)ptondv(CO,vv,pp);
4627: if ( m ) ndv_mod(m,(NDV)BDY(in));
4628: }
4629: NEXTNODE(in0,in);
4630: BDY(in) = (pointer)ptondv(CO,vv,f);
4631: if ( m ) ndv_mod(m,(NDV)BDY(in));
4632: NEXT(in) = 0;
4633:
4634: /* dont sort, dont removecont */
4635: ndv_setup(m,0,in0,1,1);
4636: nd_psn--;
4637: nd_scale=2;
4638: while ( 1 ) {
4639: nd = (pointer)ndvtond(m,nd_ps[nd_psn]);
4640: stat = nd_nf(m,0,nd,nd_ps,1,0,&nf);
4641: if ( !stat ) {
4642: nd_psn++;
4643: nd_reconstruct(0,0);
4644: nd_psn--;
4645: } else
4646: break;
4647: }
4648: *rp = ndvtop(m,CO,vv,ndtondv(m,nf));
1.63 noro 4649: }
4650:
4651: int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r)
4652: {
1.157 noro 4653: NM m;
4654: UINT *t,*s;
4655: int i;
4656:
4657: for ( i = 0; i < n; i++ ) r[i] = 0;
4658: for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) {
4659: t = DL(m);
4660: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
4661: r[i] = CM(m);
4662: }
4663: for ( i = 0; !r[i]; i++ );
4664: return i;
1.63 noro 4665: }
4666:
1.113 noro 4667: int nd_to_vect_q(UINT *s0,int n,ND d,Q *r)
1.74 noro 4668: {
1.157 noro 4669: NM m;
4670: UINT *t,*s;
4671: int i;
4672:
4673: for ( i = 0; i < n; i++ ) r[i] = 0;
4674: for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) {
4675: t = DL(m);
4676: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
4677: r[i] = CQ(m);
4678: }
4679: for ( i = 0; !r[i]; i++ );
4680: return i;
1.74 noro 4681: }
4682:
1.129 noro 4683: Q *nm_ind_pair_to_vect(int mod,UINT *s0,int n,NM_ind_pair pair)
4684: {
1.157 noro 4685: NM m;
4686: NMV mr;
4687: UINT *d,*t,*s;
4688: NDV p;
4689: int i,j,len;
4690: Q *r;
4691:
4692: m = pair->mul;
4693: d = DL(m);
4694: p = nd_ps[pair->index];
4695: len = LEN(p);
4696: r = (Q *)CALLOC(n,sizeof(Q));
4697: t = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
4698: for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) {
4699: ndl_add(d,DL(mr),t);
4700: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
4701: r[i] = CQ(mr);
4702: }
4703: return r;
1.129 noro 4704: }
4705:
1.67 noro 4706: IndArray nm_ind_pair_to_vect_compress(int mod,UINT *s0,int n,NM_ind_pair pair)
1.64 noro 4707: {
1.157 noro 4708: NM m;
4709: NMV mr;
4710: UINT *d,*t,*s;
4711: NDV p;
4712: unsigned char *ivc;
4713: unsigned short *ivs;
4714: UINT *v,*ivi,*s0v;
4715: int i,j,len,prev,diff,cdiff;
4716: IndArray r;
4717:
4718: m = pair->mul;
4719: d = DL(m);
4720: p = nd_ps[pair->index];
4721: len = LEN(p);
4722: t = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
4723: v = (unsigned int *)ALLOCA(len*sizeof(unsigned int));
4724: for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) {
4725: ndl_add(d,DL(mr),t);
4726: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
4727: v[j] = i;
4728: }
4729: r = (IndArray)MALLOC(sizeof(struct oIndArray));
4730: r->head = v[0];
4731: diff = 0;
4732: for ( i = 1; i < len; i++ ) {
4733: cdiff = v[i]-v[i-1]; diff = MAX(cdiff,diff);
4734: }
4735: if ( diff < 256 ) {
4736: r->width = 1;
4737: ivc = (unsigned char *)MALLOC_ATOMIC(len*sizeof(unsigned char));
4738: r->index.c = ivc;
4739: for ( i = 1, ivc[0] = 0; i < len; i++ ) ivc[i] = v[i]-v[i-1];
4740: } else if ( diff < 65536 ) {
4741: r->width = 2;
4742: ivs = (unsigned short *)MALLOC_ATOMIC(len*sizeof(unsigned short));
4743: r->index.s = ivs;
4744: for ( i = 1, ivs[0] = 0; i < len; i++ ) ivs[i] = v[i]-v[i-1];
4745: } else {
4746: r->width = 4;
4747: ivi = (unsigned int *)MALLOC_ATOMIC(len*sizeof(unsigned int));
4748: r->index.i = ivi;
4749: for ( i = 1, ivi[0] = 0; i < len; i++ ) ivi[i] = v[i]-v[i-1];
4750: }
4751: return r;
1.64 noro 4752: }
4753:
1.135 noro 4754: int compress_array(Q *svect,Q *cvect,int n)
4755: {
1.157 noro 4756: int i,j;
1.135 noro 4757:
1.157 noro 4758: for ( i = j = 0; i < n; i++ )
4759: if ( svect[i] ) cvect[j++] = svect[i];
4760: return j;
1.135 noro 4761: }
4762:
4763: void expand_array(Q *svect,Q *cvect,int n)
4764: {
1.157 noro 4765: int i,j;
1.135 noro 4766:
1.157 noro 4767: for ( i = j = 0; j < n; i++ )
4768: if ( svect[i] ) svect[i] = cvect[j++];
1.135 noro 4769: }
4770:
1.133 noro 4771: int ndv_reduce_vect_q(Q *svect,int trace,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.107 noro 4772: {
1.157 noro 4773: int i,j,k,len,pos,prev,nz;
4774: Q cs,mcs,c1,c2,cr,gcd,t;
4775: IndArray ivect;
4776: unsigned char *ivc;
4777: unsigned short *ivs;
4778: unsigned int *ivi;
4779: NDV redv;
4780: NMV mr;
4781: NODE rp;
4782: int maxrs;
4783: double hmag;
4784: Q *cvect;
4785:
4786: maxrs = 0;
4787: for ( i = 0; i < col && !svect[i]; i++ );
4788: if ( i == col ) return maxrs;
4789: hmag = p_mag((P)svect[i])*nd_scale;
4790: cvect = (Q *)ALLOCA(col*sizeof(Q));
4791: for ( i = 0; i < nred; i++ ) {
4792: ivect = imat[i];
4793: k = ivect->head;
4794: if ( svect[k] ) {
4795: maxrs = MAX(maxrs,rp0[i]->sugar);
4796: redv = trace?nd_ps_trace[rp0[i]->index]:nd_ps[rp0[i]->index];
4797: len = LEN(redv); mr = BDY(redv);
4798: igcd_cofactor(svect[k],CQ(mr),&gcd,&cs,&cr);
4799: chsgnq(cs,&mcs);
4800: if ( !UNIQ(cr) ) {
4801: for ( j = 0; j < col; j++ ) {
4802: mulq(svect[j],cr,&c1); svect[j] = c1;
4803: }
4804: }
4805: svect[k] = 0; prev = k;
4806: switch ( ivect->width ) {
4807: case 1:
4808: ivc = ivect->index.c;
4809: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4810: pos = prev+ivc[j]; prev = pos;
4811: mulq(CQ(mr),mcs,&c2); addq(svect[pos],c2,&t); svect[pos] = t;
4812: }
4813: break;
4814: case 2:
4815: ivs = ivect->index.s;
4816: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4817: pos = prev+ivs[j]; prev = pos;
4818: mulq(CQ(mr),mcs,&c2); addq(svect[pos],c2,&t); svect[pos] = t;
4819: }
4820: break;
4821: case 4:
4822: ivi = ivect->index.i;
4823: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4824: pos = prev+ivi[j]; prev = pos;
4825: mulq(CQ(mr),mcs,&c2); addq(svect[pos],c2,&t); svect[pos] = t;
4826: }
4827: break;
4828: }
4829: for ( j = k+1; j < col && !svect[j]; j++ );
4830: if ( j == col ) break;
4831: if ( hmag && ((double)p_mag((P)svect[j]) > hmag) ) {
4832: nz = compress_array(svect,cvect,col);
4833: removecont_array((P *)cvect,nz,1);
4834: expand_array(svect,cvect,nz);
4835: hmag = ((double)p_mag((P)svect[j]))*nd_scale;
4836: }
4837: }
4838: }
4839: nz = compress_array(svect,cvect,col);
4840: removecont_array((P *)cvect,nz,1);
4841: expand_array(svect,cvect,nz);
4842: if ( DP_Print ) {
4843: fprintf(asir_out,"-"); fflush(asir_out);
4844: }
4845: return maxrs;
1.107 noro 4846: }
4847:
1.76 noro 4848: int ndv_reduce_vect(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.65 noro 4849: {
1.157 noro 4850: int i,j,k,len,pos,prev;
4851: UINT c,c1,c2,c3,up,lo,dmy;
4852: IndArray ivect;
4853: unsigned char *ivc;
4854: unsigned short *ivs;
4855: unsigned int *ivi;
4856: NDV redv;
4857: NMV mr;
4858: NODE rp;
4859: int maxrs;
4860:
4861: maxrs = 0;
4862: for ( i = 0; i < nred; i++ ) {
4863: ivect = imat[i];
4864: k = ivect->head; svect[k] %= m;
4865: if ( c = svect[k] ) {
4866: maxrs = MAX(maxrs,rp0[i]->sugar);
4867: c = m-c; redv = nd_ps[rp0[i]->index];
4868: len = LEN(redv); mr = BDY(redv);
4869: svect[k] = 0; prev = k;
4870: switch ( ivect->width ) {
4871: case 1:
4872: ivc = ivect->index.c;
4873: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4874: pos = prev+ivc[j]; c1 = CM(mr); c2 = svect[pos];
4875: prev = pos;
4876: DMA(c1,c,c2,up,lo);
4877: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
4878: } else svect[pos] = lo;
4879: }
4880: break;
4881: case 2:
4882: ivs = ivect->index.s;
4883: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4884: pos = prev+ivs[j]; c1 = CM(mr); c2 = svect[pos];
4885: prev = pos;
4886: DMA(c1,c,c2,up,lo);
4887: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
4888: } else svect[pos] = lo;
4889: }
4890: break;
4891: case 4:
4892: ivi = ivect->index.i;
4893: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4894: pos = prev+ivi[j]; c1 = CM(mr); c2 = svect[pos];
4895: prev = pos;
4896: DMA(c1,c,c2,up,lo);
4897: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
4898: } else svect[pos] = lo;
4899: }
4900: break;
4901: }
4902: }
4903: }
4904: for ( i = 0; i < col; i++ )
4905: if ( svect[i] >= (UINT)m ) svect[i] %= m;
4906: return maxrs;
1.65 noro 4907: }
4908:
1.76 noro 4909: int ndv_reduce_vect_sf(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.72 noro 4910: {
1.157 noro 4911: int i,j,k,len,pos,prev;
4912: UINT c,c1,c2,c3,up,lo,dmy;
4913: IndArray ivect;
4914: unsigned char *ivc;
4915: unsigned short *ivs;
4916: unsigned int *ivi;
4917: NDV redv;
4918: NMV mr;
4919: NODE rp;
4920: int maxrs;
4921:
4922: maxrs = 0;
4923: for ( i = 0; i < nred; i++ ) {
4924: ivect = imat[i];
4925: k = ivect->head; svect[k] %= m;
4926: if ( c = svect[k] ) {
4927: maxrs = MAX(maxrs,rp0[i]->sugar);
4928: c = _chsgnsf(c); redv = nd_ps[rp0[i]->index];
4929: len = LEN(redv); mr = BDY(redv);
4930: svect[k] = 0; prev = k;
4931: switch ( ivect->width ) {
4932: case 1:
4933: ivc = ivect->index.c;
4934: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4935: pos = prev+ivc[j]; prev = pos;
4936: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
4937: }
4938: break;
4939: case 2:
4940: ivs = ivect->index.s;
4941: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4942: pos = prev+ivs[j]; prev = pos;
4943: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
4944: }
4945: break;
4946: case 4:
4947: ivi = ivect->index.i;
4948: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4949: pos = prev+ivi[j]; prev = pos;
4950: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
4951: }
4952: break;
4953: }
4954: }
4955: }
4956: return maxrs;
1.72 noro 4957: }
4958:
1.65 noro 4959: NDV vect_to_ndv(UINT *vect,int spcol,int col,int *rhead,UINT *s0vect)
4960: {
1.157 noro 4961: int j,k,len;
4962: UINT *p;
4963: UINT c;
4964: NDV r;
4965: NMV mr0,mr;
4966:
4967: for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++;
4968: if ( !len ) return 0;
4969: else {
4970: mr0 = (NMV)GC_malloc_atomic_ignore_off_page(nmv_adv*len);
1.103 noro 4971: #if 0
1.157 noro 4972: ndv_alloc += nmv_adv*len;
1.103 noro 4973: #endif
1.157 noro 4974: mr = mr0;
4975: p = s0vect;
4976: for ( j = k = 0; j < col; j++, p += nd_wpd )
4977: if ( !rhead[j] ) {
4978: if ( c = vect[k++] ) {
4979: ndl_copy(p,DL(mr)); CM(mr) = c; NMV_ADV(mr);
4980: }
4981: }
4982: MKNDV(nd_nvar,mr0,len,r);
4983: return r;
4984: }
1.65 noro 4985: }
4986:
1.129 noro 4987: /* for preprocessed vector */
4988:
1.113 noro 4989: NDV vect_to_ndv_q(Q *vect,int spcol,int col,int *rhead,UINT *s0vect)
1.107 noro 4990: {
1.157 noro 4991: int j,k,len;
4992: UINT *p;
4993: Q c;
4994: NDV r;
4995: NMV mr0,mr;
4996:
4997: for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++;
4998: if ( !len ) return 0;
4999: else {
5000: mr0 = (NMV)GC_malloc(nmv_adv*len);
1.107 noro 5001: #if 0
1.157 noro 5002: ndv_alloc += nmv_adv*len;
1.107 noro 5003: #endif
1.157 noro 5004: mr = mr0;
5005: p = s0vect;
5006: for ( j = k = 0; j < col; j++, p += nd_wpd )
5007: if ( !rhead[j] ) {
5008: if ( c = vect[k++] ) {
5009: if ( DN(c) )
5010: error("afo");
5011: ndl_copy(p,DL(mr)); CQ(mr) = c; NMV_ADV(mr);
5012: }
5013: }
5014: MKNDV(nd_nvar,mr0,len,r);
5015: return r;
5016: }
1.107 noro 5017: }
5018:
1.129 noro 5019: /* for plain vector */
5020:
5021: NDV plain_vect_to_ndv_q(Q *vect,int col,UINT *s0vect)
5022: {
1.157 noro 5023: int j,k,len;
5024: UINT *p;
5025: Q c;
5026: NDV r;
5027: NMV mr0,mr;
5028:
5029: for ( j = 0, len = 0; j < col; j++ ) if ( vect[j] ) len++;
5030: if ( !len ) return 0;
5031: else {
5032: mr0 = (NMV)GC_malloc(nmv_adv*len);
1.129 noro 5033: #if 0
1.157 noro 5034: ndv_alloc += nmv_adv*len;
1.129 noro 5035: #endif
1.157 noro 5036: mr = mr0;
5037: p = s0vect;
5038: for ( j = k = 0; j < col; j++, p += nd_wpd, k++ )
5039: if ( c = vect[k] ) {
5040: if ( DN(c) )
5041: error("afo");
5042: ndl_copy(p,DL(mr)); CQ(mr) = c; NMV_ADV(mr);
5043: }
5044: MKNDV(nd_nvar,mr0,len,r);
5045: return r;
5046: }
1.129 noro 5047: }
5048:
1.133 noro 5049: int nd_sp_f4(int m,int trace,ND_pairs l,PGeoBucket bucket)
1.65 noro 5050: {
1.157 noro 5051: ND_pairs t;
5052: NODE sp0,sp;
5053: int stat;
5054: ND spol;
5055:
5056: for ( t = l; t; t = NEXT(t) ) {
5057: stat = nd_sp(m,trace,t,&spol);
5058: if ( !stat ) return 0;
5059: if ( spol ) {
5060: add_pbucket_symbolic(bucket,spol);
5061: }
5062: }
5063: return 1;
1.65 noro 5064: }
5065:
1.133 noro 5066: int nd_symbolic_preproc(PGeoBucket bucket,int trace,UINT **s0vect,NODE *r)
1.65 noro 5067: {
1.157 noro 5068: NODE rp0,rp;
5069: NM mul,head,s0,s;
5070: int index,col,i,sugar;
5071: RHist h;
5072: UINT *s0v,*p;
5073: NM_ind_pair pair;
5074: ND red;
5075: NDV *ps;
5076:
5077: s0 = 0; rp0 = 0; col = 0;
5078: ps = trace?nd_ps_trace:nd_ps;
5079: while ( 1 ) {
5080: head = remove_head_pbucket_symbolic(bucket);
5081: if ( !head ) break;
5082: if ( !s0 ) s0 = head;
5083: else NEXT(s) = head;
5084: s = head;
5085: index = ndl_find_reducer(DL(head));
5086: if ( index >= 0 ) {
5087: h = nd_psh[index];
5088: NEWNM(mul);
5089: ndl_sub(DL(head),DL(h),DL(mul));
5090: if ( ndl_check_bound2(index,DL(mul)) ) return 0;
5091: sugar = TD(DL(mul))+SG(ps[index]);
5092: MKNM_ind_pair(pair,mul,index,sugar);
5093: red = ndv_mul_nm_symbolic(mul,ps[index]);
5094: add_pbucket_symbolic(bucket,nd_remove_head(red));
5095: NEXTNODE(rp0,rp); BDY(rp) = (pointer)pair;
5096: }
5097: col++;
5098: }
5099: if ( rp0 ) NEXT(rp) = 0;
5100: NEXT(s) = 0;
5101: s0v = (UINT *)MALLOC_ATOMIC(col*nd_wpd*sizeof(UINT));
5102: for ( i = 0, p = s0v, s = s0; i < col;
5103: i++, p += nd_wpd, s = NEXT(s) ) ndl_copy(DL(s),p);
5104: *s0vect = s0v;
5105: *r = rp0;
5106: return col;
1.65 noro 5107: }
5108:
1.69 noro 5109: NODE nd_f4(int m)
5110: {
1.157 noro 5111: int i,nh,stat,index;
5112: NODE r,g;
5113: ND_pairs d,l,t;
5114: ND spol,red;
5115: NDV nf,redv;
5116: NM s0,s;
5117: NODE rp0,srp0,nflist;
5118: int nsp,nred,col,rank,len,k,j,a;
5119: UINT c;
5120: UINT **spmat;
5121: UINT *s0vect,*svect,*p,*v;
5122: int *colstat;
5123: IndArray *imat;
5124: int *rhead;
5125: int spcol,sprow;
5126: int sugar;
5127: PGeoBucket bucket;
5128: struct oEGT eg0,eg1,eg_f4;
1.69 noro 5129:
1.103 noro 5130: #if 0
1.157 noro 5131: ndv_alloc = 0;
1.103 noro 5132: #endif
1.157 noro 5133: g = 0; d = 0;
5134: for ( i = 0; i < nd_psn; i++ ) {
5135: d = update_pairs(d,g,i);
5136: g = update_base(g,i);
5137: }
5138: while ( d ) {
5139: get_eg(&eg0);
5140: l = nd_minsugarp(d,&d);
5141: sugar = SG(l);
5142: bucket = create_pbucket();
5143: stat = nd_sp_f4(m,0,l,bucket);
5144: if ( !stat ) {
5145: for ( t = l; NEXT(t); t = NEXT(t) );
5146: NEXT(t) = d; d = l;
5147: d = nd_reconstruct(0,d);
5148: continue;
5149: }
5150: if ( bucket->m < 0 ) continue;
5151: col = nd_symbolic_preproc(bucket,0,&s0vect,&rp0);
5152: if ( !col ) {
5153: for ( t = l; NEXT(t); t = NEXT(t) );
5154: NEXT(t) = d; d = l;
5155: d = nd_reconstruct(0,d);
5156: continue;
5157: }
5158: get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1);
5159: if ( DP_Print )
5160: fprintf(asir_out,"sugar=%d,symb=%fsec,",
5161: sugar,eg_f4.exectime+eg_f4.gctime);
5162: if ( 1 )
5163: nflist = nd_f4_red(m,l,0,s0vect,col,rp0,0);
5164: else
5165: nflist = nd_f4_red_dist(m,l,s0vect,col,rp0,0);
5166: /* adding new bases */
5167: for ( r = nflist; r; r = NEXT(r) ) {
5168: nf = (NDV)BDY(r);
5169: ndv_removecont(m,nf);
5170: if ( !m && nd_nalg ) {
5171: ND nf1;
5172:
5173: nf1 = ndvtond(m,nf);
5174: nd_monic(0,&nf1);
5175: nd_removecont(m,nf1);
5176: nf = ndtondv(m,nf1);
5177: }
5178: nh = ndv_newps(m,nf,0);
5179: d = update_pairs(d,g,nh);
5180: g = update_base(g,nh);
5181: }
5182: }
1.159 noro 5183: for ( r = g; r; r = NEXT(r) ) BDY(r) = (pointer)nd_ps[(long)BDY(r)];
1.103 noro 5184: #if 0
1.157 noro 5185: fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc);
1.103 noro 5186: #endif
1.157 noro 5187: return g;
1.69 noro 5188: }
1.74 noro 5189:
1.133 noro 5190: NODE nd_f4_trace(int m)
5191: {
1.157 noro 5192: int i,nh,stat,index;
5193: NODE r,g;
5194: ND_pairs d,l,l0,t;
5195: ND spol,red;
5196: NDV nf,redv,nfqv,nfv;
5197: NM s0,s;
5198: NODE rp0,srp0,nflist;
5199: int nsp,nred,col,rank,len,k,j,a;
5200: UINT c;
5201: UINT **spmat;
5202: UINT *s0vect,*svect,*p,*v;
5203: int *colstat;
5204: IndArray *imat;
5205: int *rhead;
5206: int spcol,sprow;
5207: int sugar;
5208: PGeoBucket bucket;
5209: struct oEGT eg0,eg1,eg_f4;
5210:
5211: g = 0; d = 0;
5212: for ( i = 0; i < nd_psn; i++ ) {
5213: d = update_pairs(d,g,i);
5214: g = update_base(g,i);
5215: }
5216: while ( d ) {
5217: get_eg(&eg0);
5218: l = nd_minsugarp(d,&d);
5219: sugar = SG(l);
5220: bucket = create_pbucket();
5221: stat = nd_sp_f4(m,0,l,bucket);
5222: if ( !stat ) {
5223: for ( t = l; NEXT(t); t = NEXT(t) );
5224: NEXT(t) = d; d = l;
5225: d = nd_reconstruct(1,d);
5226: continue;
5227: }
5228: if ( bucket->m < 0 ) continue;
5229: col = nd_symbolic_preproc(bucket,0,&s0vect,&rp0);
5230: if ( !col ) {
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: get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1);
5237: if ( DP_Print )
5238: fprintf(asir_out,"sugar=%d,symb=%fsec,",
5239: sugar,eg_f4.exectime+eg_f4.gctime);
5240: nflist = nd_f4_red(m,l,0,s0vect,col,rp0,&l0);
5241: if ( !l0 ) continue;
5242: l = l0;
5243:
5244: /* over Q */
5245: bucket = create_pbucket();
5246: stat = nd_sp_f4(0,1,l,bucket);
5247: if ( !stat ) {
5248: for ( t = l; NEXT(t); t = NEXT(t) );
5249: NEXT(t) = d; d = l;
5250: d = nd_reconstruct(1,d);
5251: continue;
5252: }
5253: if ( bucket->m < 0 ) continue;
5254: col = nd_symbolic_preproc(bucket,1,&s0vect,&rp0);
5255: if ( !col ) {
5256: for ( t = l; NEXT(t); t = NEXT(t) );
5257: NEXT(t) = d; d = l;
5258: d = nd_reconstruct(1,d);
5259: continue;
5260: }
5261: nflist = nd_f4_red(0,l,1,s0vect,col,rp0,0);
5262: /* adding new bases */
5263: for ( r = nflist; r; r = NEXT(r) ) {
5264: nfqv = (NDV)BDY(r);
5265: ndv_removecont(0,nfqv);
5266: if ( !rem(NM(HCQ(nfqv)),m) ) return 0;
5267: if ( nd_nalg ) {
5268: ND nf1;
5269:
5270: nf1 = ndvtond(m,nfqv);
5271: nd_monic(0,&nf1);
5272: nd_removecont(0,nf1);
5273: nfqv = ndtondv(0,nf1); nd_free(nf1);
5274: }
5275: nfv = ndv_dup(0,nfqv);
5276: ndv_mod(m,nfv);
5277: ndv_removecont(m,nfv);
5278: nh = ndv_newps(0,nfv,nfqv);
5279: d = update_pairs(d,g,nh);
5280: g = update_base(g,nh);
5281: }
5282: }
1.159 noro 5283: for ( r = g; r; r = NEXT(r) ) BDY(r) = (pointer)nd_ps_trace[(long)BDY(r)];
1.133 noro 5284: #if 0
1.157 noro 5285: fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc);
1.133 noro 5286: #endif
1.157 noro 5287: return g;
1.133 noro 5288: }
5289:
5290: NODE nd_f4_red(int m,ND_pairs sp0,int trace,UINT *s0vect,int col,NODE rp0,ND_pairs *nz)
1.63 noro 5291: {
1.157 noro 5292: IndArray *imat;
5293: int nsp,nred,i;
5294: int *rhead;
5295: NODE r0,rp;
5296: ND_pairs sp;
5297: NM_ind_pair *rvect;
5298:
5299: for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ );
5300: nred = length(rp0);
5301: imat = (IndArray *)ALLOCA(nred*sizeof(IndArray));
5302: rhead = (int *)ALLOCA(col*sizeof(int));
5303: for ( i = 0; i < col; i++ ) rhead[i] = 0;
5304:
5305: /* construction of index arrays */
5306: rvect = (NM_ind_pair *)ALLOCA(nred*sizeof(NM_ind_pair));
5307: for ( rp = rp0, i = 0; rp; i++, rp = NEXT(rp) ) {
5308: rvect[i] = (NM_ind_pair)BDY(rp);
5309: imat[i] = nm_ind_pair_to_vect_compress(m,s0vect,col,rvect[i]);
5310: rhead[imat[i]->head] = 1;
5311: }
5312: if ( m )
5313: r0 = nd_f4_red_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,nz);
5314: else
5315: r0 = nd_f4_red_q_main(sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred);
5316: return r0;
1.106 noro 5317: }
1.74 noro 5318:
1.106 noro 5319: NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col,
1.133 noro 5320: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred,ND_pairs *nz)
1.106 noro 5321: {
1.157 noro 5322: int spcol,sprow,a;
5323: int i,j,k,l,rank;
5324: NODE r0,r;
5325: ND_pairs sp;
5326: ND spol;
5327: int **spmat;
5328: UINT *svect,*v;
5329: int *colstat;
5330: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
5331: int maxrs;
5332: int *spsugar;
5333: ND_pairs *spactive;
5334:
5335: spcol = col-nred;
5336: get_eg(&eg0);
5337: /* elimination (1st step) */
5338: spmat = (int **)ALLOCA(nsp*sizeof(UINT *));
5339: svect = (UINT *)ALLOCA(col*sizeof(UINT));
5340: spsugar = (int *)ALLOCA(nsp*sizeof(UINT));
5341: spactive = !nz?0:(ND_pairs *)ALLOCA(nsp*sizeof(ND_pairs));
5342: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
5343: nd_sp(m,0,sp,&spol);
5344: if ( !spol ) continue;
5345: nd_to_vect(m,s0vect,col,spol,svect);
5346: if ( m == -1 )
5347: maxrs = ndv_reduce_vect_sf(m,svect,col,imat,rvect,nred);
5348: else
5349: maxrs = ndv_reduce_vect(m,svect,col,imat,rvect,nred);
5350: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
5351: if ( i < col ) {
5352: spmat[sprow] = v = (UINT *)MALLOC_ATOMIC(spcol*sizeof(UINT));
5353: for ( j = k = 0; j < col; j++ )
5354: if ( !rhead[j] ) v[k++] = svect[j];
5355: spsugar[sprow] = MAX(maxrs,SG(spol));
5356: if ( nz )
5357: spactive[sprow] = sp;
5358: sprow++;
5359: }
5360: nd_free(spol);
5361: }
5362: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
5363: if ( DP_Print ) {
5364: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
5365: fflush(asir_out);
5366: }
5367: /* free index arrays */
5368: for ( i = 0; i < nred; i++ ) GC_free(imat[i]->index.c);
5369:
5370: /* elimination (2nd step) */
5371: colstat = (int *)ALLOCA(spcol*sizeof(int));
5372: if ( m == -1 )
5373: rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat);
5374: else
5375: rank = nd_gauss_elim_mod(spmat,spsugar,spactive,sprow,spcol,m,colstat);
5376: r0 = 0;
5377: for ( i = 0; i < rank; i++ ) {
5378: NEXTNODE(r0,r); BDY(r) =
5379: (pointer)vect_to_ndv(spmat[i],spcol,col,rhead,s0vect);
5380: SG((NDV)BDY(r)) = spsugar[i];
5381: GC_free(spmat[i]);
5382: }
5383: if ( r0 ) NEXT(r) = 0;
5384:
5385: for ( ; i < sprow; i++ ) GC_free(spmat[i]);
5386: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
5387: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
5388: if ( DP_Print ) {
5389: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
5390: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
5391: nsp,nred,sprow,spcol,rank);
5392: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
5393: }
5394: if ( nz ) {
5395: for ( i = 0; i < rank-1; i++ ) NEXT(spactive[i]) = spactive[i+1];
5396: if ( rank > 0 ) {
5397: NEXT(spactive[rank-1]) = 0;
5398: *nz = spactive[0];
5399: } else
5400: *nz = 0;
5401: }
5402: return r0;
1.74 noro 5403: }
5404:
1.133 noro 5405: #if 1
5406: NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,int trace,UINT *s0vect,int col,
1.107 noro 5407: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred)
5408: {
1.157 noro 5409: int spcol,sprow,a;
5410: int i,j,k,l,rank;
5411: NODE r0,r;
5412: ND_pairs sp;
5413: ND spol;
5414: Q **spmat;
5415: Q *svect,*v;
5416: int *colstat;
5417: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
5418: int maxrs;
5419: int *spsugar;
5420: pointer *w;
5421:
5422: spcol = col-nred;
5423: get_eg(&eg0);
5424: /* elimination (1st step) */
5425: spmat = (Q **)ALLOCA(nsp*sizeof(Q *));
5426: svect = (Q *)ALLOCA(col*sizeof(Q));
5427: spsugar = (int *)ALLOCA(nsp*sizeof(Q));
5428: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
5429: nd_sp(0,trace,sp,&spol);
5430: if ( !spol ) continue;
5431: nd_to_vect_q(s0vect,col,spol,svect);
5432: maxrs = ndv_reduce_vect_q(svect,trace,col,imat,rvect,nred);
5433: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
5434: if ( i < col ) {
5435: spmat[sprow] = v = (Q *)MALLOC(spcol*sizeof(Q));
5436: for ( j = k = 0; j < col; j++ )
5437: if ( !rhead[j] ) v[k++] = svect[j];
5438: spsugar[sprow] = MAX(maxrs,SG(spol));
5439: sprow++;
5440: }
5441: /* nd_free(spol); */
5442: }
5443: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
5444: if ( DP_Print ) {
5445: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
5446: fflush(asir_out);
5447: }
5448: /* free index arrays */
5449: /* for ( i = 0; i < nred; i++ ) GC_free(imat[i]->index.c); */
5450:
5451: /* elimination (2nd step) */
5452: colstat = (int *)ALLOCA(spcol*sizeof(int));
5453: rank = nd_gauss_elim_q(spmat,spsugar,sprow,spcol,colstat);
5454: w = (pointer *)ALLOCA(rank*sizeof(pointer));
5455: for ( i = 0; i < rank; i++ ) {
5456: w[rank-i-1] = (pointer)vect_to_ndv_q(spmat[i],spcol,col,rhead,s0vect);
5457: SG((NDV)w[rank-i-1]) = spsugar[i];
5458: /* GC_free(spmat[i]); */
5459: }
1.138 noro 5460: #if 0
1.157 noro 5461: qsort(w,rank,sizeof(NDV),
5462: (int (*)(const void *,const void *))ndv_compare);
1.137 noro 5463: #endif
1.157 noro 5464: r0 = 0;
5465: for ( i = 0; i < rank; i++ ) {
5466: NEXTNODE(r0,r); BDY(r) = w[i];
5467: }
5468: if ( r0 ) NEXT(r) = 0;
5469:
5470: /* for ( ; i < sprow; i++ ) GC_free(spmat[i]); */
5471: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
5472: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
5473: if ( DP_Print ) {
5474: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
5475: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
5476: nsp,nred,sprow,spcol,rank);
5477: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
5478: }
5479: return r0;
1.107 noro 5480: }
1.129 noro 5481: #else
5482: void printm(Q **mat,int row,int col)
5483: {
1.157 noro 5484: int i,j;
5485: printf("[");
5486: for ( i = 0; i < row; i++ ) {
5487: for ( j = 0; j < col; j++ ) {
5488: printexpr(CO,mat[i][j]); printf(" ");
5489: }
5490: printf("]\n");
5491: }
1.129 noro 5492: }
5493:
5494: NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,UINT *s0vect,int col,
5495: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred)
5496: {
1.157 noro 5497: int row,a;
5498: int i,j,rank;
5499: NODE r0,r;
5500: ND_pairs sp;
5501: ND spol;
5502: Q **mat;
5503: int *colstat;
5504: int *sugar;
5505:
5506: row = nsp+nred;
5507: /* make the matrix */
5508: mat = (Q **)ALLOCA(row*sizeof(Q *));
5509: sugar = (int *)ALLOCA(row*sizeof(int));
5510: for ( row = a = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
5511: nd_sp(0,0,sp,&spol);
5512: if ( !spol ) continue;
5513: mat[row] = (Q *)MALLOC(col*sizeof(Q));
5514: nd_to_vect_q(s0vect,col,spol,mat[row]);
5515: sugar[row] = SG(spol);
5516: row++;
5517: }
5518: for ( i = 0; i < nred; i++, row++ ) {
5519: mat[row] = nm_ind_pair_to_vect(0,s0vect,col,rvect[i]);
5520: sugar[row] = rvect[i]->sugar;
5521: }
5522: /* elimination */
5523: colstat = (int *)ALLOCA(col*sizeof(int));
5524: rank = nd_gauss_elim_q(mat,sugar,row,col,colstat);
5525: r0 = 0;
5526: for ( i = 0; i < rank; i++ ) {
5527: for ( j = 0; j < col; j++ ) if ( mat[i][j] ) break;
5528: if ( j == col ) error("nd_f4_red_q_main : cannot happen");
5529: if ( rhead[j] ) continue;
5530: NEXTNODE(r0,r); BDY(r) =
5531: (pointer)plain_vect_to_ndv_q(mat[i],col,s0vect);
5532: SG((NDV)BDY(r)) = sugar[i];
5533: }
5534: if ( r0 ) NEXT(r) = 0;
5535: printf("\n");
5536: return r0;
1.129 noro 5537: }
5538: #endif
1.107 noro 5539:
1.74 noro 5540: FILE *nd_write,*nd_read;
5541:
5542: void nd_send_int(int a) {
1.157 noro 5543: write_int(nd_write,&a);
1.74 noro 5544: }
5545:
5546: void nd_send_intarray(int *p,int len) {
1.157 noro 5547: write_intarray(nd_write,p,len);
1.74 noro 5548: }
5549:
5550: int nd_recv_int() {
1.157 noro 5551: int a;
1.74 noro 5552:
1.157 noro 5553: read_int(nd_read,&a);
5554: return a;
1.74 noro 5555: }
5556:
5557: void nd_recv_intarray(int *p,int len) {
1.157 noro 5558: read_intarray(nd_read,p,len);
1.74 noro 5559: }
5560:
5561: void nd_send_ndv(NDV p) {
1.157 noro 5562: int len,i;
5563: NMV m;
1.74 noro 5564:
1.157 noro 5565: if ( !p ) nd_send_int(0);
5566: else {
5567: len = LEN(p);
5568: nd_send_int(len);
5569: m = BDY(p);
5570: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
5571: nd_send_int(CM(m));
5572: nd_send_intarray(DL(m),nd_wpd);
5573: }
5574: }
1.74 noro 5575: }
5576:
5577: void nd_send_nd(ND p) {
1.157 noro 5578: int len,i;
5579: NM m;
1.74 noro 5580:
1.157 noro 5581: if ( !p ) nd_send_int(0);
5582: else {
5583: len = LEN(p);
5584: nd_send_int(len);
5585: m = BDY(p);
5586: for ( i = 0; i < len; i++, m = NEXT(m) ) {
5587: nd_send_int(CM(m));
5588: nd_send_intarray(DL(m),nd_wpd);
5589: }
5590: }
1.74 noro 5591: }
1.65 noro 5592:
1.74 noro 5593: NDV nd_recv_ndv()
5594: {
1.157 noro 5595: int len,i;
5596: NMV m,m0;
5597: NDV r;
5598:
5599: len = nd_recv_int();
5600: if ( !len ) return 0;
5601: else {
5602: m0 = m = (NMV)GC_malloc_atomic_ignore_off_page(nmv_adv*len);
1.103 noro 5603: #if 0
1.157 noro 5604: ndv_alloc += len*nmv_adv;
1.103 noro 5605: #endif
1.157 noro 5606: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
5607: CM(m) = nd_recv_int();
5608: nd_recv_intarray(DL(m),nd_wpd);
5609: }
5610: MKNDV(nd_nvar,m0,len,r);
5611: return r;
5612: }
1.74 noro 5613: }
1.65 noro 5614:
1.74 noro 5615: int ox_exec_f4_red(Q proc)
5616: {
1.157 noro 5617: Obj obj;
5618: STRING fname;
5619: NODE arg;
5620: int s;
5621: extern int ox_need_conv,ox_file_io;
5622:
5623: MKSTR(fname,"nd_exec_f4_red");
5624: arg = mknode(2,proc,fname);
5625: Pox_cmo_rpc(arg,&obj);
5626: s = get_ox_server_id(QTOS(proc));
5627: nd_write = iofp[s].out;
5628: nd_read = iofp[s].in;
5629: ox_need_conv = ox_file_io = 0;
5630: return s;
1.74 noro 5631: }
5632:
1.133 noro 5633: NODE nd_f4_red_dist(int m,ND_pairs sp0,UINT *s0vect,int col,NODE rp0,ND_pairs *nz)
1.74 noro 5634: {
1.157 noro 5635: int nsp,nred;
5636: int i,rank,s;
5637: NODE rp,r0,r;
5638: ND_pairs sp;
5639: NM_ind_pair pair;
5640: NMV nmv;
5641: NM nm;
5642: NDV nf;
5643: Obj proc,dmy;
5644:
5645: ox_launch_main(0,0,&proc);
5646: s = ox_exec_f4_red((Q)proc);
5647:
5648: nd_send_int(m);
5649: nd_send_int(nd_nvar);
5650: nd_send_int(nd_bpe);
5651: nd_send_int(nd_wpd);
5652: nd_send_int(nmv_adv);
5653:
5654: saveobj(nd_write,dp_current_spec->obj); fflush(nd_write);
5655:
5656: nd_send_int(nd_psn);
5657: for ( i = 0; i < nd_psn; i++ ) nd_send_ndv(nd_ps[i]);
5658:
5659: for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ );
5660: nd_send_int(nsp);
5661: for ( i = 0, sp = sp0; i < nsp; i++, sp = NEXT(sp) ) {
5662: nd_send_int(sp->i1); nd_send_int(sp->i2);
5663: }
5664:
5665: nd_send_int(col); nd_send_intarray(s0vect,col*nd_wpd);
5666:
5667: nred = length(rp0); nd_send_int(nred);
5668: for ( i = 0, rp = rp0; i < nred; i++, rp = NEXT(rp) ) {
5669: pair = (NM_ind_pair)BDY(rp);
5670: nd_send_int(pair->index);
5671: nd_send_intarray(pair->mul->dl,nd_wpd);
5672: }
5673: fflush(nd_write);
5674: rank = nd_recv_int();
5675: fprintf(asir_out,"rank=%d\n",rank);
5676: r0 = 0;
5677: for ( i = 0; i < rank; i++ ) {
5678: nf = nd_recv_ndv();
5679: NEXTNODE(r0,r); BDY(r) = (pointer)nf;
5680: }
5681: Pox_shutdown(mknode(1,proc),&dmy);
5682: return r0;
1.74 noro 5683: }
5684:
5685: /* server side */
5686:
5687: void nd_exec_f4_red_dist()
5688: {
1.157 noro 5689: int m,i,nsp,col,s0size,nred,spcol,j,k;
5690: NM_ind_pair *rp0;
5691: NDV nf;
5692: UINT *s0vect;
5693: IndArray *imat;
5694: int *rhead;
5695: int **spmat;
5696: UINT *svect,*v;
5697: ND_pairs *sp0;
5698: int *colstat;
5699: int a,sprow,rank;
5700: struct order_spec *ord;
5701: Obj ordspec;
5702: ND spol;
5703: int maxrs;
5704: int *spsugar;
5705:
5706: nd_read = iofp[0].in;
5707: nd_write = iofp[0].out;
5708: m = nd_recv_int();
5709: nd_nvar = nd_recv_int();
5710: nd_bpe = nd_recv_int();
5711: nd_wpd = nd_recv_int();
5712: nmv_adv = nd_recv_int();
5713:
5714: loadobj(nd_read,&ordspec);
5715: create_order_spec(0,ordspec,&ord);
5716: nd_init_ord(ord);
5717: nd_setup_parameters(nd_nvar,0);
5718:
5719: nd_psn = nd_recv_int();
5720: nd_ps = (NDV *)MALLOC(nd_psn*sizeof(NDV));
5721: nd_bound = (UINT **)MALLOC(nd_psn*sizeof(UINT *));
5722: for ( i = 0; i < nd_psn; i++ ) {
5723: nd_ps[i] = nd_recv_ndv();
5724: nd_bound[i] = ndv_compute_bound(nd_ps[i]);
5725: }
5726:
5727: nsp = nd_recv_int();
5728: sp0 = (ND_pairs *)MALLOC(nsp*sizeof(ND_pairs));
5729: for ( i = 0; i < nsp; i++ ) {
5730: NEWND_pairs(sp0[i]);
5731: sp0[i]->i1 = nd_recv_int(); sp0[i]->i2 = nd_recv_int();
5732: ndl_lcm(HDL(nd_ps[sp0[i]->i1]),HDL(nd_ps[sp0[i]->i2]),LCM(sp0[i]));
5733: }
5734:
5735: col = nd_recv_int();
5736: s0size = col*nd_wpd;
5737: s0vect = (UINT *)MALLOC(s0size*sizeof(UINT));
5738: nd_recv_intarray(s0vect,s0size);
5739:
5740: nred = nd_recv_int();
5741: rp0 = (NM_ind_pair *)MALLOC(nred*sizeof(NM_ind_pair));
5742: for ( i = 0; i < nred; i++ ) {
5743: rp0[i] = (NM_ind_pair)MALLOC(sizeof(struct oNM_ind_pair));
5744: rp0[i]->index = nd_recv_int();
5745: rp0[i]->mul = (NM)MALLOC(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT));
5746: nd_recv_intarray(rp0[i]->mul->dl,nd_wpd);
5747: }
5748:
5749: spcol = col-nred;
5750: imat = (IndArray *)MALLOC(nred*sizeof(IndArray));
5751: rhead = (int *)MALLOC(col*sizeof(int));
5752: for ( i = 0; i < col; i++ ) rhead[i] = 0;
5753:
5754: /* construction of index arrays */
5755: for ( i = 0; i < nred; i++ ) {
5756: imat[i] = nm_ind_pair_to_vect_compress(m,s0vect,col,rp0[i]);
5757: rhead[imat[i]->head] = 1;
5758: }
5759:
5760: /* elimination (1st step) */
5761: spmat = (int **)MALLOC(nsp*sizeof(UINT *));
5762: svect = (UINT *)MALLOC(col*sizeof(UINT));
5763: spsugar = (int *)ALLOCA(nsp*sizeof(UINT));
5764: for ( a = sprow = 0; a < nsp; a++ ) {
5765: nd_sp(m,0,sp0[a],&spol);
5766: if ( !spol ) continue;
5767: nd_to_vect(m,s0vect,col,spol,svect);
5768: if ( m == -1 )
5769: maxrs = ndv_reduce_vect_sf(m,svect,col,imat,rp0,nred);
5770: else
5771: maxrs = ndv_reduce_vect(m,svect,col,imat,rp0,nred);
5772: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
5773: if ( i < col ) {
5774: spmat[sprow] = v = (UINT *)MALLOC(spcol*sizeof(UINT));
5775: for ( j = k = 0; j < col; j++ )
5776: if ( !rhead[j] ) v[k++] = svect[j];
5777: spsugar[sprow] = MAX(maxrs,SG(spol));
5778: sprow++;
5779: }
5780: nd_free(spol);
5781: }
5782: /* elimination (2nd step) */
5783: colstat = (int *)ALLOCA(spcol*sizeof(int));
5784: if ( m == -1 )
5785: rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat);
5786: else
5787: rank = nd_gauss_elim_mod(spmat,spsugar,0,sprow,spcol,m,colstat);
5788: nd_send_int(rank);
5789: for ( i = 0; i < rank; i++ ) {
5790: nf = vect_to_ndv(spmat[i],spcol,col,rhead,s0vect);
5791: nd_send_ndv(nf);
5792: }
5793: fflush(nd_write);
1.107 noro 5794: }
5795:
1.113 noro 5796: int nd_gauss_elim_q(Q **mat0,int *sugar,int row,int col,int *colstat)
1.107 noro 5797: {
1.157 noro 5798: int mod,i,j,t,c,rank,rank0,inv;
5799: int *ci,*ri;
5800: Q dn;
5801: MAT m,nm;
5802: int **wmat;
5803:
5804: /* XXX */
5805: mod = 99999989;
5806: wmat = (int **)ALLOCA(row*sizeof(int *));
5807: for ( i = 0; i < row; i++ ) {
5808: wmat[i] = (int *)ALLOCA(col*sizeof(int));
5809: for ( j = 0; j < col; j++ ) {
5810: if ( mat0[i][j] ) {
5811: t = rem(NM(mat0[i][j]),mod);
5812: if ( SGN(mat0[i][j]) < 0 ) t = mod-t;
5813: wmat[i][j] = t;
5814: } else
5815: wmat[i][j] = 0;
5816: }
5817: }
5818: rank0 = nd_gauss_elim_mod(wmat,sugar,0,row,col,mod,colstat);
5819: NEWMAT(m); m->row = row; m->col = col; m->body = (pointer **)mat0;
5820: rank = generic_gauss_elim(m,&nm,&dn,&ri,&ci);
5821: if ( rank != rank0 )
5822: error("afo");
5823: for ( i = 0; i < row; i++ )
5824: for ( j = 0; j < col; j++ )
5825: mat0[i][j] = 0;
5826: c = col-rank;
5827: for ( i = 0; i < rank; i++ ) {
5828: mat0[i][ri[i]] = dn;
5829: for ( j = 0; j < c; j++ )
5830: mat0[i][ci[j]] = (Q)BDY(nm)[i][j];
5831: }
5832: inv = invm(rem(NM(dn),mod),mod);
5833: if ( SGN(dn) < 0 ) inv = mod-inv;
5834: for ( i = 0; i < row; i++ )
5835: for ( j = 0; j < col; j++ ) {
5836: if ( mat0[i][j] ) {
5837: t = rem(NM(mat0[i][j]),mod);
5838: if ( SGN(mat0[i][j]) < 0 ) t = mod-t;
5839: } else
5840: t = 0;
5841: c = dmar(t,inv,0,mod);
5842: if ( wmat[i][j] != c )
5843: error("afo");
5844: }
5845: return rank;
1.76 noro 5846: }
5847:
1.133 noro 5848: int nd_gauss_elim_mod(int **mat0,int *sugar,ND_pairs *spactive,int row,int col,int md,int *colstat)
1.76 noro 5849: {
1.157 noro 5850: int i,j,k,l,inv,a,rank,s;
5851: unsigned int *t,*pivot,*pk;
5852: unsigned int **mat;
5853: ND_pairs pair;
5854:
5855: mat = (unsigned int **)mat0;
5856: for ( rank = 0, j = 0; j < col; j++ ) {
5857: for ( i = rank; i < row; i++ )
5858: mat[i][j] %= md;
5859: for ( i = rank; i < row; i++ )
5860: if ( mat[i][j] )
5861: break;
5862: if ( i == row ) {
5863: colstat[j] = 0;
5864: continue;
5865: } else
5866: colstat[j] = 1;
5867: if ( i != rank ) {
5868: t = mat[i]; mat[i] = mat[rank]; mat[rank] = t;
5869: s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s;
5870: if ( spactive ) {
5871: pair = spactive[i]; spactive[i] = spactive[rank];
5872: spactive[rank] = pair;
5873: }
5874: }
5875: pivot = mat[rank];
5876: s = sugar[rank];
5877: inv = invm(pivot[j],md);
5878: for ( k = j, pk = pivot+k; k < col; k++, pk++ )
5879: if ( *pk ) {
5880: if ( *pk >= (unsigned int)md )
5881: *pk %= md;
5882: DMAR(*pk,inv,0,md,*pk)
5883: }
5884: for ( i = rank+1; i < row; i++ ) {
5885: t = mat[i];
5886: if ( a = t[j] ) {
5887: sugar[i] = MAX(sugar[i],s);
5888: red_by_vect(md,t+j,pivot+j,md-a,col-j);
5889: }
5890: }
5891: rank++;
5892: }
5893: for ( j = col-1, l = rank-1; j >= 0; j-- )
5894: if ( colstat[j] ) {
5895: pivot = mat[l];
5896: s = sugar[l];
5897: for ( i = 0; i < l; i++ ) {
5898: t = mat[i];
5899: t[j] %= md;
5900: if ( a = t[j] ) {
5901: sugar[i] = MAX(sugar[i],s);
5902: red_by_vect(md,t+j,pivot+j,md-a,col-j);
5903: }
5904: }
5905: l--;
5906: }
5907: for ( j = 0, l = 0; l < rank; j++ )
5908: if ( colstat[j] ) {
5909: t = mat[l];
5910: for ( k = j; k < col; k++ )
5911: if ( t[k] >= (unsigned int)md )
5912: t[k] %= md;
5913: l++;
5914: }
5915: return rank;
1.76 noro 5916: }
5917:
5918: int nd_gauss_elim_sf(int **mat0,int *sugar,int row,int col,int md,int *colstat)
5919: {
1.157 noro 5920: int i,j,k,l,inv,a,rank,s;
5921: unsigned int *t,*pivot,*pk;
5922: unsigned int **mat;
5923:
5924: mat = (unsigned int **)mat0;
5925: for ( rank = 0, j = 0; j < col; j++ ) {
5926: for ( i = rank; i < row; i++ )
5927: if ( mat[i][j] )
5928: break;
5929: if ( i == row ) {
5930: colstat[j] = 0;
5931: continue;
5932: } else
5933: colstat[j] = 1;
5934: if ( i != rank ) {
5935: t = mat[i]; mat[i] = mat[rank]; mat[rank] = t;
5936: s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s;
5937: }
5938: pivot = mat[rank];
5939: s = sugar[rank];
5940: inv = _invsf(pivot[j]);
5941: for ( k = j, pk = pivot+k; k < col; k++, pk++ )
5942: if ( *pk )
5943: *pk = _mulsf(*pk,inv);
5944: for ( i = rank+1; i < row; i++ ) {
5945: t = mat[i];
5946: if ( a = t[j] ) {
5947: sugar[i] = MAX(sugar[i],s);
5948: red_by_vect_sf(md,t+j,pivot+j,_chsgnsf(a),col-j);
5949: }
5950: }
5951: rank++;
5952: }
5953: for ( j = col-1, l = rank-1; j >= 0; j-- )
5954: if ( colstat[j] ) {
5955: pivot = mat[l];
5956: s = sugar[l];
5957: for ( i = 0; i < l; i++ ) {
5958: t = mat[i];
5959: if ( a = t[j] ) {
5960: sugar[i] = MAX(sugar[i],s);
5961: red_by_vect_sf(md,t+j,pivot+j,_chsgnsf(a),col-j);
5962: }
5963: }
5964: l--;
5965: }
5966: return rank;
1.77 noro 5967: }
5968:
5969: int ndv_ishomo(NDV p)
5970: {
1.157 noro 5971: NMV m;
5972: int len,h;
1.77 noro 5973:
1.157 noro 5974: if ( !p ) return 1;
5975: len = LEN(p);
5976: m = BDY(p);
5977: h = TD(DL(m));
5978: NMV_ADV(m);
5979: for ( len--; len; len--, NMV_ADV(m) )
5980: if ( TD(DL(m)) != h ) return 0;
5981: return 1;
1.77 noro 5982: }
5983:
5984: void ndv_save(NDV p,int index)
5985: {
1.157 noro 5986: FILE *s;
5987: char name[BUFSIZ];
5988: short id;
5989: int nv,sugar,len,n,i,td,e,j;
5990: NMV m;
5991: unsigned int *dl;
5992: int mpos;
5993:
5994: sprintf(name,"%s/%d",Demand,index);
5995: s = fopen(name,"w");
5996: savevl(s,0);
5997: if ( !p ) {
5998: saveobj(s,0);
5999: return;
6000: }
6001: id = O_DP;
6002: nv = NV(p);
6003: sugar = SG(p);
6004: len = LEN(p);
6005: write_short(s,&id); write_int(s,&nv); write_int(s,&sugar);
6006: write_int(s,&len);
6007:
6008: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
6009: saveobj(s,(Obj)CQ(m));
6010: dl = DL(m);
6011: td = TD(dl);
6012: write_int(s,&td);
6013: for ( j = 0; j < nv; j++ ) {
6014: e = GET_EXP(dl,j);
6015: write_int(s,&e);
6016: }
6017: if ( nd_module ) {
6018: mpos = MPOS(dl); write_int(s,&mpos);
6019: }
6020: }
6021: fclose(s);
1.77 noro 6022: }
6023:
6024: NDV ndv_load(int index)
6025: {
1.157 noro 6026: FILE *s;
6027: char name[BUFSIZ];
6028: short id;
6029: int nv,sugar,len,n,i,td,e,j;
6030: NDV d;
6031: NMV m0,m;
6032: unsigned int *dl;
6033: Obj obj;
6034: int mpos;
6035:
6036: sprintf(name,"%s/%d",Demand,index);
6037: s = fopen(name,"r");
6038: if ( !s ) return 0;
6039:
6040: skipvl(s);
6041: read_short(s,&id);
6042: if ( !id ) return 0;
6043: read_int(s,&nv);
6044: read_int(s,&sugar);
6045: read_int(s,&len);
6046:
6047: m0 = m = MALLOC(len*nmv_adv);
6048: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
6049: loadobj(s,&obj); CQ(m) = (Q)obj;
6050: dl = DL(m);
6051: ndl_zero(dl);
6052: read_int(s,&td); TD(dl) = td;
6053: for ( j = 0; j < nv; j++ ) {
6054: read_int(s,&e);
6055: PUT_EXP(dl,j,e);
6056: }
6057: if ( nd_module ) {
6058: read_int(s,&mpos); MPOS(dl) = mpos;
6059: }
6060: if ( nd_blockmask ) ndl_weight_mask(dl);
6061: }
6062: fclose(s);
6063: MKNDV(nv,m0,len,d);
6064: SG(d) = sugar;
6065: return d;
1.99 noro 6066: }
6067:
1.102 noro 6068: void nd_det(int mod,MAT f,P *rp)
1.99 noro 6069: {
1.157 noro 6070: VL fv,tv;
6071: int n,i,j,max,e,nvar,sgn,k0,l0,len0,len,k,l,a;
6072: pointer **m;
6073: Q mone;
6074: P **w;
6075: P mp,r;
6076: NDV **dm;
6077: NDV *t,*mi,*mj;
6078: NDV d,s,mij,mjj;
6079: ND u;
6080: NMV nmv;
6081: UINT *bound;
6082: PGeoBucket bucket;
6083: struct order_spec *ord;
6084: Q dq,dt,ds;
6085: N gn,qn,dn0,nm,dn;
6086:
6087: create_order_spec(0,0,&ord);
6088: nd_init_ord(ord);
6089: get_vars((Obj)f,&fv);
6090: if ( f->row != f->col )
6091: error("nd_det : non-square matrix");
6092: n = f->row;
6093: m = f->body;
6094: for ( nvar = 0, tv = fv; tv; tv = NEXT(tv), nvar++ );
6095:
6096: if ( !nvar ) {
6097: if ( !mod )
6098: detp(CO,(P **)m,n,rp);
6099: else {
6100: w = (P **)almat_pointer(n,n);
6101: for ( i = 0; i < n; i++ )
6102: for ( j = 0; j < n; j++ )
6103: ptomp(mod,(P)m[i][j],&w[i][j]);
6104: detmp(CO,mod,w,n,&mp);
6105: mptop(mp,rp);
6106: }
6107: return;
6108: }
6109:
6110: if ( !mod ) {
6111: w = (P **)almat_pointer(n,n);
6112: dq = ONE;
6113: for ( i = 0; i < n; i++ ) {
6114: dn0 = ONEN;
6115: for ( j = 0; j < n; j++ ) {
6116: if ( !m[i][j] ) continue;
6117: lgp(m[i][j],&nm,&dn);
6118: gcdn(dn0,dn,&gn); divsn(dn0,gn,&qn); muln(qn,dn,&dn0);
6119: }
6120: if ( !UNIN(dn0) ) {
6121: NTOQ(dn0,1,ds);
6122: for ( j = 0; j < n; j++ )
6123: mulp(CO,(P)m[i][j],(P)ds,&w[i][j]);
6124: mulq(dq,ds,&dt); dq = dt;
6125: } else
6126: for ( j = 0; j < n; j++ )
6127: w[i][j] = (P)m[i][j];
6128: }
6129: m = (pointer **)w;
6130: }
6131:
6132: for ( i = 0, max = 0; i < n; i++ )
6133: for ( j = 0; j < n; j++ )
6134: for ( tv = fv; tv; tv = NEXT(tv) ) {
6135: e = getdeg(tv->v,(P)m[i][j]);
6136: max = MAX(e,max);
6137: }
6138: nd_setup_parameters(nvar,max);
6139: dm = (NDV **)almat_pointer(n,n);
6140: for ( i = 0, max = 0; i < n; i++ )
6141: for ( j = 0; j < n; j++ ) {
6142: dm[i][j] = ptondv(CO,fv,m[i][j]);
6143: if ( mod ) ndv_mod(mod,dm[i][j]);
6144: if ( dm[i][j] && !LEN(dm[i][j]) ) dm[i][j] = 0;
6145: }
6146: d = ptondv(CO,fv,(P)ONE);
6147: if ( mod ) ndv_mod(mod,d);
6148: chsgnq(ONE,&mone);
6149: for ( j = 0, sgn = 1; j < n; j++ ) {
6150: if ( DP_Print ) fprintf(stderr,".",j);
6151: for ( i = j; i < n && !dm[i][j]; i++ );
6152: if ( i == n ) {
6153: *rp = 0;
6154: return;
6155: }
6156: k0 = i; l0 = j; len0 = LEN(dm[k0][l0]);
6157: for ( k = j; k < n; k++ )
6158: for ( l = j; l < n; l++ )
6159: if ( dm[k][l] && LEN(dm[k][l]) < len0 ) {
6160: k0 = k; l0 = l; len0 = LEN(dm[k][l]);
6161: }
6162: if ( k0 != j ) {
6163: t = dm[j]; dm[j] = dm[k0]; dm[k0] = t;
6164: sgn = -sgn;
6165: }
6166: if ( l0 != j ) {
6167: for ( k = j; k < n; k++ ) {
6168: s = dm[k][j]; dm[k][j] = dm[k][l0]; dm[k][l0] = s;
6169: }
6170: sgn = -sgn;
6171: }
6172: bound = nd_det_compute_bound(dm,n,j);
6173: for ( k = 0; k < nd_nvar; k++ )
6174: if ( bound[k]*2 > nd_mask0 ) break;
6175: if ( k < nd_nvar )
6176: nd_det_reconstruct(dm,n,j,d);
6177:
6178: for ( i = j+1, mj = dm[j], mjj = mj[j]; i < n; i++ ) {
6179: /* if ( DP_Print ) fprintf(stderr," i=%d\n ",i); */
6180: mi = dm[i]; mij = mi[j];
6181: if ( mod )
6182: ndv_mul_c(mod,mij,mod-1);
6183: else
6184: ndv_mul_c_q(mij,mone);
6185: for ( k = j+1; k < n; k++ ) {
6186: /* if ( DP_Print ) fprintf(stderr,"k=%d ",k); */
6187: bucket = create_pbucket();
6188: if ( mi[k] ) {
6189: nmv = BDY(mjj); len = LEN(mjj);
6190: for ( a = 0; a < len; a++, NMV_ADV(nmv) ) {
6191: u = ndv_mul_nmv_trunc(mod,nmv,mi[k],DL(BDY(d)));
6192: add_pbucket(mod,bucket,u);
6193: }
6194: }
6195: if ( mj[k] && mij ) {
6196: nmv = BDY(mij); len = LEN(mij);
6197: for ( a = 0; a < len; a++, NMV_ADV(nmv) ) {
6198: u = ndv_mul_nmv_trunc(mod,nmv,mj[k],DL(BDY(d)));
6199: add_pbucket(mod,bucket,u);
6200: }
6201: }
6202: u = nd_quo(mod,bucket,d);
6203: mi[k] = ndtondv(mod,u);
6204: }
6205: /* if ( DP_Print ) fprintf(stderr,"\n",k); */
6206: }
6207: d = mjj;
6208: }
6209: if ( DP_Print ) fprintf(stderr,"\n",k);
6210: if ( sgn < 0 )
6211: if ( mod )
6212: ndv_mul_c(mod,d,mod-1);
6213: else
6214: ndv_mul_c_q(d,mone);
6215: r = ndvtop(mod,CO,fv,d);
6216: if ( !mod && !UNIQ(dq) )
6217: divsp(CO,r,(P)dq,rp);
6218: else
6219: *rp = r;
1.99 noro 6220: }
6221:
1.102 noro 6222: ND ndv_mul_nmv_trunc(int mod,NMV m0,NDV p,UINT *d)
1.99 noro 6223: {
1.157 noro 6224: NM mr,mr0;
6225: NM tnm;
6226: NMV m;
6227: UINT *d0,*dt,*dm;
6228: int c,n,td,i,c1,c2,len;
6229: Q q;
6230: ND r;
6231:
6232: if ( !p ) return 0;
6233: else {
6234: n = NV(p); m = BDY(p); len = LEN(p);
6235: d0 = DL(m0);
6236: td = TD(d);
6237: mr0 = 0;
6238: NEWNM(tnm);
6239: if ( mod ) {
6240: c = CM(m0);
6241: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
6242: ndl_add(DL(m),d0,DL(tnm));
6243: if ( ndl_reducible(DL(tnm),d) ) {
6244: NEXTNM(mr0,mr);
6245: c1 = CM(m); DMAR(c1,c,0,mod,c2); CM(mr) = c2;
6246: ndl_copy(DL(tnm),DL(mr));
6247: }
6248: }
6249: } else {
6250: q = CQ(m0);
6251: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
6252: ndl_add(DL(m),d0,DL(tnm));
6253: if ( ndl_reducible(DL(tnm),d) ) {
6254: NEXTNM(mr0,mr);
6255: mulq(CQ(m),q,&CQ(mr));
6256: ndl_copy(DL(tnm),DL(mr));
6257: }
6258: }
6259: }
6260: if ( !mr0 )
6261: return 0;
6262: else {
6263: NEXT(mr) = 0;
6264: for ( len = 0, mr = mr0; mr; mr = NEXT(mr), len++ );
6265: MKND(NV(p),mr0,len,r);
6266: SG(r) = SG(p) + TD(d0);
6267: return r;
6268: }
6269: }
1.114 noro 6270: }
6271:
6272: void nd_det_reconstruct(NDV **dm,int n,int j,NDV d)
6273: {
1.157 noro 6274: int i,obpe,oadv,h,k,l;
6275: static NM prev_nm_free_list;
6276: EPOS oepos;
6277:
6278: obpe = nd_bpe;
6279: oadv = nmv_adv;
6280: oepos = nd_epos;
6281: if ( obpe < 2 ) nd_bpe = 2;
6282: else if ( obpe < 3 ) nd_bpe = 3;
6283: else if ( obpe < 4 ) nd_bpe = 4;
6284: else if ( obpe < 5 ) nd_bpe = 5;
6285: else if ( obpe < 6 ) nd_bpe = 6;
6286: else if ( obpe < 8 ) nd_bpe = 8;
6287: else if ( obpe < 10 ) nd_bpe = 10;
6288: else if ( obpe < 16 ) nd_bpe = 16;
6289: else if ( obpe < 32 ) nd_bpe = 32;
6290: else error("nd_det_reconstruct : exponent too large");
6291:
6292: nd_setup_parameters(nd_nvar,0);
6293: prev_nm_free_list = _nm_free_list;
6294: _nm_free_list = 0;
6295: for ( k = j; k < n; k++ )
6296: for (l = j; l < n; l++ )
6297: ndv_realloc(dm[k][l],obpe,oadv,oepos);
6298: ndv_realloc(d,obpe,oadv,oepos);
6299: prev_nm_free_list = 0;
1.114 noro 6300: #if 0
1.157 noro 6301: GC_gcollect();
1.114 noro 6302: #endif
6303: }
6304:
1.153 noro 6305: /* returns a UINT array containing degree bounds */
6306:
1.114 noro 6307: UINT *nd_det_compute_bound(NDV **dm,int n,int j)
6308: {
1.157 noro 6309: UINT *d0,*d1,*d,*t,*r;
6310: int k,l,i;
1.114 noro 6311:
1.157 noro 6312: d0 = (UINT *)MALLOC(nd_nvar*sizeof(UINT));
6313: for ( k = 0; k < nd_nvar; k++ ) d0[k] = 0;
6314: for ( k = j; k < n; k++ )
6315: for ( l = j; l < n; l++ )
6316: if ( dm[k][l] ) {
6317: d = ndv_compute_bound(dm[k][l]);
6318: for ( i = 0; i < nd_nvar; i++ )
6319: d0[i] = MAX(d0[i],d[i]);
6320: }
6321: return d0;
1.117 noro 6322: }
6323:
6324: DL nd_separate_d(UINT *d,UINT *trans)
6325: {
1.157 noro 6326: int n,td,i,e,j;
6327: DL a;
1.117 noro 6328:
1.157 noro 6329: ndl_zero(trans);
6330: td = 0;
6331: for ( i = 0; i < nd_ntrans; i++ ) {
6332: e = GET_EXP(d,i);
6333: PUT_EXP(trans,i,e);
6334: td += MUL_WEIGHT(e,i);
6335: }
6336: if ( nd_ntrans+nd_nalg < nd_nvar ) {
6337: /* homogenized */
6338: i = nd_nvar-1;
6339: e = GET_EXP(d,i);
6340: PUT_EXP(trans,i,e);
6341: td += MUL_WEIGHT(e,i);
6342: }
6343: TD(trans) = td;
6344: if ( nd_blockmask) ndl_weight_mask(trans);
6345: NEWDL(a,nd_nalg);
6346: td = 0;
6347: for ( i = 0; i < nd_nalg; i++ ) {
6348: j = nd_ntrans+i;
6349: e = GET_EXP(d,j);
6350: a->d[i] = e;
6351: td += e;
6352: }
6353: a->td = td;
6354: return a;
1.117 noro 6355: }
6356:
1.118 noro 6357: int nd_monic(int mod,ND *p)
1.117 noro 6358: {
1.157 noro 6359: UINT *trans,*t;
6360: DL alg;
6361: MP mp0,mp;
6362: NM m,m0,m1,ma0,ma,mb,mr0,mr;
6363: ND r;
6364: DL dl;
6365: DP nm;
6366: NDV ndv;
6367: DAlg inv,cd;
6368: ND s,c;
6369: Q l,mul;
6370: N ln;
6371: int n,ntrans,i,e,td,is_lc,len;
6372: NumberField nf;
6373: struct oEGT eg0,eg1;
6374:
6375: if ( !(nf = get_numberfield()) )
6376: error("nd_monic : current_numberfield is not set");
6377:
6378: /* Q coef -> DAlg coef */
6379: NEWNM(ma0); ma = ma0;
6380: m = BDY(*p);
6381: is_lc = 1;
6382: while ( 1 ) {
6383: NEWMP(mp0); mp = mp0;
6384: mp->c = (P)CQ(m);
6385: mp->dl = nd_separate_d(DL(m),DL(ma));
6386: NEWNM(mb);
6387: for ( m = NEXT(m); m; m = NEXT(m) ) {
6388: alg = nd_separate_d(DL(m),DL(mb));
6389: if ( !ndl_equal(DL(ma),DL(mb)) )
6390: break;
6391: NEXTMP(mp0,mp); mp->c = (P)CQ(m); mp->dl = alg;
6392: }
6393: NEXT(mp) = 0;
6394: MKDP(nd_nalg,mp0,nm);
6395: MKDAlg(nm,ONE,cd);
6396: if ( is_lc == 1 ) {
6397: /* if the lc is a rational number, we have nothing to do */
6398: if ( !mp0->dl->td )
6399: return 1;
6400:
6401: get_eg(&eg0);
6402: invdalg(cd,&inv);
6403: get_eg(&eg1); add_eg(&eg_invdalg,&eg0,&eg1);
6404: /* check the validity of inv */
6405: if ( mod && !rem(NM(inv->dn),mod) )
6406: return 0;
6407: CA(ma) = nf->one;
6408: is_lc = 0;
6409: ln = ONEN;
6410: } else {
6411: muldalg(cd,inv,&CA(ma));
6412: lcmn(ln,NM(CA(ma)->dn),&ln);
6413: }
6414: if ( m ) {
6415: NEXT(ma) = mb; ma = mb;
6416: } else {
6417: NEXT(ma) = 0;
6418: break;
6419: }
6420: }
6421: /* l = lcm(denoms) */
6422: NTOQ(ln,1,l);
6423: for ( mr0 = 0, m = ma0; m; m = NEXT(m) ) {
6424: divq(l,CA(m)->dn,&mul);
6425: for ( mp = BDY(CA(m)->nm); mp; mp = NEXT(mp) ) {
6426: NEXTNM(mr0,mr);
6427: mulq((Q)mp->c,mul,&CQ(mr));
6428: dl = mp->dl;
6429: td = TD(DL(m));
6430: ndl_copy(DL(m),DL(mr));
6431: for ( i = 0; i < nd_nalg; i++ ) {
6432: e = dl->d[i];
6433: PUT_EXP(DL(mr),i+nd_ntrans,e);
6434: td += MUL_WEIGHT(e,i+nd_ntrans);
6435: }
1.163 ! noro 6436: if ( nd_module ) MPOS(DL(mr)) = MPOS(DL(m));
1.157 noro 6437: TD(DL(mr)) = td;
6438: if ( nd_blockmask) ndl_weight_mask(DL(mr));
6439: }
6440: }
6441: NEXT(mr) = 0;
6442: for ( len = 0, mr = mr0; mr; mr = NEXT(mr), len++ );
6443: MKND(NV(*p),mr0,len,r);
6444: /* XXX */
6445: SG(r) = SG(*p);
6446: nd_free(*p);
6447: *p = r;
6448: return 1;
1.59 noro 6449: }
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