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