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