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