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