Annotation of OpenXM_contrib2/asir2000/engine/nd.c, Revision 1.207
1.207 ! noro 1: /* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.206 2013/09/10 02:10:00 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.198 noro 3083: NDV recompute_trace(NODE trace,NDV *p,int m);
3084: void nd_gr_recompute_trace(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist,LIST *rp);
3085:
3086: NDV recompute_trace(NODE ti,NDV *p,int mod)
3087: {
3088: int c,c1,c2,i;
3089: NM mul,m,tail;
3090: ND d,r,rm;
3091: NODE sj;
3092: NDV red;
3093: Obj mj;
3094: static int afo=0;
3095:
3096: afo++;
3097: mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT));
3098: CM(mul) = 1;
3099: tail = 0;
3100: for ( i = 0, d = r = 0; ti; ti = NEXT(ti), i++ ) {
3101: sj = BDY((LIST)BDY(ti));
3102: if ( ARG0(sj) ) {
3103: red = p[QTOS((Q)ARG1(sj))];
3104: mj = (Obj)ARG2(sj);
3105: if ( OID(mj) != O_DP ) ndl_zero(DL(mul));
3106: else dltondl(nd_nvar,BDY((DP)mj)->dl,DL(mul));
3107: rm = ndv_mul_nm(mod,mul,red);
3108: if ( !r ) r = rm;
3109: else {
3110: for ( m = BDY(r); m && !ndl_equal(m->dl,BDY(rm)->dl); m = NEXT(m), LEN(r)-- ) {
3111: if ( d ) {
3112: NEXT(tail) = m; tail = m; LEN(d)++;
3113: } else {
3114: MKND(nd_nvar,m,1,d); tail = BDY(d);
3115: }
3116: }
3117: if ( !m ) return 0; /* failure */
3118: else {
3119: BDY(r) = m;
3120: c1 = invm(HCM(rm),mod); c2 = mod-HCM(r);
3121: DMAR(c1,c2,0,mod,c);
3122: nd_mul_c(mod,rm,c);
3123: r = nd_add(mod,r,rm);
3124: }
3125: }
3126: }
3127: }
3128: if ( tail ) NEXT(tail) = 0;
3129: d = nd_add(mod,d,r);
3130: nd_mul_c(mod,d,invm(HCM(d),mod));
3131: return ndtondv(mod,d);
3132: }
3133:
3134: void nd_gr_recompute_trace(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist,LIST *rp)
3135: {
3136: VL tv,fv,vv,vc,av;
3137: NODE fd,fd0,r,r0,t,x,s,xx,alist;
3138: int e,max,nvar,i;
3139: NDV b;
3140: int ishomo,nalg;
3141: Alg alpha,dp;
3142: P p,zp;
3143: Q dmy;
3144: LIST f1,f2;
3145: Obj obj;
3146: NumberField nf;
3147: struct order_spec *ord1;
3148: NODE permtrace,intred,ind,perm,trace,ti;
3149: int len,n,j;
3150: NDV *db,*pb;
3151:
3152: parse_nd_option(current_option);
3153: get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc);
3154: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
3155: switch ( ord->id ) {
3156: case 1:
3157: if ( ord->nv != nvar )
3158: error("nd_check : invalid order specification");
3159: break;
3160: default:
3161: break;
3162: }
3163: nd_init_ord(ord);
3164: nd_bpe = QTOS((Q)ARG7(BDY(tlist)));
3165: nd_setup_parameters(nvar,0);
3166:
3167: len = length(BDY(f));
3168: db = (NDV *)MALLOC(len*sizeof(NDV *));
3169: for ( i = 0, t = BDY(f); t; i++, t = NEXT(t) ) {
3170: ptozp((P)BDY(t),1,&dmy,&zp);
3171: b = ptondv(CO,vv,zp);
3172: ndv_mod(m,b);
3173: ndv_mul_c(m,b,invm(HCM(b),m));
3174: db[i] = b;
3175: }
3176:
3177: permtrace = BDY((LIST)ARG2(BDY(tlist)));
3178: intred = BDY((LIST)ARG3(BDY(tlist)));
3179: ind = BDY((LIST)ARG4(BDY(tlist)));
3180: perm = BDY((LIST)ARG0(permtrace));
3181: trace = NEXT(permtrace);
3182:
3183: for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) {
3184: j = QTOS((Q)ARG0(BDY((LIST)BDY(t))));
3185: if ( j > i ) i = j;
3186: }
3187: n = i+1;
3188: pb = (NDV *)MALLOC(n*sizeof(NDV *));
3189: for ( t = perm, i = 0; t; t = NEXT(t), i++ ) {
3190: ti = BDY((LIST)BDY(t));
3191: pb[QTOS((Q)ARG0(ti))] = db[QTOS((Q)ARG1(ti))];
3192: }
3193: for ( t = trace; t; t = NEXT(t) ) {
3194: ti = BDY((LIST)BDY(t));
3195: pb[QTOS((Q)ARG0(ti))] = recompute_trace(BDY((LIST)ARG1(ti)),pb,m);
3196: if ( !pb[QTOS((Q)ARG0(ti))] ) { *rp = 0; return; }
3197: if ( DP_Print ) {
3198: fprintf(asir_out,"."); fflush(asir_out);
3199: }
3200: }
3201: for ( t = intred; t; t = NEXT(t) ) {
3202: ti = BDY((LIST)BDY(t));
3203: pb[QTOS((Q)ARG0(ti))] = recompute_trace(BDY((LIST)ARG1(ti)),pb,m);
3204: if ( !pb[QTOS((Q)ARG0(ti))] ) { *rp = 0; return; }
3205: if ( DP_Print ) {
3206: fprintf(asir_out,"*"); fflush(asir_out);
3207: }
3208: }
3209: for ( r0 = 0, t = ind; t; t = NEXT(t) ) {
3210: NEXTNODE(r0,r);
3211: b = pb[QTOS((Q)BDY(t))];
3212: ndv_mul_c(m,b,invm(HCM(b),m));
3213: #if 0
3214: BDY(r) = ndvtop(m,CO,vv,pb[QTOS((Q)BDY(t))]);
3215: #else
3216: BDY(r) = ndvtodp(m,pb[QTOS((Q)BDY(t))]);
3217: #endif
3218: }
3219: if ( r0 ) NEXT(r) = 0;
3220: MKLIST(*rp,r0);
3221: if ( DP_Print ) fprintf(asir_out,"\n");
3222: }
3223:
1.133 noro 3224: void nd_gr_trace(LIST f,LIST v,int trace,int homo,int f4,struct order_spec *ord,LIST *rp)
1.20 noro 3225: {
1.157 noro 3226: VL tv,fv,vv,vc,av;
3227: NODE fd,fd0,in0,in,r,r0,t,s,cand,alist;
3228: int m,nocheck,nvar,mindex,e,max;
3229: NDV c;
3230: NMV a;
3231: P p,zp;
3232: Q dmy;
3233: EPOS oepos;
1.164 noro 3234: int obpe,oadv,wmax,i,len,cbpe,ishomo,nalg,mrank,trank,ompos;
1.157 noro 3235: Alg alpha,dp;
3236: P poly;
1.158 noro 3237: LIST f1,f2,zpl;
1.157 noro 3238: Obj obj;
3239: NumberField nf;
3240: struct order_spec *ord1;
3241: struct oEGT eg_check,eg0,eg1;
1.168 noro 3242: NODE tr,tl1,tl2,tl3,tl4;
3243: LIST l1,l2,l3,l4,l5;
1.167 noro 3244: int *perm;
1.168 noro 3245: int j,ret;
1.198 noro 3246: Q jq,bpe;
1.157 noro 3247:
1.167 noro 3248: nd_module = 0;
1.172 noro 3249: parse_nd_option(current_option);
1.157 noro 3250: if ( DP_Multiple )
3251: nd_scale = ((double)DP_Multiple)/(double)(Denominator?Denominator:1);
3252:
3253: get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc);
3254: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
3255: switch ( ord->id ) {
3256: case 1:
3257: if ( ord->nv != nvar )
3258: error("nd_gr_trace : invalid order specification");
3259: break;
3260: default:
3261: break;
3262: }
3263:
3264: get_algtree((Obj)f,&av);
3265: for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++ );
3266: nd_ntrans = nvar;
3267: nd_nalg = nalg;
3268: /* #i -> t#i */
3269: if ( nalg ) {
3270: preprocess_algcoef(vv,av,ord,f,&ord1,&f1,&alist);
3271: ord = ord1;
3272: f = f1;
3273: }
3274: nvar += nalg;
3275:
3276: nocheck = 0;
3277: mindex = 0;
3278:
3279: if ( Demand ) nd_demand = 1;
3280: else nd_demand = 0;
3281:
3282: /* setup modulus */
3283: if ( trace < 0 ) {
3284: trace = -trace;
3285: nocheck = 1;
3286: }
3287: m = trace > 1 ? trace : get_lprime(mindex);
1.158 noro 3288: nd_init_ord(ord);
3289: mrank = 0;
1.178 noro 3290: for ( t = BDY(f), max = 1; t; t = NEXT(t) )
1.157 noro 3291: for ( tv = vv; tv; tv = NEXT(tv) ) {
1.158 noro 3292: if ( nd_module ) {
3293: s = BDY((LIST)BDY(t));
3294: trank = length(s);
3295: mrank = MAX(mrank,trank);
3296: for ( ; s; s = NEXT(s) ) {
3297: e = getdeg(tv->v,(P)BDY(s));
3298: max = MAX(e,max);
3299: }
3300: } else {
3301: e = getdeg(tv->v,(P)BDY(t));
3302: max = MAX(e,max);
3303: }
1.157 noro 3304: }
3305: nd_setup_parameters(nvar,max);
1.164 noro 3306: obpe = nd_bpe; oadv = nmv_adv; oepos = nd_epos; ompos = nd_mpos;
1.157 noro 3307: ishomo = 1;
3308: for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
1.167 noro 3309: if ( nd_module ) {
1.172 noro 3310: if ( !nd_gentrace ) pltozpl((LIST)BDY(t),&dmy,&zpl);
1.167 noro 3311: else zpl = (LIST)BDY(t);
1.158 noro 3312: c = (pointer)pltondv(CO,vv,zpl);
3313: } else {
1.172 noro 3314: if ( !nd_gentrace ) ptozp((P)BDY(t),1,&dmy,&zp);
1.167 noro 3315: else zp = (P)BDY(t);
1.158 noro 3316: c = (pointer)ptondv(CO,vv,zp);
1.167 noro 3317: }
1.157 noro 3318: if ( ishomo )
3319: ishomo = ishomo && ndv_ishomo(c);
3320: if ( c ) {
3321: NEXTNODE(in0,in); BDY(in) = (pointer)c;
3322: NEXTNODE(fd0,fd); BDY(fd) = (pointer)ndv_dup(0,c);
3323: }
3324: }
3325: if ( in0 ) NEXT(in) = 0;
3326: if ( fd0 ) NEXT(fd) = 0;
3327: if ( !ishomo && homo ) {
3328: for ( t = in0, wmax = max; t; t = NEXT(t) ) {
3329: c = (NDV)BDY(t); len = LEN(c);
3330: for ( a = BDY(c), i = 0; i < len; i++, NMV_ADV(a) )
3331: wmax = MAX(TD(DL(a)),wmax);
3332: }
3333: homogenize_order(ord,nvar,&ord1);
3334: nd_init_ord(ord1);
3335: nd_setup_parameters(nvar+1,wmax);
3336: for ( t = fd0; t; t = NEXT(t) )
1.164 noro 3337: ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos,ompos);
1.157 noro 3338: }
3339: while ( 1 ) {
1.183 noro 3340: tl1 = tl2 = tl3 = tl4 = 0;
1.157 noro 3341: if ( Demand )
3342: nd_demand = 1;
1.187 noro 3343: ret = ndv_setup(m,1,fd0,nd_gbblock?1:0,0);
1.172 noro 3344: if ( nd_gentrace ) {
1.167 noro 3345: MKLIST(l1,nd_tracelist); MKNODE(nd_alltracelist,l1,0);
3346: }
1.177 noro 3347: if ( ret )
3348: cand = f4?nd_f4_trace(m,&perm):nd_gb_trace(m,ishomo || homo,&perm);
3349: if ( !ret || !cand ) {
1.157 noro 3350: /* failure */
3351: if ( trace > 1 ) { *rp = 0; return; }
3352: else m = get_lprime(++mindex);
3353: continue;
3354: }
3355: if ( !ishomo && homo ) {
3356: /* dehomogenization */
3357: for ( t = cand; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord);
3358: nd_init_ord(ord);
3359: nd_setup_parameters(nvar,0);
3360: }
3361: nd_demand = 0;
1.167 noro 3362: cand = ndv_reducebase(cand,perm);
1.172 noro 3363: if ( nd_gentrace ) { tl1 = nd_alltracelist; nd_alltracelist = 0; }
1.157 noro 3364: cand = ndv_reduceall(0,cand);
3365: cbpe = nd_bpe;
1.172 noro 3366: if ( nd_gentrace ) { tl2 = nd_alltracelist; nd_alltracelist = 0; }
1.173 noro 3367: get_eg(&eg0);
1.157 noro 3368: if ( nocheck )
3369: break;
1.170 noro 3370: if ( ret = ndv_check_membership(0,in0,obpe,oadv,oepos,cand) ) {
1.172 noro 3371: if ( nd_gentrace ) {
1.168 noro 3372: tl3 = nd_alltracelist; nd_alltracelist = 0;
3373: } else tl3 = 0;
3374: /* gbcheck : cand is a GB of Id(cand) ? */
1.172 noro 3375: ret = nd_gb(0,0,1,nd_gensyz?1:0,0)!=0;
3376: if ( nd_gentrace && nd_gensyz ) {
1.168 noro 3377: tl4 = nd_alltracelist; nd_alltracelist = 0;
3378: } else tl4 = 0;
3379: }
3380: if ( ret ) break;
1.157 noro 3381: else if ( trace > 1 ) {
3382: /* failure */
3383: *rp = 0; return;
3384: } else {
3385: /* try the next modulus */
3386: m = get_lprime(++mindex);
3387: /* reset the parameters */
3388: if ( !ishomo && homo ) {
3389: nd_init_ord(ord1);
3390: nd_setup_parameters(nvar+1,wmax);
3391: } else {
3392: nd_init_ord(ord);
3393: nd_setup_parameters(nvar,max);
3394: }
3395: }
3396: }
3397: get_eg(&eg1); init_eg(&eg_check); add_eg(&eg_check,&eg0,&eg1);
3398: if ( DP_Print )
3399: fprintf(asir_out,"check=%fsec\n",eg_check.exectime+eg_check.gctime);
3400: /* dp->p */
3401: nd_bpe = cbpe;
3402: nd_setup_parameters(nd_nvar,0);
1.158 noro 3403: for ( r = cand; r; r = NEXT(r) ) {
1.167 noro 3404: if ( nd_module ) BDY(r) = ndvtopl(0,CO,vv,BDY(r),mrank);
1.158 noro 3405: else BDY(r) = (pointer)ndvtop(0,CO,vv,BDY(r));
3406: }
1.157 noro 3407: if ( nalg )
3408: cand = postprocess_algcoef(av,alist,cand);
3409: MKLIST(*rp,cand);
1.172 noro 3410: if ( nd_gentrace ) {
1.167 noro 3411: tl1 = reverse_node(tl1); tl2 = reverse_node(tl2);
1.168 noro 3412: tl3 = reverse_node(tl3);
1.167 noro 3413: /* tl2 = [[i,[[*,j,*,*],...]],...] */
3414: for ( t = tl2; t; t = NEXT(t) ) {
3415: /* s = [i,[*,j,*,*],...] */
3416: s = BDY((LIST)BDY(t));
3417: j = perm[QTOS((Q)ARG0(s))]; STOQ(j,jq); ARG0(s) = (pointer)jq;
3418: for ( s = BDY((LIST)ARG1(s)); s; s = NEXT(s) ) {
3419: j = perm[QTOS((Q)ARG1(BDY((LIST)BDY(s))))]; STOQ(j,jq);
3420: ARG1(BDY((LIST)BDY(s))) = (pointer)jq;
3421: }
3422: }
3423: for ( j = length(cand)-1, t = 0; j >= 0; j-- ) {
3424: STOQ(perm[j],jq); MKNODE(s,jq,t); t = s;
3425: }
1.168 noro 3426: MKLIST(l1,tl1); MKLIST(l2,tl2); MKLIST(l3,t); MKLIST(l4,tl3);
3427: MKLIST(l5,tl4);
1.198 noro 3428: STOQ(nd_bpe,bpe);
3429: tr = mknode(8,*rp,(!ishomo&&homo)?ONE:0,l1,l2,l3,l4,l5,bpe); MKLIST(*rp,tr);
1.167 noro 3430: }
1.157 noro 3431: }
1.52 noro 3432:
1.157 noro 3433: /* XXX : module element is not considered */
1.1 noro 3434:
1.61 noro 3435: void dltondl(int n,DL dl,UINT *r)
1.1 noro 3436: {
1.157 noro 3437: UINT *d;
3438: int i,j,l,s,ord_l;
3439: struct order_pair *op;
3440:
3441: d = dl->d;
3442: for ( i = 0; i < nd_wpd; i++ ) r[i] = 0;
3443: if ( nd_blockmask ) {
3444: l = nd_blockmask->n;
3445: op = nd_blockmask->order_pair;
3446: for ( j = 0, s = 0; j < l; j++ ) {
3447: ord_l = op[j].length;
3448: for ( i = 0; i < ord_l; i++, s++ ) PUT_EXP(r,s,d[s]);
3449: }
3450: TD(r) = ndl_weight(r);
3451: ndl_weight_mask(r);
3452: } else {
3453: for ( i = 0; i < n; i++ ) PUT_EXP(r,i,d[i]);
3454: TD(r) = ndl_weight(r);
3455: }
1.1 noro 3456: }
3457:
1.61 noro 3458: DL ndltodl(int n,UINT *ndl)
1.1 noro 3459: {
1.157 noro 3460: DL dl;
3461: int *d;
3462: int i,j,l,s,ord_l;
3463: struct order_pair *op;
3464:
3465: NEWDL(dl,n);
3466: dl->td = TD(ndl);
3467: d = dl->d;
3468: if ( nd_blockmask ) {
3469: l = nd_blockmask->n;
3470: op = nd_blockmask->order_pair;
3471: for ( j = 0, s = 0; j < l; j++ ) {
3472: ord_l = op[j].length;
3473: for ( i = 0; i < ord_l; i++, s++ ) d[s] = GET_EXP(ndl,s);
3474: }
3475: } else {
3476: for ( i = 0; i < n; i++ ) d[i] = GET_EXP(ndl,i);
3477: }
3478: return dl;
1.1 noro 3479: }
3480:
1.167 noro 3481: void nmtodp(int mod,NM m,DP *r)
3482: {
3483: DP dp;
3484: MP mr;
3485:
3486: NEWMP(mr);
3487: mr->dl = ndltodl(nd_nvar,DL(m));
3488: mr->c = ndctop(mod,m->c);
3489: NEXT(mr) = 0; MKDP(nd_nvar,mr,dp); dp->sugar = mr->dl->td;
3490: *r = dp;
3491: }
3492:
1.61 noro 3493: void ndl_print(UINT *dl)
1.1 noro 3494: {
1.157 noro 3495: int n;
3496: int i,j,l,ord_l,s,s0;
3497: struct order_pair *op;
3498:
3499: n = nd_nvar;
3500: printf("<<");
3501: if ( nd_blockmask ) {
3502: l = nd_blockmask->n;
3503: op = nd_blockmask->order_pair;
3504: for ( j = 0, s = s0 = 0; j < l; j++ ) {
3505: ord_l = op[j].length;
3506: for ( i = 0; i < ord_l; i++, s++ )
3507: printf(s==n-1?"%d":"%d,",GET_EXP(dl,s));
3508: }
3509: } else {
3510: for ( i = 0; i < n; i++ ) printf(i==n-1?"%d":"%d,",GET_EXP(dl,i));
3511: }
3512: printf(">>");
3513: if ( MPOS(dl) )
3514: printf("*e%d",MPOS(dl));
1.1 noro 3515: }
3516:
3517: void nd_print(ND p)
3518: {
1.157 noro 3519: NM m;
1.1 noro 3520:
1.157 noro 3521: if ( !p )
3522: printf("0\n");
3523: else {
3524: for ( m = BDY(p); m; m = NEXT(m) ) {
3525: if ( CM(m) & 0x80000000 ) printf("+@_%d*",IFTOF(CM(m)));
3526: else printf("+%d*",CM(m));
3527: ndl_print(DL(m));
3528: }
3529: printf("\n");
3530: }
1.1 noro 3531: }
3532:
1.113 noro 3533: void nd_print_q(ND p)
1.16 noro 3534: {
1.157 noro 3535: NM m;
1.16 noro 3536:
1.157 noro 3537: if ( !p )
3538: printf("0\n");
3539: else {
3540: for ( m = BDY(p); m; m = NEXT(m) ) {
3541: printf("+");
3542: printexpr(CO,(Obj)CQ(m));
3543: printf("*");
3544: ndl_print(DL(m));
3545: }
3546: printf("\n");
3547: }
1.16 noro 3548: }
3549:
1.1 noro 3550: void ndp_print(ND_pairs d)
3551: {
1.157 noro 3552: ND_pairs t;
1.1 noro 3553:
1.157 noro 3554: for ( t = d; t; t = NEXT(t) ) printf("%d,%d ",t->i1,t->i2);
3555: printf("\n");
1.1 noro 3556: }
3557:
1.20 noro 3558: void nd_removecont(int mod,ND p)
1.16 noro 3559: {
1.157 noro 3560: int i,n;
3561: Q *w;
3562: Q dvr,t;
3563: NM m;
3564: struct oVECT v;
3565: N q,r;
3566:
3567: if ( mod == -1 ) nd_mul_c(mod,p,_invsf(HCM(p)));
3568: else if ( mod ) nd_mul_c(mod,p,invm(HCM(p),mod));
3569: else {
3570: for ( m = BDY(p), n = 0; m; m = NEXT(m), n++ );
3571: w = (Q *)ALLOCA(n*sizeof(Q));
3572: v.len = n;
3573: v.body = (pointer *)w;
3574: for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) w[i] = CQ(m);
3575: removecont_array((P *)w,n,1);
3576: for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) CQ(m) = w[i];
3577: }
1.16 noro 3578: }
3579:
1.21 noro 3580: void nd_removecont2(ND p1,ND p2)
3581: {
1.157 noro 3582: int i,n1,n2,n;
3583: Q *w;
3584: Q dvr,t;
3585: NM m;
3586: struct oVECT v;
3587: N q,r;
3588:
3589: n1 = nd_length(p1);
3590: n2 = nd_length(p2);
3591: n = n1+n2;
3592: w = (Q *)ALLOCA(n*sizeof(Q));
3593: v.len = n;
3594: v.body = (pointer *)w;
3595: i = 0;
3596: if ( p1 )
3597: for ( m = BDY(p1); i < n1; m = NEXT(m), i++ ) w[i] = CQ(m);
3598: if ( p2 )
3599: for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = CQ(m);
3600: removecont_array((P *)w,n,1);
3601: i = 0;
3602: if ( p1 )
3603: for ( m = BDY(p1); i < n1; m = NEXT(m), i++ ) CQ(m) = w[i];
3604: if ( p2 )
3605: for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) CQ(m) = w[i];
1.21 noro 3606: }
3607:
1.20 noro 3608: void ndv_removecont(int mod,NDV p)
1.16 noro 3609: {
1.157 noro 3610: int i,len,all_p;
3611: Q *c;
3612: P *w;
3613: Q dvr,t;
3614: P g,cont,tp;
3615: NMV m;
3616:
3617: if ( mod == -1 )
3618: ndv_mul_c(mod,p,_invsf(HCM(p)));
3619: else if ( mod )
3620: ndv_mul_c(mod,p,invm(HCM(p),mod));
3621: else {
3622: len = p->len;
3623: w = (P *)ALLOCA(len*sizeof(P));
3624: c = (Q *)ALLOCA(len*sizeof(Q));
3625: for ( m = BDY(p), all_p = 1, i = 0; i < len; NMV_ADV(m), i++ ) {
3626: ptozp(CP(m),1,&c[i],&w[i]);
3627: all_p = all_p && !NUM(w[i]);
3628: }
3629: if ( all_p ) {
3630: qltozl(c,len,&dvr); nd_heu_nezgcdnpz(nd_vc,w,len,1,&g);
3631: mulp(nd_vc,(P)dvr,g,&cont);
3632: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) {
3633: divsp(nd_vc,CP(m),cont,&tp); CP(m) = tp;
3634: }
3635: } else {
3636: sortbynm((Q *)c,len);
3637: qltozl((Q *)c,len,&dvr);
3638: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) {
3639: divsp(nd_vc,CP(m),(P)dvr,&tp); CP(m) = tp;
3640: }
3641: }
3642: }
1.21 noro 3643: }
3644:
1.157 noro 3645: /* koko */
3646:
1.164 noro 3647: void ndv_homogenize(NDV p,int obpe,int oadv,EPOS oepos,int ompos)
1.61 noro 3648: {
1.157 noro 3649: int len,i,max;
3650: NMV m,mr0,mr,t;
1.61 noro 3651:
1.157 noro 3652: len = p->len;
1.178 noro 3653: for ( m = BDY(p), i = 0, max = 1; i < len; NMV_OADV(m), i++ )
1.157 noro 3654: max = MAX(max,TD(DL(m)));
3655: mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p);
3656: m = (NMV)((char *)mr0+(len-1)*oadv);
3657: mr = (NMV)((char *)mr0+(len-1)*nmv_adv);
3658: t = (NMV)ALLOCA(nmv_adv);
3659: for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) {
1.164 noro 3660: ndl_homogenize(DL(m),DL(t),obpe,oepos,ompos,max);
1.157 noro 3661: CQ(mr) = CQ(m);
3662: ndl_copy(DL(t),DL(mr));
3663: }
3664: NV(p)++;
3665: BDY(p) = mr0;
1.61 noro 3666: }
3667:
1.45 noro 3668: void ndv_dehomogenize(NDV p,struct order_spec *ord)
1.23 noro 3669: {
1.164 noro 3670: int i,j,adj,len,newnvar,newwpd,newadv,newexporigin,newmpos;
1.167 noro 3671: int pos;
1.157 noro 3672: Q *w;
3673: Q dvr,t;
3674: NMV m,r;
3675:
3676: len = p->len;
3677: newnvar = nd_nvar-1;
3678: newexporigin = nd_get_exporigin(ord);
1.167 noro 3679: if ( nd_module ) newmpos = newexporigin-1;
1.157 noro 3680: newwpd = newnvar/nd_epw+(newnvar%nd_epw?1:0)+newexporigin;
3681: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ )
3682: ndl_dehomogenize(DL(m));
3683: if ( newwpd != nd_wpd ) {
3684: newadv = ROUND_FOR_ALIGN(sizeof(struct oNMV)+(newwpd-1)*sizeof(UINT));
3685: for ( m = r = BDY(p), i = 0; i < len; NMV_ADV(m), NDV_NADV(r), i++ ) {
3686: CQ(r) = CQ(m);
1.167 noro 3687: if ( nd_module ) pos = MPOS(DL(m));
1.157 noro 3688: for ( j = 0; j < newexporigin; j++ ) DL(r)[j] = DL(m)[j];
3689: adj = nd_exporigin-newexporigin;
3690: for ( ; j < newwpd; j++ ) DL(r)[j] = DL(m)[j+adj];
1.167 noro 3691: if ( nd_module ) {
3692: DL(r)[newmpos] = pos;
3693: }
1.157 noro 3694: }
3695: }
3696: NV(p)--;
1.23 noro 3697: }
3698:
1.150 noro 3699: void nd_heu_nezgcdnpz(VL vl,P *pl,int m,int full,P *pr)
3700: {
1.157 noro 3701: int i;
3702: P *tpl,*tpl1;
3703: NODE l;
3704: P h,gcd,t;
3705:
3706: tpl = (P *)ALLOCA(m*sizeof(P));
3707: tpl1 = (P *)ALLOCA(m*sizeof(P));
3708: bcopy(pl,tpl,m*sizeof(P));
3709: gcd = (P)ONE;
3710: for ( l = nd_hcf; l; l = NEXT(l) ) {
3711: h = (P)BDY(l);
3712: while ( 1 ) {
3713: for ( i = 0; i < m; i++ )
3714: if ( !divtpz(vl,tpl[i],h,&tpl1[i]) )
3715: break;
3716: if ( i == m ) {
3717: bcopy(tpl1,tpl,m*sizeof(P));
3718: mulp(vl,gcd,h,&t); gcd = t;
3719: } else
3720: break;
3721: }
3722: }
3723: if ( DP_Print > 2 ){fprintf(asir_out,"[%d]",nmonop(gcd)); fflush(asir_out);}
3724: if ( full ) {
3725: heu_nezgcdnpz(vl,tpl,m,&t);
3726: mulp(vl,gcd,t,pr);
3727: } else
3728: *pr = gcd;
1.150 noro 3729: }
3730:
3731: void removecont_array(P *p,int n,int full)
1.146 noro 3732: {
1.157 noro 3733: int all_p,all_q,i;
3734: Q *c;
3735: P *w;
3736: P t,s;
3737:
3738: for ( all_q = 1, i = 0; i < n; i++ )
3739: all_q = all_q && NUM(p[i]);
3740: if ( all_q ) {
3741: removecont_array_q((Q *)p,n);
3742: } else {
3743: c = (Q *)ALLOCA(n*sizeof(Q));
3744: w = (P *)ALLOCA(n*sizeof(P));
3745: for ( i = 0; i < n; i++ ) {
3746: ptozp(p[i],1,&c[i],&w[i]);
3747: }
3748: removecont_array_q(c,n);
3749: nd_heu_nezgcdnpz(nd_vc,w,n,full,&t);
3750: for ( i = 0; i < n; i++ ) {
3751: divsp(nd_vc,w[i],t,&s); mulp(nd_vc,s,(P)c[i],&p[i]);
3752: }
3753: }
1.146 noro 3754: }
3755:
3756: void removecont_array_q(Q *c,int n)
1.21 noro 3757: {
1.157 noro 3758: struct oVECT v;
3759: Q d0,d1,a,u,u1,gcd;
3760: int i,j;
3761: N qn,rn,gn;
3762: Q *q,*r;
3763:
3764: q = (Q *)ALLOCA(n*sizeof(Q));
3765: r = (Q *)ALLOCA(n*sizeof(Q));
3766: v.id = O_VECT; v.len = n; v.body = (pointer *)c;
3767: igcdv_estimate(&v,&d0);
3768: for ( i = 0; i < n; i++ ) {
3769: divn(NM(c[i]),NM(d0),&qn,&rn);
3770: NTOQ(qn,SGN(c[i])*SGN(d0),q[i]);
3771: NTOQ(rn,SGN(c[i]),r[i]);
3772: }
3773: for ( i = 0; i < n; i++ ) if ( r[i] ) break;
3774: if ( i < n ) {
3775: v.id = O_VECT; v.len = n; v.body = (pointer *)r;
3776: igcdv(&v,&d1);
3777: gcdn(NM(d0),NM(d1),&gn); NTOQ(gn,1,gcd);
3778: divsn(NM(d0),gn,&qn); NTOQ(qn,1,a);
3779: for ( i = 0; i < n; i++ ) {
3780: mulq(a,q[i],&u);
3781: if ( r[i] ) {
3782: divsn(NM(r[i]),gn,&qn); NTOQ(qn,SGN(r[i]),u1);
3783: addq(u,u1,&q[i]);
3784: } else
3785: q[i] = u;
3786: }
3787: }
3788: for ( i = 0; i < n; i++ ) c[i] = q[i];
1.16 noro 3789: }
3790:
1.19 noro 3791: void nd_mul_c(int mod,ND p,int mul)
1.1 noro 3792: {
1.157 noro 3793: NM m;
3794: int c,c1;
1.1 noro 3795:
1.157 noro 3796: if ( !p ) return;
3797: if ( mul == 1 ) return;
3798: if ( mod == -1 )
3799: for ( m = BDY(p); m; m = NEXT(m) )
3800: CM(m) = _mulsf(CM(m),mul);
3801: else
3802: for ( m = BDY(p); m; m = NEXT(m) ) {
3803: c1 = CM(m); DMAR(c1,mul,0,mod,c); CM(m) = c;
3804: }
1.1 noro 3805: }
3806:
1.146 noro 3807: void nd_mul_c_q(ND p,P mul)
1.16 noro 3808: {
1.157 noro 3809: NM m;
3810: P c;
1.16 noro 3811:
1.157 noro 3812: if ( !p ) return;
3813: if ( UNIQ(mul) ) return;
3814: for ( m = BDY(p); m; m = NEXT(m) ) {
3815: mulp(nd_vc,CP(m),mul,&c); CP(m) = c;
3816: }
1.16 noro 3817: }
3818:
1.61 noro 3819: void nd_mul_c_p(VL vl,ND p,P mul)
3820: {
1.157 noro 3821: NM m;
3822: P c;
1.61 noro 3823:
1.157 noro 3824: if ( !p ) return;
3825: for ( m = BDY(p); m; m = NEXT(m) ) {
3826: mulp(vl,CP(m),mul,&c); CP(m) = c;
3827: }
1.61 noro 3828: }
3829:
1.1 noro 3830: void nd_free(ND p)
3831: {
1.157 noro 3832: NM t,s;
1.1 noro 3833:
1.157 noro 3834: if ( !p ) return;
3835: t = BDY(p);
3836: while ( t ) {
3837: s = NEXT(t);
3838: FREENM(t);
3839: t = s;
3840: }
3841: FREEND(p);
1.1 noro 3842: }
3843:
1.23 noro 3844: void ndv_free(NDV p)
3845: {
1.200 noro 3846: GCFREE(BDY(p));
1.23 noro 3847: }
3848:
1.61 noro 3849: void nd_append_red(UINT *d,int i)
1.1 noro 3850: {
1.157 noro 3851: RHist m,m0;
3852: int h;
1.1 noro 3853:
1.157 noro 3854: NEWRHist(m);
3855: h = ndl_hash_value(d);
3856: m->index = i;
3857: ndl_copy(d,DL(m));
3858: NEXT(m) = nd_red[h];
3859: nd_red[h] = m;
1.1 noro 3860: }
3861:
1.61 noro 3862: UINT *ndv_compute_bound(NDV p)
1.1 noro 3863: {
1.157 noro 3864: UINT *d1,*d2,*t;
3865: UINT u;
3866: int i,j,k,l,len,ind;
3867: NMV m;
3868:
3869: if ( !p )
3870: return 0;
3871: d1 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
3872: d2 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
3873: len = LEN(p);
3874: m = BDY(p); ndl_copy(DL(m),d1); NMV_ADV(m);
3875: for ( i = 1; i < len; i++, NMV_ADV(m) ) {
1.159 noro 3876: ndl_max(DL(m),d1,d2);
1.157 noro 3877: t = d1; d1 = d2; d2 = t;
3878: }
3879: l = nd_nvar+31;
3880: t = (UINT *)MALLOC_ATOMIC(l*sizeof(UINT));
3881: for ( i = nd_exporigin, ind = 0; i < nd_wpd; i++ ) {
3882: u = d1[i];
3883: k = (nd_epw-1)*nd_bpe;
3884: for ( j = 0; j < nd_epw; j++, k -= nd_bpe, ind++ )
3885: t[ind] = (u>>k)&nd_mask0;
3886: }
3887: for ( ; ind < l; ind++ ) t[ind] = 0;
3888: return t;
1.1 noro 3889: }
3890:
1.99 noro 3891: UINT *nd_compute_bound(ND p)
3892: {
1.157 noro 3893: UINT *d1,*d2,*t;
3894: UINT u;
3895: int i,j,k,l,len,ind;
3896: NM m;
3897:
3898: if ( !p )
3899: return 0;
3900: d1 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
3901: d2 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
3902: len = LEN(p);
3903: m = BDY(p); ndl_copy(DL(m),d1); m = NEXT(m);
3904: for ( m = NEXT(m); m; m = NEXT(m) ) {
3905: ndl_lcm(DL(m),d1,d2);
3906: t = d1; d1 = d2; d2 = t;
3907: }
3908: l = nd_nvar+31;
3909: t = (UINT *)MALLOC_ATOMIC(l*sizeof(UINT));
3910: for ( i = nd_exporigin, ind = 0; i < nd_wpd; i++ ) {
3911: u = d1[i];
3912: k = (nd_epw-1)*nd_bpe;
3913: for ( j = 0; j < nd_epw; j++, k -= nd_bpe, ind++ )
3914: t[ind] = (u>>k)&nd_mask0;
3915: }
3916: for ( ; ind < l; ind++ ) t[ind] = 0;
3917: return t;
1.99 noro 3918: }
3919:
1.157 noro 3920: /* if nd_module == 1 then d[nd_exporigin-1] indicates the position */
3921: /* of a term. In this case we need additional 1 word. */
3922:
1.48 noro 3923: int nd_get_exporigin(struct order_spec *ord)
3924: {
1.157 noro 3925: switch ( ord->id ) {
3926: case 0: case 2: case 256: case 258:
3927: return 1+nd_module;
3928: case 1: case 257:
3929: /* block order */
3930: /* poly ring d[0]:weight d[1]:w0,...,d[nd_exporigin-1]:w(n-1) */
3931: /* module d[0]:weight d[1]:w0,...,d[nd_exporigin-2]:w(n-1) */
3932: return ord->ord.block.length+1+nd_module;
3933: case 3: case 259:
3934: error("nd_get_exporigin : composite order is not supported yet.");
3935: }
1.48 noro 3936: }
3937:
1.61 noro 3938: void nd_setup_parameters(int nvar,int max) {
1.157 noro 3939: int i,j,n,elen,ord_o,ord_l,l,s,wpd;
3940: struct order_pair *op;
1.48 noro 3941:
1.157 noro 3942: nd_nvar = nvar;
3943: if ( max ) {
3944: /* XXX */
3945: if ( do_weyl ) nd_bpe = 32;
3946: else if ( max < 2 ) nd_bpe = 1;
3947: else if ( max < 4 ) nd_bpe = 2;
3948: else if ( max < 8 ) nd_bpe = 3;
3949: else if ( max < 16 ) nd_bpe = 4;
3950: else if ( max < 32 ) nd_bpe = 5;
3951: else if ( max < 64 ) nd_bpe = 6;
3952: else if ( max < 256 ) nd_bpe = 8;
3953: else if ( max < 1024 ) nd_bpe = 10;
3954: else if ( max < 65536 ) nd_bpe = 16;
3955: else nd_bpe = 32;
3956: }
1.203 noro 3957: if ( !do_weyl && weight_check && (current_dl_weight_vector || nd_matrix) ) {
1.201 noro 3958: UINT t;
1.203 noro 3959: int st;
3960: int *v;
3961: /* t = max(weights) */
3962: t = 0;
3963: if ( current_dl_weight_vector )
3964: for ( i = 0, t = 0; i < nd_nvar; i++ ) {
3965: if ( (st=current_dl_weight_vector[i]) < 0 ) st = -st;
3966: if ( t < st ) t = st;
3967: }
3968: if ( nd_matrix )
3969: for ( i = 0; i < nd_matrix_len; i++ )
3970: for ( j = 0, v = nd_matrix[i]; j < nd_nvar; j++ ) {
3971: if ( (st=v[j]) < 0 ) st = -st;
3972: if ( t < st ) t = st;
3973: }
3974: /* i = bitsize of t */
3975: for ( i = 0; t; t >>=1, i++ );
3976: /* i += bitsize of nd_nvar */
3977: for ( t = nd_nvar; t; t >>=1, i++);
3978: /* nd_bpe+i = bitsize of max(weights)*max(exp)*nd_nvar */
3979: if ( (nd_bpe+i) >= 31 )
3980: error("nd_setup_parameters : too large weight");
3981: }
1.157 noro 3982: nd_epw = (sizeof(UINT)*8)/nd_bpe;
3983: elen = nd_nvar/nd_epw+(nd_nvar%nd_epw?1:0);
3984: nd_exporigin = nd_get_exporigin(nd_ord);
3985: wpd = nd_exporigin+elen;
3986: if ( nd_module )
3987: nd_mpos = nd_exporigin-1;
3988: else
3989: nd_mpos = -1;
3990: if ( wpd != nd_wpd ) {
3991: nd_free_private_storage();
3992: nd_wpd = wpd;
3993: }
3994: if ( nd_bpe < 32 ) {
3995: nd_mask0 = (1<<nd_bpe)-1;
3996: } else {
3997: nd_mask0 = 0xffffffff;
3998: }
3999: bzero(nd_mask,sizeof(nd_mask));
4000: nd_mask1 = 0;
4001: for ( i = 0; i < nd_epw; i++ ) {
4002: nd_mask[nd_epw-i-1] = (nd_mask0<<(i*nd_bpe));
4003: nd_mask1 |= (1<<(nd_bpe-1))<<(i*nd_bpe);
4004: }
4005: nmv_adv = ROUND_FOR_ALIGN(sizeof(struct oNMV)+(nd_wpd-1)*sizeof(UINT));
4006: nd_epos = nd_create_epos(nd_ord);
4007: nd_blockmask = nd_create_blockmask(nd_ord);
4008: nd_work_vector = (int *)REALLOC(nd_work_vector,nd_nvar*sizeof(int));
1.1 noro 4009: }
4010:
1.103 noro 4011: ND_pairs nd_reconstruct(int trace,ND_pairs d)
1.1 noro 4012: {
1.157 noro 4013: int i,obpe,oadv,h;
4014: static NM prev_nm_free_list;
4015: static ND_pairs prev_ndp_free_list;
4016: RHist mr0,mr;
4017: RHist r;
4018: RHist *old_red;
4019: ND_pairs s0,s,t;
4020: EPOS oepos;
4021:
4022: obpe = nd_bpe;
4023: oadv = nmv_adv;
4024: oepos = nd_epos;
4025: if ( obpe < 2 ) nd_bpe = 2;
4026: else if ( obpe < 3 ) nd_bpe = 3;
4027: else if ( obpe < 4 ) nd_bpe = 4;
4028: else if ( obpe < 5 ) nd_bpe = 5;
4029: else if ( obpe < 6 ) nd_bpe = 6;
4030: else if ( obpe < 8 ) nd_bpe = 8;
4031: else if ( obpe < 10 ) nd_bpe = 10;
4032: else if ( obpe < 16 ) nd_bpe = 16;
4033: else if ( obpe < 32 ) nd_bpe = 32;
4034: else error("nd_reconstruct : exponent too large");
4035:
4036: nd_setup_parameters(nd_nvar,0);
4037: prev_nm_free_list = _nm_free_list;
4038: prev_ndp_free_list = _ndp_free_list;
4039: _nm_free_list = 0;
4040: _ndp_free_list = 0;
4041: for ( i = nd_psn-1; i >= 0; i-- ) ndv_realloc(nd_ps[i],obpe,oadv,oepos);
4042: if ( trace )
4043: for ( i = nd_psn-1; i >= 0; i-- )
4044: ndv_realloc(nd_ps_trace[i],obpe,oadv,oepos);
4045: s0 = 0;
4046: for ( t = d; t; t = NEXT(t) ) {
4047: NEXTND_pairs(s0,s);
4048: s->i1 = t->i1;
4049: s->i2 = t->i2;
4050: SG(s) = SG(t);
4051: ndl_reconstruct(LCM(t),LCM(s),obpe,oepos);
4052: }
4053:
4054: old_red = (RHist *)ALLOCA(REDTAB_LEN*sizeof(RHist));
4055: for ( i = 0; i < REDTAB_LEN; i++ ) {
4056: old_red[i] = nd_red[i];
4057: nd_red[i] = 0;
4058: }
4059: for ( i = 0; i < REDTAB_LEN; i++ )
4060: for ( r = old_red[i]; r; r = NEXT(r) ) {
4061: NEWRHist(mr);
4062: mr->index = r->index;
4063: SG(mr) = SG(r);
4064: ndl_reconstruct(DL(r),DL(mr),obpe,oepos);
4065: h = ndl_hash_value(DL(mr));
4066: NEXT(mr) = nd_red[h];
4067: nd_red[h] = mr;
4068: }
4069: for ( i = 0; i < REDTAB_LEN; i++ ) old_red[i] = 0;
4070: old_red = 0;
4071: for ( i = 0; i < nd_psn; i++ ) {
4072: NEWRHist(r); SG(r) = SG(nd_psh[i]);
4073: ndl_reconstruct(DL(nd_psh[i]),DL(r),obpe,oepos);
4074: nd_psh[i] = r;
4075: }
4076: if ( s0 ) NEXT(s) = 0;
4077: prev_nm_free_list = 0;
4078: prev_ndp_free_list = 0;
1.71 noro 4079: #if 0
1.157 noro 4080: GC_gcollect();
1.71 noro 4081: #endif
1.157 noro 4082: return s0;
1.1 noro 4083: }
4084:
1.61 noro 4085: void ndl_reconstruct(UINT *d,UINT *r,int obpe,EPOS oepos)
1.1 noro 4086: {
1.157 noro 4087: int n,i,ei,oepw,omask0,j,s,ord_l,l;
4088: struct order_pair *op;
1.1 noro 4089:
1.157 noro 4090: n = nd_nvar;
4091: oepw = (sizeof(UINT)*8)/obpe;
4092: omask0 = (1<<obpe)-1;
4093: TD(r) = TD(d);
4094: for ( i = nd_exporigin; i < nd_wpd; i++ ) r[i] = 0;
4095: if ( nd_blockmask ) {
4096: l = nd_blockmask->n;
4097: op = nd_blockmask->order_pair;
4098: for ( i = 1; i < nd_exporigin; i++ )
4099: r[i] = d[i];
4100: for ( j = 0, s = 0; j < l; j++ ) {
4101: ord_l = op[j].length;
4102: for ( i = 0; i < ord_l; i++, s++ ) {
4103: ei = GET_EXP_OLD(d,s);
4104: PUT_EXP(r,s,ei);
4105: }
4106: }
4107: } else {
4108: for ( i = 0; i < n; i++ ) {
4109: ei = GET_EXP_OLD(d,i);
4110: PUT_EXP(r,i,ei);
4111: }
4112: }
4113: if ( nd_module ) MPOS(r) = MPOS(d);
1.1 noro 4114: }
1.3 noro 4115:
1.6 noro 4116: ND nd_copy(ND p)
4117: {
1.157 noro 4118: NM m,mr,mr0;
4119: int c,n;
4120: ND r;
4121:
4122: if ( !p )
4123: return 0;
4124: else {
4125: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
4126: NEXTNM(mr0,mr);
4127: CM(mr) = CM(m);
4128: ndl_copy(DL(m),DL(mr));
4129: }
4130: NEXT(mr) = 0;
4131: MKND(NV(p),mr0,LEN(p),r);
4132: SG(r) = SG(p);
4133: return r;
4134: }
1.6 noro 4135: }
4136:
1.53 noro 4137: int nd_sp(int mod,int trace,ND_pairs p,ND *rp)
1.11 noro 4138: {
1.157 noro 4139: NM m1,m2;
4140: NDV p1,p2;
4141: ND t1,t2;
4142: UINT *lcm;
4143: P gp,tp;
1.167 noro 4144: Q g,t,iq;
1.157 noro 4145: int td;
1.167 noro 4146: LIST hist;
4147: NODE node;
4148: DP d;
1.157 noro 4149:
4150: if ( !mod && nd_demand ) {
4151: p1 = ndv_load(p->i1); p2 = ndv_load(p->i2);
4152: } else {
4153: if ( trace ) {
4154: p1 = nd_ps_trace[p->i1]; p2 = nd_ps_trace[p->i2];
4155: } else {
4156: p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2];
4157: }
4158: }
4159: lcm = LCM(p);
4160: NEWNM(m1); ndl_sub(lcm,HDL(p1),DL(m1));
4161: if ( ndl_check_bound2(p->i1,DL(m1)) ) {
4162: FREENM(m1); return 0;
4163: }
4164: NEWNM(m2); ndl_sub(lcm,HDL(p2),DL(m2));
4165: if ( ndl_check_bound2(p->i2,DL(m2)) ) {
4166: FREENM(m1); FREENM(m2); return 0;
4167: }
4168:
4169: if ( mod == -1 ) {
4170: CM(m1) = HCM(p2); CM(m2) = _chsgnsf(HCM(p1));
4171: } else if ( mod ) {
4172: CM(m1) = HCM(p2); CM(m2) = mod-HCM(p1);
4173: } else if ( nd_vc ) {
4174: ezgcdpz(nd_vc,HCP(p1),HCP(p2),&gp);
4175: divsp(nd_vc,HCP(p2),gp,&CP(m1));
4176: divsp(nd_vc,HCP(p1),gp,&tp); chsgnp(tp,&CP(m2));
4177: } else {
4178: igcd_cofactor(HCQ(p1),HCQ(p2),&g,&t,&CQ(m1)); chsgnq(t,&CQ(m2));
4179: }
4180: t1 = ndv_mul_nm(mod,m1,p1); t2 = ndv_mul_nm(mod,m2,p2);
4181: *rp = nd_add(mod,t1,t2);
1.172 noro 4182: if ( nd_gentrace ) {
1.167 noro 4183: /* nd_tracelist is initialized */
4184: STOQ(p->i1,iq); nmtodp(mod,m1,&d); node = mknode(4,ONE,iq,d,ONE);
4185: MKLIST(hist,node); MKNODE(nd_tracelist,hist,0);
4186: STOQ(p->i2,iq); nmtodp(mod,m2,&d); node = mknode(4,ONE,iq,d,ONE);
4187: MKLIST(hist,node); MKNODE(node,hist,nd_tracelist);
4188: nd_tracelist = node;
4189: }
1.157 noro 4190: FREENM(m1); FREENM(m2);
4191: return 1;
1.11 noro 4192: }
4193:
1.19 noro 4194: void ndv_mul_c(int mod,NDV p,int mul)
1.11 noro 4195: {
1.157 noro 4196: NMV m;
4197: int c,c1,len,i;
1.11 noro 4198:
1.157 noro 4199: if ( !p ) return;
4200: len = LEN(p);
4201: if ( mod == -1 )
4202: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) )
4203: CM(m) = _mulsf(CM(m),mul);
4204: else
4205: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
4206: c1 = CM(m); DMAR(c1,mul,0,mod,c); CM(m) = c;
4207: }
1.11 noro 4208: }
4209:
1.113 noro 4210: void ndv_mul_c_q(NDV p,Q mul)
1.16 noro 4211: {
1.157 noro 4212: NMV m;
4213: Q c;
4214: int len,i;
4215:
4216: if ( !p ) return;
4217: len = LEN(p);
4218: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
4219: mulq(CQ(m),mul,&c); CQ(m) = c;
4220: }
1.16 noro 4221: }
4222:
1.55 noro 4223: ND weyl_ndv_mul_nm(int mod,NM m0,NDV p) {
1.157 noro 4224: int n2,i,j,l,n,tlen;
4225: UINT *d0;
4226: NM *tab,*psum;
4227: ND s,r;
4228: NM t;
4229: NMV m1;
4230:
4231: if ( !p ) return 0;
4232: n = NV(p); n2 = n>>1;
4233: d0 = DL(m0);
4234: l = LEN(p);
4235: for ( i = 0, tlen = 1; i < n2; i++ ) tlen *= (GET_EXP(d0,n2+i)+1);
4236: tab = (NM *)ALLOCA(tlen*sizeof(NM));
4237: psum = (NM *)ALLOCA(tlen*sizeof(NM));
4238: for ( i = 0; i < tlen; i++ ) psum[i] = 0;
4239: m1 = (NMV)(((char *)BDY(p))+nmv_adv*(l-1));
4240: for ( i = l-1; i >= 0; i--, NMV_PREV(m1) ) {
4241: /* m0(NM) * m1(NMV) => tab(NM) */
4242: weyl_mul_nm_nmv(n,mod,m0,m1,tab,tlen);
4243: for ( j = 0; j < tlen; j++ ) {
4244: if ( tab[j] ) {
4245: NEXT(tab[j]) = psum[j]; psum[j] = tab[j];
4246: }
4247: }
4248: }
4249: for ( i = tlen-1, r = 0; i >= 0; i-- )
4250: if ( psum[i] ) {
4251: for ( j = 0, t = psum[i]; t; t = NEXT(t), j++ );
4252: MKND(n,psum[i],j,s);
4253: r = nd_add(mod,r,s);
4254: }
4255: if ( r ) SG(r) = SG(p)+TD(d0);
4256: return r;
1.55 noro 4257: }
4258:
1.56 noro 4259: /* product of monomials */
4260: /* XXX block order is not handled correctly */
4261:
1.55 noro 4262: void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *tab,int tlen)
4263: {
1.157 noro 4264: int i,n2,j,s,curlen,homo,h,a,b,k,l,u,min;
4265: UINT *d0,*d1,*d,*dt,*ctab;
4266: Q *ctab_q;
4267: Q q,q1;
4268: UINT c0,c1,c;
4269: NM *p;
4270: NM m,t;
4271: int mpos;
4272:
4273: for ( i = 0; i < tlen; i++ ) tab[i] = 0;
4274: if ( !m0 || !m1 ) return;
4275: d0 = DL(m0); d1 = DL(m1); n2 = n>>1;
1.166 noro 4276: if ( nd_module )
4277: if ( MPOS(d0) ) error("weyl_mul_nm_nmv : invalid operation");
4278:
1.157 noro 4279: NEWNM(m); d = DL(m);
4280: if ( mod ) {
4281: c0 = CM(m0); c1 = CM(m1); DMAR(c0,c1,0,mod,c); CM(m) = c;
1.179 noro 4282: } else if ( nd_vc )
4283: mulp(nd_vc,CP(m0),CP(m1),&CP(m));
4284: else
1.157 noro 4285: mulq(CQ(m0),CQ(m1),&CQ(m));
4286: for ( i = 0; i < nd_wpd; i++ ) d[i] = 0;
4287: homo = n&1 ? 1 : 0;
4288: if ( homo ) {
4289: /* offset of h-degree */
4290: h = GET_EXP(d0,n-1)+GET_EXP(d1,n-1);
4291: PUT_EXP(DL(m),n-1,h);
4292: TD(DL(m)) = h;
4293: if ( nd_blockmask ) ndl_weight_mask(DL(m));
4294: }
4295: tab[0] = m;
4296: NEWNM(m); d = DL(m);
4297: for ( i = 0, curlen = 1; i < n2; i++ ) {
4298: a = GET_EXP(d0,i); b = GET_EXP(d1,n2+i);
4299: k = GET_EXP(d0,n2+i); l = GET_EXP(d1,i);
4300: /* xi^a*(Di^k*xi^l)*Di^b */
4301: a += l; b += k;
4302: s = MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i);
4303: if ( !k || !l ) {
4304: for ( j = 0; j < curlen; j++ )
4305: if ( t = tab[j] ) {
4306: dt = DL(t);
4307: PUT_EXP(dt,i,a); PUT_EXP(dt,n2+i,b); TD(dt) += s;
4308: if ( nd_blockmask ) ndl_weight_mask(dt);
4309: }
4310: curlen *= k+1;
4311: continue;
4312: }
4313: min = MIN(k,l);
4314: if ( mod ) {
4315: ctab = (UINT *)ALLOCA((min+1)*sizeof(UINT));
4316: mkwcm(k,l,mod,ctab);
4317: } else {
4318: ctab_q = (Q *)ALLOCA((min+1)*sizeof(Q));
4319: mkwc(k,l,ctab_q);
4320: }
4321: for ( j = min; j >= 0; j-- ) {
4322: for ( u = 0; u < nd_wpd; u++ ) d[u] = 0;
4323: PUT_EXP(d,i,a-j); PUT_EXP(d,n2+i,b-j);
4324: h = MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i);
4325: if ( homo ) {
4326: TD(d) = s;
4327: PUT_EXP(d,n-1,s-h);
4328: } else TD(d) = h;
4329: if ( nd_blockmask ) ndl_weight_mask(d);
4330: if ( mod ) c = ctab[j];
4331: else q = ctab_q[j];
4332: p = tab+curlen*j;
4333: if ( j == 0 ) {
4334: for ( u = 0; u < curlen; u++, p++ ) {
4335: if ( tab[u] ) {
4336: ndl_addto(DL(tab[u]),d);
4337: if ( mod ) {
4338: c0 = CM(tab[u]); DMAR(c0,c,0,mod,c1); CM(tab[u]) = c1;
1.180 noro 4339: } else if ( nd_vc )
4340: mulp(nd_vc,CP(tab[u]),(P)q,&CP(tab[u]));
4341: else {
1.157 noro 4342: mulq(CQ(tab[u]),q,&q1); CQ(tab[u]) = q1;
4343: }
4344: }
4345: }
4346: } else {
4347: for ( u = 0; u < curlen; u++, p++ ) {
4348: if ( tab[u] ) {
4349: NEWNM(t);
4350: ndl_add(DL(tab[u]),d,DL(t));
4351: if ( mod ) {
4352: c0 = CM(tab[u]); DMAR(c0,c,0,mod,c1); CM(t) = c1;
1.181 noro 4353: } else if ( nd_vc )
1.180 noro 4354: mulp(nd_vc,CP(tab[u]),(P)q,&CP(t));
4355: else
1.157 noro 4356: mulq(CQ(tab[u]),q,&CQ(t));
4357: *p = t;
4358: }
4359: }
4360: }
4361: }
4362: curlen *= k+1;
4363: }
4364: FREENM(m);
1.167 noro 4365: if ( nd_module ) {
1.166 noro 4366: mpos = MPOS(d1);
1.167 noro 4367: for ( i = 0; i < tlen; i++ )
4368: if ( tab[i] ) {
4369: d = DL(tab[i]);
4370: MPOS(d) = mpos;
4371: TD(d) = ndl_weight(d);
4372: }
4373: }
1.55 noro 4374: }
4375:
1.63 noro 4376: ND ndv_mul_nm_symbolic(NM m0,NDV p)
4377: {
1.157 noro 4378: NM mr,mr0;
4379: NMV m;
4380: UINT *d,*dt,*dm;
4381: int c,n,td,i,c1,c2,len;
4382: Q q;
4383: ND r;
4384:
4385: if ( !p ) return 0;
4386: else {
4387: n = NV(p); m = BDY(p);
4388: d = DL(m0);
4389: len = LEN(p);
4390: mr0 = 0;
4391: td = TD(d);
4392: c = CM(m0);
4393: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
4394: NEXTNM(mr0,mr);
4395: CM(mr) = 1;
4396: ndl_add(DL(m),d,DL(mr));
4397: }
4398: NEXT(mr) = 0;
4399: MKND(NV(p),mr0,len,r);
4400: SG(r) = SG(p) + TD(d);
4401: return r;
4402: }
1.63 noro 4403: }
4404:
1.55 noro 4405: ND ndv_mul_nm(int mod,NM m0,NDV p)
1.9 noro 4406: {
1.157 noro 4407: NM mr,mr0;
4408: NMV m;
4409: UINT *d,*dt,*dm;
4410: int c,n,td,i,c1,c2,len;
4411: P q;
4412: ND r;
4413:
4414: if ( !p ) return 0;
4415: else if ( do_weyl )
4416: if ( mod == -1 )
4417: error("ndv_mul_nm : not implemented (weyl)");
4418: else
4419: return weyl_ndv_mul_nm(mod,m0,p);
4420: else {
4421: n = NV(p); m = BDY(p);
4422: d = DL(m0);
4423: len = LEN(p);
4424: mr0 = 0;
4425: td = TD(d);
4426: if ( mod == -1 ) {
4427: c = CM(m0);
4428: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
4429: NEXTNM(mr0,mr);
4430: CM(mr) = _mulsf(CM(m),c);
4431: ndl_add(DL(m),d,DL(mr));
4432: }
4433: } else if ( mod ) {
4434: c = CM(m0);
4435: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
4436: NEXTNM(mr0,mr);
4437: c1 = CM(m);
4438: DMAR(c1,c,0,mod,c2);
4439: CM(mr) = c2;
4440: ndl_add(DL(m),d,DL(mr));
4441: }
4442: } else {
4443: q = CP(m0);
4444: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
4445: NEXTNM(mr0,mr);
4446: mulp(nd_vc,CP(m),q,&CP(mr));
4447: ndl_add(DL(m),d,DL(mr));
4448: }
4449: }
4450: NEXT(mr) = 0;
4451: MKND(NV(p),mr0,len,r);
4452: SG(r) = SG(p) + TD(d);
4453: return r;
4454: }
1.4 noro 4455: }
4456:
1.104 noro 4457: ND nd_quo(int mod,PGeoBucket bucket,NDV d)
1.99 noro 4458: {
1.157 noro 4459: NM mq0,mq;
4460: NMV tm;
4461: Q q;
4462: int i,nv,sg,c,c1,c2,hindex;
4463: ND p,t,r;
4464: N tnm;
4465:
4466: if ( bucket->m < 0 ) return 0;
4467: else {
4468: nv = NV(d);
4469: mq0 = 0;
4470: tm = (NMV)ALLOCA(nmv_adv);
4471: while ( 1 ) {
4472: hindex = mod?head_pbucket(mod,bucket):head_pbucket_q(bucket);
4473: if ( hindex < 0 ) break;
4474: p = bucket->body[hindex];
4475: NEXTNM(mq0,mq);
4476: ndl_sub(HDL(p),HDL(d),DL(mq));
4477: ndl_copy(DL(mq),DL(tm));
4478: if ( mod ) {
4479: c1 = invm(HCM(d),mod); c2 = HCM(p);
4480: DMAR(c1,c2,0,mod,c); CM(mq) = c;
4481: CM(tm) = mod-c;
4482: } else {
4483: divsn(NM(HCQ(p)),NM(HCQ(d)),&tnm);
4484: NTOQ(tnm,SGN(HCQ(p))*SGN(HCQ(d)),CQ(mq));
4485: chsgnq(CQ(mq),&CQ(tm));
4486: }
4487: t = ndv_mul_nmv_trunc(mod,tm,d,HDL(d));
4488: bucket->body[hindex] = nd_remove_head(p);
4489: t = nd_remove_head(t);
4490: add_pbucket(mod,bucket,t);
4491: }
4492: if ( !mq0 )
4493: r = 0;
4494: else {
4495: NEXT(mq) = 0;
4496: for ( i = 0, mq = mq0; mq; mq = NEXT(mq), i++ );
4497: MKND(nv,mq0,i,r);
4498: /* XXX */
4499: SG(r) = HTD(r);
4500: }
4501: return r;
4502: }
1.99 noro 4503: }
4504:
1.43 noro 4505: void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos)
1.11 noro 4506: {
1.157 noro 4507: NMV m,mr,mr0,t;
4508: int len,i,k;
1.11 noro 4509:
1.157 noro 4510: if ( !p ) return;
4511: m = BDY(p); len = LEN(p);
4512: mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p);
4513: m = (NMV)((char *)mr0+(len-1)*oadv);
4514: mr = (NMV)((char *)mr0+(len-1)*nmv_adv);
4515: t = (NMV)ALLOCA(nmv_adv);
4516: for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) {
4517: CQ(t) = CQ(m);
4518: for ( k = 0; k < nd_wpd; k++ ) DL(t)[k] = 0;
4519: ndl_reconstruct(DL(m),DL(t),obpe,oepos);
4520: CQ(mr) = CQ(t);
4521: ndl_copy(DL(t),DL(mr));
4522: }
4523: BDY(p) = mr0;
1.61 noro 4524: }
4525:
4526: NDV ndv_dup_realloc(NDV p,int obpe,int oadv,EPOS oepos)
4527: {
1.157 noro 4528: NMV m,mr,mr0;
4529: int len,i;
4530: NDV r;
4531:
4532: if ( !p ) return 0;
4533: m = BDY(p); len = LEN(p);
4534: mr0 = mr = (NMV)MALLOC(len*nmv_adv);
4535: for ( i = 0; i < len; i++, NMV_OADV(m), NMV_ADV(mr) ) {
4536: ndl_zero(DL(mr));
4537: ndl_reconstruct(DL(m),DL(mr),obpe,oepos);
4538: CQ(mr) = CQ(m);
4539: }
4540: MKNDV(NV(p),mr0,len,r);
4541: SG(r) = SG(p);
4542: return r;
1.11 noro 4543: }
4544:
1.61 noro 4545: /* duplicate p */
4546:
4547: NDV ndv_dup(int mod,NDV p)
1.3 noro 4548: {
1.157 noro 4549: NDV d;
4550: NMV t,m,m0;
4551: int i,len;
4552:
4553: if ( !p ) return 0;
4554: len = LEN(p);
4555: m0 = m = (NMV)(mod?MALLOC_ATOMIC(len*nmv_adv):MALLOC(len*nmv_adv));
4556: for ( t = BDY(p), i = 0; i < len; i++, NMV_ADV(t), NMV_ADV(m) ) {
4557: ndl_copy(DL(t),DL(m));
4558: CQ(m) = CQ(t);
4559: }
4560: MKNDV(NV(p),m0,len,d);
4561: SG(d) = SG(p);
4562: return d;
1.23 noro 4563: }
4564:
1.63 noro 4565: ND nd_dup(ND p)
4566: {
1.157 noro 4567: ND d;
4568: NM t,m,m0;
1.63 noro 4569:
1.157 noro 4570: if ( !p ) return 0;
4571: for ( m0 = 0, t = BDY(p); t; t = NEXT(t) ) {
4572: NEXTNM(m0,m);
4573: ndl_copy(DL(t),DL(m));
4574: CQ(m) = CQ(t);
4575: }
4576: if ( m0 ) NEXT(m) = 0;
4577: MKND(NV(p),m0,LEN(p),d);
4578: SG(d) = SG(p);
4579: return d;
1.63 noro 4580: }
4581:
1.61 noro 4582: /* XXX if p->len == 0 then it represents 0 */
4583:
4584: void ndv_mod(int mod,NDV p)
4585: {
1.157 noro 4586: NMV t,d;
4587: int r,s,u;
4588: int i,len,dlen;
4589: P cp;
4590: Q c;
4591: Obj gfs;
4592:
4593: if ( !p ) return;
4594: len = LEN(p);
4595: dlen = 0;
4596: if ( mod == -1 )
4597: for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) {
4598: simp_ff((Obj)CP(t),&gfs);
4599: r = FTOIF(CONT((GFS)gfs));
4600: CM(d) = r;
4601: ndl_copy(DL(t),DL(d));
4602: NMV_ADV(d);
4603: dlen++;
4604: }
4605: else
4606: for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) {
4607: if ( nd_vc ) {
4608: nd_subst_vector(nd_vc,CP(t),nd_subst,&cp);
4609: c = (Q)cp;
4610: } else
4611: c = CQ(t);
4612: r = rem(NM(c),mod);
4613: if ( r ) {
4614: if ( SGN(c) < 0 )
4615: r = mod-r;
4616: if ( DN(c) ) {
4617: s = rem(DN(c),mod);
4618: if ( !s )
4619: error("ndv_mod : division by 0");
4620: s = invm(s,mod);
4621: DMAR(r,s,0,mod,u); r = u;
4622: }
4623: CM(d) = r;
4624: ndl_copy(DL(t),DL(d));
4625: NMV_ADV(d);
4626: dlen++;
4627: }
4628: }
4629: LEN(p) = dlen;
1.61 noro 4630: }
4631:
4632: NDV ptondv(VL vl,VL dvl,P p)
4633: {
1.157 noro 4634: ND nd;
4635:
4636: nd = ptond(vl,dvl,p);
4637: return ndtondv(0,nd);
4638: }
1.61 noro 4639:
1.157 noro 4640: void pltozpl(LIST l,Q *cont,LIST *pp)
4641: {
4642: NODE nd,nd1;
4643: int n;
4644: P *pl;
4645: Q *cl;
4646: int i;
4647: P dmy;
4648: Q dvr;
4649: LIST r;
4650:
4651: nd = BDY(l); n = length(nd);
4652: pl = (P *)ALLOCA(n*sizeof(P));
4653: cl = (Q *)ALLOCA(n*sizeof(P));
4654: for ( i = 0; i < n; i++, nd = NEXT(nd) )
4655: ptozp((P)BDY(nd),1,&cl[i],&dmy);
4656: qltozl(cl,n,&dvr);
4657: nd = BDY(l);
4658: for ( i = 0; i < n; i++, nd = NEXT(nd) ) {
4659: divsp(CO,(P)BDY(nd),(P)dvr,&pl[i]);
4660: }
4661: nd = 0;
4662: for ( i = n-1; i >= 0; i-- ) {
4663: MKNODE(nd1,pl[i],nd); nd = nd1;
4664: }
4665: MKLIST(r,nd);
4666: *pp = r;
4667: }
4668:
4669: /* (a1,a2,...,an) -> a1*e(1)+...+an*e(n) */
4670:
4671: NDV pltondv(VL vl,VL dvl,LIST p)
4672: {
4673: int i;
4674: NODE t;
4675: ND r,ri;
4676: NM m;
4677:
4678: if ( !nd_module ) error("pltond : module order must be set");
4679: r = 0;
4680: for ( i = 1, t = BDY(p); t; t = NEXT(t), i++ ) {
4681: ri = ptond(vl,dvl,(P)BDY(t));
1.163 noro 4682: if ( ri )
4683: for ( m = BDY(ri); m; m = NEXT(m) ) {
1.167 noro 4684: MPOS(DL(m)) = i;
4685: TD(DL(m)) = ndl_weight(DL(m));
1.163 noro 4686: if ( nd_blockmask ) ndl_weight_mask(DL(m));
4687: }
1.157 noro 4688: r = nd_add(0,r,ri);
4689: }
4690: return ndtondv(0,r);
1.61 noro 4691: }
4692:
4693: ND ptond(VL vl,VL dvl,P p)
1.23 noro 4694: {
1.157 noro 4695: int n,i,j,k,e;
4696: VL tvl;
4697: V v;
4698: DCP dc;
4699: DCP *w;
4700: ND r,s,t,u;
4701: P x;
4702: int c;
4703: UINT *d;
4704: NM m,m0;
4705:
4706: if ( !p )
4707: return 0;
4708: else if ( NUM(p) ) {
4709: NEWNM(m);
4710: ndl_zero(DL(m));
4711: CQ(m) = (Q)p;
4712: NEXT(m) = 0;
4713: MKND(nd_nvar,m,1,r);
4714: SG(r) = 0;
4715: return r;
4716: } else {
4717: for ( dc = DC(p), k = 0; dc; dc = NEXT(dc), k++ );
4718: w = (DCP *)ALLOCA(k*sizeof(DCP));
4719: for ( dc = DC(p), j = 0; j < k; dc = NEXT(dc), j++ ) w[j] = dc;
4720: for ( i = 0, tvl = dvl, v = VR(p);
4721: tvl && tvl->v != v; tvl = NEXT(tvl), i++ );
4722: if ( !tvl ) {
4723: for ( j = k-1, s = 0, MKV(v,x); j >= 0; j-- ) {
4724: t = ptond(vl,dvl,COEF(w[j]));
4725: pwrp(vl,x,DEG(w[j]),&p);
4726: nd_mul_c_p(CO,t,p); s = nd_add(0,s,t);
4727: }
4728: return s;
4729: } else {
4730: NEWNM(m0); d = DL(m0);
4731: for ( j = k-1, s = 0; j >= 0; j-- ) {
4732: ndl_zero(d); e = QTOS(DEG(w[j])); PUT_EXP(d,i,e);
4733: TD(d) = MUL_WEIGHT(e,i);
4734: if ( nd_blockmask) ndl_weight_mask(d);
4735: if ( nd_module ) MPOS(d) = 0;
4736: t = ptond(vl,dvl,COEF(w[j]));
4737: for ( m = BDY(t); m; m = NEXT(m) )
4738: ndl_addto(DL(m),d);
4739: SG(t) += TD(d);
4740: s = nd_add(0,s,t);
4741: }
4742: FREENM(m0);
4743: return s;
4744: }
4745: }
1.61 noro 4746: }
4747:
4748: P ndvtop(int mod,VL vl,VL dvl,NDV p)
4749: {
1.157 noro 4750: VL tvl;
4751: int len,n,j,i,e;
4752: NMV m;
4753: Q q;
4754: P c;
4755: UINT *d;
4756: P s,r,u,t,w;
4757: GFS gfs;
4758:
4759: if ( !p ) return 0;
4760: else {
4761: len = LEN(p);
4762: n = NV(p);
4763: m = (NMV)(((char *)BDY(p))+nmv_adv*(len-1));
4764: for ( j = len-1, s = 0; j >= 0; j--, NMV_PREV(m) ) {
4765: if ( mod == -1 ) {
4766: e = IFTOF(CM(m)); MKGFS(e,gfs); c = (P)gfs;
4767: } else if ( mod ) {
4768: STOQ(CM(m),q); c = (P)q;
4769: } else
4770: c = CP(m);
4771: d = DL(m);
4772: for ( i = 0, t = c, tvl = dvl; i < n; tvl = NEXT(tvl), i++ ) {
4773: MKV(tvl->v,r); e = GET_EXP(d,i); STOQ(e,q);
4774: pwrp(vl,r,q,&u); mulp(vl,t,u,&w); t = w;
4775: }
4776: addp(vl,s,t,&u); s = u;
4777: }
4778: return s;
4779: }
4780: }
4781:
4782: LIST ndvtopl(int mod,VL vl,VL dvl,NDV p,int rank)
4783: {
4784: VL tvl;
4785: int len,n,j,i,e;
4786: NMV m;
4787: Q q;
4788: P c;
4789: UINT *d;
4790: P s,r,u,t,w;
4791: GFS gfs;
4792: P *a;
4793: LIST l;
4794: NODE nd,nd1;
4795:
4796: if ( !p ) return 0;
4797: else {
4798: a = (P *)ALLOCA((rank+1)*sizeof(P));
4799: for ( i = 0; i <= rank; i++ ) a[i] = 0;
4800: len = LEN(p);
4801: n = NV(p);
4802: m = (NMV)(((char *)BDY(p))+nmv_adv*(len-1));
4803: for ( j = len-1; j >= 0; j--, NMV_PREV(m) ) {
4804: if ( mod == -1 ) {
4805: e = IFTOF(CM(m)); MKGFS(e,gfs); c = (P)gfs;
4806: } else if ( mod ) {
4807: STOQ(CM(m),q); c = (P)q;
4808: } else
4809: c = CP(m);
4810: d = DL(m);
4811: for ( i = 0, t = c, tvl = dvl; i < n; tvl = NEXT(tvl), i++ ) {
4812: MKV(tvl->v,r); e = GET_EXP(d,i); STOQ(e,q);
4813: pwrp(vl,r,q,&u); mulp(vl,t,u,&w); t = w;
4814: }
4815: addp(vl,a[MPOS(d)],t,&u); a[MPOS(d)] = u;
4816: }
4817: nd = 0;
4818: for ( i = rank; i > 0; i-- ) {
4819: MKNODE(nd1,a[i],nd); nd = nd1;
4820: }
4821: MKLIST(l,nd);
4822: return l;
4823: }
1.3 noro 4824: }
4825:
1.61 noro 4826: NDV ndtondv(int mod,ND p)
1.11 noro 4827: {
1.157 noro 4828: NDV d;
4829: NMV m,m0;
4830: NM t;
4831: int i,len;
4832:
4833: if ( !p ) return 0;
4834: len = LEN(p);
4835: if ( mod )
1.200 noro 4836: m0 = m = (NMV)MALLOC_ATOMIC_IGNORE_OFF_PAGE(len*nmv_adv);
1.157 noro 4837: else
4838: m0 = m = MALLOC(len*nmv_adv);
1.103 noro 4839: #if 0
1.157 noro 4840: ndv_alloc += nmv_adv*len;
1.103 noro 4841: #endif
1.157 noro 4842: for ( t = BDY(p), i = 0; t; t = NEXT(t), i++, NMV_ADV(m) ) {
4843: ndl_copy(DL(t),DL(m));
4844: CQ(m) = CQ(t);
4845: }
4846: MKNDV(NV(p),m0,len,d);
4847: SG(d) = SG(p);
4848: return d;
1.11 noro 4849: }
4850:
1.61 noro 4851: ND ndvtond(int mod,NDV p)
1.11 noro 4852: {
1.157 noro 4853: ND d;
4854: NM m,m0;
4855: NMV t;
4856: int i,len;
4857:
4858: if ( !p ) return 0;
4859: m0 = 0;
4860: len = p->len;
4861: for ( t = BDY(p), i = 0; i < len; NMV_ADV(t), i++ ) {
4862: NEXTNM(m0,m);
4863: ndl_copy(DL(t),DL(m));
4864: CQ(m) = CQ(t);
4865: }
4866: NEXT(m) = 0;
4867: MKND(NV(p),m0,len,d);
4868: SG(d) = SG(p);
4869: return d;
1.11 noro 4870: }
4871:
1.198 noro 4872: DP ndvtodp(int mod,NDV p)
4873: {
4874: MP m,m0;
4875: DP d;
4876: NMV t;
4877: int i,len;
4878:
4879: if ( !p ) return 0;
4880: m0 = 0;
4881: len = p->len;
4882: for ( t = BDY(p), i = 0; i < len; NMV_ADV(t), i++ ) {
4883: NEXTMP(m0,m);
4884: m->dl = ndltodl(nd_nvar,DL(t));
4885: m->c = ndctop(mod,t->c);
4886: }
4887: NEXT(m) = 0;
4888: MKDP(nd_nvar,m0,d);
4889: SG(d) = SG(p);
4890: return d;
4891: }
4892:
1.204 noro 4893: DP ndtodp(int mod,ND p)
4894: {
4895: MP m,m0;
4896: DP d;
4897: NM t;
4898: int i,len;
4899:
4900: if ( !p ) return 0;
4901: m0 = 0;
4902: len = p->len;
4903: for ( t = BDY(p); t; t = NEXT(t) ) {
4904: NEXTMP(m0,m);
4905: m->dl = ndltodl(nd_nvar,DL(t));
4906: m->c = ndctop(mod,t->c);
4907: }
4908: NEXT(m) = 0;
4909: MKDP(nd_nvar,m0,d);
4910: SG(d) = SG(p);
4911: return d;
4912: }
4913:
1.3 noro 4914: void ndv_print(NDV p)
4915: {
1.157 noro 4916: NMV m;
4917: int i,len;
1.3 noro 4918:
1.157 noro 4919: if ( !p ) printf("0\n");
4920: else {
4921: len = LEN(p);
4922: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
4923: if ( CM(m) & 0x80000000 ) printf("+@_%d*",IFTOF(CM(m)));
4924: else printf("+%d*",CM(m));
4925: ndl_print(DL(m));
4926: }
4927: printf("\n");
4928: }
1.16 noro 4929: }
4930:
1.113 noro 4931: void ndv_print_q(NDV p)
1.16 noro 4932: {
1.157 noro 4933: NMV m;
4934: int i,len;
1.16 noro 4935:
1.157 noro 4936: if ( !p ) printf("0\n");
4937: else {
4938: len = LEN(p);
4939: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
4940: printf("+");
4941: printexpr(CO,(Obj)CQ(m));
4942: printf("*");
4943: ndl_print(DL(m));
4944: }
4945: printf("\n");
4946: }
1.25 noro 4947: }
4948:
1.167 noro 4949: NODE ndv_reducebase(NODE x,int *perm)
1.27 noro 4950: {
1.157 noro 4951: int len,i,j;
1.167 noro 4952: NDVI w;
1.157 noro 4953: NODE t,t0;
4954:
4955: len = length(x);
1.167 noro 4956: w = (NDVI)ALLOCA(len*sizeof(struct oNDVI));
4957: for ( i = 0, t = x; i < len; i++, t = NEXT(t) ) {
4958: w[i].p = BDY(t); w[i].i = perm[i];
4959: }
1.157 noro 4960: for ( i = 0; i < len; i++ ) {
4961: for ( j = 0; j < i; j++ ) {
1.167 noro 4962: if ( w[i].p && w[j].p )
4963: if ( ndl_reducible(HDL(w[i].p),HDL(w[j].p)) ) w[i].p = 0;
4964: else if ( ndl_reducible(HDL(w[j].p),HDL(w[i].p)) ) w[j].p = 0;
1.157 noro 4965: }
4966: }
1.167 noro 4967: for ( i = j = 0, t0 = 0; i < len; i++ ) {
4968: if ( w[i].p ) {
4969: NEXTNODE(t0,t); BDY(t) = (pointer)w[i].p;
4970: perm[j++] = w[i].i;
4971: }
1.157 noro 4972: }
4973: NEXT(t) = 0; x = t0;
4974: return x;
1.11 noro 4975: }
1.32 noro 4976:
1.43 noro 4977: /* XXX incomplete */
4978:
1.32 noro 4979: void nd_init_ord(struct order_spec *ord)
4980: {
1.157 noro 4981: nd_module = (ord->id >= 256);
1.203 noro 4982: nd_matrix = 0;
4983: nd_matrix_len = 0;
1.157 noro 4984: switch ( ord->id ) {
4985: case 0:
4986: switch ( ord->ord.simple ) {
4987: case 0:
4988: nd_dcomp = 1;
4989: nd_isrlex = 1;
4990: break;
4991: case 1:
4992: nd_dcomp = 1;
4993: nd_isrlex = 0;
4994: break;
4995: case 2:
4996: nd_dcomp = 0;
4997: nd_isrlex = 0;
4998: ndl_compare_function = ndl_lex_compare;
4999: break;
5000: case 11:
5001: /* XXX */
5002: nd_dcomp = 0;
5003: nd_isrlex = 1;
5004: ndl_compare_function = ndl_ww_lex_compare;
5005: break;
5006: default:
5007: error("nd_gr : unsupported order");
5008: }
5009: break;
5010: case 1:
5011: /* block order */
5012: /* XXX */
5013: nd_dcomp = -1;
5014: nd_isrlex = 0;
5015: ndl_compare_function = ndl_block_compare;
5016: break;
5017: case 2:
5018: /* matrix order */
5019: /* XXX */
5020: nd_dcomp = -1;
5021: nd_isrlex = 0;
5022: nd_matrix_len = ord->ord.matrix.row;
5023: nd_matrix = ord->ord.matrix.matrix;
5024: ndl_compare_function = ndl_matrix_compare;
5025: break;
5026: case 3:
5027: /* composite order */
5028: nd_dcomp = -1;
5029: nd_isrlex = 0;
5030: nd_worb_len = ord->ord.composite.length;
5031: nd_worb = ord->ord.composite.w_or_b;
5032: ndl_compare_function = ndl_composite_compare;
5033: break;
5034:
5035: /* module order */
5036: case 256:
1.160 noro 5037: nd_ispot = ord->ispot;
1.174 noro 5038: nd_pot_nelim = ord->pot_nelim;
1.157 noro 5039: nd_dcomp = -1;
5040: switch ( ord->ord.simple ) {
5041: case 0:
1.167 noro 5042: nd_isrlex = 1;
1.157 noro 5043: ndl_compare_function = ndl_module_grlex_compare;
5044: break;
5045: case 1:
1.167 noro 5046: nd_isrlex = 0;
1.157 noro 5047: ndl_compare_function = ndl_module_glex_compare;
5048: break;
5049: case 2:
1.167 noro 5050: nd_isrlex = 0;
1.157 noro 5051: ndl_compare_function = ndl_module_lex_compare;
5052: break;
5053: default:
5054: error("nd_gr : unsupported order");
5055: }
5056: break;
5057: case 257:
5058: /* block order */
1.174 noro 5059: nd_ispot = ord->ispot;
5060: nd_pot_nelim = ord->pot_nelim;
5061: nd_dcomp = -1;
5062: nd_isrlex = 0;
1.157 noro 5063: ndl_compare_function = ndl_module_block_compare;
5064: break;
5065: case 258:
5066: /* matrix order */
1.174 noro 5067: nd_ispot = ord->ispot;
5068: nd_pot_nelim = ord->pot_nelim;
5069: nd_dcomp = -1;
5070: nd_isrlex = 0;
1.157 noro 5071: nd_matrix_len = ord->ord.matrix.row;
5072: nd_matrix = ord->ord.matrix.matrix;
5073: ndl_compare_function = ndl_module_matrix_compare;
5074: break;
5075: case 259:
5076: /* composite order */
1.174 noro 5077: nd_ispot = ord->ispot;
5078: nd_pot_nelim = ord->pot_nelim;
5079: nd_dcomp = -1;
5080: nd_isrlex = 0;
1.157 noro 5081: nd_worb_len = ord->ord.composite.length;
5082: nd_worb = ord->ord.composite.w_or_b;
5083: ndl_compare_function = ndl_module_composite_compare;
5084: break;
5085: }
5086: nd_ord = ord;
1.32 noro 5087: }
5088:
1.43 noro 5089: BlockMask nd_create_blockmask(struct order_spec *ord)
5090: {
1.157 noro 5091: int n,i,j,s,l;
5092: UINT *t;
5093: BlockMask bm;
5094:
5095: /* we only create mask table for block order */
1.164 noro 5096: if ( ord->id != 1 && ord->id != 257 )
1.157 noro 5097: return 0;
5098: n = ord->ord.block.length;
5099: bm = (BlockMask)MALLOC(sizeof(struct oBlockMask));
5100: bm->n = n;
5101: bm->order_pair = ord->ord.block.order_pair;
5102: bm->mask = (UINT **)MALLOC(n*sizeof(UINT *));
5103: for ( i = 0, s = 0; i < n; i++ ) {
5104: bm->mask[i] = t = (UINT *)MALLOC_ATOMIC(nd_wpd*sizeof(UINT));
5105: for ( j = 0; j < nd_wpd; j++ ) t[j] = 0;
5106: l = bm->order_pair[i].length;
5107: for ( j = 0; j < l; j++, s++ ) PUT_EXP(t,s,nd_mask0);
5108: }
5109: return bm;
1.57 noro 5110: }
5111:
5112: EPOS nd_create_epos(struct order_spec *ord)
5113: {
1.157 noro 5114: int i,j,l,s,ord_l,ord_o;
5115: EPOS epos;
5116: struct order_pair *op;
5117:
5118: epos = (EPOS)MALLOC_ATOMIC(nd_nvar*sizeof(struct oEPOS));
5119: switch ( ord->id ) {
1.164 noro 5120: case 0: case 256:
1.157 noro 5121: if ( nd_isrlex ) {
5122: for ( i = 0; i < nd_nvar; i++ ) {
5123: epos[i].i = nd_exporigin + (nd_nvar-1-i)/nd_epw;
5124: epos[i].s = (nd_epw-((nd_nvar-1-i)%nd_epw)-1)*nd_bpe;
5125: }
5126: } else {
5127: for ( i = 0; i < nd_nvar; i++ ) {
5128: epos[i].i = nd_exporigin + i/nd_epw;
5129: epos[i].s = (nd_epw-(i%nd_epw)-1)*nd_bpe;
5130: }
5131: }
5132: break;
1.164 noro 5133: case 1: case 257:
1.157 noro 5134: /* block order */
5135: l = ord->ord.block.length;
5136: op = ord->ord.block.order_pair;
5137: for ( j = 0, s = 0; j < l; j++ ) {
5138: ord_o = op[j].order;
5139: ord_l = op[j].length;
5140: if ( !ord_o )
5141: for ( i = 0; i < ord_l; i++ ) {
5142: epos[s+i].i = nd_exporigin + (s+ord_l-i-1)/nd_epw;
5143: epos[s+i].s = (nd_epw-((s+ord_l-i-1)%nd_epw)-1)*nd_bpe;
5144: }
5145: else
5146: for ( i = 0; i < ord_l; i++ ) {
5147: epos[s+i].i = nd_exporigin + (s+i)/nd_epw;
5148: epos[s+i].s = (nd_epw-((s+i)%nd_epw)-1)*nd_bpe;
5149: }
5150: s += ord_l;
5151: }
5152: break;
5153: case 2:
5154: /* matrix order */
5155: case 3:
5156: /* composite order */
1.167 noro 5157: default:
1.157 noro 5158: for ( i = 0; i < nd_nvar; i++ ) {
5159: epos[i].i = nd_exporigin + i/nd_epw;
5160: epos[i].s = (nd_epw-(i%nd_epw)-1)*nd_bpe;
5161: }
5162: break;
5163: }
5164: return epos;
1.43 noro 5165: }
1.59 noro 5166:
5167: /* external interface */
5168:
1.191 noro 5169: void nd_nf_p(Obj f,LIST g,LIST v,int m,struct order_spec *ord,Obj *rp)
1.59 noro 5170: {
1.157 noro 5171: NODE t,in0,in;
1.191 noro 5172: ND ndf,nf;
5173: NDV ndvf;
1.157 noro 5174: VL vv,tv;
1.191 noro 5175: int stat,nvar,max,mrank;
1.157 noro 5176: union oNDC dn;
5177: Q cont;
5178: P pp;
1.191 noro 5179: LIST ppl;
1.157 noro 5180:
5181: if ( !f ) {
5182: *rp = 0;
5183: return;
5184: }
5185: pltovl(v,&vv);
5186: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
5187:
1.191 noro 5188: /* max=65536 implies nd_bpe=32 */
5189: max = 65536;
1.157 noro 5190:
1.191 noro 5191: nd_module = 0;
5192: /* nd_module will be set if ord is a module ordering */
1.157 noro 5193: nd_init_ord(ord);
5194: nd_setup_parameters(nvar,max);
1.191 noro 5195: if ( nd_module && OID(f) != O_LIST )
5196: error("nd_nf_p : the first argument must be a list");
5197: if ( nd_module ) mrank = length(BDY((LIST)f));
1.157 noro 5198: /* conversion to ndv */
5199: for ( in0 = 0, t = BDY(g); t; t = NEXT(t) ) {
5200: NEXTNODE(in0,in);
1.191 noro 5201: if ( nd_module ) {
5202: if ( !BDY(t) || OID(BDY(t)) != O_LIST
5203: || length(BDY((LIST)BDY(t))) != mrank )
5204: error("nd_nf_p : inconsistent basis element");
5205: if ( !m ) pltozpl((LIST)BDY(t),&cont,&ppl);
5206: else ppl = (LIST)BDY(t);
5207: BDY(in) = (pointer)pltondv(CO,vv,ppl);
5208: } else {
5209: if ( !m ) ptozp((P)BDY(t),1,&cont,&pp);
5210: else pp = (P)BDY(t);
5211: BDY(in) = (pointer)ptondv(CO,vv,pp);
5212: }
1.157 noro 5213: if ( m ) ndv_mod(m,(NDV)BDY(in));
5214: }
1.191 noro 5215: if ( in0 ) NEXT(in) = 0;
5216:
5217: if ( nd_module ) ndvf = pltondv(CO,vv,(LIST)f);
5218: else ndvf = ptondv(CO,vv,(P)f);
5219: if ( m ) ndv_mod(m,ndvf);
5220: ndf = (pointer)ndvtond(m,ndvf);
1.157 noro 5221:
5222: /* dont sort, dont removecont */
5223: ndv_setup(m,0,in0,1,1);
5224: nd_scale=2;
1.191 noro 5225: stat = nd_nf(m,0,ndf,nd_ps,1,0,&nf);
5226: if ( !stat )
5227: error("nd_nf_p : exponent too large");
5228: if ( nd_module ) *rp = (Obj)ndvtopl(m,CO,vv,ndtondv(m,nf),mrank);
5229: else *rp = (Obj)ndvtop(m,CO,vv,ndtondv(m,nf));
1.63 noro 5230: }
5231:
5232: int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r)
5233: {
1.157 noro 5234: NM m;
5235: UINT *t,*s;
5236: int i;
5237:
5238: for ( i = 0; i < n; i++ ) r[i] = 0;
5239: for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) {
5240: t = DL(m);
5241: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
5242: r[i] = CM(m);
5243: }
5244: for ( i = 0; !r[i]; i++ );
5245: return i;
1.63 noro 5246: }
5247:
1.113 noro 5248: int nd_to_vect_q(UINT *s0,int n,ND d,Q *r)
1.74 noro 5249: {
1.157 noro 5250: NM m;
5251: UINT *t,*s;
5252: int i;
5253:
5254: for ( i = 0; i < n; i++ ) r[i] = 0;
5255: for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) {
5256: t = DL(m);
5257: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
5258: r[i] = CQ(m);
5259: }
5260: for ( i = 0; !r[i]; i++ );
5261: return i;
1.74 noro 5262: }
5263:
1.129 noro 5264: Q *nm_ind_pair_to_vect(int mod,UINT *s0,int n,NM_ind_pair pair)
5265: {
1.157 noro 5266: NM m;
5267: NMV mr;
5268: UINT *d,*t,*s;
5269: NDV p;
5270: int i,j,len;
5271: Q *r;
5272:
5273: m = pair->mul;
5274: d = DL(m);
5275: p = nd_ps[pair->index];
5276: len = LEN(p);
5277: r = (Q *)CALLOC(n,sizeof(Q));
5278: t = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
5279: for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) {
5280: ndl_add(d,DL(mr),t);
5281: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
5282: r[i] = CQ(mr);
5283: }
5284: return r;
1.129 noro 5285: }
5286:
1.67 noro 5287: IndArray nm_ind_pair_to_vect_compress(int mod,UINT *s0,int n,NM_ind_pair pair)
1.64 noro 5288: {
1.157 noro 5289: NM m;
5290: NMV mr;
5291: UINT *d,*t,*s;
5292: NDV p;
5293: unsigned char *ivc;
5294: unsigned short *ivs;
5295: UINT *v,*ivi,*s0v;
5296: int i,j,len,prev,diff,cdiff;
5297: IndArray r;
1.198 noro 5298: struct oEGT eg0,eg1;
1.157 noro 5299:
5300: m = pair->mul;
5301: d = DL(m);
5302: p = nd_ps[pair->index];
5303: len = LEN(p);
5304: t = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
5305: v = (unsigned int *)ALLOCA(len*sizeof(unsigned int));
1.198 noro 5306: get_eg(&eg0);
1.157 noro 5307: for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) {
5308: ndl_add(d,DL(mr),t);
5309: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
5310: v[j] = i;
5311: }
1.198 noro 5312: get_eg(&eg1); add_eg(&eg_search,&eg0,&eg1);
1.157 noro 5313: r = (IndArray)MALLOC(sizeof(struct oIndArray));
5314: r->head = v[0];
5315: diff = 0;
5316: for ( i = 1; i < len; i++ ) {
5317: cdiff = v[i]-v[i-1]; diff = MAX(cdiff,diff);
5318: }
5319: if ( diff < 256 ) {
5320: r->width = 1;
5321: ivc = (unsigned char *)MALLOC_ATOMIC(len*sizeof(unsigned char));
5322: r->index.c = ivc;
5323: for ( i = 1, ivc[0] = 0; i < len; i++ ) ivc[i] = v[i]-v[i-1];
5324: } else if ( diff < 65536 ) {
5325: r->width = 2;
5326: ivs = (unsigned short *)MALLOC_ATOMIC(len*sizeof(unsigned short));
5327: r->index.s = ivs;
5328: for ( i = 1, ivs[0] = 0; i < len; i++ ) ivs[i] = v[i]-v[i-1];
5329: } else {
5330: r->width = 4;
5331: ivi = (unsigned int *)MALLOC_ATOMIC(len*sizeof(unsigned int));
5332: r->index.i = ivi;
5333: for ( i = 1, ivi[0] = 0; i < len; i++ ) ivi[i] = v[i]-v[i-1];
5334: }
5335: return r;
1.64 noro 5336: }
5337:
1.135 noro 5338: int compress_array(Q *svect,Q *cvect,int n)
5339: {
1.157 noro 5340: int i,j;
1.135 noro 5341:
1.157 noro 5342: for ( i = j = 0; i < n; i++ )
5343: if ( svect[i] ) cvect[j++] = svect[i];
5344: return j;
1.135 noro 5345: }
5346:
5347: void expand_array(Q *svect,Q *cvect,int n)
5348: {
1.157 noro 5349: int i,j;
1.135 noro 5350:
1.157 noro 5351: for ( i = j = 0; j < n; i++ )
5352: if ( svect[i] ) svect[i] = cvect[j++];
1.135 noro 5353: }
5354:
1.133 noro 5355: int ndv_reduce_vect_q(Q *svect,int trace,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.107 noro 5356: {
1.157 noro 5357: int i,j,k,len,pos,prev,nz;
5358: Q cs,mcs,c1,c2,cr,gcd,t;
5359: IndArray ivect;
5360: unsigned char *ivc;
5361: unsigned short *ivs;
5362: unsigned int *ivi;
5363: NDV redv;
5364: NMV mr;
5365: NODE rp;
5366: int maxrs;
5367: double hmag;
5368: Q *cvect;
5369:
5370: maxrs = 0;
5371: for ( i = 0; i < col && !svect[i]; i++ );
5372: if ( i == col ) return maxrs;
5373: hmag = p_mag((P)svect[i])*nd_scale;
5374: cvect = (Q *)ALLOCA(col*sizeof(Q));
5375: for ( i = 0; i < nred; i++ ) {
5376: ivect = imat[i];
5377: k = ivect->head;
5378: if ( svect[k] ) {
5379: maxrs = MAX(maxrs,rp0[i]->sugar);
5380: redv = trace?nd_ps_trace[rp0[i]->index]:nd_ps[rp0[i]->index];
5381: len = LEN(redv); mr = BDY(redv);
5382: igcd_cofactor(svect[k],CQ(mr),&gcd,&cs,&cr);
5383: chsgnq(cs,&mcs);
5384: if ( !UNIQ(cr) ) {
5385: for ( j = 0; j < col; j++ ) {
5386: mulq(svect[j],cr,&c1); svect[j] = c1;
5387: }
5388: }
5389: svect[k] = 0; prev = k;
5390: switch ( ivect->width ) {
5391: case 1:
5392: ivc = ivect->index.c;
5393: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
5394: pos = prev+ivc[j]; prev = pos;
5395: mulq(CQ(mr),mcs,&c2); addq(svect[pos],c2,&t); svect[pos] = t;
5396: }
5397: break;
5398: case 2:
5399: ivs = ivect->index.s;
5400: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
5401: pos = prev+ivs[j]; prev = pos;
5402: mulq(CQ(mr),mcs,&c2); addq(svect[pos],c2,&t); svect[pos] = t;
5403: }
5404: break;
5405: case 4:
5406: ivi = ivect->index.i;
5407: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
5408: pos = prev+ivi[j]; prev = pos;
5409: mulq(CQ(mr),mcs,&c2); addq(svect[pos],c2,&t); svect[pos] = t;
5410: }
5411: break;
5412: }
5413: for ( j = k+1; j < col && !svect[j]; j++ );
5414: if ( j == col ) break;
5415: if ( hmag && ((double)p_mag((P)svect[j]) > hmag) ) {
5416: nz = compress_array(svect,cvect,col);
5417: removecont_array((P *)cvect,nz,1);
5418: expand_array(svect,cvect,nz);
5419: hmag = ((double)p_mag((P)svect[j]))*nd_scale;
5420: }
5421: }
5422: }
5423: nz = compress_array(svect,cvect,col);
5424: removecont_array((P *)cvect,nz,1);
5425: expand_array(svect,cvect,nz);
5426: if ( DP_Print ) {
5427: fprintf(asir_out,"-"); fflush(asir_out);
5428: }
5429: return maxrs;
1.107 noro 5430: }
5431:
1.76 noro 5432: int ndv_reduce_vect(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.65 noro 5433: {
1.157 noro 5434: int i,j,k,len,pos,prev;
5435: UINT c,c1,c2,c3,up,lo,dmy;
5436: IndArray ivect;
5437: unsigned char *ivc;
5438: unsigned short *ivs;
5439: unsigned int *ivi;
5440: NDV redv;
5441: NMV mr;
5442: NODE rp;
5443: int maxrs;
5444:
5445: maxrs = 0;
5446: for ( i = 0; i < nred; i++ ) {
5447: ivect = imat[i];
5448: k = ivect->head; svect[k] %= m;
5449: if ( c = svect[k] ) {
5450: maxrs = MAX(maxrs,rp0[i]->sugar);
5451: c = m-c; redv = nd_ps[rp0[i]->index];
5452: len = LEN(redv); mr = BDY(redv);
5453: svect[k] = 0; prev = k;
5454: switch ( ivect->width ) {
5455: case 1:
5456: ivc = ivect->index.c;
5457: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
5458: pos = prev+ivc[j]; c1 = CM(mr); c2 = svect[pos];
5459: prev = pos;
5460: DMA(c1,c,c2,up,lo);
5461: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
5462: } else svect[pos] = lo;
5463: }
5464: break;
5465: case 2:
5466: ivs = ivect->index.s;
5467: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
5468: pos = prev+ivs[j]; c1 = CM(mr); c2 = svect[pos];
5469: prev = pos;
5470: DMA(c1,c,c2,up,lo);
5471: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
5472: } else svect[pos] = lo;
5473: }
5474: break;
5475: case 4:
5476: ivi = ivect->index.i;
5477: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
5478: pos = prev+ivi[j]; c1 = CM(mr); c2 = svect[pos];
5479: prev = pos;
5480: DMA(c1,c,c2,up,lo);
5481: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
5482: } else svect[pos] = lo;
5483: }
5484: break;
5485: }
5486: }
5487: }
5488: for ( i = 0; i < col; i++ )
5489: if ( svect[i] >= (UINT)m ) svect[i] %= m;
5490: return maxrs;
1.65 noro 5491: }
5492:
1.76 noro 5493: int ndv_reduce_vect_sf(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.72 noro 5494: {
1.157 noro 5495: int i,j,k,len,pos,prev;
5496: UINT c,c1,c2,c3,up,lo,dmy;
5497: IndArray ivect;
5498: unsigned char *ivc;
5499: unsigned short *ivs;
5500: unsigned int *ivi;
5501: NDV redv;
5502: NMV mr;
5503: NODE rp;
5504: int maxrs;
5505:
5506: maxrs = 0;
5507: for ( i = 0; i < nred; i++ ) {
5508: ivect = imat[i];
5509: k = ivect->head; svect[k] %= m;
5510: if ( c = svect[k] ) {
5511: maxrs = MAX(maxrs,rp0[i]->sugar);
5512: c = _chsgnsf(c); redv = nd_ps[rp0[i]->index];
5513: len = LEN(redv); mr = BDY(redv);
5514: svect[k] = 0; prev = k;
5515: switch ( ivect->width ) {
5516: case 1:
5517: ivc = ivect->index.c;
5518: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
5519: pos = prev+ivc[j]; prev = pos;
5520: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
5521: }
5522: break;
5523: case 2:
5524: ivs = ivect->index.s;
5525: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
5526: pos = prev+ivs[j]; prev = pos;
5527: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
5528: }
5529: break;
5530: case 4:
5531: ivi = ivect->index.i;
5532: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
5533: pos = prev+ivi[j]; prev = pos;
5534: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
5535: }
5536: break;
5537: }
5538: }
5539: }
5540: return maxrs;
1.72 noro 5541: }
5542:
1.65 noro 5543: NDV vect_to_ndv(UINT *vect,int spcol,int col,int *rhead,UINT *s0vect)
5544: {
1.157 noro 5545: int j,k,len;
5546: UINT *p;
5547: UINT c;
5548: NDV r;
5549: NMV mr0,mr;
5550:
5551: for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++;
5552: if ( !len ) return 0;
5553: else {
1.200 noro 5554: mr0 = (NMV)MALLOC_ATOMIC_IGNORE_OFF_PAGE(nmv_adv*len);
1.103 noro 5555: #if 0
1.157 noro 5556: ndv_alloc += nmv_adv*len;
1.103 noro 5557: #endif
1.157 noro 5558: mr = mr0;
5559: p = s0vect;
5560: for ( j = k = 0; j < col; j++, p += nd_wpd )
5561: if ( !rhead[j] ) {
5562: if ( c = vect[k++] ) {
5563: ndl_copy(p,DL(mr)); CM(mr) = c; NMV_ADV(mr);
5564: }
5565: }
5566: MKNDV(nd_nvar,mr0,len,r);
5567: return r;
5568: }
1.65 noro 5569: }
5570:
1.129 noro 5571: /* for preprocessed vector */
5572:
1.113 noro 5573: NDV vect_to_ndv_q(Q *vect,int spcol,int col,int *rhead,UINT *s0vect)
1.107 noro 5574: {
1.157 noro 5575: int j,k,len;
5576: UINT *p;
5577: Q c;
5578: NDV r;
5579: NMV mr0,mr;
5580:
5581: for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++;
5582: if ( !len ) return 0;
5583: else {
1.200 noro 5584: mr0 = (NMV)MALLOC(nmv_adv*len);
1.107 noro 5585: #if 0
1.157 noro 5586: ndv_alloc += nmv_adv*len;
1.107 noro 5587: #endif
1.157 noro 5588: mr = mr0;
5589: p = s0vect;
5590: for ( j = k = 0; j < col; j++, p += nd_wpd )
5591: if ( !rhead[j] ) {
5592: if ( c = vect[k++] ) {
5593: if ( DN(c) )
5594: error("afo");
5595: ndl_copy(p,DL(mr)); CQ(mr) = c; NMV_ADV(mr);
5596: }
5597: }
5598: MKNDV(nd_nvar,mr0,len,r);
5599: return r;
5600: }
1.107 noro 5601: }
5602:
1.129 noro 5603: /* for plain vector */
5604:
5605: NDV plain_vect_to_ndv_q(Q *vect,int col,UINT *s0vect)
5606: {
1.157 noro 5607: int j,k,len;
5608: UINT *p;
5609: Q c;
5610: NDV r;
5611: NMV mr0,mr;
5612:
5613: for ( j = 0, len = 0; j < col; j++ ) if ( vect[j] ) len++;
5614: if ( !len ) return 0;
5615: else {
1.200 noro 5616: mr0 = (NMV)MALLOC(nmv_adv*len);
1.129 noro 5617: #if 0
1.157 noro 5618: ndv_alloc += nmv_adv*len;
1.129 noro 5619: #endif
1.157 noro 5620: mr = mr0;
5621: p = s0vect;
5622: for ( j = k = 0; j < col; j++, p += nd_wpd, k++ )
5623: if ( c = vect[k] ) {
5624: if ( DN(c) )
5625: error("afo");
5626: ndl_copy(p,DL(mr)); CQ(mr) = c; NMV_ADV(mr);
5627: }
5628: MKNDV(nd_nvar,mr0,len,r);
5629: return r;
5630: }
1.129 noro 5631: }
5632:
1.133 noro 5633: int nd_sp_f4(int m,int trace,ND_pairs l,PGeoBucket bucket)
1.65 noro 5634: {
1.157 noro 5635: ND_pairs t;
5636: NODE sp0,sp;
5637: int stat;
5638: ND spol;
5639:
5640: for ( t = l; t; t = NEXT(t) ) {
5641: stat = nd_sp(m,trace,t,&spol);
5642: if ( !stat ) return 0;
5643: if ( spol ) {
5644: add_pbucket_symbolic(bucket,spol);
5645: }
5646: }
5647: return 1;
1.65 noro 5648: }
5649:
1.133 noro 5650: int nd_symbolic_preproc(PGeoBucket bucket,int trace,UINT **s0vect,NODE *r)
1.65 noro 5651: {
1.157 noro 5652: NODE rp0,rp;
5653: NM mul,head,s0,s;
5654: int index,col,i,sugar;
5655: RHist h;
5656: UINT *s0v,*p;
5657: NM_ind_pair pair;
5658: ND red;
5659: NDV *ps;
5660:
5661: s0 = 0; rp0 = 0; col = 0;
5662: ps = trace?nd_ps_trace:nd_ps;
5663: while ( 1 ) {
5664: head = remove_head_pbucket_symbolic(bucket);
5665: if ( !head ) break;
5666: if ( !s0 ) s0 = head;
5667: else NEXT(s) = head;
5668: s = head;
5669: index = ndl_find_reducer(DL(head));
5670: if ( index >= 0 ) {
5671: h = nd_psh[index];
5672: NEWNM(mul);
5673: ndl_sub(DL(head),DL(h),DL(mul));
5674: if ( ndl_check_bound2(index,DL(mul)) ) return 0;
5675: sugar = TD(DL(mul))+SG(ps[index]);
5676: MKNM_ind_pair(pair,mul,index,sugar);
5677: red = ndv_mul_nm_symbolic(mul,ps[index]);
5678: add_pbucket_symbolic(bucket,nd_remove_head(red));
5679: NEXTNODE(rp0,rp); BDY(rp) = (pointer)pair;
5680: }
5681: col++;
5682: }
5683: if ( rp0 ) NEXT(rp) = 0;
5684: NEXT(s) = 0;
5685: s0v = (UINT *)MALLOC_ATOMIC(col*nd_wpd*sizeof(UINT));
5686: for ( i = 0, p = s0v, s = s0; i < col;
5687: i++, p += nd_wpd, s = NEXT(s) ) ndl_copy(DL(s),p);
5688: *s0vect = s0v;
5689: *r = rp0;
5690: return col;
1.65 noro 5691: }
5692:
1.198 noro 5693:
1.167 noro 5694: NODE nd_f4(int m,int **indp)
1.69 noro 5695: {
1.157 noro 5696: int i,nh,stat,index;
5697: NODE r,g;
5698: ND_pairs d,l,t;
5699: ND spol,red;
5700: NDV nf,redv;
5701: NM s0,s;
5702: NODE rp0,srp0,nflist;
5703: int nsp,nred,col,rank,len,k,j,a;
5704: UINT c;
5705: UINT **spmat;
5706: UINT *s0vect,*svect,*p,*v;
5707: int *colstat;
5708: IndArray *imat;
5709: int *rhead;
5710: int spcol,sprow;
5711: int sugar;
5712: PGeoBucket bucket;
5713: struct oEGT eg0,eg1,eg_f4;
1.69 noro 5714:
1.103 noro 5715: #if 0
1.157 noro 5716: ndv_alloc = 0;
1.103 noro 5717: #endif
1.157 noro 5718: g = 0; d = 0;
5719: for ( i = 0; i < nd_psn; i++ ) {
1.168 noro 5720: d = update_pairs(d,g,i,0);
1.157 noro 5721: g = update_base(g,i);
5722: }
5723: while ( d ) {
5724: get_eg(&eg0);
5725: l = nd_minsugarp(d,&d);
5726: sugar = SG(l);
5727: bucket = create_pbucket();
5728: stat = nd_sp_f4(m,0,l,bucket);
5729: if ( !stat ) {
5730: for ( t = l; NEXT(t); t = NEXT(t) );
5731: NEXT(t) = d; d = l;
5732: d = nd_reconstruct(0,d);
5733: continue;
5734: }
5735: if ( bucket->m < 0 ) continue;
5736: col = nd_symbolic_preproc(bucket,0,&s0vect,&rp0);
5737: if ( !col ) {
5738: for ( t = l; NEXT(t); t = NEXT(t) );
5739: NEXT(t) = d; d = l;
5740: d = nd_reconstruct(0,d);
5741: continue;
5742: }
5743: get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1);
5744: if ( DP_Print )
5745: fprintf(asir_out,"sugar=%d,symb=%fsec,",
5746: sugar,eg_f4.exectime+eg_f4.gctime);
5747: if ( 1 )
5748: nflist = nd_f4_red(m,l,0,s0vect,col,rp0,0);
5749: else
5750: nflist = nd_f4_red_dist(m,l,s0vect,col,rp0,0);
5751: /* adding new bases */
5752: for ( r = nflist; r; r = NEXT(r) ) {
5753: nf = (NDV)BDY(r);
5754: ndv_removecont(m,nf);
5755: if ( !m && nd_nalg ) {
5756: ND nf1;
5757:
5758: nf1 = ndvtond(m,nf);
5759: nd_monic(0,&nf1);
5760: nd_removecont(m,nf1);
5761: nf = ndtondv(m,nf1);
5762: }
5763: nh = ndv_newps(m,nf,0);
1.168 noro 5764: d = update_pairs(d,g,nh,0);
1.157 noro 5765: g = update_base(g,nh);
5766: }
5767: }
1.103 noro 5768: #if 0
1.157 noro 5769: fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc);
1.103 noro 5770: #endif
1.167 noro 5771: conv_ilist(0,0,g,indp);
1.157 noro 5772: return g;
1.69 noro 5773: }
1.74 noro 5774:
1.167 noro 5775: NODE nd_f4_trace(int m,int **indp)
1.133 noro 5776: {
1.157 noro 5777: int i,nh,stat,index;
5778: NODE r,g;
5779: ND_pairs d,l,l0,t;
5780: ND spol,red;
5781: NDV nf,redv,nfqv,nfv;
5782: NM s0,s;
5783: NODE rp0,srp0,nflist;
5784: int nsp,nred,col,rank,len,k,j,a;
5785: UINT c;
5786: UINT **spmat;
5787: UINT *s0vect,*svect,*p,*v;
5788: int *colstat;
5789: IndArray *imat;
5790: int *rhead;
5791: int spcol,sprow;
5792: int sugar;
5793: PGeoBucket bucket;
5794: struct oEGT eg0,eg1,eg_f4;
5795:
5796: g = 0; d = 0;
5797: for ( i = 0; i < nd_psn; i++ ) {
1.168 noro 5798: d = update_pairs(d,g,i,0);
1.157 noro 5799: g = update_base(g,i);
5800: }
5801: while ( d ) {
5802: get_eg(&eg0);
5803: l = nd_minsugarp(d,&d);
5804: sugar = SG(l);
5805: bucket = create_pbucket();
5806: stat = nd_sp_f4(m,0,l,bucket);
5807: if ( !stat ) {
5808: for ( t = l; NEXT(t); t = NEXT(t) );
5809: NEXT(t) = d; d = l;
5810: d = nd_reconstruct(1,d);
5811: continue;
5812: }
5813: if ( bucket->m < 0 ) continue;
5814: col = nd_symbolic_preproc(bucket,0,&s0vect,&rp0);
5815: if ( !col ) {
5816: for ( t = l; NEXT(t); t = NEXT(t) );
5817: NEXT(t) = d; d = l;
5818: d = nd_reconstruct(1,d);
5819: continue;
5820: }
5821: get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1);
5822: if ( DP_Print )
5823: fprintf(asir_out,"sugar=%d,symb=%fsec,",
5824: sugar,eg_f4.exectime+eg_f4.gctime);
5825: nflist = nd_f4_red(m,l,0,s0vect,col,rp0,&l0);
5826: if ( !l0 ) continue;
5827: l = l0;
5828:
5829: /* over Q */
5830: bucket = create_pbucket();
5831: stat = nd_sp_f4(0,1,l,bucket);
5832: if ( !stat ) {
5833: for ( t = l; NEXT(t); t = NEXT(t) );
5834: NEXT(t) = d; d = l;
5835: d = nd_reconstruct(1,d);
5836: continue;
5837: }
5838: if ( bucket->m < 0 ) continue;
5839: col = nd_symbolic_preproc(bucket,1,&s0vect,&rp0);
5840: if ( !col ) {
5841: for ( t = l; NEXT(t); t = NEXT(t) );
5842: NEXT(t) = d; d = l;
5843: d = nd_reconstruct(1,d);
5844: continue;
5845: }
5846: nflist = nd_f4_red(0,l,1,s0vect,col,rp0,0);
5847: /* adding new bases */
5848: for ( r = nflist; r; r = NEXT(r) ) {
5849: nfqv = (NDV)BDY(r);
5850: ndv_removecont(0,nfqv);
5851: if ( !rem(NM(HCQ(nfqv)),m) ) return 0;
5852: if ( nd_nalg ) {
5853: ND nf1;
5854:
5855: nf1 = ndvtond(m,nfqv);
5856: nd_monic(0,&nf1);
5857: nd_removecont(0,nf1);
5858: nfqv = ndtondv(0,nf1); nd_free(nf1);
5859: }
5860: nfv = ndv_dup(0,nfqv);
5861: ndv_mod(m,nfv);
5862: ndv_removecont(m,nfv);
5863: nh = ndv_newps(0,nfv,nfqv);
1.168 noro 5864: d = update_pairs(d,g,nh,0);
1.157 noro 5865: g = update_base(g,nh);
5866: }
5867: }
1.133 noro 5868: #if 0
1.157 noro 5869: fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc);
1.133 noro 5870: #endif
1.167 noro 5871: conv_ilist(0,1,g,indp);
1.157 noro 5872: return g;
1.133 noro 5873: }
5874:
1.176 noro 5875: NODE nd_f4_pseudo_trace(int m,int **indp)
5876: {
5877: int i,nh,stat,index;
5878: NODE r,g;
5879: ND_pairs d,l,l0,t;
5880: ND spol,red;
5881: NDV nf,redv,nfqv,nfv;
5882: NM s0,s;
5883: NODE rp0,srp0,nflist;
5884: int nsp,nred,col,rank,len,k,j,a;
5885: UINT c;
5886: UINT **spmat;
5887: UINT *s0vect,*svect,*p,*v;
5888: int *colstat;
5889: IndArray *imat;
5890: int *rhead;
5891: int spcol,sprow;
5892: int sugar;
5893: PGeoBucket bucket;
5894: struct oEGT eg0,eg1,eg_f4;
5895:
5896: g = 0; d = 0;
5897: for ( i = 0; i < nd_psn; i++ ) {
5898: d = update_pairs(d,g,i,0);
5899: g = update_base(g,i);
5900: }
5901: while ( d ) {
5902: get_eg(&eg0);
5903: l = nd_minsugarp(d,&d);
5904: sugar = SG(l);
5905: bucket = create_pbucket();
5906: stat = nd_sp_f4(m,0,l,bucket);
5907: if ( !stat ) {
5908: for ( t = l; NEXT(t); t = NEXT(t) );
5909: NEXT(t) = d; d = l;
5910: d = nd_reconstruct(1,d);
5911: continue;
5912: }
5913: if ( bucket->m < 0 ) continue;
5914: col = nd_symbolic_preproc(bucket,0,&s0vect,&rp0);
5915: if ( !col ) {
5916: for ( t = l; NEXT(t); t = NEXT(t) );
5917: NEXT(t) = d; d = l;
5918: d = nd_reconstruct(1,d);
5919: continue;
5920: }
5921: get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1);
5922: if ( DP_Print )
5923: fprintf(asir_out,"sugar=%d,symb=%fsec,",
5924: sugar,eg_f4.exectime+eg_f4.gctime);
5925: nflist = nd_f4_red(m,l,0,s0vect,col,rp0,&l0);
5926: if ( !l0 ) continue;
5927: l = l0;
5928:
5929: /* over Q */
5930: while ( 1 ) {
5931: bucket = create_pbucket();
5932: stat = nd_sp_f4(0,1,l,bucket);
5933: if ( !stat ) {
5934: for ( t = l; NEXT(t); t = NEXT(t) );
5935: NEXT(t) = d; d = l;
5936: d = nd_reconstruct(1,d);
5937: continue;
5938: }
5939: if ( bucket->m < 0 ) continue;
5940: col = nd_symbolic_preproc(bucket,1,&s0vect,&rp0);
5941: if ( !col ) {
5942: for ( t = l; NEXT(t); t = NEXT(t) );
5943: NEXT(t) = d; d = l;
5944: d = nd_reconstruct(1,d);
5945: continue;
5946: }
5947: nflist = nd_f4_red(0,l,1,s0vect,col,rp0,0);
5948: }
5949:
5950: /* adding new bases */
5951: for ( r = nflist; r; r = NEXT(r) ) {
5952: nfqv = (NDV)BDY(r);
5953: ndv_removecont(0,nfqv);
5954: if ( !rem(NM(HCQ(nfqv)),m) ) return 0;
5955: if ( nd_nalg ) {
5956: ND nf1;
5957:
5958: nf1 = ndvtond(m,nfqv);
5959: nd_monic(0,&nf1);
5960: nd_removecont(0,nf1);
5961: nfqv = ndtondv(0,nf1); nd_free(nf1);
5962: }
5963: nfv = ndv_dup(0,nfqv);
5964: ndv_mod(m,nfv);
5965: ndv_removecont(m,nfv);
5966: nh = ndv_newps(0,nfv,nfqv);
5967: d = update_pairs(d,g,nh,0);
5968: g = update_base(g,nh);
5969: }
5970: }
5971: #if 0
5972: fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc);
5973: #endif
5974: conv_ilist(0,1,g,indp);
5975: return g;
5976: }
5977:
1.133 noro 5978: NODE nd_f4_red(int m,ND_pairs sp0,int trace,UINT *s0vect,int col,NODE rp0,ND_pairs *nz)
1.63 noro 5979: {
1.157 noro 5980: IndArray *imat;
5981: int nsp,nred,i;
5982: int *rhead;
5983: NODE r0,rp;
5984: ND_pairs sp;
5985: NM_ind_pair *rvect;
1.198 noro 5986: init_eg(&eg_search);
1.157 noro 5987: for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ );
5988: nred = length(rp0);
5989: imat = (IndArray *)ALLOCA(nred*sizeof(IndArray));
5990: rhead = (int *)ALLOCA(col*sizeof(int));
5991: for ( i = 0; i < col; i++ ) rhead[i] = 0;
5992:
5993: /* construction of index arrays */
5994: rvect = (NM_ind_pair *)ALLOCA(nred*sizeof(NM_ind_pair));
5995: for ( rp = rp0, i = 0; rp; i++, rp = NEXT(rp) ) {
5996: rvect[i] = (NM_ind_pair)BDY(rp);
5997: imat[i] = nm_ind_pair_to_vect_compress(m,s0vect,col,rvect[i]);
5998: rhead[imat[i]->head] = 1;
5999: }
6000: if ( m )
6001: r0 = nd_f4_red_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,nz);
6002: else
6003: r0 = nd_f4_red_q_main(sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred);
1.198 noro 6004: print_eg("search",&eg_search);
1.157 noro 6005: return r0;
1.106 noro 6006: }
1.74 noro 6007:
1.106 noro 6008: NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col,
1.133 noro 6009: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred,ND_pairs *nz)
1.106 noro 6010: {
1.157 noro 6011: int spcol,sprow,a;
6012: int i,j,k,l,rank;
6013: NODE r0,r;
6014: ND_pairs sp;
6015: ND spol;
6016: int **spmat;
6017: UINT *svect,*v;
6018: int *colstat;
6019: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
6020: int maxrs;
6021: int *spsugar;
6022: ND_pairs *spactive;
6023:
6024: spcol = col-nred;
6025: get_eg(&eg0);
6026: /* elimination (1st step) */
6027: spmat = (int **)ALLOCA(nsp*sizeof(UINT *));
6028: svect = (UINT *)ALLOCA(col*sizeof(UINT));
6029: spsugar = (int *)ALLOCA(nsp*sizeof(UINT));
6030: spactive = !nz?0:(ND_pairs *)ALLOCA(nsp*sizeof(ND_pairs));
6031: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
6032: nd_sp(m,0,sp,&spol);
6033: if ( !spol ) continue;
6034: nd_to_vect(m,s0vect,col,spol,svect);
6035: if ( m == -1 )
6036: maxrs = ndv_reduce_vect_sf(m,svect,col,imat,rvect,nred);
6037: else
6038: maxrs = ndv_reduce_vect(m,svect,col,imat,rvect,nred);
6039: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
6040: if ( i < col ) {
6041: spmat[sprow] = v = (UINT *)MALLOC_ATOMIC(spcol*sizeof(UINT));
6042: for ( j = k = 0; j < col; j++ )
6043: if ( !rhead[j] ) v[k++] = svect[j];
6044: spsugar[sprow] = MAX(maxrs,SG(spol));
6045: if ( nz )
6046: spactive[sprow] = sp;
6047: sprow++;
6048: }
6049: nd_free(spol);
6050: }
6051: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
6052: if ( DP_Print ) {
6053: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
6054: fflush(asir_out);
6055: }
6056: /* free index arrays */
1.200 noro 6057: for ( i = 0; i < nred; i++ ) GCFREE(imat[i]->index.c);
1.157 noro 6058:
6059: /* elimination (2nd step) */
6060: colstat = (int *)ALLOCA(spcol*sizeof(int));
6061: if ( m == -1 )
6062: rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat);
6063: else
6064: rank = nd_gauss_elim_mod(spmat,spsugar,spactive,sprow,spcol,m,colstat);
6065: r0 = 0;
6066: for ( i = 0; i < rank; i++ ) {
6067: NEXTNODE(r0,r); BDY(r) =
6068: (pointer)vect_to_ndv(spmat[i],spcol,col,rhead,s0vect);
6069: SG((NDV)BDY(r)) = spsugar[i];
1.200 noro 6070: GCFREE(spmat[i]);
1.157 noro 6071: }
6072: if ( r0 ) NEXT(r) = 0;
6073:
1.200 noro 6074: for ( ; i < sprow; i++ ) GCFREE(spmat[i]);
1.157 noro 6075: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
6076: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
6077: if ( DP_Print ) {
6078: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
6079: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
6080: nsp,nred,sprow,spcol,rank);
6081: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
6082: }
6083: if ( nz ) {
6084: for ( i = 0; i < rank-1; i++ ) NEXT(spactive[i]) = spactive[i+1];
6085: if ( rank > 0 ) {
6086: NEXT(spactive[rank-1]) = 0;
6087: *nz = spactive[0];
6088: } else
6089: *nz = 0;
6090: }
6091: return r0;
1.74 noro 6092: }
6093:
1.133 noro 6094: #if 1
6095: NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,int trace,UINT *s0vect,int col,
1.107 noro 6096: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred)
6097: {
1.157 noro 6098: int spcol,sprow,a;
6099: int i,j,k,l,rank;
6100: NODE r0,r;
6101: ND_pairs sp;
6102: ND spol;
6103: Q **spmat;
6104: Q *svect,*v;
6105: int *colstat;
6106: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
6107: int maxrs;
6108: int *spsugar;
6109: pointer *w;
6110:
6111: spcol = col-nred;
6112: get_eg(&eg0);
6113: /* elimination (1st step) */
6114: spmat = (Q **)ALLOCA(nsp*sizeof(Q *));
6115: svect = (Q *)ALLOCA(col*sizeof(Q));
6116: spsugar = (int *)ALLOCA(nsp*sizeof(Q));
6117: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
6118: nd_sp(0,trace,sp,&spol);
6119: if ( !spol ) continue;
6120: nd_to_vect_q(s0vect,col,spol,svect);
6121: maxrs = ndv_reduce_vect_q(svect,trace,col,imat,rvect,nred);
6122: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
6123: if ( i < col ) {
6124: spmat[sprow] = v = (Q *)MALLOC(spcol*sizeof(Q));
6125: for ( j = k = 0; j < col; j++ )
6126: if ( !rhead[j] ) v[k++] = svect[j];
6127: spsugar[sprow] = MAX(maxrs,SG(spol));
6128: sprow++;
6129: }
6130: /* nd_free(spol); */
6131: }
6132: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
6133: if ( DP_Print ) {
6134: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
6135: fflush(asir_out);
6136: }
6137: /* free index arrays */
1.200 noro 6138: /* for ( i = 0; i < nred; i++ ) GCFREE(imat[i]->index.c); */
1.157 noro 6139:
6140: /* elimination (2nd step) */
6141: colstat = (int *)ALLOCA(spcol*sizeof(int));
6142: rank = nd_gauss_elim_q(spmat,spsugar,sprow,spcol,colstat);
6143: w = (pointer *)ALLOCA(rank*sizeof(pointer));
6144: for ( i = 0; i < rank; i++ ) {
6145: w[rank-i-1] = (pointer)vect_to_ndv_q(spmat[i],spcol,col,rhead,s0vect);
6146: SG((NDV)w[rank-i-1]) = spsugar[i];
1.200 noro 6147: /* GCFREE(spmat[i]); */
1.157 noro 6148: }
1.138 noro 6149: #if 0
1.157 noro 6150: qsort(w,rank,sizeof(NDV),
6151: (int (*)(const void *,const void *))ndv_compare);
1.137 noro 6152: #endif
1.157 noro 6153: r0 = 0;
6154: for ( i = 0; i < rank; i++ ) {
6155: NEXTNODE(r0,r); BDY(r) = w[i];
6156: }
6157: if ( r0 ) NEXT(r) = 0;
6158:
1.200 noro 6159: /* for ( ; i < sprow; i++ ) GCFREE(spmat[i]); */
1.157 noro 6160: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
6161: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
6162: if ( DP_Print ) {
6163: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
6164: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
6165: nsp,nred,sprow,spcol,rank);
6166: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
6167: }
6168: return r0;
1.107 noro 6169: }
1.129 noro 6170: #else
6171: void printm(Q **mat,int row,int col)
6172: {
1.157 noro 6173: int i,j;
6174: printf("[");
6175: for ( i = 0; i < row; i++ ) {
6176: for ( j = 0; j < col; j++ ) {
6177: printexpr(CO,mat[i][j]); printf(" ");
6178: }
6179: printf("]\n");
6180: }
1.129 noro 6181: }
6182:
6183: NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,UINT *s0vect,int col,
6184: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred)
6185: {
1.157 noro 6186: int row,a;
6187: int i,j,rank;
6188: NODE r0,r;
6189: ND_pairs sp;
6190: ND spol;
6191: Q **mat;
6192: int *colstat;
6193: int *sugar;
6194:
6195: row = nsp+nred;
6196: /* make the matrix */
6197: mat = (Q **)ALLOCA(row*sizeof(Q *));
6198: sugar = (int *)ALLOCA(row*sizeof(int));
6199: for ( row = a = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
6200: nd_sp(0,0,sp,&spol);
6201: if ( !spol ) continue;
6202: mat[row] = (Q *)MALLOC(col*sizeof(Q));
6203: nd_to_vect_q(s0vect,col,spol,mat[row]);
6204: sugar[row] = SG(spol);
6205: row++;
6206: }
6207: for ( i = 0; i < nred; i++, row++ ) {
6208: mat[row] = nm_ind_pair_to_vect(0,s0vect,col,rvect[i]);
6209: sugar[row] = rvect[i]->sugar;
6210: }
6211: /* elimination */
6212: colstat = (int *)ALLOCA(col*sizeof(int));
6213: rank = nd_gauss_elim_q(mat,sugar,row,col,colstat);
6214: r0 = 0;
6215: for ( i = 0; i < rank; i++ ) {
6216: for ( j = 0; j < col; j++ ) if ( mat[i][j] ) break;
6217: if ( j == col ) error("nd_f4_red_q_main : cannot happen");
6218: if ( rhead[j] ) continue;
6219: NEXTNODE(r0,r); BDY(r) =
6220: (pointer)plain_vect_to_ndv_q(mat[i],col,s0vect);
6221: SG((NDV)BDY(r)) = sugar[i];
6222: }
6223: if ( r0 ) NEXT(r) = 0;
6224: printf("\n");
6225: return r0;
1.129 noro 6226: }
6227: #endif
1.107 noro 6228:
1.74 noro 6229: FILE *nd_write,*nd_read;
6230:
6231: void nd_send_int(int a) {
1.157 noro 6232: write_int(nd_write,&a);
1.74 noro 6233: }
6234:
6235: void nd_send_intarray(int *p,int len) {
1.157 noro 6236: write_intarray(nd_write,p,len);
1.74 noro 6237: }
6238:
6239: int nd_recv_int() {
1.157 noro 6240: int a;
1.74 noro 6241:
1.157 noro 6242: read_int(nd_read,&a);
6243: return a;
1.74 noro 6244: }
6245:
6246: void nd_recv_intarray(int *p,int len) {
1.157 noro 6247: read_intarray(nd_read,p,len);
1.74 noro 6248: }
6249:
6250: void nd_send_ndv(NDV p) {
1.157 noro 6251: int len,i;
6252: NMV m;
1.74 noro 6253:
1.157 noro 6254: if ( !p ) nd_send_int(0);
6255: else {
6256: len = LEN(p);
6257: nd_send_int(len);
6258: m = BDY(p);
6259: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
6260: nd_send_int(CM(m));
6261: nd_send_intarray(DL(m),nd_wpd);
6262: }
6263: }
1.74 noro 6264: }
6265:
6266: void nd_send_nd(ND p) {
1.157 noro 6267: int len,i;
6268: NM m;
1.74 noro 6269:
1.157 noro 6270: if ( !p ) nd_send_int(0);
6271: else {
6272: len = LEN(p);
6273: nd_send_int(len);
6274: m = BDY(p);
6275: for ( i = 0; i < len; i++, m = NEXT(m) ) {
6276: nd_send_int(CM(m));
6277: nd_send_intarray(DL(m),nd_wpd);
6278: }
6279: }
1.74 noro 6280: }
1.65 noro 6281:
1.74 noro 6282: NDV nd_recv_ndv()
6283: {
1.157 noro 6284: int len,i;
6285: NMV m,m0;
6286: NDV r;
6287:
6288: len = nd_recv_int();
6289: if ( !len ) return 0;
6290: else {
1.200 noro 6291: m0 = m = (NMV)MALLOC_ATOMIC_IGNORE_OFF_PAGE(nmv_adv*len);
1.103 noro 6292: #if 0
1.157 noro 6293: ndv_alloc += len*nmv_adv;
1.103 noro 6294: #endif
1.157 noro 6295: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
6296: CM(m) = nd_recv_int();
6297: nd_recv_intarray(DL(m),nd_wpd);
6298: }
6299: MKNDV(nd_nvar,m0,len,r);
6300: return r;
6301: }
1.74 noro 6302: }
1.65 noro 6303:
1.74 noro 6304: int ox_exec_f4_red(Q proc)
6305: {
1.157 noro 6306: Obj obj;
6307: STRING fname;
6308: NODE arg;
6309: int s;
6310: extern int ox_need_conv,ox_file_io;
6311:
6312: MKSTR(fname,"nd_exec_f4_red");
6313: arg = mknode(2,proc,fname);
6314: Pox_cmo_rpc(arg,&obj);
6315: s = get_ox_server_id(QTOS(proc));
6316: nd_write = iofp[s].out;
6317: nd_read = iofp[s].in;
6318: ox_need_conv = ox_file_io = 0;
6319: return s;
1.74 noro 6320: }
6321:
1.133 noro 6322: NODE nd_f4_red_dist(int m,ND_pairs sp0,UINT *s0vect,int col,NODE rp0,ND_pairs *nz)
1.74 noro 6323: {
1.157 noro 6324: int nsp,nred;
6325: int i,rank,s;
6326: NODE rp,r0,r;
6327: ND_pairs sp;
6328: NM_ind_pair pair;
6329: NMV nmv;
6330: NM nm;
6331: NDV nf;
6332: Obj proc,dmy;
6333:
6334: ox_launch_main(0,0,&proc);
6335: s = ox_exec_f4_red((Q)proc);
6336:
6337: nd_send_int(m);
6338: nd_send_int(nd_nvar);
6339: nd_send_int(nd_bpe);
6340: nd_send_int(nd_wpd);
6341: nd_send_int(nmv_adv);
6342:
6343: saveobj(nd_write,dp_current_spec->obj); fflush(nd_write);
6344:
6345: nd_send_int(nd_psn);
6346: for ( i = 0; i < nd_psn; i++ ) nd_send_ndv(nd_ps[i]);
6347:
6348: for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ );
6349: nd_send_int(nsp);
6350: for ( i = 0, sp = sp0; i < nsp; i++, sp = NEXT(sp) ) {
6351: nd_send_int(sp->i1); nd_send_int(sp->i2);
6352: }
6353:
6354: nd_send_int(col); nd_send_intarray(s0vect,col*nd_wpd);
6355:
6356: nred = length(rp0); nd_send_int(nred);
6357: for ( i = 0, rp = rp0; i < nred; i++, rp = NEXT(rp) ) {
6358: pair = (NM_ind_pair)BDY(rp);
6359: nd_send_int(pair->index);
6360: nd_send_intarray(pair->mul->dl,nd_wpd);
6361: }
6362: fflush(nd_write);
6363: rank = nd_recv_int();
6364: fprintf(asir_out,"rank=%d\n",rank);
6365: r0 = 0;
6366: for ( i = 0; i < rank; i++ ) {
6367: nf = nd_recv_ndv();
6368: NEXTNODE(r0,r); BDY(r) = (pointer)nf;
6369: }
6370: Pox_shutdown(mknode(1,proc),&dmy);
6371: return r0;
1.74 noro 6372: }
6373:
6374: /* server side */
6375:
6376: void nd_exec_f4_red_dist()
6377: {
1.157 noro 6378: int m,i,nsp,col,s0size,nred,spcol,j,k;
6379: NM_ind_pair *rp0;
6380: NDV nf;
6381: UINT *s0vect;
6382: IndArray *imat;
6383: int *rhead;
6384: int **spmat;
6385: UINT *svect,*v;
6386: ND_pairs *sp0;
6387: int *colstat;
6388: int a,sprow,rank;
6389: struct order_spec *ord;
6390: Obj ordspec;
6391: ND spol;
6392: int maxrs;
6393: int *spsugar;
6394:
6395: nd_read = iofp[0].in;
6396: nd_write = iofp[0].out;
6397: m = nd_recv_int();
6398: nd_nvar = nd_recv_int();
6399: nd_bpe = nd_recv_int();
6400: nd_wpd = nd_recv_int();
6401: nmv_adv = nd_recv_int();
6402:
6403: loadobj(nd_read,&ordspec);
6404: create_order_spec(0,ordspec,&ord);
6405: nd_init_ord(ord);
6406: nd_setup_parameters(nd_nvar,0);
6407:
6408: nd_psn = nd_recv_int();
6409: nd_ps = (NDV *)MALLOC(nd_psn*sizeof(NDV));
6410: nd_bound = (UINT **)MALLOC(nd_psn*sizeof(UINT *));
6411: for ( i = 0; i < nd_psn; i++ ) {
6412: nd_ps[i] = nd_recv_ndv();
6413: nd_bound[i] = ndv_compute_bound(nd_ps[i]);
6414: }
6415:
6416: nsp = nd_recv_int();
6417: sp0 = (ND_pairs *)MALLOC(nsp*sizeof(ND_pairs));
6418: for ( i = 0; i < nsp; i++ ) {
6419: NEWND_pairs(sp0[i]);
6420: sp0[i]->i1 = nd_recv_int(); sp0[i]->i2 = nd_recv_int();
6421: ndl_lcm(HDL(nd_ps[sp0[i]->i1]),HDL(nd_ps[sp0[i]->i2]),LCM(sp0[i]));
6422: }
6423:
6424: col = nd_recv_int();
6425: s0size = col*nd_wpd;
6426: s0vect = (UINT *)MALLOC(s0size*sizeof(UINT));
6427: nd_recv_intarray(s0vect,s0size);
6428:
6429: nred = nd_recv_int();
6430: rp0 = (NM_ind_pair *)MALLOC(nred*sizeof(NM_ind_pair));
6431: for ( i = 0; i < nred; i++ ) {
6432: rp0[i] = (NM_ind_pair)MALLOC(sizeof(struct oNM_ind_pair));
6433: rp0[i]->index = nd_recv_int();
6434: rp0[i]->mul = (NM)MALLOC(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT));
6435: nd_recv_intarray(rp0[i]->mul->dl,nd_wpd);
6436: }
6437:
6438: spcol = col-nred;
6439: imat = (IndArray *)MALLOC(nred*sizeof(IndArray));
6440: rhead = (int *)MALLOC(col*sizeof(int));
6441: for ( i = 0; i < col; i++ ) rhead[i] = 0;
6442:
6443: /* construction of index arrays */
6444: for ( i = 0; i < nred; i++ ) {
6445: imat[i] = nm_ind_pair_to_vect_compress(m,s0vect,col,rp0[i]);
6446: rhead[imat[i]->head] = 1;
6447: }
6448:
6449: /* elimination (1st step) */
6450: spmat = (int **)MALLOC(nsp*sizeof(UINT *));
6451: svect = (UINT *)MALLOC(col*sizeof(UINT));
6452: spsugar = (int *)ALLOCA(nsp*sizeof(UINT));
6453: for ( a = sprow = 0; a < nsp; a++ ) {
6454: nd_sp(m,0,sp0[a],&spol);
6455: if ( !spol ) continue;
6456: nd_to_vect(m,s0vect,col,spol,svect);
6457: if ( m == -1 )
6458: maxrs = ndv_reduce_vect_sf(m,svect,col,imat,rp0,nred);
6459: else
6460: maxrs = ndv_reduce_vect(m,svect,col,imat,rp0,nred);
6461: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
6462: if ( i < col ) {
6463: spmat[sprow] = v = (UINT *)MALLOC(spcol*sizeof(UINT));
6464: for ( j = k = 0; j < col; j++ )
6465: if ( !rhead[j] ) v[k++] = svect[j];
6466: spsugar[sprow] = MAX(maxrs,SG(spol));
6467: sprow++;
6468: }
6469: nd_free(spol);
6470: }
6471: /* elimination (2nd step) */
6472: colstat = (int *)ALLOCA(spcol*sizeof(int));
6473: if ( m == -1 )
6474: rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat);
6475: else
6476: rank = nd_gauss_elim_mod(spmat,spsugar,0,sprow,spcol,m,colstat);
6477: nd_send_int(rank);
6478: for ( i = 0; i < rank; i++ ) {
6479: nf = vect_to_ndv(spmat[i],spcol,col,rhead,s0vect);
6480: nd_send_ndv(nf);
6481: }
6482: fflush(nd_write);
1.107 noro 6483: }
6484:
1.113 noro 6485: int nd_gauss_elim_q(Q **mat0,int *sugar,int row,int col,int *colstat)
1.107 noro 6486: {
1.176 noro 6487: int i,j,t,c,rank,inv;
1.157 noro 6488: int *ci,*ri;
6489: Q dn;
6490: MAT m,nm;
6491:
6492: NEWMAT(m); m->row = row; m->col = col; m->body = (pointer **)mat0;
6493: rank = generic_gauss_elim(m,&nm,&dn,&ri,&ci);
6494: for ( i = 0; i < row; i++ )
6495: for ( j = 0; j < col; j++ )
6496: mat0[i][j] = 0;
6497: c = col-rank;
6498: for ( i = 0; i < rank; i++ ) {
6499: mat0[i][ri[i]] = dn;
6500: for ( j = 0; j < c; j++ )
6501: mat0[i][ci[j]] = (Q)BDY(nm)[i][j];
6502: }
6503: return rank;
1.76 noro 6504: }
6505:
1.133 noro 6506: int nd_gauss_elim_mod(int **mat0,int *sugar,ND_pairs *spactive,int row,int col,int md,int *colstat)
1.76 noro 6507: {
1.157 noro 6508: int i,j,k,l,inv,a,rank,s;
6509: unsigned int *t,*pivot,*pk;
6510: unsigned int **mat;
6511: ND_pairs pair;
6512:
6513: mat = (unsigned int **)mat0;
6514: for ( rank = 0, j = 0; j < col; j++ ) {
6515: for ( i = rank; i < row; i++ )
6516: mat[i][j] %= md;
6517: for ( i = rank; i < row; i++ )
6518: if ( mat[i][j] )
6519: break;
6520: if ( i == row ) {
6521: colstat[j] = 0;
6522: continue;
6523: } else
6524: colstat[j] = 1;
6525: if ( i != rank ) {
6526: t = mat[i]; mat[i] = mat[rank]; mat[rank] = t;
6527: s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s;
6528: if ( spactive ) {
6529: pair = spactive[i]; spactive[i] = spactive[rank];
6530: spactive[rank] = pair;
6531: }
6532: }
6533: pivot = mat[rank];
6534: s = sugar[rank];
6535: inv = invm(pivot[j],md);
6536: for ( k = j, pk = pivot+k; k < col; k++, pk++ )
6537: if ( *pk ) {
6538: if ( *pk >= (unsigned int)md )
6539: *pk %= md;
6540: DMAR(*pk,inv,0,md,*pk)
6541: }
6542: for ( i = rank+1; i < row; i++ ) {
6543: t = mat[i];
6544: if ( a = t[j] ) {
6545: sugar[i] = MAX(sugar[i],s);
6546: red_by_vect(md,t+j,pivot+j,md-a,col-j);
6547: }
6548: }
6549: rank++;
6550: }
6551: for ( j = col-1, l = rank-1; j >= 0; j-- )
6552: if ( colstat[j] ) {
6553: pivot = mat[l];
6554: s = sugar[l];
6555: for ( i = 0; i < l; i++ ) {
6556: t = mat[i];
6557: t[j] %= md;
6558: if ( a = t[j] ) {
6559: sugar[i] = MAX(sugar[i],s);
6560: red_by_vect(md,t+j,pivot+j,md-a,col-j);
6561: }
6562: }
6563: l--;
6564: }
6565: for ( j = 0, l = 0; l < rank; j++ )
6566: if ( colstat[j] ) {
6567: t = mat[l];
6568: for ( k = j; k < col; k++ )
6569: if ( t[k] >= (unsigned int)md )
6570: t[k] %= md;
6571: l++;
6572: }
6573: return rank;
1.76 noro 6574: }
6575:
6576: int nd_gauss_elim_sf(int **mat0,int *sugar,int row,int col,int md,int *colstat)
6577: {
1.157 noro 6578: int i,j,k,l,inv,a,rank,s;
6579: unsigned int *t,*pivot,*pk;
6580: unsigned int **mat;
6581:
6582: mat = (unsigned int **)mat0;
6583: for ( rank = 0, j = 0; j < col; j++ ) {
6584: for ( i = rank; i < row; i++ )
6585: if ( mat[i][j] )
6586: break;
6587: if ( i == row ) {
6588: colstat[j] = 0;
6589: continue;
6590: } else
6591: colstat[j] = 1;
6592: if ( i != rank ) {
6593: t = mat[i]; mat[i] = mat[rank]; mat[rank] = t;
6594: s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s;
6595: }
6596: pivot = mat[rank];
6597: s = sugar[rank];
6598: inv = _invsf(pivot[j]);
6599: for ( k = j, pk = pivot+k; k < col; k++, pk++ )
6600: if ( *pk )
6601: *pk = _mulsf(*pk,inv);
6602: for ( i = rank+1; i < row; i++ ) {
6603: t = mat[i];
6604: if ( a = t[j] ) {
6605: sugar[i] = MAX(sugar[i],s);
6606: red_by_vect_sf(md,t+j,pivot+j,_chsgnsf(a),col-j);
6607: }
6608: }
6609: rank++;
6610: }
6611: for ( j = col-1, l = rank-1; j >= 0; j-- )
6612: if ( colstat[j] ) {
6613: pivot = mat[l];
6614: s = sugar[l];
6615: for ( i = 0; i < l; i++ ) {
6616: t = mat[i];
6617: if ( a = t[j] ) {
6618: sugar[i] = MAX(sugar[i],s);
6619: red_by_vect_sf(md,t+j,pivot+j,_chsgnsf(a),col-j);
6620: }
6621: }
6622: l--;
6623: }
6624: return rank;
1.77 noro 6625: }
6626:
6627: int ndv_ishomo(NDV p)
6628: {
1.157 noro 6629: NMV m;
6630: int len,h;
1.77 noro 6631:
1.157 noro 6632: if ( !p ) return 1;
6633: len = LEN(p);
6634: m = BDY(p);
6635: h = TD(DL(m));
6636: NMV_ADV(m);
6637: for ( len--; len; len--, NMV_ADV(m) )
6638: if ( TD(DL(m)) != h ) return 0;
6639: return 1;
1.77 noro 6640: }
6641:
6642: void ndv_save(NDV p,int index)
6643: {
1.157 noro 6644: FILE *s;
6645: char name[BUFSIZ];
6646: short id;
6647: int nv,sugar,len,n,i,td,e,j;
6648: NMV m;
6649: unsigned int *dl;
6650: int mpos;
6651:
6652: sprintf(name,"%s/%d",Demand,index);
6653: s = fopen(name,"w");
6654: savevl(s,0);
6655: if ( !p ) {
6656: saveobj(s,0);
6657: return;
6658: }
6659: id = O_DP;
6660: nv = NV(p);
6661: sugar = SG(p);
6662: len = LEN(p);
6663: write_short(s,&id); write_int(s,&nv); write_int(s,&sugar);
6664: write_int(s,&len);
6665:
6666: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
6667: saveobj(s,(Obj)CQ(m));
6668: dl = DL(m);
6669: td = TD(dl);
6670: write_int(s,&td);
6671: for ( j = 0; j < nv; j++ ) {
6672: e = GET_EXP(dl,j);
6673: write_int(s,&e);
6674: }
6675: if ( nd_module ) {
6676: mpos = MPOS(dl); write_int(s,&mpos);
6677: }
6678: }
6679: fclose(s);
1.77 noro 6680: }
6681:
1.206 noro 6682: void nd_save_mod(ND p,int index)
6683: {
6684: FILE *s;
6685: char name[BUFSIZ];
6686: int nv,sugar,len,c;
6687: NM m;
6688:
6689: sprintf(name,"%s/%d",Demand,index);
6690: s = fopen(name,"w");
6691: if ( !p ) {
6692: len = 0;
6693: write_int(s,&len);
6694: fclose(s);
6695: return;
6696: }
6697: nv = NV(p);
6698: sugar = SG(p);
6699: len = LEN(p);
6700: write_int(s,&nv); write_int(s,&sugar); write_int(s,&len);
6701: for ( m = BDY(p); m; m = NEXT(m) ) {
6702: c = CM(m); write_int(s,&c);
6703: write_intarray(s,DL(m),nd_wpd);
6704: }
6705: fclose(s);
6706: }
6707:
1.77 noro 6708: NDV ndv_load(int index)
6709: {
1.157 noro 6710: FILE *s;
6711: char name[BUFSIZ];
6712: short id;
6713: int nv,sugar,len,n,i,td,e,j;
6714: NDV d;
6715: NMV m0,m;
6716: unsigned int *dl;
6717: Obj obj;
6718: int mpos;
6719:
6720: sprintf(name,"%s/%d",Demand,index);
6721: s = fopen(name,"r");
6722: if ( !s ) return 0;
6723:
6724: skipvl(s);
6725: read_short(s,&id);
6726: if ( !id ) return 0;
6727: read_int(s,&nv);
6728: read_int(s,&sugar);
6729: read_int(s,&len);
6730:
6731: m0 = m = MALLOC(len*nmv_adv);
6732: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
6733: loadobj(s,&obj); CQ(m) = (Q)obj;
6734: dl = DL(m);
6735: ndl_zero(dl);
6736: read_int(s,&td); TD(dl) = td;
6737: for ( j = 0; j < nv; j++ ) {
6738: read_int(s,&e);
6739: PUT_EXP(dl,j,e);
6740: }
6741: if ( nd_module ) {
6742: read_int(s,&mpos); MPOS(dl) = mpos;
6743: }
6744: if ( nd_blockmask ) ndl_weight_mask(dl);
6745: }
6746: fclose(s);
6747: MKNDV(nv,m0,len,d);
6748: SG(d) = sugar;
6749: return d;
1.99 noro 6750: }
6751:
1.206 noro 6752: ND nd_load_mod(int index)
6753: {
6754: FILE *s;
6755: char name[BUFSIZ];
6756: int nv,sugar,len,i,c;
6757: ND d;
6758: NM m0,m;
6759:
6760: sprintf(name,"%s/%d",Demand,index);
6761: s = fopen(name,"r");
6762: /* if the file does not exist, it means p[index]=0 */
6763: if ( !s ) return 0;
6764:
6765: read_int(s,&nv);
6766: if ( !nv ) { fclose(s); return 0; }
6767:
6768: read_int(s,&sugar);
6769: read_int(s,&len);
6770: for ( m0 = 0, i = 0; i < len; i++ ) {
6771: NEXTNM(m0,m);
6772: read_int(s,&c); CM(m) = c;
6773: read_intarray(s,DL(m),nd_wpd);
6774: }
6775: NEXT(m) = 0;
6776: MKND(nv,m0,len,d);
6777: SG(d) = sugar;
6778: fclose(s);
6779: return d;
6780: }
6781:
1.102 noro 6782: void nd_det(int mod,MAT f,P *rp)
1.99 noro 6783: {
1.157 noro 6784: VL fv,tv;
6785: int n,i,j,max,e,nvar,sgn,k0,l0,len0,len,k,l,a;
6786: pointer **m;
6787: Q mone;
6788: P **w;
6789: P mp,r;
6790: NDV **dm;
6791: NDV *t,*mi,*mj;
6792: NDV d,s,mij,mjj;
6793: ND u;
6794: NMV nmv;
6795: UINT *bound;
6796: PGeoBucket bucket;
6797: struct order_spec *ord;
6798: Q dq,dt,ds;
6799: N gn,qn,dn0,nm,dn;
6800:
6801: create_order_spec(0,0,&ord);
6802: nd_init_ord(ord);
6803: get_vars((Obj)f,&fv);
6804: if ( f->row != f->col )
6805: error("nd_det : non-square matrix");
6806: n = f->row;
6807: m = f->body;
6808: for ( nvar = 0, tv = fv; tv; tv = NEXT(tv), nvar++ );
6809:
6810: if ( !nvar ) {
6811: if ( !mod )
6812: detp(CO,(P **)m,n,rp);
6813: else {
6814: w = (P **)almat_pointer(n,n);
6815: for ( i = 0; i < n; i++ )
6816: for ( j = 0; j < n; j++ )
6817: ptomp(mod,(P)m[i][j],&w[i][j]);
6818: detmp(CO,mod,w,n,&mp);
6819: mptop(mp,rp);
6820: }
6821: return;
6822: }
6823:
6824: if ( !mod ) {
6825: w = (P **)almat_pointer(n,n);
6826: dq = ONE;
6827: for ( i = 0; i < n; i++ ) {
6828: dn0 = ONEN;
6829: for ( j = 0; j < n; j++ ) {
6830: if ( !m[i][j] ) continue;
6831: lgp(m[i][j],&nm,&dn);
6832: gcdn(dn0,dn,&gn); divsn(dn0,gn,&qn); muln(qn,dn,&dn0);
6833: }
6834: if ( !UNIN(dn0) ) {
6835: NTOQ(dn0,1,ds);
6836: for ( j = 0; j < n; j++ )
6837: mulp(CO,(P)m[i][j],(P)ds,&w[i][j]);
6838: mulq(dq,ds,&dt); dq = dt;
6839: } else
6840: for ( j = 0; j < n; j++ )
6841: w[i][j] = (P)m[i][j];
6842: }
6843: m = (pointer **)w;
6844: }
6845:
1.178 noro 6846: for ( i = 0, max = 1; i < n; i++ )
1.157 noro 6847: for ( j = 0; j < n; j++ )
6848: for ( tv = fv; tv; tv = NEXT(tv) ) {
6849: e = getdeg(tv->v,(P)m[i][j]);
6850: max = MAX(e,max);
6851: }
6852: nd_setup_parameters(nvar,max);
6853: dm = (NDV **)almat_pointer(n,n);
1.178 noro 6854: for ( i = 0, max = 1; i < n; i++ )
1.157 noro 6855: for ( j = 0; j < n; j++ ) {
6856: dm[i][j] = ptondv(CO,fv,m[i][j]);
6857: if ( mod ) ndv_mod(mod,dm[i][j]);
6858: if ( dm[i][j] && !LEN(dm[i][j]) ) dm[i][j] = 0;
6859: }
6860: d = ptondv(CO,fv,(P)ONE);
6861: if ( mod ) ndv_mod(mod,d);
6862: chsgnq(ONE,&mone);
6863: for ( j = 0, sgn = 1; j < n; j++ ) {
6864: if ( DP_Print ) fprintf(stderr,".",j);
6865: for ( i = j; i < n && !dm[i][j]; i++ );
6866: if ( i == n ) {
6867: *rp = 0;
6868: return;
6869: }
6870: k0 = i; l0 = j; len0 = LEN(dm[k0][l0]);
6871: for ( k = j; k < n; k++ )
6872: for ( l = j; l < n; l++ )
6873: if ( dm[k][l] && LEN(dm[k][l]) < len0 ) {
6874: k0 = k; l0 = l; len0 = LEN(dm[k][l]);
6875: }
6876: if ( k0 != j ) {
6877: t = dm[j]; dm[j] = dm[k0]; dm[k0] = t;
6878: sgn = -sgn;
6879: }
6880: if ( l0 != j ) {
6881: for ( k = j; k < n; k++ ) {
6882: s = dm[k][j]; dm[k][j] = dm[k][l0]; dm[k][l0] = s;
6883: }
6884: sgn = -sgn;
6885: }
6886: bound = nd_det_compute_bound(dm,n,j);
6887: for ( k = 0; k < nd_nvar; k++ )
6888: if ( bound[k]*2 > nd_mask0 ) break;
6889: if ( k < nd_nvar )
6890: nd_det_reconstruct(dm,n,j,d);
6891:
6892: for ( i = j+1, mj = dm[j], mjj = mj[j]; i < n; i++ ) {
6893: /* if ( DP_Print ) fprintf(stderr," i=%d\n ",i); */
6894: mi = dm[i]; mij = mi[j];
6895: if ( mod )
6896: ndv_mul_c(mod,mij,mod-1);
6897: else
6898: ndv_mul_c_q(mij,mone);
6899: for ( k = j+1; k < n; k++ ) {
6900: /* if ( DP_Print ) fprintf(stderr,"k=%d ",k); */
6901: bucket = create_pbucket();
6902: if ( mi[k] ) {
6903: nmv = BDY(mjj); len = LEN(mjj);
6904: for ( a = 0; a < len; a++, NMV_ADV(nmv) ) {
6905: u = ndv_mul_nmv_trunc(mod,nmv,mi[k],DL(BDY(d)));
6906: add_pbucket(mod,bucket,u);
6907: }
6908: }
6909: if ( mj[k] && mij ) {
6910: nmv = BDY(mij); len = LEN(mij);
6911: for ( a = 0; a < len; a++, NMV_ADV(nmv) ) {
6912: u = ndv_mul_nmv_trunc(mod,nmv,mj[k],DL(BDY(d)));
6913: add_pbucket(mod,bucket,u);
6914: }
6915: }
6916: u = nd_quo(mod,bucket,d);
6917: mi[k] = ndtondv(mod,u);
6918: }
6919: /* if ( DP_Print ) fprintf(stderr,"\n",k); */
6920: }
6921: d = mjj;
6922: }
6923: if ( DP_Print ) fprintf(stderr,"\n",k);
6924: if ( sgn < 0 )
6925: if ( mod )
6926: ndv_mul_c(mod,d,mod-1);
6927: else
6928: ndv_mul_c_q(d,mone);
6929: r = ndvtop(mod,CO,fv,d);
6930: if ( !mod && !UNIQ(dq) )
6931: divsp(CO,r,(P)dq,rp);
6932: else
6933: *rp = r;
1.99 noro 6934: }
6935:
1.102 noro 6936: ND ndv_mul_nmv_trunc(int mod,NMV m0,NDV p,UINT *d)
1.99 noro 6937: {
1.157 noro 6938: NM mr,mr0;
6939: NM tnm;
6940: NMV m;
6941: UINT *d0,*dt,*dm;
6942: int c,n,td,i,c1,c2,len;
6943: Q q;
6944: ND r;
6945:
6946: if ( !p ) return 0;
6947: else {
6948: n = NV(p); m = BDY(p); len = LEN(p);
6949: d0 = DL(m0);
6950: td = TD(d);
6951: mr0 = 0;
6952: NEWNM(tnm);
6953: if ( mod ) {
6954: c = CM(m0);
6955: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
6956: ndl_add(DL(m),d0,DL(tnm));
6957: if ( ndl_reducible(DL(tnm),d) ) {
6958: NEXTNM(mr0,mr);
6959: c1 = CM(m); DMAR(c1,c,0,mod,c2); CM(mr) = c2;
6960: ndl_copy(DL(tnm),DL(mr));
6961: }
6962: }
6963: } else {
6964: q = CQ(m0);
6965: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
6966: ndl_add(DL(m),d0,DL(tnm));
6967: if ( ndl_reducible(DL(tnm),d) ) {
6968: NEXTNM(mr0,mr);
6969: mulq(CQ(m),q,&CQ(mr));
6970: ndl_copy(DL(tnm),DL(mr));
6971: }
6972: }
6973: }
6974: if ( !mr0 )
6975: return 0;
6976: else {
6977: NEXT(mr) = 0;
6978: for ( len = 0, mr = mr0; mr; mr = NEXT(mr), len++ );
6979: MKND(NV(p),mr0,len,r);
6980: SG(r) = SG(p) + TD(d0);
6981: return r;
6982: }
6983: }
1.114 noro 6984: }
6985:
6986: void nd_det_reconstruct(NDV **dm,int n,int j,NDV d)
6987: {
1.157 noro 6988: int i,obpe,oadv,h,k,l;
6989: static NM prev_nm_free_list;
6990: EPOS oepos;
6991:
6992: obpe = nd_bpe;
6993: oadv = nmv_adv;
6994: oepos = nd_epos;
6995: if ( obpe < 2 ) nd_bpe = 2;
6996: else if ( obpe < 3 ) nd_bpe = 3;
6997: else if ( obpe < 4 ) nd_bpe = 4;
6998: else if ( obpe < 5 ) nd_bpe = 5;
6999: else if ( obpe < 6 ) nd_bpe = 6;
7000: else if ( obpe < 8 ) nd_bpe = 8;
7001: else if ( obpe < 10 ) nd_bpe = 10;
7002: else if ( obpe < 16 ) nd_bpe = 16;
7003: else if ( obpe < 32 ) nd_bpe = 32;
7004: else error("nd_det_reconstruct : exponent too large");
7005:
7006: nd_setup_parameters(nd_nvar,0);
7007: prev_nm_free_list = _nm_free_list;
7008: _nm_free_list = 0;
7009: for ( k = j; k < n; k++ )
7010: for (l = j; l < n; l++ )
7011: ndv_realloc(dm[k][l],obpe,oadv,oepos);
7012: ndv_realloc(d,obpe,oadv,oepos);
7013: prev_nm_free_list = 0;
1.114 noro 7014: #if 0
1.157 noro 7015: GC_gcollect();
1.114 noro 7016: #endif
7017: }
7018:
1.153 noro 7019: /* returns a UINT array containing degree bounds */
7020:
1.114 noro 7021: UINT *nd_det_compute_bound(NDV **dm,int n,int j)
7022: {
1.157 noro 7023: UINT *d0,*d1,*d,*t,*r;
7024: int k,l,i;
1.114 noro 7025:
1.157 noro 7026: d0 = (UINT *)MALLOC(nd_nvar*sizeof(UINT));
7027: for ( k = 0; k < nd_nvar; k++ ) d0[k] = 0;
7028: for ( k = j; k < n; k++ )
7029: for ( l = j; l < n; l++ )
7030: if ( dm[k][l] ) {
7031: d = ndv_compute_bound(dm[k][l]);
7032: for ( i = 0; i < nd_nvar; i++ )
7033: d0[i] = MAX(d0[i],d[i]);
7034: }
7035: return d0;
1.117 noro 7036: }
7037:
7038: DL nd_separate_d(UINT *d,UINT *trans)
7039: {
1.157 noro 7040: int n,td,i,e,j;
7041: DL a;
1.117 noro 7042:
1.157 noro 7043: ndl_zero(trans);
7044: td = 0;
7045: for ( i = 0; i < nd_ntrans; i++ ) {
7046: e = GET_EXP(d,i);
7047: PUT_EXP(trans,i,e);
7048: td += MUL_WEIGHT(e,i);
7049: }
7050: if ( nd_ntrans+nd_nalg < nd_nvar ) {
7051: /* homogenized */
7052: i = nd_nvar-1;
7053: e = GET_EXP(d,i);
7054: PUT_EXP(trans,i,e);
7055: td += MUL_WEIGHT(e,i);
7056: }
7057: TD(trans) = td;
7058: if ( nd_blockmask) ndl_weight_mask(trans);
7059: NEWDL(a,nd_nalg);
7060: td = 0;
7061: for ( i = 0; i < nd_nalg; i++ ) {
7062: j = nd_ntrans+i;
7063: e = GET_EXP(d,j);
7064: a->d[i] = e;
7065: td += e;
7066: }
7067: a->td = td;
7068: return a;
1.117 noro 7069: }
7070:
1.118 noro 7071: int nd_monic(int mod,ND *p)
1.117 noro 7072: {
1.157 noro 7073: UINT *trans,*t;
7074: DL alg;
7075: MP mp0,mp;
7076: NM m,m0,m1,ma0,ma,mb,mr0,mr;
7077: ND r;
7078: DL dl;
7079: DP nm;
7080: NDV ndv;
7081: DAlg inv,cd;
7082: ND s,c;
7083: Q l,mul;
7084: N ln;
7085: int n,ntrans,i,e,td,is_lc,len;
7086: NumberField nf;
7087: struct oEGT eg0,eg1;
7088:
7089: if ( !(nf = get_numberfield()) )
7090: error("nd_monic : current_numberfield is not set");
7091:
7092: /* Q coef -> DAlg coef */
7093: NEWNM(ma0); ma = ma0;
7094: m = BDY(*p);
7095: is_lc = 1;
7096: while ( 1 ) {
7097: NEWMP(mp0); mp = mp0;
7098: mp->c = (P)CQ(m);
7099: mp->dl = nd_separate_d(DL(m),DL(ma));
7100: NEWNM(mb);
7101: for ( m = NEXT(m); m; m = NEXT(m) ) {
7102: alg = nd_separate_d(DL(m),DL(mb));
7103: if ( !ndl_equal(DL(ma),DL(mb)) )
7104: break;
7105: NEXTMP(mp0,mp); mp->c = (P)CQ(m); mp->dl = alg;
7106: }
7107: NEXT(mp) = 0;
7108: MKDP(nd_nalg,mp0,nm);
7109: MKDAlg(nm,ONE,cd);
7110: if ( is_lc == 1 ) {
7111: /* if the lc is a rational number, we have nothing to do */
7112: if ( !mp0->dl->td )
7113: return 1;
7114:
7115: get_eg(&eg0);
7116: invdalg(cd,&inv);
7117: get_eg(&eg1); add_eg(&eg_invdalg,&eg0,&eg1);
7118: /* check the validity of inv */
7119: if ( mod && !rem(NM(inv->dn),mod) )
7120: return 0;
7121: CA(ma) = nf->one;
7122: is_lc = 0;
7123: ln = ONEN;
7124: } else {
7125: muldalg(cd,inv,&CA(ma));
7126: lcmn(ln,NM(CA(ma)->dn),&ln);
7127: }
7128: if ( m ) {
7129: NEXT(ma) = mb; ma = mb;
7130: } else {
7131: NEXT(ma) = 0;
7132: break;
7133: }
7134: }
7135: /* l = lcm(denoms) */
7136: NTOQ(ln,1,l);
7137: for ( mr0 = 0, m = ma0; m; m = NEXT(m) ) {
7138: divq(l,CA(m)->dn,&mul);
7139: for ( mp = BDY(CA(m)->nm); mp; mp = NEXT(mp) ) {
7140: NEXTNM(mr0,mr);
7141: mulq((Q)mp->c,mul,&CQ(mr));
7142: dl = mp->dl;
7143: td = TD(DL(m));
7144: ndl_copy(DL(m),DL(mr));
7145: for ( i = 0; i < nd_nalg; i++ ) {
7146: e = dl->d[i];
7147: PUT_EXP(DL(mr),i+nd_ntrans,e);
7148: td += MUL_WEIGHT(e,i+nd_ntrans);
7149: }
1.163 noro 7150: if ( nd_module ) MPOS(DL(mr)) = MPOS(DL(m));
1.157 noro 7151: TD(DL(mr)) = td;
7152: if ( nd_blockmask) ndl_weight_mask(DL(mr));
7153: }
7154: }
7155: NEXT(mr) = 0;
7156: for ( len = 0, mr = mr0; mr; mr = NEXT(mr), len++ );
7157: MKND(NV(*p),mr0,len,r);
7158: /* XXX */
7159: SG(r) = SG(*p);
7160: nd_free(*p);
7161: *p = r;
7162: return 1;
1.59 noro 7163: }
1.167 noro 7164:
7165: NODE reverse_node(NODE n)
7166: {
7167: NODE t,t1;
7168:
7169: for ( t = 0; n; n = NEXT(n) ) {
7170: MKNODE(t1,BDY(n),t); t = t1;
7171: }
7172: return t;
7173: }
7174:
7175: P ndc_div(int mod,union oNDC a,union oNDC b)
7176: {
7177: union oNDC c;
7178: int inv,t;
7179:
7180: if ( mod == -1 ) c.m = _mulsf(a.m,_invsf(b.m));
7181: else if ( mod ) {
7182: inv = invm(b.m,mod);
7183: DMAR(a.m,inv,0,mod,t); c.m = t;
7184: } else if ( nd_vc )
7185: divsp(nd_vc,a.p,b.p,&c.p);
7186: else
7187: divq(a.z,b.z,&c.z);
7188: return ndctop(mod,c);
7189: }
7190:
7191: P ndctop(int mod,union oNDC c)
7192: {
7193: Q q;
7194: int e;
7195: GFS gfs;
7196:
7197: if ( mod == -1 ) {
7198: e = IFTOF(c.m); MKGFS(e,gfs); return (P)gfs;
7199: } else if ( mod ) {
7200: STOQ(c.m,q); return (P)q;
7201: } else
7202: return (P)c.p;
7203: }
7204:
7205: /* [0,0,0,cont] = p -> p/cont */
7206:
7207: void finalize_tracelist(int i,P cont)
7208: {
7209: LIST l;
7210: NODE node;
7211: Q iq;
7212:
7213: if ( !UNIQ(cont) ) {
1.196 noro 7214: node = mknode(4,NULLP,NULLP,NULLP,cont);
1.167 noro 7215: MKLIST(l,node); MKNODE(node,l,nd_tracelist);
7216: nd_tracelist = node;
7217: }
7218: STOQ(i,iq);
7219: nd_tracelist = reverse_node(nd_tracelist);
7220: MKLIST(l,nd_tracelist);
7221: node = mknode(2,iq,l); MKLIST(l,node);
7222: MKNODE(node,l,nd_alltracelist); MKLIST(l,node);
7223: nd_alltracelist = node; nd_tracelist = 0;
7224: }
7225:
7226: void conv_ilist(int demand,int trace,NODE g,int **indp)
7227: {
7228: int n,i,j;
7229: int *ind;
7230: NODE t;
7231:
7232: n = length(g);
7233: ind = (int *)MALLOC(n*sizeof(int));
7234: for ( i = 0, t = g; i < n; i++, t = NEXT(t) ) {
7235: j = (long)BDY(t); ind[i] = j;
7236: BDY(t) = (pointer)(demand?ndv_load(j):(trace?nd_ps_trace[j]:nd_ps[j]));
7237: }
7238: if ( indp ) *indp = ind;
7239: }
1.172 noro 7240:
7241: void parse_nd_option(NODE opt)
7242: {
1.187 noro 7243: NODE t,p,u;
7244: int i,s;
1.172 noro 7245: char *key;
7246: Obj value;
7247:
1.187 noro 7248: nd_gentrace = 0; nd_gensyz = 0; nd_nora = 0; nd_gbblock = 0;
1.195 noro 7249: nd_newelim = 0; nd_intersect = 0;
1.172 noro 7250: for ( t = opt; t; t = NEXT(t) ) {
7251: p = BDY((LIST)BDY(t));
7252: key = BDY((STRING)BDY(p));
7253: value = (Obj)BDY(NEXT(p));
7254: if ( !strcmp(key,"gentrace") )
7255: nd_gentrace = value?1:0;
7256: else if ( !strcmp(key,"gensyz") )
7257: nd_gensyz = value?1:0;
1.173 noro 7258: else if ( !strcmp(key,"nora") )
7259: nd_nora = value?1:0;
1.187 noro 7260: else if ( !strcmp(key,"gbblock") ) {
7261: if ( !value || OID(value) != O_LIST )
7262: error("nd_* : invalid value for gbblock option");
7263: u = BDY((LIST)value);
1.189 noro 7264: nd_gbblock = MALLOC((2*length(u)+1)*sizeof(int));
1.187 noro 7265: for ( i = 0; u; u = NEXT(u) ) {
7266: p = BDY((LIST)BDY(u));
7267: s = nd_gbblock[i++] = QTOS((Q)BDY(p));
7268: nd_gbblock[i++] = s+QTOS((Q)BDY(NEXT(p)))-1;
7269: }
7270: nd_gbblock[i] = -1;
1.192 noro 7271: } else if ( !strcmp(key,"newelim") )
7272: nd_newelim = value?1:0;
1.195 noro 7273: else if ( !strcmp(key,"intersect") )
7274: nd_intersect = value?1:0;
1.172 noro 7275: }
7276: }
1.204 noro 7277:
7278: ND mdptond(DP d);
7279: ND nd_mul_nm(int mod,NM m0,ND p);
1.207 ! noro 7280: ND *btog(NODE ti,ND **p,int nb,int mod);
! 7281: ND btog_one(NODE ti,ND *p,int nb,int mod);
1.204 noro 7282: MAT nd_btog(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist,MAT *rp);
1.205 noro 7283: VECT nd_btog_one(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist,int pos,MAT *rp);
1.204 noro 7284:
7285: /* d:monomial */
7286: ND mdptond(DP d)
7287: {
7288: NM m;
7289: ND r;
7290:
7291: if ( OID(d) == 1 )
7292: r = ptond(CO,CO,(P)d);
7293: else {
7294: NEWNM(m);
7295: dltondl(NV(d),BDY(d)->dl,DL(m));
7296: CQ(m) = (Q)BDY(d)->c;
7297: NEXT(m) = 0;
7298: MKND(NV(d),m,1,r);
7299: }
7300: return r;
7301: }
7302:
7303: ND nd_mul_nm(int mod,NM m0,ND p)
7304: {
7305: UINT *d0;
7306: int c0,c1,c;
7307: NM tm,mr,mr0;
7308: ND r;
7309:
7310: if ( !p ) return 0;
7311: d0 = DL(m0);
7312: c0 = CM(m0);
7313: mr0 = 0;
7314: for ( tm = BDY(p); tm; tm = NEXT(tm) ) {
7315: NEXTNM(mr0,mr);
7316: c = CM(tm); DMAR(c0,c,0,mod,c1); CM(mr) = c1;
7317: ndl_add(d0,DL(tm),DL(mr));
7318: }
7319: NEXT(mr) = 0;
7320: MKND(NV(p),mr0,LEN(p),r);
7321: return r;
7322: }
7323:
1.207 ! noro 7324: ND *btog(NODE ti,ND **p,int nb,int mod)
1.204 noro 7325: {
7326: PGeoBucket *r;
7327: int i,ci;
7328: NODE t,s;
7329: ND m,tp;
7330: ND *pi,*rd;
7331: P c;
7332:
7333: r = (PGeoBucket *)MALLOC(nb*sizeof(PGeoBucket));
7334: for ( i = 0; i < nb; i++ )
7335: r[i] = create_pbucket();
7336: for ( t = ti; t; t = NEXT(t) ) {
7337: s = BDY((LIST)BDY(t));
7338: if ( ARG0(s) ) {
7339: m = mdptond((DP)ARG2(s));
7340: ptomp(mod,(P)HCQ(m),&c);
7341: if ( ci = ((MQ)c)->cont ) {
7342: HCM(m) = ci;
7343: pi = p[QTOS((Q)ARG1(s))];
7344: for ( i = 0; i < nb; i++ ) {
7345: tp = nd_mul_nm(mod,BDY(m),pi[i]);
7346: add_pbucket(mod,r[i],tp);
7347: }
7348: }
7349: ci = 1;
7350: } else {
7351: ptomp(mod,(P)ARG3(s),&c); ci = ((MQ)c)->cont;
7352: ci = invm(ci,mod);
7353: }
7354: }
7355: rd = (ND *)MALLOC(nb*sizeof(ND));
7356: for ( i = 0; i < nb; i++ )
7357: rd[i] = normalize_pbucket(mod,r[i]);
7358: if ( ci != 1 )
7359: for ( i = 0; i < nb; i++ ) nd_mul_c(mod,rd[i],ci);
7360: return rd;
7361: }
7362:
1.207 ! noro 7363: ND btog_one(NODE ti,ND *p,int nb,int mod)
1.205 noro 7364: {
7365: PGeoBucket r;
1.206 noro 7366: int i,ci,j;
1.205 noro 7367: NODE t,s;
7368: ND m,tp;
7369: ND pi,rd;
7370: P c;
7371:
7372: r = create_pbucket();
7373: for ( t = ti; t; t = NEXT(t) ) {
7374: s = BDY((LIST)BDY(t));
7375: if ( ARG0(s) ) {
7376: m = mdptond((DP)ARG2(s));
7377: ptomp(mod,(P)HCQ(m),&c);
7378: if ( ci = ((MQ)c)->cont ) {
7379: HCM(m) = ci;
1.206 noro 7380: pi = p[j=QTOS((Q)ARG1(s))];
7381: if ( !pi ) {
7382: pi = nd_load_mod(j);
7383: tp = nd_mul_nm(mod,BDY(m),pi);
7384: nd_free(pi);
7385: add_pbucket(mod,r,tp);
7386: } else {
7387: tp = nd_mul_nm(mod,BDY(m),pi);
7388: add_pbucket(mod,r,tp);
7389: }
1.205 noro 7390: }
7391: ci = 1;
7392: } else {
7393: ptomp(mod,(P)ARG3(s),&c); ci = ((MQ)c)->cont;
7394: ci = invm(ci,mod);
7395: }
7396: }
7397: rd = normalize_pbucket(mod,r);
1.206 noro 7398: free_pbucket(r);
1.205 noro 7399: if ( ci != 1 ) nd_mul_c(mod,rd,ci);
7400: return rd;
7401: }
1.204 noro 7402:
7403: MAT nd_btog(LIST f,LIST v,int mod,struct order_spec *ord,LIST tlist,MAT *rp)
7404: {
7405: int i,j,n,m,nb,pi0,pi1,nvar;
7406: VL fv,tv,vv;
7407: NODE permtrace,perm,trace,intred,ind,t,pi,ti;
7408: ND **p;
7409: ND *c;
7410: ND u;
7411: P inv;
7412: MAT mat;
7413:
7414: parse_nd_option(current_option);
7415: get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc);
7416: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
7417: switch ( ord->id ) {
7418: case 1:
7419: if ( ord->nv != nvar )
7420: error("nd_check : invalid order specification");
7421: break;
7422: default:
7423: break;
7424: }
7425: nd_init_ord(ord);
7426: #if 0
7427: nd_bpe = QTOS((Q)ARG7(BDY(tlist)));
7428: #else
7429: nd_bpe = 32;
7430: #endif
7431: nd_setup_parameters(nvar,0);
7432: permtrace = BDY((LIST)ARG2(BDY(tlist)));
7433: intred = BDY((LIST)ARG3(BDY(tlist)));
7434: ind = BDY((LIST)ARG4(BDY(tlist)));
7435: perm = BDY((LIST)BDY(permtrace)); trace =NEXT(permtrace);
7436: for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) {
7437: j = QTOS((Q)BDY(BDY((LIST)BDY(t))));
7438: if ( j > i ) i = j;
7439: }
7440: n = i+1;
7441: nb = length(BDY(f));
7442: p = (ND **)MALLOC(n*sizeof(ND *));
7443: for ( t = perm, i = 0; t; t = NEXT(t), i++ ) {
7444: pi = BDY((LIST)BDY(t));
7445: pi0 = QTOS((Q)ARG0(pi)); pi1 = QTOS((Q)ARG1(pi));
7446: p[pi0] = c = (ND *)MALLOC(nb*sizeof(ND));
7447: ptomp(mod,(P)ARG2(pi),&inv);
7448: u = ptond(CO,vv,(P)ONE);
7449: HCM(u) = ((MQ)inv)->cont;
7450: c[pi1] = u;
7451: }
7452: for ( t = trace,i=0; t; t = NEXT(t), i++ ) {
7453: printf("%d ",i); fflush(stdout);
7454: ti = BDY((LIST)BDY(t));
1.207 ! noro 7455: p[j=QTOS((Q)ARG0(ti))] = btog(BDY((LIST)ARG1(ti)),p,nb,mod);
1.204 noro 7456: if ( j == 441 )
7457: printf("afo");
7458: }
7459: for ( t = intred, i=0; t; t = NEXT(t), i++ ) {
7460: printf("%d ",i); fflush(stdout);
7461: ti = BDY((LIST)BDY(t));
1.207 ! noro 7462: p[j=QTOS((Q)ARG0(ti))] = btog(BDY((LIST)ARG1(ti)),p,nb,mod);
1.204 noro 7463: if ( j == 441 )
7464: printf("afo");
7465: }
7466: m = length(ind);
7467: MKMAT(mat,nb,m);
7468: for ( j = 0, t = ind; j < m; j++, t = NEXT(t) )
7469: for ( i = 0, c = p[QTOS((Q)BDY(t))]; i < nb; i++ )
7470: BDY(mat)[i][j] = ndtodp(mod,c[i]);
7471: return mat;
7472: }
7473:
1.205 noro 7474: VECT nd_btog_one(LIST f,LIST v,int mod,struct order_spec *ord,
7475: LIST tlist,int pos,MAT *rp)
7476: {
7477: int i,j,n,m,nb,pi0,pi1,nvar;
7478: VL fv,tv,vv;
7479: NODE permtrace,perm,trace,intred,ind,t,pi,ti;
7480: ND *p;
7481: ND *c;
7482: ND u;
7483: P inv;
7484: VECT vect;
7485:
7486: parse_nd_option(current_option);
7487: get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc);
7488: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
7489: switch ( ord->id ) {
7490: case 1:
7491: if ( ord->nv != nvar )
7492: error("nd_check : invalid order specification");
7493: break;
7494: default:
7495: break;
7496: }
7497: nd_init_ord(ord);
7498: #if 0
7499: nd_bpe = QTOS((Q)ARG7(BDY(tlist)));
7500: #else
7501: nd_bpe = 32;
7502: #endif
7503: nd_setup_parameters(nvar,0);
7504: permtrace = BDY((LIST)ARG2(BDY(tlist)));
7505: intred = BDY((LIST)ARG3(BDY(tlist)));
7506: ind = BDY((LIST)ARG4(BDY(tlist)));
7507: perm = BDY((LIST)BDY(permtrace)); trace =NEXT(permtrace);
7508: for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) {
7509: j = QTOS((Q)BDY(BDY((LIST)BDY(t))));
7510: if ( j > i ) i = j;
7511: }
7512: n = i+1;
7513: nb = length(BDY(f));
7514: p = (ND *)MALLOC(n*sizeof(ND *));
7515: for ( t = perm, i = 0; t; t = NEXT(t), i++ ) {
7516: pi = BDY((LIST)BDY(t));
7517: pi0 = QTOS((Q)ARG0(pi)); pi1 = QTOS((Q)ARG1(pi));
7518: if ( pi1 == pos ) {
7519: ptomp(mod,(P)ARG2(pi),&inv);
7520: u = ptond(CO,vv,(P)ONE);
7521: HCM(u) = ((MQ)inv)->cont;
7522: p[pi0] = u;
7523: }
7524: }
7525: for ( t = trace,i=0; t; t = NEXT(t), i++ ) {
7526: printf("%d ",i); fflush(stdout);
7527: ti = BDY((LIST)BDY(t));
1.207 ! noro 7528: p[j=QTOS((Q)ARG0(ti))] = btog_one(BDY((LIST)ARG1(ti)),p,nb,mod);
1.206 noro 7529: if ( Demand ) {
7530: nd_save_mod(p[j],j); nd_free(p[j]); p[j] = 0;
7531: }
1.205 noro 7532: }
7533: for ( t = intred, i=0; t; t = NEXT(t), i++ ) {
7534: printf("%d ",i); fflush(stdout);
7535: ti = BDY((LIST)BDY(t));
1.207 ! noro 7536: p[j=QTOS((Q)ARG0(ti))] = btog_one(BDY((LIST)ARG1(ti)),p,nb,mod);
1.206 noro 7537: if ( Demand ) {
7538: nd_save_mod(p[j],j); nd_free(p[j]); p[j] = 0;
7539: }
1.205 noro 7540: }
7541: m = length(ind);
7542: MKVECT(vect,m);
1.206 noro 7543: for ( j = 0, t = ind; j < m; j++, t = NEXT(t) ) {
7544: u = p[QTOS((Q)BDY(t))];
7545: if ( !u ) {
7546: u = nd_load_mod(QTOS((Q)BDY(t)));
7547: BDY(vect)[j] = ndtodp(mod,u);
7548: nd_free(u);
7549: } else
7550: BDY(vect)[j] = ndtodp(mod,u);
7551: }
1.205 noro 7552: return vect;
7553: }
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