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