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